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.

network.py 24 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710
  1. # -*- coding: utf-8 -*-
  2. # MegEngine is Licensed under the Apache License, Version 2.0 (the "License")
  3. #
  4. # Copyright (c) 2014-2021 Megvii Inc. All rights reserved.
  5. #
  6. # Unless required by applicable law or agreed to in writing,
  7. # software distributed under the License is distributed on an
  8. # "AS IS" BASIS, WITHOUT ARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  9. import collections
  10. import fnmatch
  11. import itertools
  12. import re
  13. from collections import OrderedDict
  14. from typing import Dict, List
  15. import numpy as np
  16. from ..core._imperative_rt import ComputingGraph
  17. from ..core._imperative_rt.core2 import SymbolVar
  18. from ..core.tensor import megbrain_graph as G
  19. from ..logger import get_logger
  20. from .comp_graph_tools import get_dep_vars, get_opr_type, get_oprs_seq
  21. from .network_node import (
  22. Host2DeviceCopy,
  23. ImmutableTensor,
  24. NetworkNode,
  25. OpNode,
  26. VarNode,
  27. str_to_mge_class,
  28. )
  29. logger = get_logger(__name__)
  30. class Network:
  31. def __init__(self):
  32. self.input_vars = [] # input var of graph
  33. self._orig_inputs = []
  34. self.output_vars = [] # output var of graph
  35. self._orig_outputs = []
  36. self.all_oprs_map = OrderedDict()
  37. self.all_vars_map = OrderedDict()
  38. self.graph = ComputingGraph()
  39. @classmethod
  40. def load(cls, model_path: str, outspec: List[str] = None):
  41. """
  42. Loads a computing graph as a Network object.
  43. :param model_path: file path of mge model.
  44. :param outspec: only load the subgraph with outspec as its endpoints.
  45. """
  46. self = cls()
  47. _, _, outputs = G.load_graph(model_path)
  48. if outspec is not None:
  49. output_spec = outspec.copy()
  50. all_vars = get_dep_vars(outputs) + outputs
  51. new_outputs = {}
  52. for i in all_vars:
  53. if i.name in output_spec:
  54. new_outputs[i.name] = i
  55. output_spec.remove(i.name)
  56. assert len(output_spec) == 0, "Can not find {} in this model".format(
  57. output_spec
  58. )
  59. outputs = [new_outputs[i] for i in outspec]
  60. self._orig_outputs = outputs
  61. for x in self._orig_outputs:
  62. self.output_vars.append(self._get_var(x))
  63. self.add_dep_oprs()
  64. for x in self._orig_inputs:
  65. self.input_vars.append(self._get_var(x))
  66. self.graph = self._orig_outputs[0].graph
  67. return self
  68. def _compile(self):
  69. self.all_oprs_map = {}
  70. self.all_vars_map = {}
  71. for opr in self.all_oprs:
  72. if isinstance(opr, (ImmutableTensor, Host2DeviceCopy)):
  73. opr.compile(self.graph)
  74. else:
  75. opr.compile()
  76. if opr.name is not None:
  77. opr._opr.name = opr.name
  78. self.all_oprs_map[opr._opr.id] = opr
  79. for o in opr.outputs:
  80. self.all_vars_map[o.var.id] = o
  81. def dump(
  82. self,
  83. file,
  84. *,
  85. keep_var_name: int = 1,
  86. keep_opr_name: bool = False,
  87. keep_param_name: bool = False,
  88. keep_opr_priority: bool = False,
  89. strip_info_file=None,
  90. append_json=False,
  91. optimize_for_inference=True,
  92. append=False,
  93. **kwargs
  94. ):
  95. """
  96. Serializes graph to file.
  97. :param file: output file, could be file object or filename.
  98. :param append: whether output is appended to ``file``.
  99. Only works when ``file`` is str.
  100. :param keep_var_name: level for keeping variable names:
  101. * 0: none of the names are kept
  102. * 1: (default)keep names of output vars
  103. * 2: keep names of all (output and internal) vars
  104. :param keep_opr_name: whether to keep operator names.
  105. :param keep_param_name: whether to keep param names, so param values can be
  106. easily manipulated after loading model
  107. :param keep_opr_priority: whether to keep priority setting for operators
  108. :param strip_info_file: a string for path or a file handler. if is not None,
  109. then the dump information for code strip would be written to ``strip_info_file``
  110. :param append_json: will be check when `strip_info_file` is not None. if set
  111. true, the information for code strip will be append to strip_info_file.
  112. if set false, will rewrite strip_info_file
  113. :param optimize_for_inference: enbale optmizations,
  114. will skip all optimize options if this is False. Default: True
  115. :Keyword Arguments:
  116. * enable_io16xc32 --
  117. whether to use float16 for I/O between oprs and use
  118. float32 as internal computation precision. Note the output var would be
  119. changed to float16.
  120. * enable_ioc16 --
  121. whether to use float16 for both I/O and computation
  122. precision.
  123. * enable_hwcd4 --
  124. whether to use NHWCD4 data layout. This is faster on some
  125. OpenCL backend.
  126. * enable_nchw88 --
  127. whether to use NCHW88 data layout, currently
  128. used in X86 AVX backend.
  129. * enable_nchw44 --
  130. whether to use NCHW44 data layout, currently
  131. used in arm backend.
  132. * enable_nchw44_dot --
  133. whether to use NCHW44_dot data layout, currently
  134. used in armv8.2+dotprod backend.
  135. * enable_nchw4 --
  136. whether to use NCHW4 data layout, currently
  137. used in nvidia backend(based on cudnn).
  138. * enable_nchw32 --
  139. whether to use NCHW32 data layout, currently
  140. used in nvidia backend with tensorcore(based on cudnn).
  141. * enable_chwn4 --
  142. whether to use CHWN4 data layout, currently
  143. used in nvidia backend with tensorcore.
  144. * enable_fuse_conv_bias_nonlinearity: whether to fuse conv+bias+nonlinearty
  145. into one opr.
  146. * enable_fuse_conv_bias_with_z: whether to fuse conv_bias with z
  147. input for inference on nvidia backend(this optimization pass will
  148. result in mismatch of the precision of output of training and
  149. inference)
  150. """
  151. self._compile()
  152. out = [G.VarNode(var.var) for var in self.output_vars]
  153. if kwargs.pop("arg_names", False):
  154. logger.warning(
  155. '"arg_names" is not supported in Network.dump, rename input vars directly'
  156. )
  157. if kwargs.pop("output_names", False):
  158. logger.warning(
  159. '"output_names" is not supported in Network.dump, rename output vars directly'
  160. )
  161. if optimize_for_inference:
  162. out = G.optimize_for_inference(out, **kwargs)
  163. dump_content, _ = G.dump_graph(
  164. out,
  165. keep_var_name=keep_var_name,
  166. keep_opr_name=keep_opr_name,
  167. keep_param_name=keep_param_name,
  168. keep_opr_priority=keep_opr_priority,
  169. strip_info_file=strip_info_file,
  170. append_json=append_json,
  171. )
  172. if isinstance(file, str):
  173. permission = "wb" if append == False else "ab"
  174. file = open(file, permission)
  175. file.write(dump_content)
  176. def make_const(self, data, name=None, device=None):
  177. """Makes an ImmutableTensor OpNode to provide a parameter for the network.
  178. """
  179. node = ImmutableTensor(data, name, device, self.graph)
  180. node.compile(self.graph)
  181. return node.outputs[0]
  182. def make_input_node(self, shape, dtype, name=None, device=None):
  183. """Makes a Host2DeviceCopy OpNode to provide an input varnode for the network.
  184. """
  185. node = Host2DeviceCopy(shape, dtype, name, device)
  186. node.compile(self.graph)
  187. return node.outputs[0]
  188. def add_output(self, *vars: VarNode):
  189. """Adds vars into the network output node list
  190. """
  191. if not all([var.owner for var in vars]):
  192. self.add_dep_oprs(*vars)
  193. for var in vars:
  194. if var not in self.output_vars:
  195. self.output_vars.append(var)
  196. def remove_output(self, *vars: VarNode):
  197. """Removes vars from the network output node list.
  198. """
  199. for var in vars:
  200. if var in self.output_vars:
  201. self.output_vars.remove(var)
  202. def add_dep_oprs(self, *vars):
  203. if len(vars) == 0:
  204. vars = self.output_vars
  205. q = list(vars)
  206. while len(q) > 0:
  207. cur = q.pop(0)
  208. if cur.owner is not None:
  209. continue
  210. if cur.name is None:
  211. cur.name = cur.var.name
  212. self.all_vars_map[cur.var.id] = cur
  213. mge_opr = cur.var.owner
  214. if get_opr_type(mge_opr) == "Host2DeviceCopy":
  215. self._orig_inputs.extend(mge_opr.outputs)
  216. cur.owner = self._add_opr(mge_opr)
  217. if cur.owner is None:
  218. cur.owner = self.all_oprs_map[mge_opr.id]
  219. continue
  220. q.extend(cur.owner.inputs)
  221. return list(vars)
  222. def modify_opr_names(self, modifier):
  223. """Modifies names of operators **inplace**; useful for merging loaded
  224. network into another network
  225. :param modifier: a string to be prepended to the name, or a function
  226. that maps from name to name
  227. :type modifier: str or callable
  228. """
  229. if isinstance(modifier, str):
  230. om = modifier
  231. modifier = lambda v: "{}.{}".format(om, v)
  232. assert isinstance(modifier, collections.Callable)
  233. for i in self.all_oprs:
  234. v0 = i.name
  235. v1 = modifier(v0)
  236. assert isinstance(v1, str)
  237. i.name = v1
  238. def reset_batch_size(self, batchsize, *, blacklist=()):
  239. """Helper for reset batch size; first dimension of all data providers
  240. not in blacklist are assumed to be the batch size
  241. :param blacklist: data provider names whose first dimension is not
  242. batchbatch size
  243. """
  244. blacklist = set(blacklist)
  245. prev_batchsize = None
  246. for i in self.data_providers_filter:
  247. if i.name in blacklist:
  248. blacklist.remove(i.name)
  249. else:
  250. shp = list(i.shape)
  251. if prev_batchsize is None:
  252. prev_batchsize = shp[0]
  253. else:
  254. assert prev_batchsize == shp[0], (
  255. "batchsize mismatch: batchsize={} "
  256. "shape={} dp={}".format(prev_batchsize, shp, i.name)
  257. )
  258. shp[0] = batchsize
  259. i.shape = tuple(shp)
  260. assert prev_batchsize is not None, "no data provider found"
  261. assert not blacklist, "unused items in blacklist: {}".format(blacklist)
  262. def replace_vars(self, repl_dict: Dict[VarNode, VarNode]):
  263. """
  264. Replaces vars in the graph.
  265. :param repl_dict: the map {old_var: new_var} that specifies how to replace the vars.
  266. """
  267. if not all([var.owner for var in repl_dict.values()]):
  268. print(repl_dict.values())
  269. self.add_dep_oprs(*list(repl_dict.values()))
  270. for var in self.all_vars:
  271. if var in repl_dict:
  272. repl_var = repl_dict[var]
  273. owner = repl_var.owner
  274. idx = owner.outputs.index(repl_var)
  275. owner.outputs[idx] = var
  276. var.__dict__.update(repl_var.__dict__)
  277. var.var = repl_var.var
  278. def replace_oprs(self, repl_dict: Dict[OpNode, OpNode]):
  279. """
  280. Replaces operators in the graph.
  281. :param oprmap: the map {old_opr: new_opr} that specifies how to replace the operators.
  282. """
  283. for opr in self.all_oprs:
  284. if opr in repl_dict:
  285. assert len(opr.outputs) == len(
  286. repl_dict[opr].outputs
  287. ), "can not replace {} with {}".format(type(opr), type(repl_dict[opr]))
  288. repl_dict[opr].outputs = opr.outputs
  289. for ind, var in enumerate(opr.outputs):
  290. var.owner = repl_dict[opr]
  291. var.__dict__.update(repl_dict[opr].outputs[ind].__dict__)
  292. var.var = repl_dict[opr].outputs[ind].var
  293. def get_opr_by_type(self, oprcls, unique=True):
  294. assert issubclass(oprcls, OpNode)
  295. rst = self.opr_filter.type(oprcls).as_list()
  296. if unique:
  297. assert len(rst) == 1, "{} operators of type {} found".format(
  298. len(rst), oprcls
  299. )
  300. (rst,) = rst
  301. return rst
  302. def get_opr_by_name(self, name, unique=True):
  303. rst = self.opr_filter.name(name).as_list()
  304. if unique:
  305. assert len(rst) == 1, "{} operators of type {} found".format(len(rst), name)
  306. (rst,) = rst
  307. return rst
  308. def get_var_by_name(self, name, unique=True):
  309. rst = self.var_filter.name(name).as_list()
  310. if unique:
  311. assert len(rst) == 1, "{} operators of type {} found".format(len(rst), name)
  312. (rst,) = rst
  313. return rst
  314. def get_var_receive_oprs(self, var):
  315. """ Gets all oprs which use var as input
  316. """
  317. return self.opr_filter.has_input(var).as_list()
  318. def get_dep_oprs(self, var):
  319. """Gets dependent oprs of var
  320. """
  321. return get_oprs_seq(var, False, False)
  322. @property
  323. def opr_filter(self):
  324. """Filter on all opnodes of the Network.
  325. """
  326. oprs = self.all_oprs
  327. return NodeFilter(itertools.islice(oprs, len(oprs)))
  328. @property
  329. def var_filter(self):
  330. """Filter on all varnode of the Network.
  331. """
  332. vars = self.all_vars
  333. return NodeFilter(itertools.islice(vars, len(vars)))
  334. @property
  335. def params_filter(self): # all immutable tensor
  336. """Filter on all parameters (ImmutableTensor Opr) of the Network
  337. """
  338. return self.opr_filter.param_provider()
  339. @property
  340. def data_providers_filter(self): # all host2devicecopy
  341. """Filter on all input nodes (Host2DeviceCopy Opr) of the Network
  342. """
  343. return self.opr_filter.data_provider()
  344. @property
  345. def dest_vars(self):
  346. """Output varnodes of the Network.
  347. """
  348. return self.output_vars
  349. @property
  350. def all_oprs(self):
  351. return get_oprs_seq(self.output_vars, False, False)
  352. @property
  353. def all_vars(self):
  354. return get_dep_vars(self.output_vars)
  355. @property
  356. def all_vars_dict(self):
  357. return self.var_filter.as_dict()
  358. @property
  359. def all_oprs_dict(self):
  360. return self.opr_filter.as_dict()
  361. # used for loading and building graph
  362. def _add_opr(self, opr):
  363. # TODO: use megbrain C++ RTTI to replace type string
  364. if opr.id not in self.all_oprs_map:
  365. opnode = str_to_mge_class(get_opr_type(opr)).load(opr)
  366. self.all_oprs_map[opr.id] = opnode
  367. for var in opr.inputs:
  368. opnode.add_inp_var(self._get_var(var))
  369. for var in opr.outputs:
  370. opnode.add_out_var(self._get_var(var))
  371. return opnode
  372. else:
  373. return None
  374. def _get_opr(self, x):
  375. if x.id in self.all_oprs_map:
  376. return self.all_oprs_map[x.id]
  377. else:
  378. return None
  379. def _get_var(self, x):
  380. # auto convert to VarNode of Network
  381. if x.id not in self.all_vars_map or self.all_vars_map[x.id].var != x:
  382. self.all_vars_map[x.id] = VarNode.load(x, self._get_opr(x.owner))
  383. return self.all_vars_map[x.id]
  384. def as_varnode(obj):
  385. """convert a :class:`.VarNode` compatible object to :class:`.VarNode`.
  386. :param obj: it must be one of the following:
  387. 1. a :class:`.VarNode` object
  388. 2. a :class:`.OpNode` object that has unique output
  389. 3. an iterable that produces either type 1 or 2, with length 1
  390. :rtype: :class:`.VarNode`
  391. """
  392. if type(obj) is VarNode:
  393. return obj
  394. if isinstance(obj, OpNode):
  395. assert len(obj.outputs) == 1, (
  396. "operator {} must have one output to be converted to VarNode; "
  397. "got {} actually".format(obj, len(obj.outputs))
  398. )
  399. ret = obj.outputs[0]
  400. assert type(ret) is VarNode
  401. return ret
  402. assert isinstance(
  403. obj, collections.Iterable
  404. ), "{} is not compatible with VarNode".format(obj)
  405. val = list(obj)
  406. assert (
  407. len(val) == 1
  408. ), "can not convert sequence of length {} to VarNode ({})".format(
  409. len(val), (lambda s: s if len(s) < 50 else s[:50] + " ...")(str(val))
  410. )
  411. return as_varnode(val[0])
  412. def as_oprnode(obj):
  413. """convert a :class:`.OpNode` compatible object to
  414. :class:`.OpNode`; it works like :func:`as_varnode`."""
  415. if type(obj) is VarNode:
  416. return obj.owner
  417. if isinstance(obj, OpNode):
  418. return obj
  419. assert isinstance(
  420. obj, collections.Iterable
  421. ), "{} is not compatible with OpNode".format(obj)
  422. val = list(obj)
  423. assert (
  424. len(val) == 1
  425. ), "can not convert sequence of length {} to " "OpNode({})".format(len(val), val)
  426. return as_oprnode(val[0])
  427. class NodeFilter:
  428. """Filter on node iterator. This class is an iterator of
  429. :class:`.NetworkNode` objects and multiple filtering conditions and
  430. mappers can be chained.
  431. Example::
  432. # find all :class:`.ImmutableTensor` nodes
  433. for i in NodeFilter(node_iter).param_provider():
  434. print(i)
  435. # find all :class:`.ImmutableTensor` nodes that end with ':W'
  436. for i in NodeFilter(node_iter).param_provider().name('*:W'):
  437. print(i)
  438. # number of inputs
  439. nr_input = NodeFilter(node_iter).data_provider().as_count()
  440. """
  441. _iter = None
  442. def __init__(self, node_iter):
  443. """
  444. :param node_iter: iterator to :class:`.NetworkNode`, or a
  445. :class:`.VarNode`-compatible object; in the later case, its
  446. dependent oprs would be used
  447. """
  448. if isinstance(node_iter, VarNode):
  449. oprs = get_oprs_seq(node_iter, False, False)
  450. node_iter = itertools.islice(oprs, len(oprs) - 1)
  451. if isinstance(node_iter, OpNode):
  452. oprs = get_oprs_seq(node_iter.inputs, False, False)
  453. node_iter = itertools.islice(oprs, len(oprs) - 1)
  454. assert isinstance(node_iter, collections.Iterable)
  455. if (not isinstance(node_iter, NodeFilter)) and type(
  456. self
  457. ) is not NodeFilterCheckType:
  458. node_iter = NodeFilterCheckType(node_iter, NetworkNode)
  459. self._iter = node_iter
  460. @classmethod
  461. def make_all_deps(cls, *dest_vars):
  462. """make a :class:`NodeFilter` that contains all deps of given vars"""
  463. return cls(list(get_oprs_seq(dest_vars, False, False)))
  464. def __iter__(self):
  465. """to be overwritten by subclass to implement filters"""
  466. return iter(self._iter)
  467. def type(self, node_type):
  468. """filter by specific node type
  469. :param node_type: node type class
  470. :return: a new :class:`NodeFilter` object
  471. """
  472. return NodeFilterType(self, node_type)
  473. def check_type(self, node_type):
  474. """assert that all oprs produced by this iterator are instances of
  475. certain type
  476. :param node_type: node type class
  477. :return: a new :class:`NodeFilter` object
  478. :raises TypeError: if type check failed
  479. """
  480. return NodeFilterCheckType(self, node_type)
  481. def not_type(self, node_type):
  482. """remove oprs of specific type
  483. :param node_type: node type class
  484. :return: a new :class:`NodeFilter` object
  485. """
  486. return NodeFilterNotType(self, node_type)
  487. def param_provider(self):
  488. """get :class:`.ParamProvider` oprs; shorthand for
  489. ``.type(ParamProvider)``"""
  490. return self.type(ImmutableTensor)
  491. def data_provider(self):
  492. """get :class:`.DataProvider` oprs; shorthand for
  493. ``.type(DataProvider)``"""
  494. return self.type(Host2DeviceCopy)
  495. def name(self, pattern, ignorecase=True):
  496. """filter by node name
  497. :param pattern: a string in glob syntax that can contain ``?`` and
  498. ``*`` to match a single or arbitrary characters.
  499. :type pattern: :class:`str`
  500. :param ignorecase: whether to ignroe case
  501. :type ignorecase: bool
  502. :return: a new :class:`NodeFilter` object
  503. """
  504. return NodeFilterName(self, pattern, ignorecase)
  505. def has_input(self, var):
  506. """an opr is kept if it has given var as one of its inputs
  507. :param var: var node to checked
  508. :return: a new :class:`NodeFilter` object
  509. """
  510. return NodeFilterHasInput(self, var)
  511. def as_list(self):
  512. """consume this iterator and return its content as a list
  513. :rtype: [:class:`.GraphNodeBase`]
  514. """
  515. return list(self)
  516. def as_unique(self):
  517. """assert that this iterator yields only one node and return it
  518. :return: the unique node
  519. :rtype: :class:`.GraphNodeBase`
  520. :raises ValueError: if this iterator does not yield a unique node
  521. """
  522. (opr,) = self
  523. return opr
  524. def as_dict(self):
  525. """construct an ordered dict to map from node names to objects in
  526. this iterator
  527. :rtype: :class:`OrderedDict`
  528. """
  529. return collections.OrderedDict((i.name, i) for i in self)
  530. def as_count(self):
  531. """consume this iterator and get the number of elements
  532. :rtype: int
  533. """
  534. return sum(1 for _ in self)
  535. class NodeFilterType(NodeFilter):
  536. """see :meth:`NodeFilter.type`"""
  537. _node_type = None
  538. def __init__(self, node_iter, node_type):
  539. assert issubclass(node_type, NetworkNode), "bad opr type: {}".format(node_type)
  540. super().__init__(node_iter)
  541. self._node_type = node_type
  542. def __iter__(self):
  543. for i in self._iter:
  544. if isinstance(i, self._node_type):
  545. yield i
  546. class NodeFilterNotType(NodeFilterType):
  547. """see :meth:`NodeFilter.not_type`"""
  548. def __iter__(self):
  549. for i in self._iter:
  550. if not isinstance(i, self._node_type):
  551. yield i
  552. class NodeFilterCheckType(NodeFilterType):
  553. """see :meth:`NodeFilter.check_type`"""
  554. def __iter__(self):
  555. for i in self._iter:
  556. if not isinstance(i, self._node_type):
  557. raise TypeError(
  558. "all nodes should be {}; got {!r}".format(self._node_type, i)
  559. )
  560. yield i
  561. class NodeFilterHasInput(NodeFilter):
  562. """see :meth:`NodeFilter.has_input`"""
  563. _var = None
  564. def __init__(self, node_iter, var):
  565. var = as_varnode(var)
  566. super().__init__(node_iter)
  567. self.var = var
  568. def __iter__(self):
  569. for i in self._iter:
  570. assert isinstance(
  571. i, OpNode
  572. ), "has_input() must be used with OpNode; " "got {!r}".format(i)
  573. if any(self.var is _ for _ in i.inputs):
  574. yield i
  575. class NodeFilterName(NodeFilter):
  576. """see :meth:`NodeFilter.name`"""
  577. _re = None
  578. def __init__(self, node_iter, pattern, ignorecase):
  579. super().__init__(node_iter)
  580. self.pattern = pattern
  581. self._re = self.make_re(pattern, ignorecase)
  582. @classmethod
  583. def make_re(cls, pattern, ignorecase=True):
  584. assert isinstance(pattern, str), "bad pattern: {!r}".format(pattern)
  585. assert isinstance(ignorecase, bool)
  586. flags = 0
  587. if ignorecase:
  588. flags |= re.IGNORECASE
  589. return re.compile(fnmatch.translate(pattern), flags=flags)
  590. def __iter__(self):
  591. for i in self._iter:
  592. if self.pattern == i.name or self._re.match(i.name):
  593. yield i

MegEngine 安装包中集成了使用 GPU 运行代码所需的 CUDA 环境,不用区分 CPU 和 GPU 版。 如果想要运行 GPU 程序,请确保机器本身配有 GPU 硬件设备并安装好驱动。 如果你想体验在云端 GPU 算力平台进行深度学习开发的感觉,欢迎访问 MegStudio 平台