/external/chromium_org/third_party/skia/src/pathops/ |
H A D | SkPathOpsPoint.cpp | 10 SkDVector v = {a.fX - b.fX, a.fY - b.fY}; 15 SkDPoint v = {a.fX + b.fX, a.fY + b.fY};
|
H A D | SkPathOpsPoint.h | 14 return AlmostEqualUlps(pt1.fX, pt2.fX) && AlmostEqualUlps(pt1.fY, pt2.fY); 18 double fX; member in struct:SkDVector 22 fX = pt.fX; 29 fX += v.fX; 34 fX -= v.fX; 39 fX / 78 double fX; member in struct:SkDPoint [all...] |
H A D | SkPathOpsRect.cpp | 22 if (!between(quad[0].fX, quad[1].fX, quad[2].fX)) { 23 roots = SkDQuad::FindExtrema(quad[0].fX, quad[1].fX, quad[2].fX, tValues); 49 if (!is_bounded_by_end_points(c[0].fX, c[1].fX, c[2].fX, c[3].fX)) { [all...] |
H A D | SkPathOpsLine.cpp | 12 fPts[0].fX - t1 * delta.fX, fPts[0].fY - t1 * delta.fY}, { 13 fPts[0].fX - t2 * delta.fX, fPts[0].fY - t2 * delta.fY}}}; 52 SkDPoint result = { one_t * fPts[0].fX + t * fPts[1].fX, one_t * fPts[0].fY + t * fPts[1].fY }; 67 if (!AlmostBetweenUlps(fPts[0].fX, xy.fX, fPts[1].fX) 73 double denom = len.fX * le [all...] |
H A D | SkPathWriter.cpp | 51 pt1.fX, pt1.fY, pt2.fX, pt2.fY, fDefer[1].fX, fDefer[1].fY); 53 fPathPtr->cubicTo(pt1.fX, pt1.fY, pt2.fX, pt2.fY, fDefer[1].fX, fDefer[1].fY); 104 SkDebugf("path.lineTo(%1.9g,%1.9g);\n", fDefer[1].fX, fDefer[1].fY); 106 fPathPtr->lineTo(fDefer[1].fX, fDefer[1].fY); 115 if (fEmpty || !AlmostEqualUlps(fDefer[1].fX, fFirstPt.fX) [all...] |
H A D | SkLineParameters.h | 73 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...] |
/external/skia/src/pathops/ |
H A D | SkPathOpsPoint.cpp | 10 SkDVector v = {a.fX - b.fX, a.fY - b.fY}; 15 SkDPoint v = {a.fX + b.fX, a.fY + b.fY};
|
H A D | SkPathOpsPoint.h | 14 return AlmostEqualUlps(pt1.fX, pt2.fX) && AlmostEqualUlps(pt1.fY, pt2.fY); 18 double fX; member in struct:SkDVector 22 fX = pt.fX; 29 fX += v.fX; 34 fX -= v.fX; 39 fX / 78 double fX; member in struct:SkDPoint [all...] |
H A D | SkPathOpsRect.cpp | 22 if (!between(quad[0].fX, quad[1].fX, quad[2].fX)) { 23 roots = SkDQuad::FindExtrema(quad[0].fX, quad[1].fX, quad[2].fX, tValues); 49 if (!is_bounded_by_end_points(c[0].fX, c[1].fX, c[2].fX, c[3].fX)) { [all...] |
H A D | SkPathOpsLine.cpp | 12 fPts[0].fX - t1 * delta.fX, fPts[0].fY - t1 * delta.fY}, { 13 fPts[0].fX - t2 * delta.fX, fPts[0].fY - t2 * delta.fY}}}; 52 SkDPoint result = { one_t * fPts[0].fX + t * fPts[1].fX, one_t * fPts[0].fY + t * fPts[1].fY }; 67 if (!AlmostBetweenUlps(fPts[0].fX, xy.fX, fPts[1].fX) 73 double denom = len.fX * le [all...] |
H A D | SkPathWriter.cpp | 51 pt1.fX, pt1.fY, pt2.fX, pt2.fY, fDefer[1].fX, fDefer[1].fY); 53 fPathPtr->cubicTo(pt1.fX, pt1.fY, pt2.fX, pt2.fY, fDefer[1].fX, fDefer[1].fY); 104 SkDebugf("path.lineTo(%1.9g,%1.9g);\n", fDefer[1].fX, fDefer[1].fY); 106 fPathPtr->lineTo(fDefer[1].fX, fDefer[1].fY); 115 if (fEmpty || !AlmostEqualUlps(fDefer[1].fX, fFirstPt.fX) [all...] |
H A D | SkLineParameters.h | 73 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...] |
/external/clang/test/CodeGenCXX/ |
H A D | constructor-conversion.cpp | 10 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/chromium_org/third_party/skia/include/core/ |
H A D | SkPoint.h | 19 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/include/core/ |
H A D | SkPoint.h | 19 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/chromium_org/third_party/skia/gm/ |
H A D | gradients_2pt_conical.cpp | 43 SkScalar radius0 = SkScalarDiv(pts[1].fX - pts[0].fX, 10); 44 SkScalar radius1 = SkScalarDiv(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 = SkScalarDiv(pts[1].fX - pts[0].fX, 10); 57 SkScalar radius1 = SkScalarDiv(pts[1].fX - pts[0].fX, [all...] |
/external/skia/gm/ |
H A D | gradients_2pt_conical.cpp | 43 SkScalar radius0 = SkScalarDiv(pts[1].fX - pts[0].fX, 10); 44 SkScalar radius1 = SkScalarDiv(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 = SkScalarDiv(pts[1].fX - pts[0].fX, 10); 57 SkScalar radius1 = SkScalarDiv(pts[1].fX - pts[0].fX, [all...] |
/external/chromium_org/third_party/skia/tests/ |
H A D | PathOpsDRectTest.cpp | 48 REPORTER_ASSERT(reporter, rect.fLeft == SkTMin(line[0].fX, line[1].fX)); 50 REPORTER_ASSERT(reporter, rect.fRight == SkTMax(line[0].fX, line[1].fX)); 54 REPORTER_ASSERT(reporter, rect2.fLeft == SkTMin(line[0].fX, line[1].fX)); 56 REPORTER_ASSERT(reporter, rect2.fRight == SkTMax(line[0].fX, line[1].fX)); 65 REPORTER_ASSERT(reporter, rect.fLeft == SkTMin(quad[0].fX, 66 SkTMin(quad[1].fX, qua [all...] |
/external/skia/tests/ |
H A D | PathOpsDRectTest.cpp | 48 REPORTER_ASSERT(reporter, rect.fLeft == SkTMin(line[0].fX, line[1].fX)); 50 REPORTER_ASSERT(reporter, rect.fRight == SkTMax(line[0].fX, line[1].fX)); 54 REPORTER_ASSERT(reporter, rect2.fLeft == SkTMin(line[0].fX, line[1].fX)); 56 REPORTER_ASSERT(reporter, rect2.fRight == SkTMax(line[0].fX, line[1].fX)); 65 REPORTER_ASSERT(reporter, rect.fLeft == SkTMin(quad[0].fX, 66 SkTMin(quad[1].fX, qua [all...] |
/external/chromium_org/third_party/skia/include/utils/ |
H A D | SkCubicInterval.h | 18 return SkEvalCubicInterval(pts[0].fX, pts[0].fY, 19 pts[1].fX, pts[1].fY, x);
|
/external/skia/include/utils/ |
H A D | SkCubicInterval.h | 18 return SkEvalCubicInterval(pts[0].fX, pts[0].fY, 19 pts[1].fX, pts[1].fY, x);
|
/external/chromium_org/third_party/skia/src/core/ |
H A D | SkStrokerPriv.cpp | 18 path->lineTo(stop.fX, stop.fY); 25 SkScalar px = pivot.fX; 27 SkScalar nx = normal.fX; 37 stop.fX, stop.fY); 49 path->setLastPt(pivot.fX + normal.fX + parallel.fX, pivot.fY + normal.fY + parallel.fY); 50 path->lineTo(pivot.fX - normal.fX + parallel.fX, pivo [all...] |
/external/skia/src/core/ |
H A D | SkStrokerPriv.cpp | 18 path->lineTo(stop.fX, stop.fY); 25 SkScalar px = pivot.fX; 27 SkScalar nx = normal.fX; 37 stop.fX, stop.fY); 49 path->setLastPt(pivot.fX + normal.fX + parallel.fX, pivot.fY + normal.fY + parallel.fY); 50 path->lineTo(pivot.fX - normal.fX + parallel.fX, pivo [all...] |
/external/chromium_org/third_party/skia/src/gpu/ |
H A D | GrRectanizer_skyline.cpp | 30 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...] |
/external/skia/src/gpu/ |
H A D | GrRectanizer_skyline.cpp | 30 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...] |