| /netbsd-src/external/apache2/llvm/dist/llvm/tools/llvm-profgen/ |
| H A D | CSPreInliner.cpp | 101 bool CSPreInliner::shouldInline(ProfiledInlineCandidate &Candidate) { in shouldInline() argument
105 return Candidate.CalleeSamples->getContext().hasAttribute( in shouldInline()
111 if (Candidate.CallsiteCount > HotCountThreshold) in shouldInline()
116 if (Candidate.CallsiteCount < ColdCountThreshold) in shouldInline()
119 return (Candidate.SizeCost < SampleThreshold); in shouldInline()
142 ProfiledInlineCandidate Candidate = CQueue.top(); in processFunction() local
145 if ((ShouldInline = shouldInline(Candidate))) { in processFunction()
148 ContextTracker.markContextSamplesInlined(Candidate.CalleeSamples); in processFunction()
149 Candidate.CalleeSamples->getContext().setAttribute( in processFunction()
151 FuncFinalSize += Candidate.SizeCost; in processFunction()
[all …]
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/ |
| H A D | StraightLineStrengthReduce.cpp | 134 struct Candidate { struct in __anon8c5187130111::StraightLineStrengthReduce
142 Candidate() = default;
143 Candidate(Kind CT, const SCEV *B, ConstantInt *Idx, Value *S, in Candidate() function
176 Candidate *Basis = nullptr; argument
184 bool isBasisFor(const Candidate &Basis, const Candidate &C);
187 bool isFoldable(const Candidate &C, TargetTransformInfo *TTI,
192 bool isSimplestForm(const Candidate &C);
224 void allocateCandidatesAndFindBasis(Candidate::Kind CT, const SCEV *B,
229 void rewriteCandidateWithBasis(const Candidate &C, const Candidate &Basis);
241 static Value *emitBump(const Candidate &Basis, const Candidate &C,
[all …]
|
| H A D | NaryReassociate.cpp | 414 Value *Candidate = findClosestMatchingDominator(CandidateExpr, GEP); in tryReassociateGEPAtIndex() local
415 if (Candidate == nullptr) in tryReassociateGEPAtIndex()
422 Candidate = Builder.CreateBitOrPointerCast(Candidate, GEP->getType()); in tryReassociateGEPAtIndex()
423 assert(Candidate->getType() == GEP->getType()); in tryReassociateGEPAtIndex()
455 Builder.CreateGEP(GEP->getResultElementType(), Candidate, RHS)); in tryReassociateGEPAtIndex()
564 if (Value *Candidate = Candidates.back()) { in findClosestMatchingDominator() local
565 Instruction *CandidateInstruction = cast<Instruction>(Candidate); in findClosestMatchingDominator()
|
| /netbsd-src/external/apache2/llvm/dist/clang/lib/Analysis/ |
| H A D | ThreadSafetyTIL.cpp | 209 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 …]
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/ |
| H A D | HexagonMachineScheduler.cpp | 498 const RegPressureTracker &RPTracker, SchedCandidate &Candidate, in readyQueueVerboseDump() argument
511 SchedulingCost(Q, *I, Candidate, RPDelta, true); in readyQueueVerboseDump()
577 SchedCandidate &Candidate, in SchedulingCost() argument
766 SchedCandidate &Candidate) { in pickNodeFromQueue() argument
769 readyQueueVerboseDump(RPTracker, Candidate, Q); in pickNodeFromQueue()
783 int CurrentCost = SchedulingCost(Q, *I, Candidate, RPDelta, false); in pickNodeFromQueue()
786 if (!Candidate.SU) { in pickNodeFromQueue()
788 Candidate.SU = *I; in pickNodeFromQueue()
789 Candidate.RPDelta = RPDelta; in pickNodeFromQueue()
790 Candidate.SCost = CurrentCost; in pickNodeFromQueue()
[all …]
|
| H A D | HexagonMachineScheduler.h | 258 SUnit *SU, SchedCandidate &Candidate,
263 SchedCandidate &Candidate);
269 SchedCandidate &Candidate, ReadyQueue &Q);
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/ |
| H A D | GCNMinRegStrategy.cpp | 24 struct Candidate : ilist_node<Candidate> { struct in __anon800396cb0111::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 D | GCNILPSched.cpp | 22 struct Candidate : ilist_node<Candidate> { struct in __anon5fdfa5e20111::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()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/ |
| H A D | MachineOutliner.h | 38 struct Candidate { struct
121 Candidate(unsigned StartIdx, unsigned Len, in Candidate() function
127 Candidate() {} in Candidate() function
131 bool operator<(const Candidate &RHS) const {
167 std::vector<Candidate> Candidates;
190 for (const Candidate &C : Candidates) in getOutliningCost()
212 OutlinedFunction(std::vector<Candidate> &Candidates, unsigned SequenceSize, in OutlinedFunction()
217 for (Candidate &C : Candidates) in OutlinedFunction()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/IPO/ |
| H A D | SampleProfile.cpp | 380 Function &F, InlineCandidate &Candidate, uint64_t SumOrigin,
384 InlineCost shouldInlineCandidate(InlineCandidate &Candidate);
387 tryInlineCandidate(InlineCandidate &Candidate,
738 static bool doesHistoryAllowICP(const Instruction &Inst, StringRef Candidate) { in doesHistoryAllowICP() argument
759 if (ValueData[I].Value == Function::getGUID(Candidate)) in doesHistoryAllowICP()
859 Function &F, InlineCandidate &Candidate, uint64_t SumOrigin, uint64_t &Sum, in tryPromoteAndInlineCandidate() argument
861 auto CalleeFunctionName = Candidate.CalleeSamples->getFuncName(); in tryPromoteAndInlineCandidate()
866 auto &CI = *Candidate.CallInstr; in tryPromoteAndInlineCandidate()
887 CI, R->getValue(), Candidate.CallsiteCount, Sum, false, ORE); in tryPromoteAndInlineCandidate()
889 Sum -= Candidate.CallsiteCount; in tryPromoteAndInlineCandidate()
[all …]
|
| H A D | IROutliner.cpp | 129 Instruction *StartInst = (*Candidate->begin()).Inst; in splitCandidate()
130 Instruction *EndInst = (*Candidate->end()).Inst; in splitCandidate()
295 IRSimilarityCandidate &C = *Region.Candidate; in collectRegionsConstants()
502 IRSimilarityCandidate &C = *Region.Candidate; in getCodeExtractorArguments()
573 IRSimilarityCandidate &C = *Region.Candidate; in findExtractedInputToOverallInputMapping()
643 IRSimilarityCandidate &C = *Region.Candidate; in findExtractedOutputToOverallOutputMapping()
1026 Optional<unsigned> GVN = Region.Candidate->getGVN(V); in alignOutputBlockWithAggFunc()
1310 Optional<Value *> OV = Region->Candidate->fromGVN(OutputGVN); in findCostOutputReloads()
1342 IRSimilarityCandidate &Candidate = *CurrentGroup.Regions[0]->Candidate; in findCostForOutputBlocks() local
1344 Optional<Value *> OV = Candidate.fromGVN(GVN); in findCostForOutputBlocks()
[all …]
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/SystemZ/ |
| H A D | SystemZMachineScheduler.cpp | 176 Candidate Best; in pickNode()
180 Candidate c(SU, *HazardRec); in pickNode()
201 SystemZPostRASchedStrategy::Candidate::
202 Candidate(SUnit *SU_, SystemZHazardRecognizer &HazardRec) : Candidate() { in Candidate() function in SystemZPostRASchedStrategy::Candidate
214 bool SystemZPostRASchedStrategy::Candidate::
215 operator<(const Candidate &other) { in operator <()
245 Candidate c(SU, *HazardRec); c.dumpCosts(); dbgs() << "\n";); in schedNode()
|
| H A D | SystemZMachineScheduler.h | 41 struct Candidate { struct
50 Candidate() = default; argument
51 Candidate(SUnit *SU_, SystemZHazardRecognizer &HazardRec);
54 bool operator<(const Candidate &other);
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/CodeGen/ |
| H A D | MIRVRegNamerUtils.cpp | 148 for (MachineInstr &Candidate : *MBB) { in renameInstsInMBB()
150 if (Candidate.mayStore() || Candidate.isBranch()) in renameInstsInMBB()
152 if (!Candidate.getNumOperands()) in renameInstsInMBB()
155 MachineOperand &MO = Candidate.getOperand(0); in renameInstsInMBB()
160 NamedVReg(MO.getReg(), Prefix + getInstructionOpcodeHash(Candidate))); in renameInstsInMBB()
|
| H A D | MachineOutliner.cpp | 367 unsigned StringLen, std::vector<Candidate> &CandidatesForRepeatedSeq,
413 for (const Candidate &C : OF.Candidates) in getSubprogramOrNull()
455 unsigned StringLen, std::vector<Candidate> &CandidatesForRepeatedSeq, in emitNotOutliningCheaperRemark()
461 Candidate &C = CandidatesForRepeatedSeq.front(); in emitNotOutliningCheaperRemark()
520 std::vector<Candidate> CandidatesForRepeatedSeq; in findCandidates()
548 &EndIdx](const Candidate &C) { in findCandidates()
624 Candidate &FirstCand = OF.Candidates.front(); in createOutlinedFunction()
630 if (llvm::all_of(OF.Candidates, [](const outliner::Candidate &C) { in createOutlinedFunction()
750 erase_if(OF.Candidates, [&Mapper](Candidate &C) { in outline()
772 for (Candidate &C : OF.Candidates) { in outline()
|
| /netbsd-src/usr.bin/make/ |
| H A D | suff.c | 197 typedef struct Candidate { struct
212 struct Candidate *parent; argument
224 } Candidate; typedef
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 *tar
222 childrenListCandidate global() argument
[all...] |
| /netbsd-src/external/apache2/llvm/dist/clang/utils/TableGen/ |
| H A D | ClangOpenCLBuiltinEmitter.cpp | 129 BuiltinIndexListTy *Candidate,
547 BuiltinIndexListTy *Candidate, in CanReuseSignature() argument
549 assert(Candidate->size() == SignatureList.size() && in CanReuseSignature()
553 SignatureListMap.find(Candidate)->second.Signatures; in CanReuseSignature()
554 for (unsigned Index = 0; Index < Candidate->size(); Index++) { in CanReuseSignature()
589 for (auto *Candidate : KnownSignatures) { in GroupBySignature() local
590 if (Candidate->size() == CurSignatureList->size() && in GroupBySignature()
591 *Candidate == *CurSignatureList) { in GroupBySignature()
592 if (CanReuseSignature(Candidate, Fct.second)) { in GroupBySignature()
593 SignatureListMap.find(Candidate)->second.Names.push_back(Fct.first); in GroupBySignature()
|
| /netbsd-src/external/apache2/llvm/dist/clang/lib/Driver/ToolChains/ |
| H A D | ROCm.h | 42 struct Candidate { struct
51 Candidate(std::string Path, bool StrictChecking = false, argument
111 SmallVector<Candidate, 4> ROCmSearchDirs;
124 const SmallVectorImpl<Candidate> &getInstallationPathCandidates();
130 llvm::SmallString<0> findSPACKPackage(const Candidate &Cand,
|
| H A D | AMDGPU.cpp | 39 RocmInstallationDetector::findSPACKPackage(const Candidate &Cand, in findSPACKPackage()
170 const SmallVectorImpl<RocmInstallationDetector::Candidate> &
229 return Candidate(ParentDir.str(), /*StrictChecking=*/true, in getInstallationPathCandidates()
239 return Candidate(ParentDir.str(), /*StrictChecking=*/true); in getInstallationPathCandidates()
375 for (const auto &Candidate : ROCmDirs) { in detectDeviceLibrary() local
376 auto CandidatePath = Candidate.Path; in detectDeviceLibrary()
380 bool CheckLibDevice = (!NoBuiltinLibs || Candidate.StrictChecking); in detectDeviceLibrary()
414 auto SPACKPath = findSPACKPackage(Candidate, "rocm-device-libs"); in detectDeviceLibrary()
431 SmallVector<Candidate, 4> HIPSearchDirs; in detectHIPRuntime()
438 for (const auto &Candidate : HIPSearchDirs) { in detectHIPRuntime() local
[all …]
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/Mips/ |
| H A D | MipsDelaySlotFiller.cpp | 255 bool delayHasHazard(const MachineInstr &Candidate, RegDefsUses &RegDU,
293 bool terminateSearch(const MachineInstr &Candidate) const;
947 bool MipsDelaySlotFiller::delayHasHazard(const MachineInstr &Candidate, in delayHasHazard() argument
950 assert(!Candidate.isKill() && in delayHasHazard()
953 bool HasHazard = Candidate.isImplicitDef(); in delayHasHazard()
955 HasHazard |= IM.hasHazard(Candidate); in delayHasHazard()
956 HasHazard |= RegDU.update(Candidate, 0, Candidate.getNumOperands()); in delayHasHazard()
961 bool MipsDelaySlotFiller::terminateSearch(const MachineInstr &Candidate) const { in terminateSearch()
962 return (Candidate.isTerminator() || Candidate.isCall() || in terminateSearch()
963 Candidate.isPosition() || Candidate.isInlineAsm() || in terminateSearch()
[all …]
|
| /netbsd-src/external/apache2/llvm/dist/clang/lib/Sema/ |
| H A D | SemaOverload.cpp | 6324 OverloadCandidate &Candidate = in AddOverloadCandidate() local
6326 Candidate.FoundDecl = FoundDecl; in AddOverloadCandidate()
6327 Candidate.Function = Function; in AddOverloadCandidate()
6328 Candidate.Viable = true; in AddOverloadCandidate()
6329 Candidate.RewriteKind = in AddOverloadCandidate()
6331 Candidate.IsSurrogate = false; in AddOverloadCandidate()
6332 Candidate.IsADLCandidate = IsADLCandidate; in AddOverloadCandidate()
6333 Candidate.IgnoreObjectArgument = false; in AddOverloadCandidate()
6334 Candidate.ExplicitCallArguments = Args.size(); in AddOverloadCandidate()
6340 Candidate.Viable = false; in AddOverloadCandidate()
[all …]
|
| H A D | Scope.cpp | 122 if (VarDecl *Candidate = NRVO.getPointer()) { in mergeNRVOIntoParent() local
123 if (isDeclScope(Candidate)) in mergeNRVOIntoParent()
124 Candidate->setNRVOVariable(true); in mergeNRVOIntoParent()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/Vectorize/ |
| H A D | VPlanSLP.cpp | 256 for (auto *Candidate : Candidates) { in getBest() local
258 auto *CandidateI = cast<VPInstruction>(Candidate); in getBest()
260 LLVM_DEBUG(dbgs() << *cast<VPInstruction>(Candidate)->getUnderlyingInstr() in getBest()
262 BestCandidates.push_back(Candidate); in getBest()
280 for (auto *Candidate : BestCandidates) { in getBest() local
281 unsigned Score = getLAScore(Last, Candidate, Depth, IAI); in getBest()
290 Best = Candidate; in getBest()
|
| /netbsd-src/external/apache2/llvm/dist/clang/lib/AST/ |
| H A D | ExternalASTMerger.cpp | 34 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()
482 llvm::SmallVector<Candidate, 4> Candidates; in FindExternalVisibleDeclsByName()
484 auto FilterFoundDecl = [&Candidates](const Candidate &C) { in FindExternalVisibleDeclsByName()
509 for (const Candidate &C : Candidates) { in FindExternalVisibleDeclsByName()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/AggressiveInstCombine/ |
| H A D | AggressiveInstCombine.cpp | 239 Value *Candidate; in matchAndOrChain() local
241 if (!match(V, m_LShr(m_Value(Candidate), m_APInt(BitIndex)))) in matchAndOrChain()
242 Candidate = V; in matchAndOrChain()
246 MOps.Root = Candidate; in matchAndOrChain()
254 return MOps.Root == Candidate; in matchAndOrChain()
|