Searched refs:tb_path (Results 1 – 7 of 7) sorted by relevance
/linux-3.4.99/fs/reiserfs/ |
D | do_balan.c | 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() [all …]
|
D | ibalance.c | 37 src_bi->bi_bh = PATH_H_PBUFFER(tb->tb_path, h); in internal_define_dest_src_infos() 38 src_bi->bi_parent = PATH_H_PPARENT(tb->tb_path, h); in internal_define_dest_src_infos() 39 src_bi->bi_position = PATH_H_POSITION(tb->tb_path, h + 1); in internal_define_dest_src_infos() 53 dest_bi->bi_bh = PATH_H_PBUFFER(tb->tb_path, h); in internal_define_dest_src_infos() 54 dest_bi->bi_parent = PATH_H_PPARENT(tb->tb_path, h); in internal_define_dest_src_infos() 55 …dest_bi->bi_position = PATH_H_POSITION(tb->tb_path, h + 1); /* dest position is analog of dest->b_… in internal_define_dest_src_infos() 66 dest_bi->bi_bh = PATH_H_PBUFFER(tb->tb_path, h); in internal_define_dest_src_infos() 67 dest_bi->bi_parent = PATH_H_PPARENT(tb->tb_path, h); in internal_define_dest_src_infos() 68 dest_bi->bi_position = PATH_H_POSITION(tb->tb_path, h + 1); in internal_define_dest_src_infos() 75 src_bi->bi_bh = PATH_H_PBUFFER(tb->tb_path, h); in internal_define_dest_src_infos() [all …]
|
D | fix_node.c | 85 Sh = PATH_H_PBUFFER(tb->tb_path, h); in create_virtual_node() 227 RFALSE(!PATH_H_PPARENT(tb->tb_path, 0), in check_left() 307 RFALSE(!PATH_H_PPARENT(tb->tb_path, 0), in check_right() 399 max_node_size = MAX_CHILD_SIZE(PATH_H_PBUFFER(tb->tb_path, h)); in get_num_ver() 660 S0 = PATH_H_PBUFFER(tb->tb_path, 0); in are_leaves_removable() 754 pathrelse(tb->tb_path); in free_buffers_in_tb() 782 *Sh = PATH_H_PBUFFER(tb->tb_path, h); in get_empty_nodes() 859 if ((f = PATH_H_PPARENT(tb->tb_path, h)) == NULL || in get_lfree() 864 order = PATH_H_B_ITEM_ORDER(tb->tb_path, h) - 1; in get_lfree() 881 if ((f = PATH_H_PPARENT(tb->tb_path, h)) == NULL || in get_rfree() [all …]
|
D | prints.c | 628 tb->tb_mode, PATH_LAST_POSITION(tb->tb_path), in store_print_tb() 629 tb->tb_path->pos_in_item); in store_print_tb() 632 if (PATH_H_PATH_OFFSET(tb->tb_path, h) <= in store_print_tb() 633 tb->tb_path->path_length in store_print_tb() 634 && PATH_H_PATH_OFFSET(tb->tb_path, in store_print_tb() 636 tbSh = PATH_H_PBUFFER(tb->tb_path, h); in store_print_tb() 637 tbFh = PATH_H_PPARENT(tb->tb_path, h); in store_print_tb()
|
D | lbalance.c | 569 src_bi->bi_bh = PATH_PLAST_BUFFER(tb->tb_path); in leaf_define_dest_src_infos() 570 src_bi->bi_parent = PATH_H_PPARENT(tb->tb_path, 0); in leaf_define_dest_src_infos() 571 src_bi->bi_position = PATH_H_B_ITEM_ORDER(tb->tb_path, 0); /* src->b_item_order */ in leaf_define_dest_src_infos() 581 src_bi->bi_bh = PATH_PLAST_BUFFER(tb->tb_path); in leaf_define_dest_src_infos() 582 src_bi->bi_parent = PATH_H_PPARENT(tb->tb_path, 0); in leaf_define_dest_src_infos() 583 src_bi->bi_position = PATH_H_B_ITEM_ORDER(tb->tb_path, 0); in leaf_define_dest_src_infos() 617 src_bi->bi_bh = PATH_PLAST_BUFFER(tb->tb_path); in leaf_define_dest_src_infos() 618 src_bi->bi_parent = PATH_H_PPARENT(tb->tb_path, 0); in leaf_define_dest_src_infos() 619 src_bi->bi_position = PATH_H_B_ITEM_ORDER(tb->tb_path, 0); in leaf_define_dest_src_infos() 664 struct buffer_head *S0 = PATH_PLAST_BUFFER(tb->tb_path); in leaf_shift_left() [all …]
|
D | stree.c | 1102 struct item_head *p_le_ih = PATH_PITEM_HEAD(tb->tb_path); in calc_deleted_bytes_number() 1119 (PATH_PLAST_BUFFER(tb->tb_path)->b_size); in calc_deleted_bytes_number() 1134 tb->tb_path = path; in init_tb_struct() 1680 p_le_ih = PATH_PITEM_HEAD(s_cut_balance.tb_path); in reiserfs_cut_from_item() 1695 PATH_PITEM_HEAD(s_cut_balance.tb_path); in reiserfs_cut_from_item()
|
D | reiserfs.h | 2060 struct treepath *tb_path; member 2848 .path = tb->tb_path, in reiserfs_new_form_blocknrs()
|