Home
last modified time | relevance | path

Searched refs:Candidate (Results 1 – 24 of 24) sorted by relevance

/external/llvm/lib/Transforms/Scalar/
DStraightLineStrengthReduce.cpp81 struct Candidate : public ilist_node<Candidate> { struct in __anon32c487ca0111::StraightLineStrengthReduce
89 Candidate() in Candidate() argument
92 Candidate(Kind CT, const SCEV *B, ConstantInt *Idx, Value *S, in Candidate() argument
120 Candidate *Basis; argument
148 bool isBasisFor(const Candidate &Basis, const Candidate &C);
150 bool isFoldable(const Candidate &C, TargetTransformInfo *TTI,
154 bool isSimplestForm(const Candidate &C);
179 void allocateCandidatesAndFindBasis(Candidate::Kind CT, const SCEV *B,
183 void rewriteCandidateWithBasis(const Candidate &C, const Candidate &Basis);
193 static Value *emitBump(const Candidate &Basis, const Candidate &C,
[all …]
DSink.cpp250 BasicBlock *Candidate = (*I)->getBlock(); in SinkInstruction() local
252 IsAcceptableTarget(Inst, Candidate)) in SinkInstruction()
253 SuccToSinkTo = Candidate; in SinkInstruction()
/external/clang/lib/Analysis/
DThreadSafetyTIL.cpp210 BasicBlock *Candidate = nullptr; in computeDominator() local
216 if (Candidate == nullptr) { in computeDominator()
217 Candidate = Pred; in computeDominator()
222 while (Alternate != Candidate) { in computeDominator()
223 if (Candidate->BlockID > Alternate->BlockID) in computeDominator()
224 Candidate = Candidate->DominatorNode.Parent; in computeDominator()
229 DominatorNode.Parent = Candidate; in computeDominator()
237 BasicBlock *Candidate = nullptr; in computePostDominator() local
243 if (Candidate == nullptr) { in computePostDominator()
244 Candidate = Succ; in computePostDominator()
[all …]
/external/clang/unittests/Tooling/
DTestVisitor.h204 : Candidate(Name, LineNumber, ColumnNumber), Found(false) {} in ExpectedMatch()
207 if (Candidate.Matches(Name, Location)) { in UpdateFor()
210 } else if (!Found && Candidate.PartiallyMatches(Name, Location)) { in UpdateFor()
219 << "Expected \"" << Candidate.ExpectedName in ExpectFound()
220 << "\" at " << Candidate.LineNumber in ExpectFound()
221 << ":" << Candidate.ColumnNumber << PartialMatches; in ExpectFound()
224 MatchCandidate Candidate; member
/external/llvm/lib/Target/AArch64/
DAArch64CollectLOH.cpp817 for (const MachineInstr *Candidate : PotentialCandidates) { in computeOthers() local
819 const MachineInstr *Def = *UseToDefs.find(Candidate)->second.begin(); in computeOthers()
864 for (const MachineInstr *Candidate : PotentialCandidates) { in computeOthers() local
865 if (!UseToDefs.find(Candidate)->second.empty()) in computeOthers()
867 *UseToDefs.find(Candidate)->second.begin()); in computeOthers()
891 if (isCandidateLoad(Candidate)) { in computeOthers()
896 if (!supportLoadFromLiteral(Candidate)) in computeOthers()
899 DEBUG(dbgs() << "Record AdrpLdr:\n" << *L1 << '\n' << *Candidate in computeOthers()
903 Args.push_back(Candidate); in computeOthers()
906 assert((!InvolvedInLOHs || InvolvedInLOHs->insert(Candidate)) && in computeOthers()
[all …]
/external/llvm/lib/Target/Hexagon/
DHexagonMachineScheduler.cpp471 SchedCandidate &Candidate, in SchedulingCost() argument
537 SchedCandidate &Candidate) { in pickNodeFromQueue() argument
551 int CurrentCost = SchedulingCost(Q, *I, Candidate, RPDelta, false); in pickNodeFromQueue()
554 if (!Candidate.SU) { in pickNodeFromQueue()
555 Candidate.SU = *I; in pickNodeFromQueue()
556 Candidate.RPDelta = RPDelta; in pickNodeFromQueue()
557 Candidate.SCost = CurrentCost; in pickNodeFromQueue()
563 if (CurrentCost > Candidate.SCost) { in pickNodeFromQueue()
565 Candidate.SU = *I; in pickNodeFromQueue()
566 Candidate.RPDelta = RPDelta; in pickNodeFromQueue()
[all …]
DHexagonMachineScheduler.h229 SUnit *SU, SchedCandidate &Candidate,
234 SchedCandidate &Candidate);
/external/llvm/lib/Target/Mips/
DMipsDelaySlotFiller.cpp209 bool delayHasHazard(const MachineInstr &Candidate, RegDefsUses &RegDU,
247 bool terminateSearch(const MachineInstr &Candidate) const;
844 bool Filler::delayHasHazard(const MachineInstr &Candidate, RegDefsUses &RegDU, in delayHasHazard() argument
846 bool HasHazard = (Candidate.isImplicitDef() || Candidate.isKill()); in delayHasHazard()
848 HasHazard |= IM.hasHazard(Candidate); in delayHasHazard()
849 HasHazard |= RegDU.update(Candidate, 0, Candidate.getNumOperands()); in delayHasHazard()
854 bool Filler::terminateSearch(const MachineInstr &Candidate) const { in terminateSearch()
855 return (Candidate.isTerminator() || Candidate.isCall() || in terminateSearch()
856 Candidate.isPosition() || Candidate.isInlineAsm() || in terminateSearch()
857 Candidate.hasUnmodeledSideEffects()); in terminateSearch()
/external/clang/lib/Sema/
DSemaOverload.cpp5643 OverloadCandidate &Candidate = CandidateSet.addCandidate(Args.size()); in AddOverloadCandidate() local
5644 Candidate.FoundDecl = FoundDecl; in AddOverloadCandidate()
5645 Candidate.Function = Function; in AddOverloadCandidate()
5646 Candidate.Viable = true; in AddOverloadCandidate()
5647 Candidate.IsSurrogate = false; in AddOverloadCandidate()
5648 Candidate.IgnoreObjectArgument = false; in AddOverloadCandidate()
5649 Candidate.ExplicitCallArguments = Args.size(); in AddOverloadCandidate()
5660 Candidate.Viable = false; in AddOverloadCandidate()
5661 Candidate.FailureKind = ovl_fail_illegal_constructor; in AddOverloadCandidate()
5673 Candidate.Viable = false; in AddOverloadCandidate()
[all …]
DScope.cpp119 if (VarDecl *Candidate = NRVO.getPointer()) { in mergeNRVOIntoParent() local
120 if (isDeclScope(Candidate)) in mergeNRVOIntoParent()
121 Candidate->setNRVOVariable(true); in mergeNRVOIntoParent()
DSemaLookup.cpp3348 TypoCorrection &Candidate) { in isCandidateViable() argument
3349 Candidate.setCallbackDistance(CCC.RankCandidate(Candidate)); in isCandidateViable()
3350 return Candidate.getEditDistance(false) != TypoCorrection::InvalidDistance; in isCandidateViable()
3602 bool TypoCorrectionConsumer::resolveCorrection(TypoCorrection &Candidate) { in resolveCorrection() argument
3603 IdentifierInfo *Name = Candidate.getCorrectionAsIdentifierInfo(); in resolveCorrection()
3610 Name == Typo && !Candidate.WillReplaceSpecifier()); in resolveCorrection()
3618 Candidate.WillReplaceSpecifier(true); in resolveCorrection()
3628 QualifiedResults.push_back(Candidate); in resolveCorrection()
3639 Candidate.addCorrectionDecl(TRD); in resolveCorrection()
3640 checkCorrectionVisibility(SemaRef, Candidate); in resolveCorrection()
[all …]
DSemaCodeComplete.cpp3880 for (auto &Candidate : CandidateSet) in mergeCandidatesWithResults() local
3881 if (Candidate.Viable) in mergeCandidatesWithResults()
3882 Results.push_back(ResultCandidate(Candidate.Function)); in mergeCandidatesWithResults()
3896 for (auto &Candidate : Candidates) { in getParamType() local
3897 if (auto FType = Candidate.getFunctionType()) in getParamType()
DSemaDeclCXX.cpp7937 bool ValidateCandidate(const TypoCorrection &Candidate) override { in ValidateCandidate() argument
7938 NamedDecl *ND = Candidate.getCorrectionDecl(); in ValidateCandidate()
7945 if (Candidate.WillReplaceSpecifier() && !Candidate.getCorrectionSpecifier()) in ValidateCandidate()
7962 Candidate.WillReplaceSpecifier() in ValidateCandidate()
7963 ? Candidate.getCorrectionSpecifier() in ValidateCandidate()
DSemaOpenMP.cpp644 bool ValidateCandidate(const TypoCorrection &Candidate) override { in ValidateCandidate() argument
645 NamedDecl *ND = Candidate.getCorrectionDecl(); in ValidateCandidate()
DSemaDecl.cpp7931 NamedDecl *Candidate = Previous.getFoundDecl(); in CheckFunctionDeclaration() local
7932 if (shouldLinkPossiblyHiddenDecl(Candidate, NewFD)) { in CheckFunctionDeclaration()
7934 OldDecl = Candidate; in CheckFunctionDeclaration()
/external/llvm/utils/release/
Dtest-release.sh389 for Candidate in `find $InstallPath/{bin,lib} -type f`; do
390 if file $Candidate | grep ELF | egrep 'executable|shared object' > /dev/null 2>&1 ; then
391 rpath=`objdump -x $Candidate | grep 'RPATH' | sed -e's/^ *RPATH *//'`
394 chrpath -r $newrpath $Candidate 2>&1 > /dev/null 2>&1
/external/clang/lib/Parse/
DParseTentative.cpp1023 bool ValidateCandidate(const TypoCorrection &Candidate) override { in ValidateCandidate() argument
1026 if (Candidate.isResolved() && !Candidate.isKeyword() && in ValidateCandidate()
1027 std::all_of(Candidate.begin(), Candidate.end(), in ValidateCandidate()
1031 return CorrectionCandidateCallback::ValidateCandidate(Candidate); in ValidateCandidate()
/external/libxml2/os400/libxmlrpg/
Dxpointer.rpgle4 * W3C Candidate Recommendation 7 June 2000
/external/clang/include/clang/Sema/
DSemaInternal.h284 bool resolveCorrection(TypoCorrection &Candidate);
/external/markdown/docs/
DCHANGE_LOG10 Mar 8, 2009: Release Candidate 2.0-rc-1.
/external/v8/src/heap/
Dmark-compact.cc782 class Candidate { in CollectEvacuationCandidates() class
784 Candidate() : fragmentation_(0), page_(NULL) {} in CollectEvacuationCandidates() function in v8::internal::MarkCompactCollector::CollectEvacuationCandidates::Candidate
785 Candidate(int f, Page* p) : fragmentation_(f), page_(p) {} in CollectEvacuationCandidates() function in v8::internal::MarkCompactCollector::CollectEvacuationCandidates::Candidate
831 Candidate candidates[kMaxMaxEvacuationCandidates]; in CollectEvacuationCandidates()
838 Candidate* least = NULL; in CollectEvacuationCandidates()
889 candidates[count++] = Candidate(fragmentation, p); in CollectEvacuationCandidates()
900 *least = Candidate(fragmentation, p); in CollectEvacuationCandidates()
/external/llvm/docs/
DHowToReleaseLLVM.rst144 number. For instance, to create **Release Candidate 1** you would issue the
165 Similarly, **Release Candidate 2** would be named ``RC2`` and so on. This keeps
/external/llvm/include/llvm/CodeGen/
DMachineScheduler.h894 SchedCandidate &Candidate);
/external/llvm/lib/Analysis/
DScalarEvolution.cpp7037 const SCEV *Candidate) { in IsMaxConsistingOf() argument
7041 auto It = std::find(MaxExpr->op_begin(), MaxExpr->op_end(), Candidate); in IsMaxConsistingOf()
7050 const SCEV *Candidate) { in IsMinConsistingOf() argument
7055 return IsMaxConsistingOf<MaxExprType>(MaybeMaxExpr, SE.getNotSCEV(Candidate)); in IsMinConsistingOf()