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.

graph.py 18 kB

5 years ago
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455
  1. # Copyright 2019 Huawei Technologies Co., Ltd
  2. #
  3. # Licensed under the Apache License, Version 2.0 (the "License");
  4. # you may not use this file except in compliance with the License.
  5. # You may obtain a copy of the License at
  6. #
  7. # http://www.apache.org/licenses/LICENSE-2.0
  8. #
  9. # Unless required by applicable law or agreed to in writing, software
  10. # distributed under the License is distributed on an "AS IS" BASIS,
  11. # WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  12. # See the License for the specific language governing permissions and
  13. # limitations under the License.
  14. # ============================================================================
  15. """
  16. This file is used to define the basic graph.
  17. """
  18. import copy
  19. import time
  20. from mindinsight.datavisual.common.log import logger
  21. from mindinsight.datavisual.common import exceptions
  22. from .node import NodeTypeEnum
  23. from .node import Node
  24. class EdgeTypeEnum:
  25. """Node edge type enum."""
  26. control = 'control'
  27. data = 'data'
  28. class DataTypeEnum:
  29. """Data type enum."""
  30. DT_TENSOR = 13
  31. class Graph:
  32. """The `Graph` object is used to describe a graph file."""
  33. MIN_POLYMERIC_NODE_COUNT = 5
  34. def __init__(self):
  35. # Store nodes contain leaf nodes, name scope node, except polymeric nodes
  36. self._normal_nodes = {}
  37. # Store polymeric nodes.
  38. self._polymeric_nodes = {}
  39. # Store all nodes resolved from the file.
  40. self._leaf_nodes = {}
  41. # The format of node groups is {'group_name': {'node_name': <Node>}}
  42. self._node_groups = {}
  43. def exist_node(self, name):
  44. """
  45. Check node exist in graph.
  46. Args:
  47. name (str): The node name.
  48. Returns:
  49. bool, if node is exist will return True.
  50. """
  51. if self._normal_nodes.get(name) is None:
  52. return False
  53. return True
  54. def get_normal_nodes(self, namescope=None):
  55. """
  56. Get nodes by namescope.
  57. Args:
  58. namescope (str): A namescope of nodes.
  59. Returns:
  60. list[dict], a list object contain `Node` object.
  61. """
  62. nodes = []
  63. if namescope is None:
  64. for name, node in self._normal_nodes.items():
  65. if '/' not in name:
  66. # Get first layer nodes
  67. nodes.append(node.to_dict())
  68. return nodes
  69. namescope = namescope + '/'
  70. for name, node in self._normal_nodes.items():
  71. if name.startswith(namescope) and '/' not in name.split(namescope)[1]:
  72. nodes.append(node.to_dict())
  73. return nodes
  74. def get_polymeric_nodes(self, polymeric_scope):
  75. """
  76. Get polymeric nodes by polymeric scope.
  77. Args:
  78. polymeric_scope (str): The polymeric scope name of nodes.
  79. Returns:
  80. list[dict], a list object contain `Node` object.
  81. """
  82. nodes = []
  83. for node in self._polymeric_nodes.values():
  84. if node.polymeric_scope_name == polymeric_scope:
  85. nodes.append(node.to_dict())
  86. return nodes
  87. def search_node_names(self, content, offset, limit):
  88. """
  89. Search node names by content.
  90. Args:
  91. content (Union[str, None]): This content can be the key content of the node to search,
  92. if None, will get all node names.
  93. offset (int): An offset for page. Ex, offset is 0, mean current page is 1.
  94. limit (int): An offset for page. Ex, offset is 0, mean current page is 1.
  95. Returns:
  96. list[str], a list of node names.
  97. """
  98. all_names = []
  99. all_names.extend(list(self._normal_nodes.keys()))
  100. all_names.extend(list(self._polymeric_nodes.keys()))
  101. if content is not None:
  102. content = content.lower()
  103. catch_names = [name for name in all_names if content in name.lower()]
  104. else:
  105. catch_names = all_names
  106. catch_names = sorted(catch_names)
  107. real_offset = offset * limit
  108. return catch_names[real_offset:real_offset+limit]
  109. def search_single_node(self, node_name):
  110. """
  111. Search node, and return every layer nodes until this node.
  112. Args:
  113. node_name (str): The name of node.
  114. Returns:
  115. dict, a dict object, format is :
  116. item_object = {'nodes': [<Node object>],
  117. 'scope_name': '<Node scope>',
  118. 'children': {<item_object>}}
  119. """
  120. if node_name and self._polymeric_nodes.get(node_name) is None \
  121. and self._normal_nodes.get(node_name) is None:
  122. raise exceptions.NodeNotInGraphError()
  123. response = {}
  124. nodes = self.get_normal_nodes()
  125. response.update({
  126. 'nodes': nodes,
  127. 'scope_name': '',
  128. 'children': {}
  129. })
  130. names = node_name.split('/')
  131. children = response['children']
  132. for i in range(1, len(names)+1):
  133. if i == len(names):
  134. polymeric_node = self._polymeric_nodes.get(node_name)
  135. if polymeric_node:
  136. polymeric_scope = polymeric_node.polymeric_scope_name
  137. nodes = self.get_polymeric_nodes(polymeric_scope)
  138. children.update({'nodes': nodes,
  139. 'scope_name': polymeric_scope,
  140. 'children': {}})
  141. break
  142. name_scope = '/'.join(names[:i])
  143. nodes = self.get_normal_nodes(name_scope)
  144. children.update({
  145. 'nodes': nodes,
  146. 'scope_name': name_scope,
  147. 'children': {}
  148. })
  149. children = children['children']
  150. return response
  151. def _build_polymeric_nodes(self):
  152. """Build polymeric node."""
  153. logger.debug("Start to build polymeric nodes")
  154. self._find_polymeric_nodes()
  155. group_count_map = {}
  156. for group_name, group in self._node_groups.items():
  157. name = group_name.split('/')[-1]
  158. count = group_count_map.get(name, 0)
  159. count += 1
  160. group_count_map[name] = count
  161. polymeric_node_name = group_name + '_{}_[{}]'.format(count, len(group))
  162. polymeric_node = Node(polymeric_node_name, node_id=polymeric_node_name)
  163. polymeric_node.node_type = NodeTypeEnum.POLYMERIC_SCOPE.value
  164. polymeric_node.name_scope = '/'.join(group_name.split('/')[:-1])
  165. polymeric_node.subnode_count = len(group)
  166. for name_tmp, node_tmp in group.items():
  167. node_tmp.polymeric_scope_name = polymeric_node_name
  168. self._polymeric_nodes.update({name_tmp: node_tmp})
  169. polymeric_node.update_input(node_tmp.input)
  170. polymeric_node.update_output(node_tmp.output)
  171. self._normal_nodes.update({polymeric_node_name: polymeric_node})
  172. self._update_input_output()
  173. def _find_polymeric_nodes(self):
  174. """Find polymeric nodes from node groups."""
  175. node_groups = copy.deepcopy(self._node_groups)
  176. for group_name, group in node_groups.items():
  177. if len(group) < self.MIN_POLYMERIC_NODE_COUNT:
  178. self._normal_nodes.update(group)
  179. self._node_groups.pop(group_name)
  180. continue
  181. move_node_names = []
  182. is_move_group = False
  183. for node_name, group_node in group.items():
  184. node_list = []
  185. is_in_group = False
  186. for dst_name in group_node.output:
  187. node_tmp = self._leaf_nodes[dst_name]
  188. node_list.append(node_tmp)
  189. start = time.time()
  190. run_count = 0
  191. visit_nodes = {}
  192. while node_list:
  193. # Iterate to find if the output of the node in the group causes a loop
  194. # example: there is a group A, and node_a is a Node in group.
  195. # if there is a loop in node_a, like A/node_a -> B/node_b -> A/node_b
  196. # we will remove the node_a from group A.
  197. node_tmp = node_list[0]
  198. node_list = node_list[1:]
  199. visit_nodes.update({node_tmp.name: True})
  200. if node_tmp in group.values():
  201. is_in_group = True
  202. break
  203. for dst_name_tmp in node_tmp.output:
  204. run_count += 1
  205. node_tmp = self._leaf_nodes[dst_name_tmp]
  206. if visit_nodes.get(dst_name_tmp):
  207. continue
  208. node_list.append(node_tmp)
  209. logger.debug("Find group %s node end, is_in_group: %s, use time: %s, "
  210. "run count: %s.", group_name, is_in_group,
  211. time.time() - start, run_count)
  212. if is_in_group:
  213. move_node_names.append(node_name)
  214. if (len(group) - len(move_node_names)) < self.MIN_POLYMERIC_NODE_COUNT:
  215. is_move_group = True
  216. break
  217. if is_move_group:
  218. self._normal_nodes.update(group)
  219. self._node_groups.pop(group_name)
  220. else:
  221. for name_tmp in move_node_names:
  222. node_tmp = self._node_groups[group_name].pop(name_tmp)
  223. self._normal_nodes.update({name_tmp: node_tmp})
  224. def _update_input_output(self):
  225. """We need to update input and output attribute after build polymeric node."""
  226. for node in self._normal_nodes.values():
  227. for src_name, input_attr in node.input.items():
  228. if self._polymeric_nodes.get(src_name):
  229. input_attr['scope'] = NodeTypeEnum.POLYMERIC_SCOPE.value
  230. node.update_input({src_name: input_attr})
  231. for dst_name, output_attr in node.output.items():
  232. if self._polymeric_nodes.get(dst_name):
  233. output_attr['scope'] = NodeTypeEnum.POLYMERIC_SCOPE.value
  234. node.update_output({dst_name: output_attr})
  235. for node in self._polymeric_nodes.values():
  236. for src_name, input_attr in node.input.items():
  237. if self._polymeric_nodes.get(src_name):
  238. input_attr['scope'] = NodeTypeEnum.POLYMERIC_SCOPE.value
  239. node.update_input({src_name: input_attr})
  240. for dst_name, output_attr in node.output.items():
  241. if self._polymeric_nodes.get(dst_name):
  242. output_attr['scope'] = NodeTypeEnum.POLYMERIC_SCOPE.value
  243. node.update_output({dst_name: output_attr})
  244. def _calc_polymeric_input_output(self):
  245. """Calc polymeric input and output after build polymeric node."""
  246. for name, node in self._normal_nodes.items():
  247. polymeric_input = {}
  248. for src_name in node.input:
  249. src_node = self._polymeric_nodes.get(src_name)
  250. if node.node_type == NodeTypeEnum.POLYMERIC_SCOPE.value:
  251. src_name = src_name if not src_node else src_node.polymeric_scope_name
  252. output_name = self._calc_dummy_node_name(name, src_name)
  253. polymeric_input.update({output_name: {'edge_type': EdgeTypeEnum.data}})
  254. continue
  255. if not src_node:
  256. continue
  257. if not node.name_scope and src_node.name_scope:
  258. # if current node is in first layer, and the src node is not in
  259. # the first layer, the src node will not be the polymeric input of current node.
  260. continue
  261. if node.name_scope == src_node.name_scope \
  262. or node.name_scope.startswith(src_node.name_scope):
  263. polymeric_input.update(
  264. {src_node.polymeric_scope_name: {'edge_type': EdgeTypeEnum.data}})
  265. node.update_polymeric_input(polymeric_input)
  266. polymeric_output = {}
  267. for dst_name in node.output:
  268. dst_node = self._polymeric_nodes.get(dst_name)
  269. if node.node_type == NodeTypeEnum.POLYMERIC_SCOPE.value:
  270. dst_name = dst_name if not dst_node else dst_node.polymeric_scope_name
  271. output_name = self._calc_dummy_node_name(name, dst_name)
  272. polymeric_output.update({output_name: {'edge_type': EdgeTypeEnum.data}})
  273. continue
  274. if not dst_node:
  275. continue
  276. if not node.name_scope and dst_node.name_scope:
  277. continue
  278. if node.name_scope == dst_node.name_scope \
  279. or node.name_scope.startswith(dst_node.name_scope):
  280. polymeric_output.update(
  281. {dst_node.polymeric_scope_name: {'edge_type': EdgeTypeEnum.data}})
  282. node.update_polymeric_output(polymeric_output)
  283. for name, node in self._polymeric_nodes.items():
  284. polymeric_input = {}
  285. for src_name in node.input:
  286. output_name = self._calc_dummy_node_name(name, src_name)
  287. polymeric_input.update({output_name: {'edge_type': EdgeTypeEnum.data}})
  288. node.update_polymeric_input(polymeric_input)
  289. polymeric_output = {}
  290. for dst_name in node.output:
  291. polymeric_output = {}
  292. output_name = self._calc_dummy_node_name(name, dst_name)
  293. polymeric_output.update({output_name: {'edge_type': EdgeTypeEnum.data}})
  294. node.update_polymeric_output(polymeric_output)
  295. def _calc_dummy_node_name(self, current_node_name, other_node_name):
  296. """
  297. Calc dummy node name.
  298. Args:
  299. current_node_name (str): The name of current node.
  300. other_node_name (str): The target dummy node name.
  301. Returns:
  302. str, the dummy node name.
  303. """
  304. name_tmp = other_node_name
  305. if self._polymeric_nodes.get(other_node_name):
  306. name_tmp = self._polymeric_nodes[other_node_name].polymeric_scope_name
  307. name_tmp_list = name_tmp.split('/')
  308. current_name_list = current_node_name.split('/')
  309. index = 0
  310. min_len = min(len(name_tmp_list), len(current_name_list))
  311. for i in range(min_len):
  312. index = i
  313. if name_tmp_list[index] != current_name_list[index]:
  314. break
  315. dummy_node_name = '/'.join(name_tmp_list[:index+1])
  316. return dummy_node_name
  317. def _build_name_scope_nodes(self):
  318. """Build name scope node by every node name."""
  319. normal_nodes = dict(self._normal_nodes)
  320. rename_node_names = {}
  321. for name, node in normal_nodes.items():
  322. name_list = name.split('/')
  323. for i in range(1, len(name_list)):
  324. name_scope = '/'.join(name_list[:i])
  325. name_scope_node = self._normal_nodes.get(name_scope)
  326. if name_scope_node is None:
  327. name_scope_node = Node(name_scope, node_id=name_scope)
  328. name_scope_node.node_type = NodeTypeEnum.NAME_SCOPE.value
  329. name_scope_node.name_scope = '/'.join(name_list[:i-1])
  330. elif name_scope_node.node_type != NodeTypeEnum.NAME_SCOPE.value:
  331. # The name of this node conflicts with namescope, so rename this node
  332. old_name = name_scope_node.name
  333. old_names = name_scope_node.name.split('/')
  334. old_names[-1] = f'({old_names[-1]})'
  335. new_name = '/'.join(old_names)
  336. name_scope_node.name = new_name
  337. self._normal_nodes.pop(old_name)
  338. self._normal_nodes.update({new_name: name_scope_node})
  339. rename_node_names.update({old_name: new_name})
  340. # create new namescope
  341. name_scope_node = Node(name_scope, node_id=name_scope)
  342. name_scope_node.node_type = NodeTypeEnum.NAME_SCOPE.value
  343. name_scope_node.name_scope = '/'.join(name_list[:i-1])
  344. # update the input and output of this to namescope node
  345. name_scope_with_slash = name_scope + '/'
  346. for src_name, input_attr in node.input.items():
  347. if src_name.startswith(name_scope_with_slash):
  348. continue
  349. name_scope_node.update_input({src_name: input_attr})
  350. for dst_name, output_attr in node.output.items():
  351. if dst_name.startswith(name_scope_with_slash):
  352. continue
  353. name_scope_node.update_output({dst_name: output_attr})
  354. self._normal_nodes.update({name_scope: name_scope_node})
  355. if rename_node_names:
  356. # If existing nodes are renamed, the inputs and outputs of all nodes need to be refreshed
  357. nodes = []
  358. nodes.extend(self._normal_nodes.values())
  359. nodes.extend(self._polymeric_nodes.values())
  360. for node in nodes:
  361. attrs = ['input', 'output', 'polymeric_input', 'polymeric_output']
  362. for item in attrs:
  363. tmp_dict = dict(getattr(node, item))
  364. for name, value in tmp_dict.items():
  365. new_name = rename_node_names.get(name, False)
  366. if new_name:
  367. getattr(node, item).pop(name)
  368. getattr(node, f'update_{item}')({new_name: value})
  369. self._calc_subnode_count()
  370. def _calc_subnode_count(self):
  371. """Calc the sub node count of scope node."""
  372. name_scope_mapping = {}
  373. for node in self._normal_nodes.values():
  374. if node.name_scope:
  375. count = name_scope_mapping.get(node.name_scope, 0)
  376. name_scope_mapping[node.name_scope] = count + 1
  377. for name_scope, count in name_scope_mapping.items():
  378. node = self._normal_nodes[name_scope]
  379. node.subnode_count = count

MindInsight为MindSpore提供了简单易用的调优调试能力。在训练过程中,可以将标量、张量、图像、计算图、模型超参、训练耗时等数据记录到文件中,通过MindInsight可视化页面进行查看及分析。

Contributors (1)