aaron/ispc
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

+1

Browse Source
This commit is contained in:
Evghenii
2014-01-31 17:49:39 +01:00
parent 5cf880e8fc
commit bead800c13
1 changed files with 18 additions and 17 deletions
Download Patch File Download Diff File Expand all files Collapse all files

35
examples_ptx/mergeSort/mergeSort.ispc
View File

@@ -30,15 +30,15 @@ int binarySearchInclusiveRanks(
const int L, const int L,
int stride) int stride)
{ {
if (L == 0) cif (L == 0)
return 0; return 0;
int pos = 0; int pos = 0;
for (; stride > 0; stride >>= 1) cfor (; stride > 0; stride >>= 1)
{ {
int newPos = min(pos + stride, L); int newPos = min(pos + stride, L);
if (data[newPos - 1] <= val) cif (data[newPos - 1] <= val)
pos = newPos; pos = newPos;
} }
@@ -52,11 +52,11 @@ int binarySearchExclusiveRanks(
const int L, const int L,
int stride) int stride)
{ {
if (L == 0) cif (L == 0)
return 0; return 0;
int pos = 0; int pos = 0;
for (; stride > 0; stride >>= 1) cfor (; stride > 0; stride >>= 1)
{ {
int newPos = min(pos + stride, L); int newPos = min(pos + stride, L);
@@ -74,11 +74,11 @@ int binarySearchInclusive(
const int L, const int L,
int stride) int stride)
{ {
if (L == 0) cif (L == 0)
return 0; return 0;
int pos = 0; int pos = 0;
for (; stride > 0; stride >>= 1) cfor (; stride > 0; stride >>= 1)
{ {
int newPos = min(pos + stride, L); int newPos = min(pos + stride, L);
@@ -96,11 +96,11 @@ int binarySearchExclusive(
const int L, const int L,
int stride) int stride)
{ {
if (L == 0) cif (L == 0)
return 0; return 0;
int pos = 0; int pos = 0;
for (; stride > 0; stride >>= 1) cfor (; stride > 0; stride >>= 1)
{ {
int newPos = min(pos + stride, L); int newPos = min(pos + stride, L);
@@ -444,23 +444,24 @@ void mergeElementaryIntervalsKernel(
} }
// Compute destination addresses for merge data // Compute destination addresses for merge data
int dstPosA = binarySearchExclusive1(keyA, keyB, lenSrcB, SAMPLE_STRIDE) + programIndex; int dstPosA, dstPosB, dstA = -1, dstB = -1;
int dstPosB = binarySearchInclusive1(keyB, keyA, lenSrcA, SAMPLE_STRIDE) + programIndex; if (programIndex < lenSrcA)
dstPosA = binarySearchExclusive1(keyA, keyB, lenSrcB, SAMPLE_STRIDE) + programIndex;
if (programIndex < lenSrcB)
dstPosB = binarySearchInclusive1(keyB, keyA, lenSrcA, SAMPLE_STRIDE) + programIndex;
int dstA = -1, dstB = -1;
if (programIndex < lenSrcA && dstPosA < lenSrcA) if (programIndex < lenSrcA && dstPosA < lenSrcA)
dstA = segmentBase + startDstA + dstPosA; dstA = segmentBase + startDstA + dstPosA;
if (programIndex < lenSrcB && dstPosB < lenSrcA)
dstB = segmentBase + startDstA + dstPosB;
dstPosA -= lenSrcA; dstPosA -= lenSrcA;
dstPosB -= lenSrcA;
if (programIndex < lenSrcA && dstPosA < lenSrcB) if (programIndex < lenSrcA && dstPosA < lenSrcB)
dstA = segmentBase + startDstB + dstPosA; dstA = segmentBase + startDstB + dstPosA;
if (programIndex < lenSrcB && dstPosB < lenSrcA)
dstB = segmentBase + startDstA + dstPosB;
dstPosB -= lenSrcA;
if (programIndex < lenSrcB && dstPosB < lenSrcB) if (programIndex < lenSrcB && dstPosB < lenSrcB)
dstB = segmentBase + startDstB + dstPosB; dstB = segmentBase + startDstB + dstPosB;
// store merge data
if (dstA >= 0) if (dstA >= 0)
{ {
dstKey[dstA] = keyA; dstKey[dstA] = keyA;