Lines Matching refs:available
112 * as not available);
181 * The index head is not available for the in-the-gaps method, so add an
191 * ubifs_calc_available - calculate available FS space.
195 * This function calculates and returns amount of FS space available for use.
200 long long available;
202 available = c->main_bytes - c->lst.total_used;
205 * Now 'available' contains theoretically available flash space
223 available -= (long long)subtract_lebs * c->leb_size;
225 /* Subtract the dead space which is not available for use */
226 available -= c->lst.total_dead;
234 available -= c->lst.total_dark;
238 * @min_idx_lebs. Those extra LEBs are assumed to be available, but
244 available -= subtract_lebs * c->dark_wm;
248 return available > 0 ? available : 0;
295 long long outstanding, available;
308 * The number of LEBs that are available to be used by the index is:
313 * @c->lst.empty_lebs are available because they are empty.
314 * @c->freeable_cnt are available because they contain only free and
315 * dirty space, @c->idx_gc_cnt are available because they are index
337 available = ubifs_calc_available(c, min_idx_lebs);
340 if (unlikely(available < outstanding)) {
341 dbg_budg("out of data space: available %lld, outstanding %lld",
342 available, outstanding);
346 if (available - outstanding <= c->rp_size && !can_use_rp(c))
611 * (e.g., via the 'statfs()' call) reports that it has N bytes available, they
668 long long available, outstanding, free;
672 available = ubifs_calc_available(c, c->bi.min_idx_lebs);
680 * Thus, amend the available space.
692 available += lebs * (c->dark_wm - c->leb_overhead);
694 if (available > outstanding)
695 free = ubifs_reported_space(c, available - outstanding);