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