Home
last modified time | relevance | path

Searched refs:FL (Results 1 – 6 of 6) sorted by relevance

/fs/reiserfs/
Dfix_node.c808 brelse(tb->FL[i]); in free_buffers_in_tb()
815 tb->FL[i] = NULL; in free_buffers_in_tb()
923 (l = tb->FL[h]) == NULL) in get_lfree()
969 if (!tb->FL[h]) in is_left_neighbor_in_cache()
977 !B_IS_IN_TREE(tb->FL[h]) || in is_left_neighbor_in_cache()
979 !buffer_uptodate(tb->FL[h]), in is_left_neighbor_in_cache()
981 father, tb->FL[h]); in is_left_neighbor_in_cache()
987 left_neighbor_position = (father == tb->FL[h]) ? in is_left_neighbor_in_cache()
988 tb->lkey[h] : B_NR_ITEMS(tb->FL[h]); in is_left_neighbor_in_cache()
991 B_N_CHILD_NUM(tb->FL[h], left_neighbor_position); in is_left_neighbor_in_cache()
[all …]
Dibalance.c47 dest_bi->bi_parent = tb->FL[h]; in internal_define_dest_src_infos()
55 src_bi->bi_parent = tb->FL[h]; in internal_define_dest_src_infos()
96 dest_bi->bi_parent = tb->FL[h]; in internal_define_dest_src_infos()
873 bi.bi_parent = tb->FL[h]; in balance_internal()
894 bi.bi_parent = tb->FL[h]; in balance_internal()
Ddo_balan.c24 bi->bi_parent = tb->FL[0]; in buffer_info_init_left()
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()
1599 return B_NR_ITEMS(tb->FL[h]); in get_left_neighbor_position()
1676 retval |= locked_or_not_in_tree(tb, tb->FL[0], "FL[0]"); in check_before_balancing()
1699 (tb->FL[0], get_left_neighbor_position(tb, 0)))) { in check_after_balance_leaf()
Dprints.c661 (tb->FL[h]) ? (long long)(tb->FL[h]-> in store_print_tb()
Dlbalance.c649 dest_bi->bi_parent = tb->FL[0]; in leaf_define_dest_src_infos()
673 dest_bi->bi_parent = tb->FL[0]; in leaf_define_dest_src_infos()
681 src_bi->bi_parent = tb->FL[0]; in leaf_define_dest_src_infos()
Dreiserfs.h2417 struct buffer_head *FL[MAX_HEIGHT]; member