/external/skia/src/pathops/ |
SkIntersections.cpp | 18 const SkDPoint& iPt = fPt[index]; 58 memmove(&fPt[index], &fPt[index + 1], sizeof(fPt[0]) * remaining); 68 if (pt.roughlyEqual(fPt[index])) { 86 memmove(&fPt[index + 1], &fPt[index], sizeof(fPt[0]) * remaining); 93 fPt[index] = pt; 103 SkASSERT(fUsed <= SK_ARRAY_COUNT(fPt)); [all...] |
SkPathOpsWinding.cpp | 92 fPt = segment->ptAtT(fT); 99 SkPoint fPt; 108 SkScalar baseXY = pt_xy(base.fPt, dir); 122 if (!sideways_overlap(fBounds, base.fPt, dir)) { 125 SkScalar baseXY = pt_xy(base.fPt, dir); 132 SkScalar baseYX = pt_yx(base.fPt, dir); 150 if (SkDPoint::ApproximatelyEqual(pt, base.fPt)) { 162 && SkDPoint::RoughlyEqual(pt, base.fPt)) { 181 newHit->fPt = pt; 206 return a->fPt.fX < b->fPt.fX [all...] |
SkPathWriter.cpp | 121 SkDebugf("path.lineTo(%1.9g,%1.9g);\n", fDefer[1]->fPt.fX, fDefer[1]->fPt.fY); 123 fCurrent.lineTo(fDefer[1]->fPt); 141 SkDebugf("path.moveTo(%1.9g,%1.9g);\n", fFirstPtT->fPt.fX, fFirstPtT->fPt.fY); 143 fCurrent.moveTo(fFirstPtT->fPt); 163 SkPoint result = pt->fPt; 164 if (fFirstPtT && result != fFirstPtT->fPt && fFirstPtT->contains(pt)) { 165 result = fFirstPtT->fPt; 180 SkVector deferDxdy = fDefer[1]->fPt - fDefer[0]->fPt [all...] |
SkDLineIntersection.cpp | 35 fPt[0] = line.ptAtT(fT[0][0]); 37 fPt[1] = line.ptAtT(fT[0][1]); 236 fPt[0].fX = xIntercept; 237 fPt[0].fY = y; 314 fPt[0].fX = x; 315 fPt[0].fY = yIntercept;
|
SkIntersections.h | 25 sk_bzero(fPt, sizeof(fPt)); 161 return fPt[index]; 203 SkASSERT(max <= (int) SK_ARRAY_COUNT(fPt)); 315 SkDPoint fPt[13]; // FIXME: since scans store points as SkPoint, this should also
|
SkOpSpan.cpp | 47 if (ptT->fPt == pt && ptT->segment() == segment) { 100 fPt = pt; 120 if (this->fPt == check->fPt) {
|
SkOpSegment.cpp | 217 if (loop->segment() == this && loop->fT == t && loop->fPt == pt) { 240 newPtT->fPt = this->ptAtT(newT); [all...] |
SkOpSegment.h | 323 return ptsDisjoint(span.fT, span.fPt, test.fT, test.fPt); 328 return ptsDisjoint(span.fT, span.fPt, t, pt);
|
SkOpSpan.h | 167 SkPoint fPt; // cache of point value at this t 307 return fPtT.fPt;
|
SkPathOpsDebug.cpp | 91 SkPoint fPt; 116 glitch->fPt = { SK_ScalarNaN, SK_ScalarNaN }; 152 glitch->fPt = pt; 160 glitch->fPt = pt; 419 if (!SkScalarIsNaN(glitch.fPt.fX) || !SkScalarIsNaN(glitch.fPt.fY)) { 420 SkDebugf(" pt=%g,%g", glitch.fPt.fX, glitch.fPt.fY); [all...] |
/external/skqp/src/pathops/ |
SkIntersections.cpp | 18 const SkDPoint& iPt = fPt[index]; 58 memmove(&fPt[index], &fPt[index + 1], sizeof(fPt[0]) * remaining); 68 if (pt.roughlyEqual(fPt[index])) { 86 memmove(&fPt[index + 1], &fPt[index], sizeof(fPt[0]) * remaining); 93 fPt[index] = pt; 103 SkASSERT(fUsed <= SK_ARRAY_COUNT(fPt)); [all...] |
SkPathOpsWinding.cpp | 92 fPt = segment->ptAtT(fT); 99 SkPoint fPt; 108 SkScalar baseXY = pt_xy(base.fPt, dir); 122 if (!sideways_overlap(fBounds, base.fPt, dir)) { 125 SkScalar baseXY = pt_xy(base.fPt, dir); 132 SkScalar baseYX = pt_yx(base.fPt, dir); 150 if (SkDPoint::ApproximatelyEqual(pt, base.fPt)) { 162 && SkDPoint::RoughlyEqual(pt, base.fPt)) { 181 newHit->fPt = pt; 206 return a->fPt.fX < b->fPt.fX [all...] |
SkPathWriter.cpp | 121 SkDebugf("path.lineTo(%1.9g,%1.9g);\n", fDefer[1]->fPt.fX, fDefer[1]->fPt.fY); 123 fCurrent.lineTo(fDefer[1]->fPt); 141 SkDebugf("path.moveTo(%1.9g,%1.9g);\n", fFirstPtT->fPt.fX, fFirstPtT->fPt.fY); 143 fCurrent.moveTo(fFirstPtT->fPt); 163 SkPoint result = pt->fPt; 164 if (fFirstPtT && result != fFirstPtT->fPt && fFirstPtT->contains(pt)) { 165 result = fFirstPtT->fPt; 180 SkVector deferDxdy = fDefer[1]->fPt - fDefer[0]->fPt [all...] |
SkDLineIntersection.cpp | 35 fPt[0] = line.ptAtT(fT[0][0]); 37 fPt[1] = line.ptAtT(fT[0][1]); 236 fPt[0].fX = xIntercept; 237 fPt[0].fY = y; 314 fPt[0].fX = x; 315 fPt[0].fY = yIntercept;
|
SkIntersections.h | 25 sk_bzero(fPt, sizeof(fPt)); 161 return fPt[index]; 203 SkASSERT(max <= (int) SK_ARRAY_COUNT(fPt)); 315 SkDPoint fPt[13]; // FIXME: since scans store points as SkPoint, this should also
|
SkOpSpan.cpp | 47 if (ptT->fPt == pt && ptT->segment() == segment) { 100 fPt = pt; 120 if (this->fPt == check->fPt) {
|
SkOpSegment.cpp | 217 if (loop->segment() == this && loop->fT == t && loop->fPt == pt) { 240 newPtT->fPt = this->ptAtT(newT); [all...] |
SkOpSegment.h | 323 return ptsDisjoint(span.fT, span.fPt, test.fT, test.fPt); 328 return ptsDisjoint(span.fT, span.fPt, t, pt);
|
SkOpSpan.h | 167 SkPoint fPt; // cache of point value at this t 307 return fPtT.fPt;
|
/external/skia/src/gpu/ops/ |
GrAAConvexTessellator.h | 76 const SkPoint& lastPoint() const { return fPts.top().fPt; } 77 const SkPoint& firstPoint() const { return fPts[0].fPt; } 78 const SkPoint& point(int index) const { return fPts[index].fPt; } 86 pt->fPt = newPt; 118 SkPoint fPt;
|
/external/skqp/src/gpu/ops/ |
GrAAConvexTessellator.h | 76 const SkPoint& lastPoint() const { return fPts.top().fPt; } 77 const SkPoint& firstPoint() const { return fPts[0].fPt; } 78 const SkPoint& point(int index) const { return fPts[index].fPt; } 86 pt->fPt = newPt; 118 SkPoint fPt;
|
/external/skia/gm/ |
simple_magnification.cpp | 27 SkPoint fPt; 38 canvas->drawPoints(SkCanvas::kPoints_PointMode, 1, &r.fPt, paint);
|
/external/skqp/gm/ |
simple_magnification.cpp | 27 SkPoint fPt; 38 canvas->drawPoints(SkCanvas::kPoints_PointMode, 1, &r.fPt, paint);
|
/external/skia/samplecode/ |
SamplePathClip.cpp | 247 SkPoint* fPt; 249 VertClick(Sample* view, SkPoint* pt) : MyClick(view), fPt(pt) {} 250 void handleMove() override { *fPt = snap(fCurr); }
|
/external/skqp/samplecode/ |
SamplePathClip.cpp | 247 SkPoint* fPt; 249 VertClick(Sample* view, SkPoint* pt) : MyClick(view), fPt(pt) {} 250 void handleMove() override { *fPt = snap(fCurr); }
|