Home
last modified time | relevance | path

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

1234

/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DCGSCCPassManager.h118 extern template class AllAnalysesOn<LazyCallGraph::SCC>;
129 AnalysisManager<LazyCallGraph::SCC, LazyCallGraph &>;
137 CGSCCUpdateResult &>::run(LazyCallGraph::SCC &InitialC,
210 ModuleAnalysisManager, LazyCallGraph::SCC, LazyCallGraph &>;
257 SmallPriorityWorklist<LazyCallGraph::SCC *, 1> &CWorklist;
273 SmallPtrSetImpl<LazyCallGraph::SCC *> &InvalidatedSCCs;
293 LazyCallGraph::SCC *UpdatedC;
343 detail::PassConcept<LazyCallGraph::SCC, CGSCCAnalysisManager,
435 LazyCallGraph::SCC &updateCGAndAnalysisManagerForFunctionPass(
446 LazyCallGraph::SCC &updateCGAndAnalysisManagerForCGSCCPass(
[all …]
H A DLazyCallGraph.h117 class SCC; variable
422 class LLVM_EXTERNAL_VISIBILITY SCC {
490 bool isParentOf(const SCC &C) const;
498 bool isAncestorOf(const SCC &C) const;
545 SmallVector<SCC *, 4> SCCs;
548 SmallDenseMap<SCC *, int, 4> SCCIndices;
569 for (LazyCallGraph::SCC &C : RC) {
613 iterator find(SCC &C) const { in find()
967 if (SCC *C = lookupSCC(N)) in lookupRefSCC()
1131 SpecificBumpPtrAllocator<SCC> SCCBPA;
[all …]
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
/freebsd-13.1/contrib/llvm-project/llvm/lib/Analysis/
H A DCGSCCPassManager.cpp48 template class AllAnalysesOn<LazyCallGraph::SCC>;
74 LazyCallGraph::SCC *C = &InitialC; in run()
378 LazyCallGraph::SCC *C = &InitialC; in run()
389 auto ScanSCC = [](LazyCallGraph::SCC &C, in run()
536 LazyCallGraph::SCC *CurrentC = &C; in run()
829 static LazyCallGraph::SCC *
833 using SCC = LazyCallGraph::SCC; in incorporateNewSCCRange() typedef
843 SCC *OldC = C; in incorporateNewSCCRange()
897 using SCC = LazyCallGraph::SCC; in updateCGAndAnalysisManagerForPass() typedef
901 SCC *C = &InitialC; in updateCGAndAnalysisManagerForPass()
[all …]
H A DLazyCallGraph.cpp281 bool LazyCallGraph::SCC::isParentOf(const SCC &C) const { in isParentOf()
294 bool LazyCallGraph::SCC::isAncestorOf(const SCC &TargetC) const { in isAncestorOf()
343 for (SCC *C : SCCs) { in verify()
383 for (SCC *C : SCCs) { in verify()
412 for (SCC &C : *this) in isParentOf()
636 for (SCC *C : in switchInternalEdgeToCall()
1042 for (SCC &C : RC) in insertIncomingRefEdge()
1067 for (SCC &C : RC) in insertIncomingRefEdge()
1222 for (SCC *C : SCCs) { in removeInternalRefEdge()
1372 for (SCC *C : SCCs) { in removeInternalRefEdge()
[all …]
H A DSyntheticCountsUtils.cpp27 const SccTy &SCC, GetProfCountTy GetProfCount, AddCountTy AddCount) { in propagateFromSCC() argument
32 for (auto &Node : SCC) in propagateFromSCC()
98 for (auto &SCC : reverse(SCCs)) in propagate() local
99 propagateFromSCC(SCC, GetProfCount, AddCount); in propagate()
H A DGlobalsModRef.cpp477 const std::vector<CallGraphNode *> &SCC = *I; in CollectSCCMembership() local
478 assert(!SCC.empty() && "SCC with no functions?"); in CollectSCCMembership()
480 for (auto *CGN : SCC) in CollectSCCMembership()
495 const std::vector<CallGraphNode *> &SCC = *I; in AnalyzeCallGraph() local
496 assert(!SCC.empty() && "SCC with no functions?"); in AnalyzeCallGraph()
498 Function *F = SCC[0]->getFunction(); in AnalyzeCallGraph()
504 for (auto *Node : SCC) in AnalyzeCallGraph()
544 for (CallGraphNode::iterator CI = SCC[i]->begin(), E = SCC[i]->end(); in AnalyzeCallGraph()
554 if (!is_contained(SCC, CalleeNode)) in AnalyzeCallGraph()
565 for (auto *Node : SCC) in AnalyzeCallGraph()
[all …]
H A DCallGraphSCCPass.cpp686 bool runOnSCC(CallGraphSCC &SCC) override { in runOnSCC() argument
699 SCC.getCallGraph().getModule().print(OS, nullptr); in runOnSCC()
703 for (CallGraphNode *CGN : SCC) { in runOnSCC()
720 SCC.getCallGraph().getModule().print(OS, nullptr); in runOnSCC()
737 static std::string getDescription(const CallGraphSCC &SCC) { in getDescription() argument
740 for (CallGraphNode *CGN : SCC) { in getDescription()
752 bool CallGraphSCCPass::skipSCC(CallGraphSCC &SCC) const { in skipSCC()
754 SCC.getCallGraph().getModule().getContext().getOptPassGate(); in skipSCC()
755 return Gate.isEnabled() && !Gate.shouldRunPass(this, getDescription(SCC)); in skipSCC()
H A DDependenceGraphBuilder.cpp112 for (auto &SCC : make_range(scc_begin(&Graph), scc_end(&Graph))) { in createPiBlocks() local
113 if (SCC.size() > 1) in createPiBlocks()
114 ListOfSCCs.emplace_back(SCC.begin(), SCC.end()); in createPiBlocks()
/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/
H A DCallGraphUpdater.h49 LazyCallGraph::SCC *SCC = nullptr; variable
62 void initialize(CallGraph &CG, CallGraphSCC &SCC) { in initialize() argument
64 this->CGSCC = &SCC; in initialize()
66 void initialize(LazyCallGraph &LCG, LazyCallGraph::SCC &SCC, in initialize() argument
69 this->SCC = &SCC; in initialize()
73 &AM.getResult<FunctionAnalysisManagerCGSCCProxy>(SCC, LCG).getManager(); in initialize()
/freebsd-13.1/contrib/llvm-project/llvm/lib/Passes/
H A DStandardInstrumentations.cpp204 if (any_isa<const LazyCallGraph::SCC *>(IR)) { in unwrapModule()
205 const LazyCallGraph::SCC *C = any_cast<const LazyCallGraph::SCC *>(IR); in unwrapModule()
269 if (any_isa<const LazyCallGraph::SCC *>(IR)) { in getIRName()
270 const LazyCallGraph::SCC *C = any_cast<const LazyCallGraph::SCC *>(IR); in getIRName()
312 if (any_isa<const LazyCallGraph::SCC *>(IR)) { in shouldPrintIR()
313 const LazyCallGraph::SCC *C = any_cast<const LazyCallGraph::SCC *>(IR); in shouldPrintIR()
350 if (any_isa<const LazyCallGraph::SCC *>(IR)) { in unwrapAndPrint()
351 const LazyCallGraph::SCC *C = any_cast<const LazyCallGraph::SCC *>(IR); in unwrapAndPrint()
684 if (any_isa<const LazyCallGraph::SCC *>(IR)) in getModuleForComparison()
685 return any_cast<const LazyCallGraph::SCC *>(IR) in getModuleForComparison()
[all …]
/freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DPruneEH.cpp50 bool runOnSCC(CallGraphSCC &SCC) override;
166 bool PruneEH::runOnSCC(CallGraphSCC &SCC) { in runOnSCC() argument
167 if (skipSCC(SCC)) in runOnSCC()
170 for (auto &N : SCC) { in runOnSCC()
176 CGU.initialize(CG, SCC); in runOnSCC()
H A DInlineSimple.cpp76 bool runOnSCC(CallGraphSCC &SCC) override;
116 bool SimpleInliner::runOnSCC(CallGraphSCC &SCC) { in runOnSCC() argument
118 return LegacyInlinerBase::runOnSCC(SCC); in runOnSCC()
H A DOpenMPOpt.cpp701 : M(*(*SCC.begin())->getParent()), SCC(SCC), CGUpdater(CGUpdater), in OpenMPOpt()
712 if (SCC.empty()) in run()
1815 if (SCC.empty()) in runAttributor()
3983 if (SCC.empty()) in registerAAs()
4222 if (SCC.empty()) in run()
4234 SetVector<Function *> Functions(SCC.begin(), SCC.end()); in run()
4262 SCC.push_back(Fn); in run()
4265 if (SCC.empty()) in run()
4285 SetVector<Function *> Functions(SCC.begin(), SCC.end()); in run()
4330 if (SCC.empty()) in runOnSCC()
[all …]
H A DInliner.cpp295 bool LegacyInlinerBase::runOnSCC(CallGraphSCC &SCC) { in runOnSCC() argument
296 if (skipSCC(SCC)) in runOnSCC()
298 return inlineCalls(SCC); in runOnSCC()
302 inlineCallsImpl(CallGraphSCC &SCC, CallGraph &CG, in inlineCallsImpl() argument
312 for (CallGraphNode *Node : SCC) { in inlineCallsImpl()
330 for (CallGraphNode *Node : SCC) { in inlineCallsImpl()
521 if (SCC.isSingular()) { in inlineCallsImpl()
537 bool LegacyInlinerBase::inlineCalls(CallGraphSCC &SCC) { in inlineCalls() argument
548 SCC, CG, GetAssumptionCache, PSI, GetTLI, InsertLifetime, in inlineCalls()
824 PreservedAnalyses InlinerPass::run(LazyCallGraph::SCC &InitialC, in run()
[all …]
H A DAlwaysInliner.cpp146 bool runOnSCC(CallGraphSCC &SCC) override { return inlineCalls(SCC); } in runOnSCC() argument
/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/Transforms/IPO/
H A DInliner.h46 bool runOnSCC(CallGraphSCC &SCC) override;
71 bool inlineCalls(CallGraphSCC &SCC);
103 PreservedAnalyses run(LazyCallGraph::SCC &C, CGSCCAnalysisManager &AM,
/freebsd-13.1/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-13.1/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DSOPInstructions.td173 let Defs = [SCC] in {
183 } // End Defs = [SCC]
209 let Defs = [SCC] in {
218 } // End Defs = [SCC]
305 let Defs = [SCC] in {
309 } // End Defs = [SCC]
464 let Defs = [SCC] in { // Carry out goes to SCC
477 let Uses = [SCC] in { // Carry in comes from SCC
793 let Defs = [SCC];
821 // VCC = COPY SCC
[all …]
H A DAMDGPUAnnotateKernelFeatures.cpp51 bool runOnSCC(CallGraphSCC &SCC) override;
393 bool AMDGPUAnnotateKernelFeatures::runOnSCC(CallGraphSCC &SCC) { in runOnSCC() argument
396 for (CallGraphNode *I : SCC) { in runOnSCC()
H A DSIOptimizeExecMaskingPreRA.cpp195 assert(AndSCC.getReg() == AMDGPU::SCC); in optimizeVcndVcmpPair()
197 assert(Andn2SCC.getReg() == AMDGPU::SCC); in optimizeVcndVcmpPair()
329 RecalcRegs.insert(AMDGPU::SCC); in runOnMachineFunction()
337 RecalcRegs.insert(AMDGPU::SCC); in runOnMachineFunction()
/freebsd-13.1/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-13.1/sys/dev/scc/
H A Dscc_if.m36 # The SCC hardware interface. The core SCC code is hardware independent.
37 # The details of the hardware are abstracted by the SCC hardware interface.
74 # ipend() - query SCC for pending interrupts.
/freebsd-13.1/contrib/llvm-project/llvm/tools/opt/
H A DPassPrinters.cpp74 bool runOnSCC(CallGraphSCC &SCC) override { in runOnSCC()
78 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) { in runOnSCC()
/freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DCallGraphUpdater.cpp94 LazyCallGraph::SCC *C = LCG->lookupSCC(N); in reanalyzeFunction()
138 SCC->getOuterRefSCC().replaceNodeFunction(OldLCGN, NewFn); in replaceFunctionWith()

1234