Lines Matching full:bins

98  * The list is in ascending order of free space. Since all bins are already in the list, this
105 	list_for_each_entry(active_bin, &packer->bins, list)  in insert_in_sorted_list()
111 	list_move_tail(&bin->list, &packer->bins);  in insert_in_sorted_list()
130 	list_add_tail(&bin->list, &packer->bins);  in make_bin()
138  * @bin_count: The number of partial bins to keep in memory.
155 	INIT_LIST_HEAD(&packer->bins);  in vdo_make_packer()
199 	list_for_each_entry_safe(bin, tmp, &packer->bins, list) {  in vdo_free_packer()
533 	list_for_each_entry(bin, &packer->bins, list) {  in select_bin()
539 	 * None of the bins have enough space for the data_vio. We're not allowed to create new  in select_bin()
540 	 * bins, so we have to overflow one of the existing bins. It's pretty intuitive to select  in select_bin()
546 	fullest_bin = list_first_entry(&packer->bins, struct packer_bin, list);  in select_bin()
625  * write_all_non_empty_bins() - Write out all non-empty bins on behalf of a flush or suspend.
632 	list_for_each_entry(bin, &packer->bins, list)  in write_all_non_empty_bins()
646  * All bins with at least two compressed data blocks will be written out, and any solitary pending
748 		/* Don't dump empty bins. */  in dump_packer_bin()
776 	list_for_each_entry(bin, &packer->bins, list)  in vdo_dump_packer()