Lines Matching refs:left
135 avl_walk(avl_tree_t *tree, void *oldnode, int left) in avl_walk() argument
139 int right = 1 - left; in avl_walk()
155 if (node->avl_child[left] != NULL) { in avl_walk()
156 for (node = node->avl_child[left]; in avl_walk()
304 int left = !(balance < 0); /* when balance = -2, left will be 0 */ in avl_rotation() local
305 int right = 1 - left; in avl_rotation()
309 avl_node_t *child = node->avl_child[left]; in avl_rotation()
358 node->avl_child[left] = cright; in avl_rotation()
361 AVL_SETCHILD(cright, left); in avl_rotation()
420 gleft = gchild->avl_child[left]; in avl_rotation()
428 node->avl_child[left] = gright; in avl_rotation()
431 AVL_SETCHILD(gright, left); in avl_rotation()
448 gchild->avl_child[left] = child; in avl_rotation()
451 AVL_SETCHILD(child, left); in avl_rotation()
682 int left; in avl_remove() local
707 left = avl_balance2child[old_balance + 1]; in avl_remove()
708 right = 1 - left; in avl_remove()
714 for (node = delete->avl_child[left]; in avl_remove()
726 if (node->avl_child[left] == node) in avl_remove()
727 node->avl_child[left] = &tmp; in avl_remove()
734 AVL_SETPARENT(node->avl_child[left], node); in avl_remove()