Moritz Pflanzer | beabe3b | 2017-08-31 14:56:32 +0100 | [diff] [blame] | 1 | /* |
Georgios Pinitas | 7cd26d4 | 2019-01-09 18:35:17 +0000 | [diff] [blame] | 2 | * Copyright (c) 2017-2019 ARM Limited. |
Moritz Pflanzer | beabe3b | 2017-08-31 14:56:32 +0100 | [diff] [blame] | 3 | * |
| 4 | * SPDX-License-Identifier: MIT |
| 5 | * |
| 6 | * Permission is hereby granted, free of charge, to any person obtaining a copy |
| 7 | * of this software and associated documentation files (the "Software"), to |
| 8 | * deal in the Software without restriction, including without limitation the |
| 9 | * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or |
| 10 | * sell copies of the Software, and to permit persons to whom the Software is |
| 11 | * furnished to do so, subject to the following conditions: |
| 12 | * |
| 13 | * The above copyright notice and this permission notice shall be included in all |
| 14 | * copies or substantial portions of the Software. |
| 15 | * |
| 16 | * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR |
| 17 | * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, |
| 18 | * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE |
| 19 | * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER |
| 20 | * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, |
| 21 | * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE |
| 22 | * SOFTWARE. |
| 23 | */ |
| 24 | #pragma once |
| 25 | |
| 26 | /* |
| 27 | * Generic transform. |
| 28 | * |
| 29 | * Assuming the untransposed case, this works by first reading <BlockBy> |
| 30 | * consecutive values from the first input row. This same number of values |
| 31 | * are then read from the next <IntBy-1> rows. Now return to the first |
| 32 | * input row and repeat. |
| 33 | * |
| 34 | * Need to cope with the work requested in either dimension not actually |
| 35 | * being a multiple of the block sizes. |
| 36 | */ |
David Mansell | d93991e | 2018-07-06 14:52:52 +0100 | [diff] [blame] | 37 | template <unsigned int tIntBy, unsigned int BlockBy, bool Transposed, size_t TOutSize, size_t TInSize, bool sve> |
Anthony Barbier | 5f70773 | 2018-07-03 16:22:02 +0100 | [diff] [blame] | 38 | struct TransformImpl { |
Moritz Pflanzer | beabe3b | 2017-08-31 14:56:32 +0100 | [diff] [blame] | 39 | template <typename TOut, typename TIn> |
Anthony Barbier | 5f70773 | 2018-07-03 16:22:02 +0100 | [diff] [blame] | 40 | static void Transform(TOut* out, const TIn* const in, const int stride, |
| 41 | const int y0, const int ymax, const int x0, const int xmax) { |
David Mansell | d93991e | 2018-07-06 14:52:52 +0100 | [diff] [blame] | 42 | // For SVE cases we multiply the interleave factor by the vector length. |
Georgios Pinitas | 421405b | 2018-10-26 19:05:32 +0100 | [diff] [blame] | 43 | const unsigned int IntBy = tIntBy * (sve ? get_vector_length<TOut>() / BlockBy : 1); |
David Mansell | d93991e | 2018-07-06 14:52:52 +0100 | [diff] [blame] | 44 | |
Moritz Pflanzer | beabe3b | 2017-08-31 14:56:32 +0100 | [diff] [blame] | 45 | const int n_whole_y_blocks = (ymax - y0) / IntBy; |
Anthony Barbier | 5f70773 | 2018-07-03 16:22:02 +0100 | [diff] [blame] | 46 | const int y_remainders = (ymax - y0) % IntBy; |
| 47 | const int n_y_blocks = n_whole_y_blocks + (y_remainders ? 1 : 0); |
Moritz Pflanzer | beabe3b | 2017-08-31 14:56:32 +0100 | [diff] [blame] | 48 | |
| 49 | const int n_whole_x_blocks = (xmax - x0) / BlockBy; |
Anthony Barbier | 5f70773 | 2018-07-03 16:22:02 +0100 | [diff] [blame] | 50 | const int x_remainders = (xmax - x0) % BlockBy; |
| 51 | const int n_x_blocks = n_whole_x_blocks + (x_remainders ? 1 : 0); |
Moritz Pflanzer | beabe3b | 2017-08-31 14:56:32 +0100 | [diff] [blame] | 52 | |
| 53 | // "Y" loop: advance down the rows of the source IntBy rows at a time. |
| 54 | // Set up fill_rows to show the number rows to copy from, and blank_rows |
| 55 | // for the number of blank rows to add. |
Anthony Barbier | 5f70773 | 2018-07-03 16:22:02 +0100 | [diff] [blame] | 56 | for (int y_block=0 ; y_block < n_y_blocks; y_block++) { |
| 57 | int fill_rows = (y_block < n_whole_y_blocks) ? IntBy : y_remainders; |
Moritz Pflanzer | beabe3b | 2017-08-31 14:56:32 +0100 | [diff] [blame] | 58 | int blank_rows = IntBy - fill_rows; |
| 59 | |
| 60 | int y_base = y0 + (y_block * IntBy); |
| 61 | |
| 62 | // So now advance along this block of rows, BlockBy columns at a time. |
Anthony Barbier | 5f70773 | 2018-07-03 16:22:02 +0100 | [diff] [blame] | 63 | for (int x_block=0 ; x_block < n_x_blocks; x_block++) { |
| 64 | int fill_cols = (x_block < n_whole_x_blocks) ? BlockBy : x_remainders; |
Moritz Pflanzer | beabe3b | 2017-08-31 14:56:32 +0100 | [diff] [blame] | 65 | int blank_cols = BlockBy - fill_cols; |
| 66 | |
| 67 | int x_base = x0 + (x_block * BlockBy); |
| 68 | |
Anthony Barbier | 5f70773 | 2018-07-03 16:22:02 +0100 | [diff] [blame] | 69 | for (int row = 0; row < fill_rows; row++) { |
| 70 | for (int col = 0; col < fill_cols; col++) { |
Moritz Pflanzer | beabe3b | 2017-08-31 14:56:32 +0100 | [diff] [blame] | 71 | // In-range copy. If it's transposed, we reverse the sense of rows and columns here. |
Anthony Barbier | 5f70773 | 2018-07-03 16:22:02 +0100 | [diff] [blame] | 72 | if (Transposed) { |
Moritz Pflanzer | beabe3b | 2017-08-31 14:56:32 +0100 | [diff] [blame] | 73 | *out++ = static_cast<TOut>(in[(x_base + col) * stride + y_base + row]); |
Anthony Barbier | 5f70773 | 2018-07-03 16:22:02 +0100 | [diff] [blame] | 74 | } else { |
Moritz Pflanzer | beabe3b | 2017-08-31 14:56:32 +0100 | [diff] [blame] | 75 | *out++ = static_cast<TOut>(in[(y_base + row) * stride + x_base + col]); |
| 76 | } |
| 77 | } |
| 78 | // "col" tail - row is in range but column is out of range. |
Anthony Barbier | 5f70773 | 2018-07-03 16:22:02 +0100 | [diff] [blame] | 79 | for (int col=0; col < blank_cols; col++) { |
Moritz Pflanzer | beabe3b | 2017-08-31 14:56:32 +0100 | [diff] [blame] | 80 | *out++ = static_cast<TOut>(0); |
| 81 | } |
| 82 | } |
| 83 | // "row" tail - row is out of range so fill with zeros always. |
Georgios Pinitas | 7cd26d4 | 2019-01-09 18:35:17 +0000 | [diff] [blame] | 84 | TOut zeroval = static_cast<TOut>(0); |
| 85 | int pads = blank_rows * (fill_cols + blank_cols); |
| 86 | |
| 87 | for (int i=0; i<pads; i++) { |
| 88 | out[i] = zeroval; |
Moritz Pflanzer | beabe3b | 2017-08-31 14:56:32 +0100 | [diff] [blame] | 89 | } |
Georgios Pinitas | 7cd26d4 | 2019-01-09 18:35:17 +0000 | [diff] [blame] | 90 | |
| 91 | out += pads; |
Moritz Pflanzer | beabe3b | 2017-08-31 14:56:32 +0100 | [diff] [blame] | 92 | } |
| 93 | } |
| 94 | } |
| 95 | |
| 96 | template <typename T> |
Anthony Barbier | 5f70773 | 2018-07-03 16:22:02 +0100 | [diff] [blame] | 97 | static inline void Transform(T* out, const T* const in, const int stride, |
| 98 | const int k0, const int kmax, const int x0, const int xmax) { |
Moritz Pflanzer | beabe3b | 2017-08-31 14:56:32 +0100 | [diff] [blame] | 99 | Transform<T, T>(out, in, stride, k0, kmax, x0, xmax); |
| 100 | } |
| 101 | }; |
| 102 | |
| 103 | /*****************************************************************************/ |
David Mansell | d93991e | 2018-07-06 14:52:52 +0100 | [diff] [blame] | 104 | template <unsigned int IntBy, unsigned int BlockBy, bool Transposed, bool sve=false, typename TOut, typename TIn> |
Moritz Pflanzer | beabe3b | 2017-08-31 14:56:32 +0100 | [diff] [blame] | 105 | void Transform( |
Anthony Barbier | 5f70773 | 2018-07-03 16:22:02 +0100 | [diff] [blame] | 106 | TOut* out, const TIn* const in, const int stride, |
| 107 | const int k0, const int kmax, const int x0, const int xmax |
| 108 | ) { |
| 109 | // Redirect to a specialised implementation predicated on argument size. |
David Mansell | d93991e | 2018-07-06 14:52:52 +0100 | [diff] [blame] | 110 | TransformImpl<IntBy, BlockBy, Transposed, sizeof(TOut), sizeof(TIn), sve>::Transform( |
Anthony Barbier | 5f70773 | 2018-07-03 16:22:02 +0100 | [diff] [blame] | 111 | out, in, stride, k0, kmax, x0, xmax |
| 112 | ); |
Moritz Pflanzer | beabe3b | 2017-08-31 14:56:32 +0100 | [diff] [blame] | 113 | } |
| 114 | /*****************************************************************************/ |
| 115 | |
| 116 | #include "transforms/list.hpp" |