82     listNode *node;  in listAddNodeHead()  local
84     if ((node = zmalloc(sizeof(*node))) == NULL)  in listAddNodeHead()
86     node->value = value;  in listAddNodeHead()
88         list->head = list->tail = node;  in listAddNodeHead()
89         node->prev = node->next = NULL;  in listAddNodeHead()
91         node->prev = NULL;  in listAddNodeHead()
92         node->next = list->head;  in listAddNodeHead()
93         list->head->prev = node;  in listAddNodeHead()
94         list->head = node;  in listAddNodeHead()
108     listNode *node;  in listAddNodeTail()  local
110     if ((node = zmalloc(sizeof(*node))) == NULL)  in listAddNodeTail()
112     node->value = value;  in listAddNodeTail()
114         list->head = list->tail = node;  in listAddNodeTail()
115         node->prev = node->next = NULL;  in listAddNodeTail()
117         node->prev = list->tail;  in listAddNodeTail()
118         node->next = NULL;  in listAddNodeTail()
119         list->tail->next = node;  in listAddNodeTail()
120         list->tail = node;  in listAddNodeTail()
127     listNode *node;  in listInsertNode()  local
129     if ((node = zmalloc(sizeof(*node))) == NULL)  in listInsertNode()
131     node->value = value;  in listInsertNode()
133         node->prev = old_node;  in listInsertNode()
134         node->next = old_node->next;  in listInsertNode()
136             list->tail = node;  in listInsertNode()
139         node->next = old_node;  in listInsertNode()
140         node->prev = old_node->prev;  in listInsertNode()
142             list->head = node;  in listInsertNode()
145     if (node->prev != NULL) {  in listInsertNode()
146         node->prev->next = node;  in listInsertNode()
148     if (node->next != NULL) {  in listInsertNode()
149         node->next->prev = node;  in listInsertNode()
159 void listDelNode(list *list, listNode *node)  in listDelNode()  argument
161     if (node->prev)  in listDelNode()
162         node->prev->next = node->next;  in listDelNode()
164         list->head = node->next;  in listDelNode()
165     if (node->next)  in listDelNode()
166         node->next->prev = node->prev;  in listDelNode()
168         list->tail = node->prev;  in listDelNode()
169     if (list->free) list->free(node->value);  in listDelNode()
170     zfree(node);  in listDelNode()
246     listNode *node;  in listDup()  local
254     while((node = listNext(&iter)) != NULL) {  in listDup()
258             value = copy->dup(node->value);  in listDup()
264             value = node->value;  in listDup()
285     listNode *node;  in listSearchKey()  local
288     while((node = listNext(&iter)) != NULL) {  in listSearchKey()
290             if (list->match(node->value, key)) {  in listSearchKey()
291                 return node;  in listSearchKey()
294             if (key == node->value) {  in listSearchKey()
295                 return node;  in listSearchKey()