Home
last modified time | relevance | path

Searched refs:best (Results 1 – 25 of 521) sorted by relevance

12345678910>>...21

/external/chromium_org/third_party/libjingle/source/talk/media/base/
Dvideocapturer_unittest.cc235 cricket::VideoFormat best; in TEST_F() local
236 EXPECT_TRUE(capturer_.GetBestCaptureFormat(desired, &best)); in TEST_F()
237 EXPECT_EQ(640, best.width); in TEST_F()
238 EXPECT_EQ(480, best.height); in TEST_F()
239 EXPECT_EQ(cricket::VideoFormat::FpsToInterval(30), best.interval); in TEST_F()
242 EXPECT_FALSE(capturer_.GetBestCaptureFormat(desired, &best)); in TEST_F()
245 EXPECT_TRUE(capturer_.GetBestCaptureFormat(desired, &best)); in TEST_F()
252 cricket::VideoFormat best; in TEST_F() local
254 EXPECT_TRUE(capturer_.GetBestCaptureFormat(desired, &best)); in TEST_F()
255 EXPECT_EQ(1280, best.width); in TEST_F()
[all …]
/external/tcpdump/missing/
Dinet_ntop.c117 } best, cur; in inet_ntop_v6() local
129 best.base = -1; in inet_ntop_v6()
141 if (best.base == -1 || cur.len > best.len) in inet_ntop_v6()
142 best = cur; in inet_ntop_v6()
146 if ((cur.base != -1) && (best.base == -1 || cur.len > best.len)) in inet_ntop_v6()
147 best = cur; in inet_ntop_v6()
148 if (best.base != -1 && best.len < 2) in inet_ntop_v6()
149 best.base = -1; in inet_ntop_v6()
158 if (best.base != -1 && i >= best.base && i < (best.base + best.len)) in inet_ntop_v6()
160 if (i == best.base) in inet_ntop_v6()
[all …]
/external/openssh/openbsd-compat/
Dinet_ntop.c119 struct { int base, len; } best, cur; in inet_ntop6() local
132 best.base = -1; in inet_ntop6()
142 if (best.base == -1 || cur.len > best.len) in inet_ntop6()
143 best = cur; in inet_ntop6()
149 if (best.base == -1 || cur.len > best.len) in inet_ntop6()
150 best = cur; in inet_ntop6()
152 if (best.base != -1 && best.len < 2) in inet_ntop6()
153 best.base = -1; in inet_ntop6()
162 if (best.base != -1 && i >= best.base && in inet_ntop6()
163 i < (best.base + best.len)) { in inet_ntop6()
[all …]
/external/eigen/bench/
Dbench_gemm.cpp202 …std::cout << "blas cpu " << tblas.best(CPU_TIMER)/rep << "s \t" << (double(m)*n*p*rep*2… in main()
203 …std::cout << "blas real " << tblas.best(REAL_TIMER)/rep << "s \t" << (double(m)*n*p*rep*2… in main()
209 …std::cout << "eigen cpu " << tmt.best(CPU_TIMER)/rep << "s \t" << (double(m)*n*p*rep*2/t… in main()
210 …std::cout << "eigen real " << tmt.best(REAL_TIMER)/rep << "s \t" << (double(m)*n*p*rep*2/t… in main()
220 …std::cout << "eigen mono cpu " << tmono.best(CPU_TIMER)/rep << "s \t" << (double(m)*n*p*rep*2… in main()
221 …std::cout << "eigen mono real " << tmono.best(REAL_TIMER)/rep << "s \t" << (double(m)*n*p*rep*2… in main()
222 …t << "mt speed up x" << tmono.best(CPU_TIMER) / tmt.best(REAL_TIMER) << " => " << (100.0*tmono.be… in main()
238 …std::cout << "\"matlab\" cpu " << t.best(CPU_TIMER)/rep << "s \t" << (double(m)*n*p*rep*2/t.b… in main()
239 …std::cout << "\"matlab\" real " << t.best(REAL_TIMER)/rep << "s \t" << (double(m)*n*p*rep*2/t.b… in main()
251 …std::cout << "\"matlab\" cpu " << t.best(CPU_TIMER)/rep << "s \t" << (double(m)*n*p*rep*2/t.b… in main()
[all …]
Dquatmul.cpp33 …std::cout << label << " default " << 1e3*t.best(CPU_TIMER) << "ms \t" << 1e-6*double(rep)/(t.best in bench()
36 …std::cout << label << " novec " << 1e3*t.best(CPU_TIMER) << "ms \t" << 1e-6*double(rep)/(t.best in bench()
Dsparse_dense_product.cpp80 …std::cout << " a * v:\t" << timer.best() << " " << double(REPEAT)/timer.best() << " * / sec " <… in main()
87 std::cout << " a' * v:\t" << timer.best() << endl; in main()
96 …std::cout << " a * v:\t" << timer.best()/REPEAT << " " << double(REPEAT)/timer.best(REAL_TIMER)… in main()
101 std::cout << " a' * v:\t" << timer.best()/REPEAT << endl; in main()
/external/ppp/pppd/plugins/pppoatm/
Dmisc.c24 int i,best; in __atmlib_fetch() local
30 best = -1; in __atmlib_fetch()
35 best = i; in __atmlib_fetch()
40 if (best > -1) (*pos) += best_len; in __atmlib_fetch()
41 return best; in __atmlib_fetch()
/external/webrtc/src/modules/audio_coding/codecs/isac/fix/source/
Dpitch_estimator.c120 WebRtc_Word32 best[4]= {-100, -100, -100, -100}; in FindFour32() local
124 if (in[k] > best[3]) { in FindFour32()
125 if (in[k] > best[2]) { in FindFour32()
126 if (in[k] > best[1]) { in FindFour32()
127 if (in[k] > best[0]) { // The Best in FindFour32()
128 best[3] = best[2]; in FindFour32()
130 best[2] = best[1]; in FindFour32()
132 best[1] = best[0]; in FindFour32()
134 best[0] = in[k]; in FindFour32()
137 best[3] = best[2]; in FindFour32()
[all …]
/external/clang/utils/
DFindSpecRefs604 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 is not None:
645 return best[1]
DCmpDriver48 best = None
52 if best is None or candidate < best[0]:
53 best = (candidate, a_0, j)
54 a = best[1]
/external/chromium_org/third_party/tcmalloc/vendor/src/
Dpage_heap.cc112 Span *best = NULL; in AllocLarge() local
119 if ((best == NULL) in AllocLarge()
120 || (span->length < best->length) in AllocLarge()
121 || ((span->length == best->length) && (span->start < best->start))) { in AllocLarge()
122 best = span; in AllocLarge()
123 ASSERT(best->location == Span::ON_NORMAL_FREELIST); in AllocLarge()
133 if ((best == NULL) in AllocLarge()
134 || (span->length < best->length) in AllocLarge()
135 || ((span->length == best->length) && (span->start < best->start))) { in AllocLarge()
136 best = span; in AllocLarge()
[all …]
/external/openssh/
Ddh.c129 int best, bestcount, which; in choose_dh() local
141 best = bestcount = 0; in choose_dh()
152 if ((dhg.size > wantbits && dhg.size < best) || in choose_dh()
153 (dhg.size > best && best < wantbits)) { in choose_dh()
154 best = dhg.size; in choose_dh()
157 if (dhg.size == best) in choose_dh()
174 dhg.size != best || in choose_dh()
/external/chromium_org/third_party/tcmalloc/chromium/src/
Dpage_heap.cc113 Span *best = NULL; in AllocLarge() local
120 if ((best == NULL) in AllocLarge()
121 || (span->length < best->length) in AllocLarge()
122 || ((span->length == best->length) && (span->start < best->start))) { in AllocLarge()
123 best = span; in AllocLarge()
124 ASSERT(best->location == Span::ON_NORMAL_FREELIST); in AllocLarge()
134 if ((best == NULL) in AllocLarge()
135 || (span->length < best->length) in AllocLarge()
136 || ((span->length == best->length) && (span->start < best->start))) { in AllocLarge()
137 best = span; in AllocLarge()
[all …]
/external/libvpx/libvpx/vp8/encoder/
Dencodemb.c252 int best; in optimize_b() local
326 best = rd_cost1 < rd_cost0; in optimize_b()
330 tokens[i][0].rate = base_bits + (best ? rate1 : rate0); in optimize_b()
331 tokens[i][0].error = d2 + (best ? error1 : error0); in optimize_b()
335 best_mask[0] |= best << i; in optimize_b()
392 best = rd_cost1 < rd_cost0; in optimize_b()
400 tokens[i][1].rate = base_bits + (best ? rate1 : rate0); in optimize_b()
401 tokens[i][1].error = d2 + (best ? error1 : error0); in optimize_b()
403 tokens[i][1].token =best?t1:t0; in optimize_b()
405 best_mask[1] |= best << i; in optimize_b()
[all …]
/external/chromium/net/http/
Dhttp_auth.cc36 scoped_ptr<HttpAuthHandler> best; in ChooseBestChallenge() local
49 if (cur.get() && (!best.get() || best->score() < cur->score()) && in ChooseBestChallenge()
51 best.swap(cur); in ChooseBestChallenge()
53 handler->swap(best); in ChooseBestChallenge()
/external/qemu/distrib/sdl-1.2.15/src/video/x11/
DSDL_x11modes.c126 int best = -1; in set_best_resolution() local
133 best = i; in set_best_resolution()
138 if ( best < 0 || in set_best_resolution()
139 (modes[i]->hdisplay < modes[best]->hdisplay && in set_best_resolution()
140 modes[i]->vdisplay <= modes[best]->vdisplay) || in set_best_resolution()
141 (modes[i]->vdisplay < modes[best]->vdisplay && in set_best_resolution()
142 modes[i]->hdisplay <= modes[best]->hdisplay) ) { in set_best_resolution()
143 best = i; in set_best_resolution()
147 if ( best >= 0 && in set_best_resolution()
148 ((modes[best]->hdisplay != mode.hdisplay) || in set_best_resolution()
[all …]
/external/chromium_org/net/http/
Dhttp_auth.cc36 scoped_ptr<HttpAuthHandler> best; in ChooseBestChallenge() local
49 if (cur.get() && (!best.get() || best->score() < cur->score()) && in ChooseBestChallenge()
51 best.swap(cur); in ChooseBestChallenge()
53 handler->swap(best); in ChooseBestChallenge()
/external/chromium_org/third_party/skia/src/gpu/gl/unix/
DSkNativeGLContext_unix.cpp139 int best = -1, best_num_samp = -1; in createGLContext() local
148 if (best < 0 || (samp_buf && samples > best_num_samp)) in createGLContext()
149 best = i, best_num_samp = samples; in createGLContext()
152 XVisualInfo temp = visReturn[best]; in createGLContext()
/external/skia/src/gpu/gl/unix/
DSkNativeGLContext_unix.cpp139 int best = -1, best_num_samp = -1; in createGLContext() local
148 if (best < 0 || (samp_buf && samples > best_num_samp)) in createGLContext()
149 best = i, best_num_samp = samples; in createGLContext()
152 XVisualInfo temp = visReturn[best]; in createGLContext()
/external/jdiff/src/jdiff/
DDiffMyers.java207 int best = 0; in diag() local
215 if (fd[fdiagoff + d] * 2 - dd > best in diag()
230 best = fd[fdiagoff + d] * 2 - dd; in diag()
236 if (best > 0) in diag()
242 best = 0; in diag()
248 if ((xlim - bd[bdiagoff + d]) * 2 + dd > best in diag()
262 best = (xlim - bd[bdiagoff + d]) * 2 + dd; in diag()
268 if (best > 0) in diag()
/external/chromium_org/chrome/browser/search_engines/
Dutil.cc96 UncheckedURLMap::iterator best = unchecked_urls.begin(); in RemoveDuplicatePrepopulateIDs() local
101 best = i; in RemoveDuplicatePrepopulateIDs()
111 best = i; in RemoveDuplicatePrepopulateIDs()
113 } else if (i->second->id() < best->second->id()) { in RemoveDuplicatePrepopulateIDs()
114 best = i; in RemoveDuplicatePrepopulateIDs()
119 checked_urls.push_back(best->second); in RemoveDuplicatePrepopulateIDs()
121 if (i == best) in RemoveDuplicatePrepopulateIDs()
/external/libvpx/libvpx/vp9/encoder/
Dvp9_encodemb.c132 int best, band, pt; in optimize_b() local
192 best = rd_cost1 < rd_cost0; in optimize_b()
196 tokens[i][0].rate = base_bits + (best ? rate1 : rate0); in optimize_b()
197 tokens[i][0].error = d2 + (best ? error1 : error0); in optimize_b()
201 best_index[i][0] = best; in optimize_b()
247 best = rd_cost1 < rd_cost0; in optimize_b()
254 tokens[i][1].rate = base_bits + (best ? rate1 : rate0); in optimize_b()
255 tokens[i][1].error = d2 + (best ? error1 : error0); in optimize_b()
257 tokens[i][1].token = best ? t1 : t0; in optimize_b()
259 best_index[i][1] = best; in optimize_b()
[all …]
/external/libvpx/libvpx/build/make/
Drtcd.sh92 best=$(eval "echo \$${fn}_default")
93 best_ofn=$(eval "echo \$${best}")
94 [ -n "$best" ] && [ "$best_ofn" != "$ofn" ] && eval "${best}_link=false"
/external/eigen/bench/btl/data/
Dmean.cxx121 Lib_Mean best(*is); in main() local
129 cout << " <TD> " << 100*(is->_mean_in_cache/best._mean_in_cache) << " </TD>" << endl ; in main()
131 … cout << " <TD> " << 100*(is->_mean_out_of_cache/best._mean_out_of_cache) << " </TD>" << endl ; in main()
/external/llvm/lib/Analysis/
DPathProfileInfo.cpp123 BallLarusEdge* best = 0; in getNextEdge() local
130 (!best || (best->getWeight() < (*next)->getWeight())) ) // best one? in getNextEdge()
131 best = *next; in getNextEdge()
134 return best; in getNextEdge()

12345678910>>...21