20                                          struct buffer_info *bi)  in buffer_info_init_left()  argument
22 	bi->tb          = tb;  in buffer_info_init_left()
23 	bi->bi_bh       = tb->L[0];  in buffer_info_init_left()
24 	bi->bi_parent   = tb->FL[0];  in buffer_info_init_left()
25 	bi->bi_position = get_left_neighbor_position(tb, 0);  in buffer_info_init_left()
29                                           struct buffer_info *bi)  in buffer_info_init_right()  argument
31 	bi->tb          = tb;  in buffer_info_init_right()
32 	bi->bi_bh       = tb->R[0];  in buffer_info_init_right()
33 	bi->bi_parent   = tb->FR[0];  in buffer_info_init_right()
34 	bi->bi_position = get_right_neighbor_position(tb, 0);  in buffer_info_init_right()
38                                          struct buffer_info *bi)  in buffer_info_init_tbS0()  argument
40 	bi->tb          = tb;  in buffer_info_init_tbS0()
41 	bi->bi_bh        = PATH_PLAST_BUFFER(tb->tb_path);  in buffer_info_init_tbS0()
42 	bi->bi_parent   = PATH_H_PPARENT(tb->tb_path, 0);  in buffer_info_init_tbS0()
43 	bi->bi_position = PATH_H_POSITION(tb->tb_path, 1);  in buffer_info_init_tbS0()
47                                        struct buffer_info *bi,  in buffer_info_init_bh()  argument
50 	bi->tb          = tb;  in buffer_info_init_bh()
51 	bi->bi_bh       = bh;  in buffer_info_init_bh()
52 	bi->bi_parent   = NULL;  in buffer_info_init_bh()
53 	bi->bi_position = 0;  in buffer_info_init_bh()
81 	struct buffer_info bi;  in balance_leaf_when_delete_del()  local
90 	buffer_info_init_tbS0(tb, &bi);  in balance_leaf_when_delete_del()
91 	leaf_delete_items(&bi, 0, item_pos, 1, -1);  in balance_leaf_when_delete_del()
115 	struct buffer_info bi;  in balance_leaf_when_delete_cut()  local
116 	buffer_info_init_tbS0(tb, &bi);  in balance_leaf_when_delete_cut()
127 		leaf_cut_from_buffer(&bi, item_pos, pos_in_item,  in balance_leaf_when_delete_cut()
137 		leaf_cut_from_buffer(&bi, item_pos, pos_in_item,  in balance_leaf_when_delete_cut()
243 	struct buffer_info bi;  in balance_leaf_when_delete()  local
255 	buffer_info_init_tbS0(tb, &bi);  in balance_leaf_when_delete()
294 	struct buffer_info bi;  in balance_leaf_insert_left()  local
316 		buffer_info_init_left(tb, &bi);  in balance_leaf_insert_left()
317 		leaf_insert_into_buf(&bi, n + tb->item_pos - ret, ih, body,  in balance_leaf_insert_left()
348 		buffer_info_init_left(tb, &bi);  in balance_leaf_insert_left()
349 		leaf_insert_into_buf(&bi, n + tb->item_pos - ret, ih, body,  in balance_leaf_insert_left()
362 	struct buffer_info bi;  in balance_leaf_paste_left_shift_dirent()  local
385 		buffer_info_init_left(tb, &bi);  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()
425 	struct buffer_info bi;  in balance_leaf_paste_left_shift()  local
470 		buffer_info_init_left(tb, &bi);  in balance_leaf_paste_left_shift()
471 		leaf_paste_in_buffer(&bi, n + tb->item_pos - ret,  in balance_leaf_paste_left_shift()
544 	struct buffer_info bi;  in balance_leaf_paste_left_whole()  local
569 	buffer_info_init_left(tb, &bi);  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()
576 		leaf_paste_entries(&bi, n + tb->item_pos - ret,  in balance_leaf_paste_left_whole()
634 	struct buffer_info bi;  in balance_leaf_insert_right()  local
672 		buffer_info_init_right(tb, &bi);  in balance_leaf_insert_right()
683 		leaf_insert_into_buf(&bi, 0, ih, r_body, r_zeroes_number);  in balance_leaf_insert_right()
704 		buffer_info_init_right(tb, &bi);  in balance_leaf_insert_right()
705 		leaf_insert_into_buf(&bi, tb->item_pos - n + tb->rnum[0] - 1,  in balance_leaf_insert_right()
721 	struct buffer_info bi;  in balance_leaf_paste_right_shift_dirent()  local
746 		buffer_info_init_right(tb, &bi);  in balance_leaf_paste_right_shift_dirent()
747 		leaf_paste_in_buffer(&bi, 0, paste_entry_position,  in balance_leaf_paste_right_shift_dirent()
751 		leaf_paste_entries(&bi, 0, paste_entry_position, 1,  in balance_leaf_paste_right_shift_dirent()
775 	struct buffer_info bi;  in balance_leaf_paste_right_shift()  local
824 	buffer_info_init_right(tb, &bi);  in balance_leaf_paste_right_shift()
834 	leaf_paste_in_buffer(&bi, 0, n_shift, tb->insert_size[0] - n_rem,  in balance_leaf_paste_right_shift()
852 	struct buffer_info bi;  in balance_leaf_paste_right_whole()  local
854 							buffer_info_init_right(tb, &bi);  in balance_leaf_paste_right_whole()
859 		buffer_info_init_right(tb, &bi);  in balance_leaf_paste_right_whole()
860 		leaf_paste_in_buffer(&bi, 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()
937 	struct buffer_info bi;  in balance_leaf_new_nodes_insert()  local
978 		buffer_info_init_bh(tb, &bi, tb->S_new[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()
1011 		buffer_info_init_bh(tb, &bi, tb->S_new[i]);  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()
1030 	struct buffer_info bi;  in balance_leaf_new_nodes_paste_dirent()  local
1054 		buffer_info_init_bh(tb, &bi, tb->S_new[i]);  in balance_leaf_new_nodes_paste_dirent()
1055 		leaf_paste_in_buffer(&bi, 0, tb->pos_in_item - entry_count +  in balance_leaf_new_nodes_paste_dirent()
1060 		leaf_paste_entries(&bi, 0, tb->pos_in_item - entry_count +  in balance_leaf_new_nodes_paste_dirent()
1087 	struct buffer_info bi;  in balance_leaf_new_nodes_paste_shift()  local
1122 	buffer_info_init_bh(tb, &bi, tb->S_new[i]);  in balance_leaf_new_nodes_paste_shift()
1132 	leaf_paste_in_buffer(&bi, 0, n_shift, tb->insert_size[0] - n_rem,  in balance_leaf_new_nodes_paste_shift()
1160 	struct buffer_info bi;  in balance_leaf_new_nodes_paste_whole()  local
1181 	buffer_info_init_bh(tb, &bi, tb->S_new[i]);  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()
1189 		leaf_paste_entries(&bi, tb->item_pos - n + tb->snum[i],  in balance_leaf_new_nodes_paste_whole()
1276 	struct buffer_info bi;  in balance_leaf_finish_node_insert()  local
1277 	buffer_info_init_tbS0(tb, &bi);  in balance_leaf_finish_node_insert()
1278 	leaf_insert_into_buf(&bi, tb->item_pos, ih, body, tb->zeroes_num);  in balance_leaf_finish_node_insert()
1294 	struct buffer_info bi;  in balance_leaf_finish_node_paste_dirent()  local
1301 		buffer_info_init_tbS0(tb, &bi);  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()
1327 	struct buffer_info bi;  in balance_leaf_finish_node_paste()  local
1342 		buffer_info_init_tbS0(tb, &bi);  in balance_leaf_finish_node_paste()
1343 		leaf_paste_in_buffer(&bi, tb->item_pos,  in balance_leaf_finish_node_paste()
1479 void make_empty_node(struct buffer_info *bi)  in make_empty_node()  argument
1483 	RFALSE(bi->bi_bh == NULL, "PAP-12295: pointer to the buffer is NULL");  in make_empty_node()
1485 	blkh = B_BLK_HEAD(bi->bi_bh);  in make_empty_node()
1487 	set_blkh_free_space(blkh, MAX_CHILD_SIZE(bi->bi_bh));  in make_empty_node()
1489 	if (bi->bi_parent)  in make_empty_node()
1490 		B_N_CHILD(bi->bi_parent, bi->bi_position)->dc_size = 0;	/* Endian safe if 0 */  in make_empty_node()
1497 	struct buffer_info bi;  in get_FEB()  local
1506 	buffer_info_init_bh(tb, &bi, tb->FEB[i]);  in get_FEB()
1507 	make_empty_node(&bi);  in get_FEB()