arm_compute v18.11
diff --git a/documentation/transform_8hpp_source.xhtml b/documentation/transform_8hpp_source.xhtml
new file mode 100644
index 0000000..33c7d71
--- /dev/null
+++ b/documentation/transform_8hpp_source.xhtml
@@ -0,0 +1,112 @@
+<!-- HTML header for doxygen 1.8.9.1-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=9"/>
+<meta name="generator" content="Doxygen 1.8.13"/>
+<meta name="robots" content="NOINDEX, NOFOLLOW" /> <!-- Prevent indexing by search engines -->
+<title>Compute Library: src/core/NEON/kernels/arm_gemm/transform.hpp Source File</title>
+<link href="tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="jquery.js"></script>
+<script type="text/javascript" src="dynsections.js"></script>
+<link href="navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="resize.js"></script>
+<script type="text/javascript" src="navtreedata.js"></script>
+<script type="text/javascript" src="navtree.js"></script>
+<script type="text/javascript">
+ $(document).ready(initResizable);
+</script>
+<link href="search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="search/searchdata.js"></script>
+<script type="text/javascript" src="search/search.js"></script>
+<script type="text/x-mathjax-config">
+ MathJax.Hub.Config({
+ extensions: ["tex2jax.js"],
+ jax: ["input/TeX","output/HTML-CSS"],
+});
+</script><script type="text/javascript" src="http://cdn.mathjax.org/mathjax/latest/MathJax.js"></script>
+<link href="doxygen.css" rel="stylesheet" type="text/css" />
+</head>
+<body>
+<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
+<div id="titlearea">
+<table cellspacing="0" cellpadding="0">
+ <tbody>
+ <tr style="height: 56px;">
+ <td style="padding-left: 0.5em;">
+ <div id="projectname">Compute Library
+  <span id="projectnumber">18.11</span>
+ </div>
+ </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.8.13 -->
+<script type="text/javascript">
+var searchBox = new SearchBox("searchBox", "search",false,'Search');
+</script>
+<script type="text/javascript" src="menudata.js"></script>
+<script type="text/javascript" src="menu.js"></script>
+<script type="text/javascript">
+$(function() {
+ initMenu('',true,false,'search.php','Search');
+ $(document).ready(function() { init_search(); });
+});
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+ <div id="nav-tree">
+ <div id="nav-tree-contents">
+ <div id="nav-sync" class="sync"></div>
+ </div>
+ </div>
+ <div id="splitbar" style="-moz-user-select:none;"
+ class="ui-resizable-handle">
+ </div>
+</div>
+<script type="text/javascript">
+$(document).ready(function(){initNavTree('transform_8hpp_source.xhtml','');});
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+ onmouseover="return searchBox.OnSearchSelectShow()"
+ onmouseout="return searchBox.OnSearchSelectHide()"
+ onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<iframe src="javascript:void(0)" frameborder="0"
+ name="MSearchResults" id="MSearchResults">
+</iframe>
+</div>
+
+<div class="header">
+ <div class="headertitle">
+<div class="title">transform.hpp</div> </div>
+</div><!--header-->
+<div class="contents">
+<a href="transform_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-2018 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="comment">/*</span></div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="comment"> * Generic transform.</span></div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="comment"> *</span></div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="comment"> * Assuming the untransposed case, this works by first reading <BlockBy></span></div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="comment"> * consecutive values from the first input row. This same number of values</span></div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="comment"> * are then read from the next <IntBy-1> rows. Now return to the first</span></div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="comment"> * input row and repeat.</span></div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="comment"> *</span></div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="comment"> * Need to cope with the work requested in either dimension not actually</span></div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="comment"> * being a multiple of the block sizes.</span></div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="comment"> */</span></div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="keyword">template</span> <<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> tIntBy, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> BlockBy, <span class="keywordtype">bool</span> Transposed, <span class="keywordtype">size_t</span> TOutSize, <span class="keywordtype">size_t</span> TInSize, <span class="keywordtype">bool</span> sve></div><div class="line"><a name="l00038"></a><span class="lineno"><a class="line" href="struct_transform_impl.xhtml"> 38</a></span> <span class="keyword">struct </span><a class="code" href="struct_transform_impl.xhtml">TransformImpl</a> {</div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  <span class="keyword">template</span> <<span class="keyword">typename</span> TOut, <span class="keyword">typename</span> TIn></div><div class="line"><a name="l00040"></a><span class="lineno"><a class="line" href="struct_transform_impl.xhtml#a63b509dd384dfffc0d4f650115799f8b"> 40</a></span>  <span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code" href="struct_transform_impl.xhtml#a63b509dd384dfffc0d4f650115799f8b">Transform</a>(TOut* <a class="code" href="namespacearm__compute_1_1test_1_1validation.xhtml#af8a8a0625e7981212a0af48deb9d2a09">out</a>, <span class="keyword">const</span> TIn* <span class="keyword">const</span> <a class="code" href="namespacearm__compute_1_1test_1_1validation.xhtml#ad366eaa4cf2d106037d91c30795a5c76">in</a>, <span class="keyword">const</span> <span class="keywordtype">int</span> stride,</div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> y0, <span class="keyword">const</span> <span class="keywordtype">int</span> ymax, <span class="keyword">const</span> <span class="keywordtype">int</span> x0, <span class="keyword">const</span> <span class="keywordtype">int</span> xmax) {</div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  <span class="comment">// For SVE cases we multiply the interleave factor by the vector length.</span></div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> IntBy = tIntBy * (sve ? get_vector_length<TOut>() / BlockBy : 1);</div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span> </div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> n_whole_y_blocks = (ymax - y0) / IntBy;</div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> y_remainders = (ymax - y0) % IntBy;</div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> n_y_blocks = n_whole_y_blocks + (y_remainders ? 1 : 0);</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">int</span> n_whole_x_blocks = (xmax - x0) / BlockBy;</div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> x_remainders = (xmax - x0) % BlockBy;</div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> n_x_blocks = n_whole_x_blocks + (x_remainders ? 1 : 0);</div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span> </div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  <span class="comment">// "Y" loop: advance down the rows of the source IntBy rows at a time.</span></div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  <span class="comment">// Set up fill_rows to show the number rows to copy from, and blank_rows</span></div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  <span class="comment">// for the number of blank rows to add.</span></div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> y_block=0 ; y_block < n_y_blocks; y_block++) {</div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  <span class="keywordtype">int</span> fill_rows = (y_block < n_whole_y_blocks) ? IntBy : y_remainders;</div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  <span class="keywordtype">int</span> blank_rows = IntBy - fill_rows;</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="keywordtype">int</span> y_base = y0 + (y_block * IntBy);</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="comment">// So now advance along this block of rows, BlockBy columns at a time.</span></div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> x_block=0 ; x_block < n_x_blocks; x_block++) {</div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  <span class="keywordtype">int</span> fill_cols = (x_block < n_whole_x_blocks) ? BlockBy : x_remainders;</div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  <span class="keywordtype">int</span> blank_cols = BlockBy - fill_cols;</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="keywordtype">int</span> x_base = x0 + (x_block * BlockBy);</div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span> </div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> row = 0; row < fill_rows; row++) {</div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> col = 0; col < fill_cols; col++) {</div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  <span class="comment">// In-range copy. If it's transposed, we reverse the sense of rows and columns here.</span></div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  <span class="keywordflow">if</span> (Transposed) {</div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  *out++ = <span class="keyword">static_cast<</span>TOut<span class="keyword">></span>(in[(x_base + col) * stride + y_base + row]);</div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  *out++ = <span class="keyword">static_cast<</span>TOut<span class="keyword">></span>(in[(y_base + row) * stride + x_base + col]);</div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  }</div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  }</div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  <span class="comment">// "col" tail - row is in range but column is out of range.</span></div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> col=0; col < blank_cols; col++) {</div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  *out++ = <span class="keyword">static_cast<</span>TOut<span class="keyword">></span>(0);</div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  }</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  }</div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  <span class="comment">// "row" tail - row is out of range so fill with zeros always.</span></div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> row = 0; row < blank_rows; row++) {</div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> col=0; col < (fill_cols + blank_cols); col++) {</div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  *out++ = <span class="keyword">static_cast<</span>TOut<span class="keyword">></span>(0);</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>  }</div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  }</div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  }</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="keyword">template</span> <<span class="keyword">typename</span> T></div><div class="line"><a name="l00094"></a><span class="lineno"><a class="line" href="struct_transform_impl.xhtml#a1c7a0b8d7bd5f883e459db42f2165755"> 94</a></span>  <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="struct_transform_impl.xhtml#a1c7a0b8d7bd5f883e459db42f2165755">Transform</a>(T* <a class="code" href="namespacearm__compute_1_1test_1_1validation.xhtml#af8a8a0625e7981212a0af48deb9d2a09">out</a>, <span class="keyword">const</span> T* <span class="keyword">const</span> <a class="code" href="namespacearm__compute_1_1test_1_1validation.xhtml#ad366eaa4cf2d106037d91c30795a5c76">in</a>, <span class="keyword">const</span> <span class="keywordtype">int</span> stride,</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> k0, <span class="keyword">const</span> <span class="keywordtype">int</span> kmax, <span class="keyword">const</span> <span class="keywordtype">int</span> x0, <span class="keyword">const</span> <span class="keywordtype">int</span> xmax) {</div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  Transform<T, T>(<a class="code" href="namespacearm__compute_1_1test_1_1validation.xhtml#af8a8a0625e7981212a0af48deb9d2a09">out</a>, <a class="code" href="namespacearm__compute_1_1test_1_1validation.xhtml#ad366eaa4cf2d106037d91c30795a5c76">in</a>, stride, k0, kmax, x0, xmax);</div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  }</div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span> };</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span> </div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span> <span class="comment">/*****************************************************************************/</span></div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span> <span class="keyword">template</span> <<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> IntBy, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> BlockBy, <span class="keywordtype">bool</span> Transposed, <span class="keywordtype">bool</span> sve=false, <span class="keyword">typename</span> TOut, <span class="keyword">typename</span> TIn></div><div class="line"><a name="l00102"></a><span class="lineno"><a class="line" href="transform_8hpp.xhtml#a26afdd476f20600b47f35560ccfe23a9"> 102</a></span> <span class="keywordtype">void</span> <a class="code" href="struct_transform_impl.xhtml#a63b509dd384dfffc0d4f650115799f8b">Transform</a>(</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  TOut* <a class="code" href="namespacearm__compute_1_1test_1_1validation.xhtml#af8a8a0625e7981212a0af48deb9d2a09">out</a>, <span class="keyword">const</span> TIn* <span class="keyword">const</span> <a class="code" href="namespacearm__compute_1_1test_1_1validation.xhtml#ad366eaa4cf2d106037d91c30795a5c76">in</a>, <span class="keyword">const</span> <span class="keywordtype">int</span> stride,</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> k0, <span class="keyword">const</span> <span class="keywordtype">int</span> kmax, <span class="keyword">const</span> <span class="keywordtype">int</span> x0, <span class="keyword">const</span> <span class="keywordtype">int</span> xmax</div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span> ) {</div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  <span class="comment">// Redirect to a specialised implementation predicated on argument size.</span></div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <a class="code" href="struct_transform_impl.xhtml">TransformImpl<IntBy, BlockBy, Transposed, sizeof(TOut), sizeof(TIn), sve>::Transform</a>(</div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <a class="code" href="namespacearm__compute_1_1test_1_1validation.xhtml#af8a8a0625e7981212a0af48deb9d2a09">out</a>, <a class="code" href="namespacearm__compute_1_1test_1_1validation.xhtml#ad366eaa4cf2d106037d91c30795a5c76">in</a>, stride, k0, kmax, x0, xmax</div><div class="line"><a name="l00109"></a><span class="lineno"> 109</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="comment">/*****************************************************************************/</span></div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span> </div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span> <span class="preprocessor">#include "<a class="code" href="transforms_2list_8hpp.xhtml">transforms/list.hpp</a>"</span></div><div class="ttc" id="transforms_2list_8hpp_xhtml"><div class="ttname"><a href="transforms_2list_8hpp.xhtml">list.hpp</a></div></div>
+<div class="ttc" id="struct_transform_impl_xhtml_a1c7a0b8d7bd5f883e459db42f2165755"><div class="ttname"><a href="struct_transform_impl.xhtml#a1c7a0b8d7bd5f883e459db42f2165755">TransformImpl::Transform</a></div><div class="ttdeci">static void Transform(T *out, const T *const in, const int stride, const int k0, const int kmax, const int x0, const int xmax)</div><div class="ttdef"><b>Definition:</b> <a href="transform_8hpp_source.xhtml#l00094">transform.hpp:94</a></div></div>
+<div class="ttc" id="namespacearm__compute_1_1test_1_1validation_xhtml_ad366eaa4cf2d106037d91c30795a5c76"><div class="ttname"><a href="namespacearm__compute_1_1test_1_1validation.xhtml#ad366eaa4cf2d106037d91c30795a5c76">arm_compute::test::validation::in</a></div><div class="ttdeci">CLTensor in</div><div class="ttdef"><b>Definition:</b> <a href="_c_l_2_winograd_8cpp_source.xhtml#l00265">Winograd.cpp:265</a></div></div>
+<div class="ttc" id="struct_transform_impl_xhtml_a63b509dd384dfffc0d4f650115799f8b"><div class="ttname"><a href="struct_transform_impl.xhtml#a63b509dd384dfffc0d4f650115799f8b">TransformImpl::Transform</a></div><div class="ttdeci">static void Transform(TOut *out, const TIn *const in, const int stride, const int y0, const int ymax, const int x0, const int xmax)</div><div class="ttdef"><b>Definition:</b> <a href="transform_8hpp_source.xhtml#l00040">transform.hpp:40</a></div></div>
+<div class="ttc" id="struct_transform_impl_xhtml"><div class="ttname"><a href="struct_transform_impl.xhtml">TransformImpl</a></div><div class="ttdef"><b>Definition:</b> <a href="transform_8hpp_source.xhtml#l00038">transform.hpp:38</a></div></div>
+<div class="ttc" id="namespacearm__compute_1_1test_1_1validation_xhtml_af8a8a0625e7981212a0af48deb9d2a09"><div class="ttname"><a href="namespacearm__compute_1_1test_1_1validation.xhtml#af8a8a0625e7981212a0af48deb9d2a09">arm_compute::test::validation::out</a></div><div class="ttdeci">CLTensor out</div><div class="ttdef"><b>Definition:</b> <a href="_c_l_2_winograd_8cpp_source.xhtml#l00266">Winograd.cpp:266</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<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="transform_8hpp.xhtml">transform.hpp</a></li>
+ <li class="footer">Generated on Thu Nov 22 2018 11:57:39 for Compute Library by
+ <a href="http://www.doxygen.org/index.html">
+ <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.13 </li>
+ </ul>
+</div>
+</body>
+</html>