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

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