Lines Matching refs:lru
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);
320 TAILQ_INSERT_TAIL(&coda_nc_lru.head, cncp, lru);
340 * place it at the head of the lru list.
364 TAILQ_REMOVE(&coda_nc_lru.head, cncp, lru);
365 TAILQ_INSERT_HEAD(&coda_nc_lru.head, cncp, lru);
510 * best to go through on basis of LRU since cache will almost
511 * always be full and LRU is more straightforward.
526 ncncp = TAILQ_NEXT(cncp, lru);
554 * Go through the whole lru chain and kill everything as we go.
555 * I don't use remove since that would rebuild the lru chain
566 TAILQ_FOREACH(cncp, &coda_nc_lru.head, lru) {
Indexes created Thu Oct 16 14:10:15 GMT 2025