The Tor Browser / file comparison
comparison: media/libopus/celt/fixed_generic.h
media/libopus/celt/fixed_generic.h
- changeset 0
- 6474c204b198
equal
deleted
inserted
replaced
| -1:000000000000 | 0:3a1f9f54c396 |
|---|---|
| 1 /* Copyright (C) 2007-2009 Xiph.Org Foundation | |
| 2 Copyright (C) 2003-2008 Jean-Marc Valin | |
| 3 Copyright (C) 2007-2008 CSIRO */ | |
| 4 /** | |
| 5 @file fixed_generic.h | |
| 6 @brief Generic fixed-point operations | |
| 7 */ | |
| 8 /* | |
| 9 Redistribution and use in source and binary forms, with or without | |
| 10 modification, are permitted provided that the following conditions | |
| 11 are met: | |
| 12 | |
| 13 - Redistributions of source code must retain the above copyright | |
| 14 notice, this list of conditions and the following disclaimer. | |
| 15 | |
| 16 - Redistributions in binary form must reproduce the above copyright | |
| 17 notice, this list of conditions and the following disclaimer in the | |
| 18 documentation and/or other materials provided with the distribution. | |
| 19 | |
| 20 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | |
| 21 ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | |
| 22 LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | |
| 23 A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER | |
| 24 OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, | |
| 25 EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, | |
| 26 PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR | |
| 27 PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF | |
| 28 LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING | |
| 29 NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS | |
| 30 SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | |
| 31 */ | |
| 32 | |
| 33 #ifndef FIXED_GENERIC_H | |
| 34 #define FIXED_GENERIC_H | |
| 35 | |
| 36 /** Multiply a 16-bit signed value by a 16-bit unsigned value. The result is a 32-bit signed value */ | |
| 37 #define MULT16_16SU(a,b) ((opus_val32)(opus_val16)(a)*(opus_val32)(opus_uint16)(b)) | |
| 38 | |
| 39 /** 16x32 multiplication, followed by a 16-bit shift right. Results fits in 32 bits */ | |
| 40 #define MULT16_32_Q16(a,b) ADD32(MULT16_16((a),SHR((b),16)), SHR(MULT16_16SU((a),((b)&0x0000ffff)),16)) | |
| 41 | |
| 42 /** 16x32 multiplication, followed by a 16-bit shift right (round-to-nearest). Results fits in 32 bits */ | |
| 43 #define MULT16_32_P16(a,b) ADD32(MULT16_16((a),SHR((b),16)), PSHR(MULT16_16SU((a),((b)&0x0000ffff)),16)) | |
| 44 | |
| 45 /** 16x32 multiplication, followed by a 15-bit shift right. Results fits in 32 bits */ | |
| 46 #define MULT16_32_Q15(a,b) ADD32(SHL(MULT16_16((a),SHR((b),16)),1), SHR(MULT16_16SU((a),((b)&0x0000ffff)),15)) | |
| 47 | |
| 48 /** 32x32 multiplication, followed by a 31-bit shift right. Results fits in 32 bits */ | |
| 49 #define MULT32_32_Q31(a,b) ADD32(ADD32(SHL(MULT16_16(SHR((a),16),SHR((b),16)),1), SHR(MULT16_16SU(SHR((a),16),((b)&0x0000ffff)),15)), SHR(MULT16_16SU(SHR((b),16),((a)&0x0000ffff)),15)) | |
| 50 | |
| 51 /** Compile-time conversion of float constant to 16-bit value */ | |
| 52 #define QCONST16(x,bits) ((opus_val16)(.5+(x)*(((opus_val32)1)<<(bits)))) | |
| 53 | |
| 54 /** Compile-time conversion of float constant to 32-bit value */ | |
| 55 #define QCONST32(x,bits) ((opus_val32)(.5+(x)*(((opus_val32)1)<<(bits)))) | |
| 56 | |
| 57 /** Negate a 16-bit value */ | |
| 58 #define NEG16(x) (-(x)) | |
| 59 /** Negate a 32-bit value */ | |
| 60 #define NEG32(x) (-(x)) | |
| 61 | |
| 62 /** Change a 32-bit value into a 16-bit value. The value is assumed to fit in 16-bit, otherwise the result is undefined */ | |
| 63 #define EXTRACT16(x) ((opus_val16)(x)) | |
| 64 /** Change a 16-bit value into a 32-bit value */ | |
| 65 #define EXTEND32(x) ((opus_val32)(x)) | |
| 66 | |
| 67 /** Arithmetic shift-right of a 16-bit value */ | |
| 68 #define SHR16(a,shift) ((a) >> (shift)) | |
| 69 /** Arithmetic shift-left of a 16-bit value */ | |
| 70 #define SHL16(a,shift) ((opus_int16)((opus_uint16)(a)<<(shift))) | |
| 71 /** Arithmetic shift-right of a 32-bit value */ | |
| 72 #define SHR32(a,shift) ((a) >> (shift)) | |
| 73 /** Arithmetic shift-left of a 32-bit value */ | |
| 74 #define SHL32(a,shift) ((opus_int32)((opus_uint32)(a)<<(shift))) | |
| 75 | |
| 76 /** 32-bit arithmetic shift right with rounding-to-nearest instead of rounding down */ | |
| 77 #define PSHR32(a,shift) (SHR32((a)+((EXTEND32(1)<<((shift))>>1)),shift)) | |
| 78 /** 32-bit arithmetic shift right where the argument can be negative */ | |
| 79 #define VSHR32(a, shift) (((shift)>0) ? SHR32(a, shift) : SHL32(a, -(shift))) | |
| 80 | |
| 81 /** "RAW" macros, should not be used outside of this header file */ | |
| 82 #define SHR(a,shift) ((a) >> (shift)) | |
| 83 #define SHL(a,shift) SHL32(a,shift) | |
| 84 #define PSHR(a,shift) (SHR((a)+((EXTEND32(1)<<((shift))>>1)),shift)) | |
| 85 #define SATURATE(x,a) (((x)>(a) ? (a) : (x)<-(a) ? -(a) : (x))) | |
| 86 | |
| 87 #define SATURATE16(x) (EXTRACT16((x)>32767 ? 32767 : (x)<-32768 ? -32768 : (x))) | |
| 88 | |
| 89 /** Shift by a and round-to-neareast 32-bit value. Result is a 16-bit value */ | |
| 90 #define ROUND16(x,a) (EXTRACT16(PSHR32((x),(a)))) | |
| 91 /** Divide by two */ | |
| 92 #define HALF16(x) (SHR16(x,1)) | |
| 93 #define HALF32(x) (SHR32(x,1)) | |
| 94 | |
| 95 /** Add two 16-bit values */ | |
| 96 #define ADD16(a,b) ((opus_val16)((opus_val16)(a)+(opus_val16)(b))) | |
| 97 /** Subtract two 16-bit values */ | |
| 98 #define SUB16(a,b) ((opus_val16)(a)-(opus_val16)(b)) | |
| 99 /** Add two 32-bit values */ | |
| 100 #define ADD32(a,b) ((opus_val32)(a)+(opus_val32)(b)) | |
| 101 /** Subtract two 32-bit values */ | |
| 102 #define SUB32(a,b) ((opus_val32)(a)-(opus_val32)(b)) | |
| 103 | |
| 104 /** 16x16 multiplication where the result fits in 16 bits */ | |
| 105 #define MULT16_16_16(a,b) ((((opus_val16)(a))*((opus_val16)(b)))) | |
| 106 | |
| 107 /* (opus_val32)(opus_val16) gives TI compiler a hint that it's 16x16->32 multiply */ | |
| 108 /** 16x16 multiplication where the result fits in 32 bits */ | |
| 109 #define MULT16_16(a,b) (((opus_val32)(opus_val16)(a))*((opus_val32)(opus_val16)(b))) | |
| 110 | |
| 111 /** 16x16 multiply-add where the result fits in 32 bits */ | |
| 112 #define MAC16_16(c,a,b) (ADD32((c),MULT16_16((a),(b)))) | |
| 113 /** 16x32 multiply, followed by a 15-bit shift right and 32-bit add. | |
| 114 b must fit in 31 bits. | |
| 115 Result fits in 32 bits. */ | |
| 116 #define MAC16_32_Q15(c,a,b) ADD32(c,ADD32(MULT16_16((a),SHR((b),15)), SHR(MULT16_16((a),((b)&0x00007fff)),15))) | |
| 117 | |
| 118 #define MULT16_16_Q11_32(a,b) (SHR(MULT16_16((a),(b)),11)) | |
| 119 #define MULT16_16_Q11(a,b) (SHR(MULT16_16((a),(b)),11)) | |
| 120 #define MULT16_16_Q13(a,b) (SHR(MULT16_16((a),(b)),13)) | |
| 121 #define MULT16_16_Q14(a,b) (SHR(MULT16_16((a),(b)),14)) | |
| 122 #define MULT16_16_Q15(a,b) (SHR(MULT16_16((a),(b)),15)) | |
| 123 | |
| 124 #define MULT16_16_P13(a,b) (SHR(ADD32(4096,MULT16_16((a),(b))),13)) | |
| 125 #define MULT16_16_P14(a,b) (SHR(ADD32(8192,MULT16_16((a),(b))),14)) | |
| 126 #define MULT16_16_P15(a,b) (SHR(ADD32(16384,MULT16_16((a),(b))),15)) | |
| 127 | |
| 128 /** Divide a 32-bit value by a 16-bit value. Result fits in 16 bits */ | |
| 129 #define DIV32_16(a,b) ((opus_val16)(((opus_val32)(a))/((opus_val16)(b)))) | |
| 130 | |
| 131 /** Divide a 32-bit value by a 32-bit value. Result fits in 32 bits */ | |
| 132 #define DIV32(a,b) (((opus_val32)(a))/((opus_val32)(b))) | |
| 133 | |
| 134 #endif |
