| /external/skia/gm/ |
| shadertext.cpp | 22 SkPoint pts[] = { { 0, 0 }, { s, s } }; local
34 paint.setShader(SkGradientShader::CreateLinear(pts, colors, pos,
65 static SkShader* MakeLinear(const SkPoint pts[2], const GradData& data,
67 return SkGradientShader::CreateLinear(pts, data.fColors, data.fPos,
71 static SkShader* MakeRadial(const SkPoint pts[2], const GradData& data,
74 center.set(SkScalarAve(pts[0].fX, pts[1].fX),
75 SkScalarAve(pts[0].fY, pts[1].fY));
80 static SkShader* MakeSweep(const SkPoint pts[2], const GradData& data
132 SkPoint pts[2] = { local
[all...] |
| composeshader.cpp | 24 SkPoint pts[2]; local
27 pts[0].set(0, 0);
28 pts[1].set(SkIntToScalar(100), 0);
31 SkShader* shaderA = SkGradientShader::CreateLinear(pts, colors, NULL, 2,
34 pts[0].set(0, 0);
35 pts[1].set(0, SkIntToScalar(100));
38 SkShader* shaderB = SkGradientShader::CreateLinear(pts, colors, NULL, 2,
|
| gradientDirtyLaundry.cpp | 38 static SkShader* MakeLinear(const SkPoint pts[2], const GradData& data,
40 return SkGradientShader::CreateLinear(pts, data.fColors, data.fPos,
44 static SkShader* MakeRadial(const SkPoint pts[2], const GradData& data,
47 center.set(SkScalarAve(pts[0].fX, pts[1].fX),
48 SkScalarAve(pts[0].fY, pts[1].fY));
53 static SkShader* MakeSweep(const SkPoint pts[2], const GradData& data,
56 center.set(SkScalarAve(pts[0].fX, pts[1].fX)
82 SkPoint pts[2] = { { 0, 0 }, variable
[all...] |
| gradients.cpp | 42 static SkShader* MakeLinear(const SkPoint pts[2], const GradData& data,
44 return SkGradientShader::CreateLinear(pts, data.fColors, data.fPos,
48 static SkShader* MakeRadial(const SkPoint pts[2], const GradData& data,
51 center.set(SkScalarAve(pts[0].fX, pts[1].fX),
52 SkScalarAve(pts[0].fY, pts[1].fY));
57 static SkShader* MakeSweep(const SkPoint pts[2], const GradData& data,
60 center.set(SkScalarAve(pts[0].fX, pts[1].fX)
115 SkPoint pts[2] = { local
168 SkPoint pts[2] = { local
[all...] |
| /external/chromium_org/third_party/skia/src/pathops/ |
| SkPathOpsQuad.h | 14 const SkDQuad& first() const { return (const SkDQuad&) pts[0]; }
15 const SkDQuad& second() const { return (const SkDQuad&) pts[2]; }
16 SkDPoint pts[5]; member in struct:SkDQuadPair
27 void set(const SkPoint pts[3]) {
28 fPts[0] = pts[0];
29 fPts[1] = pts[1];
30 fPts[2] = pts[2];
56 static SkDPoint SubDivide(const SkPoint pts[3], const SkDPoint& a, const SkDPoint& c,
59 quad.set(pts);
|
| SkOpEdgeBuilder.cpp | 69 SkPoint pts[4]; local
73 verb = iter.next(pts);
80 fPathPts.push_back(pts[0]);
81 curveStart = curve[0] = pts[0];
85 if (AlmostEqualUlps(curve[0].fX, pts[1].fX)
86 && AlmostEqualUlps(curve[0].fY, pts[1].fY)) {
91 curve[1] = pts[1];
92 curve[2] = pts[2];
93 verb = SkReduceOrder::Quad(curve, pts);
99 const SkPoint* quadPts = quadder.computeQuads(pts, iter.conicWeight()
[all...] |
| SkReduceOrder.h | 30 static SkPath::Verb Cubic(const SkPoint pts[4], SkPoint* reducePts);
31 static SkPath::Verb Quad(const SkPoint pts[3], SkPoint* reducePts);
|
| /external/skia/src/pathops/ |
| SkPathOpsQuad.h | 14 const SkDQuad& first() const { return (const SkDQuad&) pts[0]; }
15 const SkDQuad& second() const { return (const SkDQuad&) pts[2]; }
16 SkDPoint pts[5]; member in struct:SkDQuadPair
27 void set(const SkPoint pts[3]) {
28 fPts[0] = pts[0];
29 fPts[1] = pts[1];
30 fPts[2] = pts[2];
56 static SkDPoint SubDivide(const SkPoint pts[3], const SkDPoint& a, const SkDPoint& c,
59 quad.set(pts);
|
| SkOpEdgeBuilder.cpp | 69 SkPoint pts[4]; local
73 verb = iter.next(pts);
80 fPathPts.push_back(pts[0]);
81 curveStart = curve[0] = pts[0];
85 if (AlmostEqualUlps(curve[0].fX, pts[1].fX)
86 && AlmostEqualUlps(curve[0].fY, pts[1].fY)) {
91 curve[1] = pts[1];
92 curve[2] = pts[2];
93 verb = SkReduceOrder::Quad(curve, pts);
99 const SkPoint* quadPts = quadder.computeQuads(pts, iter.conicWeight()
[all...] |
| SkReduceOrder.h | 30 static SkPath::Verb Cubic(const SkPoint pts[4], SkPoint* reducePts);
31 static SkPath::Verb Quad(const SkPoint pts[3], SkPoint* reducePts);
|
| /external/eigen/unsupported/test/ |
| splines.cpp | 109 MatrixXd pts(10,3);
110 pts << 0.707620811535916, 0.510258911240815, 0.417485437023409,
120 pts.transposeInPlace();
125 VERIFY( (pt - pts.col(i)).norm() < 1e-14 );
136 MatrixXd pts(11,3);
137 pts << 0.959743958516081, 0.340385726666133, 0.585267750979777,
148 pts.transposeInPlace();
153 VERIFY( (pt - pts.col(i)).norm() < 1e-14 );
175 MatrixXd pts(12,2);
176 pts << -0.370967741935484, 0.236842105263158
[all...] |
| /external/chromium_org/third_party/skia/src/core/ |
| SkPathMeasure.cpp | 59 static bool quad_too_curvy(const SkPoint pts[3]) {
62 SkScalar dx = SkScalarHalf(pts[1].fX) -
63 SkScalarHalf(SkScalarHalf(pts[0].fX + pts[2].fX));
64 SkScalar dy = SkScalarHalf(pts[1].fY) -
65 SkScalarHalf(SkScalarHalf(pts[0].fY + pts[2].fY));
78 static bool cubic_too_curvy(const SkPoint pts[4]) {
79 return cheap_dist_exceeds_limit(pts[1],
80 SkScalarInterp(pts[0].fX, pts[3].fX, SK_Scalar1/3)
137 SkPoint pts[4]; local
[all...] |
| SkStroke.cpp | 103 void quad_to(const SkPoint pts[3],
107 void cubic_to(const SkPoint pts[4],
237 void SkPathStroker::quad_to(const SkPoint pts[3],
241 if (!set_normal_unitnormal(pts[1], pts[2], fRadius,
243 // pts[1] nearly equals pts[2], so just draw a line to pts[2]
244 this->line_to(pts[2], normalAB);
254 SkChopQuadAtHalf(pts, tmp)
373 SkPoint pts[3], tmp[5]; local
434 SkPoint pts[4], tmp[13]; local
574 SkPoint pts[4]; local
653 SkPoint pts[8]; local
[all...] |
| SkScan_Hairline.cpp | 48 SkPoint pts[2] = { pt0, pt1 };
57 if (!SkLineClipper::IntersectLine(pts, fixedBounds, pts)) {
67 if (!SkLineClipper::IntersectLine(pts, r, pts)) {
72 SkFDot6 x0 = SkScalarToFDot6(pts[0].fX);
73 SkFDot6 y0 = SkScalarToFDot6(pts[0].fY);
74 SkFDot6 x1 = SkScalarToFDot6(pts[1].fX);
75 SkFDot6 y1 = SkScalarToFDot6(pts[1].fY);
196 static int compute_int_quad_dist(const SkPoint pts[3])
[all...] |
| SkPath.cpp | 41 SkPoint pts[4]; local
42 return SkPath::kDone_Verb == iter.next(pts);
307 SkPoint pts[4]; local
312 while ((verb = iter.next(pts)) != kDone_Verb) {
318 firstPt = prevPt = pts[0];
343 if (!check_edge_against_rect(prevPt, pts[nextPt], rect, direction)) {
346 prevPt = pts[nextPt];
394 const SkPoint* pts = fPathRef->points(); local
395 line[0] = pts[0];
396 line[1] = pts[1]
443 const SkPoint* pts = *ptsPtr; local
539 const SkPoint* pts = fPathRef->points(); local
550 const SkPoint* pts = fPathRef->points(); local
557 const SkPoint* pts = fPathRef->points(); local
764 SkPoint* pts = ed.growForVerb(kQuad_Verb); local
796 SkPoint* pts = ed.growForConic(w); local
821 SkPoint* pts = ed.growForVerb(kCubic_Verb); local
1285 SkPoint pts[kSkBuildQuadArcStorage]; local
1312 SkPoint pts[kSkBuildQuadArcStorage]; local
1375 SkPoint pts[kSkBuildQuadArcStorage]; local
1406 SkPoint pts[4]; local
1473 const SkPoint* pts = path.fPathRef->points() + 1; local
1511 const SkPoint* pts = path.fPathRef->points(); local
1551 const SkPoint* pts = src.fPathRef->pointsEnd(); local
1649 SkPoint pts[4]; local
1949 SkPoint* SK_RESTRICT pts = ptsParam; local
2181 SkPoint pts[4]; local
2385 SkPoint pts[4]; local
2442 const SkPoint* pts() const { return fCurrPt; } function in class:ContourIter
2681 const SkPoint* pts = iter.pts(); local
[all...] |
| SkEdge.cpp | 177 int SkQuadraticEdge::setQuadratic(const SkPoint pts[3], int shift)
184 x0 = int(pts[0].fX * scale);
185 y0 = int(pts[0].fY * scale);
186 x1 = int(pts[1].fX * scale);
187 y1 = int(pts[1].fY * scale);
188 x2 = int(pts[2].fX * scale);
189 y2 = int(pts[2].fY * scale);
192 x0 = pts[0].fX >> shift;
193 y0 = pts[0].fY >> shift;
194 x1 = pts[1].fX >> shift
[all...] |
| /external/skia/src/core/ |
| SkPathMeasure.cpp | 59 static bool quad_too_curvy(const SkPoint pts[3]) {
62 SkScalar dx = SkScalarHalf(pts[1].fX) -
63 SkScalarHalf(SkScalarHalf(pts[0].fX + pts[2].fX));
64 SkScalar dy = SkScalarHalf(pts[1].fY) -
65 SkScalarHalf(SkScalarHalf(pts[0].fY + pts[2].fY));
78 static bool cubic_too_curvy(const SkPoint pts[4]) {
79 return cheap_dist_exceeds_limit(pts[1],
80 SkScalarInterp(pts[0].fX, pts[3].fX, SK_Scalar1/3)
137 SkPoint pts[4]; local
[all...] |
| SkStroke.cpp | 103 void quad_to(const SkPoint pts[3],
107 void cubic_to(const SkPoint pts[4],
237 void SkPathStroker::quad_to(const SkPoint pts[3],
241 if (!set_normal_unitnormal(pts[1], pts[2], fRadius,
243 // pts[1] nearly equals pts[2], so just draw a line to pts[2]
244 this->line_to(pts[2], normalAB);
254 SkChopQuadAtHalf(pts, tmp)
373 SkPoint pts[3], tmp[5]; local
434 SkPoint pts[4], tmp[13]; local
574 SkPoint pts[4]; local
653 SkPoint pts[8]; local
[all...] |
| SkScan_Hairline.cpp | 48 SkPoint pts[2] = { pt0, pt1 };
57 if (!SkLineClipper::IntersectLine(pts, fixedBounds, pts)) {
67 if (!SkLineClipper::IntersectLine(pts, r, pts)) {
72 SkFDot6 x0 = SkScalarToFDot6(pts[0].fX);
73 SkFDot6 y0 = SkScalarToFDot6(pts[0].fY);
74 SkFDot6 x1 = SkScalarToFDot6(pts[1].fX);
75 SkFDot6 y1 = SkScalarToFDot6(pts[1].fY);
196 static int compute_int_quad_dist(const SkPoint pts[3])
[all...] |
| SkPath.cpp | 41 SkPoint pts[4]; local
42 return SkPath::kDone_Verb == iter.next(pts);
307 SkPoint pts[4]; local
312 while ((verb = iter.next(pts)) != kDone_Verb) {
318 firstPt = prevPt = pts[0];
343 if (!check_edge_against_rect(prevPt, pts[nextPt], rect, direction)) {
346 prevPt = pts[nextPt];
394 const SkPoint* pts = fPathRef->points(); local
395 line[0] = pts[0];
396 line[1] = pts[1]
443 const SkPoint* pts = *ptsPtr; local
539 const SkPoint* pts = fPathRef->points(); local
550 const SkPoint* pts = fPathRef->points(); local
557 const SkPoint* pts = fPathRef->points(); local
764 SkPoint* pts = ed.growForVerb(kQuad_Verb); local
796 SkPoint* pts = ed.growForConic(w); local
821 SkPoint* pts = ed.growForVerb(kCubic_Verb); local
1285 SkPoint pts[kSkBuildQuadArcStorage]; local
1312 SkPoint pts[kSkBuildQuadArcStorage]; local
1375 SkPoint pts[kSkBuildQuadArcStorage]; local
1406 SkPoint pts[4]; local
1473 const SkPoint* pts = path.fPathRef->points() + 1; local
1511 const SkPoint* pts = path.fPathRef->points(); local
1551 const SkPoint* pts = src.fPathRef->pointsEnd(); local
1649 SkPoint pts[4]; local
1949 SkPoint* SK_RESTRICT pts = ptsParam; local
2181 SkPoint pts[4]; local
2385 SkPoint pts[4]; local
2442 const SkPoint* pts() const { return fCurrPt; } function in class:ContourIter
2681 const SkPoint* pts = iter.pts(); local
[all...] |
| SkEdge.cpp | 177 int SkQuadraticEdge::setQuadratic(const SkPoint pts[3], int shift)
184 x0 = int(pts[0].fX * scale);
185 y0 = int(pts[0].fY * scale);
186 x1 = int(pts[1].fX * scale);
187 y1 = int(pts[1].fY * scale);
188 x2 = int(pts[2].fX * scale);
189 y2 = int(pts[2].fY * scale);
192 x0 = pts[0].fX >> shift;
193 y0 = pts[0].fY >> shift;
194 x1 = pts[1].fX >> shift
[all...] |
| /external/libvpx/libvpx/test/ |
| resize_test.cc | 67 vpx_codec_pts_t pts; local
72 pts = pkt->data.frame.pts;
74 mem_put_le32(header + 4, pts & 0xFFFFFFFF);
75 mem_put_le32(header + 8, pts >> 32);
125 : pts(_pts), w(_w), h(_h) {}
127 vpx_codec_pts_t pts; member in struct:__anon22937::ResizeTest::FrameInfo
138 vpx_codec_pts_t pts) {
139 frame_info_list_.push_back(FrameInfo(pts, img.d_w, img.d_h));
151 const vpx_codec_pts_t pts = info->pts local
252 const vpx_codec_pts_t pts = info->pts; local
[all...] |
| /external/eigen/unsupported/Eigen/src/Splines/ |
| SplineFitting.h | 58 * \param[in] pts The data points to which a spline should be fit.
64 void ChordLengths(const PointArrayType& pts, KnotVectorType& chord_lengths)
68 const DenseIndex n = pts.cols();
71 chord_lengths.resize(pts.cols());
73 chord_lengths.rightCols(n-1) = (pts.array().leftCols(n-1) - pts.array().rightCols(n-1)).matrix().colwise().norm();
95 * \param pts The points for which an interpolating spline will be computed.
101 static SplineType Interpolate(const PointArrayType& pts, DenseIndex degree);
106 * \param pts The points for which an interpolating spline will be computed.
113 static SplineType Interpolate(const PointArrayType& pts, DenseIndex degree, const KnotVectorType& knot_parameters)
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/state_trackers/vega/ |
| api_path.c | 438 VGfloat pts[] = {*minX, *minY,
444 matrix_map_point(matrix, pts[0], pts[1], pts + 0, pts + 1);
445 matrix_map_point(matrix, pts[2], pts[3], pts + 2, pts + 3);
446 matrix_map_point(matrix, pts[4], pts[5], pts + 4, pts + 5)
[all...] |
| /external/mesa3d/src/gallium/state_trackers/vega/ |
| api_path.c | 438 VGfloat pts[] = {*minX, *minY,
444 matrix_map_point(matrix, pts[0], pts[1], pts + 0, pts + 1);
445 matrix_map_point(matrix, pts[2], pts[3], pts + 2, pts + 3);
446 matrix_map_point(matrix, pts[4], pts[5], pts + 4, pts + 5)
[all...] |
