Go to the documentation of this file.
18 OS <<
"SCCs for Function " <<
F.getName() <<
" in PostOrder:";
20 const std::vector<BasicBlock *> &NextSCC = *SCCI;
21 OS <<
"\nSCC #" << ++SccNum <<
": ";
28 BB->printAsOperand(OS,
false);
30 if (NextSCC.size() == 1 && SCCI.hasCycle())
31 OS <<
" (Has self-loop).";
A set of analyses that are preserved following a run of a transformation pass.
This is an optimization pass for GlobalISel generic memory operations.
PreservedAnalyses run(Function &F, FunctionAnalysisManager &AM)
LLVM Basic Block Representation.
into llvm powi allowing the code generator to produce balanced multiplication trees First
scc_iterator< T > scc_begin(const T &G)
Construct the begin iterator for a deduced graph type T.
Enumerate the SCCs of a directed graph in reverse topological order of the SCC DAG.
static PreservedAnalyses all()
Construct a special preserved set that preserves all passes.
A container for analyses that lazily runs them and caches their results.
Common register allocation spilling lr str ldr sxth r3 ldr mla r4 can lr mov lr str ldr sxth r3 mla r4 and then merge mul and lr str ldr sxth r3 mla r4 It also increase the likelihood the store may become dead bb27 Successors according to LLVM BB