Lines Matching defs:min_idx_lebs
205 * @min_idx_lebs: minimum number of LEBs reserved for the index
209 long long ubifs_calc_available(const struct ubifs_info *c, int min_idx_lebs)
221 subtract_lebs = min_idx_lebs;
251 * @min_idx_lebs. Those extra LEBs are assumed to be available, but
255 if (c->lst.idx_lebs > min_idx_lebs) {
256 subtract_lebs = c->lst.idx_lebs - min_idx_lebs;
295 * Notes about @c->min_idx_lebs and @c->lst.idx_lebs variables:
300 * o @c->min_idx_lebs is the number of LEBS the index presumably takes. IOW,
301 * the index may be consolidated to take up to @c->min_idx_lebs LEBs.
309 int lebs, rsvd_idx_lebs, min_idx_lebs;
312 min_idx_lebs = ubifs_calc_min_idx_lebs(c);
314 /* Now 'min_idx_lebs' contains number of LEBs to reserve */
315 if (min_idx_lebs > c->lst.idx_lebs)
316 rsvd_idx_lebs = min_idx_lebs - c->lst.idx_lebs;
345 dbg_budg("out of indexing space: min_idx_lebs %d (old %d), "
346 "rsvd_idx_lebs %d", min_idx_lebs, c->min_idx_lebs,
351 available = ubifs_calc_available(c, min_idx_lebs);
363 c->min_idx_lebs = min_idx_lebs;
564 c->min_idx_lebs = ubifs_calc_min_idx_lebs(c);
569 ubifs_assert(c->min_idx_lebs < c->main_lebs);
595 c->min_idx_lebs = ubifs_calc_min_idx_lebs(c);
685 ubifs_assert(c->min_idx_lebs == ubifs_calc_min_idx_lebs(c));
687 available = ubifs_calc_available(c, c->min_idx_lebs);
700 if (c->min_idx_lebs > c->lst.idx_lebs)
701 rsvd_idx_lebs = c->min_idx_lebs - c->lst.idx_lebs;