Home
last modified time | relevance | path

Searched refs:best (Results 1 – 25 of 1418) sorted by relevance

12345678910>>...57

/external/igt-gpu-tools/tools/
Dhsw_compute_wrpll.c128 struct wrpll_rnp *best) in wrpll_update_rnp() argument
133 if (best->p == 0) { in wrpll_update_rnp()
134 best->p = p; in wrpll_update_rnp()
135 best->n2 = n2; in wrpll_update_rnp()
136 best->r2 = r2; in wrpll_update_rnp()
155 b = freq2k * budget * best->p * best->r2; in wrpll_update_rnp()
157 diff_best = ABS_DIFF((freq2k * best->p * best->r2), in wrpll_update_rnp()
158 (LC_FREQ_2K * best->n2)); in wrpll_update_rnp()
164 if (best->p * best->r2 * diff < p * r2 * diff_best) { in wrpll_update_rnp()
165 best->p = p; in wrpll_update_rnp()
[all …]
/external/rust/crates/grpcio-sys/grpc/third_party/cares/cares/
Dinet_ntop.c119 struct { int base, len; } best, cur; in inet_ntop6() local
131 best.base = -1; in inet_ntop6()
132 best.len = 0; in inet_ntop6()
143 if (best.base == -1 || cur.len > best.len) in inet_ntop6()
144 best = cur; in inet_ntop6()
150 if (best.base == -1 || cur.len > best.len) in inet_ntop6()
151 best = cur; in inet_ntop6()
153 if (best.base != -1 && best.len < 2) in inet_ntop6()
154 best.base = -1; in inet_ntop6()
162 if (best.base != -1 && i >= best.base && in inet_ntop6()
[all …]
/external/curl/lib/
Dinet_ntop.c91 } 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/
Daddrtostr.c115 } 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/
Dinet_ntop.c119 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/icu/icu4c/source/test/intltest/
Dlocalematchertest.cpp100 const Locale *best = matcher.getBestMatch(Locale::getFrench(), errorCode); in testEmpty() local
101 assertEquals("getBestMatch(fr)", "(null)", locString(best)); in testEmpty()
130 const Locale *best = matcher.getBestMatch("en_GB", errorCode); in testBasics() local
131 assertEquals("fromRange.getBestMatch(en_GB)", "en_GB", locString(best)); in testBasics()
132 best = matcher.getBestMatch("en_US", errorCode); in testBasics()
133 assertEquals("fromRange.getBestMatch(en_US)", "en", locString(best)); in testBasics()
134 best = matcher.getBestMatch("fr_FR", errorCode); in testBasics()
135 assertEquals("fromRange.getBestMatch(fr_FR)", "fr", locString(best)); in testBasics()
136 best = matcher.getBestMatch("ja_JP", errorCode); in testBasics()
137 assertEquals("fromRange.getBestMatch(ja_JP)", "fr", locString(best)); in testBasics()
[all …]
/external/libwebsockets/lib/core-net/
Dlws-dsh.c30 lws_dsh_obj_t *best; member
111 (!s->best || obj->asize < s->best->asize)) { in search_best_free()
112 s->best = obj; in search_best_free()
262 s.best = NULL; in _lws_dsh_alloc_tail()
269 if (!s.best) { in _lws_dsh_alloc_tail()
278 if (!s.best) { in _lws_dsh_alloc_tail()
286 assert(!(((unsigned long)s.best) & (sizeof(int *) - 1))); in _lws_dsh_alloc_tail()
288 if (s.best->asize < asize + (2 * sizeof(*s.best))) { in _lws_dsh_alloc_tail()
296 lws_dll2_remove(&s.best->list); in _lws_dsh_alloc_tail()
297 s.best->dsh = s.dsh; in _lws_dsh_alloc_tail()
[all …]
/external/zstd/lib/dictBuilder/
Dcover.c843 void COVER_best_init(COVER_best_t *best) { in COVER_best_init() argument
844 if (best==NULL) return; /* compatible with init on NULL */ in COVER_best_init()
845 (void)ZSTD_pthread_mutex_init(&best->mutex, NULL); in COVER_best_init()
846 (void)ZSTD_pthread_cond_init(&best->cond, NULL); in COVER_best_init()
847 best->liveJobs = 0; in COVER_best_init()
848 best->dict = NULL; in COVER_best_init()
849 best->dictSize = 0; in COVER_best_init()
850 best->compressedSize = (size_t)-1; in COVER_best_init()
851 memset(&best->parameters, 0, sizeof(best->parameters)); in COVER_best_init()
857 void COVER_best_wait(COVER_best_t *best) { in COVER_best_wait() argument
[all …]
Dcover.h106 void COVER_best_init(COVER_best_t *best);
111 void COVER_best_wait(COVER_best_t *best);
116 void COVER_best_destroy(COVER_best_t *best);
122 void COVER_best_start(COVER_best_t *best);
129 void COVER_best_finish(COVER_best_t *best, ZDICT_cover_params_t parameters,
/external/mesa3d/src/gallium/drivers/radeonsi/
Dsi_test_dma_perf.c345 struct si_result *best = NULL; in si_test_dma_perf() local
393 if (!best) { in si_test_dma_perf()
394 best = r; in si_test_dma_perf()
404 if (best->score * min_improvement < r->score) in si_test_dma_perf()
405 best = r; in si_test_dma_perf()
421 if (!best || in si_test_dma_perf()
423 (prev->is_cp == best->is_cp && prev->is_sdma == best->is_sdma && in si_test_dma_perf()
424 prev->is_cs == best->is_cs && prev->cache_policy == best->cache_policy && in si_test_dma_perf()
425 prev->dwords_per_thread == best->dwords_per_thread && in si_test_dma_perf()
426 prev->waves_per_sh == best->waves_per_sh) || in si_test_dma_perf()
[all …]
/external/eigen/bench/
Dbench_gemm.cpp262 …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 …]
Ddense_solvers.cpp74 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()
/external/llvm-project/polly/lib/External/isl/
Disl_blk.c81 int best = 0; in isl_blk_alloc() local
82 for (i = 1; ctx->cache[best].size != n && i < ctx->n_cached; ++i) { in isl_blk_alloc()
83 if (ctx->cache[best].size < n) { in isl_blk_alloc()
84 if (ctx->cache[i].size > ctx->cache[best].size) in isl_blk_alloc()
85 best = i; in isl_blk_alloc()
87 ctx->cache[i].size < ctx->cache[best].size) in isl_blk_alloc()
88 best = i; in isl_blk_alloc()
90 if (ctx->cache[best].size < 2 * n + 100) { in isl_blk_alloc()
91 block = ctx->cache[best]; in isl_blk_alloc()
92 if (--ctx->n_cached != best) in isl_blk_alloc()
[all …]
/external/webrtc/modules/audio_coding/codecs/isac/fix/source/
Dpitch_estimator.c105 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/starlark-go/internal/spell/
Dspell.go26 var best string
32 best = c
35 return best
76 best := i
84 best = min(best, k)
86 if best > max {
87 return best
/external/libcups/scheduler/
Dauth.c266 con->best = cupsdFindBest(con->uri, httpGetState(con->http)); in cupsdAuthorize()
269 …OG_DEBUG2, "con->uri=\"%s\", con->best=%p(%s)", con->uri, con->best, con->best ? con->best->locati… in cupsdAuthorize()
271 if (con->best && con->best->type != CUPSD_AUTH_NONE) in cupsdAuthorize()
273 if (con->best->type == CUPSD_AUTH_DEFAULT) in cupsdAuthorize()
276 type = con->best->type; in cupsdAuthorize()
394 con->http->hostaddr->addr.sa_family == AF_LOCAL && con->best) in cupsdAuthorize()
411 for (name = (char *)cupsArrayFirst(con->best->names); in cupsdAuthorize()
413 name = (char *)cupsArrayNext(con->best->names)) in cupsdAuthorize()
1381 *best; /* Best match for location so far */ in cupsdFindBest() local
1437 best = NULL; in cupsdFindBest()
[all …]
/external/libcups/cups/
Ddest-options.c2288 *best = NULL, /* Best matching entry */ in cups_get_media_db() local
2324 best = mdb; in cups_get_media_db()
2332 if (best->left != 0 || best->right != 0 || best->top != 0 || best->bottom != 0) in cups_get_media_db()
2338 if (mdb->left <= best->left && mdb->right <= best->right && in cups_get_media_db()
2339 mdb->top <= best->top && mdb->bottom <= best->bottom) in cups_get_media_db()
2341 best = mdb; in cups_get_media_db()
2355 (best->left || best->right || best->top || best->bottom)) in cups_get_media_db()
2368 if (mdb->left >= best->left && mdb->right >= best->right && in cups_get_media_db()
2369 mdb->top >= best->top && mdb->bottom >= best->bottom && in cups_get_media_db()
2370 …(mdb->bottom != best->bottom || mdb->left != best->left || mdb->right != best->right || mdb->top !… in cups_get_media_db()
[all …]
/external/icing/icing/scoring/
Dranker.cc45 int best = target_subtree_root_index; in Heapify() local
54 scored_document_hits->at(best))) { in Heapify()
55 best = left; in Heapify()
61 scored_document_hits->at(best))) { in Heapify()
62 best = right; in Heapify()
67 if (best != target_subtree_root_index) { in Heapify()
68 std::swap(scored_document_hits->at(best), in Heapify()
70 Heapify(scored_document_hits, best, scored_document_hit_comparator); in Heapify()
/external/libcups/backend/
Ddnssd.c385 cups_device_t *best; /* Best matching device */ in main() local
391 best = NULL, count = 0, sent = 0; in main()
461 if (!best) in main()
462 best = device; in main()
463 else if (_cups_strcasecmp(best->name, device->name) || in main()
464 _cups_strcasecmp(best->domain, device->domain)) in main()
466 unquote(uriName, best->fullName, sizeof(uriName)); in main()
468 if (best->uuid) in main()
471 best->cups_shared ? "/cups?uuid=%s" : "/?uuid=%s", in main()
472 best->uuid); in main()
[all …]
/external/webp/src/enc/
Dalpha_enc.c241 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/ppp/pppd/plugins/pppoatm/
Dmisc.c24 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/Reactive-Extensions/RxCpp/Ix/CPP/src/cpplinq/
Dlinq_last.hpp30 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/skqp/tests/
DStrokerTest.cpp151 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/skia/tests/
DStrokerTest.cpp151 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/mesa3d/src/gallium/frontends/clover/util/
Dfactor.hpp117 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()

12345678910>>...57