mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2025-10-30 16:17:05 +00:00
e6850235f5
contain it so that it would have full iterator access without much work. Writer includes code to print out IntervalPartition's now. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@133 91177308-0d34-0410-b5e6-96231b3b80d8
98 lines
3.3 KiB
C++
98 lines
3.3 KiB
C++
//===-- Analysis/Writer.cpp - Printing routines for analyses -----*- C++ -*--=//
|
|
//
|
|
// This library file implements analysis result printing support for
|
|
// llvm/Analysis/Writer.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";
|
|
|
|
// Print out all of the basic blocks in the interval...
|
|
copy(I->Nodes.begin(), I->Nodes.end(),
|
|
ostream_iterator<BasicBlock*>(o, "\n"));
|
|
|
|
o << "Interval Predecessors:\n";
|
|
copy(I->Predecessors.begin(), I->Predecessors.end(),
|
|
ostream_iterator<BasicBlock*>(o, "\n"));
|
|
|
|
o << "Interval Successors:\n";
|
|
copy(I->Successors.begin(), I->Successors.end(),
|
|
ostream_iterator<BasicBlock*>(o, "\n"));
|
|
}
|
|
|
|
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"));
|
|
return o;
|
|
}
|
|
|
|
void cfg::WriteToOutput(const DominatorSet &DS, ostream &o) {
|
|
for (DominatorSet::const_iterator I = DS.begin(), E = DS.end(); I != E; ++I) {
|
|
o << "=============================--------------------------------\n"
|
|
<< "\nDominator Set For Basic Block\n" << I->first
|
|
<< "-------------------------------\n" << I->second << endl;
|
|
}
|
|
}
|
|
|
|
|
|
void cfg::WriteToOutput(const ImmediateDominators &ID, ostream &o) {
|
|
for (ImmediateDominators::const_iterator I = ID.begin(), E = ID.end();
|
|
I != E; ++I) {
|
|
o << "=============================--------------------------------\n"
|
|
<< "\nImmediate Dominator For Basic Block\n" << I->first
|
|
<< "is: \n" << I->second << endl;
|
|
}
|
|
}
|
|
|
|
|
|
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) {
|
|
for (DominanceFrontier::const_iterator I = DF.begin(), E = DF.end();
|
|
I != E; ++I) {
|
|
o << "=============================--------------------------------\n"
|
|
<< "\nDominance Frontier For Basic Block\n" << I->first
|
|
<< "is: \n" << I->second << endl;
|
|
}
|
|
}
|
|
|