| /external/webrtc/talk/media/base/ |
| D | videocapturer_unittest.cc | 343 cricket::VideoFormat best; in TEST_F() local
344 EXPECT_TRUE(capturer_.GetBestCaptureFormat(desired, &best)); in TEST_F()
345 EXPECT_EQ(640, best.width); in TEST_F()
346 EXPECT_EQ(480, best.height); in TEST_F()
347 EXPECT_EQ(cricket::VideoFormat::FpsToInterval(30), best.interval); in TEST_F()
350 EXPECT_FALSE(capturer_.GetBestCaptureFormat(desired, &best)); in TEST_F()
353 EXPECT_TRUE(capturer_.GetBestCaptureFormat(desired, &best)); in TEST_F()
360 cricket::VideoFormat best; in TEST_F() local
362 EXPECT_TRUE(capturer_.GetBestCaptureFormat(desired, &best)); in TEST_F()
363 EXPECT_EQ(1280, best.width); in TEST_F()
[all …]
|
| /external/curl/lib/ |
| D | inet_ntop.c | 91 } best, cur; in inet_ntop6() local
103 best.base = -1; in inet_ntop6()
105 best.len = 0; in inet_ntop6()
116 if(best.base == -1 || cur.len > best.len) in inet_ntop6()
117 best = cur; in inet_ntop6()
121 if((cur.base != -1) && (best.base == -1 || cur.len > best.len)) in inet_ntop6()
122 best = cur; in inet_ntop6()
123 if(best.base != -1 && best.len < 2) in inet_ntop6()
124 best.base = -1; in inet_ntop6()
129 if(best.base != -1 && i >= best.base && i < (best.base + best.len)) { in inet_ntop6()
[all …]
|
| /external/tcpdump/ |
| D | addrtostr.c | 115 } best, cur; in addrtostr6() local
126 best.len = 0; in addrtostr6()
127 best.base = -1; in addrtostr6()
140 if (best.base == -1 || cur.len > best.len) in addrtostr6()
141 best = cur; in addrtostr6()
145 if ((cur.base != -1) && (best.base == -1 || cur.len > best.len)) in addrtostr6()
146 best = cur; in addrtostr6()
147 if (best.base != -1 && best.len < 2) in addrtostr6()
148 best.base = -1; in addrtostr6()
167 if (best.base != -1 && i >= best.base && i < (best.base + best.len)) in addrtostr6()
[all …]
|
| /external/openssh/openbsd-compat/ |
| D | inet_ntop.c | 119 struct { int base, len; } best, cur; in inet_ntop6() local
132 best.base = -1; in inet_ntop6()
142 if (best.base == -1 || cur.len > best.len) in inet_ntop6()
143 best = cur; in inet_ntop6()
149 if (best.base == -1 || cur.len > best.len) in inet_ntop6()
150 best = cur; in inet_ntop6()
152 if (best.base != -1 && best.len < 2) in inet_ntop6()
153 best.base = -1; in inet_ntop6()
162 if (best.base != -1 && i >= best.base && in inet_ntop6()
163 i < (best.base + best.len)) { in inet_ntop6()
[all …]
|
| /external/libcups/cups/ |
| D | dest-options.c | 1797 *best = NULL, /* Best matching entry */ in cups_get_media_db() local
1833 best = mdb; in cups_get_media_db()
1841 if (best->left != 0 || best->right != 0 || best->top != 0 || best->bottom != 0) in cups_get_media_db()
1847 if (mdb->left <= best->left && mdb->right <= best->right && in cups_get_media_db()
1848 mdb->top <= best->top && mdb->bottom <= best->bottom) in cups_get_media_db()
1850 best = mdb; in cups_get_media_db()
1864 (best->left || best->right || best->top || best->bottom)) in cups_get_media_db()
1877 if (mdb->left >= best->left && mdb->right >= best->right && in cups_get_media_db()
1878 mdb->top >= best->top && mdb->bottom >= best->bottom && in cups_get_media_db()
1879 …(mdb->bottom != best->bottom || mdb->left != best->left || mdb->right != best->right || mdb->top !… in cups_get_media_db()
[all …]
|
| /external/eigen/bench/ |
| D | bench_gemm.cpp | 262 …std::cout << "blas cpu " << tblas.best(CPU_TIMER)/rep << "s \t" << (double(m)*n*p*rep*2… in main()
263 …std::cout << "blas real " << tblas.best(REAL_TIMER)/rep << "s \t" << (double(m)*n*p*rep*2… in main()
269 …std::cout << "eigen cpu " << tmt.best(CPU_TIMER)/rep << "s \t" << (double(m)*n*p*rep*2/t… in main()
270 …std::cout << "eigen real " << tmt.best(REAL_TIMER)/rep << "s \t" << (double(m)*n*p*rep*2/t… in main()
280 …std::cout << "eigen mono cpu " << tmono.best(CPU_TIMER)/rep << "s \t" << (double(m)*n*p*rep*2… in main()
281 …std::cout << "eigen mono real " << tmono.best(REAL_TIMER)/rep << "s \t" << (double(m)*n*p*rep*2… in main()
282 …t << "mt speed up x" << tmono.best(CPU_TIMER) / tmt.best(REAL_TIMER) << " => " << (100.0*tmono.be… in main()
291 …std::cout << "lazy cpu " << tmt.best(CPU_TIMER)/rep << "s \t" << (double(m)*n*p*rep*2/tm… in main()
292 …std::cout << "lazy real " << tmt.best(REAL_TIMER)/rep << "s \t" << (double(m)*n*p*rep*2/tm… in main()
307 …std::cout << "\"matlab\" cpu " << t.best(CPU_TIMER)/rep << "s \t" << (double(m)*n*p*rep*2/t.b… in main()
[all …]
|
| D | dense_solvers.cpp | 74 results["LLT"][id] = t_llt.best(); in bench()
75 results["LDLT"][id] = t_ldlt.best(); in bench()
76 results["PartialPivLU"][id] = t_lu.best(); in bench()
77 results["FullPivLU"][id] = t_fplu.best(); in bench()
78 results["HouseholderQR"][id] = t_qr.best(); in bench()
79 results["ColPivHouseholderQR"][id] = t_cpqr.best(); in bench()
80 results["CompleteOrthogonalDecomposition"][id] = t_cod.best(); in bench()
81 results["FullPivHouseholderQR"][id] = t_fpqr.best(); in bench()
82 results["JacobiSVD"][id] = t_jsvd.best(); in bench()
83 results["BDCSVD"][id] = t_bdcsvd.best(); in bench()
|
| D | quatmul.cpp | 33 …std::cout << label << " default " << 1e3*t.best(CPU_TIMER) << "ms \t" << 1e-6*double(rep)/(t.best… in bench()
36 …std::cout << label << " novec " << 1e3*t.best(CPU_TIMER) << "ms \t" << 1e-6*double(rep)/(t.best… in bench()
|
| D | sparse_dense_product.cpp | 80 …std::cout << " a * v:\t" << timer.best() << " " << double(REPEAT)/timer.best() << " * / sec " <… in main()
87 std::cout << " a' * v:\t" << timer.best() << endl; in main()
96 …std::cout << " a * v:\t" << timer.best()/REPEAT << " " << double(REPEAT)/timer.best(REAL_TIMER)… in main()
101 std::cout << " a' * v:\t" << timer.best()/REPEAT << endl; in main()
|
| /external/webrtc/webrtc/modules/audio_coding/codecs/isac/fix/source/ |
| D | pitch_estimator.c | 105 int32_t best[4]= {-100, -100, -100, -100}; in FindFour32() local
109 if (in[k] > best[3]) { in FindFour32()
110 if (in[k] > best[2]) { in FindFour32()
111 if (in[k] > best[1]) { in FindFour32()
112 if (in[k] > best[0]) { // The Best in FindFour32()
113 best[3] = best[2]; in FindFour32()
115 best[2] = best[1]; in FindFour32()
117 best[1] = best[0]; in FindFour32()
119 best[0] = in[k]; in FindFour32()
122 best[3] = best[2]; in FindFour32()
[all …]
|
| /external/webp/src/enc/ |
| D | alpha_enc.c | 241 FilterTrial best; in ApplyFiltersAndEncode() local
244 InitFilterTrial(&best); in ApplyFiltersAndEncode()
256 if (ok && trial.score < best.score) { in ApplyFiltersAndEncode()
257 VP8BitWriterWipeOut(&best.bw); in ApplyFiltersAndEncode()
258 best = trial; in ApplyFiltersAndEncode()
267 reduce_levels, effort_level, NULL, &best); in ApplyFiltersAndEncode()
272 stats->lossless_features = best.stats.lossless_features; in ApplyFiltersAndEncode()
273 stats->histogram_bits = best.stats.histogram_bits; in ApplyFiltersAndEncode()
274 stats->transform_bits = best.stats.transform_bits; in ApplyFiltersAndEncode()
275 stats->cache_bits = best.stats.cache_bits; in ApplyFiltersAndEncode()
[all …]
|
| /external/skia/tests/ |
| D | StrokerTest.cpp | 151 int best = 0; in DEF_TEST() local
162 if (best < gMaxRecursion[2]) { in DEF_TEST()
170 best = gMaxRecursion[2]; in DEF_TEST()
179 SkDebugf("\n%s max quad=%d\n", __FUNCTION__, best); in DEF_TEST()
230 int best = 0; in DEF_TEST() local
254 if (best < gMaxRecursion[2]) { in DEF_TEST()
262 best = gMaxRecursion[2]; in DEF_TEST()
271 SkDebugf("\n%s max quad=%d\n", __FUNCTION__, best); in DEF_TEST()
340 int best = 0; in DEF_TEST() local
358 if (best < gMaxRecursion[2]) { in DEF_TEST()
[all …]
|
| /external/skqp/tests/ |
| D | StrokerTest.cpp | 151 int best = 0; in DEF_TEST() local
162 if (best < gMaxRecursion[2]) { in DEF_TEST()
170 best = gMaxRecursion[2]; in DEF_TEST()
179 SkDebugf("\n%s max quad=%d\n", __FUNCTION__, best); in DEF_TEST()
230 int best = 0; in DEF_TEST() local
254 if (best < gMaxRecursion[2]) { in DEF_TEST()
262 best = gMaxRecursion[2]; in DEF_TEST()
271 SkDebugf("\n%s max quad=%d\n", __FUNCTION__, best); in DEF_TEST()
340 int best = 0; in DEF_TEST() local
358 if (best < gMaxRecursion[2]) { in DEF_TEST()
[all …]
|
| /external/Reactive-Extensions/RxCpp/Ix/CPP/src/cpplinq/ |
| D | linq_last.hpp | 30 Cursor best = c; in linq_last_() local
34 best = c; in linq_last_()
36 return best.get(); in linq_last_()
65 Cursor best = c; in linq_last_or_default_() local
69 best = c; in linq_last_or_default_()
71 return best.get(); in linq_last_or_default_()
|
| /external/ppp/pppd/plugins/pppoatm/ |
| D | misc.c | 24 int i,best; in __atmlib_fetch() local
30 best = -1; in __atmlib_fetch()
35 best = i; in __atmlib_fetch()
40 if (best > -1) (*pos) += best_len; in __atmlib_fetch()
41 return best; in __atmlib_fetch()
|
| /external/mesa3d/src/gallium/state_trackers/clover/util/ |
| D | factor.hpp | 117 auto best = std::make_pair(T(1), std::vector<T>(grid.size(), T(1))); in find_grid_optimal_factor() local
119 for (auto block = best; in find_grid_optimal_factor()
120 block.first != 0 && best.first != product_limit; in find_grid_optimal_factor()
122 if (block.first > best.first) in find_grid_optimal_factor()
123 best = block; in find_grid_optimal_factor()
126 return best.second; in find_grid_optimal_factor()
|
| /external/clang/utils/ |
| D | 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:
645 return best[1]
|
| /external/ltp/testcases/lib/ |
| D | tst_net_vars.c | 335 unsigned int i, j, max, best, border = 0; in get_ipv6_network() local
378 for (i = best = 0, max = 2; buf[i]; i++) { in get_ipv6_network()
384 best = i, max = j; in get_ipv6_network()
388 size_t best_end = best + max - 1; in get_ipv6_network()
390 if (max > 2 && best < border) { in get_ipv6_network()
393 if (best == 0 && best_end >= border) { in get_ipv6_network()
397 } else if (best == 0 && best_end < border) { in get_ipv6_network()
402 } else if (best > 0 && best_end >= border) { in get_ipv6_network()
407 ret[best] = ':'; in get_ipv6_network()
408 ret[best + 1] = '\0'; in get_ipv6_network()
[all …]
|
| /external/libvpx/libvpx/vp8/encoder/ |
| D | encodemb.c | 170 int best; in optimize_b() local
232 best = rd_cost1 < rd_cost0; in optimize_b()
236 tokens[i][0].rate = base_bits + (best ? rate1 : rate0); in optimize_b()
237 tokens[i][0].error = d2 + (best ? error1 : error0); in optimize_b()
241 best_mask[0] |= best << i; in optimize_b()
289 best = rd_cost1 < rd_cost0; in optimize_b()
296 tokens[i][1].rate = base_bits + (best ? rate1 : rate0); in optimize_b()
297 tokens[i][1].error = d2 + (best ? error1 : error0); in optimize_b()
299 tokens[i][1].token = best ? t1 : t0; in optimize_b()
301 best_mask[1] |= best << i; in optimize_b()
[all …]
|
| /external/zopfli/src/zopfli/ |
| D | blocksplitter.c | 46 double best = ZOPFLI_LARGE_FLOAT; in FindMinimum() local
51 if (v < best) { in FindMinimum()
52 best = v; in FindMinimum()
64 double best; in FindMinimum() local
76 best = vp[0]; in FindMinimum()
78 if (vp[i] < best) { in FindMinimum()
79 best = vp[i]; in FindMinimum()
83 if (best > lastbest) break; in FindMinimum()
89 lastbest = best; in FindMinimum()
|
| /external/openssh/ |
| D | dh.c | 150 int best, bestcount, which; in choose_dh() local
161 best = bestcount = 0; in choose_dh()
172 if ((dhg.size > wantbits && dhg.size < best) || in choose_dh()
173 (dhg.size > best && best < wantbits)) { in choose_dh()
174 best = dhg.size; in choose_dh()
177 if (dhg.size == best) in choose_dh()
194 dhg.size != best || in choose_dh()
|
| /external/cldr/tools/scripts/build/bin-build/ |
| D | post-jsps.sh | 6 rm -rf ${HOME}/best/${DIRNAME}
7 mkdir -p ${HOME}/best/${DIRNAME}
21 cp -r .svn ${WARFILE} ${HOME}/best/${DIRNAME}/
|
| /external/tensorflow/tensorflow/contrib/tensor_forest/kernels/v4/ |
| D | graph_collection_operator.cc | 38 SplitCandidate* best, in BestSplit() argument
60 *best = SplitCandidate(); in BestSplit()
62 runner->GetLeftStats(best->mutable_left_stats()); in BestSplit()
63 runner->GetRightStats(best->mutable_right_stats()); in BestSplit()
64 runner->GetSplit(best->mutable_split()); in BestSplit()
|
| D | decision-tree-resource.cc | 53 void DecisionTreeResource::SplitNode(int32 node_id, SplitCandidate* best, in SplitNode() argument
64 model_op_->ExportModel(best->left_stats(), left_leaf); in SplitNode()
71 model_op_->ExportModel(best->right_stats(), right_leaf); in SplitNode()
74 node->mutable_binary_node()->Swap(best->mutable_split()); in SplitNode()
|
| /external/linux-kselftest/tools/testing/selftests/bpf/ |
| D | test_lpm_map.c | 85 struct tlpm_node *best = NULL; in tlpm_match() local
102 if (!best || i > best->n_bits) in tlpm_match()
103 best = list; in tlpm_match()
107 return best; in tlpm_match()
114 struct tlpm_node *best = tlpm_match(list, key, n_bits); in tlpm_delete() local
117 if (!best || best->n_bits != n_bits) in tlpm_delete()
120 if (best == list) { in tlpm_delete()
121 node = best->next; in tlpm_delete()
122 free(best); in tlpm_delete()
127 if (node->next == best) { in tlpm_delete()
[all …]
|