/github/workspace/src/MatrixFunctions/mat_mult/kernels/plp_mat_mult_i8s_xpulpv2.c
Functions
| Name | |
|---|---|
| void | plp_mat_mult_i8s_xpulpv2(const int8_t restrict pSrcA, const int8_t restrict pSrcB, uint32_t M, uint32_t N, uint32_t O, int32_t *restrict pDstC) Matrix matrix multiplication of a 8-bit integer matrices for XPULPV2 extension. |
Attributes
| Name | |
|---|---|
| HAL_CL_L1 v4s | mask0 Matrix multiplication of 8-bit integer matrices kernel for XPULPV2 extension. |
| HAL_CL_L1 v4s | mask1 |
| HAL_CL_L1 v4s | mask2 |
| HAL_CL_L1 v4s | mask3 |
Functions Documentation
function plp_mat_mult_i8s_xpulpv2
void plp_mat_mult_i8s_xpulpv2(
const int8_t *__restrict__ pSrcA,
const int8_t *__restrict__ pSrcB,
uint32_t M,
uint32_t N,
uint32_t O,
int32_t *__restrict__ pDstC
)
Matrix matrix multiplication of a 8-bit integer matrices for XPULPV2 extension.
Parameters:
- pSrcA points to first the input matrix
- pSrcB points to second the input matrix
- M Height of first matrix
- N Width of first and heigt of second matrix
- O Width of second matrix
- pDstC Output is written here
Return: none
Par: Exploiting SIMD instructions
The 8 bit values are packed four each into 32 bit vectors and then the four dot products are performed on 32 bit vectors, with 32 bit accumulator.
Attributes Documentation
variable mask0
static HAL_CL_L1 v4s mask0 = { 0, 1, 4, 5 };
Matrix multiplication of 8-bit integer matrices kernel for XPULPV2 extension.
Parameters:
- pSrcA points to the first input matrix
- pSrcB points to the second input matrix
- M height of the first input matrix
- N width of the first input matrix and hight of the second
- O width of the second input matrix
- pDstC points to the output matrix
Return: none
variable mask1
static HAL_CL_L1 v4s mask1 = { 2, 3, 6, 7 };
variable mask2
static HAL_CL_L1 v4s mask2 = { 0, 2, 4, 6 };
variable mask3
static HAL_CL_L1 v4s mask3 = { 1, 3, 5, 7 };
Source code
/* =====================================================================
* Project: PULP DSP Library
* Title: plp_mat_mult_i8s_xpulpv2.c
* Description: 8-bit integer matrix multiplication for XPULPV2
*
* $Date: 18. July 2019
* $Revision: V0
*
* Target Processor: PULP cores
* ===================================================================== */
/*
* Copyright (C) 2019 ETH Zurich and University of Bologna.
*
* Author: Tom Kuchler, 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"
// define BASIC_VERSION // if used don't forget to also use the undefine at end of file
#ifdef BASIC_VERSION
void plp_mat_mult_i8s_xpulpv2(const int8_t *__restrict__ pSrcA,
const int8_t *__restrict__ pSrcB,
uint32_t M,
uint32_t N,
uint32_t O,
int32_t *__restrict__ pDstC) {
uint32_t i; // loop counter
uint32_t j; // loop counter
uint32_t k; // loop counter
for (i = 0; i < M; i++) {
for (k = 0; k < O; k++) {
int32_t sum = 0;
for (j = 0; j < N; j++) {
sum = sum + pSrcA[i * N + j] * pSrcB[j * O + k];
}
pDstC[i * O + k] = sum;
}
}
}
#else
HAL_CL_L1 static v4s mask0 = { 0, 1, 4, 5 };
HAL_CL_L1 static v4s mask1 = { 2, 3, 6, 7 };
HAL_CL_L1 static v4s mask2 = { 0, 2, 4, 6 };
HAL_CL_L1 static v4s mask3 = { 1, 3, 5, 7 };
void plp_mat_mult_i8s_xpulpv2(const int8_t *__restrict__ pSrcA,
const int8_t *__restrict__ pSrcB,
uint32_t M,
uint32_t N,
uint32_t O,
int32_t *__restrict__ pDstC) {
uint32_t i = 0; // loop counter for M
uint32_t j = 0; // loop counter for N
uint32_t k = 0; // loop counter for O
for (i = 0; i < M / 2; i++) {
for (k = 0; k < O / 4; k++) {
int32_t sum00 = 0;
int32_t sum01 = 0;
int32_t sum02 = 0;
int32_t sum03 = 0;
int32_t sum10 = 0;
int32_t sum11 = 0;
int32_t sum12 = 0;
int32_t sum13 = 0;
// v2s* Bpoint = (v2s*) &(pSrcB[k]);
for (j = 0; j < N / 4; j++) {
v4s aVec0 = *((v4s *)&(pSrcA[(i * 2) * N + (j * 4)]));
v4s aVec1 = *((v4s *)&(pSrcA[(i * 2 + 1) * N + (j * 4)]));
v4s temp0 = *((v4s *)&(pSrcB[(j * 4) * O + (k * 4)]));
v4s temp1 = *((v4s *)&(pSrcB[(j * 4 + 1) * O + (k * 4)]));
v4s temp2 = *((v4s *)&(pSrcB[(j * 4 + 2) * O + (k * 4)]));
v4s temp3 = *((v4s *)&(pSrcB[(j * 4 + 3) * O + (k * 4)]));
v4s temp4 = __builtin_shuffle(temp0, temp1, mask0); // 0,1,4,5
v4s temp5 = __builtin_shuffle(temp2, temp3, mask0); // 8,9,12,13
v4s temp6 = __builtin_shuffle(temp0, temp1, mask1); // 2,3,6,7
v4s temp7 = __builtin_shuffle(temp2, temp3, mask1); // 3,7,11,15
v4s bVec0 = __builtin_shuffle(temp4, temp5, mask2); // 0,4,8,12
v4s bVec1 = __builtin_shuffle(temp4, temp5, mask3); // 1,5,9,13
v4s bVec2 = __builtin_shuffle(temp6, temp7, mask2); // 2,6,10,14
v4s bVec3 = __builtin_shuffle(temp6, temp7, mask3); // 3,7,11,15
sum00 = __SUMDOTP4(aVec0, bVec0, sum00);
sum01 = __SUMDOTP4(aVec0, bVec1, sum01);
sum02 = __SUMDOTP4(aVec0, bVec2, sum02);
sum03 = __SUMDOTP4(aVec0, bVec3, sum03);
sum10 = __SUMDOTP4(aVec1, bVec0, sum10);
sum11 = __SUMDOTP4(aVec1, bVec1, sum11);
sum12 = __SUMDOTP4(aVec1, bVec2, sum12);
sum13 = __SUMDOTP4(aVec1, bVec3, sum13);
}
pDstC[(i * 2) * O + (k * 4)] = sum00;
pDstC[(i * 2) * O + (k * 4 + 1)] = sum01;
pDstC[(i * 2) * O + (k * 4 + 2)] = sum02;
pDstC[(i * 2) * O + (k * 4 + 3)] = sum03;
pDstC[(i * 2 + 1) * O + (k * 4)] = sum10;
pDstC[(i * 2 + 1) * O + (k * 4 + 1)] = sum11;
pDstC[(i * 2 + 1) * O + (k * 4 + 2)] = sum12;
pDstC[(i * 2 + 1) * O + (k * 4 + 3)] = sum13;
}
}
// clean up code
i = i * 2;
j = j * 4;
k = k * 4;
// check if every index is nicely finished
if (i == M && j == N && k == O) {
} else {
uint32_t iEnd = i;
uint32_t jEnd = j;
uint32_t kEnd = k;
// clean up for j
if (jEnd != N) {
for (i = 0; i < iEnd; i++) {
for (k = 0; k < kEnd; k++) {
int32_t sum = 0;
for (j = jEnd; j < N; j++) {
sum = sum + pSrcA[i * N + j] * pSrcB[j * O + k];
}
pDstC[i * O + k] += sum;
}
}
}
// clean up for k
if (kEnd != O) {
for (i = 0; i < iEnd; i++) {
for (k = kEnd; k < O; k++) {
int32_t sum = 0;
for (j = 0; j < N; j++) {
sum = sum + pSrcA[i * N + j] * pSrcB[j * O + k];
}
pDstC[i * O + k] = sum;
}
}
}
// clean up for i
for (i = iEnd; i < M; i++) {
for (k = 0; k < O; k++) {
int32_t sum = 0;
for (j = 0; j < N; j++) {
sum = sum + pSrcA[i * N + j] * pSrcB[j * O + k];
}
pDstC[i * O + k] = sum;
}
}
}
}
#endif
// undefine BASIC_VERSION
Updated on 2023-03-01 at 16:16:33 +0000