| /external/skia/src/pathops/ |
| SkPathOpsPoint.h | 14 return AlmostEqualUlps(pt1.fX, pt2.fX) && AlmostEqualUlps(pt1.fY, pt2.fY);
19 double fY;
23 fY = pt.fY;
29 fY += v.fY;
35 fY -= v.fY;
41 fY /= s
[all...] |
| SkDCubicToQuads.cpp | 38 const SkDPoint fromC1 = {(3 * fPts[1].fX - fPts[0].fX) / 2, (3 * fPts[1].fY - fPts[0].fY) / 2};
39 const SkDPoint fromC2 = {(3 * fPts[2].fX - fPts[3].fX) / 2, (3 * fPts[2].fY - fPts[3].fY) / 2};
41 quad[1].fY = (fromC1.fY + fromC2.fY) / 2;
|
| SkPathOpsPoint.cpp | 10 SkDVector v = {a.fX - b.fX, a.fY - b.fY};
|
| SkLineParameters.h | 55 if (NotAlmostEqualUlps(pts[0].fY, pts[++endIndex].fY)) {
56 if (pts[0].fY > pts[endIndex].fY) {
65 if (pts[0].fY > pts[3].fY) {
72 fA = pts[s].fY - pts[e].fY;
74 fC = pts[s].fX * pts[e].fY - pts[e].fX * pts[s].fY;
[all...] |
| SkOpCubicHull.cpp | 10 double dy = cubic[index].fY - cubic[zero].fY;
18 rotPath[index].fY = cubic[zero].fY;
22 if (approximately_equal(cubic[side1].fY, cubic[zero].fY)) {
23 rotPath[side1].fY = cubic[zero].fY;
25 if (approximately_equal(cubic[side2].fY, cubic[zero].fY)) {
[all...] |
| SkPathWriter.cpp | 50 pt1.fX, pt1.fY, fDefer[1].fX, fDefer[1].fY, weight);
52 fPathPtr->conicTo(pt1.fX, pt1.fY, fDefer[1].fX, fDefer[1].fY, weight);
69 pt1.fX, pt1.fY, pt2.fX, pt2.fY, fDefer[1].fX, fDefer[1].fY);
71 fPathPtr->cubicTo(pt1.fX, pt1.fY, pt2.fX, pt2.fY, fDefer[1].fX, fDefer[1].fY);
[all...] |
| SkPathOpsLine.cpp | 17 SkDPoint result = { one_t * fPts[0].fX + t * fPts[1].fX, one_t * fPts[0].fY + t * fPts[1].fY };
33 || !AlmostBetweenUlps(fPts[0].fY, xy.fY, fPts[1].fY)) {
38 double denom = len.fX * len.fX + len.fY * len.fY; // see DLine intersectRay
40 double numer = len.fX * ab0.fX + ab0.fY * len.fY;
51 double tiniest = SkTMin(SkTMin(SkTMin(fPts[0].fX, fPts[0].fY), fPts[1].fX), fPts[1].fY)
[all...] |
| SkPathOpsQuad.cpp | 27 double origY = endPt[0]->fY;
29 double opp = endPt[1]->fY - origY;
30 double sign = (fPts[oddMan].fY - origY) * adj - (fPts[oddMan].fX - origX) * opp;
37 double test = (q2[n].fY - origY) * adj - (q2[n].fX - origX) * opp;
151 double tiniest = SkTMin(SkTMin(SkTMin(SkTMin(SkTMin(fPts[0].fX, fPts[0].fY),
152 fPts[1].fX), fPts[1].fY), fPts[2].fX), fPts[2].fY);
153 double largest = SkTMax(SkTMax(SkTMax(SkTMax(SkTMax(fPts[0].fX, fPts[0].fY),
154 fPts[1].fX), fPts[1].fY), fPts[2].fX), fPts[2].fY);
[all...] |
| SkPathOpsBounds.h | 38 if (pt.fY < fTop) fTop = SkDoubleToScalar(pt.fY);
40 if (pt.fY > fBottom) fBottom = SkDoubleToScalar(pt.fY);
46 && AlmostLessOrEqualUlps(fTop, pt.fY)
47 && AlmostLessOrEqualUlps(pt.fY, fBottom);
|
| SkPathOpsCubic.cpp | 23 if (fPts[endIndex].fY == fPts[ctrlIndex].fY) {
24 dstPt->fY = fPts[endIndex].fY;
42 && approximately_equal_half(lessPt.fY, cubicAtT.fY)) {
61 && approximately_equal_half(morePt.fY, cubicAtT.fY)) {
111 dst.pts[1].fY = (fPts[0].fY + fPts[1].fY) / 2
[all...] |
| /external/skia/include/core/ |
| SkPoint3.h | 14 SkScalar fX, fY, fZ;
23 SkScalar y() const { return fY; }
26 void set(SkScalar x, SkScalar y, SkScalar z) { fX = x; fY = y; fZ = z; }
29 return a.fX == b.fX && a.fY == b.fY && a.fZ == b.fZ;
42 SkScalar length() const { return SkPoint3::Length(fX, fY, fZ); }
54 p.set(scale * fX, scale * fY, scale * fZ);
62 fY *= value;
72 neg.fY = -fY;
[all...] |
| SkPoint.h | 19 int16_t fX, fY;
28 int16_t y() const { return fY; }
32 fY = SkToS16(y);
41 int32_t fX, fY;
50 int32_t y() const { return fY; }
52 void setY(int32_t y) { fY = y; }
55 * Returns true iff fX and fY are both zero.
57 bool isZero() const { return (fX | fY) == 0; }
60 * Set both fX and fY to zero. Same as set(0, 0)
62 void setZero() { fX = fY = 0;
[all...] |
| /external/skia/src/core/ |
| SkQuadClipper.cpp | 42 return chopMonoQuadAt(pts[0].fY, pts[1].fY, pts[2].fY, y, t);
55 if (srcPts[0].fY > srcPts[2].fY) {
68 if (dst[2].fY <= ctop || dst[0].fY >= cbot) {
76 if (dst[0].fY < ctop) {
86 if (dst[i].fY < ctop) {
87 dst[i].fY = ctop
[all...] |
| SkStrokerPriv.cpp | 18 path->lineTo(stop.fX, stop.fY);
43 path->setLastPt(pivot.fX + normal.fX + parallel.fX, pivot.fY + normal.fY + parallel.fY);
44 path->lineTo(pivot.fX - normal.fX + parallel.fX, pivot.fY - normal.fY + parallel.fY);
48 path->lineTo(pivot.fX + normal.fX + parallel.fX, pivot.fY + normal.fY + parallel.fY);
[all...] |
| SkEdgeClipper.cpp | 35 if (src[0].fY > src[count - 1].fY) {
68 return chopMonoQuadAt(pts[0].fY, pts[1].fY, pts[2].fY, y, t);
81 if (pts[0].fY < clip.fTop) {
86 tmp[2].fY = clip.fTop;
87 clamp_ge(tmp[3].fY, clip.fTop);
95 if (pts[i].fY < clip.fTop) {
96 pts[i].fY = clip.fTop
[all...] |
| SkRRect.cpp | 144 if (fRadii[i].fX <= 0 || fRadii[i].fY <= 0) {
150 fRadii[i].fY = 0;
182 scale = compute_min_scale(fRadii[1].fY, fRadii[2].fY, height, scale);
184 scale = compute_min_scale(fRadii[3].fY, fRadii[0].fY, height, scale);
188 SkScaleToSides::AdjustRadii(height, scale, &fRadii[1].fY, &fRadii[2].fY);
190 SkScaleToSides::AdjustRadii(height, scale, &fRadii[3].fY, &fRadii[0].fY);
[all...] |
| SkLineClipper.cpp | 27 SkScalar dy = src[1].fY - src[0].fY;
34 double Y0 = src[0].fY;
36 double Y1 = src[1].fY;
50 return SkScalarAve(src[0].fY, src[1].fY);
55 double Y0 = src[0].fY;
57 double Y1 = src[1].fY;
99 if (src[0].fY < src[1].fY) {
[all...] |
| /external/skia/src/image/ |
| SkReadPixelsRec.h | 22 , fY(y)
29 int fY;
|
| /external/skia/src/animator/ |
| SkDrawPoint.cpp | 19 SK_MEMBER_ALIAS(y, fPoint.fY, Float)
30 SK_MEMBER_ALIAS(y, fPoint.fY, Float)
43 rect->fTop = rect->fBottom = fPoint.fY;
|
| SkParseSVGPath.cpp | 25 dest.set(SkScalarAve(a.fX, b.fX),SkScalarAve(a.fY, b.fY));
41 m.set(SkScalarHalf(3*j.fX - c.fX), SkScalarHalf(3*j.fY - c.fY));
42 n.set(SkScalarHalf(3*o.fX -q.fX), SkScalarHalf(3*o.fY - q.fY));
47 m.set(SkScalarHalf(3*p.fX - c.fX), SkScalarHalf(3*p.fY - c.fY));
48 n.set(SkScalarHalf(3*l.fX -p2.fX),SkScalarHalf(3*l.fY -p2.fY));
[all...] |
| /external/skia/gm/ |
| circularclips.cpp | 13 SkScalar fX1, fX2, fY, fR;
20 fY = 50;
23 fCircle1.addCircle(fX1, fY, fR, SkPath::kCW_Direction);
24 fCircle2.addCircle(fX2, fY, fR, SkPath::kCW_Direction);
48 SkRect rect = SkRect::MakeLTRB(fX1 - fR, fY - fR, fX2 + fR, fY + fR);
56 canvas->translate(-((fX1 + fX2)/2 - fR), -(fY - 2*fR/3));
82 canvas->translate(0, 2 * fY);
|
| gradients_2pt_conical.cpp | 45 center0.set(pts[0].fX + radius0, pts[0].fY + radius0);
46 center1.set(pts[1].fX - radius1, pts[1].fY - radius1);
58 center0.set(pts[0].fX + radius0, pts[0].fY + radius0);
59 center1.set(pts[1].fX - radius1, pts[1].fY - radius1);
70 SkScalarAve(pts[0].fY, pts[1].fY));
72 SkScalarInterp(pts[0].fY, pts[1].fY, SkIntToScalar(1)/4));
83 SkScalarAve(pts[0].fY, pts[1].fY));
[all...] |
| /external/skia/tests/ |
| PathOpsLineIntersectionTest.cpp | 120 if (line1[0].fY == line1[1].fY) {
124 ts.horizontal(line2, left, right, line1[0].fY, line1[0].fX != left);
127 if (line2[0].fY == line2[1].fY) {
131 ts.horizontal(line1, left, right, line2[0].fY, line2[0].fX != left);
135 double top = SkTMin(line1[0].fY, line1[1].fY);
136 double bottom = SkTMax(line1[0].fY, line1[1].fY);
[all...] |
| PathOpsDPointTest.cpp | 41 p.fX = p.fY = 0;
42 REPORTER_ASSERT(reporter, p.fX == 0 && p.fY == 0);
44 REPORTER_ASSERT(reporter, pt.distanceSquared(p) == pt.fX * pt.fX + pt.fY * pt.fY);
46 sqrt(pt.fX * pt.fX + pt.fY * pt.fY)));
|
| /external/skia/src/gpu/batches/ |
| GrCopySurfaceBatch.cpp | 33 clippedDstPoint->fY -= clippedSrcRect->fTop;
36 if (clippedDstPoint->fY < 0) {
37 clippedSrcRect->fTop -= clippedDstPoint->fY;
38 clippedDstPoint->fY = 0;
53 if (clippedDstPoint->fY + clippedSrcRect->height() > dst->height()) {
54 clippedSrcRect->fBottom = clippedSrcRect->fTop + dst->height() - clippedDstPoint->fY;
|
