/github/workspace/src/BasicMathFunctions/dot_prod/kernels/plp_dot_prod_q32p_xpulpv2.c

Functions

	Name
void	plp_dot_prod_q32p_xpulpv2(void * S) Parallel dot product with interleaved access of 32-bit fixed point vectors kernel for XPULPV2 extension.

Functions Documentation

function plp_dot_prod_q32p_xpulpv2

void plp_dot_prod_q32p_xpulpv2(
    void * S
)

Parallel dot product with interleaved access of 32-bit fixed point vectors kernel for XPULPV2 extension.

Parameters:

• S points to the instance structure for fixed point parallel dot product

Return: none

Source code

/* =====================================================================
 * Project:      PULP DSP Library
 * Title:        plp_dot_prod_q32p_xpulpv2.c
 * Description:  32-bit fixed point scalar dot product for XPULPV2 with interleaved access
 *
 * $Date:        04. Jun 2019
 * $Revision:    V0
 *
 * Target Processor: PULP cores
 * ===================================================================== */
/*
 * Copyright (C) 2019 ETH Zurich and University of Bologna.
 *
 * Author: Xiaying Wang, 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.
 *
 * Notice: project inspired by ARM CMSIS DSP and parts of source code
 * ported and adopted for RISC-V PULP platform from ARM CMSIS DSP
 * released under Copyright (C) 2010-2019 ARM Limited or its affiliates
 * with Apache-2.0.
 */

#include "plp_math.h"

void plp_dot_prod_q32p_xpulpv2(void *S) {

    int core_id = hal_core_id();

    plp_dot_prod_instance_q32 *args = (plp_dot_prod_instance_q32 *)S;

    int32_t *pSrcA = (int32_t *)(args->pSrcA);
    int32_t *pSrcB = (int32_t *)(args->pSrcB);
    uint32_t blkSizePE = args->blkSizePE;
    uint32_t deciPoint = args->deciPoint;
    uint32_t nPE = args->nPE;
    int32_t *resBufferPE = &(args->resBuffer[core_id]);

    // *NOTICE* here, we can do something better for performance, by splitting it more evenly.
    // If (blkSizePe / nPE) is odd, then each core will process (blkSizePe / nPE) - 1 elements.
    // This is due to verification reasons: FOr the non-parallel case, we always sum up two
    // temporary values, and then execute __ROUNDNORM_REG. To mimik this behavior, every core
    // (except the last one) will process an even number of elements. This way, the last core will
    // have to do more work, but the result of this function will identical to the result of the
    // singlecore implementation.
    // set the default block size
    uint32_t blkSize = (blkSizePE / nPE) & 0xFFFFFFFE; // the and makes sure the block size is even

    // set pSrcA and pSrcB to the correct location
    pSrcA += core_id * blkSize;
    pSrcB += core_id * blkSize;

    // set the block size for the last core
    if (core_id == nPE - 1) {
        blkSize = blkSizePE - (nPE - 1) * blkSize;
    }

    if (blkSize == 0) {
        *resBufferPE = 0;
        return;
    }

    int32_t i, sum = 0;

#if defined(PLP_MATH_LOOPUNROLL)

    for (i = 0; i < blkSize - 1; i += 2) {
        int32_t x0 = pSrcA[i] * pSrcB[i];
        int32_t x1 = pSrcA[i + 1] * pSrcB[i + 1];
        sum += __ADDROUNDNORM_REG(x0, x1, deciPoint);
    }

    if (i != blkSize) {
        sum += __ROUNDNORM_REG(pSrcA[i] * pSrcB[i], deciPoint);
    }

#else // PLP_MATH_LOOPUNROLL

    for (i = 0; i < blkSize; i++) {
        sum += __ROUNDNORM_REG(pSrcA[i] * pSrcB[i], deciPoint);
    }

#endif // PLP_MATH_LOOPUNROLL

    *resBufferPE = sum;
}

---

Updated on 2023-03-01 at 16:16:32 +0000