| /external/skia/src/pathops/ |
| SkIntersections.cpp | 18 const SkDPoint& iPt = fPt[index];
56 fPt[index] = pt;
61 if (pt.roughlyEqual(fPt[index])) {
77 memmove(&fPt[index + 1], &fPt[index], sizeof(fPt[0]) * remaining);
84 fPt[index] = pt;
90 SkASSERT(fUsed <= SK_ARRAY_COUNT(fPt));
123 fPt[0] = a.fPt[aIndex]
[all...] |
| SkPathOpsWinding.cpp | 90 fPt = segment->ptAtT(fT);
97 SkPoint fPt;
106 SkScalar baseXY = pt_xy(base.fPt, dir);
120 if (!sideways_overlap(fBounds, base.fPt, dir)) {
123 SkScalar baseXY = pt_xy(base.fPt, dir);
130 SkScalar baseYX = pt_yx(base.fPt, dir);
148 if (SkDPoint::ApproximatelyEqual(pt, base.fPt)) {
160 && SkDPoint::RoughlyEqual(pt, base.fPt)) {
179 newHit->fPt = pt;
204 return a->fPt.fX < b->fPt.fX
[all...] |
| SkIntersections.h | 24 sk_bzero(fPt, sizeof(fPt));
151 return fPt[index];
194 SkASSERT(max <= (int) SK_ARRAY_COUNT(fPt));
302 SkDPoint fPt[12]; // FIXME: since scans store points as SkPoint, this should also
|
| SkDLineIntersection.cpp | 33 fPt[0] = line.ptAtT(fT[0][0]);
35 fPt[1] = line.ptAtT(fT[0][1]);
232 fPt[0].fX = xIntercept;
233 fPt[0].fY = y;
308 fPt[0].fX = x;
309 fPt[0].fY = yIntercept;
|
| SkOpSpan.cpp | 17 if (fPt != check->fPt) {
90 fPt = pt;
190 SkASSERT(pt == ptT->fPt);
208 const SkPoint& pt = ptT->fPt;
210 ptT->fPt = pt;
|
| SkPathOpsDebug.cpp | 87 SkPoint fPt;
104 glitch->fPt = { SK_ScalarNaN, SK_ScalarNaN };
129 glitch->fPt = pt;
137 glitch->fPt = pt;
417 const SkPoint& newPt = endPtT.fPt;
685 coincident = (SkDPoint::ApproximatelyEqual(priorPtT->fPt, oppStart->fPt) ||
686 SkDPoint::ApproximatelyEqual(priorPtT->fPt, oppEnd->fPt)) &&
687 (SkDPoint::ApproximatelyEqual(ptT->fPt, oppStart->fPt) |
[all...] |
| SkOpSegment.cpp | 164 const SkPoint& newPt = endPtT.fPt;
234 ptT->fPt = newPt;
339 bool ptMatch = loop->fPt == pt;
[all...] |
| SkOpSegment.h | 305 return ptsDisjoint(span.fT, span.fPt, test.fT, test.fPt);
309 return ptsDisjoint(span.fT, span.fPt, t, pt);
|
| SkOpSpan.h | 148 SkPoint fPt; // cache of point value at this t
261 return fPtT.fPt;
|
| SkDConicLineIntersection.cpp | 350 fPt[index] = conic.ptAtT(fT[0][index]);
|
| SkDCubicLineIntersection.cpp | 424 fPt[index] = cubic.ptAtT(fT[0][index]);
|
| SkDQuadLineIntersection.cpp | 431 fPt[index] = quad.ptAtT(fT[0][index]);
|
| SkAddIntersections.cpp | 515 if (testTAt->fPt != nextTAt->fPt) {
|
| SkOpCoincidence.cpp | 116 newPt->fPt = test->pt();
124 newPt->fPt = oTest->pt();
|
| /external/skia/src/gpu/batches/ |
| GrAAConvexTessellator.h | 73 const SkPoint& lastPoint() const { return fPts.top().fPt; }
74 const SkPoint& firstPoint() const { return fPts[0].fPt; }
75 const SkPoint& point(int index) const { return fPts[index].fPt; }
83 pt->fPt = newPt;
115 SkPoint fPt;
|
| /external/skia/samplecode/ |
| SamplePathClip.cpp | 246 SkPoint* fPt;
248 VertClick(SkView* view, SkPoint* pt) : MyClick(view), fPt(pt) {}
249 void handleMove() override { *fPt = snap(fCurr); }
|
| /external/skia/tests/ |
| PathOpsDebug.cpp | 190 fPt[index].fX, fPt[index].fY);
967 SkDebugf(" t=%1.9g pt=(%1.9g,%1.9g)%s%s", this->fT, this->fPt.fX, this->fPt.fY,
[all...] |
