Searched refs:best (Results 1 - 25 of 89) 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/skia/tests/
H A DStrokerTest.cpp134 int best = 0; local
145 if (best < gMaxRecursion[2]) {
153 best = gMaxRecursion[2];
162 SkDebugf("\n%s max quad=%d\n", __FUNCTION__, best);
213 int best = 0; local
237 if (best < gMaxRecursion[2]) {
245 best = gMaxRecursion[2];
254 SkDebugf("\n%s max quad=%d\n", __FUNCTION__, best);
323 int best = 0; local
341 if (best < gMaxRecursio
368 int best[2] = { 0 }; local
[all...]
/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.c150 int best, bestcount, which; local
162 best = bestcount = 0;
173 if ((dhg.size > wantbits && dhg.size < best) ||
174 (dhg.size > best && best < wantbits)) {
175 best = dhg.size;
178 if (dhg.size == best)
195 dhg.size != best ||
/external/zopfli/src/zopfli/
H A Dblocksplitter.c46 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/apache-commons-math/src/main/java/org/apache/commons/math/optimization/direct/
H A DMultiDirectional.java71 final RealPointValuePair best = original[0];
75 if (comparator.compare(reflected, best) < 0) {
91 if (comparator.compare(contracted, best) < 0) {
113 * @param comparator comparator to use to sort simplex vertices from best to poorest
114 * @return best point in the transformed simplex
H A DNelderMead.java83 final RealPointValuePair best = simplex[0];
88 // compute the centroid of the best vertices
109 if ((comparator.compare(best, reflected) <= 0) &&
115 } else if (comparator.compare(reflected, best) < 0) {
/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 DCmpDriver53 best = None
57 if best is None or candidate < best[0]:
58 best = (candidate, a_0, j)
59 a = best[1]
/external/libvpx/libvpx/vp8/encoder/
H A Dencodemb.c204 int best; local
270 /* And pick the best. */
271 best = rd_cost1 < rd_cost0;
275 tokens[i][0].rate = base_bits + (best ? rate1 : rate0);
276 tokens[i][0].error = d2 + (best ? error1 : error0);
280 best_mask[0] |= best << i;
336 /* And pick the best. */
337 best = rd_cost1 < rd_cost0;
345 tokens[i][1].rate = base_bits + (best ? rate1 : rate0);
346 tokens[i][1].error = d2 + (best
[all...]
/external/webp/src/enc/
H A Dalpha.c32 // prediction modes 0 to 3 and pick the best one.
215 // Quick estimate of the best candidate.
224 // For large number of colors, try FILTER_NONE in addition to the best
249 FilterTrial best; local
252 InitFilterTrial(&best);
263 if (ok && trial.score < best.score) {
264 VP8BitWriterWipeOut(&best.bw);
265 best = trial;
274 reduce_levels, effort_level, NULL, &best);
277 if (stats != NULL) *stats = 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/libexif/doc/
H A DMakefile.am34 (cd $(DOXYGEN_OUTPUT_DIR) && $(AMTAR) chof - $(HTML_APIDOC_DIR) | GZIP=--best gzip -c) > $@
46 (cd $(DOXYGEN_OUTPUT_DIR) && $(AMTAR) chof - $(HTML_APIDOC_INTERNALS_DIR) | GZIP=--best gzip -c) > $@
/external/okhttp/benchmarks/src/main/java/com/squareup/okhttp/benchmarks/
H A DBenchmark.java110 double best = 0.0;
122 best = Math.max(best, requestsPerSecond);
138 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 Dbitwriter.ml10 (* Note that this takes a moment to link, so it's best to keep the number of
/external/libvpx/libvpx/vp9/encoder/
H A Dvp9_encodemb.c116 int best, band, pt, i, final_eob; local
165 /* And pick the best. */
166 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;
225 /* And pick the best. */
226 best = rd_cost1 < rd_cost0;
241 tokens[i][1].rate = base_bits + (best ? rate1 : rate0);
242 tokens[i][1].error = d2 + (best
[all...]
/external/glide/third_party/gif_encoder/src/main/java/com/bumptech/glide/gifencoder/
H A DNeuQuant.java315 int best;
318 best = -1;
343 best = p[3];
368 best = p[3];
374 return (best);
463 /* finds best neuron (min dist-bias) and returns position */

Completed in 3947 milliseconds

1234