You can not select more than 25 topics Topics must start with a chinese character,a letter or number, can include dashes ('-') and can be up to 35 characters long.

draw.cc 18 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655
  1. /**
  2. * Copyright 2019-2020 Huawei Technologies Co., Ltd
  3. *
  4. * Licensed under the Apache License, Version 2.0 (the "License");
  5. * you may not use this file except in compliance with the License.
  6. * You may obtain a copy of the License at
  7. *
  8. * http://www.apache.org/licenses/LICENSE-2.0
  9. *
  10. * Unless required by applicable law or agreed to in writing, software
  11. * distributed under the License is distributed on an "AS IS" BASIS,
  12. * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  13. * See the License for the specific language governing permissions and
  14. * limitations under the License.
  15. */
  16. #include "debug/draw.h"
  17. #include <algorithm>
  18. #include <iostream>
  19. #include <iterator>
  20. #include <vector>
  21. #include <string>
  22. #include "ir/meta_func_graph.h"
  23. #include "ir/param_info.h"
  24. #include "ir/primitive.h"
  25. #include "ir/graph_utils.h"
  26. #include "utils/utils.h"
  27. #include "frontend/operator/composite/composite.h"
  28. #include "pipeline/jit/parse/resolve.h"
  29. #include "ir/tensor.h"
  30. #include "pipeline/jit/base.h"
  31. namespace mindspore {
  32. // namespace to support debug utils
  33. namespace draw {
  34. namespace {
  35. // Only for ValueNode
  36. std::string ValueType(const ValueNodePtr &node) {
  37. if (node == nullptr) {
  38. return "";
  39. }
  40. auto v = node->value();
  41. return v->type_name();
  42. }
  43. std::string ReplaceSpecialChar(const std::string &str) {
  44. std::ostringstream oss;
  45. for (size_t i = 0; i < str.size(); i++) {
  46. if (str[i] == '<') {
  47. oss << "「";
  48. } else if (str[i] == '>') {
  49. oss << "」";
  50. } else {
  51. oss << str[i];
  52. }
  53. }
  54. return oss.str();
  55. }
  56. } // namespace
  57. // API of debug utils
  58. void DrawNodes(const std::vector<AnfNodePtr> &nodes, OrderedMap<FuncGraphPtr, std::shared_ptr<BaseDigraph>> *sub_graphs,
  59. bool is_user) {
  60. if (sub_graphs == nullptr) {
  61. return;
  62. }
  63. for (auto &nd : nodes) {
  64. MS_EXCEPTION_IF_NULL(nd);
  65. auto sub_graph = nd->func_graph();
  66. if (sub_graph != nullptr) {
  67. auto gsub = (*sub_graphs)[sub_graph];
  68. if (gsub == nullptr) {
  69. if (is_user) {
  70. gsub = std::make_shared<ModelDigraph>(sub_graph->ToString());
  71. } else {
  72. gsub = std::make_shared<Digraph>(sub_graph->ToString());
  73. }
  74. (*sub_graphs)[sub_graph] = gsub;
  75. }
  76. if (!nd->isa<Parameter>()) {
  77. gsub->Node(nd);
  78. }
  79. }
  80. }
  81. }
  82. void DrawValueNodes(const std::vector<AnfNodePtr> &nodes,
  83. OrderedMap<FuncGraphPtr, std::shared_ptr<BaseDigraph>> *sub_graphs) {
  84. if (sub_graphs == nullptr) {
  85. return;
  86. }
  87. int dup_idx = 0;
  88. for (auto &nd : nodes) {
  89. for (auto &t : SuccIncoming(nd)) {
  90. MS_EXCEPTION_IF_NULL(t);
  91. MS_EXCEPTION_IF_NULL(nd);
  92. if (t->isa<ValueNode>() && (*sub_graphs).find(nd->func_graph()) != (*sub_graphs).end()) {
  93. (*sub_graphs)[nd->func_graph()]->Node(t, dup_idx);
  94. dup_idx++;
  95. } else if (t->isa<Parameter>() && (*sub_graphs).find(t->func_graph()) != (*sub_graphs).end()) {
  96. (*sub_graphs)[t->func_graph()]->Node(t, dup_idx);
  97. dup_idx++;
  98. }
  99. }
  100. }
  101. }
  102. void DrawEdges(const std::vector<AnfNodePtr> &nodes, const std::shared_ptr<BaseDigraph> &digraph, bool is_user) {
  103. if (digraph == nullptr) {
  104. return;
  105. }
  106. int dup_idx = 0;
  107. int offset = 0;
  108. if (is_user) {
  109. offset = 1;
  110. }
  111. // Draw edge
  112. for (auto &nd : nodes) {
  113. auto succs = SuccIncoming(nd);
  114. auto num = succs.size();
  115. for (size_t i = 0; i < num; i++) {
  116. auto &t = succs.at(i);
  117. MS_EXCEPTION_IF_NULL(t);
  118. if (t->isa<ValueNode>() || t->isa<Parameter>()) {
  119. if ((!is_user) || (i != 0)) {
  120. // `SizeToInt(i) - offset` is just for printing as text
  121. digraph->Edge(t, nd, SizeToInt(i) - offset, dup_idx);
  122. }
  123. if (IsValueNode<FuncGraph>(t)) {
  124. auto const_graph = GetValueNode<FuncGraphPtr>(t);
  125. digraph->Edge(t, const_graph, dup_idx);
  126. }
  127. dup_idx++;
  128. } else {
  129. digraph->Edge(t, nd, SizeToInt(i) - offset);
  130. }
  131. }
  132. }
  133. }
  134. void DrawByOpt(std::string filename, const FuncGraphPtr &func_graph, bool is_user) {
  135. if (func_graph == nullptr) {
  136. return;
  137. }
  138. auto ret = func_graph->get_return();
  139. auto nodes = DeepScopedGraphSearch(ret);
  140. std::shared_ptr<BaseDigraph> digraph;
  141. OrderedMap<FuncGraphPtr, std::shared_ptr<BaseDigraph>> sub_graphs;
  142. ChangeFileMode(filename, S_IRWXU);
  143. if (is_user) {
  144. digraph = std::make_shared<ModelDigraph>("mindspore", filename);
  145. } else {
  146. digraph = std::make_shared<Digraph>("mindspore", filename);
  147. }
  148. MS_EXCEPTION_IF_NULL(digraph);
  149. digraph->Start();
  150. // Draw nodes
  151. DrawNodes(nodes, &sub_graphs, is_user);
  152. // Draw ValueNodes on CNodes
  153. DrawValueNodes(nodes, &sub_graphs);
  154. // Draw subgraph
  155. for (const auto &gsub : sub_graphs) {
  156. digraph->SubGraph(gsub.first, gsub.second);
  157. }
  158. // Draw edge
  159. DrawEdges(nodes, digraph, is_user);
  160. digraph->End();
  161. // set file mode to read only by user
  162. ChangeFileMode(filename, S_IRUSR);
  163. }
  164. #ifdef ENABLE_DUMP_IR
  165. void Draw(const std::string &filename, const FuncGraphPtr &func_graph) {
  166. const std::string dot_suffix = ".dot";
  167. std::string filename_with_suffix =
  168. (filename.rfind(dot_suffix) != (filename.size() - dot_suffix.size())) ? (filename + dot_suffix) : filename;
  169. DrawByOpt(pipeline::GetSaveGraphsPathName(filename_with_suffix), func_graph, false);
  170. }
  171. void DrawUserFuncGraph(const std::string &filename, const FuncGraphPtr &func_graph) {
  172. DrawByOpt(pipeline::GetSaveGraphsPathName(filename), func_graph, true);
  173. }
  174. #else
  175. void Draw(const std::string &, const FuncGraphPtr &) {
  176. static bool already_printed = false;
  177. if (already_printed) {
  178. return;
  179. }
  180. already_printed = true;
  181. MS_LOG(WARNING) << "The functionality of dumping function graph IR in graphviz dot format is disabled, "
  182. << "please recompile source to enable it. See help of building script.";
  183. }
  184. void DrawUserFuncGraph(const std::string &, const FuncGraphPtr &) {
  185. static bool already_printed = false;
  186. if (already_printed) {
  187. return;
  188. }
  189. already_printed = true;
  190. MS_LOG(WARNING) << "The functionality of dumping function graph IR in graphviz dot format is disabled, "
  191. << "please recompile source to enable it. See help of building script.";
  192. }
  193. #endif
  194. std::string Graphviz::Shape(AnfNodePtr node) {
  195. if (node == nullptr) {
  196. return "";
  197. }
  198. if (node->isa<CNode>()) {
  199. return "plaintext";
  200. }
  201. if (node->isa<Parameter>()) {
  202. return "octagon";
  203. }
  204. if (IsValueNode<FuncGraph>(node)) {
  205. return "oval";
  206. }
  207. return "plaintext";
  208. }
  209. std::string Graphviz::Color(const AnfNodePtr &node) {
  210. if (node == nullptr) {
  211. return "";
  212. }
  213. if (node->isa<CNode>()) {
  214. return "cornsilk";
  215. }
  216. if (node->isa<Parameter>()) {
  217. return "paleturquoise";
  218. }
  219. if (IsValueNode<FuncGraph>(node)) {
  220. return "palegreen";
  221. }
  222. return "lavender";
  223. }
  224. void BaseDigraph::Start() {
  225. buffer_ << "digraph " << name_ << " {" << std::endl;
  226. buffer_ << "compound=true" << std::endl;
  227. }
  228. void BaseDigraph::Head(const AnfNodePtr &node, int id) {
  229. if (node == nullptr) {
  230. return;
  231. }
  232. buffer_ << "node" << node << "_" << id;
  233. if (node->isa<CNode>() || (node->isa<ValueNode>() && !IsValueNode<FuncGraph>(node))) {
  234. buffer_ << ":core";
  235. }
  236. }
  237. void BaseDigraph::Tail(const AnfNodePtr &node, int idx, int id) {
  238. if (node == nullptr) {
  239. return;
  240. }
  241. buffer_ << "node" << node << "_" << id;
  242. buffer_ << ":" << idx;
  243. }
  244. void BaseDigraph::Tail(const FuncGraphPtr &func_graph) {
  245. if (func_graph == nullptr) {
  246. return;
  247. }
  248. buffer_ << "node" << func_graph->get_return() << "_" << 0;
  249. }
  250. void BaseDigraph::Edge(AnfNodePtr start, FuncGraphPtr end, int id_start) {
  251. Head(start, id_start);
  252. buffer_ << "->";
  253. Tail(end);
  254. buffer_ << "[lhead=cluster_" << end;
  255. buffer_ << ",dir=both,arrowhead=dot,style=filled,color=blue]";
  256. buffer_ << std::endl;
  257. }
  258. void BaseDigraph::End() {
  259. buffer_ << "}" << std::endl;
  260. if (fout_.is_open()) {
  261. fout_ << buffer_.str();
  262. }
  263. }
  264. void BaseDigraph::FuncGraphParameters(const FuncGraphPtr &key) {
  265. buffer_ << "parameters_" << key << "[shape=plaintext ";
  266. buffer_ << "label=<<table bgcolor='paleturquoise' cellspacing='0' cellborder='1' border='0'>";
  267. buffer_ << "<tr><td>parameters</td></tr>";
  268. int count = 0;
  269. for (auto &parameter : key->parameters()) {
  270. buffer_ << "<tr><td>";
  271. buffer_ << parameter->ToString();
  272. auto param = parameter->cast<ParameterPtr>();
  273. if (param->has_default()) {
  274. auto tensor_v = param->default_param();
  275. if (tensor_v && tensor_v->isa<tensor::Tensor>()) {
  276. auto tensor = tensor_v->cast<tensor::TensorPtr>();
  277. auto &shape = tensor->shape();
  278. std::ostringstream shape_str;
  279. std::copy(shape.begin(), shape.end(), std::ostream_iterator<int>(shape_str, ","));
  280. buffer_ << "[" << shape_str.str() << "]";
  281. }
  282. }
  283. buffer_ << "</td></tr>";
  284. count++;
  285. // wrap the text.
  286. if (count % 10 == 0) {
  287. buffer_ << "\n";
  288. }
  289. }
  290. buffer_ << "</table>>,];";
  291. }
  292. void BaseDigraph::SubGraph(const FuncGraphPtr &key, const std::shared_ptr<BaseDigraph> &gsub) {
  293. if (key == nullptr || gsub == nullptr) {
  294. return;
  295. }
  296. std::string label = key->debug_info()->get_full_name();
  297. if (label.empty()) {
  298. label = gsub->name();
  299. }
  300. std::string label_managed = "[managed]";
  301. if (key->manager() == nullptr) {
  302. label_managed = "[not managed]";
  303. }
  304. label += label_managed;
  305. gsub->FuncGraphParameters(key);
  306. buffer_ << "subgraph cluster_" << key << "{" << std::endl;
  307. buffer_ << "id=cluster_" << key << std::endl;
  308. buffer_ << "label=\"" << label << "\"" << std::endl;
  309. buffer_ << "fontname=\"Courier New\"" << std::endl;
  310. buffer_ << gsub->buffer().str();
  311. buffer_ << "}" << std::endl;
  312. }
  313. Digraph::~Digraph() {
  314. try {
  315. if (fout_.is_open()) {
  316. fout_.close();
  317. }
  318. } catch (const std::exception &e) {
  319. MS_LOG(ERROR) << "Exception when closing file " << filename_;
  320. }
  321. }
  322. static std::string ReplaceAll(std::string str, const std::string &from, const std::string &to) {
  323. size_t start_pos = 0;
  324. while ((start_pos = str.find(from, start_pos)) != std::string::npos) {
  325. (void)str.replace(start_pos, from.length(), to);
  326. start_pos += to.length(); // Handles case where 'to' is a substring of 'from'
  327. }
  328. return str;
  329. }
  330. static void DrawValueNode(Graphviz *const graph_obj, const ValueNodePtr &node) {
  331. MS_EXCEPTION_IF_NULL(graph_obj);
  332. graph_obj->buffer() << "label=<<table port='core' cellborder='0' cellspacing='2' bgcolor='" << graph_obj->Color(node)
  333. << "'>";
  334. graph_obj->buffer() << "<tr><td bgcolor='white'>";
  335. graph_obj->buffer() << ValueType(node);
  336. graph_obj->buffer() << "</td></tr>";
  337. graph_obj->buffer() << "<tr><td>";
  338. if (IsValueNode<MetaFuncGraph>(node)) {
  339. graph_obj->buffer() << node->value()->cast<MetaFuncGraphPtr>()->name();
  340. } else if (IsValueNode<parse::NameSpace>(node)) {
  341. graph_obj->buffer() << node->value()->cast<parse::NameSpacePtr>()->name();
  342. } else if (IsValueNode<parse::Symbol>(node)) {
  343. graph_obj->buffer() << ReplaceSpecialChar(node->value()->cast<parse::SymbolPtr>()->name());
  344. } else {
  345. std::ostringstream ss;
  346. ss << node->value()->ToString();
  347. std::string s = ReplaceAll(ss.str(), ", ", "<br/>");
  348. graph_obj->buffer() << s;
  349. ValuePtr value = node->value();
  350. if (value->isa<Primitive>()) {
  351. PrimitivePtr primitive = value->cast<PrimitivePtr>();
  352. graph_obj->buffer() << "</td></tr>";
  353. graph_obj->buffer() << "<tr><td align='left'>";
  354. if (!primitive->instance_name().empty()) {
  355. graph_obj->buffer() << "instance name:"
  356. << " ";
  357. graph_obj->buffer() << primitive->instance_name();
  358. graph_obj->buffer() << "<br/>";
  359. }
  360. auto attrs = primitive->attrs();
  361. if (attrs.size() > 0) {
  362. graph_obj->buffer() << "</td></tr>";
  363. graph_obj->buffer() << "<tr><td align='left'>";
  364. int i = 0;
  365. for (const auto &attr : attrs) {
  366. if (i != 0) {
  367. graph_obj->buffer() << "<br/>";
  368. }
  369. graph_obj->buffer() << attr.first << " ";
  370. graph_obj->buffer() << attr.second->ToString();
  371. i++;
  372. }
  373. }
  374. }
  375. }
  376. graph_obj->buffer() << "</td></tr>";
  377. graph_obj->buffer() << "</table>>,";
  378. }
  379. static void DrawParallelInfo(Graphviz *const graph_obj, const CNodePtr &node) {
  380. if (graph_obj == nullptr || node == nullptr) {
  381. return;
  382. }
  383. auto distributed_operation_info = node->user_data<parallel::OperatorInfo>();
  384. if (distributed_operation_info != nullptr) {
  385. auto strategyPtr = distributed_operation_info->strategy();
  386. if (strategyPtr != nullptr) {
  387. auto num = node->inputs().size();
  388. graph_obj->buffer() << "<tr><td colspan='" << num << "' ";
  389. graph_obj->buffer() << "bgcolor='" << graph_obj->Color(node) << "'>";
  390. std::vector<ValuePtr> temp = {MakeValue(strategyPtr->GetInputStage()), MakeValue(strategyPtr->GetInputDim())};
  391. ValueTuplePtr strategy_tuple = std::make_shared<ValueTuple>(temp);
  392. graph_obj->buffer() << "Strategy " << strategy_tuple->ToString();
  393. graph_obj->buffer() << "</td></tr>" << std::endl;
  394. }
  395. }
  396. }
  397. static void DrawCNode(Graphviz *const graph_obj, const CNodePtr &node) {
  398. if (graph_obj == nullptr || node == nullptr || node->size() == 0) {
  399. return;
  400. }
  401. auto num = node->size();
  402. bool is_modelgraph = false;
  403. if (typeid(*graph_obj) == typeid(ModelDigraph)) {
  404. is_modelgraph = true;
  405. num -= 1;
  406. }
  407. graph_obj->buffer() << "label=<<table port='core'>" << std::endl;
  408. // Draw ports for CNode
  409. if (num > 0) {
  410. graph_obj->buffer() << "<tr>";
  411. for (size_t i = 0; i < num; i++) {
  412. graph_obj->buffer() << "<td port='" << i << "'>" << i << "</td>";
  413. }
  414. graph_obj->buffer() << "</tr>" << std::endl;
  415. }
  416. // Draw op name
  417. graph_obj->buffer() << "<tr><td";
  418. if (num > 0) {
  419. graph_obj->buffer() << " colspan='" << num << "'";
  420. }
  421. graph_obj->buffer() << " bgcolor='" << graph_obj->Color(node) << "'>";
  422. if (IsValueNode<Primitive>(node->input(0)) && is_modelgraph) {
  423. auto primitive = GetValueNode<PrimitivePtr>(node->input(0));
  424. graph_obj->buffer() << ReplaceAll(primitive->ToString(), ", ", "<br/>");
  425. auto attrs = primitive->attrs();
  426. if (attrs.size() > 0) {
  427. graph_obj->buffer() << "</td></tr>" << std::endl << "<tr><td";
  428. // Draw attrs
  429. if (num > 0) {
  430. graph_obj->buffer() << " colspan='" << num << "'";
  431. }
  432. graph_obj->buffer() << ">";
  433. int i = 0;
  434. for (auto &attr : attrs) {
  435. if (i != 0) {
  436. graph_obj->buffer() << "<br/>";
  437. }
  438. graph_obj->buffer() << attr.first << " " << attr.second->ToString();
  439. i++;
  440. }
  441. }
  442. graph_obj->buffer() << "CNode";
  443. } else {
  444. graph_obj->buffer() << "CNode(" << node->ToString() << ")";
  445. }
  446. graph_obj->buffer() << "</td></tr>" << std::endl;
  447. DrawParallelInfo(graph_obj, node);
  448. graph_obj->buffer() << "</table>>,";
  449. }
  450. void Digraph::Node(AnfNodePtr node, int id) {
  451. if (node == nullptr) {
  452. return;
  453. }
  454. buffer_ << "node" << node << "_" << id;
  455. buffer_ << "[";
  456. // set fontname
  457. buffer_ << "fontname=\"Courier New\",";
  458. // set label and shape
  459. buffer_ << "shape=" << Shape(node) << ",";
  460. if (node->isa<CNode>()) {
  461. DrawCNode(this, node->cast<CNodePtr>());
  462. } else if (node->isa<ValueNode>() && !IsValueNode<FuncGraph>(node)) {
  463. DrawValueNode(this, node->cast<ValueNodePtr>());
  464. } else {
  465. buffer_ << "label=\"" << node->ToString();
  466. if (IsValueNode<FuncGraph>(node)) {
  467. FuncGraphPtr nextNet = GetValueNode<FuncGraphPtr>(node);
  468. std::string nextNetName = nextNet->debug_info()->get_full_name();
  469. if (!nextNetName.empty()) {
  470. buffer_ << "[" << nextNet->debug_info()->get_full_name().c_str() << "]";
  471. }
  472. }
  473. buffer_ << "\","
  474. << "style=filled,fillcolor=" << Color(node) << ",";
  475. }
  476. // Set URL for func graph
  477. if (IsValueNode<FuncGraph>(node)) {
  478. buffer_ << "URL=\"#cluster_" << GetValueNode(node) << "\",";
  479. }
  480. buffer_ << "]" << std::endl;
  481. }
  482. void Digraph::Edge(AnfNodePtr start, AnfNodePtr end, int idx, int id_start) {
  483. if (start == nullptr || end == nullptr) {
  484. return;
  485. }
  486. Head(start, id_start);
  487. buffer_ << "->";
  488. Tail(end, idx);
  489. buffer_ << "[arrowhead=vee,";
  490. // check how many inputs for end
  491. if (end->isa<CNode>()) {
  492. auto cnode = end->cast<CNodePtr>();
  493. MS_EXCEPTION_IF_NULL(cnode);
  494. auto num = cnode->inputs().size();
  495. if (idx == 0 && num > 1) {
  496. buffer_ << "style=dashed";
  497. }
  498. }
  499. buffer_ << "]" << std::endl;
  500. }
  501. ModelDigraph::~ModelDigraph() {
  502. try {
  503. if (fout_.is_open()) {
  504. fout_.close();
  505. }
  506. } catch (const std::exception &e) {
  507. MS_LOG(ERROR) << "exception when closing file " << filename_;
  508. }
  509. }
  510. std::string ModelDigraph::Shape(AnfNodePtr node) {
  511. if (node == nullptr) {
  512. return "";
  513. }
  514. if (node->isa<CNode>()) {
  515. return "plaintext";
  516. }
  517. if (node->isa<Parameter>()) {
  518. return "ellipse";
  519. }
  520. if (IsValueNode<FuncGraph>(node)) {
  521. return "oval";
  522. }
  523. return "plaintext";
  524. }
  525. void ModelDigraph::Node(AnfNodePtr node, int id) {
  526. if (node == nullptr) {
  527. return;
  528. }
  529. if (IsValueNode<Primitive>(node)) {
  530. return;
  531. }
  532. buffer_ << "node" << node << "_" << id;
  533. buffer_ << "[";
  534. // set fontname
  535. buffer_ << "fontname=\"Courier New\",";
  536. // set label and shape
  537. buffer_ << "shape=" << Shape(node) << ",";
  538. if (node->isa<CNode>()) {
  539. DrawCNode(this, node->cast<CNodePtr>());
  540. } else if (node->isa<ValueNode>() && !IsValueNode<FuncGraph>(node)) {
  541. DrawValueNode(this, node->cast<ValueNodePtr>());
  542. } else {
  543. buffer_ << "label=\"" << node->ToString() << "\",";
  544. buffer_ << "style=filled,fillcolor=" << Color(node) << ",";
  545. }
  546. // Set URL for func graph
  547. if (IsValueNode<FuncGraph>(node)) {
  548. buffer_ << "URL=\"#cluster_" << GetValueNode(node) << "\",";
  549. }
  550. buffer_ << "]" << std::endl;
  551. }
  552. void ModelDigraph::Edge(AnfNodePtr start, AnfNodePtr end, int idx, int id_start) {
  553. if (start == nullptr || end == nullptr) {
  554. return;
  555. }
  556. Head(start, id_start);
  557. buffer_ << "->";
  558. Tail(end, idx);
  559. buffer_ << "[arrowhead=vee,";
  560. buffer_ << "]" << std::endl;
  561. }
  562. struct DrawerRegister {
  563. DrawerRegister() {
  564. FuncGraph::set_drawer(
  565. [](const std::string &filename, const FuncGraphPtr &func_graph) { Draw(filename, func_graph); });
  566. }
  567. ~DrawerRegister() = default;
  568. } drawer_regsiter;
  569. } // namespace draw
  570. } // namespace mindspore