Chris Lattner | 6632848 | 2005-01-10 23:08:40 +0000 | [diff] [blame] | 1 | //===-- SelectionDAGPrinter.cpp - Implement SelectionDAG::viewGraph() -----===// |
Misha Brukman | edf128a | 2005-04-21 22:36:52 +0000 | [diff] [blame] | 2 | // |
Chris Lattner | 6632848 | 2005-01-10 23:08:40 +0000 | [diff] [blame] | 3 | // The LLVM Compiler Infrastructure |
| 4 | // |
Chris Lattner | 4ee451d | 2007-12-29 20:36:04 +0000 | [diff] [blame] | 5 | // This file is distributed under the University of Illinois Open Source |
| 6 | // License. See LICENSE.TXT for details. |
Misha Brukman | edf128a | 2005-04-21 22:36:52 +0000 | [diff] [blame] | 7 | // |
Chris Lattner | 6632848 | 2005-01-10 23:08:40 +0000 | [diff] [blame] | 8 | //===----------------------------------------------------------------------===// |
| 9 | // |
| 10 | // This implements the SelectionDAG::viewGraph method. |
| 11 | // |
| 12 | //===----------------------------------------------------------------------===// |
| 13 | |
Dan Gohman | 84fbac5 | 2009-02-06 17:22:58 +0000 | [diff] [blame] | 14 | #include "ScheduleDAGSDNodes.h" |
Chris Lattner | 5839bf2 | 2005-08-26 17:15:30 +0000 | [diff] [blame] | 15 | #include "llvm/Constants.h" |
| 16 | #include "llvm/Function.h" |
Chris Lattner | 5267651 | 2006-03-05 09:38:03 +0000 | [diff] [blame] | 17 | #include "llvm/Assembly/Writer.h" |
Chris Lattner | 6632848 | 2005-01-10 23:08:40 +0000 | [diff] [blame] | 18 | #include "llvm/CodeGen/SelectionDAG.h" |
Evan Cheng | d6594ae | 2006-09-12 21:00:35 +0000 | [diff] [blame] | 19 | #include "llvm/CodeGen/MachineConstantPool.h" |
Chris Lattner | 6632848 | 2005-01-10 23:08:40 +0000 | [diff] [blame] | 20 | #include "llvm/CodeGen/MachineFunction.h" |
Bill Wendling | 10fff60 | 2008-07-03 22:53:42 +0000 | [diff] [blame] | 21 | #include "llvm/CodeGen/MachineModuleInfo.h" |
Dan Gohman | dc5f936 | 2008-07-17 21:12:16 +0000 | [diff] [blame] | 22 | #include "llvm/CodeGen/PseudoSourceValue.h" |
Devang Patel | 83489bb | 2009-01-13 00:35:13 +0000 | [diff] [blame] | 23 | #include "llvm/Analysis/DebugInfo.h" |
Dan Gohman | 6f0d024 | 2008-02-10 18:45:23 +0000 | [diff] [blame] | 24 | #include "llvm/Target/TargetRegisterInfo.h" |
Chris Lattner | 7228aa7 | 2005-08-19 21:21:16 +0000 | [diff] [blame] | 25 | #include "llvm/Target/TargetMachine.h" |
David Greene | c5e7e8d | 2008-10-27 18:17:03 +0000 | [diff] [blame] | 26 | #include "llvm/Support/Debug.h" |
Chris Lattner | 6632848 | 2005-01-10 23:08:40 +0000 | [diff] [blame] | 27 | #include "llvm/Support/GraphWriter.h" |
Chris Lattner | 62ca325 | 2008-08-23 22:53:13 +0000 | [diff] [blame] | 28 | #include "llvm/Support/raw_ostream.h" |
David Greene | c5e7e8d | 2008-10-27 18:17:03 +0000 | [diff] [blame] | 29 | #include "llvm/ADT/DenseSet.h" |
Chris Lattner | e9c44cd | 2005-01-11 00:34:33 +0000 | [diff] [blame] | 30 | #include "llvm/ADT/StringExtras.h" |
Chris Lattner | 6e741f8 | 2005-07-15 22:48:31 +0000 | [diff] [blame] | 31 | #include "llvm/Config/config.h" |
Chris Lattner | 6632848 | 2005-01-10 23:08:40 +0000 | [diff] [blame] | 32 | #include <fstream> |
| 33 | using namespace llvm; |
| 34 | |
Chris Lattner | e0646b8 | 2005-01-10 23:26:00 +0000 | [diff] [blame] | 35 | namespace llvm { |
| 36 | template<> |
| 37 | struct DOTGraphTraits<SelectionDAG*> : public DefaultDOTGraphTraits { |
Dan Gohman | 3580331 | 2008-07-21 21:06:55 +0000 | [diff] [blame] | 38 | static bool hasEdgeDestLabels() { |
| 39 | return true; |
| 40 | } |
| 41 | |
| 42 | static unsigned numEdgeDestLabels(const void *Node) { |
| 43 | return ((const SDNode *) Node)->getNumValues(); |
| 44 | } |
| 45 | |
| 46 | static std::string getEdgeDestLabel(const void *Node, unsigned i) { |
Owen Anderson | e50ed30 | 2009-08-10 22:56:29 +0000 | [diff] [blame] | 47 | return ((const SDNode *) Node)->getValueType(i).getEVTString(); |
Dan Gohman | 3580331 | 2008-07-21 21:06:55 +0000 | [diff] [blame] | 48 | } |
| 49 | |
| 50 | /// edgeTargetsEdgeSource - This method returns true if this outgoing edge |
| 51 | /// should actually target another edge source, not a node. If this method is |
| 52 | /// implemented, getEdgeTarget should be implemented. |
| 53 | template<typename EdgeIter> |
| 54 | static bool edgeTargetsEdgeSource(const void *Node, EdgeIter I) { |
| 55 | return true; |
| 56 | } |
| 57 | |
| 58 | /// getEdgeTarget - If edgeTargetsEdgeSource returns true, this method is |
| 59 | /// called to determine which outgoing edge of Node is the target of this |
| 60 | /// edge. |
| 61 | template<typename EdgeIter> |
| 62 | static EdgeIter getEdgeTarget(const void *Node, EdgeIter I) { |
| 63 | SDNode *TargetNode = *I; |
| 64 | SDNodeIterator NI = SDNodeIterator::begin(TargetNode); |
Gabor Greif | 99a6cb9 | 2008-08-26 22:36:50 +0000 | [diff] [blame] | 65 | std::advance(NI, I.getNode()->getOperand(I.getOperand()).getResNo()); |
Dan Gohman | 3580331 | 2008-07-21 21:06:55 +0000 | [diff] [blame] | 66 | return NI; |
| 67 | } |
| 68 | |
Chris Lattner | e0646b8 | 2005-01-10 23:26:00 +0000 | [diff] [blame] | 69 | static std::string getGraphName(const SelectionDAG *G) { |
| 70 | return G->getMachineFunction().getFunction()->getName(); |
| 71 | } |
Chris Lattner | e9c44cd | 2005-01-11 00:34:33 +0000 | [diff] [blame] | 72 | |
| 73 | static bool renderGraphFromBottomUp() { |
| 74 | return true; |
Chris Lattner | e0646b8 | 2005-01-10 23:26:00 +0000 | [diff] [blame] | 75 | } |
Chris Lattner | 37345fe | 2005-10-01 00:17:07 +0000 | [diff] [blame] | 76 | |
| 77 | static bool hasNodeAddressLabel(const SDNode *Node, |
| 78 | const SelectionDAG *Graph) { |
| 79 | return true; |
| 80 | } |
Chris Lattner | 34ab4d4 | 2006-10-20 18:06:09 +0000 | [diff] [blame] | 81 | |
| 82 | /// If you want to override the dot attributes printed for a particular |
| 83 | /// edge, override this method. |
| 84 | template<typename EdgeIter> |
| 85 | static std::string getEdgeAttributes(const void *Node, EdgeIter EI) { |
Dan Gohman | 475871a | 2008-07-27 21:46:04 +0000 | [diff] [blame] | 86 | SDValue Op = EI.getNode()->getOperand(EI.getOperand()); |
Owen Anderson | e50ed30 | 2009-08-10 22:56:29 +0000 | [diff] [blame] | 87 | EVT VT = Op.getValueType(); |
Owen Anderson | 825b72b | 2009-08-11 20:47:22 +0000 | [diff] [blame^] | 88 | if (VT == MVT::Flag) |
Chris Lattner | 34ab4d4 | 2006-10-20 18:06:09 +0000 | [diff] [blame] | 89 | return "color=red,style=bold"; |
Owen Anderson | 825b72b | 2009-08-11 20:47:22 +0000 | [diff] [blame^] | 90 | else if (VT == MVT::Other) |
Dan Gohman | 7a0a4fc | 2007-06-18 15:30:16 +0000 | [diff] [blame] | 91 | return "color=blue,style=dashed"; |
Chris Lattner | 34ab4d4 | 2006-10-20 18:06:09 +0000 | [diff] [blame] | 92 | return ""; |
| 93 | } |
| 94 | |
Chris Lattner | e0646b8 | 2005-01-10 23:26:00 +0000 | [diff] [blame] | 95 | |
Chris Lattner | e9c44cd | 2005-01-11 00:34:33 +0000 | [diff] [blame] | 96 | static std::string getNodeLabel(const SDNode *Node, |
Owen Anderson | 8cbc94a | 2009-06-24 17:37:09 +0000 | [diff] [blame] | 97 | const SelectionDAG *Graph, |
| 98 | bool ShortNames); |
Jim Laskey | ec20402 | 2006-10-02 12:26:53 +0000 | [diff] [blame] | 99 | static std::string getNodeAttributes(const SDNode *N, |
| 100 | const SelectionDAG *Graph) { |
| 101 | #ifndef NDEBUG |
| 102 | const std::string &Attrs = Graph->getGraphAttrs(N); |
| 103 | if (!Attrs.empty()) { |
| 104 | if (Attrs.find("shape=") == std::string::npos) |
| 105 | return std::string("shape=Mrecord,") + Attrs; |
| 106 | else |
| 107 | return Attrs; |
| 108 | } |
| 109 | #endif |
Chris Lattner | e0646b8 | 2005-01-10 23:26:00 +0000 | [diff] [blame] | 110 | return "shape=Mrecord"; |
| 111 | } |
Chris Lattner | fc08d9c | 2005-01-10 23:52:04 +0000 | [diff] [blame] | 112 | |
| 113 | static void addCustomGraphFeatures(SelectionDAG *G, |
| 114 | GraphWriter<SelectionDAG*> &GW) { |
| 115 | GW.emitSimpleNode(0, "plaintext=circle", "GraphRoot"); |
Gabor Greif | ba36cb5 | 2008-08-28 21:40:38 +0000 | [diff] [blame] | 116 | if (G->getRoot().getNode()) |
| 117 | GW.emitEdge(0, -1, G->getRoot().getNode(), G->getRoot().getResNo(), |
Dan Gohman | 694caf5 | 2008-07-22 17:52:59 +0000 | [diff] [blame] | 118 | "color=blue,style=dashed"); |
Chris Lattner | fc08d9c | 2005-01-10 23:52:04 +0000 | [diff] [blame] | 119 | } |
Chris Lattner | e0646b8 | 2005-01-10 23:26:00 +0000 | [diff] [blame] | 120 | }; |
| 121 | } |
| 122 | |
Chris Lattner | e9c44cd | 2005-01-11 00:34:33 +0000 | [diff] [blame] | 123 | std::string DOTGraphTraits<SelectionDAG*>::getNodeLabel(const SDNode *Node, |
Owen Anderson | 8cbc94a | 2009-06-24 17:37:09 +0000 | [diff] [blame] | 124 | const SelectionDAG *G, |
| 125 | bool ShortNames) { |
Chris Lattner | d212bb8 | 2009-06-26 19:06:10 +0000 | [diff] [blame] | 126 | std::string Result = Node->getOperationName(G); |
| 127 | { |
| 128 | raw_string_ostream OS(Result); |
| 129 | Node->print_details(OS, G); |
Chris Lattner | e9c44cd | 2005-01-11 00:34:33 +0000 | [diff] [blame] | 130 | } |
Chris Lattner | d212bb8 | 2009-06-26 19:06:10 +0000 | [diff] [blame] | 131 | return Result; |
Chris Lattner | e9c44cd | 2005-01-11 00:34:33 +0000 | [diff] [blame] | 132 | } |
Misha Brukman | edf128a | 2005-04-21 22:36:52 +0000 | [diff] [blame] | 133 | |
Chris Lattner | e9c44cd | 2005-01-11 00:34:33 +0000 | [diff] [blame] | 134 | |
Chris Lattner | 6632848 | 2005-01-10 23:08:40 +0000 | [diff] [blame] | 135 | /// viewGraph - Pop up a ghostview window with the reachable parts of the DAG |
| 136 | /// rendered using 'dot'. |
| 137 | /// |
Dan Gohman | 462dc7f | 2008-07-21 20:00:07 +0000 | [diff] [blame] | 138 | void SelectionDAG::viewGraph(const std::string &Title) { |
Chris Lattner | e388b5e | 2005-07-14 05:17:43 +0000 | [diff] [blame] | 139 | // This code is only for debugging! |
Chris Lattner | c5f44ad | 2005-07-14 05:33:13 +0000 | [diff] [blame] | 140 | #ifndef NDEBUG |
Daniel Dunbar | f6ccee5 | 2009-07-24 08:24:36 +0000 | [diff] [blame] | 141 | ViewGraph(this, "dag." + getMachineFunction().getFunction()->getNameStr(), |
| 142 | false, Title); |
Reid Spencer | 9d5b532 | 2006-06-27 16:49:46 +0000 | [diff] [blame] | 143 | #else |
Bill Wendling | 832171c | 2006-12-07 20:04:42 +0000 | [diff] [blame] | 144 | cerr << "SelectionDAG::viewGraph is only available in debug builds on " |
| 145 | << "systems with Graphviz or gv!\n"; |
Reid Spencer | 9d5b532 | 2006-06-27 16:49:46 +0000 | [diff] [blame] | 146 | #endif // NDEBUG |
Chris Lattner | 6632848 | 2005-01-10 23:08:40 +0000 | [diff] [blame] | 147 | } |
Jim Laskey | ec20402 | 2006-10-02 12:26:53 +0000 | [diff] [blame] | 148 | |
Dan Gohman | 0b12aef | 2008-07-30 18:48:53 +0000 | [diff] [blame] | 149 | // This overload is defined out-of-line here instead of just using a |
| 150 | // default parameter because this is easiest for gdb to call. |
| 151 | void SelectionDAG::viewGraph() { |
| 152 | viewGraph(""); |
| 153 | } |
Jim Laskey | ec20402 | 2006-10-02 12:26:53 +0000 | [diff] [blame] | 154 | |
| 155 | /// clearGraphAttrs - Clear all previously defined node graph attributes. |
| 156 | /// Intended to be used from a debugging tool (eg. gdb). |
| 157 | void SelectionDAG::clearGraphAttrs() { |
| 158 | #ifndef NDEBUG |
| 159 | NodeGraphAttrs.clear(); |
| 160 | #else |
Bill Wendling | 832171c | 2006-12-07 20:04:42 +0000 | [diff] [blame] | 161 | cerr << "SelectionDAG::clearGraphAttrs is only available in debug builds" |
| 162 | << " on systems with Graphviz or gv!\n"; |
Jim Laskey | ec20402 | 2006-10-02 12:26:53 +0000 | [diff] [blame] | 163 | #endif |
| 164 | } |
| 165 | |
| 166 | |
| 167 | /// setGraphAttrs - Set graph attributes for a node. (eg. "color=red".) |
| 168 | /// |
| 169 | void SelectionDAG::setGraphAttrs(const SDNode *N, const char *Attrs) { |
| 170 | #ifndef NDEBUG |
| 171 | NodeGraphAttrs[N] = Attrs; |
| 172 | #else |
Bill Wendling | 832171c | 2006-12-07 20:04:42 +0000 | [diff] [blame] | 173 | cerr << "SelectionDAG::setGraphAttrs is only available in debug builds" |
| 174 | << " on systems with Graphviz or gv!\n"; |
Jim Laskey | ec20402 | 2006-10-02 12:26:53 +0000 | [diff] [blame] | 175 | #endif |
| 176 | } |
| 177 | |
| 178 | |
| 179 | /// getGraphAttrs - Get graph attributes for a node. (eg. "color=red".) |
| 180 | /// Used from getNodeAttributes. |
| 181 | const std::string SelectionDAG::getGraphAttrs(const SDNode *N) const { |
| 182 | #ifndef NDEBUG |
| 183 | std::map<const SDNode *, std::string>::const_iterator I = |
| 184 | NodeGraphAttrs.find(N); |
| 185 | |
| 186 | if (I != NodeGraphAttrs.end()) |
| 187 | return I->second; |
| 188 | else |
| 189 | return ""; |
| 190 | #else |
Bill Wendling | 832171c | 2006-12-07 20:04:42 +0000 | [diff] [blame] | 191 | cerr << "SelectionDAG::getGraphAttrs is only available in debug builds" |
| 192 | << " on systems with Graphviz or gv!\n"; |
Jim Laskey | ec20402 | 2006-10-02 12:26:53 +0000 | [diff] [blame] | 193 | return std::string(""); |
| 194 | #endif |
| 195 | } |
| 196 | |
| 197 | /// setGraphColor - Convenience for setting node color attribute. |
| 198 | /// |
| 199 | void SelectionDAG::setGraphColor(const SDNode *N, const char *Color) { |
| 200 | #ifndef NDEBUG |
| 201 | NodeGraphAttrs[N] = std::string("color=") + Color; |
| 202 | #else |
Bill Wendling | 832171c | 2006-12-07 20:04:42 +0000 | [diff] [blame] | 203 | cerr << "SelectionDAG::setGraphColor is only available in debug builds" |
| 204 | << " on systems with Graphviz or gv!\n"; |
Jim Laskey | ec20402 | 2006-10-02 12:26:53 +0000 | [diff] [blame] | 205 | #endif |
| 206 | } |
| 207 | |
David Greene | c5e7e8d | 2008-10-27 18:17:03 +0000 | [diff] [blame] | 208 | /// setSubgraphColorHelper - Implement setSubgraphColor. Return |
| 209 | /// whether we truncated the search. |
| 210 | /// |
| 211 | bool SelectionDAG::setSubgraphColorHelper(SDNode *N, const char *Color, DenseSet<SDNode *> &visited, |
| 212 | int level, bool &printed) { |
| 213 | bool hit_limit = false; |
| 214 | |
| 215 | #ifndef NDEBUG |
| 216 | if (level >= 20) { |
| 217 | if (!printed) { |
| 218 | printed = true; |
| 219 | DOUT << "setSubgraphColor hit max level\n"; |
| 220 | } |
| 221 | return true; |
| 222 | } |
| 223 | |
| 224 | unsigned oldSize = visited.size(); |
| 225 | visited.insert(N); |
| 226 | if (visited.size() != oldSize) { |
| 227 | setGraphColor(N, Color); |
| 228 | for(SDNodeIterator i = SDNodeIterator::begin(N), iend = SDNodeIterator::end(N); |
| 229 | i != iend; |
| 230 | ++i) { |
| 231 | hit_limit = setSubgraphColorHelper(*i, Color, visited, level+1, printed) || hit_limit; |
| 232 | } |
| 233 | } |
| 234 | #else |
| 235 | cerr << "SelectionDAG::setSubgraphColor is only available in debug builds" |
| 236 | << " on systems with Graphviz or gv!\n"; |
| 237 | #endif |
| 238 | return hit_limit; |
| 239 | } |
| 240 | |
| 241 | /// setSubgraphColor - Convenience for setting subgraph color attribute. |
| 242 | /// |
| 243 | void SelectionDAG::setSubgraphColor(SDNode *N, const char *Color) { |
| 244 | #ifndef NDEBUG |
| 245 | DenseSet<SDNode *> visited; |
| 246 | bool printed = false; |
| 247 | if (setSubgraphColorHelper(N, Color, visited, 0, printed)) { |
| 248 | // Visually mark that we hit the limit |
Ted Kremenek | 8e7fa91 | 2008-10-27 22:43:07 +0000 | [diff] [blame] | 249 | if (strcmp(Color, "red") == 0) { |
David Greene | c5e7e8d | 2008-10-27 18:17:03 +0000 | [diff] [blame] | 250 | setSubgraphColorHelper(N, "blue", visited, 0, printed); |
| 251 | } |
Ted Kremenek | 8e7fa91 | 2008-10-27 22:43:07 +0000 | [diff] [blame] | 252 | else if (strcmp(Color, "yellow") == 0) { |
David Greene | c5e7e8d | 2008-10-27 18:17:03 +0000 | [diff] [blame] | 253 | setSubgraphColorHelper(N, "green", visited, 0, printed); |
| 254 | } |
| 255 | } |
| 256 | |
| 257 | #else |
| 258 | cerr << "SelectionDAG::setSubgraphColor is only available in debug builds" |
| 259 | << " on systems with Graphviz or gv!\n"; |
| 260 | #endif |
| 261 | } |
| 262 | |
Dan Gohman | 343f0c0 | 2008-11-19 23:18:57 +0000 | [diff] [blame] | 263 | std::string ScheduleDAGSDNodes::getGraphNodeLabel(const SUnit *SU) const { |
Dan Gohman | 7d1cd3f | 2008-11-19 22:09:45 +0000 | [diff] [blame] | 264 | std::string s; |
| 265 | raw_string_ostream O(s); |
| 266 | O << "SU(" << SU->NodeNum << "): "; |
| 267 | if (SU->getNode()) { |
| 268 | SmallVector<SDNode *, 4> FlaggedNodes; |
| 269 | for (SDNode *N = SU->getNode(); N; N = N->getFlaggedNode()) |
| 270 | FlaggedNodes.push_back(N); |
| 271 | while (!FlaggedNodes.empty()) { |
Owen Anderson | 8cbc94a | 2009-06-24 17:37:09 +0000 | [diff] [blame] | 272 | O << DOTGraphTraits<SelectionDAG*>::getNodeLabel(FlaggedNodes.back(), |
| 273 | DAG, false); |
Dan Gohman | 7d1cd3f | 2008-11-19 22:09:45 +0000 | [diff] [blame] | 274 | FlaggedNodes.pop_back(); |
| 275 | if (!FlaggedNodes.empty()) |
| 276 | O << "\n "; |
| 277 | } |
| 278 | } else { |
| 279 | O << "CROSS RC COPY"; |
| 280 | } |
| 281 | return O.str(); |
| 282 | } |
Dan Gohman | 3e1a7ae | 2007-08-28 20:32:58 +0000 | [diff] [blame] | 283 | |
Dan Gohman | 343f0c0 | 2008-11-19 23:18:57 +0000 | [diff] [blame] | 284 | void ScheduleDAGSDNodes::getCustomGraphFeatures(GraphWriter<ScheduleDAG*> &GW) const { |
| 285 | if (DAG) { |
| 286 | // Draw a special "GraphRoot" node to indicate the root of the graph. |
| 287 | GW.emitSimpleNode(0, "plaintext=circle", "GraphRoot"); |
| 288 | const SDNode *N = DAG->getRoot().getNode(); |
| 289 | if (N && N->getNodeId() != -1) |
| 290 | GW.emitEdge(0, -1, &SUnits[N->getNodeId()], -1, |
| 291 | "color=blue,style=dashed"); |
| 292 | } |
Dan Gohman | 3e1a7ae | 2007-08-28 20:32:58 +0000 | [diff] [blame] | 293 | } |