Searched refs:lru (Results 1 - 25 of 31) sorted by relevance

12

/drivers/staging/android/ion/
H A Dion_page_pool.c51 list_add_tail(&page->lru, &pool->high_items);
54 list_add_tail(&page->lru, &pool->low_items);
67 page = list_first_entry(&pool->high_items, struct page, lru);
71 page = list_first_entry(&pool->low_items, struct page, lru);
75 list_del(&page->lru);
H A Dion_system_heap.c150 list_add_tail(&page->lru, &pages);
163 list_for_each_entry_safe(page, tmp_page, &pages, lru) {
166 list_del(&page->lru);
175 list_for_each_entry_safe(page, tmp_page, &pages, lru)
/drivers/misc/
H A Dvmw_balloon.c374 list_for_each_entry_safe(page, next, &b->pages, lru) {
375 list_del(&page->lru);
449 list_add(&page->lru, &b->refused_pages);
456 list_add(&page->lru, &b->pages);
474 list_del(&page->lru);
494 list_for_each_entry_safe(page, next, &b->refused_pages, lru) {
495 list_del(&page->lru);
631 list_for_each_entry_safe(page, next, &b->pages, lru) {
/drivers/xen/
H A Dballoon.c122 list_add_tail(&page->lru, &ballooned_pages);
125 list_add(&page->lru, &ballooned_pages);
145 page = list_entry(ballooned_pages.prev, struct page, lru);
147 page = list_entry(ballooned_pages.next, struct page, lru);
148 list_del(&page->lru);
162 struct list_head *next = page->lru.next;
165 return list_entry(next, struct page, lru);
327 page = list_first_entry_or_null(&ballooned_pages, struct page, lru);
H A Dprivcmd.c71 list_for_each_entry_safe(p, n, pages, lru)
106 list_add_tail(&page->lru, pagelist);
146 page = list_entry(pos, struct page, lru);
223 struct page, lru);
H A Dxen-scsiback.c235 list_add(&page[i]->lru, &scsiback_free_pages);
249 page[0] = list_first_entry(&scsiback_free_pages, struct page, lru);
250 list_del(&page[0]->lru);
/drivers/video/fbdev/core/
H A Dfb_defio.c128 list_for_each_entry(cur, &fbdefio->pagelist, lru) {
140 list_add_tail(&page->lru, &cur->lru);
187 list_for_each_entry(cur, &fbdefio->pagelist, lru) {
/drivers/gpu/drm/ttm/
H A Dttm_page_alloc.c30 * - Use page->lru to keep a free list
323 list_for_each_entry_reverse(p, &pool->list, lru) {
331 __list_del(p->lru.prev, &pool->list);
366 __list_del(&p->lru, &pool->list);
478 list_del(&failed_pages[i]->lru);
549 list_add(&p->lru, pages);
611 list_for_each_entry(p, &pool->list, lru) {
697 list_add_tail(&pages[i]->lru, &pool->list);
761 list_for_each_entry(p, &plist, lru) {
767 list_for_each_entry(p, &plist, lru) {
[all...]
H A Dttm_bo.c147 BUG_ON(!list_empty(&bo->lru));
173 BUG_ON(!list_empty(&bo->lru));
176 list_add_tail(&bo->lru, &man->lru);
195 if (!list_empty(&bo->lru)) {
196 list_del_init(&bo->lru);
472 * If bo idle, remove from delayed- and lru lists, and unref.
722 list_for_each_entry(bo, &man->lru, lru) {
1118 INIT_LIST_HEAD(&bo->lru);
[all...]
H A Dttm_bo_util.c462 INIT_LIST_HEAD(&fbo->lru);
/drivers/md/
H A Ddm-bufio.c77 * are linked to lru[LIST_CLEAN] with their lru_list field.
80 * lru[LIST_DIRTY] with their lru_list field. When the write
84 * dirty_lru too. They are later added to lru in the process
90 struct list_head lru[LIST_SIZE]; member in struct:dm_bufio_client
436 list_add(&b->lru_list, &c->lru[dirty]);
467 list_move(&b->lru_list, &c->lru[dirty]);
681 list_for_each_entry_reverse(b, &c->lru[LIST_CLEAN], lru_list) {
693 list_for_each_entry_reverse(b, &c->lru[LIST_DIRTY], lru_list) {
820 list_for_each_entry_safe_reverse(b, tmp, &c->lru[LIST_DIRTY], lru_list) {
1188 list_for_each_entry_safe_reverse(b, tmp, &c->lru[LIST_DIRT
[all...]
H A Draid5.h199 struct list_head lru; /* inactive_list or handle_list */ member in struct:stripe_head
H A Draid5.c261 if (list_empty(&sh->lru)) {
264 list_add_tail(&sh->lru, &group->handle_list);
295 BUG_ON(!list_empty(&sh->lru));
300 list_add_tail(&sh->lru, &conf->delayed_list);
306 list_add_tail(&sh->lru, &conf->bitmap_list);
311 list_add_tail(&sh->lru, &conf->handle_list);
326 list_add_tail(&sh->lru, temp_inactive_list);
475 sh = list_entry(first, struct stripe_head, lru);
697 BUG_ON(list_empty(&sh->lru) &&
699 list_del_init(&sh->lru);
[all...]
/drivers/staging/android/
H A Dashmem.c63 * @lru: The entry in the LRU list
74 struct list_head lru; member in struct:ashmem_range
135 list_add_tail(&range->lru, &ashmem_lru_list);
148 list_del(&range->lru);
439 list_for_each_entry_safe(range, next, &ashmem_lru_list, lru) {
461 * note that lru_count is count of pages on the lru, not a count of
/drivers/block/
H A Dxen-blkfront.c504 struct page, lru);
505 list_del(&indirect_page->lru);
961 list_for_each_entry_safe(indirect_page, n, &info->indirect_pages, lru) {
962 list_del(&indirect_page->lru);
1103 list_add(&indirect_page->lru, &info->indirect_pages);
1698 list_add(&indirect_page->lru, &info->indirect_pages);
1734 list_for_each_entry_safe(indirect_page, n, &info->indirect_pages, lru) {
1735 list_del(&indirect_page->lru);
/drivers/block/xen-blkback/
H A Dblkback.c117 page[0] = list_first_entry(&blkif->free_pages, struct page, lru);
118 list_del(&page[0]->lru);
133 list_add(&page[i]->lru, &blkif->free_pages);
149 struct page, lru);
150 list_del(&page[num_pages]->lru);
/drivers/md/bcache/
H A Dbcache.h298 struct list_head lru; member in struct:io
536 * Lists of struct btrees; lru is the list for structs that have memory
H A Drequest.c412 i = list_first_entry(&dc->io_lru, struct io, lru);
426 list_move_tail(&i->lru, &dc->io_lru);
/drivers/staging/lustre/lustre/llite/
H A Dvvp_page.c388 list_empty(&vmpage->lru) ? "not-" : "");
/drivers/base/
H A Dnode.c368 #define page_initialized(page) (page->lru.next)
/drivers/gpu/drm/qxl/
H A Dqxl_fb.c155 list_for_each_entry(page, pagelist, lru) {
/drivers/gpu/drm/udl/
H A Dudl_fb.c114 list_for_each_entry(cur, &fbdefio->pagelist, lru) {
/drivers/gpu/drm/vmwgfx/
H A Dvmwgfx_fb.c305 list_for_each_entry(page, pagelist, lru) {
/drivers/video/fbdev/
H A Dmetronomefb.c475 list_for_each_entry(cur, &fbdefio->pagelist, lru) {
H A Dauo_k190x.c330 list_for_each_entry(cur, &fbdefio->pagelist, lru) {

Completed in 465 milliseconds

12