| /system/libhwbinder/vts/performance/ |
| PerfTest.cpp | 151 double best = (double)best_ / 1.0E6; local
156 << ", \"wst\":" << setw(W) << left << worst << ", \"bst\":" << setw(W) << left << best
|
| Benchmark_throughput.cpp | 113 // e.g. best/worst/total_time.
135 double best = (double) m_best / 1.0E6; local
142 << "ms best:"
143 << best
|
| /external/syslinux/com32/lib/syslinux/ |
| movebits.c | 185 const struct syslinux_memmap *best = NULL; local
194 if (!best || best_len > slen) {
195 best = s;
201 if (best) {
202 *start = best->start;
|
| /frameworks/minikin/libs/minikin/ |
| LineBreaker.cpp | 321 // and mPreBreak is its preBreak value. mBestBreak is the index of the best line breaking candidate
324 // This break would create an overfull line, pick the best break and break there (greedy)
334 // remaining part still doesn't fit. We now need to break at the second best place after the
436 float best = SCORE_INFTY; local
462 if (jScore + bestHope >= best) continue;
496 if (score <= best) {
497 best = score;
501 mCandidates[i].score = best + mCandidates[i].penalty + mLinePenalty;
|
| /external/syslinux/efi/ |
| main.c | 485 EFI_PHYSICAL_ADDRESS best; local
501 /* What's the best address? */
503 best = min;
505 best = m->PhysicalStart;
507 start = round_up(best, align);
523 /* What's the best address? */
525 best = max - size;
527 best = end - size;
529 start = round_down(best, align);
1116 * just allocate some memory and hope for the best
[all...] |
| /external/syslinux/gpxe/src/net/udp/ |
| dhcp.c | 345 struct dhcp_offer *best = NULL; local
350 ( ( best == NULL ) ||
351 ( offer->priority > best->priority ) ||
352 ( ( offer->priority == best->priority ) &&
353 ( offer->valid & ~best->valid ) ) ) )
354 best = offer;
357 return best;
647 /* Locate best source of PXE settings */
[all...] |
| /packages/apps/Gallery/src/com/android/camera/ |
| ViewImage.java | [all...] |
| /toolchain/binutils/binutils-2.25/opcodes/ |
| m68k-dis.c | 1320 /* Try to match the current instruction to best and if so, return the
1326 const struct m68k_opcode * best)
1331 const char *args = best->args;
1390 if (p - buffer < 4 && (best->match & 0xFFFF) != 0)
1396 && (best->match & 0xffff) == 0xffff
[all...] |
| /external/mesa3d/src/mesa/main/ |
| texcompress_fxt1.c | 265 GLint i, j, best = -1; local
275 best = j;
279 return best;
309 GLint i, k, best = 0; local
324 best = i;
331 return best;
473 GLint best = -1; local
475 /* determine best vector */
485 best = j;
489 GLint best = fxt1_bestcol(vec, nv, input[k], nc, &err)
[all...] |
| /external/eigen/bench/ |
| geometry.cpp | 78 cout << timer.best() << " ";
|
| /external/libvpx/libvpx/vp8/common/ |
| findnearmv.h | 73 int_mv *nearby, int_mv *best, int near_mv_ref_cts[4],
|
| /external/protobuf/js/ |
| debug.js | 46 * This function makes a best effort and may not work in all cases. It will not
69 * make a best effort in creating a human readable representation of the
|
| /prebuilts/go/darwin-x86/src/cmd/compile/internal/gc/ |
| dcl.go | 1338 // best maps from the ODCLFUNC of each visited function that
1341 best map[*Node]nowritebarrierrecCall
1352 best: make(map[*Node]nowritebarrierrecCall),
1358 c.best[n] = nowritebarrierrecCall{target: nil, depth: 0, lineno: n.Func.WBLineno}
1390 call, hasWB := c.best[n]
1400 call = c.best[n]
1441 fnbest, ok := c.best[defn]
1445 best, ok := c.best[c.curfn]
1446 if ok && fnbest.depth+1 >= best.depth
[all...] |
| /prebuilts/go/linux-x86/src/cmd/compile/internal/gc/ |
| dcl.go | 1338 // best maps from the ODCLFUNC of each visited function that
1341 best map[*Node]nowritebarrierrecCall
1352 best: make(map[*Node]nowritebarrierrecCall),
1358 c.best[n] = nowritebarrierrecCall{target: nil, depth: 0, lineno: n.Func.WBLineno}
1390 call, hasWB := c.best[n]
1400 call = c.best[n]
1441 fnbest, ok := c.best[defn]
1445 best, ok := c.best[c.curfn]
1446 if ok && fnbest.depth+1 >= best.depth
[all...] |
| /external/fio/ |
| graph.c | 962 struct graph_value *best = NULL; local
1008 best = v;
1020 if (best)
1024 if (best)
1025 return best->tooltip;
|
| /external/selinux/libselinux/src/ |
| label_file.c | 843 int best = -1; local
864 best = 0;
876 best = i;
882 if (best >= 0) {
884 lr = &specs[best]->lr;
|
| /external/zopfli/src/zopfli/ |
| deflate.c | 256 int best = 0; local
265 best = i;
270 best & 1, best & 2, best & 4,
751 Does squeeze strategy where first the best possible lz77 is done, and then based
|
| /external/freetype/src/pshinter/ |
| pshglob.c | 90 FT_Pos best = 64 + 32 + 2;
104 if ( dist < best )
106 best = dist;
|
| /external/pdfium/third_party/freetype/src/pshinter/ |
| pshglob.c | 90 FT_Pos best = 64 + 32 + 2;
104 if ( dist < best )
106 best = dist;
|
| /external/v8/benchmarks/ |
| raytrace.js | 682 var best = new Flog.RayTracer.IntersectionInfo();
683 best.distance = 2000;
690 if(info.isHit && info.distance >= 0 && info.distance < best.distance){
691 best = info;
696 best.hitCount = hits;
697 return best;
|
| /external/llvm/test/Bindings/OCaml/ |
| executionengine.ml | 14 (* Note that this takes a moment to link, so it's best to keep the number of
|
| /external/swiftshader/third_party/LLVM/test/Bindings/Ocaml/ |
| executionengine.ml | 10 (* Note that this takes a moment to link, so it's best to keep the number of
|
| /frameworks/native/libs/binder/tests/ |
| binderThroughputTest.cpp | 144 double best = (double)m_best / 1.0E6; local
147 cout << "average:" << average << "ms worst:" << worst << "ms best:" << best << "ms" << endl;
|
| schd-dbg.cpp | 245 double best = (double)m_best / 1.0E6; local
252 << ",\"bst\":" << setw(W) << left << best << ",\"miss\":" << left
|
| /packages/inputmethods/OpenWnn/src/jp/co/omronsoft/openwnn/JAJP/ |
| OpenWnnClauseConverterJAJP.java | 179 /* there may be no way to be the best sequence from the 'start' */
184 /* there may be no way to be the best sequence from the 'start' */
215 /* update the best sub-sentence on the cache buffer */
349 /* reserve only the best clause */
350 WnnClause best = (WnnClause)clauseList.get(0); local
351 if (best.frequency < clause.frequency) {
|
