| /external/skqp/src/pathops/ |
| D | SkPathOpsPoint.h | 14 return AlmostEqualUlps(pt1.fX, pt2.fX) && AlmostEqualUlps(pt1.fY, pt2.fY); in AlmostEqualUlps()
19 double fY; member
23 fY = pt.fY; in set()
29 fY += v.fY;
35 fY -= v.fY;
41 fY /= s;
47 fY *= s;
51 SkVector v = {SkDoubleToScalar(fX), SkDoubleToScalar(fY)}; in asSkVector()
57 return fX * a.fY - fY * a.fX; in cross()
63 double xy = fX * a.fY; in crossCheck()
[all …]
|
| D | SkPathOpsLine.cpp | 17 SkDPoint result = { one_t * fPts[0].fX + t * fPts[1].fX, one_t * fPts[0].fY + t * fPts[1].fY }; in ptAtT()
33 || !AlmostBetweenUlps(fPts[0].fY, xy.fY, fPts[1].fY)) { in nearPoint()
38 double denom = len.fX * len.fX + len.fY * len.fY; // see DLine intersectRay in nearPoint()
40 double numer = len.fX * ab0.fX + ab0.fY * len.fY; in nearPoint()
51 double tiniest = SkTMin(SkTMin(SkTMin(fPts[0].fX, fPts[0].fY), fPts[1].fX), fPts[1].fY); in nearPoint()
52 double largest = SkTMax(SkTMax(SkTMax(fPts[0].fX, fPts[0].fY), fPts[1].fX), fPts[1].fY); in nearPoint()
68 double denom = len.fX * len.fX + len.fY * len.fY; // see DLine intersectRay in nearRay()
70 double numer = len.fX * ab0.fX + ab0.fY * len.fY; in nearRay()
75 double tiniest = SkTMin(SkTMin(SkTMin(fPts[0].fX, fPts[0].fY), fPts[1].fX), fPts[1].fY); in nearRay()
76 double largest = SkTMax(SkTMax(SkTMax(fPts[0].fX, fPts[0].fY), fPts[1].fX), fPts[1].fY); in nearRay()
[all …]
|
| D | SkLineParameters.h | 55 if (NotAlmostEqualUlps(pts[0].fY, pts[++endIndex].fY)) { in cubicEndPoints()
56 if (pts[0].fY > pts[endIndex].fY) { in cubicEndPoints()
65 if (pts[0].fY > pts[3].fY) { in cubicEndPoints()
72 fA = pts[s].fY - pts[e].fY; in cubicEndPoints()
74 fC = pts[s].fX * pts[e].fY - pts[e].fX * pts[s].fY; in cubicEndPoints()
86 fA = pts[0].fY - pts[1].fY; in lineEndPoints()
88 fC = pts[0].fX * pts[1].fY - pts[1].fX * pts[0].fY; in lineEndPoints()
104 if (pts[0].fY > pts[2].fY) { in quadEndPoints()
111 fA = pts[s].fY - pts[e].fY; in quadEndPoints()
113 fC = pts[s].fX * pts[e].fY - pts[e].fX * pts[s].fY; in quadEndPoints()
[all …]
|
| D | SkOpCubicHull.cpp | 10 double dy = cubic[index].fY - cubic[zero].fY; in rotate()
18 rotPath[index].fY = cubic[zero].fY; in rotate()
22 if (approximately_equal(cubic[side1].fY, cubic[zero].fY)) { in rotate()
23 rotPath[side1].fY = cubic[zero].fY; in rotate()
25 if (approximately_equal(cubic[side2].fY, cubic[zero].fY)) { in rotate()
26 rotPath[side2].fY = cubic[zero].fY; in rotate()
32 rotPath[index].fX = cubic[index].fX * dx + cubic[index].fY * dy; in rotate()
33 rotPath[index].fY = cubic[index].fY * dx - cubic[index].fX * dy; in rotate()
60 if (fPts[yMin].fY > fPts[index].fY || (fPts[yMin].fY == fPts[index].fY in convexHull()
85 int sides = side(rotPath[side1].fY - rotPath[yMin].fY); in convexHull()
[all …]
|
| D | SkPathOpsCubic.cpp | 23 if (fPts[endIndex].fY == fPts[ctrlIndex].fY) { in align()
24 dstPt->fY = fPts[endIndex].fY; in align()
41 && approximately_equal_half(lessPt.fY, cubicAtT.fY)) { in binarySearch()
60 && approximately_equal_half(morePt.fY, cubicAtT.fY)) { in binarySearch()
107 dst.pts[1].fY = (fPts[0].fY + fPts[1].fY) / 2; in chopAt()
109 dst.pts[2].fY = (fPts[0].fY + 2 * fPts[1].fY + fPts[2].fY) / 4; in chopAt()
111 dst.pts[3].fY = (fPts[0].fY + 3 * (fPts[1].fY + fPts[2].fY) + fPts[3].fY) / 8; in chopAt()
113 dst.pts[4].fY = (fPts[1].fY + 2 * fPts[2].fY + fPts[3].fY) / 4; in chopAt()
115 dst.pts[5].fY = (fPts[2].fY + fPts[3].fY) / 2; in chopAt()
120 interp_cubic_coords(&fPts[0].fY, &dst.pts[0].fY, t); in chopAt()
[all …]
|
| /external/skia/src/pathops/ |
| D | SkPathOpsPoint.h | 14 return AlmostEqualUlps(pt1.fX, pt2.fX) && AlmostEqualUlps(pt1.fY, pt2.fY); in AlmostEqualUlps()
19 double fY; member
23 fY = pt.fY; in set()
30 fY += v.fY;
36 fY -= v.fY;
42 fY /= s;
48 fY *= s;
52 SkVector v = {SkDoubleToScalar(fX), SkDoubleToScalar(fY)}; in asSkVector()
58 return fX * a.fY - fY * a.fX; in cross()
64 double xy = fX * a.fY; in crossCheck()
[all …]
|
| D | SkLineParameters.h | 55 if (NotAlmostEqualUlps(pts[0].fY, pts[++endIndex].fY)) { in cubicEndPoints()
56 if (pts[0].fY > pts[endIndex].fY) { in cubicEndPoints()
65 if (pts[0].fY > pts[3].fY) { in cubicEndPoints()
72 fA = pts[s].fY - pts[e].fY; in cubicEndPoints()
74 fC = pts[s].fX * pts[e].fY - pts[e].fX * pts[s].fY; in cubicEndPoints()
86 fA = pts[0].fY - pts[1].fY; in lineEndPoints()
88 fC = pts[0].fX * pts[1].fY - pts[1].fX * pts[0].fY; in lineEndPoints()
104 if (pts[0].fY > pts[2].fY) { in quadEndPoints()
111 fA = pts[s].fY - pts[e].fY; in quadEndPoints()
113 fC = pts[s].fX * pts[e].fY - pts[e].fX * pts[s].fY; in quadEndPoints()
[all …]
|
| D | SkOpCubicHull.cpp | 10 double dy = cubic[index].fY - cubic[zero].fY; in rotate()
18 rotPath[index].fY = cubic[zero].fY; in rotate()
22 if (approximately_equal(cubic[side1].fY, cubic[zero].fY)) { in rotate()
23 rotPath[side1].fY = cubic[zero].fY; in rotate()
25 if (approximately_equal(cubic[side2].fY, cubic[zero].fY)) { in rotate()
26 rotPath[side2].fY = cubic[zero].fY; in rotate()
32 rotPath[index].fX = cubic[index].fX * dx + cubic[index].fY * dy; in rotate()
33 rotPath[index].fY = cubic[index].fY * dx - cubic[index].fX * dy; in rotate()
60 if (fPts[yMin].fY > fPts[index].fY || (fPts[yMin].fY == fPts[index].fY in convexHull()
85 int sides = side(rotPath[side1].fY - rotPath[yMin].fY); in convexHull()
[all …]
|
| D | SkPathOpsLine.cpp | 17 SkDPoint result = { one_t * fPts[0].fX + t * fPts[1].fX, one_t * fPts[0].fY + t * fPts[1].fY }; in ptAtT()
33 || !AlmostBetweenUlps(fPts[0].fY, xy.fY, fPts[1].fY)) { in nearPoint()
38 double denom = len.fX * len.fX + len.fY * len.fY; // see DLine intersectRay in nearPoint()
40 double numer = len.fX * ab0.fX + ab0.fY * len.fY; in nearPoint()
51 double tiniest = std::min(std::min(std::min(fPts[0].fX, fPts[0].fY), fPts[1].fX), fPts[1].fY); in nearPoint()
52 double largest = std::max(std::max(std::max(fPts[0].fX, fPts[0].fY), fPts[1].fX), fPts[1].fY); in nearPoint()
68 double denom = len.fX * len.fX + len.fY * len.fY; // see DLine intersectRay in nearRay()
70 double numer = len.fX * ab0.fX + ab0.fY * len.fY; in nearRay()
75 double tiniest = std::min(std::min(std::min(fPts[0].fX, fPts[0].fY), fPts[1].fX), fPts[1].fY); in nearRay()
76 double largest = std::max(std::max(std::max(fPts[0].fX, fPts[0].fY), fPts[1].fX), fPts[1].fY); in nearRay()
[all …]
|
| D | SkPathOpsCubic.cpp | 23 if (fPts[endIndex].fY == fPts[ctrlIndex].fY) { in align()
24 dstPt->fY = fPts[endIndex].fY; in align()
41 && approximately_equal_half(lessPt.fY, cubicAtT.fY)) { in binarySearch()
60 && approximately_equal_half(morePt.fY, cubicAtT.fY)) { in binarySearch()
107 dst.pts[1].fY = (fPts[0].fY + fPts[1].fY) / 2; in chopAt()
109 dst.pts[2].fY = (fPts[0].fY + 2 * fPts[1].fY + fPts[2].fY) / 4; in chopAt()
111 dst.pts[3].fY = (fPts[0].fY + 3 * (fPts[1].fY + fPts[2].fY) + fPts[3].fY) / 8; in chopAt()
113 dst.pts[4].fY = (fPts[1].fY + 2 * fPts[2].fY + fPts[3].fY) / 4; in chopAt()
115 dst.pts[5].fY = (fPts[2].fY + fPts[3].fY) / 2; in chopAt()
120 interp_cubic_coords(&fPts[0].fY, &dst.pts[0].fY, t); in chopAt()
[all …]
|
| D | SkPathOpsQuad.cpp | 53 double origY = endPt[0]->fY; in hullIntersects()
55 double opp = endPt[1]->fY - origY; in hullIntersects()
56 double sign = (fPts[oddMan].fY - origY) * adj - (fPts[oddMan].fX - origX) * opp; in hullIntersects()
63 double test = (q2[n].fY - origY) * adj - (q2[n].fX - origX) * opp; in hullIntersects()
191 double tiniest = std::min(std::min(std::min(std::min(std::min(fPts[0].fX, fPts[0].fY), in isLinear()
192 fPts[1].fX), fPts[1].fY), fPts[2].fX), fPts[2].fY); in isLinear()
193 double largest = std::max(std::max(std::max(std::max(std::max(fPts[0].fX, fPts[0].fY), in isLinear()
194 fPts[1].fX), fPts[1].fY), fPts[2].fX), fPts[2].fY); in isLinear()
204 a * fPts[0].fY + b * fPts[1].fY + c * fPts[2].fY }; in dxdyAtT()
205 if (result.fX == 0 && result.fY == 0) { in dxdyAtT()
[all …]
|
| /external/skqp/include/core/ |
| D | SkPoint.h | 37 int32_t fY; //!< y-axis value member
59 int32_t y() const { return fY; } in y()
65 bool isZero() const { return (fX | fY) == 0; } in isZero()
74 fY = y; in set()
82 return {-fX, -fY};
91 fY = Sk32_sat_add(fY, v.fY);
100 fY = Sk32_sat_sub(fY, v.fY);
110 return fX == x && fY == y; in equals()
120 return a.fX == b.fX && a.fY == b.fY;
130 return a.fX != b.fX || a.fY != b.fY;
[all …]
|
| D | SkPoint3.h | 14 SkScalar fX, fY, fZ; member
23 SkScalar y() const { return fY; } in y()
26 void set(SkScalar x, SkScalar y, SkScalar z) { fX = x; fY = y; fZ = z; } in set()
29 return a.fX == b.fX && a.fY == b.fY && a.fZ == b.fZ;
42 SkScalar length() const { return SkPoint3::Length(fX, fY, fZ); } in length()
54 p.set(scale * fX, scale * fY, scale * fZ); in makeScale()
62 fY *= value; in scale()
72 neg.fY = -fY;
82 v.set(a.fX - b.fX, a.fY - b.fY, a.fZ - b.fZ);
90 v.set(a.fX + b.fX, a.fY + b.fY, a.fZ + b.fZ);
[all …]
|
| /external/skia/include/core/ |
| D | SkPoint.h | 27 int32_t fY; //!< y-axis value member
49 constexpr int32_t y() const { return fY; } in y()
55 bool isZero() const { return (fX | fY) == 0; } in isZero()
64 fY = y; in set()
72 return {-fX, -fY};
81 fY = Sk32_sat_add(fY, v.fY);
90 fY = Sk32_sat_sub(fY, v.fY);
100 return fX == x && fY == y; in equals()
110 return a.fX == b.fX && a.fY == b.fY;
120 return a.fX != b.fX || a.fY != b.fY;
[all …]
|
| D | SkPoint3.h | 14 SkScalar fX, fY, fZ; member
23 SkScalar y() const { return fY; } in y()
26 void set(SkScalar x, SkScalar y, SkScalar z) { fX = x; fY = y; fZ = z; } in set()
29 return a.fX == b.fX && a.fY == b.fY && a.fZ == b.fZ;
42 SkScalar length() const { return SkPoint3::Length(fX, fY, fZ); } in length()
54 p.set(scale * fX, scale * fY, scale * fZ); in makeScale()
62 fY *= value; in scale()
72 neg.fY = -fY;
81 return { a.fX - b.fX, a.fY - b.fY, a.fZ - b.fZ };
87 return { a.fX + b.fX, a.fY + b.fY, a.fZ + b.fZ };
[all …]
|
| /external/skia/src/core/ |
| D | SkStrokerPriv.cpp | 17 path->lineTo(stop.fX, stop.fY); in ButtCapper()
37 path->setLastPt(pivot.fX + normal.fX + parallel.fX, pivot.fY + normal.fY + parallel.fY); in SquareCapper()
38 path->lineTo(pivot.fX - normal.fX + parallel.fX, pivot.fY - normal.fY + parallel.fY); in SquareCapper()
40 path->lineTo(pivot.fX + normal.fX + parallel.fX, pivot.fY + normal.fY + parallel.fY); in SquareCapper()
41 path->lineTo(pivot.fX - normal.fX + parallel.fX, pivot.fY - normal.fY + parallel.fY); in SquareCapper()
42 path->lineTo(stop.fX, stop.fY); in SquareCapper()
49 return before.fX * after.fY > before.fY * after.fX; in is_clockwise()
78 inner->lineTo(pivot.fX, pivot.fY); in HandleInnerJoin()
81 inner->lineTo(pivot.fX - after.fX, pivot.fY - after.fY); in HandleInnerJoin()
96 outer->lineTo(pivot.fX + after.fX, pivot.fY + after.fY); in BluntJoiner()
[all …]
|
| D | SkAnalyticEdge.h | 34 SkFixed fY; // The current y member
59 if (y == fY + SK_Fixed1) { in goY()
61 fY = y; in goY()
62 } else if (y != fY) { in goY()
66 fY = y; in goY()
72 SkASSERT(fDX == 0 || y - fY == SK_Fixed1 >> yShift); in goY()
73 fY = y; in goY()
92 fUpperY, fLowerY, SkFixedToFloat(fY), SkFixedToFloat(fX), in dump()
118 SkASSERT(SkAbs32(fX - SkFixedMul(fY - fSnappedY, fDX) - fSnappedX) < SK_Fixed1); in keepContinuous()
119 SkASSERT(SkAbs32(fY - fSnappedY) < SK_Fixed1); // This may differ due to smooth jump in keepContinuous()
[all …]
|
| D | SkEdgeClipper.cpp | 37 if (src[0].fY > src[count - 1].fY) { in sort_increasing_Y()
87 return chopMonoQuadAt(pts[0].fY, pts[1].fY, pts[2].fY, y, t); in chopMonoQuadAtY()
100 if (pts[0].fY < clip.fTop) { in chop_quad_in_Y()
105 tmp[2].fY = clip.fTop; in chop_quad_in_Y()
106 clamp_ge(tmp[3].fY, clip.fTop); in chop_quad_in_Y()
114 if (pts[i].fY < clip.fTop) { in chop_quad_in_Y()
115 pts[i].fY = clip.fTop; in chop_quad_in_Y()
122 if (pts[2].fY > clip.fBottom) { in chop_quad_in_Y()
126 clamp_le(tmp[1].fY, clip.fBottom); in chop_quad_in_Y()
127 tmp[2].fY = clip.fBottom; in chop_quad_in_Y()
[all …]
|
| /external/skqp/src/core/ |
| D | SkStrokerPriv.cpp | 17 path->lineTo(stop.fX, stop.fY); in ButtCapper()
37 path->setLastPt(pivot.fX + normal.fX + parallel.fX, pivot.fY + normal.fY + parallel.fY); in SquareCapper()
38 path->lineTo(pivot.fX - normal.fX + parallel.fX, pivot.fY - normal.fY + parallel.fY); in SquareCapper()
40 path->lineTo(pivot.fX + normal.fX + parallel.fX, pivot.fY + normal.fY + parallel.fY); in SquareCapper()
41 path->lineTo(pivot.fX - normal.fX + parallel.fX, pivot.fY - normal.fY + parallel.fY); in SquareCapper()
42 path->lineTo(stop.fX, stop.fY); in SquareCapper()
49 return before.fX * after.fY > before.fY * after.fX; in is_clockwise()
78 inner->lineTo(pivot.fX, pivot.fY); in HandleInnerJoin()
81 inner->lineTo(pivot.fX - after.fX, pivot.fY - after.fY); in HandleInnerJoin()
96 outer->lineTo(pivot.fX + after.fX, pivot.fY + after.fY); in BluntJoiner()
[all …]
|
| D | SkAnalyticEdge.h | 34 SkFixed fY; // The current y member
59 if (y == fY + SK_Fixed1) { in goY()
61 fY = y; in goY()
62 } else if (y != fY) { in goY()
66 fY = y; in goY()
72 SkASSERT(fDX == 0 || y - fY == SK_Fixed1 >> yShift); in goY()
73 fY = y; in goY()
92 fUpperY, fLowerY, SkFixedToFloat(fY), SkFixedToFloat(fX), in dump()
118 SkASSERT(SkAbs32(fX - SkFixedMul(fY - fSnappedY, fDX) - fSnappedX) < SK_Fixed1); in keepContinuous()
119 SkASSERT(SkAbs32(fY - fSnappedY) < SK_Fixed1); // This may differ due to smooth jump in keepContinuous()
[all …]
|
| D | SkRRect.cpp | 128 if (radii[i].fX <= 0 || radii[i].fY <= 0) { in clamp_to_zero()
134 radii[i].fY = 0; in clamp_to_zero()
208 scale = compute_min_scale(fRadii[1].fY, fRadii[2].fY, height, scale); in scaleRadii()
210 scale = compute_min_scale(fRadii[3].fY, fRadii[0].fY, height, scale); in scaleRadii()
213 flush_to_zero(fRadii[1].fY, fRadii[2].fY); in scaleRadii()
215 flush_to_zero(fRadii[3].fY, fRadii[0].fY); in scaleRadii()
219 SkScaleToSides::AdjustRadii(height, scale, &fRadii[1].fY, &fRadii[2].fY); in scaleRadii()
221 SkScaleToSides::AdjustRadii(height, scale, &fRadii[3].fY, &fRadii[0].fY); in scaleRadii()
247 y < fRect.fTop + fRadii[kUpperLeft_Corner].fY) { in checkCornerContainment()
251 y - (fRect.fTop + fRadii[kUpperLeft_Corner].fY)); in checkCornerContainment()
[all …]
|
| D | SkEdgeClipper.cpp | 37 if (src[0].fY > src[count - 1].fY) { in sort_increasing_Y()
87 return chopMonoQuadAt(pts[0].fY, pts[1].fY, pts[2].fY, y, t); in chopMonoQuadAtY()
100 if (pts[0].fY < clip.fTop) { in chop_quad_in_Y()
105 tmp[2].fY = clip.fTop; in chop_quad_in_Y()
106 clamp_ge(tmp[3].fY, clip.fTop); in chop_quad_in_Y()
114 if (pts[i].fY < clip.fTop) { in chop_quad_in_Y()
115 pts[i].fY = clip.fTop; in chop_quad_in_Y()
122 if (pts[2].fY > clip.fBottom) { in chop_quad_in_Y()
126 clamp_le(tmp[1].fY, clip.fBottom); in chop_quad_in_Y()
127 tmp[2].fY = clip.fBottom; in chop_quad_in_Y()
[all …]
|
| /external/pdfium/xfa/fwl/theme/ |
| D | cfwl_scrollbartp.cpp | 117 float fY = rect.top + rect.height / 2; in DrawPaw() local
118 path.MoveTo(CFX_PointF(fX, fY - 4)); in DrawPaw()
119 path.LineTo(CFX_PointF(fX + fPawLen, fY - 4)); in DrawPaw()
120 path.MoveTo(CFX_PointF(fX, fY - 2)); in DrawPaw()
121 path.LineTo(CFX_PointF(fX + fPawLen, fY - 2)); in DrawPaw()
122 path.MoveTo(CFX_PointF(fX, fY)); in DrawPaw()
123 path.LineTo(CFX_PointF(fX + fPawLen, fY)); in DrawPaw()
124 path.MoveTo(CFX_PointF(fX, fY + 2)); in DrawPaw()
125 path.LineTo(CFX_PointF(fX + fPawLen, fY + 2)); in DrawPaw()
134 path.MoveTo(CFX_PointF(fX, fY - 3)); in DrawPaw()
[all …]
|
| /external/skia/tests/ |
| D | PathOpsLineIntersectionTest.cpp | 120 if (line1[0].fY == line1[1].fY) { in testOne()
124 ts.horizontal(line2, left, right, line1[0].fY, line1[0].fX != left); in testOne()
127 if (line2[0].fY == line2[1].fY) { in testOne()
131 ts.horizontal(line1, left, right, line2[0].fY, line2[0].fX != left); in testOne()
135 double top = std::min(line1[0].fY, line1[1].fY); in testOne()
136 double bottom = std::max(line1[0].fY, line1[1].fY); in testOne()
138 ts.vertical(line2, top, bottom, line1[0].fX, line1[0].fY != top); in testOne()
142 double top = std::min(line2[0].fY, line2[1].fY); in testOne()
143 double bottom = std::max(line2[0].fY, line2[1].fY); in testOne()
145 ts.vertical(line1, top, bottom, line2[0].fX, line2[0].fY != top); in testOne()
[all …]
|
| /external/skqp/tests/ |
| D | PathOpsLineIntersectionTest.cpp | 120 if (line1[0].fY == line1[1].fY) { in testOne()
124 ts.horizontal(line2, left, right, line1[0].fY, line1[0].fX != left); in testOne()
127 if (line2[0].fY == line2[1].fY) { in testOne()
131 ts.horizontal(line1, left, right, line2[0].fY, line2[0].fX != left); in testOne()
135 double top = SkTMin(line1[0].fY, line1[1].fY); in testOne()
136 double bottom = SkTMax(line1[0].fY, line1[1].fY); in testOne()
138 ts.vertical(line2, top, bottom, line1[0].fX, line1[0].fY != top); in testOne()
142 double top = SkTMin(line2[0].fY, line2[1].fY); in testOne()
143 double bottom = SkTMax(line2[0].fY, line2[1].fY); in testOne()
145 ts.vertical(line1, top, bottom, line2[0].fX, line2[0].fY != top); in testOne()
[all …]
|