Lines Matching full:folios

165 		struct folio *folio = fbatch->folios[i];
375 		struct folio *batch_folio = fbatch->folios[i];
625 	 * Lazyfree folios are clean anonymous folios.  They have
627 	 * anonymous folios
901  * a list of folios to be migrated using folio_isolate_lru().
902  * It drains folios on LRU cache and then disable on all cpus until
932  * folios_put_refs - Reduce the reference count on a batch of folios.
933  * @folios: The folios.
936  * Like folio_put(), but for a batch of folios.  This is more efficient
938  * to be taken if the folios are freed.  The folios batch is returned
946 void folios_put_refs(struct folio_batch *folios, unsigned int *refs)
952 	for (i = 0, j = 0; i < folios->nr; i++) {
953 		struct folio *folio = folios->folios[i];
985 			folios->folios[j] = folio;
991 		folio_batch_reinit(folios);
995 	folios->nr = j;
996 	mem_cgroup_uncharge_folios(folios);
997 	free_unref_folios(folios);
1042  * The folios which we're about to release may be in the deferred lru-addition
1044  * OK from a correctness point of view but is inefficient - those folios may be
1062  * folio_batch_remove_exceptionals() - Prune non-folios from a batch.
1065  * find_get_entries() fills a batch with both folios and shadow/swap/DAX
1075 		struct folio *folio = fbatch->folios[i];
1077 			fbatch->folios[j++] = folio;