lebs              297 fs/ubifs/budget.c 	int lebs, rsvd_idx_lebs, min_idx_lebs;
lebs              330 fs/ubifs/budget.c 	lebs = c->lst.empty_lebs + c->freeable_cnt + c->idx_gc_cnt -
lebs              332 fs/ubifs/budget.c 	if (unlikely(rsvd_idx_lebs > lebs)) {
lebs              668 fs/ubifs/budget.c 	int rsvd_idx_lebs, lebs;
lebs              690 fs/ubifs/budget.c 	lebs = c->lst.empty_lebs + c->freeable_cnt + c->idx_gc_cnt -
lebs              692 fs/ubifs/budget.c 	lebs -= rsvd_idx_lebs;
lebs              693 fs/ubifs/budget.c 	available += lebs * (c->dark_wm - c->leb_overhead);
lebs              231 fs/ubifs/find.c 		int lebs, rsvd_idx_lebs = 0;
lebs              234 fs/ubifs/find.c 		lebs = c->lst.empty_lebs + c->idx_gc_cnt;
lebs              235 fs/ubifs/find.c 		lebs += c->freeable_cnt - c->lst.taken_empty_lebs;
lebs              250 fs/ubifs/find.c 		if (rsvd_idx_lebs < lebs) {
lebs              485 fs/ubifs/find.c 	int lebs, rsvd_idx_lebs, pick_free = 0, err, lnum, flags;
lebs              496 fs/ubifs/find.c 	lebs = c->lst.empty_lebs + c->freeable_cnt + c->idx_gc_cnt -
lebs              498 fs/ubifs/find.c 	if (rsvd_idx_lebs < lebs)