Lines Matching defs:min_idx_lebs
193 * @min_idx_lebs: minimum number of LEBs reserved for the index
197 long long ubifs_calc_available(const struct ubifs_info *c, int min_idx_lebs)
209 subtract_lebs = min_idx_lebs;
238 * @min_idx_lebs. Those extra LEBs are assumed to be available, but
242 if (c->lst.idx_lebs > min_idx_lebs) {
243 subtract_lebs = c->lst.idx_lebs - min_idx_lebs;
282 * Notes about @c->bi.min_idx_lebs and @c->lst.idx_lebs variables:
287 * o @c->bi.min_idx_lebs is the number of LEBS the index presumably takes. IOW,
288 * the index may be consolidated to take up to @c->bi.min_idx_lebs LEBs.
296 int lebs, rsvd_idx_lebs, min_idx_lebs;
299 min_idx_lebs = ubifs_calc_min_idx_lebs(c);
301 /* Now 'min_idx_lebs' contains number of LEBs to reserve */
302 if (min_idx_lebs > c->lst.idx_lebs)
303 rsvd_idx_lebs = min_idx_lebs - c->lst.idx_lebs;
332 dbg_budg("out of indexing space: min_idx_lebs %d (old %d), rsvd_idx_lebs %d",
333 min_idx_lebs, c->bi.min_idx_lebs, rsvd_idx_lebs);
337 available = ubifs_calc_available(c, min_idx_lebs);
349 c->bi.min_idx_lebs = min_idx_lebs;
549 c->bi.min_idx_lebs = ubifs_calc_min_idx_lebs(c);
554 ubifs_assert(c, c->bi.min_idx_lebs < c->main_lebs);
580 c->bi.min_idx_lebs = ubifs_calc_min_idx_lebs(c);
670 ubifs_assert(c, c->bi.min_idx_lebs == ubifs_calc_min_idx_lebs(c));
672 available = ubifs_calc_available(c, c->bi.min_idx_lebs);
685 if (c->bi.min_idx_lebs > c->lst.idx_lebs)
686 rsvd_idx_lebs = c->bi.min_idx_lebs - c->lst.idx_lebs;