Lines Matching refs:bi

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()
242 struct buffer_info bi; in balance_leaf_when_delete() local
252 buffer_info_init_tbS0(tb, &bi); in balance_leaf_when_delete()
291 struct buffer_info bi; in balance_leaf_insert_left() local
312 buffer_info_init_left(tb, &bi); in balance_leaf_insert_left()
313 leaf_insert_into_buf(&bi, n + tb->item_pos - ret, ih, body, in balance_leaf_insert_left()
342 buffer_info_init_left(tb, &bi); in balance_leaf_insert_left()
343 leaf_insert_into_buf(&bi, n + tb->item_pos - ret, ih, body, in balance_leaf_insert_left()
356 struct buffer_info bi; in balance_leaf_paste_left_shift_dirent() local
379 buffer_info_init_left(tb, &bi); in balance_leaf_paste_left_shift_dirent()
380 leaf_paste_in_buffer(&bi, n + tb->item_pos - ret, in balance_leaf_paste_left_shift_dirent()
395 leaf_paste_entries(&bi, n + tb->item_pos - ret, in balance_leaf_paste_left_shift_dirent()
419 struct buffer_info bi; in balance_leaf_paste_left_shift() local
464 buffer_info_init_left(tb, &bi); in balance_leaf_paste_left_shift()
465 leaf_paste_in_buffer(&bi, n + tb->item_pos - ret, in balance_leaf_paste_left_shift()
538 struct buffer_info bi; in balance_leaf_paste_left_whole() local
563 buffer_info_init_left(tb, &bi); in balance_leaf_paste_left_whole()
564 leaf_paste_in_buffer(&bi, n + tb->item_pos - ret, tb->pos_in_item, in balance_leaf_paste_left_whole()
570 leaf_paste_entries(&bi, n + tb->item_pos - ret, in balance_leaf_paste_left_whole()
628 struct buffer_info bi; in balance_leaf_insert_right() local
663 buffer_info_init_right(tb, &bi); in balance_leaf_insert_right()
674 leaf_insert_into_buf(&bi, 0, ih, r_body, r_zeroes_number); in balance_leaf_insert_right()
695 buffer_info_init_right(tb, &bi); in balance_leaf_insert_right()
696 leaf_insert_into_buf(&bi, tb->item_pos - n + tb->rnum[0] - 1, in balance_leaf_insert_right()
712 struct buffer_info bi; in balance_leaf_paste_right_shift_dirent() local
737 buffer_info_init_right(tb, &bi); in balance_leaf_paste_right_shift_dirent()
738 leaf_paste_in_buffer(&bi, 0, paste_entry_position, in balance_leaf_paste_right_shift_dirent()
742 leaf_paste_entries(&bi, 0, paste_entry_position, 1, in balance_leaf_paste_right_shift_dirent()
766 struct buffer_info bi; in balance_leaf_paste_right_shift() local
815 buffer_info_init_right(tb, &bi); in balance_leaf_paste_right_shift()
825 leaf_paste_in_buffer(&bi, 0, n_shift, tb->insert_size[0] - n_rem, in balance_leaf_paste_right_shift()
843 struct buffer_info bi; in balance_leaf_paste_right_whole() local
845 buffer_info_init_right(tb, &bi); in balance_leaf_paste_right_whole()
850 buffer_info_init_right(tb, &bi); in balance_leaf_paste_right_whole()
851 leaf_paste_in_buffer(&bi, tb->item_pos - n + tb->rnum[0], in balance_leaf_paste_right_whole()
859 leaf_paste_entries(&bi, tb->item_pos - n + tb->rnum[0], in balance_leaf_paste_right_whole()
928 struct buffer_info bi; in balance_leaf_new_nodes_insert() local
967 buffer_info_init_bh(tb, &bi, tb->S_new[i]); in balance_leaf_new_nodes_insert()
980 leaf_insert_into_buf(&bi, 0, ih, r_body, r_zeroes_number); in balance_leaf_new_nodes_insert()
1000 buffer_info_init_bh(tb, &bi, tb->S_new[i]); in balance_leaf_new_nodes_insert()
1001 leaf_insert_into_buf(&bi, tb->item_pos - n + tb->snum[i] - 1, in balance_leaf_new_nodes_insert()
1019 struct buffer_info bi; in balance_leaf_new_nodes_paste_dirent() local
1043 buffer_info_init_bh(tb, &bi, tb->S_new[i]); in balance_leaf_new_nodes_paste_dirent()
1044 leaf_paste_in_buffer(&bi, 0, tb->pos_in_item - entry_count + in balance_leaf_new_nodes_paste_dirent()
1049 leaf_paste_entries(&bi, 0, tb->pos_in_item - entry_count + in balance_leaf_new_nodes_paste_dirent()
1076 struct buffer_info bi; in balance_leaf_new_nodes_paste_shift() local
1111 buffer_info_init_bh(tb, &bi, tb->S_new[i]); in balance_leaf_new_nodes_paste_shift()
1121 leaf_paste_in_buffer(&bi, 0, n_shift, tb->insert_size[0] - n_rem, in balance_leaf_new_nodes_paste_shift()
1149 struct buffer_info bi; in balance_leaf_new_nodes_paste_whole() local
1170 buffer_info_init_bh(tb, &bi, tb->S_new[i]); in balance_leaf_new_nodes_paste_whole()
1171 leaf_paste_in_buffer(&bi, tb->item_pos - n + tb->snum[i], in balance_leaf_new_nodes_paste_whole()
1178 leaf_paste_entries(&bi, tb->item_pos - n + tb->snum[i], in balance_leaf_new_nodes_paste_whole()
1265 struct buffer_info bi; in balance_leaf_finish_node_insert() local
1266 buffer_info_init_tbS0(tb, &bi); in balance_leaf_finish_node_insert()
1267 leaf_insert_into_buf(&bi, tb->item_pos, ih, body, tb->zeroes_num); in balance_leaf_finish_node_insert()
1283 struct buffer_info bi; in balance_leaf_finish_node_paste_dirent() local
1290 buffer_info_init_tbS0(tb, &bi); in balance_leaf_finish_node_paste_dirent()
1291 leaf_paste_in_buffer(&bi, tb->item_pos, tb->pos_in_item, in balance_leaf_finish_node_paste_dirent()
1295 leaf_paste_entries(&bi, tb->item_pos, tb->pos_in_item, 1, in balance_leaf_finish_node_paste_dirent()
1316 struct buffer_info bi; in balance_leaf_finish_node_paste() local
1331 buffer_info_init_tbS0(tb, &bi); in balance_leaf_finish_node_paste()
1332 leaf_paste_in_buffer(&bi, tb->item_pos, in balance_leaf_finish_node_paste()
1468 void make_empty_node(struct buffer_info *bi) in make_empty_node() argument
1472 RFALSE(bi->bi_bh == NULL, "PAP-12295: pointer to the buffer is NULL"); in make_empty_node()
1474 blkh = B_BLK_HEAD(bi->bi_bh); in make_empty_node()
1476 set_blkh_free_space(blkh, MAX_CHILD_SIZE(bi->bi_bh)); in make_empty_node()
1478 if (bi->bi_parent) in make_empty_node()
1479 B_N_CHILD(bi->bi_parent, bi->bi_position)->dc_size = 0; /* Endian safe if 0 */ in make_empty_node()
1486 struct buffer_info bi; in get_FEB() local
1495 buffer_info_init_bh(tb, &bi, tb->FEB[i]); in get_FEB()
1496 make_empty_node(&bi); in get_FEB()