| /frameworks/base/media/mca/filterfw/java/android/filterfw/core/ |
| CachedFrameManager.java | 123 int oldest = mAvailableFrames.firstKey(); local
124 Frame frame = mAvailableFrames.get(oldest);
127 mAvailableFrames.remove(oldest);
|
| /external/chromium_org/base/containers/ |
| mru_cache_unittest.cc | 69 // Check that item1 is the oldest since item2 was added afterwards.
71 Cache::reverse_iterator oldest = cache.rbegin(); local
72 ASSERT_TRUE(oldest != cache.rend());
73 EXPECT_EQ(kItem1Key, oldest->first);
74 EXPECT_EQ(item1.value, oldest->second.value);
85 // Check that retrieving item1 pushed item2 to oldest.
87 Cache::reverse_iterator oldest = cache.rbegin(); local
88 ASSERT_TRUE(oldest != cache.rend());
89 EXPECT_EQ(kItem2Key, oldest->first);
90 EXPECT_EQ(item2.value, oldest->second.value)
[all...] |
| /external/chromium_org/net/quic/crypto/ |
| strike_register_test.cc | 110 // This should push the oldest value out and force the horizon to be updated.
217 set<string>::iterator oldest = nonces_.begin(), it; local
219 TimeFromBytes(reinterpret_cast<const uint8*>(oldest->data()));
221 for (it = oldest; it != nonces_.end(); it++) {
224 (t == oldest_time && memcmp(it->data(), oldest->data(), 32) < 0)) {
226 oldest = it;
230 nonces_.erase(oldest);
|
| /external/chromium/third_party/libjingle/source/talk/base/ |
| diskcache.cc | 240 // oldest resources... something that isn't O(n^2)
242 EntryMap::iterator oldest = map_.end(); local
246 oldest = it;
249 if (oldest == map_.end()) {
253 for (EntryMap::iterator it = oldest++; it != map_.end(); ++it) {
254 if (it->second.last_modified < oldest->second.last_modified) {
255 oldest = it;
258 if (!DeleteResource(oldest->first)) {
|
| /external/chromium_org/third_party/libjingle/source/talk/base/ |
| diskcache.cc | 240 // oldest resources... something that isn't O(n^2)
242 EntryMap::iterator oldest = map_.end(); local
246 oldest = it;
249 if (oldest == map_.end()) {
253 for (EntryMap::iterator it = oldest++; it != map_.end(); ++it) {
254 if (it->second.last_modified < oldest->second.last_modified) {
255 oldest = it;
258 if (!DeleteResource(oldest->first)) {
|
| /external/chromium_org/third_party/leveldatabase/src/db/ |
| snapshot.h | 38 SnapshotImpl* oldest() const { assert(!empty()); return list_.next_; } function in class:leveldb::SnapshotList
|
| /external/chromium_org/apps/ |
| shell_window_geometry_cache.cc | 73 ExtensionData::iterator oldest = extension_data.end(); local
74 // Too many windows in the cache, find the oldest one to remove.
84 if (oldest == extension_data.end() ||
85 it->second.last_change < oldest->second.last_change)
86 oldest = it;
88 extension_data.erase(oldest);
|
| /external/dnsmasq/src/ |
| forward.c | 959 when the oldest in-use record will expire. Impose an absolute
963 struct frec *f, *oldest, *target; local
969 for (f = daemon->frec_list, oldest = NULL, target = NULL, count = 0; f; f = f->next, count++)
980 if (!oldest || difftime(f->time, oldest->time) <= 0)
981 oldest = f;
990 /* can't find empty one, use oldest if there is one
992 if (oldest && ((int)difftime(now, oldest->time)) >= TIMEOUT)
996 if (difftime(now, oldest->time) < 2*TIMEOUT &&
[all...] |
| /system/core/include/utils/ |
| LruCache.h | 225 Entry* oldest = mOldest; local
230 for (Entry* p = oldest; p != NULL; p = p->child) {
|
| /packages/inputmethods/OpenWnn/libs/libwnnDictionary/engine/ |
| ndldic.c | 1060 NJ_UINT16 que_id, oldest; local
1074 oldest = GET_LEARN_NEXT_WORD_POS(loctset->loct.handle);
1100 if (current < oldest) {
1110 max_value = oldest;
1685 NJ_UINT16 que_id, oldest; local
1937 NJ_UINT16 que_id, oldest; local
[all...] |
| /external/mksh/src/ |
| jobs.c | 1004 Job *jl, *oldest; local
1015 oldest = NULL;
1018 (!oldest || jl->age < oldest->age))
1019 oldest = jl;
1020 if (!oldest) {
1029 remove_job(oldest, "zombie");
[all...] |
| /external/speex/libspeex/ |
| jitter.c | 341 /* If the current sub-window is full, perform a rotation and discard oldest sub-widow */
420 /*No place left in the buffer, need to make room for it by discarding the oldest packet */
479 /* Find the oldest packet */
480 spx_uint32_t oldest=0; local
483 if (jitter->packets[i].data && (!found || LT32(jitter->packets[i].timestamp,oldest)))
485 oldest = jitter->packets[i].timestamp;
492 jitter->pointer_timestamp = oldest;
493 jitter->next_stop = oldest;
|
| /system/core/debuggerd/ |
| tombstone.c | 600 * the oldest entry. If we didn't, we want to start at zero.
748 int oldest = 0; local
754 oldest = i;
770 /* we didn't find an available file, so we clobber the oldest one */
771 snprintf(path, sizeof(path), TOMBSTONE_DIR"/tombstone_%02d", oldest);
|
| /external/chromium/net/disk_cache/ |
| backend_impl.cc | 1716 int oldest = -1; local
[all...] |
| /external/chromium_org/net/disk_cache/ |
| backend_impl.cc | 1686 int oldest = -1; local
[all...] |
| /external/chromium_org/net/disk_cache/v3/ |
| backend_impl_v3.cc | 1084 int oldest = -1; local
1090 DCHECK_LT(oldest, 0);
1091 newest = oldest = i;
1096 if (access_times[i] < access_times[oldest])
1097 oldest = i;
1101 if (newest < 0 || oldest < 0)
1109 next_entry = entries[oldest].get();
1110 iterator->list = static_cast<Rankings::List>(oldest);
[all...] |
| /frameworks/av/media/libstagefright/ |
| ACodec.cpp | 818 BufferInfo *oldest = NULL; local
834 (oldest == NULL ||
837 mDequeueCounter - oldest->mDequeuedAt)) {
838 oldest = info;
842 if (oldest) {
846 oldest->mGraphicBuffer = new GraphicBuffer(buf, false);
847 oldest->mStatus = BufferInfo::OWNED_BY_US;
850 mNode, kPortIndexOutput, oldest->mGraphicBuffer,
851 oldest->mBufferID);
855 oldest->mData->base())
[all...] |
| /external/chromium/chrome/browser/net/ |
| passive_log_collector.cc | 280 uint32 oldest = deletion_queue_.front(); local
282 DeleteSourceInfo(oldest);
|
| /bionic/libc/netbsd/resolv/ |
| res_cache.c | 1602 Entry* oldest = cache->mru_list.mru_prev; local
[all...] |
| /external/wpa_supplicant_8/src/p2p/ |
| p2p.c | 413 struct p2p_device *dev, *oldest = NULL; local
422 if (oldest == NULL ||
423 os_time_before(&dev->last_seen, &oldest->last_seen))
424 oldest = dev;
426 if (count + 1 > p2p->cfg->max_peers && oldest) {
427 p2p_dbg(p2p, "Remove oldest peer entry to make room for a new peer");
430 if(&oldest->list == p2p->sd_dev_list)
431 p2p->sd_dev_list = oldest->list.next;
433 dl_list_del(&oldest->list);
434 p2p_device_free(p2p, oldest);
[all...] |
| /development/scripts/app_engine_server/gae_shell/static/ |
| shell.js | 36 * The shell history. history is an array of strings, ordered oldest to
|
| /external/chromium_org/chrome/browser/resources/chromeos/wallpaper_manager/js/ |
| wallpaper_manager.js | 533 * Removes the oldest custom wallpaper. If the oldest one is set as current
534 * wallpaper, removes the second oldest one to free some space. This should
560 // Instead of simply remove oldest wallpaper, we should consider a
[all...] |
| /external/chromium_org/third_party/WebKit/Tools/TestResultServer/static-dashboards/ |
| aggregate_results.js | 145 // Include the most recent and oldest values.
|
| /external/chromium_org/third_party/angle_dx11/src/libGLESv2/renderer/ |
| Renderer9.cpp | 1197 NullColorbufferCacheEntry *oldest = &mNullColorbufferCache[0]; local
[all...] |
| /external/oprofile/events/mips/74K/ |
| events | 39 event:0x15 counters:0,2 um:zero minimum:500 name:OOO_ALU_ISSUE_CYCLES : 21-0 Out-of-order ALU issue cycles (issued instruction is not the oldest in the pool)
115 event:0x415 counters:1,3 um:zero minimum:500 name:OOO_AGEN_ISSUE_CYCLES : 21-1 Out-of-order AGEN issue cycles (issued instruction is not the oldest in the pool)
|
