Searched refs:PATH_H_PBUFFER (Results 1 – 5 of 5) sorted by relevance
/linux-2.4.37.9/fs/reiserfs/ |
D | ibalance.c | 45 src_bi->bi_bh = PATH_H_PBUFFER (tb->tb_path, h); in internal_define_dest_src_infos() 61 dest_bi->bi_bh = PATH_H_PBUFFER (tb->tb_path, h); in internal_define_dest_src_infos() 74 dest_bi->bi_bh = PATH_H_PBUFFER (tb->tb_path, h); in internal_define_dest_src_infos() 83 src_bi->bi_bh = PATH_H_PBUFFER (tb->tb_path, h); in internal_define_dest_src_infos() 103 dest_bi->bi_bh = PATH_H_PBUFFER (tb->tb_path, h); in internal_define_dest_src_infos() 543 RFALSE( src_bi.bi_bh != PATH_H_PBUFFER (tb->tb_path, h)/*tb->S[h]*/ || in internal_shift_right() 546 src_bi.bi_bh, PATH_H_PBUFFER (tb->tb_path, h)); in internal_shift_right() 592 struct buffer_head * tbSh = PATH_H_PBUFFER (tb->tb_path, h); in balance_internal_when_delete() 711 if (B_NR_ITEMS(PATH_H_PBUFFER(tb->tb_path, h)) == 0) in replace_lkey() 761 struct buffer_head * tbSh = PATH_H_PBUFFER (tb->tb_path, h); in balance_internal() [all …]
|
D | do_balan.c | 1414 if (PATH_H_PBUFFER(tb->tb_path,1) && in check_after_balance_leaf() 1415 (B_FREE_SPACE (PATH_H_PBUFFER(tb->tb_path,0)) != in check_after_balance_leaf() 1416 (MAX_CHILD_SIZE (PATH_H_PBUFFER(tb->tb_path,0)) - in check_after_balance_leaf() 1417 dc_size(B_N_CHILD (PATH_H_PBUFFER(tb->tb_path,1), in check_after_balance_leaf() 1419 int left = B_FREE_SPACE (PATH_H_PBUFFER(tb->tb_path,0)); in check_after_balance_leaf() 1420 int right = (MAX_CHILD_SIZE (PATH_H_PBUFFER(tb->tb_path,0)) - in check_after_balance_leaf() 1421 dc_size(B_N_CHILD (PATH_H_PBUFFER(tb->tb_path,1), in check_after_balance_leaf() 1428 MAX_CHILD_SIZE (PATH_H_PBUFFER(tb->tb_path,0)), in check_after_balance_leaf() 1429 PATH_H_PBUFFER(tb->tb_path,1), in check_after_balance_leaf() 1431 dc_size(B_N_CHILD (PATH_H_PBUFFER(tb->tb_path,1), PATH_H_POSITION (tb->tb_path, 1 )) ), in check_after_balance_leaf() [all …]
|
D | fix_node.c | 87 Sh = PATH_H_PBUFFER (tb->tb_path, h); in create_virtual_node() 390 max_node_size = MAX_CHILD_SIZE (PATH_H_PBUFFER (tb->tb_path, h)); in get_num_ver() 636 S0 = PATH_H_PBUFFER (tb->tb_path, 0); in are_leaves_removable() 760 * p_s_Sh = PATH_H_PBUFFER (p_s_tb->tb_path, n_h); in get_empty_nodes() 906 p_s_father = PATH_H_PBUFFER(p_s_tb->tb_path, n_h + 1); in is_left_neighbor_in_cache() 1120 if ( n_position == B_NR_ITEMS (PATH_H_PBUFFER(p_s_path, n_h + 1)) ) { in get_parents() 1154 struct buffer_head * Sh = PATH_H_PBUFFER (tb->tb_path, h); in can_node_be_removed() 1238 Sh = PATH_H_PBUFFER (tb->tb_path, h); in ip_check_balance() 1540 Sh = PATH_H_PBUFFER (tb->tb_path, h); in dc_check_balance_internal() 1710 S0 = PATH_H_PBUFFER (tb->tb_path, 0); in dc_check_balance_leaf() [all …]
|
D | prints.c | 374 bh = PATH_H_PBUFFER (path, h); in print_path() 609 tbSh = PATH_H_PBUFFER (tb->tb_path, h); in store_print_tb()
|
/linux-2.4.37.9/include/linux/ |
D | reiserfs_fs.h | 1271 #define PATH_H_PBUFFER(p_s_path, h) PATH_OFFSET_PBUFFER (p_s_path, p_s_path->path_length - (h)) /* … macro 1272 #define PATH_H_PPARENT(path, h) PATH_H_PBUFFER (path, (h) + 1) /* tb->F[h] or tb->S[0]->b_parent …
|