Lines Matching defs:next
1471 * next node from which to allocate, handling wrap at end of node
1490 * next node id whether or not we find a free huge page to free so
1491 * that the next attempt to free addresses the next node.
1829 node = node->next;
2255 * Remove huge page from pool from next node to free. Attempt to keep
2277 page = list_entry(h->hugepage_freelists[node].next,
3190 /* allocate from next node when distributing huge pages */
3401 struct page *page, *next;
3403 list_for_each_entry_safe(page, next, freel, lru) {
4418 /* Go to parse next node*/
6269 * here we just wait to defer the next page fault to avoid busy loop and