mirror of
https://github.com/UberGames/lilium-voyager.git
synced 2024-12-15 14:40:53 +00:00
113 lines
4 KiB
C
113 lines
4 KiB
C
|
/* Copyright (C) 2005 Analog Devices */
|
||
|
|
/**
|
||
|
|
@author Jean-Marc Valin
|
||
|
|
@file cb_search_bfin.h
|
||
|
|
@brief Fixed codebook functions (Blackfin version)
|
||
|
|
*/
|
||
|
|
/*
|
||
|
|
Redistribution and use in source and binary forms, with or without
|
||
|
|
modification, are permitted provided that the following conditions
|
||
|
|
are met:
|
||
|
|
|
||
|
|
- Redistributions of source code must retain the above copyright
|
||
|
|
notice, this list of conditions and the following disclaimer.
|
||
|
|
|
||
|
|
- Redistributions in binary form must reproduce the above copyright
|
||
|
|
notice, this list of conditions and the following disclaimer in the
|
||
|
|
documentation and/or other materials provided with the distribution.
|
||
|
|
|
||
|
|
- Neither the name of the Xiph.org Foundation nor the names of its
|
||
|
|
contributors may be used to endorse or promote products derived from
|
||
|
|
this software without specific prior written permission.
|
||
|
|
|
||
|
|
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
||
|
|
``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
||
|
|
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
||
|
|
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR
|
||
|
|
CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
|
||
|
|
EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
|
||
|
|
PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
|
||
|
|
PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
|
||
|
|
LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
|
||
|
|
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
|
||
|
|
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||
|
|
*/
|
||
|
|
|
||
|
|
#define OVERRIDE_COMPUTE_WEIGHTED_CODEBOOK
|
||
|
|
void compute_weighted_codebook(const signed char *shape_cb, const spx_word16_t *r, spx_word16_t *resp, spx_word16_t *resp2, spx_word32_t *E, int shape_cb_size, int subvect_size, char *stack)
|
||
|
|
{
|
||
|
|
int i;
|
||
|
|
for (i=0;i<shape_cb_size;i++)
|
||
|
|
{
|
||
|
|
__asm__ __volatile__ (
|
||
|
|
"P0 = %0;\n\t"
|
||
|
|
"LC0 = P0;\n\t"
|
||
|
|
"P1 = %1;\n\t"
|
||
|
|
"P2 = %2;\n\t"
|
||
|
|
"P3 = %3;\n\t"
|
||
|
|
"P0 = 1;\n\t"
|
||
|
|
"L0 = 0;\n\t"
|
||
|
|
"L1 = 0;\n\t"
|
||
|
|
"R2 = 0;\n\t"
|
||
|
|
"A1 = 0;\n\t"
|
||
|
|
"LOOP outter%= LC0;\n\t"
|
||
|
|
"LOOP_BEGIN outter%=;\n\t"
|
||
|
|
"A0 = 0;\n\t"
|
||
|
|
"P4 = P1;\n\t"
|
||
|
|
"I1 = P2;\n\t"
|
||
|
|
"R0 = B[P4++] (X) || R1.L = W[I1--];\n\t"
|
||
|
|
"LOOP inner%= LC1 = P0;\n\t"
|
||
|
|
"LOOP_BEGIN inner%=;\n\t"
|
||
|
|
"A0 += R0.L*R1.L (IS) || R0 = B[P4++] (X) || R1.L = W[I1--];\n\t"
|
||
|
|
"LOOP_END inner%=;\n\t"
|
||
|
|
"R0 = A0;\n\t"
|
||
|
|
"R0 >>>= 13;\n\t"
|
||
|
|
"A1 += R0.L*R0.L (IS);\n\t"
|
||
|
|
"W[P3++] = R0;\n\t"
|
||
|
|
"P0 += 1;\n\t"
|
||
|
|
"P2 += 2;\n\t"
|
||
|
|
"LOOP_END outter%=;\n\t"
|
||
|
|
"P4 = %4;\n\t"
|
||
|
|
"R1 = A1;\n\t"
|
||
|
|
"[P4] = R1;\n\t"
|
||
|
|
:
|
||
|
|
: "m" (subvect_size), "m" (shape_cb), "m" (r), "m" (resp), "m" (E)
|
||
|
|
: "A0", "P0", "P1", "P2", "P3", "P4", "R0", "R1", "R2", "I0", "I1", "L0",
|
||
|
|
"L1", "A0", "A1", "memory"
|
||
|
|
#if !(__GNUC__ == 3)
|
||
|
|
, "LC0", "LC1" /* gcc 3.4 doesn't know about LC registers */
|
||
|
|
#endif
|
||
|
|
);
|
||
|
|
shape_cb += subvect_size;
|
||
|
|
resp += subvect_size;
|
||
|
|
E++;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
#define OVERRIDE_TARGET_UPDATE
|
||
|
|
static inline void target_update(spx_word16_t *t, spx_word16_t g, spx_word16_t *r, int len)
|
||
|
|
{
|
||
|
|
if (!len)
|
||
|
|
return;
|
||
|
|
__asm__ __volatile__
|
||
|
|
(
|
||
|
|
"I0 = %0;\n\t"
|
||
|
|
"I1 = %1;\n\t"
|
||
|
|
"L0 = 0;\n\t"
|
||
|
|
"L1 = 0;\n\t"
|
||
|
|
"R2 = 4096;\n\t"
|
||
|
|
"LOOP tupdate%= LC0 = %3;\n\t"
|
||
|
|
"LOOP_BEGIN tupdate%=;\n\t"
|
||
|
|
"R0.L = W[I0] || R1.L = W[I1++];\n\t"
|
||
|
|
"R1 = (A1 = R1.L*%2.L) (IS);\n\t"
|
||
|
|
"R1 = R1 + R2;\n\t"
|
||
|
|
"R1 >>>= 13;\n\t"
|
||
|
|
"R0.L = R0.L - R1.L;\n\t"
|
||
|
|
"W[I0++] = R0.L;\n\t"
|
||
|
|
"LOOP_END tupdate%=;\n\t"
|
||
|
|
:
|
||
|
|
: "a" (t), "a" (r), "d" (g), "a" (len)
|
||
|
|
: "R0", "R1", "R2", "A1", "I0", "I1", "L0", "L1"
|
||
|
|
);
|
||
|
|
}
|