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()
79 	struct buffer_head *tbS0 = PATH_PLAST_BUFFER(tb->tb_path);  in balance_leaf_when_delete_del()
80 	int item_pos = PATH_LAST_POSITION(tb->tb_path);  in balance_leaf_when_delete_del()
97 			if (!PATH_H_POSITION(tb->tb_path, 1))  in balance_leaf_when_delete_del()
99 					    PATH_H_PPARENT(tb->tb_path, 0), 0);  in balance_leaf_when_delete_del()
111 	struct buffer_head *tbS0 = PATH_PLAST_BUFFER(tb->tb_path);  in balance_leaf_when_delete_cut()
112 	int item_pos = PATH_LAST_POSITION(tb->tb_path);  in balance_leaf_when_delete_cut()
114 	int pos_in_item = tb->tb_path->pos_in_item;  in balance_leaf_when_delete_cut()
148 	struct buffer_head *tbS0 = PATH_PLAST_BUFFER(tb->tb_path);  in balance_leaf_when_delete_left()
155 			if (tb->FR[0] == PATH_H_PPARENT(tb->tb_path, 0)) {  in balance_leaf_when_delete_left()
160 				if (PATH_H_POSITION(tb->tb_path, 1) == 0 &&  in balance_leaf_when_delete_left()
241 	struct buffer_head *tbS0 = PATH_PLAST_BUFFER(tb->tb_path);  in balance_leaf_when_delete()
249 	RFALSE(!tb->blknum[0] && !PATH_H_PPARENT(tb->tb_path, 0),  in balance_leaf_when_delete()
417 	struct buffer_head *tbS0 = PATH_PLAST_BUFFER(tb->tb_path);  in balance_leaf_paste_left_shift()
536 	struct buffer_head *tbS0 = PATH_PLAST_BUFFER(tb->tb_path);  in balance_leaf_paste_left_whole()
626 	struct buffer_head *tbS0 = PATH_PLAST_BUFFER(tb->tb_path);  in balance_leaf_insert_right()
711 	struct buffer_head *tbS0 = PATH_PLAST_BUFFER(tb->tb_path);  in balance_leaf_paste_right_shift_dirent()
762 	struct buffer_head *tbS0 = PATH_PLAST_BUFFER(tb->tb_path);  in balance_leaf_paste_right_shift()
840 	struct buffer_head *tbS0 = PATH_PLAST_BUFFER(tb->tb_path);  in balance_leaf_paste_right_whole()
884 	struct buffer_head *tbS0 = PATH_PLAST_BUFFER(tb->tb_path);  in balance_leaf_paste_right()
926 	struct buffer_head *tbS0 = PATH_PLAST_BUFFER(tb->tb_path);  in balance_leaf_new_nodes_insert()
1016 	struct buffer_head *tbS0 = PATH_PLAST_BUFFER(tb->tb_path);  in balance_leaf_new_nodes_paste_dirent()
1071 	struct buffer_head *tbS0 = PATH_PLAST_BUFFER(tb->tb_path);  in balance_leaf_new_nodes_paste_shift()
1145 	struct buffer_head *tbS0 = PATH_PLAST_BUFFER(tb->tb_path);  in balance_leaf_new_nodes_paste_whole()
1197 	struct buffer_head *tbS0 = PATH_PLAST_BUFFER(tb->tb_path);  in balance_leaf_new_nodes_paste()
1264 	struct buffer_head *tbS0 = PATH_PLAST_BUFFER(tb->tb_path);  in balance_leaf_finish_node_insert()
1281 	struct buffer_head *tbS0 = PATH_PLAST_BUFFER(tb->tb_path);  in balance_leaf_finish_node_paste_dirent()
1315 	struct buffer_head *tbS0 = PATH_PLAST_BUFFER(tb->tb_path);  in balance_leaf_finish_node_paste()
1387 	struct buffer_head *tbS0 = PATH_PLAST_BUFFER(tb->tb_path);  in balance_leaf()
1395 	tb->item_pos = PATH_LAST_POSITION(tb->tb_path),  in balance_leaf()
1396 	tb->pos_in_item = tb->tb_path->pos_in_item,  in balance_leaf()
1581 	int Sh_position = PATH_H_POSITION(tb->tb_path, h + 1);  in get_left_neighbor_position()
1583 	RFALSE(PATH_H_PPARENT(tb->tb_path, h) == NULL || tb->FL[h] == NULL,  in get_left_neighbor_position()
1585 	       h, tb->FL[h], h, PATH_H_PPARENT(tb->tb_path, h));  in get_left_neighbor_position()
1595 	int Sh_position = PATH_H_POSITION(tb->tb_path, h + 1);  in get_right_neighbor_position()
1597 	RFALSE(PATH_H_PPARENT(tb->tb_path, h) == NULL || tb->FR[h] == NULL,  in get_right_neighbor_position()
1599 	       h, PATH_H_PPARENT(tb->tb_path, h), h, tb->FR[h]);  in get_right_neighbor_position()
1601 	if (Sh_position == B_NR_ITEMS(PATH_H_PPARENT(tb->tb_path, h)))  in get_right_neighbor_position()
1675 	retval |= locked_or_not_in_tree(tb, PATH_PLAST_BUFFER(tb->tb_path),  in check_before_balancing()
1677 	check_leaf(PATH_PLAST_BUFFER(tb->tb_path));  in check_before_balancing()
1704 	if (PATH_H_PBUFFER(tb->tb_path, 1) &&  in check_after_balance_leaf()
1705 	    (B_FREE_SPACE(PATH_H_PBUFFER(tb->tb_path, 0)) !=  in check_after_balance_leaf()
1706 	     (MAX_CHILD_SIZE(PATH_H_PBUFFER(tb->tb_path, 0)) -  in check_after_balance_leaf()
1707 	      dc_size(B_N_CHILD(PATH_H_PBUFFER(tb->tb_path, 1),  in check_after_balance_leaf()
1708 				PATH_H_POSITION(tb->tb_path, 1)))))) {  in check_after_balance_leaf()
1709 		int left = B_FREE_SPACE(PATH_H_PBUFFER(tb->tb_path, 0));  in check_after_balance_leaf()
1710 		int right = (MAX_CHILD_SIZE(PATH_H_PBUFFER(tb->tb_path, 0)) -  in check_after_balance_leaf()
1711 			     dc_size(B_N_CHILD(PATH_H_PBUFFER(tb->tb_path, 1),  in check_after_balance_leaf()
1712 					       PATH_H_POSITION(tb->tb_path,  in check_after_balance_leaf()
1719 				 MAX_CHILD_SIZE(PATH_H_PBUFFER(tb->tb_path, 0)),  in check_after_balance_leaf()
1720 				 PATH_H_PBUFFER(tb->tb_path, 1),  in check_after_balance_leaf()
1721 				 PATH_H_POSITION(tb->tb_path, 1),  in check_after_balance_leaf()
1723 					 (PATH_H_PBUFFER(tb->tb_path, 1),  in check_after_balance_leaf()
1724 					  PATH_H_POSITION(tb->tb_path, 1))),  in check_after_balance_leaf()
1734 	check_leaf(PATH_PLAST_BUFFER(tb->tb_path));  in check_leaf_level()
1743 		check_internal_node(tb->tb_sb, PATH_H_PBUFFER(tb->tb_path, h),  in check_internal_levels()
1887 	child_pos = PATH_H_B_ITEM_ORDER(tb->tb_path, 0) +  in do_balance()