arm_compute v19.05
diff --git a/documentation/gemv__pretransposed_8hpp_source.xhtml b/documentation/gemv__pretransposed_8hpp_source.xhtml
index 7a5edd9..61a06e3 100644
--- a/documentation/gemv__pretransposed_8hpp_source.xhtml
+++ b/documentation/gemv__pretransposed_8hpp_source.xhtml
@@ -40,7 +40,7 @@
<img alt="Compute Library" src="https://raw.githubusercontent.com/ARM-software/ComputeLibrary/gh-pages/ACL_logo.png" style="max-width: 100%;margin-top: 15px;margin-left: 10px"/>
<td style="padding-left: 0.5em;">
<div id="projectname">
-  <span id="projectnumber">19.02</span>
+  <span id="projectnumber">19.05</span>
</div>
</td>
</tr>
@@ -100,14 +100,14 @@
<div class="title">gemv_pretransposed.hpp</div> </div>
</div><!--header-->
<div class="contents">
-<a href="gemv__pretransposed_8hpp.xhtml">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">/*</span></div><div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment"> * Copyright (c) 2017-2019 ARM Limited.</span></div><div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment"> *</span></div><div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment"> * SPDX-License-Identifier: MIT</span></div><div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment"> *</span></div><div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment"> * Permission is hereby granted, free of charge, to any person obtaining a copy</span></div><div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment"> * of this software and associated documentation files (the "Software"), to</span></div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment"> * deal in the Software without restriction, including without limitation the</span></div><div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment"> * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or</span></div><div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment"> * sell copies of the Software, and to permit persons to whom the Software is</span></div><div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment"> * furnished to do so, subject to the following conditions:</span></div><div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment"> *</span></div><div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="comment"> * The above copyright notice and this permission notice shall be included in all</span></div><div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="comment"> * copies or substantial portions of the Software.</span></div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="comment"> *</span></div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="comment"> * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR</span></div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="comment"> * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,</span></div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="comment"> * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE</span></div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="comment"> * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER</span></div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="comment"> * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,</span></div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="comment"> * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE</span></div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="comment"> * SOFTWARE.</span></div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="comment"> */</span></div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="preprocessor">#pragma once</span></div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span> </div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="preprocessor">#include <stdio.h></span></div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> </div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="preprocessor">#include "arm_gemm.hpp"</span></div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> </div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="preprocessor">#include "<a class="code" href="mergeresults_8hpp.xhtml">mergeresults.hpp</a>"</span></div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="preprocessor">#include "<a class="code" href="transform_8hpp.xhtml">transform.hpp</a>"</span></div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> </div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="preprocessor">#ifdef CYCLE_PROFILING</span></div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="preprocessor">#include "<a class="code" href="profiler_8hpp.xhtml">profiler.hpp</a>"</span></div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span> </div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="keyword">namespace </span><a class="code" href="namespacearm__gemm.xhtml">arm_gemm</a> {</div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span> </div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="comment">// Implementation of the GemmCommon abstract class.</span></div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="comment">//</span></div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="comment">// This is implementation is for GEMV with pretransposition.</span></div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="comment">//</span></div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span> <span class="comment">// batches are not supported as a batched GEMV makes no sense (can be converted to a GEMM).</span></div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="keyword">template</span><<span class="keyword">typename</span> strategy, <span class="keyword">typename</span> To, <span class="keyword">typename</span> Tr></div><div class="line"><a name="l00045"></a><span class="lineno"><a class="line" href="classarm__gemm_1_1_gemv_pretransposed.xhtml"> 45</a></span> <span class="keyword">class </span><a class="code" href="classarm__gemm_1_1_gemv_pretransposed.xhtml">GemvPretransposed</a> : <span class="keyword">public</span> GemmCommon<To, Tr> {</div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> strategy::operand_type Toi;</div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> strategy::result_type Tri;</div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span> </div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> _Nsize;</div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> _Ksize;</div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span> </div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> _nmultis;</div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span> </div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> _trB;</div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span> </div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  <span class="keyword">const</span> Tr _beta;</div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span> </div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  <span class="keyword">const</span> CPUInfo * <span class="keyword">const</span> _ci;</div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span> </div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> _buffer_per_multi;</div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span> </div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> m_block=0;</div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> n_block=0;</div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span> </div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  <span class="keyword">const</span> Toi *_A_pretransposed = <span class="keyword">nullptr</span>;</div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span> </div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span> <span class="keyword">public</span>:</div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  <a class="code" href="classarm__gemm_1_1_gemv_pretransposed.xhtml#a1721e8ac2ad69c15d7c13a063d4c00c4">GemvPretransposed</a>(<a class="code" href="classarm__gemm_1_1_gemv_pretransposed.xhtml">GemvPretransposed</a> &) = <span class="keyword">delete</span>;</div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <a class="code" href="classarm__gemm_1_1_gemv_pretransposed.xhtml">GemvPretransposed</a> & <a class="code" href="classarm__gemm_1_1_gemv_pretransposed.xhtml#a4bd9591d6da5b65a99c56f82acc14c4c">operator= </a>(<a class="code" href="classarm__gemm_1_1_gemv_pretransposed.xhtml">GemvPretransposed</a> &) = <span class="keyword">delete</span>;</div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span> </div><div class="line"><a name="l00071"></a><span class="lineno"><a class="line" href="classarm__gemm_1_1_gemv_pretransposed.xhtml#a8dca5a76de1711aa0d39bf892b7ca2c9"> 71</a></span>  <a class="code" href="classarm__gemm_1_1_gemv_pretransposed.xhtml#a8dca5a76de1711aa0d39bf892b7ca2c9">GemvPretransposed</a>(<span class="keyword">const</span> GemmArgs<Tr> &args)</div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  : _Nsize(args._Nsize), _Ksize(args._Ksize), _nmultis(args._nmulti), _trB(args._trB), _beta(args._beta), _ci(args._ci),</div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  _buffer_per_multi(_Ksize * <a class="code" href="utils_8hpp.xhtml#aa4508679e1d089c2bdcf000f72357683">iceildiv</a>(_Nsize, strategy::A_interleave()) * strategy::A_interleave()) {</div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  <span class="comment">/* For now don't do any blocking. TODO: figure out if we should. */</span></div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  <span class="keywordflow">if</span> (args._cfg && args._cfg->inner_block_size) {</div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  m_block = args._cfg->inner_block_size;</div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  m_block = _Ksize;</div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  }</div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span> </div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <span class="keywordflow">if</span> (args._cfg && args._cfg->outer_block_size) {</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  n_block = args._cfg->outer_block_size;</div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  n_block = _Nsize;</div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  }</div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  }</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span> </div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <span class="comment">// Window is number of out_width blocks, times number of multis.</span></div><div class="line"><a name="l00089"></a><span class="lineno"><a class="line" href="classarm__gemm_1_1_gemv_pretransposed.xhtml#a9fe814165d032363ea4f9cfdd36dd5e2"> 89</a></span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code" href="classarm__gemm_1_1_gemv_pretransposed.xhtml#a9fe814165d032363ea4f9cfdd36dd5e2">get_window_size</a>()<span class="keyword"> const override </span>{</div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <span class="keywordflow">return</span> <a class="code" href="utils_8hpp.xhtml#aa4508679e1d089c2bdcf000f72357683">iceildiv</a>(_Nsize, strategy::out_width()) * _nmultis;</div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  }</div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span> </div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <span class="comment">// Actually execute the GEMV.</span></div><div class="line"><a name="l00094"></a><span class="lineno"><a class="line" href="classarm__gemm_1_1_gemv_pretransposed.xhtml#a514bdec015ee0ca587b6444e9defc190"> 94</a></span>  <span class="keywordtype">void</span> <a class="code" href="classarm__gemm_1_1_gemv_pretransposed.xhtml#a514bdec015ee0ca587b6444e9defc190">execute</a>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> start, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> end, <span class="keywordtype">int</span>)<span class="keyword"> override </span>{</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span> <span class="preprocessor">#ifdef CYCLE_PROFILING</span></div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  profiler prof;</div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  strategy strat(_ci);</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span> </div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="comment">/* Break the window values down into multis of interest... */</span></div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> window_per_multi = <a class="code" href="utils_8hpp.xhtml#aa4508679e1d089c2bdcf000f72357683">iceildiv</a>(_Nsize, strategy::out_width());</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> multi_0 = start / window_per_multi;</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> multi_end = end / window_per_multi;</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span> </div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <span class="comment">/* ... and figure out where we start and end in the first and last multi. */</span></div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> n_0 = (start - (multi_0 * window_per_multi)) * strategy::out_width();</div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> n_max = (end - (multi_end * window_per_multi)) * strategy::out_width();</div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span> </div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  static_assert(std::is_same<Tr, Tri>::value, <span class="stringliteral">"GemvPretransposed: Result types must be the same."</span>);</div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span> </div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> multi=multi_0; multi<=multi_end; multi++) {</div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> n_start = (multi==multi_0) ? n_0 : 0;</div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> n_end = (multi==multi_end) ? n_max : _Nsize;</div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span> </div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  <span class="keywordflow">if</span> (n_end <= n_start)</div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span> </div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> m0=0; m0<_Ksize; m0+=m_block) {</div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> mmax = std::min(m0 + m_block, _Ksize);</div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span> </div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> n=n_start; n<n_end; n+=n_block) {</div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> nmax = std::min(n + n_block, n_end);</div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span> <span class="preprocessor">#ifdef CYCLE_PROFILING</span></div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  <span class="keyword">auto</span> p = prof.ScopedProfiler(<a class="code" href="profiler_8hpp.xhtml#a97f4e398174b5e094f5262e5d785ac20">PROFILE_KERNEL</a>, (mmax-m0) * (nmax-n));</div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <span class="comment">/* This assumes that the underlying call was a GEMM with M=1; for the N=1 case we would have to pick up this->_Bptr below instead */</span></div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  strat.kernel(_A_pretransposed + (multi * _buffer_per_multi) + (n * _Ksize) + (m0 * strategy::A_interleave()),</div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  (_Ksize * strategy::A_interleave()),</div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  this->_Aptr + (multi * this->_A_multi_stride) + m0,</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  this->_Cptr + (multi * this->_C_multi_stride) + n,</div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  _beta, (mmax-m0), (nmax-n));</div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  }</div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  }</div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  }</div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  }</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span> </div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  <span class="comment">/* Pretransposed interface implementation */</span></div><div class="line"><a name="l00138"></a><span class="lineno"><a class="line" href="classarm__gemm_1_1_gemv_pretransposed.xhtml#ac5dec5063a75604fdc60555f15577b94"> 138</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classarm__gemm_1_1_gemv_pretransposed.xhtml#ac5dec5063a75604fdc60555f15577b94">B_is_pretransposed</a>()<span class="keyword"> const override </span>{</div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  }</div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span> </div><div class="line"><a name="l00142"></a><span class="lineno"><a class="line" href="classarm__gemm_1_1_gemv_pretransposed.xhtml#aa7cfff39cbb2be65cd40042a75e5ae1c"> 142</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classarm__gemm_1_1_gemv_pretransposed.xhtml#aa7cfff39cbb2be65cd40042a75e5ae1c">B_pretranspose_required</a>()<span class="keyword"> const override </span>{</div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  <span class="comment">/* Transpose is required if _A_pretransposed is still nullptr */</span></div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  <span class="keywordflow">return</span> (_A_pretransposed == <span class="keyword">nullptr</span>);</div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  }</div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span> </div><div class="line"><a name="l00147"></a><span class="lineno"><a class="line" href="classarm__gemm_1_1_gemv_pretransposed.xhtml#ae9fc7380e533c43a1d91e48a7578e412"> 147</a></span>  <span class="keywordtype">size_t</span> <a class="code" href="classarm__gemm_1_1_gemv_pretransposed.xhtml#ae9fc7380e533c43a1d91e48a7578e412">get_B_pretransposed_array_size</a>()<span class="keyword"> const override </span>{</div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  <span class="keywordflow">return</span> _buffer_per_multi * _nmultis * <span class="keyword">sizeof</span>(To);</div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  }</div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span> </div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  <span class="keyword">using</span> GemmCommon<To, Tr>::pretranspose_B_array;</div><div class="line"><a name="l00152"></a><span class="lineno"><a class="line" href="classarm__gemm_1_1_gemv_pretransposed.xhtml#a28341e4e1158f3446a8dfa13c9f5c6f0"> 152</a></span>  <span class="keywordtype">void</span> <a class="code" href="classarm__gemm_1_1_gemv_pretransposed.xhtml#a28341e4e1158f3446a8dfa13c9f5c6f0">pretranspose_B_array</a>(<span class="keywordtype">void</span> *buffer, <span class="keyword">const</span> To *B, <span class="keyword">const</span> <span class="keywordtype">int</span> ldb, <span class="keyword">const</span> <span class="keywordtype">int</span> B_multi_stride)<span class="keyword"> override </span>{</div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  Toi *A_buffer = reinterpret_cast<Toi *>(buffer);</div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span> </div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> multi=0; multi<_nmultis; multi++) {</div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  <span class="comment">/* Reverse sense here as we are dealing with B rather than A. So if</span></div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span> <span class="comment"> * strategy::A_transpose is false and _trB is false, we still</span></div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span> <span class="comment"> * transpose. */</span></div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  <span class="keywordflow">if</span> (_trB ^ strategy::A_transpose()) {</div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  Transform<strategy::A_interleave(), strategy::A_block(), false>(A_buffer + (multi * _buffer_per_multi), B + (multi * B_multi_stride), ldb, 0, _Nsize, 0, _Ksize);</div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  Transform<strategy::A_interleave(), strategy::A_block(), true>(A_buffer + (multi * _buffer_per_multi), B + (multi * B_multi_stride), ldb, 0, _Nsize, 0, _Ksize);</div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  }</div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  }</div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span> </div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  _A_pretransposed = A_buffer;</div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  }</div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span> </div><div class="line"><a name="l00169"></a><span class="lineno"><a class="line" href="classarm__gemm_1_1_gemv_pretransposed.xhtml#a27df64c6276eb144594c5d37d1110b20"> 169</a></span>  <span class="keywordtype">void</span> <a class="code" href="classarm__gemm_1_1_gemv_pretransposed.xhtml#a27df64c6276eb144594c5d37d1110b20">set_pretransposed_B_data</a>(<span class="keywordtype">void</span> *buffer)<span class="keyword"> override </span>{</div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  _A_pretransposed = reinterpret_cast<Toi *>(buffer);</div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  }</div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span> };</div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span> </div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span> } <span class="comment">// namespace arm_gemm</span></div><div class="ttc" id="utils_8hpp_xhtml_aa4508679e1d089c2bdcf000f72357683"><div class="ttname"><a href="utils_8hpp.xhtml#aa4508679e1d089c2bdcf000f72357683">iceildiv</a></div><div class="ttdeci">T iceildiv(const T a, const T b)</div><div class="ttdef"><b>Definition:</b> <a href="utils_8hpp_source.xhtml#l00036">utils.hpp:36</a></div></div>
+<a href="gemv__pretransposed_8hpp.xhtml">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">/*</span></div><div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment"> * Copyright (c) 2017-2019 ARM Limited.</span></div><div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment"> *</span></div><div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment"> * SPDX-License-Identifier: MIT</span></div><div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment"> *</span></div><div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment"> * Permission is hereby granted, free of charge, to any person obtaining a copy</span></div><div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment"> * of this software and associated documentation files (the "Software"), to</span></div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment"> * deal in the Software without restriction, including without limitation the</span></div><div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment"> * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or</span></div><div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment"> * sell copies of the Software, and to permit persons to whom the Software is</span></div><div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment"> * furnished to do so, subject to the following conditions:</span></div><div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment"> *</span></div><div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="comment"> * The above copyright notice and this permission notice shall be included in all</span></div><div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="comment"> * copies or substantial portions of the Software.</span></div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="comment"> *</span></div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="comment"> * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR</span></div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="comment"> * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,</span></div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="comment"> * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE</span></div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="comment"> * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER</span></div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="comment"> * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,</span></div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="comment"> * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE</span></div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="comment"> * SOFTWARE.</span></div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="comment"> */</span></div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="preprocessor">#pragma once</span></div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span> </div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="preprocessor">#include <stdio.h></span></div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> </div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="preprocessor">#include "arm_gemm.hpp"</span></div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> </div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="preprocessor">#include "<a class="code" href="mergeresults_8hpp.xhtml">mergeresults.hpp</a>"</span></div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="preprocessor">#include "<a class="code" href="transform_8hpp.xhtml">transform.hpp</a>"</span></div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> </div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="preprocessor">#ifdef CYCLE_PROFILING</span></div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="preprocessor">#include "<a class="code" href="profiler_8hpp.xhtml">profiler.hpp</a>"</span></div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span> </div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="keyword">namespace </span><a class="code" href="namespacearm__gemm.xhtml">arm_gemm</a> {</div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span> </div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="comment">// Implementation of the GemmCommon abstract class.</span></div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="comment">//</span></div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="comment">// This is implementation is for GEMV with pretransposition.</span></div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="comment">//</span></div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span> <span class="comment">// batches are not supported as a batched GEMV makes no sense (can be converted to a GEMM).</span></div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="keyword">template</span><<span class="keyword">typename</span> strategy, <span class="keyword">typename</span> To, <span class="keyword">typename</span> Tr></div><div class="line"><a name="l00045"></a><span class="lineno"><a class="line" href="classarm__gemm_1_1_gemv_pretransposed.xhtml"> 45</a></span> <span class="keyword">class </span><a class="code" href="classarm__gemm_1_1_gemv_pretransposed.xhtml">GemvPretransposed</a> : <span class="keyword">public</span> GemmCommon<To, Tr> {</div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> strategy::operand_type Toi;</div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> strategy::result_type Tri;</div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span> </div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> _Nsize;</div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> _Ksize;</div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span> </div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> _nmultis;</div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span> </div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> _trB;</div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span> </div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  <span class="keyword">const</span> Tr _beta;</div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span> </div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  <span class="keyword">const</span> CPUInfo * <span class="keyword">const</span> _ci;</div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span> </div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> _buffer_per_multi;</div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span> </div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> m_block=0;</div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> n_block=0;</div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span> </div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  <span class="keyword">const</span> Toi *_A_pretransposed = <span class="keyword">nullptr</span>;</div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span> </div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span> <span class="keyword">public</span>:</div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  <a class="code" href="classarm__gemm_1_1_gemv_pretransposed.xhtml#a1721e8ac2ad69c15d7c13a063d4c00c4">GemvPretransposed</a>(<a class="code" href="classarm__gemm_1_1_gemv_pretransposed.xhtml">GemvPretransposed</a> &) = <span class="keyword">delete</span>;</div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <a class="code" href="classarm__gemm_1_1_gemv_pretransposed.xhtml">GemvPretransposed</a> & <a class="code" href="classarm__gemm_1_1_gemv_pretransposed.xhtml#a4bd9591d6da5b65a99c56f82acc14c4c">operator= </a>(<a class="code" href="classarm__gemm_1_1_gemv_pretransposed.xhtml">GemvPretransposed</a> &) = <span class="keyword">delete</span>;</div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span> </div><div class="line"><a name="l00071"></a><span class="lineno"><a class="line" href="classarm__gemm_1_1_gemv_pretransposed.xhtml#a8dca5a76de1711aa0d39bf892b7ca2c9"> 71</a></span>  <a class="code" href="classarm__gemm_1_1_gemv_pretransposed.xhtml#a8dca5a76de1711aa0d39bf892b7ca2c9">GemvPretransposed</a>(<span class="keyword">const</span> GemmArgs<Tr> &args)</div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  : _Nsize(args._Nsize), _Ksize(args._Ksize), _nmultis(args._nmulti), _trB(args._trB), _beta(args._beta), _ci(args._ci),</div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  _buffer_per_multi(_Ksize * <a class="code" href="utils_8hpp.xhtml#aa4508679e1d089c2bdcf000f72357683">iceildiv</a>(_Nsize, strategy::A_interleave()) * strategy::A_interleave()) {</div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  <span class="comment">/* For now don't do any blocking. TODO: figure out if we should. */</span></div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  <span class="keywordflow">if</span> (args._cfg && args._cfg->inner_block_size) {</div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  m_block = args._cfg->inner_block_size;</div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  m_block = _Ksize;</div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  }</div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span> </div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <span class="keywordflow">if</span> (args._cfg && args._cfg->outer_block_size) {</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  n_block = args._cfg->outer_block_size;</div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  n_block = _Nsize;</div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  }</div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  }</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span> </div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <span class="comment">// Window is number of out_width blocks, times number of multis.</span></div><div class="line"><a name="l00089"></a><span class="lineno"><a class="line" href="classarm__gemm_1_1_gemv_pretransposed.xhtml#a9fe814165d032363ea4f9cfdd36dd5e2"> 89</a></span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code" href="classarm__gemm_1_1_gemv_pretransposed.xhtml#a9fe814165d032363ea4f9cfdd36dd5e2">get_window_size</a>()<span class="keyword"> const override </span>{</div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <span class="keywordflow">return</span> <a class="code" href="utils_8hpp.xhtml#aa4508679e1d089c2bdcf000f72357683">iceildiv</a>(_Nsize, strategy::out_width()) * _nmultis;</div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  }</div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span> </div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <span class="comment">// Actually execute the GEMV.</span></div><div class="line"><a name="l00094"></a><span class="lineno"><a class="line" href="classarm__gemm_1_1_gemv_pretransposed.xhtml#a514bdec015ee0ca587b6444e9defc190"> 94</a></span>  <span class="keywordtype">void</span> <a class="code" href="classarm__gemm_1_1_gemv_pretransposed.xhtml#a514bdec015ee0ca587b6444e9defc190">execute</a>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> start, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> end, <span class="keywordtype">int</span>)<span class="keyword"> override </span>{</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span> <span class="preprocessor">#ifdef CYCLE_PROFILING</span></div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  profiler prof;</div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  strategy strat(_ci);</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span> </div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="comment">/* Break the window values down into multis of interest... */</span></div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> window_per_multi = <a class="code" href="utils_8hpp.xhtml#aa4508679e1d089c2bdcf000f72357683">iceildiv</a>(_Nsize, strategy::out_width());</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> multi_0 = start / window_per_multi;</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> multi_end = end / window_per_multi;</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span> </div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <span class="comment">/* ... and figure out where we start and end in the first and last multi. */</span></div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> n_0 = (start - (multi_0 * window_per_multi)) * strategy::out_width();</div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> n_max = (end - (multi_end * window_per_multi)) * strategy::out_width();</div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span> </div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  static_assert(std::is_same<Tr, Tri>::value, <span class="stringliteral">"GemvPretransposed: Result types must be the same."</span>);</div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span> </div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> multi=multi_0; multi<=multi_end; multi++) {</div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> n_start = (multi==multi_0) ? n_0 : 0;</div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> n_end = (multi==multi_end) ? n_max : _Nsize;</div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span> </div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  <span class="keywordflow">if</span> (n_end <= n_start)</div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span> </div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> m0=0; m0<_Ksize; m0+=m_block) {</div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> mmax = std::min(m0 + m_block, _Ksize);</div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span> </div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> n=n_start; n<n_end; n+=n_block) {</div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> nmax = std::min(n + n_block, n_end);</div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span> <span class="preprocessor">#ifdef CYCLE_PROFILING</span></div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  <span class="keyword">auto</span> p = prof.ScopedProfiler(<a class="code" href="profiler_8hpp.xhtml#a97f4e398174b5e094f5262e5d785ac20">PROFILE_KERNEL</a>, (mmax-m0) * (nmax-n));</div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <span class="comment">/* This assumes that the underlying call was a GEMM with M=1; for the N=1 case we would have to pick up this->_Bptr below instead */</span></div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  strat.kernel(_A_pretransposed + (multi * _buffer_per_multi) + (n * _Ksize) + (m0 * strategy::A_interleave()),</div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  (_Ksize * strategy::A_interleave()),</div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  this->_Aptr + (multi * this->_A_multi_stride) + m0,</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  this->_Cptr + (multi * this->_C_multi_stride) + n,</div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  _beta, (mmax-m0), (nmax-n));</div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  }</div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  }</div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  }</div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  }</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span> </div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  <span class="comment">/* Pretransposed interface implementation */</span></div><div class="line"><a name="l00138"></a><span class="lineno"><a class="line" href="classarm__gemm_1_1_gemv_pretransposed.xhtml#ac5dec5063a75604fdc60555f15577b94"> 138</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classarm__gemm_1_1_gemv_pretransposed.xhtml#ac5dec5063a75604fdc60555f15577b94">B_is_pretransposed</a>()<span class="keyword"> const override </span>{</div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  }</div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span> </div><div class="line"><a name="l00142"></a><span class="lineno"><a class="line" href="classarm__gemm_1_1_gemv_pretransposed.xhtml#aa7cfff39cbb2be65cd40042a75e5ae1c"> 142</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classarm__gemm_1_1_gemv_pretransposed.xhtml#aa7cfff39cbb2be65cd40042a75e5ae1c">B_pretranspose_required</a>()<span class="keyword"> const override </span>{</div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  <span class="comment">/* Transpose is required if _A_pretransposed is still nullptr */</span></div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  <span class="keywordflow">return</span> (_A_pretransposed == <span class="keyword">nullptr</span>);</div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  }</div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span> </div><div class="line"><a name="l00147"></a><span class="lineno"><a class="line" href="classarm__gemm_1_1_gemv_pretransposed.xhtml#ae9fc7380e533c43a1d91e48a7578e412"> 147</a></span>  <span class="keywordtype">size_t</span> <a class="code" href="classarm__gemm_1_1_gemv_pretransposed.xhtml#ae9fc7380e533c43a1d91e48a7578e412">get_B_pretransposed_array_size</a>()<span class="keyword"> const override </span>{</div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  <span class="keywordflow">return</span> _buffer_per_multi * _nmultis * <span class="keyword">sizeof</span>(To);</div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  }</div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span> </div><div class="line"><a name="l00151"></a><span class="lineno"><a class="line" href="classarm__gemm_1_1_gemv_pretransposed.xhtml#a28341e4e1158f3446a8dfa13c9f5c6f0"> 151</a></span>  <span class="keywordtype">void</span> <a class="code" href="classarm__gemm_1_1_gemv_pretransposed.xhtml#a28341e4e1158f3446a8dfa13c9f5c6f0">pretranspose_B_array</a>(<span class="keywordtype">void</span> *buffer, <span class="keyword">const</span> To *B, <span class="keyword">const</span> <span class="keywordtype">int</span> ldb, <span class="keyword">const</span> <span class="keywordtype">int</span> B_multi_stride)<span class="keyword"> override </span>{</div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  Toi *A_buffer = reinterpret_cast<Toi *>(buffer);</div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span> </div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> multi=0; multi<_nmultis; multi++) {</div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  <span class="comment">/* Reverse sense here as we are dealing with B rather than A. So if</span></div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span> <span class="comment"> * strategy::A_transpose is false and _trB is false, we still</span></div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span> <span class="comment"> * transpose. */</span></div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  <span class="keywordflow">if</span> (_trB ^ strategy::A_transpose()) {</div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  Transform<strategy::A_interleave(), strategy::A_block(), false>(A_buffer + (multi * _buffer_per_multi), B + (multi * B_multi_stride), ldb, 0, _Nsize, 0, _Ksize);</div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  Transform<strategy::A_interleave(), strategy::A_block(), true>(A_buffer + (multi * _buffer_per_multi), B + (multi * B_multi_stride), ldb, 0, _Nsize, 0, _Ksize);</div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  }</div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  }</div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span> </div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  _A_pretransposed = A_buffer;</div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  }</div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span> </div><div class="line"><a name="l00168"></a><span class="lineno"><a class="line" href="classarm__gemm_1_1_gemv_pretransposed.xhtml#a27df64c6276eb144594c5d37d1110b20"> 168</a></span>  <span class="keywordtype">void</span> <a class="code" href="classarm__gemm_1_1_gemv_pretransposed.xhtml#a27df64c6276eb144594c5d37d1110b20">set_pretransposed_B_data</a>(<span class="keywordtype">void</span> *buffer)<span class="keyword"> override </span>{</div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  _A_pretransposed = reinterpret_cast<Toi *>(buffer);</div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  }</div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span> };</div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span> </div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span> } <span class="comment">// namespace arm_gemm</span></div><div class="ttc" id="utils_8hpp_xhtml_aa4508679e1d089c2bdcf000f72357683"><div class="ttname"><a href="utils_8hpp.xhtml#aa4508679e1d089c2bdcf000f72357683">iceildiv</a></div><div class="ttdeci">T iceildiv(const T a, const T b)</div><div class="ttdef"><b>Definition:</b> <a href="utils_8hpp_source.xhtml#l00036">utils.hpp:36</a></div></div>
<div class="ttc" id="classarm__gemm_1_1_gemv_pretransposed_xhtml_a4bd9591d6da5b65a99c56f82acc14c4c"><div class="ttname"><a href="classarm__gemm_1_1_gemv_pretransposed.xhtml#a4bd9591d6da5b65a99c56f82acc14c4c">arm_gemm::GemvPretransposed::operator=</a></div><div class="ttdeci">GemvPretransposed & operator=(GemvPretransposed &)=delete</div></div>
-<div class="ttc" id="classarm__gemm_1_1_gemv_pretransposed_xhtml_a27df64c6276eb144594c5d37d1110b20"><div class="ttname"><a href="classarm__gemm_1_1_gemv_pretransposed.xhtml#a27df64c6276eb144594c5d37d1110b20">arm_gemm::GemvPretransposed::set_pretransposed_B_data</a></div><div class="ttdeci">void set_pretransposed_B_data(void *buffer) override</div><div class="ttdef"><b>Definition:</b> <a href="gemv__pretransposed_8hpp_source.xhtml#l00169">gemv_pretransposed.hpp:169</a></div></div>
+<div class="ttc" id="classarm__gemm_1_1_gemv_pretransposed_xhtml_a27df64c6276eb144594c5d37d1110b20"><div class="ttname"><a href="classarm__gemm_1_1_gemv_pretransposed.xhtml#a27df64c6276eb144594c5d37d1110b20">arm_gemm::GemvPretransposed::set_pretransposed_B_data</a></div><div class="ttdeci">void set_pretransposed_B_data(void *buffer) override</div><div class="ttdef"><b>Definition:</b> <a href="gemv__pretransposed_8hpp_source.xhtml#l00168">gemv_pretransposed.hpp:168</a></div></div>
<div class="ttc" id="mergeresults_8hpp_xhtml"><div class="ttname"><a href="mergeresults_8hpp.xhtml">mergeresults.hpp</a></div></div>
<div class="ttc" id="namespacearm__gemm_xhtml"><div class="ttname"><a href="namespacearm__gemm.xhtml">arm_gemm</a></div><div class="ttdef"><b>Definition:</b> <a href="buffer__manager_8hpp_source.xhtml#l00041">buffer_manager.hpp:41</a></div></div>
<div class="ttc" id="profiler_8hpp_xhtml"><div class="ttname"><a href="profiler_8hpp.xhtml">profiler.hpp</a></div></div>
<div class="ttc" id="classarm__gemm_1_1_gemv_pretransposed_xhtml_a9fe814165d032363ea4f9cfdd36dd5e2"><div class="ttname"><a href="classarm__gemm_1_1_gemv_pretransposed.xhtml#a9fe814165d032363ea4f9cfdd36dd5e2">arm_gemm::GemvPretransposed::get_window_size</a></div><div class="ttdeci">unsigned int get_window_size() const override</div><div class="ttdef"><b>Definition:</b> <a href="gemv__pretransposed_8hpp_source.xhtml#l00089">gemv_pretransposed.hpp:89</a></div></div>
-<div class="ttc" id="classarm__gemm_1_1_gemv_pretransposed_xhtml_a28341e4e1158f3446a8dfa13c9f5c6f0"><div class="ttname"><a href="classarm__gemm_1_1_gemv_pretransposed.xhtml#a28341e4e1158f3446a8dfa13c9f5c6f0">arm_gemm::GemvPretransposed::pretranspose_B_array</a></div><div class="ttdeci">void pretranspose_B_array(void *buffer, const To *B, const int ldb, const int B_multi_stride) override</div><div class="ttdef"><b>Definition:</b> <a href="gemv__pretransposed_8hpp_source.xhtml#l00152">gemv_pretransposed.hpp:152</a></div></div>
+<div class="ttc" id="classarm__gemm_1_1_gemv_pretransposed_xhtml_a28341e4e1158f3446a8dfa13c9f5c6f0"><div class="ttname"><a href="classarm__gemm_1_1_gemv_pretransposed.xhtml#a28341e4e1158f3446a8dfa13c9f5c6f0">arm_gemm::GemvPretransposed::pretranspose_B_array</a></div><div class="ttdeci">void pretranspose_B_array(void *buffer, const To *B, const int ldb, const int B_multi_stride) override</div><div class="ttdef"><b>Definition:</b> <a href="gemv__pretransposed_8hpp_source.xhtml#l00151">gemv_pretransposed.hpp:151</a></div></div>
<div class="ttc" id="transform_8hpp_xhtml"><div class="ttname"><a href="transform_8hpp.xhtml">transform.hpp</a></div></div>
<div class="ttc" id="classarm__gemm_1_1_gemv_pretransposed_xhtml_ac5dec5063a75604fdc60555f15577b94"><div class="ttname"><a href="classarm__gemm_1_1_gemv_pretransposed.xhtml#ac5dec5063a75604fdc60555f15577b94">arm_gemm::GemvPretransposed::B_is_pretransposed</a></div><div class="ttdeci">bool B_is_pretransposed() const override</div><div class="ttdef"><b>Definition:</b> <a href="gemv__pretransposed_8hpp_source.xhtml#l00138">gemv_pretransposed.hpp:138</a></div></div>
<div class="ttc" id="classarm__gemm_1_1_gemv_pretransposed_xhtml_aa7cfff39cbb2be65cd40042a75e5ae1c"><div class="ttname"><a href="classarm__gemm_1_1_gemv_pretransposed.xhtml#aa7cfff39cbb2be65cd40042a75e5ae1c">arm_gemm::GemvPretransposed::B_pretranspose_required</a></div><div class="ttdeci">bool B_pretranspose_required() const override</div><div class="ttdef"><b>Definition:</b> <a href="gemv__pretransposed_8hpp_source.xhtml#l00142">gemv_pretransposed.hpp:142</a></div></div>
@@ -123,7 +123,7 @@
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="dir_68267d1309a1af8e8297ef4c3efbcdba.xhtml">src</a></li><li class="navelem"><a class="el" href="dir_aebb8dcc11953d78e620bbef0b9e2183.xhtml">core</a></li><li class="navelem"><a class="el" href="dir_d91e1966cc57df4f49d1e07be7697713.xhtml">NEON</a></li><li class="navelem"><a class="el" href="dir_1ce938f580a6f304b99685e2c1dd19db.xhtml">kernels</a></li><li class="navelem"><a class="el" href="dir_9847dd9cb7a28e46201717fa7336cf62.xhtml">arm_gemm</a></li><li class="navelem"><a class="el" href="gemv__pretransposed_8hpp.xhtml">gemv_pretransposed.hpp</a></li>
- <li class="footer">Generated on Thu Feb 28 2019 12:24:50 for Compute Library by
+ <li class="footer">Generated on Thu May 23 2019 17:11:20 for Compute Library by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.15 </li>
</ul>