Gitiles
Code Review Sign In
review.mlplatform.org / ml / armnn / refs/heads/gh-pages / . / 24.02 / _single_axis_priority_list_8cpp_source.html
blob: b768c0a2283fcdb214e9e0ab4c8b4a4a76bf8fa0 [file] [log] [blame]
Nikhil Raj38b600d2024-02-15 15:02:19 +0000[diff] [blame]1<!-- HTML header for doxygen 1.8.17-->
2<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
3<html xmlns="http://www.w3.org/1999/xhtml">
4<head>
5<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
6<meta http-equiv="X-UA-Compatible" content="IE=9"/>
7<meta name="generator" content="Doxygen 1.8.17"/>
8<meta name="viewport" content="width=device-width, initial-scale=1"/>
9<title>Arm NN: src/backends/backendsCommon/memoryOptimizerStrategyLibrary/strategies/SingleAxisPriorityList.cpp Source File</title>
10<link href="tabs.css" rel="stylesheet" type="text/css"/>
11<script type="text/javascript" src="jquery.js"></script>
12<script type="text/javascript" src="dynsections.js"></script>
13<link href="navtree.css" rel="stylesheet" type="text/css"/>
14<script type="text/javascript" src="resize.js"></script>
15<script type="text/javascript" src="navtreedata.js"></script>
16<script type="text/javascript" src="navtree.js"></script>
17<link href="search/search.css" rel="stylesheet" type="text/css"/>
18<script type="text/javascript" src="search/searchdata.js"></script>
19<script type="text/javascript" src="search/search.js"></script>
20<script type="text/x-mathjax-config">
21 MathJax.Hub.Config({
22 extensions: ["tex2jax.js"],
23 jax: ["input/TeX","output/HTML-CSS"],
24});
25</script>
26<script type="text/javascript" async="async" src="http://cdn.mathjax.org/mathjax/latest/MathJax.js"></script>
27<link href="doxygen.css" rel="stylesheet" type="text/css" />
28<link href="customdoxygen.css" rel="stylesheet" type="text/css"/>
29</head>
30<body>
31<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
32<div id="titlearea">
33<table cellspacing="0" cellpadding="0">
34 <tbody>
35 <tr style="height: 56px;">
36 <img alt="ArmNN" src="Arm_NN_horizontal_blue.png" style="max-width: 15rem; margin-top: .5rem; margin-left 13px"/>
37 <td id="projectalign" style="padding-left: 0.9em;">
38 <div id="projectname">
39 &#160;<span id="projectnumber">24.02</span>
40 </div>
41 </td>
42 </tr>
43 </tbody>
44</table>
45</div>
46<!-- end header part -->
47<!-- Generated by Doxygen 1.8.17 -->
48<script type="text/javascript">
49/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
50var searchBox = new SearchBox("searchBox", "search",false,'Search');
51/* @license-end */
52</script>
53<script type="text/javascript" src="menudata.js"></script>
54<script type="text/javascript" src="menu.js"></script>
55<script type="text/javascript">
56/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
57$(function() {
58 initMenu('',true,false,'search.php','Search');
59 $(document).ready(function() { init_search(); });
60});
61/* @license-end */</script>
62<div id="main-nav"></div>
63</div><!-- top -->
64<div id="side-nav" class="ui-resizable side-nav-resizable">
65 <div id="nav-tree">
66 <div id="nav-tree-contents">
67 <div id="nav-sync" class="sync"></div>
68 </div>
69 </div>
70 <div id="splitbar" style="-moz-user-select:none;"
71 class="ui-resizable-handle">
72 </div>
73</div>
74<script type="text/javascript">
75/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
76$(document).ready(function(){initNavTree('_single_axis_priority_list_8cpp_source.html',''); initResizable(); });
77/* @license-end */
78</script>
79<div id="doc-content">
80<!-- window showing the filter options -->
81<div id="MSearchSelectWindow"
82 onmouseover="return searchBox.OnSearchSelectShow()"
83 onmouseout="return searchBox.OnSearchSelectHide()"
84 onkeydown="return searchBox.OnSearchSelectKey(event)">
85</div>
86
87<!-- iframe showing the search results (closed by default) -->
88<div id="MSearchResultsWindow">
89<iframe src="javascript:void(0)" frameborder="0"
90 name="MSearchResults" id="MSearchResults">
91</iframe>
92</div>
93
94<div class="header">
95 <div class="headertitle">
96<div class="title">SingleAxisPriorityList.cpp</div> </div>
97</div><!--header-->
98<div class="contents">
99<a href="_single_axis_priority_list_8cpp.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>
100<div class="line"><a name="l00002"></a><span class="lineno"> 2</span>&#160;<span class="comment">// Copyright © 2021 Arm Ltd and Contributors. All rights reserved.</span></div>
101<div class="line"><a name="l00003"></a><span class="lineno"> 3</span>&#160;<span class="comment">// SPDX-License-Identifier: MIT</span></div>
102<div class="line"><a name="l00004"></a><span class="lineno"> 4</span>&#160;<span class="comment">//</span></div>
103<div class="line"><a name="l00005"></a><span class="lineno"> 5</span>&#160; </div>
104<div class="line"><a name="l00006"></a><span class="lineno"> 6</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="_single_axis_priority_list_8hpp.html">SingleAxisPriorityList.hpp</a>&quot;</span></div>
105<div class="line"><a name="l00007"></a><span class="lineno"> 7</span>&#160; </div>
106<div class="line"><a name="l00008"></a><span class="lineno"> 8</span>&#160;<span class="preprocessor">#include &lt;algorithm&gt;</span></div>
107<div class="line"><a name="l00009"></a><span class="lineno"> 9</span>&#160;<span class="preprocessor">#include &lt;cstdlib&gt;</span></div>
108<div class="line"><a name="l00010"></a><span class="lineno"> 10</span>&#160; </div>
109<div class="line"><a name="l00011"></a><span class="lineno"> 11</span>&#160;<span class="preprocessor">#include &lt;iostream&gt;</span></div>
110<div class="line"><a name="l00012"></a><span class="lineno"> 12</span>&#160; </div>
111<div class="line"><a name="l00013"></a><span class="lineno"> 13</span>&#160;<span class="keyword">namespace </span><a class="code" href="namespacearmnn.html">armnn</a></div>
112<div class="line"><a name="l00014"></a><span class="lineno"> 14</span>&#160;{</div>
113<div class="line"><a name="l00015"></a><span class="lineno"> 15</span>&#160; </div>
114<div class="line"><a name="l00016"></a><span class="lineno"> 16</span>&#160;<span class="comment">// This strategy uses a vector of size_ts/words to represent occupancy of a memBlock in a memBin.</span></div>
115<div class="line"><a name="l00017"></a><span class="lineno"> 17</span>&#160;<span class="comment">// Where each bit represents occupancy of a single time-step in that lifetime.</span></div>
116<div class="line"><a name="l00018"></a><span class="lineno"> 18</span>&#160;<span class="comment">// We can then use bit masks to check for overlaps of memBlocks along the lifetime</span></div>
117<div class="line"><a name="l00019"></a><span class="lineno"> 19</span>&#160; </div>
118<div class="line"><a name="l00020"></a><span class="lineno"> 20</span>&#160;<span class="comment">// For more information on the algorithm itself see: https://arxiv.org/pdf/2001.03288.pdf</span></div>
119<div class="line"><a name="l00021"></a><span class="lineno"> 21</span>&#160;<span class="comment">// This strategy is an implementation of 4.3 Greedy by Size</span></div>
120<div class="line"><a name="l00022"></a><span class="lineno"><a class="line" href="namespacearmnn.html#aa2b4a5cd5b7f1555cba80a6072824024"> 22</a></span>&#160;constexpr <span class="keywordtype">size_t</span> <a class="code" href="namespacearmnn.html#aa2b4a5cd5b7f1555cba80a6072824024">wordSize</a> = <span class="keyword">sizeof</span>(size_t) * 8;</div>
121<div class="line"><a name="l00023"></a><span class="lineno"> 23</span>&#160; </div>
122<div class="line"><a name="l00024"></a><span class="lineno"><a class="line" href="classarmnn_1_1_single_axis_priority_list.html#a84ae72d221e80b93c2246b44a50fa361"> 24</a></span>&#160;std::string <a class="code" href="classarmnn_1_1_single_axis_priority_list.html#a84ae72d221e80b93c2246b44a50fa361">SingleAxisPriorityList::GetName</a>()<span class="keyword"> const </span>{</div>
123<div class="line"><a name="l00025"></a><span class="lineno"> 25</span>&#160; <span class="keywordflow">return</span> m_Name;</div>
124<div class="line"><a name="l00026"></a><span class="lineno"> 26</span>&#160;}</div>
125<div class="line"><a name="l00027"></a><span class="lineno"> 27</span>&#160; </div>
126<div class="line"><a name="l00028"></a><span class="lineno"><a class="line" href="classarmnn_1_1_single_axis_priority_list.html#acd35ef4810ce3b938f5454bdee0cb826"> 28</a></span>&#160;<a class="code" href="namespacearmnn.html#a7100de49939c3e393101f78d425a98c6">MemBlockStrategyType</a> <a class="code" href="classarmnn_1_1_single_axis_priority_list.html#acd35ef4810ce3b938f5454bdee0cb826">SingleAxisPriorityList::GetMemBlockStrategyType</a>()<span class="keyword"> const </span>{</div>
127<div class="line"><a name="l00029"></a><span class="lineno"> 29</span>&#160; <span class="keywordflow">return</span> m_MemBlockStrategyType;</div>
128<div class="line"><a name="l00030"></a><span class="lineno"> 30</span>&#160;}</div>
129<div class="line"><a name="l00031"></a><span class="lineno"> 31</span>&#160; </div>
130<div class="line"><a name="l00032"></a><span class="lineno"> 32</span>&#160;<span class="keyword">struct </span>SingleAxisPriorityList::BinTracker</div>
131<div class="line"><a name="l00033"></a><span class="lineno"> 33</span>&#160;{</div>
132<div class="line"><a name="l00034"></a><span class="lineno"> 34</span>&#160; <span class="comment">// maxLifeTime is the number of operators in the model</span></div>
133<div class="line"><a name="l00035"></a><span class="lineno"> 35</span>&#160; <span class="comment">// We then divide that by wordSize to get the number of words we need to store all the lifetimes</span></div>
134<div class="line"><a name="l00036"></a><span class="lineno"> 36</span>&#160; BinTracker(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> maxLifeTime)</div>
135<div class="line"><a name="l00037"></a><span class="lineno"> 37</span>&#160; : m_OccupiedSpaces(1 + maxLifeTime/<a class="code" href="namespacearmnn.html#aa2b4a5cd5b7f1555cba80a6072824024">wordSize</a>, 0)</div>
136<div class="line"><a name="l00038"></a><span class="lineno"> 38</span>&#160; {}</div>
137<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>&#160; </div>
138<div class="line"><a name="l00040"></a><span class="lineno"> 40</span>&#160; <span class="comment">// Add a block of a single word size to the bin</span></div>
139<div class="line"><a name="l00041"></a><span class="lineno"> 41</span>&#160; <span class="keywordtype">void</span> AddBlock(MemBlock* block, <span class="keyword">const</span> <span class="keywordtype">size_t</span> word, <span class="keyword">const</span> <span class="keywordtype">size_t</span> index)</div>
140<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>&#160; {</div>
141<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>&#160; m_OccupiedSpaces[index] = m_OccupiedSpaces[index] | word;</div>
142<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>&#160; </div>
143<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>&#160; m_PlacedBlocks.push_back(block);</div>
144<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>&#160; m_MemSize = std::max(m_MemSize, block-&gt;m_MemSize);</div>
145<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>&#160; }</div>
146<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>&#160; </div>
147<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>&#160; <span class="comment">// Add a block with a word size of two or more to the bin</span></div>
148<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>&#160; <span class="keywordtype">void</span> AddBlock(MemBlock* block,</div>
149<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>&#160; <span class="keyword">const</span> <span class="keywordtype">size_t</span> startIndex,</div>
150<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>&#160; <span class="keyword">const</span> <span class="keywordtype">size_t</span> endIndex,</div>
151<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>&#160; <span class="keyword">const</span> <span class="keywordtype">size_t</span> firstWord,</div>
152<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>&#160; <span class="keyword">const</span> <span class="keywordtype">size_t</span> lastWord)</div>
153<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>&#160; {</div>
154<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>&#160; m_OccupiedSpaces[startIndex] = m_OccupiedSpaces[startIndex] | firstWord;</div>
155<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>&#160; m_OccupiedSpaces[endIndex] = m_OccupiedSpaces[endIndex] | lastWord;</div>
156<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>&#160; </div>
157<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = startIndex +1; i &lt;= endIndex -1; ++i)</div>
158<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>&#160; {</div>
159<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>&#160; m_OccupiedSpaces[i] = std::numeric_limits&lt;size_t&gt;::max();</div>
160<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>&#160; }</div>
161<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>&#160; </div>
162<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>&#160; m_PlacedBlocks.push_back(block);</div>
163<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>&#160; m_MemSize = std::max(m_MemSize, block-&gt;m_MemSize);</div>
164<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>&#160; }</div>
165<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>&#160; </div>
166<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>&#160; <span class="keywordtype">size_t</span> m_MemSize = 0;</div>
167<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>&#160; std::vector&lt;size_t&gt; m_OccupiedSpaces;</div>
168<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>&#160; std::vector&lt;MemBlock*&gt; m_PlacedBlocks;</div>
169<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>&#160;};</div>
170<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>&#160; </div>
171<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>&#160;<span class="keywordtype">void</span> SingleAxisPriorityList::PlaceBlocks(<span class="keyword">const</span> std::list&lt;MemBlock*&gt;&amp; priorityList,</div>
172<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>&#160; std::vector&lt;BinTracker&gt;&amp; placedBlocks,</div>
173<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>&#160; <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> maxLifetime)</div>
174<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>&#160;{</div>
175<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>&#160; <span class="comment">// This function is used when the given block start and end lifetimes fit within a single word.</span></div>
176<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>&#160; <span class="keyword">auto</span> singleWordLoop = [&amp;](MemBlock* curBlock, <span class="keyword">const</span> <span class="keywordtype">size_t</span> firstWord, <span class="keyword">const</span> <span class="keywordtype">size_t</span> index)</div>
177<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>&#160; {</div>
178<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>&#160; <span class="keywordtype">bool</span> placed = <span class="keyword">false</span>;</div>
179<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>&#160; <span class="comment">// loop through all existing bins</span></div>
180<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>&#160; <span class="keywordflow">for</span> (<span class="keyword">auto</span>&amp; blockList : placedBlocks)</div>
181<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>&#160; {</div>
182<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>&#160; <span class="comment">// Check if the lifetimes at the given index overlap with the lifetimes of the block</span></div>
183<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>&#160; <span class="keywordflow">if</span> ((blockList.m_OccupiedSpaces[index] &amp; firstWord) == 0)</div>
184<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>&#160; {</div>
185<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>&#160; <span class="comment">// If the binary AND is 0 there is no overlap between the words and the block will fit</span></div>
186<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>&#160; blockList.AddBlock(curBlock, firstWord, index);</div>
187<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>&#160; placed = <span class="keyword">true</span>;</div>
188<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>&#160; <span class="keywordflow">break</span>;</div>
189<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>&#160; }</div>
190<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>&#160; }</div>
191<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>&#160; <span class="comment">// No suitable bin was found, create a new bin/BinTracker and add it to the placedBlocks vector</span></div>
192<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>&#160; <span class="keywordflow">if</span> (!placed)</div>
193<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>&#160; {</div>
194<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>&#160; placedBlocks.emplace_back(BinTracker{maxLifetime});</div>
195<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>&#160; placedBlocks.back().AddBlock(curBlock, firstWord, index);</div>
196<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>&#160; }</div>
197<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>&#160; };</div>
198<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>&#160; </div>
199<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>&#160; <span class="comment">// This function is used when the given block start and end lifetimes fit within two words.</span></div>
200<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>&#160; <span class="keyword">auto</span> doubleWordLoop =[&amp;](MemBlock* curBlock,</div>
201<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>&#160; <span class="keyword">const</span> <span class="keywordtype">size_t</span> firstWord,</div>
202<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>&#160; <span class="keyword">const</span> <span class="keywordtype">size_t</span> firstIndex,</div>
203<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>&#160; <span class="keyword">const</span> <span class="keywordtype">size_t</span> lastWord,</div>
204<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>&#160; <span class="keyword">const</span> <span class="keywordtype">size_t</span> lastIndex)</div>
205<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>&#160; {</div>
206<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>&#160; <span class="keywordtype">bool</span> placed = <span class="keyword">false</span>;</div>
207<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>&#160; <span class="keywordflow">for</span> (<span class="keyword">auto</span>&amp; blockList : placedBlocks)</div>
208<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>&#160; {</div>
209<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>&#160; <span class="comment">// Check if the lifetimes at the given indexes overlap with the lifetimes of the block</span></div>
210<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>&#160; <span class="keywordflow">if</span> ((blockList.m_OccupiedSpaces[firstIndex] &amp; firstWord) == 0 &amp;&amp;</div>
211<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>&#160; (blockList.m_OccupiedSpaces[lastIndex] &amp; lastWord) == 0)</div>
212<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>&#160; {</div>
213<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>&#160; blockList.AddBlock(curBlock, firstIndex, lastIndex, firstWord, lastWord);</div>
214<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>&#160; placed = <span class="keyword">true</span>;</div>
215<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>&#160; <span class="keywordflow">break</span>;</div>
216<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>&#160; }</div>
217<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>&#160; }</div>
218<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>&#160; <span class="comment">// No suitable bin was found, create a new bin/BinTracker and add it to the placedBlocks vector</span></div>
219<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>&#160; <span class="keywordflow">if</span> (!placed)</div>
220<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>&#160; {</div>
221<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>&#160; placedBlocks.emplace_back(BinTracker{maxLifetime});</div>
222<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>&#160; placedBlocks.back().AddBlock(curBlock, firstIndex, lastIndex, firstWord, lastWord);</div>
223<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>&#160; }</div>
224<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>&#160; };</div>
225<div class="line"><a name="l00127"></a><span class="lineno"> 127</span>&#160; </div>
226<div class="line"><a name="l00128"></a><span class="lineno"> 128</span>&#160; <span class="comment">// Loop through the blocks to place</span></div>
227<div class="line"><a name="l00129"></a><span class="lineno"> 129</span>&#160; <span class="keywordflow">for</span>(<span class="keyword">const</span> <span class="keyword">auto</span> curBlock : priorityList)</div>
228<div class="line"><a name="l00130"></a><span class="lineno"> 130</span>&#160; {</div>
229<div class="line"><a name="l00131"></a><span class="lineno"> 131</span>&#160; <span class="comment">// The lifetimes of both the block and bin are represented by single bits on a word/s</span></div>
230<div class="line"><a name="l00132"></a><span class="lineno"> 132</span>&#160; <span class="comment">// Each bin has maxLifetime/wordSize words</span></div>
231<div class="line"><a name="l00133"></a><span class="lineno"> 133</span>&#160; <span class="comment">// The number of words for a block depends on the size of the blocks lifetime</span></div>
232<div class="line"><a name="l00134"></a><span class="lineno"> 134</span>&#160; <span class="comment">// and the alignment of the block&#39;s lifetimes</span></div>
233<div class="line"><a name="l00135"></a><span class="lineno"> 135</span>&#160; <span class="comment">// This allows for checking sizeof(size_t) * 8 lifetimes at once with a binary AND</span></div>
234<div class="line"><a name="l00136"></a><span class="lineno"> 136</span>&#160; <span class="keyword">const</span> <span class="keywordtype">size_t</span> firstWordIndex = curBlock-&gt;m_StartOfLife/<a class="code" href="namespacearmnn.html#aa2b4a5cd5b7f1555cba80a6072824024">wordSize</a>;</div>
235<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>&#160; <span class="keyword">const</span> <span class="keywordtype">size_t</span> lastWordIndex = curBlock-&gt;m_EndOfLife/<a class="code" href="namespacearmnn.html#aa2b4a5cd5b7f1555cba80a6072824024">wordSize</a>;</div>
236<div class="line"><a name="l00138"></a><span class="lineno"> 138</span>&#160; </div>
237<div class="line"><a name="l00139"></a><span class="lineno"> 139</span>&#160; <span class="comment">// Align and right shift the first word</span></div>
238<div class="line"><a name="l00140"></a><span class="lineno"> 140</span>&#160; <span class="comment">// This sets the bits before curBlock-&gt;m_StartOfLife to 0</span></div>
239<div class="line"><a name="l00141"></a><span class="lineno"> 141</span>&#160; <span class="keywordtype">size_t</span> remainder = (curBlock-&gt;m_StartOfLife - firstWordIndex * <a class="code" href="namespacearmnn.html#aa2b4a5cd5b7f1555cba80a6072824024">wordSize</a>);</div>
240<div class="line"><a name="l00142"></a><span class="lineno"> 142</span>&#160; <span class="keywordtype">size_t</span> firstWord = std::numeric_limits&lt;size_t&gt;::max() &gt;&gt; remainder;</div>
241<div class="line"><a name="l00143"></a><span class="lineno"> 143</span>&#160; </div>
242<div class="line"><a name="l00144"></a><span class="lineno"> 144</span>&#160; <span class="comment">// If the indexes match the block can fit into a single word</span></div>
243<div class="line"><a name="l00145"></a><span class="lineno"> 145</span>&#160; <span class="keywordflow">if</span>(firstWordIndex == lastWordIndex)</div>
244<div class="line"><a name="l00146"></a><span class="lineno"> 146</span>&#160; {</div>
245<div class="line"><a name="l00147"></a><span class="lineno"> 147</span>&#160; <span class="comment">// We then need to zero the bits to the right of curBlock-&gt;m_EndOfLife</span></div>
246<div class="line"><a name="l00148"></a><span class="lineno"> 148</span>&#160; remainder += curBlock-&gt;m_EndOfLife + 1 - curBlock-&gt;m_StartOfLife;</div>
247<div class="line"><a name="l00149"></a><span class="lineno"> 149</span>&#160; firstWord = firstWord &gt;&gt; (<a class="code" href="namespacearmnn.html#aa2b4a5cd5b7f1555cba80a6072824024">wordSize</a> - remainder);</div>
248<div class="line"><a name="l00150"></a><span class="lineno"> 150</span>&#160; firstWord = firstWord &lt;&lt; (<a class="code" href="namespacearmnn.html#aa2b4a5cd5b7f1555cba80a6072824024">wordSize</a> - remainder);</div>
249<div class="line"><a name="l00151"></a><span class="lineno"> 151</span>&#160; </div>
250<div class="line"><a name="l00152"></a><span class="lineno"> 152</span>&#160; singleWordLoop(curBlock, firstWord, firstWordIndex);</div>
251<div class="line"><a name="l00153"></a><span class="lineno"> 153</span>&#160; <span class="keywordflow">continue</span>;</div>
252<div class="line"><a name="l00154"></a><span class="lineno"> 154</span>&#160; }</div>
253<div class="line"><a name="l00155"></a><span class="lineno"> 155</span>&#160; </div>
254<div class="line"><a name="l00156"></a><span class="lineno"> 156</span>&#160; <span class="comment">// The indexes don&#39;t match we need at least two words</span></div>
255<div class="line"><a name="l00157"></a><span class="lineno"> 157</span>&#160; <span class="comment">// Zero the bits to the right of curBlock-&gt;m_EndOfLife</span></div>
256<div class="line"><a name="l00158"></a><span class="lineno"> 158</span>&#160; remainder = (curBlock-&gt;m_EndOfLife + 1 - lastWordIndex * <a class="code" href="namespacearmnn.html#aa2b4a5cd5b7f1555cba80a6072824024">wordSize</a>);</div>
257<div class="line"><a name="l00159"></a><span class="lineno"> 159</span>&#160; <span class="keywordtype">size_t</span> lastWord = std::numeric_limits&lt;size_t&gt;::max() &lt;&lt; (<a class="code" href="namespacearmnn.html#aa2b4a5cd5b7f1555cba80a6072824024">wordSize</a> - remainder);</div>
258<div class="line"><a name="l00160"></a><span class="lineno"> 160</span>&#160; </div>
259<div class="line"><a name="l00161"></a><span class="lineno"> 161</span>&#160; <span class="keywordflow">if</span>(firstWordIndex + 1 == lastWordIndex)</div>
260<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>&#160; {</div>
261<div class="line"><a name="l00163"></a><span class="lineno"> 163</span>&#160; doubleWordLoop(curBlock, firstWord, firstWordIndex, lastWord, lastWordIndex);</div>
262<div class="line"><a name="l00164"></a><span class="lineno"> 164</span>&#160; <span class="keywordflow">continue</span>;</div>
263<div class="line"><a name="l00165"></a><span class="lineno"> 165</span>&#160; }</div>
264<div class="line"><a name="l00166"></a><span class="lineno"> 166</span>&#160; </div>
265<div class="line"><a name="l00167"></a><span class="lineno"> 167</span>&#160; <span class="comment">// The block cannot fit into two words</span></div>
266<div class="line"><a name="l00168"></a><span class="lineno"> 168</span>&#160; <span class="comment">// We don&#39;t need to create any more words to represent this,</span></div>
267<div class="line"><a name="l00169"></a><span class="lineno"> 169</span>&#160; <span class="comment">// as any word between the first and last block would always equal the maximum value of size_t,</span></div>
268<div class="line"><a name="l00170"></a><span class="lineno"> 170</span>&#160; <span class="comment">// all the lifetimes would be occupied</span></div>
269<div class="line"><a name="l00171"></a><span class="lineno"> 171</span>&#160; </div>
270<div class="line"><a name="l00172"></a><span class="lineno"> 172</span>&#160; <span class="comment">// Instead, we just check that the corresponding word in the bin is completely empty</span></div>
271<div class="line"><a name="l00173"></a><span class="lineno"> 173</span>&#160; </div>
272<div class="line"><a name="l00174"></a><span class="lineno"> 174</span>&#160; <span class="keywordtype">bool</span> placed = <span class="keyword">false</span>;</div>
273<div class="line"><a name="l00175"></a><span class="lineno"> 175</span>&#160; <span class="keywordflow">for</span> (<span class="keyword">auto</span>&amp; blockList : placedBlocks)</div>
274<div class="line"><a name="l00176"></a><span class="lineno"> 176</span>&#160; {</div>
275<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>&#160; <span class="comment">// Check the first and last word</span></div>
276<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>&#160; <span class="keywordflow">if</span> ((blockList.m_OccupiedSpaces[firstWordIndex] &amp; firstWord) != 0 ||</div>
277<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>&#160; (blockList.m_OccupiedSpaces[lastWordIndex] &amp; lastWord) != 0)</div>
278<div class="line"><a name="l00180"></a><span class="lineno"> 180</span>&#160; {</div>
279<div class="line"><a name="l00181"></a><span class="lineno"> 181</span>&#160; <span class="keywordflow">continue</span>;</div>
280<div class="line"><a name="l00182"></a><span class="lineno"> 182</span>&#160; }</div>
281<div class="line"><a name="l00183"></a><span class="lineno"> 183</span>&#160; </div>
282<div class="line"><a name="l00184"></a><span class="lineno"> 184</span>&#160; <span class="keywordtype">bool</span> fits = <span class="keyword">true</span>;</div>
283<div class="line"><a name="l00185"></a><span class="lineno"> 185</span>&#160; <span class="comment">// Check that all spaces in between are clear</span></div>
284<div class="line"><a name="l00186"></a><span class="lineno"> 186</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = firstWordIndex +1; i &lt;= lastWordIndex -1; ++i)</div>
285<div class="line"><a name="l00187"></a><span class="lineno"> 187</span>&#160; {</div>
286<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>&#160; <span class="keywordflow">if</span> (blockList.m_OccupiedSpaces[i] != 0)</div>
287<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>&#160; {</div>
288<div class="line"><a name="l00190"></a><span class="lineno"> 190</span>&#160; fits = <span class="keyword">false</span>;</div>
289<div class="line"><a name="l00191"></a><span class="lineno"> 191</span>&#160; <span class="keywordflow">break</span>;</div>
290<div class="line"><a name="l00192"></a><span class="lineno"> 192</span>&#160; }</div>
291<div class="line"><a name="l00193"></a><span class="lineno"> 193</span>&#160; }</div>
292<div class="line"><a name="l00194"></a><span class="lineno"> 194</span>&#160; </div>
293<div class="line"><a name="l00195"></a><span class="lineno"> 195</span>&#160; <span class="keywordflow">if</span> (!fits)</div>
294<div class="line"><a name="l00196"></a><span class="lineno"> 196</span>&#160; {</div>
295<div class="line"><a name="l00197"></a><span class="lineno"> 197</span>&#160; <span class="keywordflow">continue</span>;</div>
296<div class="line"><a name="l00198"></a><span class="lineno"> 198</span>&#160; }</div>
297<div class="line"><a name="l00199"></a><span class="lineno"> 199</span>&#160; </div>
298<div class="line"><a name="l00200"></a><span class="lineno"> 200</span>&#160; blockList.AddBlock(curBlock, firstWordIndex, lastWordIndex, firstWord, lastWord);</div>
299<div class="line"><a name="l00201"></a><span class="lineno"> 201</span>&#160; placed = <span class="keyword">true</span>;</div>
300<div class="line"><a name="l00202"></a><span class="lineno"> 202</span>&#160; <span class="keywordflow">break</span>;</div>
301<div class="line"><a name="l00203"></a><span class="lineno"> 203</span>&#160; }</div>
302<div class="line"><a name="l00204"></a><span class="lineno"> 204</span>&#160; </div>
303<div class="line"><a name="l00205"></a><span class="lineno"> 205</span>&#160; <span class="comment">// No suitable bin was found, create a new bin/BinTracker and add it to the placedBlocks vector</span></div>
304<div class="line"><a name="l00206"></a><span class="lineno"> 206</span>&#160; <span class="keywordflow">if</span> (!placed)</div>
305<div class="line"><a name="l00207"></a><span class="lineno"> 207</span>&#160; {</div>
306<div class="line"><a name="l00208"></a><span class="lineno"> 208</span>&#160; placedBlocks.emplace_back(BinTracker{maxLifetime});</div>
307<div class="line"><a name="l00209"></a><span class="lineno"> 209</span>&#160; placedBlocks.back().AddBlock(curBlock, firstWordIndex, lastWordIndex, firstWord, lastWord);</div>
308<div class="line"><a name="l00210"></a><span class="lineno"> 210</span>&#160; }</div>
309<div class="line"><a name="l00211"></a><span class="lineno"> 211</span>&#160; }</div>
310<div class="line"><a name="l00212"></a><span class="lineno"> 212</span>&#160;}</div>
311<div class="line"><a name="l00213"></a><span class="lineno"> 213</span>&#160; </div>
312<div class="line"><a name="l00214"></a><span class="lineno"><a class="line" href="classarmnn_1_1_single_axis_priority_list.html#ada820fb9d89d2fb75bacaffe511791b7"> 214</a></span>&#160;std::vector&lt;MemBin&gt; <a class="code" href="classarmnn_1_1_single_axis_priority_list.html#ada820fb9d89d2fb75bacaffe511791b7">SingleAxisPriorityList::Optimize</a>(std::vector&lt;MemBlock&gt;&amp; blocks)</div>
313<div class="line"><a name="l00215"></a><span class="lineno"> 215</span>&#160;{</div>
314<div class="line"><a name="l00216"></a><span class="lineno"> 216</span>&#160; <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> maxLifetime = 0;</div>
315<div class="line"><a name="l00217"></a><span class="lineno"> 217</span>&#160; std::list&lt;MemBlock*&gt; priorityList;</div>
316<div class="line"><a name="l00218"></a><span class="lineno"> 218</span>&#160; <span class="keywordflow">for</span> (<span class="keyword">auto</span>&amp; block: blocks)</div>
317<div class="line"><a name="l00219"></a><span class="lineno"> 219</span>&#160; {</div>
318<div class="line"><a name="l00220"></a><span class="lineno"> 220</span>&#160; maxLifetime = std::max(maxLifetime, block.m_EndOfLife);</div>
319<div class="line"><a name="l00221"></a><span class="lineno"> 221</span>&#160; priorityList.emplace_back(&amp;block);</div>
320<div class="line"><a name="l00222"></a><span class="lineno"> 222</span>&#160; }</div>
321<div class="line"><a name="l00223"></a><span class="lineno"> 223</span>&#160; maxLifetime++;</div>
322<div class="line"><a name="l00224"></a><span class="lineno"> 224</span>&#160; </div>
323<div class="line"><a name="l00225"></a><span class="lineno"> 225</span>&#160; <span class="comment">// From testing ordering by m_MemSize in non-descending order gives the best results overall</span></div>
324<div class="line"><a name="l00226"></a><span class="lineno"> 226</span>&#160; priorityList.sort([](<span class="keyword">const</span> <a class="code" href="structarmnn_1_1_mem_block.html">MemBlock</a>* lhs, <span class="keyword">const</span> <a class="code" href="structarmnn_1_1_mem_block.html">MemBlock</a>* rhs)</div>
325<div class="line"><a name="l00227"></a><span class="lineno"> 227</span>&#160; {</div>
326<div class="line"><a name="l00228"></a><span class="lineno"> 228</span>&#160; <span class="keywordflow">return</span> lhs-&gt;<a class="code" href="structarmnn_1_1_mem_block.html#ac972eed0c811e23b9e1060cee4ac5a53">m_MemSize</a> &gt; rhs-&gt;<a class="code" href="structarmnn_1_1_mem_block.html#ac972eed0c811e23b9e1060cee4ac5a53">m_MemSize</a> ;</div>
327<div class="line"><a name="l00229"></a><span class="lineno"> 229</span>&#160; });</div>
328<div class="line"><a name="l00230"></a><span class="lineno"> 230</span>&#160; </div>
329<div class="line"><a name="l00231"></a><span class="lineno"> 231</span>&#160; </div>
330<div class="line"><a name="l00232"></a><span class="lineno"> 232</span>&#160; std::vector&lt;BinTracker&gt; placedBlocks;</div>
331<div class="line"><a name="l00233"></a><span class="lineno"> 233</span>&#160; placedBlocks.reserve(maxLifetime);</div>
332<div class="line"><a name="l00234"></a><span class="lineno"> 234</span>&#160; PlaceBlocks(priorityList, placedBlocks, maxLifetime);</div>
333<div class="line"><a name="l00235"></a><span class="lineno"> 235</span>&#160; </div>
334<div class="line"><a name="l00236"></a><span class="lineno"> 236</span>&#160; std::vector&lt;MemBin&gt; bins;</div>
335<div class="line"><a name="l00237"></a><span class="lineno"> 237</span>&#160; bins.reserve(placedBlocks.size());</div>
336<div class="line"><a name="l00238"></a><span class="lineno"> 238</span>&#160; <span class="keywordflow">for</span> (<span class="keyword">auto</span> blockList: placedBlocks)</div>
337<div class="line"><a name="l00239"></a><span class="lineno"> 239</span>&#160; {</div>
338<div class="line"><a name="l00240"></a><span class="lineno"> 240</span>&#160; <a class="code" href="structarmnn_1_1_mem_bin.html">MemBin</a> bin;</div>
339<div class="line"><a name="l00241"></a><span class="lineno"> 241</span>&#160; bin.<a class="code" href="structarmnn_1_1_mem_bin.html#aeb1783f0f3f528e11f9ce70f0214f8bb">m_MemBlocks</a>.reserve(blockList.m_PlacedBlocks.size());</div>
340<div class="line"><a name="l00242"></a><span class="lineno"> 242</span>&#160; bin.<a class="code" href="structarmnn_1_1_mem_bin.html#a08e50de8fcc7560644bdabc7356bb270">m_MemSize</a> = blockList.m_MemSize;</div>
341<div class="line"><a name="l00243"></a><span class="lineno"> 243</span>&#160; </div>
342<div class="line"><a name="l00244"></a><span class="lineno"> 244</span>&#160; <span class="keywordflow">for</span> (<span class="keyword">auto</span> block : blockList.m_PlacedBlocks)</div>
343<div class="line"><a name="l00245"></a><span class="lineno"> 245</span>&#160; {</div>
344<div class="line"><a name="l00246"></a><span class="lineno"> 246</span>&#160; bin.<a class="code" href="structarmnn_1_1_mem_bin.html#aeb1783f0f3f528e11f9ce70f0214f8bb">m_MemBlocks</a>.emplace_back(<a class="code" href="structarmnn_1_1_mem_block.html">MemBlock</a>{block-&gt;<a class="code" href="structarmnn_1_1_mem_block.html#a709b862a06a33e0f77e0d5cfb95daaf3">m_StartOfLife</a>,</div>
345<div class="line"><a name="l00247"></a><span class="lineno"> 247</span>&#160; block-&gt;m_EndOfLife,</div>
346<div class="line"><a name="l00248"></a><span class="lineno"> 248</span>&#160; block-&gt;m_MemSize,</div>
347<div class="line"><a name="l00249"></a><span class="lineno"> 249</span>&#160; 0,</div>
348<div class="line"><a name="l00250"></a><span class="lineno"> 250</span>&#160; block-&gt;m_Index,});</div>
349<div class="line"><a name="l00251"></a><span class="lineno"> 251</span>&#160; }</div>
350<div class="line"><a name="l00252"></a><span class="lineno"> 252</span>&#160; bins.push_back(std::move(bin));</div>
351<div class="line"><a name="l00253"></a><span class="lineno"> 253</span>&#160; }</div>
352<div class="line"><a name="l00254"></a><span class="lineno"> 254</span>&#160; </div>
353<div class="line"><a name="l00255"></a><span class="lineno"> 255</span>&#160; <span class="keywordflow">return</span> bins;</div>
354<div class="line"><a name="l00256"></a><span class="lineno"> 256</span>&#160;}</div>
355<div class="line"><a name="l00257"></a><span class="lineno"> 257</span>&#160; </div>
356<div class="line"><a name="l00258"></a><span class="lineno"> 258</span>&#160;} <span class="comment">// namespace armnn</span></div>
357<div class="line"><a name="l00259"></a><span class="lineno"> 259</span>&#160; </div>
358</div><!-- fragment --></div><!-- contents -->
359</div><!-- doc-content -->
360<div class="ttc" id="aclassarmnn_1_1_single_axis_priority_list_html_acd35ef4810ce3b938f5454bdee0cb826"><div class="ttname"><a href="classarmnn_1_1_single_axis_priority_list.html#acd35ef4810ce3b938f5454bdee0cb826">armnn::SingleAxisPriorityList::GetMemBlockStrategyType</a></div><div class="ttdeci">MemBlockStrategyType GetMemBlockStrategyType() const override</div><div class="ttdef"><b>Definition:</b> <a href="_single_axis_priority_list_8cpp_source.html#l00028">SingleAxisPriorityList.cpp:28</a></div></div>
361<div class="ttc" id="astructarmnn_1_1_mem_block_html"><div class="ttname"><a href="structarmnn_1_1_mem_block.html">armnn::MemBlock</a></div><div class="ttdef"><b>Definition:</b> <a href="_i_memory_optimizer_strategy_8hpp_source.html#l00013">IMemoryOptimizerStrategy.hpp:13</a></div></div>
362<div class="ttc" id="astructarmnn_1_1_mem_block_html_a709b862a06a33e0f77e0d5cfb95daaf3"><div class="ttname"><a href="structarmnn_1_1_mem_block.html#a709b862a06a33e0f77e0d5cfb95daaf3">armnn::MemBlock::m_StartOfLife</a></div><div class="ttdeci">const unsigned int m_StartOfLife</div><div class="ttdef"><b>Definition:</b> <a href="_i_memory_optimizer_strategy_8hpp_source.html#l00022">IMemoryOptimizerStrategy.hpp:22</a></div></div>
363<div class="ttc" id="anamespacearmnn_html_aa2b4a5cd5b7f1555cba80a6072824024"><div class="ttname"><a href="namespacearmnn.html#aa2b4a5cd5b7f1555cba80a6072824024">armnn::wordSize</a></div><div class="ttdeci">constexpr size_t wordSize</div><div class="ttdef"><b>Definition:</b> <a href="_single_axis_priority_list_8cpp_source.html#l00022">SingleAxisPriorityList.cpp:22</a></div></div>
364<div class="ttc" id="aclassarmnn_1_1_single_axis_priority_list_html_ada820fb9d89d2fb75bacaffe511791b7"><div class="ttname"><a href="classarmnn_1_1_single_axis_priority_list.html#ada820fb9d89d2fb75bacaffe511791b7">armnn::SingleAxisPriorityList::Optimize</a></div><div class="ttdeci">std::vector&lt; MemBin &gt; Optimize(std::vector&lt; MemBlock &gt; &amp;memBlocks) override</div><div class="ttdef"><b>Definition:</b> <a href="_single_axis_priority_list_8cpp_source.html#l00214">SingleAxisPriorityList.cpp:214</a></div></div>
365<div class="ttc" id="anamespacearmnn_html_a7100de49939c3e393101f78d425a98c6"><div class="ttname"><a href="namespacearmnn.html#a7100de49939c3e393101f78d425a98c6">armnn::MemBlockStrategyType</a></div><div class="ttdeci">MemBlockStrategyType</div><div class="ttdef"><b>Definition:</b> <a href="_types_8hpp_source.html#l00253">Types.hpp:253</a></div></div>
366<div class="ttc" id="a_single_axis_priority_list_8hpp_html"><div class="ttname"><a href="_single_axis_priority_list_8hpp.html">SingleAxisPriorityList.hpp</a></div></div>
367<div class="ttc" id="astructarmnn_1_1_mem_bin_html_a08e50de8fcc7560644bdabc7356bb270"><div class="ttname"><a href="structarmnn_1_1_mem_bin.html#a08e50de8fcc7560644bdabc7356bb270">armnn::MemBin::m_MemSize</a></div><div class="ttdeci">size_t m_MemSize</div><div class="ttdef"><b>Definition:</b> <a href="_i_memory_optimizer_strategy_8hpp_source.html#l00035">IMemoryOptimizerStrategy.hpp:35</a></div></div>
368<div class="ttc" id="astructarmnn_1_1_mem_block_html_ac972eed0c811e23b9e1060cee4ac5a53"><div class="ttname"><a href="structarmnn_1_1_mem_block.html#ac972eed0c811e23b9e1060cee4ac5a53">armnn::MemBlock::m_MemSize</a></div><div class="ttdeci">const size_t m_MemSize</div><div class="ttdef"><b>Definition:</b> <a href="_i_memory_optimizer_strategy_8hpp_source.html#l00025">IMemoryOptimizerStrategy.hpp:25</a></div></div>
369<div class="ttc" id="astructarmnn_1_1_mem_bin_html_aeb1783f0f3f528e11f9ce70f0214f8bb"><div class="ttname"><a href="structarmnn_1_1_mem_bin.html#aeb1783f0f3f528e11f9ce70f0214f8bb">armnn::MemBin::m_MemBlocks</a></div><div class="ttdeci">std::vector&lt; MemBlock &gt; m_MemBlocks</div><div class="ttdef"><b>Definition:</b> <a href="_i_memory_optimizer_strategy_8hpp_source.html#l00034">IMemoryOptimizerStrategy.hpp:34</a></div></div>
370<div class="ttc" id="anamespacearmnn_html"><div class="ttname"><a href="namespacearmnn.html">armnn</a></div><div class="ttdoc">Copyright (c) 2021 ARM Limited and Contributors.</div><div class="ttdef"><b>Definition:</b> <a href="01__00__quick__start_8dox_source.html#l00006">01_00_quick_start.dox:6</a></div></div>
371<div class="ttc" id="astructarmnn_1_1_mem_bin_html"><div class="ttname"><a href="structarmnn_1_1_mem_bin.html">armnn::MemBin</a></div><div class="ttdef"><b>Definition:</b> <a href="_i_memory_optimizer_strategy_8hpp_source.html#l00032">IMemoryOptimizerStrategy.hpp:32</a></div></div>
372<div class="ttc" id="aclassarmnn_1_1_single_axis_priority_list_html_a84ae72d221e80b93c2246b44a50fa361"><div class="ttname"><a href="classarmnn_1_1_single_axis_priority_list.html#a84ae72d221e80b93c2246b44a50fa361">armnn::SingleAxisPriorityList::GetName</a></div><div class="ttdeci">std::string GetName() const override</div><div class="ttdef"><b>Definition:</b> <a href="_single_axis_priority_list_8cpp_source.html#l00024">SingleAxisPriorityList.cpp:24</a></div></div>
373<!-- start footer part -->
374<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
375 <ul>
376 <li class="navelem"><a class="el" href="dir_68267d1309a1af8e8297ef4c3efbcdba.html">src</a></li><li class="navelem"><a class="el" href="dir_0f3cdec46afbc61a1ded8e1687c9c9a0.html">backends</a></li><li class="navelem"><a class="el" href="dir_797a213d7d01b98ef12d53b0820ea64e.html">backendsCommon</a></li><li class="navelem"><a class="el" href="dir_222b9efbf86b09050d83daeffd81e1d1.html">memoryOptimizerStrategyLibrary</a></li><li class="navelem"><a class="el" href="dir_d49dbf30bb5f789805533dd1aa43d8d9.html">strategies</a></li><li class="navelem"><a class="el" href="_single_axis_priority_list_8cpp.html">SingleAxisPriorityList.cpp</a></li>
377 <li class="footer">Generated on Wed Feb 14 2024 16:36:15 for Arm NN by
378 <a href="http://www.doxygen.org/index.html">
379 <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.17 </li>
380 </ul>
381</div>
382</body>
383</html>