| /external/skqp/gm/ |
| bigmatrix.cpp | 38 path.addCircle(pt.fX, pt.fY, small);
43 SkRect rect = {pt.fX - small, pt.fY - small,
44 pt.fX + small, pt.fY + small};
63 rect.setLTRB(pt.fX - small, pt.fY - small,
64 pt.fX + small, pt.fY + small);
|
| /external/skqp/samplecode/ |
| SamplePathClip.cpp | 39 fCenter.fY - fOval.centerY());
63 fCenter.set(click->fCurr.fX, click->fCurr.fY);
77 if (p0.fY == p1.fY) {
81 if (p0.fY > p1.fY) {
85 if (p1.fY <= bounds.top() || p0.fY >= bounds.bottom()) {
89 double dxdy = (double)(p1.fX - p0.fX) / (p1.fY - p0.fY);
[all...] |
| SampleGradients.cpp | 72 SkScalarAve(pts[0].fY, pts[1].fY));
80 SkScalarAve(pts[0].fY, pts[1].fY));
81 return SkGradientShader::MakeSweep(center.fX, center.fY, data.fColors, data.fPos, data.fCount);
87 SkScalarAve(pts[0].fY, pts[1].fY));
89 SkScalarInterp(pts[0].fY, pts[1].fY, SkIntToScalar(1)/4));
100 SkScalarAve(pts[0].fY, pts[1].fY))
[all...] |
| /external/skia/samplecode/ |
| SampleGradients.cpp | 72 SkScalarAve(pts[0].fY, pts[1].fY));
80 SkScalarAve(pts[0].fY, pts[1].fY));
81 return SkGradientShader::MakeSweep(center.fX, center.fY, data.fColors, data.fPos, data.fCount);
87 SkScalarAve(pts[0].fY, pts[1].fY));
89 SkScalarInterp(pts[0].fY, pts[1].fY, SkIntToScalar(1)/4));
100 SkScalarAve(pts[0].fY, pts[1].fY))
[all...] |
| /external/skia/src/pathops/ |
| SkPathOpsCurve.cpp | 24 double minY = fCubic.fPts[0].fY;
27 minY = SkTMin(minY, fCubic.fPts[index].fY);
28 maxY = SkTMax(maxY, fCubic.fPts[index].fY);
30 if (!AlmostBetweenUlps(minY, xy.fY, maxY)) {
34 SkDLine perp = {{ xy, { xy.fX + opp.fY - xy.fY, xy.fY + xy.fX - opp.fX }}};
106 SkTAbs(fCurve[index].fY)));
111 && roughly_zero_when_compared_to(fSweep[0].fY, maxVal)) {
117 if (fSweep[0].fX == 0 && fSweep[0].fY == 0)
[all...] |
| SkDConicLineIntersection.cpp | 68 double conicVals[] = { fConic[0].fY, fConic[1].fY, fConic[2].fY };
82 SkDEBUGCODE(double conicVals[] = { fConic[0].fY, fConic[1].fY, fConic[2].fY });
83 SkOPOBJASSERT(fIntersections, close_to(pt.fY, axisIntercept, conicVals));
127 double opp = (*fLine)[1].fY - (*fLine)[0].fY;
130 r[n] = (fConic[n].fY - (*fLine)[0].fY) * adj - (fConic[n].fX - (*fLine)[0].fX) * opp
[all...] |
| SkDCubicLineIntersection.cpp | 123 double opp = fLine[1].fY - fLine[0].fY;
127 c[n].fX = (fCubic[n].fY - fLine[0].fY) * adj - (fCubic[n].fX - fLine[0].fX) * opp;
136 c[n].fY = (fCubic[n].fY - fLine[0].fY) * opp
169 SkDCubic::Coefficients(&c[0].fY, &A, &B, &C, &D);
174 if (!approximately_equal(calcPt.fY, axisIntercept)) {
176 int extrema = SkDCubic::FindExtrema(&c[0].fY, extremeTs)
[all...] |
| /external/skqp/src/pathops/ |
| SkPathOpsCurve.cpp | 24 double minY = fCubic.fPts[0].fY;
27 minY = SkTMin(minY, fCubic.fPts[index].fY);
28 maxY = SkTMax(maxY, fCubic.fPts[index].fY);
30 if (!AlmostBetweenUlps(minY, xy.fY, maxY)) {
34 SkDLine perp = {{ xy, { xy.fX + opp.fY - xy.fY, xy.fY + xy.fX - opp.fX }}};
106 SkTAbs(fCurve[index].fY)));
111 && roughly_zero_when_compared_to(fSweep[0].fY, maxVal)) {
117 if (fSweep[0].fX == 0 && fSweep[0].fY == 0)
[all...] |
| SkDConicLineIntersection.cpp | 68 double conicVals[] = { fConic[0].fY, fConic[1].fY, fConic[2].fY };
82 SkDEBUGCODE(double conicVals[] = { fConic[0].fY, fConic[1].fY, fConic[2].fY });
83 SkOPOBJASSERT(fIntersections, close_to(pt.fY, axisIntercept, conicVals));
127 double opp = (*fLine)[1].fY - (*fLine)[0].fY;
130 r[n] = (fConic[n].fY - (*fLine)[0].fY) * adj - (fConic[n].fX - (*fLine)[0].fX) * opp
[all...] |
| SkDCubicLineIntersection.cpp | 123 double opp = fLine[1].fY - fLine[0].fY;
127 c[n].fX = (fCubic[n].fY - fLine[0].fY) * adj - (fCubic[n].fX - fLine[0].fX) * opp;
136 c[n].fY = (fCubic[n].fY - fLine[0].fY) * opp
169 SkDCubic::Coefficients(&c[0].fY, &A, &B, &C, &D);
174 if (!approximately_equal(calcPt.fY, axisIntercept)) {
176 int extrema = SkDCubic::FindExtrema(&c[0].fY, extremeTs)
[all...] |
| /external/skia/tests/ |
| GeometryTest.cpp | 16 return SkScalarNearlyEqual(a.fX, b.fX) && SkScalarNearlyEqual(a.fY, b.fY);
63 check_pairs(reporter, i, t, "quad-pos", r0.fX, r0.fY, r1.fX, r1.fY);
68 check_pairs(reporter, i, t, "quad-tan", v0.fX, v0.fY, v1.fX, v1.fY);
79 check_pairs(reporter, 0, t, "conic-pos", p0.fX, p0.fY, p1.fX, p1.fY);
86 check_pairs(reporter, 0, t, "conic-tan", v0.fX, v0.fY, v1.fX, v1.fY);
[all...] |
| ClipCubicTest.cpp | 35 (float)crv[0].fX, (float)crv[0].fY,
36 (float)crv[1].fX, (float)crv[1].fY,
37 (float)crv[2].fX, (float)crv[2].fY,
38 (float)crv[3].fX, (float)crv[3].fY);
48 SkScalarAbs(c0[i].fY - c1[i].fY) > tol
64 crv[0].fX = x0; crv[0].fY = y0;
65 crv[1].fX = x1; crv[1].fY = y1;
66 crv[2].fX = x2; crv[2].fY = y2;
67 crv[3].fX = x3; crv[3].fY = y3
[all...] |
| /external/skqp/tests/ |
| GeometryTest.cpp | 16 return SkScalarNearlyEqual(a.fX, b.fX) && SkScalarNearlyEqual(a.fY, b.fY);
63 check_pairs(reporter, i, t, "quad-pos", r0.fX, r0.fY, r1.fX, r1.fY);
68 check_pairs(reporter, i, t, "quad-tan", v0.fX, v0.fY, v1.fX, v1.fY);
79 check_pairs(reporter, 0, t, "conic-pos", p0.fX, p0.fY, p1.fX, p1.fY);
86 check_pairs(reporter, 0, t, "conic-tan", v0.fX, v0.fY, v1.fX, v1.fY);
[all...] |
| ClipCubicTest.cpp | 35 (float)crv[0].fX, (float)crv[0].fY,
36 (float)crv[1].fX, (float)crv[1].fY,
37 (float)crv[2].fX, (float)crv[2].fY,
38 (float)crv[3].fX, (float)crv[3].fY);
48 SkScalarAbs(c0[i].fY - c1[i].fY) > tol
64 crv[0].fX = x0; crv[0].fY = y0;
65 crv[1].fX = x1; crv[1].fY = y1;
66 crv[2].fX = x2; crv[2].fY = y2;
67 crv[3].fX = x3; crv[3].fY = y3
[all...] |
| /external/skia/src/core/ |
| SkGeometry.cpp | 189 SkScalar a = src[0].fY;
190 SkScalar b = src[1].fY;
191 SkScalar c = src[2].fY;
197 flatten_double_quad_extrema(&dst[0].fY);
232 dst[0].set(a, src[0].fY);
233 dst[1].set(b, src[1].fY);
234 dst[2].set(c, src[2].fY);
246 // Fx' Fx'' + Fy' Fy'' = 0
252 SkScalar Ay = src[1].fY - src[0].fY
[all...] |
| SkEdge.cpp | 40 y0 = SkScalarRoundToFDot6(p0.fY, shift);
42 y1 = SkScalarRoundToFDot6(p1.fY, shift);
46 y0 = int(p0.fY * scale);
48 y1 = int(p1.fY * scale);
187 y0 = SkScalarRoundToFDot6(pts[0].fY, shift);
189 y1 = SkScalarRoundToFDot6(pts[1].fY, shift);
191 y2 = SkScalarRoundToFDot6(pts[2].fY, shift);
195 y0 = int(pts[0].fY * scale);
197 y1 = int(pts[1].fY * scale);
199 y2 = int(pts[2].fY * scale)
[all...] |
| SkPath.cpp | 257 if (v.fX || v.fY) {
259 SkScalar yL = v.fY * (rect.fLeft - edgeBegin->fX);
260 SkScalar xT = v.fX * (rect.fTop - edgeBegin->fY);
261 SkScalar yR = v.fY * (rect.fRight - edgeBegin->fX);
262 SkScalar xB = v.fX * (rect.fBottom - edgeBegin->fY);
472 SkScalar top = last.fY;
474 SkScalar bottom = pts->fY;
764 this->moveTo(pt.fX + x, pt.fY + y);
775 y = pt.fY;
796 this->lineTo(pt.fX + x, pt.fY + y)
[all...] |
| SkStroke.cpp | 52 return !SkPointPriv::CanNormalize(v.fX, v.fY);
59 (after.fY - before.fY) * scale)) {
70 if (!unitNormal->setNormalize(vec.fX, vec.fY)) {
254 SkScalar prevY = fPrevPt.fY;
270 fFirstOuterPt.set(prevX + normal->fX, prevY + normal->fY);
272 fOuter.moveTo(fFirstOuterPt.fX, fFirstOuterPt.fY);
273 fInner.moveTo(prevX - normal->fX, prevY - normal->fY);
310 fOuter.moveTo(pt.fX, pt.fY);
388 fOuter.lineTo(currPt.fX + normal.fX, currPt.fY + normal.fY)
[all...] |
| /external/skqp/src/core/ |
| SkEdge.cpp | 40 y0 = SkScalarRoundToFDot6(p0.fY, shift);
42 y1 = SkScalarRoundToFDot6(p1.fY, shift);
46 y0 = int(p0.fY * scale);
48 y1 = int(p1.fY * scale);
187 y0 = SkScalarRoundToFDot6(pts[0].fY, shift);
189 y1 = SkScalarRoundToFDot6(pts[1].fY, shift);
191 y2 = SkScalarRoundToFDot6(pts[2].fY, shift);
195 y0 = int(pts[0].fY * scale);
197 y1 = int(pts[1].fY * scale);
199 y2 = int(pts[2].fY * scale)
[all...] |
| SkPath.cpp | 256 if (v.fX || v.fY) {
258 SkScalar yL = v.fY * (rect.fLeft - edgeBegin->fX);
259 SkScalar xT = v.fX * (rect.fTop - edgeBegin->fY);
260 SkScalar yR = v.fY * (rect.fRight - edgeBegin->fX);
261 SkScalar xB = v.fX * (rect.fBottom - edgeBegin->fY);
471 SkScalar top = last.fY;
473 SkScalar bottom = pts->fY;
755 this->moveTo(pt.fX + x, pt.fY + y);
766 y = pt.fY;
787 this->lineTo(pt.fX + x, pt.fY + y)
[all...] |
| SkGeometry.cpp | 189 SkScalar a = src[0].fY;
190 SkScalar b = src[1].fY;
191 SkScalar c = src[2].fY;
197 flatten_double_quad_extrema(&dst[0].fY);
232 dst[0].set(a, src[0].fY);
233 dst[1].set(b, src[1].fY);
234 dst[2].set(c, src[2].fY);
246 // Fx' Fx'' + Fy' Fy'' = 0
252 SkScalar Ay = src[1].fY - src[0].fY
[all...] |
| SkStroke.cpp | 52 return !SkPointPriv::CanNormalize(v.fX, v.fY);
59 (after.fY - before.fY) * scale)) {
70 if (!unitNormal->setNormalize(vec.fX, vec.fY)) {
254 SkScalar prevY = fPrevPt.fY;
270 fFirstOuterPt.set(prevX + normal->fX, prevY + normal->fY);
272 fOuter.moveTo(fFirstOuterPt.fX, fFirstOuterPt.fY);
273 fInner.moveTo(prevX - normal->fX, prevY - normal->fY);
309 fOuter.moveTo(pt.fX, pt.fY);
387 fOuter.lineTo(currPt.fX + normal.fX, currPt.fY + normal.fY)
[all...] |
| /external/skia/src/gpu/ |
| GrPathUtils.cpp | 86 { SkScalarAve(p0.fX, p1.fX), SkScalarAve(p0.fY, p1.fY) },
87 { SkScalarAve(p1.fX, p2.fX), SkScalarAve(p1.fY, p2.fY) },
89 SkPoint r = { SkScalarAve(q[0].fX, q[1].fX), SkScalarAve(q[0].fY, q[1].fY) };
143 { SkScalarAve(p0.fX, p1.fX), SkScalarAve(p0.fY, p1.fY) },
144 { SkScalarAve(p1.fX, p2.fX), SkScalarAve(p1.fY, p2.fY) },
[all...] |
| /external/skqp/src/gpu/ |
| GrPathUtils.cpp | 86 { SkScalarAve(p0.fX, p1.fX), SkScalarAve(p0.fY, p1.fY) },
87 { SkScalarAve(p1.fX, p2.fX), SkScalarAve(p1.fY, p2.fY) },
89 SkPoint r = { SkScalarAve(q[0].fX, q[1].fX), SkScalarAve(q[0].fY, q[1].fY) };
143 { SkScalarAve(p0.fX, p1.fX), SkScalarAve(p0.fY, p1.fY) },
144 { SkScalarAve(p1.fX, p2.fX), SkScalarAve(p1.fY, p2.fY) },
[all...] |
| /external/skia/bench/ |
| GradientBench.cpp | 59 SkScalarAve(pts[0].fY, pts[1].fY));
69 SkScalarAve(pts[0].fY, pts[1].fY));
70 return SkGradientShader::MakeSweep(center.fX, center.fY, data.fColors, data.fPos, data.fCount);
78 SkScalarAve(pts[0].fY, pts[1].fY));
80 SkScalarInterp(pts[0].fY, pts[1].fY, SkIntToScalar(1)/4));
91 SkScalarAve(pts[0].fY, pts[1].fY))
[all...] |
