/packages/apps/Camera/jni/feature_stab/db_vlvm/ |
db_utilities_indexing.h | 96 double best; local 99 best=s[0];pos=0; 100 if(s[1]>best){best=s[1];pos=1;} 101 if(s[2]>best){best=s[2];pos=2;} 107 double best; local 110 best=s[0];pos=0; 111 if(s[1]>best){best=s[1];pos=1; 119 double best; local 132 double best; local 146 double best; local 161 double best; local 176 double best; local 193 double t,best; local 204 double t,best; local [all...] |
/packages/apps/Gallery2/jni_mosaic/feature_stab/db_vlvm/ |
db_utilities_indexing.h | 96 double best; local 99 best=s[0];pos=0; 100 if(s[1]>best){best=s[1];pos=1;} 101 if(s[2]>best){best=s[2];pos=2;} 107 double best; local 110 best=s[0];pos=0; 111 if(s[1]>best){best=s[1];pos=1; 119 double best; local 132 double best; local 146 double best; local 161 double best; local 176 double best; local 193 double t,best; local 204 double t,best; local [all...] |
/packages/apps/LegacyCamera/jni/feature_stab/db_vlvm/ |
db_utilities_indexing.h | 96 double best; local 99 best=s[0];pos=0; 100 if(s[1]>best){best=s[1];pos=1;} 101 if(s[2]>best){best=s[2];pos=2;} 107 double best; local 110 best=s[0];pos=0; 111 if(s[1]>best){best=s[1];pos=1; 119 double best; local 132 double best; local 146 double best; local 161 double best; local 176 double best; local 193 double t,best; local 204 double t,best; local [all...] |
/bionic/libc/upstream-netbsd/libc/inet/ |
inet_ntop.c | 135 struct { int base, len; } best, cur; local 151 best.base = -1; 152 best.len = 0; 163 if (best.base == -1 || cur.len > best.len) 164 best = cur; 170 if (best.base == -1 || cur.len > best.len) 171 best = cur; 173 if (best.base != -1 && best.len < 2 [all...] |
/external/openssh/openbsd-compat/ |
inet_ntop.c | 119 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.len < 2 [all...] |
/external/tcpdump/missing/ |
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.len < 2 [all...] |
/ndk/sources/host-tools/make-3.81/ |
strcache.c | 60 struct strcache *best = NULL; local 71 the blocks and choose the one with the best fit (the one that leaves the 74 if (sp->bytesfree > len && (!best || best->bytesfree > sp->bytesfree)) 75 best = sp; 78 if (!best) 79 best = new_cache(); 81 assert (best->bytesfree > len); 83 /* Add the string to the best cache. */ 84 res = best->end [all...] |
/external/ppp/pppd/plugins/pppoatm/ |
misc.c | 24 int i,best; local 30 best = -1; 35 best = i; 40 if (best > -1) (*pos) += best_len; 41 return best;
|
/external/eigen/bench/ |
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";
|
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_TIMER)/rep << "s \t" << (double(m)*n*p*rep*2/tmono.best(CPU_TIMER))*1e-9 << " GFLOPS \t(" (…) [all...] |
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/webrtc/src/modules/audio_coding/codecs/isac/fix/source/ |
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] [all...] |
/external/openssh/ |
dh.c | 129 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/ |
http_auth.cc | 36 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/ |
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/ |
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 is not None [all...] |
CmpDriver | 48 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/ |
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 ? error1 : error0) [all...] |
/external/qemu/distrib/sdl-1.2.15/src/video/x11/ |
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]->hdisplay != mode.hdisplay) | [all...] |
/packages/apps/Gallery2/jni/filters/ |
kmeans.h | 157 int best = findClosest<T, N>(values + x, oldCenters, dimension, stride, pop_size); local 158 add<T, N>(values + x, tmp + best, dimension); 159 popularities[best / stride]++; 227 int best = findClosest<T, N>(values + x, centroids, dimension, stride, pop_size); local 228 set<T, T>(values + x, centroids + best, dimension);
|
/external/eigen/bench/btl/data/ |
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 ;
|
/external/quake/quake/src/WinQuake/ |
pr_exec.cpp | 224 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/ |
rtcd.sh | 92 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/ |
PathProfileInfo.cpp | 123 BallLarusEdge* best = 0; local 130 (!best || (best->getWeight() < (*next)->getWeight())) ) // best one? 131 best = *next; 134 return best;
|
/ndk/sources/host-tools/sed-4.2.1/sed/ |
fmt.c | 40 "best". Adjust to taste, subject to the caveats given. */ 131 short line_length; /* length of the best line starting here */ 132 COST best_cost; /* cost of best paragraph starting here */ 438 register COST wcost, best; local 447 best = MAXCOST; 463 if (wcost < best) 465 best = wcost; 472 start->best_cost = best + base_cost (start);
|