Home
last modified time | relevance | path

Searched refs:candidate (Results 1 – 25 of 388) sorted by relevance

12345678910>>...16

/third_party/node/deps/v8/src/compiler/
Djs-inlining-heuristic.cc175 Candidate candidate = CollectFunctions(node, kMaxCallPolymorphism); in Reduce() local
176 if (candidate.num_functions == 0) { in Reduce()
178 } else if (candidate.num_functions > 1 && !FLAG_polymorphic_inlining) { in Reduce()
186 candidate.total_size = 0; in Reduce()
190 for (int i = 0; i < candidate.num_functions; ++i) { in Reduce()
191 if (!candidate.bytecode[i].has_value()) { in Reduce()
192 candidate.can_inline_function[i] = false; in Reduce()
196 SharedFunctionInfoRef shared = candidate.functions[i].has_value() in Reduce()
197 ? candidate.functions[i].value().shared() in Reduce()
198 : candidate.shared_info.value(); in Reduce()
[all …]
Dwasm-inlining.cc119 CandidateInfo candidate{call, inlinee_index, call_count, in ReduceCall() local
122 inlining_candidates_.push(candidate); in ReduceCall()
135 void WasmInliner::Trace(const CandidateInfo& candidate, const char* decision) { in Trace() argument
139 function_index_, candidate.node->id(), candidate.inlinee_index, in Trace()
140 candidate.call_count, candidate.wire_byte_size, decision); in Trace()
148 CandidateInfo candidate = inlining_candidates_.top(); in Finalize() local
150 Node* call = candidate.node; in Finalize()
152 Trace(candidate, "dead node"); in Finalize()
155 int min_count_for_inlining = candidate.wire_byte_size / 2; in Finalize()
156 if (candidate.call_count < min_count_for_inlining) { in Finalize()
[all …]
/third_party/libphonenumber/cpp/src/phonenumbers/
Dphonenumbermatcher.cc80 bool ContainsOnlyValidXChars(const PhoneNumber& number, const string& candidate, in ContainsOnlyValidXChars() argument
89 found = candidate.find_first_of("xX"); in ContainsOnlyValidXChars()
92 while (found != string::npos && found < candidate.length() - 1) { in ContainsOnlyValidXChars()
94 char next_char = candidate[found + 1]; in ContainsOnlyValidXChars()
100 number, candidate.substr(found, candidate.length() - found)) in ContainsOnlyValidXChars()
105 string normalized_extension(candidate.substr(found, in ContainsOnlyValidXChars()
106 candidate.length() - found)); in ContainsOnlyValidXChars()
112 found = candidate.find_first_of("xX", found + 1); in ContainsOnlyValidXChars()
455 bool PhoneNumberMatcher::ParseAndVerify(const string& candidate, int offset, in ParseAndVerify() argument
460 if (!reg_exps_->matching_brackets_->FullMatch(candidate) || in ParseAndVerify()
[all …]
Dphonenumbermatcher.h121 bool ExtractMatch(const string& candidate, int offset,
127 bool ExtractInnerMatch(const string& candidate, int offset,
133 bool ParseAndVerify(const string& candidate, int offset,
138 const string& candidate,
164 const string& candidate) const;
169 const string& candidate,
/third_party/libphonenumber/java/libphonenumber/src/com/google/i18n/phonenumbers/
DPhoneNumberMatcher.java259 CharSequence candidate = text.subSequence(start, matcher.end()); in find() local
264 candidate = trimAfterFirstMatch(PhoneNumberUtil.SECOND_NUMBER_START_PATTERN, candidate); in find()
266 PhoneNumberMatch match = extractMatch(candidate, start); in find()
271 index = start + candidate.length(); in find()
282 private static CharSequence trimAfterFirstMatch(Pattern pattern, CharSequence candidate) { in trimAfterFirstMatch() argument
283 Matcher trailingCharsMatcher = pattern.matcher(candidate); in trimAfterFirstMatch()
285 candidate = candidate.subSequence(0, trailingCharsMatcher.start()); in trimAfterFirstMatch()
287 return candidate; in trimAfterFirstMatch()
321 private PhoneNumberMatch extractMatch(CharSequence candidate, int offset) { in extractMatch() argument
323 if (SLASH_SEPARATED_DATES.matcher(candidate).find()) { in extractMatch()
[all …]
/third_party/typescript/src/services/
DpatternMatcher.ts36 getMatchForLastSegmentOfPattern(candidate: string): PatternMatch | undefined;
41 … getFullMatch(candidateContainers: readonly string[], candidate: string): PatternMatch | undefined;
112 …getFullMatch: (containers, candidate) => getFullMatch(containers, candidate, dotSeparatedSegments,…
113 …getMatchForLastSegmentOfPattern: candidate => matchSegment(candidate, last(dotSeparatedSegments), …
118 …function getFullMatch(candidateContainers: readonly string[], candidate: string, dotSeparatedSegme…
122 … const candidateMatch = matchSegment(candidate, last(dotSeparatedSegments), stringToWordSpans);
152 …function matchTextChunk(candidate: string, chunk: TextChunk, stringToWordSpans: ESMap<string, Text…
153 const index = indexOfIgnoringCase(candidate, chunk.textLowerCase);
157 …hunk.text.length === candidate.length ? PatternMatchKind.exact : PatternMatchKind.prefix, /*isCase…
169 const wordSpans = getWordSpans(candidate, stringToWordSpans);
[all …]
/third_party/glslang/glslang/MachineIndependent/
DLiveTraverser.h75 TIntermAggregate* candidate = globals[f]->getAsAggregate(); in pushFunction() local
76 if (candidate && candidate->getOp() == EOpFunction && candidate->getName() == name) { in pushFunction()
77 destinations.push_back(candidate); in pushFunction()
87 TIntermAggregate* candidate = globals[f]->getAsAggregate(); in pushGlobalReference() local
88 if (candidate && candidate->getOp() == EOpSequence && in pushGlobalReference()
89 candidate->getSequence().size() == 1 && in pushGlobalReference()
90 candidate->getSequence()[0]->getAsBinaryNode()) { in pushGlobalReference()
91 TIntermBinary* binary = candidate->getSequence()[0]->getAsBinaryNode(); in pushGlobalReference()
95 destinations.push_back(candidate); in pushGlobalReference()
DParseContextBase.cpp395 const TFunction& candidate = *(*it); in selectFunction() local
399 if (call.getParamCount() < candidate.getFixedParamCount() || in selectFunction()
400 call.getParamCount() > candidate.getParamCount()) in selectFunction()
407 const int paramCount = std::min(call.getParamCount(), candidate.getParamCount()); in selectFunction()
409 if (candidate[param].type->getQualifier().isParamInput()) { in selectFunction()
410 … if (! convertible(*call[param].type, *candidate[param].type, candidate.getBuiltInOp(), param)) { in selectFunction()
415 if (candidate[param].type->getQualifier().isParamOutput()) { in selectFunction()
416 … if (! convertible(*candidate[param].type, *call[param].type, candidate.getBuiltInOp(), param)) { in selectFunction()
424 viableCandidates.push_back(&candidate); in selectFunction()
460 const TFunction& candidate = *(*it); in selectFunction() local
[all …]
/third_party/node/test/fixtures/postject-copy/node_modules/commander/lib/
DsuggestSimilar.js63 candidates = candidates.map(candidate => candidate.slice(2));
69 candidates.forEach((candidate) => {
70 if (candidate.length <= 1) return; // no one character guesses
72 const distance = editDistance(word, candidate);
73 const length = Math.max(word.length, candidate.length);
79 similar = [candidate];
81 similar.push(candidate);
88 similar = similar.map(candidate => `--${candidate}`);
/third_party/mesa3d/src/amd/compiler/
Daco_scheduler.cpp667 aco_ptr<Instruction>& candidate = block->instructions[candidate_idx]; in schedule_SMEM() local
676 if (candidate->opcode == aco_opcode::p_logical_start) in schedule_SMEM()
680 if ((candidate->isVMEM() || candidate->isFlatLike()) && in schedule_SMEM()
685 if (candidate->format == Format::SMEM && current->operands[0].size() == 4 && in schedule_SMEM()
686 candidate->operands[0].size() == 2) in schedule_SMEM()
691 HazardResult haz = perform_hazard_query(&hq, candidate.get(), false); in schedule_SMEM()
701 if (candidate->isDS() || !can_move_down) { in schedule_SMEM()
702 add_to_hazard_query(&hq, candidate.get()); in schedule_SMEM()
709 add_to_hazard_query(&hq, candidate.get()); in schedule_SMEM()
730 aco_ptr<Instruction>& candidate = block->instructions[candidate_idx]; in schedule_SMEM() local
[all …]
/third_party/mesa3d/src/gallium/drivers/r300/compiler/
Dradeon_program_pair.c42 int candidate = -1; in rc_pair_alloc_source() local
88 candidate = i; in rc_pair_alloc_source()
93 candidate = RC_PAIR_PRESUB_SRC; in rc_pair_alloc_source()
94 } else if (candidate < 0 || (rgb && rgb_used > 2) in rc_pair_alloc_source()
102 pair->RGB.Src[candidate].Used = 1; in rc_pair_alloc_source()
103 pair->RGB.Src[candidate].File = file; in rc_pair_alloc_source()
104 pair->RGB.Src[candidate].Index = index; in rc_pair_alloc_source()
105 if (candidate == RC_PAIR_PRESUB_SRC) { in rc_pair_alloc_source()
115 pair->Alpha.Src[candidate].Used = 1; in rc_pair_alloc_source()
116 pair->Alpha.Src[candidate].File = file; in rc_pair_alloc_source()
[all …]
/third_party/astc-encoder/Test/
Dastc_trace_analysis.py133 def add_candidate(self, candidate): argument
134 self.candidates.append(candidate)
204 for candidate in pas:
205 yield (block, pas, candidate)
240 for candidate in pas:
241 errorval = candidate.refinement_errors[-1]
245 best_candidate = candidate
305 for candidate in get_node(pas, "candidate", True):
307 failed = get_attrib(candidate, "failed", False, False)
311 wx = get_attrib(candidate, "weight_x")
[all …]
/third_party/node/deps/v8/src/compiler/backend/
Dinstruction-scheduler.cc30 auto candidate = nodes_.end(); in PopBestCandidate() local
34 candidate = iterator; in PopBestCandidate()
39 if (candidate != nodes_.end()) { in PopBestCandidate()
40 ScheduleGraphNode* result = *candidate; in PopBestCandidate()
41 nodes_.erase(candidate); in PopBestCandidate()
52 auto candidate = nodes_.begin(); in PopBestCandidate() local
53 std::advance(candidate, random_number_generator()->NextInt( in PopBestCandidate()
55 ScheduleGraphNode* result = *candidate; in PopBestCandidate()
56 nodes_.erase(candidate); in PopBestCandidate()
228 ScheduleGraphNode* candidate = ready_list.PopBestCandidate(cycle); in Schedule() local
[all …]
/third_party/node/deps/v8/src/utils/
Dversion.cc31 const char* candidate = IsCandidate() ? " (candidate)" : ""; in GetString() local
34 GetPatch(), GetEmbedder(), candidate); in GetString()
37 GetEmbedder(), candidate); in GetString()
45 const char* candidate = IsCandidate() ? "-candidate" : ""; in GetSONAME() local
48 GetBuild(), GetPatch(), GetEmbedder(), candidate); in GetSONAME()
51 GetEmbedder(), candidate); in GetSONAME()
/third_party/mesa3d/src/amd/vulkan/
Dradv_nir_lower_ray_queries.c161 struct ray_query_intersection_vars candidate; member
249 dst->candidate = in init_ray_query_vars()
281 rq_copy_var(b, index, vars->closest.barycentrics, vars->candidate.barycentrics, 0x3); in copy_candidate_to_closest()
283 vars->candidate.custom_instance_and_mask, 0x1); in copy_candidate_to_closest()
284 rq_copy_var(b, index, vars->closest.geometry_id_and_flags, vars->candidate.geometry_id_and_flags, in copy_candidate_to_closest()
286 rq_copy_var(b, index, vars->closest.instance_addr, vars->candidate.instance_addr, 0x1); in copy_candidate_to_closest()
287 rq_copy_var(b, index, vars->closest.instance_id, vars->candidate.instance_id, 0x1); in copy_candidate_to_closest()
288 rq_copy_var(b, index, vars->closest.intersection_type, vars->candidate.intersection_type, 0x1); in copy_candidate_to_closest()
289 rq_copy_var(b, index, vars->closest.opaque, vars->candidate.opaque, 0x1); in copy_candidate_to_closest()
290 rq_copy_var(b, index, vars->closest.frontface, vars->candidate.frontface, 0x1); in copy_candidate_to_closest()
[all …]
/third_party/node/lib/internal/crypto/
Drandom.js539 function checkPrime(candidate, options = kEmptyObject, callback) { argument
540 if (typeof candidate === 'bigint')
541 candidate = unsignedBigIntToBuffer(candidate, 'candidate');
542 if (!isAnyArrayBuffer(candidate) && !isArrayBufferView(candidate)) {
552 candidate,
568 const job = new CheckPrimeJob(kCryptoJobAsync, candidate, checks);
573 function checkPrimeSync(candidate, options = kEmptyObject) { argument
574 if (typeof candidate === 'bigint')
575 candidate = unsignedBigIntToBuffer(candidate, 'candidate');
576 if (!isAnyArrayBuffer(candidate) && !isArrayBufferView(candidate)) {
[all …]
/third_party/typescript/src/compiler/
DmoduleNameResolver.ts432 const candidate = combinePaths(typeRoot, typeReferenceDirectiveName); constant
433 const candidateDirectory = getDirectoryPath(candidate);
439 loadNodeModuleFromDirectory(Extensions.DtsOnly, candidate,
465 …const { path: candidate } = normalizePathForCJSResolution(initialLocationForSecondaryLookup, typeR…
466 …result = nodeLoadModuleByRelativeName(Extensions.DtsOnly, candidate, /*onlyRecordFailures*/ false,…
503 const candidate = combinePaths(nodeModulesFolder, packageName); constant
504 … return getPackageJsonInfo(candidate, /*onlyRecordFailures*/ false, moduleResolutionState);
1076 …type ResolutionKindSpecificLoader = (extensions: Extensions, candidate: string, onlyRecordFailures…
1178 const candidate = normalizePath(combinePaths(containingDirectory, moduleName)); constant
1191 startsWith(candidate, normalizedRoot) &&
[all …]
/third_party/node/deps/v8/tools/clusterfuzz/js_fuzzer/
Dexceptions.js150 function _findMatch(iterable, candidate) { argument
153 if (entry === candidate) {
157 if (entry.test(candidate)) {
166 function _doesntMatch(iterable, candidate) { argument
167 return !_findMatch(iterable, candidate);
/third_party/wpa_supplicant/wpa_supplicant-2.9_standard/src/rsn_supp/
Dpreauth.c318 struct rsn_pmksa_candidate *candidate, *n; in rsn_preauth_candidate_process() local
336 dl_list_for_each_safe(candidate, n, &sm->pmksa_candidates, in rsn_preauth_candidate_process()
339 p = pmksa_cache_get(sm->pmksa, candidate->bssid, NULL, NULL, 0); in rsn_preauth_candidate_process()
340 if (os_memcmp(sm->bssid, candidate->bssid, ETH_ALEN) != 0 && in rsn_preauth_candidate_process()
345 MAC2STR(candidate->bssid)); in rsn_preauth_candidate_process()
349 MAC2STR_SEC(candidate->bssid)); in rsn_preauth_candidate_process()
350 dl_list_del(&candidate->list); in rsn_preauth_candidate_process()
351 rsn_preauth_init(sm, candidate->bssid, in rsn_preauth_candidate_process()
353 os_free(candidate); in rsn_preauth_candidate_process()
358 MAC2STR(candidate->bssid)); in rsn_preauth_candidate_process()
[all …]
/third_party/rust/crates/aho-corasick/src/packed/teddy/
Druntime.rs447 let c = self.candidate(haystack, at); in find_at()
457 let c = self.candidate(haystack, at); in find_at()
468 unsafe fn candidate(&self, haystack: &[u8], at: usize) -> __m128i { in candidate() method
497 let c = self.candidate(haystack, at); in find_at()
507 let c = self.candidate(haystack, at); in find_at()
518 unsafe fn candidate(&self, haystack: &[u8], at: usize) -> __m256i { in candidate() method
547 let c = self.candidate(haystack, at); in find_at()
557 let c = self.candidate(haystack, at); in find_at()
568 unsafe fn candidate(&self, haystack: &[u8], at: usize) -> __m256i { in candidate() method
600 let c = self.candidate(haystack, at, &mut prev0); in find_at()
[all …]
/third_party/elfutils/lib/
Dnext_prime.c35 is_prime (size_t candidate) in is_prime() argument
41 while (sq < candidate && candidate % divn != 0) in is_prime()
51 return candidate % divn != 0; in is_prime()
/third_party/libffi/src/arm/
Dffi.c679 is_hfa1 (const ffi_type *ty, int candidate) in is_hfa1() argument
690 if (!is_hfa1 (elements[i], candidate)) in is_hfa1()
693 else if (t != candidate) in is_hfa1()
711 int candidate, i; in vfp_type_p() local
715 candidate = ty->type; in vfp_type_p()
725 candidate = ty->elements[0]->type; in vfp_type_p()
726 if (candidate != FFI_TYPE_FLOAT && candidate != FFI_TYPE_DOUBLE) in vfp_type_p()
741 candidate = elements[0]->type; in vfp_type_p()
742 if (candidate == FFI_TYPE_STRUCT || candidate == FFI_TYPE_COMPLEX) in vfp_type_p()
746 candidate = is_hfa0 (elements[i]); in vfp_type_p()
[all …]
/third_party/libffi/src/aarch64/
Dffi.c120 is_hfa1 (const ffi_type *ty, int candidate) in is_hfa1() argument
131 if (!is_hfa1 (elements[i], candidate)) in is_hfa1()
134 else if (t != candidate) in is_hfa1()
153 int candidate, i; in is_vfp_type() local
157 candidate = ty->type; in is_vfp_type()
158 switch (candidate) in is_vfp_type()
168 candidate = ty->elements[0]->type; in is_vfp_type()
169 switch (candidate) in is_vfp_type()
189 candidate = elements[0]->type; in is_vfp_type()
190 if (candidate == FFI_TYPE_STRUCT || candidate == FFI_TYPE_COMPLEX) in is_vfp_type()
[all …]
/third_party/skia/third_party/externals/brotli/c/enc/
Dcompress_fragment_two_pass.c284 const uint8_t* candidate; in CreateCommands() local
298 candidate = ip - last_distance; in CreateCommands()
299 if (IsMatch(ip, candidate, min_match)) { in CreateCommands()
300 if (BROTLI_PREDICT_TRUE(candidate < ip)) { in CreateCommands()
305 candidate = base_ip + table[hash]; in CreateCommands()
306 BROTLI_DCHECK(candidate >= base_ip); in CreateCommands()
307 BROTLI_DCHECK(candidate < ip); in CreateCommands()
310 } while (BROTLI_PREDICT_TRUE(!IsMatch(ip, candidate, min_match))); in CreateCommands()
314 if (ip - candidate > MAX_DISTANCE) goto trawl; in CreateCommands()
326 candidate + min_match, ip + min_match, in CreateCommands()
[all …]
/third_party/node/deps/brotli/c/enc/
Dcompress_fragment_two_pass.c284 const uint8_t* candidate; in CreateCommands() local
298 candidate = ip - last_distance; in CreateCommands()
299 if (IsMatch(ip, candidate, min_match)) { in CreateCommands()
300 if (BROTLI_PREDICT_TRUE(candidate < ip)) { in CreateCommands()
305 candidate = base_ip + table[hash]; in CreateCommands()
306 BROTLI_DCHECK(candidate >= base_ip); in CreateCommands()
307 BROTLI_DCHECK(candidate < ip); in CreateCommands()
310 } while (BROTLI_PREDICT_TRUE(!IsMatch(ip, candidate, min_match))); in CreateCommands()
314 if (ip - candidate > MAX_DISTANCE) goto trawl; in CreateCommands()
326 candidate + min_match, ip + min_match, in CreateCommands()
[all …]

12345678910>>...16