| /third_party/skia/src/pathops/ |
| H A D | SkIntersections.cpp | 18 const SkDPoint& iPt = fPt[index]; in closestTo()
58 memmove(&fPt[index], &fPt[index + 1], sizeof(fPt[0]) * remaining); in insert()
68 if (pt.roughlyEqual(fPt[index])) { in insert()
86 memmove(&fPt[index + 1], &fPt[index], sizeof(fPt[0]) * remaining); in insert()
93 fPt[index] = pt; in insert()
103 SkASSERT(fUsed <= SK_ARRAY_COUNT(fPt)); in insert()
[all...] |
| H A D | SkPathOpsWinding.cpp | 93 fPt = segment->ptAtT(fT); in makeTestBase()
100 SkPoint fPt; member
109 SkScalar baseXY = pt_xy(base.fPt, dir); in rayCheck()
123 if (!sideways_overlap(fBounds, base.fPt, dir)) { in rayCheck()
126 SkScalar baseXY = pt_xy(base.fPt, dir); in rayCheck()
133 SkScalar baseYX = pt_yx(base.fPt, dir); in rayCheck()
151 if (SkDPoint::ApproximatelyEqual(pt, base.fPt)) { in rayCheck()
163 && SkDPoint::RoughlyEqual(pt, base.fPt)) { in rayCheck()
182 newHit->fPt = pt; in rayCheck()
207 return a->fPt in hit_compare_x()
[all...] |
| H A D | SkPathWriter.cpp | 121 SkDebugf("path.lineTo(%1.9g,%1.9g);\n", fDefer[1]->fPt.fX, fDefer[1]->fPt.fY); in lineTo()
123 fCurrent.lineTo(fDefer[1]->fPt); in lineTo()
141 SkDebugf("path.moveTo(%1.9g,%1.9g);\n", fFirstPtT->fPt.fX, fFirstPtT->fPt.fY); in moveTo()
143 fCurrent.moveTo(fFirstPtT->fPt); in moveTo()
163 SkPoint result = pt->fPt; in update()
164 if (fFirstPtT && result != fFirstPtT->fPt && fFirstPtT->contains(pt)) { in update()
165 result = fFirstPtT->fPt; in update()
180 SkVector deferDxdy = fDefer[1]->fPt in changedSlopes()
[all...] |
| H A D | SkDLineIntersection.cpp | 35 fPt[0] = line.ptAtT(fT[0][0]); in computePoints()
37 fPt[1] = line.ptAtT(fT[0][1]); in computePoints()
236 fPt[0].fX = xIntercept; in horizontal()
237 fPt[0].fY = y; in horizontal()
314 fPt[0].fX = x; in vertical()
315 fPt[0].fY = yIntercept; in vertical()
|
| H A D | SkIntersections.h | 25 sk_bzero(fPt, sizeof(fPt));
161 return fPt[index]; in pt()
203 SkASSERT(max <= (int) SK_ARRAY_COUNT(fPt)); in setMax()
315 SkDPoint fPt[13]; // FIXME: since scans store points as SkPoint, this should also member in SkIntersections
|
| H A D | SkOpSegment.cpp | 217 if (loop->segment() == this && loop->fT == t && loop->fPt == pt) { in existing()
240 newPtT->fPt = this->ptAtT(newT); in addExpanded()
1058 if (!SkDPoint::ApproximatelyEqual(testPt, base->fPt)) { in match()
1061 return this != testParent || !this->ptsDisjoint(base->fT, base->fPt, testT, testPt); in match()
1369 if (!SkDPoint::WayRoughlyEqual(refHead->fPt, checkHead->fPt)) { in spansNearby()
1376 SkOPASSERT(!SkDPoint::ApproximatelyEqual(dBugRef->fPt, dBugCheck->fPt)); in spansNearby()
1413 SkScalar distSq = SkPointPriv::DistanceToSqd(ref->fPt, check->fPt); in spansNearby()
[all...] |
| H A D | SkOpSpan.cpp | 47 if (ptT->fPt == pt && ptT->segment() == segment) { in contains()
100 fPt = pt; in init()
120 if (this->fPt == check->fPt) { in ptAlreadySeen()
|
| H A D | SkOpSegment.h | 323 return ptsDisjoint(span.fT, span.fPt, test.fT, test.fPt); in ptsDisjoint()
328 return ptsDisjoint(span.fT, span.fPt, t, pt); in ptsDisjoint()
|
| H A D | SkPathOpsDebug.cpp | 91 SkPoint fPt; member
116 glitch->fPt = { SK_ScalarNaN, SK_ScalarNaN }; in recordCommon()
152 glitch->fPt = pt; in record()
160 glitch->fPt = pt; in record()
419 if (!SkScalarIsNaN(glitch.fPt.fX) || !SkScalarIsNaN(glitch.fPt.fY)) { in CheckHealth()
420 SkDebugf(" pt=%g,%g", glitch.fPt.fX, glitch.fPt.fY); in CheckHealth()
1169 const SkPoint& pt = span->ptT()->fPt; in debugShowNewWinding()
1193 const SkPoint& pt = span->ptT()->fPt; in debugShowNewWinding()
[all...] |
| H A D | SkOpSpan.h | 167 SkPoint fPt; // cache of point value at this t member in SkOpPtT
307 return fPtT.fPt; in pt()
|
| H A D | SkAddIntersections.cpp | 531 if (testTAt->fPt != nextTAt->fPt) { in AddIntersectTs()
|
| H A D | SkOpCoincidence.cpp | 393 if (span->coinPtTStart()->fPt != span->oppPtTStart()->fPt) { in DEBUG_COIN_DECLARE_ONLY_PARAMS()
409 if (span->coinPtTEnd()->fPt != span->oppPtTEnd()->fPt) { in DEBUG_COIN_DECLARE_ONLY_PARAMS()
|
| H A D | SkDCubicLineIntersection.cpp | 442 fPt[index] = cubic.ptAtT(fT[0][index]); in intersectRay()
|
| H A D | SkDQuadLineIntersection.cpp | 447 fPt[index] = quad.ptAtT(fT[0][index]); in intersectRay()
|
| H A D | SkDConicLineIntersection.cpp | 371 fPt[index] = conic.ptAtT(fT[0][index]); in intersectRay()
|
| /third_party/skia/docs/examples/ |
| H A D | Point_iset_2.cpp | 8 SkPoint fPt; in REG_FIDDLE() local
9 fPt.iset(iPt); in REG_FIDDLE()
11 SkDebugf("fPt: %g, %g\n", fPt.fX, fPt.fY); in REG_FIDDLE()
|
| /third_party/skia/src/gpu/geometry/ |
| H A D | GrAAConvexTessellator.h | 76 const SkPoint& lastPoint() const { return fPts.top().fPt; } in lastPoint()
77 const SkPoint& firstPoint() const { return fPts[0].fPt; } in firstPoint()
78 const SkPoint& point(int index) const { return fPts[index].fPt; } in point()
86 pt->fPt = newPt; in addNewPt()
118 SkPoint fPt; member
|
| /third_party/skia/gm/ |
| H A D | simple_magnification.cpp | 39 SkPoint fPt; in make_image() member
50 canvas->drawPoints(SkCanvas::kPoints_PointMode, 1, &r.fPt, paint); in make_image()
|
| /third_party/skia/samplecode/ |
| H A D | SamplePathClip.cpp | 233 SkPoint* fPt; member in EdgeClipView::VertClick
235 VertClick(SkPoint* pt) : fPt(pt) {} in VertClick()
236 void handleMove() override { *fPt = snap(fCurr); }
|
| /third_party/skia/tests/ |
| H A D | PathOpsDebug.cpp | 211 fPt[index].fX, fPt[index].fY); in dump()
692 SkDebugf(" t=%1.9g pt=(%1.9g,%1.9g)%s%s%s", this->fT, this->fPt.fX, this->fPt.fY, in dumpBase()
|