node->next = next;
node->prev = next ? next->prev : NULL;
if (node->next) node->next->prev = node;
- if (node->prev) node->next->next = node;
+ if (node->prev) node->prev->next = node;
return node;
}
+void list_insert_after(list_t *prev, void *data)
+{
+ // prev must be valid,
+ // as we cannot return the original list head
+ list_t *node = new0(list_t);
+ node->data = data;
+ node->prev = prev;
+ node->next = prev->next;
+ prev->next = node;
+ if (node->next) node->next->prev = node;
+}
+
list_t *list_append(list_t *head, void *data)
{
list_t *last = head;
return len;
}
-void list_move(list_t *node, int offset)
-{
-}
-
/* Misc */
int error(char *fmt, ...)
{