85 			     struct scan_data *data)  in scan_for_dirty_cb()  argument
96 	if (lprops->free + lprops->dirty < data->min_space)  in scan_for_dirty_cb()
99 	if (data->exclude_index && lprops->flags & LPROPS_INDEX)  in scan_for_dirty_cb()
103 		if (!data->pick_free)  in scan_for_dirty_cb()
109 	data->lnum = lprops->lnum;  in scan_for_dirty_cb()
130 	struct scan_data data;  in scan_for_dirty()  local
165 	data.min_space = min_space;  in scan_for_dirty()
166 	data.pick_free = pick_free;  in scan_for_dirty()
167 	data.lnum = -1;  in scan_for_dirty()
168 	data.exclude_index = exclude_index;  in scan_for_dirty()
171 				    &data);  in scan_for_dirty()
174 	ubifs_assert(c, data.lnum >= c->main_first && data.lnum < c->leb_cnt);  in scan_for_dirty()
175 	c->lscan_lnum = data.lnum;  in scan_for_dirty()
176 	lprops = ubifs_lpt_lookup_dirty(c, data.lnum);  in scan_for_dirty()
179 	ubifs_assert(c, lprops->lnum == data.lnum);  in scan_for_dirty()
352 			    struct scan_data *data)  in scan_for_free_cb()  argument
366 	if (lprops->free < data->min_space)  in scan_for_free_cb()
369 	if (!data->pick_free && lprops->free == c->leb_size)  in scan_for_free_cb()
380 	data->lnum = lprops->lnum;  in scan_for_free_cb()
401 	struct scan_data data;  in do_find_free_space()  local
445 	data.min_space = min_space;  in do_find_free_space()
446 	data.pick_free = pick_free;  in do_find_free_space()
447 	data.lnum = -1;  in do_find_free_space()
450 				    &data);  in do_find_free_space()
453 	ubifs_assert(c, data.lnum >= c->main_first && data.lnum < c->leb_cnt);  in do_find_free_space()
454 	c->lscan_lnum = data.lnum;  in do_find_free_space()
455 	lprops = ubifs_lpt_lookup_dirty(c, data.lnum);  in do_find_free_space()
458 	ubifs_assert(c, lprops->lnum == data.lnum);  in do_find_free_space()
592 			   struct scan_data *data)  in scan_for_idx_cb()  argument
613 	data->lnum = lprops->lnum;  in scan_for_idx_cb()
624 	struct scan_data data;  in scan_for_leb_for_idx()  local
627 	data.lnum = -1;  in scan_for_leb_for_idx()
630 				    &data);  in scan_for_leb_for_idx()
633 	ubifs_assert(c, data.lnum >= c->main_first && data.lnum < c->leb_cnt);  in scan_for_leb_for_idx()
634 	c->lscan_lnum = data.lnum;  in scan_for_leb_for_idx()
635 	lprops = ubifs_lpt_lookup_dirty(c, data.lnum);  in scan_for_leb_for_idx()
638 	ubifs_assert(c, lprops->lnum == data.lnum);  in scan_for_leb_for_idx()
785 			   struct scan_data *data)  in scan_dirty_idx_cb()  argument
802 	data->lnum = lprops->lnum;  in scan_dirty_idx_cb()
820 	struct scan_data data;  in find_dirty_idx_leb()  local
824 	data.lnum = -1;  in find_dirty_idx_leb()
828 		ret = scan_dirty_idx_cb(c, lprops, 1, &data);  in find_dirty_idx_leb()
833 		ret = scan_dirty_idx_cb(c, lprops, 1, &data);  in find_dirty_idx_leb()
838 		ret = scan_dirty_idx_cb(c, lprops, 1, &data);  in find_dirty_idx_leb()
847 				    &data);  in find_dirty_idx_leb()
851 	ubifs_assert(c, data.lnum >= c->main_first && data.lnum < c->leb_cnt);  in find_dirty_idx_leb()
852 	c->lscan_lnum = data.lnum;  in find_dirty_idx_leb()
853 	lprops = ubifs_lpt_lookup_dirty(c, data.lnum);  in find_dirty_idx_leb()
856 	ubifs_assert(c, lprops->lnum == data.lnum);  in find_dirty_idx_leb()