/github/workspace/src/MatrixFunctions/mat_add/kernels/plp_mat_add_i8s_rv32im.c
Functions
Name | |
---|---|
void | plp_mat_add_i8s_rv32im(const int8_t restrict pSrcA, const int8_t restrict pSrcB, uint32_t M, uint32_t N, int8_t *restrict pDst) matrix addition of 8-bit integer matrices kernel for RV32IM extension. |
Functions Documentation
function plp_mat_add_i8s_rv32im
void plp_mat_add_i8s_rv32im(
const int8_t *__restrict__ pSrcA,
const int8_t *__restrict__ pSrcB,
uint32_t M,
uint32_t N,
int8_t *__restrict__ pDst
)
matrix addition of 8-bit integer matrices kernel for RV32IM extension.
Parameters:
- pSrcA Points to the first input matrix
- pSrcB Points to the second input matrix
- M Height of all matrices
- N Width of all matrices
- pDst Points to the output matrix
Return: none
matrix addition of a 8-bit integer matrices for RV32IM extension.
Source code
/* =====================================================================
* Project: PULP DSP Library
* Title: plp_mat_add_i8s_rv32im.c
* Description: 8-bit matrix addition kernel for RV32IM
*
* $Date: 1. July 2020
* $Revision: V0
*
* Target Processor: PULP cores
* ===================================================================== */
/*
* Copyright (C) 2020 ETH Zurich and University of Bologna.
*
* Author: Tibor Schneider, ETH Zurich
*
* SPDX-License-Identifier: Apache-2.0
*
* Licensed under the Apache License, Version 2.0 (the License); you may
* not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an AS IS BASIS, WITHOUT
* WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#include "plp_math.h"
void plp_mat_add_i8s_rv32im(const int8_t *__restrict__ pSrcA,
const int8_t *__restrict__ pSrcB,
uint32_t M,
uint32_t N,
int8_t *__restrict__ pDst) {
uint32_t i; // loop counters
uint32_t total = M*N; // we can see it as a 1D operation
#if defined(PLP_MATH_LOOPUNROLL)
// loop over the matrix - the shift by one is for the loop unrolling
for (i = 0; i < total>>1; i++) {
pDst[2*i] = pSrcA[2*i] + pSrcB[2*i];
pDst[2*i+1] = pSrcA[2*i+1] + pSrcB[2*i+1];
}
// to save the branch we just always compute the possibly remaining element
pDst[total - 1] = pSrcA[total - 1] + pSrcB[total - 1];
#else // No PLP_MATH_LOOPUNROLL
for (i = 0; i < total; i++) {
pDst[i] = pSrcA[i] + pSrcB[i];
}
#endif // PLP_MATH_LOOPUNROLL
}
Updated on 2023-03-01 at 16:16:32 +0000