67         if (list->free) list->free(current->value);  in listRelease()
80 list *listAddNodeHead(list *list, void *value)  in listAddNodeHead()  argument
86     node->value = value;  in listAddNodeHead()
106 list *listAddNodeTail(list *list, void *value)  in listAddNodeTail()  argument
112     node->value = value;  in listAddNodeTail()
126 list *listInsertNode(list *list, listNode *old_node, void *value, int after) {  in listInsertNode()  argument
131     node->value = value;  in listInsertNode()
169     if (list->free) list->free(node->value);  in listDelNode()
255         void *value;  in listDup()  local
258             value = copy->dup(node->value);  in listDup()
259             if (value == NULL) {  in listDup()
264             value = node->value;  in listDup()
265         if (listAddNodeTail(copy, value) == NULL) {  in listDup()
290             if (list->match(node->value, key)) {  in listSearchKey()
294             if (key == node->value) {  in listSearchKey()