144     node->next = node->prev = NULL;  in quicklistCreateNode()
284         quicklistNode *t = quicklist->tail, *tp = t->prev, *tpp = tp->prev;  in __quicklistCompress()
320         reverse = reverse->prev;  in __quicklistCompress()
356         new_node->prev = old_node;  in __quicklistInsertNode()
360                 old_node->next->prev = new_node;  in __quicklistInsertNode()
368             new_node->prev = old_node->prev;  in __quicklistInsertNode()
369             if (old_node->prev)  in __quicklistInsertNode()
370                 old_node->prev->next = new_node;  in __quicklistInsertNode()
371             old_node->prev = new_node;  in __quicklistInsertNode()
582         node->next->prev = node->prev;  in __quicklistDelNode()
583     if (node->prev)  in __quicklistDelNode()
584         node->prev->next = node->next;  in __quicklistDelNode()
587         quicklist->tail = node->prev;  in __quicklistDelNode()
635     quicklistNode *prev = entry->node->prev;  in quicklistDelEntry()  local
649             iter->current = prev;  in quicklistDelEntry()
736     quicklistNode *prev, *prev_prev, *next, *next_next, *target;  in _quicklistMergeNodes()  local
737     prev = prev_prev = next = next_next = target = NULL;  in _quicklistMergeNodes()
739     if (center->prev) {  in _quicklistMergeNodes()
740         prev = center->prev;  in _quicklistMergeNodes()
741         if (center->prev->prev)  in _quicklistMergeNodes()
742             prev_prev = center->prev->prev;  in _quicklistMergeNodes()
752     if (_quicklistNodeAllowMerge(prev, prev_prev, fill)) {  in _quicklistMergeNodes()
753         _quicklistZiplistMerge(quicklist, prev_prev, prev);  in _quicklistMergeNodes()
754         prev_prev = prev = NULL; /* they could have moved, invalidate them. */  in _quicklistMergeNodes()
764     if (_quicklistNodeAllowMerge(center, center->prev, fill)) {  in _quicklistMergeNodes()
765         target = _quicklistZiplistMerge(quicklist, center->prev, center);  in _quicklistMergeNodes()
869         if (!_quicklistNodeAllowInsert(node->prev, fill, sz)) {  in _quicklistInsert()
905     } else if (full && at_head && node->prev && !full_prev && !after) {  in _quicklistInsert()
909         new_node = node->prev;  in _quicklistInsert()
916                         (at_head && node->prev && full_prev && !after))) {  in _quicklistInsert()
1172             iter->current = iter->current->prev;  in quicklistNext()
1253             n = forward ? n->next : n->prev;  in quicklistIndex()
1488     quicklistNode *prev = NULL;  in _itrprintr()  local
1490         if (entry.node != prev) {  in _itrprintr()
1493             prev = entry.node;  in _itrprintr()