mirror of
https://github.com/RPCSX/llvm.git
synced 2024-11-27 05:30:49 +00:00
e3e43d9d57
I did this a long time ago with a janky python script, but now clang-format has built-in support for this. I fed clang-format every line with a #include and let it re-sort things according to the precise LLVM rules for include ordering baked into clang-format these days. I've reverted a number of files where the results of sorting includes isn't healthy. Either places where we have legacy code relying on particular include ordering (where possible, I'll fix these separately) or where we have particular formatting around #include lines that I didn't want to disturb in this patch. This patch is *entirely* mechanical. If you get merge conflicts or anything, just ignore the changes in this patch and run clang-format over your #include lines in the files. Sorry for any noise here, but it is important to keep these things stable. I was seeing an increasing number of patches with irrelevant re-ordering of #include lines because clang-format was used. This patch at least isolates that churn, makes it easy to skip when resolving conflicts, and gets us to a clean baseline (again). git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@304787 91177308-0d34-0410-b5e6-96231b3b80d8
308 lines
9.7 KiB
C++
308 lines
9.7 KiB
C++
//===-- SelectionDAGPrinter.cpp - Implement SelectionDAG::viewGraph() -----===//
|
|
//
|
|
// The LLVM Compiler Infrastructure
|
|
//
|
|
// This file is distributed under the University of Illinois Open Source
|
|
// License. See LICENSE.TXT for details.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
//
|
|
// This implements the SelectionDAG::viewGraph method.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#include "ScheduleDAGSDNodes.h"
|
|
#include "llvm/ADT/DenseSet.h"
|
|
#include "llvm/ADT/StringExtras.h"
|
|
#include "llvm/CodeGen/MachineConstantPool.h"
|
|
#include "llvm/CodeGen/MachineFunction.h"
|
|
#include "llvm/CodeGen/MachineModuleInfo.h"
|
|
#include "llvm/CodeGen/SelectionDAG.h"
|
|
#include "llvm/IR/Constants.h"
|
|
#include "llvm/IR/DebugInfo.h"
|
|
#include "llvm/Support/Debug.h"
|
|
#include "llvm/Support/GraphWriter.h"
|
|
#include "llvm/Support/raw_ostream.h"
|
|
#include "llvm/Target/TargetMachine.h"
|
|
#include "llvm/Target/TargetRegisterInfo.h"
|
|
using namespace llvm;
|
|
|
|
#define DEBUG_TYPE "dag-printer"
|
|
|
|
namespace llvm {
|
|
template<>
|
|
struct DOTGraphTraits<SelectionDAG*> : public DefaultDOTGraphTraits {
|
|
|
|
explicit DOTGraphTraits(bool isSimple=false) :
|
|
DefaultDOTGraphTraits(isSimple) {}
|
|
|
|
static bool hasEdgeDestLabels() {
|
|
return true;
|
|
}
|
|
|
|
static unsigned numEdgeDestLabels(const void *Node) {
|
|
return ((const SDNode *) Node)->getNumValues();
|
|
}
|
|
|
|
static std::string getEdgeDestLabel(const void *Node, unsigned i) {
|
|
return ((const SDNode *) Node)->getValueType(i).getEVTString();
|
|
}
|
|
|
|
template<typename EdgeIter>
|
|
static std::string getEdgeSourceLabel(const void *Node, EdgeIter I) {
|
|
return itostr(I - SDNodeIterator::begin((const SDNode *) Node));
|
|
}
|
|
|
|
/// edgeTargetsEdgeSource - This method returns true if this outgoing edge
|
|
/// should actually target another edge source, not a node. If this method
|
|
/// is implemented, getEdgeTarget should be implemented.
|
|
template<typename EdgeIter>
|
|
static bool edgeTargetsEdgeSource(const void *Node, EdgeIter I) {
|
|
return true;
|
|
}
|
|
|
|
/// getEdgeTarget - If edgeTargetsEdgeSource returns true, this method is
|
|
/// called to determine which outgoing edge of Node is the target of this
|
|
/// edge.
|
|
template<typename EdgeIter>
|
|
static EdgeIter getEdgeTarget(const void *Node, EdgeIter I) {
|
|
SDNode *TargetNode = *I;
|
|
SDNodeIterator NI = SDNodeIterator::begin(TargetNode);
|
|
std::advance(NI, I.getNode()->getOperand(I.getOperand()).getResNo());
|
|
return NI;
|
|
}
|
|
|
|
static std::string getGraphName(const SelectionDAG *G) {
|
|
return G->getMachineFunction().getName();
|
|
}
|
|
|
|
static bool renderGraphFromBottomUp() {
|
|
return true;
|
|
}
|
|
|
|
static std::string getNodeIdentifierLabel(const SDNode *Node,
|
|
const SelectionDAG *Graph) {
|
|
std::string R;
|
|
raw_string_ostream OS(R);
|
|
#ifndef NDEBUG
|
|
OS << 't' << Node->PersistentId;
|
|
#else
|
|
OS << static_cast<const void *>(Node);
|
|
#endif
|
|
return R;
|
|
}
|
|
|
|
/// If you want to override the dot attributes printed for a particular
|
|
/// edge, override this method.
|
|
template<typename EdgeIter>
|
|
static std::string getEdgeAttributes(const void *Node, EdgeIter EI,
|
|
const SelectionDAG *Graph) {
|
|
SDValue Op = EI.getNode()->getOperand(EI.getOperand());
|
|
EVT VT = Op.getValueType();
|
|
if (VT == MVT::Glue)
|
|
return "color=red,style=bold";
|
|
else if (VT == MVT::Other)
|
|
return "color=blue,style=dashed";
|
|
return "";
|
|
}
|
|
|
|
|
|
static std::string getSimpleNodeLabel(const SDNode *Node,
|
|
const SelectionDAG *G) {
|
|
std::string Result = Node->getOperationName(G);
|
|
{
|
|
raw_string_ostream OS(Result);
|
|
Node->print_details(OS, G);
|
|
}
|
|
return Result;
|
|
}
|
|
std::string getNodeLabel(const SDNode *Node, const SelectionDAG *Graph);
|
|
static std::string getNodeAttributes(const SDNode *N,
|
|
const SelectionDAG *Graph) {
|
|
#ifndef NDEBUG
|
|
const std::string &Attrs = Graph->getGraphAttrs(N);
|
|
if (!Attrs.empty()) {
|
|
if (Attrs.find("shape=") == std::string::npos)
|
|
return std::string("shape=Mrecord,") + Attrs;
|
|
else
|
|
return Attrs;
|
|
}
|
|
#endif
|
|
return "shape=Mrecord";
|
|
}
|
|
|
|
static void addCustomGraphFeatures(SelectionDAG *G,
|
|
GraphWriter<SelectionDAG*> &GW) {
|
|
GW.emitSimpleNode(nullptr, "plaintext=circle", "GraphRoot");
|
|
if (G->getRoot().getNode())
|
|
GW.emitEdge(nullptr, -1, G->getRoot().getNode(), G->getRoot().getResNo(),
|
|
"color=blue,style=dashed");
|
|
}
|
|
};
|
|
}
|
|
|
|
std::string DOTGraphTraits<SelectionDAG*>::getNodeLabel(const SDNode *Node,
|
|
const SelectionDAG *G) {
|
|
return DOTGraphTraits<SelectionDAG*>::getSimpleNodeLabel(Node, G);
|
|
}
|
|
|
|
|
|
/// viewGraph - Pop up a ghostview window with the reachable parts of the DAG
|
|
/// rendered using 'dot'.
|
|
///
|
|
void SelectionDAG::viewGraph(const std::string &Title) {
|
|
// This code is only for debugging!
|
|
#ifndef NDEBUG
|
|
ViewGraph(this, "dag." + getMachineFunction().getName(),
|
|
false, Title);
|
|
#else
|
|
errs() << "SelectionDAG::viewGraph is only available in debug builds on "
|
|
<< "systems with Graphviz or gv!\n";
|
|
#endif // NDEBUG
|
|
}
|
|
|
|
// This overload is defined out-of-line here instead of just using a
|
|
// default parameter because this is easiest for gdb to call.
|
|
void SelectionDAG::viewGraph() {
|
|
viewGraph("");
|
|
}
|
|
|
|
/// clearGraphAttrs - Clear all previously defined node graph attributes.
|
|
/// Intended to be used from a debugging tool (eg. gdb).
|
|
void SelectionDAG::clearGraphAttrs() {
|
|
#ifndef NDEBUG
|
|
NodeGraphAttrs.clear();
|
|
#else
|
|
errs() << "SelectionDAG::clearGraphAttrs is only available in debug builds"
|
|
<< " on systems with Graphviz or gv!\n";
|
|
#endif
|
|
}
|
|
|
|
|
|
/// setGraphAttrs - Set graph attributes for a node. (eg. "color=red".)
|
|
///
|
|
void SelectionDAG::setGraphAttrs(const SDNode *N, const char *Attrs) {
|
|
#ifndef NDEBUG
|
|
NodeGraphAttrs[N] = Attrs;
|
|
#else
|
|
errs() << "SelectionDAG::setGraphAttrs is only available in debug builds"
|
|
<< " on systems with Graphviz or gv!\n";
|
|
#endif
|
|
}
|
|
|
|
|
|
/// getGraphAttrs - Get graph attributes for a node. (eg. "color=red".)
|
|
/// Used from getNodeAttributes.
|
|
const std::string SelectionDAG::getGraphAttrs(const SDNode *N) const {
|
|
#ifndef NDEBUG
|
|
std::map<const SDNode *, std::string>::const_iterator I =
|
|
NodeGraphAttrs.find(N);
|
|
|
|
if (I != NodeGraphAttrs.end())
|
|
return I->second;
|
|
else
|
|
return "";
|
|
#else
|
|
errs() << "SelectionDAG::getGraphAttrs is only available in debug builds"
|
|
<< " on systems with Graphviz or gv!\n";
|
|
return std::string();
|
|
#endif
|
|
}
|
|
|
|
/// setGraphColor - Convenience for setting node color attribute.
|
|
///
|
|
void SelectionDAG::setGraphColor(const SDNode *N, const char *Color) {
|
|
#ifndef NDEBUG
|
|
NodeGraphAttrs[N] = std::string("color=") + Color;
|
|
#else
|
|
errs() << "SelectionDAG::setGraphColor is only available in debug builds"
|
|
<< " on systems with Graphviz or gv!\n";
|
|
#endif
|
|
}
|
|
|
|
/// setSubgraphColorHelper - Implement setSubgraphColor. Return
|
|
/// whether we truncated the search.
|
|
///
|
|
bool SelectionDAG::setSubgraphColorHelper(SDNode *N, const char *Color, DenseSet<SDNode *> &visited,
|
|
int level, bool &printed) {
|
|
bool hit_limit = false;
|
|
|
|
#ifndef NDEBUG
|
|
if (level >= 20) {
|
|
if (!printed) {
|
|
printed = true;
|
|
DEBUG(dbgs() << "setSubgraphColor hit max level\n");
|
|
}
|
|
return true;
|
|
}
|
|
|
|
unsigned oldSize = visited.size();
|
|
visited.insert(N);
|
|
if (visited.size() != oldSize) {
|
|
setGraphColor(N, Color);
|
|
for(SDNodeIterator i = SDNodeIterator::begin(N), iend = SDNodeIterator::end(N);
|
|
i != iend;
|
|
++i) {
|
|
hit_limit = setSubgraphColorHelper(*i, Color, visited, level+1, printed) || hit_limit;
|
|
}
|
|
}
|
|
#else
|
|
errs() << "SelectionDAG::setSubgraphColor is only available in debug builds"
|
|
<< " on systems with Graphviz or gv!\n";
|
|
#endif
|
|
return hit_limit;
|
|
}
|
|
|
|
/// setSubgraphColor - Convenience for setting subgraph color attribute.
|
|
///
|
|
void SelectionDAG::setSubgraphColor(SDNode *N, const char *Color) {
|
|
#ifndef NDEBUG
|
|
DenseSet<SDNode *> visited;
|
|
bool printed = false;
|
|
if (setSubgraphColorHelper(N, Color, visited, 0, printed)) {
|
|
// Visually mark that we hit the limit
|
|
if (strcmp(Color, "red") == 0) {
|
|
setSubgraphColorHelper(N, "blue", visited, 0, printed);
|
|
} else if (strcmp(Color, "yellow") == 0) {
|
|
setSubgraphColorHelper(N, "green", visited, 0, printed);
|
|
}
|
|
}
|
|
|
|
#else
|
|
errs() << "SelectionDAG::setSubgraphColor is only available in debug builds"
|
|
<< " on systems with Graphviz or gv!\n";
|
|
#endif
|
|
}
|
|
|
|
std::string ScheduleDAGSDNodes::getGraphNodeLabel(const SUnit *SU) const {
|
|
std::string s;
|
|
raw_string_ostream O(s);
|
|
O << "SU(" << SU->NodeNum << "): ";
|
|
if (SU->getNode()) {
|
|
SmallVector<SDNode *, 4> GluedNodes;
|
|
for (SDNode *N = SU->getNode(); N; N = N->getGluedNode())
|
|
GluedNodes.push_back(N);
|
|
while (!GluedNodes.empty()) {
|
|
O << DOTGraphTraits<SelectionDAG*>
|
|
::getSimpleNodeLabel(GluedNodes.back(), DAG);
|
|
GluedNodes.pop_back();
|
|
if (!GluedNodes.empty())
|
|
O << "\n ";
|
|
}
|
|
} else {
|
|
O << "CROSS RC COPY";
|
|
}
|
|
return O.str();
|
|
}
|
|
|
|
void ScheduleDAGSDNodes::getCustomGraphFeatures(GraphWriter<ScheduleDAG*> &GW) const {
|
|
if (DAG) {
|
|
// Draw a special "GraphRoot" node to indicate the root of the graph.
|
|
GW.emitSimpleNode(nullptr, "plaintext=circle", "GraphRoot");
|
|
const SDNode *N = DAG->getRoot().getNode();
|
|
if (N && N->getNodeId() != -1)
|
|
GW.emitEdge(nullptr, -1, &SUnits[N->getNodeId()], -1,
|
|
"color=blue,style=dashed");
|
|
}
|
|
}
|