Home
last modified time | relevance | path

Searched refs:folioq (Results 1 – 4 of 4) sorted by relevance

/include/linux/
A Dfolio_queue.h55 folio_batch_init(&folioq->vec); in folioq_init()
56 folioq->next = NULL; in folioq_init()
57 folioq->prev = NULL; in folioq_init()
58 folioq->marks = 0; in folioq_init()
59 folioq->marks2 = 0; in folioq_init()
60 folioq->rreq_id = rreq_id; in folioq_init()
61 folioq->debug_id = 0; in folioq_init()
98 return folioq_count(folioq) >= folioq_nr_slots(folioq); in folioq_full()
220 folioq_mark(folioq, slot); in folioq_append_mark()
250 return folioq->orders[slot]; in folioq_folio_order()
[all …]
A Diov_iter.h151 const struct folio_queue *folioq = iter->folioq; in iterate_folioq() local
155 if (slot == folioq_nr_slots(folioq)) { in iterate_folioq()
157 folioq = folioq->next; in iterate_folioq()
162 struct folio *folio = folioq_folio(folioq, slot); in iterate_folioq()
170 fsize = folioq_folio_size(folioq, slot); in iterate_folioq()
182 if (slot == folioq_nr_slots(folioq) && folioq->next) { in iterate_folioq()
183 folioq = folioq->next; in iterate_folioq()
192 iter->folioq = folioq; in iterate_folioq()
A Duio.h71 const struct folio_queue *folioq; member
301 const struct folio_queue *folioq,
A Dnetfs.h457 void netfs_folioq_free(struct folio_queue *folioq,

Completed in 152 milliseconds