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_remove(list_t *head, list_t *node)
19 list_t *next = node->next;
20 list_t *prev = node->prev;
21 if (next) next->prev = prev;
22 if (prev) prev->next = next;
24 return head == node ? next : head;
27 int list_length(list_t *node)
30 for (; node; node = node->next)
35 void list_move(list_t *node, int offset)