| /external/skia/src/pathops/ |
| D | SkIntersections.cpp | 18 const SkDPoint& iPt = fPt[index]; in closestTo()
56 fPt[index] = pt; in insert()
61 if (pt.roughlyEqual(fPt[index])) { in insert()
77 memmove(&fPt[index + 1], &fPt[index], sizeof(fPt[0]) * remaining); in insert()
84 fPt[index] = pt; in insert()
90 SkASSERT(fUsed <= SK_ARRAY_COUNT(fPt)); in insert()
123 fPt[0] = a.fPt[aIndex]; in merge()
124 fPt2[0] = b.fPt[bIndex]; in merge()
138 SkDVector best = fPt[result] - origin; in mostOutside()
139 SkDVector test = fPt[index] - origin; in mostOutside()
[all …]
|
| D | SkPathOpsWinding.cpp | 90 fPt = segment->ptAtT(fT); in makeTestBase()
97 SkPoint fPt; member
106 SkScalar baseXY = pt_xy(base.fPt, dir); in rayCheck()
120 if (!sideways_overlap(fBounds, base.fPt, dir)) { in rayCheck()
123 SkScalar baseXY = pt_xy(base.fPt, dir); in rayCheck()
130 SkScalar baseYX = pt_yx(base.fPt, dir); in rayCheck()
148 if (SkDPoint::ApproximatelyEqual(pt, base.fPt)) { in rayCheck()
160 && SkDPoint::RoughlyEqual(pt, base.fPt)) { in rayCheck()
179 newHit->fPt = pt; in rayCheck()
204 return a->fPt.fX < b->fPt.fX; in hit_compare_x()
[all …]
|
| D | SkDLineIntersection.cpp | 33 fPt[0] = line.ptAtT(fT[0][0]); in computePoints()
35 fPt[1] = line.ptAtT(fT[0][1]); in computePoints()
232 fPt[0].fX = xIntercept; in horizontal()
233 fPt[0].fY = y; in horizontal()
308 fPt[0].fX = x; in vertical()
309 fPt[0].fY = yIntercept; in vertical()
|
| D | SkOpSpan.cpp | 17 if (fPt != check->fPt) { in collapsed()
90 fPt = pt; in init()
190 SkASSERT(pt == ptT->fPt); in alignEnd()
208 const SkPoint& pt = ptT->fPt; in alignInner()
210 ptT->fPt = pt; in alignInner()
|
| D | SkIntersections.h | 24 sk_bzero(fPt, sizeof(fPt)); in SkIntersections()
151 return fPt[index]; in pt()
194 SkASSERT(max <= (int) SK_ARRAY_COUNT(fPt)); in setMax()
302 SkDPoint fPt[12]; // FIXME: since scans store points as SkPoint, this should also variable
|
| D | SkOpSegment.cpp | 164 const SkPoint& newPt = endPtT.fPt; in addAlignIntersection()
234 ptT->fPt = newPt; in addAlignIntersection()
339 bool ptMatch = loop->fPt == pt; in addT()
1103 if (!SkDPoint::ApproximatelyEqual(testPt, base->fPt)) { in match()
1106 return !this->ptsDisjoint(base->fT, base->fPt, testT, testPt); in match()
1272 coincident = (SkDPoint::ApproximatelyEqual(priorPtT->fPt, oppStart->fPt) || in missingCoincidence()
1273 SkDPoint::ApproximatelyEqual(priorPtT->fPt, oppEnd->fPt)) && in missingCoincidence()
1274 (SkDPoint::ApproximatelyEqual(ptT->fPt, oppStart->fPt) || in missingCoincidence()
1275 SkDPoint::ApproximatelyEqual(ptT->fPt, oppEnd->fPt)); in missingCoincidence()
1430 if (this->match(startBase, testBase->segment(), testBase->fT, testBase->fPt)) { in moveNearby()
[all …]
|
| D | SkPathOpsDebug.cpp | 87 SkPoint fPt; member
104 glitch->fPt = { SK_ScalarNaN, SK_ScalarNaN }; in recordCommon()
129 glitch->fPt = pt; in record()
137 glitch->fPt = pt; in record()
417 const SkPoint& newPt = endPtT.fPt; in debugAddAlignIntersection()
685 coincident = (SkDPoint::ApproximatelyEqual(priorPtT->fPt, oppStart->fPt) || in debugMissingCoincidence()
686 SkDPoint::ApproximatelyEqual(priorPtT->fPt, oppEnd->fPt)) && in debugMissingCoincidence()
687 (SkDPoint::ApproximatelyEqual(ptT->fPt, oppStart->fPt) || in debugMissingCoincidence()
688 SkDPoint::ApproximatelyEqual(ptT->fPt, oppEnd->fPt)); in debugMissingCoincidence()
822 if (this->match(startBase, testBase->segment(), testBase->fT, testBase->fPt)) { in debugMoveNearby()
[all …]
|
| D | SkOpSegment.h | 305 return ptsDisjoint(span.fT, span.fPt, test.fT, test.fPt); in ptsDisjoint()
309 return ptsDisjoint(span.fT, span.fPt, t, pt); in ptsDisjoint()
|
| D | SkOpSpan.h | 148 SkPoint fPt; // cache of point value at this t variable
261 return fPtT.fPt; in pt()
|
| D | SkAddIntersections.cpp | 515 if (testTAt->fPt != nextTAt->fPt) { in AddIntersectTs()
|
| D | SkOpCoincidence.cpp | 116 newPt->fPt = test->pt(); in addExpanded()
124 newPt->fPt = oTest->pt(); in addExpanded()
|
| D | SkDQuadLineIntersection.cpp | 431 fPt[index] = quad.ptAtT(fT[0][index]); in intersectRay()
|
| D | SkDConicLineIntersection.cpp | 350 fPt[index] = conic.ptAtT(fT[0][index]); in intersectRay()
|
| D | SkDCubicLineIntersection.cpp | 424 fPt[index] = cubic.ptAtT(fT[0][index]); in intersectRay()
|
| /external/skia/src/gpu/batches/ |
| D | GrAAConvexTessellator.h | 73 const SkPoint& lastPoint() const { return fPts.top().fPt; } in lastPoint()
74 const SkPoint& firstPoint() const { return fPts[0].fPt; } in firstPoint()
75 const SkPoint& point(int index) const { return fPts[index].fPt; } in point()
83 pt->fPt = newPt; in addNewPt()
115 SkPoint fPt; member
|
| /external/skia/samplecode/ |
| D | SamplePathClip.cpp | 246 SkPoint* fPt; member in EdgeClipView::VertClick
248 VertClick(SkView* view, SkPoint* pt) : MyClick(view), fPt(pt) {} in VertClick()
249 void handleMove() override { *fPt = snap(fCurr); } in handleMove()
|
| /external/skia/tests/ |
| D | PathOpsDebug.cpp | 190 fPt[index].fX, fPt[index].fY); in dump()
967 SkDebugf(" t=%1.9g pt=(%1.9g,%1.9g)%s%s", this->fT, this->fPt.fX, this->fPt.fY, in dumpBase()
|