Lines Matching refs:tb_path
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()
242 int item_pos = PATH_LAST_POSITION(tb->tb_path); in balance_leaf_when_delete()
251 RFALSE(!tb->blknum[0] && !PATH_H_PPARENT(tb->tb_path, 0), in balance_leaf_when_delete()
423 struct buffer_head *tbS0 = PATH_PLAST_BUFFER(tb->tb_path); in balance_leaf_paste_left_shift()
542 struct buffer_head *tbS0 = PATH_PLAST_BUFFER(tb->tb_path); in balance_leaf_paste_left_whole()
632 struct buffer_head *tbS0 = PATH_PLAST_BUFFER(tb->tb_path); in balance_leaf_insert_right()
720 struct buffer_head *tbS0 = PATH_PLAST_BUFFER(tb->tb_path); in balance_leaf_paste_right_shift_dirent()
771 struct buffer_head *tbS0 = PATH_PLAST_BUFFER(tb->tb_path); in balance_leaf_paste_right_shift()
849 struct buffer_head *tbS0 = PATH_PLAST_BUFFER(tb->tb_path); in balance_leaf_paste_right_whole()
893 struct buffer_head *tbS0 = PATH_PLAST_BUFFER(tb->tb_path); in balance_leaf_paste_right()
935 struct buffer_head *tbS0 = PATH_PLAST_BUFFER(tb->tb_path); in balance_leaf_new_nodes_insert()
1027 struct buffer_head *tbS0 = PATH_PLAST_BUFFER(tb->tb_path); in balance_leaf_new_nodes_paste_dirent()
1082 struct buffer_head *tbS0 = PATH_PLAST_BUFFER(tb->tb_path); in balance_leaf_new_nodes_paste_shift()
1156 struct buffer_head *tbS0 = PATH_PLAST_BUFFER(tb->tb_path); in balance_leaf_new_nodes_paste_whole()
1208 struct buffer_head *tbS0 = PATH_PLAST_BUFFER(tb->tb_path); in balance_leaf_new_nodes_paste()
1275 struct buffer_head *tbS0 = PATH_PLAST_BUFFER(tb->tb_path); in balance_leaf_finish_node_insert()
1292 struct buffer_head *tbS0 = PATH_PLAST_BUFFER(tb->tb_path); in balance_leaf_finish_node_paste_dirent()
1326 struct buffer_head *tbS0 = PATH_PLAST_BUFFER(tb->tb_path); in balance_leaf_finish_node_paste()
1398 struct buffer_head *tbS0 = PATH_PLAST_BUFFER(tb->tb_path); in balance_leaf()
1406 tb->item_pos = PATH_LAST_POSITION(tb->tb_path), in balance_leaf()
1407 tb->pos_in_item = tb->tb_path->pos_in_item, in balance_leaf()
1592 int Sh_position = PATH_H_POSITION(tb->tb_path, h + 1); in get_left_neighbor_position()
1594 RFALSE(PATH_H_PPARENT(tb->tb_path, h) == NULL || tb->FL[h] == NULL, in get_left_neighbor_position()
1596 h, tb->FL[h], h, PATH_H_PPARENT(tb->tb_path, h)); in get_left_neighbor_position()
1606 int Sh_position = PATH_H_POSITION(tb->tb_path, h + 1); in get_right_neighbor_position()
1608 RFALSE(PATH_H_PPARENT(tb->tb_path, h) == NULL || tb->FR[h] == NULL, in get_right_neighbor_position()
1610 h, PATH_H_PPARENT(tb->tb_path, h), h, tb->FR[h]); in get_right_neighbor_position()
1612 if (Sh_position == B_NR_ITEMS(PATH_H_PPARENT(tb->tb_path, h))) in get_right_neighbor_position()
1686 retval |= locked_or_not_in_tree(tb, PATH_PLAST_BUFFER(tb->tb_path), in check_before_balancing()
1688 check_leaf(PATH_PLAST_BUFFER(tb->tb_path)); in check_before_balancing()
1715 if (PATH_H_PBUFFER(tb->tb_path, 1) && in check_after_balance_leaf()
1716 (B_FREE_SPACE(PATH_H_PBUFFER(tb->tb_path, 0)) != in check_after_balance_leaf()
1717 (MAX_CHILD_SIZE(PATH_H_PBUFFER(tb->tb_path, 0)) - in check_after_balance_leaf()
1718 dc_size(B_N_CHILD(PATH_H_PBUFFER(tb->tb_path, 1), in check_after_balance_leaf()
1719 PATH_H_POSITION(tb->tb_path, 1)))))) { in check_after_balance_leaf()
1720 int left = B_FREE_SPACE(PATH_H_PBUFFER(tb->tb_path, 0)); in check_after_balance_leaf()
1721 int right = (MAX_CHILD_SIZE(PATH_H_PBUFFER(tb->tb_path, 0)) - in check_after_balance_leaf()
1722 dc_size(B_N_CHILD(PATH_H_PBUFFER(tb->tb_path, 1), in check_after_balance_leaf()
1723 PATH_H_POSITION(tb->tb_path, in check_after_balance_leaf()
1730 MAX_CHILD_SIZE(PATH_H_PBUFFER(tb->tb_path, 0)), in check_after_balance_leaf()
1731 PATH_H_PBUFFER(tb->tb_path, 1), in check_after_balance_leaf()
1732 PATH_H_POSITION(tb->tb_path, 1), in check_after_balance_leaf()
1734 (PATH_H_PBUFFER(tb->tb_path, 1), in check_after_balance_leaf()
1735 PATH_H_POSITION(tb->tb_path, 1))), in check_after_balance_leaf()
1745 check_leaf(PATH_PLAST_BUFFER(tb->tb_path)); in check_leaf_level()
1754 check_internal_node(tb->tb_sb, PATH_H_PBUFFER(tb->tb_path, h), in check_internal_levels()
1898 child_pos = PATH_H_B_ITEM_ORDER(tb->tb_path, 0) + in do_balance()