9     void *data;  member
57 bool list_contains(const list_t *list, const void *data)  in list_contains()  argument
60   assert(data != NULL);  in list_contains()
63     if (list_node(node) == data) {  in list_contains()
71 list_node_t *list_get_node(const list_t *list, const void *data)  in list_get_node()  argument
74   assert(data != NULL);  in list_get_node()
77     if (list_node(node) == data) {  in list_get_node()
97     return list->head->data;  in list_front()
104   return list->tail->data;  in list_back()
114 bool list_insert_after(list_t *list, list_node_t *prev_node, void *data) {  in list_insert_after()  argument
117     assert(data != NULL);  in list_insert_after()
124     node->data = data;  in list_insert_after()
133 bool list_prepend(list_t *list, void *data)  in list_prepend()  argument
136     assert(data != NULL);  in list_prepend()
143     node->data = data;  in list_prepend()
152 bool list_append(list_t *list, void *data)  in list_append()  argument
155     assert(data != NULL);  in list_append()
162     node->data = data;  in list_append()
174 bool list_remove(list_t *list, void *data)  in list_remove()  argument
177     assert(data != NULL);  in list_remove()
183     if (list->head->data == data) {  in list_remove()
193         if (node->data == data) {  in list_remove()
204 bool list_delete(list_t *list, void *data)  in list_delete()  argument
207     assert(data != NULL);  in list_delete()
213     if (list->head->data == data) {  in list_delete()
223         if (node->data == data) {  in list_delete()
252     if (!callback(node->data, context)) {  in list_foreach()
281     return node->data;  in list_node()
292         list->free_cb(node->data);  in list_free_node()