fs/ubifs/budget.c

190  * @min_idx_lebs: minimum number of LEBs reserved for the index
194 long long ubifs_calc_available(const struct ubifs_info *c, int min_idx_lebs)
206 	subtract_lebs = min_idx_lebs;
235 	 * @min_idx_lebs. Those extra LEBs are assumed to be available, but
239 	if (c->lst.idx_lebs > min_idx_lebs) {
240 		subtract_lebs = c->lst.idx_lebs - min_idx_lebs;
279  * Notes about @c->bi.min_idx_lebs and @c->lst.idx_lebs variables:
284  * o @c->bi.min_idx_lebs is the number of LEBS the index presumably takes. IOW,
285  *    the index may be consolidated to take up to @c->bi.min_idx_lebs LEBs.
293 	int lebs, rsvd_idx_lebs, min_idx_lebs;
296 	min_idx_lebs = ubifs_calc_min_idx_lebs(c);
298 	/* Now 'min_idx_lebs' contains number of LEBs to reserve */
299 	if (min_idx_lebs > c->lst.idx_lebs)
300 		rsvd_idx_lebs = min_idx_lebs - c->lst.idx_lebs;
329 		dbg_budg("out of indexing space: min_idx_lebs %d (old %d), rsvd_idx_lebs %d",
330 			 min_idx_lebs, c->bi.min_idx_lebs, rsvd_idx_lebs);
334 	available = ubifs_calc_available(c, min_idx_lebs);
346 	c->bi.min_idx_lebs = min_idx_lebs;
546 	c->bi.min_idx_lebs = ubifs_calc_min_idx_lebs(c);
551 	ubifs_assert(c, c->bi.min_idx_lebs < c->main_lebs);
577 	c->bi.min_idx_lebs = ubifs_calc_min_idx_lebs(c);
667 	ubifs_assert(c, c->bi.min_idx_lebs == ubifs_calc_min_idx_lebs(c));
669 	available = ubifs_calc_available(c, c->bi.min_idx_lebs);
682 	if (c->bi.min_idx_lebs > c->lst.idx_lebs)
683 		rsvd_idx_lebs = c->bi.min_idx_lebs - c->lst.idx_lebs;