Lines Matching refs:next

144     node->next = node->prev = NULL;  in quicklistCreateNode()
157 quicklistNode *current, *next; in quicklistRelease() local
162 next = current->next; in quicklistRelease()
170 current = next; in quicklistRelease()
283 quicklistNode *h = quicklist->head, *hn = h->next, *hnn = hn->next; in __quicklistCompress()
319 forward = forward->next; in __quicklistCompress()
358 new_node->next = old_node->next; in __quicklistInsertNode()
359 if (old_node->next) in __quicklistInsertNode()
360 old_node->next->prev = new_node; in __quicklistInsertNode()
361 old_node->next = new_node; in __quicklistInsertNode()
366 new_node->next = old_node; in __quicklistInsertNode()
370 old_node->prev->next = new_node; in __quicklistInsertNode()
581 if (node->next) in __quicklistDelNode()
582 node->next->prev = node->prev; in __quicklistDelNode()
584 node->prev->next = node->next; in __quicklistDelNode()
591 quicklist->head = node->next; in __quicklistDelNode()
636 quicklistNode *next = entry->node->next; in quicklistDelEntry() local
646 iter->current = next; 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()
745 if (center->next) { in _quicklistMergeNodes()
746 next = center->next; in _quicklistMergeNodes()
747 if (center->next->next) in _quicklistMergeNodes()
748 next_next = center->next->next; in _quicklistMergeNodes()
758 if (_quicklistNodeAllowMerge(next, next_next, fill)) { in _quicklistMergeNodes()
759 _quicklistZiplistMerge(quicklist, next, next_next); in _quicklistMergeNodes()
760 next = next_next = NULL; /* they could have moved, invalidate them. */ in _quicklistMergeNodes()
773 if (_quicklistNodeAllowMerge(target, target->next, fill)) { in _quicklistMergeNodes()
774 _quicklistZiplistMerge(quicklist, target, target->next); in _quicklistMergeNodes()
860 if (!_quicklistNodeAllowInsert(node->next, fill, sz)) { in _quicklistInsert()
879 unsigned char *next = ziplistNext(node->zl, entry->zi); in _quicklistInsert() local
880 if (next == NULL) { in _quicklistInsert()
883 node->zl = ziplistInsert(node->zl, next, value, sz); in _quicklistInsert()
895 } else if (full && at_tail && node->next && !full_next && after) { in _quicklistInsert()
899 new_node = node->next; in _quicklistInsert()
915 } else if (full && ((at_tail && node->next && full_next && after) || in _quicklistInsert()
983 quicklistNode *next = node->next; in quicklistDelRange() local
1034 node = next; in quicklistDelRange()
1167 iter->current = iter->current->next; in quicklistNext()
1192 current = current->next) { in quicklistDup()
1253 n = forward ? n->next : n->prev; in quicklistIndex()
1575 for (unsigned int at = 0; at < ql->len; at++, node = node->next) { in _ql_verify()
2611 at++, node = node->next) { in quicklistTest()