Lines Matching refs:right
58 #define right dict_right macro
93 lower = upper->right; in rotate_left()
94 upper->right = lowleft = lower->left; in rotate_left()
105 dict_assert (upper == upparent->right); in rotate_left()
106 upparent->right = lower; in rotate_left()
123 upper->left = lowright = lower->right; in rotate_right()
128 if (upper == upparent->right) { in rotate_right()
129 upparent->right = lower; in rotate_right()
135 lower->right = upper; in rotate_right()
149 free_nodes(dict, node->right, nil); in free_nodes()
203 height_right = verify_redblack(nil, root->right); in verify_redblack()
211 if (root->right->color != dnode_black) in verify_redblack()
234 + verify_node_count(nil, root->right); in verify_node_count()
250 || verify_dict_has_node(nil, root->right, node); in verify_dict_has_node()
273 new->nilnode.right = &new->nilnode; in dict_create()
321 dict->nilnode.right = &dict->nilnode; in dict_free_nodes()
350 dict->nilnode.right = &dict->nilnode; in dict_init()
371 dict->nilnode.right = &dict->nilnode; in dict_init_like()
387 dict->nilnode.right = &dict->nilnode; in dict_clear()
410 if (nil->right != nil) in dict_verify()
432 int dict_similar(const dict_t *left, const dict_t *right) in dict_similar() argument
434 if (left->compare != right->compare) in dict_similar()
437 if (left->allocnode != right->allocnode) in dict_similar()
440 if (left->freenode != right->freenode) in dict_similar()
443 if (left->context != right->context) in dict_similar()
446 if (left->dupes != right->dupes) in dict_similar()
474 root = root->right; in dict_lookup()
483 root = root->right; in dict_lookup()
509 root = root->right; in dict_lower_bound()
544 root = root->right; in dict_upper_bound()
550 root = root->right; in dict_upper_bound()
589 where = where->right; in dict_insert()
597 parent->right = node; in dict_insert()
601 node->right = nil; in dict_insert()
612 uncle = grandpa->right; in dict_insert()
620 if (node == parent->right) { in dict_insert()
686 if (delete->left != nil && delete->right != nil) { in dict_delete()
700 child = next->right; in dict_delete()
706 dict_assert (nextparent->right == next); in dict_delete()
707 nextparent->right = child; in dict_delete()
717 next->right = delete->right; in dict_delete()
719 next->right->parent = next; in dict_delete()
726 dict_assert (delparent->right == delete); in dict_delete()
727 delparent->right = next; in dict_delete()
732 dict_assert (delete->left == nil || delete->right == nil); in dict_delete()
734 child = (delete->left != nil) ? delete->left : delete->right; in dict_delete()
741 dict_assert (delete == delparent->right); in dict_delete()
742 delparent->right = child; in dict_delete()
747 delete->right = NULL; in dict_delete()
764 sister = parent->right; in dict_delete()
770 sister = parent->right; in dict_delete()
774 && sister->right->color == dnode_black) { in dict_delete()
778 if (sister->right->color == dnode_black) { in dict_delete()
783 sister = parent->right; in dict_delete()
787 sister->right->color = dnode_black; in dict_delete()
793 dict_assert (child == parent->right); in dict_delete()
803 if (sister->right->color == dnode_black in dict_delete()
809 dict_assert (sister->right->color == dnode_red); in dict_delete()
810 sister->right->color = dnode_black; in dict_delete()
883 dnode_t *nil = dict_nil(dict), *root = dict_root(dict), *right; in dict_last() local
886 while ((right = root->right) != nil) in dict_last()
887 root = right; in dict_last()
903 if (curr->right != nil) { in dict_next()
904 curr = curr->right; in dict_next()
912 while (parent != nil && curr == parent->right) { in dict_next()
927 dnode_t *nil = dict_nil(dict), *parent, *right; in dict_prev() local
931 while ((right = curr->right) != nil) in dict_prev()
932 curr = right; in dict_prev()
995 new->right = NULL; in dnode_create()
1005 dnode->right = NULL; in dnode_init()
1035 return (dnode->parent && dnode->left && dnode->right); in dnode_is_in_a_dict()
1058 load->nilnode.right = &load->nilnode; in load_begin_internal()
1085 nil->right->left = newnode; in dict_load_next()
1086 nil->right = newnode; in dict_load_next()
1119 complete->right = dictnil; in dict_load_end()
1121 tree[level]->right = complete; in dict_load_end()
1131 curr->right = dictnil; in dict_load_end()
1137 tree[level]->right = complete; in dict_load_end()
1157 tree[i]->right = complete; in dict_load_end()
1164 dictnil->right = dictnil; in dict_load_end()