blob: 23b976a8f8990a4fb84925fe1a3fafc57b2f17dc [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);
rmistry@google.comfbfcd562012-08-23 18:09:54 +000024
rileya@google.com589708b2012-07-26 20:04:23 +000025 if (A == 0) {
26 return valid_divide(-C, B, roots);
27 }
rmistry@google.comfbfcd562012-08-23 18:09:54 +000028
rileya@google.com589708b2012-07-26 20:04:23 +000029 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];
rmistry@google.comfbfcd562012-08-23 18:09:54 +000090
rileya@google.com589708b2012-07-26 20:04:23 +000091 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
rileya@google.com98e8b6d2012-07-31 20:38:06 +0000166/////////////////////////////////////////////////////////////////////
167
rileya@google.com589708b2012-07-26 20:04:23 +0000168SkTwoPointConicalGradient::SkTwoPointConicalGradient(
169 const SkPoint& start, SkScalar startRadius,
170 const SkPoint& end, SkScalar endRadius,
171 const SkColor colors[], const SkScalar pos[],
172 int colorCount, SkShader::TileMode mode,
173 SkUnitMapper* mapper)
174 : SkGradientShaderBase(colors, pos, colorCount, mode, mapper),
175 fCenter1(start),
176 fCenter2(end),
177 fRadius1(startRadius),
178 fRadius2(endRadius) {
179 // this is degenerate, and should be caught by our caller
180 SkASSERT(fCenter1 != fCenter2 || fRadius1 != fRadius2);
181 this->init();
182}
183
184void SkTwoPointConicalGradient::shadeSpan(int x, int y, SkPMColor* dstCParam,
185 int count) {
186 SkASSERT(count > 0);
rmistry@google.comfbfcd562012-08-23 18:09:54 +0000187
rileya@google.com589708b2012-07-26 20:04:23 +0000188 SkPMColor* SK_RESTRICT dstC = dstCParam;
rmistry@google.comfbfcd562012-08-23 18:09:54 +0000189
rileya@google.com589708b2012-07-26 20:04:23 +0000190 SkMatrix::MapXYProc dstProc = fDstToIndexProc;
bsalomon@google.com100abf42012-09-05 17:40:04 +0000191
rileya@google.com589708b2012-07-26 20:04:23 +0000192 const SkPMColor* SK_RESTRICT cache = this->getCache32();
193
194 TwoPointRadialProc shadeProc = twopoint_repeat;
195 if (SkShader::kClamp_TileMode == fTileMode) {
196 shadeProc = twopoint_clamp;
197 } else if (SkShader::kMirror_TileMode == fTileMode) {
198 shadeProc = twopoint_mirror;
199 } else {
200 SkASSERT(SkShader::kRepeat_TileMode == fTileMode);
201 }
rmistry@google.comfbfcd562012-08-23 18:09:54 +0000202
rileya@google.com589708b2012-07-26 20:04:23 +0000203 if (fDstToIndexClass != kPerspective_MatrixClass) {
204 SkPoint srcPt;
205 dstProc(fDstToIndex, SkIntToScalar(x) + SK_ScalarHalf,
206 SkIntToScalar(y) + SK_ScalarHalf, &srcPt);
207 SkScalar dx, fx = srcPt.fX;
208 SkScalar dy, fy = srcPt.fY;
rmistry@google.comfbfcd562012-08-23 18:09:54 +0000209
rileya@google.com589708b2012-07-26 20:04:23 +0000210 if (fDstToIndexClass == kFixedStepInX_MatrixClass) {
211 SkFixed fixedX, fixedY;
212 (void)fDstToIndex.fixedStepInX(SkIntToScalar(y), &fixedX, &fixedY);
213 dx = SkFixedToScalar(fixedX);
214 dy = SkFixedToScalar(fixedY);
215 } else {
216 SkASSERT(fDstToIndexClass == kLinear_MatrixClass);
217 dx = fDstToIndex.getScaleX();
218 dy = fDstToIndex.getSkewY();
219 }
220
221 fRec.setup(fx, fy, dx, dy);
222 (*shadeProc)(&fRec, dstC, cache, count);
223 } else { // perspective case
224 SkScalar dstX = SkIntToScalar(x);
225 SkScalar dstY = SkIntToScalar(y);
226 for (; count > 0; --count) {
227 SkPoint srcPt;
228 dstProc(fDstToIndex, dstX, dstY, &srcPt);
229 dstX += SK_Scalar1;
rmistry@google.comfbfcd562012-08-23 18:09:54 +0000230
rileya@google.com589708b2012-07-26 20:04:23 +0000231 fRec.setup(srcPt.fX, srcPt.fY, 0, 0);
232 (*shadeProc)(&fRec, dstC, cache, 1);
233 }
234 }
235}
236
237bool SkTwoPointConicalGradient::setContext(const SkBitmap& device,
238 const SkPaint& paint,
239 const SkMatrix& matrix) {
240 if (!this->INHERITED::setContext(device, paint, matrix)) {
241 return false;
242 }
rmistry@google.comfbfcd562012-08-23 18:09:54 +0000243
rileya@google.com589708b2012-07-26 20:04:23 +0000244 // we don't have a span16 proc
245 fFlags &= ~kHasSpan16_Flag;
rmistry@google.comfbfcd562012-08-23 18:09:54 +0000246
rileya@google.com589708b2012-07-26 20:04:23 +0000247 // in general, we might discard based on computed-radius, so clear
248 // this flag (todo: sometimes we can detect that we never discard...)
249 fFlags &= ~kOpaqueAlpha_Flag;
250
251 return true;
252}
253
254SkShader::BitmapType SkTwoPointConicalGradient::asABitmap(
255 SkBitmap* bitmap, SkMatrix* matrix, SkShader::TileMode* xy) const {
256 SkPoint diff = fCenter2 - fCenter1;
rileya@google.com589708b2012-07-26 20:04:23 +0000257 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
rileya@google.com589708b2012-07-26 20:04:23 +0000295SkTwoPointConicalGradient::SkTwoPointConicalGradient(
296 SkFlattenableReadBuffer& buffer)
297 : INHERITED(buffer),
298 fCenter1(buffer.readPoint()),
299 fCenter2(buffer.readPoint()),
300 fRadius1(buffer.readScalar()),
301 fRadius2(buffer.readScalar()) {
302 this->init();
303};
304
305void SkTwoPointConicalGradient::flatten(
306 SkFlattenableWriteBuffer& buffer) const {
307 this->INHERITED::flatten(buffer);
308 buffer.writePoint(fCenter1);
309 buffer.writePoint(fCenter2);
310 buffer.writeScalar(fRadius1);
311 buffer.writeScalar(fRadius2);
312}
313
rileya@google.comd7cc6512012-07-27 14:00:39 +0000314/////////////////////////////////////////////////////////////////////
315
bsalomon@google.comcf8fb1f2012-08-02 14:03:32 +0000316#if SK_SUPPORT_GPU
317
bsalomon@google.com2eaaefd2012-10-29 19:51:22 +0000318#include "GrTBackendEffectFactory.h"
319
rileya@google.comd7cc6512012-07-27 14:00:39 +0000320// For brevity
321typedef GrGLUniformManager::UniformHandle UniformHandle;
322static const UniformHandle kInvalidUniformHandle = GrGLUniformManager::kInvalidUniformHandle;
323
bsalomon@google.com0707c292012-10-25 21:45:42 +0000324class GrGLConical2Gradient : public GrGLGradientEffect {
rileya@google.comd7cc6512012-07-27 14:00:39 +0000325public:
326
bsalomon@google.com396e61f2012-10-25 19:00:29 +0000327 GrGLConical2Gradient(const GrBackendEffectFactory& factory,
bsalomon@google.coma469c282012-10-24 18:28:34 +0000328 const GrEffect&);
rileya@google.comd7cc6512012-07-27 14:00:39 +0000329 virtual ~GrGLConical2Gradient() { }
330
bsalomon@google.comf78df332012-10-29 12:43:38 +0000331 virtual void emitCode(GrGLShaderBuilder*,
bsalomon@google.com2eaaefd2012-10-29 19:51:22 +0000332 const GrEffectStage&,
bsalomon@google.comf78df332012-10-29 12:43:38 +0000333 EffectKey,
334 const char* vertexCoords,
335 const char* outputColor,
336 const char* inputColor,
337 const TextureSamplerArray&) SK_OVERRIDE;
bsalomon@google.com28a15fb2012-10-26 17:53:18 +0000338 virtual void setData(const GrGLUniformManager&, const GrEffectStage&) SK_OVERRIDE;
rileya@google.comd7cc6512012-07-27 14:00:39 +0000339
bsalomon@google.com2eaaefd2012-10-29 19:51:22 +0000340 static EffectKey GenKey(const GrEffectStage&, const GrGLCaps& caps);
rileya@google.comd7cc6512012-07-27 14:00:39 +0000341
342protected:
343
344 UniformHandle fVSParamUni;
345 UniformHandle fFSParamUni;
346
347 const char* fVSVaryingName;
348 const char* fFSVaryingName;
349
350 bool fIsDegenerate;
351
352 // @{
353 /// Values last uploaded as uniforms
354
bsalomon@google.com81712882012-11-01 17:12:34 +0000355 SkScalar fCachedCenter;
356 SkScalar fCachedRadius;
357 SkScalar fCachedDiffRadius;
rileya@google.comd7cc6512012-07-27 14:00:39 +0000358
359 // @}
360
361private:
362
bsalomon@google.com0707c292012-10-25 21:45:42 +0000363 typedef GrGLGradientEffect INHERITED;
rileya@google.comd7cc6512012-07-27 14:00:39 +0000364
365};
366
rileya@google.com98e8b6d2012-07-31 20:38:06 +0000367/////////////////////////////////////////////////////////////////////
368
369class GrConical2Gradient : public GrGradientEffect {
370public:
371
bsalomon@google.com0ac6af42013-01-16 15:16:18 +0000372 static GrEffectRef* Create(GrContext* ctx,
373 const SkTwoPointConicalGradient& shader,
374 const SkMatrix& matrix,
375 SkShader::TileMode tm) {
376 SkAutoTUnref<GrEffect> effect(SkNEW_ARGS(GrConical2Gradient, (ctx, shader, matrix, tm)));
bsalomon@google.coma1ebbe42013-01-16 15:51:47 +0000377 return CreateEffectRef(effect);
bsalomon@google.com0ac6af42013-01-16 15:16:18 +0000378 }
rileya@google.com98e8b6d2012-07-31 20:38:06 +0000379
380 virtual ~GrConical2Gradient() { }
381
382 static const char* Name() { return "Two-Point Conical Gradient"; }
bsalomon@google.com396e61f2012-10-25 19:00:29 +0000383 virtual const GrBackendEffectFactory& getFactory() const SK_OVERRIDE {
384 return GrTBackendEffectFactory<GrConical2Gradient>::getInstance();
rileya@google.com98e8b6d2012-07-31 20:38:06 +0000385 }
rileya@google.com98e8b6d2012-07-31 20:38:06 +0000386
387 // The radial gradient parameters can collapse to a linear (instead of quadratic) equation.
388 bool isDegenerate() const { return SkScalarAbs(fDiffRadius) == SkScalarAbs(fCenterX1); }
bsalomon@google.com81712882012-11-01 17:12:34 +0000389 SkScalar center() const { return fCenterX1; }
390 SkScalar diffRadius() const { return fDiffRadius; }
391 SkScalar radius() const { return fRadius0; }
rileya@google.com98e8b6d2012-07-31 20:38:06 +0000392
bsalomon@google.com422e81a2012-10-25 14:11:03 +0000393 typedef GrGLConical2Gradient GLEffect;
rileya@google.com98e8b6d2012-07-31 20:38:06 +0000394
395private:
bsalomon@google.com68b58c92013-01-17 16:50:08 +0000396 virtual bool onIsEqual(const GrEffect& sBase) const SK_OVERRIDE {
397 const GrConical2Gradient& s = static_cast<const GrConical2Gradient&>(sBase);
398 return (INHERITED::onIsEqual(sBase) &&
399 this->fCenterX1 == s.fCenterX1 &&
400 this->fRadius0 == s.fRadius0 &&
401 this->fDiffRadius == s.fDiffRadius);
402 }
403
bsalomon@google.com0ac6af42013-01-16 15:16:18 +0000404 GrConical2Gradient(GrContext* ctx,
405 const SkTwoPointConicalGradient& shader,
406 const SkMatrix& matrix,
407 SkShader::TileMode tm)
408 : INHERITED(ctx, shader, matrix, tm)
409 , fCenterX1(shader.getCenterX1())
410 , fRadius0(shader.getStartRadius())
411 , fDiffRadius(shader.getDiffRadius()) { }
412
bsalomon@google.comf271cc72012-10-24 19:35:13 +0000413 GR_DECLARE_EFFECT_TEST;
rileya@google.com98e8b6d2012-07-31 20:38:06 +0000414
415 // @{
416 // Cache of values - these can change arbitrarily, EXCEPT
417 // we shouldn't change between degenerate and non-degenerate?!
418
bsalomon@google.com81712882012-11-01 17:12:34 +0000419 SkScalar fCenterX1;
420 SkScalar fRadius0;
421 SkScalar fDiffRadius;
rileya@google.com98e8b6d2012-07-31 20:38:06 +0000422
423 // @}
424
425 typedef GrGradientEffect INHERITED;
426};
427
bsalomon@google.comf271cc72012-10-24 19:35:13 +0000428GR_DEFINE_EFFECT_TEST(GrConical2Gradient);
bsalomon@google.comd4726202012-08-03 14:34:46 +0000429
bsalomon@google.com0ac6af42013-01-16 15:16:18 +0000430GrEffectRef* GrConical2Gradient::TestCreate(SkRandom* random,
431 GrContext* context,
432 GrTexture**) {
bsalomon@google.comd4726202012-08-03 14:34:46 +0000433 SkPoint center1 = {random->nextUScalar1(), random->nextUScalar1()};
434 SkScalar radius1 = random->nextUScalar1();
435 SkPoint center2;
436 SkScalar radius2;
437 do {
bsalomon@google.comfb883bf2012-12-11 15:32:04 +0000438 center2.set(random->nextUScalar1(), random->nextUScalar1());
bsalomon@google.comd4726202012-08-03 14:34:46 +0000439 radius2 = random->nextUScalar1 ();
440 // If the circles are identical the factory will give us an empty shader.
441 } while (radius1 == radius2 && center1 == center2);
rmistry@google.comfbfcd562012-08-23 18:09:54 +0000442
bsalomon@google.comd4726202012-08-03 14:34:46 +0000443 SkColor colors[kMaxRandomGradientColors];
444 SkScalar stopsArray[kMaxRandomGradientColors];
445 SkScalar* stops = stopsArray;
446 SkShader::TileMode tm;
447 int colorCount = RandomGradientParams(random, colors, &stops, &tm);
448 SkAutoTUnref<SkShader> shader(SkGradientShader::CreateTwoPointConical(center1, radius1,
449 center2, radius2,
450 colors, stops, colorCount,
451 tm));
bsalomon@google.come197cbf2013-01-14 16:46:26 +0000452 SkPaint paint;
453 return shader->asNewEffect(context, paint);
bsalomon@google.comd4726202012-08-03 14:34:46 +0000454}
455
456
rileya@google.com98e8b6d2012-07-31 20:38:06 +0000457/////////////////////////////////////////////////////////////////////
458
rileya@google.comd7cc6512012-07-27 14:00:39 +0000459GrGLConical2Gradient::GrGLConical2Gradient(
bsalomon@google.com396e61f2012-10-25 19:00:29 +0000460 const GrBackendEffectFactory& factory,
bsalomon@google.coma469c282012-10-24 18:28:34 +0000461 const GrEffect& baseData)
rileya@google.comd7cc6512012-07-27 14:00:39 +0000462 : INHERITED(factory)
463 , fVSParamUni(kInvalidUniformHandle)
464 , fFSParamUni(kInvalidUniformHandle)
465 , fVSVaryingName(NULL)
466 , fFSVaryingName(NULL)
bsalomon@google.com81712882012-11-01 17:12:34 +0000467 , fCachedCenter(SK_ScalarMax)
468 , fCachedRadius(-SK_ScalarMax)
469 , fCachedDiffRadius(-SK_ScalarMax) {
rileya@google.comd7cc6512012-07-27 14:00:39 +0000470
471 const GrConical2Gradient& data =
472 static_cast<const GrConical2Gradient&>(baseData);
473 fIsDegenerate = data.isDegenerate();
474}
475
bsalomon@google.comf78df332012-10-29 12:43:38 +0000476void GrGLConical2Gradient::emitCode(GrGLShaderBuilder* builder,
bsalomon@google.comd8b5fac2012-11-01 17:02:46 +0000477 const GrEffectStage& stage,
478 EffectKey key,
bsalomon@google.comf78df332012-10-29 12:43:38 +0000479 const char* vertexCoords,
480 const char* outputColor,
481 const char* inputColor,
482 const TextureSamplerArray& samplers) {
bsalomon@google.comd8b5fac2012-11-01 17:02:46 +0000483 const char* fsCoords;
484 const char* vsCoordsVarying;
485 GrSLType coordsVaryingType;
486 this->setupMatrix(builder, key, vertexCoords, &fsCoords, &vsCoordsVarying, &coordsVaryingType);
487
bsalomon@google.comf78df332012-10-29 12:43:38 +0000488 this->emitYCoordUniform(builder);
rileya@google.comd7cc6512012-07-27 14:00:39 +0000489 // 2 copies of uniform array, 1 for each of vertex & fragment shader,
490 // to work around Xoom bug. Doesn't seem to cause performance decrease
491 // in test apps, but need to keep an eye on it.
492 fVSParamUni = builder->addUniformArray(GrGLShaderBuilder::kVertex_ShaderType,
493 kFloat_GrSLType, "Conical2VSParams", 6);
494 fFSParamUni = builder->addUniformArray(GrGLShaderBuilder::kFragment_ShaderType,
495 kFloat_GrSLType, "Conical2FSParams", 6);
496
497 // For radial gradients without perspective we can pass the linear
498 // part of the quadratic as a varying.
bsalomon@google.comd8b5fac2012-11-01 17:02:46 +0000499 if (kVec2f_GrSLType == coordsVaryingType) {
rileya@google.comd7cc6512012-07-27 14:00:39 +0000500 builder->addVarying(kFloat_GrSLType, "Conical2BCoeff",
501 &fVSVaryingName, &fFSVaryingName);
502 }
rileya@google.comd7cc6512012-07-27 14:00:39 +0000503
bsalomon@google.comf78df332012-10-29 12:43:38 +0000504 // VS
505 {
506 SkString* code = &builder->fVSCode;
507 SkString p2; // distance between centers
508 SkString p3; // start radius
509 SkString p5; // difference in radii (r1 - r0)
510 builder->getUniformVariable(fVSParamUni).appendArrayAccess(2, &p2);
511 builder->getUniformVariable(fVSParamUni).appendArrayAccess(3, &p3);
512 builder->getUniformVariable(fVSParamUni).appendArrayAccess(5, &p5);
rileya@google.comd7cc6512012-07-27 14:00:39 +0000513
bsalomon@google.comf78df332012-10-29 12:43:38 +0000514 // For radial gradients without perspective we can pass the linear
515 // part of the quadratic as a varying.
bsalomon@google.comd8b5fac2012-11-01 17:02:46 +0000516 if (kVec2f_GrSLType == coordsVaryingType) {
bsalomon@google.comf78df332012-10-29 12:43:38 +0000517 // r2Var = -2 * (r2Parm[2] * varCoord.x - r2Param[3] * r2Param[5])
518 code->appendf("\t%s = -2.0 * (%s * %s.x + %s * %s);\n",
519 fVSVaryingName, p2.c_str(),
bsalomon@google.comd8b5fac2012-11-01 17:02:46 +0000520 vsCoordsVarying, p3.c_str(), p5.c_str());
bsalomon@google.comf78df332012-10-29 12:43:38 +0000521 }
rileya@google.comd7cc6512012-07-27 14:00:39 +0000522 }
523
bsalomon@google.comf78df332012-10-29 12:43:38 +0000524 // FS
525 {
526 SkString* code = &builder->fFSCode;
rileya@google.comd7cc6512012-07-27 14:00:39 +0000527
bsalomon@google.comf78df332012-10-29 12:43:38 +0000528 SkString cName("c");
529 SkString ac4Name("ac4");
530 SkString dName("d");
531 SkString qName("q");
532 SkString r0Name("r0");
533 SkString r1Name("r1");
534 SkString tName("t");
535 SkString p0; // 4a
536 SkString p1; // 1/a
537 SkString p2; // distance between centers
538 SkString p3; // start radius
539 SkString p4; // start radius squared
540 SkString p5; // difference in radii (r1 - r0)
rileya@google.comd7cc6512012-07-27 14:00:39 +0000541
bsalomon@google.comf78df332012-10-29 12:43:38 +0000542 builder->getUniformVariable(fFSParamUni).appendArrayAccess(0, &p0);
543 builder->getUniformVariable(fFSParamUni).appendArrayAccess(1, &p1);
544 builder->getUniformVariable(fFSParamUni).appendArrayAccess(2, &p2);
545 builder->getUniformVariable(fFSParamUni).appendArrayAccess(3, &p3);
546 builder->getUniformVariable(fFSParamUni).appendArrayAccess(4, &p4);
547 builder->getUniformVariable(fFSParamUni).appendArrayAccess(5, &p5);
rileya@google.comd7cc6512012-07-27 14:00:39 +0000548
bsalomon@google.comf78df332012-10-29 12:43:38 +0000549 // If we we're able to interpolate the linear component,
550 // bVar is the varying; otherwise compute it
551 SkString bVar;
bsalomon@google.comd8b5fac2012-11-01 17:02:46 +0000552 if (kVec2f_GrSLType == coordsVaryingType) {
bsalomon@google.comf78df332012-10-29 12:43:38 +0000553 bVar = fFSVaryingName;
554 } else {
555 bVar = "b";
556 code->appendf("\tfloat %s = -2.0 * (%s * %s.x + %s * %s);\n",
bsalomon@google.comd8b5fac2012-11-01 17:02:46 +0000557 bVar.c_str(), p2.c_str(), fsCoords,
bsalomon@google.comf78df332012-10-29 12:43:38 +0000558 p3.c_str(), p5.c_str());
559 }
rmistry@google.comfbfcd562012-08-23 18:09:54 +0000560
bsalomon@google.comf78df332012-10-29 12:43:38 +0000561 // output will default to transparent black (we simply won't write anything
562 // else to it if invalid, instead of discarding or returning prematurely)
563 code->appendf("\t%s = vec4(0.0,0.0,0.0,0.0);\n", outputColor);
rileya@google.comd7cc6512012-07-27 14:00:39 +0000564
bsalomon@google.comf78df332012-10-29 12:43:38 +0000565 // c = (x^2)+(y^2) - params[4]
566 code->appendf("\tfloat %s = dot(%s, %s) - %s;\n", cName.c_str(),
bsalomon@google.comd8b5fac2012-11-01 17:02:46 +0000567 fsCoords, fsCoords,
bsalomon@google.comf78df332012-10-29 12:43:38 +0000568 p4.c_str());
rileya@google.comd7cc6512012-07-27 14:00:39 +0000569
bsalomon@google.comf78df332012-10-29 12:43:38 +0000570 // Non-degenerate case (quadratic)
571 if (!fIsDegenerate) {
rileya@google.comd7cc6512012-07-27 14:00:39 +0000572
bsalomon@google.comf78df332012-10-29 12:43:38 +0000573 // ac4 = params[0] * c
574 code->appendf("\tfloat %s = %s * %s;\n", ac4Name.c_str(), p0.c_str(),
575 cName.c_str());
rileya@google.comd7cc6512012-07-27 14:00:39 +0000576
bsalomon@google.comf78df332012-10-29 12:43:38 +0000577 // d = b^2 - ac4
578 code->appendf("\tfloat %s = %s * %s - %s;\n", dName.c_str(),
579 bVar.c_str(), bVar.c_str(), ac4Name.c_str());
rileya@google.comd7cc6512012-07-27 14:00:39 +0000580
bsalomon@google.comf78df332012-10-29 12:43:38 +0000581 // only proceed if discriminant is >= 0
582 code->appendf("\tif (%s >= 0.0) {\n", dName.c_str());
rileya@google.comd7cc6512012-07-27 14:00:39 +0000583
bsalomon@google.comf78df332012-10-29 12:43:38 +0000584 // intermediate value we'll use to compute the roots
585 // q = -0.5 * (b +/- sqrt(d))
586 code->appendf("\t\tfloat %s = -0.5 * (%s + (%s < 0.0 ? -1.0 : 1.0)"
587 " * sqrt(%s));\n", qName.c_str(), bVar.c_str(),
588 bVar.c_str(), dName.c_str());
rileya@google.comd7cc6512012-07-27 14:00:39 +0000589
bsalomon@google.comf78df332012-10-29 12:43:38 +0000590 // compute both roots
591 // r0 = q * params[1]
592 code->appendf("\t\tfloat %s = %s * %s;\n", r0Name.c_str(),
593 qName.c_str(), p1.c_str());
594 // r1 = c / q
595 code->appendf("\t\tfloat %s = %s / %s;\n", r1Name.c_str(),
596 cName.c_str(), qName.c_str());
rileya@google.comd7cc6512012-07-27 14:00:39 +0000597
bsalomon@google.comf78df332012-10-29 12:43:38 +0000598 // Note: If there are two roots that both generate radius(t) > 0, the
599 // Canvas spec says to choose the larger t.
rileya@google.comd7cc6512012-07-27 14:00:39 +0000600
bsalomon@google.comf78df332012-10-29 12:43:38 +0000601 // so we'll look at the larger one first:
602 code->appendf("\t\tfloat %s = max(%s, %s);\n", tName.c_str(),
603 r0Name.c_str(), r1Name.c_str());
rileya@google.comd7cc6512012-07-27 14:00:39 +0000604
bsalomon@google.comf78df332012-10-29 12:43:38 +0000605 // if r(t) > 0, then we're done; t will be our x coordinate
606 code->appendf("\t\tif (%s * %s + %s > 0.0) {\n", tName.c_str(),
607 p5.c_str(), p3.c_str());
rileya@google.comd7cc6512012-07-27 14:00:39 +0000608
bsalomon@google.comf78df332012-10-29 12:43:38 +0000609 code->appendf("\t\t");
610 this->emitColorLookup(builder, tName.c_str(), outputColor, inputColor, samplers[0]);
rileya@google.comd7cc6512012-07-27 14:00:39 +0000611
bsalomon@google.comf78df332012-10-29 12:43:38 +0000612 // otherwise, if r(t) for the larger root was <= 0, try the other root
613 code->appendf("\t\t} else {\n");
614 code->appendf("\t\t\t%s = min(%s, %s);\n", tName.c_str(),
615 r0Name.c_str(), r1Name.c_str());
rileya@google.comd7cc6512012-07-27 14:00:39 +0000616
bsalomon@google.comf78df332012-10-29 12:43:38 +0000617 // if r(t) > 0 for the smaller root, then t will be our x coordinate
618 code->appendf("\t\t\tif (%s * %s + %s > 0.0) {\n",
619 tName.c_str(), p5.c_str(), p3.c_str());
620
621 code->appendf("\t\t\t");
622 this->emitColorLookup(builder, tName.c_str(), outputColor, inputColor, samplers[0]);
623
624 // end if (r(t) > 0) for smaller root
625 code->appendf("\t\t\t}\n");
626 // end if (r(t) > 0), else, for larger root
627 code->appendf("\t\t}\n");
628 // end if (discriminant >= 0)
629 code->appendf("\t}\n");
630 } else {
631
632 // linear case: t = -c/b
633 code->appendf("\tfloat %s = -(%s / %s);\n", tName.c_str(),
634 cName.c_str(), bVar.c_str());
635
636 // if r(t) > 0, then t will be the x coordinate
637 code->appendf("\tif (%s * %s + %s > 0.0) {\n", tName.c_str(),
638 p5.c_str(), p3.c_str());
639 code->appendf("\t");
640 this->emitColorLookup(builder, tName.c_str(), outputColor, inputColor, samplers[0]);
641 code->appendf("\t}\n");
642 }
rileya@google.comd7cc6512012-07-27 14:00:39 +0000643 }
644}
645
bsalomon@google.com28a15fb2012-10-26 17:53:18 +0000646void GrGLConical2Gradient::setData(const GrGLUniformManager& uman, const GrEffectStage& stage) {
647 INHERITED::setData(uman, stage);
648 const GrConical2Gradient& data = static_cast<const GrConical2Gradient&>(*stage.getEffect());
rileya@google.comd7cc6512012-07-27 14:00:39 +0000649 GrAssert(data.isDegenerate() == fIsDegenerate);
bsalomon@google.com81712882012-11-01 17:12:34 +0000650 SkScalar centerX1 = data.center();
651 SkScalar radius0 = data.radius();
652 SkScalar diffRadius = data.diffRadius();
rileya@google.comd7cc6512012-07-27 14:00:39 +0000653
654 if (fCachedCenter != centerX1 ||
655 fCachedRadius != radius0 ||
656 fCachedDiffRadius != diffRadius) {
657
bsalomon@google.com81712882012-11-01 17:12:34 +0000658 SkScalar a = SkScalarMul(centerX1, centerX1) - diffRadius * diffRadius;
rileya@google.comd7cc6512012-07-27 14:00:39 +0000659
660 // When we're in the degenerate (linear) case, the second
661 // value will be INF but the program doesn't read it. (We
662 // use the same 6 uniforms even though we don't need them
663 // all in the linear case just to keep the code complexity
664 // down).
665 float values[6] = {
bsalomon@google.com81712882012-11-01 17:12:34 +0000666 SkScalarToFloat(a * 4),
667 1.f / (SkScalarToFloat(a)),
668 SkScalarToFloat(centerX1),
669 SkScalarToFloat(radius0),
670 SkScalarToFloat(SkScalarMul(radius0, radius0)),
671 SkScalarToFloat(diffRadius)
rileya@google.comd7cc6512012-07-27 14:00:39 +0000672 };
673
674 uman.set1fv(fVSParamUni, 0, 6, values);
675 uman.set1fv(fFSParamUni, 0, 6, values);
676 fCachedCenter = centerX1;
677 fCachedRadius = radius0;
678 fCachedDiffRadius = diffRadius;
679 }
680}
681
bsalomon@google.com2eaaefd2012-10-29 19:51:22 +0000682GrGLEffect::EffectKey GrGLConical2Gradient::GenKey(const GrEffectStage& s, const GrGLCaps&) {
bsalomon@google.comd8b5fac2012-11-01 17:02:46 +0000683 enum {
684 kIsDegenerate = 1 << kMatrixKeyBitCnt,
685 };
686
687 EffectKey key = GenMatrixKey(s);
688 if (static_cast<const GrConical2Gradient&>(*s.getEffect()).isDegenerate()) {
689 key |= kIsDegenerate;
690 }
691 return key;
rileya@google.com98e8b6d2012-07-31 20:38:06 +0000692}
rileya@google.comd7cc6512012-07-27 14:00:39 +0000693
694/////////////////////////////////////////////////////////////////////
695
bsalomon@google.com0ac6af42013-01-16 15:16:18 +0000696GrEffectRef* SkTwoPointConicalGradient::asNewEffect(GrContext* context, const SkPaint&) const {
bsalomon@google.com00835cc2013-01-14 17:07:22 +0000697 SkASSERT(NULL != context);
bsalomon@google.comf94b3a42012-10-31 18:09:01 +0000698 SkASSERT(fPtsToUnit.isIdentity());
699 // invert the localM, translate to center1, rotate so center2 is on x axis.
bsalomon@google.comdfdb7e52012-10-16 15:19:45 +0000700 SkMatrix matrix;
bsalomon@google.comf94b3a42012-10-31 18:09:01 +0000701 if (!this->getLocalMatrix().invert(&matrix)) {
humper@google.com84831ac2013-01-14 22:09:54 +0000702 return NULL;
bsalomon@google.comf94b3a42012-10-31 18:09:01 +0000703 }
704 matrix.postTranslate(-fCenter1.fX, -fCenter1.fY);
705
rileya@google.com98e8b6d2012-07-31 20:38:06 +0000706 SkPoint diff = fCenter2 - fCenter1;
707 SkScalar diffLen = diff.length();
708 if (0 != diffLen) {
709 SkScalar invDiffLen = SkScalarInvert(diffLen);
bsalomon@google.comf94b3a42012-10-31 18:09:01 +0000710 SkMatrix rot;
711 rot.setSinCos(-SkScalarMul(invDiffLen, diff.fY),
712 SkScalarMul(invDiffLen, diff.fX));
713 matrix.postConcat(rot);
bsalomon@google.comdfdb7e52012-10-16 15:19:45 +0000714 }
715
bsalomon@google.com0ac6af42013-01-16 15:16:18 +0000716 return GrConical2Gradient::Create(context, *this, matrix, fTileMode);
rileya@google.comd7cc6512012-07-27 14:00:39 +0000717}
718
bsalomon@google.comcf8fb1f2012-08-02 14:03:32 +0000719#else
720
bsalomon@google.com5d2cd202013-01-16 15:31:06 +0000721GrEffectRef* SkTwoPointConicalGradient::asNewEffect(GrContext*, const SkPaint&) const {
bsalomon@google.comcf8fb1f2012-08-02 14:03:32 +0000722 SkDEBUGFAIL("Should not call in GPU-less build");
bsalomon@google.come197cbf2013-01-14 16:46:26 +0000723 return NULL;
bsalomon@google.comcf8fb1f2012-08-02 14:03:32 +0000724}
725
twiz@google.coma5e65ec2012-08-02 15:15:16 +0000726#endif
robertphillips@google.com76f9e932013-01-15 20:17:47 +0000727
728#ifdef SK_DEVELOPER
729void SkTwoPointConicalGradient::toString(SkString* str) const {
730 str->append("SkTwoPointConicalGradient: (");
731
732 str->append("center1: (");
733 str->appendScalar(fCenter1.fX);
734 str->append(", ");
735 str->appendScalar(fCenter1.fY);
736 str->append(") radius1: ");
737 str->appendScalar(fRadius1);
738 str->append(" ");
739
740 str->append("center2: (");
741 str->appendScalar(fCenter2.fX);
742 str->append(", ");
743 str->appendScalar(fCenter2.fY);
744 str->append(") radius2: ");
745 str->appendScalar(fRadius2);
746 str->append(" ");
747
748 this->INHERITED::toString(str);
749
750 str->append(")");
751}
752#endif