Searched refs:curr_node (Results 1 – 2 of 2) sorted by relevance
717 rb_node *curr_node = node; in rbtree_insert_fixup() local723 while (curr_node != tree->root && curr_node->parent->color == red) { in rbtree_insert_fixup()729 grandparent = curr_node->parent->parent; in rbtree_insert_fixup()731 if (curr_node->parent == grandparent->left) { in rbtree_insert_fixup()744 curr_node->parent->color = black; in rbtree_insert_fixup()749 curr_node = grandparent; in rbtree_insert_fixup()757 if (curr_node == curr_node->parent->right) { in rbtree_insert_fixup()758 curr_node = curr_node->parent; in rbtree_insert_fixup()759 rbtree_rotate_left(tree, curr_node); in rbtree_insert_fixup()765 curr_node->parent->color = black; in rbtree_insert_fixup()[all …]
200 prefix, dest_node, curr_node = pending_nodes.pop()201 for k, v in curr_node.iteritems():206 prefix, k, v, curr_node, dest_node))