fs/reiserfs/do_balan.c

20                                          struct buffer_info *bi)
22 	bi->tb          = tb;
23 	bi->bi_bh       = tb->L[0];
24 	bi->bi_parent   = tb->FL[0];
25 	bi->bi_position = get_left_neighbor_position(tb, 0);
29                                           struct buffer_info *bi)
31 	bi->tb          = tb;
32 	bi->bi_bh       = tb->R[0];
33 	bi->bi_parent   = tb->FR[0];
34 	bi->bi_position = get_right_neighbor_position(tb, 0);
38                                          struct buffer_info *bi)
40 	bi->tb          = tb;
41 	bi->bi_bh        = PATH_PLAST_BUFFER(tb->tb_path);
42 	bi->bi_parent   = PATH_H_PPARENT(tb->tb_path, 0);
43 	bi->bi_position = PATH_H_POSITION(tb->tb_path, 1);
47                                        struct buffer_info *bi,
50 	bi->tb          = tb;
51 	bi->bi_bh       = bh;
52 	bi->bi_parent   = NULL;
53 	bi->bi_position = 0;
81 	struct buffer_info bi;
90 	buffer_info_init_tbS0(tb, &bi);
91 	leaf_delete_items(&bi, 0, item_pos, 1, -1);
115 	struct buffer_info bi;
116 	buffer_info_init_tbS0(tb, &bi);
127 		leaf_cut_from_buffer(&bi, item_pos, pos_in_item,
137 		leaf_cut_from_buffer(&bi, item_pos, pos_in_item,
242 	struct buffer_info bi;
252 	buffer_info_init_tbS0(tb, &bi);
291 	struct buffer_info bi;
312 		buffer_info_init_left(tb, &bi);
313 		leaf_insert_into_buf(&bi, n + tb->item_pos - ret, ih, body,
342 		buffer_info_init_left(tb, &bi);
343 		leaf_insert_into_buf(&bi, n + tb->item_pos - ret, ih, body,
356 	struct buffer_info bi;
379 		buffer_info_init_left(tb, &bi);
380 		leaf_paste_in_buffer(&bi, n + tb->item_pos - ret,
395 		leaf_paste_entries(&bi, n + tb->item_pos - ret,
419 	struct buffer_info bi;
464 		buffer_info_init_left(tb, &bi);
465 		leaf_paste_in_buffer(&bi, n + tb->item_pos - ret,
538 	struct buffer_info bi;
563 	buffer_info_init_left(tb, &bi);
564 	leaf_paste_in_buffer(&bi, n + tb->item_pos - ret, tb->pos_in_item,
570 		leaf_paste_entries(&bi, n + tb->item_pos - ret,
628 	struct buffer_info bi;
663 		buffer_info_init_right(tb, &bi);
674 		leaf_insert_into_buf(&bi, 0, ih, r_body, r_zeroes_number);
695 		buffer_info_init_right(tb, &bi);
696 		leaf_insert_into_buf(&bi, tb->item_pos - n + tb->rnum[0] - 1,
712 	struct buffer_info bi;
737 		buffer_info_init_right(tb, &bi);
738 		leaf_paste_in_buffer(&bi, 0, paste_entry_position,
742 		leaf_paste_entries(&bi, 0, paste_entry_position, 1,
766 	struct buffer_info bi;
815 	buffer_info_init_right(tb, &bi);
825 	leaf_paste_in_buffer(&bi, 0, n_shift, tb->insert_size[0] - n_rem,
843 	struct buffer_info bi;
845 	buffer_info_init_right(tb, &bi);
850 		buffer_info_init_right(tb, &bi);
851 		leaf_paste_in_buffer(&bi, tb->item_pos - n + tb->rnum[0],
859 		leaf_paste_entries(&bi, tb->item_pos - n + tb->rnum[0],
928 	struct buffer_info bi;
967 		buffer_info_init_bh(tb, &bi, tb->S_new[i]);
980 		leaf_insert_into_buf(&bi, 0, ih, r_body, r_zeroes_number);
1000 		buffer_info_init_bh(tb, &bi, tb->S_new[i]);
1001 		leaf_insert_into_buf(&bi, tb->item_pos - n + tb->snum[i] - 1,
1019 	struct buffer_info bi;
1043 		buffer_info_init_bh(tb, &bi, tb->S_new[i]);
1044 		leaf_paste_in_buffer(&bi, 0, tb->pos_in_item - entry_count +
1049 		leaf_paste_entries(&bi, 0, tb->pos_in_item - entry_count +
1076 	struct buffer_info bi;
1111 	buffer_info_init_bh(tb, &bi, tb->S_new[i]);
1121 	leaf_paste_in_buffer(&bi, 0, n_shift, tb->insert_size[0] - n_rem,
1149 	struct buffer_info bi;
1170 	buffer_info_init_bh(tb, &bi, tb->S_new[i]);
1171 	leaf_paste_in_buffer(&bi, tb->item_pos - n + tb->snum[i],
1178 		leaf_paste_entries(&bi, tb->item_pos - n + tb->snum[i],
1265 	struct buffer_info bi;
1266 	buffer_info_init_tbS0(tb, &bi);
1267 	leaf_insert_into_buf(&bi, tb->item_pos, ih, body, tb->zeroes_num);
1283 	struct buffer_info bi;
1290 		buffer_info_init_tbS0(tb, &bi);
1291 		leaf_paste_in_buffer(&bi, tb->item_pos, tb->pos_in_item,
1295 		leaf_paste_entries(&bi, tb->item_pos, tb->pos_in_item, 1,
1316 	struct buffer_info bi;
1331 		buffer_info_init_tbS0(tb, &bi);
1332 		leaf_paste_in_buffer(&bi, tb->item_pos,
1468 void make_empty_node(struct buffer_info *bi)
1472 	RFALSE(bi->bi_bh == NULL, "PAP-12295: pointer to the buffer is NULL");
1474 	blkh = B_BLK_HEAD(bi->bi_bh);
1476 	set_blkh_free_space(blkh, MAX_CHILD_SIZE(bi->bi_bh));
1478 	if (bi->bi_parent)
1479 		B_N_CHILD(bi->bi_parent, bi->bi_position)->dc_size = 0;	/* Endian safe if 0 */
1486 	struct buffer_info bi;
1495 	buffer_info_init_bh(tb, &bi, tb->FEB[i]);
1496 	make_empty_node(&bi);