90     listNode *node;  in listAddNodeHead()  local
92     if ((node = zmalloc(sizeof(*node))) == NULL)  in listAddNodeHead()
94     node->value = value;  in listAddNodeHead()
96         list->head = list->tail = node;  in listAddNodeHead()
97         node->prev = node->next = NULL;  in listAddNodeHead()
99         node->prev = NULL;  in listAddNodeHead()
100         node->next = list->head;  in listAddNodeHead()
101         list->head->prev = node;  in listAddNodeHead()
102         list->head = node;  in listAddNodeHead()
116     listNode *node;  in listAddNodeTail()  local
118     if ((node = zmalloc(sizeof(*node))) == NULL)  in listAddNodeTail()
120     node->value = value;  in listAddNodeTail()
122         list->head = list->tail = node;  in listAddNodeTail()
123         node->prev = node->next = NULL;  in listAddNodeTail()
125         node->prev = list->tail;  in listAddNodeTail()
126         node->next = NULL;  in listAddNodeTail()
127         list->tail->next = node;  in listAddNodeTail()
128         list->tail = node;  in listAddNodeTail()
135     listNode *node;  in listInsertNode()  local
137     if ((node = zmalloc(sizeof(*node))) == NULL)  in listInsertNode()
139     node->value = value;  in listInsertNode()
141         node->prev = old_node;  in listInsertNode()
142         node->next = old_node->next;  in listInsertNode()
144             list->tail = node;  in listInsertNode()
147         node->next = old_node;  in listInsertNode()
148         node->prev = old_node->prev;  in listInsertNode()
150             list->head = node;  in listInsertNode()
153     if (node->prev != NULL) {  in listInsertNode()
154         node->prev->next = node;  in listInsertNode()
156     if (node->next != NULL) {  in listInsertNode()
157         node->next->prev = node;  in listInsertNode()
167 void listDelNode(list *list, listNode *node)  in listDelNode()  argument
169     if (node->prev)  in listDelNode()
170         node->prev->next = node->next;  in listDelNode()
172         list->head = node->next;  in listDelNode()
173     if (node->next)  in listDelNode()
174         node->next->prev = node->prev;  in listDelNode()
176         list->tail = node->prev;  in listDelNode()
177     if (list->free) list->free(node->value);  in listDelNode()
178     zfree(node);  in listDelNode()
254     listNode *node;  in listDup()  local
262     while((node = listNext(&iter)) != NULL) {  in listDup()
266             value = copy->dup(node->value);  in listDup()
272             value = node->value;  in listDup()
293     listNode *node;  in listSearchKey()  local
296     while((node = listNext(&iter)) != NULL) {  in listSearchKey()
298             if (list->match(node->value, key)) {  in listSearchKey()
299                 return node;  in listSearchKey()
302             if (key == node->value) {  in listSearchKey()
303                 return node;  in listSearchKey()