136 avl_walk(avl_tree_t *tree, void	*oldnode, int left)  in avl_walk()  argument
140 	int right = 1 - left;  in avl_walk()
156 	if (node->avl_child[left] != NULL) {  in avl_walk()
157 		for (node = node->avl_child[left];  in avl_walk()
305 	int left = !(balance < 0);	/* when balance = -2, left will be 0 */  in avl_rotation()  local
306 	int right = 1 - left;  in avl_rotation()
310 	avl_node_t *child = node->avl_child[left];  in avl_rotation()
359 		node->avl_child[left] = cright;  in avl_rotation()
362 			AVL_SETCHILD(cright, left);  in avl_rotation()
421 	gleft = gchild->avl_child[left];  in avl_rotation()
429 	node->avl_child[left] = gright;  in avl_rotation()
432 		AVL_SETCHILD(gright, left);  in avl_rotation()
449 	gchild->avl_child[left] = child;  in avl_rotation()
452 	AVL_SETCHILD(child, left);  in avl_rotation()
686 	int left;  in avl_remove()  local
711 		left = avl_balance2child[old_balance + 1];  in avl_remove()
712 		right = 1 - left;  in avl_remove()
718 		for (node = delete->avl_child[left];  in avl_remove()
730 		if (node->avl_child[left] == node)  in avl_remove()
731 			node->avl_child[left] = &tmp;  in avl_remove()
738 		AVL_SETPARENT(node->avl_child[left], node);  in avl_remove()