| <a href="_n_e_non_linear_filter_kernel_8cpp.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) 2016-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">#include "<a class="code" href="_n_e_non_linear_filter_kernel_8h.xhtml">arm_compute/core/NEON/kernels/NENonLinearFilterKernel.h</a>"</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 "<a class="code" href="_coordinates_8h.xhtml">arm_compute/core/Coordinates.h</a>"</span></div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="preprocessor">#include "<a class="code" href="_error_8h.xhtml">arm_compute/core/Error.h</a>"</span></div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="preprocessor">#include "<a class="code" href="arm__compute_2core_2_helpers_8h.xhtml">arm_compute/core/Helpers.h</a>"</span></div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="preprocessor">#include "<a class="code" href="_i_tensor_8h.xhtml">arm_compute/core/ITensor.h</a>"</span></div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="preprocessor">#include "<a class="code" href="_tensor_info_8h.xhtml">arm_compute/core/TensorInfo.h</a>"</span></div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="preprocessor">#include "<a class="code" href="_validate_8h.xhtml">arm_compute/core/Validate.h</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">#include <algorithm></span></div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="preprocessor">#include <arm_neon.h></span></div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="preprocessor">#include <array></span></div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="preprocessor">#include <tuple></span></div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="preprocessor">#include <utility></span></div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span> </div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="keyword">namespace </span><a class="code" href="namespacearm__compute.xhtml">arm_compute</a></div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span> {</div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="keyword">namespace</span></div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span> {</div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span> <span class="keyword">const</span> uint8x16_t zero_u8 = vdupq_n_u8(0);</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">template</span> <<span class="keywordtype">size_t</span> columns></div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span> <span class="keyword">inline</span> uint8x8_t min_row(uint8x16_t row_data)</div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span> {</div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  uint8x8_t min = vget_low_u8(row_data);</div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span> </div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  <span class="keywordflow">for</span>(<span class="keywordtype">size_t</span> c = 1; c < columns; ++c)</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>  row_data = vextq_u8(row_data, zero_u8, 1);</div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  min = vmin_u8(min, vget_low_u8(row_data));</div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  }</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="keywordflow">return</span> min;</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> </div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span> <span class="keyword">template</span> <<span class="keywordtype">size_t</span> columns></div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span> <span class="keyword">inline</span> uint8x8_t max_row(uint8x16_t row_data)</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>  uint8x8_t max = vget_low_u8(row_data);</div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span> </div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  <span class="keywordflow">for</span>(<span class="keywordtype">size_t</span> c = 1; c < columns; ++c)</div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  {</div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  row_data = vextq_u8(row_data, zero_u8, 1);</div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  max = vmax_u8(max, vget_low_u8(row_data));</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> </div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  <span class="keywordflow">return</span> max;</div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span> }</div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span> </div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> sort(uint8x8_t &a, uint8x8_t &<a class="code" href="namespacearm__compute_1_1test_1_1validation.xhtml#aa76b4a6e74940dabc5b7fc6b2dab3545">b</a>)</div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span> {</div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  <span class="keyword">const</span> uint8x8_t min = vmin_u8(a, <a class="code" href="namespacearm__compute_1_1test_1_1validation.xhtml#aa76b4a6e74940dabc5b7fc6b2dab3545">b</a>);</div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  <span class="keyword">const</span> uint8x8_t max = vmax_u8(a, <a class="code" href="namespacearm__compute_1_1test_1_1validation.xhtml#aa76b4a6e74940dabc5b7fc6b2dab3545">b</a>);</div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  a = min;</div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  <a class="code" href="namespacearm__compute_1_1test_1_1validation.xhtml#aa76b4a6e74940dabc5b7fc6b2dab3545">b</a> = max;</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="comment">// Sorting networks below were generated using http://pages.ripco.net/~jgamble/nw.html</span></div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span> <span class="comment">// Calculations that do not affect the median were removed.</span></div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="non__linear__filter__helpers_8h.xhtml#a7b5c174de888c3cfa7c08c16682fd770">sort5</a>(uint8x8_t &p0, uint8x8_t &p1, uint8x8_t &p2, uint8x8_t &p3, uint8x8_t &p4)</div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span> {</div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  sort(p0, p1);</div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  sort(p2, p3);</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  sort(p0, p2);</div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  sort(p1, p3);</div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  sort(p1, p2);</div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  sort(p0, p4);</div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  sort(p1, p4);</div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  sort(p2, p4);</div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span> }</div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span> </div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="non__linear__filter__helpers_8h.xhtml#a0960df49e39a9499677066c32600c17f">sort9</a>(uint8x8_t &p0, uint8x8_t &p1, uint8x8_t &p2,</div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  uint8x8_t &p3, uint8x8_t &p4, uint8x8_t &p5,</div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  uint8x8_t &p6, uint8x8_t &p7, uint8x8_t &p8)</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>  sort(p1, p2);</div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  sort(p4, p5);</div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  sort(p7, p8);</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  sort(p0, p1);</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  sort(p3, p4);</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  sort(p6, p7);</div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  sort(p1, p2);</div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  sort(p4, p5);</div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  sort(p7, p8);</div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  sort(p0, p3);</div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  sort(p5, p8);</div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  sort(p4, p7);</div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  sort(p3, p6);</div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  sort(p1, p4);</div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  sort(p2, p5);</div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  sort(p4, p7);</div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  sort(p4, p2);</div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  sort(p6, p4);</div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  sort(p4, p2);</div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span> }</div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span> </div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> sort21(std::array<uint8x8_t, 21> &p)</div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span> {</div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  sort(p[0], p[1]);</div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  sort(p[2], p[3]);</div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  sort(p[4], p[5]);</div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  sort(p[6], p[7]);</div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  sort(p[8], p[9]);</div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  sort(p[10], p[11]);</div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  sort(p[12], p[13]);</div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  sort(p[14], p[15]);</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  sort(p[16], p[17]);</div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  sort(p[18], p[19]);</div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  sort(p[0], p[2]);</div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  sort(p[1], p[3]);</div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  sort(p[4], p[6]);</div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  sort(p[5], p[7]);</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  sort(p[8], p[10]);</div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  sort(p[9], p[11]);</div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  sort(p[12], p[14]);</div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  sort(p[13], p[15]);</div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  sort(p[16], p[18]);</div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  sort(p[17], p[19]);</div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  sort(p[1], p[2]);</div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  sort(p[5], p[6]);</div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  sort(p[0], p[4]);</div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  sort(p[3], p[7]);</div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  sort(p[9], p[10]);</div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  sort(p[13], p[14]);</div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  sort(p[8], p[12]);</div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  sort(p[11], p[15]);</div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  sort(p[17], p[18]);</div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  sort(p[16], p[20]);</div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  sort(p[1], p[5]);</div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  sort(p[2], p[6]);</div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  sort(p[9], p[13]);</div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  sort(p[10], p[14]);</div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  sort(p[0], p[8]);</div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  sort(p[7], p[15]);</div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  sort(p[17], p[20]);</div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  sort(p[1], p[4]);</div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  sort(p[3], p[6]);</div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  sort(p[9], p[12]);</div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  sort(p[11], p[14]);</div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  sort(p[18], p[20]);</div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  sort(p[0], p[16]);</div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  sort(p[2], p[4]);</div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  sort(p[3], p[5]);</div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  sort(p[10], p[12]);</div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  sort(p[11], p[13]);</div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  sort(p[1], p[9]);</div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  sort(p[6], p[14]);</div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  sort(p[19], p[20]);</div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  sort(p[3], p[4]);</div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  sort(p[11], p[12]);</div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  sort(p[1], p[8]);</div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  sort(p[2], p[10]);</div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  sort(p[5], p[13]);</div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  sort(p[7], p[14]);</div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  sort(p[3], p[11]);</div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  sort(p[2], p[8]);</div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  sort(p[4], p[12]);</div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  sort(p[7], p[13]);</div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  sort(p[1], p[17]);</div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  sort(p[3], p[10]);</div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  sort(p[5], p[12]);</div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  sort(p[1], p[16]);</div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  sort(p[2], p[18]);</div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  sort(p[3], p[9]);</div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  sort(p[6], p[12]);</div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  sort(p[2], p[16]);</div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  sort(p[3], p[8]);</div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  sort(p[7], p[12]);</div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  sort(p[5], p[9]);</div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  sort(p[6], p[10]);</div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  sort(p[4], p[8]);</div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  sort(p[7], p[11]);</div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  sort(p[3], p[19]);</div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  sort(p[5], p[8]);</div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  sort(p[7], p[10]);</div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  sort(p[3], p[18]);</div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  sort(p[4], p[20]);</div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  sort(p[6], p[8]);</div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  sort(p[7], p[9]);</div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  sort(p[3], p[17]);</div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  sort(p[5], p[20]);</div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  sort(p[7], p[8]);</div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  sort(p[3], p[16]);</div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  sort(p[6], p[20]);</div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  sort(p[5], p[17]);</div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  sort(p[7], p[20]);</div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  sort(p[4], p[16]);</div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  sort(p[6], p[18]);</div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  sort(p[5], p[16]);</div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  sort(p[7], p[19]);</div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  sort(p[7], p[18]);</div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  sort(p[6], p[16]);</div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  sort(p[7], p[17]);</div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  sort(p[10], p[18]);</div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  sort(p[7], p[16]);</div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  sort(p[9], p[17]);</div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  sort(p[8], p[16]);</div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  sort(p[9], p[16]);</div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  sort(p[10], p[16]);</div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span> }</div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span> </div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> sort25(std::array<uint8x8_t, 25> &p)</div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span> {</div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  sort(p[1], p[2]);</div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  sort(p[0], p[1]);</div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  sort(p[1], p[2]);</div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  sort(p[4], p[5]);</div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  sort(p[3], p[4]);</div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  sort(p[4], p[5]);</div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  sort(p[0], p[3]);</div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  sort(p[2], p[5]);</div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  sort(p[2], p[3]);</div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  sort(p[1], p[4]);</div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  sort(p[1], p[2]);</div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  sort(p[3], p[4]);</div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  sort(p[7], p[8]);</div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  sort(p[6], p[7]);</div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  sort(p[7], p[8]);</div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  sort(p[10], p[11]);</div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  sort(p[9], p[10]);</div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  sort(p[10], p[11]);</div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  sort(p[6], p[9]);</div><div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  sort(p[8], p[11]);</div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  sort(p[8], p[9]);</div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  sort(p[7], p[10]);</div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  sort(p[7], p[8]);</div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  sort(p[9], p[10]);</div><div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  sort(p[0], p[6]);</div><div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  sort(p[4], p[10]);</div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  sort(p[4], p[6]);</div><div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  sort(p[2], p[8]);</div><div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  sort(p[2], p[4]);</div><div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  sort(p[6], p[8]);</div><div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  sort(p[1], p[7]);</div><div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  sort(p[5], p[11]);</div><div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  sort(p[5], p[7]);</div><div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  sort(p[3], p[9]);</div><div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  sort(p[3], p[5]);</div><div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  sort(p[7], p[9]);</div><div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  sort(p[1], p[2]);</div><div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  sort(p[3], p[4]);</div><div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  sort(p[5], p[6]);</div><div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  sort(p[7], p[8]);</div><div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  sort(p[9], p[10]);</div><div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  sort(p[13], p[14]);</div><div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  sort(p[12], p[13]);</div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  sort(p[13], p[14]);</div><div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  sort(p[16], p[17]);</div><div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  sort(p[15], p[16]);</div><div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  sort(p[16], p[17]);</div><div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  sort(p[12], p[15]);</div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  sort(p[14], p[17]);</div><div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  sort(p[14], p[15]);</div><div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  sort(p[13], p[16]);</div><div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  sort(p[13], p[14]);</div><div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  sort(p[15], p[16]);</div><div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  sort(p[19], p[20]);</div><div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  sort(p[18], p[19]);</div><div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  sort(p[19], p[20]);</div><div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  sort(p[21], p[22]);</div><div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  sort(p[23], p[24]);</div><div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  sort(p[21], p[23]);</div><div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  sort(p[22], p[24]);</div><div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  sort(p[22], p[23]);</div><div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  sort(p[18], p[21]);</div><div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  sort(p[20], p[23]);</div><div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  sort(p[20], p[21]);</div><div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  sort(p[19], p[22]);</div><div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  sort(p[22], p[24]);</div><div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  sort(p[19], p[20]);</div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  sort(p[21], p[22]);</div><div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  sort(p[23], p[24]);</div><div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  sort(p[12], p[18]);</div><div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  sort(p[16], p[22]);</div><div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  sort(p[16], p[18]);</div><div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  sort(p[14], p[20]);</div><div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  sort(p[20], p[24]);</div><div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  sort(p[14], p[16]);</div><div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  sort(p[18], p[20]);</div><div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  sort(p[22], p[24]);</div><div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  sort(p[13], p[19]);</div><div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  sort(p[17], p[23]);</div><div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  sort(p[17], p[19]);</div><div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  sort(p[15], p[21]);</div><div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  sort(p[15], p[17]);</div><div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  sort(p[19], p[21]);</div><div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  sort(p[13], p[14]);</div><div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  sort(p[15], p[16]);</div><div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  sort(p[17], p[18]);</div><div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  sort(p[19], p[20]);</div><div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  sort(p[21], p[22]);</div><div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  sort(p[23], p[24]);</div><div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  sort(p[0], p[12]);</div><div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  sort(p[8], p[20]);</div><div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  sort(p[8], p[12]);</div><div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  sort(p[4], p[16]);</div><div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  sort(p[16], p[24]);</div><div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  sort(p[12], p[16]);</div><div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  sort(p[2], p[14]);</div><div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  sort(p[10], p[22]);</div><div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  sort(p[10], p[14]);</div><div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  sort(p[6], p[18]);</div><div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  sort(p[6], p[10]);</div><div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  sort(p[10], p[12]);</div><div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  sort(p[1], p[13]);</div><div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  sort(p[9], p[21]);</div><div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  sort(p[9], p[13]);</div><div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  sort(p[5], p[17]);</div><div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  sort(p[13], p[17]);</div><div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  sort(p[3], p[15]);</div><div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  sort(p[11], p[23]);</div><div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  sort(p[11], p[15]);</div><div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  sort(p[7], p[19]);</div><div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  sort(p[7], p[11]);</div><div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  sort(p[11], p[13]);</div><div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  sort(p[11], p[12]);</div><div class="line"><a name="l00340"></a><span class="lineno"> 340</span> }</div><div class="line"><a name="l00341"></a><span class="lineno"> 341</span> } <span class="comment">// namespace</span></div><div class="line"><a name="l00342"></a><span class="lineno"> 342</span> </div><div class="line"><a name="l00343"></a><span class="lineno"><a class="line" href="classarm__compute_1_1_n_e_non_linear_filter_kernel.xhtml#af7d8f3eac26e577c2c1754a7c2dab402"> 343</a></span> <a class="code" href="classarm__compute_1_1_n_e_non_linear_filter_kernel.xhtml#af7d8f3eac26e577c2c1754a7c2dab402">NENonLinearFilterKernel::NENonLinearFilterKernel</a>()</div><div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  : _border_width(0), _input(nullptr), _output(nullptr), _mask(nullptr), _pattern(<a class="code" href="namespacearm__compute.xhtml#afdda916edc7502967bbec17ea3c06c02">MatrixPattern</a>::<a class="code" href="namespacearm__compute.xhtml#afdda916edc7502967bbec17ea3c06c02ae657cce1913c857166b0475f18668ef5">BOX</a>), _function(<a class="code" href="namespacearm__compute.xhtml#adf2ced65e536375a1c96425d9fced858">NonLinearFilterFunction</a>::<a class="code" href="elementwise__operation_8cl.xhtml#a74e75242132eaabbc1c512488a135926">MIN</a>), _func_idx(0), _border_size()</div><div class="line"><a name="l00345"></a><span class="lineno"> 345</span> {</div><div class="line"><a name="l00346"></a><span class="lineno"> 346</span> }</div><div class="line"><a name="l00347"></a><span class="lineno"> 347</span> </div><div class="line"><a name="l00348"></a><span class="lineno"><a class="line" href="classarm__compute_1_1_n_e_non_linear_filter_kernel.xhtml#a423f9a45a52983b4de5e2b347f4369c7"> 348</a></span> <a class="code" href="structarm__compute_1_1_border_size.xhtml">BorderSize</a> <a class="code" href="classarm__compute_1_1_n_e_non_linear_filter_kernel.xhtml#a423f9a45a52983b4de5e2b347f4369c7">NENonLinearFilterKernel::border_size</a>()<span class="keyword"> const</span></div><div class="line"><a name="l00349"></a><span class="lineno"> 349</span> <span class="keyword"></span>{</div><div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  <span class="keywordflow">return</span> _border_size;</div><div class="line"><a name="l00351"></a><span class="lineno"> 351</span> }</div><div class="line"><a name="l00352"></a><span class="lineno"> 352</span> </div><div class="line"><a name="l00353"></a><span class="lineno"><a class="line" href="classarm__compute_1_1_n_e_non_linear_filter_kernel.xhtml#ab85de2b20def413700f940020fe8d7e3"> 353</a></span> <span class="keywordtype">void</span> <a class="code" href="classarm__compute_1_1_n_e_non_linear_filter_kernel.xhtml#ab85de2b20def413700f940020fe8d7e3">NENonLinearFilterKernel::configure</a>(<span class="keyword">const</span> <a class="code" href="classarm__compute_1_1_i_tensor.xhtml">ITensor</a> *input, <a class="code" href="classarm__compute_1_1_i_tensor.xhtml">ITensor</a> *output, <a class="code" href="namespacearm__compute.xhtml#adf2ced65e536375a1c96425d9fced858">NonLinearFilterFunction</a> <span class="keyword">function</span>, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> mask_size, <a class="code" href="namespacearm__compute.xhtml#afdda916edc7502967bbec17ea3c06c02">MatrixPattern</a> pattern, <span class="keyword">const</span> uint8_t *mask,</div><div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  <span class="keywordtype">bool</span> border_undefined)</div><div class="line"><a name="l00355"></a><span class="lineno"> 355</span> {</div><div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  <a class="code" href="_validate_8h.xhtml#aadf5c9cff86327b96d88d04649d9715e">ARM_COMPUTE_ERROR_ON_DATA_TYPE_CHANNEL_NOT_IN</a>(input, 1, <a class="code" href="namespacearm__compute.xhtml#ab4e88c89b3b7ea1735996cc4def22d58a6669348b484e3008dca2bfa8e85e40b5">DataType::U8</a>);</div><div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  <a class="code" href="_validate_8h.xhtml#aadf5c9cff86327b96d88d04649d9715e">ARM_COMPUTE_ERROR_ON_DATA_TYPE_CHANNEL_NOT_IN</a>(output, 1, <a class="code" href="namespacearm__compute.xhtml#ab4e88c89b3b7ea1735996cc4def22d58a6669348b484e3008dca2bfa8e85e40b5">DataType::U8</a>);</div><div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  <a class="code" href="_error_8h.xhtml#a54a6080c9f4df1f908e57a9bbb46f5da">ARM_COMPUTE_ERROR_ON</a>(3 != mask_size && 5 != mask_size);</div><div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  <a class="code" href="_error_8h.xhtml#a54a6080c9f4df1f908e57a9bbb46f5da">ARM_COMPUTE_ERROR_ON</a>(<a class="code" href="namespacearm__compute.xhtml#afdda916edc7502967bbec17ea3c06c02a03570470bad94692ce93e32700d2e1cb">MatrixPattern::OTHER</a> == pattern && <span class="keyword">nullptr</span> == mask);</div><div class="line"><a name="l00360"></a><span class="lineno"> 360</span> </div><div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  <span class="comment">// Set class variables</span></div><div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  _border_size = <a class="code" href="structarm__compute_1_1_border_size.xhtml">BorderSize</a>(mask_size / 2);</div><div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  _input = input;</div><div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  _output = output;</div><div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  _mask = mask;</div><div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  _pattern = pattern;</div><div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  _function = <span class="keyword">function</span>;</div><div class="line"><a name="l00368"></a><span class="lineno"> 368</span> </div><div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  <span class="comment">// Configure kernel window</span></div><div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> num_elems_processed_per_iteration = (<a class="code" href="namespacearm__compute.xhtml#afdda916edc7502967bbec17ea3c06c02a03570470bad94692ce93e32700d2e1cb">MatrixPattern::OTHER</a> == pattern) ? 1 : 8;</div><div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  constexpr <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> num_elems_read_per_iteration = 16;</div><div class="line"><a name="l00372"></a><span class="lineno"> 372</span> </div><div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  <a class="code" href="classarm__compute_1_1_window.xhtml">Window</a> win = <a class="code" href="namespacearm__compute.xhtml#ab7980fa5ee693e3282a76da047a1c3b5">calculate_max_window</a>(*input-><a class="code" href="classarm__compute_1_1_i_tensor.xhtml#a0e95dc1e53c361348314873b168ae237">info</a>(), num_elems_processed_per_iteration, border_undefined, <a class="code" href="classarm__compute_1_1_n_e_non_linear_filter_kernel.xhtml#a423f9a45a52983b4de5e2b347f4369c7">border_size</a>());</div><div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  <a class="code" href="classarm__compute_1_1_access_window_horizontal.xhtml">AccessWindowHorizontal</a> output_access(output-><a class="code" href="classarm__compute_1_1_i_tensor.xhtml#a0e95dc1e53c361348314873b168ae237">info</a>(), 0, num_elems_processed_per_iteration);</div><div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  <a class="code" href="namespacearm__compute.xhtml#afc4bd8e872567d9c4c57d89eb0bb3da1">update_window_and_padding</a>(win,</div><div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  <a class="code" href="classarm__compute_1_1_access_window_rectangle.xhtml">AccessWindowRectangle</a>(input-><a class="code" href="classarm__compute_1_1_i_tensor.xhtml#a0e95dc1e53c361348314873b168ae237">info</a>(), -<a class="code" href="classarm__compute_1_1_n_e_non_linear_filter_kernel.xhtml#a423f9a45a52983b4de5e2b347f4369c7">border_size</a>().<a class="code" href="structarm__compute_1_1_border_size.xhtml#a05374b750b0fc472c34ee61e6f028bba">left</a>, -<a class="code" href="classarm__compute_1_1_n_e_non_linear_filter_kernel.xhtml#a423f9a45a52983b4de5e2b347f4369c7">border_size</a>().<a class="code" href="structarm__compute_1_1_border_size.xhtml#a3fdd42ea34070a54e696b3adc28c4be3">top</a>, num_elems_read_per_iteration, mask_size),</div><div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  output_access);</div><div class="line"><a name="l00378"></a><span class="lineno"> 378</span>  output_access.set_valid_region(win, input-><a class="code" href="classarm__compute_1_1_i_tensor.xhtml#a0e95dc1e53c361348314873b168ae237">info</a>()-><a class="code" href="classarm__compute_1_1_i_tensor_info.xhtml#a74dfd07380a290c34fe7c8e065029b95">valid_region</a>(), border_undefined, <a class="code" href="classarm__compute_1_1_n_e_non_linear_filter_kernel.xhtml#a423f9a45a52983b4de5e2b347f4369c7">border_size</a>());</div><div class="line"><a name="l00379"></a><span class="lineno"> 379</span> </div><div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  INEKernel::configure(win);</div><div class="line"><a name="l00381"></a><span class="lineno"> 381</span> </div><div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  <span class="comment">// Define function index</span></div><div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  _func_idx = (3 == mask_size) ? 0 : 1;</div><div class="line"><a name="l00384"></a><span class="lineno"> 384</span> </div><div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  <span class="keywordflow">if</span>(<a class="code" href="namespacearm__compute.xhtml#afdda916edc7502967bbec17ea3c06c02a03570470bad94692ce93e32700d2e1cb">MatrixPattern::OTHER</a> != pattern)</div><div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  {</div><div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  _func_idx = (_func_idx) * 3 + static_cast<unsigned int>(<span class="keyword">function</span>);</div><div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  }</div><div class="line"><a name="l00389"></a><span class="lineno"> 389</span> }</div><div class="line"><a name="l00390"></a><span class="lineno"> 390</span> </div><div class="line"><a name="l00391"></a><span class="lineno"> 391</span> <span class="keywordtype">void</span> NENonLinearFilterKernel::fill_mask(uint8_t *mask, <span class="keywordtype">int</span> cols, <span class="keywordtype">int</span> rows, <a class="code" href="namespacearm__compute.xhtml#afdda916edc7502967bbec17ea3c06c02">MatrixPattern</a> pattern)</div><div class="line"><a name="l00392"></a><span class="lineno"> 392</span> {</div><div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> v = 0;</div><div class="line"><a name="l00394"></a><span class="lineno"> 394</span> </div><div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  <span class="keywordflow">for</span>(<span class="keywordtype">int</span> r = 0; r < rows; ++r)</div><div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  {</div><div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  <span class="keywordflow">for</span>(<span class="keywordtype">int</span> c = 0; c < cols; ++c, ++v)</div><div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  {</div><div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  uint8_t val = 0;</div><div class="line"><a name="l00400"></a><span class="lineno"> 400</span> </div><div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  <span class="keywordflow">switch</span>(pattern)</div><div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  {</div><div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  <span class="keywordflow">case</span> <a class="code" href="namespacearm__compute.xhtml#afdda916edc7502967bbec17ea3c06c02ae657cce1913c857166b0475f18668ef5">MatrixPattern::BOX</a>:</div><div class="line"><a name="l00404"></a><span class="lineno"> 404</span>  val = 255;</div><div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  <span class="keywordflow">break</span>;</div><div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  <span class="keywordflow">case</span> <a class="code" href="namespacearm__compute.xhtml#afdda916edc7502967bbec17ea3c06c02a04dd53a8e6c2306e9bbf944c1d6047f2">MatrixPattern::CROSS</a>:</div><div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  val = ((r == (rows / 2)) || (c == (cols / 2))) ? 255 : 0;</div><div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  <span class="keywordflow">break</span>;</div><div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  <span class="keywordflow">case</span> <a class="code" href="namespacearm__compute.xhtml#afdda916edc7502967bbec17ea3c06c02a290d4b81f4e2b47d86fd1b0170e9aab7">MatrixPattern::DISK</a>:</div><div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  val = (((r - rows / 2.0f + 0.5f) * (r - rows / 2.0f + 0.5f)) / ((rows / 2.0f) * (rows / 2.0f)) + ((c - cols / 2.0f + 0.5f) * (c - cols / 2.0f + 0.5f)) / ((cols / 2.0f) *</div><div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  (cols / 2.0f))) <= 1.0f ? 255 : 0;</div><div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  <span class="keywordflow">break</span>;</div><div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  <span class="keywordflow">default</span>:</div><div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  }</div><div class="line"><a name="l00416"></a><span class="lineno"> 416</span> </div><div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  mask[v] = val;</div><div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  }</div><div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  }</div><div class="line"><a name="l00420"></a><span class="lineno"> 420</span> }</div><div class="line"><a name="l00421"></a><span class="lineno"> 421</span> </div><div class="line"><a name="l00422"></a><span class="lineno"> 422</span> <span class="keyword">template</span> <></div><div class="line"><a name="l00423"></a><span class="lineno"> 423</span> <span class="keywordtype">void</span> NENonLinearFilterKernel::median_filter_box<3, 3>(<span class="keyword">const</span> Window &win)</div><div class="line"><a name="l00424"></a><span class="lineno"> 424</span> {</div><div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  Iterator input(_input, win);</div><div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  Iterator output(_output, win);</div><div class="line"><a name="l00427"></a><span class="lineno"> 427</span> </div><div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  <span class="keyword">const</span> <span class="keyword">auto</span> input_top_ptr = static_cast<const unsigned char *>(_input-><a class="code" href="classarm__compute_1_1_i_tensor.xhtml#adbd73147d41e8a640bc299d12613c31e">ptr_to_element</a>(Coordinates(-1, -1)));</div><div class="line"><a name="l00429"></a><span class="lineno"> 429</span>  <span class="keyword">const</span> <span class="keyword">auto</span> input_mid_ptr = static_cast<const unsigned char *>(_input-><a class="code" href="classarm__compute_1_1_i_tensor.xhtml#adbd73147d41e8a640bc299d12613c31e">ptr_to_element</a>(Coordinates(-1, 0)));</div><div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  <span class="keyword">const</span> <span class="keyword">auto</span> input_bot_ptr = static_cast<const unsigned char *>(_input-><a class="code" href="classarm__compute_1_1_i_tensor.xhtml#adbd73147d41e8a640bc299d12613c31e">ptr_to_element</a>(Coordinates(-1, 1)));</div><div class="line"><a name="l00431"></a><span class="lineno"> 431</span> </div><div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  <a class="code" href="namespacearm__compute.xhtml#a5002bf7ec46d52971f9526e94172cfee">execute_window_loop</a>(win, [&](<span class="keyword">const</span> Coordinates &)</div><div class="line"><a name="l00433"></a><span class="lineno"> 433</span>  {</div><div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  <span class="keyword">const</span> uint8x16_t top_data = vld1q_u8(input_top_ptr + input.offset());</div><div class="line"><a name="l00435"></a><span class="lineno"> 435</span>  <span class="keyword">const</span> uint8x16_t mid_data = vld1q_u8(input_mid_ptr + input.offset());</div><div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  <span class="keyword">const</span> uint8x16_t bot_data = vld1q_u8(input_bot_ptr + input.offset());</div><div class="line"><a name="l00437"></a><span class="lineno"> 437</span> </div><div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  uint8x8_t p0 = vget_low_u8(top_data);</div><div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  uint8x8_t p1 = vext_u8(vget_low_u8(top_data), vget_high_u8(top_data), 1);</div><div class="line"><a name="l00440"></a><span class="lineno"> 440</span>  uint8x8_t p2 = vext_u8(vget_low_u8(top_data), vget_high_u8(top_data), 2);</div><div class="line"><a name="l00441"></a><span class="lineno"> 441</span>  uint8x8_t p3 = vget_low_u8(mid_data);</div><div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  uint8x8_t p4 = vext_u8(vget_low_u8(mid_data), vget_high_u8(mid_data), 1);</div><div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  uint8x8_t p5 = vext_u8(vget_low_u8(mid_data), vget_high_u8(mid_data), 2);</div><div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  uint8x8_t p6 = vget_low_u8(bot_data);</div><div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  uint8x8_t p7 = vext_u8(vget_low_u8(bot_data), vget_high_u8(bot_data), 1);</div><div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  uint8x8_t p8 = vext_u8(vget_low_u8(bot_data), vget_high_u8(bot_data), 2);</div><div class="line"><a name="l00447"></a><span class="lineno"> 447</span> </div><div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  <a class="code" href="non__linear__filter__helpers_8h.xhtml#a0960df49e39a9499677066c32600c17f">sort9</a>(p0, p1, p2, p3, p4, p5, p6, p7, p8);</div><div class="line"><a name="l00449"></a><span class="lineno"> 449</span> </div><div class="line"><a name="l00450"></a><span class="lineno"> 450</span>  vst1_u8(output.ptr(), p4);</div><div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  },</div><div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  input, output);</div><div class="line"><a name="l00453"></a><span class="lineno"> 453</span> }</div><div class="line"><a name="l00454"></a><span class="lineno"> 454</span> <span class="keyword">template</span> <></div><div class="line"><a name="l00455"></a><span class="lineno"> 455</span> <span class="keywordtype">void</span> NENonLinearFilterKernel::median_filter_box<5, 5>(<span class="keyword">const</span> Window &win)</div><div class="line"><a name="l00456"></a><span class="lineno"> 456</span> {</div><div class="line"><a name="l00457"></a><span class="lineno"> 457</span>  Iterator input(_input, win);</div><div class="line"><a name="l00458"></a><span class="lineno"> 458</span>  Iterator output(_output, win);</div><div class="line"><a name="l00459"></a><span class="lineno"> 459</span> </div><div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  <span class="keyword">const</span> <span class="keyword">auto</span> input_top2_ptr = static_cast<const unsigned char *>(_input-><a class="code" href="classarm__compute_1_1_i_tensor.xhtml#adbd73147d41e8a640bc299d12613c31e">ptr_to_element</a>(Coordinates(-2, -2)));</div><div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  <span class="keyword">const</span> <span class="keyword">auto</span> input_top_ptr = static_cast<const unsigned char *>(_input-><a class="code" href="classarm__compute_1_1_i_tensor.xhtml#adbd73147d41e8a640bc299d12613c31e">ptr_to_element</a>(Coordinates(-2, -1)));</div><div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  <span class="keyword">const</span> <span class="keyword">auto</span> input_mid_ptr = static_cast<const unsigned char *>(_input-><a class="code" href="classarm__compute_1_1_i_tensor.xhtml#adbd73147d41e8a640bc299d12613c31e">ptr_to_element</a>(Coordinates(-2, 0)));</div><div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  <span class="keyword">const</span> <span class="keyword">auto</span> input_bot_ptr = static_cast<const unsigned char *>(_input-><a class="code" href="classarm__compute_1_1_i_tensor.xhtml#adbd73147d41e8a640bc299d12613c31e">ptr_to_element</a>(Coordinates(-2, 1)));</div><div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  <span class="keyword">const</span> <span class="keyword">auto</span> input_bot2_ptr = static_cast<const unsigned char *>(_input-><a class="code" href="classarm__compute_1_1_i_tensor.xhtml#adbd73147d41e8a640bc299d12613c31e">ptr_to_element</a>(Coordinates(-2, 2)));</div><div class="line"><a name="l00465"></a><span class="lineno"> 465</span> </div><div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  <a class="code" href="namespacearm__compute.xhtml#a5002bf7ec46d52971f9526e94172cfee">execute_window_loop</a>(win, [&](<span class="keyword">const</span> Coordinates &)</div><div class="line"><a name="l00467"></a><span class="lineno"> 467</span>  {</div><div class="line"><a name="l00468"></a><span class="lineno"> 468</span>  <span class="keyword">const</span> uint8x16_t top2_data = vld1q_u8(input_top2_ptr + input.offset());</div><div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  <span class="keyword">const</span> uint8x16_t top_data = vld1q_u8(input_top_ptr + input.offset());</div><div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  <span class="keyword">const</span> uint8x16_t mid_data = vld1q_u8(input_mid_ptr + input.offset());</div><div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  <span class="keyword">const</span> uint8x16_t bot_data = vld1q_u8(input_bot_ptr + input.offset());</div><div class="line"><a name="l00472"></a><span class="lineno"> 472</span>  <span class="keyword">const</span> uint8x16_t bot2_data = vld1q_u8(input_bot2_ptr + input.offset());</div><div class="line"><a name="l00473"></a><span class="lineno"> 473</span> </div><div class="line"><a name="l00474"></a><span class="lineno"> 474</span>  <span class="keyword">const</span> std::array<uint8x8_t, 10> d =</div><div class="line"><a name="l00475"></a><span class="lineno"> 475</span>  {</div><div class="line"><a name="l00476"></a><span class="lineno"> 476</span>  vget_low_u8(top2_data),</div><div class="line"><a name="l00477"></a><span class="lineno"> 477</span>  vget_high_u8(top2_data),</div><div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  vget_low_u8(top_data),</div><div class="line"><a name="l00479"></a><span class="lineno"> 479</span>  vget_high_u8(top_data),</div><div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  vget_low_u8(mid_data),</div><div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  vget_high_u8(mid_data),</div><div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  vget_low_u8(bot_data),</div><div class="line"><a name="l00483"></a><span class="lineno"> 483</span>  vget_high_u8(bot_data),</div><div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  vget_low_u8(bot2_data),</div><div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  vget_high_u8(bot2_data)</div><div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  };</div><div class="line"><a name="l00487"></a><span class="lineno"> 487</span> </div><div class="line"><a name="l00488"></a><span class="lineno"> 488</span>  std::array<uint8x8_t, 25> p{ 0 };</div><div class="line"><a name="l00489"></a><span class="lineno"> 489</span>  <span class="keywordflow">for</span>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i = 0; i < 5; ++i)</div><div class="line"><a name="l00490"></a><span class="lineno"> 490</span>  {</div><div class="line"><a name="l00491"></a><span class="lineno"> 491</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> idx_d = i * 2;</div><div class="line"><a name="l00492"></a><span class="lineno"> 492</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> idx_p = i * 5;</div><div class="line"><a name="l00493"></a><span class="lineno"> 493</span> </div><div class="line"><a name="l00494"></a><span class="lineno"> 494</span>  p[idx_p] = d[idx_d];</div><div class="line"><a name="l00495"></a><span class="lineno"> 495</span>  p[idx_p + 1] = vext_u8(d[idx_d], d[idx_d + 1], 1);</div><div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  p[idx_p + 2] = vext_u8(d[idx_d], d[idx_d + 1], 2);</div><div class="line"><a name="l00497"></a><span class="lineno"> 497</span>  p[idx_p + 3] = vext_u8(d[idx_d], d[idx_d + 1], 3);</div><div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  p[idx_p + 4] = vext_u8(d[idx_d], d[idx_d + 1], 4);</div><div class="line"><a name="l00499"></a><span class="lineno"> 499</span>  }</div><div class="line"><a name="l00500"></a><span class="lineno"> 500</span> </div><div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  sort25(p);</div><div class="line"><a name="l00502"></a><span class="lineno"> 502</span> </div><div class="line"><a name="l00503"></a><span class="lineno"> 503</span>  vst1_u8(output.ptr(), p[12]);</div><div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  },</div><div class="line"><a name="l00505"></a><span class="lineno"> 505</span>  input, output);</div><div class="line"><a name="l00506"></a><span class="lineno"> 506</span> }</div><div class="line"><a name="l00507"></a><span class="lineno"> 507</span> </div><div class="line"><a name="l00508"></a><span class="lineno"> 508</span> <span class="keyword">template</span> <<span class="keywordtype">int</span> mask_w, <span class="keywordtype">int</span> mask_h></div><div class="line"><a name="l00509"></a><span class="lineno"> 509</span> <span class="keywordtype">void</span> NENonLinearFilterKernel::min_filter_box(<span class="keyword">const</span> Window &win)</div><div class="line"><a name="l00510"></a><span class="lineno"> 510</span> {</div><div class="line"><a name="l00511"></a><span class="lineno"> 511</span>  static_assert(mask_w > 0, <span class="stringliteral">"Mask size must not be 0"</span>);</div><div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  static_assert(mask_h > 0, <span class="stringliteral">"Mask size must not be 0"</span>);</div><div class="line"><a name="l00513"></a><span class="lineno"> 513</span> </div><div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  Iterator input(_input, win);</div><div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  Iterator output(_output, win);</div><div class="line"><a name="l00516"></a><span class="lineno"> 516</span> </div><div class="line"><a name="l00517"></a><span class="lineno"> 517</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> k_row_half = mask_h / 2;</div><div class="line"><a name="l00518"></a><span class="lineno"> 518</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> k_col_half = mask_w / 2;</div><div class="line"><a name="l00519"></a><span class="lineno"> 519</span> </div><div class="line"><a name="l00520"></a><span class="lineno"> 520</span>  <span class="comment">// Set row pointers</span></div><div class="line"><a name="l00521"></a><span class="lineno"> 521</span>  std::array<const unsigned char *, mask_h> input_ptrs{ {} };</div><div class="line"><a name="l00522"></a><span class="lineno"> 522</span>  <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i = -k_row_half; i <= k_row_half; ++i)</div><div class="line"><a name="l00523"></a><span class="lineno"> 523</span>  {</div><div class="line"><a name="l00524"></a><span class="lineno"> 524</span>  input_ptrs[k_row_half + i] = _input-><a class="code" href="classarm__compute_1_1_i_tensor.xhtml#ab988210662dbd3bf32fd563c7dd1bdbf">buffer</a>() + _input-><a class="code" href="classarm__compute_1_1_i_tensor.xhtml#a0e95dc1e53c361348314873b168ae237">info</a>()-><a class="code" href="classarm__compute_1_1_i_tensor_info.xhtml#a8a5312c9a822d27a3b38dc238c1c7de3">offset_element_in_bytes</a>(Coordinates(-k_col_half, i));</div><div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  }</div><div class="line"><a name="l00526"></a><span class="lineno"> 526</span> </div><div class="line"><a name="l00527"></a><span class="lineno"> 527</span>  <a class="code" href="namespacearm__compute.xhtml#a5002bf7ec46d52971f9526e94172cfee">execute_window_loop</a>(win, [&](<span class="keyword">const</span> Coordinates &)</div><div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  {</div><div class="line"><a name="l00529"></a><span class="lineno"> 529</span>  <span class="comment">// Get min of rows</span></div><div class="line"><a name="l00530"></a><span class="lineno"> 530</span>  uint8x16_t rows_min = vld1q_u8(input_ptrs[0] + input.offset());</div><div class="line"><a name="l00531"></a><span class="lineno"> 531</span> </div><div class="line"><a name="l00532"></a><span class="lineno"> 532</span>  <span class="keywordflow">for</span>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> r = 1; r < mask_h; ++r)</div><div class="line"><a name="l00533"></a><span class="lineno"> 533</span>  {</div><div class="line"><a name="l00534"></a><span class="lineno"> 534</span>  <span class="keyword">const</span> uint8x16_t data = vld1q_u8(input_ptrs[r] + input.offset());</div><div class="line"><a name="l00535"></a><span class="lineno"> 535</span>  rows_min = vminq_u8(rows_min, data);</div><div class="line"><a name="l00536"></a><span class="lineno"> 536</span>  }</div><div class="line"><a name="l00537"></a><span class="lineno"> 537</span> </div><div class="line"><a name="l00538"></a><span class="lineno"> 538</span>  <span class="keyword">const</span> uint8x8_t out = min_row<mask_w>(rows_min);</div><div class="line"><a name="l00539"></a><span class="lineno"> 539</span> </div><div class="line"><a name="l00540"></a><span class="lineno"> 540</span>  <span class="comment">// Store result as U8</span></div><div class="line"><a name="l00541"></a><span class="lineno"> 541</span>  vst1_u8(output.ptr(), out);</div><div class="line"><a name="l00542"></a><span class="lineno"> 542</span>  },</div><div class="line"><a name="l00543"></a><span class="lineno"> 543</span>  input, output);</div><div class="line"><a name="l00544"></a><span class="lineno"> 544</span> }</div><div class="line"><a name="l00545"></a><span class="lineno"> 545</span> </div><div class="line"><a name="l00546"></a><span class="lineno"> 546</span> <span class="keyword">template</span> <<span class="keywordtype">int</span> mask_w, <span class="keywordtype">int</span> mask_h></div><div class="line"><a name="l00547"></a><span class="lineno"> 547</span> <span class="keywordtype">void</span> NENonLinearFilterKernel::max_filter_box(<span class="keyword">const</span> Window &win)</div><div class="line"><a name="l00548"></a><span class="lineno"> 548</span> {</div><div class="line"><a name="l00549"></a><span class="lineno"> 549</span>  static_assert(mask_w > 0, <span class="stringliteral">"Mask size must not be 0"</span>);</div><div class="line"><a name="l00550"></a><span class="lineno"> 550</span>  static_assert(mask_h > 0, <span class="stringliteral">"Mask size must not be 0"</span>);</div><div class="line"><a name="l00551"></a><span class="lineno"> 551</span>  <a class="code" href="_error_8h.xhtml#a54a6080c9f4df1f908e57a9bbb46f5da">ARM_COMPUTE_ERROR_ON</a>(_input-><a class="code" href="classarm__compute_1_1_i_tensor.xhtml#ab988210662dbd3bf32fd563c7dd1bdbf">buffer</a>() == <span class="keyword">nullptr</span>);</div><div class="line"><a name="l00552"></a><span class="lineno"> 552</span> </div><div class="line"><a name="l00553"></a><span class="lineno"> 553</span>  Iterator input(_input, win);</div><div class="line"><a name="l00554"></a><span class="lineno"> 554</span>  Iterator output(_output, win);</div><div class="line"><a name="l00555"></a><span class="lineno"> 555</span> </div><div class="line"><a name="l00556"></a><span class="lineno"> 556</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> k_row_half = mask_h / 2;</div><div class="line"><a name="l00557"></a><span class="lineno"> 557</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> k_col_half = mask_w / 2;</div><div class="line"><a name="l00558"></a><span class="lineno"> 558</span> </div><div class="line"><a name="l00559"></a><span class="lineno"> 559</span>  <span class="comment">// Set row pointers</span></div><div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  std::array<const unsigned char *, mask_h> input_ptrs{ {} };</div><div class="line"><a name="l00561"></a><span class="lineno"> 561</span>  <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i = -k_row_half; i <= k_row_half; ++i)</div><div class="line"><a name="l00562"></a><span class="lineno"> 562</span>  {</div><div class="line"><a name="l00563"></a><span class="lineno"> 563</span>  input_ptrs[k_row_half + i] = _input-><a class="code" href="classarm__compute_1_1_i_tensor.xhtml#ab988210662dbd3bf32fd563c7dd1bdbf">buffer</a>() + _input-><a class="code" href="classarm__compute_1_1_i_tensor.xhtml#a0e95dc1e53c361348314873b168ae237">info</a>()-><a class="code" href="classarm__compute_1_1_i_tensor_info.xhtml#a8a5312c9a822d27a3b38dc238c1c7de3">offset_element_in_bytes</a>(Coordinates(-k_col_half, i));</div><div class="line"><a name="l00564"></a><span class="lineno"> 564</span>  }</div><div class="line"><a name="l00565"></a><span class="lineno"> 565</span> </div><div class="line"><a name="l00566"></a><span class="lineno"> 566</span>  <a class="code" href="namespacearm__compute.xhtml#a5002bf7ec46d52971f9526e94172cfee">execute_window_loop</a>(win, [&](<span class="keyword">const</span> Coordinates &)</div><div class="line"><a name="l00567"></a><span class="lineno"> 567</span>  {</div><div class="line"><a name="l00568"></a><span class="lineno"> 568</span>  uint8x16_t rows_max = vld1q_u8(input_ptrs[0] + input.offset());</div><div class="line"><a name="l00569"></a><span class="lineno"> 569</span> </div><div class="line"><a name="l00570"></a><span class="lineno"> 570</span>  <span class="comment">// Get max of rows</span></div><div class="line"><a name="l00571"></a><span class="lineno"> 571</span>  <span class="keywordflow">for</span>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> r = 1; r < mask_h; ++r)</div><div class="line"><a name="l00572"></a><span class="lineno"> 572</span>  {</div><div class="line"><a name="l00573"></a><span class="lineno"> 573</span>  <span class="keyword">const</span> uint8x16_t data = vld1q_u8(input_ptrs[r] + input.offset());</div><div class="line"><a name="l00574"></a><span class="lineno"> 574</span>  rows_max = vmaxq_u8(rows_max, data);</div><div class="line"><a name="l00575"></a><span class="lineno"> 575</span>  }</div><div class="line"><a name="l00576"></a><span class="lineno"> 576</span> </div><div class="line"><a name="l00577"></a><span class="lineno"> 577</span>  <span class="comment">// Get max of columns</span></div><div class="line"><a name="l00578"></a><span class="lineno"> 578</span>  <span class="keyword">const</span> uint8x8_t out = max_row<mask_w>(rows_max);</div><div class="line"><a name="l00579"></a><span class="lineno"> 579</span> </div><div class="line"><a name="l00580"></a><span class="lineno"> 580</span>  <span class="comment">// Store result as U8</span></div><div class="line"><a name="l00581"></a><span class="lineno"> 581</span>  vst1_u8(output.ptr(), out);</div><div class="line"><a name="l00582"></a><span class="lineno"> 582</span>  },</div><div class="line"><a name="l00583"></a><span class="lineno"> 583</span>  input, output);</div><div class="line"><a name="l00584"></a><span class="lineno"> 584</span> }</div><div class="line"><a name="l00585"></a><span class="lineno"> 585</span> </div><div class="line"><a name="l00586"></a><span class="lineno"> 586</span> <span class="keyword">template</span> <></div><div class="line"><a name="l00587"></a><span class="lineno"> 587</span> <span class="keywordtype">void</span> NENonLinearFilterKernel::median_filter_cross<3, 3>(<span class="keyword">const</span> Window &win)</div><div class="line"><a name="l00588"></a><span class="lineno"> 588</span> {</div><div class="line"><a name="l00589"></a><span class="lineno"> 589</span>  Iterator input(_input, win);</div><div class="line"><a name="l00590"></a><span class="lineno"> 590</span>  Iterator output(_output, win);</div><div class="line"><a name="l00591"></a><span class="lineno"> 591</span> </div><div class="line"><a name="l00592"></a><span class="lineno"> 592</span>  <span class="keyword">const</span> <span class="keyword">auto</span> input_top_ptr = static_cast<const unsigned char *>(_input-><a class="code" href="classarm__compute_1_1_i_tensor.xhtml#adbd73147d41e8a640bc299d12613c31e">ptr_to_element</a>(Coordinates(0, -1)));</div><div class="line"><a name="l00593"></a><span class="lineno"> 593</span>  <span class="keyword">const</span> <span class="keyword">auto</span> input_mid_ptr = static_cast<const unsigned char *>(_input-><a class="code" href="classarm__compute_1_1_i_tensor.xhtml#adbd73147d41e8a640bc299d12613c31e">ptr_to_element</a>(Coordinates(-1, 0)));</div><div class="line"><a name="l00594"></a><span class="lineno"> 594</span>  <span class="keyword">const</span> <span class="keyword">auto</span> input_bot_ptr = static_cast<const unsigned char *>(_input-><a class="code" href="classarm__compute_1_1_i_tensor.xhtml#adbd73147d41e8a640bc299d12613c31e">ptr_to_element</a>(Coordinates(0, 1)));</div><div class="line"><a name="l00595"></a><span class="lineno"> 595</span> </div><div class="line"><a name="l00596"></a><span class="lineno"> 596</span>  <a class="code" href="namespacearm__compute.xhtml#a5002bf7ec46d52971f9526e94172cfee">execute_window_loop</a>(win, [&](<span class="keyword">const</span> Coordinates &)</div><div class="line"><a name="l00597"></a><span class="lineno"> 597</span>  {</div><div class="line"><a name="l00598"></a><span class="lineno"> 598</span>  <span class="keyword">const</span> uint8x8_t top_data = vld1_u8(input_top_ptr + input.offset());</div><div class="line"><a name="l00599"></a><span class="lineno"> 599</span>  <span class="keyword">const</span> uint8x16_t mid_data = vld1q_u8(input_mid_ptr + input.offset());</div><div class="line"><a name="l00600"></a><span class="lineno"> 600</span>  <span class="keyword">const</span> uint8x8_t bot_data = vld1_u8(input_bot_ptr + input.offset());</div><div class="line"><a name="l00601"></a><span class="lineno"> 601</span> </div><div class="line"><a name="l00602"></a><span class="lineno"> 602</span>  uint8x8_t p0 = top_data;</div><div class="line"><a name="l00603"></a><span class="lineno"> 603</span>  uint8x8_t p1 = vget_low_u8(mid_data);</div><div class="line"><a name="l00604"></a><span class="lineno"> 604</span>  uint8x8_t p2 = vext_u8(vget_low_u8(mid_data), vget_high_u8(mid_data), 1);</div><div class="line"><a name="l00605"></a><span class="lineno"> 605</span>  uint8x8_t p3 = vext_u8(vget_low_u8(mid_data), vget_high_u8(mid_data), 2);</div><div class="line"><a name="l00606"></a><span class="lineno"> 606</span>  uint8x8_t p4 = bot_data;</div><div class="line"><a name="l00607"></a><span class="lineno"> 607</span> </div><div class="line"><a name="l00608"></a><span class="lineno"> 608</span>  <a class="code" href="non__linear__filter__helpers_8h.xhtml#a7b5c174de888c3cfa7c08c16682fd770">sort5</a>(p0, p1, p2, p3, p4);</div><div class="line"><a name="l00609"></a><span class="lineno"> 609</span> </div><div class="line"><a name="l00610"></a><span class="lineno"> 610</span>  vst1_u8(output.ptr(), p2);</div><div class="line"><a name="l00611"></a><span class="lineno"> 611</span>  },</div><div class="line"><a name="l00612"></a><span class="lineno"> 612</span>  input, output);</div><div class="line"><a name="l00613"></a><span class="lineno"> 613</span> }</div><div class="line"><a name="l00614"></a><span class="lineno"> 614</span> </div><div class="line"><a name="l00615"></a><span class="lineno"> 615</span> <span class="keyword">template</span> <></div><div class="line"><a name="l00616"></a><span class="lineno"> 616</span> <span class="keywordtype">void</span> NENonLinearFilterKernel::median_filter_cross<5, 5>(<span class="keyword">const</span> Window &win)</div><div class="line"><a name="l00617"></a><span class="lineno"> 617</span> {</div><div class="line"><a name="l00618"></a><span class="lineno"> 618</span>  Iterator input(_input, win);</div><div class="line"><a name="l00619"></a><span class="lineno"> 619</span>  Iterator output(_output, win);</div><div class="line"><a name="l00620"></a><span class="lineno"> 620</span> </div><div class="line"><a name="l00621"></a><span class="lineno"> 621</span>  <span class="keyword">const</span> <span class="keyword">auto</span> input_top2_ptr = static_cast<const unsigned char *>(_input-><a class="code" href="classarm__compute_1_1_i_tensor.xhtml#adbd73147d41e8a640bc299d12613c31e">ptr_to_element</a>(Coordinates(0, -2)));</div><div class="line"><a name="l00622"></a><span class="lineno"> 622</span>  <span class="keyword">const</span> <span class="keyword">auto</span> input_top_ptr = static_cast<const unsigned char *>(_input-><a class="code" href="classarm__compute_1_1_i_tensor.xhtml#adbd73147d41e8a640bc299d12613c31e">ptr_to_element</a>(Coordinates(0, -1)));</div><div class="line"><a name="l00623"></a><span class="lineno"> 623</span>  <span class="keyword">const</span> <span class="keyword">auto</span> input_mid_ptr = static_cast<const unsigned char *>(_input-><a class="code" href="classarm__compute_1_1_i_tensor.xhtml#adbd73147d41e8a640bc299d12613c31e">ptr_to_element</a>(Coordinates(-2, 0)));</div><div class="line"><a name="l00624"></a><span class="lineno"> 624</span>  <span class="keyword">const</span> <span class="keyword">auto</span> input_bot_ptr = static_cast<const unsigned char *>(_input-><a class="code" href="classarm__compute_1_1_i_tensor.xhtml#adbd73147d41e8a640bc299d12613c31e">ptr_to_element</a>(Coordinates(0, 1)));</div><div class="line"><a name="l00625"></a><span class="lineno"> 625</span>  <span class="keyword">const</span> <span class="keyword">auto</span> input_bot2_ptr = static_cast<const unsigned char *>(_input-><a class="code" href="classarm__compute_1_1_i_tensor.xhtml#adbd73147d41e8a640bc299d12613c31e">ptr_to_element</a>(Coordinates(0, 2)));</div><div class="line"><a name="l00626"></a><span class="lineno"> 626</span> </div><div class="line"><a name="l00627"></a><span class="lineno"> 627</span>  <a class="code" href="namespacearm__compute.xhtml#a5002bf7ec46d52971f9526e94172cfee">execute_window_loop</a>(win, [&](<span class="keyword">const</span> Coordinates &)</div><div class="line"><a name="l00628"></a><span class="lineno"> 628</span>  {</div><div class="line"><a name="l00629"></a><span class="lineno"> 629</span>  <span class="keyword">const</span> uint8x8_t top2_data = vld1_u8(input_top2_ptr + input.offset());</div><div class="line"><a name="l00630"></a><span class="lineno"> 630</span>  <span class="keyword">const</span> uint8x8_t top_data = vld1_u8(input_top_ptr + input.offset());</div><div class="line"><a name="l00631"></a><span class="lineno"> 631</span>  <span class="keyword">const</span> uint8x16_t mid_data = vld1q_u8(input_mid_ptr + input.offset());</div><div class="line"><a name="l00632"></a><span class="lineno"> 632</span>  <span class="keyword">const</span> uint8x8_t bot_data = vld1_u8(input_bot_ptr + input.offset());</div><div class="line"><a name="l00633"></a><span class="lineno"> 633</span>  <span class="keyword">const</span> uint8x8_t bot2_data = vld1_u8(input_bot2_ptr + input.offset());</div><div class="line"><a name="l00634"></a><span class="lineno"> 634</span> </div><div class="line"><a name="l00635"></a><span class="lineno"> 635</span>  uint8x8_t p0 = top2_data;</div><div class="line"><a name="l00636"></a><span class="lineno"> 636</span>  uint8x8_t p1 = top_data;</div><div class="line"><a name="l00637"></a><span class="lineno"> 637</span>  uint8x8_t p2 = vget_low_u8(mid_data);</div><div class="line"><a name="l00638"></a><span class="lineno"> 638</span>  uint8x8_t p3 = vext_u8(vget_low_u8(mid_data), vget_high_u8(mid_data), 1);</div><div class="line"><a name="l00639"></a><span class="lineno"> 639</span>  uint8x8_t p4 = vext_u8(vget_low_u8(mid_data), vget_high_u8(mid_data), 2);</div><div class="line"><a name="l00640"></a><span class="lineno"> 640</span>  uint8x8_t p5 = vext_u8(vget_low_u8(mid_data), vget_high_u8(mid_data), 3);</div><div class="line"><a name="l00641"></a><span class="lineno"> 641</span>  uint8x8_t p6 = vext_u8(vget_low_u8(mid_data), vget_high_u8(mid_data), 4);</div><div class="line"><a name="l00642"></a><span class="lineno"> 642</span>  uint8x8_t p7 = bot_data;</div><div class="line"><a name="l00643"></a><span class="lineno"> 643</span>  uint8x8_t p8 = bot2_data;</div><div class="line"><a name="l00644"></a><span class="lineno"> 644</span> </div><div class="line"><a name="l00645"></a><span class="lineno"> 645</span>  <a class="code" href="non__linear__filter__helpers_8h.xhtml#a0960df49e39a9499677066c32600c17f">sort9</a>(p0, p1, p2, p3, p4, p5, p6, p7, p8);</div><div class="line"><a name="l00646"></a><span class="lineno"> 646</span> </div><div class="line"><a name="l00647"></a><span class="lineno"> 647</span>  vst1_u8(output.ptr(), p4);</div><div class="line"><a name="l00648"></a><span class="lineno"> 648</span>  },</div><div class="line"><a name="l00649"></a><span class="lineno"> 649</span>  input, output);</div><div class="line"><a name="l00650"></a><span class="lineno"> 650</span> }</div><div class="line"><a name="l00651"></a><span class="lineno"> 651</span> </div><div class="line"><a name="l00652"></a><span class="lineno"> 652</span> <span class="keyword">template</span> <<span class="keywordtype">int</span> mask_w, <span class="keywordtype">int</span> mask_h></div><div class="line"><a name="l00653"></a><span class="lineno"> 653</span> <span class="keywordtype">void</span> NENonLinearFilterKernel::min_filter_cross(<span class="keyword">const</span> Window &win)</div><div class="line"><a name="l00654"></a><span class="lineno"> 654</span> {</div><div class="line"><a name="l00655"></a><span class="lineno"> 655</span>  static_assert(mask_w > 0, <span class="stringliteral">"Mask size must not be 0"</span>);</div><div class="line"><a name="l00656"></a><span class="lineno"> 656</span>  static_assert(mask_h > 0, <span class="stringliteral">"Mask size must not be 0"</span>);</div><div class="line"><a name="l00657"></a><span class="lineno"> 657</span>  <a class="code" href="_error_8h.xhtml#a54a6080c9f4df1f908e57a9bbb46f5da">ARM_COMPUTE_ERROR_ON</a>(_input-><a class="code" href="classarm__compute_1_1_i_tensor.xhtml#ab988210662dbd3bf32fd563c7dd1bdbf">buffer</a>() == <span class="keyword">nullptr</span>);</div><div class="line"><a name="l00658"></a><span class="lineno"> 658</span> </div><div class="line"><a name="l00659"></a><span class="lineno"> 659</span>  Iterator input(_input, win);</div><div class="line"><a name="l00660"></a><span class="lineno"> 660</span>  Iterator output(_output, win);</div><div class="line"><a name="l00661"></a><span class="lineno"> 661</span> </div><div class="line"><a name="l00662"></a><span class="lineno"> 662</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> k_row_half = mask_h / 2;</div><div class="line"><a name="l00663"></a><span class="lineno"> 663</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> k_col_half = mask_w / 2;</div><div class="line"><a name="l00664"></a><span class="lineno"> 664</span> </div><div class="line"><a name="l00665"></a><span class="lineno"> 665</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> *mid_ptr = _input-><a class="code" href="classarm__compute_1_1_i_tensor.xhtml#ab988210662dbd3bf32fd563c7dd1bdbf">buffer</a>() + _input-><a class="code" href="classarm__compute_1_1_i_tensor.xhtml#a0e95dc1e53c361348314873b168ae237">info</a>()-><a class="code" href="classarm__compute_1_1_i_tensor_info.xhtml#a8a5312c9a822d27a3b38dc238c1c7de3">offset_element_in_bytes</a>(Coordinates(-k_col_half, 0));</div><div class="line"><a name="l00666"></a><span class="lineno"> 666</span> </div><div class="line"><a name="l00667"></a><span class="lineno"> 667</span>  <span class="comment">// Set row pointers</span></div><div class="line"><a name="l00668"></a><span class="lineno"> 668</span>  std::array<const unsigned char *, mask_h> input_ptrs{ {} };</div><div class="line"><a name="l00669"></a><span class="lineno"> 669</span>  <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i = -k_row_half; i <= k_row_half; ++i)</div><div class="line"><a name="l00670"></a><span class="lineno"> 670</span>  {</div><div class="line"><a name="l00671"></a><span class="lineno"> 671</span>  input_ptrs[k_row_half + i] = _input-><a class="code" href="classarm__compute_1_1_i_tensor.xhtml#ab988210662dbd3bf32fd563c7dd1bdbf">buffer</a>() + _input-><a class="code" href="classarm__compute_1_1_i_tensor.xhtml#a0e95dc1e53c361348314873b168ae237">info</a>()-><a class="code" href="classarm__compute_1_1_i_tensor_info.xhtml#a8a5312c9a822d27a3b38dc238c1c7de3">offset_element_in_bytes</a>(Coordinates(0, i));</div><div class="line"><a name="l00672"></a><span class="lineno"> 672</span>  }</div><div class="line"><a name="l00673"></a><span class="lineno"> 673</span> </div><div class="line"><a name="l00674"></a><span class="lineno"> 674</span>  <a class="code" href="namespacearm__compute.xhtml#a5002bf7ec46d52971f9526e94172cfee">execute_window_loop</a>(win, [&](<span class="keyword">const</span> Coordinates &)</div><div class="line"><a name="l00675"></a><span class="lineno"> 675</span>  {</div><div class="line"><a name="l00676"></a><span class="lineno"> 676</span>  uint8x8_t rows_min = vld1_u8(input_ptrs[0] + input.offset());</div><div class="line"><a name="l00677"></a><span class="lineno"> 677</span> </div><div class="line"><a name="l00678"></a><span class="lineno"> 678</span>  <span class="comment">// Get min of rows</span></div><div class="line"><a name="l00679"></a><span class="lineno"> 679</span>  <span class="keywordflow">for</span>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> r = 1; r < mask_h; ++r)</div><div class="line"><a name="l00680"></a><span class="lineno"> 680</span>  {</div><div class="line"><a name="l00681"></a><span class="lineno"> 681</span>  <span class="keyword">const</span> uint8x8_t data = vld1_u8(input_ptrs[r] + input.offset());</div><div class="line"><a name="l00682"></a><span class="lineno"> 682</span>  rows_min = vmin_u8(rows_min, data);</div><div class="line"><a name="l00683"></a><span class="lineno"> 683</span>  }</div><div class="line"><a name="l00684"></a><span class="lineno"> 684</span> </div><div class="line"><a name="l00685"></a><span class="lineno"> 685</span>  <span class="comment">// Get min of middle row</span></div><div class="line"><a name="l00686"></a><span class="lineno"> 686</span>  <span class="keyword">const</span> uint8x16_t data = vld1q_u8(mid_ptr + input.offset());</div><div class="line"><a name="l00687"></a><span class="lineno"> 687</span>  uint8x8_t out = min_row<mask_w>(data);</div><div class="line"><a name="l00688"></a><span class="lineno"> 688</span> </div><div class="line"><a name="l00689"></a><span class="lineno"> 689</span>  <span class="comment">// Get final min</span></div><div class="line"><a name="l00690"></a><span class="lineno"> 690</span>  out = vmin_u8(out, rows_min);</div><div class="line"><a name="l00691"></a><span class="lineno"> 691</span> </div><div class="line"><a name="l00692"></a><span class="lineno"> 692</span>  <span class="comment">// Store result as U8</span></div><div class="line"><a name="l00693"></a><span class="lineno"> 693</span>  vst1_u8(output.ptr(), out);</div><div class="line"><a name="l00694"></a><span class="lineno"> 694</span>  },</div><div class="line"><a name="l00695"></a><span class="lineno"> 695</span>  input, output);</div><div class="line"><a name="l00696"></a><span class="lineno"> 696</span> }</div><div class="line"><a name="l00697"></a><span class="lineno"> 697</span> </div><div class="line"><a name="l00698"></a><span class="lineno"> 698</span> <span class="keyword">template</span> <<span class="keywordtype">int</span> mask_w, <span class="keywordtype">int</span> mask_h></div><div class="line"><a name="l00699"></a><span class="lineno"> 699</span> <span class="keywordtype">void</span> NENonLinearFilterKernel::max_filter_cross(<span class="keyword">const</span> Window &win)</div><div class="line"><a name="l00700"></a><span class="lineno"> 700</span> {</div><div class="line"><a name="l00701"></a><span class="lineno"> 701</span>  static_assert(mask_w > 0, <span class="stringliteral">"Mask size must not be 0"</span>);</div><div class="line"><a name="l00702"></a><span class="lineno"> 702</span>  static_assert(mask_h > 0, <span class="stringliteral">"Mask size must not be 0"</span>);</div><div class="line"><a name="l00703"></a><span class="lineno"> 703</span>  <a class="code" href="_error_8h.xhtml#a54a6080c9f4df1f908e57a9bbb46f5da">ARM_COMPUTE_ERROR_ON</a>(_input-><a class="code" href="classarm__compute_1_1_i_tensor.xhtml#ab988210662dbd3bf32fd563c7dd1bdbf">buffer</a>() == <span class="keyword">nullptr</span>);</div><div class="line"><a name="l00704"></a><span class="lineno"> 704</span> </div><div class="line"><a name="l00705"></a><span class="lineno"> 705</span>  Iterator input(_input, win);</div><div class="line"><a name="l00706"></a><span class="lineno"> 706</span>  Iterator output(_output, win);</div><div class="line"><a name="l00707"></a><span class="lineno"> 707</span> </div><div class="line"><a name="l00708"></a><span class="lineno"> 708</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> k_row_half = mask_h / 2;</div><div class="line"><a name="l00709"></a><span class="lineno"> 709</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> k_col_half = mask_w / 2;</div><div class="line"><a name="l00710"></a><span class="lineno"> 710</span> </div><div class="line"><a name="l00711"></a><span class="lineno"> 711</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> *mid_ptr = _input-><a class="code" href="classarm__compute_1_1_i_tensor.xhtml#ab988210662dbd3bf32fd563c7dd1bdbf">buffer</a>() + _input-><a class="code" href="classarm__compute_1_1_i_tensor.xhtml#a0e95dc1e53c361348314873b168ae237">info</a>()-><a class="code" href="classarm__compute_1_1_i_tensor_info.xhtml#a8a5312c9a822d27a3b38dc238c1c7de3">offset_element_in_bytes</a>(Coordinates(-k_col_half, 0));</div><div class="line"><a name="l00712"></a><span class="lineno"> 712</span> </div><div class="line"><a name="l00713"></a><span class="lineno"> 713</span>  <span class="comment">// Set row pointers</span></div><div class="line"><a name="l00714"></a><span class="lineno"> 714</span>  std::array<unsigned char *, mask_h> input_ptrs{ {} };</div><div class="line"><a name="l00715"></a><span class="lineno"> 715</span>  <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i = -k_row_half; i <= k_row_half; ++i)</div><div class="line"><a name="l00716"></a><span class="lineno"> 716</span>  {</div><div class="line"><a name="l00717"></a><span class="lineno"> 717</span>  input_ptrs[k_row_half + i] = _input-><a class="code" href="classarm__compute_1_1_i_tensor.xhtml#ab988210662dbd3bf32fd563c7dd1bdbf">buffer</a>() + _input-><a class="code" href="classarm__compute_1_1_i_tensor.xhtml#a0e95dc1e53c361348314873b168ae237">info</a>()-><a class="code" href="classarm__compute_1_1_i_tensor_info.xhtml#a8a5312c9a822d27a3b38dc238c1c7de3">offset_element_in_bytes</a>(Coordinates(0, i));</div><div class="line"><a name="l00718"></a><span class="lineno"> 718</span>  }</div><div class="line"><a name="l00719"></a><span class="lineno"> 719</span> </div><div class="line"><a name="l00720"></a><span class="lineno"> 720</span>  <a class="code" href="namespacearm__compute.xhtml#a5002bf7ec46d52971f9526e94172cfee">execute_window_loop</a>(win, [&](<span class="keyword">const</span> Coordinates &)</div><div class="line"><a name="l00721"></a><span class="lineno"> 721</span>  {</div><div class="line"><a name="l00722"></a><span class="lineno"> 722</span>  uint8x8_t rows_max = vld1_u8(input_ptrs[0] + input.offset());</div><div class="line"><a name="l00723"></a><span class="lineno"> 723</span> </div><div class="line"><a name="l00724"></a><span class="lineno"> 724</span>  <span class="comment">// Get max of rows</span></div><div class="line"><a name="l00725"></a><span class="lineno"> 725</span>  <span class="keywordflow">for</span>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> r = 1; r < mask_h; ++r)</div><div class="line"><a name="l00726"></a><span class="lineno"> 726</span>  {</div><div class="line"><a name="l00727"></a><span class="lineno"> 727</span>  <span class="keyword">const</span> uint8x8_t data = vld1_u8(input_ptrs[r] + input.offset());</div><div class="line"><a name="l00728"></a><span class="lineno"> 728</span>  rows_max = vmax_u8(rows_max, data);</div><div class="line"><a name="l00729"></a><span class="lineno"> 729</span>  }</div><div class="line"><a name="l00730"></a><span class="lineno"> 730</span> </div><div class="line"><a name="l00731"></a><span class="lineno"> 731</span>  <span class="comment">// Get max of middle row</span></div><div class="line"><a name="l00732"></a><span class="lineno"> 732</span>  <span class="keyword">const</span> uint8x16_t data = vld1q_u8(mid_ptr + input.offset());</div><div class="line"><a name="l00733"></a><span class="lineno"> 733</span>  uint8x8_t out = max_row<mask_w>(data);</div><div class="line"><a name="l00734"></a><span class="lineno"> 734</span> </div><div class="line"><a name="l00735"></a><span class="lineno"> 735</span>  <span class="comment">// Get final max</span></div><div class="line"><a name="l00736"></a><span class="lineno"> 736</span>  out = vmax_u8(out, rows_max);</div><div class="line"><a name="l00737"></a><span class="lineno"> 737</span> </div><div class="line"><a name="l00738"></a><span class="lineno"> 738</span>  <span class="comment">// Store result as U8</span></div><div class="line"><a name="l00739"></a><span class="lineno"> 739</span>  vst1_u8(output.ptr(), out);</div><div class="line"><a name="l00740"></a><span class="lineno"> 740</span>  },</div><div class="line"><a name="l00741"></a><span class="lineno"> 741</span>  input, output);</div><div class="line"><a name="l00742"></a><span class="lineno"> 742</span> }</div><div class="line"><a name="l00743"></a><span class="lineno"> 743</span> </div><div class="line"><a name="l00744"></a><span class="lineno"> 744</span> <span class="keyword">template</span> <></div><div class="line"><a name="l00745"></a><span class="lineno"> 745</span> <span class="keywordtype">void</span> NENonLinearFilterKernel::median_filter_disk<5, 5>(<span class="keyword">const</span> Window &win)</div><div class="line"><a name="l00746"></a><span class="lineno"> 746</span> {</div><div class="line"><a name="l00747"></a><span class="lineno"> 747</span>  Iterator input(_input, win);</div><div class="line"><a name="l00748"></a><span class="lineno"> 748</span>  Iterator output(_output, win);</div><div class="line"><a name="l00749"></a><span class="lineno"> 749</span> </div><div class="line"><a name="l00750"></a><span class="lineno"> 750</span>  <span class="keyword">static</span> <span class="keyword">const</span> uint8x16_t zero = vdupq_n_u8(0);</div><div class="line"><a name="l00751"></a><span class="lineno"> 751</span>  <span class="keyword">const</span> <span class="keyword">auto</span> input_top2_ptr = static_cast<const unsigned char *>(_input-><a class="code" href="classarm__compute_1_1_i_tensor.xhtml#adbd73147d41e8a640bc299d12613c31e">ptr_to_element</a>(Coordinates(-2, -2)));</div><div class="line"><a name="l00752"></a><span class="lineno"> 752</span>  <span class="keyword">const</span> <span class="keyword">auto</span> input_top_ptr = static_cast<const unsigned char *>(_input-><a class="code" href="classarm__compute_1_1_i_tensor.xhtml#adbd73147d41e8a640bc299d12613c31e">ptr_to_element</a>(Coordinates(-2, -1)));</div><div class="line"><a name="l00753"></a><span class="lineno"> 753</span>  <span class="keyword">const</span> <span class="keyword">auto</span> input_mid_ptr = static_cast<const unsigned char *>(_input-><a class="code" href="classarm__compute_1_1_i_tensor.xhtml#adbd73147d41e8a640bc299d12613c31e">ptr_to_element</a>(Coordinates(-2, 0)));</div><div class="line"><a name="l00754"></a><span class="lineno"> 754</span>  <span class="keyword">const</span> <span class="keyword">auto</span> input_bot_ptr = static_cast<const unsigned char *>(_input-><a class="code" href="classarm__compute_1_1_i_tensor.xhtml#adbd73147d41e8a640bc299d12613c31e">ptr_to_element</a>(Coordinates(-2, 1)));</div><div class="line"><a name="l00755"></a><span class="lineno"> 755</span>  <span class="keyword">const</span> <span class="keyword">auto</span> input_bot2_ptr = static_cast<const unsigned char *>(_input-><a class="code" href="classarm__compute_1_1_i_tensor.xhtml#adbd73147d41e8a640bc299d12613c31e">ptr_to_element</a>(Coordinates(-2, 2)));</div><div class="line"><a name="l00756"></a><span class="lineno"> 756</span> </div><div class="line"><a name="l00757"></a><span class="lineno"> 757</span>  <a class="code" href="namespacearm__compute.xhtml#a5002bf7ec46d52971f9526e94172cfee">execute_window_loop</a>(win, [&](<span class="keyword">const</span> Coordinates &)</div><div class="line"><a name="l00758"></a><span class="lineno"> 758</span>  {</div><div class="line"><a name="l00759"></a><span class="lineno"> 759</span>  <span class="keyword">const</span> uint8x16_t top2_data = vextq_u8(vld1q_u8(input_top2_ptr + input.offset()), zero, 1);</div><div class="line"><a name="l00760"></a><span class="lineno"> 760</span>  <span class="keyword">const</span> uint8x16_t top_data = vld1q_u8(input_top_ptr + input.offset());</div><div class="line"><a name="l00761"></a><span class="lineno"> 761</span>  <span class="keyword">const</span> uint8x16_t mid_data = vld1q_u8(input_mid_ptr + input.offset());</div><div class="line"><a name="l00762"></a><span class="lineno"> 762</span>  <span class="keyword">const</span> uint8x16_t bot_data = vld1q_u8(input_bot_ptr + input.offset());</div><div class="line"><a name="l00763"></a><span class="lineno"> 763</span>  <span class="keyword">const</span> uint8x16_t bot2_data = vextq_u8(vld1q_u8(input_bot2_ptr + input.offset()), zero, 1);</div><div class="line"><a name="l00764"></a><span class="lineno"> 764</span> </div><div class="line"><a name="l00765"></a><span class="lineno"> 765</span>  std::array<uint8x8_t, 10> d =</div><div class="line"><a name="l00766"></a><span class="lineno"> 766</span>  {</div><div class="line"><a name="l00767"></a><span class="lineno"> 767</span>  vget_low_u8(top2_data),</div><div class="line"><a name="l00768"></a><span class="lineno"> 768</span>  vget_high_u8(top2_data),</div><div class="line"><a name="l00769"></a><span class="lineno"> 769</span>  vget_low_u8(top_data),</div><div class="line"><a name="l00770"></a><span class="lineno"> 770</span>  vget_high_u8(top_data),</div><div class="line"><a name="l00771"></a><span class="lineno"> 771</span>  vget_low_u8(mid_data),</div><div class="line"><a name="l00772"></a><span class="lineno"> 772</span>  vget_high_u8(mid_data),</div><div class="line"><a name="l00773"></a><span class="lineno"> 773</span>  vget_low_u8(bot_data),</div><div class="line"><a name="l00774"></a><span class="lineno"> 774</span>  vget_high_u8(bot_data),</div><div class="line"><a name="l00775"></a><span class="lineno"> 775</span>  vget_low_u8(bot2_data),</div><div class="line"><a name="l00776"></a><span class="lineno"> 776</span>  vget_high_u8(bot2_data)</div><div class="line"><a name="l00777"></a><span class="lineno"> 777</span>  };</div><div class="line"><a name="l00778"></a><span class="lineno"> 778</span> </div><div class="line"><a name="l00779"></a><span class="lineno"> 779</span>  std::array<uint8x8_t, 21> p{ 0 };</div><div class="line"><a name="l00780"></a><span class="lineno"> 780</span>  p[0] = d[0];</div><div class="line"><a name="l00781"></a><span class="lineno"> 781</span>  p[1] = vext_u8(d[0], d[1], 1);</div><div class="line"><a name="l00782"></a><span class="lineno"> 782</span>  p[2] = vext_u8(d[0], d[1], 2);</div><div class="line"><a name="l00783"></a><span class="lineno"> 783</span>  p[18] = d[8];</div><div class="line"><a name="l00784"></a><span class="lineno"> 784</span>  p[19] = vext_u8(d[8], d[9], 1);</div><div class="line"><a name="l00785"></a><span class="lineno"> 785</span>  p[20] = vext_u8(d[8], d[9], 2);</div><div class="line"><a name="l00786"></a><span class="lineno"> 786</span> </div><div class="line"><a name="l00787"></a><span class="lineno"> 787</span>  <span class="keywordflow">for</span>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i = 0; i < 3; ++i)</div><div class="line"><a name="l00788"></a><span class="lineno"> 788</span>  {</div><div class="line"><a name="l00789"></a><span class="lineno"> 789</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> idx_d = 2 + i * 2;</div><div class="line"><a name="l00790"></a><span class="lineno"> 790</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> idx_p = 3 + i * 5;</div><div class="line"><a name="l00791"></a><span class="lineno"> 791</span> </div><div class="line"><a name="l00792"></a><span class="lineno"> 792</span>  p[idx_p] = d[idx_d];</div><div class="line"><a name="l00793"></a><span class="lineno"> 793</span>  p[idx_p + 1] = vext_u8(d[idx_d], d[idx_d + 1], 1);</div><div class="line"><a name="l00794"></a><span class="lineno"> 794</span>  p[idx_p + 2] = vext_u8(d[idx_d], d[idx_d + 1], 2);</div><div class="line"><a name="l00795"></a><span class="lineno"> 795</span>  p[idx_p + 3] = vext_u8(d[idx_d], d[idx_d + 1], 3);</div><div class="line"><a name="l00796"></a><span class="lineno"> 796</span>  p[idx_p + 4] = vext_u8(d[idx_d], d[idx_d + 1], 4);</div><div class="line"><a name="l00797"></a><span class="lineno"> 797</span>  }</div><div class="line"><a name="l00798"></a><span class="lineno"> 798</span> </div><div class="line"><a name="l00799"></a><span class="lineno"> 799</span>  sort21(p);</div><div class="line"><a name="l00800"></a><span class="lineno"> 800</span> </div><div class="line"><a name="l00801"></a><span class="lineno"> 801</span>  vst1_u8(output.ptr(), p[10]);</div><div class="line"><a name="l00802"></a><span class="lineno"> 802</span>  },</div><div class="line"><a name="l00803"></a><span class="lineno"> 803</span>  input, output);</div><div class="line"><a name="l00804"></a><span class="lineno"> 804</span> }</div><div class="line"><a name="l00805"></a><span class="lineno"> 805</span> </div><div class="line"><a name="l00806"></a><span class="lineno"> 806</span> <span class="keyword">template</span> <></div><div class="line"><a name="l00807"></a><span class="lineno"> 807</span> <span class="keywordtype">void</span> NENonLinearFilterKernel::min_filter_disk<5, 5>(<span class="keyword">const</span> Window &win)</div><div class="line"><a name="l00808"></a><span class="lineno"> 808</span> {</div><div class="line"><a name="l00809"></a><span class="lineno"> 809</span>  Iterator input(_input, win);</div><div class="line"><a name="l00810"></a><span class="lineno"> 810</span>  Iterator output(_output, win);</div><div class="line"><a name="l00811"></a><span class="lineno"> 811</span> </div><div class="line"><a name="l00812"></a><span class="lineno"> 812</span>  <span class="keyword">static</span> <span class="keyword">const</span> uint8x16_t zero = vdupq_n_u8(0);</div><div class="line"><a name="l00813"></a><span class="lineno"> 813</span>  <span class="keyword">const</span> <span class="keyword">auto</span> input_top2_ptr = static_cast<const unsigned char *>(_input-><a class="code" href="classarm__compute_1_1_i_tensor.xhtml#adbd73147d41e8a640bc299d12613c31e">ptr_to_element</a>(Coordinates(-2, -2)));</div><div class="line"><a name="l00814"></a><span class="lineno"> 814</span>  <span class="keyword">const</span> <span class="keyword">auto</span> input_top_ptr = static_cast<const unsigned char *>(_input-><a class="code" href="classarm__compute_1_1_i_tensor.xhtml#adbd73147d41e8a640bc299d12613c31e">ptr_to_element</a>(Coordinates(-2, -1)));</div><div class="line"><a name="l00815"></a><span class="lineno"> 815</span>  <span class="keyword">const</span> <span class="keyword">auto</span> input_mid_ptr = static_cast<const unsigned char *>(_input-><a class="code" href="classarm__compute_1_1_i_tensor.xhtml#adbd73147d41e8a640bc299d12613c31e">ptr_to_element</a>(Coordinates(-2, 0)));</div><div class="line"><a name="l00816"></a><span class="lineno"> 816</span>  <span class="keyword">const</span> <span class="keyword">auto</span> input_bot_ptr = static_cast<const unsigned char *>(_input-><a class="code" href="classarm__compute_1_1_i_tensor.xhtml#adbd73147d41e8a640bc299d12613c31e">ptr_to_element</a>(Coordinates(-2, 1)));</div><div class="line"><a name="l00817"></a><span class="lineno"> 817</span>  <span class="keyword">const</span> <span class="keyword">auto</span> input_bot2_ptr = static_cast<const unsigned char *>(_input-><a class="code" href="classarm__compute_1_1_i_tensor.xhtml#adbd73147d41e8a640bc299d12613c31e">ptr_to_element</a>(Coordinates(-2, 2)));</div><div class="line"><a name="l00818"></a><span class="lineno"> 818</span> </div><div class="line"><a name="l00819"></a><span class="lineno"> 819</span>  <a class="code" href="namespacearm__compute.xhtml#a5002bf7ec46d52971f9526e94172cfee">execute_window_loop</a>(win, [&](<span class="keyword">const</span> Coordinates &)</div><div class="line"><a name="l00820"></a><span class="lineno"> 820</span>  {</div><div class="line"><a name="l00821"></a><span class="lineno"> 821</span>  <span class="keyword">const</span> uint8x16_t top2_data = vextq_u8(vld1q_u8(input_top2_ptr + input.offset()), zero, 1);</div><div class="line"><a name="l00822"></a><span class="lineno"> 822</span>  <span class="keyword">const</span> uint8x16_t top_data = vld1q_u8(input_top_ptr + input.offset());</div><div class="line"><a name="l00823"></a><span class="lineno"> 823</span>  <span class="keyword">const</span> uint8x16_t mid_data = vld1q_u8(input_mid_ptr + input.offset());</div><div class="line"><a name="l00824"></a><span class="lineno"> 824</span>  <span class="keyword">const</span> uint8x16_t bot_data = vld1q_u8(input_bot_ptr + input.offset());</div><div class="line"><a name="l00825"></a><span class="lineno"> 825</span>  <span class="keyword">const</span> uint8x16_t bot2_data = vextq_u8(vld1q_u8(input_bot2_ptr + input.offset()), zero, 1);</div><div class="line"><a name="l00826"></a><span class="lineno"> 826</span> </div><div class="line"><a name="l00827"></a><span class="lineno"> 827</span>  <span class="keyword">const</span> uint8x16_t rows_min_3 = vminq_u8(top2_data, bot2_data);</div><div class="line"><a name="l00828"></a><span class="lineno"> 828</span>  uint8x16_t rows_min_5 = vminq_u8(top_data, bot_data);</div><div class="line"><a name="l00829"></a><span class="lineno"> 829</span>  rows_min_5 = vminq_u8(rows_min_5, mid_data);</div><div class="line"><a name="l00830"></a><span class="lineno"> 830</span> </div><div class="line"><a name="l00831"></a><span class="lineno"> 831</span>  <span class="keyword">const</span> uint8x8_t out_3 = min_row<3>(rows_min_3);</div><div class="line"><a name="l00832"></a><span class="lineno"> 832</span>  <span class="keyword">const</span> uint8x8_t out_5 = min_row<5>(rows_min_5);</div><div class="line"><a name="l00833"></a><span class="lineno"> 833</span> </div><div class="line"><a name="l00834"></a><span class="lineno"> 834</span>  vst1_u8(output.ptr(), vmin_u8(out_3, out_5));</div><div class="line"><a name="l00835"></a><span class="lineno"> 835</span>  },</div><div class="line"><a name="l00836"></a><span class="lineno"> 836</span>  input, output);</div><div class="line"><a name="l00837"></a><span class="lineno"> 837</span> }</div><div class="line"><a name="l00838"></a><span class="lineno"> 838</span> </div><div class="line"><a name="l00839"></a><span class="lineno"> 839</span> <span class="keyword">template</span> <></div><div class="line"><a name="l00840"></a><span class="lineno"> 840</span> <span class="keywordtype">void</span> NENonLinearFilterKernel::max_filter_disk<5, 5>(<span class="keyword">const</span> Window &win)</div><div class="line"><a name="l00841"></a><span class="lineno"> 841</span> {</div><div class="line"><a name="l00842"></a><span class="lineno"> 842</span>  Iterator input(_input, win);</div><div class="line"><a name="l00843"></a><span class="lineno"> 843</span>  Iterator output(_output, win);</div><div class="line"><a name="l00844"></a><span class="lineno"> 844</span> </div><div class="line"><a name="l00845"></a><span class="lineno"> 845</span>  <span class="keyword">static</span> <span class="keyword">const</span> uint8x16_t zero = vdupq_n_u8(0);</div><div class="line"><a name="l00846"></a><span class="lineno"> 846</span>  <span class="keyword">const</span> <span class="keyword">auto</span> input_top2_ptr = static_cast<const unsigned char *>(_input-><a class="code" href="classarm__compute_1_1_i_tensor.xhtml#adbd73147d41e8a640bc299d12613c31e">ptr_to_element</a>(Coordinates(-2, -2)));</div><div class="line"><a name="l00847"></a><span class="lineno"> 847</span>  <span class="keyword">const</span> <span class="keyword">auto</span> input_top_ptr = static_cast<const unsigned char *>(_input-><a class="code" href="classarm__compute_1_1_i_tensor.xhtml#adbd73147d41e8a640bc299d12613c31e">ptr_to_element</a>(Coordinates(-2, -1)));</div><div class="line"><a name="l00848"></a><span class="lineno"> 848</span>  <span class="keyword">const</span> <span class="keyword">auto</span> input_mid_ptr = static_cast<const unsigned char *>(_input-><a class="code" href="classarm__compute_1_1_i_tensor.xhtml#adbd73147d41e8a640bc299d12613c31e">ptr_to_element</a>(Coordinates(-2, 0)));</div><div class="line"><a name="l00849"></a><span class="lineno"> 849</span>  <span class="keyword">const</span> <span class="keyword">auto</span> input_bot_ptr = static_cast<const unsigned char *>(_input-><a class="code" href="classarm__compute_1_1_i_tensor.xhtml#adbd73147d41e8a640bc299d12613c31e">ptr_to_element</a>(Coordinates(-2, 1)));</div><div class="line"><a name="l00850"></a><span class="lineno"> 850</span>  <span class="keyword">const</span> <span class="keyword">auto</span> input_bot2_ptr = static_cast<const unsigned char *>(_input-><a class="code" href="classarm__compute_1_1_i_tensor.xhtml#adbd73147d41e8a640bc299d12613c31e">ptr_to_element</a>(Coordinates(-2, 2)));</div><div class="line"><a name="l00851"></a><span class="lineno"> 851</span> </div><div class="line"><a name="l00852"></a><span class="lineno"> 852</span>  <a class="code" href="namespacearm__compute.xhtml#a5002bf7ec46d52971f9526e94172cfee">execute_window_loop</a>(win, [&](<span class="keyword">const</span> Coordinates &)</div><div class="line"><a name="l00853"></a><span class="lineno"> 853</span>  {</div><div class="line"><a name="l00854"></a><span class="lineno"> 854</span>  <span class="keyword">const</span> uint8x16_t top2_data = vextq_u8(vld1q_u8(input_top2_ptr + input.offset()), zero, 1);</div><div class="line"><a name="l00855"></a><span class="lineno"> 855</span>  <span class="keyword">const</span> uint8x16_t top_data = vld1q_u8(input_top_ptr + input.offset());</div><div class="line"><a name="l00856"></a><span class="lineno"> 856</span>  <span class="keyword">const</span> uint8x16_t mid_data = vld1q_u8(input_mid_ptr + input.offset());</div><div class="line"><a name="l00857"></a><span class="lineno"> 857</span>  <span class="keyword">const</span> uint8x16_t bot_data = vld1q_u8(input_bot_ptr + input.offset());</div><div class="line"><a name="l00858"></a><span class="lineno"> 858</span>  <span class="keyword">const</span> uint8x16_t bot2_data = vextq_u8(vld1q_u8(input_bot2_ptr + input.offset()), zero, 1);</div><div class="line"><a name="l00859"></a><span class="lineno"> 859</span> </div><div class="line"><a name="l00860"></a><span class="lineno"> 860</span>  <span class="keyword">const</span> uint8x16_t rows_max_3 = vmaxq_u8(top2_data, bot2_data);</div><div class="line"><a name="l00861"></a><span class="lineno"> 861</span>  uint8x16_t rows_max_5 = vmaxq_u8(top_data, bot_data);</div><div class="line"><a name="l00862"></a><span class="lineno"> 862</span>  rows_max_5 = vmaxq_u8(rows_max_5, mid_data);</div><div class="line"><a name="l00863"></a><span class="lineno"> 863</span> </div><div class="line"><a name="l00864"></a><span class="lineno"> 864</span>  <span class="keyword">const</span> uint8x8_t out_3 = max_row<3>(rows_max_3);</div><div class="line"><a name="l00865"></a><span class="lineno"> 865</span>  <span class="keyword">const</span> uint8x8_t out_5 = max_row<5>(rows_max_5);</div><div class="line"><a name="l00866"></a><span class="lineno"> 866</span> </div><div class="line"><a name="l00867"></a><span class="lineno"> 867</span>  vst1_u8(output.ptr(), vmax_u8(out_3, out_5));</div><div class="line"><a name="l00868"></a><span class="lineno"> 868</span>  },</div><div class="line"><a name="l00869"></a><span class="lineno"> 869</span>  input, output);</div><div class="line"><a name="l00870"></a><span class="lineno"> 870</span> }</div><div class="line"><a name="l00871"></a><span class="lineno"> 871</span> </div><div class="line"><a name="l00872"></a><span class="lineno"> 872</span> <span class="keyword">template</span> <<span class="keywordtype">int</span> mask_w, <span class="keywordtype">int</span> mask_h></div><div class="line"><a name="l00873"></a><span class="lineno"> 873</span> <span class="keywordtype">void</span> NENonLinearFilterKernel::non_linear_filter_generic(<span class="keyword">const</span> Window &win)</div><div class="line"><a name="l00874"></a><span class="lineno"> 874</span> {</div><div class="line"><a name="l00875"></a><span class="lineno"> 875</span>  Iterator input(_input, win);</div><div class="line"><a name="l00876"></a><span class="lineno"> 876</span>  Iterator output(_output, win);</div><div class="line"><a name="l00877"></a><span class="lineno"> 877</span>  <a class="code" href="_error_8h.xhtml#a54a6080c9f4df1f908e57a9bbb46f5da">ARM_COMPUTE_ERROR_ON</a>(_input-><a class="code" href="classarm__compute_1_1_i_tensor.xhtml#ab988210662dbd3bf32fd563c7dd1bdbf">buffer</a>() == <span class="keyword">nullptr</span>);</div><div class="line"><a name="l00878"></a><span class="lineno"> 878</span> </div><div class="line"><a name="l00879"></a><span class="lineno"> 879</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> k_row_half = mask_h / 2;</div><div class="line"><a name="l00880"></a><span class="lineno"> 880</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> k_col_half = mask_w / 2;</div><div class="line"><a name="l00881"></a><span class="lineno"> 881</span>  constexpr <span class="keywordtype">int</span> mask_size = mask_w * mask_h;</div><div class="line"><a name="l00882"></a><span class="lineno"> 882</span> </div><div class="line"><a name="l00883"></a><span class="lineno"> 883</span>  <span class="comment">// Set row pointers</span></div><div class="line"><a name="l00884"></a><span class="lineno"> 884</span>  std::array<unsigned char *, mask_h> input_ptrs{ {} };</div><div class="line"><a name="l00885"></a><span class="lineno"> 885</span>  <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i = -k_row_half; i <= k_row_half; ++i)</div><div class="line"><a name="l00886"></a><span class="lineno"> 886</span>  {</div><div class="line"><a name="l00887"></a><span class="lineno"> 887</span>  input_ptrs[k_row_half + i] = _input-><a class="code" href="classarm__compute_1_1_i_tensor.xhtml#ab988210662dbd3bf32fd563c7dd1bdbf">buffer</a>() + _input-><a class="code" href="classarm__compute_1_1_i_tensor.xhtml#a0e95dc1e53c361348314873b168ae237">info</a>()-><a class="code" href="classarm__compute_1_1_i_tensor_info.xhtml#a8a5312c9a822d27a3b38dc238c1c7de3">offset_element_in_bytes</a>(Coordinates(-k_col_half, i));</div><div class="line"><a name="l00888"></a><span class="lineno"> 888</span>  }</div><div class="line"><a name="l00889"></a><span class="lineno"> 889</span> </div><div class="line"><a name="l00890"></a><span class="lineno"> 890</span>  std::array<uint8_t, mask_size> vals{ {} };</div><div class="line"><a name="l00891"></a><span class="lineno"> 891</span> </div><div class="line"><a name="l00892"></a><span class="lineno"> 892</span>  <a class="code" href="namespacearm__compute.xhtml#a5002bf7ec46d52971f9526e94172cfee">execute_window_loop</a>(win, [&](<span class="keyword">const</span> Coordinates &)</div><div class="line"><a name="l00893"></a><span class="lineno"> 893</span>  {</div><div class="line"><a name="l00894"></a><span class="lineno"> 894</span>  <span class="comment">// Clear array</span></div><div class="line"><a name="l00895"></a><span class="lineno"> 895</span>  <a class="code" href="namespacearm__compute_1_1test_1_1validation.xhtml#a1643f4cb252152ed8ffc0df84744ad5d">std::fill</a>(std::begin(vals), std::end(vals), 0);</div><div class="line"><a name="l00896"></a><span class="lineno"> 896</span> </div><div class="line"><a name="l00897"></a><span class="lineno"> 897</span>  <span class="keywordtype">size_t</span> v = 0;</div><div class="line"><a name="l00898"></a><span class="lineno"> 898</span>  <span class="keywordtype">size_t</span> m = 0;</div><div class="line"><a name="l00899"></a><span class="lineno"> 899</span> </div><div class="line"><a name="l00900"></a><span class="lineno"> 900</span>  <span class="keywordflow">for</span>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> r = 0; r < mask_h; ++r)</div><div class="line"><a name="l00901"></a><span class="lineno"> 901</span>  {</div><div class="line"><a name="l00902"></a><span class="lineno"> 902</span>  <span class="keyword">const</span> <span class="keyword">auto</span> in_ptr = static_cast<const uint8_t *>(input_ptrs[r] + input.offset());</div><div class="line"><a name="l00903"></a><span class="lineno"> 903</span> </div><div class="line"><a name="l00904"></a><span class="lineno"> 904</span>  <span class="keywordflow">for</span>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> c = 0; c < mask_w; ++c, ++m)</div><div class="line"><a name="l00905"></a><span class="lineno"> 905</span>  {</div><div class="line"><a name="l00906"></a><span class="lineno"> 906</span>  <span class="keywordflow">if</span>(_mask[m] == 255)</div><div class="line"><a name="l00907"></a><span class="lineno"> 907</span>  {</div><div class="line"><a name="l00908"></a><span class="lineno"> 908</span>  vals[v] = in_ptr[c];</div><div class="line"><a name="l00909"></a><span class="lineno"> 909</span>  ++v;</div><div class="line"><a name="l00910"></a><span class="lineno"> 910</span>  }</div><div class="line"><a name="l00911"></a><span class="lineno"> 911</span>  }</div><div class="line"><a name="l00912"></a><span class="lineno"> 912</span>  }</div><div class="line"><a name="l00913"></a><span class="lineno"> 913</span> </div><div class="line"><a name="l00914"></a><span class="lineno"> 914</span>  <span class="comment">// Only do something if there is at least one non-zero element in the</span></div><div class="line"><a name="l00915"></a><span class="lineno"> 915</span>  <span class="comment">// mask</span></div><div class="line"><a name="l00916"></a><span class="lineno"> 916</span>  <span class="keywordflow">if</span>(v > 0)</div><div class="line"><a name="l00917"></a><span class="lineno"> 917</span>  {</div><div class="line"><a name="l00918"></a><span class="lineno"> 918</span>  std::sort(vals.begin(), vals.begin() + v);</div><div class="line"><a name="l00919"></a><span class="lineno"> 919</span> </div><div class="line"><a name="l00920"></a><span class="lineno"> 920</span>  <span class="keywordflow">switch</span>(_function)</div><div class="line"><a name="l00921"></a><span class="lineno"> 921</span>  {</div><div class="line"><a name="l00922"></a><span class="lineno"> 922</span>  <span class="keywordflow">case</span> <a class="code" href="namespacearm__compute.xhtml#adf2ced65e536375a1c96425d9fced858ace31e2a082d17e038fcc6e3006166653">NonLinearFilterFunction::MIN</a>:</div><div class="line"><a name="l00923"></a><span class="lineno"> 923</span>  *output.ptr() = vals[0];</div><div class="line"><a name="l00924"></a><span class="lineno"> 924</span>  <span class="keywordflow">break</span>;</div><div class="line"><a name="l00925"></a><span class="lineno"> 925</span>  <span class="keywordflow">case</span> <a class="code" href="namespacearm__compute.xhtml#adf2ced65e536375a1c96425d9fced858a26a4b44a837bf97b972628509912b4a5">NonLinearFilterFunction::MAX</a>:</div><div class="line"><a name="l00926"></a><span class="lineno"> 926</span>  *output.ptr() = vals[v - 1];</div><div class="line"><a name="l00927"></a><span class="lineno"> 927</span>  <span class="keywordflow">break</span>;</div><div class="line"><a name="l00928"></a><span class="lineno"> 928</span>  <span class="keywordflow">case</span> <a class="code" href="namespacearm__compute.xhtml#adf2ced65e536375a1c96425d9fced858a8ab0c3a037e882577dec378985477074">NonLinearFilterFunction::MEDIAN</a>:</div><div class="line"><a name="l00929"></a><span class="lineno"> 929</span>  *output.ptr() = vals[v / 2];</div><div class="line"><a name="l00930"></a><span class="lineno"> 930</span>  <span class="keywordflow">break</span>;</div><div class="line"><a name="l00931"></a><span class="lineno"> 931</span>  <span class="keywordflow">default</span>:</div><div class="line"><a name="l00932"></a><span class="lineno"> 932</span>  <span class="keywordflow">break</span>;</div><div class="line"><a name="l00933"></a><span class="lineno"> 933</span>  }</div><div class="line"><a name="l00934"></a><span class="lineno"> 934</span>  }</div><div class="line"><a name="l00935"></a><span class="lineno"> 935</span>  },</div><div class="line"><a name="l00936"></a><span class="lineno"> 936</span>  input, output);</div><div class="line"><a name="l00937"></a><span class="lineno"> 937</span> }</div><div class="line"><a name="l00938"></a><span class="lineno"> 938</span> </div><div class="line"><a name="l00939"></a><span class="lineno"><a class="line" href="classarm__compute_1_1_n_e_non_linear_filter_kernel.xhtml#a112b35dd205c62ea6ed1447ef226da82"> 939</a></span> <span class="keywordtype">void</span> <a class="code" href="classarm__compute_1_1_n_e_non_linear_filter_kernel.xhtml#a112b35dd205c62ea6ed1447ef226da82">NENonLinearFilterKernel::run</a>(<span class="keyword">const</span> <a class="code" href="classarm__compute_1_1_window.xhtml">Window</a> &window, <span class="keyword">const</span> <a class="code" href="structarm__compute_1_1_thread_info.xhtml">ThreadInfo</a> &<a class="code" href="namespacearm__compute_1_1test_1_1validation.xhtml#a4f4125dba5283887b34f889b1c615c0c">info</a>)</div><div class="line"><a name="l00940"></a><span class="lineno"> 940</span> {</div><div class="line"><a name="l00941"></a><span class="lineno"> 941</span>  <a class="code" href="_error_8h.xhtml#a6dc630a6ae9cc063b3924bcea8dee9d6">ARM_COMPUTE_UNUSED</a>(<a class="code" href="namespacearm__compute_1_1test_1_1validation.xhtml#a4f4125dba5283887b34f889b1c615c0c">info</a>);</div><div class="line"><a name="l00942"></a><span class="lineno"> 942</span>  <a class="code" href="_validate_8h.xhtml#a1b35b0d258183cf9ef36adf684d0b88c">ARM_COMPUTE_ERROR_ON_UNCONFIGURED_KERNEL</a>(<span class="keyword">this</span>);</div><div class="line"><a name="l00943"></a><span class="lineno"> 943</span>  <a class="code" href="_validate_8h.xhtml#a6eb9ce82815fe429250189da7592ba75">ARM_COMPUTE_ERROR_ON_INVALID_SUBWINDOW</a>(<a class="code" href="classarm__compute_1_1_i_kernel.xhtml#ad34a46f53686c12a5c5e717cc9617fb6">INEKernel::window</a>(), <a class="code" href="classarm__compute_1_1_i_kernel.xhtml#ad34a46f53686c12a5c5e717cc9617fb6">window</a>);</div><div class="line"><a name="l00944"></a><span class="lineno"> 944</span> </div><div class="line"><a name="l00945"></a><span class="lineno"> 945</span>  <span class="keyword">using</span> <a class="code" href="namespacearm__compute.xhtml#adf2ced65e536375a1c96425d9fced858">NonLinearFilterFunction</a> = void (<a class="code" href="classarm__compute_1_1_n_e_non_linear_filter_kernel.xhtml">NENonLinearFilterKernel</a>::*)(<span class="keyword">const</span> <a class="code" href="classarm__compute_1_1_window.xhtml">Window</a> & <a class="code" href="classarm__compute_1_1_i_kernel.xhtml#ad34a46f53686c12a5c5e717cc9617fb6">window</a>);</div><div class="line"><a name="l00946"></a><span class="lineno"> 946</span> </div><div class="line"><a name="l00947"></a><span class="lineno"> 947</span>  <span class="comment">// Function table for BOX pattern</span></div><div class="line"><a name="l00948"></a><span class="lineno"> 948</span>  <span class="keyword">static</span> <span class="keyword">const</span> std::array<NonLinearFilterFunction, 6> func_table_box =</div><div class="line"><a name="l00949"></a><span class="lineno"> 949</span>  {</div><div class="line"><a name="l00950"></a><span class="lineno"> 950</span>  {</div><div class="line"><a name="l00951"></a><span class="lineno"> 951</span>  &NENonLinearFilterKernel::median_filter_box<3, 3>,</div><div class="line"><a name="l00952"></a><span class="lineno"> 952</span>  &NENonLinearFilterKernel::min_filter_box<3, 3>,</div><div class="line"><a name="l00953"></a><span class="lineno"> 953</span>  &NENonLinearFilterKernel::max_filter_box<3, 3>,</div><div class="line"><a name="l00954"></a><span class="lineno"> 954</span>  &NENonLinearFilterKernel::median_filter_box<5, 5>,</div><div class="line"><a name="l00955"></a><span class="lineno"> 955</span>  &NENonLinearFilterKernel::min_filter_box<5, 5>,</div><div class="line"><a name="l00956"></a><span class="lineno"> 956</span>  &NENonLinearFilterKernel::max_filter_box<5, 5>,</div><div class="line"><a name="l00957"></a><span class="lineno"> 957</span>  }</div><div class="line"><a name="l00958"></a><span class="lineno"> 958</span>  };</div><div class="line"><a name="l00959"></a><span class="lineno"> 959</span> </div><div class="line"><a name="l00960"></a><span class="lineno"> 960</span>  <span class="comment">// Function table for CROSS pattern</span></div><div class="line"><a name="l00961"></a><span class="lineno"> 961</span>  <span class="keyword">static</span> <span class="keyword">const</span> std::array<NonLinearFilterFunction, 6> func_table_cross =</div><div class="line"><a name="l00962"></a><span class="lineno"> 962</span>  {</div><div class="line"><a name="l00963"></a><span class="lineno"> 963</span>  {</div><div class="line"><a name="l00964"></a><span class="lineno"> 964</span>  &NENonLinearFilterKernel::median_filter_cross<3, 3>,</div><div class="line"><a name="l00965"></a><span class="lineno"> 965</span>  &NENonLinearFilterKernel::min_filter_cross<3, 3>,</div><div class="line"><a name="l00966"></a><span class="lineno"> 966</span>  &NENonLinearFilterKernel::max_filter_cross<3, 3>,</div><div class="line"><a name="l00967"></a><span class="lineno"> 967</span>  &NENonLinearFilterKernel::median_filter_cross<5, 5>,</div><div class="line"><a name="l00968"></a><span class="lineno"> 968</span>  &NENonLinearFilterKernel::min_filter_cross<5, 5>,</div><div class="line"><a name="l00969"></a><span class="lineno"> 969</span>  &NENonLinearFilterKernel::max_filter_cross<5, 5>,</div><div class="line"><a name="l00970"></a><span class="lineno"> 970</span>  }</div><div class="line"><a name="l00971"></a><span class="lineno"> 971</span>  };</div><div class="line"><a name="l00972"></a><span class="lineno"> 972</span> </div><div class="line"><a name="l00973"></a><span class="lineno"> 973</span>  <span class="comment">// Function table for DISK pattern</span></div><div class="line"><a name="l00974"></a><span class="lineno"> 974</span>  <span class="keyword">static</span> <span class="keyword">const</span> std::array<NonLinearFilterFunction, 6> func_table_disk =</div><div class="line"><a name="l00975"></a><span class="lineno"> 975</span>  {</div><div class="line"><a name="l00976"></a><span class="lineno"> 976</span>  {</div><div class="line"><a name="l00977"></a><span class="lineno"> 977</span>  &NENonLinearFilterKernel::median_filter_box<3, 3>,</div><div class="line"><a name="l00978"></a><span class="lineno"> 978</span>  &NENonLinearFilterKernel::min_filter_box<3, 3>,</div><div class="line"><a name="l00979"></a><span class="lineno"> 979</span>  &NENonLinearFilterKernel::max_filter_box<3, 3>,</div><div class="line"><a name="l00980"></a><span class="lineno"> 980</span>  &NENonLinearFilterKernel::median_filter_disk<5, 5>,</div><div class="line"><a name="l00981"></a><span class="lineno"> 981</span>  &NENonLinearFilterKernel::min_filter_disk<5, 5>,</div><div class="line"><a name="l00982"></a><span class="lineno"> 982</span>  &NENonLinearFilterKernel::max_filter_disk<5, 5>,</div><div class="line"><a name="l00983"></a><span class="lineno"> 983</span>  }</div><div class="line"><a name="l00984"></a><span class="lineno"> 984</span>  };</div><div class="line"><a name="l00985"></a><span class="lineno"> 985</span> </div><div class="line"><a name="l00986"></a><span class="lineno"> 986</span>  <span class="comment">// Function table for OTHER pattern</span></div><div class="line"><a name="l00987"></a><span class="lineno"> 987</span>  <span class="keyword">static</span> <span class="keyword">const</span> std::array<NonLinearFilterFunction, 2> func_table_generic =</div><div class="line"><a name="l00988"></a><span class="lineno"> 988</span>  {</div><div class="line"><a name="l00989"></a><span class="lineno"> 989</span>  {</div><div class="line"><a name="l00990"></a><span class="lineno"> 990</span>  &NENonLinearFilterKernel::non_linear_filter_generic<3, 3>,</div><div class="line"><a name="l00991"></a><span class="lineno"> 991</span>  &NENonLinearFilterKernel::non_linear_filter_generic<5, 5>,</div><div class="line"><a name="l00992"></a><span class="lineno"> 992</span>  }</div><div class="line"><a name="l00993"></a><span class="lineno"> 993</span>  };</div><div class="line"><a name="l00994"></a><span class="lineno"> 994</span> </div><div class="line"><a name="l00995"></a><span class="lineno"> 995</span>  <span class="keywordflow">switch</span>(_pattern)</div><div class="line"><a name="l00996"></a><span class="lineno"> 996</span>  {</div><div class="line"><a name="l00997"></a><span class="lineno"> 997</span>  <span class="keywordflow">case</span> <a class="code" href="namespacearm__compute.xhtml#afdda916edc7502967bbec17ea3c06c02ae657cce1913c857166b0475f18668ef5">MatrixPattern::BOX</a>:</div><div class="line"><a name="l00998"></a><span class="lineno"> 998</span>  <a class="code" href="_error_8h.xhtml#a54a6080c9f4df1f908e57a9bbb46f5da">ARM_COMPUTE_ERROR_ON</a>(_func_idx >= func_table_box.size());</div><div class="line"><a name="l00999"></a><span class="lineno"> 999</span>  (this->*func_table_box[_func_idx])(<a class="code" href="classarm__compute_1_1_i_kernel.xhtml#ad34a46f53686c12a5c5e717cc9617fb6">window</a>);</div><div class="line"><a name="l01000"></a><span class="lineno"> 1000</span>  <span class="keywordflow">break</span>;</div><div class="line"><a name="l01001"></a><span class="lineno"> 1001</span>  <span class="keywordflow">case</span> <a class="code" href="namespacearm__compute.xhtml#afdda916edc7502967bbec17ea3c06c02a04dd53a8e6c2306e9bbf944c1d6047f2">MatrixPattern::CROSS</a>:</div><div class="line"><a name="l01002"></a><span class="lineno"> 1002</span>  <a class="code" href="_error_8h.xhtml#a54a6080c9f4df1f908e57a9bbb46f5da">ARM_COMPUTE_ERROR_ON</a>(_func_idx >= func_table_cross.size());</div><div class="line"><a name="l01003"></a><span class="lineno"> 1003</span>  (this->*func_table_cross[_func_idx])(<a class="code" href="classarm__compute_1_1_i_kernel.xhtml#ad34a46f53686c12a5c5e717cc9617fb6">window</a>);</div><div class="line"><a name="l01004"></a><span class="lineno"> 1004</span>  <span class="keywordflow">break</span>;</div><div class="line"><a name="l01005"></a><span class="lineno"> 1005</span>  <span class="keywordflow">case</span> <a class="code" href="namespacearm__compute.xhtml#afdda916edc7502967bbec17ea3c06c02a290d4b81f4e2b47d86fd1b0170e9aab7">MatrixPattern::DISK</a>:</div><div class="line"><a name="l01006"></a><span class="lineno"> 1006</span>  <a class="code" href="_error_8h.xhtml#a54a6080c9f4df1f908e57a9bbb46f5da">ARM_COMPUTE_ERROR_ON</a>(_func_idx >= func_table_disk.size());</div><div class="line"><a name="l01007"></a><span class="lineno"> 1007</span>  (this->*func_table_disk[_func_idx])(<a class="code" href="classarm__compute_1_1_i_kernel.xhtml#ad34a46f53686c12a5c5e717cc9617fb6">window</a>);</div><div class="line"><a name="l01008"></a><span class="lineno"> 1008</span>  <span class="keywordflow">break</span>;</div><div class="line"><a name="l01009"></a><span class="lineno"> 1009</span>  <span class="keywordflow">case</span> <a class="code" href="namespacearm__compute.xhtml#afdda916edc7502967bbec17ea3c06c02a03570470bad94692ce93e32700d2e1cb">MatrixPattern::OTHER</a>:</div><div class="line"><a name="l01010"></a><span class="lineno"> 1010</span>  <span class="keywordflow">default</span>:</div><div class="line"><a name="l01011"></a><span class="lineno"> 1011</span>  <a class="code" href="_error_8h.xhtml#a54a6080c9f4df1f908e57a9bbb46f5da">ARM_COMPUTE_ERROR_ON</a>(_func_idx >= func_table_generic.size());</div><div class="line"><a name="l01012"></a><span class="lineno"> 1012</span>  (this->*func_table_generic[_func_idx])(<a class="code" href="classarm__compute_1_1_i_kernel.xhtml#ad34a46f53686c12a5c5e717cc9617fb6">window</a>);</div><div class="line"><a name="l01013"></a><span class="lineno"> 1013</span>  <span class="keywordflow">break</span>;</div><div class="line"><a name="l01014"></a><span class="lineno"> 1014</span>  }</div><div class="line"><a name="l01015"></a><span class="lineno"> 1015</span> }</div><div class="line"><a name="l01016"></a><span class="lineno"> 1016</span> } <span class="comment">// namespace arm_compute</span></div><div class="ttc" id="structarm__compute_1_1_border_size_xhtml_a3fdd42ea34070a54e696b3adc28c4be3"><div class="ttname"><a href="structarm__compute_1_1_border_size.xhtml#a3fdd42ea34070a54e696b3adc28c4be3">arm_compute::BorderSize::top</a></div><div class="ttdeci">unsigned int top</div><div class="ttdoc">top of the border</div><div class="ttdef"><b>Definition:</b> <a href="arm__compute_2core_2_types_8h_source.xhtml#l00339">Types.h:339</a></div></div> |