Home
last modified time | relevance | path

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

1234

/freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DStraightLineStrengthReduce.cpp134 struct Candidate { struct in __anon1b45effc0111::StraightLineStrengthReduce
142 Candidate() = default;
176 Candidate *Basis = nullptr; argument
184 bool isBasisFor(const Candidate &Basis, const Candidate &C);
229 void rewriteCandidateWithBasis(const Candidate &C, const Candidate &Basis);
241 static Value *emitBump(const Candidate &Basis, const Candidate &C,
350 Candidate C(CT, B, Idx, S, I); in allocateCandidatesAndFindBasis()
634 const Candidate &C, const Candidate &Basis) { in rewriteCandidateWithBasis()
653 case Candidate::Add: in rewriteCandidateWithBasis()
654 case Candidate::Mul: { in rewriteCandidateWithBasis()
[all …]
H A DNaryReassociate.cpp414 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()
/freebsd-13.1/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()
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 …]
/freebsd-13.1/contrib/llvm-project/llvm/lib/Target/Hexagon/
H A DHexagonMachineScheduler.cpp786 if (!Candidate.SU) { in pickNodeFromQueue()
788 Candidate.SU = *I; in pickNodeFromQueue()
789 Candidate.RPDelta = RPDelta; in pickNodeFromQueue()
790 Candidate.SCost = CurrentCost; in pickNodeFromQueue()
801 Candidate.SU = *I; in pickNodeFromQueue()
802 Candidate.RPDelta = RPDelta; in pickNodeFromQueue()
812 Candidate.SU = *I; in pickNodeFromQueue()
813 Candidate.RPDelta = RPDelta; in pickNodeFromQueue()
825 Candidate.SU = *I; in pickNodeFromQueue()
844 Candidate.SU = *I; in pickNodeFromQueue()
[all …]
H A DHexagonMachineScheduler.h258 SUnit *SU, SchedCandidate &Candidate,
263 SchedCandidate &Candidate);
269 SchedCandidate &Candidate, ReadyQueue &Q);
/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DMachineOutliner.h38 struct Candidate { struct
121 Candidate(unsigned StartIdx, unsigned Len, in Candidate() argument
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()
/freebsd-13.1/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DGCNMinRegStrategy.cpp24 struct Candidate : ilist_node<Candidate> { struct in __anon7ba951140111::GCNMinRegScheduler
28 Candidate(const SUnit *SU_, int Priority_ = 0) in Candidate() argument
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 __anon673d9d6b0111::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()
/freebsd-13.1/contrib/llvm-project/llvm/lib/Target/SystemZ/
H A DSystemZMachineScheduler.cpp176 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 DSystemZMachineScheduler.h41 struct Candidate { struct
50 Candidate() = default; argument
51 Candidate(SUnit *SU_, SystemZHazardRecognizer &HazardRec);
54 bool operator<(const Candidate &other);
/freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DSampleProfile.cpp393 tryInlineCandidate(InlineCandidate &Candidate,
863 auto &CI = *Candidate.CallInstr; in tryPromoteAndInlineCandidate()
886 Sum -= Candidate.CallsiteCount; in tryPromoteAndInlineCandidate()
899 Candidate.CallInstr = DI; in tryPromoteAndInlineCandidate()
1068 InlineCandidate Candidate = { in inlineHotFunctions() local
1096 if (tryInlineCandidate(Candidate)) { in inlineHotFunctions()
1163 CallBase &CB = *Candidate.CallInstr; in tryInlineCandidate()
1208 if (Candidate.CallsiteDistribution < 1) { in tryInlineCandidate()
1344 InlineCandidate Candidate = CQueue.top(); in inlineHotFunctionsWithPriority() local
1346 CallBase *I = Candidate.CallInstr; in inlineHotFunctionsWithPriority()
[all …]
H A DIROutliner.cpp132 Instruction *StartInst = (*Candidate->begin()).Inst; in splitCandidate()
133 Instruction *EndInst = (*Candidate->end()).Inst; in splitCandidate()
298 IRSimilarityCandidate &C = *Region.Candidate; in collectRegionsConstants()
582 IRSimilarityCandidate &C = *Region.Candidate; in getCodeExtractorArguments()
653 IRSimilarityCandidate &C = *Region.Candidate; in findExtractedInputToOverallInputMapping()
723 IRSimilarityCandidate &C = *Region.Candidate; in findExtractedOutputToOverallOutputMapping()
1422 IRSimilarityCandidate &Candidate = *CurrentGroup.Regions[0]->Candidate; in findCostForOutputBlocks() local
1424 Optional<Value *> OV = Candidate.fromGVN(GVN); in findCostForOutputBlocks()
1590 IDL->insert(Region.Candidate->end(), *Region.NewBack); in extractSection()
1592 IDL->erase(Region.Candidate->begin(), std::prev(Region.Candidate->end())); in extractSection()
[all …]
/freebsd-13.1/contrib/llvm-project/llvm/lib/CodeGen/
H A DMIRVRegNamerUtils.cpp148 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 DMachineOutliner.cpp367 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()
/freebsd-13.1/contrib/llvm-project/clang/lib/Driver/ToolChains/
H A DROCm.h42 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 DAMDGPU.cpp39 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()
382 for (const auto &Candidate : ROCmDirs) { in detectDeviceLibrary() local
383 auto CandidatePath = Candidate.Path; in detectDeviceLibrary()
435 SmallVector<Candidate, 4> HIPSearchDirs; in detectHIPRuntime()
442 for (const auto &Candidate : HIPSearchDirs) { in detectHIPRuntime() local
443 InstallPath = Candidate.Path; in detectHIPRuntime()
448 auto SPACKPath = findSPACKPackage(Candidate, "hip"); in detectHIPRuntime()
[all …]
/freebsd-13.1/contrib/bmake/
H A Dsuff.c207 typedef struct Candidate { struct
222 struct Candidate *parent; argument
234 } Candidate; typedef
999 static Candidate *
1078 Candidate *src = ln->datum; in RemoveCandidate()
1118 static Candidate *
1175 static Candidate *
1715 Candidate *targ; in FindDepsRegularKnown()
1738 Candidate *targ; in FindDepsRegularUnknown()
1831 Candidate *src; in FindDepsRegular()
[all …]
/freebsd-13.1/contrib/llvm-project/llvm/lib/Target/Mips/
H A DMipsDelaySlotFiller.cpp255 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 …]
/freebsd-13.1/contrib/llvm-project/clang/lib/Sema/
H A DSemaOverload.cpp6324 Candidate.Viable = true; in AddOverloadCandidate()
6325 Candidate.RewriteKind = in AddOverloadCandidate()
6336 Candidate.Viable = false; in AddOverloadCandidate()
6878 Candidate.RewriteKind = in AddMethodCandidate()
6909 Candidate.Viable = true; in AddMethodCandidate()
7033 Candidate.RewriteKind = in AddMethodTemplateCandidate()
7115 Candidate.RewriteKind = in AddTemplateOverloadCandidate()
7299 Candidate.Viable = true; in AddConversionCandidate()
7526 Candidate.Viable = true; in AddSurrogateCandidate()
7733 Candidate.Viable = true; in AddBuiltinCandidate()
[all …]
H A DScope.cpp122 if (VarDecl *Candidate = NRVO.getPointer()) { in mergeNRVOIntoParent() local
123 if (isDeclScope(Candidate)) in mergeNRVOIntoParent()
124 Candidate->setNRVOVariable(true); in mergeNRVOIntoParent()
/freebsd-13.1/contrib/llvm-project/clang/utils/TableGen/
H A DClangOpenCLBuiltinEmitter.cpp133 BuiltinIndexListTy *Candidate,
609 BuiltinIndexListTy *Candidate, in CanReuseSignature() argument
611 assert(Candidate->size() == SignatureList.size() && in CanReuseSignature()
615 SignatureListMap.find(Candidate)->second.Signatures; in CanReuseSignature()
616 for (unsigned Index = 0; Index < Candidate->size(); Index++) { in CanReuseSignature()
651 for (auto *Candidate : KnownSignatures) { in GroupBySignature() local
652 if (Candidate->size() == CurSignatureList->size() && in GroupBySignature()
653 *Candidate == *CurSignatureList) { in GroupBySignature()
654 if (CanReuseSignature(Candidate, Fct.second)) { in GroupBySignature()
655 SignatureListMap.find(Candidate)->second.Names.push_back(Fct.first); in GroupBySignature()
/freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DVPlanSLP.cpp256 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()
/freebsd-13.1/contrib/llvm-project/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()
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()
/freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/AggressiveInstCombine/
H A DAggressiveInstCombine.cpp239 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()
/freebsd-13.1/contrib/llvm-project/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