| /* |
| * Copyright (c) 2017-2018 ARM Limited. |
| * |
| * SPDX-License-Identifier: MIT |
| * |
| * Permission is hereby granted, free of charge, to any person obtaining a copy |
| * of this software and associated documentation files (the "Software"), to |
| * deal in the Software without restriction, including without limitation the |
| * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or |
| * sell copies of the Software, and to permit persons to whom the Software is |
| * furnished to do so, subject to the following conditions: |
| * |
| * The above copyright notice and this permission notice shall be included in all |
| * copies or substantial portions of the Software. |
| * |
| * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR |
| * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, |
| * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE |
| * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER |
| * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, |
| * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE |
| * SOFTWARE. |
| */ |
| |
| /* As some of the merges need these headers, but are all included in the |
| * arm_gemm namespace, put these headers here. */ |
| #include <algorithm> |
| |
| #include <arm_neon.h> |
| |
| #include "arm_gemm.hpp" |
| #include "asmlib.hpp" |
| #include "utils.hpp" |
| |
| namespace arm_gemm { |
| |
| template<unsigned int twidth, unsigned int height, bool sve=false, typename Tin, typename Tout> |
| void MergeResults(Tout * out, const Tin * in, int ldc, int y0, int ymax, int x0, int xmax, const Tout *bias, Activation act, bool append) { |
| // For SVE cases, multiply the width up by the vector length. |
| // Use the *input* type to determine this, since this will be what the kernel operated on. |
| const int width = twidth * (sve ? get_vector_length<Tin>() : 1); |
| |
| const int full_y_blocks = (ymax - y0) / height; |
| const int y_remainder = (ymax - y0) % height; |
| const int y_blocks = full_y_blocks + (y_remainder ? 1 : 0); |
| |
| const int full_x_blocks = (xmax - x0) / width; |
| const int x_remainder = (xmax - x0) % width; |
| const int x_blocks = full_x_blocks + (x_remainder ? 1 : 0); |
| |
| for (int y_block = 0; y_block < y_blocks; y_block++) { |
| int ybase = y0 + (y_block * height); |
| |
| int fill_rows = (y_block < full_y_blocks) ? height : y_remainder; |
| |
| for (int x_block = 0; x_block < x_blocks; x_block++) { |
| int xbase = x0 + (x_block * width); |
| |
| int fill_cols = (x_block < full_x_blocks) ? width : x_remainder; |
| |
| for (int row=0; row < fill_rows; row++) { |
| for (int col=0; col < fill_cols; col++) { |
| Tout &r = out[(ybase + row) * ldc + xbase + col]; |
| Tout v = in[row * width + col]; |
| |
| if (append) { |
| v += r; |
| } |
| |
| if (bias) { |
| v += bias[xbase + col]; |
| } |
| |
| switch(act.type) { |
| default: |
| case Activation::Type::None: |
| break; |
| |
| case Activation::Type::ReLU: |
| v = std::max(v, static_cast<Tout>(0)); |
| break; |
| |
| case Activation::Type::BoundedReLU: |
| v = std::max(std::min(v, static_cast<Tout>(act.param1)), static_cast<Tout>(0)); |
| break; |
| } |
| |
| r = v; |
| } |
| } |
| |
| in += (width * height); |
| } |
| } |
| } |
| |
| #include "merges/list.hpp" |
| |
| #if defined(__aarch64__) && defined(__ARM_FP16_ARGS) |
| template void MergeResults<12u, 8u, false, float, __fp16>(__fp16*, float const*, int, int, int, int, int, __fp16 const*, Activation, bool); |
| #endif |
| |
| #if defined(__arm__) && defined(__ARM_FP16_ARGS) |
| template void MergeResults<8u, 6u, false, float, __fp16>(__fp16*, float const*, int, int, int, int, int, __fp16 const*, Activation, bool); |
| #endif |
| |
| } // namespace arm_gemm |