Home
last modified time | relevance | path

Searched refs:SCC (Results 1 – 25 of 79) sorted by relevance

1234

/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DCGSCCPassManager.h112 extern template class AllAnalysesOn<LazyCallGraph::SCC>;
114 extern template class AnalysisManager<LazyCallGraph::SCC, LazyCallGraph &>;
123 AnalysisManager<LazyCallGraph::SCC, LazyCallGraph &>;
130 PassManager<LazyCallGraph::SCC, CGSCCAnalysisManager, LazyCallGraph &,
131 CGSCCUpdateResult &>::run(LazyCallGraph::SCC &InitialC,
134 extern template class PassManager<LazyCallGraph::SCC, CGSCCAnalysisManager,
143 PassManager<LazyCallGraph::SCC, CGSCCAnalysisManager, LazyCallGraph &,
148 struct RequireAnalysisPass<AnalysisT, LazyCallGraph::SCC, CGSCCAnalysisManager,
150 : PassInfoMixin<RequireAnalysisPass<AnalysisT, LazyCallGraph::SCC,
153 PreservedAnalyses run(LazyCallGraph::SCC &C, CGSCCAnalysisManager &AM,
[all …]
H A DLazyCallGraph.h114 class SCC; variable
419 class LLVM_EXTERNAL_VISIBILITY SCC {
427 SCC(RefSCC &OuterRefSCC, NodeRangeT &&Nodes) in SCC() function
442 friend raw_ostream &operator<<(raw_ostream &OS, const SCC &C) {
488 bool isParentOf(const SCC &C) const;
496 bool isAncestorOf(const SCC &C) const;
502 bool isChildOf(const SCC &C) const { return C.isParentOf(*this); } in isChildOf()
508 bool isDescendantOf(const SCC &C) const { return C.isAncestorOf(*this); } in isDescendantOf()
551 SmallVector<SCC *, 4> SCCs;
554 SmallDenseMap<SCC *, int, 4> SCCIndices;
[all …]
H A DMLInlineAdvisor.h37 void onPassEntry(LazyCallGraph::SCC *SCC) override;
38 void onPassExit(LazyCallGraph::SCC *SCC) override;
H A DCallGraphSCCPass.h59 virtual bool runOnSCC(CallGraphSCC &SCC) = 0;
83 bool skipSCC(CallGraphSCC &SCC) const;
131 bool runOnSCC(CallGraphSCC &SCC) override { return false; } in runOnSCC() argument
H A DInlineAdvisor.h185 virtual void onPassEntry(LazyCallGraph::SCC *SCC = nullptr) {}
189 /// to prepare for a partial update, based on the optional SCC.
190 virtual void onPassExit(LazyCallGraph::SCC *SCC = nullptr) {}
354 PreservedAnalyses run(LazyCallGraph::SCC &InitialC, CGSCCAnalysisManager &AM,
H A DSyntheticCountsUtils.h45 static void propagateFromSCC(const SccTy &SCC, GetProfCountTy GetProfCount,
/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DCGSCCPassManager.cpp49 template class AllAnalysesOn<LazyCallGraph::SCC>;
50 template class AnalysisManager<LazyCallGraph::SCC, LazyCallGraph &>;
51 template class PassManager<LazyCallGraph::SCC, CGSCCAnalysisManager,
55 LazyCallGraph::SCC, LazyCallGraph &>;
62 PassManager<LazyCallGraph::SCC, CGSCCAnalysisManager, LazyCallGraph &,
63 CGSCCUpdateResult &>::run(LazyCallGraph::SCC &InitialC, in run()
75 LazyCallGraph::SCC *C = &InitialC; in run()
105 PI.runAfterPassInvalidated<LazyCallGraph::SCC>(*Pass, PassPA); in run()
117 PI.runAfterPass<LazyCallGraph::SCC>(*Pass, *C, PassPA); in run()
130 PA.preserveSet<AllAnalysesOn<LazyCallGraph::SCC>>(); in run()
[all …]
H A DLazyCallGraph.cpp242 LLVM_DUMP_METHOD void LazyCallGraph::SCC::dump() const { in dump()
248 void LazyCallGraph::SCC::verify() { in verify()
284 bool LazyCallGraph::SCC::isParentOf(const SCC &C) const { in isParentOf()
297 bool LazyCallGraph::SCC::isAncestorOf(const SCC &TargetC) const { in isAncestorOf()
304 SmallPtrSet<const SCC *, 16> Visited = {this}; in isAncestorOf()
305 SmallVector<const SCC *, 16> Worklist = {this}; in isAncestorOf()
309 const SCC &C = *Worklist.pop_back_val(); in isAncestorOf()
312 SCC *CalleeC = G.lookupSCC(E.getNode()); in isAncestorOf()
345 SmallPtrSet<SCC *, 4> SCCSet; in verify()
346 for (SCC *C : SCCs) { in verify()
[all …]
H A DSyntheticCountsUtils.cpp24 const SccTy &SCC, GetProfCountTy GetProfCount, AddCountTy AddCount) { in propagateFromSCC() argument
29 for (auto &Node : SCC) in propagateFromSCC()
95 for (auto &SCC : reverse(SCCs)) in propagate() local
96 propagateFromSCC(SCC, GetProfCount, AddCount); in propagate()
H A DGlobalsModRef.cpp481 const std::vector<CallGraphNode *> &SCC = *I; in CollectSCCMembership() local
482 assert(!SCC.empty() && "SCC with no functions?"); in CollectSCCMembership()
484 for (auto *CGN : SCC) in CollectSCCMembership()
499 const std::vector<CallGraphNode *> &SCC = *I; in AnalyzeCallGraph() local
500 assert(!SCC.empty() && "SCC with no functions?"); in AnalyzeCallGraph()
502 Function *F = SCC[0]->getFunction(); in AnalyzeCallGraph()
508 for (auto *Node : SCC) in AnalyzeCallGraph()
532 for (unsigned i = 0, e = SCC.size(); i != e && !KnowNothing; ++i) { in AnalyzeCallGraph()
560 for (CallGraphNode::iterator CI = SCC[i]->begin(), E = SCC[i]->end(); in AnalyzeCallGraph()
570 if (!is_contained(SCC, CalleeNode)) in AnalyzeCallGraph()
[all …]
H A DCallGraphSCCPass.cpp678 bool runOnSCC(CallGraphSCC &SCC) override { in runOnSCC() argument
691 SCC.getCallGraph().getModule().print(OS, nullptr); in runOnSCC()
695 for (CallGraphNode *CGN : SCC) { in runOnSCC()
712 SCC.getCallGraph().getModule().print(OS, nullptr); in runOnSCC()
729 static std::string getDescription(const CallGraphSCC &SCC) { in getDescription() argument
732 for (CallGraphNode *CGN : SCC) { in getDescription()
744 bool CallGraphSCCPass::skipSCC(CallGraphSCC &SCC) const { in skipSCC()
746 SCC.getCallGraph().getModule().getContext().getOptPassGate(); in skipSCC()
748 !Gate.shouldRunPass(this->getPassName(), getDescription(SCC)); in skipSCC()
H A DDependenceGraphBuilder.cpp113 for (auto &SCC : make_range(scc_begin(&Graph), scc_end(&Graph))) { in createPiBlocks() local
114 if (SCC.size() > 1) in createPiBlocks()
115 ListOfSCCs.emplace_back(SCC.begin(), SCC.end()); in createPiBlocks()
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/
H A DCallGraphUpdater.h44 LazyCallGraph::SCC *SCC = nullptr; variable
57 void initialize(LazyCallGraph &LCG, LazyCallGraph::SCC &SCC, in initialize() argument
60 this->SCC = &SCC; in initialize()
64 &AM.getResult<FunctionAnalysisManagerCGSCCProxy>(SCC, LCG).getManager(); in initialize()
/freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DAMDGPUAnnotateKernelFeatures.cpp41 bool runOnSCC(CallGraphSCC &SCC) override;
112 bool AMDGPUAnnotateKernelFeatures::runOnSCC(CallGraphSCC &SCC) { in runOnSCC() argument
115 for (CallGraphNode *I : SCC) { in runOnSCC()
H A DSOPInstructions.td212 let Uses = [SCC] in {
215 } // End Uses = [SCC]
223 let Defs = [SCC] in {
235 } // End Defs = [SCC]
261 let Defs = [SCC] in {
270 } // End Defs = [SCC]
334 let hasSideEffects = 1, Uses = [EXEC], Defs = [EXEC, SCC] in {
345 } // End hasSideEffects = 1, Uses = [EXEC], Defs = [EXEC, SCC]
363 let Defs = [SCC] in {
367 } // End Defs = [SCC]
[all …]
H A DSIOptimizeExecMaskingPreRA.cpp207 assert(AndSCC.getReg() == AMDGPU::SCC); in optimizeVcndVcmpPair()
209 assert(Andn2SCC.getReg() == AMDGPU::SCC); in optimizeVcndVcmpPair()
368 RecalcRegs.insert(AMDGPU::SCC); in runOnMachineFunction()
375 RecalcRegs.insert(AMDGPU::SCC); in runOnMachineFunction()
H A DAMDGPUPerfHintAnalysis.h29 bool runOnSCC(CallGraphSCC &SCC) override;
/freebsd/sys/contrib/device-tree/Bindings/arm/
H A Dvexpress-scc.txt4 Test chips for ARM Versatile Express platform implement SCC (Serial
23 - reg: when the SCC is memory mapped, physical address and size of the
25 - interrupts: when the SCC can generate a system-level interrupt
/freebsd/sys/contrib/device-tree/Bindings/crypto/
H A Dfsl-imx-scc.txt1 Freescale Security Controller (SCC)
9 - clocks: Should contain the clock driving the SCC core.
/freebsd/sys/dev/scc/
H A Dscc_if.m35 # The SCC hardware interface. The core SCC code is hardware independent.
36 # The details of the hardware are abstracted by the SCC hardware interface.
73 # ipend() - query SCC for pending interrupts.
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DCallGraphUpdater.cpp67 LazyCallGraph::SCC *C = LCG->lookupSCC(N); in reanalyzeFunction()
96 SCC->getOuterRefSCC().replaceNodeFunction(OldLCGN, NewFn); in replaceFunctionWith()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DOpenMPOpt.cpp379 void foreachUse(SmallVectorImpl<Function *> &SCC, in foreachUse()
381 for (Function *F : SCC) in foreachUse()
925 OpenMPOpt(SmallVectorImpl<Function *> &SCC, CallGraphUpdater &CGUpdater, in OpenMPOpt()
928 : M(*(*SCC.begin())->getParent()), SCC(SCC), CGUpdater(CGUpdater), in OpenMPOpt()
939 if (SCC.empty()) in run()
944 LLVM_DEBUG(dbgs() << TAG << "Run on SCC with " << SCC.size() in run()
994 for (Function *F : SCC) { in printICVs()
1012 for (Function *F : SCC) { in printKernels()
1309 RFI.foreachUse(SCC, DetectPRsCB); in mergeParallelRegions()
1462 RFI.foreachUse(SCC, DeleteCallCB); in deleteParallelRegions()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/IPO/
H A DArgumentPromotion.h29 PreservedAnalyses run(LazyCallGraph::SCC &C, CGSCCAnalysisManager &AM,
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Coroutines/
H A DCoroSplit.h33 PreservedAnalyses run(LazyCallGraph::SCC &C, CGSCCAnalysisManager &AM,
/freebsd/tools/kerneldoc/subsys/
H A DDoxyfile-dev_scc6 PROJECT_NAME = "FreeBSD kernel SCC device code"

1234