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

  /system/core/libpixelflinger/codeflinger/
CodeCache.cpp 139 // evict the LRU
140 size_t lru = 0; local
144 if (e.when < mCacheData.valueAt(lru).when) {
145 lru = i;
148 const cache_entry_t& e = mCacheData.valueAt(lru);
150 mCacheData.removeItemsAt(lru);
  /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);
opd_sfile.c 265 goto lru;
272 lru:
293 list_init(&to->lru);
495 list_del(&sf->lru);
559 struct sfile * sf = list_entry(pos, struct sfile, lru);
615 sf = list_entry(pos, struct sfile, lru);
626 list_del(&sf->lru);
633 list_add_tail(&sf->lru, &lru_list);
  /external/chromium/net/disk_cache/
eviction.cc 5 // The eviction policy is a very simple pure LRU, so the elements at the end of
173 if (header_->lru.filled)
176 header_->lru.filled = 1;
298 } else if (header_->lru.sizes[Rankings::DELETED] > header_->num_entries / 4) {
409 if (header_->lru.sizes[Rankings::DELETED] > header_->num_entries / 4)
452 header_->lru.sizes[Rankings::DELETED];
454 if (header_->lru.sizes[0] > data_entries / 3)
456 if (header_->lru.sizes[1] > data_entries / 3)
disk_format.h 39 // location on the LRU lists, last access time etc.
94 LruData lru; // Eviction control data. member in struct:disk_cache::IndexHeader
151 uint64 last_used; // LRU info.
152 uint64 last_modified; // LRU info.
153 CacheAddr next; // LRU list.
154 CacheAddr prev; // LRU list.
backend_impl.cc 344 data_->header.lru.sizes[Rankings::DELETED];
730 return &data_->header.lru;
899 data_->header.lru.sizes[0] * 100 / data_->header.num_entries);
901 data_->header.lru.sizes[1] * 100 / data_->header.num_entries);
903 data_->header.lru.sizes[2] * 100 / data_->header.num_entries);
    [all...]
  /external/chromium/net/tools/dump_cache/
dump_files.cc 68 printf("head %d: 0x%x\n", i, header.lru.heads[i]);
69 printf("tail %d: 0x%x\n", i, header.lru.tails[i]);
71 printf("transaction: 0x%x\n", header.lru.transaction);
72 printf("operation: %d\n", header.lru.operation);
73 printf("operation list: %d\n", header.lru.operation_list);
  /frameworks/base/core/java/android/app/
ActivityManager.java 840 * more important). Currently an LRU value is only maintained for
844 public int lru; field in class:ActivityManager.RunningAppProcessInfo
910 dest.writeInt(lru);
923 lru = source.readInt();
    [all...]
  /frameworks/base/opengl/libagl/
array.cpp 497 // always record LRU in v[0]
510 const int lru = 1 - v[0].mru;
511 v[0].mru = lru;
512 return cache_vertex(c, &v[lru], index);
    [all...]
  /external/kernel-headers/original/linux/
mm.h 253 struct list_head lru; /* Pageout list, eg. active_list member in struct:page
350 * page_count() == 0 means the page is free. page->lru is then used for
    [all...]
  /frameworks/base/services/java/com/android/server/am/
ActivityManagerService.java 247 // LRU background list.
840 * Current sequence id for process LRU updating.
    [all...]
  /external/sqlite/dist/
sqlite3.c 9660 int lru; \/* Least recently used entry has the smallest value *\/ member in struct:Parse::yColCache
    [all...]
sqlite3.c.orig     [all...]
  /prebuilt/sdk/4/
android.jar 
  /prebuilt/sdk/5/
android.jar 
  /prebuilt/sdk/6/
android.jar 

Completed in 188 milliseconds