| <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> |
| <html xmlns="http://www.w3.org/1999/xhtml"> |
| <head> |
| <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> |
| <meta http-equiv="X-UA-Compatible" content="IE=9"/> |
| <meta name="generator" content="Doxygen 1.8.17"/> |
| <meta name="viewport" content="width=device-width, initial-scale=1"/> |
| <title>mxnet: /work/mxnet/3rdparty/tvm/nnvm/include/nnvm/graph.h Source File</title> |
| <link href="tabs.css" rel="stylesheet" type="text/css"/> |
| <script type="text/javascript" src="jquery.js"></script> |
| <script type="text/javascript" src="dynsections.js"></script> |
| <link href="search/search.css" rel="stylesheet" type="text/css"/> |
| <script type="text/javascript" src="search/searchdata.js"></script> |
| <script type="text/javascript" src="search/search.js"></script> |
| <link href="doxygen.css" rel="stylesheet" type="text/css" /> |
| </head> |
| <body> |
| <div id="top"><!-- do not remove this div, it is closed by doxygen! --> |
| <div id="titlearea"> |
| <table cellspacing="0" cellpadding="0"> |
| <tbody> |
| <tr style="height: 56px;"> |
| <td id="projectalign" style="padding-left: 0.5em;"> |
| <div id="projectname">mxnet |
| </div> |
| </td> |
| </tr> |
| </tbody> |
| </table> |
| </div> |
| <!-- end header part --> |
| <!-- Generated by Doxygen 1.8.17 --> |
| <script type="text/javascript"> |
| /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */ |
| var searchBox = new SearchBox("searchBox", "search",false,'Search'); |
| /* @license-end */ |
| </script> |
| <script type="text/javascript" src="menudata.js"></script> |
| <script type="text/javascript" src="menu.js"></script> |
| <script type="text/javascript"> |
| /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */ |
| $(function() { |
| initMenu('',true,false,'search.php','Search'); |
| $(document).ready(function() { init_search(); }); |
| }); |
| /* @license-end */</script> |
| <div id="main-nav"></div> |
| <!-- window showing the filter options --> |
| <div id="MSearchSelectWindow" |
| onmouseover="return searchBox.OnSearchSelectShow()" |
| onmouseout="return searchBox.OnSearchSelectHide()" |
| onkeydown="return searchBox.OnSearchSelectKey(event)"> |
| </div> |
| |
| <!-- iframe showing the search results (closed by default) --> |
| <div id="MSearchResultsWindow"> |
| <iframe src="javascript:void(0)" frameborder="0" |
| name="MSearchResults" id="MSearchResults"> |
| </iframe> |
| </div> |
| |
| <div id="nav-path" class="navpath"> |
| <ul> |
| <li class="navelem"><a class="el" href="dir_8cab8f464681f7cc51cee77e79a434cd.html">3rdparty</a></li><li class="navelem"><a class="el" href="dir_d40daf7ef9783ad6669561b9a39523a5.html">tvm</a></li><li class="navelem"><a class="el" href="dir_59ab2d7405f48271a817356d16f4868c.html">nnvm</a></li><li class="navelem"><a class="el" href="dir_564b1b3930cee8f0cd6786ede046ff35.html">include</a></li><li class="navelem"><a class="el" href="dir_aadb892b7c99db7e2c3fc68a6c967545.html">nnvm</a></li> </ul> |
| </div> |
| </div><!-- top --> |
| <div class="header"> |
| <div class="headertitle"> |
| <div class="title">graph.h</div> </div> |
| </div><!--header--> |
| <div class="contents"> |
| <a href="graph_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">/*</span></div> |
| <div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment"> * Licensed to the Apache Software Foundation (ASF) under one</span></div> |
| <div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment"> * or more contributor license agreements. See the NOTICE file</span></div> |
| <div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment"> * distributed with this work for additional information</span></div> |
| <div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment"> * regarding copyright ownership. The ASF licenses this file</span></div> |
| <div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment"> * to you under the Apache License, Version 2.0 (the</span></div> |
| <div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment"> * "License"); you may not use this file except in compliance</span></div> |
| <div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment"> * with the License. You may obtain a copy of the License at</span></div> |
| <div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment"> *</span></div> |
| <div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment"> * http://www.apache.org/licenses/LICENSE-2.0</span></div> |
| <div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment"> *</span></div> |
| <div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment"> * Unless required by applicable law or agreed to in writing,</span></div> |
| <div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="comment"> * software distributed under the License is distributed on an</span></div> |
| <div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="comment"> * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY</span></div> |
| <div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="comment"> * KIND, either express or implied. See the License for the</span></div> |
| <div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="comment"> * specific language governing permissions and limitations</span></div> |
| <div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="comment"> * under the License.</span></div> |
| <div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="comment"> */</span></div> |
| <div class="line"><a name="l00019"></a><span class="lineno"> 19</span>  </div> |
| <div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="preprocessor">#ifndef NNVM_GRAPH_H_</span></div> |
| <div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="preprocessor">#define NNVM_GRAPH_H_</span></div> |
| <div class="line"><a name="l00026"></a><span class="lineno"> 26</span>  </div> |
| <div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="preprocessor">#include <algorithm></span></div> |
| <div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="preprocessor">#include <memory></span></div> |
| <div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="preprocessor">#include <string></span></div> |
| <div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="preprocessor">#include <unordered_map></span></div> |
| <div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="preprocessor">#include <unordered_set></span></div> |
| <div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="preprocessor">#include <utility></span></div> |
| <div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="preprocessor">#include <vector></span></div> |
| <div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  </div> |
| <div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="preprocessor">#include "<a class="code" href="3rdparty_2tvm_2nnvm_2include_2nnvm_2base_8h.html">base.h</a>"</span></div> |
| <div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="preprocessor">#include "<a class="code" href="3rdparty_2tvm_2nnvm_2include_2nnvm_2node_8h.html">node.h</a>"</span></div> |
| <div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="preprocessor">#include "<a class="code" href="symbolic_8h.html">symbolic.h</a>"</span></div> |
| <div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  </div> |
| <div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="keyword">namespace </span><a class="code" href="namespacennvm.html">nnvm</a> {</div> |
| <div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  </div> |
| <div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="keyword">class </span>IndexedGraph;</div> |
| <div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  </div> |
| <div class="line"><a name="l00047"></a><span class="lineno"><a class="line" href="classnnvm_1_1Graph.html"> 47</a></span> <span class="keyword">class </span><a class="code" href="classnnvm_1_1Graph.html">Graph</a> {</div> |
| <div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  <span class="keyword">public</span>:</div> |
| <div class="line"><a name="l00050"></a><span class="lineno"><a class="line" href="classnnvm_1_1Graph.html#a1be6cd069643a2608625df12f49423eb"> 50</a></span>  std::vector<NodeEntry> <a class="code" href="classnnvm_1_1Graph.html#a1be6cd069643a2608625df12f49423eb">outputs</a>;</div> |
| <div class="line"><a name="l00061"></a><span class="lineno"><a class="line" href="classnnvm_1_1Graph.html#a6590464798f3a02e9edfe760bd7ece22"> 61</a></span>  std::unordered_map<std::string, std::shared_ptr<any> > <a class="code" href="classnnvm_1_1Graph.html#a6590464798f3a02e9edfe760bd7ece22">attrs</a>;</div> |
| <div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  <span class="keyword">template</span> <<span class="keyword">typename</span> T></div> |
| <div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <span class="keyword">inline</span> <span class="keyword">const</span> T& <a class="code" href="classnnvm_1_1Graph.html#ac3b5c307c14dd45179b0c916e8bb2220">GetAttr</a>(<span class="keyword">const</span> std::string& attr_name) <span class="keyword">const</span>;</div> |
| <div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="classnnvm_1_1Graph.html#a493eda4cf584454f1fb10419d0a87790">HasAttr</a>(<span class="keyword">const</span> std::string& attr_name) <span class="keyword">const</span>;</div> |
| <div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  <span class="keyword">template</span> <<span class="keyword">typename</span> T></div> |
| <div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <span class="keyword">inline</span> T <a class="code" href="classnnvm_1_1Graph.html#aef2d59ea8a92838e09fb852ec79be083">MoveCopyAttr</a>(<span class="keyword">const</span> std::string& attr_name);</div> |
| <div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="keyword">const</span> <a class="code" href="classnnvm_1_1IndexedGraph.html">IndexedGraph</a>& <a class="code" href="classnnvm_1_1Graph.html#a428b2c98b62c8e74d48094e9e4d2b35c">indexed_graph</a>() <span class="keyword">const</span>;</div> |
| <div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  </div> |
| <div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <span class="keyword">private</span>:</div> |
| <div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="comment">// internal structure of indexed graph</span></div> |
| <div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  <span class="keyword">mutable</span> std::shared_ptr<const IndexedGraph> indexed_graph_;</div> |
| <div class="line"><a name="l00097"></a><span class="lineno"> 97</span> };</div> |
| <div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  </div> |
| <div class="line"><a name="l00108"></a><span class="lineno"><a class="line" href="classnnvm_1_1IndexedGraph.html"> 108</a></span> <span class="keyword">class </span><a class="code" href="classnnvm_1_1IndexedGraph.html">IndexedGraph</a> {</div> |
| <div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  <span class="keyword">public</span>:</div> |
| <div class="line"><a name="l00111"></a><span class="lineno"><a class="line" href="structnnvm_1_1IndexedGraph_1_1NodeEntry.html"> 111</a></span>  <span class="keyword">struct </span><a class="code" href="structnnvm_1_1IndexedGraph_1_1NodeEntry.html">NodeEntry</a> {</div> |
| <div class="line"><a name="l00113"></a><span class="lineno"><a class="line" href="structnnvm_1_1IndexedGraph_1_1NodeEntry.html#ae73ae8527f6416a91d8d9c5457019688"> 113</a></span>  uint32_t <a class="code" href="structnnvm_1_1IndexedGraph_1_1NodeEntry.html#ae73ae8527f6416a91d8d9c5457019688">node_id</a>;</div> |
| <div class="line"><a name="l00115"></a><span class="lineno"><a class="line" href="structnnvm_1_1IndexedGraph_1_1NodeEntry.html#afb64f4be9e59c21f76c775495e7030c5"> 115</a></span>  uint32_t <a class="code" href="structnnvm_1_1IndexedGraph_1_1NodeEntry.html#afb64f4be9e59c21f76c775495e7030c5">index</a>;</div> |
| <div class="line"><a name="l00117"></a><span class="lineno"><a class="line" href="structnnvm_1_1IndexedGraph_1_1NodeEntry.html#a0aa0a4dfb369844ecb63072cef7f7cd0"> 117</a></span>  uint32_t <a class="code" href="structnnvm_1_1IndexedGraph_1_1NodeEntry.html#a0aa0a4dfb369844ecb63072cef7f7cd0">version</a>;</div> |
| <div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  };</div> |
| <div class="line"><a name="l00120"></a><span class="lineno"><a class="line" href="structnnvm_1_1IndexedGraph_1_1Node.html"> 120</a></span>  <span class="keyword">struct </span><a class="code" href="structnnvm_1_1IndexedGraph_1_1Node.html">Node</a> {</div> |
| <div class="line"><a name="l00122"></a><span class="lineno"><a class="line" href="structnnvm_1_1IndexedGraph_1_1Node.html#aa322c6e6c69854ea1743c62ba75364a7"> 122</a></span>  <span class="keyword">const</span> <a class="code" href="classnnvm_1_1Node.html">nnvm::Node</a>* <a class="code" href="structnnvm_1_1IndexedGraph_1_1Node.html#aa322c6e6c69854ea1743c62ba75364a7">source</a>;</div> |
| <div class="line"><a name="l00124"></a><span class="lineno"><a class="line" href="structnnvm_1_1IndexedGraph_1_1Node.html#af5528f74fa38dc455701eb415571fb2a"> 124</a></span>  <a class="code" href="classdmlc_1_1array__view.html">array_view<NodeEntry></a> <a class="code" href="structnnvm_1_1IndexedGraph_1_1Node.html#af5528f74fa38dc455701eb415571fb2a">inputs</a>;</div> |
| <div class="line"><a name="l00126"></a><span class="lineno"><a class="line" href="structnnvm_1_1IndexedGraph_1_1Node.html#a4ea5256c0e198c3b6585bc69153a1e4e"> 126</a></span>  <a class="code" href="classdmlc_1_1array__view.html">array_view<uint32_t></a> <a class="code" href="structnnvm_1_1IndexedGraph_1_1Node.html#a4ea5256c0e198c3b6585bc69153a1e4e">control_deps</a>;</div> |
| <div class="line"><a name="l00128"></a><span class="lineno"><a class="line" href="structnnvm_1_1IndexedGraph_1_1Node.html#a1fb87e2c471af26277432adeb1c3396f"> 128</a></span>  std::weak_ptr<nnvm::Node> <a class="code" href="structnnvm_1_1IndexedGraph_1_1Node.html#a1fb87e2c471af26277432adeb1c3396f">weak_ref</a>;</div> |
| <div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  };</div> |
| <div class="line"><a name="l00131"></a><span class="lineno"><a class="line" href="classnnvm_1_1IndexedGraph.html#a2b4330a003b45bf8f668df5c6c14eb2a"> 131</a></span>  <span class="keyword">inline</span> <span class="keywordtype">size_t</span> <a class="code" href="classnnvm_1_1IndexedGraph.html#a2b4330a003b45bf8f668df5c6c14eb2a">num_nodes</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> nodes_.size(); }</div> |
| <div class="line"><a name="l00133"></a><span class="lineno"><a class="line" href="classnnvm_1_1IndexedGraph.html#a07ac7fc560d6814737e1c954e08cdd4a"> 133</a></span>  <span class="keyword">inline</span> <span class="keywordtype">size_t</span> <a class="code" href="classnnvm_1_1IndexedGraph.html#a07ac7fc560d6814737e1c954e08cdd4a">num_node_entries</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> entry_rptr_.back(); }</div> |
| <div class="line"><a name="l00141"></a><span class="lineno"><a class="line" href="classnnvm_1_1IndexedGraph.html#a30f64e8c479ca766d194c48b1e4b9dbd"> 141</a></span>  <span class="keyword">inline</span> uint32_t <a class="code" href="classnnvm_1_1IndexedGraph.html#a30f64e8c479ca766d194c48b1e4b9dbd">entry_id</a>(uint32_t <a class="code" href="classnnvm_1_1IndexedGraph.html#a7591498bbad77ac6e50b2d376afaa1e3">node_id</a>, uint32_t index)<span class="keyword"> const </span>{</div> |
| <div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  <span class="keywordflow">return</span> entry_rptr_[<a class="code" href="classnnvm_1_1IndexedGraph.html#a7591498bbad77ac6e50b2d376afaa1e3">node_id</a>] + index;</div> |
| <div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  }</div> |
| <div class="line"><a name="l00150"></a><span class="lineno"><a class="line" href="classnnvm_1_1IndexedGraph.html#ab0343b19380e06575f64ec6bb91ba87c"> 150</a></span>  <span class="keyword">inline</span> uint32_t <a class="code" href="classnnvm_1_1IndexedGraph.html#ab0343b19380e06575f64ec6bb91ba87c">entry_id</a>(<span class="keyword">const</span> <a class="code" href="structnnvm_1_1IndexedGraph_1_1NodeEntry.html">NodeEntry</a>& e)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> entry_rptr_[e.<a class="code" href="structnnvm_1_1IndexedGraph_1_1NodeEntry.html#ae73ae8527f6416a91d8d9c5457019688">node_id</a>] + e.<a class="code" href="structnnvm_1_1IndexedGraph_1_1NodeEntry.html#afb64f4be9e59c21f76c775495e7030c5">index</a>; }</div> |
| <div class="line"><a name="l00157"></a><span class="lineno"><a class="line" href="classnnvm_1_1IndexedGraph.html#a631864da58d1a1d7a2f75597fa49af54"> 157</a></span>  <span class="keyword">inline</span> uint32_t <a class="code" href="classnnvm_1_1IndexedGraph.html#a631864da58d1a1d7a2f75597fa49af54">entry_id</a>(<span class="keyword">const</span> <a class="code" href="structnnvm_1_1NodeEntry.html">nnvm::NodeEntry</a>& e)<span class="keyword"> const </span>{</div> |
| <div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  <span class="keywordflow">return</span> entry_rptr_[<a class="code" href="classnnvm_1_1IndexedGraph.html#a7591498bbad77ac6e50b2d376afaa1e3">node_id</a>(e.<a class="code" href="structnnvm_1_1NodeEntry.html#ae438981d6f9d3a890e197d917b9e1a4f">node</a>.get())] + e.<a class="code" href="structnnvm_1_1NodeEntry.html#a5f231fbd1854ee182696b023be6ff5f8">index</a>;</div> |
| <div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  }</div> |
| <div class="line"><a name="l00165"></a><span class="lineno"><a class="line" href="classnnvm_1_1IndexedGraph.html#a7591498bbad77ac6e50b2d376afaa1e3"> 165</a></span>  <span class="keyword">inline</span> uint32_t <a class="code" href="classnnvm_1_1IndexedGraph.html#a7591498bbad77ac6e50b2d376afaa1e3">node_id</a>(<span class="keyword">const</span> <a class="code" href="classnnvm_1_1Node.html">nnvm::Node</a>* node)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> node2index_.at(node); }</div> |
| <div class="line"><a name="l00171"></a><span class="lineno"><a class="line" href="classnnvm_1_1IndexedGraph.html#add7f0a62896704f5bec992e2937e632f"> 171</a></span>  <span class="keyword">inline</span> <span class="keyword">const</span> <a class="code" href="structnnvm_1_1IndexedGraph_1_1Node.html">Node</a>& <a class="code" href="classnnvm_1_1IndexedGraph.html#add7f0a62896704f5bec992e2937e632f">operator[]</a>(uint32_t <a class="code" href="classnnvm_1_1IndexedGraph.html#a7591498bbad77ac6e50b2d376afaa1e3">node_id</a>)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> nodes_[<a class="code" href="classnnvm_1_1IndexedGraph.html#a7591498bbad77ac6e50b2d376afaa1e3">node_id</a>]; }</div> |
| <div class="line"><a name="l00177"></a><span class="lineno"><a class="line" href="classnnvm_1_1IndexedGraph.html#a483903874108e0de776a1d7eb976d90d"> 177</a></span>  <span class="keyword">inline</span> <span class="keyword">const</span> <a class="code" href="structnnvm_1_1IndexedGraph_1_1Node.html">Node</a>& <a class="code" href="classnnvm_1_1IndexedGraph.html#a483903874108e0de776a1d7eb976d90d">operator[]</a>(<span class="keyword">const</span> <a class="code" href="classnnvm_1_1Node.html">nnvm::Node</a>* node)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> nodes_[<a class="code" href="classnnvm_1_1IndexedGraph.html#a7591498bbad77ac6e50b2d376afaa1e3">node_id</a>(node)]; }</div> |
| <div class="line"><a name="l00179"></a><span class="lineno"><a class="line" href="classnnvm_1_1IndexedGraph.html#a714885749b0905330dd744f23dd81ee1"> 179</a></span>  <span class="keyword">inline</span> <span class="keyword">const</span> std::vector<uint32_t>& <a class="code" href="classnnvm_1_1IndexedGraph.html#a714885749b0905330dd744f23dd81ee1">input_nodes</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> input_nodes_; }</div> |
| <div class="line"><a name="l00181"></a><span class="lineno"><a class="line" href="classnnvm_1_1IndexedGraph.html#acb41409fded35e301fd9bf65186397fb"> 181</a></span>  <span class="keyword">inline</span> <span class="keyword">const</span> std::unordered_set<uint32_t>& <a class="code" href="classnnvm_1_1IndexedGraph.html#acb41409fded35e301fd9bf65186397fb">mutable_input_nodes</a>()<span class="keyword"> const </span>{</div> |
| <div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  <span class="keywordflow">return</span> mutable_input_nodes_;</div> |
| <div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  }</div> |
| <div class="line"><a name="l00185"></a><span class="lineno"><a class="line" href="classnnvm_1_1IndexedGraph.html#a9dc0c49b8629d32a3ec12bcc2b0df549"> 185</a></span>  <span class="keyword">inline</span> <span class="keyword">const</span> std::vector<NodeEntry>& <a class="code" href="classnnvm_1_1IndexedGraph.html#a9dc0c49b8629d32a3ec12bcc2b0df549">outputs</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> outputs_; }</div> |
| <div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  </div> |
| <div class="line"><a name="l00188"></a><span class="lineno"><a class="line" href="classnnvm_1_1IndexedGraph.html#a8b35a4d16e3fc611595e76e80da842aa"> 188</a></span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="classnnvm_1_1IndexedGraph.html#a8b35a4d16e3fc611595e76e80da842aa">exist</a>(<span class="keyword">const</span> <a class="code" href="classnnvm_1_1Node.html">nnvm::Node</a>* node)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> node2index_.count(node); }</div> |
| <div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  </div> |
| <div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  <span class="comment">// disalllow copy assign</span></div> |
| <div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  <a class="code" href="classnnvm_1_1IndexedGraph.html#a96b3d5ce684df1beca8825f17bb761d0">IndexedGraph</a>(<span class="keyword">const</span> <a class="code" href="classnnvm_1_1IndexedGraph.html">IndexedGraph</a>&) = <span class="keyword">delete</span>;</div> |
| <div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  </div> |
| <div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  <span class="keyword">private</span>:</div> |
| <div class="line"><a name="l00194"></a><span class="lineno"><a class="line" href="classnnvm_1_1IndexedGraph.html#afab89afd724f1b07b1aaad6bdc61c47a"> 194</a></span>  <span class="keyword">friend</span> <span class="keyword">class </span><a class="code" href="classnnvm_1_1Graph.html">Graph</a>;</div> |
| <div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  <span class="keyword">explicit</span> <a class="code" href="classnnvm_1_1IndexedGraph.html#a96b3d5ce684df1beca8825f17bb761d0">IndexedGraph</a>(<span class="keyword">const</span> <a class="code" href="classnnvm_1_1Graph.html">Graph</a>& other);</div> |
| <div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  <span class="comment">// Node pointers in CSR structure.</span></div> |
| <div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  std::vector<Node> nodes_;</div> |
| <div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  <span class="comment">// Index to all input nodes.</span></div> |
| <div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  std::vector<uint32_t> input_nodes_;</div> |
| <div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  <span class="comment">// Index to all mutable input nodes.</span></div> |
| <div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  std::unordered_set<uint32_t> mutable_input_nodes_;</div> |
| <div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  <span class="comment">// space to store the outputs entries</span></div> |
| <div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  std::vector<NodeEntry> outputs_;</div> |
| <div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  <span class="comment">// mapping from node to index.</span></div> |
| <div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  std::unordered_map<const nnvm::Node*, uint32_t> node2index_;</div> |
| <div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  <span class="comment">// CSR pointer of node entries</span></div> |
| <div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  std::vector<size_t> entry_rptr_;</div> |
| <div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  <span class="comment">// space to store input entries of each</span></div> |
| <div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  std::vector<NodeEntry> input_entries_;</div> |
| <div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  <span class="comment">// control flow dependencies</span></div> |
| <div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  std::vector<uint32_t> control_deps_;</div> |
| <div class="line"><a name="l00216"></a><span class="lineno"> 216</span> };</div> |
| <div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  </div> |
| <div class="line"><a name="l00225"></a><span class="lineno"> 225</span> <span class="keyword">template</span> <<span class="keyword">typename</span> FVisit></div> |
| <div class="line"><a name="l00226"></a><span class="lineno"> 226</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="namespacennvm.html#a6b06865bedddb2bab9903e448120658c">DFSVisit</a>(<span class="keyword">const</span> std::vector<NodeEntry>& heads, FVisit fvisit);</div> |
| <div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  </div> |
| <div class="line"><a name="l00228"></a><span class="lineno"> 228</span> <span class="comment">// inline function implementations</span></div> |
| <div class="line"><a name="l00229"></a><span class="lineno"> 229</span> <span class="keyword">template</span> <<span class="keyword">typename</span> T></div> |
| <div class="line"><a name="l00230"></a><span class="lineno"><a class="line" href="classnnvm_1_1Graph.html#ac3b5c307c14dd45179b0c916e8bb2220"> 230</a></span> <span class="keyword">inline</span> <span class="keyword">const</span> T& <a class="code" href="classnnvm_1_1Graph.html#ac3b5c307c14dd45179b0c916e8bb2220">Graph::GetAttr</a>(<span class="keyword">const</span> std::string& attr_name)<span class="keyword"> const </span>{</div> |
| <div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  <span class="keyword">auto</span> it = <a class="code" href="classnnvm_1_1Graph.html#a6590464798f3a02e9edfe760bd7ece22">attrs</a>.find(attr_name);</div> |
| <div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  CHECK(it != <a class="code" href="classnnvm_1_1Graph.html#a6590464798f3a02e9edfe760bd7ece22">attrs</a>.end()) << <span class="stringliteral">"Cannot find attribute "</span> << attr_name << <span class="stringliteral">" in the graph"</span>;</div> |
| <div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  <span class="keywordflow">return</span> nnvm::unsafe_get<T>(*it->second);</div> |
| <div class="line"><a name="l00234"></a><span class="lineno"> 234</span> }</div> |
| <div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  </div> |
| <div class="line"><a name="l00236"></a><span class="lineno"><a class="line" href="classnnvm_1_1Graph.html#a493eda4cf584454f1fb10419d0a87790"> 236</a></span> <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="classnnvm_1_1Graph.html#a493eda4cf584454f1fb10419d0a87790">Graph::HasAttr</a>(<span class="keyword">const</span> std::string& attr_name)<span class="keyword"> const </span>{</div> |
| <div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  <span class="keyword">auto</span> it = <a class="code" href="classnnvm_1_1Graph.html#a6590464798f3a02e9edfe760bd7ece22">attrs</a>.find(attr_name);</div> |
| <div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  <span class="keywordflow">return</span> it != <a class="code" href="classnnvm_1_1Graph.html#a6590464798f3a02e9edfe760bd7ece22">attrs</a>.end();</div> |
| <div class="line"><a name="l00239"></a><span class="lineno"> 239</span> }</div> |
| <div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  </div> |
| <div class="line"><a name="l00241"></a><span class="lineno"> 241</span> <span class="keyword">template</span> <<span class="keyword">typename</span> T></div> |
| <div class="line"><a name="l00242"></a><span class="lineno"><a class="line" href="classnnvm_1_1Graph.html#aef2d59ea8a92838e09fb852ec79be083"> 242</a></span> <span class="keyword">inline</span> T <a class="code" href="classnnvm_1_1Graph.html#aef2d59ea8a92838e09fb852ec79be083">Graph::MoveCopyAttr</a>(<span class="keyword">const</span> std::string& attr_name) {</div> |
| <div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  <span class="keyword">auto</span> it = <a class="code" href="classnnvm_1_1Graph.html#a6590464798f3a02e9edfe760bd7ece22">attrs</a>.find(attr_name);</div> |
| <div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  CHECK(it != <a class="code" href="classnnvm_1_1Graph.html#a6590464798f3a02e9edfe760bd7ece22">attrs</a>.end()) << <span class="stringliteral">"Cannot find attribute "</span> << attr_name << <span class="stringliteral">" in the graph"</span>;</div> |
| <div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  std::shared_ptr<any> sptr = it->second;</div> |
| <div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  <a class="code" href="classnnvm_1_1Graph.html#a6590464798f3a02e9edfe760bd7ece22">attrs</a>.erase(it);</div> |
| <div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  <span class="keywordflow">if</span> (sptr.unique()) {</div> |
| <div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  <span class="keywordflow">return</span> std::move(nnvm::get<T>(*sptr));</div> |
| <div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  } <span class="keywordflow">else</span> {</div> |
| <div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  <span class="keywordflow">return</span> nnvm::get<T>(*sptr);</div> |
| <div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  }</div> |
| <div class="line"><a name="l00252"></a><span class="lineno"> 252</span> }</div> |
| <div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  </div> |
| <div class="line"><a name="l00254"></a><span class="lineno"> 254</span> <span class="keyword">template</span> <<span class="keyword">typename</span> GNode, <span class="keyword">typename</span> HashType, <span class="keyword">typename</span> FVisit, <span class="keyword">typename</span> HashFunc, <span class="keyword">typename</span> InDegree,</div> |
| <div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  <span class="keyword">typename</span> GetInput></div> |
| <div class="line"><a name="l00256"></a><span class="lineno"><a class="line" href="namespacennvm.html#a24f3e607ea360d951389b4b9b83eb7fe"> 256</a></span> <span class="keywordtype">void</span> <a class="code" href="namespacennvm.html#a24f3e607ea360d951389b4b9b83eb7fe">PostOrderDFSVisit</a>(<span class="keyword">const</span> std::vector<GNode>& heads, FVisit fvisit, HashFunc hash,</div> |
| <div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  InDegree indegree, GetInput getinput) {</div> |
| <div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  std::vector<std::pair<GNode, uint32_t> > stack;</div> |
| <div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  std::unordered_set<HashType> visited;</div> |
| <div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  <span class="keywordflow">for</span> (<span class="keyword">auto</span>& head : heads) {</div> |
| <div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  HashType head_hash = hash(head);</div> |
| <div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  <span class="keywordflow">if</span> (visited.count(head_hash) == 0) {</div> |
| <div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  stack.push_back(std::make_pair(head, 0));</div> |
| <div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  visited.insert(head_hash);</div> |
| <div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  }</div> |
| <div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  <span class="keywordflow">while</span> (!stack.empty()) {</div> |
| <div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  std::pair<GNode, uint32_t>& back = stack.back();</div> |
| <div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  <span class="keywordflow">if</span> (back.second == indegree(back.first)) {</div> |
| <div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  fvisit(back.first);</div> |
| <div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  stack.pop_back();</div> |
| <div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  } <span class="keywordflow">else</span> {</div> |
| <div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  <span class="keyword">const</span> GNode& input = getinput(back.first, back.second++);</div> |
| <div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  HashType input_hash = hash(input);</div> |
| <div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  <span class="keywordflow">if</span> (visited.count(input_hash) == 0) {</div> |
| <div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  stack.push_back(std::make_pair(input, 0));</div> |
| <div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  visited.insert(input_hash);</div> |
| <div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  }</div> |
| <div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  }</div> |
| <div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  }</div> |
| <div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  }</div> |
| <div class="line"><a name="l00281"></a><span class="lineno"> 281</span> }</div> |
| <div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  </div> |
| <div class="line"><a name="l00283"></a><span class="lineno"> 283</span> <span class="keyword">template</span> <<span class="keyword">typename</span> FVisit></div> |
| <div class="line"><a name="l00284"></a><span class="lineno"><a class="line" href="namespacennvm.html#a6b06865bedddb2bab9903e448120658c"> 284</a></span> <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="namespacennvm.html#a6b06865bedddb2bab9903e448120658c">DFSVisit</a>(<span class="keyword">const</span> std::vector<NodeEntry>& heads, FVisit fvisit) {</div> |
| <div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  <span class="keyword">typedef</span> <span class="keyword">const</span> <a class="code" href="namespacennvm.html#a573897937ff3b88f0014feabb8e44a92">ObjectPtr</a>* GNode;</div> |
| <div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  std::vector<GNode> head_nodes(heads.size());</div> |
| <div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  std::transform(heads.begin(), heads.end(), head_nodes.begin(),</div> |
| <div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  [](<span class="keyword">const</span> <a class="code" href="structnnvm_1_1NodeEntry.html">NodeEntry</a>& e) -> GNode { return &e.node; });</div> |
| <div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  PostOrderDFSVisit<GNode, Node*>(</div> |
| <div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  head_nodes, [fvisit](GNode n) { fvisit(*n); }, <span class="comment">// FVisit</span></div> |
| <div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  [](GNode n) -> <a class="code" href="classnnvm_1_1Node.html">Node</a>* { <span class="keywordflow">return</span> n->get(); }, <span class="comment">// HashFunc</span></div> |
| <div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  [](GNode n) -> uint32_t { <span class="comment">// InDegree</span></div> |
| <div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  <span class="keywordflow">if</span> (!(*n)) <span class="keywordflow">return</span> 0;</div> |
| <div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  <span class="keywordflow">return</span> (*n)-><a class="code" href="classnnvm_1_1Node.html#a1be3a2e4759dc6239332cb9657c5c11d">inputs</a>.size() + (*n)->control_deps.size();</div> |
| <div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  },</div> |
| <div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  [](GNode n, uint32_t index) -> GNode { <span class="comment">// GetInput</span></div> |
| <div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  <span class="keywordflow">if</span> (index < (*n)->inputs.size()) {</div> |
| <div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  <span class="keywordflow">return</span> &(*n)->inputs.at(index).node;</div> |
| <div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  } <span class="keywordflow">else</span> {</div> |
| <div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  <span class="keywordflow">return</span> &(*n)->control_deps.at(index - (*n)->inputs.size());</div> |
| <div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  }</div> |
| <div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  });</div> |
| <div class="line"><a name="l00303"></a><span class="lineno"> 303</span> }</div> |
| <div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  </div> |
| <div class="line"><a name="l00305"></a><span class="lineno"> 305</span> } <span class="comment">// namespace nnvm</span></div> |
| <div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  </div> |
| <div class="line"><a name="l00307"></a><span class="lineno"> 307</span> <span class="preprocessor">#endif // NNVM_GRAPH_H_</span></div> |
| </div><!-- fragment --></div><!-- contents --> |
| <div class="ttc" id="aclassnnvm_1_1Graph_html_a493eda4cf584454f1fb10419d0a87790"><div class="ttname"><a href="classnnvm_1_1Graph.html#a493eda4cf584454f1fb10419d0a87790">nnvm::Graph::HasAttr</a></div><div class="ttdeci">bool HasAttr(const std::string &attr_name) const</div><div class="ttdoc">Check whether has a specific attribute.</div><div class="ttdef"><b>Definition:</b> graph.h:236</div></div> |
| <div class="ttc" id="astructnnvm_1_1IndexedGraph_1_1NodeEntry_html_ae73ae8527f6416a91d8d9c5457019688"><div class="ttname"><a href="structnnvm_1_1IndexedGraph_1_1NodeEntry.html#ae73ae8527f6416a91d8d9c5457019688">nnvm::IndexedGraph::NodeEntry::node_id</a></div><div class="ttdeci">uint32_t node_id</div><div class="ttdoc">the source node id in the computation graph</div><div class="ttdef"><b>Definition:</b> graph.h:113</div></div> |
| <div class="ttc" id="aclassnnvm_1_1IndexedGraph_html_acb41409fded35e301fd9bf65186397fb"><div class="ttname"><a href="classnnvm_1_1IndexedGraph.html#acb41409fded35e301fd9bf65186397fb">nnvm::IndexedGraph::mutable_input_nodes</a></div><div class="ttdeci">const std::unordered_set< uint32_t > & mutable_input_nodes() const</div><div class="ttdef"><b>Definition:</b> graph.h:181</div></div> |
| <div class="ttc" id="aclassnnvm_1_1Node_html"><div class="ttname"><a href="classnnvm_1_1Node.html">nnvm::Node</a></div><div class="ttdoc">Node represents an operation in a computation graph.</div><div class="ttdef"><b>Definition:</b> node.h:143</div></div> |
| <div class="ttc" id="aclassnnvm_1_1IndexedGraph_html_ab0343b19380e06575f64ec6bb91ba87c"><div class="ttname"><a href="classnnvm_1_1IndexedGraph.html#ab0343b19380e06575f64ec6bb91ba87c">nnvm::IndexedGraph::entry_id</a></div><div class="ttdeci">uint32_t entry_id(const NodeEntry &e) const</div><div class="ttdoc">Get a unique entry id between 0 to num_node_entries() for a given IndexedGraph::NodeEntry.</div><div class="ttdef"><b>Definition:</b> graph.h:150</div></div> |
| <div class="ttc" id="aclassnnvm_1_1Graph_html_a428b2c98b62c8e74d48094e9e4d2b35c"><div class="ttname"><a href="classnnvm_1_1Graph.html#a428b2c98b62c8e74d48094e9e4d2b35c">nnvm::Graph::indexed_graph</a></div><div class="ttdeci">const IndexedGraph & indexed_graph() const</div><div class="ttdoc">get a indexed graph of current graph, if not exist, create it on demand</div></div> |
| <div class="ttc" id="aclassnnvm_1_1IndexedGraph_html_add7f0a62896704f5bec992e2937e632f"><div class="ttname"><a href="classnnvm_1_1IndexedGraph.html#add7f0a62896704f5bec992e2937e632f">nnvm::IndexedGraph::operator[]</a></div><div class="ttdeci">const Node & operator[](uint32_t node_id) const</div><div class="ttdoc">Get the corresponding Node structure for a given node_id.</div><div class="ttdef"><b>Definition:</b> graph.h:171</div></div> |
| <div class="ttc" id="aclassnnvm_1_1Graph_html"><div class="ttname"><a href="classnnvm_1_1Graph.html">nnvm::Graph</a></div><div class="ttdoc">Symbolic computation graph. This is the intermediate representation for optimization pass.</div><div class="ttdef"><b>Definition:</b> graph.h:47</div></div> |
| <div class="ttc" id="aclassnnvm_1_1Node_html_a1be3a2e4759dc6239332cb9657c5c11d"><div class="ttname"><a href="classnnvm_1_1Node.html#a1be3a2e4759dc6239332cb9657c5c11d">nnvm::Node::inputs</a></div><div class="ttdeci">std::vector< NodeEntry > inputs</div><div class="ttdoc">inputs to this node</div><div class="ttdef"><b>Definition:</b> node.h:153</div></div> |
| <div class="ttc" id="astructnnvm_1_1NodeEntry_html_a5f231fbd1854ee182696b023be6ff5f8"><div class="ttname"><a href="structnnvm_1_1NodeEntry.html#a5f231fbd1854ee182696b023be6ff5f8">nnvm::NodeEntry::index</a></div><div class="ttdeci">uint32_t index</div><div class="ttdoc">index of output from the source.</div><div class="ttdef"><b>Definition:</b> node.h:67</div></div> |
| <div class="ttc" id="aclassnnvm_1_1IndexedGraph_html_a07ac7fc560d6814737e1c954e08cdd4a"><div class="ttname"><a href="classnnvm_1_1IndexedGraph.html#a07ac7fc560d6814737e1c954e08cdd4a">nnvm::IndexedGraph::num_node_entries</a></div><div class="ttdeci">size_t num_node_entries() const</div><div class="ttdef"><b>Definition:</b> graph.h:133</div></div> |
| <div class="ttc" id="aclassnnvm_1_1IndexedGraph_html_a30f64e8c479ca766d194c48b1e4b9dbd"><div class="ttname"><a href="classnnvm_1_1IndexedGraph.html#a30f64e8c479ca766d194c48b1e4b9dbd">nnvm::IndexedGraph::entry_id</a></div><div class="ttdeci">uint32_t entry_id(uint32_t node_id, uint32_t index) const</div><div class="ttdoc">Get a unique entry id between 0 to num_node_entries() for a given IndexedGraph::NodeEntry.</div><div class="ttdef"><b>Definition:</b> graph.h:141</div></div> |
| <div class="ttc" id="aclassnnvm_1_1IndexedGraph_html"><div class="ttname"><a href="classnnvm_1_1IndexedGraph.html">nnvm::IndexedGraph</a></div><div class="ttdoc">Auxiliary data structure to index a graph. It maps Nodes in the graph to consecutive integers node_id...</div><div class="ttdef"><b>Definition:</b> graph.h:108</div></div> |
| <div class="ttc" id="astructnnvm_1_1IndexedGraph_1_1Node_html_aa322c6e6c69854ea1743c62ba75364a7"><div class="ttname"><a href="structnnvm_1_1IndexedGraph_1_1Node.html#aa322c6e6c69854ea1743c62ba75364a7">nnvm::IndexedGraph::Node::source</a></div><div class="ttdeci">const nnvm::Node * source</div><div class="ttdoc">pointer to the source node</div><div class="ttdef"><b>Definition:</b> graph.h:122</div></div> |
| <div class="ttc" id="aclassdmlc_1_1array__view_html"><div class="ttname"><a href="classdmlc_1_1array__view.html">dmlc::array_view</a></div><div class="ttdoc">Read only data structure to reference continuous memory region of array. Provide unified view for vec...</div><div class="ttdef"><b>Definition:</b> array_view.h:36</div></div> |
| <div class="ttc" id="aclassnnvm_1_1IndexedGraph_html_a7591498bbad77ac6e50b2d376afaa1e3"><div class="ttname"><a href="classnnvm_1_1IndexedGraph.html#a7591498bbad77ac6e50b2d376afaa1e3">nnvm::IndexedGraph::node_id</a></div><div class="ttdeci">uint32_t node_id(const nnvm::Node *node) const</div><div class="ttdoc">Get the corresponding node id for a given Node in the IndexedGraph.</div><div class="ttdef"><b>Definition:</b> graph.h:165</div></div> |
| <div class="ttc" id="a3rdparty_2tvm_2nnvm_2include_2nnvm_2base_8h_html"><div class="ttname"><a href="3rdparty_2tvm_2nnvm_2include_2nnvm_2base_8h.html">base.h</a></div><div class="ttdoc">Configuration of nnvm as well as basic data structure.</div></div> |
| <div class="ttc" id="astructnnvm_1_1IndexedGraph_1_1NodeEntry_html_a0aa0a4dfb369844ecb63072cef7f7cd0"><div class="ttname"><a href="structnnvm_1_1IndexedGraph_1_1NodeEntry.html#a0aa0a4dfb369844ecb63072cef7f7cd0">nnvm::IndexedGraph::NodeEntry::version</a></div><div class="ttdeci">uint32_t version</div><div class="ttdoc">version of the node</div><div class="ttdef"><b>Definition:</b> graph.h:117</div></div> |
| <div class="ttc" id="anamespacennvm_html_a24f3e607ea360d951389b4b9b83eb7fe"><div class="ttname"><a href="namespacennvm.html#a24f3e607ea360d951389b4b9b83eb7fe">nnvm::PostOrderDFSVisit</a></div><div class="ttdeci">void PostOrderDFSVisit(const std::vector< GNode > &heads, FVisit fvisit, HashFunc hash, InDegree indegree, GetInput getinput)</div><div class="ttdef"><b>Definition:</b> graph.h:256</div></div> |
| <div class="ttc" id="aclassnnvm_1_1Graph_html_a6590464798f3a02e9edfe760bd7ece22"><div class="ttname"><a href="classnnvm_1_1Graph.html#a6590464798f3a02e9edfe760bd7ece22">nnvm::Graph::attrs</a></div><div class="ttdeci">std::unordered_map< std::string, std::shared_ptr< any > > attrs</div><div class="ttdoc">attributes of a graph Note that attribute is shared pointer and can be shared across graphs.</div><div class="ttdef"><b>Definition:</b> graph.h:61</div></div> |
| <div class="ttc" id="astructnnvm_1_1IndexedGraph_1_1Node_html_a1fb87e2c471af26277432adeb1c3396f"><div class="ttname"><a href="structnnvm_1_1IndexedGraph_1_1Node.html#a1fb87e2c471af26277432adeb1c3396f">nnvm::IndexedGraph::Node::weak_ref</a></div><div class="ttdeci">std::weak_ptr< nnvm::Node > weak_ref</div><div class="ttdoc">weak reference to node</div><div class="ttdef"><b>Definition:</b> graph.h:128</div></div> |
| <div class="ttc" id="aclassnnvm_1_1IndexedGraph_html_a9dc0c49b8629d32a3ec12bcc2b0df549"><div class="ttname"><a href="classnnvm_1_1IndexedGraph.html#a9dc0c49b8629d32a3ec12bcc2b0df549">nnvm::IndexedGraph::outputs</a></div><div class="ttdeci">const std::vector< NodeEntry > & outputs() const</div><div class="ttdef"><b>Definition:</b> graph.h:185</div></div> |
| <div class="ttc" id="astructnnvm_1_1IndexedGraph_1_1Node_html_a4ea5256c0e198c3b6585bc69153a1e4e"><div class="ttname"><a href="structnnvm_1_1IndexedGraph_1_1Node.html#a4ea5256c0e198c3b6585bc69153a1e4e">nnvm::IndexedGraph::Node::control_deps</a></div><div class="ttdeci">array_view< uint32_t > control_deps</div><div class="ttdoc">control flow dependencies to the node</div><div class="ttdef"><b>Definition:</b> graph.h:126</div></div> |
| <div class="ttc" id="anamespacennvm_html_a573897937ff3b88f0014feabb8e44a92"><div class="ttname"><a href="namespacennvm.html#a573897937ff3b88f0014feabb8e44a92">nnvm::ObjectPtr</a></div><div class="ttdeci">std::shared_ptr< Node > ObjectPtr</div><div class="ttdoc">we always used ObjectPtr for a reference pointer to the node, so this alias can be changed in case.</div><div class="ttdef"><b>Definition:</b> node.h:49</div></div> |
| <div class="ttc" id="aclassnnvm_1_1IndexedGraph_html_a96b3d5ce684df1beca8825f17bb761d0"><div class="ttname"><a href="classnnvm_1_1IndexedGraph.html#a96b3d5ce684df1beca8825f17bb761d0">nnvm::IndexedGraph::IndexedGraph</a></div><div class="ttdeci">IndexedGraph(const IndexedGraph &)=delete</div></div> |
| <div class="ttc" id="asymbolic_8h_html"><div class="ttname"><a href="symbolic_8h.html">symbolic.h</a></div><div class="ttdoc">Symbolic graph construction API.</div></div> |
| <div class="ttc" id="astructnnvm_1_1IndexedGraph_1_1Node_html_af5528f74fa38dc455701eb415571fb2a"><div class="ttname"><a href="structnnvm_1_1IndexedGraph_1_1Node.html#af5528f74fa38dc455701eb415571fb2a">nnvm::IndexedGraph::Node::inputs</a></div><div class="ttdeci">array_view< NodeEntry > inputs</div><div class="ttdoc">inputs to the node</div><div class="ttdef"><b>Definition:</b> graph.h:124</div></div> |
| <div class="ttc" id="astructnnvm_1_1IndexedGraph_1_1Node_html"><div class="ttname"><a href="structnnvm_1_1IndexedGraph_1_1Node.html">nnvm::IndexedGraph::Node</a></div><div class="ttdoc">Node data structure in IndexedGraph.</div><div class="ttdef"><b>Definition:</b> graph.h:120</div></div> |
| <div class="ttc" id="astructnnvm_1_1IndexedGraph_1_1NodeEntry_html_afb64f4be9e59c21f76c775495e7030c5"><div class="ttname"><a href="structnnvm_1_1IndexedGraph_1_1NodeEntry.html#afb64f4be9e59c21f76c775495e7030c5">nnvm::IndexedGraph::NodeEntry::index</a></div><div class="ttdeci">uint32_t index</div><div class="ttdoc">index of output from the source.</div><div class="ttdef"><b>Definition:</b> graph.h:115</div></div> |
| <div class="ttc" id="aclassnnvm_1_1Graph_html_ac3b5c307c14dd45179b0c916e8bb2220"><div class="ttname"><a href="classnnvm_1_1Graph.html#ac3b5c307c14dd45179b0c916e8bb2220">nnvm::Graph::GetAttr</a></div><div class="ttdeci">const T & GetAttr(const std::string &attr_name) const</div><div class="ttdoc">Get the immutable attribute from attrs.</div><div class="ttdef"><b>Definition:</b> graph.h:230</div></div> |
| <div class="ttc" id="anamespacennvm_html_a6b06865bedddb2bab9903e448120658c"><div class="ttname"><a href="namespacennvm.html#a6b06865bedddb2bab9903e448120658c">nnvm::DFSVisit</a></div><div class="ttdeci">void DFSVisit(const std::vector< NodeEntry > &heads, FVisit fvisit)</div><div class="ttdoc">perform a Post Order DFS visit to each node in the graph. This order is deterministic and is also top...</div><div class="ttdef"><b>Definition:</b> graph.h:284</div></div> |
| <div class="ttc" id="aclassnnvm_1_1IndexedGraph_html_a714885749b0905330dd744f23dd81ee1"><div class="ttname"><a href="classnnvm_1_1IndexedGraph.html#a714885749b0905330dd744f23dd81ee1">nnvm::IndexedGraph::input_nodes</a></div><div class="ttdeci">const std::vector< uint32_t > & input_nodes() const</div><div class="ttdef"><b>Definition:</b> graph.h:179</div></div> |
| <div class="ttc" id="aclassnnvm_1_1Graph_html_aef2d59ea8a92838e09fb852ec79be083"><div class="ttname"><a href="classnnvm_1_1Graph.html#aef2d59ea8a92838e09fb852ec79be083">nnvm::Graph::MoveCopyAttr</a></div><div class="ttdeci">T MoveCopyAttr(const std::string &attr_name)</div><div class="ttdoc">Get a move copy of the attribute, implement copy on write semantics. The content is moved if the refe...</div><div class="ttdef"><b>Definition:</b> graph.h:242</div></div> |
| <div class="ttc" id="aclassnnvm_1_1IndexedGraph_html_a631864da58d1a1d7a2f75597fa49af54"><div class="ttname"><a href="classnnvm_1_1IndexedGraph.html#a631864da58d1a1d7a2f75597fa49af54">nnvm::IndexedGraph::entry_id</a></div><div class="ttdeci">uint32_t entry_id(const nnvm::NodeEntry &e) const</div><div class="ttdoc">Get a unique entry id between 0 to num_node_entries() for a given NodeEntry.</div><div class="ttdef"><b>Definition:</b> graph.h:157</div></div> |
| <div class="ttc" id="astructnnvm_1_1NodeEntry_html"><div class="ttname"><a href="structnnvm_1_1NodeEntry.html">nnvm::NodeEntry</a></div><div class="ttdoc">an entry that represents output data from a node</div><div class="ttdef"><b>Definition:</b> node.h:52</div></div> |
| <div class="ttc" id="aclassnnvm_1_1IndexedGraph_html_a8b35a4d16e3fc611595e76e80da842aa"><div class="ttname"><a href="classnnvm_1_1IndexedGraph.html#a8b35a4d16e3fc611595e76e80da842aa">nnvm::IndexedGraph::exist</a></div><div class="ttdeci">bool exist(const nnvm::Node *node) const</div><div class="ttdef"><b>Definition:</b> graph.h:188</div></div> |
| <div class="ttc" id="a3rdparty_2tvm_2nnvm_2include_2nnvm_2node_8h_html"><div class="ttname"><a href="3rdparty_2tvm_2nnvm_2include_2nnvm_2node_8h.html">node.h</a></div><div class="ttdoc">Graph node data structure.</div></div> |
| <div class="ttc" id="astructnnvm_1_1NodeEntry_html_ae438981d6f9d3a890e197d917b9e1a4f"><div class="ttname"><a href="structnnvm_1_1NodeEntry.html#ae438981d6f9d3a890e197d917b9e1a4f">nnvm::NodeEntry::node</a></div><div class="ttdeci">ObjectPtr node</div><div class="ttdoc">the source node of this data</div><div class="ttdef"><b>Definition:</b> node.h:65</div></div> |
| <div class="ttc" id="aclassnnvm_1_1IndexedGraph_html_a483903874108e0de776a1d7eb976d90d"><div class="ttname"><a href="classnnvm_1_1IndexedGraph.html#a483903874108e0de776a1d7eb976d90d">nnvm::IndexedGraph::operator[]</a></div><div class="ttdeci">const Node & operator[](const nnvm::Node *node) const</div><div class="ttdoc">Get the corresponding Node structure.</div><div class="ttdef"><b>Definition:</b> graph.h:177</div></div> |
| <div class="ttc" id="astructnnvm_1_1IndexedGraph_1_1NodeEntry_html"><div class="ttname"><a href="structnnvm_1_1IndexedGraph_1_1NodeEntry.html">nnvm::IndexedGraph::NodeEntry</a></div><div class="ttdoc">represents a data in the graph</div><div class="ttdef"><b>Definition:</b> graph.h:111</div></div> |
| <div class="ttc" id="aclassnnvm_1_1IndexedGraph_html_a2b4330a003b45bf8f668df5c6c14eb2a"><div class="ttname"><a href="classnnvm_1_1IndexedGraph.html#a2b4330a003b45bf8f668df5c6c14eb2a">nnvm::IndexedGraph::num_nodes</a></div><div class="ttdeci">size_t num_nodes() const</div><div class="ttdef"><b>Definition:</b> graph.h:131</div></div> |
| <div class="ttc" id="aclassnnvm_1_1Graph_html_a1be6cd069643a2608625df12f49423eb"><div class="ttname"><a href="classnnvm_1_1Graph.html#a1be6cd069643a2608625df12f49423eb">nnvm::Graph::outputs</a></div><div class="ttdeci">std::vector< NodeEntry > outputs</div><div class="ttdoc">outputs of the computation graph.</div><div class="ttdef"><b>Definition:</b> graph.h:50</div></div> |
| <div class="ttc" id="anamespacennvm_html"><div class="ttname"><a href="namespacennvm.html">nnvm</a></div><div class="ttdef"><b>Definition:</b> base.h:35</div></div> |
| <!-- start footer part --> |
| <hr class="footer"/><address class="footer"><small> |
| Generated on Sun Aug 1 2021 20:32:48 for mxnet by  <a href="http://www.doxygen.org/index.html"> |
| <img class="footer" src="doxygen.png" alt="doxygen"/> |
| </a> 1.8.17 |
| </small></address> |
| </body> |
| </html> |