Searched refs:fY (Results 1 - 25 of 402) sorted by relevance

1234567891011>>

/external/skia/src/pathops/
H A DSkDCubicToQuads.cpp38 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;
H A DSkPathOpsPoint.h14 return AlmostEqualUlps(pt1.fX, pt2.fX) && AlmostEqualUlps(pt1.fY, pt2.fY);
19 double fY; member in struct:SkDVector
23 fY = pt.fY;
29 fY += v.fY;
35 fY -= v.fY;
41 fY /
96 double fY; member in struct:SkDPoint
[all...]
H A DSkPathOpsPoint.cpp10 SkDVector v = {a.fX - b.fX, a.fY - b.fY};
H A DSkLineParameters.h55 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...]
H A DSkOpCubicHull.cpp10 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...]
H A DSkPathOpsBounds.h38 if (pt.fY < fTop) fTop = pt.fY;
40 if (pt.fY > fBottom) fBottom = pt.fY;
45 if (pt.fY < fTop) fTop = SkDoubleToScalar(pt.fY);
47 if (pt.fY > fBottom) fBottom = SkDoubleToScalar(pt.fY);
53 && AlmostLessOrEqualUlps(fTop, pt.fY)
54 && AlmostLessOrEqualUlps(pt.fY, fBotto
[all...]
H A DSkPathOpsLine.cpp17 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), fPt
[all...]
H A DSkPathOpsTightBounds.cpp21 moveBounds.fTop = SkTMin(moveBounds.fTop, pts[0].fY);
23 moveBounds.fBottom = SkTMax(moveBounds.fBottom, pts[0].fY);
31 wellBehaved &= between(pts[0].fY, pts[1].fY, pts[2].fY);
38 wellBehaved &= between(pts[0].fY, pts[1].fY, pts[3].fY);
40 wellBehaved &= between(pts[0].fY, pts[2].fY, pt
[all...]
H A DSkPathOpsCubic.cpp23 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)) {
108 dst.pts[1].fY = (fPts[0].fY
[all...]
H A DSkPathOpsQuad.cpp49 double origY = endPt[0]->fY;
51 double opp = endPt[1]->fY - origY;
52 double sign = (fPts[oddMan].fY - origY) * adj - (fPts[oddMan].fX - origX) * opp;
59 double test = (q2[n].fY - origY) * adj - (q2[n].fX - origX) * opp;
181 double tiniest = SkTMin(SkTMin(SkTMin(SkTMin(SkTMin(fPts[0].fX, fPts[0].fY),
182 fPts[1].fX), fPts[1].fY), fPts[2].fX), fPts[2].fY);
183 double largest = SkTMax(SkTMax(SkTMax(SkTMax(SkTMax(fPts[0].fX, fPts[0].fY),
184 fPts[1].fX), fPts[1].fY), fPts[2].fX), fPts[2].fY);
[all...]
/external/skia/include/core/
H A DSkPoint3.h14 SkScalar fX, fY, fZ; member in struct:SkPoint3
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...]
H A DSkPoint.h19 int16_t fX, fY; member in struct:SkIPoint16
28 int16_t y() const { return fY; }
32 fY = SkToS16(y);
41 int32_t fX, fY; member in struct:SkIPoint
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
157 SkScalar fX, fY; member in struct:SkPoint
[all...]
/external/skia/src/core/
H A DSkQuadClipper.cpp42 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
[all...]
H A DSkStrokerPriv.cpp14 path->lineTo(stop.fX, stop.fY);
34 path->setLastPt(pivot.fX + normal.fX + parallel.fX, pivot.fY + normal.fY + parallel.fY);
35 path->lineTo(pivot.fX - normal.fX + parallel.fX, pivot.fY - normal.fY + parallel.fY);
37 path->lineTo(pivot.fX + normal.fX + parallel.fX, pivot.fY + normal.fY + parallel.fY);
[all...]
H A DSkWritePixelsRec.h22 , fY(y)
29 int fY; member in struct:SkWritePixelsRec
H A DSkAnalyticEdge.h31 SkFixed fY; // The current y member in struct:SkAnalyticEdge
54 // Update fX, fY of this edge so fY = y
56 if (y == fY + SK_Fixed1) {
58 fY = y;
59 } else if (y != fY) {
63 fY = y;
69 SkASSERT(fDX == 0 || y - fY == SK_Fixed1 >> yShift);
70 fY = y;
86 fUpperY, fLowerY, SkFixedToFloat(fY), SkFixedToFloa
[all...]
H A DSkRRect.cpp144 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...]
H A DSkLineClipper.cpp27 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/
H A DSkReadPixelsRec.h22 , fY(y)
29 int fY; member in struct:SkReadPixelsRec
/external/skia/gm/
H A Dcircularclips.cpp13 SkScalar fX1, fX2, fY, fR; member in class:CircularClipsGM
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);
H A Danimatedimageblurs.cpp54 fNodes[i].pos().fY - fNodes[i].size()-0.5f,
56 fNodes[i].pos().fY + fNodes[i].size()+0.5f);
89 fPos.fY = rand->nextRangeF(fSize, kHeight - fSize);
91 fDir.fY = SkScalarSqrt(1.0f - fDir.fX * fDir.fX);
93 fDir.fY = -fDir.fY;
105 fPos.fY += deltaTime * fSpeed * fDir.fY;
110 if (fPos.fY >= kHeight || fPos.fY < 0.
[all...]
H A Dgradients_2pt_conical.cpp46 center0.set(pts[0].fX + radius0, pts[0].fY + radius0);
47 center1.set(pts[1].fX - radius1, pts[1].fY - radius1);
57 center0.set(pts[0].fX + radius0, pts[0].fY + radius0);
58 center1.set(pts[1].fX - radius1, pts[1].fY - radius1);
67 SkScalarAve(pts[0].fY, pts[1].fY));
69 SkScalarInterp(pts[0].fY, pts[1].fY, SkIntToScalar(1)/4));
80 SkScalarAve(pts[0].fY, pts[1].fY));
[all...]
/external/skia/tests/
H A DPathOpsLineIntersectionTest.cpp120 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...]
H A DPathOpsDPointTest.cpp41 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/pdfium/xfa/fwl/theme/
H A Dcfwl_scrollbartp.cpp133 FX_FLOAT fY = pRect->top + pRect->height / 2; local
134 path.MoveTo(CFX_PointF(fX, fY - 4));
135 path.LineTo(CFX_PointF(fX + fPawLen, fY - 4));
136 path.MoveTo(CFX_PointF(fX, fY - 2));
137 path.LineTo(CFX_PointF(fX + fPawLen, fY - 2));
138 path.MoveTo(CFX_PointF(fX, fY));
139 path.LineTo(CFX_PointF(fX + fPawLen, fY));
140 path.MoveTo(CFX_PointF(fX, fY + 2));
141 path.LineTo(CFX_PointF(fX + fPawLen, fY + 2));
150 path.MoveTo(CFX_PointF(fX, fY
170 FX_FLOAT fY = pRect->top + pRect->height / 4; local
[all...]

Completed in 416 milliseconds

1234567891011>>