/external/chromium_org/third_party/leveldatabase/src/db/ |
H A D | snapshot.h | 38 SnapshotImpl* oldest() const { assert(!empty()); return list_.next_; } function in class:leveldb::SnapshotList
|
/external/chromium_org/base/containers/ |
H A D | 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 [all...] |
/external/chromium_org/net/quic/crypto/ |
H A D | 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/chrome/browser/net/ |
H A D | passive_log_collector.cc | 280 uint32 oldest = deletion_queue_.front(); local 282 DeleteSourceInfo(oldest);
|
/external/chromium/third_party/libjingle/source/talk/base/ |
H A D | 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/apps/ |
H A D | 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/chromium_org/third_party/libjingle/source/talk/base/ |
H A D | 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/dnsmasq/src/ |
H A D | 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 [all...] |
/external/speex/libspeex/ |
H A D | 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;
|
/external/mksh/src/ |
H A D | 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");
|
/external/chromium/net/disk_cache/ |
H A D | backend_impl.cc | 1716 int oldest = -1; local 1722 DCHECK_LT(oldest, 0); 1723 newest = oldest = i; 1728 if (access_times[i] < access_times[oldest]) 1729 oldest = i; 1733 if (newest < 0 || oldest < 0) 1741 next_entry = entries[oldest].release(); 1742 iterator->list = static_cast<Rankings::List>(oldest);
|
/external/chromium_org/net/disk_cache/ |
H A D | backend_impl.cc | 1686 int oldest = -1; local 1692 DCHECK_LT(oldest, 0); 1693 newest = oldest = i; 1698 if (access_times[i] < access_times[oldest]) 1699 oldest = i; 1703 if (newest < 0 || oldest < 0) 1711 next_entry = entries[oldest].get(); 1712 iterator->list = static_cast<Rankings::List>(oldest);
|
/external/chromium_org/net/disk_cache/v3/ |
H A D | 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);
|
/external/wpa_supplicant_8/hostapd/src/p2p/ |
H A D | 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...] |
/external/wpa_supplicant_8/src/p2p/ |
H A D | 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...] |
/external/wpa_supplicant_8/wpa_supplicant/src/p2p/ |
H A D | 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...] |
/external/chromium_org/third_party/angle_dx11/src/libGLESv2/renderer/ |
H A D | Renderer9.cpp | 1197 NullColorbufferCacheEntry *oldest = &mNullColorbufferCache[0]; local 1200 if (mNullColorbufferCache[i].lruCount < oldest->lruCount) 1202 oldest = &mNullColorbufferCache[i]; 1206 delete oldest->buffer; 1207 oldest->buffer = nullbuffer; 1208 oldest->lruCount = ++mMaxNullColorbufferLRU; 1209 oldest->width = width; 1210 oldest->height = height;
|
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
H A D | org.eclipse.core.resources_3.6.1.R36x_v20101007-1215.jar | META-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ... |