Lines Matching refs:right
52 #define right dict_right macro
87 lower = upper->right; in rotate_left()
88 upper->right = lowleft = lower->left; in rotate_left()
99 assert (upper == upparent->right); in rotate_left()
100 upparent->right = lower; in rotate_left()
117 upper->left = lowright = lower->right; in rotate_right()
122 if (upper == upparent->right) { in rotate_right()
123 upparent->right = lower; in rotate_right()
129 lower->right = upper; in rotate_right()
143 free_nodes(dict, node->right, nil); in free_nodes()
197 height_right = verify_redblack(nil, root->right); in verify_redblack()
205 if (root->right->color != dnode_black) in verify_redblack()
228 + verify_node_count(nil, root->right); in verify_node_count()
244 || verify_dict_has_node(nil, root->right, node); in verify_dict_has_node()
267 new->nilnode.right = &new->nilnode; in dict_create()
315 dict->nilnode.right = &dict->nilnode; in dict_free_nodes()
344 dict->nilnode.right = &dict->nilnode; in dict_init()
365 dict->nilnode.right = &dict->nilnode; in dict_init_like()
381 dict->nilnode.right = &dict->nilnode; in dict_clear()
404 if (nil->right != nil) in dict_verify()
426 int dict_similar(const dict_t *left, const dict_t *right) in dict_similar() argument
428 if (left->compare != right->compare) in dict_similar()
431 if (left->allocnode != right->allocnode) in dict_similar()
434 if (left->freenode != right->freenode) in dict_similar()
437 if (left->context != right->context) in dict_similar()
440 if (left->dupes != right->dupes) in dict_similar()
468 root = root->right; in dict_lookup()
477 root = root->right; in dict_lookup()
503 root = root->right; in dict_lower_bound()
538 root = root->right; in dict_upper_bound()
544 root = root->right; in dict_upper_bound()
583 where = where->right; in dict_insert()
591 parent->right = node; in dict_insert()
595 node->right = nil; in dict_insert()
606 uncle = grandpa->right; in dict_insert()
614 if (node == parent->right) { in dict_insert()
680 if (delete->left != nil && delete->right != nil) { in dict_delete()
694 child = next->right; in dict_delete()
700 assert (nextparent->right == next); in dict_delete()
701 nextparent->right = child; in dict_delete()
711 next->right = delete->right; in dict_delete()
713 next->right->parent = next; in dict_delete()
720 assert (delparent->right == delete); in dict_delete()
721 delparent->right = next; in dict_delete()
726 assert (delete->left == nil || delete->right == nil); in dict_delete()
728 child = (delete->left != nil) ? delete->left : delete->right; in dict_delete()
735 assert (delete == delparent->right); in dict_delete()
736 delparent->right = child; in dict_delete()
741 delete->right = NULL; in dict_delete()
758 sister = parent->right; in dict_delete()
764 sister = parent->right; in dict_delete()
768 && sister->right->color == dnode_black) { in dict_delete()
772 if (sister->right->color == dnode_black) { in dict_delete()
777 sister = parent->right; in dict_delete()
781 sister->right->color = dnode_black; in dict_delete()
787 assert (child == parent->right); in dict_delete()
797 if (sister->right->color == dnode_black in dict_delete()
803 assert (sister->right->color == dnode_red); in dict_delete()
804 sister->right->color = dnode_black; in dict_delete()
877 dnode_t *nil = dict_nil(dict), *root = dict_root(dict), *right; in dict_last() local
880 while ((right = root->right) != nil) in dict_last()
881 root = right; in dict_last()
897 if (curr->right != nil) { in dict_next()
898 curr = curr->right; in dict_next()
906 while (parent != nil && curr == parent->right) { in dict_next()
921 dnode_t *nil = dict_nil(dict), *parent, *right; in dict_prev() local
925 while ((right = curr->right) != nil) in dict_prev()
926 curr = right; in dict_prev()
989 new->right = NULL; in dnode_create()
999 dnode->right = NULL; in dnode_init()
1027 return (dnode->parent && dnode->left && dnode->right); in dnode_is_in_a_dict()
1048 load->nilnode.right = &load->nilnode; in load_begin_internal()
1075 nil->right->left = newnode; in dict_load_next()
1076 nil->right = newnode; in dict_load_next()
1109 complete->right = dictnil; in dict_load_end()
1111 tree[level]->right = complete; in dict_load_end()
1121 curr->right = dictnil; in dict_load_end()
1127 tree[level]->right = complete; in dict_load_end()
1147 tree[i]->right = complete; in dict_load_end()
1154 dictnil->right = dictnil; in dict_load_end()