Lines Matching refs:right
53 #define right dict_right macro
87 lower = upper->right; in rotate_left()
88 upper->right = lowleft = lower->left; in rotate_left()
99 dict_assert(upper == upparent->right); in rotate_left()
100 upparent->right = lower; in rotate_left()
116 upper->left = lowright = lower->right; in rotate_right()
121 if (upper == upparent->right) { in rotate_right()
122 upparent->right = lower; in rotate_right()
128 lower->right = upper; in rotate_right()
141 free_nodes(dict, node->right, nil); in free_nodes()
194 height_right = verify_redblack(nil, root->right); in verify_redblack()
202 if (root->right->color != dnode_black) in verify_redblack()
224 + verify_node_count(nil, root->right); in verify_node_count()
239 || verify_dict_has_node(nil, root->right, node); in verify_dict_has_node()
260 new->nilnode.right = &new->nilnode; in dict_create()
305 dict->nilnode.right = &dict->nilnode; in dict_free_nodes()
333 dict->nilnode.right = &dict->nilnode; in dict_init()
353 dict->nilnode.right = &dict->nilnode; in dict_init_like()
368 dict->nilnode.right = &dict->nilnode; in dict_clear()
390 if (nil->right != nil) in dict_verify()
412 int dict_similar(const dict_t *left, const dict_t *right) in dict_similar() argument
414 if (left->compare != right->compare) in dict_similar()
417 if (left->allocnode != right->allocnode) in dict_similar()
420 if (left->freenode != right->freenode) in dict_similar()
423 if (left->context != right->context) in dict_similar()
426 if (left->dupes != right->dupes) in dict_similar()
453 root = root->right; in dict_lookup()
462 root = root->right; in dict_lookup()
487 root = root->right; in dict_lower_bound()
521 root = root->right; in dict_upper_bound()
527 root = root->right; in dict_upper_bound()
565 where = where->right; in dict_insert()
573 parent->right = node; in dict_insert()
577 node->right = nil; in dict_insert()
588 uncle = grandpa->right; in dict_insert()
596 if (node == parent->right) { in dict_insert()
661 if (delete->left != nil && delete->right != nil) { in dict_delete()
675 child = next->right; in dict_delete()
681 dict_assert(nextparent->right == next); in dict_delete()
682 nextparent->right = child; in dict_delete()
692 next->right = delete->right; in dict_delete()
694 next->right->parent = next; in dict_delete()
701 dict_assert(delparent->right == delete); in dict_delete()
702 delparent->right = next; in dict_delete()
707 dict_assert(delete->left == nil || delete->right == nil); in dict_delete()
709 child = (delete->left != nil) ? delete->left : delete->right; in dict_delete()
716 dict_assert(delete == delparent->right); in dict_delete()
717 delparent->right = child; in dict_delete()
722 delete->right = NULL; in dict_delete()
739 sister = parent->right; in dict_delete()
745 sister = parent->right; in dict_delete()
749 && sister->right->color == dnode_black) { in dict_delete()
753 if (sister->right->color == dnode_black) { in dict_delete()
758 sister = parent->right; in dict_delete()
762 sister->right->color = dnode_black; in dict_delete()
768 dict_assert(child == parent->right); in dict_delete()
778 if (sister->right->color == dnode_black in dict_delete()
784 dict_assert(sister->right->color == dnode_red); in dict_delete()
785 sister->right->color = dnode_black; in dict_delete()
855 dnode_t *nil = dict_nil(dict), *root = dict_root(dict), *right; in dict_last() local
858 while ((right = root->right) != nil) in dict_last()
859 root = right; in dict_last()
874 if (curr->right != nil) { in dict_next()
875 curr = curr->right; in dict_next()
883 while (parent != nil && curr == parent->right) { in dict_next()
897 dnode_t *nil = dict_nil(dict), *parent, *right; in dict_prev() local
901 while ((right = curr->right) != nil) in dict_prev()
902 curr = right; in dict_prev()
965 new->right = NULL; in dnode_create()
975 dnode->right = NULL; in dnode_init()
1005 return (dnode->parent && dnode->left && dnode->right); in dnode_is_in_a_dict()
1028 load->nilnode.right = &load->nilnode; in load_begin_internal()
1055 nil->right->left = newnode; in dict_load_next()
1056 nil->right = newnode; in dict_load_next()
1089 complete->right = dictnil; in dict_load_end()
1091 tree[level]->right = complete; in dict_load_end()
1101 curr->right = dictnil; in dict_load_end()
1107 tree[level]->right = complete; in dict_load_end()
1127 tree[i]->right = complete; in dict_load_end()
1134 dictnil->right = dictnil; in dict_load_end()