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

+runs.. next step is tunning

Browse Source
This commit is contained in:
Evghenii
2014-01-29 19:21:12 +01:00
parent ac4d847eac
commit 1be05cb03a
1 changed files with 1 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

3
examples_ptx/mergeSort/mergeSort.ispc
View File

@@ -84,7 +84,7 @@ void mergeSortGangKernel(
s_key[programIndex + programCount] = srcKey[base + programIndex + programCount]; s_key[programIndex + programCount] = srcKey[base + programIndex + programCount];
s_val[programIndex + programCount] = srcVal[base + programIndex + programCount]; s_val[programIndex + programCount] = srcVal[base + programIndex + programCount];
for (uniform int stride = 1; stride < programCount; stride <<= 1) for (uniform int stride = 1; stride < 2*programCount; stride <<= 1)
{ {
const int lPos = programIndex & (stride - 1); const int lPos = programIndex & (stride - 1);
uniform int *baseKey = s_key + 2 * (programIndex - lPos); uniform int *baseKey = s_key + 2 * (programIndex - lPos);
@@ -480,7 +480,6 @@ void mergeSort(
for (uniform int stride = 2*programCount; stride < N; stride <<= 1) for (uniform int stride = 2*programCount; stride < N; stride <<= 1)
{ {
// print ("stride= % N= % \n", stride, N);
uniform int lastSegmentElements = N % (2 * stride); uniform int lastSegmentElements = N % (2 * stride);
//Find sample ranks and prepare for limiters merge //Find sample ranks and prepare for limiters merge