NaturalLoops::NaturalLoops() { }
NaturalLoops::~NaturalLoops() { }
+void NaturalLoops::computeDependencies(Graph& graph)
+{
+ graph.m_dominators.computeIfNecessary(graph);
+}
+
void NaturalLoops::compute(Graph& graph)
{
// Implement the classic dominator-based natural loop finder. The first
static const bool verbose = false;
- graph.m_dominators.computeIfNecessary(graph);
-
if (verbose) {
dataLog("Dominators:\n");
- graph.m_dominators.dump(graph, WTF::dataFile());
+ graph.m_dominators.dump(WTF::dataFile());
}
m_loops.resize(0);