annotate src/opus-1.3/silk/tests/test_unit_LPC_inv_pred_gain.c @ 169:223a55898ab9 tip default

Add null config files
author Chris Cannam <cannam@all-day-breakfast.com>
date Mon, 02 Mar 2020 14:03:47 +0000
parents 4664ac0c1032
children
rev   line source
cannam@154 1 /***********************************************************************
cannam@154 2 Copyright (c) 2017 Google Inc., Jean-Marc Valin
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 - Redistributions of source code must retain the above copyright notice,
cannam@154 7 this list of conditions and the following disclaimer.
cannam@154 8 - Redistributions in binary form must reproduce the above copyright
cannam@154 9 notice, this list of conditions and the following disclaimer in the
cannam@154 10 documentation and/or other materials provided with the distribution.
cannam@154 11 - Neither the name of Internet Society, IETF or IETF Trust, nor the
cannam@154 12 names of specific contributors, may be used to endorse or promote
cannam@154 13 products derived from this software without specific prior written
cannam@154 14 permission.
cannam@154 15 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
cannam@154 16 AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
cannam@154 17 IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
cannam@154 18 ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
cannam@154 19 LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
cannam@154 20 CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
cannam@154 21 SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
cannam@154 22 INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
cannam@154 23 CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
cannam@154 24 ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
cannam@154 25 POSSIBILITY OF SUCH DAMAGE.
cannam@154 26 ***********************************************************************/
cannam@154 27
cannam@154 28 #ifdef HAVE_CONFIG_H
cannam@154 29 #include "config.h"
cannam@154 30 #endif
cannam@154 31
cannam@154 32 #include <stdio.h>
cannam@154 33 #include <stdlib.h>
cannam@154 34 #include "celt/stack_alloc.h"
cannam@154 35 #include "cpu_support.h"
cannam@154 36 #include "SigProc_FIX.h"
cannam@154 37
cannam@154 38 /* Computes the impulse response of the filter so we
cannam@154 39 can catch filters that are definitely unstable. Some
cannam@154 40 unstable filters may be classified as stable, but not
cannam@154 41 the other way around. */
cannam@154 42 int check_stability(opus_int16 *A_Q12, int order) {
cannam@154 43 int i;
cannam@154 44 int j;
cannam@154 45 int sum_a, sum_abs_a;
cannam@154 46 sum_a = sum_abs_a = 0;
cannam@154 47 for( j = 0; j < order; j++ ) {
cannam@154 48 sum_a += A_Q12[ j ];
cannam@154 49 sum_abs_a += silk_abs( A_Q12[ j ] );
cannam@154 50 }
cannam@154 51 /* Check DC stability. */
cannam@154 52 if( sum_a >= 4096 ) {
cannam@154 53 return 0;
cannam@154 54 }
cannam@154 55 /* If the sum of absolute values is less than 1, the filter
cannam@154 56 has to be stable. */
cannam@154 57 if( sum_abs_a < 4096 ) {
cannam@154 58 return 1;
cannam@154 59 }
cannam@154 60 double y[SILK_MAX_ORDER_LPC] = {0};
cannam@154 61 y[0] = 1;
cannam@154 62 for( i = 0; i < 10000; i++ ) {
cannam@154 63 double sum = 0;
cannam@154 64 for( j = 0; j < order; j++ ) {
cannam@154 65 sum += y[ j ]*A_Q12[ j ];
cannam@154 66 }
cannam@154 67 for( j = order - 1; j > 0; j-- ) {
cannam@154 68 y[ j ] = y[ j - 1 ];
cannam@154 69 }
cannam@154 70 y[ 0 ] = sum*(1./4096);
cannam@154 71 /* If impulse response reaches +/- 10000, the filter
cannam@154 72 is definitely unstable. */
cannam@154 73 if( !(y[ 0 ] < 10000 && y[ 0 ] > -10000) ) {
cannam@154 74 return 0;
cannam@154 75 }
cannam@154 76 /* Test every 8 sample for low amplitude. */
cannam@154 77 if( ( i & 0x7 ) == 0 ) {
cannam@154 78 double amp = 0;
cannam@154 79 for( j = 0; j < order; j++ ) {
cannam@154 80 amp += fabs(y[j]);
cannam@154 81 }
cannam@154 82 if( amp < 0.00001 ) {
cannam@154 83 return 1;
cannam@154 84 }
cannam@154 85 }
cannam@154 86 }
cannam@154 87 return 1;
cannam@154 88 }
cannam@154 89
cannam@154 90 int main(void) {
cannam@154 91 const int arch = opus_select_arch();
cannam@154 92 /* Set to 10000 so all branches in C function are triggered */
cannam@154 93 const int loop_num = 10000;
cannam@154 94 int count = 0;
cannam@154 95 ALLOC_STACK;
cannam@154 96
cannam@154 97 /* FIXME: Make the seed random (with option to set it explicitly)
cannam@154 98 so we get wider coverage. */
cannam@154 99 srand(0);
cannam@154 100
cannam@154 101 printf("Testing silk_LPC_inverse_pred_gain() optimization ...\n");
cannam@154 102 for( count = 0; count < loop_num; count++ ) {
cannam@154 103 unsigned int i;
cannam@154 104 opus_int order;
cannam@154 105 unsigned int shift;
cannam@154 106 opus_int16 A_Q12[ SILK_MAX_ORDER_LPC ];
cannam@154 107 opus_int32 gain;
cannam@154 108
cannam@154 109 for( order = 2; order <= SILK_MAX_ORDER_LPC; order += 2 ) { /* order must be even. */
cannam@154 110 for( shift = 0; shift < 16; shift++ ) { /* Different dynamic range. */
cannam@154 111 for( i = 0; i < SILK_MAX_ORDER_LPC; i++ ) {
cannam@154 112 A_Q12[i] = ((opus_int16)rand()) >> shift;
cannam@154 113 }
cannam@154 114 gain = silk_LPC_inverse_pred_gain(A_Q12, order, arch);
cannam@154 115 /* Look for filters that silk_LPC_inverse_pred_gain() thinks are
cannam@154 116 stable but definitely aren't. */
cannam@154 117 if( gain != 0 && !check_stability(A_Q12, order) ) {
cannam@154 118 fprintf(stderr, "**Loop %4d failed!**\n", count);
cannam@154 119 return 1;
cannam@154 120 }
cannam@154 121 }
cannam@154 122 }
cannam@154 123 if( !(count % 500) ) {
cannam@154 124 printf("Loop %4d passed\n", count);
cannam@154 125 }
cannam@154 126 }
cannam@154 127 printf("silk_LPC_inverse_pred_gain() optimization passed\n");
cannam@154 128 return 0;
cannam@154 129 }