Home
last modified time | relevance | path

Searched refs:Candidates (Results 1 – 25 of 66) sorted by relevance

123

/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DLoopLoadElimination.cpp184 std::forward_list<StoreToLoadForwardingCandidate> Candidates; in findStoreToLoadDependences() local
189 return Candidates; in findStoreToLoadDependences()
231 Candidates.emplace_front(Load, Store); in findStoreToLoadDependences()
235 Candidates.remove_if([&](const StoreToLoadForwardingCandidate &C) { in findStoreToLoadDependences()
239 return Candidates; in findStoreToLoadDependences()
269 std::forward_list<StoreToLoadForwardingCandidate> &Candidates) { in removeDependencesFromMultipleStores() argument
276 for (const auto &Cand : Candidates) { in removeDependencesFromMultipleStores()
302 Candidates.remove_if([&](const StoreToLoadForwardingCandidate &Cand) { in removeDependencesFromMultipleStores()
336 const SmallVectorImpl<StoreToLoadForwardingCandidate> &Candidates) { in findPointersWrittenOnForwardingPath() argument
355 llvm::max_element(Candidates, in findPointersWrittenOnForwardingPath()
[all …]
H A DStraightLineStrengthReduce.cpp244 std::list<Candidate> Candidates; member in __anon0eec50480111::StraightLineStrengthReduce
364 for (auto Basis = Candidates.rbegin(); in allocateCandidatesAndFindBasis()
365 Basis != Candidates.rend() && NumIterations < MaxNumIterations; in allocateCandidatesAndFindBasis()
375 Candidates.push_back(C); in allocateCandidatesAndFindBasis()
690 while (!Candidates.empty()) { in runOnFunction()
691 const Candidate &C = Candidates.back(); in runOnFunction()
695 Candidates.pop_back(); in runOnFunction()
H A DGVNSink.cpp836 SmallVector<SinkingInstructionCandidate, 4> Candidates; in sinkBB() local
849 Candidates.emplace_back(*Cand); in sinkBB()
853 llvm::stable_sort(Candidates, std::greater<SinkingInstructionCandidate>()); in sinkBB()
855 : Candidates) dbgs() in sinkBB()
859 if (Candidates.empty() || Candidates.front().Cost <= 0) in sinkBB()
861 auto C = Candidates.front(); in sinkBB()
H A DReassociate.cpp2016 SmallVectorImpl<Instruction *> &Candidates) { in getNegatibleInsts() argument
2033 Candidates.push_back(I); in getNegatibleInsts()
2036 getNegatibleInsts(I->getOperand(0), Candidates); in getNegatibleInsts()
2037 getNegatibleInsts(I->getOperand(1), Candidates); in getNegatibleInsts()
2047 Candidates.push_back(I); in getNegatibleInsts()
2050 getNegatibleInsts(I->getOperand(0), Candidates); in getNegatibleInsts()
2051 getNegatibleInsts(I->getOperand(1), Candidates); in getNegatibleInsts()
2069 SmallVector<Instruction *, 4> Candidates; in canonicalizeNegFPConstantsForOp() local
2070 getNegatibleInsts(Op, Candidates); in canonicalizeNegFPConstantsForOp()
2071 if (Candidates.empty()) in canonicalizeNegFPConstantsForOp()
[all …]
H A DGVNHoist.cpp484 unsigned rauw(const SmallVecInsn &Candidates, Instruction *Repl,
491 unsigned removeAndReplace(const SmallVecInsn &Candidates, Instruction *Repl,
973 unsigned GVNHoist::rauw(const SmallVecInsn &Candidates, Instruction *Repl, in rauw() argument
976 for (Instruction *I : Candidates) { in rauw()
1013 unsigned GVNHoist::removeAndReplace(const SmallVecInsn &Candidates, in removeAndReplace() argument
1024 unsigned NR = rauw(Candidates, Repl, NewMemAcc); in removeAndReplace()
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DMachineOutliner.h207 /// Used to ensure that \p Candidates are outlined in an order that
208 /// preserves the start and end indices of other \p Candidates.
220 std::vector<Candidate> Candidates;
237 unsigned getOccurrenceCount() const { return Candidates.size(); }
243 for (const Candidate &C : Candidates) in getOutliningCost()
263 unsigned getNumInstrs() const { return Candidates[0].getLength(); } in OutlinedFunction()
265 OutlinedFunction(std::vector<Candidate> &Candidates, unsigned SequenceSize, in OutlinedFunction()
267 : Candidates(Candidates), SequenceSize(SequenceSize), in OutlinedFunction()
270 for (Candidate &C : Candidates)
[all...]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Instrumentation/
H A DValueProfilePlugins.inc30 std::vector<CandidateInfo> *Candidates;
36 : F(Fn), TLI(TLI), Candidates(nullptr) {}
39 Candidates = &Cs;
41 Candidates = nullptr;
51 Candidates->emplace_back(CandidateInfo{Length, InsertPt, AnnotatedInst});
68 Candidates->emplace_back(CandidateInfo{Length, InsertPt, AnnotatedInst});
82 void run(std::vector<CandidateInfo> &Candidates) {
88 Candidates.emplace_back(CandidateInfo{Callee, InsertPt, AnnotatedInst});
102 void run(std::vector<CandidateInfo> &Candidates) {
118 Candidates.emplace_back(CandidateInfo{I, InsertPt, AnnotatedInst});
H A DValueProfileCollector.cpp39 void get(InstrProfValueKind K, std::vector<CandidateInfo> &Candidates) {} in get() argument
51 void get(InstrProfValueKind K, std::vector<CandidateInfo> &Candidates) { in get() argument
53 Plugin.run(Candidates); in get()
54 Base::get(K, Candidates); in get()
H A DIndirectCallPromotion.cpp352 ArrayRef<PromotionCandidate> Candidates,
362 CallBase &CB, Instruction *VPtr, ArrayRef<PromotionCandidate> Candidates,
369 ArrayRef<PromotionCandidate> Candidates,
381 std::vector<PromotionCandidate> &Candidates);
508 std::vector<PromotionCandidate> &Candidates) { in computeVTableInfos() argument
547 for (size_t I = 0; I < Candidates.size(); I++) in computeVTableInfos()
548 CalleeIndexMap[Candidates[I].TargetFunction] = I; in computeVTableInfos()
584 auto &Candidate = Candidates[CalleeIndexIter->second]; in computeVTableInfos()
632 CallBase &CB, Instruction *VPtr, ArrayRef<PromotionCandidate> Candidates, in tryToPromoteWithFuncCmp() argument
637 for (const auto &C : Candidates) { in tryToPromoteWithFuncCmp()
[all …]
/freebsd/contrib/llvm-project/clang/include/clang/Sema/
H A DTemplateDeduction.h339 SmallVector<TemplateSpecCandidate, 16> Candidates; variable
365 iterator begin() { return Candidates.begin(); } in begin()
366 iterator end() { return Candidates.end(); } in end()
368 size_t size() const { return Candidates.size(); } in size()
369 bool empty() const { return Candidates.empty(); } in empty()
374 Candidates.emplace_back(); in addCandidate()
375 return Candidates.back(); in addCandidate()
H A DOverload.h1105 SmallVector<OverloadCandidate, 16> Candidates;
1187 iterator begin() { return Candidates.begin(); } in begin()
1188 iterator end() { return Candidates.end(); } in end()
1190 size_t size() const { return Candidates.size(); } in size()
1191 bool empty() const { return Candidates.empty(); } in empty()
1215 Candidates.push_back(OverloadCandidate());
1216 OverloadCandidate &C = Candidates.back();
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DInterleavedLoadCombinePass.cpp104 bool findPattern(std::list<VectorInfo> &Candidates,
1058 std::list<VectorInfo> &Candidates, std::list<VectorInfo> &InterleavedLoad, in findPattern() argument
1060 for (auto C0 = Candidates.begin(), E0 = Candidates.end(); C0 != E0; ++C0) { in findPattern()
1066 std::vector<std::list<VectorInfo>::iterator> Res(Factor, Candidates.end()); in findPattern()
1068 for (auto C = Candidates.begin(), E = Candidates.end(); C != E; C++) { in findPattern()
1084 if (Res[i] == Candidates.end()) in findPattern()
1093 if (Res[0] != Candidates.end()) { in findPattern()
1096 InterleavedLoad.splice(InterleavedLoad.end(), Candidates, Res[i]); in findPattern()
1263 std::list<VectorInfo> Candidates; in run() local
1272 Candidates.emplace_back(cast<FixedVectorType>(SVI->getType())); in run()
[all …]
H A DMachineOutliner.cpp483 for (const Candidate &C : OF.Candidates) in getSubprogramOrNull()
570 for (size_t i = 0, e = OF.Candidates.size(); i < e; i++) { in emitOutlinedFunctionRemark()
573 OF.Candidates[i].front().getDebugLoc()); in emitOutlinedFunctionRemark()
676 if (!OF || OF->Candidates.size() < 2) in findCandidates()
716 Candidate &FirstCand = OF.Candidates.front(); in createOutlinedFunction()
720 TII.mergeOutliningCandidateAttributes(*F, OF.Candidates); in createOutlinedFunction()
724 OF.Candidates.cbegin(), OF.Candidates.cend(), UWTableKind::None, in createOutlinedFunction()
775 for (auto &Cand : OF.Candidates) { in createOutlinedFunction()
851 auto NumCandidatesBefore = OF.Candidates.size(); in outline()
855 erase_if(OF.Candidates, [&UnsignedVecBegin](Candidate &C) { in outline()
[all …]
H A DMachineLICM.cpp228 SmallVectorImpl<CandidateInfo> &Candidates,
484 SmallVectorImpl<CandidateInfo> &Candidates, in ProcessMI() argument
570 Candidates.push_back(CandidateInfo(MI, Def, FI)); in ProcessMI()
586 SmallVector<CandidateInfo, 32> Candidates; in HoistRegionPostRA() local
611 ProcessMI(&MI, RUDefs, RUClobbers, StoredFIs, Candidates, CurLoop); in HoistRegionPostRA()
637 for (CandidateInfo &Candidate : Candidates) { in HoistRegionPostRA()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DCanonicalizeFreezeInLoops.cpp157 SmallSetVector<FrozenIndPHIInfo, 4> Candidates; in run() local
186 Candidates.insert(Info); in run()
193 if (Candidates.empty()) in run()
197 for (const auto &Info : Candidates) { in run()
220 for (const auto &Item : Candidates) { in run()
/freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DGCNNSAReassign.cpp255 SmallVector<Candidate, 32> Candidates; in runOnMachineFunction() local
262 Candidates.push_back(std::pair(&MI, true)); in runOnMachineFunction()
265 Candidates.push_back(std::pair(&MI, false)); in runOnMachineFunction()
273 for (auto &C : Candidates) { in runOnMachineFunction()
331 auto I = std::lower_bound(Candidates.begin(), &C, MinInd, in runOnMachineFunction()
335 for (auto E = Candidates.end(); Success && I != E && in runOnMachineFunction()
/freebsd/contrib/llvm-project/llvm/lib/Target/BPF/
H A DBPFAdjustOpt.cpp300 SmallVector<PassThroughInfo, 4> Candidates; in avoidSpeculation() local
337 Candidates.push_back(Info); in avoidSpeculation()
350 Candidates.push_back(Info); in avoidSpeculation()
354 if (!isCandidate || Candidates.empty()) in avoidSpeculation()
357 llvm::append_range(PassThroughs, Candidates); in avoidSpeculation()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DVPlanSLP.cpp239 SmallPtrSetImpl<VPValue *> &Candidates, in getBest() argument
248 for (auto *Candidate : Candidates) { in getBest()
291 Candidates.erase(Best); in getBest()
315 SmallPtrSet<VPValue *, 4> Candidates; in reorderMultiNodeOps() local
321 Candidates.insert(Ops.second[Lane]); in reorderMultiNodeOps()
332 getBest(Mode[Op], Last, Candidates, IAI); in reorderMultiNodeOps()
/freebsd/contrib/llvm-project/clang/lib/AST/
H A DExternalASTMerger.cpp477 llvm::SmallVector<Candidate, 4> Candidates; in FindExternalVisibleDeclsByName() local
479 auto FilterFoundDecl = [&Candidates](const Candidate &C) { in FindExternalVisibleDeclsByName()
480 if (!HasDeclOfSameType(Candidates, C)) in FindExternalVisibleDeclsByName()
481 Candidates.push_back(C); in FindExternalVisibleDeclsByName()
500 if (Candidates.empty()) in FindExternalVisibleDeclsByName()
503 Decls.reserve(Candidates.size()); in FindExternalVisibleDeclsByName()
504 for (const Candidate &C : Candidates) { in FindExternalVisibleDeclsByName()
/freebsd/contrib/llvm-project/llvm/utils/TableGen/Common/
H A DCodeGenTarget.cpp182 std::vector<CodeGenRegisterClass *> Candidates; in getSuperRegForSubReg() local
203 Candidates.push_back(SubClassWithSubReg); in getSuperRegForSubReg()
207 if (Candidates.empty()) in getSuperRegForSubReg()
211 llvm::stable_sort(Candidates, [&](const CodeGenRegisterClass *A, in getSuperRegForSubReg()
223 return Candidates[0]; in getSuperRegForSubReg()
/freebsd/contrib/llvm-project/llvm/lib/Target/Mips/
H A DMips16InstrInfo.cpp350 BitVector Candidates = in loadImmediate() local
357 Candidates.reset(MO.getReg()); in loadImmediate()
377 Available &= Candidates; in loadImmediate()
388 Reg = Candidates.find_first(); in loadImmediate()
389 Candidates.reset(Reg); in loadImmediate()
403 SpReg = Candidates.find_first(); in loadImmediate()
/freebsd/contrib/llvm-project/llvm/lib/Target/PowerPC/
H A DPPCPreEmitPeephole.cpp372 SmallVector<MachineInstr *, 8> Candidates( in removeAccPrimeUnprime() local
383 Candidates[Acc - PPC::ACC0] = &BBI; in removeAccPrimeUnprime()
391 if (!Candidates[Acc - PPC::ACC0]) in removeAccPrimeUnprime()
394 InstrsToErase.insert(Candidates[Acc - PPC::ACC0]); in removeAccPrimeUnprime()
404 Candidates[Reg - PPC::ACC0] = nullptr; in removeAccPrimeUnprime()
/freebsd/contrib/llvm-project/clang/lib/Driver/ToolChains/
H A DCuda.cpp146 SmallVector<Candidate, 4> Candidates; in CudaInstallationDetector() local
153 Candidates.emplace_back( in CudaInstallationDetector()
157 Candidates.emplace_back( in CudaInstallationDetector()
177 Candidates.emplace_back( in CudaInstallationDetector()
183 Candidates.emplace_back(D.SysRoot + "/usr/local/cuda"); in CudaInstallationDetector()
185 Candidates.emplace_back(D.SysRoot + "/usr/local/cuda-" + Ver); in CudaInstallationDetector()
191 Candidates.emplace_back(D.SysRoot + "/usr/lib/cuda"); in CudaInstallationDetector()
196 for (const auto &Candidate : Candidates) { in CudaInstallationDetector()
/freebsd/contrib/llvm-project/llvm/include/llvm/ExecutionEngine/Orc/
H A DSpeculation.h139 void registerSymbols(FunctionCandidatesMap Candidates, JITDylib *JD) { in registerSymbols() argument
140 for (auto &SymPair : Candidates) { in registerSymbols()
/freebsd/contrib/llvm-project/llvm/lib/DebugInfo/LogicalView/Core/
H A DLVScope.cpp825 LVScopes Candidates;
828 Candidates.push_back(Target); in findIn()
831 if (!Candidates.empty()) { in findIn()
838 for (const LVScope *Candidate : Candidates) in findIn()
847 if (!Candidates.empty()) in findIn()
848 return (Candidates.size() == 1) in findIn()
849 ? (equals(Candidates[0]) ? Candidates[0] : nullptr) in findIn()
850 : findEqualScope(&Candidates); in findIn()
833 LVScopes Candidates; findIn() local

123