Lines Matching refs:minX1
128 int minX1 = std::max(-maxD, 0), maxX1 = width + std::min(minD, 0);
129 int minX2 = std::max(minX1 - maxD, 0), maxX2 = std::min(maxX1 - minD, width);
130 int D = maxD - minD, width1 = maxX1 - minX1, width2 = maxX2 - minX2;
181 cost -= minX1*D + minD; // simplify the cost indices inside the loop
206 for( x = minX1; x < maxX1; x++ )
256 for( x = minX1; x < maxX1; x++ )
343 int minX1 = std::max(-maxD, 0), maxX1 = width + std::min(minD, 0);
344 int D = maxD - minD, width1 = maxX1 - minX1;
355 if( minX1 >= maxX1 )
788 int _x2 = x + minX1 - d - minD;
805 disp1ptr[x + minX1] = (DispType)(d + minD*DISP_SCALE);
808 for( x = minX1; x < maxX1; x++ )
1129 int x, minX1 = std::max(maxD, 0), maxX1 = cols + std::min(minD, 0);
1157 for( x = minX1; x < maxX1; x++ )
1173 for( x = minX1; x < maxX1; x++ )
1186 for( x = minX1; x < maxX1; x++ )
