| /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;
122 fPt[0] = a.fPt[aIndex];
123 fPt2[0] = b.fPt[bIndex]
[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...] |
| SkConicLineIntersection.cpp | 34 fPt[index] = conic.ptAtT(fT[0][index]);
|
| SkDLineIntersection.cpp | 28 fPt[0] = line.ptAtT(fT[0][0]);
30 fPt[1] = line.ptAtT(fT[0][1]);
227 fPt[0].fX = xIntercept;
228 fPt[0].fY = y;
303 fPt[0].fX = x;
304 fPt[0].fY = yIntercept;
|
| SkIntersections.h | 24 sk_bzero(fPt, sizeof(fPt));
148 return fPt[index];
289 SkDPoint fPt[10]; // FIXME: since scans store points as SkPoint, this should also
|
| SkOpSpan.cpp | 26 fPt = pt;
126 SkASSERT(pt == ptT->fPt);
144 const SkPoint& pt = ptT->fPt;
146 ptT->fPt = pt;
|
| SkOpSegment.h | 278 return ptsDisjoint(span.fT, span.fPt, test.fT, test.fPt);
282 return ptsDisjoint(span.fT, span.fPt, t, pt);
|
| SkPathOpsDebug.cpp | 201 SkDebugf(") t=%1.9g (%1.9g,%1.9g)", ptT->fT, ptT->fPt.fX, ptT->fPt.fY);
224 const SkPoint& pt = span->ptT()->fPt;
248 const SkPoint& pt = span->ptT()->fPt;
462 // SkASSERT(SkDPoint::RoughlyEqual(fPtT.fPt, ptT->fPt));
|
| SkPathOpsPostSect.cpp | 26 fPt = pt;
170 SkASSERT(pt == ptT->fPt);
188 const SkPoint& pt = ptT->fPt;
190 ptT->fPt = pt;
|
| SkOpSpan.h | 116 SkPoint fPt; // cache of point value at this t
225 return fPtT.fPt;
|
| SkOpSegment.cpp | 256 bool ptMatch = loop->fPt == pt;
[all...] |
| 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 | 512 if (testTAt->fPt != nextTAt->fPt) {
|
| /external/skia/src/gpu/ |
| GrAAConvexTessellator.h | 68 const SkPoint& lastPoint() const { return fPts.top().fPt; }
69 const SkPoint& firstPoint() const { return fPts[0].fPt; }
70 const SkPoint& point(int index) const { return fPts[index].fPt; }
78 pt->fPt = newPt;
110 SkPoint fPt;
|
| /external/skia/tests/ |
| PathOpsDebug.cpp | 193 fPt[index].fX, fPt[index].fY);
896 SkDebugf(" t=%1.9g pt=(%1.9g,%1.9g)%s%s", this->fT, this->fPt.fX, this->fPt.fY,
[all...] |
