Lines Matching defs:searchStep

291 								  const float				searchStep,
296 DE_ASSERT(xBounds.x() + searchStep > xBounds.x()); // step is not effectively 0
297 DE_ASSERT(xBounds.y() + searchStep > xBounds.y());
302 for (float x = xBounds.x(); x < xBounds.y()+searchStep; x += searchStep)
321 const float searchStep,
327 DE_ASSERT(xBounds.x() + searchStep > xBounds.x()); // step is not effectively 0
328 DE_ASSERT(xBounds.y() + searchStep > xBounds.y());
329 DE_ASSERT(yBounds.x() + searchStep > yBounds.x());
330 DE_ASSERT(yBounds.y() + searchStep > yBounds.y());
335 for (float x = xBounds.x(); x < xBounds.y()+searchStep; x += searchStep)
337 for (float y = yBounds.x(); y < yBounds.y()+searchStep; y += searchStep)
403 const float searchStep,
408 DE_ASSERT(xBounds0.x() + searchStep > xBounds0.x()); // step is not effectively 0
409 DE_ASSERT(xBounds0.y() + searchStep > xBounds0.y());
410 DE_ASSERT(xBounds1.x() + searchStep > xBounds1.x());
411 DE_ASSERT(xBounds1.y() + searchStep > xBounds1.y());
416 for (float x0 = xBounds0.x(); x0 < xBounds0.y()+searchStep; x0 += searchStep)
421 for (float x1 = xBounds1.x(); x1 <= xBounds1.y(); x1 += searchStep)
442 const float searchStep,
449 DE_ASSERT(xBounds0.x() + searchStep > xBounds0.x()); // step is not effectively 0
450 DE_ASSERT(xBounds0.y() + searchStep > xBounds0.y());
451 DE_ASSERT(yBounds0.x() + searchStep > yBounds0.x());
452 DE_ASSERT(yBounds0.y() + searchStep > yBounds0.y());
453 DE_ASSERT(xBounds1.x() + searchStep > xBounds1.x());
454 DE_ASSERT(xBounds1.y() + searchStep > xBounds1.y());
455 DE_ASSERT(yBounds1.x() + searchStep > yBounds1.x());
456 DE_ASSERT(yBounds1.y() + searchStep > yBounds1.y());
461 for (float x0 = xBounds0.x(); x0 < xBounds0.y()+searchStep; x0 += searchStep)
463 for (float y0 = yBounds0.x(); y0 < yBounds0.y()+searchStep; y0 += searchStep)
469 for (float x1 = xBounds1.x(); x1 <= xBounds1.y(); x1 += searchStep)
471 for (float y1 = yBounds1.x(); y1 <= yBounds1.y(); y1 += searchStep)
499 const float searchStep,
508 DE_ASSERT(xBounds0.x() + searchStep > xBounds0.x()); // step is not effectively 0
509 DE_ASSERT(xBounds0.y() + searchStep > xBounds0.y());
510 DE_ASSERT(yBounds0.x() + searchStep > yBounds0.x());
511 DE_ASSERT(yBounds0.y() + searchStep > yBounds0.y());
512 DE_ASSERT(zBounds0.x() + searchStep > zBounds0.x());
513 DE_ASSERT(zBounds0.y() + searchStep > zBounds0.y());
514 DE_ASSERT(xBounds1.x() + searchStep > xBounds1.x());
515 DE_ASSERT(xBounds1.y() + searchStep > xBounds1.y());
516 DE_ASSERT(yBounds1.x() + searchStep > yBounds1.x());
517 DE_ASSERT(yBounds1.y() + searchStep > yBounds1.y());
518 DE_ASSERT(zBounds1.x() + searchStep > zBounds1.x());
519 DE_ASSERT(zBounds1.y() + searchStep > zBounds1.y());
524 for (float x0 = xBounds0.x(); x0 < xBounds0.y()+searchStep; x0 += searchStep)
526 for (float y0 = yBounds0.x(); y0 < yBounds0.y()+searchStep; y0 += searchStep)
533 for (float z0 = zBounds0.x(); z0 < zBounds0.y()+searchStep; z0 += searchStep)
538 for (float x1 = xBounds1.x(); x1 < xBounds1.y()+searchStep; x1 += searchStep)
540 for (float y1 = yBounds1.x(); y1 < yBounds1.y()+searchStep; y1 += searchStep)
547 for (float z1 = zBounds1.x(); z1 < zBounds1.y()+searchStep; z1 += searchStep)
740 float searchStep = texClass == TEXTURECHANNELCLASS_UNSIGNED_FIXED_POINT ? computeBilinearSearchStepForUnorm(prec) :
771 searchStep = computeBilinearSearchStepFromFloatQuad(prec, quad);
775 if (isBilinearRangeValid(prec, quad, Vec2(minA, maxA), Vec2(minB, maxB), searchStep, result))
812 float searchStep = texClass == TEXTURECHANNELCLASS_UNSIGNED_FIXED_POINT ? computeBilinearSearchStepForUnorm(prec) :
850 searchStep = de::min(computeBilinearSearchStepFromFloatQuad(prec, quad0), computeBilinearSearchStepFromFloatQuad(prec, quad1));
854 if (isTrilinearRangeValid(prec, quad0, quad1, Vec2(minA, maxA), Vec2(minB, maxB), Vec2(minC, maxC), searchStep, result))
1537 float searchStep = texClass == TEXTURECHANNELCLASS_UNSIGNED_FIXED_POINT ? computeBilinearSearchStepForUnorm(prec) :
1573 searchStep = computeBilinearSearchStepFromFloatQuad(prec, quad);
1577 if (isBilinearRangeValid(prec, quad, Vec2(minA, maxA), Vec2(minB, maxB), searchStep, result))