Home
last modified time | relevance | path

Searched refs:fX (Results 1 – 25 of 490) sorted by relevance

12345678910>>...20

/external/skia/src/pathops/
DSkPathOpsPoint.h14 return AlmostEqualUlps(pt1.fX, pt2.fX) && AlmostEqualUlps(pt1.fY, pt2.fY); in AlmostEqualUlps()
18 double fX; member
22 fX = pt.fX; in set()
28 fX += v.fX;
34 fX -= v.fX;
40 fX /= s;
46 fX *= s;
51 SkVector v = {SkDoubleToScalar(fX), SkDoubleToScalar(fY)}; in asSkVector()
57 return fX * a.fY - fY * a.fX; in cross()
62 double xy = fX * a.fY; in crossCheck()
[all …]
DSkPathOpsLine.cpp17 SkDPoint result = { one_t * fPts[0].fX + t * fPts[1].fX, one_t * fPts[0].fY + t * fPts[1].fY }; in ptAtT()
32 if (!AlmostBetweenUlps(fPts[0].fX, xy.fX, fPts[1].fX) in nearPoint()
38 double denom = len.fX * len.fX + len.fY * len.fY; // see DLine intersectRay in nearPoint()
40 double numer = len.fX * ab0.fX + ab0.fY * len.fY; in nearPoint()
51 double tiniest = SkTMin(SkTMin(SkTMin(fPts[0].fX, fPts[0].fY), fPts[1].fX), fPts[1].fY); in nearPoint()
52 double largest = SkTMax(SkTMax(SkTMax(fPts[0].fX, fPts[0].fY), fPts[1].fX), fPts[1].fY); in nearPoint()
68 double denom = len.fX * len.fX + len.fY * len.fY; // see DLine intersectRay in nearRay()
70 double numer = len.fX * ab0.fX + ab0.fY * len.fY; in nearRay()
75 double tiniest = SkTMin(SkTMin(SkTMin(fPts[0].fX, fPts[0].fY), fPts[1].fX), fPts[1].fY); in nearRay()
76 double largest = SkTMax(SkTMax(SkTMax(fPts[0].fX, fPts[0].fY), fPts[1].fX), fPts[1].fY); in nearRay()
[all …]
DSkPathOpsCubic.cpp20 if (fPts[endIndex].fX == fPts[ctrlIndex].fX) { in align()
21 dstPt->fX = fPts[endIndex].fX; in align()
35 double calcPos = (&cubicAtT.fX)[xAxis]; in binarySearch()
41 if (approximately_equal_half(lessPt.fX, cubicAtT.fX) in binarySearch()
45 double lessDist = (&lessPt.fX)[xAxis] - axisIntercept; in binarySearch()
60 if (approximately_equal_half(morePt.fX, cubicAtT.fX) in binarySearch()
64 double moreDist = (&morePt.fX)[xAxis] - axisIntercept; in binarySearch()
72 calcPos = (&cubicAtT.fX)[xAxis]; in binarySearch()
110 dst.pts[1].fX = (fPts[0].fX + fPts[1].fX) / 2; in chopAt()
112 dst.pts[2].fX = (fPts[0].fX + 2 * fPts[1].fX + fPts[2].fX) / 4; in chopAt()
[all …]
DSkPathOpsQuad.cpp26 double origX = endPt[0]->fX; in hullIntersects()
28 double adj = endPt[1]->fX - origX; in hullIntersects()
30 double sign = (fPts[oddMan].fY - origY) * adj - (fPts[oddMan].fX - origX) * opp; in hullIntersects()
37 double test = (q2[n].fY - origY) * adj - (q2[n].fX - origX) * opp; in hullIntersects()
151 double tiniest = SkTMin(SkTMin(SkTMin(SkTMin(SkTMin(fPts[0].fX, fPts[0].fY), in isLinear()
152 fPts[1].fX), fPts[1].fY), fPts[2].fX), fPts[2].fY); in isLinear()
153 double largest = SkTMax(SkTMax(SkTMax(SkTMax(SkTMax(fPts[0].fX, fPts[0].fY), in isLinear()
154 fPts[1].fX), fPts[1].fY), fPts[2].fX), fPts[2].fY); in isLinear()
163 SkDVector result = { a * fPts[0].fX + b * fPts[1].fX + c * fPts[2].fX, in dxdyAtT()
165 if (result.fX == 0 && result.fY == 0) { in dxdyAtT()
[all …]
DSkPathWriter.cpp50 pt1.fX, pt1.fY, fDefer[1].fX, fDefer[1].fY, weight); in conicTo()
52 fPathPtr->conicTo(pt1.fX, pt1.fY, fDefer[1].fX, fDefer[1].fY, weight); in conicTo()
69 pt1.fX, pt1.fY, pt2.fX, pt2.fY, fDefer[1].fX, fDefer[1].fY); in cubicTo()
71 fPathPtr->cubicTo(pt1.fX, pt1.fY, pt2.fX, pt2.fY, fDefer[1].fX, fDefer[1].fY); in cubicTo()
122 SkDebugf("path.lineTo(%1.9g,%1.9g);\n", fDefer[1].fX, fDefer[1].fY); in lineTo()
124 fPathPtr->lineTo(fDefer[1].fX, fDefer[1].fY); in lineTo()
133 if (fEmpty || !AlmostEqualUlps(fDefer[1].fX, fFirstPt.fX) in nudge()
152 pt1.fX, pt1.fY, fDefer[1].fX, fDefer[1].fY); in quadTo()
154 fPathPtr->quadTo(pt1.fX, pt1.fY, fDefer[1].fX, fDefer[1].fY); in quadTo()
166 SkScalar deferDx = fDefer[1].fX - fDefer[0].fX; in changedSlopes()
[all …]
DSkLineParameters.h73 fB = pts[e].fX - pts[s].fX; in cubicEndPoints()
74 fC = pts[s].fX * pts[e].fY - pts[e].fX * pts[s].fY; in cubicEndPoints()
87 fB = pts[1].fX - pts[0].fX; in lineEndPoints()
88 fC = pts[0].fX * pts[1].fY - pts[1].fX * pts[0].fY; in lineEndPoints()
112 fB = pts[e].fX - pts[s].fX; in quadEndPoints()
113 fC = pts[s].fX * pts[e].fY - pts[e].fX * pts[s].fY; in quadEndPoints()
141 distance[index].fX = index * oneThird; in cubicDistanceY()
142 distance[index].fY = fA * pts[index].fX + fB * pts[index].fY + fC; in cubicDistanceY()
149 distance[index].fX = index * oneHalf; in quadDistanceY()
150 distance[index].fY = fA * pts[index].fX + fB * pts[index].fY + fC; in quadDistanceY()
[all …]
DSkDLineIntersection.cpp49 double denom = bLen.fY * aLen.fX - aLen.fY * bLen.fX; in intersectRay()
51 double numerA = ab0.fY * bLen.fX - bLen.fY * ab0.fX; in intersectRay()
52 double numerB = ab0.fY * aLen.fX - aLen.fY * ab0.fX; in intersectRay()
66 if (!AlmostEqualUlps(aLen.fX * a[0].fY - aLen.fY * a[0].fX, in intersectRay()
67 aLen.fX * b[0].fY - aLen.fY * b[0].fX)) { in intersectRay()
97 double axLen = a[1].fX - a[0].fX; in intersect()
99 double bxLen = b[1].fX - b[0].fX; in intersect()
115 double ab0x = a[0].fX - b[0].fX; in intersect()
190 if (AlmostEqualUlps(min, max) && max - min < fabs(line[0].fX - line[1].fX)) { in horizontal_coincident()
223 double xIntercept = line[0].fX + fT[0][0] * (line[1].fX - line[0].fX); in horizontal()
[all …]
DSkReduceOrder.cpp60 if (quad[minX].fX > quad[index].fX) { in reduce()
66 if (quad[maxX].fX < quad[index].fX) { in reduce()
74 if (AlmostEqualUlps(quad[index].fX, quad[minX].fX)) { in reduce()
123 double dx10 = cubic[1].fX - cubic[0].fX; in check_quadratic()
124 double dx23 = cubic[2].fX - cubic[3].fX; in check_quadratic()
125 double midX = cubic[0].fX + dx10 * 3 / 2; in check_quadratic()
126 double sideAx = midX - cubic[3].fX; in check_quadratic()
142 reduction[1].fX = midX; in check_quadratic()
191 if (cubic[minX].fX > cubic[index].fX) { in reduce()
197 if (cubic[maxX].fX < cubic[index].fX) { in reduce()
[all …]
/external/skia/gm/
Dgradients_2pt_conical.cpp43 SkScalar radius0 = (pts[1].fX - pts[0].fX) / 10; in Make2ConicalOutside()
44 SkScalar radius1 = (pts[1].fX - pts[0].fX) / 3; in Make2ConicalOutside()
45 center0.set(pts[0].fX + radius0, pts[0].fY + radius0); in Make2ConicalOutside()
46 center1.set(pts[1].fX - radius1, pts[1].fY - radius1); in Make2ConicalOutside()
56 SkScalar radius0 = (pts[1].fX - pts[0].fX) / 10; in Make2ConicalOutsideFlip()
57 SkScalar radius1 = (pts[1].fX - pts[0].fX) / 3; in Make2ConicalOutsideFlip()
58 center0.set(pts[0].fX + radius0, pts[0].fY + radius0); in Make2ConicalOutsideFlip()
59 center1.set(pts[1].fX - radius1, pts[1].fY - radius1); in Make2ConicalOutsideFlip()
69 center0.set(SkScalarAve(pts[0].fX, pts[1].fX), in Make2ConicalInside()
71 center1.set(SkScalarInterp(pts[0].fX, pts[1].fX, SkIntToScalar(3)/5), in Make2ConicalInside()
[all …]
/external/skia/include/core/
DSkPoint.h19 int16_t fX, fY; member
27 int16_t x() const { return fX; } in x()
31 fX = SkToS16(x); in set()
41 int32_t fX, fY; member
49 int32_t x() const { return fX; } in x()
51 void setX(int32_t x) { fX = x; } in setX()
57 bool isZero() const { return (fX | fY) == 0; } in isZero()
62 void setZero() { fX = fY = 0; } in setZero()
65 void set(int32_t x, int32_t y) { fX = x; fY = y; } in set()
89 void negate() { fX = -fX; fY = -fY; } in negate()
[all …]
DSkPoint3.h14 SkScalar fX, fY, fZ; member
22 SkScalar x() const { return fX; } in x()
26 void set(SkScalar x, SkScalar y, SkScalar z) { fX = x; fY = y; fZ = z; } in set()
29 return a.fX == b.fX && a.fY == b.fY && a.fZ == b.fZ;
42 SkScalar length() const { return SkPoint3::Length(fX, fY, fZ); } in length()
54 p.set(scale * fX, scale * fY, scale * fZ); in makeScale()
61 fX *= value; in scale()
71 neg.fX = -fX;
82 v.set(a.fX - b.fX, a.fY - b.fY, a.fZ - b.fZ);
90 v.set(a.fX + b.fX, a.fY + b.fY, a.fZ + b.fZ);
[all …]
/external/skia/src/core/
DSkStrokerPriv.cpp18 path->lineTo(stop.fX, stop.fY); in ButtCapper()
43 path->setLastPt(pivot.fX + normal.fX + parallel.fX, pivot.fY + normal.fY + parallel.fY); in SquareCapper()
44 path->lineTo(pivot.fX - normal.fX + parallel.fX, pivot.fY - normal.fY + parallel.fY); in SquareCapper()
48 path->lineTo(pivot.fX + normal.fX + parallel.fX, pivot.fY + normal.fY + parallel.fY); in SquareCapper()
49 path->lineTo(pivot.fX - normal.fX + parallel.fX, pivot.fY - normal.fY + parallel.fY); in SquareCapper()
50 path->lineTo(stop.fX, stop.fY); in SquareCapper()
58 return SkScalarMul(before.fX, after.fY) - SkScalarMul(before.fY, after.fX) > 0; in is_clockwise()
88 inner->lineTo(pivot.fX, pivot.fY); in HandleInnerJoin()
91 inner->lineTo(pivot.fX - after.fX, pivot.fY - after.fY); in HandleInnerJoin()
107 outer->lineTo(pivot.fX + after.fX, pivot.fY + after.fY); in BluntJoiner()
[all …]
DSkLineClipper.cpp29 return SkScalarAve(src[0].fX, src[1].fX); in sect_with_horizontal()
33 double X0 = src[0].fX; in sect_with_horizontal()
35 double X1 = src[1].fX; in sect_with_horizontal()
48 SkScalar dx = src[1].fX - src[0].fX; in sect_with_vertical()
54 double X0 = src[0].fX; in sect_with_vertical()
56 double X1 = src[1].fX; in sect_with_vertical()
118 if (tmp[0].fX < tmp[1].fX) { in IntersectLine()
127 if ((tmp[index1].fX <= clip.fLeft || tmp[index0].fX >= clip.fRight) && in IntersectLine()
128 tmp[index0].fX < tmp[index1].fX) { in IntersectLine()
133 if (tmp[index0].fX < clip.fLeft) { in IntersectLine()
[all …]
DSkRRect.cpp133 if (!SkScalarsAreFinite(&radii[0].fX, 8)) { in setRectRadii()
144 if (fRadii[i].fX <= 0 || fRadii[i].fY <= 0) { in setRectRadii()
149 fRadii[i].fX = 0; in setRectRadii()
181 scale = compute_min_scale(fRadii[0].fX, fRadii[1].fX, width, scale); in scaleRadii()
183 scale = compute_min_scale(fRadii[2].fX, fRadii[3].fX, width, scale); in scaleRadii()
187 SkScaleToSides::AdjustRadii(width, scale, &fRadii[0].fX, &fRadii[1].fX); in scaleRadii()
189 SkScaleToSides::AdjustRadii(width, scale, &fRadii[2].fX, &fRadii[3].fX); in scaleRadii()
209 if (x < fRect.fLeft + fRadii[kUpperLeft_Corner].fX && in checkCornerContainment()
213 canonicalPt.set(x - (fRect.fLeft + fRadii[kUpperLeft_Corner].fX), in checkCornerContainment()
215 SkASSERT(canonicalPt.fX < 0 && canonicalPt.fY < 0); in checkCornerContainment()
[all …]
/external/skia/tests/
DPathOpsLineIntersectionTest.cpp121 double left = SkTMin(line1[0].fX, line1[1].fX); in testOne()
122 double right = SkTMax(line1[0].fX, line1[1].fX); in testOne()
124 ts.horizontal(line2, left, right, line1[0].fY, line1[0].fX != left); in testOne()
128 double left = SkTMin(line2[0].fX, line2[1].fX); in testOne()
129 double right = SkTMax(line2[0].fX, line2[1].fX); in testOne()
131 ts.horizontal(line1, left, right, line2[0].fY, line2[0].fX != left); in testOne()
134 if (line1[0].fX == line1[1].fX) { in testOne()
138 ts.vertical(line2, top, bottom, line1[0].fX, line1[0].fY != top); in testOne()
141 if (line2[0].fX == line2[1].fX) { in testOne()
145 ts.vertical(line1, top, bottom, line2[0].fX, line2[0].fY != top); in testOne()
[all …]
DStrokerTest.cpp33 path.moveTo(c[0].fX, c[0].fY); in cubicTest()
34 path.cubicTo(c[1].fX, c[1].fY, c[2].fX, c[2].fY, c[3].fX, c[3].fY); in cubicTest()
40 path.moveTo(c[0].fX, c[0].fY); in quadTest()
41 path.quadTo(c[1].fX, c[1].fY, c[2].fX, c[2].fY); in quadTest()
49 SkPoint c[4] = { {(float) d[0].fX, (float) d[0].fY}, {(float) d[1].fX, (float) d[1].fY}, in cubicSetTest()
50 {(float) d[2].fX, (float) d[2].fY}, {(float) d[3].fX, (float) d[3].fY} }; in cubicSetTest()
63 SkPoint c[4] = { {(float) d[0].fX, (float) d[0].fY}, {(float) d[1].fX, (float) d[1].fY}, in cubicPairSetTest()
64 … {(float) d[2].fX, (float) d[2].fY}, {(float) d[3].fX, (float) d[3].fY} }; in cubicPairSetTest()
77 SkPoint c[3] = { {(float) d[0].fX, (float) d[0].fY}, {(float) d[1].fX, (float) d[1].fY}, in quadSetTest()
78 {(float) d[2].fX, (float) d[2].fY} }; in quadSetTest()
[all …]
DPathOpsCubicReduceOrderTest.cpp17 return between(cubic[0].fX, cubic[1].fX, cubic[3].fX)
18 && between(cubic[0].fX, cubic[2].fX, cubic[3].fX)
27 if (cubic[minX].fX > cubic[index].fX) {
33 if (cubic[maxX].fX < cubic[index].fX) {
40 return approximately_equal(cubic[maxX].fX, cubic[minX].fX)
216 if ( (reducer.fLine[0].fX != cubic[0].fX && reducer.fLine[0].fX != cubic[3].fX) in DEF_TEST()
218 || (reducer.fLine[1].fX != cubic[0].fX && reducer.fLine[1].fX != cubic[3].fX) in DEF_TEST()
228 if ( (!AlmostEqualUlps(reducer.fLine[0].fX, bounds.fLeft) in DEF_TEST()
229 && !AlmostEqualUlps(reducer.fLine[0].fX, bounds.fRight)) in DEF_TEST()
232 || (!AlmostEqualUlps(reducer.fLine[1].fX, bounds.fLeft) in DEF_TEST()
[all …]
DPathOpsTestCommon.cpp28 double dx = c[3].fX - 3 * (c[2].fX - c[1].fX) - c[0].fX; in calc_t_div()
148 if (quad[1].fX < bounds.fLeft) { in CubicToQuads()
149 quad[1].fX = bounds.fLeft; in CubicToQuads()
150 } else if (quad[1].fX > bounds.fRight) { in CubicToQuads()
151 quad[1].fX = bounds.fRight; in CubicToQuads()
173 quadPath->moveTo(pts[0].fX, pts[0].fY); in CubicPathToQuads()
176 quadPath->lineTo(pts[1].fX, pts[1].fY); in CubicPathToQuads()
179 quadPath->quadTo(pts[1].fX, pts[1].fY, pts[2].fX, pts[2].fY); in CubicPathToQuads()
190 quadPath->quadTo(qPts[0].fX, qPts[0].fY, qPts[1].fX, qPts[1].fY); in CubicPathToQuads()
212 simplePath->moveTo(pts[0].fX, pts[0].fY); in CubicPathToSimple()
[all …]
/external/skia/src/animator/
DSkParseSVGPath.cpp25 dest.set(SkScalarAve(a.fX, b.fX),SkScalarAve(a.fY, b.fY)); in midPt()
41 m.set(SkScalarHalf(3*j.fX - c.fX), SkScalarHalf(3*j.fY - c.fY)); in quadApprox()
42 n.set(SkScalarHalf(3*o.fX -q.fX), SkScalarHalf(3*o.fY - q.fY)); in quadApprox()
47 m.set(SkScalarHalf(3*p.fX - c.fX), SkScalarHalf(3*p.fY - c.fY)); in quadApprox()
48 n.set(SkScalarHalf(3*l.fX -p2.fX),SkScalarHalf(3*l.fY -p2.fY)); in quadApprox()
94 str = SkParse::FindScalars(str, &value[0].fX, count * 2); in find_points()
97 value[index].fX += relative->fX; in find_points()
156 data = find_scalar(data, &x, relative, c.fX); in parseSVG()
158 c.fX = x; in parseSVG()
164 fPath.lineTo(c.fX, y); in parseSVG()
[all …]
/external/skia/samplecode/
DSampleGradients.cpp72 center.set(SkScalarAve(pts[0].fX, pts[1].fX), in MakeRadial()
74 return SkGradientShader::CreateRadial(center, center.fX, data.fColors, in MakeRadial()
80 center.set(SkScalarAve(pts[0].fX, pts[1].fX), in MakeSweep()
82 … return SkGradientShader::CreateSweep(center.fX, center.fY, data.fColors, data.fPos, data.fCount); in MakeSweep()
87 center0.set(SkScalarAve(pts[0].fX, pts[1].fX), in Make2Conical()
89 center1.set(SkScalarInterp(pts[0].fX, pts[1].fX, SkIntToScalar(3)/5), in Make2Conical()
92 center1, (pts[1].fX - pts[0].fX) / 7, in Make2Conical()
93 center0, (pts[1].fX - pts[0].fX) / 2, in Make2Conical()
100 center.set(SkScalarAve(pts[0].fX, pts[1].fX), in Make2ConicalConcentric()
103 center, (pts[1].fX - pts[0].fX) / 7, in Make2ConicalConcentric()
[all …]
/external/skia/src/utils/
DSkCamera.cpp36 SkScalar mag = SkScalarSqrt(fX*fX + fY*fY + fZ*fZ); in normalize()
39 unit->fX = fX * scale; in normalize()
43 unit->fX = unit->fY = unit->fZ = 0; in normalize()
49 return a.fX * b.fX + a.fY * b.fY + a.fZ * b.fZ; in Dot()
58 SkScalar y = a.fZ * b.fX - a.fX * b.fY; in Cross()
59 SkScalar z = a.fX * b.fY - a.fY * b.fX; in Cross()
87 SkScalar cy = SkScalarMul(fU.fZ, fV.fX) - SkScalarMul(fU.fX, fV.fY); in dotWith()
88 SkScalar cz = SkScalarMul(fU.fX, fV.fY) - SkScalarMul(fU.fY, fV.fX); in dotWith()
181 SkScalar x = SkScalarDot(3, &fMat[0][0], 1, &src.fX, 1) + fMat[0][3]; in mapPoint()
182 SkScalar y = SkScalarDot(3, &fMat[1][0], 1, &src.fX, 1) + fMat[1][3]; in mapPoint()
[all …]
/external/skia/src/gpu/effects/
DGrRRectEffect.cpp305 radius = rrect.getSimpleRadii().fX; in onSetData()
310 radius = rrect.radii(SkRRect::kUpperLeft_Corner).fX; in onSetData()
317 radius = rrect.radii(SkRRect::kUpperRight_Corner).fX; in onSetData()
324 radius = rrect.radii(SkRRect::kLowerRight_Corner).fX; in onSetData()
331 radius = rrect.radii(SkRRect::kLowerLeft_Corner).fX; in onSetData()
338 radius = rrect.radii(SkRRect::kUpperLeft_Corner).fX; in onSetData()
345 radius = rrect.radii(SkRRect::kUpperLeft_Corner).fX; in onSetData()
352 radius = rrect.radii(SkRRect::kUpperRight_Corner).fX; in onSetData()
359 radius = rrect.radii(SkRRect::kLowerLeft_Corner).fX; in onSetData()
451 r[SkRRect::kUpperLeft_Corner].fX = d->fRandom->nextRangeF(kRadiusMin, 9.f); in TestCreate()
[all …]
/external/skia/src/gpu/
DGrRectanizer_skyline.cpp30 bestX = fSkyline[i].fX; in addRect()
39 loc->fX = bestX; in addRect()
46 loc->fX = 0; in addRect()
52 int x = fSkyline[skylineIndex].fX; in rectangleFits()
76 newSegment.fX = x; in addSkylineLevel()
81 SkASSERT(newSegment.fX + newSegment.fWidth <= this->width()); in addSkylineLevel()
87 SkASSERT(fSkyline[i-1].fX <= fSkyline[i].fX); in addSkylineLevel()
89 if (fSkyline[i].fX < fSkyline[i-1].fX + fSkyline[i-1].fWidth) { in addSkylineLevel()
90 int shrink = fSkyline[i-1].fX + fSkyline[i-1].fWidth - fSkyline[i].fX; in addSkylineLevel()
92 fSkyline[i].fX += shrink; in addSkylineLevel()
/external/pdfium/xfa/src/fwl/src/theme/
Dscrollbartp.cpp150 FX_FLOAT fX = pRect->left + pRect->width / 4; in DrawPaw() local
152 path.MoveTo(fX, fY - 4); in DrawPaw()
153 path.LineTo(fX + fPawLen, fY - 4); in DrawPaw()
154 path.MoveTo(fX, fY - 2); in DrawPaw()
155 path.LineTo(fX + fPawLen, fY - 2); in DrawPaw()
156 path.MoveTo(fX, fY); in DrawPaw()
157 path.LineTo(fX + fPawLen, fY); in DrawPaw()
158 path.MoveTo(fX, fY + 2); in DrawPaw()
159 path.LineTo(fX + fPawLen, fY + 2); in DrawPaw()
164 fX++; in DrawPaw()
[all …]
/external/skia/bench/
DGradientBench.cpp60 center.set(SkScalarAve(pts[0].fX, pts[1].fX), in MakeRadial()
62 return SkGradientShader::CreateRadial(center, center.fX * scale, in MakeRadial()
71 center.set(SkScalarAve(pts[0].fX, pts[1].fX), in MakeSweep()
73 return SkGradientShader::CreateSweep(center.fX, center.fY, data.fColors, in MakeSweep()
81 center0.set(SkScalarAve(pts[0].fX, pts[1].fX), in MakeConical()
83 center1.set(SkScalarInterp(pts[0].fX, pts[1].fX, SkIntToScalar(3)/5), in MakeConical()
85 return SkGradientShader::CreateTwoPointConical(center1, (pts[1].fX - pts[0].fX) / 7, in MakeConical()
86 center0, (pts[1].fX - pts[0].fX) / 2, in MakeConical()
94 center0.set(SkScalarAve(pts[0].fX, pts[1].fX), in MakeConicalZeroRad()
96 center1.set(SkScalarInterp(pts[0].fX, pts[1].fX, SkIntToScalar(3)/5), in MakeConicalZeroRad()
[all …]

12345678910>>...20