Searched refs:fX (Results 1 - 25 of 339) sorted by relevance

1234567891011>>

/external/skia/src/pathops/
H A DSkPathOpsPoint.h14 return AlmostEqualUlps(pt1.fX, pt2.fX) && AlmostEqualUlps(pt1.fY, pt2.fY);
18 double fX; member in struct:SkDVector
22 fX = pt.fX;
28 fX += v.fX;
34 fX -= v.fX;
40 fX /
81 double fX; member in struct:SkDPoint
[all...]
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};
40 quad[1].fX = (fromC1.fX + fromC2.fX) / 2;
H A DSkPathOpsPoint.cpp10 SkDVector v = {a.fX - b.fX, a.fY - b.fY};
H A DSkPathWriter.cpp50 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, fDefe
[all...]
H A DSkPathOpsLine.cpp45 SkDPoint result = { one_t * fPts[0].fX + t * fPts[1].fX, one_t * fPts[0].fY + t * fPts[1].fY };
60 if (!AlmostBetweenUlps(fPts[0].fX, xy.fX, fPts[1].fX)
66 double denom = len.fX * len.fX + len.fY * len.fY; // see DLine intersectRay
68 double numer = len.fX * ab0.fX + ab0.fY * len.fY;
76 double tiniest = SkTMin(SkTMin(SkTMin(fPts[0].fX, fPt
[all...]
H A DSkPathOpsQuad.cpp26 double origX = endPt[0]->fX;
28 double adj = endPt[1]->fX - origX;
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;
150 double tiniest = SkTMin(SkTMin(SkTMin(SkTMin(SkTMin(fPts[0].fX, fPts[0].fY),
151 fPts[1].fX), fPts[1].fY), fPts[2].fX), fPts[2].fY);
152 double largest = SkTMax(SkTMax(SkTMax(SkTMax(SkTMax(fPts[0].fX, fPts[0].fY),
153 fPts[1].fX), fPts[1].fY), fPts[2].fX), fPt
[all...]
H A DSkLineParameters.h73 fB = pts[e].fX - pts[s].fX;
74 fC = pts[s].fX * pts[e].fY - pts[e].fX * pts[s].fY;
87 fB = pts[1].fX - pts[0].fX;
88 fC = pts[0].fX * pts[1].fY - pts[1].fX * pts[0].fY;
112 fB = pts[e].fX - pts[s].fX;
[all...]
H A DSkPathOpsBounds.h37 if (pt.fX < fLeft) fLeft = SkDoubleToScalar(pt.fX);
39 if (pt.fX > fRight) fRight = SkDoubleToScalar(pt.fX);
44 return AlmostLessOrEqualUlps(fLeft, pt.fX)
45 && AlmostLessOrEqualUlps(pt.fX, fRight)
H A DSkPathOpsCubic.cpp20 if (fPts[endIndex].fX == fPts[ctrlIndex].fX) {
21 dstPt->fX = fPts[endIndex].fX;
35 double calcPos = (&cubicAtT.fX)[xAxis];
41 if (approximately_equal_half(lessPt.fX, cubicAtT.fX)
45 double lessDist = (&lessPt.fX)[xAxis] - axisIntercept;
60 if (approximately_equal_half(morePt.fX, cubicAtT.fX)
[all...]
/external/clang/test/CodeGenCXX/
H A Dconstructor-conversion.cpp10 X(int) : iX(2), fX(2.3) , name("HELLO\n") { }
12 X(const char* arg, int ix=0) { iX = ix; fX = 6.0; name = arg+ix; }
13 X(): iX(100), fX(1.2) {}
15 float fX; member in class:X
18 printf("iX = %d fX = %f name = %s\n", iX, fX, name);
/external/skia/include/core/
H A DSkPoint.h19 int16_t fX, fY; member in struct:SkIPoint16
27 int16_t x() const { return fX; }
31 fX = SkToS16(x);
41 int32_t fX, fY; member in struct:SkIPoint
49 int32_t x() const { return fX; }
51 void setX(int32_t x) { fX = x; }
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
157 SkScalar fX, fY; member in struct:SkPoint
[all...]
/external/skia/gm/
H A Dgradients_2pt_conical.cpp43 SkScalar radius0 = (pts[1].fX - pts[0].fX) / 10;
44 SkScalar radius1 = (pts[1].fX - pts[0].fX) / 3;
45 center0.set(pts[0].fX + radius0, pts[0].fY + radius0);
46 center1.set(pts[1].fX - radius1, pts[1].fY - radius1);
56 SkScalar radius0 = (pts[1].fX - pts[0].fX) / 10;
57 SkScalar radius1 = (pts[1].fX - pts[0].fX) /
[all...]
/external/skia/include/utils/
H A DSkCubicInterval.h18 return SkEvalCubicInterval(pts[0].fX, pts[0].fY,
19 pts[1].fX, pts[1].fY, x);
/external/skia/src/image/
H A DSkReadPixelsRec.h21 , fX(x)
28 int fX; member in struct:SkReadPixelsRec
/external/skia/src/gpu/
H A DGrRectanizer_skyline.cpp30 bestX = fSkyline[i].fX;
39 loc->fX = bestX;
46 loc->fX = 0;
52 int x = fSkyline[skylineIndex].fX;
76 newSegment.fX = x;
81 SkASSERT(newSegment.fX + newSegment.fWidth <= this->width());
87 SkASSERT(fSkyline[i-1].fX <= fSkyline[i].fX);
89 if (fSkyline[i].fX < fSkyline[i-1].fX
[all...]
H A DGrPlotMgr.h34 sk_bzero(fBusy, fDim.fX * fDim.fY);
40 for (int x = 0; x < fDim.fX; x++) {
53 SkASSERT((unsigned)x < (unsigned)fDim.fX);
55 return fBusy[y * fDim.fX + x] != 0;
59 SkASSERT((unsigned)x < (unsigned)fDim.fX);
61 fBusy[y * fDim.fX + x] = false;
/external/skia/src/animator/
H A DSkDrawPoint.cpp18 SK_MEMBER_ALIAS(x, fPoint.fX, Float),
29 SK_MEMBER_ALIAS(x, fPoint.fX, Float),
42 rect->fLeft = rect->fRight = fPoint.fX;
H A DSkParseSVGPath.cpp25 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),SkScalarHal
[all...]
/external/skia/src/core/
H A DSkLineClipper.cpp29 return SkScalarAve(src[0].fX, src[1].fX);
33 double X0 = src[0].fX;
35 double X1 = src[1].fX;
48 SkScalar dx = src[1].fX - src[0].fX;
54 double X0 = src[0].fX;
56 double X1 = src[1].fX;
118 if (tmp[0].fX < tmp[1].fX) {
[all...]
H A DSkStrokerPriv.cpp18 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, pivo
[all...]
/external/skia/tests/
H A DPathOpsLineIntersectionTest.cpp121 double left = SkTMin(line1[0].fX, line1[1].fX);
122 double right = SkTMax(line1[0].fX, line1[1].fX);
124 ts.horizontal(line2, left, right, line1[0].fY, line1[0].fX != left);
128 double left = SkTMin(line2[0].fX, line2[1].fX);
129 double right = SkTMax(line2[0].fX, line2[1].fX);
131 ts.horizontal(line1, left, right, line2[0].fY, line2[0].fX !
[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/skia/include/effects/
H A DSkLightingImageFilter.h18 : fX(x), fY(y), fZ(z) {}
20 return fX * other.fX + fY * other.fY + fZ * other.fZ;
23 return fX > fY ? (fX > fZ ? fX : fZ) : (fY > fZ ? fY : fZ);
28 fX = fX * scale;
33 return SkPoint3(fX * scalar, fY * scalar, fZ * scalar);
36 return SkPoint3(fX
41 SkScalar fX, fY, fZ; member in class:SkPoint3
[all...]
/external/skia/src/utils/
H A DSkParsePath.cpp51 str = SkParse::FindScalars(str, &value[0].fX, count * 2);
54 value[index].fX += relative->fX;
115 data = find_scalar(data, &x, relative, c.fX);
117 c.fX = x;
122 path.lineTo(c.fX, y);
132 points[0].fX -= lastc.fX - c.fX;
147 points[0].fX
[all...]
/external/skia/samplecode/
H A DSampleGradients.cpp72 center.set(SkScalarAve(pts[0].fX, pts[1].fX),
74 return SkGradientShader::CreateRadial(center, center.fX, data.fColors,
80 center.set(SkScalarAve(pts[0].fX, pts[1].fX),
82 return SkGradientShader::CreateSweep(center.fX, center.fY, data.fColors, data.fPos, data.fCount);
87 center0.set(SkScalarAve(pts[0].fX, pts[1].fX),
89 center1.set(SkScalarInterp(pts[0].fX, pts[1].fX, SkIntToScala
[all...]

Completed in 296 milliseconds

1234567891011>>