83 	struct item_head *ih = item_head(tbS0, item_pos);  in balance_leaf_when_delete_del()  local
86 	RFALSE(ih_item_len(ih) + IH_SIZE != -tb->insert_size[0],  in balance_leaf_when_delete_del()
88 	       -tb->insert_size[0], ih);  in balance_leaf_when_delete_del()
113 	struct item_head *ih = item_head(tbS0, item_pos);  in balance_leaf_when_delete_cut()  local
118 	if (is_direntry_le_ih(ih)) {  in balance_leaf_when_delete_cut()
140 		RFALSE(!ih_item_len(ih),  in balance_leaf_when_delete_cut()
245 	struct item_head *ih;  in balance_leaf_when_delete()  local
254 	ih = item_head(tbS0, item_pos);  in balance_leaf_when_delete()
290 					     struct item_head *const ih,  in balance_leaf_insert_left()  argument
306 		new_item_len = ih_item_len(ih) - tb->lbytes;  in balance_leaf_insert_left()
309 		put_ih_item_len(ih, ih_item_len(ih) - new_item_len);  in balance_leaf_insert_left()
311 		RFALSE(ih_item_len(ih) <= 0,  in balance_leaf_insert_left()
313 		       "ih_item_len=%d", ih_item_len(ih));  in balance_leaf_insert_left()
317 		leaf_insert_into_buf(&bi, n + tb->item_pos - ret, ih, body,  in balance_leaf_insert_left()
318 			     min_t(int, tb->zeroes_num, ih_item_len(ih)));  in balance_leaf_insert_left()
320 		version = ih_version(ih);  in balance_leaf_insert_left()
327 		if (is_indirect_le_ih(ih))  in balance_leaf_insert_left()
330 		add_le_ih_k_offset(ih, tb->lbytes << shift);  in balance_leaf_insert_left()
332 		put_ih_item_len(ih, new_item_len);  in balance_leaf_insert_left()
339 		RFALSE(ih_item_len(ih) <= 0,  in balance_leaf_insert_left()
341 		       "ih_item_len=%d", ih_item_len(ih));  in balance_leaf_insert_left()
349 		leaf_insert_into_buf(&bi, n + tb->item_pos - ret, ih, body,  in balance_leaf_insert_left()
358 						 struct item_head * const ih,  in balance_leaf_paste_left_shift_dirent()  argument
420 						  struct item_head * const ih,  in balance_leaf_paste_left_shift()  argument
429 		balance_leaf_paste_left_shift_dirent(tb, ih, body);  in balance_leaf_paste_left_shift()
539 					  struct item_head * const ih,  in balance_leaf_paste_left_whole()  argument
593 					    struct item_head * const ih,  in balance_leaf_paste_left()  argument
598 		return balance_leaf_paste_left_shift(tb, ih, body);  in balance_leaf_paste_left()
600 		balance_leaf_paste_left_whole(tb, ih, body);  in balance_leaf_paste_left()
606 				      struct item_head * const ih,  in balance_leaf_left()  argument
617 			return balance_leaf_insert_left(tb, ih, body);  in balance_leaf_left()
619 			return balance_leaf_paste_left(tb, ih, body);  in balance_leaf_left()
628 				      struct item_head * const ih,  in balance_leaf_insert_right()  argument
654 		version = ih_version(ih);  in balance_leaf_insert_right()
657 		old_key_comp = le_ih_k_offset(ih);  in balance_leaf_insert_right()
658 		old_len = ih_item_len(ih);  in balance_leaf_insert_right()
665 		if (is_indirect_le_ih(ih))  in balance_leaf_insert_right()
667 		offset = le_ih_k_offset(ih) + ((old_len - tb->rbytes) << shift);  in balance_leaf_insert_right()
668 		set_le_ih_k_offset(ih, offset);  in balance_leaf_insert_right()
669 		put_ih_item_len(ih, tb->rbytes);  in balance_leaf_insert_right()
683 		leaf_insert_into_buf(&bi, 0, ih, r_body, r_zeroes_number);  in balance_leaf_insert_right()
692 		set_le_ih_k_offset(ih, old_key_comp);  in balance_leaf_insert_right()
693 		put_ih_item_len(ih, old_len - tb->rbytes);  in balance_leaf_insert_right()
706 				     ih, body, tb->zeroes_num);  in balance_leaf_insert_right()
717 				     struct item_head * const ih,  in balance_leaf_paste_right_shift_dirent()  argument
768 				     struct item_head * const ih,  in balance_leaf_paste_right_shift()  argument
779 		balance_leaf_paste_right_shift_dirent(tb, ih, body);  in balance_leaf_paste_right_shift()
846 				     struct item_head * const ih,  in balance_leaf_paste_right_whole()  argument
890 				     struct item_head * const ih,  in balance_leaf_paste_right()  argument
906 		balance_leaf_paste_right_shift(tb, ih, body);  in balance_leaf_paste_right()
909 		balance_leaf_paste_right_whole(tb, ih, body);  in balance_leaf_paste_right()
914 			       struct item_head * const ih,  in balance_leaf_right()  argument
923 		balance_leaf_insert_right(tb, ih, body);  in balance_leaf_right()
925 		balance_leaf_paste_right(tb, ih, body);  in balance_leaf_right()
929 					  struct item_head * const ih,  in balance_leaf_new_nodes_insert()  argument
960 		version = ih_version(ih);  in balance_leaf_new_nodes_insert()
961 		old_key_comp = le_ih_k_offset(ih);  in balance_leaf_new_nodes_insert()
962 		old_len = ih_item_len(ih);  in balance_leaf_new_nodes_insert()
969 		if (is_indirect_le_ih(ih))  in balance_leaf_new_nodes_insert()
971 		set_le_ih_k_offset(ih,  in balance_leaf_new_nodes_insert()
972 				   le_ih_k_offset(ih) +  in balance_leaf_new_nodes_insert()
975 		put_ih_item_len(ih, tb->sbytes[i]);  in balance_leaf_new_nodes_insert()
991 		leaf_insert_into_buf(&bi, 0, ih, r_body, r_zeroes_number);  in balance_leaf_new_nodes_insert()
997 		set_le_ih_k_offset(ih, old_key_comp);  in balance_leaf_new_nodes_insert()
998 		put_ih_item_len(ih, old_len - tb->sbytes[i]);  in balance_leaf_new_nodes_insert()
1013 				     ih, body, tb->zeroes_num);  in balance_leaf_new_nodes_insert()
1021 					 struct item_head * const ih,  in balance_leaf_new_nodes_paste_dirent()  argument
1076 					 struct item_head * const ih,  in balance_leaf_new_nodes_paste_shift()  argument
1089 	RFALSE(ih, "PAP-12210: ih must be 0");  in balance_leaf_new_nodes_paste_shift()
1092 		balance_leaf_new_nodes_paste_dirent(tb, ih, body, insert_key,  in balance_leaf_new_nodes_paste_shift()
1149 					       struct item_head * const ih,  in balance_leaf_new_nodes_paste_whole()  argument
1202 					 struct item_head * const ih,  in balance_leaf_new_nodes_paste()  argument
1222 		balance_leaf_new_nodes_paste_shift(tb, ih, body, insert_key,  in balance_leaf_new_nodes_paste()
1226 		balance_leaf_new_nodes_paste_whole(tb, ih, body, insert_key,  in balance_leaf_new_nodes_paste()
1232 				   struct item_head * const ih,  in balance_leaf_new_nodes()  argument
1254 			balance_leaf_new_nodes_insert(tb, ih, body, insert_key,  in balance_leaf_new_nodes()
1257 			balance_leaf_new_nodes_paste(tb, ih, body, insert_key,  in balance_leaf_new_nodes()
1272 					    struct item_head * const ih,  in balance_leaf_finish_node_insert()  argument
1278 	leaf_insert_into_buf(&bi, tb->item_pos, ih, body, tb->zeroes_num);  in balance_leaf_finish_node_insert()
1289 						  struct item_head * const ih,  in balance_leaf_finish_node_paste_dirent()  argument
1323 					   struct item_head * const ih,  in balance_leaf_finish_node_paste()  argument
1332 		balance_leaf_finish_node_paste_dirent(tb, ih, body);  in balance_leaf_finish_node_paste()
1367 				      struct item_head * const ih,  in balance_leaf_finish_node()  argument
1373 			balance_leaf_finish_node_insert(tb, ih, body);  in balance_leaf_finish_node()
1375 			balance_leaf_finish_node_paste(tb, ih, body);  in balance_leaf_finish_node()
1393 static int balance_leaf(struct tree_balance *tb, struct item_head *ih,  in balance_leaf()  argument
1410 		tb->zeroes_num = ih_item_len(ih);  in balance_leaf()
1420 	body += balance_leaf_left(tb, ih, body, flag);  in balance_leaf()
1426 	balance_leaf_right(tb, ih, body, flag);  in balance_leaf()
1461 	balance_leaf_new_nodes(tb, ih, body, insert_key, insert_ptr, flag);  in balance_leaf()
1463 	balance_leaf_finish_node(tb, ih, body, flag);  in balance_leaf()
1858 void do_balance(struct tree_balance *tb, struct item_head *ih,  in do_balance()  argument
1899 	    balance_leaf(tb, ih, body, flag, insert_key, insert_ptr);  in do_balance()