6 list_t *list_insert(list_t *next, void *data)
8 list_t *node = new0(list_t);
11 node->prev = next ? next->prev : NULL;
12 if (node->next) node->next->prev = node;
13 if (node->prev) node->next->next = node;
17 list_t *list_append(list_t *head, void *data)
22 list_t *node = new0(list_t);
25 if (last) last->next = node;
26 return last ? head : node;
29 list_t *list_remove(list_t *head, list_t *node)
31 list_t *next = node->next;
32 list_t *prev = node->prev;
33 if (next) next->prev = prev;
34 if (prev) prev->next = next;
36 return head == node ? next : head;
39 int list_length(list_t *node)
42 for (; node; node = node->next)
47 void list_move(list_t *node, int offset)