| /system/core/logd/ |
| LogBuffer.cpp | 236 LogTimeEntry *oldest = NULL; local
245 && (!oldest || (oldest->mStart > entry->mStart))) {
246 oldest = entry;
257 if (oldest && (oldest->mStart <= e->getMonotonicTime())) {
310 if (oldest && (oldest->mStart <= e->getMonotonicTime())) {
355 if (oldest && (oldest->mStart <= e->getMonotonicTime()))
[all...] |
| LogStatistics.h | 184 void format(char **strp, uid_t uid, unsigned int logMask, log_time oldest);
|
| /external/chromium_org/chrome/browser/sync_file_system/drive_backend/ |
| folder_creator.cc | 99 const google_apis::FileResource* oldest = NULL; local
105 if (!oldest || oldest->created_date() > entry.created_date())
106 oldest = &entry;
109 if (!oldest) {
114 std::string file_id = oldest->file_id();
|
| /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_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/webrtc/base/ |
| diskcache.cc | 223 // oldest resources... something that isn't O(n^2)
225 EntryMap::iterator oldest = map_.end(); local
229 oldest = it;
232 if (oldest == map_.end()) {
236 for (EntryMap::iterator it = oldest++; it != map_.end(); ++it) {
237 if (it->second.last_modified < oldest->second.last_modified) {
238 oldest = it;
241 if (!DeleteResource(oldest->first)) {
|
| /system/core/liblog/ |
| log_read_kern.c | 418 struct log_list *oldest = NULL; local
424 if (!oldest
425 || (entry->entry.entry.sec < oldest->entry.entry.sec)
426 || ((entry->entry.entry.sec == oldest->entry.entry.sec)
427 && (entry->entry.entry.nsec < oldest->entry.entry.nsec))) {
428 oldest = entry;
432 if (!oldest) {
440 || (oldest->entry.entry.sec < firstentry->entry.entry.sec)
441 || ((oldest->entry.entry.sec == firstentry->entry.entry.sec)
442 && (oldest->entry.entry.nsec < firstentry->entry.entry.nsec)))
[all...] |
| /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/ |
| app_window_geometry_cache.cc | 69 ExtensionData::iterator oldest = extension_data.end(); local
70 // Too many windows in the cache, find the oldest one to remove.
82 if (oldest == extension_data.end() ||
83 it->second.last_change < oldest->second.last_change)
84 oldest = it;
86 extension_data.erase(oldest);
|
| /external/dnsmasq/src/ |
| forward.c | 972 when the oldest in-use record will expire. Impose an absolute
976 struct frec *f, *oldest, *target; local
982 for (f = daemon->frec_list, oldest = NULL, target = NULL, count = 0; f; f = f->next, count++)
993 if (!oldest || difftime(f->time, oldest->time) <= 0)
994 oldest = f;
1003 /* can't find empty one, use oldest if there is one
1005 if (oldest && ((int)difftime(now, oldest->time)) >= TIMEOUT)
1009 if (difftime(now, oldest->time) < 2*TIMEOUT &&
[all...] |
| /external/chromium_org/components/domain_reliability/ |
| context.cc | 81 // Gets the start time of the oldest beacon, if there are any. Returns true
90 // Removes the oldest beacon. DCHECKs if there isn't one.
302 base::TimeTicks oldest; local
303 if ((*it)->GetOldestBeaconStart(&oldest)) {
304 if (!min_resource || oldest < min_time) {
305 min_time = oldest;
313 << "removing oldest beacon from " << min_resource->config->name;
|
| /frameworks/base/libs/hwui/ |
| TextureCache.cpp | 155 Texture* oldest = mCache.peekOldestValue();
156 if (oldest && !oldest->isInUse) {
|
| /system/core/include/utils/ |
| LruCache.h | 238 Entry* oldest = mOldest; local
243 for (Entry* p = oldest; p != NULL; p = p->child) {
|
| /external/chromium_org/chrome/browser/profiles/ |
| profile_metrics.cc | 68 base::Time oldest = base::Time::Now() -
72 if (info_cache.GetProfileActiveTimeAtIndex(i) < oldest) {
|
| /hardware/intel/img/hwcomposer/common/planes/ |
| DisplayPlane.cpp | 281 // unmap the first entry (oldest buffer)
283 BufferMapper *oldest = mActiveBuffers.itemAt(0); local
284 bm->unmap(oldest);
|
| /system/core/debuggerd/ |
| tombstone.cpp | 668 int oldest = -1; local
675 if (oldest < 0 || sb.st_mtime < oldest_sb.st_mtime) {
676 oldest = i;
692 if (oldest < 0) {
694 oldest = 0;
697 // we didn't find an available file, so we clobber the oldest one
698 snprintf(path, sizeof(path), TOMBSTONE_TEMPLATE, oldest);
|
| /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 | 1002 Job *jl, *oldest; local
1013 oldest = NULL;
1016 (!oldest || jl->age < oldest->age))
1017 oldest = jl;
1018 if (!oldest) {
1027 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;
|
| /external/chromium_org/net/disk_cache/blockfile/ |
| backend_impl.cc | 1663 int oldest = -1; local
[all...] |
| backend_impl_v3.cc | 1010 int oldest = -1; local
1016 DCHECK_LT(oldest, 0);
1017 newest = oldest = i;
1022 if (access_times[i] < access_times[oldest])
1023 oldest = i;
1027 if (newest < 0 || oldest < 0)
1035 next_entry = entries[oldest].get();
1036 iterator->list = static_cast<Rankings::List>(oldest);
[all...] |
| /external/chromium_org/chrome/browser/resources/chromeos/chromevox/chromevox/injected/ |
| navigation_history.js | 44 * An array of nodes ordered from newest to oldest in the history.
76 // If list is too long, pop the last (oldest) item.
|
| /pdk/apps/TestingCamera2/src/com/android/testingcamera2/ |
| ImageReaderSubPane.java | 472 Image oldest = mCurrentImages.remove();
473 oldest.close();
|
