prenex/magyarsort
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

ILP comment (idea) for occurence countin'

Browse Source
This commit is contained in:
Richard Thier 2023-04-09 23:46:47 +02:00
parent 3c0b2d5202
commit f84f6fc398
1 changed files with 1 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

1
thiersort.h
View File

@ -451,6 +451,7 @@ static inline void thiersort8_internal(
#ifdef TS_SSE2 #ifdef TS_SSE2
// TODO: implement with SSE2 // TODO: implement with SSE2
#else #else
/* TODO: We can go both down and upwards here to increase ILP! */
/* Occurence counting O(n) */ /* Occurence counting O(n) */
for(TSU32 i = 0; i < length; ++i) { for(TSU32 i = 0; i < length; ++i) {
++radics[ts_radixi(arr[i].key, isint, isunsigned, isfloat)]; ++radics[ts_radixi(arr[i].key, isint, isunsigned, isfloat)];