83 	struct item_head *ih = item_head(tbS0, item_pos);  in balance_leaf_when_delete_del()
113 	struct item_head *ih = item_head(tbS0, item_pos);  in balance_leaf_when_delete_cut()
287 					     struct item_head *const ih,  in balance_leaf_insert_left()
352 						 struct item_head * const ih,  in balance_leaf_paste_left_shift_dirent()
364 		struct item_head *pasted;  in balance_leaf_paste_left_shift_dirent()
373 			pasted = item_head(tb->L[0], B_NR_ITEMS(tb->L[0]) - 1);  in balance_leaf_paste_left_shift_dirent()
414 						  struct item_head * const ih,  in balance_leaf_paste_left_shift()
422 	if (is_direntry_le_ih(item_head(tbS0, tb->item_pos))) {  in balance_leaf_paste_left_shift()
430 	RFALSE(tb->pos_in_item != ih_item_len(item_head(tbS0, tb->item_pos)),  in balance_leaf_paste_left_shift()
433 	       ih_item_len(item_head(tbS0, tb->item_pos)), tb->pos_in_item);  in balance_leaf_paste_left_shift()
437 		struct item_head *tbS0_pos_ih, *tbL0_ih;  in balance_leaf_paste_left_shift()
438 		struct item_head *tbS0_0_ih;  in balance_leaf_paste_left_shift()
442 		tbS0_pos_ih = item_head(tbS0, tb->item_pos);  in balance_leaf_paste_left_shift()
443 		tbS0_0_ih = item_head(tbS0, 0);  in balance_leaf_paste_left_shift()
461 		tbL0_ih = item_head(tb->L[0], n + tb->item_pos - ret);  in balance_leaf_paste_left_shift()
533 					  struct item_head * const ih,  in balance_leaf_paste_left_whole()
539 	struct item_head *pasted;  in balance_leaf_paste_left_whole()
549 		pasted = item_head(tb->L[0], n - 1);  in balance_leaf_paste_left_whole()
568 	pasted = item_head(tb->L[0], n + tb->item_pos - ret);  in balance_leaf_paste_left_whole()
587 					    struct item_head * const ih,  in balance_leaf_paste_left()
600 				      struct item_head * const ih,  in balance_leaf_left()
622 				      struct item_head * const ih,  in balance_leaf_insert_right()
708 				     struct item_head * const ih,  in balance_leaf_paste_right_shift_dirent()
717 	entry_count = ih_entry_count(item_head(tbS0, tb->item_pos));  in balance_leaf_paste_right_shift_dirent()
759 				     struct item_head * const ih,  in balance_leaf_paste_right_shift()
769 	if (is_direntry_le_ih(item_head(tbS0, tb->item_pos))) {  in balance_leaf_paste_right_shift()
784 	RFALSE(tb->pos_in_item != ih_item_len(item_head(tbS0, tb->item_pos)),  in balance_leaf_paste_right_shift()
787 	       ih_item_len(item_head(tbS0, tb->item_pos)));  in balance_leaf_paste_right_shift()
801 	version = ih_version(item_head(tb->R[0], 0));  in balance_leaf_paste_right_shift()
828 	if (is_indirect_le_ih(item_head(tb->R[0], 0)))  in balance_leaf_paste_right_shift()
829 		set_ih_free_space(item_head(tb->R[0], 0), 0);  in balance_leaf_paste_right_shift()
837 				     struct item_head * const ih,  in balance_leaf_paste_right_whole()
842 	struct item_head *pasted;  in balance_leaf_paste_right_whole()
857 	pasted = item_head(tb->R[0], tb->item_pos - n + tb->rnum[0]);  in balance_leaf_paste_right_whole()
881 				     struct item_head * const ih,  in balance_leaf_paste_right()
905 			       struct item_head * const ih,  in balance_leaf_right()
920 					  struct item_head * const ih,  in balance_leaf_new_nodes_insert()
922 					  struct item_head *insert_key,  in balance_leaf_new_nodes_insert()
1010 					 struct item_head * const ih,  in balance_leaf_new_nodes_paste_dirent()
1012 					 struct item_head *insert_key,  in balance_leaf_new_nodes_paste_dirent()
1017 	struct item_head *aux_ih = item_head(tbS0, tb->item_pos);  in balance_leaf_new_nodes_paste_dirent()
1065 					 struct item_head * const ih,  in balance_leaf_new_nodes_paste_shift()
1067 					 struct item_head *insert_key,  in balance_leaf_new_nodes_paste_shift()
1072 	struct item_head *aux_ih = item_head(tbS0, tb->item_pos);  in balance_leaf_new_nodes_paste_shift()
1075 	struct item_head *tmp;  in balance_leaf_new_nodes_paste_shift()
1089 	RFALSE(tb->pos_in_item != ih_item_len(item_head(tbS0, tb->item_pos)) ||  in balance_leaf_new_nodes_paste_shift()
1124 	tmp = item_head(tb->S_new[i], 0);  in balance_leaf_new_nodes_paste_shift()
1138 					       struct item_head * const ih,  in balance_leaf_new_nodes_paste_whole()
1140 					       struct item_head *insert_key,  in balance_leaf_new_nodes_paste_whole()
1148 	struct item_head *pasted;  in balance_leaf_new_nodes_paste_whole()
1152 	struct item_head *ih_check = item_head(tbS0, tb->item_pos);  in balance_leaf_new_nodes_paste_whole()
1175 	pasted = item_head(tb->S_new[i], tb->item_pos - n +  in balance_leaf_new_nodes_paste_whole()
1191 					 struct item_head * const ih,  in balance_leaf_new_nodes_paste()
1193 					 struct item_head *insert_key,  in balance_leaf_new_nodes_paste()
1221 				   struct item_head * const ih,  in balance_leaf_new_nodes()
1223 				   struct item_head *insert_key,  in balance_leaf_new_nodes()
1261 					    struct item_head * const ih,  in balance_leaf_finish_node_insert()
1278 						  struct item_head * const ih,  in balance_leaf_finish_node_paste_dirent()
1282 	struct item_head *pasted = item_head(tbS0, tb->item_pos);  in balance_leaf_finish_node_paste_dirent()
1312 					   struct item_head * const ih,  in balance_leaf_finish_node_paste()
1317 	struct item_head *pasted = item_head(tbS0, tb->item_pos);  in balance_leaf_finish_node_paste()
1356 				      struct item_head * const ih,  in balance_leaf_finish_node()
1382 static int balance_leaf(struct tree_balance *tb, struct item_head *ih,  in balance_leaf()
1384 			struct item_head *insert_key,  in balance_leaf()
1406 	    && is_indirect_le_ih(item_head(tbS0, tb->item_pos)))  in balance_leaf()
1570 		memcpy(internal_key(dest, n_dest), item_head(src, n_src),  in replace_key()
1847 void do_balance(struct tree_balance *tb, struct item_head *ih,  in do_balance()
1859 	struct item_head insert_key[2];  in do_balance()