Home
last modified time | relevance | path

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

1234

/openbsd/gnu/llvm/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 …]
/openbsd/gnu/llvm/llvm/lib/Transforms/Scalar/
H A DStraightLineStrengthReduce.cpp133 struct Candidate { struct in __anon1e67aed50111::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.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.back()) { in findClosestMatchingDominator() local
570 Instruction *CandidateInstruction = cast<Instruction>(Candidate); in findClosestMatchingDominator()
/openbsd/gnu/llvm/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 …]
/openbsd/gnu/llvm/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.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.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()
767 erase_if(OF.Candidates, [&Mapper](Candidate &C) { in outline()
789 for (Candidate &C : OF.Candidates) { in outline()
/openbsd/gnu/llvm/llvm/lib/Target/AMDGPU/
H A DGCNMinRegStrategy.cpp24 struct Candidate : ilist_node<Candidate> { struct in __anon9d39fb4d0111::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 __anonfecd50e40111::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()
/openbsd/gnu/llvm/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()
H A DVLIWMachineScheduler.h249 SchedCandidate &Candidate, RegPressureDelta &Delta,
254 SchedCandidate &Candidate);
260 SchedCandidate &Candidate, ReadyQueue &Q);
/openbsd/gnu/llvm/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);
/openbsd/gnu/llvm/llvm/lib/Transforms/IPO/
H A DSampleProfile.cpp502 tryInlineCandidate(InlineCandidate &Candidate,
946 auto &CI = *Candidate.CallInstr; in tryPromoteAndInlineCandidate()
969 Sum -= Candidate.CallsiteCount; in tryPromoteAndInlineCandidate()
982 Candidate.CallInstr = DI; in tryPromoteAndInlineCandidate()
1214 if (tryInlineCandidate(Candidate)) { in inlineHotFunctions()
1241 CallBase &CB = *Candidate.CallInstr; in tryInlineCandidate()
1287 if (Candidate.CallsiteDistribution < 1) { in tryInlineCandidate()
1453 InlineCandidate Candidate = CQueue.top(); in inlineHotFunctionsWithPriority() local
1455 CallBase *I = Candidate.CallInstr; in inlineHotFunctionsWithPriority()
1464 Sum *= Candidate.CallsiteDistribution; in inlineHotFunctionsWithPriority()
[all …]
H A DIROutliner.cpp266 EndInst = Candidate->end()->Inst; in splitCandidate()
284 Candidate->getBasicBlocks(BBSet); in splitCandidate()
372 Candidate->getBasicBlocks(BBSet); in splitCandidate()
426 Candidate->getBasicBlocks(BBSet); in reattachCandidate()
506 for (IRInstructionData &ID : *Candidate) { in getBenefit()
559 IRSimilarityCandidate &C = *Region.Candidate; in collectRegionsConstants()
1896 if (Region.Candidate->getGVN(PN)) in replaceArgumentUses()
2570 IRSimilarityCandidate &Candidate = *CurrentGroup.Regions[0]->Candidate; in findCostForOutputBlocks() local
2572 Candidate.getBasicBlocks(CandidateBlocks); in findCostForOutputBlocks()
2577 for (IRInstructionData &ID : Candidate) { in findCostForOutputBlocks()
[all …]
/openbsd/gnu/llvm/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 …]
/openbsd/gnu/llvm/clang/lib/Driver/ToolChains/
H A DROCm.h62 struct Candidate { struct
71 Candidate(std::string Path, bool StrictChecking = false, argument
136 SmallVector<Candidate, 4> ROCmSearchDirs;
149 const SmallVectorImpl<Candidate> &getInstallationPathCandidates();
155 llvm::SmallString<0> findSPACKPackage(const Candidate &Cand,
H A DAMDGPU.cpp41 RocmInstallationDetector::findSPACKPackage(const Candidate &Cand, in findSPACKPackage()
179 const SmallVectorImpl<RocmInstallationDetector::Candidate> &
239 return Candidate(ParentDir.str(), /*StrictChecking=*/true, in getInstallationPathCandidates()
249 return Candidate(ParentDir.str(), /*StrictChecking=*/true); in getInstallationPathCandidates()
427 for (const auto &Candidate : ROCmDirs) { in detectDeviceLibrary() local
428 LibDevicePath = Candidate.Path; in detectDeviceLibrary()
437 SmallVector<Candidate, 4> HIPSearchDirs; in detectHIPRuntime()
444 for (const auto &Candidate : HIPSearchDirs) { in detectHIPRuntime() local
445 InstallPath = Candidate.Path; in detectHIPRuntime()
450 auto SPACKPath = findSPACKPackage(Candidate, "hip"); in detectHIPRuntime()
[all …]
/openbsd/gnu/llvm/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 …]
/openbsd/gnu/llvm/clang/lib/Sema/
H A DSemaOverload.cpp6485 Candidate.Viable = true; in AddOverloadCandidate()
6486 Candidate.RewriteKind = in AddOverloadCandidate()
6497 Candidate.Viable = false; in AddOverloadCandidate()
7065 Candidate.RewriteKind = in AddMethodCandidate()
7097 Candidate.Viable = true; in AddMethodCandidate()
7235 Candidate.RewriteKind = in AddMethodTemplateCandidate()
7317 Candidate.RewriteKind = in AddTemplateOverloadCandidate()
7501 Candidate.Viable = true; in AddConversionCandidate()
7731 Candidate.Viable = true; in AddSurrogateCandidate()
7943 Candidate.Viable = true; in AddBuiltinCandidate()
[all …]
/openbsd/gnu/llvm/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()
/openbsd/gnu/llvm/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()
/openbsd/gnu/llvm/llvm/lib/Target/Hexagon/
H A DHexagonMachineScheduler.cpp46 SchedCandidate &Candidate, in SchedulingCost() argument
50 ConvergingVLIWScheduler::SchedulingCost(Q, SU, Candidate, Delta, verbose); in SchedulingCost()
/openbsd/gnu/llvm/clang/lib/AST/
H A DExternalASTMerger.cpp34 typedef std::pair<Source<NamedDecl *>, ASTImporter *> Candidate; typedef
247 bool HasDeclOfSameType(llvm::ArrayRef<Candidate> Decls, const Candidate &C) { in HasDeclOfSameType()
250 return llvm::any_of(Decls, [&](const Candidate &D) { in HasDeclOfSameType()
480 llvm::SmallVector<Candidate, 4> Candidates; in FindExternalVisibleDeclsByName()
482 auto FilterFoundDecl = [&Candidates](const Candidate &C) { in FindExternalVisibleDeclsByName()
507 for (const Candidate &C : Candidates) { in FindExternalVisibleDeclsByName()
/openbsd/gnu/llvm/llvm/lib/Demangle/
H A DMicrosoftDemangle.cpp149 StringView Candidate = S.substr(0, End); in startsWithLocalScopePattern() local
150 if (Candidate.empty()) in startsWithLocalScopePattern()
155 if (Candidate.size() == 1) in startsWithLocalScopePattern()
156 return Candidate[0] == '@' || (Candidate[0] >= '0' && Candidate[0] <= '9'); in startsWithLocalScopePattern()
159 if (Candidate.back() != '@') in startsWithLocalScopePattern()
161 Candidate = Candidate.dropBack(); in startsWithLocalScopePattern()
169 if (Candidate[0] < 'B' || Candidate[0] > 'P') in startsWithLocalScopePattern()
171 Candidate = Candidate.dropFront(); in startsWithLocalScopePattern()
172 while (!Candidate.empty()) { in startsWithLocalScopePattern()
173 if (Candidate[0] < 'A' || Candidate[0] > 'P') in startsWithLocalScopePattern()
[all …]

1234