Home
last modified time | relevance | path

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

1234

/llvm-project-15.0.7/llvm/tools/llvm-profgen/
H A DCSPreInliner.cpp159 if (Candidate.CallsiteCount <= ColdCountThreshold) in shouldInline()
171 (Candidate.CallsiteCount - NormalizationLowerBound) / in shouldInline()
182 return (Candidate.SizeCost < SampleThreshold); in shouldInline()
205 ProfiledInlineCandidate Candidate = CQueue.top(); in processFunction() local
208 if ((ShouldInline = shouldInline(Candidate))) { in processFunction()
213 Candidate.CalleeSamples->getContext().setAttribute( in processFunction()
215 FuncFinalSize += Candidate.SizeCost; in processFunction()
216 getInlineCandidates(CQueue, Candidate.CalleeSamples); in processFunction()
224 << " (callee size: " << Candidate.SizeCost in processFunction()
245 ProfiledInlineCandidate Candidate = CQueue.top(); in processFunction()
[all …]
/llvm-project-15.0.7/llvm/lib/Transforms/Scalar/
H A DStraightLineStrengthReduce.cpp133 struct Candidate { struct in __anon79ba6f780111::StraightLineStrengthReduce
141 Candidate() = default;
175 Candidate *Basis = nullptr; argument
183 bool isBasisFor(const Candidate &Basis, const Candidate &C);
228 void rewriteCandidateWithBasis(const Candidate &C, const Candidate &Basis);
240 static Value *emitBump(const Candidate &Basis, const Candidate &C,
349 Candidate C(CT, B, Idx, S, I); in allocateCandidatesAndFindBasis()
633 const Candidate &C, const Candidate &Basis) { in rewriteCandidateWithBasis()
652 case Candidate::Add: in rewriteCandidateWithBasis()
653 case Candidate::Mul: { in rewriteCandidateWithBasis()
[all …]
H A DNaryReassociate.cpp418 Value *Candidate = findClosestMatchingDominator(CandidateExpr, GEP); in tryReassociateGEPAtIndex() local
419 if (Candidate == nullptr) in tryReassociateGEPAtIndex()
426 Candidate = Builder.CreateBitOrPointerCast(Candidate, GEP->getType()); in tryReassociateGEPAtIndex()
427 assert(Candidate->getType() == GEP->getType()); in tryReassociateGEPAtIndex()
459 Builder.CreateGEP(GEP->getResultElementType(), Candidate, RHS)); in tryReassociateGEPAtIndex()
568 if (Value *Candidate = Candidates.back()) { in findClosestMatchingDominator() local
569 Instruction *CandidateInstruction = cast<Instruction>(Candidate); in findClosestMatchingDominator()
/llvm-project-15.0.7/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()
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()
248 while (Alternate != Candidate) { in computePostDominator()
[all …]
/llvm-project-15.0.7/llvm/lib/CodeGen/
H A DVLIWMachineScheduler.cpp791 if (!Candidate.SU) { in pickNodeFromQueue()
793 Candidate.SU = *I; in pickNodeFromQueue()
794 Candidate.RPDelta = RPDelta; in pickNodeFromQueue()
795 Candidate.SCost = CurrentCost; in pickNodeFromQueue()
806 Candidate.SU = *I; in pickNodeFromQueue()
807 Candidate.RPDelta = RPDelta; in pickNodeFromQueue()
817 Candidate.SU = *I; in pickNodeFromQueue()
818 Candidate.RPDelta = RPDelta; in pickNodeFromQueue()
830 Candidate.SU = *I; in pickNodeFromQueue()
849 Candidate.SU = *I; in pickNodeFromQueue()
[all …]
H A DMIRVRegNamerUtils.cpp147 for (MachineInstr &Candidate : *MBB) { in renameInstsInMBB()
149 if (Candidate.mayStore() || Candidate.isBranch()) in renameInstsInMBB()
151 if (!Candidate.getNumOperands()) in renameInstsInMBB()
154 MachineOperand &MO = Candidate.getOperand(0); in renameInstsInMBB()
159 NamedVReg(MO.getReg(), Prefix + getInstructionOpcodeHash(Candidate))); in renameInstsInMBB()
H A DMachineOutliner.cpp382 unsigned StringLen, std::vector<Candidate> &CandidatesForRepeatedSeq,
428 for (const Candidate &C : OF.Candidates) in getSubprogramOrNull()
470 unsigned StringLen, std::vector<Candidate> &CandidatesForRepeatedSeq, in emitNotOutliningCheaperRemark()
476 Candidate &C = CandidatesForRepeatedSeq.front(); in emitNotOutliningCheaperRemark()
535 std::vector<Candidate> CandidatesForRepeatedSeq; in findCandidates()
563 &EndIdx](const Candidate &C) { in findCandidates()
635 Candidate &FirstCand = OF.Candidates.front(); in createOutlinedFunction()
644 [](UWTableKind K, const outliner::Candidate &C) { in createOutlinedFunction()
766 erase_if(OF.Candidates, [&Mapper](Candidate &C) { in outline()
788 for (Candidate &C : OF.Candidates) { in outline()
/llvm-project-15.0.7/llvm/lib/Target/AMDGPU/
H A DGCNMinRegStrategy.cpp24 struct Candidate : ilist_node<Candidate> { struct in __anon7060f7100111::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()
220 RQ.push_front(*new (Alloc.Allocate()) Candidate(SuccSU, Priority)); in releaseSuccessors()
[all …]
H A DGCNILPSched.cpp22 struct Candidate : ilist_node<Candidate> { struct in __anoned9f76670111::GCNILPScheduler
25 Candidate(SUnit *SU_) in Candidate() argument
29 SpecificBumpPtrAllocator<Candidate> Alloc;
30 typedef simple_ilist<Candidate> Queue;
43 Candidate* pickCandidate();
240 GCNILPScheduler::Candidate* GCNILPScheduler::pickCandidate() { in pickCandidate()
285 PendingQueue.push_front(*new (Alloc.Allocate()) Candidate(PredSU)); in releasePredecessors()
308 *new (Alloc.Allocate()) Candidate(const_cast<SUnit*>(SU))); in schedule()
318 [=](const Candidate& C1, const Candidate& C2) { in schedule()
/llvm-project-15.0.7/llvm/include/llvm/CodeGen/
H A DMachineOutliner.h37 struct Candidate { struct
196 Candidate(unsigned StartIdx, unsigned Len, in Candidate() argument
202 Candidate() = default;
206 bool operator<(const Candidate &RHS) const {
217 std::vector<Candidate> Candidates;
240 for (const Candidate &C : Candidates) in getOutliningCost()
262 OutlinedFunction(std::vector<Candidate> &Candidates, unsigned SequenceSize, in OutlinedFunction()
267 for (Candidate &C : Candidates) in OutlinedFunction()
/llvm-project-15.0.7/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);
/llvm-project-15.0.7/clang-tools-extra/clang-tidy/performance/
H A DMoveConstructorInitCheck.cpp58 const CXXConstructorDecl *Candidate = nullptr; in check() local
68 Candidate = Ctor; in check()
73 if (Candidate) { in check()
82 diag(Candidate->getLocation(), "candidate move constructor here", in check()
/llvm-project-15.0.7/clang/unittests/Tooling/
H A DTestVisitor.h219 : Candidate(Name, LineNumber, ColumnNumber), TimesExpected(Times), in ExpectedMatch()
223 if (Candidate.Matches(Name, Location)) { in UpdateFor()
227 Candidate.PartiallyMatches(Name, Location)) { in UpdateFor()
236 << "Expected \"" << Candidate.ExpectedName in ExpectFound()
237 << "\" at " << Candidate.LineNumber in ExpectFound()
238 << ":" << Candidate.ColumnNumber << PartialMatches; in ExpectFound()
241 MatchCandidate Candidate; member
/llvm-project-15.0.7/llvm/lib/Transforms/IPO/
H A DSampleProfile.cpp467 tryInlineCandidate(InlineCandidate &Candidate,
908 auto &CI = *Candidate.CallInstr; in tryPromoteAndInlineCandidate()
931 Sum -= Candidate.CallsiteCount; in tryPromoteAndInlineCandidate()
944 Candidate.CallInstr = DI; in tryPromoteAndInlineCandidate()
1176 if (tryInlineCandidate(Candidate)) { in inlineHotFunctions()
1203 CallBase &CB = *Candidate.CallInstr; in tryInlineCandidate()
1251 if (Candidate.CallsiteDistribution < 1) { in tryInlineCandidate()
1417 InlineCandidate Candidate = CQueue.top(); in inlineHotFunctionsWithPriority() local
1419 CallBase *I = Candidate.CallInstr; in inlineHotFunctionsWithPriority()
1428 Sum *= Candidate.CallsiteDistribution; in inlineHotFunctionsWithPriority()
[all …]
H A DIROutliner.cpp184 Optional<unsigned> GVN = Candidate->getGVN(V); in findCorrespondingValueIn()
256 EndInst = Candidate->end()->Inst; in splitCandidate()
274 Candidate->getBasicBlocks(BBSet); in splitCandidate()
362 Candidate->getBasicBlocks(BBSet); in splitCandidate()
416 Candidate->getBasicBlocks(BBSet); in reattachCandidate()
496 for (IRInstructionData &ID : *Candidate) { in getBenefit()
1883 if (Region.Candidate->getGVN(PN)) in replaceArgumentUses()
2548 IRSimilarityCandidate &Candidate = *CurrentGroup.Regions[0]->Candidate; in findCostForOutputBlocks() local
2550 Candidate.getBasicBlocks(CandidateBlocks); in findCostForOutputBlocks()
2555 for (IRInstructionData &ID : Candidate) { in findCostForOutputBlocks()
[all …]
/llvm-project-15.0.7/llvm/lib/CodeGen/GlobalISel/
H A DLoadStoreOpt.cpp563 StoreMergeCandidate Candidate; in mergeBlockStores() local
571 if (!addStoreToCandidate(*StoreMI, Candidate)) { in mergeBlockStores()
575 Changed |= processMergeCandidate(Candidate); in mergeBlockStores()
578 Candidate.addPotentialAlias(*StoreMI); in mergeBlockStores()
584 if (Candidate.Stores.empty()) in mergeBlockStores()
589 Changed |= processMergeCandidate(Candidate); in mergeBlockStores()
590 Candidate.Stores.clear(); in mergeBlockStores()
597 if (operationAliasesWithCandidate(MI, Candidate)) { in mergeBlockStores()
600 Changed |= processMergeCandidate(Candidate); in mergeBlockStores()
606 Candidate.addPotentialAlias(MI); in mergeBlockStores()
[all …]
/llvm-project-15.0.7/clang/lib/Driver/ToolChains/
H A DROCm.h62 struct Candidate { struct
71 Candidate(std::string Path, bool StrictChecking = false, argument
135 SmallVector<Candidate, 4> ROCmSearchDirs;
148 const SmallVectorImpl<Candidate> &getInstallationPathCandidates();
154 llvm::SmallString<0> findSPACKPackage(const Candidate &Cand,
/llvm-project-15.0.7/llvm/lib/Target/Mips/
H A DMipsDelaySlotFiller.cpp254 bool delayHasHazard(const MachineInstr &Candidate, RegDefsUses &RegDU,
292 bool terminateSearch(const MachineInstr &Candidate) const;
944 bool MipsDelaySlotFiller::delayHasHazard(const MachineInstr &Candidate, in delayHasHazard() argument
947 assert(!Candidate.isKill() && in delayHasHazard()
950 bool HasHazard = Candidate.isImplicitDef(); in delayHasHazard()
952 HasHazard |= IM.hasHazard(Candidate); in delayHasHazard()
953 HasHazard |= RegDU.update(Candidate, 0, Candidate.getNumOperands()); in delayHasHazard()
958 bool MipsDelaySlotFiller::terminateSearch(const MachineInstr &Candidate) const { in terminateSearch()
959 return (Candidate.isTerminator() || Candidate.isCall() || in terminateSearch()
960 Candidate.isPosition() || Candidate.isInlineAsm() || in terminateSearch()
[all …]
/llvm-project-15.0.7/clang-tools-extra/clangd/unittests/
H A DFuzzyMatchTests.cpp46 ExpectedMatch Candidate; member
48 MatchesMatcher(ExpectedMatch Candidate, llvm::Optional<float> Score) in MatchesMatcher()
49 : Candidate(std::move(Candidate)), Score(Score) {} in MatchesMatcher()
52 llvm::raw_os_ostream(*OS) << "Matches " << Candidate; in DescribeTo()
64 auto Result = Matcher.match(Candidate.Word); in MatchAndExplain()
66 return Result && Candidate.accepts(AnnotatedMatch) && in MatchAndExplain()
/llvm-project-15.0.7/clang/lib/Sema/
H A DSemaOverload.cpp6386 Candidate.Viable = true; in AddOverloadCandidate()
6387 Candidate.RewriteKind = in AddOverloadCandidate()
6398 Candidate.Viable = false; in AddOverloadCandidate()
6962 Candidate.RewriteKind = in AddMethodCandidate()
6994 Candidate.Viable = true; in AddMethodCandidate()
7118 Candidate.RewriteKind = in AddMethodTemplateCandidate()
7200 Candidate.RewriteKind = in AddTemplateOverloadCandidate()
7384 Candidate.Viable = true; in AddConversionCandidate()
7611 Candidate.Viable = true; in AddSurrogateCandidate()
7818 Candidate.Viable = true; in AddBuiltinCandidate()
[all …]
/llvm-project-15.0.7/bolt/lib/Passes/
H A DRegReAssign.cpp324 MCPhysReg Candidate = 0; in conservativePassOverFunction() local
326 if (RegScore[J] > RegScore[Candidate]) in conservativePassOverFunction()
327 Candidate = J; in conservativePassOverFunction()
329 if (!Candidate || RegScore[Candidate] < 0) in conservativePassOverFunction()
340 if (RegScore[Candidate] > (ScoreRBX + 10)) in conservativePassOverFunction()
348 << BC.MRI->getName(Candidate) << "\n\n"); in conservativePassOverFunction()
350 swap(Function, RBX, Candidate); in conservativePassOverFunction()
/llvm-project-15.0.7/llvm/lib/Transforms/Vectorize/
H A DVPlanSLP.cpp247 for (auto *Candidate : Candidates) { in getBest() local
249 auto *CandidateI = cast<VPInstruction>(Candidate); in getBest()
251 LLVM_DEBUG(dbgs() << *cast<VPInstruction>(Candidate)->getUnderlyingInstr() in getBest()
253 BestCandidates.push_back(Candidate); in getBest()
271 for (auto *Candidate : BestCandidates) { in getBest() local
272 unsigned Score = getLAScore(Last, Candidate, Depth, IAI); in getBest()
281 Best = Candidate; in getBest()
/llvm-project-15.0.7/clang-tools-extra/clangd/
H A DCodeComplete.cpp910 int NumParams = Candidate.getNumParams(); in paramIndexForArg()
911 if (auto *T = Candidate.getFunctionType()) { in paramIndexForArg()
979 Candidate, *CCS, in ProcessOverloadCandidates()
980 Candidate.getFunction() in ProcessOverloadCandidates()
1116 Signal.Kind = Candidate.getKind(); in processOverloadCandidate()
1864 for (const auto &Candidate : Bundle) { in addCandidate() local
1865 if (Candidate.IndexResult) { in addCandidate()
1866 Quality.merge(*Candidate.IndexResult); in addCandidate()
1877 if (Candidate.SemaResult) { in addCandidate()
1878 Quality.merge(*Candidate.SemaResult); in addCandidate()
[all …]
/llvm-project-15.0.7/clang/utils/TableGen/
H A DClangOpenCLBuiltinEmitter.cpp134 BuiltinIndexListTy *Candidate,
643 BuiltinIndexListTy *Candidate, in CanReuseSignature() argument
645 assert(Candidate->size() == SignatureList.size() && in CanReuseSignature()
649 SignatureListMap.find(Candidate)->second.Signatures; in CanReuseSignature()
650 for (unsigned Index = 0; Index < Candidate->size(); Index++) { in CanReuseSignature()
685 for (auto *Candidate : KnownSignatures) { in GroupBySignature() local
686 if (Candidate->size() == CurSignatureList->size() && in GroupBySignature()
687 *Candidate == *CurSignatureList) { in GroupBySignature()
688 if (CanReuseSignature(Candidate, Fct.second)) { in GroupBySignature()
689 SignatureListMap.find(Candidate)->second.Names.push_back(Fct.first); in GroupBySignature()

1234