46 	bi->bi_bh        = PATH_PLAST_BUFFER(tb->tb_path);  in buffer_info_init_tbS0()
47 	bi->bi_parent   = PATH_H_PPARENT(tb->tb_path, 0);  in buffer_info_init_tbS0()
48 	bi->bi_position = PATH_H_POSITION(tb->tb_path, 1);  in buffer_info_init_tbS0()
103 	struct buffer_head *tbS0 = PATH_PLAST_BUFFER(tb->tb_path);  in balance_leaf_when_delete()
104 	int item_pos = PATH_LAST_POSITION(tb->tb_path);  in balance_leaf_when_delete()
105 	int pos_in_item = tb->tb_path->pos_in_item;  in balance_leaf_when_delete()
114 	RFALSE(!tb->blknum[0] && !PATH_H_PPARENT(tb->tb_path, 0),  in balance_leaf_when_delete()
136 				if (!PATH_H_POSITION(tb->tb_path, 1))  in balance_leaf_when_delete()
138 						    PATH_H_PPARENT(tb->tb_path,  in balance_leaf_when_delete()
191 				if (tb->FR[0] == PATH_H_PPARENT(tb->tb_path, 0)) {  in balance_leaf_when_delete()
193 					if (PATH_H_POSITION(tb->tb_path, 1) == 0  in balance_leaf_when_delete()
282 	struct buffer_head *tbS0 = PATH_PLAST_BUFFER(tb->tb_path);  in balance_leaf()
283 	int item_pos = PATH_LAST_POSITION(tb->tb_path);	/*  index into the array of item headers in S[0]  in balance_leaf()
311 	pos_in_item = tb->tb_path->pos_in_item;  in balance_leaf()
1765 	int Sh_position = PATH_H_POSITION(tb->tb_path, h + 1);  in get_left_neighbor_position()
1767 	RFALSE(PATH_H_PPARENT(tb->tb_path, h) == NULL || tb->FL[h] == NULL,  in get_left_neighbor_position()
1769 	       h, tb->FL[h], h, PATH_H_PPARENT(tb->tb_path, h));  in get_left_neighbor_position()
1779 	int Sh_position = PATH_H_POSITION(tb->tb_path, h + 1);  in get_right_neighbor_position()
1781 	RFALSE(PATH_H_PPARENT(tb->tb_path, h) == NULL || tb->FR[h] == NULL,  in get_right_neighbor_position()
1783 	       h, PATH_H_PPARENT(tb->tb_path, h), h, tb->FR[h]);  in get_right_neighbor_position()
1785 	if (Sh_position == B_NR_ITEMS(PATH_H_PPARENT(tb->tb_path, h)))  in get_right_neighbor_position()
1857 	retval |= locked_or_not_in_tree(tb, PATH_PLAST_BUFFER(tb->tb_path),  in check_before_balancing()
1859 	check_leaf(PATH_PLAST_BUFFER(tb->tb_path));  in check_before_balancing()
1886 	if (PATH_H_PBUFFER(tb->tb_path, 1) &&  in check_after_balance_leaf()
1887 	    (B_FREE_SPACE(PATH_H_PBUFFER(tb->tb_path, 0)) !=  in check_after_balance_leaf()
1888 	     (MAX_CHILD_SIZE(PATH_H_PBUFFER(tb->tb_path, 0)) -  in check_after_balance_leaf()
1889 	      dc_size(B_N_CHILD(PATH_H_PBUFFER(tb->tb_path, 1),  in check_after_balance_leaf()
1890 				PATH_H_POSITION(tb->tb_path, 1)))))) {  in check_after_balance_leaf()
1891 		int left = B_FREE_SPACE(PATH_H_PBUFFER(tb->tb_path, 0));  in check_after_balance_leaf()
1892 		int right = (MAX_CHILD_SIZE(PATH_H_PBUFFER(tb->tb_path, 0)) -  in check_after_balance_leaf()
1893 			     dc_size(B_N_CHILD(PATH_H_PBUFFER(tb->tb_path, 1),  in check_after_balance_leaf()
1894 					       PATH_H_POSITION(tb->tb_path,  in check_after_balance_leaf()
1901 				 MAX_CHILD_SIZE(PATH_H_PBUFFER(tb->tb_path, 0)),  in check_after_balance_leaf()
1902 				 PATH_H_PBUFFER(tb->tb_path, 1),  in check_after_balance_leaf()
1903 				 PATH_H_POSITION(tb->tb_path, 1),  in check_after_balance_leaf()
1905 					 (PATH_H_PBUFFER(tb->tb_path, 1),  in check_after_balance_leaf()
1906 					  PATH_H_POSITION(tb->tb_path, 1))),  in check_after_balance_leaf()
1916 	check_leaf(PATH_PLAST_BUFFER(tb->tb_path));  in check_leaf_level()
1925 		check_internal_node(tb->tb_sb, PATH_H_PBUFFER(tb->tb_path, h),  in check_internal_levels()
2060 	child_pos = PATH_H_B_ITEM_ORDER(tb->tb_path, 0) +  in do_balance()