| /external/v8/src/compiler/ |
| D | js-inlining-heuristic.cc | 158 Candidate candidate = CollectFunctions(node, kMaxCallPolymorphism); in Reduce() local
159 if (candidate.num_functions == 0) { in Reduce()
161 } else if (candidate.num_functions > 1 && !FLAG_polymorphic_inlining) { in Reduce()
169 candidate.total_size = 0; in Reduce()
173 for (int i = 0; i < candidate.num_functions; ++i) { in Reduce()
174 if (!candidate.bytecode[i].has_value()) { in Reduce()
175 candidate.can_inline_function[i] = false; in Reduce()
179 SharedFunctionInfoRef shared = candidate.functions[i].has_value() in Reduce()
180 ? candidate.functions[i].value().shared() in Reduce()
181 : candidate.shared_info.value(); in Reduce()
[all …]
|
| /external/libphonenumber/repackaged/libphonenumber/src/com/android/i18n/phonenumbers/ |
| D | PhoneNumberMatcher.java | 259 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 …]
|
| /external/libphonenumber/libphonenumber/src/com/google/i18n/phonenumbers/ |
| D | PhoneNumberMatcher.java | 258 CharSequence candidate = text.subSequence(start, matcher.end()); in find() local
263 candidate = trimAfterFirstMatch(PhoneNumberUtil.SECOND_NUMBER_START_PATTERN, candidate); in find()
265 PhoneNumberMatch match = extractMatch(candidate, start); in find()
270 index = start + candidate.length(); in find()
281 private static CharSequence trimAfterFirstMatch(Pattern pattern, CharSequence candidate) { in trimAfterFirstMatch() argument
282 Matcher trailingCharsMatcher = pattern.matcher(candidate); in trimAfterFirstMatch()
284 candidate = candidate.subSequence(0, trailingCharsMatcher.start()); in trimAfterFirstMatch()
286 return candidate; in trimAfterFirstMatch()
320 private PhoneNumberMatch extractMatch(CharSequence candidate, int offset) { in extractMatch() argument
322 if (SLASH_SEPARATED_DATES.matcher(candidate).find()) { in extractMatch()
[all …]
|
| /external/tensorflow/tensorflow/compiler/mlir/tensorflow/transforms/ |
| D | executor_island_coarsening.cc | 70 Operation* candidate = nullptr; in GetOperandCandidateToMergeWith() local
76 if (!candidate || candidate->isBeforeInBlock(def)) candidate = def; in GetOperandCandidateToMergeWith()
80 island.walk([graph_op, &candidate](Operation* op) { in GetOperandCandidateToMergeWith()
84 if (!candidate || candidate->isBeforeInBlock(def)) candidate = def; in GetOperandCandidateToMergeWith()
88 if (!candidate || !llvm::isa<IslandOp>(candidate)) return llvm::None; in GetOperandCandidateToMergeWith()
90 return llvm::Optional<IslandOp>(llvm::cast<IslandOp>(candidate)); in GetOperandCandidateToMergeWith()
99 Operation* candidate = nullptr; in GetResultCandidateToMergeWith() local
104 if (!candidate || user->isBeforeInBlock(candidate)) candidate = user; in GetResultCandidateToMergeWith()
113 if (!candidate || def->isBeforeInBlock(candidate)) candidate = def; in GetResultCandidateToMergeWith()
117 if (!candidate || !llvm::isa<IslandOp>(candidate)) return llvm::None; in GetResultCandidateToMergeWith()
[all …]
|
| /external/junit/src/main/java/org/junit/experimental/theories/ |
| D | ParameterSignature.java | 66 public boolean canAcceptValue(Object candidate) { in canAcceptValue() argument
67 return (candidate == null) ? !type.isPrimitive() : canAcceptType(candidate.getClass()); in canAcceptValue()
70 public boolean canAcceptType(Class<?> candidate) { in canAcceptType() argument
71 return type.isAssignableFrom(candidate) || in canAcceptType()
72 isAssignableViaTypeConversion(type, candidate); in canAcceptType()
75 public boolean canPotentiallyAcceptType(Class<?> candidate) { in canPotentiallyAcceptType() argument
76 return candidate.isAssignableFrom(type) || in canPotentiallyAcceptType()
77 isAssignableViaTypeConversion(candidate, type) || in canPotentiallyAcceptType()
78 canAcceptType(candidate); in canPotentiallyAcceptType()
81 private boolean isAssignableViaTypeConversion(Class<?> targetType, Class<?> candidate) { in isAssignableViaTypeConversion() argument
[all …]
|
| /external/webrtc/talk/app/webrtc/ |
| D | jsepsessiondescription.cc | 120 const IceCandidateInterface* candidate) { in AddCandidate() argument
121 if (!candidate || candidate->sdp_mline_index() < 0) in AddCandidate()
124 if (!GetMediasectionIndex(candidate, &mediasection_index)) { in AddCandidate()
137 cricket::Candidate updated_candidate = candidate->candidate(); in AddCandidate()
146 new JsepIceCandidate(candidate->sdp_mid(), in AddCandidate()
178 const IceCandidateInterface* candidate, in GetMediasectionIndex() argument
180 if (!candidate || !index) { in GetMediasectionIndex()
183 *index = static_cast<size_t>(candidate->sdp_mline_index()); in GetMediasectionIndex()
184 if (description_ && !candidate->sdp_mid().empty()) { in GetMediasectionIndex()
188 if (candidate->sdp_mid() == description_->contents().at(i).name) { in GetMediasectionIndex()
|
| D | jsepicecandidate.cc | 57 const cricket::Candidate& candidate) in JsepIceCandidate() argument
60 candidate_(candidate) { in JsepIceCandidate()
85 const IceCandidateInterface* candidate) const { in HasCandidate()
89 if ((*it)->sdp_mid() == candidate->sdp_mid() && in HasCandidate()
90 (*it)->sdp_mline_index() == candidate->sdp_mline_index() && in HasCandidate()
91 (*it)->candidate().IsEquivalent(candidate->candidate())) { in HasCandidate()
|
| D | jsepicecandidate.h | 45 const cricket::Candidate& candidate);
49 void SetCandidate(const cricket::Candidate& candidate) { in SetCandidate() argument
50 candidate_ = candidate; in SetCandidate()
55 virtual const cricket::Candidate& candidate() const { in candidate() function
77 virtual bool HasCandidate(const IceCandidateInterface* candidate) const;
79 virtual void add(JsepIceCandidate* candidate) { in add() argument
80 candidates_.push_back(candidate); in add()
|
| /external/mockito/src/main/java/org/mockito/internal/invocation/ |
| D | InvocationMatcher.java | 80 public boolean matches(Invocation candidate) { in matches() argument
81 …return invocation.getMock().equals(candidate.getMock()) && hasSameMethod(candidate) && argumentsMa… in matches()
88 public boolean hasSimilarMethod(Invocation candidate) { in hasSimilarMethod() argument
90 String candidateMethodName = candidate.getMethod().getName(); in hasSimilarMethod()
95 if (candidate.isVerified()) { in hasSimilarMethod()
98 if (getInvocation().getMock() != candidate.getMock()) { in hasSimilarMethod()
101 if (hasSameMethod(candidate)) { in hasSimilarMethod()
105 return !argumentsMatch(candidate); in hasSimilarMethod()
109 public boolean hasSameMethod(Invocation candidate) { in hasSameMethod() argument
113 Method m2 = candidate.getMethod(); in hasSameMethod()
|
| /external/skia/src/core/ |
| D | SkTDynamicHash.h | 94 T* candidate = fArray[index]; in find() local
95 if (Empty() == candidate) { in find()
98 if (Deleted() != candidate && GetKey(*candidate) == key) { in find()
99 return candidate; in find()
148 const T* candidate = fArray[index]; in countCollisions() local
149 if (Empty() == candidate || Deleted() == candidate || GetKey(*candidate) == key) { in countCollisions()
212 const T* candidate = fArray[index]; in innerAdd() local
213 if (Empty() == candidate || Deleted() == candidate) { in innerAdd()
214 if (Deleted() == candidate) { in innerAdd()
231 const T* candidate = fArray[index]; in innerRemove() local
[all …]
|
| /external/skqp/src/core/ |
| D | SkTDynamicHash.h | 94 T* candidate = fArray[index]; in find() local
95 if (Empty() == candidate) { in find()
98 if (Deleted() != candidate && GetKey(*candidate) == key) { in find()
99 return candidate; in find()
148 const T* candidate = fArray[index]; in countCollisions() local
149 if (Empty() == candidate || Deleted() == candidate || GetKey(*candidate) == key) { in countCollisions()
212 const T* candidate = fArray[index]; in innerAdd() local
213 if (Empty() == candidate || Deleted() == candidate) { in innerAdd()
214 if (Deleted() == candidate) { in innerAdd()
231 const T* candidate = fArray[index]; in innerRemove() local
[all …]
|
| /external/bouncycastle/repackaged/bcprov/src/main/java/com/android/org/bouncycastle/math/ |
| D | Primes.java | 154 …public static MROutput enhancedMRProbablePrimeTest(BigInteger candidate, SecureRandom random, int … in enhancedMRProbablePrimeTest() argument
156 checkCandidate(candidate, "candidate"); in enhancedMRProbablePrimeTest()
167 if (candidate.bitLength() == 2) in enhancedMRProbablePrimeTest()
171 if (!candidate.testBit(0)) in enhancedMRProbablePrimeTest()
176 BigInteger w = candidate; in enhancedMRProbablePrimeTest()
177 BigInteger wSubOne = candidate.subtract(ONE); in enhancedMRProbablePrimeTest()
178 BigInteger wSubTwo = candidate.subtract(TWO); in enhancedMRProbablePrimeTest()
257 public static boolean hasAnySmallFactors(BigInteger candidate) in hasAnySmallFactors() argument
259 checkCandidate(candidate, "candidate"); in hasAnySmallFactors()
261 return implHasAnySmallFactors(candidate); in hasAnySmallFactors()
[all …]
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/ |
| D | Primes.java | 150 …public static MROutput enhancedMRProbablePrimeTest(BigInteger candidate, SecureRandom random, int … in enhancedMRProbablePrimeTest() argument
152 checkCandidate(candidate, "candidate"); in enhancedMRProbablePrimeTest()
163 if (candidate.bitLength() == 2) in enhancedMRProbablePrimeTest()
167 if (!candidate.testBit(0)) in enhancedMRProbablePrimeTest()
172 BigInteger w = candidate; in enhancedMRProbablePrimeTest()
173 BigInteger wSubOne = candidate.subtract(ONE); in enhancedMRProbablePrimeTest()
174 BigInteger wSubTwo = candidate.subtract(TWO); in enhancedMRProbablePrimeTest()
253 public static boolean hasAnySmallFactors(BigInteger candidate) in hasAnySmallFactors() argument
255 checkCandidate(candidate, "candidate"); in hasAnySmallFactors()
257 return implHasAnySmallFactors(candidate); in hasAnySmallFactors()
[all …]
|
| /external/mesa3d/src/gallium/drivers/r300/compiler/ |
| D | radeon_program_pair.c | 42 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 …]
|
| /external/tensorflow/tensorflow/python/framework/ |
| D | registry_test.py | 39 def testRegistryBasics(self, candidate): argument
43 myreg.register(candidate)
44 self.assertEqual(myreg.lookup(candidate.__name__), candidate)
45 myreg.register(candidate, 'testKey')
46 self.assertEqual(myreg.lookup('testKey'), candidate)
48 sorted(myreg.list()), sorted(['testKey', candidate.__name__]))
|
| /external/tensorflow/tensorflow/core/kernels/boosted_trees/ |
| D | training_ops.cc | 193 boosted_trees::SplitCandidate candidate; in FindBestSplitsPerNode() local
194 candidate.feature_id = feature_ids(feature_idx); in FindBestSplitsPerNode()
195 candidate.candidate_idx = candidate_idx; in FindBestSplitsPerNode()
196 candidate.gain = gain; in FindBestSplitsPerNode()
197 candidate.dimension_id = 0; in FindBestSplitsPerNode()
198 candidate.threshold = thresholds(candidate_idx); in FindBestSplitsPerNode()
199 candidate.left_node_contribs.push_back( in FindBestSplitsPerNode()
201 candidate.right_node_contribs.push_back( in FindBestSplitsPerNode()
203 candidate.split_type = boosted_trees::SplitTypeWithDefault_Name( in FindBestSplitsPerNode()
210 const int32 feature_id = candidate.feature_id; in FindBestSplitsPerNode()
[all …]
|
| /external/webrtc/webrtc/api/objc/ |
| D | RTCIceCandidate.mm | 45 (webrtc::IceCandidateInterface *)candidate {
46 NSParameterAssert(candidate);
48 candidate->ToString(&sdp);
51 sdpMLineIndex:candidate->sdp_mline_index()
52 sdpMid:[NSString stringForStdString:candidate->sdp_mid()]];
58 webrtc::IceCandidateInterface *candidate = webrtc::CreateIceCandidate(
61 if (!candidate) {
62 RTCLog(@"Failed to create ICE candidate: %s\nline: %s",
67 return rtc::scoped_ptr<webrtc::IceCandidateInterface>(candidate);
|
| /external/mesa3d/src/amd/compiler/ |
| D | aco_scheduler.cpp | 547 aco_ptr<Instruction>& candidate = block->instructions[candidate_idx]; in schedule_SMEM() local
555 if (candidate->opcode == aco_opcode::p_logical_start) in schedule_SMEM()
557 if (candidate->isVMEM()) in schedule_SMEM()
562 HazardResult haz = perform_hazard_query(&hq, candidate.get(), false); in schedule_SMEM()
570 if (candidate->format == Format::DS || !can_move_down) { in schedule_SMEM()
571 add_to_hazard_query(&hq, candidate.get()); in schedule_SMEM()
578 add_to_hazard_query(&hq, candidate.get()); in schedule_SMEM()
598 aco_ptr<Instruction>& candidate = block->instructions[candidate_idx]; in schedule_SMEM() local
600 if (candidate->opcode == aco_opcode::p_logical_end) in schedule_SMEM()
606 if (is_dependency && candidate->isVMEM()) in schedule_SMEM()
[all …]
|
| /external/clang/include/clang/Sema/ |
| D | TypoCorrection.h | 276 virtual bool ValidateCandidate(const TypoCorrection &candidate);
284 virtual unsigned RankCandidate(const TypoCorrection &candidate) { in RankCandidate() argument
285 return (!MatchesTypo(candidate) && ValidateCandidate(candidate)) in RankCandidate()
308 bool MatchesTypo(const TypoCorrection &candidate) { in MatchesTypo() argument
309 return Typo && candidate.isResolved() && !candidate.requiresImport() && in MatchesTypo()
310 candidate.getCorrectionAsIdentifierInfo() == Typo && in MatchesTypo()
313 candidate.getCorrectionSpecifier() == TypoNNS; in MatchesTypo()
325 bool ValidateCandidate(const TypoCorrection &candidate) override { in ValidateCandidate() argument
326 return candidate.getCorrectionDeclAs<C>(); in ValidateCandidate()
339 bool ValidateCandidate(const TypoCorrection &candidate) override;
[all …]
|
| /external/v8/src/utils/ |
| D | version.cc | 30 const char* candidate = IsCandidate() ? " (candidate)" : ""; in GetString() local
33 GetPatch(), GetEmbedder(), candidate); in GetString()
36 GetEmbedder(), candidate); in GetString()
44 const char* candidate = IsCandidate() ? "-candidate" : ""; in GetSONAME() local
47 GetBuild(), GetPatch(), GetEmbedder(), candidate); in GetSONAME()
50 GetEmbedder(), candidate); in GetSONAME()
|
| /external/v8/src/compiler/backend/ |
| D | instruction-scheduler.cc | 30 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()
225 ScheduleGraphNode* candidate = ready_list.PopBestCandidate(cycle); in Schedule() local
[all …]
|
| /external/angle/third_party/glslang/src/glslang/MachineIndependent/ |
| D | ParseContextBase.cpp | 395 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 …]
|
| /external/deqp-deps/glslang/glslang/MachineIndependent/ |
| D | ParseContextBase.cpp | 395 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 …]
|
| /external/libtextclassifier/native/annotator/grammar/ |
| D | grammar-annotator.cc | 75 for (const grammar::Derivation& candidate : in GetAnnotations() local
78 if (!grammar::VerifyAssertions(candidate.match)) { in GetAnnotations()
81 if (!AddAnnotatedSpanFromMatch(text, candidate, annotations)) { in GetAnnotations()
180 for (const grammar::Derivation& candidate : candidates) { in GetOverlappingRuleMatches() local
183 if (!SpansOverlap(selection, candidate.match->codepoint_span)) { in GetOverlappingRuleMatches()
190 candidate.match, in GetOverlappingRuleMatches()
191 model_->rule_classification_result()->Get(candidate.rule_id)); in GetOverlappingRuleMatches()
196 result.push_back(candidate); in GetOverlappingRuleMatches()
209 for (const grammar::Derivation& candidate : candidates) { in GetBestValidInterpretation() local
210 if (!grammar::VerifyAssertions(candidate.match)) { in GetBestValidInterpretation()
[all …]
|
| /external/webrtc/webrtc/tools/loopback_test/ |
| D | loopback_test.js | 41 pc.addIceCandidate = function (candidate, successCallback, argument
43 if (forceTurn && candidate.candidate.indexOf("typ relay ") == -1) {
44 trace("Dropping non-turn candidate: " + candidate.candidate);
48 origAddIceCandidate.call(this, candidate, successCallback,
158 if (e.candidate) {
159 this.addIceCandidate(new RTCIceCandidate(e.candidate),
|