Home
last modified time | relevance | path

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

123

/freebsd-12.1/contrib/llvm/lib/Transforms/Scalar/
H A DStraightLineStrengthReduce.cpp102 struct Candidate { struct in __anon627523ed0111::StraightLineStrengthReduce
110 Candidate() = default;
144 Candidate *Basis = nullptr; argument
171 bool isBasisFor(const Candidate &Basis, const Candidate &C);
216 void rewriteCandidateWithBasis(const Candidate &C, const Candidate &Basis);
228 static Value *emitBump(const Candidate &Basis, const Candidate &C,
339 Candidate C(CT, B, Idx, S, I); in allocateCandidatesAndFindBasis()
623 const Candidate &C, const Candidate &Basis) { in rewriteCandidateWithBasis()
642 case Candidate::Add: in rewriteCandidateWithBasis()
643 case Candidate::Mul: { in rewriteCandidateWithBasis()
[all …]
H A DNaryReassociate.cpp390 Value *Candidate = findClosestMatchingDominator(CandidateExpr, GEP); in tryReassociateGEPAtIndex() local
391 if (Candidate == nullptr) in tryReassociateGEPAtIndex()
398 Candidate = Builder.CreateBitOrPointerCast(Candidate, GEP->getType()); in tryReassociateGEPAtIndex()
399 assert(Candidate->getType() == GEP->getType()); in tryReassociateGEPAtIndex()
431 cast<GetElementPtrInst>(Builder.CreateGEP(Candidate, RHS)); in tryReassociateGEPAtIndex()
540 if (Value *Candidate = Candidates.back()) { in findClosestMatchingDominator() local
541 Instruction *CandidateInstruction = cast<Instruction>(Candidate); in findClosestMatchingDominator()
H A DSink.cpp171 BasicBlock *Candidate = (*I)->getBlock(); in SinkInstruction() local
174 if (IsAcceptableTarget(Inst, Candidate, DT, LI)) in SinkInstruction()
175 SuccToSinkTo = Candidate; in SinkInstruction()
/freebsd-12.1/contrib/llvm/tools/clang/lib/Analysis/
H A DThreadSafetyTIL.cpp210 BasicBlock *Candidate = nullptr; in computeDominator() local
216 if (Candidate == nullptr) { in computeDominator()
217 Candidate = Pred; in computeDominator()
222 while (Alternate != Candidate) { in computeDominator()
224 Candidate = Candidate->DominatorNode.Parent; in computeDominator()
229 DominatorNode.Parent = Candidate; in computeDominator()
237 BasicBlock *Candidate = nullptr; in computePostDominator() local
243 if (Candidate == nullptr) { in computePostDominator()
244 Candidate = Succ; in computePostDominator()
249 while (Alternate != Candidate) { in computePostDominator()
[all …]
/freebsd-12.1/contrib/llvm/lib/Target/Hexagon/
H A DHexagonMachineScheduler.cpp785 if (!Candidate.SU) { in pickNodeFromQueue()
787 Candidate.SU = *I; in pickNodeFromQueue()
788 Candidate.RPDelta = RPDelta; in pickNodeFromQueue()
789 Candidate.SCost = CurrentCost; in pickNodeFromQueue()
800 Candidate.SU = *I; in pickNodeFromQueue()
801 Candidate.RPDelta = RPDelta; in pickNodeFromQueue()
811 Candidate.SU = *I; in pickNodeFromQueue()
812 Candidate.RPDelta = RPDelta; in pickNodeFromQueue()
824 Candidate.SU = *I; in pickNodeFromQueue()
843 Candidate.SU = *I; in pickNodeFromQueue()
[all …]
H A DHexagonMachineScheduler.h259 SUnit *SU, SchedCandidate &Candidate,
264 SchedCandidate &Candidate);
270 SchedCandidate &Candidate, ReadyQueue &Q);
/freebsd-12.1/contrib/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-12.1/contrib/llvm/lib/Target/AMDGPU/
H A DGCNMinRegStrategy.cpp31 struct Candidate : ilist_node<Candidate> { struct in __anon091349650111::GCNMinRegScheduler
35 Candidate(const SUnit *SU_, int Priority_ = 0) in Candidate() function
39 SpecificBumpPtrAllocator<Candidate> Alloc;
40 using Queue = simple_ilist<Candidate>;
75 Candidate* pickCandidate();
140 GCNMinRegScheduler::Candidate* GCNMinRegScheduler::pickCandidate() { in pickCandidate()
147 Num = findMax(Num, [=](const Candidate &C) { return C.Priority; }); in pickCandidate()
152 Num = findMax(Num, [=](const Candidate &C) { in pickCandidate()
163 Num = findMax(Num, [=](const Candidate &C) { in pickCandidate()
228 RQ.push_front(*new (Alloc.Allocate()) Candidate(SuccSU, Priority)); in releaseSuccessors()
[all …]
H A DGCNILPSched.cpp23 struct Candidate : ilist_node<Candidate> { struct in __anon07abecfc0111::GCNILPScheduler
26 Candidate(SUnit *SU_) in Candidate() argument
30 SpecificBumpPtrAllocator<Candidate> Alloc;
31 typedef simple_ilist<Candidate> Queue;
44 Candidate* pickCandidate();
241 GCNILPScheduler::Candidate* GCNILPScheduler::pickCandidate() { in pickCandidate()
286 PendingQueue.push_front(*new (Alloc.Allocate()) Candidate(PredSU)); in releasePredecessors()
309 *new (Alloc.Allocate()) Candidate(const_cast<SUnit*>(SU))); in schedule()
319 [=](const Candidate& C1, const Candidate& C2) { in schedule()
/freebsd-12.1/contrib/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.h42 struct Candidate { struct
51 Candidate() = default; argument
52 Candidate(SUnit *SU_, SystemZHazardRecognizer &HazardRec);
55 bool operator<(const Candidate &other);
/freebsd-12.1/contrib/llvm/lib/Target/Mips/
H A DMipsDelaySlotFiller.cpp258 bool delayHasHazard(const MachineInstr &Candidate, RegDefsUses &RegDU,
296 bool terminateSearch(const MachineInstr &Candidate) const;
912 bool MipsDelaySlotFiller::delayHasHazard(const MachineInstr &Candidate, in delayHasHazard() argument
915 assert(!Candidate.isKill() && in delayHasHazard()
918 bool HasHazard = Candidate.isImplicitDef(); in delayHasHazard()
920 HasHazard |= IM.hasHazard(Candidate); in delayHasHazard()
921 HasHazard |= RegDU.update(Candidate, 0, Candidate.getNumOperands()); in delayHasHazard()
926 bool MipsDelaySlotFiller::terminateSearch(const MachineInstr &Candidate) const { in terminateSearch()
927 return (Candidate.isTerminator() || Candidate.isCall() || in terminateSearch()
928 Candidate.isPosition() || Candidate.isInlineAsm() || in terminateSearch()
[all …]
/freebsd-12.1/contrib/llvm/tools/clang/lib/Sema/
H A DSemaOverload.cpp6053 Candidate.Viable = true; in AddOverloadCandidate()
6061 Candidate.Viable = false; in AddOverloadCandidate()
6110 Candidate.Viable = false; in AddOverloadCandidate()
6123 Candidate.Viable = false; in AddOverloadCandidate()
6174 Candidate.Viable = false; in AddOverloadCandidate()
6181 Candidate.Viable = false; in AddOverloadCandidate()
6597 Candidate.Viable = false; in AddMethodCandidate()
6615 Candidate.Viable = true; in AddMethodCandidate()
6967 Candidate.Viable = true; in AddConversionCandidate()
7166 Candidate.Viable = true; in AddSurrogateCandidate()
[all …]
H A DScope.cpp123 if (VarDecl *Candidate = NRVO.getPointer()) { in mergeNRVOIntoParent() local
124 if (isDeclScope(Candidate)) in mergeNRVOIntoParent()
125 Candidate->setNRVOVariable(true); in mergeNRVOIntoParent()
/freebsd-12.1/contrib/llvm/lib/Transforms/Vectorize/
H A DVPlanSLP.cpp252 for (auto *Candidate : Candidates) { in getBest() local
254 auto *CandidateI = cast<VPInstruction>(Candidate); in getBest()
256 LLVM_DEBUG(dbgs() << *cast<VPInstruction>(Candidate)->getUnderlyingInstr() in getBest()
258 BestCandidates.push_back(Candidate); in getBest()
276 for (auto *Candidate : BestCandidates) { in getBest() local
277 unsigned Score = getLAScore(Last, Candidate, Depth, IAI); in getBest()
286 Best = Candidate; in getBest()
/freebsd-12.1/contrib/llvm/tools/clang/lib/AST/
H A DExternalASTMerger.cpp35 typedef std::pair<Source<NamedDecl *>, ASTImporter *> Candidate; typedef
162 bool HasDeclOfSameType(llvm::ArrayRef<Candidate> Decls, const Candidate &C) { in HasDeclOfSameType()
165 return llvm::any_of(Decls, [&](const Candidate &D) { in HasDeclOfSameType()
381 llvm::SmallVector<Candidate, 4> Candidates; in FindExternalVisibleDeclsByName()
383 auto FilterFoundDecl = [&Candidates](const Candidate &C) { in FindExternalVisibleDeclsByName()
402 for (const Candidate &C : Candidates) { in FindExternalVisibleDeclsByName()
/freebsd-12.1/contrib/llvm/lib/Transforms/AggressiveInstCombine/
H A DAggressiveInstCombine.cpp197 Value *Candidate; in matchAndOrChain() local
199 if (!match(V, m_LShr(m_Value(Candidate), m_ConstantInt(BitIndex)))) in matchAndOrChain()
200 Candidate = V; in matchAndOrChain()
204 MOps.Root = Candidate; in matchAndOrChain()
212 return MOps.Root == Candidate; in matchAndOrChain()
/freebsd-12.1/contrib/llvm/lib/Demangle/
H A DMicrosoftDemangle.cpp145 StringView Candidate = S.substr(0, End); in startsWithLocalScopePattern() local
146 if (Candidate.empty()) in startsWithLocalScopePattern()
151 if (Candidate.size() == 1) in startsWithLocalScopePattern()
152 return Candidate[0] == '@' || (Candidate[0] >= '0' && Candidate[0] <= '9'); in startsWithLocalScopePattern()
155 if (Candidate.back() != '@') in startsWithLocalScopePattern()
157 Candidate = Candidate.dropBack(); in startsWithLocalScopePattern()
165 if (Candidate[0] < 'B' || Candidate[0] > 'P') in startsWithLocalScopePattern()
167 Candidate = Candidate.dropFront(); in startsWithLocalScopePattern()
168 while (!Candidate.empty()) { in startsWithLocalScopePattern()
169 if (Candidate[0] < 'A' || Candidate[0] > 'P') in startsWithLocalScopePattern()
[all …]
/freebsd-12.1/contrib/llvm/lib/CodeGen/
H A DMachineOutliner.cpp865 unsigned StringLen, std::vector<Candidate> &CandidatesForRepeatedSeq,
909 for (const Candidate &C : OF.Candidates) in getSubprogramOrNull()
951 unsigned StringLen, std::vector<Candidate> &CandidatesForRepeatedSeq, in emitNotOutliningCheaperRemark()
957 Candidate &C = CandidatesForRepeatedSeq.front(); in emitNotOutliningCheaperRemark()
1017 std::vector<Candidate> CandidatesForRepeatedSeq; in findCandidates()
1047 [&StartIdx, &EndIdx](const Candidate &C) { in findCandidates()
1129 Candidate &FirstCand = OF.Candidates.front(); in createOutlinedFunction()
1219 erase_if(OF.Candidates, [&Mapper](Candidate &C) { in outline()
1241 for (Candidate &C : OF.Candidates) { in outline()
/freebsd-12.1/contrib/llvm/tools/lld/COFF/
H A DSymbolTable.cpp73 DefinedRegular *Candidate = nullptr; in getSymbol() local
78 (Candidate && D->getValue() < Candidate->getValue())) in getSymbol()
81 Candidate = D; in getSymbol()
84 return Candidate; in getSymbol()
/freebsd-12.1/contrib/llvm/lib/Target/AArch64/
H A DAArch64InstrInfo.h236 std::vector<outliner::Candidate> &RepeatedSequenceLocs) const override;
246 const outliner::Candidate &C) const override;
273 unsigned findRegisterToSaveLRTo(const outliner::Candidate &C) const;
/freebsd-12.1/contrib/llvm/lib/Target/Hexagon/MCTargetDesc/
H A DHexagonMCInstrInfo.cpp842 DuplexCandidate Candidate) { in replaceDuplex() argument
843 assert(Candidate.packetIndexI < MCB.size()); in replaceDuplex()
844 assert(Candidate.packetIndexJ < MCB.size()); in replaceDuplex()
847 deriveDuplex(Context, Candidate.iClass, in replaceDuplex()
848 *MCB.getOperand(Candidate.packetIndexJ).getInst(), in replaceDuplex()
849 *MCB.getOperand(Candidate.packetIndexI).getInst()); in replaceDuplex()
851 MCB.getOperand(Candidate.packetIndexI).setInst(Duplex); in replaceDuplex()
852 MCB.erase(MCB.begin() + Candidate.packetIndexJ); in replaceDuplex()
/freebsd-12.1/contrib/serf/
H A DSTATUS11 Candidate changes:
/freebsd-12.1/contrib/llvm/tools/clang/lib/Driver/ToolChains/
H A DCuda.cpp71 struct Candidate { in CudaInstallationDetector() struct
75 Candidate(std::string Path, bool StrictChecking = false) in CudaInstallationDetector() function
78 SmallVector<Candidate, 4> Candidates; in CudaInstallationDetector()
125 for (const auto &Candidate : Candidates) { in CudaInstallationDetector() local
126 InstallPath = Candidate.Path; in CudaInstallationDetector()
137 bool CheckLibDevice = (!NoCudaLib || Candidate.StrictChecking); in CudaInstallationDetector()
/freebsd-12.1/contrib/llvm/lib/Target/ARM/
H A DARMLoadStoreOptimizer.cpp1090 Candidate->Instrs.push_back(MemOps[C].MI); in FormCandidates()
1091 Candidate->LatestMIIdx = Latest - SIndex; in FormCandidates()
1092 Candidate->EarliestMIIdx = Earliest - SIndex; in FormCandidates()
1093 Candidate->InsertPos = MemOps[Latest].Position; in FormCandidates()
1096 Candidate->CanMergeToLSMulti = CanMergeToLSMulti; in FormCandidates()
1097 Candidate->CanMergeToLSDouble = CanMergeToLSDouble; in FormCandidates()
1098 Candidates.push_back(Candidate); in FormCandidates()
1855 for (const MergeCandidate *Candidate : Candidates) { in LoadStoreMultipleOpti() local
1856 if (Candidate->CanMergeToLSMulti || Candidate->CanMergeToLSDouble) { in LoadStoreMultipleOpti()
1867 for (MachineInstr *MI : Candidate->Instrs) { in LoadStoreMultipleOpti()
[all …]

123