lfree 696 fs/reiserfs/fix_node.c static int are_leaves_removable(struct tree_balance *tb, int lfree, int rfree) lfree 748 fs/reiserfs/fix_node.c if (MAX_CHILD_SIZE(S0) + vn->vn_size <= rfree + lfree + ih_size) { lfree 1273 fs/reiserfs/fix_node.c static inline int can_node_be_removed(int mode, int lfree, int sfree, int rfree, lfree 1285 fs/reiserfs/fix_node.c if (lfree + rfree + sfree < MAX_CHILD_SIZE(Sh) + levbytes lfree 1336 fs/reiserfs/fix_node.c int lfree, sfree, rfree /* free space in L, S and R */ ; lfree 1405 fs/reiserfs/fix_node.c lfree = get_lfree(tb, h); lfree 1408 fs/reiserfs/fix_node.c if (can_node_be_removed(vn->vn_mode, lfree, sfree, rfree, tb, h) == lfree 1420 fs/reiserfs/fix_node.c check_left(tb, h, lfree); lfree 1736 fs/reiserfs/fix_node.c int lfree, rfree /* free space in L and R */ ; lfree 1769 fs/reiserfs/fix_node.c lfree = get_lfree(tb, h); lfree 1772 fs/reiserfs/fix_node.c check_left(tb, h, lfree); lfree 1945 fs/reiserfs/fix_node.c int lfree, rfree /* free space in L and R */ ; lfree 1968 fs/reiserfs/fix_node.c lfree = get_lfree(tb, h); lfree 1973 fs/reiserfs/fix_node.c if (are_leaves_removable(tb, lfree, rfree)) lfree 1982 fs/reiserfs/fix_node.c check_left(tb, h, lfree);