/src/opus/silk/sort.c

Source
/***********************************************************************
Copyright (c) 2006-2011, Skype Limited. All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
- Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
- Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
- Neither the name of Internet Society, IETF or IETF Trust, nor the
names of specific contributors, may be used to endorse or promote
products derived from this software without specific prior written
permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
POSSIBILITY OF SUCH DAMAGE.
***********************************************************************/

#ifdef HAVE_CONFIG_H
#include "config.h"
#endif

/* Insertion sort (fast for already almost sorted arrays):   */
/* Best case:  O(n)   for an already sorted array            */
/* Worst case: O(n^2) for an inversely sorted array          */
/*                                                           */
/* Shell short:    https://en.wikipedia.org/wiki/Shell_sort  */

#include "SigProc_FIX.h"

void silk_insertion_sort_increasing(
    opus_int32           *a,             /* I/O   Unsorted / Sorted vector               */
    opus_int             *idx,           /* O     Index vector for the sorted elements   */
    const opus_int       L,              /* I     Vector length                          */
    const opus_int       K               /* I     Number of correctly sorted positions   */
)
{
    opus_int32    value;
    opus_int        i, j;

    /* Safety checks */
    celt_assert( K >  0 );
    celt_assert( L >  0 );
    celt_assert( L >= K );

    /* Write start indices in index vector */
    for( i = 0; i < K; i++ ) {
        idx[ i ] = i;
    }

    /* Sort vector elements by value, increasing order */
    for( i = 1; i < K; i++ ) {
        value = a[ i ];
        for( j = i - 1; ( j >= 0 ) && ( value < a[ j ] ); j-- ) {
            a[ j + 1 ]   = a[ j ];       /* Shift value */
            idx[ j + 1 ] = idx[ j ];     /* Shift index */
        }
        a[ j + 1 ]   = value;   /* Write value */
        idx[ j + 1 ] = i;       /* Write index */
    }

    /* If less than L values are asked for, check the remaining values, */
    /* but only spend CPU to ensure that the K first values are correct */
    for( i = K; i < L; i++ ) {
        value = a[ i ];
        if( value < a[ K - 1 ] ) {
            for( j = K - 2; ( j >= 0 ) && ( value < a[ j ] ); j-- ) {
                a[ j + 1 ]   = a[ j ];       /* Shift value */
                idx[ j + 1 ] = idx[ j ];     /* Shift index */
            }
            a[ j + 1 ]   = value;   /* Write value */
            idx[ j + 1 ] = i;       /* Write index */
        }
    }
}

#ifdef FIXED_POINT
/* This function is only used by the fixed-point build */
void silk_insertion_sort_decreasing_int16(
    opus_int16                  *a,                 /* I/O   Unsorted / Sorted vector                                   */
    opus_int                    *idx,               /* O     Index vector for the sorted elements                       */
    const opus_int              L,                  /* I     Vector length                                              */
    const opus_int              K                   /* I     Number of correctly sorted positions                       */
)
{
    opus_int i, j;
    opus_int value;

    /* Safety checks */
    celt_assert( K >  0 );
    celt_assert( L >  0 );
    celt_assert( L >= K );

    /* Write start indices in index vector */
    for( i = 0; i < K; i++ ) {
        idx[ i ] = i;
    }

    /* Sort vector elements by value, decreasing order */
    for( i = 1; i < K; i++ ) {
        value = a[ i ];
        for( j = i - 1; ( j >= 0 ) && ( value > a[ j ] ); j-- ) {
            a[ j + 1 ]   = a[ j ];     /* Shift value */
            idx[ j + 1 ] = idx[ j ];   /* Shift index */
        }
        a[ j + 1 ]   = value;   /* Write value */
        idx[ j + 1 ] = i;       /* Write index */
    }

    /* If less than L values are asked for, check the remaining values, */
    /* but only spend CPU to ensure that the K first values are correct */
    for( i = K; i < L; i++ ) {
        value = a[ i ];
        if( value > a[ K - 1 ] ) {
            for( j = K - 2; ( j >= 0 ) && ( value > a[ j ] ); j-- ) {
                a[ j + 1 ]   = a[ j ];     /* Shift value */
                idx[ j + 1 ] = idx[ j ];   /* Shift index */
            }
            a[ j + 1 ]   = value;   /* Write value */
            idx[ j + 1 ] = i;       /* Write index */
        }
    }
}
#endif

