Lines Matching defs:next
1200 * next node from which to allocate, handling wrap at end of node
1219 * next node id whether or not we find a free huge page to free so
1220 * that the next attempt to free addresses the next node.
1534 node = node->next;
1764 * Free huge page from pool from next node to free.
1783 list_entry(h->hugepage_freelists[node].next,
2614 struct page *page, *next;
2616 list_for_each_entry_safe(page, next, freel, lru) {
4701 * here we just wait to defer the next page fault to avoid busy loop and