Lines Matching full:cols

61 …           __local int * bestDisp, __local int * bestCost, int d, int x, int y, int cols, int rows)
74     if( *bestCost != FILTERED && x < cols - WSZ2 - MIN_DISP && y < rows - WSZ2 && d == best_disp)
89                      short * costbuf, int *h, int cols, int d, short cost)
93     int idx = mad24(y + WSZ2 * (2 * nthread - 1), cols, x + WSZ2 * (1 - 2 * nthread));
104             left += cols;
105             right += cols;
123                      int cols, int d, short cost_up_left, short cost_up, short cost_left)
126     int idx = mad24(y - WSZ2 - 1, cols, x - WSZ2 - 1);
129     int idx2 = WSZ*cols;
143 …int rows, int cols,                                              // rows, cols of left and right i…
177     if (x < cols - WSZ2 - MIN_DISP && y < rows - WSZ2)
184                 int idx = mad24(y - WSZ2, cols, x - WSZ2 + i);
191                     left += cols;
192                     right += cols;
202                 int idx = mad24(y - WSZ2 + i, cols, x - WSZ2);
228     calcDisp(cost, disp, uniquenessRatio, best_disp + 1, best_cost + 1, disp_idx, x, y, cols, rows);
236         x = (lx < BLOCK_SIZE_X) ? gx + shiftX + lx : cols;
247         if (x < cols - WSZ2 - MIN_DISP && y < rows - WSZ2)
250 …calcCostBorder(leftptr, rightptr, x, y, nthread, costbuf, &head, cols, disp_idx, cost[2*nthread-1]…
251                 calcCostInside(leftptr, rightptr, x, y, cols, disp_idx, cost[0], cost[1], cost[-1]);
263 …cost, disp, uniquenessRatio, best_disp + nthread, best_cost + nthread, disp_idx, x, y, cols, rows);
286                                int rows, int cols, int prefilterCap, int scale_g, int scale_s)
293     if(x < cols && y < rows)
295         int cov1 =                                   input[   max(y-1, 0)   * cols + x] * 1 +
296 …input[y * cols + max(x-1,0)] * 1 + input[      y          * cols + x] * 4 + input[y * cols + min(x…
297                                                      input[min(y+1, rows-1) * cols + x] * 1;
301                 cov2 += input[clamp(y+i, 0, rows-1) * cols + clamp(x+j, 0, cols-1)];
305         output[y * cols + x] = res;
315                                int rows, int cols, int prefilterCap)
320     if(x < cols && y < rows)
324 …nt cov = input[ ((y > 0) ? y-1 : y+1)  * cols + (x-1)] * (-1) + input[ ((y > 0) ? y-1 : y+1)  * co…
325 …input[              (y)       * cols + (x-1)] * (-2) + input[        (y)             * cols + ((x<…
326 …input[((y<rows-1)?(y+1):(y-1))* cols + (x-1)] * (-1) + input[((y<rows-1)?(y+1):(y-1))* cols + ((x<…
329             output[y * cols + x] = cov;
332             output[y * cols + x] = prefilterCap;