| /bionic/libc/upstream-openbsd/lib/libc/net/ |
| inet_ntop.c | 105 struct { int base, len; } best, cur; local
118 best.base = -1;
128 if (best.base == -1 || cur.len > best.len)
129 best = cur;
135 if (best.base == -1 || cur.len > best.len)
136 best = cur;
138 if (best.base != -1 && best.len < 2
[all...] |
| /external/chromium_org/third_party/skia/experimental/Intersection/ |
| CubicBounds.cpp | 20 int best = -1; local
25 if (best < 0) {
26 best = index;
32 best = 1;
35 if (best >= 0) {
36 return leftTs[best];
|
| CubicParameterizationCode.cpp | 360 int best[bestCount][4]; local
361 bzero(best, sizeof(best));
369 if (best[w][0] < count[x][y][z]) {
370 best[w][0] = count[x][y][z];
371 best[w][1] = x;
372 best[w][2] = y;
373 best[w][3] = z;
381 printf("%c%c%c=%d\n", 'a' + best[w][1], 'a' + best[w][2]
[all...] |
| /external/chromium_org/net/http/ |
| http_auth.cc | 37 scoped_ptr<HttpAuthHandler> best; local
50 if (cur.get() && (!best.get() || best->score() < cur->score()) &&
52 best.swap(cur);
54 handler->swap(best);
|
| /development/perftests/panorama/feature_stab/db_vlvm/ |
| db_utilities_indexing.h | 96 double best; local
99 best=s[0];pos=0;
100 if(s[1]>best){best=s[1];pos=1;}
101 if(s[2]>best){best=s[2];pos=2;}
107 double best; local
110 best=s[0];pos=0;
111 if(s[1]>best){best=s[1];pos=1;
119 double best; local
132 double best; local
146 double best; local
161 double best; local
176 double best; local
193 double t,best; local
204 double t,best; local
[all...] |
| /external/chromium_org/components/search_engines/ |
| util.cc | 79 // For each group of prepopulated URLs with one ID, find the best URL to use
83 // Find the best URL.
88 UncheckedURLMap::iterator best = unchecked_urls.begin(); local
102 best = i;
106 // Otherwise, a URL is best if it matches the prepopulated data's keyword;
113 best = i;
115 } else if (i->second->id() < best->second->id()) {
116 best = i;
120 // Add the best URL to the checked group and delete the rest.
121 checked_urls.push_back(best->second)
[all...] |
| /external/chromium_org/third_party/libjingle/source/talk/media/base/ |
| videocapturer_unittest.cc | 311 cricket::VideoFormat best; local
312 EXPECT_TRUE(capturer_.GetBestCaptureFormat(desired, &best));
313 EXPECT_EQ(640, best.width);
314 EXPECT_EQ(480, best.height);
315 EXPECT_EQ(cricket::VideoFormat::FpsToInterval(30), best.interval);
318 EXPECT_FALSE(capturer_.GetBestCaptureFormat(desired, &best));
321 EXPECT_TRUE(capturer_.GetBestCaptureFormat(desired, &best));
328 cricket::VideoFormat best; local
330 EXPECT_TRUE(capturer_.GetBestCaptureFormat(desired, &best));
331 EXPECT_EQ(1280, best.width)
386 cricket::VideoFormat best; local
478 cricket::VideoFormat best; local
516 cricket::VideoFormat best; local
553 cricket::VideoFormat best; local
584 cricket::VideoFormat best; local
649 cricket::VideoFormat best; local
[all...] |
| videocapturer.cc | 267 std::vector<VideoFormat>::const_iterator best = supported_formats->end(); local
276 best = i;
279 if (supported_formats->end() == best) {
285 best_format->width = best->width;
286 best_format->height = best->height;
287 best_format->fourcc = best->fourcc;
288 best_format->interval = best->interval;
289 LOG(LS_INFO) << " Best " << best_format->ToString() << " Interval "
598 // Any fourcc is OK for the desired. Use preference to find best fourcc.
|
| /external/eigen/bench/ |
| BenchTimer.h | 41 /** Elapsed time timer keeping the best try.
98 /** Return the best elapsed time in seconds
100 inline double best(int TIMER = CPU_TIMER) const function in class:Eigen::BenchTimer
|
| /external/chromium_org/media/video/capture/linux/ |
| video_capture_device_linux.cc | 241 std::list<int>::iterator best = v4l2_formats.end(); local
244 best = std::find(v4l2_formats.begin(), best, fmtdesc.pixelformat);
248 if (best == v4l2_formats.end()) {
260 video_fmt.fmt.pix.pixelformat = *best;
|
| /external/chromium_org/third_party/libwebp/enc/ |
| alpha.c | 32 // prediction modes 0 to 3 and pick the best one.
196 // Quick estimate of the best candidate.
205 // For large number of colors, try FILTER_NONE in addition to the best
230 FilterTrial best; local
233 InitFilterTrial(&best);
244 if (ok && trial.score < best.score) {
245 VP8BitWriterWipeOut(&best.bw);
246 best = trial;
255 reduce_levels, effort_level, NULL, &best);
258 if (stats != NULL) *stats = best.stats
[all...] |
| /external/chromium_org/third_party/tcmalloc/chromium/src/ |
| page_heap.cc | 111 // find the best span (closest to n in size).
112 // The following loops implements address-ordered best-fit.
113 Span *best = NULL; local
120 if ((best == NULL)
121 || (span->length < best->length)
122 || ((span->length == best->length) && (span->start < best->start))) {
123 best = span;
124 ASSERT(best->location == Span::ON_NORMAL_FREELIST);
134 if ((best == NULL
[all...] |
| /external/chromium_org/third_party/tcmalloc/vendor/src/ |
| page_heap.cc | 110 // find the best span (closest to n in size).
111 // The following loops implements address-ordered best-fit.
112 Span *best = NULL; local
119 if ((best == NULL)
120 || (span->length < best->length)
121 || ((span->length == best->length) && (span->start < best->start))) {
122 best = span;
123 ASSERT(best->location == Span::ON_NORMAL_FREELIST);
133 if ((best == NULL
[all...] |
| /external/chromium_org/third_party/webrtc/modules/audio_coding/codecs/isac/fix/source/ |
| pitch_estimator.c | 112 int32_t best[4]= {-100, -100, -100, -100}; local
116 if (in[k] > best[3]) {
117 if (in[k] > best[2]) {
118 if (in[k] > best[1]) {
119 if (in[k] > best[0]) { // The Best
120 best[3] = best[2];
122 best[2] = best[1]
[all...] |
| /external/libvorbis/vq/ |
| bookutil.c | 52 int best=-1; local
63 if(best==-1 || this<best){
64 best=this;
|
| /external/okhttp/benchmarks/src/main/java/com/squareup/okhttp/benchmarks/ |
| Benchmark.java | 111 double best = 0.0; local
123 best = Math.max(best, requestsPerSecond);
139 return best;
|
| /external/chromium_org/courgette/ |
| disassembler_win32_x64.cc | 678 const Section* best = 0; local
683 if (best == 0 ||
684 section->file_offset_of_raw_data < best->file_offset_of_raw_data) {
685 best = section;
690 return best;
|
| disassembler_win32_x86.cc | 678 const Section* best = 0; local
683 if (best == 0 ||
684 section->file_offset_of_raw_data < best->file_offset_of_raw_data) {
685 best = section;
690 return best;
|
| /external/chromium_org/third_party/libvpx/source/libvpx/vp8/encoder/ |
| encodemb.c | 252 int best; local
318 /* And pick the best. */
319 best = rd_cost1 < rd_cost0;
323 tokens[i][0].rate = base_bits + (best ? rate1 : rate0);
324 tokens[i][0].error = d2 + (best ? error1 : error0);
328 best_mask[0] |= best << i;
384 /* And pick the best. */
385 best = rd_cost1 < rd_cost0;
393 tokens[i][1].rate = base_bits + (best ? rate1 : rate0);
394 tokens[i][1].error = d2 + (best ? error1 : error0)
[all...] |
| /external/chromium_org/third_party/mesa/src/src/mesa/drivers/windows/gdi/ |
| wgl.c | 239 int i,best = -1,bestdelta = 0x7FFFFFFF,delta; local
282 best = i + 1;
288 if(best == -1)
293 return(best);
|
| /external/chromium_org/ui/gfx/ |
| icon_util.cc | 54 const gfx::Image* best = image_family.GetBest(size); local
55 if (!best || best->IsEmpty()) {
64 best->Width() <= IconUtil::kMediumIconSize &&
65 best->Height() <= IconUtil::kMediumIconSize) {
72 if (best->Size() == size) {
73 resized_image_family->Add(*best);
77 SkBitmap best_bitmap = best->AsBitmap();
|
| /external/libvpx/libvpx/vp8/encoder/ |
| encodemb.c | 252 int best; local
325 /* And pick the best. */
326 best = rd_cost1 < rd_cost0;
330 tokens[i][0].rate = base_bits + (best ? rate1 : rate0);
331 tokens[i][0].error = d2 + (best ? error1 : error0);
335 best_mask[0] |= best << i;
391 /* And pick the best. */
392 best = rd_cost1 < rd_cost0;
400 tokens[i][1].rate = base_bits + (best ? rate1 : rate0);
401 tokens[i][1].error = d2 + (best ? error1 : error0)
[all...] |
| /external/mesa3d/src/mesa/drivers/windows/gdi/ |
| wgl.c | 239 int i,best = -1,bestdelta = 0x7FFFFFFF,delta; local
282 best = i + 1;
288 if(best == -1)
293 return(best);
|
| /external/chromium_org/third_party/libvpx/source/libvpx/vp9/encoder/ |
| vp9_encodemb.c | 126 int best, band, pt, i, final_eob; local
170 /* And pick the best. */
171 best = rd_cost1 < rd_cost0;
175 tokens[i][0].rate = base_bits + (best ? rate1 : rate0);
176 tokens[i][0].error = d2 + (best ? error1 : error0);
180 best_index[i][0] = best;
223 /* And pick the best. */
224 best = rd_cost1 < rd_cost0;
231 tokens[i][1].rate = base_bits + (best ? rate1 : rate0);
232 tokens[i][1].error = d2 + (best ? error1 : error0)
[all...] |
| /external/jdiff/src/jdiff/ |
| DiffMyers.java | 207 int best = 0; local
215 if (fd[fdiagoff + d] * 2 - dd > best
222 /* We have a good enough best diagonal;
230 best = fd[fdiagoff + d] * 2 - dd;
236 if (best > 0)
242 best = 0;
248 if ((xlim - bd[bdiagoff + d]) * 2 + dd > best
252 /* We have a good enough best diagonal;
262 best = (xlim - bd[bdiagoff + d]) * 2 + dd;
268 if (best > 0
[all...] |
