Lines Matching refs:list
35 /* simple list based uncached page pool
37 * - Use page->lru to keep a free list
62 * @list: Pool of free uc/wc pages for fast reuse.
70 struct pglist list;
377 TAILQ_FOREACH_REVERSE_SAFE(p, &pool->list, pglist, plinks.q, p1) {
386 TAILQ_REMOVE(&pool->list, pages_to_free[i], plinks.q);
422 TAILQ_REMOVE(&pool->list, pages_to_free[i], plinks.q);
640 TAILQ_CONCAT(&pool->list, &new_pages, plinks.q);
646 TAILQ_FOREACH(p, &pool->list, plinks.q) {
649 TAILQ_CONCAT(&pool->list, &new_pages, plinks.q);
658 * Cut 'count' number of pages from the pool and put them on the return list.
676 TAILQ_CONCAT(pages, &pool->list, plinks.q);
682 p = TAILQ_FIRST(&pool->list);
683 TAILQ_REMOVE(&pool->list, p, plinks.q);
693 /* Put all pages in pages list to correct pool to wait for reuse */
714 TAILQ_INSERT_TAIL(&pool->list, pages[i], plinks.q);
734 * On success pages list will hold count number of correctly
790 /* If there is any pages in the list put them back to
806 TAILQ_INIT(&pool->list);