| cannam@154 | 1 /* Copyright (C) 2013 Xiph.Org Foundation and contributors */ | 
| cannam@154 | 2 /* | 
| cannam@154 | 3    Redistribution and use in source and binary forms, with or without | 
| cannam@154 | 4    modification, are permitted provided that the following conditions | 
| cannam@154 | 5    are met: | 
| cannam@154 | 6 | 
| cannam@154 | 7    - Redistributions of source code must retain the above copyright | 
| cannam@154 | 8    notice, this list of conditions and the following disclaimer. | 
| cannam@154 | 9 | 
| cannam@154 | 10    - Redistributions in binary form must reproduce the above copyright | 
| cannam@154 | 11    notice, this list of conditions and the following disclaimer in the | 
| cannam@154 | 12    documentation and/or other materials provided with the distribution. | 
| cannam@154 | 13 | 
| cannam@154 | 14    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | 
| cannam@154 | 15    ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | 
| cannam@154 | 16    LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | 
| cannam@154 | 17    A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER | 
| cannam@154 | 18    OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, | 
| cannam@154 | 19    EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, | 
| cannam@154 | 20    PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR | 
| cannam@154 | 21    PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF | 
| cannam@154 | 22    LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING | 
| cannam@154 | 23    NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS | 
| cannam@154 | 24    SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 
| cannam@154 | 25 */ | 
| cannam@154 | 26 | 
| cannam@154 | 27 #ifndef FIXED_ARMv4_H | 
| cannam@154 | 28 #define FIXED_ARMv4_H | 
| cannam@154 | 29 | 
| cannam@154 | 30 /** 16x32 multiplication, followed by a 16-bit shift right. Results fits in 32 bits */ | 
| cannam@154 | 31 #undef MULT16_32_Q16 | 
| cannam@154 | 32 static OPUS_INLINE opus_val32 MULT16_32_Q16_armv4(opus_val16 a, opus_val32 b) | 
| cannam@154 | 33 { | 
| cannam@154 | 34   unsigned rd_lo; | 
| cannam@154 | 35   int rd_hi; | 
| cannam@154 | 36   __asm__( | 
| cannam@154 | 37       "#MULT16_32_Q16\n\t" | 
| cannam@154 | 38       "smull %0, %1, %2, %3\n\t" | 
| cannam@154 | 39       : "=&r"(rd_lo), "=&r"(rd_hi) | 
| cannam@154 | 40       : "%r"(b),"r"(SHL32(a,16)) | 
| cannam@154 | 41   ); | 
| cannam@154 | 42   return rd_hi; | 
| cannam@154 | 43 } | 
| cannam@154 | 44 #define MULT16_32_Q16(a, b) (MULT16_32_Q16_armv4(a, b)) | 
| cannam@154 | 45 | 
| cannam@154 | 46 | 
| cannam@154 | 47 /** 16x32 multiplication, followed by a 15-bit shift right. Results fits in 32 bits */ | 
| cannam@154 | 48 #undef MULT16_32_Q15 | 
| cannam@154 | 49 static OPUS_INLINE opus_val32 MULT16_32_Q15_armv4(opus_val16 a, opus_val32 b) | 
| cannam@154 | 50 { | 
| cannam@154 | 51   unsigned rd_lo; | 
| cannam@154 | 52   int rd_hi; | 
| cannam@154 | 53   __asm__( | 
| cannam@154 | 54       "#MULT16_32_Q15\n\t" | 
| cannam@154 | 55       "smull %0, %1, %2, %3\n\t" | 
| cannam@154 | 56       : "=&r"(rd_lo), "=&r"(rd_hi) | 
| cannam@154 | 57       : "%r"(b), "r"(SHL32(a,16)) | 
| cannam@154 | 58   ); | 
| cannam@154 | 59   /*We intentionally don't OR in the high bit of rd_lo for speed.*/ | 
| cannam@154 | 60   return SHL32(rd_hi,1); | 
| cannam@154 | 61 } | 
| cannam@154 | 62 #define MULT16_32_Q15(a, b) (MULT16_32_Q15_armv4(a, b)) | 
| cannam@154 | 63 | 
| cannam@154 | 64 | 
| cannam@154 | 65 /** 16x32 multiply, followed by a 15-bit shift right and 32-bit add. | 
| cannam@154 | 66     b must fit in 31 bits. | 
| cannam@154 | 67     Result fits in 32 bits. */ | 
| cannam@154 | 68 #undef MAC16_32_Q15 | 
| cannam@154 | 69 #define MAC16_32_Q15(c, a, b) ADD32(c, MULT16_32_Q15(a, b)) | 
| cannam@154 | 70 | 
| cannam@154 | 71 /** 16x32 multiply, followed by a 16-bit shift right and 32-bit add. | 
| cannam@154 | 72     Result fits in 32 bits. */ | 
| cannam@154 | 73 #undef MAC16_32_Q16 | 
| cannam@154 | 74 #define MAC16_32_Q16(c, a, b) ADD32(c, MULT16_32_Q16(a, b)) | 
| cannam@154 | 75 | 
| cannam@154 | 76 /** 32x32 multiplication, followed by a 31-bit shift right. Results fits in 32 bits */ | 
| cannam@154 | 77 #undef MULT32_32_Q31 | 
| cannam@154 | 78 #define MULT32_32_Q31(a,b) (opus_val32)((((opus_int64)(a)) * ((opus_int64)(b)))>>31) | 
| cannam@154 | 79 | 
| cannam@154 | 80 #endif |