1 /* Copyright (C) 2003 Jean-Marc Valin */ |
|
2 /** |
|
3 @file fixed_generic.h |
|
4 @brief Generic fixed-point operations |
|
5 */ |
|
6 /* |
|
7 Redistribution and use in source and binary forms, with or without |
|
8 modification, are permitted provided that the following conditions |
|
9 are met: |
|
10 |
|
11 - Redistributions of source code must retain the above copyright |
|
12 notice, this list of conditions and the following disclaimer. |
|
13 |
|
14 - Redistributions in binary form must reproduce the above copyright |
|
15 notice, this list of conditions and the following disclaimer in the |
|
16 documentation and/or other materials provided with the distribution. |
|
17 |
|
18 - Neither the name of the Xiph.org Foundation nor the names of its |
|
19 contributors may be used to endorse or promote products derived from |
|
20 this software without specific prior written permission. |
|
21 |
|
22 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
|
23 ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
|
24 LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
|
25 A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR |
|
26 CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, |
|
27 EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, |
|
28 PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR |
|
29 PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF |
|
30 LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING |
|
31 NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS |
|
32 SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
|
33 */ |
|
34 |
|
35 #ifndef FIXED_GENERIC_H |
|
36 #define FIXED_GENERIC_H |
|
37 |
|
38 #define QCONST16(x,bits) ((spx_word16_t)(.5+(x)*(((spx_word32_t)1)<<(bits)))) |
|
39 #define QCONST32(x,bits) ((spx_word32_t)(.5+(x)*(((spx_word32_t)1)<<(bits)))) |
|
40 |
|
41 #define NEG16(x) (-(x)) |
|
42 #define NEG32(x) (-(x)) |
|
43 #define EXTRACT16(x) ((spx_word16_t)(x)) |
|
44 #define EXTEND32(x) ((spx_word32_t)(x)) |
|
45 #define SHR16(a,shift) ((a) >> (shift)) |
|
46 #define SHL16(a,shift) ((a) << (shift)) |
|
47 #define SHR32(a,shift) ((a) >> (shift)) |
|
48 #define SHL32(a,shift) ((a) << (shift)) |
|
49 #define PSHR16(a,shift) (SHR16((a)+((1<<((shift))>>1)),shift)) |
|
50 #define PSHR32(a,shift) (SHR32((a)+((EXTEND32(1)<<((shift))>>1)),shift)) |
|
51 #define VSHR32(a, shift) (((shift)>0) ? SHR32(a, shift) : SHL32(a, -(shift))) |
|
52 #define SATURATE16(x,a) (((x)>(a) ? (a) : (x)<-(a) ? -(a) : (x))) |
|
53 #define SATURATE32(x,a) (((x)>(a) ? (a) : (x)<-(a) ? -(a) : (x))) |
|
54 |
|
55 #define SHR(a,shift) ((a) >> (shift)) |
|
56 #define SHL(a,shift) ((spx_word32_t)(a) << (shift)) |
|
57 #define PSHR(a,shift) (SHR((a)+((EXTEND32(1)<<((shift))>>1)),shift)) |
|
58 #define SATURATE(x,a) (((x)>(a) ? (a) : (x)<-(a) ? -(a) : (x))) |
|
59 |
|
60 |
|
61 #define ADD16(a,b) ((spx_word16_t)((spx_word16_t)(a)+(spx_word16_t)(b))) |
|
62 #define SUB16(a,b) ((spx_word16_t)(a)-(spx_word16_t)(b)) |
|
63 #define ADD32(a,b) ((spx_word32_t)(a)+(spx_word32_t)(b)) |
|
64 #define SUB32(a,b) ((spx_word32_t)(a)-(spx_word32_t)(b)) |
|
65 |
|
66 |
|
67 /* result fits in 16 bits */ |
|
68 #define MULT16_16_16(a,b) ((((spx_word16_t)(a))*((spx_word16_t)(b)))) |
|
69 |
|
70 /* (spx_word32_t)(spx_word16_t) gives TI compiler a hint that it's 16x16->32 multiply */ |
|
71 #define MULT16_16(a,b) (((spx_word32_t)(spx_word16_t)(a))*((spx_word32_t)(spx_word16_t)(b))) |
|
72 |
|
73 #define MAC16_16(c,a,b) (ADD32((c),MULT16_16((a),(b)))) |
|
74 #define MULT16_32_Q12(a,b) ADD32(MULT16_16((a),SHR((b),12)), SHR(MULT16_16((a),((b)&0x00000fff)),12)) |
|
75 #define MULT16_32_Q13(a,b) ADD32(MULT16_16((a),SHR((b),13)), SHR(MULT16_16((a),((b)&0x00001fff)),13)) |
|
76 #define MULT16_32_Q14(a,b) ADD32(MULT16_16((a),SHR((b),14)), SHR(MULT16_16((a),((b)&0x00003fff)),14)) |
|
77 |
|
78 #define MULT16_32_Q11(a,b) ADD32(MULT16_16((a),SHR((b),11)), SHR(MULT16_16((a),((b)&0x000007ff)),11)) |
|
79 #define MAC16_32_Q11(c,a,b) ADD32(c,ADD32(MULT16_16((a),SHR((b),11)), SHR(MULT16_16((a),((b)&0x000007ff)),11))) |
|
80 |
|
81 #define MULT16_32_P15(a,b) ADD32(MULT16_16((a),SHR((b),15)), PSHR(MULT16_16((a),((b)&0x00007fff)),15)) |
|
82 #define MULT16_32_Q15(a,b) ADD32(MULT16_16((a),SHR((b),15)), SHR(MULT16_16((a),((b)&0x00007fff)),15)) |
|
83 #define MAC16_32_Q15(c,a,b) ADD32(c,ADD32(MULT16_16((a),SHR((b),15)), SHR(MULT16_16((a),((b)&0x00007fff)),15))) |
|
84 |
|
85 |
|
86 #define MAC16_16_Q11(c,a,b) (ADD32((c),SHR(MULT16_16((a),(b)),11))) |
|
87 #define MAC16_16_Q13(c,a,b) (ADD32((c),SHR(MULT16_16((a),(b)),13))) |
|
88 #define MAC16_16_P13(c,a,b) (ADD32((c),SHR(ADD32(4096,MULT16_16((a),(b))),13))) |
|
89 |
|
90 #define MULT16_16_Q11_32(a,b) (SHR(MULT16_16((a),(b)),11)) |
|
91 #define MULT16_16_Q13(a,b) (SHR(MULT16_16((a),(b)),13)) |
|
92 #define MULT16_16_Q14(a,b) (SHR(MULT16_16((a),(b)),14)) |
|
93 #define MULT16_16_Q15(a,b) (SHR(MULT16_16((a),(b)),15)) |
|
94 |
|
95 #define MULT16_16_P13(a,b) (SHR(ADD32(4096,MULT16_16((a),(b))),13)) |
|
96 #define MULT16_16_P14(a,b) (SHR(ADD32(8192,MULT16_16((a),(b))),14)) |
|
97 #define MULT16_16_P15(a,b) (SHR(ADD32(16384,MULT16_16((a),(b))),15)) |
|
98 |
|
99 #define MUL_16_32_R15(a,bh,bl) ADD32(MULT16_16((a),(bh)), SHR(MULT16_16((a),(bl)),15)) |
|
100 |
|
101 #define DIV32_16(a,b) ((spx_word16_t)(((spx_word32_t)(a))/((spx_word16_t)(b)))) |
|
102 #define PDIV32_16(a,b) ((spx_word16_t)(((spx_word32_t)(a)+((spx_word16_t)(b)>>1))/((spx_word16_t)(b)))) |
|
103 #define DIV32(a,b) (((spx_word32_t)(a))/((spx_word32_t)(b))) |
|
104 #define PDIV32(a,b) (((spx_word32_t)(a)+((spx_word16_t)(b)>>1))/((spx_word32_t)(b))) |
|
105 |
|
106 #endif |
|