HomeSort by relevance Sort by last modified time
    Searched defs:lru (Results 1 - 9 of 9) sorted by null

  /external/oprofile/daemon/
opd_sfile.h 59 /** lru list */
60 struct list_head lru; member in struct:sfile
93 /** clear out a certain amount of LRU entries
94 * return non-zero if the lru is already empty */
97 /** remove a sfile from the lru list, protecting it from sfile_lru_clear() */
100 /** add this sfile to lru list */
opd_anon.c 36 * anon cache, we'll tear down all the mappings for that tgid. Thus, LRU
44 static struct list_head lru; variable in typeref:struct:list_head
54 list_for_each_safe(pos, pos2, &lru) {
119 list_add_tail(&m->lru_list, &lru);
227 list_init(&lru);
  /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/util/
u_cache.c 32 * Fixed size array with linear probing on collision and LRU eviction
81 struct util_cache_entry lru; member in struct:util_cache
105 make_empty_list(&cache->lru);
194 entry = cache->lru.prev;
197 util_cache_entry_destroy(cache, cache->lru.prev);
209 insert_at_head(&cache->lru, entry);
232 move_to_head(&cache->lru, entry);
253 assert(is_empty_list(&cache->lru));
335 assert (is_empty_list(&cache->lru));
338 struct util_cache_entry *header = cache->lru.next
    [all...]
  /external/mesa3d/src/gallium/auxiliary/util/
u_cache.c 32 * Fixed size array with linear probing on collision and LRU eviction
81 struct util_cache_entry lru; member in struct:util_cache
105 make_empty_list(&cache->lru);
194 entry = cache->lru.prev;
197 util_cache_entry_destroy(cache, cache->lru.prev);
209 insert_at_head(&cache->lru, entry);
232 move_to_head(&cache->lru, entry);
253 assert(is_empty_list(&cache->lru));
335 assert (is_empty_list(&cache->lru));
338 struct util_cache_entry *header = cache->lru.next
    [all...]
  /external/chromium_org/net/disk_cache/blockfile/
disk_format.h 29 // location on the LRU lists, last access time etc.
86 LruData lru; // Eviction control data. member in struct:disk_cache::IndexHeader
139 uint64 last_used; // LRU info.
140 uint64 last_modified; // LRU info.
141 CacheAddr next; // LRU list.
142 CacheAddr prev; // LRU list.
  /external/chromium_org/third_party/WebKit/Source/platform/fonts/harfbuzz/
HarfBuzzShaper.cpp 97 CachedShapingResultsLRU::iterator lru; member in struct:blink::CachedShapingResults
168 data->lru = --m_harfBuzzRunLRU.end();
171 CachedShapingResultsLRUNode* lru = m_harfBuzzRunLRU.front(); local
172 CachedShapingResults* foo = lru->entry->second;
173 m_harfBuzzRunMap.erase(lru->entry);
176 delete lru;
191 CachedShapingResultsLRUNode* lruNode = *node->lru;
193 m_harfBuzzRunLRU.erase(node->lru);
201 CachedShapingResultsLRUNode* lruNode = *node->lru;
202 m_harfBuzzRunLRU.erase(node->lru);
    [all...]
  /external/chromium_org/third_party/sqlite/src/src/
sqliteInt.h 2198 int lru; \/* Least recently used entry has the smallest value *\/ member in struct:Parse::yColCache
    [all...]
  /external/chromium_org/third_party/sqlite/amalgamation/
sqlite3.c 10543 int lru; \/* Least recently used entry has the smallest value *\/ member in struct:Parse::yColCache
    [all...]
  /external/chromium_org/third_party/libaddressinput/src/java/
android.jar 

Completed in 571 milliseconds