Lines Matching defs:lfree
655 static int are_leaves_removable(struct tree_balance *tb, int lfree, int rfree)
702 if (MAX_CHILD_SIZE(S0) + vn->vn_size <= rfree + lfree + ih_size) {
1160 static inline int can_node_be_removed(int mode, int lfree, int sfree, int rfree,
1172 if (lfree + rfree + sfree < MAX_CHILD_SIZE(Sh) + levbytes
1219 int lfree, sfree, rfree /* free space in L, S and R */ ;
1278 lfree = get_lfree(tb, h);
1280 if (can_node_be_removed(vn->vn_mode, lfree, sfree, rfree, tb, h) ==
1292 check_left(tb, h, lfree);
1560 int lfree, rfree /* free space in L and R */ ;
1589 lfree = get_lfree(tb, h);
1592 check_left(tb, h, lfree);
1746 int lfree, rfree /* free space in L and R */ ;
1769 lfree = get_lfree(tb, h);
1774 if (are_leaves_removable(tb, lfree, rfree))
1781 check_left(tb, h, lfree);