Searched refs:SCC (Results 1 - 25 of 76) sorted by relevance

1234

/openbsd-current/gnu/usr.bin/cvs/windows-NT/SCC/
H A DMakefile.am7 # Makefile for GNU CVS windows-NT/SCC dist.
23 SCC.mak \
24 SCC.dsp \
H A DSCC.mak7 CFG=SCC - Win32 Debug
8 !MESSAGE No configuration specified. Defaulting to SCC - Win32 Debug.
11 !IF "$(CFG)" != "SCC - Win32 Release" && "$(CFG)" != "SCC - Win32 Debug"
16 !MESSAGE NMAKE /f "SCC.mak" CFG="SCC - Win32 Debug"
20 !MESSAGE "SCC - Win32 Release" (based on "Win32 (x86) Dynamic-Link Library")
21 !MESSAGE "SCC - Win32 Debug" (based on "Win32 (x86) Dynamic-Link Library")
33 # PROP Target_Last_Scanned "SCC - Win32 Debug"
38 !IF "$(CFG)" == "SCC
[all...]
H A DMakefile.in20 # Makefile for GNU CVS windows-NT/SCC dist.
109 SCC.mak \
110 SCC.dsp \
117 subdir = windows-NT/SCC
129 $(AUTOMAKE) --gnu windows-NT/SCC/Makefile
/openbsd-current/gnu/llvm/llvm/include/llvm/Transforms/Utils/
H A DCallGraphUpdater.h50 LazyCallGraph::SCC *SCC = nullptr; member in class:llvm::CallGraphUpdater
63 void initialize(CallGraph &CG, CallGraphSCC &SCC) { argument
65 this->CGSCC = &SCC;
67 void initialize(LazyCallGraph &LCG, LazyCallGraph::SCC &SCC, argument
70 this->SCC = &SCC;
74 &AM.getResult<FunctionAnalysisManagerCGSCCProxy>(SCC, LCG).getManager();
93 /// Replace \p OldFn in the call graph (and SCC) wit
[all...]
/openbsd-current/gnu/llvm/llvm/include/llvm/Analysis/
H A DCGSCCPassManager.h66 /// entries that become dead. This extra data is provided to every SCC pass so
112 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,
140 /// a sequence of SCC passes over each SCC that the manager is run over. This
143 PassManager<LazyCallGraph::SCC, CGSCCAnalysisManage
[all...]
H A DCallGraphSCCPass.h12 // SCC order: that is, they process function bottom-up, except for recursive
46 /// doInitialization - This method is called before the SCC's of the program
53 /// whatever action is necessary for the specified SCC. Note that
54 /// non-recursive (or only self-recursive) functions will have an SCC size of
55 /// 1, where recursive portions of the call graph will have SCC size > 1.
57 /// SCC passes that add or delete functions to the SCC are required to update
58 /// the SCC list, otherwise stale pointers may be dereferenced.
59 virtual bool runOnSCC(CallGraphSCC &SCC) = 0;
61 /// doFinalization - This method is called after the SCC'
[all...]
H A DMLInlineAdvisor.h35 void onPassEntry(LazyCallGraph::SCC *SCC) override;
36 void onPassExit(LazyCallGraph::SCC *SCC) override;
H A DLazyCallGraph.h20 /// visited prior to a caller (given any SCC constraints), or vice versa. As
69 /// by an edge in the graph, do not invalidate a bottom-up traversal of the SCC
71 /// that functions already visited in a bottom-up order of the SCC DAG are no
73 /// a bottom-up order of the SCC DAG are not required to have already been
77 /// SCC DAG. The greater the fanout of the SCC DAG and the fewer merge points
78 /// in the SCC DAG, the more independence there is in optimizing within it.
114 class SCC;
377 // of an SCC (or RefSCC), or '0' when not yet reached in a DFS walk.
408 /// An SCC o
419 class LLVM_EXTERNAL_VISIBILITY SCC { class in class:llvm::LazyCallGraph::Edge
427 SCC(RefSCC &OuterRefSCC, NodeRangeT &&Nodes) function in class:llvm::LazyCallGraph::Edge::SCC
[all...]
H A DSyntheticCountsUtils.h45 static void propagateFromSCC(const SccTy &SCC, GetProfCountTy GetProfCount,
H A DInlineAdvisor.h186 virtual void onPassEntry(LazyCallGraph::SCC *SCC = nullptr) {}
190 /// to prepare for a partial update, based on the optional SCC.
191 virtual void onPassExit(LazyCallGraph::SCC *SCC = nullptr) {}
355 PreservedAnalyses run(LazyCallGraph::SCC &InitialC, CGSCCAnalysisManager &AM,
/openbsd-current/gnu/llvm/llvm/lib/Analysis/
H A DSyntheticCountsUtils.cpp21 // Given an SCC, propagate entry counts along the edge of the SCC nodes.
24 const SccTy &SCC, GetProfCountTy GetProfCount, AddCountTy AddCount) {
29 for (auto &Node : SCC)
32 // Partition the edges coming out of the SCC into those whose destination is
33 // in the SCC and the rest.
43 // For nodes in the same SCC, update the counts in two steps:
46 // SCC and summing them up.
47 // 2. Add the additional counts to the nodes in the SCC.
49 // traversal of nodes within the SCC does
23 propagateFromSCC( const SccTy &SCC, GetProfCountTy GetProfCount, AddCountTy AddCount) argument
[all...]
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,
73 // The SCC may be refined while we are running passes over it, so set up
75 LazyCallGraph::SCC *C = &InitialC;
90 PI.runAfterPassInvalidated<LazyCallGraph::SCC>(*Pass, PassPA);
92 PI.runAfterPass<LazyCallGraph::SCC>(*Pas
[all...]
H A DLazyCallGraph.cpp234 LLVM_DUMP_METHOD void LazyCallGraph::SCC::dump() const {
240 void LazyCallGraph::SCC::verify() {
242 assert(!Nodes.empty() && "Can't have an empty SCC!");
247 "Node does not map to this SCC!");
249 "Must set DFS numbers to -1 when adding a node to an SCC!");
251 "Must set low link to -1 when adding a node to an SCC!");
256 // Verify that all nodes in this SCC can reach all other nodes.
269 "Cannot reach all nodes within SCC");
276 bool LazyCallGraph::SCC::isParentOf(const SCC
[all...]
H A DGlobalsModRef.cpp469 // We do a bottom-up SCC traversal of the call graph. In other words, we
473 const std::vector<CallGraphNode *> &SCC = *I; local
474 assert(!SCC.empty() && "SCC with no functions?");
476 for (auto *CGN : SCC)
488 // We do a bottom-up SCC traversal of the call graph. In other words, we
491 const std::vector<CallGraphNode *> &SCC = *I; local
492 assert(!SCC.empty() && "SCC with no functions?");
494 Function *F = SCC[
[all...]
H A DCallGraphSCCPass.cpp12 // call-graph in SCC order: that is, they process function bottom-up, except for
50 STATISTIC(MaxSCCIterations, "Maximum CGSCCPassMgr iterations on one SCC");
77 // CGPassManager walks SCC and it needs CallGraph.
89 errs().indent(Offset*2) << "Call Graph SCC Pass Manager\n";
173 // Run pass P on all functions in the current SCC.
188 LLVM_DEBUG(dbgs() << "CGSCCPASSMGR: Pass Dirtied SCC: " << P->getPassName()
208 LLVM_DEBUG(dbgs() << "CGSCCPASSMGR: Refreshing SCC with " << CurSCC.size()
216 // Scan all functions in the SCC.
410 dbgs() << "CGSCCPASSMGR: Refreshed SCC is now:\n";
416 dbgs() << "CGSCCPASSMGR: SCC Refres
728 getDescription(const CallGraphSCC &SCC) argument
[all...]
/openbsd-current/gnu/llvm/llvm/include/llvm/Transforms/Coroutines/
H A DCoroSplit.h27 PreservedAnalyses run(LazyCallGraph::SCC &C, CGSCCAnalysisManager &AM,
/openbsd-current/gnu/llvm/llvm/include/llvm/Transforms/IPO/
H A DArgumentPromotion.h20 /// This pass walks the functions in each SCC and for each one tries to
29 PreservedAnalyses run(LazyCallGraph::SCC &C, CGSCCAnalysisManager &AM,
H A DFunctionAttrs.h51 PreservedAnalyses run(LazyCallGraph::SCC &C, CGSCCAnalysisManager &AM,
H A DInliner.h44 bool runOnSCC(CallGraphSCC &SCC) override;
49 /// breaking the SCC traversal.
69 bool inlineCalls(CallGraphSCC &SCC);
86 /// the SCC and tries to inline if profitable. It can be tuned with a number of
103 PreservedAnalyses run(LazyCallGraph::SCC &C, CGSCCAnalysisManager &AM,
H A DOpenMPOpt.h54 PreservedAnalyses run(LazyCallGraph::SCC &C, CGSCCAnalysisManager &AM,
/openbsd-current/gnu/usr.bin/cvs/windows-NT/
H A DMakefile.am39 SUBDIRS = SCC
/openbsd-current/gnu/llvm/llvm/lib/Target/AMDGPU/
H A DAMDGPUAnnotateKernelFeatures.cpp41 bool runOnSCC(CallGraphSCC &SCC) override;
112 bool AMDGPUAnnotateKernelFeatures::runOnSCC(CallGraphSCC &SCC) { argument
115 for (CallGraphNode *I : SCC) {
H A DAMDGPUPerfHintAnalysis.h29 bool runOnSCC(CallGraphSCC &SCC) override;
/openbsd-current/gnu/llvm/llvm/lib/Transforms/IPO/
H A DInlineSimple.cpp70 bool runOnSCC(CallGraphSCC &SCC) override;
110 bool SimpleInliner::runOnSCC(CallGraphSCC &SCC) { argument
112 return LegacyInlinerBase::runOnSCC(SCC);
H A DAlwaysInliner.cpp152 bool runOnSCC(CallGraphSCC &SCC) override { return inlineCalls(SCC); }

Completed in 322 milliseconds

1234