Home
last modified time | relevance | path

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

123456

/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
H A DCGSCCPassManager.h118 extern template class AllAnalysesOn<LazyCallGraph::SCC>;
120 extern template class AnalysisManager<LazyCallGraph::SCC, LazyCallGraph &>;
129 AnalysisManager<LazyCallGraph::SCC, LazyCallGraph &>;
136 PassManager<LazyCallGraph::SCC, CGSCCAnalysisManager, LazyCallGraph &,
137 CGSCCUpdateResult &>::run(LazyCallGraph::SCC &InitialC,
140 extern template class PassManager<LazyCallGraph::SCC, CGSCCAnalysisManager,
149 PassManager<LazyCallGraph::SCC, CGSCCAnalysisManager, LazyCallGraph &,
154 struct RequireAnalysisPass<AnalysisT, LazyCallGraph::SCC, CGSCCAnalysisManager,
156 : PassInfoMixin<RequireAnalysisPass<AnalysisT, LazyCallGraph::SCC,
159 PreservedAnalyses run(LazyCallGraph::SCC &C, CGSCCAnalysisManager &AM,
[all …]
H A DLazyCallGraph.h116 class SCC; variable
421 class SCC {
429 SCC(RefSCC &OuterRefSCC, NodeRangeT &&Nodes) in SCC() function
444 friend raw_ostream &operator<<(raw_ostream &OS, const SCC &C) {
489 bool isParentOf(const SCC &C) const;
497 bool isAncestorOf(const SCC &C) const;
503 bool isChildOf(const SCC &C) const { return C.isParentOf(*this); } in isChildOf()
509 bool isDescendantOf(const SCC &C) const { return C.isAncestorOf(*this); } in isDescendantOf()
544 SmallVector<SCC *, 4> SCCs;
547 SmallDenseMap<SCC *, int, 4> SCCIndices;
[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
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Analysis/
H A DCGSCCPassManager.cpp48 template class AllAnalysesOn<LazyCallGraph::SCC>;
49 template class AnalysisManager<LazyCallGraph::SCC, LazyCallGraph &>;
50 template class PassManager<LazyCallGraph::SCC, CGSCCAnalysisManager,
54 LazyCallGraph::SCC, LazyCallGraph &>;
61 PassManager<LazyCallGraph::SCC, CGSCCAnalysisManager, LazyCallGraph &,
62 CGSCCUpdateResult &>::run(LazyCallGraph::SCC &InitialC, in run()
74 LazyCallGraph::SCC *C = &InitialC; in run()
93 PI.runAfterPassInvalidated<LazyCallGraph::SCC>(*Pass, PassPA); in run()
95 PI.runAfterPass<LazyCallGraph::SCC>(*Pass, *C, PassPA); in run()
140 PA.preserveSet<AllAnalysesOn<LazyCallGraph::SCC>>(); in run()
[all …]
H A DLazyCallGraph.cpp239 LLVM_DUMP_METHOD void LazyCallGraph::SCC::dump() const { in dump()
245 void LazyCallGraph::SCC::verify() { in verify()
281 bool LazyCallGraph::SCC::isParentOf(const SCC &C) const { in isParentOf()
294 bool LazyCallGraph::SCC::isAncestorOf(const SCC &TargetC) const { in isAncestorOf()
301 SmallPtrSet<const SCC *, 16> Visited = {this}; in isAncestorOf()
302 SmallVector<const SCC *, 16> Worklist = {this}; in isAncestorOf()
306 const SCC &C = *Worklist.pop_back_val(); in isAncestorOf()
309 SCC *CalleeC = G.lookupSCC(E.getNode()); in isAncestorOf()
342 SmallPtrSet<SCC *, 4> SCCSet; in verify()
343 for (SCC *C : SCCs) { in verify()
[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()
516 for (unsigned i = 0, e = SCC.size(); i != e && !KnowNothing; ++i) { in AnalyzeCallGraph()
544 for (CallGraphNode::iterator CI = SCC[i]->begin(), E = SCC[i]->end(); in AnalyzeCallGraph()
554 if (!is_contained(SCC, CalleeNode)) 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()
/netbsd-src/external/apache2/llvm/dist/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()
/netbsd-src/sys/arch/atari/atari/
H A Dvectors.s161 VECTOR(badmfpint) | 82: SCC-DMA
164 VECTOR(badmfpint) | 85: TCCLC SCC (Timer C)
187 VECTOR(badtrap) | 96: SCC Tx empty channel B
189 VECTOR(badtrap) | 98: SCC Ext./Status Channel B
191 VECTOR(badtrap) | 100: SCC Rx Channel B
193 VECTOR(badtrap) | 102: SCC Special Rx cond. Channel B
195 VECTOR(badtrap) | 104: SCC Tx empty channel A
197 VECTOR(badtrap) | 106: SCC Ext./Status Channel A
199 VECTOR(badtrap) | 108: SCC Rx Channel A
201 VECTOR(badtrap) | 110: SCC Special Rx cond. Channel A
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/IPO/
H A DOpenMPOpt.cpp215 void foreachUse(SmallVectorImpl<Function *> &SCC, in foreachUse()
217 for (Function *F : SCC) in foreachUse()
519 OpenMPOpt(SmallVectorImpl<Function *> &SCC, CallGraphUpdater &CGUpdater, in OpenMPOpt()
522 : M(*(*SCC.begin())->getParent()), SCC(SCC), CGUpdater(CGUpdater), in OpenMPOpt()
533 if (SCC.empty()) in run()
538 LLVM_DEBUG(dbgs() << TAG << "Run on SCC with " << SCC.size() in run()
599 for (Function *F : SCC) { in printKernels()
910 RFI.foreachUse(SCC, DetectPRsCB); in mergeParallelRegions()
1067 RFI.foreachUse(SCC, DeleteCallCB); in deleteParallelRegions()
1100 for (Function *F : SCC) { in deduplicateRuntimeCalls()
[all …]
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 DInliner.cpp291 bool LegacyInlinerBase::runOnSCC(CallGraphSCC &SCC) { in runOnSCC() argument
292 if (skipSCC(SCC)) in runOnSCC()
294 return inlineCalls(SCC); in runOnSCC()
298 inlineCallsImpl(CallGraphSCC &SCC, CallGraph &CG, in inlineCallsImpl() argument
308 for (CallGraphNode *Node : SCC) { in inlineCallsImpl()
326 for (CallGraphNode *Node : SCC) { in inlineCallsImpl()
517 if (SCC.isSingular()) { in inlineCallsImpl()
533 bool LegacyInlinerBase::inlineCalls(CallGraphSCC &SCC) { in inlineCalls() argument
544 SCC, CG, GetAssumptionCache, PSI, GetTLI, InsertLifetime, in inlineCalls()
673 PreservedAnalyses InlinerPass::run(LazyCallGraph::SCC &InitialC, in run()
[all …]
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 DAlwaysInliner.cpp146 bool runOnSCC(CallGraphSCC &SCC) override { return inlineCalls(SCC); } in runOnSCC() argument
/netbsd-src/external/apache2/llvm/dist/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()
244 void printIR(raw_ostream &OS, const LazyCallGraph::SCC *C) { in printIR()
269 if (any_isa<const LazyCallGraph::SCC *>(IR)) { in getIRName()
270 const LazyCallGraph::SCC *C = any_cast<const LazyCallGraph::SCC *>(IR); in getIRName()
293 bool sccContainsFilterPrintFunc(const LazyCallGraph::SCC &C) { in sccContainsFilterPrintFunc()
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()
[all …]
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/
H A DSOPInstructions.td163 let Uses = [SCC] in {
166 } // End Uses = [SCC]
169 let Defs = [SCC] in {
179 } // End Defs = [SCC]
203 let Defs = [SCC] in {
212 } // End Defs = [SCC]
269 let hasSideEffects = 1, Uses = [EXEC], Defs = [EXEC, SCC] in {
280 } // End hasSideEffects = 1, Uses = [EXEC], Defs = [EXEC, SCC]
296 let Defs = [SCC] in {
298 } // End Defs = [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()
/netbsd-src/external/apache2/llvm/dist/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,
/netbsd-src/external/apache2/llvm/dist/llvm/docs/
H A DOptBisect.rst127 BISECT: running pass (11) Remove unused exception handling info on SCC (<<null function>>)
128 BISECT: running pass (12) Function Integration/Inlining on SCC (<<null function>>)
129 BISECT: running pass (13) Deduce function attributes on SCC (<<null function>>)
130 BISECT: running pass (14) Remove unused exception handling info on SCC (f)
131 BISECT: running pass (15) Function Integration/Inlining on SCC (f)
132 BISECT: running pass (16) Deduce function attributes on SCC (f)
133 BISECT: NOT running pass (17) Remove unused exception handling info on SCC (g)
134 BISECT: NOT running pass (18) Function Integration/Inlining on SCC (g)
135 BISECT: NOT running pass (19) Deduce function attributes on SCC (g)
158 bool CallGraphSCCPass::skipSCC(CallGraphSCC &SCC);
/netbsd-src/external/apache2/llvm/dist/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()
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/Coroutines/
H A DCoroSplit.cpp1810 CallGraph &CG, CallGraphSCC &SCC) { in updateCallGraphAfterCoroutineSplit() argument
1818 coro::updateCallGraph(F, Clones, CG, SCC); in updateCallGraphAfterCoroutineSplit()
1823 const SmallVectorImpl<Function *> &Clones, LazyCallGraph::SCC &C, in updateCallGraphAfterCoroutineSplit()
1905 static void createDevirtTriggerFunc(CallGraph &CG, CallGraphSCC &SCC) { in createDevirtTriggerFunc() argument
1922 SmallVector<CallGraphNode *, 8> Nodes(SCC.begin(), SCC.end()); in createDevirtTriggerFunc()
1924 SCC.initialize(Nodes); in createDevirtTriggerFunc()
1929 LazyCallGraph::SCC &C) { in replacePrepare()
2019 LazyCallGraph::SCC &C) { in replaceAllPrepares()
2064 PreservedAnalyses CoroSplitPass::run(LazyCallGraph::SCC &C, in run()
2162 bool runOnSCC(CallGraphSCC &SCC) override { in runOnSCC()
[all …]
/netbsd-src/crypto/external/bsd/heimdal/dist/tests/kdc/
H A Dcheck-cc.in117 ${kinit} -c SCC:1 foo@${R} || { ec=1 ; eval "${testfailed}"; }
118 ${kinit} -c SCC:2 bar@${R} || { ec=1 ; eval "${testfailed}"; }

123456