Home
last modified time | relevance | path

Searched refs:fPt (Results 1 – 25 of 41) sorted by relevance

12

/third_party/skia/src/pathops/
DSkIntersections.cpp18 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()
136 fPt[0] = a.fPt[aIndex]; in merge()
137 fPt2[0] = b.fPt[bIndex]; in merge()
151 SkDVector best = fPt[result] - origin; in mostOutside()
152 SkDVector test = fPt[index] - origin; in mostOutside()
[all …]
DSkPathOpsWinding.cpp93 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.fX < b->fPt.fX; in hit_compare_x()
[all …]
DSkPathWriter.cpp121 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 - fDefer[0]->fPt; in changedSlopes()
181 SkVector lineDxdy = ptT->fPt - fDefer[1]->fPt; in changedSlopes()
219 eStart->fPt.fX, eStart->fPt.fY, eEnd->fPt.fX, eEnd->fPt.fY); in assemble()
[all …]
DSkDLineIntersection.cpp35 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()
DSkIntersections.h25 sk_bzero(fPt, sizeof(fPt)); in SkIntersections()
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 variable
DSkOpSegment.cpp217 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()
1429 checkBest->fPt); in spansNearby()
1624 edge->fCubic[0].set(startPtT.fPt); in subDivide()
1626 edge->fCubic[points].set(endPtT.fPt); in subDivide()
[all …]
DSkOpSpan.cpp47 if (ptT->fPt == pt && ptT->segment() == segment) { in contains()
100 fPt = pt; in init()
120 if (this->fPt == check->fPt) { in ptAlreadySeen()
DSkOpSegment.h323 return ptsDisjoint(span.fT, span.fPt, test.fT, test.fPt); in ptsDisjoint()
328 return ptsDisjoint(span.fT, span.fPt, t, pt); in ptsDisjoint()
DSkPathOpsDebug.cpp91 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()
1572 if (span->coinPtTStart()->fPt != span->oppPtTStart()->fPt) { in debugAddEndMovedSpans()
1588 if (span->coinPtTEnd()->fPt != span->oppPtTEnd()->fPt) { in debugAddEndMovedSpans()
/third_party/flutter/skia/src/pathops/
DSkIntersections.cpp18 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()
136 fPt[0] = a.fPt[aIndex]; in merge()
137 fPt2[0] = b.fPt[bIndex]; in merge()
151 SkDVector best = fPt[result] - origin; in mostOutside()
152 SkDVector test = fPt[index] - origin; in mostOutside()
[all …]
DSkPathOpsWinding.cpp92 fPt = segment->ptAtT(fT); in makeTestBase()
99 SkPoint fPt; member
108 SkScalar baseXY = pt_xy(base.fPt, dir); in rayCheck()
122 if (!sideways_overlap(fBounds, base.fPt, dir)) { in rayCheck()
125 SkScalar baseXY = pt_xy(base.fPt, dir); in rayCheck()
132 SkScalar baseYX = pt_yx(base.fPt, dir); in rayCheck()
150 if (SkDPoint::ApproximatelyEqual(pt, base.fPt)) { in rayCheck()
162 && SkDPoint::RoughlyEqual(pt, base.fPt)) { in rayCheck()
181 newHit->fPt = pt; in rayCheck()
206 return a->fPt.fX < b->fPt.fX; in hit_compare_x()
[all …]
DSkPathWriter.cpp121 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 - fDefer[0]->fPt; in changedSlopes()
181 SkVector lineDxdy = ptT->fPt - fDefer[1]->fPt; in changedSlopes()
222 eStart->fPt.fX, eStart->fPt.fY, eEnd->fPt.fX, eEnd->fPt.fY); in assemble()
[all …]
DSkDLineIntersection.cpp35 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()
DSkIntersections.h25 sk_bzero(fPt, sizeof(fPt)); in SkIntersections()
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 variable
DSkOpSegment.cpp217 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()
1429 checkBest->fPt); in spansNearby()
1624 edge->fCubic[0].set(startPtT.fPt); in subDivide()
1626 edge->fCubic[points].set(endPtT.fPt); in subDivide()
[all …]
DSkOpSpan.cpp47 if (ptT->fPt == pt && ptT->segment() == segment) { in contains()
100 fPt = pt; in init()
120 if (this->fPt == check->fPt) { in ptAlreadySeen()
DSkOpSegment.h323 return ptsDisjoint(span.fT, span.fPt, test.fT, test.fPt); in ptsDisjoint()
328 return ptsDisjoint(span.fT, span.fPt, t, pt); in ptsDisjoint()
/third_party/flutter/skia/docs/examples/
DPoint_iset_2.cpp8 SkPoint fPt; in draw() local
9 fPt.iset(iPt); in draw()
11 SkDebugf("fPt: %g, %g\n", fPt.fX, fPt.fY); in draw()
/third_party/skia/docs/examples/
DPoint_iset_2.cpp8 SkPoint fPt; in draw() local
9 fPt.iset(iPt); in draw()
11 SkDebugf("fPt: %g, %g\n", fPt.fX, fPt.fY); in draw()
/third_party/skia/src/gpu/geometry/
DGrAAConvexTessellator.h76 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/flutter/skia/src/gpu/ops/
DGrAAConvexTessellator.h76 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/
Dsimple_magnification.cpp39 SkPoint fPt; in make_image() member
50 canvas->drawPoints(SkCanvas::kPoints_PointMode, 1, &r.fPt, paint); in make_image()
/third_party/flutter/skia/gm/
Dsimple_magnification.cpp41 SkPoint fPt; in make_image() member
52 canvas->drawPoints(SkCanvas::kPoints_PointMode, 1, &r.fPt, paint); in make_image()
/third_party/flutter/skia/samplecode/
DSamplePathClip.cpp235 SkPoint* fPt; member in EdgeClipView::VertClick
237 VertClick(SkPoint* pt) : fPt(pt) {} in VertClick()
238 void handleMove() override { *fPt = snap(fCurr); } in handleMove()
/third_party/skia/samplecode/
DSamplePathClip.cpp233 SkPoint* fPt; member in EdgeClipView::VertClick
235 VertClick(SkPoint* pt) : fPt(pt) {} in VertClick()
236 void handleMove() override { *fPt = snap(fCurr); } in handleMove()

12