Lines Matching defs:next
155 dnode_t *first, *next;
160 while (first && (next = dict_next(dict, first))) {
161 if (dict->compare(first->key, next->key) > 0)
163 first = next;
166 while (first && (next = dict_next(dict, first))) {
167 if (dict->compare(first->key, next->key) >= 0)
169 first = next;
661 dnode_t *next = dict_next(dict, delete);
662 dnode_t *nextparent = next->parent;
663 dnode_color_t nextcolor = next->color;
665 dict_assert(next != nil);
666 dict_assert(next->parent != nil);
667 dict_assert(next->left == nil);
674 child = next->right;
677 if (nextparent->left == next) {
680 dict_assert(nextparent->right == next);
689 next->parent = delparent;
690 next->left = delete->left;
691 next->right = delete->right;
692 next->left->parent = next;
693 next->right->parent = next;
694 next->color = delete->color;
698 delparent->left = next;
701 delparent->right = next;
865 * next key in the the left to right ordering. If the node has
1011 dnode_t *node = dict_first(dict), *next;
1015 /* the next node from under us */
1017 next = dict_next(dict, node);
1019 node = next;
1064 dnode_t *curr, *dictnil = dict_nil(dict), *loadnil = &load->nilnode, *next;
1077 for (curr = loadnil->left; curr != loadnil; curr = next) {
1078 next = curr->left;
1171 dnode_t *next = dict_next(dest, leftnode);
1176 leftnode = next;
1182 dnode_t *next = dict_next(source, rightnode);
1187 rightnode = next;