1590 int get_left_neighbor_position(struct tree_balance *tb, int h)  in get_left_neighbor_position()  argument
1592 	int Sh_position = PATH_H_POSITION(tb->tb_path, h + 1);  in get_left_neighbor_position()
1594 	RFALSE(PATH_H_PPARENT(tb->tb_path, h) == NULL || tb->FL[h] == NULL,  in get_left_neighbor_position()
1596 	       h, tb->FL[h], h, PATH_H_PPARENT(tb->tb_path, h));  in get_left_neighbor_position()
1599 		return B_NR_ITEMS(tb->FL[h]);  in get_left_neighbor_position()
1604 int get_right_neighbor_position(struct tree_balance *tb, int h)  in get_right_neighbor_position()  argument
1606 	int Sh_position = PATH_H_POSITION(tb->tb_path, h + 1);  in get_right_neighbor_position()
1608 	RFALSE(PATH_H_PPARENT(tb->tb_path, h) == NULL || tb->FR[h] == NULL,  in get_right_neighbor_position()
1610 	       h, PATH_H_PPARENT(tb->tb_path, h), h, tb->FR[h]);  in get_right_neighbor_position()
1612 	if (Sh_position == B_NR_ITEMS(PATH_H_PPARENT(tb->tb_path, h)))  in get_right_neighbor_position()
1750 	int h;  in check_internal_levels()  local
1753 	for (h = 1; tb->insert_size[h]; h++) {  in check_internal_levels()
1754 		check_internal_node(tb->tb_sb, PATH_H_PBUFFER(tb->tb_path, h),  in check_internal_levels()
1756 		if (tb->lnum[h])  in check_internal_levels()
1757 			check_internal_node(tb->tb_sb, tb->L[h], "BAD L");  in check_internal_levels()
1758 		if (tb->rnum[h])  in check_internal_levels()
1759 			check_internal_node(tb->tb_sb, tb->R[h], "BAD R");  in check_internal_levels()
1862 	int h;			/* level of the tree being processed */  in do_balance()  local
1906 	for (h = 1; h < MAX_HEIGHT && tb->insert_size[h]; h++)  in do_balance()
1907 		child_pos = balance_internal(tb, h, child_pos, insert_key,  in do_balance()