Lines Matching refs:bdx

52 #define bdx blockDim.x  macro
71 const int x = bx * (bdx - 2*polyN) + tx - polyN; in polynomialExpansion()
80 row[bdx] = 0.f; in polynomialExpansion()
81 row[2*bdx] = 0.f; in polynomialExpansion()
89 row[bdx] += c_xg[k] * (t1 - t0); in polynomialExpansion()
90 row[2*bdx] += c_xxg[k] * (t0 + t1); in polynomialExpansion()
95 if (tx >= polyN && tx + polyN < bdx && x < width) in polynomialExpansion()
98 float b3 = c_g[0] * row[bdx]; in polynomialExpansion()
99 float b5 = c_g[0] * row[2*bdx]; in polynomialExpansion()
107 b3 += (row[k + bdx] + row[-k + bdx]) * c_g[k]; in polynomialExpansion()
108 b6 += (row[k + bdx] - row[-k + bdx]) * c_xg[k]; in polynomialExpansion()
109 b5 += (row[k + 2*bdx] + row[-k + 2*bdx]) * c_g[k]; in polynomialExpansion()
161 const int x = bx * bdx + tx; in updateMatrices()
271 const int x = bx * bdx + tx; in updateFlow()
362 const int x = bx * bdx + tx; in boxFilter5()
366 const int smw = bdx + 2*ksizeHalf; // shared memory "width" in boxFilter5()
372 for (int i = tx; i < bdx + 2*ksizeHalf; i += bdx) in boxFilter5()
374 int xExt = int(bx * bdx) + i - ksizeHalf; in boxFilter5()
461 const int x = bx * bdx + tx; in gaussianBlur()
464 volatile float *row = smem + ty * (bdx + 2*ksizeHalf); in gaussianBlur()
469 for (int i = tx; i < bdx + 2*ksizeHalf; i += bdx) in gaussianBlur()
471 int xExt = int(bx * bdx) + i - ksizeHalf; in gaussianBlur()
545 const int x = bx * bdx + tx; in gaussianBlur5()
549 const int smw = bdx + 2*ksizeHalf; // shared memory "width" in gaussianBlur5()
555 for (int i = tx; i < bdx + 2*ksizeHalf; i += bdx) in gaussianBlur5()
557 int xExt = int(bx * bdx) + i - ksizeHalf; in gaussianBlur5()