1 /* Copyright (C) 2004 Jean-Marc Valin */ 2 /** 3 @file vq_arm4.h 4 @brief ARM4-optimized vq routine 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 #define OVERRIDE_VQ_NBEST 36 void vq_nbest(spx_word16_t *in, const spx_word16_t *codebook, int len, int entries, spx_word32_t *E, int N, int *nbest, spx_word32_t *best_dist, char *stack) 37 { 38 int i,j; 39 for (i=0;i<entries;i+=4) 40 { 41 #if 1 42 spx_word32_t dist1, dist2, dist3, dist4; 43 int dead1, dead2, dead3, dead4, dead5, dead6, dead7, dead8; 44 __asm__ __volatile__ ( 45 "mov %0, #0 \n\t" 46 "mov %1, #0 \n\t" 47 "mov %2, #0 \n\t" 48 "mov %3, #0 \n\t" 49 "mov %10, %4 \n\t" 50 "add %4, %4, %4\n\t" 51 ".vqloop%=:\n\t" 52 "ldrsh %7, [%5], #2 \n\t" 53 "ldrsh %8, [%6] \n\t" 54 "mov %9, %6 \n\t" 55 "mla %0, %7, %8, %0 \n\t" 56 "ldrsh %8, [%9, %4]! \n\t" 57 "mla %1, %7, %8, %1 \n\t" 58 "ldrsh %8, [%9, %4]!\n\t" 59 "mla %2, %7, %8, %2 \n\t" 60 "ldrsh %8, [%9, %4]! \n\t" 61 "mla %3, %7, %8, %3 \n\t" 62 "subs %10, %10, #1 \n\t" 63 "add %6, %6, #2 \n\t" 64 "bne .vqloop%=" 65 : "=r" (dist1), "=r" (dist2), "=r" (dist3), "=r" (dist4), 66 "=r" (dead1), "=r" (dead2), "=r" (codebook), "=r" (dead4), 67 "=r" (dead5), "=r" (dead6), "=r" (dead7) 68 : "4" (len), "5" (in), "6" (codebook) 69 : "cc"); 70 #else 71 dist1=dist2=dist3=dist4=0; 72 /* spx_word32_t dist1=0; 73 spx_word32_t dist2=0; 74 spx_word32_t dist3=0; 75 spx_word32_t dist4=0;*/ 76 for (j=0;j<2;j++) 77 { 78 const spx_word16_t *code = codebook; 79 dist1 = MAC16_16(dist1,in[j],*code); 80 code += len; 81 dist2 = MAC16_16(dist2,in[j],*code); 82 code += len; 83 dist3 = MAC16_16(dist3,in[j],*code); 84 code += len; 85 dist4 = MAC16_16(dist4,in[j],*code); 86 codebook++; 87 } 88 #endif 89 dist1=SUB32(SHR(*E++,1),dist1); 90 if (dist1<*best_dist || i==0) 91 { 92 *best_dist=dist1; 93 *nbest=i; 94 } 95 dist2=SUB32(SHR(*E++,1),dist2); 96 if (dist2<*best_dist) 97 { 98 *best_dist=dist2; 99 *nbest=i+1; 100 } 101 dist3=SUB32(SHR(*E++,1),dist3); 102 if (dist3<*best_dist) 103 { 104 *best_dist=dist3; 105 *nbest=i+2; 106 } 107 dist4=SUB32(SHR(*E++,1),dist4); 108 if (dist4<*best_dist) 109 { 110 *best_dist=dist4; 111 *nbest=i+3; 112 } 113 codebook += 3*len; 114 } 115 } 116
