Google Git
Sign in
apache / mxnet-site / d5c5a235eef72f64ccaf224b834a20ef3287469b / . / versions / 1.9.1 / api / cpp / docs / api / graph_8h_source.html
blob: 8170f79f31be5cb7430502d6e3da7f2d071765a6 [file] [log] [blame]
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://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.13"/>
<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.13 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
<script type="text/javascript" src="menudata.js"></script>
<script type="text/javascript" src="menu.js"></script>
<script type="text/javascript">
$(function() {
initMenu('',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
});
</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>&#160;<span class="comment">/*</span></div><div class="line"><a name="l00002"></a><span class="lineno"> 2</span>&#160;<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>&#160;<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>&#160;<span class="comment"> * distributed with this work for additional information</span></div><div class="line"><a name="l00005"></a><span class="lineno"> 5</span>&#160;<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>&#160;<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>&#160;<span class="comment"> * &quot;License&quot;); you may not use this file except in compliance</span></div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span>&#160;<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>&#160;<span class="comment"> *</span></div><div class="line"><a name="l00010"></a><span class="lineno"> 10</span>&#160;<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>&#160;<span class="comment"> *</span></div><div class="line"><a name="l00012"></a><span class="lineno"> 12</span>&#160;<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>&#160;<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>&#160;<span class="comment"> * &quot;AS IS&quot; BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY</span></div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span>&#160;<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>&#160;<span class="comment"> * specific language governing permissions and limitations</span></div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span>&#160;<span class="comment"> * under the License.</span></div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span>&#160;<span class="comment"> */</span></div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span>&#160;</div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span>&#160;<span class="preprocessor">#ifndef NNVM_GRAPH_H_</span></div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span>&#160;<span class="preprocessor">#define NNVM_GRAPH_H_</span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span>&#160;</div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span>&#160;<span class="preprocessor">#include &lt;vector&gt;</span></div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span>&#160;<span class="preprocessor">#include &lt;string&gt;</span></div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span>&#160;<span class="preprocessor">#include &lt;utility&gt;</span></div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span>&#160;<span class="preprocessor">#include &lt;algorithm&gt;</span></div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span>&#160;<span class="preprocessor">#include &lt;memory&gt;</span></div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span>&#160;<span class="preprocessor">#include &lt;unordered_map&gt;</span></div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span>&#160;<span class="preprocessor">#include &lt;unordered_set&gt;</span></div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="3rdparty_2tvm_2nnvm_2include_2nnvm_2base_8h.html">base.h</a>&quot;</span></div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="3rdparty_2tvm_2nnvm_2include_2nnvm_2node_8h.html">node.h</a>&quot;</span></div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="symbolic_8h.html">symbolic.h</a>&quot;</span></div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span>&#160;</div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span>&#160;<span class="keyword">namespace </span><a class="code" href="namespacennvm.html">nnvm</a> {</div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span>&#160;</div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span>&#160;<span class="keyword">class </span>IndexedGraph;</div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span>&#160;</div><div class="line"><a name="l00046"></a><span class="lineno"><a class="line" href="classnnvm_1_1Graph.html"> 46</a></span>&#160;<span class="keyword">class </span><a class="code" href="classnnvm_1_1Graph.html">Graph</a> {</div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span>&#160; <span class="keyword">public</span>:</div><div class="line"><a name="l00049"></a><span class="lineno"><a class="line" href="classnnvm_1_1Graph.html#a1be6cd069643a2608625df12f49423eb"> 49</a></span>&#160; std::vector&lt;NodeEntry&gt; <a class="code" href="classnnvm_1_1Graph.html#a1be6cd069643a2608625df12f49423eb">outputs</a>;</div><div class="line"><a name="l00060"></a><span class="lineno"><a class="line" href="classnnvm_1_1Graph.html#a6590464798f3a02e9edfe760bd7ece22"> 60</a></span>&#160; std::unordered_map&lt;std::string, std::shared_ptr&lt;any&gt; &gt; <a class="code" href="classnnvm_1_1Graph.html#a6590464798f3a02e9edfe760bd7ece22">attrs</a>;</div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span>&#160; <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span>&#160; <span class="keyword">inline</span> <span class="keyword">const</span> T&amp; <a class="code" href="classnnvm_1_1Graph.html#ac3b5c307c14dd45179b0c916e8bb2220">GetAttr</a>(<span class="keyword">const</span> std::string&amp; attr_name) <span class="keyword">const</span>;</div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>&#160; <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&amp; attr_name) <span class="keyword">const</span>;</div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span>&#160; <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>&#160; <span class="keyword">inline</span> T <a class="code" href="classnnvm_1_1Graph.html#aef2d59ea8a92838e09fb852ec79be083">MoveCopyAttr</a>(<span class="keyword">const</span> std::string&amp; attr_name);</div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span>&#160; <span class="keyword">const</span> <a class="code" href="classnnvm_1_1IndexedGraph.html">IndexedGraph</a>&amp; <a class="code" href="classnnvm_1_1Graph.html#a428b2c98b62c8e74d48094e9e4d2b35c">indexed_graph</a>() <span class="keyword">const</span>;</div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span>&#160;</div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>&#160; <span class="keyword">private</span>:</div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>&#160; <span class="comment">// internal structure of indexed graph</span></div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>&#160; <span class="keyword">mutable</span> std::shared_ptr&lt;const IndexedGraph&gt; indexed_graph_;</div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span>&#160;};</div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span>&#160;</div><div class="line"><a name="l00107"></a><span class="lineno"><a class="line" href="classnnvm_1_1IndexedGraph.html"> 107</a></span>&#160;<span class="keyword">class </span><a class="code" href="classnnvm_1_1IndexedGraph.html">IndexedGraph</a> {</div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>&#160; <span class="keyword">public</span>:</div><div class="line"><a name="l00110"></a><span class="lineno"><a class="line" href="structnnvm_1_1IndexedGraph_1_1NodeEntry.html"> 110</a></span>&#160; <span class="keyword">struct </span><a class="code" href="structnnvm_1_1IndexedGraph_1_1NodeEntry.html">NodeEntry</a> {</div><div class="line"><a name="l00112"></a><span class="lineno"><a class="line" href="structnnvm_1_1IndexedGraph_1_1NodeEntry.html#ae73ae8527f6416a91d8d9c5457019688"> 112</a></span>&#160; uint32_t <a class="code" href="structnnvm_1_1IndexedGraph_1_1NodeEntry.html#ae73ae8527f6416a91d8d9c5457019688">node_id</a>;</div><div class="line"><a name="l00114"></a><span class="lineno"><a class="line" href="structnnvm_1_1IndexedGraph_1_1NodeEntry.html#afb64f4be9e59c21f76c775495e7030c5"> 114</a></span>&#160; uint32_t <a class="code" href="structnnvm_1_1IndexedGraph_1_1NodeEntry.html#afb64f4be9e59c21f76c775495e7030c5">index</a>;</div><div class="line"><a name="l00116"></a><span class="lineno"><a class="line" href="structnnvm_1_1IndexedGraph_1_1NodeEntry.html#a0aa0a4dfb369844ecb63072cef7f7cd0"> 116</a></span>&#160; uint32_t <a class="code" href="structnnvm_1_1IndexedGraph_1_1NodeEntry.html#a0aa0a4dfb369844ecb63072cef7f7cd0">version</a>;</div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>&#160; };</div><div class="line"><a name="l00119"></a><span class="lineno"><a class="line" href="structnnvm_1_1IndexedGraph_1_1Node.html"> 119</a></span>&#160; <span class="keyword">struct </span><a class="code" href="structnnvm_1_1IndexedGraph_1_1Node.html">Node</a> {</div><div class="line"><a name="l00121"></a><span class="lineno"><a class="line" href="structnnvm_1_1IndexedGraph_1_1Node.html#aa322c6e6c69854ea1743c62ba75364a7"> 121</a></span>&#160; <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="l00123"></a><span class="lineno"><a class="line" href="structnnvm_1_1IndexedGraph_1_1Node.html#af5528f74fa38dc455701eb415571fb2a"> 123</a></span>&#160; <a class="code" href="classdmlc_1_1array__view.html">array_view&lt;NodeEntry&gt;</a> <a class="code" href="structnnvm_1_1IndexedGraph_1_1Node.html#af5528f74fa38dc455701eb415571fb2a">inputs</a>;</div><div class="line"><a name="l00125"></a><span class="lineno"><a class="line" href="structnnvm_1_1IndexedGraph_1_1Node.html#a4ea5256c0e198c3b6585bc69153a1e4e"> 125</a></span>&#160; <a class="code" href="classdmlc_1_1array__view.html">array_view&lt;uint32_t&gt;</a> <a class="code" href="structnnvm_1_1IndexedGraph_1_1Node.html#a4ea5256c0e198c3b6585bc69153a1e4e">control_deps</a>;</div><div class="line"><a name="l00127"></a><span class="lineno"><a class="line" href="structnnvm_1_1IndexedGraph_1_1Node.html#a1fb87e2c471af26277432adeb1c3396f"> 127</a></span>&#160; std::weak_ptr&lt;nnvm::Node&gt; <a class="code" href="structnnvm_1_1IndexedGraph_1_1Node.html#a1fb87e2c471af26277432adeb1c3396f">weak_ref</a>;</div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>&#160; };</div><div class="line"><a name="l00130"></a><span class="lineno"><a class="line" href="classnnvm_1_1IndexedGraph.html#a2b4330a003b45bf8f668df5c6c14eb2a"> 130</a></span>&#160; <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>{</div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span>&#160; <span class="keywordflow">return</span> nodes_.size();</div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>&#160; }</div><div class="line"><a name="l00134"></a><span class="lineno"><a class="line" href="classnnvm_1_1IndexedGraph.html#a07ac7fc560d6814737e1c954e08cdd4a"> 134</a></span>&#160; <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>{</div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>&#160; <span class="keywordflow">return</span> entry_rptr_.back();</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>&#160; }</div><div class="line"><a name="l00144"></a><span class="lineno"><a class="line" href="classnnvm_1_1IndexedGraph.html#a30f64e8c479ca766d194c48b1e4b9dbd"> 144</a></span>&#160; <span class="keyword">inline</span> uint32_t <a class="code" href="classnnvm_1_1IndexedGraph.html#a30f64e8c479ca766d194c48b1e4b9dbd">entry_id</a>(uint32_t node_id, uint32_t index)<span class="keyword"> const </span>{</div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>&#160; <span class="keywordflow">return</span> entry_rptr_[node_id] + index;</div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>&#160; }</div><div class="line"><a name="l00153"></a><span class="lineno"><a class="line" href="classnnvm_1_1IndexedGraph.html#ab0343b19380e06575f64ec6bb91ba87c"> 153</a></span>&#160; <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>&amp; e)<span class="keyword"> const </span>{</div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span>&#160; <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="l00155"></a><span class="lineno"> 155</span>&#160; }</div><div class="line"><a name="l00162"></a><span class="lineno"><a class="line" href="classnnvm_1_1IndexedGraph.html#a631864da58d1a1d7a2f75597fa49af54"> 162</a></span>&#160; <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>&amp; e)<span class="keyword"> const </span>{</div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span>&#160; <span class="keywordflow">return</span> entry_rptr_[node_id(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="l00164"></a><span class="lineno"> 164</span>&#160; }</div><div class="line"><a name="l00170"></a><span class="lineno"><a class="line" href="classnnvm_1_1IndexedGraph.html#a7591498bbad77ac6e50b2d376afaa1e3"> 170</a></span>&#160; <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>{</div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span>&#160; <span class="keywordflow">return</span> node2index_.at(node);</div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span>&#160; }</div><div class="line"><a name="l00178"></a><span class="lineno"><a class="line" href="classnnvm_1_1IndexedGraph.html#add7f0a62896704f5bec992e2937e632f"> 178</a></span>&#160; <span class="keyword">inline</span> <span class="keyword">const</span> <a class="code" href="structnnvm_1_1IndexedGraph_1_1Node.html">Node</a>&amp; <a class="code" href="classnnvm_1_1IndexedGraph.html#add7f0a62896704f5bec992e2937e632f">operator[]</a>(uint32_t node_id)<span class="keyword"> const </span>{</div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span>&#160; <span class="keywordflow">return</span> nodes_[node_id];</div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span>&#160; }</div><div class="line"><a name="l00186"></a><span class="lineno"><a class="line" href="classnnvm_1_1IndexedGraph.html#a483903874108e0de776a1d7eb976d90d"> 186</a></span>&#160; <span class="keyword">inline</span> <span class="keyword">const</span> <a class="code" href="structnnvm_1_1IndexedGraph_1_1Node.html">Node</a>&amp; <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>{</div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span>&#160; <span class="keywordflow">return</span> nodes_[node_id(node)];</div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span>&#160; }</div><div class="line"><a name="l00190"></a><span class="lineno"><a class="line" href="classnnvm_1_1IndexedGraph.html#a714885749b0905330dd744f23dd81ee1"> 190</a></span>&#160; <span class="keyword">inline</span> <span class="keyword">const</span> std::vector&lt;uint32_t&gt;&amp; <a class="code" href="classnnvm_1_1IndexedGraph.html#a714885749b0905330dd744f23dd81ee1">input_nodes</a>()<span class="keyword"> const </span>{</div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span>&#160; <span class="keywordflow">return</span> input_nodes_;</div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span>&#160; }</div><div class="line"><a name="l00194"></a><span class="lineno"><a class="line" href="classnnvm_1_1IndexedGraph.html#acb41409fded35e301fd9bf65186397fb"> 194</a></span>&#160; <span class="keyword">inline</span> <span class="keyword">const</span> std::unordered_set&lt;uint32_t&gt;&amp; <a class="code" href="classnnvm_1_1IndexedGraph.html#acb41409fded35e301fd9bf65186397fb">mutable_input_nodes</a>()<span class="keyword"> const </span>{</div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span>&#160; <span class="keywordflow">return</span> mutable_input_nodes_;</div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span>&#160; }</div><div class="line"><a name="l00198"></a><span class="lineno"><a class="line" href="classnnvm_1_1IndexedGraph.html#a9dc0c49b8629d32a3ec12bcc2b0df549"> 198</a></span>&#160; <span class="keyword">inline</span> <span class="keyword">const</span> std::vector&lt;NodeEntry&gt;&amp; <a class="code" href="classnnvm_1_1IndexedGraph.html#a9dc0c49b8629d32a3ec12bcc2b0df549">outputs</a>()<span class="keyword"> const </span>{</div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span>&#160; <span class="keywordflow">return</span> outputs_;</div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span>&#160; }</div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span>&#160;</div><div class="line"><a name="l00203"></a><span class="lineno"><a class="line" href="classnnvm_1_1IndexedGraph.html#a8b35a4d16e3fc611595e76e80da842aa"> 203</a></span>&#160; <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>{</div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span>&#160; <span class="keywordflow">return</span> node2index_.count(node);</div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span>&#160; }</div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span>&#160;</div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span>&#160; <span class="comment">// disalllow copy assign</span></div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span>&#160; <a class="code" href="classnnvm_1_1IndexedGraph.html">IndexedGraph</a>(<span class="keyword">const</span> <a class="code" href="classnnvm_1_1IndexedGraph.html">IndexedGraph</a>&amp;) = <span class="keyword">delete</span>;</div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span>&#160;</div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span>&#160; <span class="keyword">private</span>:</div><div class="line"><a name="l00211"></a><span class="lineno"><a class="line" href="classnnvm_1_1IndexedGraph.html#afab89afd724f1b07b1aaad6bdc61c47a"> 211</a></span>&#160; <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="l00216"></a><span class="lineno"> 216</span>&#160; <span class="keyword">explicit</span> <a class="code" href="classnnvm_1_1IndexedGraph.html">IndexedGraph</a>(<span class="keyword">const</span> <a class="code" href="classnnvm_1_1Graph.html">Graph</a>&amp; other);</div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span>&#160; <span class="comment">// Node pointers in CSR structure.</span></div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span>&#160; std::vector&lt;Node&gt; nodes_;</div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span>&#160; <span class="comment">// Index to all input nodes.</span></div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span>&#160; std::vector&lt;uint32_t&gt; input_nodes_;</div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span>&#160; <span class="comment">// Index to all mutable input nodes.</span></div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span>&#160; std::unordered_set&lt;uint32_t&gt; mutable_input_nodes_;</div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span>&#160; <span class="comment">// space to store the outputs entries</span></div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span>&#160; std::vector&lt;NodeEntry&gt; outputs_;</div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span>&#160; <span class="comment">// mapping from node to index.</span></div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span>&#160; std::unordered_map&lt;const nnvm::Node*, uint32_t&gt; node2index_;</div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span>&#160; <span class="comment">// CSR pointer of node entries</span></div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span>&#160; std::vector&lt;size_t&gt; entry_rptr_;</div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span>&#160; <span class="comment">// space to store input entries of each</span></div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span>&#160; std::vector&lt;NodeEntry&gt; input_entries_;</div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span>&#160; <span class="comment">// control flow dependencies</span></div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span>&#160; std::vector&lt;uint32_t&gt; control_deps_;</div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span>&#160;};</div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span>&#160;</div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> FVisit&gt;</div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span>&#160;<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&lt;NodeEntry&gt;&amp; heads, FVisit fvisit);</div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span>&#160;</div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span>&#160;<span class="comment">// inline function implementations</span></div><div class="line"><a name="l00246"></a><span class="lineno"> 246</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div><div class="line"><a name="l00247"></a><span class="lineno"><a class="line" href="classnnvm_1_1Graph.html#ac3b5c307c14dd45179b0c916e8bb2220"> 247</a></span>&#160;<span class="keyword">inline</span> <span class="keyword">const</span> T&amp; <a class="code" href="classnnvm_1_1Graph.html#ac3b5c307c14dd45179b0c916e8bb2220">Graph::GetAttr</a>(<span class="keyword">const</span> std::string&amp; attr_name)<span class="keyword"> const </span>{</div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span>&#160; <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="l00249"></a><span class="lineno"> 249</span>&#160; CHECK(it != <a class="code" href="classnnvm_1_1Graph.html#a6590464798f3a02e9edfe760bd7ece22">attrs</a>.end())</div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span>&#160; &lt;&lt; <span class="stringliteral">&quot;Cannot find attribute &quot;</span> &lt;&lt; attr_name &lt;&lt; <span class="stringliteral">&quot; in the graph&quot;</span>;</div><div class="line"><a name="l00251"></a><span class="lineno"> 251</span>&#160; <span class="keywordflow">return</span> nnvm::unsafe_get&lt;T&gt;(*it-&gt;second);</div><div class="line"><a name="l00252"></a><span class="lineno"> 252</span>&#160;}</div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span>&#160;</div><div class="line"><a name="l00254"></a><span class="lineno"><a class="line" href="classnnvm_1_1Graph.html#a493eda4cf584454f1fb10419d0a87790"> 254</a></span>&#160;<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&amp; attr_name)<span class="keyword"> const </span>{</div><div class="line"><a name="l00255"></a><span class="lineno"> 255</span>&#160; <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="l00256"></a><span class="lineno"> 256</span>&#160; <span class="keywordflow">return</span> it != <a class="code" href="classnnvm_1_1Graph.html#a6590464798f3a02e9edfe760bd7ece22">attrs</a>.end();</div><div class="line"><a name="l00257"></a><span class="lineno"> 257</span>&#160;}</div><div class="line"><a name="l00258"></a><span class="lineno"> 258</span>&#160;</div><div class="line"><a name="l00259"></a><span class="lineno"> 259</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div><div class="line"><a name="l00260"></a><span class="lineno"><a class="line" href="classnnvm_1_1Graph.html#aef2d59ea8a92838e09fb852ec79be083"> 260</a></span>&#160;<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&amp; attr_name) {</div><div class="line"><a name="l00261"></a><span class="lineno"> 261</span>&#160; <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="l00262"></a><span class="lineno"> 262</span>&#160; CHECK(it != <a class="code" href="classnnvm_1_1Graph.html#a6590464798f3a02e9edfe760bd7ece22">attrs</a>.end())</div><div class="line"><a name="l00263"></a><span class="lineno"> 263</span>&#160; &lt;&lt; <span class="stringliteral">&quot;Cannot find attribute &quot;</span> &lt;&lt; attr_name &lt;&lt; <span class="stringliteral">&quot; in the graph&quot;</span>;</div><div class="line"><a name="l00264"></a><span class="lineno"> 264</span>&#160; std::shared_ptr&lt;any&gt; sptr = it-&gt;second;</div><div class="line"><a name="l00265"></a><span class="lineno"> 265</span>&#160; <a class="code" href="classnnvm_1_1Graph.html#a6590464798f3a02e9edfe760bd7ece22">attrs</a>.erase(it);</div><div class="line"><a name="l00266"></a><span class="lineno"> 266</span>&#160; <span class="keywordflow">if</span> (sptr.unique()) {</div><div class="line"><a name="l00267"></a><span class="lineno"> 267</span>&#160; <span class="keywordflow">return</span> std::move(nnvm::get&lt;T&gt;(*sptr));</div><div class="line"><a name="l00268"></a><span class="lineno"> 268</span>&#160; } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00269"></a><span class="lineno"> 269</span>&#160; <span class="keywordflow">return</span> nnvm::get&lt;T&gt;(*sptr);</div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span>&#160; }</div><div class="line"><a name="l00271"></a><span class="lineno"> 271</span>&#160;}</div><div class="line"><a name="l00272"></a><span class="lineno"> 272</span>&#160;</div><div class="line"><a name="l00273"></a><span class="lineno"> 273</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">typename</span> GNode, <span class="keyword">typename</span> HashType,</div><div class="line"><a name="l00274"></a><span class="lineno"> 274</span>&#160; <span class="keyword">typename</span> FVisit, <span class="keyword">typename</span> HashFunc,</div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span>&#160; <span class="keyword">typename</span> InDegree, <span class="keyword">typename</span> GetInput&gt;</div><div class="line"><a name="l00276"></a><span class="lineno"><a class="line" href="namespacennvm.html#a24f3e607ea360d951389b4b9b83eb7fe"> 276</a></span>&#160;<span class="keywordtype">void</span> <a class="code" href="namespacennvm.html#a24f3e607ea360d951389b4b9b83eb7fe">PostOrderDFSVisit</a>(<span class="keyword">const</span> std::vector&lt;GNode&gt;&amp; heads,</div><div class="line"><a name="l00277"></a><span class="lineno"> 277</span>&#160; FVisit fvisit,</div><div class="line"><a name="l00278"></a><span class="lineno"> 278</span>&#160; HashFunc hash,</div><div class="line"><a name="l00279"></a><span class="lineno"> 279</span>&#160; InDegree indegree,</div><div class="line"><a name="l00280"></a><span class="lineno"> 280</span>&#160; GetInput getinput) {</div><div class="line"><a name="l00281"></a><span class="lineno"> 281</span>&#160; std::vector&lt;std::pair&lt;GNode, uint32_t&gt; &gt; stack;</div><div class="line"><a name="l00282"></a><span class="lineno"> 282</span>&#160; std::unordered_set&lt;HashType&gt; visited;</div><div class="line"><a name="l00283"></a><span class="lineno"> 283</span>&#160; <span class="keywordflow">for</span> (<span class="keyword">auto</span>&amp; head : heads) {</div><div class="line"><a name="l00284"></a><span class="lineno"> 284</span>&#160; HashType head_hash = hash(head);</div><div class="line"><a name="l00285"></a><span class="lineno"> 285</span>&#160; <span class="keywordflow">if</span> (visited.count(head_hash) == 0) {</div><div class="line"><a name="l00286"></a><span class="lineno"> 286</span>&#160; stack.push_back(std::make_pair(head, 0));</div><div class="line"><a name="l00287"></a><span class="lineno"> 287</span>&#160; visited.insert(head_hash);</div><div class="line"><a name="l00288"></a><span class="lineno"> 288</span>&#160; }</div><div class="line"><a name="l00289"></a><span class="lineno"> 289</span>&#160; <span class="keywordflow">while</span> (!stack.empty()) {</div><div class="line"><a name="l00290"></a><span class="lineno"> 290</span>&#160; std::pair&lt;GNode, uint32_t&gt;&amp; back = stack.back();</div><div class="line"><a name="l00291"></a><span class="lineno"> 291</span>&#160; <span class="keywordflow">if</span> (back.second == indegree(back.first)) {</div><div class="line"><a name="l00292"></a><span class="lineno"> 292</span>&#160; fvisit(back.first);</div><div class="line"><a name="l00293"></a><span class="lineno"> 293</span>&#160; stack.pop_back();</div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span>&#160; } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00295"></a><span class="lineno"> 295</span>&#160; <span class="keyword">const</span> GNode&amp; input = getinput(back.first, back.second++);</div><div class="line"><a name="l00296"></a><span class="lineno"> 296</span>&#160; HashType input_hash = hash(input);</div><div class="line"><a name="l00297"></a><span class="lineno"> 297</span>&#160; <span class="keywordflow">if</span> (visited.count(input_hash) == 0) {</div><div class="line"><a name="l00298"></a><span class="lineno"> 298</span>&#160; stack.push_back(std::make_pair(input, 0));</div><div class="line"><a name="l00299"></a><span class="lineno"> 299</span>&#160; visited.insert(input_hash);</div><div class="line"><a name="l00300"></a><span class="lineno"> 300</span>&#160; }</div><div class="line"><a name="l00301"></a><span class="lineno"> 301</span>&#160; }</div><div class="line"><a name="l00302"></a><span class="lineno"> 302</span>&#160; }</div><div class="line"><a name="l00303"></a><span class="lineno"> 303</span>&#160; }</div><div class="line"><a name="l00304"></a><span class="lineno"> 304</span>&#160;}</div><div class="line"><a name="l00305"></a><span class="lineno"> 305</span>&#160;</div><div class="line"><a name="l00306"></a><span class="lineno"> 306</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> FVisit&gt;</div><div class="line"><a name="l00307"></a><span class="lineno"><a class="line" href="namespacennvm.html#a6b06865bedddb2bab9903e448120658c"> 307</a></span>&#160;<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&lt;NodeEntry&gt;&amp; heads,</div><div class="line"><a name="l00308"></a><span class="lineno"> 308</span>&#160; FVisit fvisit) {</div><div class="line"><a name="l00309"></a><span class="lineno"> 309</span>&#160; <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="l00310"></a><span class="lineno"> 310</span>&#160; std::vector&lt;GNode&gt; head_nodes(heads.size());</div><div class="line"><a name="l00311"></a><span class="lineno"> 311</span>&#160; std::transform(heads.begin(), heads.end(), head_nodes.begin(),</div><div class="line"><a name="l00312"></a><span class="lineno"> 312</span>&#160; [](<span class="keyword">const</span> <a class="code" href="structnnvm_1_1NodeEntry.html">NodeEntry</a>&amp; e)-&gt;GNode {</div><div class="line"><a name="l00313"></a><span class="lineno"> 313</span>&#160; <span class="keywordflow">return</span> &amp;e.node;</div><div class="line"><a name="l00314"></a><span class="lineno"> 314</span>&#160; });</div><div class="line"><a name="l00315"></a><span class="lineno"> 315</span>&#160; PostOrderDFSVisit&lt;GNode, Node*&gt;(</div><div class="line"><a name="l00316"></a><span class="lineno"> 316</span>&#160; head_nodes,</div><div class="line"><a name="l00317"></a><span class="lineno"> 317</span>&#160; [fvisit](GNode n) {</div><div class="line"><a name="l00318"></a><span class="lineno"> 318</span>&#160; fvisit(*n);</div><div class="line"><a name="l00319"></a><span class="lineno"> 319</span>&#160; }, <span class="comment">// FVisit</span></div><div class="line"><a name="l00320"></a><span class="lineno"> 320</span>&#160; [](GNode n)-&gt;<a class="code" href="classnnvm_1_1Node.html">Node</a>* {</div><div class="line"><a name="l00321"></a><span class="lineno"> 321</span>&#160; <span class="keywordflow">return</span> n-&gt;get();</div><div class="line"><a name="l00322"></a><span class="lineno"> 322</span>&#160; }, <span class="comment">// HashFunc</span></div><div class="line"><a name="l00323"></a><span class="lineno"> 323</span>&#160; [](GNode n)-&gt;uint32_t { <span class="comment">// InDegree</span></div><div class="line"><a name="l00324"></a><span class="lineno"> 324</span>&#160; <span class="keywordflow">if</span> (!(*n)) <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00325"></a><span class="lineno"> 325</span>&#160; <span class="keywordflow">return</span> (*n)-&gt;<a class="code" href="classnnvm_1_1Node.html#a1be3a2e4759dc6239332cb9657c5c11d">inputs</a>.size() + (*n)-&gt;control_deps.size();</div><div class="line"><a name="l00326"></a><span class="lineno"> 326</span>&#160; },</div><div class="line"><a name="l00327"></a><span class="lineno"> 327</span>&#160; [](GNode n, uint32_t index)-&gt;GNode { <span class="comment">// GetInput</span></div><div class="line"><a name="l00328"></a><span class="lineno"> 328</span>&#160; <span class="keywordflow">if</span> (index &lt; (*n)-&gt;inputs.size()) {</div><div class="line"><a name="l00329"></a><span class="lineno"> 329</span>&#160; <span class="keywordflow">return</span> &amp;(*n)-&gt;inputs.at(index).node;</div><div class="line"><a name="l00330"></a><span class="lineno"> 330</span>&#160; } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00331"></a><span class="lineno"> 331</span>&#160; <span class="keywordflow">return</span> &amp;(*n)-&gt;control_deps.at(index - (*n)-&gt;inputs.size());</div><div class="line"><a name="l00332"></a><span class="lineno"> 332</span>&#160; }</div><div class="line"><a name="l00333"></a><span class="lineno"> 333</span>&#160; });</div><div class="line"><a name="l00334"></a><span class="lineno"> 334</span>&#160;}</div><div class="line"><a name="l00335"></a><span class="lineno"> 335</span>&#160;</div><div class="line"><a name="l00336"></a><span class="lineno"> 336</span>&#160;} <span class="comment">// namespace nnvm</span></div><div class="line"><a name="l00337"></a><span class="lineno"> 337</span>&#160;</div><div class="line"><a name="l00338"></a><span class="lineno"> 338</span>&#160;<span class="preprocessor">#endif // NNVM_GRAPH_H_</span></div><div class="ttc" id="classdmlc_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="namespacennvm_html"><div class="ttname"><a href="namespacennvm.html">nnvm</a></div><div class="ttdef"><b>Definition:</b> base.h:35</div></div>
<div class="ttc" id="namespacennvm_html_a24f3e607ea360d951389b4b9b83eb7fe"><div class="ttname"><a href="namespacennvm.html#a24f3e607ea360d951389b4b9b83eb7fe">nnvm::PostOrderDFSVisit</a></div><div class="ttdeci">void PostOrderDFSVisit(const std::vector&lt; GNode &gt; &amp;heads, FVisit fvisit, HashFunc hash, InDegree indegree, GetInput getinput)</div><div class="ttdef"><b>Definition:</b> graph.h:276</div></div>
<div class="ttc" id="classnnvm_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:130</div></div>
<div class="ttc" id="classnnvm_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:134</div></div>
<div class="ttc" id="classnnvm_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 &amp; 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="classnnvm_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 &amp;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:260</div></div>
<div class="ttc" id="structnnvm_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:75</div></div>
<div class="ttc" id="classnnvm_1_1Node_html_a1be3a2e4759dc6239332cb9657c5c11d"><div class="ttname"><a href="classnnvm_1_1Node.html#a1be3a2e4759dc6239332cb9657c5c11d">nnvm::Node::inputs</a></div><div class="ttdeci">std::vector&lt; NodeEntry &gt; inputs</div><div class="ttdoc">inputs to this node </div><div class="ttdef"><b>Definition:</b> node.h:165</div></div>
<div class="ttc" id="structnnvm_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:119</div></div>
<div class="ttc" id="structnnvm_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&lt; uint32_t &gt; control_deps</div><div class="ttdoc">control flow dependencies to the node </div><div class="ttdef"><b>Definition:</b> graph.h:125</div></div>
<div class="ttc" id="structnnvm_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:121</div></div>
<div class="ttc" id="3rdparty_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="classnnvm_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&lt; std::string, std::shared_ptr&lt; any &gt; &gt; 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:60</div></div>
<div class="ttc" id="structnnvm_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&lt; nnvm::Node &gt; weak_ref</div><div class="ttdoc">weak reference to node </div><div class="ttdef"><b>Definition:</b> graph.h:127</div></div>
<div class="ttc" id="classnnvm_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:155</div></div>
<div class="ttc" id="namespacennvm_html_a6b06865bedddb2bab9903e448120658c"><div class="ttname"><a href="namespacennvm.html#a6b06865bedddb2bab9903e448120658c">nnvm::DFSVisit</a></div><div class="ttdeci">void DFSVisit(const std::vector&lt; NodeEntry &gt; &amp;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:307</div></div>
<div class="ttc" id="classnnvm_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:46</div></div>
<div class="ttc" id="classnnvm_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:203</div></div>
<div class="ttc" id="classnnvm_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 &amp;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:162</div></div>
<div class="ttc" id="classnnvm_1_1Graph_html_ac3b5c307c14dd45179b0c916e8bb2220"><div class="ttname"><a href="classnnvm_1_1Graph.html#ac3b5c307c14dd45179b0c916e8bb2220">nnvm::Graph::GetAttr</a></div><div class="ttdeci">const T &amp; GetAttr(const std::string &amp;attr_name) const</div><div class="ttdoc">Get the immutable attribute from attrs. </div><div class="ttdef"><b>Definition:</b> graph.h:247</div></div>
<div class="ttc" id="classnnvm_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:107</div></div>
<div class="ttc" id="structnnvm_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:116</div></div>
<div class="ttc" id="classnnvm_1_1IndexedGraph_html_add7f0a62896704f5bec992e2937e632f"><div class="ttname"><a href="classnnvm_1_1IndexedGraph.html#add7f0a62896704f5bec992e2937e632f">nnvm::IndexedGraph::operator[]</a></div><div class="ttdeci">const Node &amp; 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:178</div></div>
<div class="ttc" id="classnnvm_1_1IndexedGraph_html_a483903874108e0de776a1d7eb976d90d"><div class="ttname"><a href="classnnvm_1_1IndexedGraph.html#a483903874108e0de776a1d7eb976d90d">nnvm::IndexedGraph::operator[]</a></div><div class="ttdeci">const Node &amp; operator[](const nnvm::Node *node) const</div><div class="ttdoc">Get the corresponding Node structure. </div><div class="ttdef"><b>Definition:</b> graph.h:186</div></div>
<div class="ttc" id="structnnvm_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:51</div></div>
<div class="ttc" id="structnnvm_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:114</div></div>
<div class="ttc" id="structnnvm_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:112</div></div>
<div class="ttc" id="classnnvm_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:144</div></div>
<div class="ttc" id="structnnvm_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&lt; NodeEntry &gt; inputs</div><div class="ttdoc">inputs to the node </div><div class="ttdef"><b>Definition:</b> graph.h:123</div></div>
<div class="ttc" id="structnnvm_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:110</div></div>
<div class="ttc" id="classnnvm_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&lt; uint32_t &gt; &amp; mutable_input_nodes() const</div><div class="ttdef"><b>Definition:</b> graph.h:194</div></div>
<div class="ttc" id="classnnvm_1_1Graph_html_a1be6cd069643a2608625df12f49423eb"><div class="ttname"><a href="classnnvm_1_1Graph.html#a1be6cd069643a2608625df12f49423eb">nnvm::Graph::outputs</a></div><div class="ttdeci">std::vector&lt; NodeEntry &gt; outputs</div><div class="ttdoc">outputs of the computation graph. </div><div class="ttdef"><b>Definition:</b> graph.h:49</div></div>
<div class="ttc" id="classnnvm_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:170</div></div>
<div class="ttc" id="classnnvm_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 &amp;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:153</div></div>
<div class="ttc" id="symbolic_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="classnnvm_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&lt; NodeEntry &gt; &amp; outputs() const</div><div class="ttdef"><b>Definition:</b> graph.h:198</div></div>
<div class="ttc" id="structnnvm_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:77</div></div>
<div class="ttc" id="classnnvm_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&lt; uint32_t &gt; &amp; input_nodes() const</div><div class="ttdef"><b>Definition:</b> graph.h:190</div></div>
<div class="ttc" id="namespacennvm_html_a573897937ff3b88f0014feabb8e44a92"><div class="ttname"><a href="namespacennvm.html#a573897937ff3b88f0014feabb8e44a92">nnvm::ObjectPtr</a></div><div class="ttdeci">std::shared_ptr&lt; Node &gt; 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:48</div></div>
<div class="ttc" id="3rdparty_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="classnnvm_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 &amp;attr_name) const</div><div class="ttdoc">Check whether has a specific attribute. </div><div class="ttdef"><b>Definition:</b> graph.h:254</div></div>
</div><!-- fragment --></div><!-- contents -->
<!-- start footer part -->
<hr class="footer"/><address class="footer"><small>
Generated on Thu Jan 5 2023 00:58:42 for mxnet by &#160;<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/>
</a> 1.8.13
</small></address>
</body>
</html>