1.1 --- /dev/null Thu Jan 01 00:00:00 1970 +0000
1.2 +++ b/media/libopus/silk/sort.c Wed Dec 31 06:09:35 2014 +0100
1.3 @@ -0,0 +1,154 @@
1.4 +/***********************************************************************
1.5 +Copyright (c) 2006-2011, Skype Limited. All rights reserved.
1.6 +Redistribution and use in source and binary forms, with or without
1.7 +modification, are permitted provided that the following conditions
1.8 +are met:
1.9 +- Redistributions of source code must retain the above copyright notice,
1.10 +this list of conditions and the following disclaimer.
1.11 +- Redistributions in binary form must reproduce the above copyright
1.12 +notice, this list of conditions and the following disclaimer in the
1.13 +documentation and/or other materials provided with the distribution.
1.14 +- Neither the name of Internet Society, IETF or IETF Trust, nor the
1.15 +names of specific contributors, may be used to endorse or promote
1.16 +products derived from this software without specific prior written
1.17 +permission.
1.18 +THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
1.19 +AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
1.20 +IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
1.21 +ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
1.22 +LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
1.23 +CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
1.24 +SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
1.25 +INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
1.26 +CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
1.27 +ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
1.28 +POSSIBILITY OF SUCH DAMAGE.
1.29 +***********************************************************************/
1.30 +
1.31 +#ifdef HAVE_CONFIG_H
1.32 +#include "config.h"
1.33 +#endif
1.34 +
1.35 +/* Insertion sort (fast for already almost sorted arrays): */
1.36 +/* Best case: O(n) for an already sorted array */
1.37 +/* Worst case: O(n^2) for an inversely sorted array */
1.38 +/* */
1.39 +/* Shell short: http://en.wikipedia.org/wiki/Shell_sort */
1.40 +
1.41 +#include "SigProc_FIX.h"
1.42 +
1.43 +void silk_insertion_sort_increasing(
1.44 + opus_int32 *a, /* I/O Unsorted / Sorted vector */
1.45 + opus_int *idx, /* O Index vector for the sorted elements */
1.46 + const opus_int L, /* I Vector length */
1.47 + const opus_int K /* I Number of correctly sorted positions */
1.48 +)
1.49 +{
1.50 + opus_int32 value;
1.51 + opus_int i, j;
1.52 +
1.53 + /* Safety checks */
1.54 + silk_assert( K > 0 );
1.55 + silk_assert( L > 0 );
1.56 + silk_assert( L >= K );
1.57 +
1.58 + /* Write start indices in index vector */
1.59 + for( i = 0; i < K; i++ ) {
1.60 + idx[ i ] = i;
1.61 + }
1.62 +
1.63 + /* Sort vector elements by value, increasing order */
1.64 + for( i = 1; i < K; i++ ) {
1.65 + value = a[ i ];
1.66 + for( j = i - 1; ( j >= 0 ) && ( value < a[ j ] ); j-- ) {
1.67 + a[ j + 1 ] = a[ j ]; /* Shift value */
1.68 + idx[ j + 1 ] = idx[ j ]; /* Shift index */
1.69 + }
1.70 + a[ j + 1 ] = value; /* Write value */
1.71 + idx[ j + 1 ] = i; /* Write index */
1.72 + }
1.73 +
1.74 + /* If less than L values are asked for, check the remaining values, */
1.75 + /* but only spend CPU to ensure that the K first values are correct */
1.76 + for( i = K; i < L; i++ ) {
1.77 + value = a[ i ];
1.78 + if( value < a[ K - 1 ] ) {
1.79 + for( j = K - 2; ( j >= 0 ) && ( value < a[ j ] ); j-- ) {
1.80 + a[ j + 1 ] = a[ j ]; /* Shift value */
1.81 + idx[ j + 1 ] = idx[ j ]; /* Shift index */
1.82 + }
1.83 + a[ j + 1 ] = value; /* Write value */
1.84 + idx[ j + 1 ] = i; /* Write index */
1.85 + }
1.86 + }
1.87 +}
1.88 +
1.89 +#ifdef FIXED_POINT
1.90 +/* This function is only used by the fixed-point build */
1.91 +void silk_insertion_sort_decreasing_int16(
1.92 + opus_int16 *a, /* I/O Unsorted / Sorted vector */
1.93 + opus_int *idx, /* O Index vector for the sorted elements */
1.94 + const opus_int L, /* I Vector length */
1.95 + const opus_int K /* I Number of correctly sorted positions */
1.96 +)
1.97 +{
1.98 + opus_int i, j;
1.99 + opus_int value;
1.100 +
1.101 + /* Safety checks */
1.102 + silk_assert( K > 0 );
1.103 + silk_assert( L > 0 );
1.104 + silk_assert( L >= K );
1.105 +
1.106 + /* Write start indices in index vector */
1.107 + for( i = 0; i < K; i++ ) {
1.108 + idx[ i ] = i;
1.109 + }
1.110 +
1.111 + /* Sort vector elements by value, decreasing order */
1.112 + for( i = 1; i < K; i++ ) {
1.113 + value = a[ i ];
1.114 + for( j = i - 1; ( j >= 0 ) && ( value > a[ j ] ); j-- ) {
1.115 + a[ j + 1 ] = a[ j ]; /* Shift value */
1.116 + idx[ j + 1 ] = idx[ j ]; /* Shift index */
1.117 + }
1.118 + a[ j + 1 ] = value; /* Write value */
1.119 + idx[ j + 1 ] = i; /* Write index */
1.120 + }
1.121 +
1.122 + /* If less than L values are asked for, check the remaining values, */
1.123 + /* but only spend CPU to ensure that the K first values are correct */
1.124 + for( i = K; i < L; i++ ) {
1.125 + value = a[ i ];
1.126 + if( value > a[ K - 1 ] ) {
1.127 + for( j = K - 2; ( j >= 0 ) && ( value > a[ j ] ); j-- ) {
1.128 + a[ j + 1 ] = a[ j ]; /* Shift value */
1.129 + idx[ j + 1 ] = idx[ j ]; /* Shift index */
1.130 + }
1.131 + a[ j + 1 ] = value; /* Write value */
1.132 + idx[ j + 1 ] = i; /* Write index */
1.133 + }
1.134 + }
1.135 +}
1.136 +#endif
1.137 +
1.138 +void silk_insertion_sort_increasing_all_values_int16(
1.139 + opus_int16 *a, /* I/O Unsorted / Sorted vector */
1.140 + const opus_int L /* I Vector length */
1.141 +)
1.142 +{
1.143 + opus_int value;
1.144 + opus_int i, j;
1.145 +
1.146 + /* Safety checks */
1.147 + silk_assert( L > 0 );
1.148 +
1.149 + /* Sort vector elements by value, increasing order */
1.150 + for( i = 1; i < L; i++ ) {
1.151 + value = a[ i ];
1.152 + for( j = i - 1; ( j >= 0 ) && ( value < a[ j ] ); j-- ) {
1.153 + a[ j + 1 ] = a[ j ]; /* Shift value */
1.154 + }
1.155 + a[ j + 1 ] = value; /* Write value */
1.156 + }
1.157 +}
