/external/tcpdump/missing/ |
H A D | inet_ntop.c | 117 } best, cur; local 129 best.base = -1; 141 if (best.base == -1 || cur.len > best.len) 142 best = cur; 146 if ((cur.base != -1) && (best.base == -1 || cur.len > best.len)) 147 best = cur; 148 if (best.base != -1 && best [all...] |
/external/chromium_org/third_party/libjingle/source/talk/media/base/ |
H A D | 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 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...] |
/external/ppp/pppd/plugins/pppoatm/ |
H A D | misc.c | 24 int i,best; local 30 best = -1; 35 best = i; 40 if (best > -1) (*pos) += best_len; 41 return best;
|
/external/chromium_org/third_party/skia/experimental/Intersection/ |
H A D | 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];
|
H A D | 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[ [all...] |
/external/skia/experimental/Intersection/ |
H A D | 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];
|
H A D | 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[ [all...] |
/external/eigen/bench/ |
H A D | quatmul.cpp | 33 std::cout << label << " default " << 1e3*t.best(CPU_TIMER) << "ms \t" << 1e-6*double(rep)/(t.best(CPU_TIMER)) << " M mul/s\n"; 36 std::cout << label << " novec " << 1e3*t.best(CPU_TIMER) << "ms \t" << 1e-6*double(rep)/(t.best(CPU_TIMER)) << " M mul/s\n";
|
H A D | bench_gemm.cpp | 129 int tries = 2; // number of tries, we keep the best 202 std::cout << "blas cpu " << tblas.best(CPU_TIMER)/rep << "s \t" << (double(m)*n*p*rep*2/tblas.best(CPU_TIMER))*1e-9 << " GFLOPS \t(" << tblas.total(CPU_TIMER) << "s)\n"; 203 std::cout << "blas real " << tblas.best(REAL_TIMER)/rep << "s \t" << (double(m)*n*p*rep*2/tblas.best(REAL_TIMER))*1e-9 << " GFLOPS \t(" << tblas.total(REAL_TIMER) << "s)\n"; 209 std::cout << "eigen cpu " << tmt.best(CPU_TIMER)/rep << "s \t" << (double(m)*n*p*rep*2/tmt.best(CPU_TIMER))*1e-9 << " GFLOPS \t(" << tmt.total(CPU_TIMER) << "s)\n"; 210 std::cout << "eigen real " << tmt.best(REAL_TIMER)/rep << "s \t" << (double(m)*n*p*rep*2/tmt.best(REAL_TIMER))*1e-9 << " GFLOPS \t(" << tmt.total(REAL_TIMER) << "s)\n"; 220 std::cout << "eigen mono cpu " << tmono.best(CPU_TIME [all...] |
H A D | sparse_dense_product.cpp | 80 std::cout << " a * v:\t" << timer.best() << " " << double(REPEAT)/timer.best() << " * / sec " << endl; 87 std::cout << " a' * v:\t" << timer.best() << endl; 96 std::cout << " a * v:\t" << timer.best()/REPEAT << " " << double(REPEAT)/timer.best(REAL_TIMER) << " * / sec " << endl; 101 std::cout << " a' * v:\t" << timer.best()/REPEAT << endl;
|
/external/chromium_org/third_party/webrtc/modules/audio_coding/codecs/isac/fix/source/ |
H A D | 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]; 124 best[ [all...] |
/external/webrtc/src/modules/audio_coding/codecs/isac/fix/source/ |
H A D | pitch_estimator.c | 120 WebRtc_Word32 best[4]= {-100, -100, -100, -100}; local 124 if (in[k] > best[3]) { 125 if (in[k] > best[2]) { 126 if (in[k] > best[1]) { 127 if (in[k] > best[0]) { // The Best 128 best[3] = best[2]; 130 best[2] = best[1]; 132 best[ [all...] |
/external/chromium_org/net/http/ |
H A D | 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);
|
/external/zopfli/src/zopfli/ |
H A D | blocksplitter.c | 46 double best = ZOPFLI_LARGE_FLOAT; local 51 if (v < best) { 52 best = v; 64 double best; local 76 best = vp[0]; 78 if (vp[i] < best) { 79 best = vp[i]; 83 if (best > lastbest) break; 89 lastbest = best;
|
/external/skia/src/gpu/gl/unix/ |
H A D | SkNativeGLContext_unix.cpp | 139 int best = -1, best_num_samp = -1; local 148 if (best < 0 || (samp_buf && samples > best_num_samp)) 149 best = i, best_num_samp = samples; 152 XVisualInfo temp = visReturn[best];
|
/external/clang/utils/ |
H A D | FindSpecRefs | 604 best = None 625 if best is None or dist < best[0]: 626 best = (dist, (section, name, page)) 627 return best[1] 637 best = None 641 if best is None or dist < best[0]: 642 best = (dist,'l'+m.group(1)) 644 if best i [all...] |
H A D | CmpDriver | 53 best = None 57 if best is None or candidate < best[0]: 58 best = (candidate, a_0, j) 59 a = best[1]
|
/external/chromium_org/third_party/libvpx/source/libvpx/vp8/encoder/ |
H A D | 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 [all...] |
/external/chromium_org/third_party/tcmalloc/chromium/src/ |
H A D | 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 [all...] |
/external/chromium_org/third_party/tcmalloc/vendor/src/ |
H A D | 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 [all...] |
/external/libvpx/libvpx/vp8/encoder/ |
H A D | 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 [all...] |
/external/chromium_org/third_party/libwebp/enc/ |
H A D | 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 [all...] |
/external/webp/src/enc/ |
H A D | 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 [all...] |
/external/qemu/distrib/sdl-1.2.15/src/video/x11/ |
H A D | SDL_x11modes.c | 126 int best = -1; local 133 best = i; 138 if ( best < 0 || 139 (modes[i]->hdisplay < modes[best]->hdisplay && 140 modes[i]->vdisplay <= modes[best]->vdisplay) || 141 (modes[i]->vdisplay < modes[best]->vdisplay && 142 modes[i]->hdisplay <= modes[best]->hdisplay) ) { 143 best = i; 147 if ( best >= 0 && 148 ((modes[best] [all...] |
/external/eigen/bench/btl/data/ |
H A D | mean.cxx | 113 cout << " <TH ALIGN=CENTER> in cache <BR> % best </TH>" << endl ; 115 cout << " <TH ALIGN=CENTER> out of cache <BR> % best </TH>" << endl ; 121 Lib_Mean best(*is); 129 cout << " <TD> " << 100*(is->_mean_in_cache/best._mean_in_cache) << " </TD>" << endl ; 131 cout << " <TD> " << 100*(is->_mean_out_of_cache/best._mean_out_of_cache) << " </TD>" << endl ;
|