| /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...] |
| /external/curl/lib/ |
| inet_ntop.c | 91 } best, cur; local
103 best.base = -1;
105 best.len = 0;
116 if(best.base == -1 || cur.len > best.len)
117 best = cur;
121 if((cur.base != -1) && (best.base == -1 || cur.len > best.len))
122 best = cur;
123 if(best.base != -1 && best.len < 2
[all...] |
| /external/syslinux/core/thread/ |
| schedule.c | 16 struct thread *st, *nt, *best; local
48 best = NULL;
60 if (!best || nt->prio < best->prio)
61 best = nt;
68 if (!best)
71 if (best != curr) {
76 dprintf("@ %llu -> %p (%s)\n", tsc, best, best->name);
77 __switch_to(best);
[all...] |
| /device/linaro/bootloader/edk2/StdLib/LibC/NetUtil/ |
| inet_ntop.c | 140 struct { int base, len; } best, cur;
local
156 best.base = -1;
157 best.len = 0;
168 if (best.base == -1 || cur.len > best.len)
169 best = cur;
175 if (best.base == -1 || cur.len > best.len)
176 best = cur;
178 if (best.base != -1 && best.len < 2)
[all...] |
| /external/c-ares/ |
| inet_ntop.c | 129 struct { int base, len; } best, cur; local
141 best.base = -1;
142 best.len = 0;
153 if (best.base == -1 || cur.len > best.len)
154 best = cur;
160 if (best.base == -1 || cur.len > best.len)
161 best = cur;
163 if (best.base != -1 && best.len < 2
[all...] |
| /external/tcpdump/missing/ |
| inet_ntop.c | 113 } best, cur; local
125 best.len = 0;
126 best.base = -1;
139 if (best.base == -1 || cur.len > best.len)
140 best = cur;
144 if ((cur.base != -1) && (best.base == -1 || cur.len > best.len))
145 best = cur;
146 if (best.base != -1 && best.len < 2
[all...] |
| /bionic/libc/upstream-openbsd/lib/libc/net/ |
| inet_ntop.c | 105 struct { int base, len; } best, cur; local
118 best.base = -1;
128 if (best.base == -1 || cur.len > best.len)
129 best = cur;
135 if (best.base == -1 || cur.len > best.len)
136 best = cur;
138 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/webrtc/talk/media/base/ |
| videocapturer_unittest.cc | 343 cricket::VideoFormat best; local
344 EXPECT_TRUE(capturer_.GetBestCaptureFormat(desired, &best));
345 EXPECT_EQ(640, best.width);
346 EXPECT_EQ(480, best.height);
347 EXPECT_EQ(cricket::VideoFormat::FpsToInterval(30), best.interval);
350 EXPECT_FALSE(capturer_.GetBestCaptureFormat(desired, &best));
353 EXPECT_TRUE(capturer_.GetBestCaptureFormat(desired, &best));
360 cricket::VideoFormat best; local
362 EXPECT_TRUE(capturer_.GetBestCaptureFormat(desired, &best));
363 EXPECT_EQ(1280, best.width)
418 cricket::VideoFormat best; local
510 cricket::VideoFormat best; local
548 cricket::VideoFormat best; local
585 cricket::VideoFormat best; local
616 cricket::VideoFormat best; local
681 cricket::VideoFormat best; local
[all...] |
| /device/google/contexthub/firmware/os/core/ |
| heap.c | 24 #define TIDX_HEAP_EXTRA 2 // must be >= 0; best if > 0, don't make it > 7, since it unnecessarily limits max heap size we can manage
117 struct HeapNode *node, *best = NULL; local
130 if (!node->used && node->size >= sz && (!best || best->size > node->size)) {
131 best = node;
132 if (best->size == sz)
139 if (!best) //alloc failed
142 if (best->size - sz > sizeof(struct HeapNode)) { //there is a point to split up the chunk
144 node = (struct HeapNode*)(best->data + sz);
148 node->size = best->size - sz - sizeof(struct HeapNode)
[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;
|
| /frameworks/compile/mclinker/lib/Support/ |
| TargetRegistry.cpp | 35 Target* best = NULL, * ambiguity = NULL; local
41 if (best == NULL || highest < quality) {
43 best = *target;
51 if (best == NULL) {
57 pError = std::string("Ambiguous targets: \"") + best->name() + "\" and \"" +
62 return best;
|
| /external/skia/tools/ |
| monobench.cpp | 42 ns best; member in struct:Bench
111 bench.best = std::min(bench.best, elapsed / loops);
114 struct Result { const char* name; ns best; }; member in struct:Result
118 sorted[i].best = benches[i].best;
121 return a.best < b.best;
127 SkDebugf(" %s %gns" , result.name, result.best.count());
129 SkDebugf(" %s %.3gx", result.name, result.best / sorted[0].best)
[all...] |
| /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 | 145 int tries = 2; // number of tries, we keep the best
262 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";
263 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";
269 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";
270 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";
280 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...] |
| dense_solvers.cpp | 74 results["LLT"][id] = t_llt.best();
75 results["LDLT"][id] = t_ldlt.best();
76 results["PartialPivLU"][id] = t_lu.best();
77 results["FullPivLU"][id] = t_fplu.best();
78 results["HouseholderQR"][id] = t_qr.best();
79 results["ColPivHouseholderQR"][id] = t_cpqr.best();
80 results["CompleteOrthogonalDecomposition"][id] = t_cod.best();
81 results["FullPivHouseholderQR"][id] = t_fpqr.best();
82 results["JacobiSVD"][id] = t_jsvd.best();
83 results["BDCSVD"][id] = t_bdcsvd.best();
[all...] |
| /packages/apps/TV/src/com/android/tv/util/ |
| TvTrackInfoUtils.java | 90 * Selects the best TvTrackInfo available or the first if none matches.
96 * @return the best matching track or the first one if none matches.
104 TvTrackInfo best = null;
106 if (comparator.compare(track, best) > 0) {
107 best = track;
110 return best;
|
| /libcore/ojluni/src/main/java/sun/misc/ |
| RegexpPool.java | 91 RegexpNode best = p; local
107 best = p;
119 best = p;
126 if (re.equals(best.re)) {
127 o = best.result;
128 best.result = null;
132 if (re.equals(best.re)) {
133 o = best.result;
134 best.result = null;
142 would match the string, the best match is returned first
193 RegexpNode best = p; local
[all...] |
| /external/libcups/cups/ |
| dest-options.c | 1715 *best = NULL, \/* Best matching entry *\/ local
[all...] |
| /external/syslinux/com32/lib/syslinux/ |
| zonelist.c | 199 struct syslinux_memmap *best = NULL; local
205 best = list;
212 if (!best)
215 *start = best->start;
235 addr_t size, best; local
237 for (best = 0; list->type != SMT_END; list = list->next) {
250 best = ALIGN_DOWN(list->start + size - len, align);
252 best = ALIGN_DOWN(ceiling - len, align);
254 if (best < *start)
255 best = 0
[all...] |
| /external/webrtc/webrtc/modules/audio_coding/codecs/isac/fix/source/ |
| pitch_estimator.c | 105 int32_t best[4]= {-100, -100, -100, -100}; local
109 if (in[k] > best[3]) {
110 if (in[k] > best[2]) {
111 if (in[k] > best[1]) {
112 if (in[k] > best[0]) { // The Best
113 best[3] = best[2];
115 best[2] = best[1]
[all...] |
| /packages/apps/Camera2/src/com/android/camera/one/v2/common/ |
| PictureSizeCalculator.java | 71 * @return The best natively-supported size to use.
113 Size best = null; local
120 best = candidate;
125 if (best == null) {
128 best = getLargestSupportedSize(supported);
131 return best;
|
| /libcore/luni/src/test/java/libcore/icu/ |
| ICUTest.java | 86 private String best(Locale l, String skeleton) { method in class:ICUTest
93 assertEquals("[d, M, y]", Arrays.toString(ICU.getDateFormatOrder(best(lv, "yyyy-M-dd"))));
94 assertEquals("[y, d, M]", Arrays.toString(ICU.getDateFormatOrder(best(lv, "yyyy-MMM-dd"))));
95 assertEquals("[d, M, \u0000]", Arrays.toString(ICU.getDateFormatOrder(best(lv, "MMM-dd"))));
97 assertEquals("[y, M, d]", Arrays.toString(ICU.getDateFormatOrder(best(fa, "yyyy-M-dd"))));
98 assertEquals("[d, M, y]", Arrays.toString(ICU.getDateFormatOrder(best(fa, "yyyy-MMM-dd"))));
99 assertEquals("[d, M, \u0000]", Arrays.toString(ICU.getDateFormatOrder(best(fa, "MMM-dd"))));
103 assertEquals("[M, d, y]", Arrays.toString(ICU.getDateFormatOrder(best(en_US, "yyyy-M-dd"))));
104 assertEquals("[M, d, y]", Arrays.toString(ICU.getDateFormatOrder(best(en_US, "yyyy-MMM-dd"))));
105 assertEquals("[M, d, \u0000]", Arrays.toString(ICU.getDateFormatOrder(best(en_US, "MMM-dd"))))
[all...] |
| /external/webp/src/enc/ |
| alpha_enc.c | 33 // prediction modes 0 to 3 and pick the best one.
203 // Quick estimate of the best candidate.
213 // For large number of colors, try FILTER_NONE in addition to the best
238 FilterTrial best; local
241 InitFilterTrial(&best);
253 if (ok && trial.score < best.score) {
254 VP8BitWriterWipeOut(&best.bw);
255 best = trial;
264 reduce_levels, effort_level, NULL, &best);
268 stats->lossless_features = best.stats.lossless_features
[all...] |
| /external/skia/tests/ |
| StrokerTest.cpp | 150 int best = 0; local
161 if (best < gMaxRecursion[2]) {
169 best = gMaxRecursion[2];
178 SkDebugf("\n%s max quad=%d\n", __FUNCTION__, best);
229 int best = 0; local
253 if (best < gMaxRecursion[2]) {
261 best = gMaxRecursion[2];
270 SkDebugf("\n%s max quad=%d\n", __FUNCTION__, best);
339 int best = 0; local
357 if (best < gMaxRecursion[2])
384 int best[2] = { 0 }; local
[all...] |
