-//===-- IntervalWriter.cpp - Library for printing Intervals ------*- C++ -*--=//
+//===-- Analysis/Writer.cpp - Printing routines for analyses -----*- C++ -*--=//
//
-// This library implements the interval printing functionality defined in
-// llvm/Assembly/Writer.h
+// This library file implements analysis result printing support for
+// llvm/Analysis/Writer.h
//
//===----------------------------------------------------------------------===//
-#include "llvm/Assembly/Writer.h"
-#include "llvm/Analysis/Interval.h"
+#include "llvm/Analysis/Writer.h"
+#include "llvm/Analysis/IntervalPartition.h"
+#include "llvm/Analysis/Dominators.h"
#include <iterator>
#include <algorithm>
+//===----------------------------------------------------------------------===//
+// Interval Printing Routines
+//===----------------------------------------------------------------------===//
+
void cfg::WriteToOutput(const Interval *I, ostream &o) {
o << "-------------------------------------------------------------\n"
<< "Interval Contents:\n";
ostream_iterator<BasicBlock*>(o, "\n"));
}
-#include "llvm/Analysis/Dominators.h"
+void cfg::WriteToOutput(const IntervalPartition &IP, ostream &o) {
+ copy(IP.begin(), IP.end(), ostream_iterator<const Interval *>(o, "\n"));
+}
+
+
+
+//===----------------------------------------------------------------------===//
+// Dominator Printing Routines
+//===----------------------------------------------------------------------===//
ostream &operator<<(ostream &o, const set<const BasicBlock*> &BBs) {
copy(BBs.begin(), BBs.end(), ostream_iterator<const BasicBlock*>(o, "\n"));
}
-void cfg::WriteToOutput(const DominatorTree &DT, ostream &o) {
+static ostream &operator<<(ostream &o, const cfg::DominatorTree::Node *Node) {
+ return o << Node->getNode() << "\n------------------------------------------\n";
+
+}
+static void PrintDomTree(const cfg::DominatorTree::Node *N, ostream &o,
+ unsigned Lev) {
+ o << "Level #" << Lev << ": " << N;
+ for (cfg::DominatorTree::Node::const_iterator I = N->begin(), E = N->end();
+ I != E; ++I) {
+ PrintDomTree(*I, o, Lev+1);
+ }
+}
+
+void cfg::WriteToOutput(const DominatorTree &DT, ostream &o) {
+ o << "=============================--------------------------------\n"
+ << "Inorder Dominator Tree:\n";
+ PrintDomTree(DT[DT.getRoot()], o, 1);
}
void cfg::WriteToOutput(const DominanceFrontier &DF, ostream &o) {