Subversion Repositories heap_sorter

typedef struct{

  short unsigned int key;

  char payload[4];

} sort_data;

int inline kcmp(short unsigned int v1, short unsigned int v2)

{

#pragma HLS LATENCY min=0 max=0

        if(v1==v2) return 0;

        if((v1-v2) & (1<<15)) return -1;

        return 1;

}

#define NM 11

#define SORT_LEN (1<<NM)

#define MAX_DEL (SORT_LEN)

#define TEST_LEN (MAX_DEL*100)

extern sort_data sort_mem[NM][SORT_LEN];

sort_data heap_sort (sort_data val);