rfree             696 fs/reiserfs/fix_node.c static int are_leaves_removable(struct tree_balance *tb, int lfree, int rfree)
rfree             748 fs/reiserfs/fix_node.c 	if (MAX_CHILD_SIZE(S0) + vn->vn_size <= rfree + lfree + ih_size) {
rfree            1273 fs/reiserfs/fix_node.c static inline int can_node_be_removed(int mode, int lfree, int sfree, int rfree,
rfree            1285 fs/reiserfs/fix_node.c 	if (lfree + rfree + sfree < MAX_CHILD_SIZE(Sh) + levbytes
rfree            1336 fs/reiserfs/fix_node.c 	int lfree, sfree, rfree /* free space in L, S and R */ ;
rfree            1404 fs/reiserfs/fix_node.c 	rfree = get_rfree(tb, h);
rfree            1408 fs/reiserfs/fix_node.c 	if (can_node_be_removed(vn->vn_mode, lfree, sfree, rfree, tb, h) ==
rfree            1428 fs/reiserfs/fix_node.c 	check_right(tb, h, rfree);
rfree            1736 fs/reiserfs/fix_node.c 	int lfree, rfree /* free space in L and R */ ;
rfree            1768 fs/reiserfs/fix_node.c 	rfree = get_rfree(tb, h);
rfree            1773 fs/reiserfs/fix_node.c 	check_right(tb, h, rfree);
rfree            1945 fs/reiserfs/fix_node.c 	int lfree, rfree /* free space in L and R */ ;
rfree            1967 fs/reiserfs/fix_node.c 	rfree = get_rfree(tb, h);
rfree            1973 fs/reiserfs/fix_node.c 	if (are_leaves_removable(tb, lfree, rfree))
rfree            1983 fs/reiserfs/fix_node.c 	check_right(tb, h, rfree);