| /external/webrtc/webrtc/base/ |
| diskcache.cc | 225 // oldest resources... something that isn't O(n^2)
227 EntryMap::iterator oldest = map_.end(); local
231 oldest = it;
234 if (oldest == map_.end()) {
238 for (EntryMap::iterator it = oldest++; it != map_.end(); ++it) {
239 if (it->second.last_modified < oldest->second.last_modified) {
240 oldest = it;
243 if (!DeleteResource(oldest->first)) {
|
| /device/google/marlin/camera/QCamera2/HAL3/ |
| QCamera3StreamMem.cpp | 455 int32_t oldest = INT_MAX; local
459 oldest = mHeapMem.getOldestFrameNumber(bufIdx);
466 if (empty || (!empty && (oldestGrallocFrameNumber < oldest))){
467 oldest = oldestGrallocFrameNumber;
476 return oldest;
|
| QCamera3Mem.cpp | 472 * DESCRIPTION: We use this to fetch the oldest frame number expected per FIFO
485 int32_t oldest = INT_MAX; local
491 if ((empty) || (!empty && oldest > mCurrentFrameNumbers[index]
493 oldest = mCurrentFrameNumbers[index];
502 return oldest;
1037 * DESCRIPTION: We use this to fetch the oldest frame number expected per FIFO
1048 int32_t oldest = INT_MAX; local
1054 (!empty && oldest > mCurrentFrameNumbers[index]
1056 oldest = mCurrentFrameNumbers[index];
1065 return oldest;
[all...] |
| /external/libchrome/base/task/sequence_manager/ |
| work_queue_sets.cc | 129 const OldestTaskEnqueueOrder& oldest = work_queue_heaps_[set_index].Min(); local
130 *out_work_queue = oldest.value;
131 *out_enqueue_order = oldest.key;
133 DCHECK(oldest.value->GetFrontTaskEnqueueOrder(&enqueue_order) &&
134 oldest.key == enqueue_order);
|
| /external/grpc-grpc/src/cpp/server/load_reporter/ |
| load_reporter.cc | 254 auto oldest = feedback_records_.begin(); local
256 while (std::distance(oldest, newest) > 0 &&
257 (newest->cpu_limit == 0 || oldest->cpu_limit == 0)) {
261 if (oldest->cpu_limit == 0) ++oldest;
263 if (std::distance(oldest, newest) < 1 ||
264 oldest->end_time == newest->end_time ||
265 newest->cpu_limit == oldest->cpu_limit) {
270 for (auto p = newest; p != oldest; --p) {
271 // Because these two numbers are counters, the oldest record shouldn't b
[all...] |
| /external/dnsmasq/src/ |
| forward.c | 843 struct frec *f, *oldest, *target; local
[all...] |
| /external/syzkaller/vendor/golang.org/x/net/internal/timeseries/ |
| timeseries.go | 89 oldest int // index to oldest bucketed Observable
98 l.oldest = 0
204 bucketNumber := (level.oldest + index) % ts.numBuckets
246 level.newest = level.oldest
247 level.oldest = (level.oldest + 1) % ts.numBuckets
426 srcValue := l.buckets[(srcIndex+l.oldest)%ts.numBuckets]
|
| /external/u-boot/fs/yaffs2/ |
| yaffs_yaffs2.c | 35 * Oldest Dirty Sequence Number handling.
40 * Calculate the oldest dirty sequence number if we don't know it.
52 /* Find the oldest dirty sequence number. */
84 * becomes invalid). If the value matches the oldest then we clear
102 * Update the oldest dirty sequence number whenever we dirty a block.
138 * periodically finds the oldest full block by sequence number for refreshing.
144 u32 oldest = 0; local
149 return oldest;
155 return oldest;
164 return oldest;
[all...] |
| /external/flatbuffers/android/jni/ |
| build_flatc.bat | 27 rem Newest and oldest version of Visual Studio that it's possible to select.
|
| /external/mksh/src/ |
| jobs.c | 1062 Job *jl, *oldest; local
1073 oldest = NULL;
1076 (!oldest || jl->age < oldest->age))
1077 oldest = jl;
1078 if (!oldest) {
1087 remove_job(oldest, "zombie");
[all...] |
| /external/speex/libspeexdsp/ |
| jitter.c | 339 /* If the current sub-window is full, perform a rotation and discard oldest sub-widow */
418 /*No place left in the buffer, need to make room for it by discarding the oldest packet */
476 /* Find the oldest packet */
477 spx_uint32_t oldest=0; local
480 if (jitter->packets[i].data && (!found || LT32(jitter->packets[i].timestamp,oldest)))
482 oldest = jitter->packets[i].timestamp;
489 jitter->pointer_timestamp = oldest;
490 jitter->next_stop = oldest;
|
| /external/webrtc/webrtc/p2p/base/ |
| p2ptransportchannel.cc | 1270 Connection* oldest = nullptr; local
[all...] |
| /external/syzkaller/vendor/golang.org/x/net/http2/hpack/ |
| tables.go | 63 // evictOldest evicts the n oldest entries in the table.
95 // that index 1 should be the newest entry, but t.ents[0] is the oldest entry,
|
| hpack.go | 205 // However, dt.ents[0] is the oldest entry. Hence, dt.ents is
|
| /bionic/libc/dns/resolv/ |
| res_cache.c | 1637 Entry* oldest = cache->mru_list.mru_prev; local
[all...] |
| /frameworks/av/media/libstagefright/ |
| ACodec.cpp | 1528 BufferInfo *oldest = NULL; local
[all...] |
| /device/google/marlin/camera/QCamera2/stack/mm-camera-interface/src/ |
| mm_camera_channel.c | 141 uint32_t mm_frame_sync_find_matched(uint8_t oldest);
[all...] |
| /external/syzkaller/pkg/bisect/ |
| bisect.go | 131 return res, nil // happens on the oldest release
|
| /external/wpa_supplicant_8/src/p2p/ |
| p2p.c | 417 struct p2p_device *dev, *oldest = NULL; local
426 if (oldest == NULL ||
427 os_reltime_before(&dev->last_seen, &oldest->last_seen))
428 oldest = dev;
430 if (count + 1 > p2p->cfg->max_peers && oldest) {
431 p2p_dbg(p2p, "Remove oldest peer entry to make room for a new peer");
432 dl_list_del(&oldest->list);
433 p2p_device_free(p2p, oldest);
[all...] |
| /external/syzkaller/vendor/golang.org/x/net/http2/ |
| writesched_priority.go | 437 // Remove the oldest node, then shift left.
|
| /external/syzkaller/vendor/golang.org/x/net/trace/ |
| events.go | 320 // Discard the oldest event.
|
| trace.go | 476 // Pick the oldest n traces.
|
| /external/v8/tools/ |
| map-processor.js | 632 // items[0] == oldest map, displayed at the top of the chunk
|
| /external/syzkaller/syz-manager/ |
| manager.go | 645 // Save up to 100 reports. If we already have 100, overwrite the oldest one.
[all...] |
| /external/icu/tools/srcgen/currysrc/libs/ |
| org.eclipse.core.resources_3.13.0.v20180512-1138.jar | |
