| /external/skqp/samplecode/ |
| D | SampleHairCurves.cpp | 40 SkScalar pts[] = { in onDrawContent() local
46 curves.moveTo(pts[0], pts[1]); in onDrawContent()
47 curves.cubicTo(pts[2], pts[3], in onDrawContent()
48 pts[4], pts[5], in onDrawContent()
49 pts[6], pts[7]); in onDrawContent()
51 hulls.moveTo(pts[0], pts[1]); in onDrawContent()
52 hulls.lineTo(pts[2], pts[3]); in onDrawContent()
53 hulls.lineTo(pts[4], pts[5]); in onDrawContent()
54 hulls.lineTo(pts[6], pts[7]); in onDrawContent()
56 ctrlPts.addCircle(pts[0], pts[1], SK_Scalar1 / 200); in onDrawContent()
[all …]
|
| D | SampleAAGeometry.cpp | 100 SkPoint pts[4];
104 while ((verb = iter.next(pts)) != SkPath::kDone_Verb) {
116 SkPoint pts[4]; in get_path_weight() local
120 while ((verb = iter.next(pts)) != SkPath::kDone_Verb) { in get_path_weight()
132 SkPoint pts[4]; in set_path_pt() local
137 while ((verb = iter.next(pts)) != SkPath::kDone_Verb) { in set_path_pt()
160 pts[index - startIndex] = pt; in set_path_pt()
165 result.moveTo(pts[0]); in set_path_pt()
168 result.lineTo(pts[1]); in set_path_pt()
172 result.quadTo(pts[1], pts[2]); in set_path_pt()
[all …]
|
| D | SampleGradients.cpp | 13 SkPoint pts[] = { { r.fLeft, r.fTop }, { r.fRight, r.fTop } }; in setgrad() local
14 return SkGradientShader::MakeLinear(pts, colors, nullptr, 2, SkShader::kClamp_TileMode); in setgrad()
64 static sk_sp<SkShader> MakeLinear(const SkPoint pts[2], const GradData& data, SkShader::TileMode tm… in MakeLinear()
65 return SkGradientShader::MakeLinear(pts, data.fColors, data.fPos, data.fCount, tm); in MakeLinear()
68 static sk_sp<SkShader> MakeRadial(const SkPoint pts[2], const GradData& data, SkShader::TileMode tm… in MakeRadial()
70 center.set(SkScalarAve(pts[0].fX, pts[1].fX), in MakeRadial()
71 SkScalarAve(pts[0].fY, pts[1].fY)); in MakeRadial()
76 static sk_sp<SkShader> MakeSweep(const SkPoint pts[2], const GradData& data, SkShader::TileMode tm)… in MakeSweep()
78 center.set(SkScalarAve(pts[0].fX, pts[1].fX), in MakeSweep()
79 SkScalarAve(pts[0].fY, pts[1].fY)); in MakeSweep()
[all …]
|
| /external/skia/samplecode/ |
| D | SampleHairCurves.cpp | 40 SkScalar pts[] = { in onDrawContent() local
46 curves.moveTo(pts[0], pts[1]); in onDrawContent()
47 curves.cubicTo(pts[2], pts[3], in onDrawContent()
48 pts[4], pts[5], in onDrawContent()
49 pts[6], pts[7]); in onDrawContent()
51 hulls.moveTo(pts[0], pts[1]); in onDrawContent()
52 hulls.lineTo(pts[2], pts[3]); in onDrawContent()
53 hulls.lineTo(pts[4], pts[5]); in onDrawContent()
54 hulls.lineTo(pts[6], pts[7]); in onDrawContent()
56 ctrlPts.addCircle(pts[0], pts[1], SK_Scalar1 / 200); in onDrawContent()
[all …]
|
| D | SampleAAGeometry.cpp | 100 SkPoint pts[4];
104 while ((verb = iter.next(pts)) != SkPath::kDone_Verb) {
116 SkPoint pts[4]; in get_path_weight() local
120 while ((verb = iter.next(pts)) != SkPath::kDone_Verb) { in get_path_weight()
132 SkPoint pts[4]; in set_path_pt() local
137 while ((verb = iter.next(pts)) != SkPath::kDone_Verb) { in set_path_pt()
160 pts[index - startIndex] = pt; in set_path_pt()
165 result.moveTo(pts[0]); in set_path_pt()
168 result.lineTo(pts[1]); in set_path_pt()
172 result.quadTo(pts[1], pts[2]); in set_path_pt()
[all …]
|
| D | SampleGradients.cpp | 13 SkPoint pts[] = { { r.fLeft, r.fTop }, { r.fRight, r.fTop } }; in setgrad() local
14 return SkGradientShader::MakeLinear(pts, colors, nullptr, 2, SkShader::kClamp_TileMode); in setgrad()
64 static sk_sp<SkShader> MakeLinear(const SkPoint pts[2], const GradData& data, SkShader::TileMode tm… in MakeLinear()
65 return SkGradientShader::MakeLinear(pts, data.fColors, data.fPos, data.fCount, tm); in MakeLinear()
68 static sk_sp<SkShader> MakeRadial(const SkPoint pts[2], const GradData& data, SkShader::TileMode tm… in MakeRadial()
70 center.set(SkScalarAve(pts[0].fX, pts[1].fX), in MakeRadial()
71 SkScalarAve(pts[0].fY, pts[1].fY)); in MakeRadial()
76 static sk_sp<SkShader> MakeSweep(const SkPoint pts[2], const GradData& data, SkShader::TileMode tm)… in MakeSweep()
78 center.set(SkScalarAve(pts[0].fX, pts[1].fX), in MakeSweep()
79 SkScalarAve(pts[0].fY, pts[1].fY)); in MakeSweep()
[all …]
|
| /external/skia/gm/ |
| D | gradients_2pt_conical.cpp | 40 static sk_sp<SkShader> Make2ConicalOutside(const SkPoint pts[2], const GradData& data, in Make2ConicalOutside()
43 SkScalar radius0 = (pts[1].fX - pts[0].fX) / 10; in Make2ConicalOutside()
44 SkScalar radius1 = (pts[1].fX - pts[0].fX) / 3; in Make2ConicalOutside()
45 center0.set(pts[0].fX + radius0, pts[0].fY + radius0); in Make2ConicalOutside()
46 center1.set(pts[1].fX - radius1, pts[1].fY - radius1); in Make2ConicalOutside()
51 static sk_sp<SkShader> Make2ConicalOutsideStrip(const SkPoint pts[2], const GradData& data, in Make2ConicalOutsideStrip()
54 SkScalar radius = (pts[1].fX - pts[0].fX) / 3; in Make2ConicalOutsideStrip()
55 center0.set(pts[0].fX, pts[0].fY); in Make2ConicalOutsideStrip()
56 center1.set(pts[1].fX, pts[1].fY); in Make2ConicalOutsideStrip()
61 static sk_sp<SkShader> Make2ConicalOutsideFlip(const SkPoint pts[2], const GradData& data, in Make2ConicalOutsideFlip()
[all …]
|
| /external/skqp/gm/ |
| D | gradients_2pt_conical.cpp | 40 static sk_sp<SkShader> Make2ConicalOutside(const SkPoint pts[2], const GradData& data, in Make2ConicalOutside()
43 SkScalar radius0 = (pts[1].fX - pts[0].fX) / 10; in Make2ConicalOutside()
44 SkScalar radius1 = (pts[1].fX - pts[0].fX) / 3; in Make2ConicalOutside()
45 center0.set(pts[0].fX + radius0, pts[0].fY + radius0); in Make2ConicalOutside()
46 center1.set(pts[1].fX - radius1, pts[1].fY - radius1); in Make2ConicalOutside()
51 static sk_sp<SkShader> Make2ConicalOutsideStrip(const SkPoint pts[2], const GradData& data, in Make2ConicalOutsideStrip()
54 SkScalar radius = (pts[1].fX - pts[0].fX) / 3; in Make2ConicalOutsideStrip()
55 center0.set(pts[0].fX, pts[0].fY); in Make2ConicalOutsideStrip()
56 center1.set(pts[1].fX, pts[1].fY); in Make2ConicalOutsideStrip()
61 static sk_sp<SkShader> Make2ConicalOutsideFlip(const SkPoint pts[2], const GradData& data, in Make2ConicalOutsideFlip()
[all …]
|
| /external/skqp/src/pathops/ |
| D | SkAddIntersections.cpp | 15 static void debugShowLineIntersection(int pts, const SkIntersectionHelper& wt, in debugShowLineIntersection() argument
17 SkASSERT(i.used() == pts); in debugShowLineIntersection()
18 if (!pts) { in debugShowLineIntersection()
20 __FUNCTION__, LINE_DEBUG_DATA(wt.pts()), LINE_DEBUG_DATA(wn.pts())); in debugShowLineIntersection()
24 i[0][0], LINE_DEBUG_DATA(wt.pts()), PT_DEBUG_DATA(i, 0)); in debugShowLineIntersection()
25 if (pts == 2) { in debugShowLineIntersection()
28 SkDebugf(" wnTs[0]=%g " LINE_DEBUG_STR, i[1][0], LINE_DEBUG_DATA(wn.pts())); in debugShowLineIntersection()
29 if (pts == 2) { in debugShowLineIntersection()
35 static void debugShowQuadLineIntersection(int pts, const SkIntersectionHelper& wt, in debugShowQuadLineIntersection() argument
38 SkASSERT(i.used() == pts); in debugShowQuadLineIntersection()
[all …]
|
| D | SkLineParameters.h | 31 bool cubicEndPoints(const SkDCubic& pts) { in cubicEndPoints() argument
33 cubicEndPoints(pts, 0, endIndex); in cubicEndPoints()
38 cubicEndPoints(pts, 0, ++endIndex); in cubicEndPoints()
44 cubicEndPoints(pts, 0, ++endIndex); // line in cubicEndPoints()
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()
71 void cubicEndPoints(const SkDCubic& pts, int s, int e) { in cubicEndPoints() argument
72 fA = pts[s].fY - pts[e].fY; in cubicEndPoints()
73 fB = pts[e].fX - pts[s].fX; in cubicEndPoints()
[all …]
|
| D | SkPathOpsTightBounds.cpp | 16 SkPoint pts[4]; in TightBounds() local
17 verb = iter.next(pts); in TightBounds()
20 moveBounds.fLeft = SkTMin(moveBounds.fLeft, pts[0].fX); in TightBounds()
21 moveBounds.fTop = SkTMin(moveBounds.fTop, pts[0].fY); in TightBounds()
22 moveBounds.fRight = SkTMax(moveBounds.fRight, pts[0].fX); in TightBounds()
23 moveBounds.fBottom = SkTMax(moveBounds.fBottom, pts[0].fY); in TightBounds()
30 wellBehaved &= between(pts[0].fX, pts[1].fX, pts[2].fX); in TightBounds()
31 wellBehaved &= between(pts[0].fY, pts[1].fY, pts[2].fY); in TightBounds()
37 wellBehaved &= between(pts[0].fX, pts[1].fX, pts[3].fX); in TightBounds()
38 wellBehaved &= between(pts[0].fY, pts[1].fY, pts[3].fY); in TightBounds()
[all …]
|
| D | SkPathOpsAsWinding.cpp | 46 static int contains_edge(SkPoint pts[4], SkPath::Verb verb, SkScalar weight, const SkPoint& edge) { in contains_edge()
48 bounds.set(pts, kPtCount[verb] + 1); in contains_edge()
62 int count = (*CurveIntercept[verb * 2])(pts, weight, edge.fY, tVals); in contains_edge()
66 SkScalar intersectX = (*CurvePointAtT[verb])(pts, weight, tVals[index]).fX; in contains_edge()
76 if (pts[0].fX < edge.fX && pts[kPtCount[verb]].fX < edge.fX) { in contains_edge()
87 directions[index] = to_direction((*CurveSlopeAtT[verb])(pts, weight, tVals[index]).fY); in contains_edge()
103 static SkPoint left_edge(SkPoint pts[4], SkPath::Verb verb, SkScalar weight, in left_edge()
111 result = pts[0].fX < pts[1].fX ? pts[0] : pts[1]; in left_edge()
112 dy = pts[1].fY - pts[0].fY; in left_edge()
115 quad.set(pts); in left_edge()
[all …]
|
| /external/skia/src/pathops/ |
| D | SkAddIntersections.cpp | 15 static void debugShowLineIntersection(int pts, const SkIntersectionHelper& wt, in debugShowLineIntersection() argument
17 SkASSERT(i.used() == pts); in debugShowLineIntersection()
18 if (!pts) { in debugShowLineIntersection()
20 __FUNCTION__, LINE_DEBUG_DATA(wt.pts()), LINE_DEBUG_DATA(wn.pts())); in debugShowLineIntersection()
24 i[0][0], LINE_DEBUG_DATA(wt.pts()), PT_DEBUG_DATA(i, 0)); in debugShowLineIntersection()
25 if (pts == 2) { in debugShowLineIntersection()
28 SkDebugf(" wnTs[0]=%g " LINE_DEBUG_STR, i[1][0], LINE_DEBUG_DATA(wn.pts())); in debugShowLineIntersection()
29 if (pts == 2) { in debugShowLineIntersection()
35 static void debugShowQuadLineIntersection(int pts, const SkIntersectionHelper& wt, in debugShowQuadLineIntersection() argument
38 SkASSERT(i.used() == pts); in debugShowQuadLineIntersection()
[all …]
|
| D | SkLineParameters.h | 31 bool cubicEndPoints(const SkDCubic& pts) { in cubicEndPoints() argument
33 cubicEndPoints(pts, 0, endIndex); in cubicEndPoints()
38 cubicEndPoints(pts, 0, ++endIndex); in cubicEndPoints()
44 cubicEndPoints(pts, 0, ++endIndex); // line in cubicEndPoints()
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()
71 void cubicEndPoints(const SkDCubic& pts, int s, int e) { in cubicEndPoints() argument
72 fA = pts[s].fY - pts[e].fY; in cubicEndPoints()
73 fB = pts[e].fX - pts[s].fX; in cubicEndPoints()
[all …]
|
| D | SkPathOpsTightBounds.cpp | 16 SkPoint pts[4]; in TightBounds() local
17 verb = iter.next(pts); in TightBounds()
20 moveBounds.fLeft = SkTMin(moveBounds.fLeft, pts[0].fX); in TightBounds()
21 moveBounds.fTop = SkTMin(moveBounds.fTop, pts[0].fY); in TightBounds()
22 moveBounds.fRight = SkTMax(moveBounds.fRight, pts[0].fX); in TightBounds()
23 moveBounds.fBottom = SkTMax(moveBounds.fBottom, pts[0].fY); in TightBounds()
30 wellBehaved &= between(pts[0].fX, pts[1].fX, pts[2].fX); in TightBounds()
31 wellBehaved &= between(pts[0].fY, pts[1].fY, pts[2].fY); in TightBounds()
37 wellBehaved &= between(pts[0].fX, pts[1].fX, pts[3].fX); in TightBounds()
38 wellBehaved &= between(pts[0].fY, pts[1].fY, pts[3].fY); in TightBounds()
[all …]
|
| D | SkPathOpsAsWinding.cpp | 46 static int contains_edge(SkPoint pts[4], SkPath::Verb verb, SkScalar weight, const SkPoint& edge) { in contains_edge()
48 bounds.set(pts, kPtCount[verb] + 1); in contains_edge()
62 int count = (*CurveIntercept[verb * 2])(pts, weight, edge.fY, tVals); in contains_edge()
66 SkScalar intersectX = (*CurvePointAtT[verb])(pts, weight, tVals[index]).fX; in contains_edge()
76 if (pts[0].fX < edge.fX && pts[kPtCount[verb]].fX < edge.fX) { in contains_edge()
87 directions[index] = to_direction((*CurveSlopeAtT[verb])(pts, weight, tVals[index]).fY); in contains_edge()
103 static SkPoint left_edge(SkPoint pts[4], SkPath::Verb verb, SkScalar weight, in left_edge()
111 result = pts[0].fX < pts[1].fX ? pts[0] : pts[1]; in left_edge()
112 dy = pts[1].fY - pts[0].fY; in left_edge()
115 quad.set(pts); in left_edge()
[all …]
|
| /external/skia/src/core/ |
| D | SkEdgeClipper.cpp | 53 const SkPoint pts[] = { p0, p1 }; in clipLine() local
54 int lineCount = SkLineClipper::ClipLine(pts, clip, lines, fCanCullToTheRight); in clipLine()
86 static bool chopMonoQuadAtY(SkPoint pts[3], SkScalar y, SkScalar* t) { in chopMonoQuadAtY()
87 return chopMonoQuadAt(pts[0].fY, pts[1].fY, pts[2].fY, y, t); in chopMonoQuadAtY()
90 static bool chopMonoQuadAtX(SkPoint pts[3], SkScalar x, SkScalar* t) { in chopMonoQuadAtX()
91 return chopMonoQuadAt(pts[0].fX, pts[1].fX, pts[2].fX, x, t); in chopMonoQuadAtX()
95 static void chop_quad_in_Y(SkPoint pts[3], const SkRect& clip) { in chop_quad_in_Y()
100 if (pts[0].fY < clip.fTop) { in chop_quad_in_Y()
101 if (chopMonoQuadAtY(pts, clip.fTop, &t)) { in chop_quad_in_Y()
103 SkChopQuadAt(pts, tmp, t); in chop_quad_in_Y()
[all …]
|
| D | SkScan_Hairline.cpp | 61 SkPoint pts[2]; in HairLineRgn() local
65 if (!SkLineClipper::IntersectLine(&array[i], fixedBounds, pts)) { in HairLineRgn()
71 if (clip && !SkLineClipper::IntersectLine(pts, clipBounds, pts)) { in HairLineRgn()
75 SkFDot6 x0 = SkScalarToFDot6(pts[0].fX); in HairLineRgn()
76 SkFDot6 y0 = SkScalarToFDot6(pts[0].fY); in HairLineRgn()
77 SkFDot6 x1 = SkScalarToFDot6(pts[1].fX); in HairLineRgn()
78 SkFDot6 y1 = SkScalarToFDot6(pts[1].fY); in HairLineRgn()
212 static uint32_t compute_int_quad_dist(const SkPoint pts[3]) { in compute_int_quad_dist()
215 SkScalar dx = SkScalarHalf(pts[0].fX + pts[2].fX) - pts[1].fX; in compute_int_quad_dist()
216 SkScalar dy = SkScalarHalf(pts[0].fY + pts[2].fY) - pts[1].fY; in compute_int_quad_dist()
[all …]
|
| /external/skqp/src/core/ |
| D | SkEdgeClipper.cpp | 53 const SkPoint pts[] = { p0, p1 }; in clipLine() local
54 int lineCount = SkLineClipper::ClipLine(pts, clip, lines, fCanCullToTheRight); in clipLine()
86 static bool chopMonoQuadAtY(SkPoint pts[3], SkScalar y, SkScalar* t) { in chopMonoQuadAtY()
87 return chopMonoQuadAt(pts[0].fY, pts[1].fY, pts[2].fY, y, t); in chopMonoQuadAtY()
90 static bool chopMonoQuadAtX(SkPoint pts[3], SkScalar x, SkScalar* t) { in chopMonoQuadAtX()
91 return chopMonoQuadAt(pts[0].fX, pts[1].fX, pts[2].fX, x, t); in chopMonoQuadAtX()
95 static void chop_quad_in_Y(SkPoint pts[3], const SkRect& clip) { in chop_quad_in_Y()
100 if (pts[0].fY < clip.fTop) { in chop_quad_in_Y()
101 if (chopMonoQuadAtY(pts, clip.fTop, &t)) { in chop_quad_in_Y()
103 SkChopQuadAt(pts, tmp, t); in chop_quad_in_Y()
[all …]
|
| D | SkPathMeasure.cpp | 36 void SkPathMeasure_segTo(const SkPoint pts[], unsigned segType, in SkPathMeasure_segTo() argument
58 dst->lineTo(pts[1]); in SkPathMeasure_segTo()
60 dst->lineTo(SkScalarInterp(pts[0].fX, pts[1].fX, stopT), in SkPathMeasure_segTo()
61 SkScalarInterp(pts[0].fY, pts[1].fY, stopT)); in SkPathMeasure_segTo()
67 dst->quadTo(pts[1], pts[2]); in SkPathMeasure_segTo()
69 SkChopQuadAt(pts, tmp0, stopT); in SkPathMeasure_segTo()
73 SkChopQuadAt(pts, tmp0, startT); in SkPathMeasure_segTo()
83 SkConic conic(pts[0], pts[2], pts[3], pts[1].fX); in SkPathMeasure_segTo()
110 dst->cubicTo(pts[1], pts[2], pts[3]); in SkPathMeasure_segTo()
112 SkChopCubicAt(pts, tmp0, stopT); in SkPathMeasure_segTo()
[all …]
|
| D | SkScan_Hairline.cpp | 61 SkPoint pts[2]; in HairLineRgn() local
65 if (!SkLineClipper::IntersectLine(&array[i], fixedBounds, pts)) { in HairLineRgn()
71 if (clip && !SkLineClipper::IntersectLine(pts, clipBounds, pts)) { in HairLineRgn()
75 SkFDot6 x0 = SkScalarToFDot6(pts[0].fX); in HairLineRgn()
76 SkFDot6 y0 = SkScalarToFDot6(pts[0].fY); in HairLineRgn()
77 SkFDot6 x1 = SkScalarToFDot6(pts[1].fX); in HairLineRgn()
78 SkFDot6 y1 = SkScalarToFDot6(pts[1].fY); in HairLineRgn()
212 static uint32_t compute_int_quad_dist(const SkPoint pts[3]) { in compute_int_quad_dist()
215 SkScalar dx = SkScalarHalf(pts[0].fX + pts[2].fX) - pts[1].fX; in compute_int_quad_dist()
216 SkScalar dy = SkScalarHalf(pts[0].fY + pts[2].fY) - pts[1].fY; in compute_int_quad_dist()
[all …]
|
| /external/skia/bench/ |
| D | GradientBench.cpp | 50 static sk_sp<SkShader> MakeLinear(const SkPoint pts[2], const GradData& data, in MakeLinear()
52 return SkGradientShader::MakeLinear(pts, data.fColors, data.fPos, data.fCount, tm); in MakeLinear()
55 static sk_sp<SkShader> MakeRadial(const SkPoint pts[2], const GradData& data, in MakeRadial()
58 center.set(SkScalarAve(pts[0].fX, pts[1].fX), in MakeRadial()
59 SkScalarAve(pts[0].fY, pts[1].fY)); in MakeRadial()
65 static sk_sp<SkShader> MakeSweep(const SkPoint pts[2], const GradData& data, in MakeSweep()
68 center.set(SkScalarAve(pts[0].fX, pts[1].fX), in MakeSweep()
69 SkScalarAve(pts[0].fY, pts[1].fY)); in MakeSweep()
74 static sk_sp<SkShader> MakeConical(const SkPoint pts[2], const GradData& data, in MakeConical()
77 center0.set(SkScalarAve(pts[0].fX, pts[1].fX), in MakeConical()
[all …]
|
| /external/skqp/bench/ |
| D | GradientBench.cpp | 50 static sk_sp<SkShader> MakeLinear(const SkPoint pts[2], const GradData& data, in MakeLinear()
52 return SkGradientShader::MakeLinear(pts, data.fColors, data.fPos, data.fCount, tm); in MakeLinear()
55 static sk_sp<SkShader> MakeRadial(const SkPoint pts[2], const GradData& data, in MakeRadial()
58 center.set(SkScalarAve(pts[0].fX, pts[1].fX), in MakeRadial()
59 SkScalarAve(pts[0].fY, pts[1].fY)); in MakeRadial()
65 static sk_sp<SkShader> MakeSweep(const SkPoint pts[2], const GradData& data, in MakeSweep()
68 center.set(SkScalarAve(pts[0].fX, pts[1].fX), in MakeSweep()
69 SkScalarAve(pts[0].fY, pts[1].fY)); in MakeSweep()
74 static sk_sp<SkShader> MakeConical(const SkPoint pts[2], const GradData& data, in MakeConical()
77 center0.set(SkScalarAve(pts[0].fX, pts[1].fX), in MakeConical()
[all …]
|
| /external/skia/src/effects/ |
| D | SkCornerPathEffect.cpp | 46 SkPoint pts[4]; in onFilterPath() local
60 switch (verb = iter.next(pts, false)) { in onFilterPath()
68 moveTo = pts[0]; in onFilterPath()
71 dst->moveTo(pts[0]); in onFilterPath()
76 bool drawSegment = ComputeStep(pts[0], pts[1], fRadius, &step); in onFilterPath()
82 dst->quadTo(pts[0].fX, pts[0].fY, pts[0].fX + step.fX, in onFilterPath()
83 pts[0].fY + step.fY); in onFilterPath()
86 dst->lineTo(pts[1].fX - step.fX, pts[1].fY - step.fY); in onFilterPath()
88 lastCorner = pts[1]; in onFilterPath()
95 dst->moveTo(pts[0]); in onFilterPath()
[all …]
|
| /external/skqp/src/effects/ |
| D | SkCornerPathEffect.cpp | 46 SkPoint pts[4]; in onFilterPath() local
60 switch (verb = iter.next(pts, false)) { in onFilterPath()
68 moveTo = pts[0]; in onFilterPath()
71 dst->moveTo(pts[0]); in onFilterPath()
76 bool drawSegment = ComputeStep(pts[0], pts[1], fRadius, &step); in onFilterPath()
82 dst->quadTo(pts[0].fX, pts[0].fY, pts[0].fX + step.fX, in onFilterPath()
83 pts[0].fY + step.fY); in onFilterPath()
86 dst->lineTo(pts[1].fX - step.fX, pts[1].fY - step.fY); in onFilterPath()
88 lastCorner = pts[1]; in onFilterPath()
95 dst->moveTo(pts[0]); in onFilterPath()
[all …]
|