| /external/chromium_org/third_party/skia/src/pathops/ |
| D | SkAddIntersections.cpp | 12 static void debugShowLineIntersection(int pts, const SkIntersectionHelper& wt, in debugShowLineIntersection() argument
14 SkASSERT(i.used() == pts); in debugShowLineIntersection()
15 if (!pts) { in debugShowLineIntersection()
17 __FUNCTION__, LINE_DEBUG_DATA(wt.pts()), LINE_DEBUG_DATA(wn.pts())); in debugShowLineIntersection()
21 i[0][0], LINE_DEBUG_DATA(wt.pts()), PT_DEBUG_DATA(i, 0)); in debugShowLineIntersection()
22 if (pts == 2) { in debugShowLineIntersection()
25 SkDebugf(" wnTs[0]=%g " LINE_DEBUG_STR, i[1][0], LINE_DEBUG_DATA(wn.pts())); in debugShowLineIntersection()
26 if (pts == 2) { in debugShowLineIntersection()
32 static void debugShowQuadLineIntersection(int pts, const SkIntersectionHelper& wt, in debugShowQuadLineIntersection() argument
35 SkASSERT(i.used() == pts); in debugShowQuadLineIntersection()
[all …]
|
| D | SkLineParameters.h | 27 void cubicEndPoints(const SkDCubic& pts) { in cubicEndPoints() argument
29 cubicEndPoints(pts, 0, endIndex); in cubicEndPoints()
34 cubicEndPoints(pts, 0, ++endIndex); in cubicEndPoints()
40 cubicEndPoints(pts, 0, ++endIndex); // line in cubicEndPoints()
50 if (NotAlmostEqualUlps(pts[0].fY, pts[++endIndex].fY)) { in cubicEndPoints()
51 if (pts[0].fY > pts[endIndex].fY) { in cubicEndPoints()
60 if (pts[0].fY > pts[3].fY) { in cubicEndPoints()
65 void cubicEndPoints(const SkDCubic& pts, int s, int e) { in cubicEndPoints() argument
66 a = pts[s].fY - pts[e].fY; in cubicEndPoints()
67 b = pts[e].fX - pts[s].fX; in cubicEndPoints()
[all …]
|
| /external/skia/src/pathops/ |
| D | SkAddIntersections.cpp | 12 static void debugShowLineIntersection(int pts, const SkIntersectionHelper& wt, in debugShowLineIntersection() argument
14 SkASSERT(i.used() == pts); in debugShowLineIntersection()
15 if (!pts) { in debugShowLineIntersection()
17 __FUNCTION__, LINE_DEBUG_DATA(wt.pts()), LINE_DEBUG_DATA(wn.pts())); in debugShowLineIntersection()
21 i[0][0], LINE_DEBUG_DATA(wt.pts()), PT_DEBUG_DATA(i, 0)); in debugShowLineIntersection()
22 if (pts == 2) { in debugShowLineIntersection()
25 SkDebugf(" wnTs[0]=%g " LINE_DEBUG_STR, i[1][0], LINE_DEBUG_DATA(wn.pts())); in debugShowLineIntersection()
26 if (pts == 2) { in debugShowLineIntersection()
32 static void debugShowQuadLineIntersection(int pts, const SkIntersectionHelper& wt, in debugShowQuadLineIntersection() argument
35 SkASSERT(i.used() == pts); in debugShowQuadLineIntersection()
[all …]
|
| D | SkLineParameters.h | 27 void cubicEndPoints(const SkDCubic& pts) { in cubicEndPoints() argument
29 cubicEndPoints(pts, 0, endIndex); in cubicEndPoints()
34 cubicEndPoints(pts, 0, ++endIndex); in cubicEndPoints()
40 cubicEndPoints(pts, 0, ++endIndex); // line in cubicEndPoints()
50 if (NotAlmostEqualUlps(pts[0].fY, pts[++endIndex].fY)) { in cubicEndPoints()
51 if (pts[0].fY > pts[endIndex].fY) { in cubicEndPoints()
60 if (pts[0].fY > pts[3].fY) { in cubicEndPoints()
65 void cubicEndPoints(const SkDCubic& pts, int s, int e) { in cubicEndPoints() argument
66 a = pts[s].fY - pts[e].fY; in cubicEndPoints()
67 b = pts[e].fX - pts[s].fX; in cubicEndPoints()
[all …]
|
| /external/chromium_org/third_party/skia/src/core/ |
| D | SkEdgeClipper.cpp | 67 static bool chopMonoQuadAtY(SkPoint pts[3], SkScalar y, SkScalar* t) { in chopMonoQuadAtY()
68 return chopMonoQuadAt(pts[0].fY, pts[1].fY, pts[2].fY, y, t); in chopMonoQuadAtY()
71 static bool chopMonoQuadAtX(SkPoint pts[3], SkScalar x, SkScalar* t) { in chopMonoQuadAtX()
72 return chopMonoQuadAt(pts[0].fX, pts[1].fX, pts[2].fX, x, t); in chopMonoQuadAtX()
76 static void chop_quad_in_Y(SkPoint pts[3], const SkRect& clip) { in chop_quad_in_Y()
81 if (pts[0].fY < clip.fTop) { in chop_quad_in_Y()
82 if (chopMonoQuadAtY(pts, clip.fTop, &t)) { in chop_quad_in_Y()
84 SkChopQuadAt(pts, tmp, t); in chop_quad_in_Y()
89 pts[0] = tmp[2]; in chop_quad_in_Y()
90 pts[1] = tmp[3]; in chop_quad_in_Y()
[all …]
|
| D | SkPathMeasure.cpp | 59 static bool quad_too_curvy(const SkPoint pts[3]) { in quad_too_curvy()
62 SkScalar dx = SkScalarHalf(pts[1].fX) - in quad_too_curvy()
63 SkScalarHalf(SkScalarHalf(pts[0].fX + pts[2].fX)); in quad_too_curvy()
64 SkScalar dy = SkScalarHalf(pts[1].fY) - in quad_too_curvy()
65 SkScalarHalf(SkScalarHalf(pts[0].fY + pts[2].fY)); in quad_too_curvy()
78 static bool cubic_too_curvy(const SkPoint pts[4]) { in cubic_too_curvy()
79 return cheap_dist_exceeds_limit(pts[1], in cubic_too_curvy()
80 SkScalarInterp(pts[0].fX, pts[3].fX, SK_Scalar1/3), in cubic_too_curvy()
81 SkScalarInterp(pts[0].fY, pts[3].fY, SK_Scalar1/3)) in cubic_too_curvy()
83 cheap_dist_exceeds_limit(pts[2], in cubic_too_curvy()
[all …]
|
| D | SkPath.cpp | 34 SkPoint pts[4]; in is_degenerate() local
35 return SkPath::kDone_Verb == iter.next(pts); in is_degenerate()
246 SkPoint pts[4]; in conservativelyContainsRect() local
251 while ((verb = iter.next(pts)) != kDone_Verb) { in conservativelyContainsRect()
257 firstPt = prevPt = pts[0]; in conservativelyContainsRect()
282 if (!check_edge_against_rect(prevPt, pts[nextPt], rect, direction)) { in conservativelyContainsRect()
285 prevPt = pts[nextPt]; in conservativelyContainsRect()
333 const SkPoint* pts = fPathRef->points(); in isLine() local
334 line[0] = pts[0]; in isLine()
335 line[1] = pts[1]; in isLine()
[all …]
|
| D | SkStroke.cpp | 112 void quad_to(const SkPoint pts[3],
116 void cubic_to(const SkPoint pts[4],
246 void SkPathStroker::quad_to(const SkPoint pts[3], in quad_to()
250 if (!set_normal_unitnormal(pts[1], pts[2], fRadius, in quad_to()
253 this->line_to(pts[2], normalAB); in quad_to()
263 SkChopQuadAtHalf(pts, tmp); in quad_to()
269 normalB = pts[2] - pts[0]; in quad_to()
275 fOuter.quadTo( pts[1].fX + normalB.fX, pts[1].fY + normalB.fY, in quad_to()
276 pts[2].fX + normalBC->fX, pts[2].fY + normalBC->fY); in quad_to()
277 fInner.quadTo( pts[1].fX - normalB.fX, pts[1].fY - normalB.fY, in quad_to()
[all …]
|
| D | SkEdgeBuilder.cpp | 25 void SkEdgeBuilder::addLine(const SkPoint pts[]) { in addLine() argument
27 if (edge->setLine(pts[0], pts[1], fShiftUp)) { in addLine()
34 void SkEdgeBuilder::addQuad(const SkPoint pts[]) { in addQuad() argument
36 if (edge->setQuadratic(pts, fShiftUp)) { in addQuad()
43 void SkEdgeBuilder::addCubic(const SkPoint pts[]) { in addCubic() argument
45 if (edge->setCubic(pts, NULL, fShiftUp)) { in addCubic()
53 SkPoint pts[4]; in addClipper() local
56 while ((verb = clipper->next(pts)) != SkPath::kDone_Verb) { in addClipper()
59 this->addLine(pts); in addClipper()
62 this->addQuad(pts); in addClipper()
[all …]
|
| /external/skia/src/core/ |
| D | SkEdgeClipper.cpp | 67 static bool chopMonoQuadAtY(SkPoint pts[3], SkScalar y, SkScalar* t) { in chopMonoQuadAtY()
68 return chopMonoQuadAt(pts[0].fY, pts[1].fY, pts[2].fY, y, t); in chopMonoQuadAtY()
71 static bool chopMonoQuadAtX(SkPoint pts[3], SkScalar x, SkScalar* t) { in chopMonoQuadAtX()
72 return chopMonoQuadAt(pts[0].fX, pts[1].fX, pts[2].fX, x, t); in chopMonoQuadAtX()
76 static void chop_quad_in_Y(SkPoint pts[3], const SkRect& clip) { in chop_quad_in_Y()
81 if (pts[0].fY < clip.fTop) { in chop_quad_in_Y()
82 if (chopMonoQuadAtY(pts, clip.fTop, &t)) { in chop_quad_in_Y()
84 SkChopQuadAt(pts, tmp, t); in chop_quad_in_Y()
89 pts[0] = tmp[2]; in chop_quad_in_Y()
90 pts[1] = tmp[3]; in chop_quad_in_Y()
[all …]
|
| D | SkPathMeasure.cpp | 59 static bool quad_too_curvy(const SkPoint pts[3]) { in quad_too_curvy()
62 SkScalar dx = SkScalarHalf(pts[1].fX) - in quad_too_curvy()
63 SkScalarHalf(SkScalarHalf(pts[0].fX + pts[2].fX)); in quad_too_curvy()
64 SkScalar dy = SkScalarHalf(pts[1].fY) - in quad_too_curvy()
65 SkScalarHalf(SkScalarHalf(pts[0].fY + pts[2].fY)); in quad_too_curvy()
78 static bool cubic_too_curvy(const SkPoint pts[4]) { in cubic_too_curvy()
79 return cheap_dist_exceeds_limit(pts[1], in cubic_too_curvy()
80 SkScalarInterp(pts[0].fX, pts[3].fX, SK_Scalar1/3), in cubic_too_curvy()
81 SkScalarInterp(pts[0].fY, pts[3].fY, SK_Scalar1/3)) in cubic_too_curvy()
83 cheap_dist_exceeds_limit(pts[2], in cubic_too_curvy()
[all …]
|
| D | SkPath.cpp | 34 SkPoint pts[4]; in is_degenerate() local
35 return SkPath::kDone_Verb == iter.next(pts); in is_degenerate()
246 SkPoint pts[4]; in conservativelyContainsRect() local
251 while ((verb = iter.next(pts)) != kDone_Verb) { in conservativelyContainsRect()
257 firstPt = prevPt = pts[0]; in conservativelyContainsRect()
282 if (!check_edge_against_rect(prevPt, pts[nextPt], rect, direction)) { in conservativelyContainsRect()
285 prevPt = pts[nextPt]; in conservativelyContainsRect()
333 const SkPoint* pts = fPathRef->points(); in isLine() local
334 line[0] = pts[0]; in isLine()
335 line[1] = pts[1]; in isLine()
[all …]
|
| D | SkStroke.cpp | 112 void quad_to(const SkPoint pts[3],
116 void cubic_to(const SkPoint pts[4],
246 void SkPathStroker::quad_to(const SkPoint pts[3], in quad_to()
250 if (!set_normal_unitnormal(pts[1], pts[2], fRadius, in quad_to()
253 this->line_to(pts[2], normalAB); in quad_to()
263 SkChopQuadAtHalf(pts, tmp); in quad_to()
269 normalB = pts[2] - pts[0]; in quad_to()
275 fOuter.quadTo( pts[1].fX + normalB.fX, pts[1].fY + normalB.fY, in quad_to()
276 pts[2].fX + normalBC->fX, pts[2].fY + normalBC->fY); in quad_to()
277 fInner.quadTo( pts[1].fX - normalB.fX, pts[1].fY - normalB.fY, in quad_to()
[all …]
|
| D | SkEdgeBuilder.cpp | 25 void SkEdgeBuilder::addLine(const SkPoint pts[]) { in addLine() argument
27 if (edge->setLine(pts[0], pts[1], fShiftUp)) { in addLine()
34 void SkEdgeBuilder::addQuad(const SkPoint pts[]) { in addQuad() argument
36 if (edge->setQuadratic(pts, fShiftUp)) { in addQuad()
43 void SkEdgeBuilder::addCubic(const SkPoint pts[]) { in addCubic() argument
45 if (edge->setCubic(pts, NULL, fShiftUp)) { in addCubic()
53 SkPoint pts[4]; in addClipper() local
56 while ((verb = clipper->next(pts)) != SkPath::kDone_Verb) { in addClipper()
59 this->addLine(pts); in addClipper()
62 this->addQuad(pts); in addClipper()
[all …]
|
| /external/skia/gm/ |
| D | gradients_no_texture.cpp | 29 static SkShader* MakeLinear(const SkPoint pts[2], const GradData& data, in MakeLinear()
31 return SkGradientShader::CreateLinear(pts, data.fColors, data.fPos, in MakeLinear()
35 static SkShader* MakeRadial(const SkPoint pts[2], const GradData& data, in MakeRadial()
38 center.set(SkScalarAve(pts[0].fX, pts[1].fX), in MakeRadial()
39 SkScalarAve(pts[0].fY, pts[1].fY)); in MakeRadial()
44 static SkShader* MakeSweep(const SkPoint pts[2], const GradData& data, in MakeSweep()
47 center.set(SkScalarAve(pts[0].fX, pts[1].fX), in MakeSweep()
48 SkScalarAve(pts[0].fY, pts[1].fY)); in MakeSweep()
53 static SkShader* Make2Radial(const SkPoint pts[2], const GradData& data, in Make2Radial()
56 center0.set(SkScalarAve(pts[0].fX, pts[1].fX), in Make2Radial()
[all …]
|
| D | shadertext.cpp | 22 SkPoint pts[] = { { 0, 0 }, { s, s } }; in makebm() local
34 paint.setShader(SkGradientShader::CreateLinear(pts, colors, pos, in makebm()
65 static SkShader* MakeLinear(const SkPoint pts[2], const GradData& data, in MakeLinear()
67 return SkGradientShader::CreateLinear(pts, data.fColors, data.fPos, in MakeLinear()
71 static SkShader* MakeRadial(const SkPoint pts[2], const GradData& data, in MakeRadial()
74 center.set(SkScalarAve(pts[0].fX, pts[1].fX), in MakeRadial()
75 SkScalarAve(pts[0].fY, pts[1].fY)); in MakeRadial()
80 static SkShader* MakeSweep(const SkPoint pts[2], const GradData& data, in MakeSweep()
83 center.set(SkScalarAve(pts[0].fX, pts[1].fX), in MakeSweep()
84 SkScalarAve(pts[0].fY, pts[1].fY)); in MakeSweep()
[all …]
|
| D | gradients.cpp | 42 static SkShader* MakeLinear(const SkPoint pts[2], const GradData& data, in MakeLinear()
44 return SkGradientShader::CreateLinear(pts, data.fColors, data.fPos, in MakeLinear()
48 static SkShader* MakeRadial(const SkPoint pts[2], const GradData& data, in MakeRadial()
51 center.set(SkScalarAve(pts[0].fX, pts[1].fX), in MakeRadial()
52 SkScalarAve(pts[0].fY, pts[1].fY)); in MakeRadial()
57 static SkShader* MakeSweep(const SkPoint pts[2], const GradData& data, in MakeSweep()
60 center.set(SkScalarAve(pts[0].fX, pts[1].fX), in MakeSweep()
61 SkScalarAve(pts[0].fY, pts[1].fY)); in MakeSweep()
66 static SkShader* Make2Radial(const SkPoint pts[2], const GradData& data, in Make2Radial()
69 center0.set(SkScalarAve(pts[0].fX, pts[1].fX), in Make2Radial()
[all …]
|
| D | gradientDirtyLaundry.cpp | 38 static SkShader* MakeLinear(const SkPoint pts[2], const GradData& data, in MakeLinear()
40 return SkGradientShader::CreateLinear(pts, data.fColors, data.fPos, in MakeLinear()
44 static SkShader* MakeRadial(const SkPoint pts[2], const GradData& data, in MakeRadial()
47 center.set(SkScalarAve(pts[0].fX, pts[1].fX), in MakeRadial()
48 SkScalarAve(pts[0].fY, pts[1].fY)); in MakeRadial()
53 static SkShader* MakeSweep(const SkPoint pts[2], const GradData& data, in MakeSweep()
56 center.set(SkScalarAve(pts[0].fX, pts[1].fX), in MakeSweep()
57 SkScalarAve(pts[0].fY, pts[1].fY)); in MakeSweep()
63 typedef SkShader* (*GradMaker)(const SkPoint pts[2], const GradData& data,
82 SkPoint pts[2] = { { 0, 0 }, in onDraw() local
[all …]
|
| /external/skia/bench/ |
| D | GradientBench.cpp | 47 static SkShader* MakeLinear(const SkPoint pts[2], const GradData& data, in MakeLinear()
50 return SkGradientShader::CreateLinear(pts, data.fColors, data.fPos, in MakeLinear()
54 static 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()
66 static SkShader* MakeSweep(const SkPoint pts[2], const GradData& data, in MakeSweep()
70 center.set(SkScalarAve(pts[0].fX, pts[1].fX), in MakeSweep()
71 SkScalarAve(pts[0].fY, pts[1].fY)); in MakeSweep()
77 static SkShader* Make2Radial(const SkPoint pts[2], const GradData& data, in Make2Radial()
81 center0.set(SkScalarAve(pts[0].fX, pts[1].fX), in Make2Radial()
[all …]
|
| D | PathIterBench.cpp | 17 static int rand_pts(SkRandom& rand, SkPoint pts[4]) { in rand_pts()
22 pts[i].fX = rand.nextSScalar1(); in rand_pts()
23 pts[i].fY = rand.nextSScalar1(); in rand_pts()
40 SkPoint pts[4]; in PathIterBench() local
41 int n = rand_pts(rand, pts); in PathIterBench()
44 fPath.moveTo(pts[0]); in PathIterBench()
47 fPath.lineTo(pts[1]); in PathIterBench()
50 fPath.quadTo(pts[1], pts[2]); in PathIterBench()
53 fPath.cubicTo(pts[1], pts[2], pts[3]); in PathIterBench()
73 SkPoint pts[4]; in onDraw() local
[all …]
|
| /external/skia/src/effects/ |
| D | SkCornerPathEffect.cpp | 41 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 …]
|
| /external/chromium_org/third_party/skia/src/effects/ |
| D | SkCornerPathEffect.cpp | 41 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 …]
|
| /external/libvpx/libvpx/test/ |
| D | resize_test.cc | 67 vpx_codec_pts_t pts; in write_ivf_frame_header() local
72 pts = pkt->data.frame.pts; in write_ivf_frame_header()
74 mem_put_le32(header + 4, pts & 0xFFFFFFFF); in write_ivf_frame_header()
75 mem_put_le32(header + 8, pts >> 32); in write_ivf_frame_header()
125 : pts(_pts), w(_w), h(_h) {} in FrameInfo()
127 vpx_codec_pts_t pts; member
138 vpx_codec_pts_t pts) { in DecompressedFrameHook() argument
139 frame_info_list_.push_back(FrameInfo(pts, img.d_w, img.d_h)); in DecompressedFrameHook()
151 const vpx_codec_pts_t pts = info->pts; in TEST_P() local
152 const unsigned int expected_w = ScaleForFrameNumber(pts, kInitialWidth); in TEST_P()
[all …]
|
| /external/mesa3d/src/gallium/state_trackers/vega/ |
| D | api_path.c | 438 VGfloat pts[] = {*minX, *minY, in vegaPathTransformedBounds()
444 matrix_map_point(matrix, pts[0], pts[1], pts + 0, pts + 1); in vegaPathTransformedBounds()
445 matrix_map_point(matrix, pts[2], pts[3], pts + 2, pts + 3); in vegaPathTransformedBounds()
446 matrix_map_point(matrix, pts[4], pts[5], pts + 4, pts + 5); in vegaPathTransformedBounds()
447 matrix_map_point(matrix, pts[6], pts[7], pts + 6, pts + 7); in vegaPathTransformedBounds()
448 *minX = MIN2(pts[0], MIN2(pts[2], MIN2(pts[4], pts[6]))); in vegaPathTransformedBounds()
449 *minY = MIN2(pts[1], MIN2(pts[3], MIN2(pts[5], pts[7]))); in vegaPathTransformedBounds()
450 maxX = MAX2(pts[0], MAX2(pts[2], MAX2(pts[4], pts[6]))); in vegaPathTransformedBounds()
451 maxY = MAX2(pts[1], MAX2(pts[3], MAX2(pts[5], pts[7]))); in vegaPathTransformedBounds()
|
| /external/chromium_org/third_party/mesa/src/src/gallium/state_trackers/vega/ |
| D | api_path.c | 438 VGfloat pts[] = {*minX, *minY, in vegaPathTransformedBounds()
444 matrix_map_point(matrix, pts[0], pts[1], pts + 0, pts + 1); in vegaPathTransformedBounds()
445 matrix_map_point(matrix, pts[2], pts[3], pts + 2, pts + 3); in vegaPathTransformedBounds()
446 matrix_map_point(matrix, pts[4], pts[5], pts + 4, pts + 5); in vegaPathTransformedBounds()
447 matrix_map_point(matrix, pts[6], pts[7], pts + 6, pts + 7); in vegaPathTransformedBounds()
448 *minX = MIN2(pts[0], MIN2(pts[2], MIN2(pts[4], pts[6]))); in vegaPathTransformedBounds()
449 *minY = MIN2(pts[1], MIN2(pts[3], MIN2(pts[5], pts[7]))); in vegaPathTransformedBounds()
450 maxX = MAX2(pts[0], MAX2(pts[2], MAX2(pts[4], pts[6]))); in vegaPathTransformedBounds()
451 maxY = MAX2(pts[1], MAX2(pts[3], MAX2(pts[5], pts[7]))); in vegaPathTransformedBounds()
|