| /external/chromium_org/third_party/WebKit/Tools/Scripts/webkitpy/common/ |
| lru_cache_unittest.py | 35 self.lru = lru_cache.LRUCache(3)
36 self.lru['key_1'] = 'item_1'
37 self.lru['key_2'] = 'item_2'
38 self.lru['key_3'] = 'item_3'
44 self.assertEqual(set(self.lru.items()), set([('key_1', 'item_1'), ('key_3', 'item_3'), ('key_2', 'item_2')]))
47 self.lru['key_4'] = 'item_4'
48 self.assertEqual(set(self.lru.items()), set([('key_4', 'item_4'), ('key_3', 'item_3'), ('key_2', 'item_2')]))
51 self.lru['key_1']
52 self.lru['key_5'] = 'item_5'
53 self.assertEqual(set(self.lru.items()), set([('key_1', 'item_1'), ('key_3', 'item_3'), ('key_5', 'item_5')])
[all...] |
| /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...] |
| /system/core/libpixelflinger/codeflinger/ |
| CodeCache.cpp | 185 // evict the LRU
186 size_t lru = 0; local
190 if (e.when < mCacheData.valueAt(lru).when) {
191 lru = i;
194 const cache_entry_t& e = mCacheData.valueAt(lru);
196 mCacheData.removeItemsAt(lru);
|
| /hardware/intel/common/libwsbm/src/ |
| wsbm_userpool.c | 65 struct _WsbmListHead lru; member in struct:_WsbmUserBuffer
161 evict_lru(struct _WsbmListHead *lru)
165 struct _WsbmListHead *list = lru->next;
168 if (list == lru) {
172 vBuf = WSBMLISTENTRY(list, struct _WsbmUserBuffer, lru);
189 WSBMLISTDELINIT(&vBuf->lru);
219 WSBMINITLISTHEAD(&vBuf->lru);
232 WSBMLISTADDTAIL(&vBuf->lru, &p->agpLRU);
246 WSBMLISTADDTAIL(&vBuf->lru, &p->vramLRU);
288 WSBMLISTDELINIT(&vBuf->lru);
[all...] |
| /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_org/net/disk_cache/blockfile/ |
| eviction_v3.cc | 5 // The eviction policy is a very simple pure LRU, so the elements at the end of
273 return (!test_mode_ && header_->lru.sizes[Rankings::DELETED] > max_length);
432 if (header_->lru.filled)
435 header_->lru.filled = 1;
466 header_->lru.sizes[Rankings::DELETED];
468 if (header_->lru.sizes[0] > data_entries / 3)
471 int list = (header_->lru.sizes[1] > data_entries / 3) ? 1 : 2;
478 header_->lru.sizes[0] > data_entries / 10)
|
| 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.
|
| eviction.cc | 5 // The eviction policy is a very simple pure LRU, so the elements at the end of
251 return (!test_mode_ && header_->lru.sizes[Rankings::DELETED] > max_length);
262 if (header_->lru.filled)
265 header_->lru.filled = 1;
557 header_->lru.sizes[Rankings::DELETED];
559 if (header_->lru.sizes[0] > data_entries / 3)
562 int list = (header_->lru.sizes[1] > data_entries / 3) ? 1 : 2;
569 header_->lru.sizes[0] > data_entries / 10)
|
| backend_impl.cc | 712 return &data_->header.lru;
953 data_->header.lru.sizes[0] * 100 / data_->header.num_entries);
955 data_->header.lru.sizes[1] * 100 / data_->header.num_entries);
957 data_->header.lru.sizes[2] * 100 / data_->header.num_entries);
1147 data_->header.lru.sizes[Rankings::DELETED];
[all...] |
| /external/chromium_org/net/tools/dump_cache/ |
| dump_files.cc | 113 printf("head %d: 0x%x\n", i, header.lru.heads[i]);
114 printf("tail %d: 0x%x\n", i, header.lru.tails[i]);
115 printf("size %d: 0x%x\n", i, header.lru.sizes[i]);
117 printf("transaction: 0x%x\n", header.lru.transaction);
118 printf("operation: %d\n", header.lru.operation);
119 printf("operation list: %d\n", header.lru.operation_list);
|
| /external/chromium_org/third_party/WebKit/Source/platform/fonts/harfbuzz/ |
| HarfBuzzShaper.cpp | 97 CachedShapingResultsLRU::iterator lru; member in struct:WebCore::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...] |
| /hardware/intel/img/libdrm/libdrm/intel/ |
| intel_bufmgr_fake.c | 138 struct block lru; member in struct:_bufmgr_fake
434 DRMLISTADDTAIL(block, &bufmgr_fake->lru);
530 DRMLISTFOREACHSAFE(block, tmp, &bufmgr_fake->lru) {
556 DRMLISTFOREACHSAFEREVERSE(block, tmp, &bufmgr_fake->lru) {
597 DBG("return to lru: offset %x sz %x\n",
600 DRMLISTADDTAIL(block, &bufmgr_fake->lru);
652 /* If we're not thrashing, allow lru eviction to dig deeper into
773 DRMLISTFOREACHSAFE(block, tmp, &bufmgr_fake->lru) {
[all...] |
| /packages/apps/Settings/src/com/android/settings/applications/ |
| RunningState.java | 185 if (DEBUG_COMPARE) Log.i(TAG, " Lru " + lhsInfo.lru + " with " + rhsInfo.lru);
186 if (lhsInfo.lru != rhsInfo.lru) {
187 return lhsInfo.lru < rhsInfo.lru ? -1 : 1;
[all...] |
| /external/chromium_org/third_party/sqlite/src/src/ |
| expr.c | [all...] |
| sqliteInt.h | 2198 int lru; \/* Least recently used entry has the smallest value *\/ member in struct:Parse::yColCache
[all...] |
| /frameworks/base/core/java/android/app/ |
| ActivityManager.java | 2072 public int lru; field in class:ActivityManager.RunningAppProcessInfo
[all...] |
| /frameworks/native/opengl/libagl/ |
| array.cpp | 501 // always record LRU in v[0]
514 const int lru = 1 - v[0].mru;
515 v[0].mru = lru;
516 return cache_vertex(c, &v[lru], index);
[all...] |
| /external/robolectric/lib/main/ |
| sqlite-jdbc-3.7.2.jar | |
| android.jar | |
| /frameworks/base/services/core/java/com/android/server/am/ |
| ActivityManagerService.java | 630 * LRU list of history of current users. Most recently current is at the end.
[all...] |
| /external/chromium_org/third_party/libaddressinput/src/java/ |
| android.jar | |
| /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...] |
