Lines Matching refs:next
158 dnode_t *first, *next;
163 while (first && (next = dict_next(dict, first))) {
164 if (dict->compare(first->key, next->key) > 0)
166 first = next;
169 while (first && (next = dict_next(dict, first))) {
170 if (dict->compare(first->key, next->key) >= 0)
172 first = next;
681 dnode_t *next = dict_next(dict, delete);
682 dnode_t *nextparent = next->parent;
683 dnode_color_t nextcolor = next->color;
685 assert (next != nil);
686 assert (next->parent != nil);
687 assert (next->left == nil);
694 child = next->right;
697 if (nextparent->left == next) {
700 assert (nextparent->right == next);
709 next->parent = delparent;
710 next->left = delete->left;
711 next->right = delete->right;
712 next->left->parent = next;
713 next->right->parent = next;
714 next->color = delete->color;
718 delparent->left = next;
721 delparent->right = next;
888 * next key in the the left to right ordering. If the node has
1032 dnode_t *node = dict_first(dict), *next;
1036 /* the next node from under us */
1038 next = dict_next(dict, node);
1040 node = next;
1085 dnode_t *curr, *dictnil = dict_nil(dict), *loadnil = &load->nilnode, *next;
1098 for (curr = loadnil->left; curr != loadnil; curr = next) {
1099 next = curr->left;
1192 dnode_t *next = dict_next(dest, leftnode);
1197 leftnode = next;
1203 dnode_t *next = dict_next(source, rightnode);
1208 rightnode = next;
