fs/ubifs/find.c

22  * @min_space: minimum number of bytes for which to scan
28 	int min_space;
97 	if (lprops->free + lprops->dirty < data->min_space)
117  * @min_space: minimum amount free plus dirty space the returned LEB has to
126 						 int min_space, int pick_free,
138 		if (lprops->free + lprops->dirty < min_space)
154 		if (lprops->free + lprops->dirty < min_space)
166 	data.min_space = min_space;
180 	ubifs_assert(c, lprops->free + lprops->dirty >= min_space);
193  * @min_space: minimum amount free plus dirty space the returned LEB has to
198  * @min_space free and dirty space. It prefers to take an LEB from the dirty or
200  * or do not have an LEB which satisfies the @min_space criteria.
222 			 int min_space, int pick_free)
288 		if (sum < min_space || sum < c->half_leb_size)
294 		if (lp->dirty + lp->free < min_space)
312 	lp = scan_for_dirty(c, min_space, pick_free, exclude_index);
367 	if (lprops->free < data->min_space)
388  * @min_space: minimum amount of free space required
397 					      int min_space, int pick_free,
407 		if (lprops && lprops->free >= min_space)
417 		if (lprops && lprops->free >= min_space)
424 		if (lprops->free >= min_space)
439 		if (lprops->free >= min_space)
446 	data.min_space = min_space;
460 	ubifs_assert(c, lprops->free >= min_space);
469  * @min_space: minimum amount of required free space
473  * This function looks for an LEB with at least @min_space bytes of free space.
479  * failed to find a LEB with @min_space bytes of free space and other a negative
482 int ubifs_find_free_space(struct ubifs_info *c, int min_space, int *offs,
488 	dbg_find("min_space %d", min_space);
529 	lprops = do_find_free_space(c, min_space, pick_free, squeeze);
566 	ubifs_assert(c, *offs <= c->leb_size - min_space);