Searched refs:best (Results 1 - 25 of 87) sorted by relevance

1234

/external/openssh/openbsd-compat/
H A Dinet_ntop.c119 struct { int base, len; } best, cur; local
132 best.base = -1;
142 if (best.base == -1 || cur.len > best.len)
143 best = cur;
149 if (best.base == -1 || cur.len > best.len)
150 best = cur;
152 if (best.base != -1 && best
[all...]
/external/tcpdump/missing/
H A Dinet_ntop.c117 } 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/ppp/pppd/plugins/pppoatm/
H A Dmisc.c24 int i,best; local
30 best = -1;
35 best = i;
40 if (best > -1) (*pos) += best_len;
41 return best;
/external/eigen/bench/
H A Dquatmul.cpp33 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 Dbench_gemm.cpp129 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 Dsparse_dense_product.cpp80 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;
H A Dproduct_threshold.cpp60 } while(t.best()<0.1);
66 std::cout << int(1e-6*n*rep/t.best()) << "\t";
H A DBenchTimer.h41 /** 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/webrtc/src/modules/audio_coding/codecs/isac/fix/source/
H A Dpitch_estimator.c120 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/openssh/
H A Ddh.c129 int best, bestcount, which; local
141 best = bestcount = 0;
152 if ((dhg.size > wantbits && dhg.size < best) ||
153 (dhg.size > best && best < wantbits)) {
154 best = dhg.size;
157 if (dhg.size == best)
174 dhg.size != best ||
/external/chromium/net/http/
H A Dhttp_auth.cc36 scoped_ptr<HttpAuthHandler> best; local
49 if (cur.get() && (!best.get() || best->score() < cur->score()) &&
51 best.swap(cur);
53 handler->swap(best);
/external/skia/src/gpu/gl/unix/
H A DSkNativeGLContext_unix.cpp139 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 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 i
[all...]
H A DCmpDriver48 best = None
52 if best is None or candidate < best[0]:
53 best = (candidate, a_0, j)
54 a = best[1]
/external/libvpx/libvpx/vp8/encoder/
H A Dencodemb.c252 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/qemu/distrib/sdl-1.2.15/src/video/x11/
H A DSDL_x11modes.c126 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 Dmean.cxx113 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 ;
/external/quake/quake/src/WinQuake/
H A Dpr_exec.cpp224 dfunction_t *f, *best; local
233 best = NULL;
240 best = f;
243 if (best)
246 Con_Printf ("%7i %s\n", best->profile, pr_strings+best->s_name);
248 best->profile = 0;
250 } while (best);
/external/libvpx/libvpx/build/make/
H A Drtcd.sh92 local best=$(eval "echo \$${fn}_default")
93 local best_ofn=$(eval "echo \$${best}")
94 [ -n "$best" ] && [ "$best_ofn" != "$ofn" ] && eval "${best}_link=false"
/external/llvm/lib/Analysis/
H A DPathProfileInfo.cpp123 BallLarusEdge* best = 0; local
130 (!best || (best->getWeight() < (*next)->getWeight())) ) // best one?
131 best = *next;
134 return best;
/external/jdiff/src/jdiff/
H A DDiffMyers.java207 int best = 0;
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 >
[all...]
/external/llvm/test/Bindings/Ocaml/
H A Danalysis.ml9 (* Note that this takes a moment to link, so it's best to keep the number of
H A Dbitwriter.ml7 (* Note that this takes a moment to link, so it's best to keep the number of
/external/quake/quake/src/QW/server/
H A Dpr_exec.c224 dfunction_t *f, *best; local
233 best = NULL;
240 best = f;
243 if (best)
246 Con_Printf ("%7i %s\n", best->profile, PR_GetString(best->s_name));
248 best->profile = 0;
250 } while (best);
/external/libvorbis/vq/
H A Dbookutil.c52 int best=-1; local
63 if(best==-1 || this<best){
64 best=this;

Completed in 621 milliseconds

1234