#include "config.h"

#include <stdlib.h>
#include <string.h>
#include <assert.h>
#include <stdlib.h>

#include <glib.h>
#ifdef HAVE_NCURSESW_NCURSES_H
#include <ncursesw/ncurses.h>
#elif HAVE_NCURSES_H
#include <ncurses.h>
#endif

#include "ui/window.h"
#include "ui/buffer.h"

ProfBuff*
buffer_create() {
  ProfBuff* new_buff = malloc(sizeof(struct prof_buff_t));
  new_buff->wrap = 0;
  new_buff->current = 0;
  return new_buff;
}

void
buffer_free(ProfBuff* buffer) {
  int i = 0;
  int imax = buffer->current;
  if(buffer->wrap == 1) {
    imax = BUFF_SIZE;
  }
  for(i = 0; i < imax; i++) {
    free(buffer->entry[i].message);
    free(buffer->entry[i].from);
  }
  free(buffer);
}

void
buffer_push(ProfBuff* buffer, const char show_char, GTimeVal *tstamp, int flags, int attrs, const char * const from, const char * const message) {
  int *current = &(buffer->current);
  ProfBuffEntry e = buffer->entry[*current];

  if(buffer->wrap == 1) {
    free(e.message);
    free(e.from);
  }
  e.show_char = show_char;
  e.tstamp = *tstamp;
  e.flags = flags;
  e.attrs = attrs;

  e.from = malloc(strlen(from)+1);
  strcpy(e.from, from);

  e.message = malloc(strlen(message)+1);
  strcpy(e.message, message);

  *current += 1;
  if(*current >= BUFF_SIZE) {
    *current = 0;
    buffer->wrap = 1;
  }
}

int
buffer_yield(ProfBuff* buffer, int line, ProfBuffEntry** list) {
  //Returns the (line+1)-th last line
  //e.g. if line == 0, returns the last line
  //To correct for splitted lines...
  int current = buffer->current;
  int imax = current;
  if(buffer->wrap == 1) {
    imax = BUFF_SIZE;
  }
  int i = 1;
  int j = 0;
  while(i <= imax) {
    ProfBuffEntry e = buffer->entry[(current - i) % BUFF_SIZE];
    if(j == line && (e.flags & NO_EOL) == 0) {
      //We found our line and we are at its last entry
      int nb_entries = 1;
      while(i + nb_entries <= imax) {
        e = buffer->entry[(current - i - nb_entries) % BUFF_SIZE];
        if((e.flags & NO_EOL) == 0) {
          break;
        }
        nb_entries += 1;
      }
      if((buffer->wrap == 1) && (i + nb_entries > imax)) {
        //The line is at the top of the buffer, we don't know if it's complete
        return 0;
      }
      else {
        *list = &(buffer->entry[(current - i - nb_entries + 1) % BUFF_SIZE]);
        return nb_entries;
      }
    }
    if((e.flags & NO_EOL) == 0) {
      j++;
    }
    i++;
  }
  return 0;
}