sw/benchmarks/src/bitonic_sort.c
// local sort of 8 elements with insert sort 
// currently unused
local sort of 8 elements with insert sort
currently unused
local sort of 8 elements with insert sort currently unused
void chunk_sort_insert(uint64_t *p)
{
    unsigned i, j;
    for (i=1; i<CHUNK_SIZE; i++) {
        uint64_t x = p[i];
        j = i;
        while (j!=0 && p[j-1]>x) {
            p[j] = p[j-1];
            j--;
        }
        p[j] = x;
    }
}
void chunk_sort_insert ( uint64_t * p ) { unsigned i , j ; for ( i = 1 ; i < CHUNK_SIZE ; i ++ ) { uint64_t x = p [ i ] ; j = i ; while ( j != 0 && p [ j - 1 ] > x ) { p [ j ] = p [ j - 1 ] ; j -- ; } p [ j ] = x ; } }
local sort of 8 elements with insert sort
currently unused
local sort of 8 elements with insert sort currently unused