1.1 --- /dev/null Thu Jan 01 00:00:00 1970 +0000
1.2 +++ b/media/libopus/silk/float/sort_FLP.c Wed Dec 31 06:09:35 2014 +0100
1.3 @@ -0,0 +1,83 @@
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 +#include "typedef.h"
1.40 +#include "SigProc_FLP.h"
1.41 +
1.42 +void silk_insertion_sort_decreasing_FLP(
1.43 + silk_float *a, /* I/O Unsorted / Sorted vector */
1.44 + opus_int *idx, /* O Index vector for the sorted elements */
1.45 + const opus_int L, /* I Vector length */
1.46 + const opus_int K /* I Number of correctly sorted positions */
1.47 +)
1.48 +{
1.49 + silk_float value;
1.50 + opus_int i, j;
1.51 +
1.52 + /* Safety checks */
1.53 + silk_assert( K > 0 );
1.54 + silk_assert( L > 0 );
1.55 + silk_assert( L >= K );
1.56 +
1.57 + /* Write start indices in index vector */
1.58 + for( i = 0; i < K; i++ ) {
1.59 + idx[ i ] = i;
1.60 + }
1.61 +
1.62 + /* Sort vector elements by value, decreasing order */
1.63 + for( i = 1; i < K; i++ ) {
1.64 + value = a[ i ];
1.65 + for( j = i - 1; ( j >= 0 ) && ( value > a[ j ] ); j-- ) {
1.66 + a[ j + 1 ] = a[ j ]; /* Shift value */
1.67 + idx[ j + 1 ] = idx[ j ]; /* Shift index */
1.68 + }
1.69 + a[ j + 1 ] = value; /* Write value */
1.70 + idx[ j + 1 ] = i; /* Write index */
1.71 + }
1.72 +
1.73 + /* If less than L values are asked check the remaining values, */
1.74 + /* but only spend CPU to ensure that the K first values are correct */
1.75 + for( i = K; i < L; i++ ) {
1.76 + value = a[ i ];
1.77 + if( value > a[ K - 1 ] ) {
1.78 + for( j = K - 2; ( j >= 0 ) && ( value > a[ j ] ); j-- ) {
1.79 + a[ j + 1 ] = a[ j ]; /* Shift value */
1.80 + idx[ j + 1 ] = idx[ j ]; /* Shift index */
1.81 + }
1.82 + a[ j + 1 ] = value; /* Write value */
1.83 + idx[ j + 1 ] = i; /* Write index */
1.84 + }
1.85 + }
1.86 +}
