BBS-Client-TUI/src/utils/dlist.c

#include <stdbool.h>
#include <stddef.h>
#include <stdint.h>
#include <stdlib.h>
#include <string.h>

#include "dlist.h"

/*
  Uses *add* when needs to make a full copy of the element.
  Uses *insert* when operates with nodes.
*/

dlist_t *_dlist_init(void *el_ptr, int el_siz, dblist_add_cb_t add_cb) {
  dlist_t *dlist = malloc(sizeof(dlist_t));
  dlist->len = 0;
  dlist->current = NULL;
  dlist->start = NULL;

  if (el_ptr != NULL) {
    _dlist_add(dlist, el_ptr, el_siz, add_cb, false);
  }

  return dlist;
}

void _dlist_insert(dlist_t *dlist, dlist_node_t *new_el,
                   dlist_node_t *prev_node) {
  if (prev_node != NULL) {
    new_el->next = prev_node->next;
    prev_node->next->previous = new_el;
    new_el->previous = prev_node;
    prev_node->next = new_el;
    if (new_el->next == NULL) {
      dlist->current = new_el;
      dlist->work_pointer = new_el;
    }
  } else {
    new_el->next = dlist->start;
    new_el->previous = NULL;
    dlist->start->previous = new_el;
    dlist->start = new_el;
  }
  dlist->len++;
}

void _dlist_insert_end(dlist_t *dlist, dlist_node_t *new_node) {
  dlist->current->next = new_node;
  new_node->previous = dlist->current;
  new_node->next = NULL;
  dlist->current = new_node;
  dlist->work_pointer = new_node;
  dlist->len++;
}

void _dlist_add_sort(dlist_t *dlist, void *el_ptr, int el_siz,
                     dblist_sort_cb_t cb, dblist_add_cb_t add_cb) {
  dlist_node_t *node = malloc(sizeof(dlist_node_t));
  node->el_ptr = malloc(el_siz);
  add_cb(node->el_ptr, el_ptr);

  dlist_node_t *dlist_item = dlist->start;
  bool res = true;
  if (dlist->start == NULL) {
    dlist->start = node;
    dlist->current = node;
    node->next = NULL;
    node->previous = NULL;
    dlist->work_pointer = node;
    dlist->len++;
    return;
  }

  for (int i = 0; i < dlist->len; i++) {
    res = cb(el_ptr, dlist_item->el_ptr);
    if (!res)
      break;
    dlist_item = dlist_item->next;
  }

  if (!res) {
    dlist_item = dlist_item->previous;
    _dlist_insert(dlist, node, dlist_item);
  } else {
    _dlist_insert_end(dlist, node);
  }
}

void _dlist_add(dlist_t *dlist, void *el_ptr, int el_siz,
                dblist_add_cb_t *add_cb, bool prepend) {
  dlist_node_t *node = malloc(sizeof(dlist_node_t));
  node->el_ptr = malloc(el_siz);
  add_cb(node->el_ptr, el_ptr);

  if (dlist->start == NULL) {
    node->previous = NULL;
    node->next = NULL;
    dlist->start = node;
    dlist->current = node;
    dlist->work_pointer = node;
  } else if (prepend) {
    node->previous = NULL;
    node->next = dlist->start;
    dlist->start->previous = node;
    dlist->start = node;
  } else {
    node->previous = dlist->current;
    node->next = NULL;
    dlist->current->next = node;
    dlist->current = node;
    dlist->work_pointer = node;
  }
  dlist->len++;
}

dlist_node_t *find_node_by_ptr(dlist_t *dlist, void *el_ptr) {
  dlist_node_t *node = dlist->start;
  do {
    if (node->el_ptr == el_ptr)
      break;
  } while ((node = node->next) != NULL);
  if (node->el_ptr == el_ptr)
    return node;
  return NULL;
}

int dlist_remove_by_ptr(dlist_t *dlist, void *el_ptr, dblist_rm_cb_t cb) {
  dlist_node_t *node = find_node_by_ptr(dlist, el_ptr);
  if (node == NULL)
    return -1;
  node->next->previous = node->previous;
  node->previous->next = node->next;
  dlist->len--;
  if (node->next == NULL)
    dlist->current = node->previous;
  if (node->previous == NULL)
    dlist->start = node->next;
  cb(node->el_ptr);
  free(node);
  return 1;
}

int dlist_clear_list(dlist_t *dlist, dblist_rm_cb_t cb) {
  dlist_node_t *current = dlist->start;
  dlist_node_t *next = NULL;

  if (current == NULL) return 1;

  do {
    cb(current->el_ptr);
    next = current->next;
    free(current);
    current = next;
  } while (current != NULL);

  dlist->len = 0;
  dlist->current = NULL;
  dlist->start = NULL;
  dlist->work_pointer = NULL;

  return 1;
}

/* Iterators */

void *dlist_it_prev(dlist_t *dlist) {
  dlist_node_t *cur_ptr = dlist->work_pointer;
  if (cur_ptr != NULL) {
    dlist->work_pointer = dlist->work_pointer->previous;
    return cur_ptr->el_ptr;
  } 
  return NULL;
}

void *dlist_it_next(dlist_t *dlist) {
  dlist_node_t *cur_ptr = dlist->work_pointer;
  if (cur_ptr != NULL) {
    dlist->work_pointer = dlist->work_pointer->next;
    return cur_ptr->el_ptr;
  } 
  return NULL;
}

dlist_node_t *dlist_wind_fwd(dlist_t *dlist, dlist_node_t *start, int count) {
  dlist_node_t *new_ptr = start;

  for (int i = 0; i <= count && new_ptr != NULL; i++) {
    new_ptr = new_ptr->next;
  }
  dlist->work_pointer = new_ptr;
  return new_ptr;
}

dlist_node_t *dlist_wind_bwd(dlist_t *dlist, dlist_node_t *start, int count) {
  dlist_node_t *new_ptr = start;

  for (int i = 0; i <= count && new_ptr != NULL; i++) {
    new_ptr = new_ptr->previous;
  }
  dlist->work_pointer = new_ptr;
  return new_ptr;
}