/external/skia/samplecode/ |
D | SampleHairCurves.cpp | 42 SkScalar pts[] = { in onDrawContent() local 48 curves.moveTo(pts[0], pts[1]); in onDrawContent() 49 curves.cubicTo(pts[2], pts[3], in onDrawContent() 50 pts[4], pts[5], in onDrawContent() 51 pts[6], pts[7]); in onDrawContent() 53 hulls.moveTo(pts[0], pts[1]); in onDrawContent() 54 hulls.lineTo(pts[2], pts[3]); in onDrawContent() 55 hulls.lineTo(pts[4], pts[5]); in onDrawContent() 56 hulls.lineTo(pts[6], pts[7]); in onDrawContent() 58 ctrlPts.addCircle(pts[0], pts[1], SK_Scalar1 / 200); in onDrawContent() [all …]
|
D | SampleAAGeometry.cpp | 99 SkPoint pts[4]; 103 while ((verb = iter.next(pts)) != SkPath::kDone_Verb) { 115 SkPoint pts[4]; in get_path_weight() local 119 while ((verb = iter.next(pts)) != SkPath::kDone_Verb) { in get_path_weight() 131 SkPoint pts[4]; in set_path_pt() local 136 while ((verb = iter.next(pts)) != SkPath::kDone_Verb) { in set_path_pt() 159 pts[index - startIndex] = pt; in set_path_pt() 164 result.moveTo(pts[0]); in set_path_pt() 167 result.lineTo(pts[1]); in set_path_pt() 171 result.quadTo(pts[1], pts[2]); in set_path_pt() [all …]
|
D | SampleGradients.cpp | 14 SkPoint pts[] = { { r.fLeft, r.fTop }, { r.fRight, r.fTop } }; in setgrad() local 15 return SkGradientShader::MakeLinear(pts, colors, nullptr, 2, SkShader::kClamp_TileMode); in setgrad() 65 static sk_sp<SkShader> MakeLinear(const SkPoint pts[2], const GradData& data, SkShader::TileMode tm… in MakeLinear() 66 return SkGradientShader::MakeLinear(pts, data.fColors, data.fPos, data.fCount, tm); in MakeLinear() 69 static sk_sp<SkShader> MakeRadial(const SkPoint pts[2], const GradData& data, SkShader::TileMode tm… in MakeRadial() 71 center.set(SkScalarAve(pts[0].fX, pts[1].fX), in MakeRadial() 72 SkScalarAve(pts[0].fY, pts[1].fY)); in MakeRadial() 77 static sk_sp<SkShader> MakeSweep(const SkPoint pts[2], const GradData& data, SkShader::TileMode tm)… in MakeSweep() 79 center.set(SkScalarAve(pts[0].fX, pts[1].fX), in MakeSweep() 80 SkScalarAve(pts[0].fY, pts[1].fY)); in MakeSweep() [all …]
|
/external/skqp/samplecode/ |
D | SampleHairCurves.cpp | 42 SkScalar pts[] = { in onDrawContent() local 48 curves.moveTo(pts[0], pts[1]); in onDrawContent() 49 curves.cubicTo(pts[2], pts[3], in onDrawContent() 50 pts[4], pts[5], in onDrawContent() 51 pts[6], pts[7]); in onDrawContent() 53 hulls.moveTo(pts[0], pts[1]); in onDrawContent() 54 hulls.lineTo(pts[2], pts[3]); in onDrawContent() 55 hulls.lineTo(pts[4], pts[5]); in onDrawContent() 56 hulls.lineTo(pts[6], pts[7]); in onDrawContent() 58 ctrlPts.addCircle(pts[0], pts[1], SK_Scalar1 / 200); in onDrawContent() [all …]
|
D | SampleAAGeometry.cpp | 99 SkPoint pts[4]; 103 while ((verb = iter.next(pts)) != SkPath::kDone_Verb) { 115 SkPoint pts[4]; in get_path_weight() local 119 while ((verb = iter.next(pts)) != SkPath::kDone_Verb) { in get_path_weight() 131 SkPoint pts[4]; in set_path_pt() local 136 while ((verb = iter.next(pts)) != SkPath::kDone_Verb) { in set_path_pt() 159 pts[index - startIndex] = pt; in set_path_pt() 164 result.moveTo(pts[0]); in set_path_pt() 167 result.lineTo(pts[1]); in set_path_pt() 171 result.quadTo(pts[1], pts[2]); in set_path_pt() [all …]
|
D | SampleGradients.cpp | 14 SkPoint pts[] = { { r.fLeft, r.fTop }, { r.fRight, r.fTop } }; in setgrad() local 15 return SkGradientShader::MakeLinear(pts, colors, nullptr, 2, SkShader::kClamp_TileMode); in setgrad() 65 static sk_sp<SkShader> MakeLinear(const SkPoint pts[2], const GradData& data, SkShader::TileMode tm… in MakeLinear() 66 return SkGradientShader::MakeLinear(pts, data.fColors, data.fPos, data.fCount, tm); in MakeLinear() 69 static sk_sp<SkShader> MakeRadial(const SkPoint pts[2], const GradData& data, SkShader::TileMode tm… in MakeRadial() 71 center.set(SkScalarAve(pts[0].fX, pts[1].fX), in MakeRadial() 72 SkScalarAve(pts[0].fY, pts[1].fY)); in MakeRadial() 77 static sk_sp<SkShader> MakeSweep(const SkPoint pts[2], const GradData& data, SkShader::TileMode tm)… in MakeSweep() 79 center.set(SkScalarAve(pts[0].fX, pts[1].fX), in MakeSweep() 80 SkScalarAve(pts[0].fY, pts[1].fY)); in MakeSweep() [all …]
|
/external/skia/src/pathops/ |
D | SkAddIntersections.cpp | 13 static void debugShowLineIntersection(int pts, const SkIntersectionHelper& wt, in debugShowLineIntersection() argument 15 SkASSERT(i.used() == pts); in debugShowLineIntersection() 16 if (!pts) { in debugShowLineIntersection() 18 __FUNCTION__, LINE_DEBUG_DATA(wt.pts()), LINE_DEBUG_DATA(wn.pts())); in debugShowLineIntersection() 22 i[0][0], LINE_DEBUG_DATA(wt.pts()), PT_DEBUG_DATA(i, 0)); in debugShowLineIntersection() 23 if (pts == 2) { in debugShowLineIntersection() 26 SkDebugf(" wnTs[0]=%g " LINE_DEBUG_STR, i[1][0], LINE_DEBUG_DATA(wn.pts())); in debugShowLineIntersection() 27 if (pts == 2) { in debugShowLineIntersection() 33 static void debugShowQuadLineIntersection(int pts, const SkIntersectionHelper& wt, in debugShowQuadLineIntersection() argument 36 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 …]
|
/external/skqp/src/pathops/ |
D | SkAddIntersections.cpp | 13 static void debugShowLineIntersection(int pts, const SkIntersectionHelper& wt, in debugShowLineIntersection() argument 15 SkASSERT(i.used() == pts); in debugShowLineIntersection() 16 if (!pts) { in debugShowLineIntersection() 18 __FUNCTION__, LINE_DEBUG_DATA(wt.pts()), LINE_DEBUG_DATA(wn.pts())); in debugShowLineIntersection() 22 i[0][0], LINE_DEBUG_DATA(wt.pts()), PT_DEBUG_DATA(i, 0)); in debugShowLineIntersection() 23 if (pts == 2) { in debugShowLineIntersection() 26 SkDebugf(" wnTs[0]=%g " LINE_DEBUG_STR, i[1][0], LINE_DEBUG_DATA(wn.pts())); in debugShowLineIntersection() 27 if (pts == 2) { in debugShowLineIntersection() 33 static void debugShowQuadLineIntersection(int pts, const SkIntersectionHelper& wt, in debugShowQuadLineIntersection() argument 36 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 …]
|
/external/skia/gm/ |
D | gradients_2pt_conical.cpp | 41 static sk_sp<SkShader> Make2ConicalOutside(const SkPoint pts[2], const GradData& data, in Make2ConicalOutside() 44 SkScalar radius0 = (pts[1].fX - pts[0].fX) / 10; in Make2ConicalOutside() 45 SkScalar radius1 = (pts[1].fX - pts[0].fX) / 3; in Make2ConicalOutside() 46 center0.set(pts[0].fX + radius0, pts[0].fY + radius0); in Make2ConicalOutside() 47 center1.set(pts[1].fX - radius1, pts[1].fY - radius1); in Make2ConicalOutside() 52 static sk_sp<SkShader> Make2ConicalOutsideStrip(const SkPoint pts[2], const GradData& data, in Make2ConicalOutsideStrip() 55 SkScalar radius = (pts[1].fX - pts[0].fX) / 3; in Make2ConicalOutsideStrip() 56 center0.set(pts[0].fX, pts[0].fY); in Make2ConicalOutsideStrip() 57 center1.set(pts[1].fX, pts[1].fY); in Make2ConicalOutsideStrip() 62 static sk_sp<SkShader> Make2ConicalOutsideFlip(const SkPoint pts[2], const GradData& data, in Make2ConicalOutsideFlip() [all …]
|
/external/skqp/gm/ |
D | gradients_2pt_conical.cpp | 41 static sk_sp<SkShader> Make2ConicalOutside(const SkPoint pts[2], const GradData& data, in Make2ConicalOutside() 44 SkScalar radius0 = (pts[1].fX - pts[0].fX) / 10; in Make2ConicalOutside() 45 SkScalar radius1 = (pts[1].fX - pts[0].fX) / 3; in Make2ConicalOutside() 46 center0.set(pts[0].fX + radius0, pts[0].fY + radius0); in Make2ConicalOutside() 47 center1.set(pts[1].fX - radius1, pts[1].fY - radius1); in Make2ConicalOutside() 52 static sk_sp<SkShader> Make2ConicalOutsideStrip(const SkPoint pts[2], const GradData& data, in Make2ConicalOutsideStrip() 55 SkScalar radius = (pts[1].fX - pts[0].fX) / 3; in Make2ConicalOutsideStrip() 56 center0.set(pts[0].fX, pts[0].fY); in Make2ConicalOutsideStrip() 57 center1.set(pts[1].fX, pts[1].fY); in Make2ConicalOutsideStrip() 62 static sk_sp<SkShader> Make2ConicalOutsideFlip(const SkPoint pts[2], const GradData& data, in Make2ConicalOutsideFlip() [all …]
|
/external/skqp/src/core/ |
D | SkEdgeClipper.cpp | 51 const SkPoint pts[] = { p0, p1 }; in clipLine() local 52 int lineCount = SkLineClipper::ClipLine(pts, clip, lines, fCanCullToTheRight); in clipLine() 84 static bool chopMonoQuadAtY(SkPoint pts[3], SkScalar y, SkScalar* t) { in chopMonoQuadAtY() 85 return chopMonoQuadAt(pts[0].fY, pts[1].fY, pts[2].fY, y, t); in chopMonoQuadAtY() 88 static bool chopMonoQuadAtX(SkPoint pts[3], SkScalar x, SkScalar* t) { in chopMonoQuadAtX() 89 return chopMonoQuadAt(pts[0].fX, pts[1].fX, pts[2].fX, x, t); in chopMonoQuadAtX() 93 static void chop_quad_in_Y(SkPoint pts[3], const SkRect& clip) { in chop_quad_in_Y() 98 if (pts[0].fY < clip.fTop) { in chop_quad_in_Y() 99 if (chopMonoQuadAtY(pts, clip.fTop, &t)) { in chop_quad_in_Y() 101 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 56 dst->lineTo(pts[1]); in SkPathMeasure_segTo() 58 dst->lineTo(SkScalarInterp(pts[0].fX, pts[1].fX, stopT), in SkPathMeasure_segTo() 59 SkScalarInterp(pts[0].fY, pts[1].fY, stopT)); in SkPathMeasure_segTo() 65 dst->quadTo(pts[1], pts[2]); in SkPathMeasure_segTo() 67 SkChopQuadAt(pts, tmp0, stopT); in SkPathMeasure_segTo() 71 SkChopQuadAt(pts, tmp0, startT); in SkPathMeasure_segTo() 81 SkConic conic(pts[0], pts[2], pts[3], pts[1].fX); in SkPathMeasure_segTo() 108 dst->cubicTo(pts[1], pts[2], pts[3]); in SkPathMeasure_segTo() 110 SkChopCubicAt(pts, tmp0, stopT); in SkPathMeasure_segTo() [all …]
|
D | SkScan_Hairline.cpp | 59 SkPoint pts[2]; in HairLineRgn() local 63 if (!SkLineClipper::IntersectLine(&array[i], fixedBounds, pts)) { in HairLineRgn() 69 if (clip && !SkLineClipper::IntersectLine(pts, clipBounds, pts)) { in HairLineRgn() 73 SkFDot6 x0 = SkScalarToFDot6(pts[0].fX); in HairLineRgn() 74 SkFDot6 y0 = SkScalarToFDot6(pts[0].fY); in HairLineRgn() 75 SkFDot6 x1 = SkScalarToFDot6(pts[1].fX); in HairLineRgn() 76 SkFDot6 y1 = SkScalarToFDot6(pts[1].fY); in HairLineRgn() 197 static uint32_t compute_int_quad_dist(const SkPoint pts[3]) { in compute_int_quad_dist() 200 SkScalar dx = SkScalarHalf(pts[0].fX + pts[2].fX) - pts[1].fX; in compute_int_quad_dist() 201 SkScalar dy = SkScalarHalf(pts[0].fY + pts[2].fY) - pts[1].fY; in compute_int_quad_dist() [all …]
|
D | SkPath.cpp | 44 SkPoint pts[4]; in is_degenerate() local 45 return SkPath::kDone_Verb == iter.next(pts); in is_degenerate() 284 SkPoint pts[4]; in conservativelyContainsRect() local 289 while ((verb = iter.next(pts, true, true)) != kDone_Verb) { in conservativelyContainsRect() 295 firstPt = prevPt = pts[0]; in conservativelyContainsRect() 322 orig.set(pts, iter.conicWeight()); in conservativelyContainsRect() 334 if (!check_edge_against_rect(prevPt, pts[nextPt], rect, direction)) { in conservativelyContainsRect() 338 prevPt = pts[nextPt]; in conservativelyContainsRect() 387 const SkPoint* pts = fPathRef->points(); in isLine() local 388 line[0] = pts[0]; in isLine() [all …]
|
/external/skia/src/core/ |
D | SkEdgeClipper.cpp | 51 const SkPoint pts[] = { p0, p1 }; in clipLine() local 52 int lineCount = SkLineClipper::ClipLine(pts, clip, lines, fCanCullToTheRight); in clipLine() 84 static bool chopMonoQuadAtY(SkPoint pts[3], SkScalar y, SkScalar* t) { in chopMonoQuadAtY() 85 return chopMonoQuadAt(pts[0].fY, pts[1].fY, pts[2].fY, y, t); in chopMonoQuadAtY() 88 static bool chopMonoQuadAtX(SkPoint pts[3], SkScalar x, SkScalar* t) { in chopMonoQuadAtX() 89 return chopMonoQuadAt(pts[0].fX, pts[1].fX, pts[2].fX, x, t); in chopMonoQuadAtX() 93 static void chop_quad_in_Y(SkPoint pts[3], const SkRect& clip) { in chop_quad_in_Y() 98 if (pts[0].fY < clip.fTop) { in chop_quad_in_Y() 99 if (chopMonoQuadAtY(pts, clip.fTop, &t)) { in chop_quad_in_Y() 101 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 56 dst->lineTo(pts[1]); in SkPathMeasure_segTo() 58 dst->lineTo(SkScalarInterp(pts[0].fX, pts[1].fX, stopT), in SkPathMeasure_segTo() 59 SkScalarInterp(pts[0].fY, pts[1].fY, stopT)); in SkPathMeasure_segTo() 65 dst->quadTo(pts[1], pts[2]); in SkPathMeasure_segTo() 67 SkChopQuadAt(pts, tmp0, stopT); in SkPathMeasure_segTo() 71 SkChopQuadAt(pts, tmp0, startT); in SkPathMeasure_segTo() 81 SkConic conic(pts[0], pts[2], pts[3], pts[1].fX); in SkPathMeasure_segTo() 108 dst->cubicTo(pts[1], pts[2], pts[3]); in SkPathMeasure_segTo() 110 SkChopCubicAt(pts, tmp0, stopT); in SkPathMeasure_segTo() [all …]
|
D | SkPath.cpp | 45 SkPoint pts[4]; in is_degenerate() local 46 return SkPath::kDone_Verb == iter.next(pts); in is_degenerate() 285 SkPoint pts[4]; in conservativelyContainsRect() local 290 while ((verb = iter.next(pts, true, true)) != kDone_Verb) { in conservativelyContainsRect() 296 firstPt = prevPt = pts[0]; in conservativelyContainsRect() 323 orig.set(pts, iter.conicWeight()); in conservativelyContainsRect() 335 if (!check_edge_against_rect(prevPt, pts[nextPt], rect, direction)) { in conservativelyContainsRect() 339 prevPt = pts[nextPt]; in conservativelyContainsRect() 388 const SkPoint* pts = fPathRef->points(); in isLine() local 389 line[0] = pts[0]; in isLine() [all …]
|
D | SkScan_Hairline.cpp | 59 SkPoint pts[2]; in HairLineRgn() local 63 if (!SkLineClipper::IntersectLine(&array[i], fixedBounds, pts)) { in HairLineRgn() 69 if (clip && !SkLineClipper::IntersectLine(pts, clipBounds, pts)) { in HairLineRgn() 73 SkFDot6 x0 = SkScalarToFDot6(pts[0].fX); in HairLineRgn() 74 SkFDot6 y0 = SkScalarToFDot6(pts[0].fY); in HairLineRgn() 75 SkFDot6 x1 = SkScalarToFDot6(pts[1].fX); in HairLineRgn() 76 SkFDot6 y1 = SkScalarToFDot6(pts[1].fY); in HairLineRgn() 197 static uint32_t compute_int_quad_dist(const SkPoint pts[3]) { in compute_int_quad_dist() 200 SkScalar dx = SkScalarHalf(pts[0].fX + pts[2].fX) - pts[1].fX; in compute_int_quad_dist() 201 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/skqp/src/effects/ |
D | SkCornerPathEffect.cpp | 40 SkPoint pts[4]; in filterPath() local 54 switch (verb = iter.next(pts, false)) { in filterPath() 62 moveTo = pts[0]; in filterPath() 65 dst->moveTo(pts[0]); in filterPath() 70 bool drawSegment = ComputeStep(pts[0], pts[1], fRadius, &step); in filterPath() 76 dst->quadTo(pts[0].fX, pts[0].fY, pts[0].fX + step.fX, in filterPath() 77 pts[0].fY + step.fY); in filterPath() 80 dst->lineTo(pts[1].fX - step.fX, pts[1].fY - step.fY); in filterPath() 82 lastCorner = pts[1]; in filterPath() 89 dst->moveTo(pts[0]); in filterPath() [all …]
|