| /src/sys/external/bsd/drm2/dist/drm/nouveau/nvkm/subdev/instmem/ |
| nouveau_nvkm_subdev_instmem_nv50.c | 46 struct list_head lru; member in struct:nv50_instmem
65 struct list_head lru; member in struct:nv50_instobj
167 * succeed,or there's no more objects left on the LRU.
170 eobj = list_first_entry_or_null(&imem->lru, typeof(*eobj), lru);
176 list_del_init(&eobj->lru);
251 /* Add the now-unused mapping to the LRU instead of directly
254 if (likely(iobj->lru.next) && iobj->map) {
255 BUG_ON(!list_empty(&iobj->lru));
256 list_add_tail(&iobj->lru, &imem->lru)
[all...] |
| /src/external/mpl/bind/dist/lib/dns/ |
| badcache.c | 54 struct cds_list_head *lru; member in struct:dns_badcache
101 bc->lru = isc_mem_cget(mctx, bc->nloops, sizeof(bc->lru[0]));
103 CDS_INIT_LIST_HEAD(&bc->lru[i]);
128 isc_mem_cput(bc->mctx, bc->lru, bc->nloops, sizeof(bc->lru[0]));
238 bcentry_purge(struct cds_lfht *ht, struct cds_list_head *lru,
242 cds_list_for_each_entry_rcu(bad, lru, lru_head) {
260 struct cds_list_head *lru = &bc->lru[tid] local
326 struct cds_list_head *lru = &bc->lru[tid]; local
[all...] |
| rrl.c | 182 for (e_old = ISC_LIST_TAIL(rrl->lru), i = 0;
185 e_old = ISC_LIST_PREV(e_old, lru), ++i)
252 ISC_LIST_INITANDAPPEND(rrl->lru, e, lru);
343 if (ISC_LIST_HEAD(rrl->lru) != e) {
345 rrl->last_logged = ISC_LIST_PREV(e, lru);
347 ISC_LIST_UNLINK(rrl->lru, e, lru);
348 ISC_LIST_PREPEND(rrl->lru, e, lru);
[all...] |
| /src/external/bsd/jemalloc.old/dist/include/jemalloc/internal/ |
| eset.h | 11 * LRU queue.
47 /* LRU of all extents in heaps. */
48 edata_list_inactive_t lru; member in struct:eset_s
|
| extent_structs.h | 147 * - extents_t's LRU
174 /* Quantized collection of extents, with built-in LRU queue. */
193 * LRU of all extents in heaps.
197 extent_list_t lru; member in struct:extents_s
|
| /src/external/bsd/jemalloc.old/include/jemalloc/internal/ |
| eset.h | 11 * LRU queue.
47 /* LRU of all extents in heaps. */
48 edata_list_inactive_t lru; member in struct:eset_s
|
| extent_structs.h | 147 * - extents_t's LRU
174 /* Quantized collection of extents, with built-in LRU queue. */
193 * LRU of all extents in heaps.
197 extent_list_t lru; member in struct:extents_s
|
| /src/external/bsd/jemalloc/dist/include/jemalloc/internal/ |
| eset.h | 12 * LRU queue.
48 /* LRU of all extents in heaps. */
49 edata_list_inactive_t lru; member in struct:eset_s
|
| /src/external/bsd/jemalloc/include/jemalloc/internal/ |
| eset.h | 12 * LRU queue.
48 /* LRU of all extents in heaps. */
49 edata_list_inactive_t lru; member in struct:eset_s
|
| extent_structs.h | 147 * - extents_t's LRU
174 /* Quantized collection of extents, with built-in LRU queue. */
193 * LRU of all extents in heaps.
197 extent_list_t lru; member in struct:extents_s
|
| /src/sys/coda/ |
| coda_namecache.c | 103 struct coda_lru coda_nc_lru; /* head of lru chain */
122 * Initialize the cache, the LRU structure and the Hash structure(s)
151 TAILQ_INSERT_HEAD(&coda_nc_lru.head, &coda_nc_heap[i], lru);
213 * LRU and Hash as needed.
245 /* Grab the next element in the lru chain */
247 TAILQ_REMOVE(&coda_nc_lru.head, cncp, lru);
275 /* Insert into the lru and hash chains. */
276 TAILQ_INSERT_TAIL(&coda_nc_lru.head, cncp, lru);
318 /* put this entry at the end of the LRU */
319 TAILQ_REMOVE(&coda_nc_lru.head, cncp, lru);
[all...] |
| coda_namecache.h | 91 TAILQ_ENTRY(coda_cache) lru; /* LRU list */ member in struct:coda_cache
99 struct coda_lru { /* Start of LRU chain */
|
| /src/sys/external/bsd/drm2/dist/drm/ttm/ |
| ttm_bo.c | 183 BUG_ON(!list_empty(&bo->lru));
202 if (!list_empty(&bo->lru))
209 list_add_tail(&bo->lru, &man->lru[bo->priority]);
235 if (!list_empty(&bo->lru)) {
236 list_del_init(&bo->lru);
293 list_bulk_move_tail(&man->lru[i], &pos->first->lru,
294 &pos->last->lru);
308 list_bulk_move_tail(&man->lru[i], &pos->first->lru
314 struct list_head *lru; local
[all...] |
| ttm_page_alloc.c | 32 * - Use page->lru to keep a free list
315 list_for_each_entry_reverse(p, &pool->list, lru) {
323 __list_del(p->lru.prev, &pool->list);
358 __list_del(&p->lru, &pool->list);
481 list_del(&failed_pages[i]->lru);
532 list_add(&p->lru, pages);
618 list_for_each_entry(p, &new_pages, lru) {
683 list_for_each_entry(page, pages, lru) {
782 list_add_tail(&pages[i]->lru, &huge->list);
807 list_add_tail(&pages[i]->lru, &pool->list)
[all...] |
| /src/external/mpl/bind/dist/lib/dns/include/dns/ |
| rrl.h | 108 ISC_LINK(dns_rrl_entry_t) lru; member in struct:dns_rrl_entry
229 ISC_LIST(dns_rrl_entry_t) lru; member in struct:dns_rrl
|
| tsig.h | 74 * LRU list of generated key along with a count of the keys on the
78 ISC_LIST(dns_tsigkey_t) lru; member in struct:dns_tsigkeyring
272 * If the key is generated, it is also placed into an LRU queue.
274 * if this quota is exceeded, the oldest key in the LRU queue is
|
| /src/external/mpl/dhcp/bind/dist/lib/dns/include/dns/ |
| rrl.h | 109 ISC_LINK(dns_rrl_entry_t) lru; member in struct:dns_rrl_entry
230 ISC_LIST(dns_rrl_entry_t) lru; member in struct:dns_rrl
|
| tsig.h | 66 * LRU list of generated key along with a count of the keys on the
71 ISC_LIST(dns_tsigkey_t) lru; member in struct:dns_tsig_keyring
|
| /src/external/mpl/dhcp/bind/dist/lib/dns/ |
| rrl.c | 202 for (e_old = ISC_LIST_TAIL(rrl->lru), i = 0;
205 e_old = ISC_LIST_PREV(e_old, lru), ++i)
273 ISC_LIST_INITANDAPPEND(rrl->lru, e, lru);
363 if (ISC_LIST_HEAD(rrl->lru) != e) {
365 rrl->last_logged = ISC_LIST_PREV(e, lru);
367 ISC_LIST_UNLINK(rrl->lru, e, lru);
368 ISC_LIST_PREPEND(rrl->lru, e, lru);
[all...] |
| /src/external/gpl3/gcc.old/dist/libgcc/config/spu/ |
| cachemgr.c | 257 unsigned int lru = 0; local
267 if (GET_LRU (entry, i) > lru)
269 lru = GET_LRU (entry, i);
340 /* Increment LRU in reserved bytes. */
388 /* We've definitely found the right entry, set LRU (reserved) to 0
|
| /src/external/bsd/jemalloc.old/dist/src/ |
| eset.c | 30 edata_list_inactive_init(&eset->lru);
100 edata_list_inactive_append(&eset->lru, edata);
145 edata_list_inactive_remove(&eset->lru, edata);
|
| /src/external/bsd/jemalloc/dist/src/ |
| eset.c | 30 edata_list_inactive_init(&eset->lru);
101 edata_list_inactive_append(&eset->lru, edata);
146 edata_list_inactive_remove(&eset->lru, edata);
|
| /src/regress/sys/uvm/pdsim/ |
| Makefile | 4 HPROGS= lfu lru nbsd opt rand
|
| /src/external/gpl3/gdb.old/dist/sim/frv/ |
| cache.h | 23 /* A representation of a set-associative cache with LRU replacement,
146 int lru; /* Lower values indicates less recently used. */ member in struct:__anon22087
|
| /src/external/gpl3/gdb/dist/sim/frv/ |
| cache.h | 23 /* A representation of a set-associative cache with LRU replacement,
146 int lru; /* Lower values indicates less recently used. */ member in struct:__anon1562
|
