Lines Matching defs:min_space
34 * @min_space: minimum number of bytes for which to scan
40 int min_space;
108 if (lprops->free + lprops->dirty < data->min_space)
128 * @min_space: minimum amount free plus dirty space the returned LEB has to
137 int min_space, int pick_free,
149 if (lprops->free + lprops->dirty < min_space)
165 if (lprops->free + lprops->dirty < min_space)
177 data.min_space = min_space;
192 ubifs_assert(lprops->free + lprops->dirty >= min_space);
205 * @min_space: minimum amount free plus dirty space the returned LEB has to
210 * @min_space free and dirty space. It prefers to take an LEB from the dirty or
212 * or do not have an LEB which satisfies the @min_space criteria.
234 int min_space, int pick_free)
300 if (sum < min_space || sum < c->half_leb_size)
306 if (lp->dirty + lp->free < min_space)
324 lp = scan_for_dirty(c, min_space, pick_free, exclude_index);
378 if (lprops->free < data->min_space)
399 * @min_space: minimum amount of free space required
408 int min_space, int pick_free,
418 if (lprops && lprops->free >= min_space)
428 if (lprops && lprops->free >= min_space)
435 if (lprops->free >= min_space)
450 if (lprops->free >= min_space)
457 data.min_space = min_space;
471 ubifs_assert(lprops->free >= min_space);
480 * @min_space: minimum amount of required free space
484 * This function looks for an LEB with at least @min_space bytes of free space.
490 * failed to find a LEB with @min_space bytes of free space and other a negative
493 int ubifs_find_free_space(struct ubifs_info *c, int min_space, int *offs,
499 dbg_find("min_space %d", min_space);
540 lprops = do_find_free_space(c, min_space, pick_free, squeeze);
577 ubifs_assert(*offs <= c->leb_size - min_space);