void print(std::ostream *OS, const Module* M = 0) const {
if (OS) print(*OS, M);
}
+ virtual void dump();
};
//===-------------------------------------
void print(std::ostream *OS, const Module* M = 0) const {
if (OS) print(*OS, M);
}
+ virtual void dump();
protected:
/// getNode - return the (Post)DominatorTree node for the specified basic
/// block. This is the same as using operator[] on this class.
void print(std::ostream *OS, const Module* M = 0) const {
if (OS) print(*OS, M);
}
+ virtual void dump();
};
#include "llvm/ADT/SetOperations.h"
#include "llvm/ADT/SmallPtrSet.h"
#include "llvm/Instructions.h"
+#include "llvm/Support/Streams.h"
#include <algorithm>
using namespace llvm;
PrintDomTree(getRootNode(), o, 1);
}
+void DominatorTreeBase::dump() {
+ print (llvm::cerr);
+}
+
bool DominatorTree::runOnFunction(Function &F) {
reset(); // Reset from the last time we were run...
Roots.push_back(&F.getEntryBlock());
}
}
+void DominanceFrontierBase::dump() {
+ print (llvm::cerr);
+}
+
+
//===----------------------------------------------------------------------===//
// ETOccurrence Implementation
//===----------------------------------------------------------------------===//
}
o << "\n";
}
+
+void ETForestBase::dump() {
+ print (llvm::cerr);
+}