61     listNode *current, *next;  in listRelease()  local
66         next = current->next;  in listRelease()
69         current = next;  in listRelease()
89         node->prev = node->next = NULL;  in listAddNodeHead()
92         node->next = list->head;  in listAddNodeHead()
115         node->prev = node->next = NULL;  in listAddNodeTail()
118         node->next = NULL;  in listAddNodeTail()
119         list->tail->next = node;  in listAddNodeTail()
134         node->next = old_node->next;  in listInsertNode()
139         node->next = old_node;  in listInsertNode()
146         node->prev->next = node;  in listInsertNode()
148     if (node->next != NULL) {  in listInsertNode()
149         node->next->prev = node;  in listInsertNode()
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()
184         iter->next = list->head;  in listGetIterator()
186         iter->next = list->tail;  in listGetIterator()
198     li->next = list->head;  in listRewind()
203     li->next = list->tail;  in listRewindTail()
223     listNode *current = iter->next;  in listNext()
227             iter->next = current->next;  in listNext()
229             iter->next = current->prev;  in listNext()
316         while(index-- && n) n = n->next;  in listIndex()
329     list->tail->next = NULL;  in listRotate()
333     tail->next = list->head;  in listRotate()