blob: feef3b9e1e162594ac697cf2af52bf1dfe839949 [file] [log] [blame]
rileya@google.com589708b2012-07-26 20:04:23 +00001
2/*
3 * Copyright 2012 Google Inc.
4 *
5 * Use of this source code is governed by a BSD-style license that can be
6 * found in the LICENSE file.
7 */
8
9#include "SkTwoPointConicalGradient.h"
10
11static int valid_divide(float numer, float denom, float* ratio) {
12 SkASSERT(ratio);
13 if (0 == denom) {
14 return 0;
15 }
16 *ratio = numer / denom;
17 return 1;
18}
19
20// Return the number of distinct real roots, and write them into roots[] in
21// ascending order
22static int find_quad_roots(float A, float B, float C, float roots[2]) {
23 SkASSERT(roots);
24
25 if (A == 0) {
26 return valid_divide(-C, B, roots);
27 }
28
29 float R = B*B - 4*A*C;
30 if (R < 0) {
31 return 0;
32 }
33 R = sk_float_sqrt(R);
34
35#if 1
36 float Q = B;
37 if (Q < 0) {
38 Q -= R;
39 } else {
40 Q += R;
41 }
42#else
43 // on 10.6 this was much slower than the above branch :(
44 float Q = B + copysignf(R, B);
45#endif
46 Q *= -0.5f;
47 if (0 == Q) {
48 roots[0] = 0;
49 return 1;
50 }
51
52 float r0 = Q / A;
53 float r1 = C / Q;
54 roots[0] = r0 < r1 ? r0 : r1;
55 roots[1] = r0 > r1 ? r0 : r1;
56 return 2;
57}
58
59static float lerp(float x, float dx, float t) {
60 return x + t * dx;
61}
62
63static float sqr(float x) { return x * x; }
64
65void TwoPtRadial::init(const SkPoint& center0, SkScalar rad0,
66 const SkPoint& center1, SkScalar rad1) {
67 fCenterX = SkScalarToFloat(center0.fX);
68 fCenterY = SkScalarToFloat(center0.fY);
69 fDCenterX = SkScalarToFloat(center1.fX) - fCenterX;
70 fDCenterY = SkScalarToFloat(center1.fY) - fCenterY;
71 fRadius = SkScalarToFloat(rad0);
72 fDRadius = SkScalarToFloat(rad1) - fRadius;
73
74 fA = sqr(fDCenterX) + sqr(fDCenterY) - sqr(fDRadius);
75 fRadius2 = sqr(fRadius);
76 fRDR = fRadius * fDRadius;
77}
78
79void TwoPtRadial::setup(SkScalar fx, SkScalar fy, SkScalar dfx, SkScalar dfy) {
80 fRelX = SkScalarToFloat(fx) - fCenterX;
81 fRelY = SkScalarToFloat(fy) - fCenterY;
82 fIncX = SkScalarToFloat(dfx);
83 fIncY = SkScalarToFloat(dfy);
84 fB = -2 * (fDCenterX * fRelX + fDCenterY * fRelY + fRDR);
85 fDB = -2 * (fDCenterX * fIncX + fDCenterY * fIncY);
86}
87
88SkFixed TwoPtRadial::nextT() {
89 float roots[2];
90
91 float C = sqr(fRelX) + sqr(fRelY) - fRadius2;
92 int countRoots = find_quad_roots(fA, fB, C, roots);
93
94 fRelX += fIncX;
95 fRelY += fIncY;
96 fB += fDB;
97
98 if (0 == countRoots) {
99 return kDontDrawT;
100 }
101
102 // Prefer the bigger t value if both give a radius(t) > 0
103 // find_quad_roots returns the values sorted, so we start with the last
104 float t = roots[countRoots - 1];
105 float r = lerp(fRadius, fDRadius, t);
106 if (r <= 0) {
107 t = roots[0]; // might be the same as roots[countRoots-1]
108 r = lerp(fRadius, fDRadius, t);
109 if (r <= 0) {
110 return kDontDrawT;
111 }
112 }
113 return SkFloatToFixed(t);
114}
115
116typedef void (*TwoPointRadialProc)(TwoPtRadial* rec, SkPMColor* dstC,
117 const SkPMColor* cache, int count);
118
119static void twopoint_clamp(TwoPtRadial* rec, SkPMColor* SK_RESTRICT dstC,
120 const SkPMColor* SK_RESTRICT cache, int count) {
121 for (; count > 0; --count) {
122 SkFixed t = rec->nextT();
123 if (TwoPtRadial::DontDrawT(t)) {
124 *dstC++ = 0;
125 } else {
126 SkFixed index = SkClampMax(t, 0xFFFF);
127 SkASSERT(index <= 0xFFFF);
128 *dstC++ = cache[index >> SkGradientShaderBase::kCache32Shift];
129 }
130 }
131}
132
133static void twopoint_repeat(TwoPtRadial* rec, SkPMColor* SK_RESTRICT dstC,
134 const SkPMColor* SK_RESTRICT cache, int count) {
135 for (; count > 0; --count) {
136 SkFixed t = rec->nextT();
137 if (TwoPtRadial::DontDrawT(t)) {
138 *dstC++ = 0;
139 } else {
140 SkFixed index = repeat_tileproc(t);
141 SkASSERT(index <= 0xFFFF);
142 *dstC++ = cache[index >> SkGradientShaderBase::kCache32Shift];
143 }
144 }
145}
146
147static void twopoint_mirror(TwoPtRadial* rec, SkPMColor* SK_RESTRICT dstC,
148 const SkPMColor* SK_RESTRICT cache, int count) {
149 for (; count > 0; --count) {
150 SkFixed t = rec->nextT();
151 if (TwoPtRadial::DontDrawT(t)) {
152 *dstC++ = 0;
153 } else {
154 SkFixed index = mirror_tileproc(t);
155 SkASSERT(index <= 0xFFFF);
156 *dstC++ = cache[index >> SkGradientShaderBase::kCache32Shift];
157 }
158 }
159}
160
161void SkTwoPointConicalGradient::init() {
162 fRec.init(fCenter1, fRadius1, fCenter2, fRadius2);
163 fPtsToUnit.reset();
164}
165
166SkTwoPointConicalGradient::SkTwoPointConicalGradient(
167 const SkPoint& start, SkScalar startRadius,
168 const SkPoint& end, SkScalar endRadius,
169 const SkColor colors[], const SkScalar pos[],
170 int colorCount, SkShader::TileMode mode,
171 SkUnitMapper* mapper)
172 : SkGradientShaderBase(colors, pos, colorCount, mode, mapper),
173 fCenter1(start),
174 fCenter2(end),
175 fRadius1(startRadius),
176 fRadius2(endRadius) {
177 // this is degenerate, and should be caught by our caller
178 SkASSERT(fCenter1 != fCenter2 || fRadius1 != fRadius2);
179 this->init();
180}
181
182void SkTwoPointConicalGradient::shadeSpan(int x, int y, SkPMColor* dstCParam,
183 int count) {
184 SkASSERT(count > 0);
185
186 SkPMColor* SK_RESTRICT dstC = dstCParam;
187
188 SkMatrix::MapXYProc dstProc = fDstToIndexProc;
189 TileProc proc = fTileProc;
190 const SkPMColor* SK_RESTRICT cache = this->getCache32();
191
192 TwoPointRadialProc shadeProc = twopoint_repeat;
193 if (SkShader::kClamp_TileMode == fTileMode) {
194 shadeProc = twopoint_clamp;
195 } else if (SkShader::kMirror_TileMode == fTileMode) {
196 shadeProc = twopoint_mirror;
197 } else {
198 SkASSERT(SkShader::kRepeat_TileMode == fTileMode);
199 }
200
201 if (fDstToIndexClass != kPerspective_MatrixClass) {
202 SkPoint srcPt;
203 dstProc(fDstToIndex, SkIntToScalar(x) + SK_ScalarHalf,
204 SkIntToScalar(y) + SK_ScalarHalf, &srcPt);
205 SkScalar dx, fx = srcPt.fX;
206 SkScalar dy, fy = srcPt.fY;
207
208 if (fDstToIndexClass == kFixedStepInX_MatrixClass) {
209 SkFixed fixedX, fixedY;
210 (void)fDstToIndex.fixedStepInX(SkIntToScalar(y), &fixedX, &fixedY);
211 dx = SkFixedToScalar(fixedX);
212 dy = SkFixedToScalar(fixedY);
213 } else {
214 SkASSERT(fDstToIndexClass == kLinear_MatrixClass);
215 dx = fDstToIndex.getScaleX();
216 dy = fDstToIndex.getSkewY();
217 }
218
219 fRec.setup(fx, fy, dx, dy);
220 (*shadeProc)(&fRec, dstC, cache, count);
221 } else { // perspective case
222 SkScalar dstX = SkIntToScalar(x);
223 SkScalar dstY = SkIntToScalar(y);
224 for (; count > 0; --count) {
225 SkPoint srcPt;
226 dstProc(fDstToIndex, dstX, dstY, &srcPt);
227 dstX += SK_Scalar1;
228
229 fRec.setup(srcPt.fX, srcPt.fY, 0, 0);
230 (*shadeProc)(&fRec, dstC, cache, 1);
231 }
232 }
233}
234
235bool SkTwoPointConicalGradient::setContext(const SkBitmap& device,
236 const SkPaint& paint,
237 const SkMatrix& matrix) {
238 if (!this->INHERITED::setContext(device, paint, matrix)) {
239 return false;
240 }
241
242 // we don't have a span16 proc
243 fFlags &= ~kHasSpan16_Flag;
244
245 // in general, we might discard based on computed-radius, so clear
246 // this flag (todo: sometimes we can detect that we never discard...)
247 fFlags &= ~kOpaqueAlpha_Flag;
248
249 return true;
250}
251
252SkShader::BitmapType SkTwoPointConicalGradient::asABitmap(
253 SkBitmap* bitmap, SkMatrix* matrix, SkShader::TileMode* xy) const {
254 SkPoint diff = fCenter2 - fCenter1;
255 SkScalar diffRadius = fRadius2 - fRadius1;
256 SkScalar startRadius = fRadius1;
257 SkScalar diffLen = 0;
258
259 if (bitmap) {
rileya@google.com1c6d64b2012-07-27 15:49:05 +0000260 this->getGradientTableBitmap(bitmap);
rileya@google.com589708b2012-07-26 20:04:23 +0000261 }
262 if (matrix) {
263 diffLen = diff.length();
264 }
265 if (matrix) {
266 if (diffLen) {
267 SkScalar invDiffLen = SkScalarInvert(diffLen);
268 // rotate to align circle centers with the x-axis
269 matrix->setSinCos(-SkScalarMul(invDiffLen, diff.fY),
270 SkScalarMul(invDiffLen, diff.fX));
271 } else {
272 matrix->reset();
273 }
274 matrix->preTranslate(-fCenter1.fX, -fCenter1.fY);
275 }
276 if (xy) {
277 xy[0] = fTileMode;
278 xy[1] = kClamp_TileMode;
279 }
280 return kTwoPointConical_BitmapType;
281}
282
283SkShader::GradientType SkTwoPointConicalGradient::asAGradient(
284 GradientInfo* info) const {
285 if (info) {
286 commonAsAGradient(info);
287 info->fPoint[0] = fCenter1;
288 info->fPoint[1] = fCenter2;
289 info->fRadius[0] = fRadius1;
290 info->fRadius[1] = fRadius2;
291 }
292 return kConical_GradientType;
293}
294
295GrCustomStage* SkTwoPointConicalGradient::asNewCustomStage(
296 GrContext* context, GrSamplerState* sampler) const {
297 SkASSERT(NULL != context && NULL != sampler);
298 SkPoint diff = fCenter2 - fCenter1;
299 SkScalar diffLen = diff.length();
300 if (0 != diffLen) {
301 SkScalar invDiffLen = SkScalarInvert(diffLen);
302 sampler->matrix()->setSinCos(-SkScalarMul(invDiffLen, diff.fY),
303 SkScalarMul(invDiffLen, diff.fX));
304 } else {
305 sampler->matrix()->reset();
306 }
307 sampler->matrix()->preTranslate(-fCenter1.fX, -fCenter1.fY);
308 sampler->textureParams()->setTileModeX(fTileMode);
309 sampler->textureParams()->setTileModeY(kClamp_TileMode);
310 sampler->textureParams()->setBilerp(true);
rileya@google.com1c6d64b2012-07-27 15:49:05 +0000311 return SkNEW_ARGS(GrConical2Gradient, (context, *this, sampler));
rileya@google.com589708b2012-07-26 20:04:23 +0000312}
313
314SkTwoPointConicalGradient::SkTwoPointConicalGradient(
315 SkFlattenableReadBuffer& buffer)
316 : INHERITED(buffer),
317 fCenter1(buffer.readPoint()),
318 fCenter2(buffer.readPoint()),
319 fRadius1(buffer.readScalar()),
320 fRadius2(buffer.readScalar()) {
321 this->init();
322};
323
324void SkTwoPointConicalGradient::flatten(
325 SkFlattenableWriteBuffer& buffer) const {
326 this->INHERITED::flatten(buffer);
327 buffer.writePoint(fCenter1);
328 buffer.writePoint(fCenter2);
329 buffer.writeScalar(fRadius1);
330 buffer.writeScalar(fRadius2);
331}
332
rileya@google.comd7cc6512012-07-27 14:00:39 +0000333/////////////////////////////////////////////////////////////////////
334
335// For brevity
336typedef GrGLUniformManager::UniformHandle UniformHandle;
337static const UniformHandle kInvalidUniformHandle = GrGLUniformManager::kInvalidUniformHandle;
338
339class GrGLConical2Gradient : public GrGLGradientStage {
340
341public:
342
343 GrGLConical2Gradient(const GrProgramStageFactory& factory,
344 const GrCustomStage&);
345 virtual ~GrGLConical2Gradient() { }
346
347 virtual void setupVariables(GrGLShaderBuilder* builder) SK_OVERRIDE;
348 virtual void emitVS(GrGLShaderBuilder* builder,
349 const char* vertexCoords) SK_OVERRIDE;
350 virtual void emitFS(GrGLShaderBuilder* builder,
351 const char* outputColor,
352 const char* inputColor,
353 const char* samplerName) SK_OVERRIDE;
354 virtual void setData(const GrGLUniformManager&,
355 const GrCustomStage&,
356 const GrRenderTarget*,
357 int stageNum) SK_OVERRIDE;
358
359 static StageKey GenKey(const GrCustomStage& s) {
360 return (static_cast<const GrConical2Gradient&>(s).isDegenerate());
361 }
362
363protected:
364
365 UniformHandle fVSParamUni;
366 UniformHandle fFSParamUni;
367
368 const char* fVSVaryingName;
369 const char* fFSVaryingName;
370
371 bool fIsDegenerate;
372
373 // @{
374 /// Values last uploaded as uniforms
375
376 GrScalar fCachedCenter;
377 GrScalar fCachedRadius;
378 GrScalar fCachedDiffRadius;
379
380 // @}
381
382private:
383
384 typedef GrGLGradientStage INHERITED;
385
386};
387
388GrGLConical2Gradient::GrGLConical2Gradient(
389 const GrProgramStageFactory& factory,
390 const GrCustomStage& baseData)
391 : INHERITED(factory)
392 , fVSParamUni(kInvalidUniformHandle)
393 , fFSParamUni(kInvalidUniformHandle)
394 , fVSVaryingName(NULL)
395 , fFSVaryingName(NULL)
396 , fCachedCenter(GR_ScalarMax)
397 , fCachedRadius(-GR_ScalarMax)
398 , fCachedDiffRadius(-GR_ScalarMax) {
399
400 const GrConical2Gradient& data =
401 static_cast<const GrConical2Gradient&>(baseData);
402 fIsDegenerate = data.isDegenerate();
403}
404
405void GrGLConical2Gradient::setupVariables(GrGLShaderBuilder* builder) {
406 // 2 copies of uniform array, 1 for each of vertex & fragment shader,
407 // to work around Xoom bug. Doesn't seem to cause performance decrease
408 // in test apps, but need to keep an eye on it.
409 fVSParamUni = builder->addUniformArray(GrGLShaderBuilder::kVertex_ShaderType,
410 kFloat_GrSLType, "Conical2VSParams", 6);
411 fFSParamUni = builder->addUniformArray(GrGLShaderBuilder::kFragment_ShaderType,
412 kFloat_GrSLType, "Conical2FSParams", 6);
413
414 // For radial gradients without perspective we can pass the linear
415 // part of the quadratic as a varying.
416 if (builder->fVaryingDims == builder->fCoordDims) {
417 builder->addVarying(kFloat_GrSLType, "Conical2BCoeff",
418 &fVSVaryingName, &fFSVaryingName);
419 }
420}
421
422void GrGLConical2Gradient::emitVS(GrGLShaderBuilder* builder,
423 const char* vertexCoords) {
424 SkString* code = &builder->fVSCode;
425 SkString p2; // distance between centers
426 SkString p3; // start radius
427 SkString p5; // difference in radii (r1 - r0)
428 builder->getUniformVariable(fVSParamUni).appendArrayAccess(2, &p2);
429 builder->getUniformVariable(fVSParamUni).appendArrayAccess(3, &p3);
430 builder->getUniformVariable(fVSParamUni).appendArrayAccess(5, &p5);
431
432 // For radial gradients without perspective we can pass the linear
433 // part of the quadratic as a varying.
434 if (builder->fVaryingDims == builder->fCoordDims) {
435 // r2Var = -2 * (r2Parm[2] * varCoord.x - r2Param[3] * r2Param[5])
436 code->appendf("\t%s = -2.0 * (%s * %s.x + %s * %s);\n",
437 fVSVaryingName, p2.c_str(),
438 vertexCoords, p3.c_str(), p5.c_str());
439 }
440}
441
442void GrGLConical2Gradient::emitFS(GrGLShaderBuilder* builder,
443 const char* outputColor,
444 const char* inputColor,
445 const char* samplerName) {
446 SkString* code = &builder->fFSCode;
447
448 SkString cName("c");
449 SkString ac4Name("ac4");
450 SkString dName("d");
451 SkString qName("q");
452 SkString r0Name("r0");
453 SkString r1Name("r1");
454 SkString tName("t");
455 SkString p0; // 4a
456 SkString p1; // 1/a
457 SkString p2; // distance between centers
458 SkString p3; // start radius
459 SkString p4; // start radius squared
460 SkString p5; // difference in radii (r1 - r0)
461
462 builder->getUniformVariable(fFSParamUni).appendArrayAccess(0, &p0);
463 builder->getUniformVariable(fFSParamUni).appendArrayAccess(1, &p1);
464 builder->getUniformVariable(fFSParamUni).appendArrayAccess(2, &p2);
465 builder->getUniformVariable(fFSParamUni).appendArrayAccess(3, &p3);
466 builder->getUniformVariable(fFSParamUni).appendArrayAccess(4, &p4);
467 builder->getUniformVariable(fFSParamUni).appendArrayAccess(5, &p5);
468
469 // If we we're able to interpolate the linear component,
470 // bVar is the varying; otherwise compute it
471 SkString bVar;
472 if (builder->fCoordDims == builder->fVaryingDims) {
473 bVar = fFSVaryingName;
474 GrAssert(2 == builder->fVaryingDims);
475 } else {
476 GrAssert(3 == builder->fVaryingDims);
477 bVar = "b";
478 code->appendf("\tfloat %s = -2.0 * (%s * %s.x + %s * %s);\n",
479 bVar.c_str(), p2.c_str(), builder->fSampleCoords.c_str(),
480 p3.c_str(), p5.c_str());
481 }
482
483 // output will default to transparent black (we simply won't write anything
484 // else to it if invalid, instead of discarding or returning prematurely)
485 code->appendf("\t%s = vec4(0.0,0.0,0.0,0.0);\n", outputColor);
486
487 // c = (x^2)+(y^2) - params[4]
488 code->appendf("\tfloat %s = dot(%s, %s) - %s;\n", cName.c_str(),
489 builder->fSampleCoords.c_str(), builder->fSampleCoords.c_str(),
490 p4.c_str());
491
492 // Non-degenerate case (quadratic)
493 if (!fIsDegenerate) {
494
495 // ac4 = params[0] * c
496 code->appendf("\tfloat %s = %s * %s;\n", ac4Name.c_str(), p0.c_str(),
497 cName.c_str());
498
499 // d = b^2 - ac4
500 code->appendf("\tfloat %s = %s * %s - %s;\n", dName.c_str(),
501 bVar.c_str(), bVar.c_str(), ac4Name.c_str());
502
503 // only proceed if discriminant is >= 0
504 code->appendf("\tif (%s >= 0.0) {\n", dName.c_str());
505
506 // intermediate value we'll use to compute the roots
507 // q = -0.5 * (b +/- sqrt(d))
508 code->appendf("\t\tfloat %s = -0.5 * (%s + (%s < 0.0 ? -1.0 : 1.0)"
509 " * sqrt(%s));\n", qName.c_str(), bVar.c_str(),
510 bVar.c_str(), dName.c_str());
511
512 // compute both roots
513 // r0 = q * params[1]
514 code->appendf("\t\tfloat %s = %s * %s;\n", r0Name.c_str(),
515 qName.c_str(), p1.c_str());
516 // r1 = c / q
517 code->appendf("\t\tfloat %s = %s / %s;\n", r1Name.c_str(),
518 cName.c_str(), qName.c_str());
519
520 // Note: If there are two roots that both generate radius(t) > 0, the
521 // Canvas spec says to choose the larger t.
522
523 // so we'll look at the larger one first:
524 code->appendf("\t\tfloat %s = max(%s, %s);\n", tName.c_str(),
525 r0Name.c_str(), r1Name.c_str());
526
527 // if r(t) > 0, then we're done; t will be our x coordinate
528 code->appendf("\t\tif (%s * %s + %s > 0.0) {\n", tName.c_str(),
529 p5.c_str(), p3.c_str());
530
531 code->appendf("\t\t");
532 this->emitColorLookup(builder, tName.c_str(), outputColor, samplerName);
533
534 // otherwise, if r(t) for the larger root was <= 0, try the other root
535 code->appendf("\t\t} else {\n");
536 code->appendf("\t\t\t%s = min(%s, %s);\n", tName.c_str(),
537 r0Name.c_str(), r1Name.c_str());
538
539 // if r(t) > 0 for the smaller root, then t will be our x coordinate
540 code->appendf("\t\t\tif (%s * %s + %s > 0.0) {\n",
541 tName.c_str(), p5.c_str(), p3.c_str());
542
543 code->appendf("\t\t\t");
544 this->emitColorLookup(builder, tName.c_str(), outputColor, samplerName);
545
546 // end if (r(t) > 0) for smaller root
547 code->appendf("\t\t\t}\n");
548 // end if (r(t) > 0), else, for larger root
549 code->appendf("\t\t}\n");
550 // end if (discriminant >= 0)
551 code->appendf("\t}\n");
552 } else {
553
554 // linear case: t = -c/b
555 code->appendf("\tfloat %s = -(%s / %s);\n", tName.c_str(),
556 cName.c_str(), bVar.c_str());
557
558 // if r(t) > 0, then t will be the x coordinate
559 code->appendf("\tif (%s * %s + %s > 0.0) {\n", tName.c_str(),
560 p5.c_str(), p3.c_str());
561 code->appendf("\t");
562 this->emitColorLookup(builder, tName.c_str(), outputColor, samplerName);
563 code->appendf("\t}\n");
564 }
565}
566
567void GrGLConical2Gradient::setData(const GrGLUniformManager& uman,
568 const GrCustomStage& baseData,
569 const GrRenderTarget*,
570 int stageNum) {
571 const GrConical2Gradient& data =
572 static_cast<const GrConical2Gradient&>(baseData);
573 GrAssert(data.isDegenerate() == fIsDegenerate);
574 GrScalar centerX1 = data.center();
575 GrScalar radius0 = data.radius();
576 GrScalar diffRadius = data.diffRadius();
577
578 if (fCachedCenter != centerX1 ||
579 fCachedRadius != radius0 ||
580 fCachedDiffRadius != diffRadius) {
581
582 GrScalar a = GrMul(centerX1, centerX1) - diffRadius * diffRadius;
583
584 // When we're in the degenerate (linear) case, the second
585 // value will be INF but the program doesn't read it. (We
586 // use the same 6 uniforms even though we don't need them
587 // all in the linear case just to keep the code complexity
588 // down).
589 float values[6] = {
590 GrScalarToFloat(a * 4),
591 1.f / (GrScalarToFloat(a)),
592 GrScalarToFloat(centerX1),
593 GrScalarToFloat(radius0),
594 GrScalarToFloat(SkScalarMul(radius0, radius0)),
595 GrScalarToFloat(diffRadius)
596 };
597
598 uman.set1fv(fVSParamUni, 0, 6, values);
599 uman.set1fv(fFSParamUni, 0, 6, values);
600 fCachedCenter = centerX1;
601 fCachedRadius = radius0;
602 fCachedDiffRadius = diffRadius;
603 }
604}
605
606
607/////////////////////////////////////////////////////////////////////
608
609GrConical2Gradient::GrConical2Gradient(GrTexture* texture,
610 GrScalar center,
611 GrScalar radius,
612 GrScalar diffRadius)
rileya@google.com1c6d64b2012-07-27 15:49:05 +0000613 : INHERITED(texture)
rileya@google.comd7cc6512012-07-27 14:00:39 +0000614 , fCenterX1 (center)
615 , fRadius0 (radius)
616 , fDiffRadius (diffRadius) {
617
618}
619
620GrConical2Gradient::GrConical2Gradient(GrContext* ctx,
rileya@google.com1c6d64b2012-07-27 15:49:05 +0000621 const SkTwoPointConicalGradient& shader,
622 GrSamplerState* sampler)
623 : INHERITED(ctx, shader, sampler)
624 , fCenterX1(shader.getCenterX1())
625 , fRadius0(shader.getStartRadius())
626 , fDiffRadius(shader.getDiffRadius()) {
rileya@google.comd7cc6512012-07-27 14:00:39 +0000627}
628
629GrConical2Gradient::~GrConical2Gradient() {
630
631}
632
633
634const GrProgramStageFactory& GrConical2Gradient::getFactory() const {
635 return GrTProgramStageFactory<GrConical2Gradient>::getInstance();
636}
637
638bool GrConical2Gradient::isEqual(const GrCustomStage& sBase) const {
639 const GrConical2Gradient& s = static_cast<const GrConical2Gradient&>(sBase);
640 return (INHERITED::isEqual(sBase) &&
641 this->fCenterX1 == s.fCenterX1 &&
642 this->fRadius0 == s.fRadius0 &&
643 this->fDiffRadius == s.fDiffRadius);
644}
645
646