Home
last modified time | relevance | path

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

1234

/src/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DStraightLineStrengthReduce.cpp133 struct Candidate { struct in __anon68b6605d0111::StraightLineStrengthReduce
141 Candidate() = default;
142 Candidate(Kind CT, const SCEV *B, ConstantInt *Idx, Value *S, in Candidate() function
175 Candidate *Basis = nullptr; argument
183 bool isBasisFor(const Candidate &Basis, const Candidate &C);
186 bool isFoldable(const Candidate &C, TargetTransformInfo *TTI,
191 bool isSimplestForm(const Candidate &C);
223 void allocateCandidatesAndFindBasis(Candidate::Kind CT, const SCEV *B,
228 void rewriteCandidateWithBasis(const Candidate &C, const Candidate &Basis);
237 static Value *emitBump(const Candidate &Basis, const Candidate &C,
[all …]
H A DNaryReassociate.cpp419 Value *Candidate = findClosestMatchingDominator(CandidateExpr, GEP); in tryReassociateGEPAtIndex() local
420 if (Candidate == nullptr) in tryReassociateGEPAtIndex()
427 Candidate = Builder.CreateBitOrPointerCast(Candidate, GEP->getType()); in tryReassociateGEPAtIndex()
428 assert(Candidate->getType() == GEP->getType()); in tryReassociateGEPAtIndex()
460 Builder.CreateGEP(GEP->getResultElementType(), Candidate, RHS)); in tryReassociateGEPAtIndex()
569 if (Value *Candidate = Candidates.pop_back_val()) { in findClosestMatchingDominator() local
570 Instruction *CandidateInstruction = cast<Instruction>(Candidate); in findClosestMatchingDominator()
/src/contrib/llvm-project/clang/lib/Analysis/
H A DThreadSafetyTIL.cpp209 BasicBlock *Candidate = nullptr; in computeDominator() local
215 if (Candidate == nullptr) { in computeDominator()
216 Candidate = Pred; in computeDominator()
221 while (Alternate != Candidate) { in computeDominator()
222 if (Candidate->BlockID > Alternate->BlockID) in computeDominator()
223 Candidate = Candidate->DominatorNode.Parent; in computeDominator()
228 DominatorNode.Parent = Candidate; in computeDominator()
236 BasicBlock *Candidate = nullptr; in computePostDominator() local
242 if (Candidate == nullptr) { in computePostDominator()
243 Candidate = Succ; in computePostDominator()
[all …]
/src/contrib/llvm-project/llvm/lib/CodeGen/
H A DVLIWMachineScheduler.cpp525 const RegPressureTracker &RPTracker, SchedCandidate &Candidate, in readyQueueVerboseDump() argument
538 SchedulingCost(Q, *I, Candidate, RPDelta, true); in readyQueueVerboseDump()
597 SchedCandidate &Candidate, in SchedulingCost() argument
771 SchedCandidate &Candidate) { in pickNodeFromQueue() argument
774 readyQueueVerboseDump(RPTracker, Candidate, Q); in pickNodeFromQueue()
788 int CurrentCost = SchedulingCost(Q, *I, Candidate, RPDelta, false); in pickNodeFromQueue()
791 if (!Candidate.SU) { in pickNodeFromQueue()
793 Candidate.SU = *I; in pickNodeFromQueue()
794 Candidate.RPDelta = RPDelta; in pickNodeFromQueue()
795 Candidate.SCost = CurrentCost; in pickNodeFromQueue()
[all …]
H A DMIRVRegNamerUtils.cpp150 for (MachineInstr &Candidate : *MBB) { in renameInstsInMBB()
152 if (Candidate.mayStore() || Candidate.isBranch()) in renameInstsInMBB()
154 if (!Candidate.getNumOperands()) in renameInstsInMBB()
157 MachineOperand &MO = Candidate.getOperand(0); in renameInstsInMBB()
162 NamedVReg(MO.getReg(), Prefix + getInstructionOpcodeHash(Candidate))); in renameInstsInMBB()
H A DMachineOutliner.cpp437 unsigned StringLen, std::vector<Candidate> &CandidatesForRepeatedSeq,
483 for (const Candidate &C : OF.Candidates) in getSubprogramOrNull()
525 unsigned StringLen, std::vector<Candidate> &CandidatesForRepeatedSeq, in emitNotOutliningCheaperRemark()
531 Candidate &C = CandidatesForRepeatedSeq.front(); in emitNotOutliningCheaperRemark()
590 std::vector<Candidate> CandidatesForRepeatedSeq; in findCandidates()
716 Candidate &FirstCand = OF.Candidates.front(); in createOutlinedFunction()
725 [](UWTableKind K, const outliner::Candidate &C) { in createOutlinedFunction()
855 erase_if(OF.Candidates, [&UnsignedVecBegin](Candidate &C) { in outline()
892 for (Candidate &C : OF.Candidates) { in outline()
/src/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DGCNMinRegStrategy.cpp24 struct Candidate : ilist_node<Candidate> { struct in __anonb5b98fd50111::GCNMinRegScheduler
28 Candidate(const SUnit *SU_, int Priority_ = 0) in Candidate() function
32 SpecificBumpPtrAllocator<Candidate> Alloc;
33 using Queue = simple_ilist<Candidate>;
68 Candidate* pickCandidate();
133 GCNMinRegScheduler::Candidate* GCNMinRegScheduler::pickCandidate() { in pickCandidate()
140 Num = findMax(Num, [=](const Candidate &C) { return C.Priority; }); in pickCandidate()
145 Num = findMax(Num, [=](const Candidate &C) { in pickCandidate()
156 Num = findMax(Num, [=](const Candidate &C) { in pickCandidate()
170 Num = findMax(Num, [=](const Candidate &C) { return -(int64_t)C.SU->NodeNum; }); in pickCandidate()
[all …]
H A DGCNILPSched.cpp22 struct Candidate : ilist_node<Candidate> { struct in __anon447a1f6c0111::GCNILPScheduler
25 Candidate(SUnit *SU_) in Candidate() function
29 SpecificBumpPtrAllocator<Candidate> Alloc;
30 using Queue = simple_ilist<Candidate>;
43 Candidate* pickCandidate();
238 GCNILPScheduler::Candidate* GCNILPScheduler::pickCandidate() { in pickCandidate()
283 PendingQueue.push_front(*new (Alloc.Allocate()) Candidate(PredSU)); in releasePredecessors()
306 *new (Alloc.Allocate()) Candidate(const_cast<SUnit*>(SU))); in schedule()
315 llvm::min_element(PendingQueue, [=](const Candidate &C1, in schedule()
316 const Candidate &C2) { in schedule()
/src/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DMachineOutliner.h37 struct Candidate { struct
199 Candidate(unsigned StartIdx, unsigned Len, in Candidate() argument
205 Candidate() = delete;
209 bool operator<(const Candidate &RHS) const {
220 std::vector<Candidate> Candidates;
243 for (const Candidate &C : Candidates) in getOutliningCost()
265 OutlinedFunction(std::vector<Candidate> &Candidates, unsigned SequenceSize, in OutlinedFunction()
270 for (Candidate &C : Candidates) in OutlinedFunction()
/src/contrib/llvm-project/llvm/lib/Transforms/Instrumentation/
H A DIndirectCallPromotion.cpp584 auto &Candidate = Candidates[CalleeIndexIter->second]; in computeVTableInfos() local
588 Candidate.VTableGUIDAndCounts[VTableVal] = V.Count; in computeVTableInfos()
589 Candidate.AddressPoints.push_back( in computeVTableInfos()
719 for (const auto &Candidate : Candidates) { in tryToPromoteWithVTableCmp() local
720 for (auto &[GUID, Count] : Candidate.VTableGUIDAndCounts) in tryToPromoteWithVTableCmp()
728 CB, VPtr, Candidate.TargetFunction, Candidate.AddressPoints, in tryToPromoteWithVTableCmp()
729 createBranchWeights(CB.getContext(), Candidate.Count, in tryToPromoteWithVTableCmp()
730 TotalFuncCount - Candidate.Count)); in tryToPromoteWithVTableCmp()
737 const auto &VTableGUIDAndCounts = Candidate.VTableGUIDAndCounts; in tryToPromoteWithVTableCmp()
739 << ore::NV("DirectCallee", Candidate.TargetFunction) in tryToPromoteWithVTableCmp()
[all …]
/src/contrib/llvm-project/llvm/lib/Target/SystemZ/
H A DSystemZMachineScheduler.cpp175 Candidate Best; in pickNode()
179 Candidate c(SU, *HazardRec); in pickNode()
200 SystemZPostRASchedStrategy::Candidate::
201 Candidate(SUnit *SU_, SystemZHazardRecognizer &HazardRec) : Candidate() { in Candidate() function in SystemZPostRASchedStrategy::Candidate
213 bool SystemZPostRASchedStrategy::Candidate::
214 operator<(const Candidate &other) { in operator <()
244 Candidate c(SU, *HazardRec); c.dumpCosts(); dbgs() << "\n";); in schedNode()
H A DSystemZMachineScheduler.h41 struct Candidate { struct
50 Candidate() = default; argument
51 Candidate(SUnit *SU_, SystemZHazardRecognizer &HazardRec);
54 bool operator<(const Candidate &other);
/src/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DSampleProfile.cpp502 Function &F, InlineCandidate &Candidate, uint64_t SumOrigin,
509 InlineCost shouldInlineCandidate(InlineCandidate &Candidate);
512 tryInlineCandidate(InlineCandidate &Candidate,
804 static bool doesHistoryAllowICP(const Instruction &Inst, StringRef Candidate) { in doesHistoryAllowICP() argument
821 if (V.Value == Function::getGUID(Candidate)) in doesHistoryAllowICP()
920 Function &F, InlineCandidate &Candidate, uint64_t SumOrigin, uint64_t &Sum, in tryPromoteAndInlineCandidate() argument
930 auto CalleeFunctionName = Candidate.CalleeSamples->getFunction(); in tryPromoteAndInlineCandidate()
935 auto &CI = *Candidate.CallInstr; in tryPromoteAndInlineCandidate()
956 CI, R->second, Candidate.CallsiteCount, Sum, false, ORE); in tryPromoteAndInlineCandidate()
958 Sum -= Candidate.CallsiteCount; in tryPromoteAndInlineCandidate()
[all …]
H A DIROutliner.cpp188 std::optional<unsigned> GVN = Candidate->getGVN(V); in findCorrespondingValueIn()
190 std::optional<unsigned> CanonNum = Candidate->getCanonicalNum(*GVN); in findCorrespondingValueIn()
192 Other.Candidate->fromCanonicalNum(*CanonNum); in findCorrespondingValueIn()
193 std::optional<Value *> FoundValueOpt = Other.Candidate->fromGVN(*FirstGVN); in findCorrespondingValueIn()
251 Instruction *BackInst = Candidate->backInstruction(); in splitCandidate()
261 EndInst = Candidate->end()->Inst; in splitCandidate()
273 Instruction *StartInst = (*Candidate->begin()).Inst; in splitCandidate()
279 Candidate->getBasicBlocks(BBSet); in splitCandidate()
367 Candidate->getBasicBlocks(BBSet); in splitCandidate()
407 Instruction *StartInst = (*Candidate->begin()).Inst; in reattachCandidate()
[all …]
H A DSampleProfileMatcher.cpp286 const auto &Candidate = R->second; in matchNonCallsiteLocs() local
287 InsertMatching(Loc, Candidate); in matchNonCallsiteLocs()
289 << " is matched from " << Loc << " to " << Candidate in matchNonCallsiteLocs()
291 LocationDelta = Candidate.LineOffset - Loc.LineOffset; in matchNonCallsiteLocs()
301 LineLocation Candidate(CandidateLineOffset, L.Discriminator); in matchNonCallsiteLocs() local
302 InsertMatching(L, Candidate); in matchNonCallsiteLocs()
304 << " to " << Candidate << "\n"); in matchNonCallsiteLocs()
314 LineLocation Candidate(CandidateLineOffset, Loc.Discriminator); in matchNonCallsiteLocs() local
315 InsertMatching(Loc, Candidate); in matchNonCallsiteLocs()
317 << Candidate << "\n"); in matchNonCallsiteLocs()
/src/contrib/bmake/
H A Dsuff.c197 typedef struct Candidate { struct
212 struct Candidate *parent; argument
224 } Candidate; argument
926 CandidateSearcher_Add(CandidateSearcher *cs, Candidate *cand) in CandidateSearcher_Add()
933 CandidateSearcher_AddIfNew(CandidateSearcher *cs, Candidate *cand) in CandidateSearcher_AddIfNew()
955 Candidate *cand = ln->datum; in CandidateList_PrintAddrs()
962 static Candidate *
963 Candidate_New(char *name, char *prefix, Suffix *suff, Candidate *parent, in Candidate_New()
966 Candidate *cand = bmake_malloc(sizeof *cand); in Candidate_New()
983 CandidateList_Add(CandidateList *list, char *srcName, Candidate *targ, in CandidateList_Add()
[all …]
/src/contrib/llvm-project/clang/lib/Driver/ToolChains/
H A DROCm.h62 struct Candidate { struct
71 Candidate(std::string Path, bool StrictChecking = false, argument
146 SmallVector<Candidate, 4> ROCmSearchDirs;
159 const SmallVectorImpl<Candidate> &getInstallationPathCandidates();
165 llvm::SmallString<0> findSPACKPackage(const Candidate &Cand,
/src/contrib/llvm-project/llvm/lib/Target/Mips/
H A DMipsDelaySlotFiller.cpp254 bool delayHasHazard(const MachineInstr &Candidate, RegDefsUses &RegDU,
292 bool terminateSearch(const MachineInstr &Candidate) const;
945 bool MipsDelaySlotFiller::delayHasHazard(const MachineInstr &Candidate, in delayHasHazard() argument
948 assert(!Candidate.isKill() && in delayHasHazard()
951 bool HasHazard = Candidate.isImplicitDef(); in delayHasHazard()
953 HasHazard |= IM.hasHazard(Candidate); in delayHasHazard()
954 HasHazard |= RegDU.update(Candidate, 0, Candidate.getNumOperands()); in delayHasHazard()
959 bool MipsDelaySlotFiller::terminateSearch(const MachineInstr &Candidate) const { in terminateSearch()
960 return (Candidate.isTerminator() || Candidate.isCall() || in terminateSearch()
961 Candidate.isPosition() || Candidate.isInlineAsm() || in terminateSearch()
[all …]
/src/contrib/llvm-project/llvm/lib/Target/SPIRV/Analysis/
H A DSPIRVConvergenceRegionAnalysis.cpp91 ConvergenceRegion *Candidate = nullptr; in findParentRegion() local
94 while (Candidate != NextCandidate && NextCandidate != nullptr) { in findParentRegion()
95 Candidate = NextCandidate; in findParentRegion()
99 if (Candidate->Children.size() == 0) in findParentRegion()
100 return Candidate; in findParentRegion()
102 for (auto *Child : Candidate->Children) { in findParentRegion()
110 return Candidate; in findParentRegion()
/src/contrib/llvm-project/clang/lib/Sema/
H A DSemaOverload.cpp6853 OverloadCandidate &Candidate = in AddOverloadCandidate() local
6855 Candidate.FoundDecl = FoundDecl; in AddOverloadCandidate()
6856 Candidate.Function = Function; in AddOverloadCandidate()
6857 Candidate.Viable = true; in AddOverloadCandidate()
6858 Candidate.RewriteKind = in AddOverloadCandidate()
6860 Candidate.IsADLCandidate = IsADLCandidate; in AddOverloadCandidate()
6861 Candidate.ExplicitCallArguments = Args.size(); in AddOverloadCandidate()
6867 Candidate.Viable = false; in AddOverloadCandidate()
6868 Candidate.FailureKind = ovl_fail_explicit; in AddOverloadCandidate()
6884 Candidate.Viable = false; in AddOverloadCandidate()
[all …]
/src/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DVPlanSLP.cpp248 for (auto *Candidate : Candidates) { in getBest() local
250 auto *CandidateI = cast<VPInstruction>(Candidate); in getBest()
252 LLVM_DEBUG(dbgs() << *cast<VPInstruction>(Candidate)->getUnderlyingInstr() in getBest()
254 BestCandidates.push_back(Candidate); in getBest()
272 for (auto *Candidate : BestCandidates) { in getBest() local
273 unsigned Score = getLAScore(Last, Candidate, Depth, IAI); in getBest()
282 Best = Candidate; in getBest()
/src/contrib/llvm-project/llvm/lib/CodeGen/GlobalISel/
H A DLoadStoreOpt.cpp588 StoreMergeCandidate Candidate; in mergeBlockStores() local
596 if (!addStoreToCandidate(*StoreMI, Candidate)) { in mergeBlockStores()
599 if (operationAliasesWithCandidate(*StoreMI, Candidate)) { in mergeBlockStores()
600 Changed |= processMergeCandidate(Candidate); in mergeBlockStores()
603 Candidate.addPotentialAlias(*StoreMI); in mergeBlockStores()
609 if (Candidate.Stores.empty()) in mergeBlockStores()
614 Changed |= processMergeCandidate(Candidate); in mergeBlockStores()
615 Candidate.Stores.clear(); in mergeBlockStores()
622 if (operationAliasesWithCandidate(MI, Candidate)) { in mergeBlockStores()
625 Changed |= processMergeCandidate(Candidate); in mergeBlockStores()
[all …]
/src/contrib/llvm-project/clang/utils/TableGen/
H A DClangOpenCLBuiltinEmitter.cpp134 BuiltinIndexListTy *Candidate,
655 BuiltinIndexListTy *Candidate, in CanReuseSignature() argument
657 assert(Candidate->size() == SignatureList.size() && in CanReuseSignature()
661 SignatureListMap.find(Candidate)->second.Signatures; in CanReuseSignature()
662 for (unsigned Index = 0; Index < Candidate->size(); Index++) { in CanReuseSignature()
697 for (auto *Candidate : KnownSignatures) { in GroupBySignature() local
698 if (Candidate->size() == CurSignatureList->size() && in GroupBySignature()
699 *Candidate == *CurSignatureList) { in GroupBySignature()
700 if (CanReuseSignature(Candidate, Fct.second)) { in GroupBySignature()
701 SignatureListMap.find(Candidate)->second.Names.push_back(Fct.first); in GroupBySignature()
/src/contrib/llvm-project/llvm/lib/Target/Hexagon/
H A DHexagonMachineScheduler.cpp46 SchedCandidate &Candidate, in SchedulingCost() argument
50 ConvergingVLIWScheduler::SchedulingCost(Q, SU, Candidate, Delta, verbose); in SchedulingCost()
/src/contrib/llvm-project/clang/lib/AST/
H A DExternalASTMerger.cpp34 typedef std::pair<Source<NamedDecl *>, ASTImporter *> Candidate; typedef
244 bool HasDeclOfSameType(llvm::ArrayRef<Candidate> Decls, const Candidate &C) { in HasDeclOfSameType()
247 return llvm::any_of(Decls, [&](const Candidate &D) { in HasDeclOfSameType()
477 llvm::SmallVector<Candidate, 4> Candidates; in FindExternalVisibleDeclsByName()
479 auto FilterFoundDecl = [&Candidates](const Candidate &C) { in FindExternalVisibleDeclsByName()
504 for (const Candidate &C : Candidates) { in FindExternalVisibleDeclsByName()

1234