80 	int item_pos = PATH_LAST_POSITION(tb->tb_path);  in balance_leaf_when_delete_del()  local
83 	struct item_head *ih = item_head(tbS0, item_pos);  in balance_leaf_when_delete_del()
91 	leaf_delete_items(&bi, 0, item_pos, 1, -1);  in balance_leaf_when_delete_del()
93 	if (!item_pos && tb->CFL[0]) {  in balance_leaf_when_delete_del()
103 	RFALSE(!item_pos && !tb->CFL[0],  in balance_leaf_when_delete_del()
112 	int item_pos = PATH_LAST_POSITION(tb->tb_path);  in balance_leaf_when_delete_cut()  local
113 	struct item_head *ih = item_head(tbS0, item_pos);  in balance_leaf_when_delete_cut()
127 		leaf_cut_from_buffer(&bi, item_pos, pos_in_item,  in balance_leaf_when_delete_cut()
130 		RFALSE(!item_pos && !pos_in_item && !tb->CFL[0],  in balance_leaf_when_delete_cut()
134 		if (!item_pos && !pos_in_item && tb->CFL[0])  in balance_leaf_when_delete_cut()
137 		leaf_cut_from_buffer(&bi, item_pos, pos_in_item,  in balance_leaf_when_delete_cut()
242 	int item_pos = PATH_LAST_POSITION(tb->tb_path);  in balance_leaf_when_delete()  local
254 	ih = item_head(tbS0, item_pos);  in balance_leaf_when_delete()
298 	if (tb->item_pos == tb->lnum[0] - 1 && tb->lbytes != -1) {  in balance_leaf_insert_left()
317 		leaf_insert_into_buf(&bi, n + tb->item_pos - ret, ih, body,  in balance_leaf_insert_left()
349 		leaf_insert_into_buf(&bi, n + tb->item_pos - ret, ih, body,  in balance_leaf_insert_left()
378 		if (ret && !tb->item_pos) {  in balance_leaf_paste_left_shift_dirent()
386 		leaf_paste_in_buffer(&bi, n + tb->item_pos - ret,  in balance_leaf_paste_left_shift_dirent()
401 		leaf_paste_entries(&bi, n + tb->item_pos - ret,  in balance_leaf_paste_left_shift_dirent()
428 	if (is_direntry_le_ih(item_head(tbS0, tb->item_pos))) {  in balance_leaf_paste_left_shift()
436 	RFALSE(tb->pos_in_item != ih_item_len(item_head(tbS0, tb->item_pos)),  in balance_leaf_paste_left_shift()
439 	       ih_item_len(item_head(tbS0, tb->item_pos)), tb->pos_in_item);  in balance_leaf_paste_left_shift()
448 		tbS0_pos_ih = item_head(tbS0, tb->item_pos);  in balance_leaf_paste_left_shift()
467 		tbL0_ih = item_head(tb->L[0], n + tb->item_pos - ret);  in balance_leaf_paste_left_shift()
471 		leaf_paste_in_buffer(&bi, n + tb->item_pos - ret,  in balance_leaf_paste_left_shift()
484 		       leaf_key(tb->L[0], n + tb->item_pos - ret)),  in balance_leaf_paste_left_shift()
549 	if (!tb->item_pos &&  in balance_leaf_paste_left_whole()
570 	leaf_paste_in_buffer(&bi, n + tb->item_pos - ret, tb->pos_in_item,  in balance_leaf_paste_left_whole()
574 	pasted = item_head(tb->L[0], n + tb->item_pos - ret);  in balance_leaf_paste_left_whole()
576 		leaf_paste_entries(&bi, n + tb->item_pos - ret,  in balance_leaf_paste_left_whole()
597 	if (tb->item_pos == tb->lnum[0] - 1 && tb->lbytes != -1)  in balance_leaf_paste_left()
613 	if (tb->item_pos < tb->lnum[0]) {  in balance_leaf_left()
638 	if (n - tb->rnum[0] >= tb->item_pos) {  in balance_leaf_insert_right()
646 	if (tb->item_pos == n - tb->rnum[0] + 1 && tb->rbytes != -1) {  in balance_leaf_insert_right()
705 		leaf_insert_into_buf(&bi, tb->item_pos - n + tb->rnum[0] - 1,  in balance_leaf_insert_right()
708 		if (tb->item_pos - n + tb->rnum[0] - 1 == 0)  in balance_leaf_insert_right()
726 	entry_count = ih_entry_count(item_head(tbS0, tb->item_pos));  in balance_leaf_paste_right_shift_dirent()
778 	if (is_direntry_le_ih(item_head(tbS0, tb->item_pos))) {  in balance_leaf_paste_right_shift()
793 	RFALSE(tb->pos_in_item != ih_item_len(item_head(tbS0, tb->item_pos)),  in balance_leaf_paste_right_shift()
796 	       ih_item_len(item_head(tbS0, tb->item_pos)));  in balance_leaf_paste_right_shift()
860 		leaf_paste_in_buffer(&bi, tb->item_pos - n + tb->rnum[0],  in balance_leaf_paste_right_whole()
866 	pasted = item_head(tb->R[0], tb->item_pos - n + tb->rnum[0]);  in balance_leaf_paste_right_whole()
868 		leaf_paste_entries(&bi, tb->item_pos - n + tb->rnum[0],  in balance_leaf_paste_right_whole()
875 			RFALSE(tb->item_pos - n + tb->rnum[0],  in balance_leaf_paste_right_whole()
897 	if (n - tb->rnum[0] > tb->item_pos) {  in balance_leaf_paste_right()
904 	if (tb->item_pos == n - tb->rnum[0] && tb->rbytes != -1)  in balance_leaf_paste_right()
941 	if (n - tb->snum[i] >= tb->item_pos) {  in balance_leaf_new_nodes_insert()
950 	if (tb->item_pos == n - tb->snum[i] + 1 && tb->sbytes[i] != -1) {  in balance_leaf_new_nodes_insert()
1012 		leaf_insert_into_buf(&bi, tb->item_pos - n + tb->snum[i] - 1,  in balance_leaf_new_nodes_insert()
1028 	struct item_head *aux_ih = item_head(tbS0, tb->item_pos);  in balance_leaf_new_nodes_paste_dirent()
1083 	struct item_head *aux_ih = item_head(tbS0, tb->item_pos);  in balance_leaf_new_nodes_paste_shift()
1100 	RFALSE(tb->pos_in_item != ih_item_len(item_head(tbS0, tb->item_pos)) ||  in balance_leaf_new_nodes_paste_shift()
1163 	struct item_head *ih_check = item_head(tbS0, tb->item_pos);  in balance_leaf_new_nodes_paste_whole()
1182 	leaf_paste_in_buffer(&bi, tb->item_pos - n + tb->snum[i],  in balance_leaf_new_nodes_paste_whole()
1186 	pasted = item_head(tb->S_new[i], tb->item_pos - n +  in balance_leaf_new_nodes_paste_whole()
1189 		leaf_paste_entries(&bi, tb->item_pos - n + tb->snum[i],  in balance_leaf_new_nodes_paste_whole()
1212 	if (n - tb->snum[i] > tb->item_pos) {  in balance_leaf_new_nodes_paste()
1220 	if (tb->item_pos == n - tb->snum[i] && tb->sbytes[i] != -1)  in balance_leaf_new_nodes_paste()
1278 	leaf_insert_into_buf(&bi, tb->item_pos, ih, body, tb->zeroes_num);  in balance_leaf_finish_node_insert()
1281 	if (tb->item_pos == 0) {  in balance_leaf_finish_node_insert()
1293 	struct item_head *pasted = item_head(tbS0, tb->item_pos);  in balance_leaf_finish_node_paste_dirent()
1302 		leaf_paste_in_buffer(&bi, tb->item_pos, tb->pos_in_item,  in balance_leaf_finish_node_paste_dirent()
1306 		leaf_paste_entries(&bi, tb->item_pos, tb->pos_in_item, 1,  in balance_leaf_finish_node_paste_dirent()
1310 		if (!tb->item_pos && !tb->pos_in_item) {  in balance_leaf_finish_node_paste_dirent()
1328 	struct item_head *pasted = item_head(tbS0, tb->item_pos);  in balance_leaf_finish_node_paste()
1343 		leaf_paste_in_buffer(&bi, tb->item_pos,  in balance_leaf_finish_node_paste()
1371 	if (0 <= tb->item_pos && tb->item_pos < tb->s0num) {  in balance_leaf_finish_node()
1406 	tb->item_pos = PATH_LAST_POSITION(tb->tb_path),  in balance_leaf()
1417 	    && is_indirect_le_ih(item_head(tbS0, tb->item_pos)))  in balance_leaf()
1424 	tb->item_pos -= (tb->lnum[0] - ((tb->lbytes != -1) ? 1 : 0));  in balance_leaf()