/external/skia/src/core/ |
D | SkDistanceFieldGen.cpp | 202 float distSq = check->fDistSq - 2.0f*(distVec.fX + distVec.fY - 1.0f); in F1() local 203 if (distSq < curr->fDistSq) { in F1() 206 curr->fDistSq = distSq; in F1() 213 distSq = check->fDistSq - 2.0f*distVec.fY + 1.0f; in F1() 214 if (distSq < curr->fDistSq) { in F1() 216 curr->fDistSq = distSq; in F1() 223 distSq = check->fDistSq + 2.0f*(distVec.fX - distVec.fY + 1.0f); in F1() 224 if (distSq < curr->fDistSq) { in F1() 227 curr->fDistSq = distSq; in F1() 234 distSq = check->fDistSq - 2.0f*distVec.fX + 1.0f; in F1() [all …]
|
/external/skqp/src/core/ |
D | SkDistanceFieldGen.cpp | 202 float distSq = check->fDistSq - 2.0f*(distVec.fX + distVec.fY - 1.0f); in F1() local 203 if (distSq < curr->fDistSq) { in F1() 206 curr->fDistSq = distSq; in F1() 213 distSq = check->fDistSq - 2.0f*distVec.fY + 1.0f; in F1() 214 if (distSq < curr->fDistSq) { in F1() 216 curr->fDistSq = distSq; in F1() 223 distSq = check->fDistSq + 2.0f*(distVec.fX - distVec.fY + 1.0f); in F1() 224 if (distSq < curr->fDistSq) { in F1() 227 curr->fDistSq = distSq; in F1() 234 distSq = check->fDistSq - 2.0f*distVec.fX + 1.0f; in F1() [all …]
|
/external/skia/tests/ |
D | PathOpsLineParametetersTest.cpp | 54 double distSq = denormalizedDistance[inner]; in DEF_TEST() local 55 distSq *= distSq; in DEF_TEST() 58 if (AlmostEqualUlps(distSq, normalSquared * answersSq)) { in DEF_TEST() 65 distSq, answersSq, normalSquared); in DEF_TEST()
|
/external/skqp/tests/ |
D | PathOpsLineParametetersTest.cpp | 54 double distSq = denormalizedDistance[inner]; in DEF_TEST() local 55 distSq *= distSq; in DEF_TEST() 58 if (AlmostEqualUlps(distSq, normalSquared * answersSq)) { in DEF_TEST() 65 distSq, answersSq, normalSquared); in DEF_TEST()
|
/external/skqp/src/pathops/ |
D | SkPathOpsLine.cpp | 105 double distSq = distU.fX * distU.fX + distU.fY * distU.fY; in NearPointH() local 106 double dist = sqrt(distSq); // OPTIMIZATION: can we compare against distSq instead ? in NearPointH() 140 double distSq = distU.fX * distU.fX + distU.fY * distU.fY; in NearPointV() local 141 double dist = sqrt(distSq); // OPTIMIZATION: can we compare against distSq instead ? in NearPointV()
|
D | SkPathOpsTSect.h | 371 double distSq = (fPerpPt - cPt).lengthSquared(); in setPerp() local 373 if (dist2Sq < distSq) { in setPerp() 1471 double distSq = thisRayI.pt(index).distanceSquared(oppRayI.pt(oIndex)); in linesIntersect() local 1472 if (closest > distSq) { in linesIntersect() 1473 closest = distSq; in linesIntersect() 1490 double distSq = oppIPt.distanceSquared(iPt); in linesIntersect() local 1491 if (bestDistSq < distSq || ++loopCount > 5) { in linesIntersect() 1494 bestDistSq = distSq; in linesIntersect()
|
D | SkOpSegment.cpp | 490 double SkOpSegment::distSq(double t, const SkOpAngle* oppAngle) const { in distSq() function in SkOpSegment 1355 SkScalar distSq = SkPointPriv::DistanceToSqd(ref->fPt, check->fPt); in spansNearby() local 1356 if (distSqBest > distSq && (refSeg != check->segment() in spansNearby() 1358 distSqBest = distSq; in spansNearby()
|
D | SkPathOpsDebug.cpp | 1270 double testMidDistSq = testSegment->distSq(testMidT, next); in debugCheckNearCoincidence() 1271 double testEndDistSq = testSegment->distSq(testEndT, next); in debugCheckNearCoincidence() 1274 double distSq = testStartPt.distanceSquared(nextStartPt); in debugCheckNearCoincidence() local 1277 double nextMidDistSq = nextSegment->distSq(nextMidT, test); in debugCheckNearCoincidence() 1278 double nextEndDistSq = nextSegment->distSq(nextEndT, test); in debugCheckNearCoincidence() 1279 SkDebugf("%s distSq=%1.9g testId=%d nextId=%d\n", __FUNCTION__, distSq, in debugCheckNearCoincidence()
|
D | SkOpSegment.h | 186 double distSq(double t, const SkOpAngle* opp) const;
|
/external/skia/src/pathops/ |
D | SkPathOpsLine.cpp | 105 double distSq = distU.fX * distU.fX + distU.fY * distU.fY; in NearPointH() local 106 double dist = sqrt(distSq); // OPTIMIZATION: can we compare against distSq instead ? in NearPointH() 140 double distSq = distU.fX * distU.fX + distU.fY * distU.fY; in NearPointV() local 141 double dist = sqrt(distSq); // OPTIMIZATION: can we compare against distSq instead ? in NearPointV()
|
D | SkPathOpsTSect.h | 371 double distSq = (fPerpPt - cPt).lengthSquared(); in setPerp() local 373 if (dist2Sq < distSq) { in setPerp() 1471 double distSq = thisRayI.pt(index).distanceSquared(oppRayI.pt(oIndex)); in linesIntersect() local 1472 if (closest > distSq) { in linesIntersect() 1473 closest = distSq; in linesIntersect() 1490 double distSq = oppIPt.distanceSquared(iPt); in linesIntersect() local 1491 if (bestDistSq < distSq || ++loopCount > 5) { in linesIntersect() 1494 bestDistSq = distSq; in linesIntersect()
|
D | SkOpSegment.cpp | 490 double SkOpSegment::distSq(double t, const SkOpAngle* oppAngle) const { in distSq() function in SkOpSegment 1355 SkScalar distSq = SkPointPriv::DistanceToSqd(ref->fPt, check->fPt); in spansNearby() local 1356 if (distSqBest > distSq && (refSeg != check->segment() in spansNearby() 1358 distSqBest = distSq; in spansNearby()
|
D | SkPathOpsDebug.cpp | 1270 double testMidDistSq = testSegment->distSq(testMidT, next); in debugCheckNearCoincidence() 1271 double testEndDistSq = testSegment->distSq(testEndT, next); in debugCheckNearCoincidence() 1274 double distSq = testStartPt.distanceSquared(nextStartPt); in debugCheckNearCoincidence() local 1277 double nextMidDistSq = nextSegment->distSq(nextMidT, test); in debugCheckNearCoincidence() 1278 double nextEndDistSq = nextSegment->distSq(nextEndT, test); in debugCheckNearCoincidence() 1279 SkDebugf("%s distSq=%1.9g testId=%d nextId=%d\n", __FUNCTION__, distSq, in debugCheckNearCoincidence()
|
D | SkOpSegment.h | 186 double distSq(double t, const SkOpAngle* opp) const;
|
/external/skqp/src/gpu/ |
D | GrDistanceFieldGenFromVector.cpp | 689 const float distSq = dataPtr[idx].fDistSq; in calculate_distance_field_data() local 690 int dilation = distSq < 1.5 * 1.5 ? 1 : in calculate_distance_field_data() 691 distSq < 2.5 * 2.5 ? 2 : in calculate_distance_field_data() 692 distSq < 3.5 * 3.5 ? 3 : SK_DistanceFieldPad; in calculate_distance_field_data() 714 if (currDistSq < distSq) { in calculate_distance_field_data()
|
/external/skia/src/gpu/ |
D | GrDistanceFieldGenFromVector.cpp | 689 const float distSq = dataPtr[idx].fDistSq; in calculate_distance_field_data() local 690 int dilation = distSq < 1.5 * 1.5 ? 1 : in calculate_distance_field_data() 691 distSq < 2.5 * 2.5 ? 2 : in calculate_distance_field_data() 692 distSq < 3.5 * 3.5 ? 3 : SK_DistanceFieldPad; in calculate_distance_field_data() 714 if (currDistSq < distSq) { in calculate_distance_field_data()
|
/external/skqp/src/utils/ |
D | SkShadowTessellator.cpp | 862 SkScalar distSq = SkPointPriv::DistanceToLineSegmentBetweenSqd(fCentroid, currPoint, in SkSpotShadowTessellator() local 864 if (distSq < minDistSq) { in SkSpotShadowTessellator() 865 minDistSq = distSq; in SkSpotShadowTessellator() 1199 SkScalar distSq = SkPointPriv::DistanceToSqd(p0, p1); in duplicate_pt() local 1200 return distSq < kCloseSqd; in duplicate_pt()
|
/external/skia/src/utils/ |
D | SkShadowTessellator.cpp | 882 SkScalar distSq = SkPointPriv::DistanceToLineSegmentBetweenSqd(fCentroid, currPoint, in SkSpotShadowTessellator() local 884 if (distSq < minDistSq) { in SkSpotShadowTessellator() 885 minDistSq = distSq; in SkSpotShadowTessellator() 1219 SkScalar distSq = SkPointPriv::DistanceToSqd(p0, p1); in duplicate_pt() local 1220 return distSq < kCloseSqd; in duplicate_pt()
|
/external/skqp/src/gpu/ops/ |
D | GrAAConvexTessellator.cpp | 58 SkScalar distSq = SkPointPriv::DistanceToSqd(p0, p1); in duplicate_pt() local 59 return distSq < kCloseSqd; in duplicate_pt()
|
/external/skia/src/gpu/ops/ |
D | GrAAConvexTessellator.cpp | 58 SkScalar distSq = SkPointPriv::DistanceToSqd(p0, p1); in duplicate_pt() local 59 return distSq < kCloseSqd; in duplicate_pt()
|