void silk_insertion_sort_increasing_all_values_int16(
     opus_int16                 *a,                 /* I/O   Unsorted / Sorted vector                                   */
     const opus_int             L                   /* I     Vector length                                              */
)
{
    opus_int    value;
    opus_int    i, j;

    /* Safety checks */
    celt_assert( L >  0 );

    /* Sort vector elements by value, increasing order */
    for( i = 1; i < L; i++ ) {
        value = a[ i ];
        for( j = i - 1; ( j >= 0 ) && ( value < a[ j ] ); j-- ) {
            a[ j + 1 ] = a[ j ]; /* Shift value */
        }
        a[ j + 1 ] = value; /* Write value */
    }
}

Line	Count	Source
1		/***********************************************************************
2		Copyright (c) 2006-2011, Skype Limited. All rights reserved.
3		Redistribution and use in source and binary forms, with or without
4		modification, are permitted provided that the following conditions
5		are met:
6		- Redistributions of source code must retain the above copyright notice,
7		this list of conditions and the following disclaimer.
8		- Redistributions in binary form must reproduce the above copyright
9		notice, this list of conditions and the following disclaimer in the
10		documentation and/or other materials provided with the distribution.
11		- Neither the name of Internet Society, IETF or IETF Trust, nor the
12		names of specific contributors, may be used to endorse or promote
13		products derived from this software without specific prior written
14		permission.
15		THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
16		AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
17		IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
18		ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
19		LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
20		CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
21		SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
22		INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
23		CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
24		ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
25		POSSIBILITY OF SUCH DAMAGE.
26		***********************************************************************/
27
28		#ifdef HAVE_CONFIG_H
29		#include "config.h"
30		#endif
31
32		/* Insertion sort (fast for already almost sorted arrays): */
33		/* Best case: O(n) for an already sorted array */
34		/* Worst case: O(n^2) for an inversely sorted array */
35		/* */
36		/* Shell short: https://en.wikipedia.org/wiki/Shell_sort */
37
38		#include "SigProc_FIX.h"
39
40		void silk_insertion_sort_increasing(
41		opus_int32 a, / I/O Unsorted / Sorted vector */
42		opus_int idx, / O Index vector for the sorted elements */
43		const opus_int L, /* I Vector length */
44		const opus_int K /* I Number of correctly sorted positions */
45		)
46	119M	{
47	119M	opus_int32 value;
48	119M	opus_int i, j;
49
50		/* Safety checks */
51	119M	celt_assert( K > 0 );
52	119M	celt_assert( L > 0 );
53	119M	celt_assert( L >= K );
54
55		/* Write start indices in index vector */
56	524M	for( i = 0; i < K; i++ ) {
57	405M	idx[ i ] = i;
58	405M	}
59
60		/* Sort vector elements by value, increasing order */
61	405M	for( i = 1; i < K; i++ ) {
62	285M	value = a[ i ];
63	768M	for( j = i - 1; ( j >= 0 ) && ( value < a[ j ] ); j-- ) {
64	483M	a[ j + 1 ] = a[ j ]; /* Shift value */
65	483M	idx[ j + 1 ] = idx[ j ]; /* Shift index */
66	483M	}
67	285M	a[ j + 1 ] = value; /* Write value */
68	285M	idx[ j + 1 ] = i; /* Write index */
69	285M	}
70
71		/* If less than L values are asked for, check the remaining values, */
72		/* but only spend CPU to ensure that the K first values are correct */
73	1.97G	for( i = K; i < L; i++ ) {
74	1.85G	value = a[ i ];
75	1.85G	if( value < a[ K - 1 ] ) {
76	1.63G	for( j = K - 2; ( j >= 0 ) && ( value < a[ j ] ); j-- ) {
77	1.26G	a[ j + 1 ] = a[ j ]; /* Shift value */
78	1.26G	idx[ j + 1 ] = idx[ j ]; /* Shift index */
79	1.26G	}
80	368M	a[ j + 1 ] = value; /* Write value */
81	368M	idx[ j + 1 ] = i; /* Write index */
82	368M	}
83	1.85G	}
84	119M	}
85
86		#ifdef FIXED_POINT
87		/* This function is only used by the fixed-point build */
88		void silk_insertion_sort_decreasing_int16(
89		opus_int16 a, / I/O Unsorted / Sorted vector */
90		opus_int idx, / O Index vector for the sorted elements */
91		const opus_int L, /* I Vector length */
92		const opus_int K /* I Number of correctly sorted positions */
93		)
94	574k	{
95	574k	opus_int i, j;
96	574k	opus_int value;
97
98		/* Safety checks */
99	574k	celt_assert( K > 0 );
100	574k	celt_assert( L > 0 );
101	574k	celt_assert( L >= K );
102
103		/* Write start indices in index vector */
104	3.81M	for( i = 0; i < K; i++ ) {
105	3.23M	idx[ i ] = i;
106	3.23M	}
107
108		/* Sort vector elements by value, decreasing order */
109	3.23M	for( i = 1; i < K; i++ ) {
110	2.66M	value = a[ i ];
111	6.32M	for( j = i - 1; ( j >= 0 ) && ( value > a[ j ] ); j-- ) {
112	3.65M	a[ j + 1 ] = a[ j ]; /* Shift value */
113	3.65M	idx[ j + 1 ] = idx[ j ]; /* Shift index */
114	3.65M	}
115	2.66M	a[ j + 1 ] = value; /* Write value */
116	2.66M	idx[ j + 1 ] = i; /* Write index */
117	2.66M	}
118
119		/* If less than L values are asked for, check the remaining values, */
120		/* but only spend CPU to ensure that the K first values are correct */
121	34.6M	for( i = K; i < L; i++ ) {
122	34.0M	value = a[ i ];
123	34.0M	if( value > a[ K - 1 ] ) {
124	28.2M	for( j = K - 2; ( j >= 0 ) && ( value > a[ j ] ); j-- ) {
125	20.5M	a[ j + 1 ] = a[ j ]; /* Shift value */
126	20.5M	idx[ j + 1 ] = idx[ j ]; /* Shift index */
127	20.5M	}
128	7.74M	a[ j + 1 ] = value; /* Write value */
129	7.74M	idx[ j + 1 ] = i; /* Write index */
130	7.74M	}
131	34.0M	}
132	574k	}
133		#endif
134
135		void silk_insertion_sort_increasing_all_values_int16(
136		opus_int16 a, / I/O Unsorted / Sorted vector */
137		const opus_int L /* I Vector length */
138		)
139	9.16k	{
140	9.16k	opus_int value;
141	9.16k	opus_int i, j;
142
143		/* Safety checks */
144	9.16k	celt_assert( L > 0 );
145
146		/* Sort vector elements by value, increasing order */
147	113k	for( i = 1; i < L; i++ ) {
148	104k	value = a[ i ];
149	183k	for( j = i - 1; ( j >= 0 ) && ( value < a[ j ] ); j-- ) {
150	79.3k	a[ j + 1 ] = a[ j ]; /* Shift value */
151	79.3k	}
152	104k	a[ j + 1 ] = value; /* Write value */
153	104k	}
154	9.16k	}

Coverage Report

Created: 2025-12-14 07:08