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

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