1cabdff1aSopenharmony_ci/*
2cabdff1aSopenharmony_ci * Various fixed-point math operations
3cabdff1aSopenharmony_ci *
4cabdff1aSopenharmony_ci * Copyright (c) 2008 Vladimir Voroshilov
5cabdff1aSopenharmony_ci *
6cabdff1aSopenharmony_ci * This file is part of FFmpeg.
7cabdff1aSopenharmony_ci *
8cabdff1aSopenharmony_ci * FFmpeg is free software; you can redistribute it and/or
9cabdff1aSopenharmony_ci * modify it under the terms of the GNU Lesser General Public
10cabdff1aSopenharmony_ci * License as published by the Free Software Foundation; either
11cabdff1aSopenharmony_ci * version 2.1 of the License, or (at your option) any later version.
12cabdff1aSopenharmony_ci *
13cabdff1aSopenharmony_ci * FFmpeg is distributed in the hope that it will be useful,
14cabdff1aSopenharmony_ci * but WITHOUT ANY WARRANTY; without even the implied warranty of
15cabdff1aSopenharmony_ci * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
16cabdff1aSopenharmony_ci * Lesser General Public License for more details.
17cabdff1aSopenharmony_ci *
18cabdff1aSopenharmony_ci * You should have received a copy of the GNU Lesser General Public
19cabdff1aSopenharmony_ci * License along with FFmpeg; if not, write to the Free Software
20cabdff1aSopenharmony_ci * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
21cabdff1aSopenharmony_ci */
22cabdff1aSopenharmony_ci
23cabdff1aSopenharmony_ci#include <stdint.h>
24cabdff1aSopenharmony_ci
25cabdff1aSopenharmony_ci#include "config.h"
26cabdff1aSopenharmony_ci#include "libavutil/avassert.h"
27cabdff1aSopenharmony_ci#include "libavutil/intmath.h"
28cabdff1aSopenharmony_ci#include "mathops.h"
29cabdff1aSopenharmony_ci#include "celp_math.h"
30cabdff1aSopenharmony_ci
31cabdff1aSopenharmony_ci#ifdef G729_BITEXACT
32cabdff1aSopenharmony_cistatic const uint16_t exp2a[]=
33cabdff1aSopenharmony_ci{
34cabdff1aSopenharmony_ci     0,  1435,  2901,  4400,  5931,  7496,  9096, 10730,
35cabdff1aSopenharmony_ci 12400, 14106, 15850, 17632, 19454, 21315, 23216, 25160,
36cabdff1aSopenharmony_ci 27146, 29175, 31249, 33368, 35534, 37747, 40009, 42320,
37cabdff1aSopenharmony_ci 44682, 47095, 49562, 52082, 54657, 57289, 59979, 62727,
38cabdff1aSopenharmony_ci};
39cabdff1aSopenharmony_ci
40cabdff1aSopenharmony_cistatic const uint16_t exp2b[]=
41cabdff1aSopenharmony_ci{
42cabdff1aSopenharmony_ci     3,   712,  1424,  2134,  2845,  3557,  4270,  4982,
43cabdff1aSopenharmony_ci  5696,  6409,  7124,  7839,  8554,  9270,  9986, 10704,
44cabdff1aSopenharmony_ci 11421, 12138, 12857, 13576, 14295, 15014, 15734, 16455,
45cabdff1aSopenharmony_ci 17176, 17898, 18620, 19343, 20066, 20790, 21514, 22238,
46cabdff1aSopenharmony_ci};
47cabdff1aSopenharmony_ci
48cabdff1aSopenharmony_ciint ff_exp2(uint16_t power)
49cabdff1aSopenharmony_ci{
50cabdff1aSopenharmony_ci    unsigned int result= exp2a[power>>10] + 0x10000;
51cabdff1aSopenharmony_ci
52cabdff1aSopenharmony_ci    av_assert2(power <= 0x7fff);
53cabdff1aSopenharmony_ci
54cabdff1aSopenharmony_ci    result= (result<<3) + ((result*exp2b[(power>>5)&31])>>17);
55cabdff1aSopenharmony_ci    return result + ((result*(power&31)*89)>>22);
56cabdff1aSopenharmony_ci}
57cabdff1aSopenharmony_ci#endif
58cabdff1aSopenharmony_ci
59cabdff1aSopenharmony_ci/**
60cabdff1aSopenharmony_ci * Table used to compute log2(x)
61cabdff1aSopenharmony_ci *
62cabdff1aSopenharmony_ci * tab_log2[i] = (1<<15) * log2(1 + i/32), i=0..32
63cabdff1aSopenharmony_ci */
64cabdff1aSopenharmony_cistatic const uint16_t tab_log2[33] =
65cabdff1aSopenharmony_ci{
66cabdff1aSopenharmony_ci#ifdef G729_BITEXACT
67cabdff1aSopenharmony_ci      0,   1455,   2866,   4236,   5568,   6863,   8124,   9352,
68cabdff1aSopenharmony_ci  10549,  11716,  12855,  13967,  15054,  16117,  17156,  18172,
69cabdff1aSopenharmony_ci  19167,  20142,  21097,  22033,  22951,  23852,  24735,  25603,
70cabdff1aSopenharmony_ci  26455,  27291,  28113,  28922,  29716,  30497,  31266,  32023,  32767,
71cabdff1aSopenharmony_ci#else
72cabdff1aSopenharmony_ci      4,   1459,   2870,   4240,   5572,   6867,   8127,   9355,
73cabdff1aSopenharmony_ci  10552,  11719,  12858,  13971,  15057,  16120,  17158,  18175,
74cabdff1aSopenharmony_ci  19170,  20145,  21100,  22036,  22954,  23854,  24738,  25605,
75cabdff1aSopenharmony_ci  26457,  27294,  28116,  28924,  29719,  30500,  31269,  32025,  32769,
76cabdff1aSopenharmony_ci#endif
77cabdff1aSopenharmony_ci};
78cabdff1aSopenharmony_ci
79cabdff1aSopenharmony_ciint ff_log2_q15(uint32_t value)
80cabdff1aSopenharmony_ci{
81cabdff1aSopenharmony_ci    uint8_t  power_int;
82cabdff1aSopenharmony_ci    uint8_t  frac_x0;
83cabdff1aSopenharmony_ci    uint16_t frac_dx;
84cabdff1aSopenharmony_ci
85cabdff1aSopenharmony_ci    // Stripping zeros from beginning
86cabdff1aSopenharmony_ci    power_int = av_log2(value);
87cabdff1aSopenharmony_ci    value <<= (31 - power_int);
88cabdff1aSopenharmony_ci
89cabdff1aSopenharmony_ci    // b31 is always non-zero now
90cabdff1aSopenharmony_ci    frac_x0 = (value & 0x7c000000) >> 26; // b26-b31 and [32..63] -> [0..31]
91cabdff1aSopenharmony_ci    frac_dx = (value & 0x03fff800) >> 11;
92cabdff1aSopenharmony_ci
93cabdff1aSopenharmony_ci    value = tab_log2[frac_x0];
94cabdff1aSopenharmony_ci    value += (frac_dx * (tab_log2[frac_x0+1] - tab_log2[frac_x0])) >> 15;
95cabdff1aSopenharmony_ci
96cabdff1aSopenharmony_ci    return (power_int << 15) + value;
97cabdff1aSopenharmony_ci}
98cabdff1aSopenharmony_ci
99cabdff1aSopenharmony_ciint64_t ff_dot_product(const int16_t *a, const int16_t *b, int length)
100cabdff1aSopenharmony_ci{
101cabdff1aSopenharmony_ci    int i;
102cabdff1aSopenharmony_ci    int64_t sum = 0;
103cabdff1aSopenharmony_ci
104cabdff1aSopenharmony_ci    for (i = 0; i < length; i++)
105cabdff1aSopenharmony_ci        sum += MUL16(a[i], b[i]);
106cabdff1aSopenharmony_ci
107cabdff1aSopenharmony_ci    return sum;
108cabdff1aSopenharmony_ci}
109cabdff1aSopenharmony_ci
110cabdff1aSopenharmony_cifloat ff_dot_productf(const float* a, const float* b, int length)
111cabdff1aSopenharmony_ci{
112cabdff1aSopenharmony_ci    float sum = 0;
113cabdff1aSopenharmony_ci    int i;
114cabdff1aSopenharmony_ci
115cabdff1aSopenharmony_ci    for(i=0; i<length; i++)
116cabdff1aSopenharmony_ci        sum += a[i] * b[i];
117cabdff1aSopenharmony_ci
118cabdff1aSopenharmony_ci    return sum;
119cabdff1aSopenharmony_ci}
120cabdff1aSopenharmony_ci
121cabdff1aSopenharmony_civoid ff_celp_math_init(CELPMContext *c)
122cabdff1aSopenharmony_ci{
123cabdff1aSopenharmony_ci    c->dot_productf   = ff_dot_productf;
124cabdff1aSopenharmony_ci
125cabdff1aSopenharmony_ci#if HAVE_MIPSFPU
126cabdff1aSopenharmony_ci    ff_celp_math_init_mips(c);
127cabdff1aSopenharmony_ci#endif
128cabdff1aSopenharmony_ci}
129