Home
last modified time | relevance | path

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

123

/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DMachineOutliner.h221 std::vector<Candidate> Candidates;
238 virtual unsigned getOccurrenceCount() const { return Candidates.size(); } in getOccurrenceCount()
244 for (const Candidate &C : Candidates) in getOutliningCost()
264 unsigned getNumInstrs() const { return Candidates[0].getLength(); } in getNumInstrs()
266 OutlinedFunction(std::vector<Candidate> &Candidates, unsigned SequenceSize, in OutlinedFunction()
268 : Candidates(Candidates), SequenceSize(SequenceSize), in OutlinedFunction()
271 for (Candidate &C : Candidates) in OutlinedFunction()
293 assert(Candidates.size() <= 1); in getOccurrenceCount()
294 return Candidates.empty() ? 0 : GlobalOccurrenceCount; in getOccurrenceCount()
300 assert(Candidates.size() <= 1); in getOutliningCost()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DLoopLoadElimination.cpp182 std::forward_list<StoreToLoadForwardingCandidate> Candidates; in findStoreToLoadDependences() local
187 return Candidates; in findStoreToLoadDependences()
229 Candidates.emplace_front(Load, Store); in findStoreToLoadDependences()
233 Candidates.remove_if([&](const StoreToLoadForwardingCandidate &C) { in findStoreToLoadDependences()
237 return Candidates; in findStoreToLoadDependences()
267 std::forward_list<StoreToLoadForwardingCandidate> &Candidates) { in removeDependencesFromMultipleStores() argument
274 for (const auto &Cand : Candidates) { in removeDependencesFromMultipleStores()
300 Candidates.remove_if([&](const StoreToLoadForwardingCandidate &Cand) { in removeDependencesFromMultipleStores()
334 const SmallVectorImpl<StoreToLoadForwardingCandidate> &Candidates) { in findPointersWrittenOnForwardingPath() argument
353 llvm::max_element(Candidates, in findPointersWrittenOnForwardingPath()
[all …]
H A DStraightLineStrengthReduce.cpp248 std::list<Candidate> Candidates; member in __anon0eec50480111::StraightLineStrengthReduce
368 for (auto Basis = Candidates.rbegin(); in allocateCandidatesAndFindBasis()
369 Basis != Candidates.rend() && NumIterations < MaxNumIterations; in allocateCandidatesAndFindBasis()
379 Candidates.push_back(C); in allocateCandidatesAndFindBasis()
697 while (!Candidates.empty()) { in runOnFunction()
698 const Candidate &C = Candidates.back(); in runOnFunction()
702 Candidates.pop_back(); in runOnFunction()
H A DGVNSink.cpp752 SmallVector<SinkingInstructionCandidate, 4> Candidates; in sinkBB() local
765 Candidates.emplace_back(*Cand); in sinkBB()
769 llvm::stable_sort(Candidates, std::greater<SinkingInstructionCandidate>()); in sinkBB()
771 : Candidates) dbgs() in sinkBB()
775 if (Candidates.empty() || Candidates.front().Cost <= 0) in sinkBB()
777 auto C = Candidates.front(); in sinkBB()
H A DReassociate.cpp2017 SmallVectorImpl<Instruction *> &Candidates) { in getNegatibleInsts() argument
2034 Candidates.push_back(I); in getNegatibleInsts()
2037 getNegatibleInsts(I->getOperand(0), Candidates); in getNegatibleInsts()
2038 getNegatibleInsts(I->getOperand(1), Candidates); in getNegatibleInsts()
2048 Candidates.push_back(I); in getNegatibleInsts()
2051 getNegatibleInsts(I->getOperand(0), Candidates); in getNegatibleInsts()
2052 getNegatibleInsts(I->getOperand(1), Candidates); in getNegatibleInsts()
2070 SmallVector<Instruction *, 4> Candidates; in canonicalizeNegFPConstantsForOp() local
2071 getNegatibleInsts(Op, Candidates); in canonicalizeNegFPConstantsForOp()
2072 if (Candidates.empty()) in canonicalizeNegFPConstantsForOp()
[all …]
H A DGVNHoist.cpp483 unsigned rauw(const SmallVecInsn &Candidates, Instruction *Repl,
490 unsigned removeAndReplace(const SmallVecInsn &Candidates, Instruction *Repl,
971 unsigned GVNHoist::rauw(const SmallVecInsn &Candidates, Instruction *Repl, in rauw() argument
974 for (Instruction *I : Candidates) { in rauw()
1011 unsigned GVNHoist::removeAndReplace(const SmallVecInsn &Candidates, in removeAndReplace() argument
1022 unsigned NR = rauw(Candidates, Repl, NewMemAcc); in removeAndReplace()
/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.cpp360 ArrayRef<PromotionCandidate> Candidates,
370 CallBase &CB, Instruction *VPtr, ArrayRef<PromotionCandidate> Candidates,
377 ArrayRef<PromotionCandidate> Candidates);
392 std::vector<PromotionCandidate> &Candidates);
520 std::vector<PromotionCandidate> &Candidates) { in computeVTableInfos() argument
559 for (size_t I = 0; I < Candidates.size(); I++) in computeVTableInfos()
560 CalleeIndexMap[Candidates[I].TargetFunction] = I; in computeVTableInfos()
596 auto &Candidate = Candidates[CalleeIndexIter->second]; in computeVTableInfos()
644 CallBase &CB, Instruction *VPtr, ArrayRef<PromotionCandidate> Candidates, in tryToPromoteWithFuncCmp() argument
649 for (const auto &C : Candidates) { in tryToPromoteWithFuncCmp()
[all …]
/freebsd/contrib/llvm-project/clang/include/clang/Sema/
H A DTemplateDeduction.h348 SmallVector<TemplateSpecCandidate, 16> Candidates; variable
374 iterator begin() { return Candidates.begin(); } in begin()
375 iterator end() { return Candidates.end(); } in end()
377 size_t size() const { return Candidates.size(); } in size()
378 bool empty() const { return Candidates.empty(); } in empty()
383 Candidates.emplace_back(); in addCandidate()
384 return Candidates.back(); in addCandidate()
H A DOverload.h1255 SmallVector<OverloadCandidate, 16> Candidates;
1371 iterator begin() { return Candidates.begin(); } in begin()
1372 iterator end() { return Candidates.end(); } in end()
1374 size_t size() const { return Candidates.size() + DeferredCandidatesCount; } in size()
1376 size_t nonDeferredCandidatesCount() const { return Candidates.size(); } in nonDeferredCandidatesCount()
1379 return Candidates.empty() && DeferredCandidatesCount == 0; in empty()
1421 Candidates.push_back(OverloadCandidate());
1422 OverloadCandidate &C = Candidates.back();
1490 Sema &S, SmallVectorImpl<OverloadCandidate *> &Candidates);
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DInterleavedLoadCombinePass.cpp103 bool findPattern(std::list<VectorInfo> &Candidates,
1057 std::list<VectorInfo> &Candidates, std::list<VectorInfo> &InterleavedLoad, in findPattern() argument
1059 for (auto C0 = Candidates.begin(), E0 = Candidates.end(); C0 != E0; ++C0) { in findPattern()
1065 std::vector<std::list<VectorInfo>::iterator> Res(Factor, Candidates.end()); in findPattern()
1067 for (auto C = Candidates.begin(), E = Candidates.end(); C != E; C++) { in findPattern()
1083 if (Res[i] == Candidates.end()) in findPattern()
1092 if (Res[0] != Candidates.end()) { in findPattern()
1095 InterleavedLoad.splice(InterleavedLoad.end(), Candidates, Res[i]); in findPattern()
1262 std::list<VectorInfo> Candidates; in run() local
1271 Candidates.emplace_back(cast<FixedVectorType>(SVI->getType())); in run()
[all …]
H A DMachineOutliner.cpp552 for (const Candidate &C : OF.Candidates) in getSubprogramOrNull()
638 for (size_t i = 0, e = OF.Candidates.size(); i < e; i++) { in emitOutlinedFunctionRemark()
641 OF.Candidates[i].front().getDebugLoc()); in emitOutlinedFunctionRemark()
740 if (!OF.has_value() || OF.value()->Candidates.empty()) in findGlobalCandidates()
743 assert(OF.value()->Candidates.size() == MinRepeats); in findGlobalCandidates()
845 if (!OF.has_value() || OF.value()->Candidates.size() < MinRepeats) in findCandidates()
919 Candidate &FirstCand = OF.Candidates.front(); in createOutlinedFunction()
923 TII.mergeOutliningCandidateAttributes(*F, OF.Candidates); in createOutlinedFunction()
927 OF.Candidates.cbegin(), OF.Candidates.cend(), UWTableKind::None, in createOutlinedFunction()
967 computeAndPublishHashSequence(MF, OF.Candidates.size()); in createOutlinedFunction()
[all …]
/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/compiler-rt/lib/ctx_profile/
H A DRootAutoDetector.cpp175 DenseMap<uptr, uint64_t> Candidates; in determineRoots() local
179 Candidates[SA] += Node->Count; in determineRoots()
186 if (Candidates.size() > 1) { in determineRoots()
187 Result.swap(Candidates); in determineRoots()
/freebsd/contrib/llvm-project/llvm/lib/Target/BPF/
H A DBPFAdjustOpt.cpp299 SmallVector<PassThroughInfo, 4> Candidates; in avoidSpeculation() local
336 Candidates.push_back(Info); in avoidSpeculation()
349 Candidates.push_back(Info); in avoidSpeculation()
353 if (!isCandidate || Candidates.empty()) in avoidSpeculation()
356 llvm::append_range(PassThroughs, Candidates); in avoidSpeculation()
/freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DGCNNSAReassign.cpp260 SmallVector<Candidate, 32> Candidates; in run() local
267 Candidates.push_back(std::pair(&MI, true)); in run()
270 Candidates.push_back(std::pair(&MI, false)); in run()
278 for (auto &C : Candidates) { in run()
337 std::lower_bound(Candidates.begin(), &C, MinInd, in run()
341 for (auto *E = Candidates.end(); in run()
/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/lib/Transforms/Vectorize/
H A DVPlanSLP.cpp295 SmallPtrSetImpl<VPValue *> &Candidates, in getBest() argument
304 for (auto *Candidate : Candidates) { in getBest()
347 Candidates.erase(Best); in getBest()
371 SmallPtrSet<VPValue *, 4> Candidates; in reorderMultiNodeOps() local
377 Candidates.insert(Ops.second[Lane]); in reorderMultiNodeOps()
388 getBest(Mode[Op], Last, Candidates, IAI); in reorderMultiNodeOps()
H A DVPlanSLP.h121 SmallPtrSetImpl<VPValue *> &Candidates,
/freebsd/contrib/llvm-project/llvm/lib/Target/Mips/
H A DMips16InstrInfo.cpp347 BitVector Candidates = in loadImmediate() local
354 Candidates.reset(MO.getReg()); in loadImmediate()
374 Available &= Candidates; in loadImmediate()
385 Reg = Candidates.find_first(); in loadImmediate()
386 Candidates.reset(Reg); in loadImmediate()
400 SpReg = Candidates.find_first(); in loadImmediate()
/freebsd/contrib/llvm-project/llvm/lib/Target/PowerPC/
H A DPPCPreEmitPeephole.cpp368 SmallVector<MachineInstr *, 8> Candidates( in removeAccPrimeUnprime() local
379 Candidates[Acc - PPC::ACC0] = &BBI; in removeAccPrimeUnprime()
387 if (!Candidates[Acc - PPC::ACC0]) in removeAccPrimeUnprime()
390 InstrsToErase.insert(Candidates[Acc - PPC::ACC0]); in removeAccPrimeUnprime()
400 Candidates[Reg - PPC::ACC0] = nullptr; in removeAccPrimeUnprime()
/freebsd/contrib/llvm-project/clang/lib/Driver/ToolChains/
H A DCuda.cpp148 SmallVector<Candidate, 4> Candidates; in CudaInstallationDetector() local
155 Candidates.emplace_back( in CudaInstallationDetector()
159 Candidates.emplace_back( in CudaInstallationDetector()
179 Candidates.emplace_back( in CudaInstallationDetector()
185 Candidates.emplace_back(D.SysRoot + "/usr/local/cuda"); in CudaInstallationDetector()
187 Candidates.emplace_back(D.SysRoot + "/usr/local/cuda-" + Ver); in CudaInstallationDetector()
193 Candidates.emplace_back(D.SysRoot + "/usr/lib/cuda"); in CudaInstallationDetector()
199 for (const auto &Candidate : Candidates) { in CudaInstallationDetector()
/freebsd/contrib/llvm-project/llvm/include/llvm/ExecutionEngine/Orc/
H A DSpeculation.h140 void registerSymbols(FunctionCandidatesMap Candidates, JITDylib *JD) { in registerSymbols() argument
141 for (auto &SymPair : Candidates) { in registerSymbols()
/freebsd/contrib/llvm-project/llvm/lib/DebugInfo/LogicalView/Core/
H A DLVScope.cpp832 LVScopes Candidates; in findIn() local
835 Candidates.push_back(Target); in findIn()
838 if (!Candidates.empty()) { in findIn()
845 for (const LVScope *Candidate : Candidates) in findIn()
854 if (!Candidates.empty()) in findIn()
855 return (Candidates.size() == 1) in findIn()
856 ? (equals(Candidates[0]) ? Candidates[0] : nullptr) in findIn()
857 : findEqualScope(&Candidates); in findIn()

123