blob: 4d3213b47bac9fa67895eadad6b3493a61387f67 [file] [log] [blame]
rileya@google.com589708b2012-07-26 20:04:23 +00001/*
2 * Copyright 2012 Google Inc.
3 *
4 * Use of this source code is governed by a BSD-style license that can be
5 * found in the LICENSE file.
6 */
7
fmalitabc590c02016-02-22 09:12:33 -08008#include "Sk4fLinearGradient.h"
Matt Sarett6cc6ae752017-04-18 18:29:12 -04009#include "SkColorSpaceXformer.h"
rileya@google.com589708b2012-07-26 20:04:23 +000010#include "SkLinearGradient.h"
bungeman06ca8ec2016-06-09 08:01:03 -070011#include "SkRefCnt.h"
rileya@google.com589708b2012-07-26 20:04:23 +000012
reedf3182eb2015-11-17 08:12:19 -080013static const float kInv255Float = 1.0f / 255;
14
rileya@google.com589708b2012-07-26 20:04:23 +000015static inline int repeat_8bits(int x) {
16 return x & 0xFF;
17}
18
rileya@google.com589708b2012-07-26 20:04:23 +000019static inline int mirror_8bits(int x) {
rileya@google.com589708b2012-07-26 20:04:23 +000020 if (x & 256) {
21 x = ~x;
22 }
23 return x & 255;
rileya@google.com589708b2012-07-26 20:04:23 +000024}
25
mtkleincc695fe2014-12-10 10:29:19 -080026static SkMatrix pts_to_unit_matrix(const SkPoint pts[2]) {
rileya@google.com589708b2012-07-26 20:04:23 +000027 SkVector vec = pts[1] - pts[0];
28 SkScalar mag = vec.length();
29 SkScalar inv = mag ? SkScalarInvert(mag) : 0;
30
31 vec.scale(inv);
mtkleincc695fe2014-12-10 10:29:19 -080032 SkMatrix matrix;
33 matrix.setSinCos(-vec.fY, vec.fX, pts[0].fX, pts[0].fY);
34 matrix.postTranslate(-pts[0].fX, -pts[0].fY);
35 matrix.postScale(inv, inv);
36 return matrix;
rileya@google.com589708b2012-07-26 20:04:23 +000037}
38
39///////////////////////////////////////////////////////////////////////////////
40
reedaddf2ed2014-08-11 08:28:24 -070041SkLinearGradient::SkLinearGradient(const SkPoint pts[2], const Descriptor& desc)
mtkleincc695fe2014-12-10 10:29:19 -080042 : SkGradientShaderBase(desc, pts_to_unit_matrix(pts))
rileya@google.com589708b2012-07-26 20:04:23 +000043 , fStart(pts[0])
mtkleincc695fe2014-12-10 10:29:19 -080044 , fEnd(pts[1]) {
rileya@google.com589708b2012-07-26 20:04:23 +000045}
46
reed60c9b582016-04-03 09:11:13 -070047sk_sp<SkFlattenable> SkLinearGradient::CreateProc(SkReadBuffer& buffer) {
reed9fa60da2014-08-21 07:59:51 -070048 DescriptorScope desc;
49 if (!desc.unflatten(buffer)) {
halcanary96fcdcc2015-08-27 07:41:13 -070050 return nullptr;
reed9fa60da2014-08-21 07:59:51 -070051 }
52 SkPoint pts[2];
53 pts[0] = buffer.readPoint();
54 pts[1] = buffer.readPoint();
brianosmane25d71c2016-09-28 11:27:28 -070055 return SkGradientShader::MakeLinear(pts, desc.fColors, std::move(desc.fColorSpace), desc.fPos,
56 desc.fCount, desc.fTileMode, desc.fGradFlags,
57 desc.fLocalMatrix);
reed9fa60da2014-08-21 07:59:51 -070058}
rileya@google.com589708b2012-07-26 20:04:23 +000059
commit-bot@chromium.org8b0e8ac2014-01-30 18:58:24 +000060void SkLinearGradient::flatten(SkWriteBuffer& buffer) const {
rileya@google.com589708b2012-07-26 20:04:23 +000061 this->INHERITED::flatten(buffer);
62 buffer.writePoint(fStart);
63 buffer.writePoint(fEnd);
64}
65
Florin Malita4aed1382017-05-25 10:38:07 -040066SkShaderBase::Context* SkLinearGradient::onMakeContext(
Herb Derby83e939b2017-02-07 14:25:11 -050067 const ContextRec& rec, SkArenaAlloc* alloc) const
68{
Florin Malitaaa0ce822017-08-28 12:50:26 -040069#ifndef SK_SUPPORT_LEGACY_LINEAR_GRADIENT
70 return CheckedMakeContext<LinearGradient4fContext>(alloc, *this, rec);
71#else
Florin Malitaae7bb042017-06-19 15:27:47 -040072 return rec.fPreferredDstType == ContextRec::kPM4f_DstType
Herb Derby83e939b2017-02-07 14:25:11 -050073 ? CheckedMakeContext<LinearGradient4fContext>(alloc, *this, rec)
74 : CheckedMakeContext< LinearGradientContext>(alloc, *this, rec);
Florin Malitaaa0ce822017-08-28 12:50:26 -040075#endif
commit-bot@chromium.org87fcd952014-04-23 19:10:51 +000076}
77
Florin Malita47e55a52017-06-06 12:26:54 -040078SkShaderBase::Context* SkLinearGradient::onMakeBurstPipelineContext(
79 const ContextRec& rec, SkArenaAlloc* alloc) const {
80
Florin Malitaa924dd32017-06-07 14:23:55 -040081 // Raster pipeline has a 2-stop specialization faster than our burst.
82 return fColorCount > 2 ? CheckedMakeContext<LinearGradient4fContext>(alloc, *this, rec)
83 : nullptr;
Florin Malita47e55a52017-06-06 12:26:54 -040084}
85
Florin Malita50b20842017-07-29 19:08:28 -040086void SkLinearGradient::appendGradientStages(SkArenaAlloc*, SkRasterPipeline*,
87 SkRasterPipeline*) const {
88 // No extra stage needed for linear gradients.
Florin Malitac86e4702017-01-20 08:41:34 -050089}
90
Matt Sarett6cc6ae752017-04-18 18:29:12 -040091sk_sp<SkShader> SkLinearGradient::onMakeColorSpace(SkColorSpaceXformer* xformer) const {
92 SkPoint pts[2] = { fStart, fEnd };
93 SkSTArray<8, SkColor> xformedColors(fColorCount);
94 xformer->apply(xformedColors.begin(), fOrigColors, fColorCount);
95 return SkGradientShader::MakeLinear(pts, xformedColors.begin(), fOrigPos, fColorCount,
96 fTileMode, fGradFlags, &this->getLocalMatrix());
97}
98
reedf3182eb2015-11-17 08:12:19 -080099// This swizzles SkColor into the same component order as SkPMColor, but does not actually
100// "pre" multiply the color components.
101//
102// This allows us to map directly to Sk4f, and eventually scale down to bytes to output a
103// SkPMColor from the floats, without having to swizzle each time.
104//
105static uint32_t SkSwizzle_Color_to_PMColor(SkColor c) {
106 return SkPackARGB32NoCheck(SkColorGetA(c), SkColorGetR(c), SkColorGetG(c), SkColorGetB(c));
107}
108
commit-bot@chromium.org87fcd952014-04-23 19:10:51 +0000109SkLinearGradient::LinearGradientContext::LinearGradientContext(
reedf3182eb2015-11-17 08:12:19 -0800110 const SkLinearGradient& shader, const ContextRec& ctx)
111 : INHERITED(shader, ctx)
commit-bot@chromium.org87fcd952014-04-23 19:10:51 +0000112{
reedf3182eb2015-11-17 08:12:19 -0800113 // setup for Sk4f
fmalita748d6202016-05-11 11:39:58 -0700114 const int count = shader.fColorCount;
115 SkASSERT(count > 1);
116
reedf3182eb2015-11-17 08:12:19 -0800117 fRecs.setCount(count);
118 Rec* rec = fRecs.begin();
119 if (shader.fOrigPos) {
120 rec[0].fPos = 0;
121 SkDEBUGCODE(rec[0].fPosScale = SK_FloatNaN;) // should never get used
122 for (int i = 1; i < count; ++i) {
123 rec[i].fPos = SkTPin(shader.fOrigPos[i], rec[i - 1].fPos, 1.0f);
lsalzmanf2b86622016-01-22 14:03:02 -0800124 float diff = rec[i].fPos - rec[i - 1].fPos;
125 if (diff > 0) {
126 rec[i].fPosScale = 1.0f / diff;
127 } else {
128 rec[i].fPosScale = 0;
129 }
reedf3182eb2015-11-17 08:12:19 -0800130 }
reedf3182eb2015-11-17 08:12:19 -0800131 } else {
132 // no pos specified, so we compute evenly spaced values
133 const float scale = float(count - 1);
fmalita748d6202016-05-11 11:39:58 -0700134 const float invScale = 1.0f / scale;
reedf3182eb2015-11-17 08:12:19 -0800135 for (int i = 0; i < count; ++i) {
136 rec[i].fPos = i * invScale;
137 rec[i].fPosScale = scale;
138 }
139 }
fmalita748d6202016-05-11 11:39:58 -0700140 rec[count - 1].fPos = 1; // overwrite the last value just to be sure we end at 1.0
reedf3182eb2015-11-17 08:12:19 -0800141
142 fApplyAlphaAfterInterp = true;
143 if ((shader.getGradFlags() & SkGradientShader::kInterpolateColorsInPremul_Flag) ||
144 shader.colorsAreOpaque())
145 {
146 fApplyAlphaAfterInterp = false;
147 }
148
149 if (fApplyAlphaAfterInterp) {
150 // Our fColor values are in PMColor order, but are still unpremultiplied, allowing us to
151 // interpolate in unpremultiplied space first, and then scale by alpha right before we
152 // convert to SkPMColor bytes.
153 const float paintAlpha = ctx.fPaint->getAlpha() * kInv255Float;
154 const Sk4f scale(1, 1, 1, paintAlpha);
155 for (int i = 0; i < count; ++i) {
156 uint32_t c = SkSwizzle_Color_to_PMColor(shader.fOrigColors[i]);
mtklein507ef6d2016-01-31 08:02:47 -0800157 rec[i].fColor = SkNx_cast<float>(Sk4b::Load(&c)) * scale;
reedf3182eb2015-11-17 08:12:19 -0800158 if (i > 0) {
159 SkASSERT(rec[i - 1].fPos <= rec[i].fPos);
160 }
161 }
162 } else {
163 // Our fColor values are premultiplied, so converting to SkPMColor is just a matter
164 // of converting the floats down to bytes.
165 unsigned alphaScale = ctx.fPaint->getAlpha() + (ctx.fPaint->getAlpha() >> 7);
166 for (int i = 0; i < count; ++i) {
167 SkPMColor pmc = SkPreMultiplyColor(shader.fOrigColors[i]);
168 pmc = SkAlphaMulQ(pmc, alphaScale);
mtklein507ef6d2016-01-31 08:02:47 -0800169 rec[i].fColor = SkNx_cast<float>(Sk4b::Load(&pmc));
reedf3182eb2015-11-17 08:12:19 -0800170 if (i > 0) {
171 SkASSERT(rec[i - 1].fPos <= rec[i].fPos);
172 }
173 }
174 }
rileya@google.com589708b2012-07-26 20:04:23 +0000175}
176
177#define NO_CHECK_ITER \
178 do { \
reedcaf7e932014-12-18 12:43:08 -0800179 unsigned fi = SkGradFixedToFixed(fx) >> SkGradientShaderBase::kCache32Shift; \
rileya@google.com589708b2012-07-26 20:04:23 +0000180 SkASSERT(fi <= 0xFF); \
181 fx += dx; \
182 *dstC++ = cache[toggle + fi]; \
reed@google.com55853db2013-02-01 19:34:59 +0000183 toggle = next_dither_toggle(toggle); \
rileya@google.com589708b2012-07-26 20:04:23 +0000184 } while (0)
185
186namespace {
187
reedcaf7e932014-12-18 12:43:08 -0800188typedef void (*LinearShadeProc)(TileProc proc, SkGradFixed dx, SkGradFixed fx,
rileya@google.com589708b2012-07-26 20:04:23 +0000189 SkPMColor* dstC, const SkPMColor* cache,
190 int toggle, int count);
191
rileya@google.com589708b2012-07-26 20:04:23 +0000192// Linear interpolation (lerp) is unnecessary if there are no sharp
193// discontinuities in the gradient - which must be true if there are
194// only 2 colors - but it's cheap.
reedcaf7e932014-12-18 12:43:08 -0800195void shadeSpan_linear_vertical_lerp(TileProc proc, SkGradFixed dx, SkGradFixed fx,
rileya@google.com589708b2012-07-26 20:04:23 +0000196 SkPMColor* SK_RESTRICT dstC,
197 const SkPMColor* SK_RESTRICT cache,
198 int toggle, int count) {
199 // We're a vertical gradient, so no change in a span.
200 // If colors change sharply across the gradient, dithering is
201 // insufficient (it subsamples the color space) and we need to lerp.
reedcaf7e932014-12-18 12:43:08 -0800202 unsigned fullIndex = proc(SkGradFixedToFixed(fx));
reed@google.com3c2102c2013-02-01 12:59:40 +0000203 unsigned fi = fullIndex >> SkGradientShaderBase::kCache32Shift;
204 unsigned remainder = fullIndex & ((1 << SkGradientShaderBase::kCache32Shift) - 1);
skia.committer@gmail.com9dde0182013-02-04 12:57:42 +0000205
reed@google.com3c2102c2013-02-01 12:59:40 +0000206 int index0 = fi + toggle;
207 int index1 = index0;
208 if (fi < SkGradientShaderBase::kCache32Count - 1) {
209 index1 += 1;
210 }
211 SkPMColor lerp = SkFastFourByteInterp(cache[index1], cache[index0], remainder);
212 index0 ^= SkGradientShaderBase::kDitherStride32;
213 index1 ^= SkGradientShaderBase::kDitherStride32;
214 SkPMColor dlerp = SkFastFourByteInterp(cache[index1], cache[index0], remainder);
rileya@google.com589708b2012-07-26 20:04:23 +0000215 sk_memset32_dither(dstC, lerp, dlerp, count);
216}
217
reedcaf7e932014-12-18 12:43:08 -0800218void shadeSpan_linear_clamp(TileProc proc, SkGradFixed dx, SkGradFixed fx,
rileya@google.com589708b2012-07-26 20:04:23 +0000219 SkPMColor* SK_RESTRICT dstC,
220 const SkPMColor* SK_RESTRICT cache,
221 int toggle, int count) {
222 SkClampRange range;
reed@google.com3c2102c2013-02-01 12:59:40 +0000223 range.init(fx, dx, count, 0, SkGradientShaderBase::kCache32Count - 1);
reed9d91eb32015-01-28 11:44:48 -0800224 range.validate(count);
rileya@google.com589708b2012-07-26 20:04:23 +0000225
226 if ((count = range.fCount0) > 0) {
227 sk_memset32_dither(dstC,
228 cache[toggle + range.fV0],
reed@google.com55853db2013-02-01 19:34:59 +0000229 cache[next_dither_toggle(toggle) + range.fV0],
rileya@google.com589708b2012-07-26 20:04:23 +0000230 count);
231 dstC += count;
232 }
233 if ((count = range.fCount1) > 0) {
234 int unroll = count >> 3;
235 fx = range.fFx1;
236 for (int i = 0; i < unroll; i++) {
237 NO_CHECK_ITER; NO_CHECK_ITER;
238 NO_CHECK_ITER; NO_CHECK_ITER;
239 NO_CHECK_ITER; NO_CHECK_ITER;
240 NO_CHECK_ITER; NO_CHECK_ITER;
241 }
242 if ((count &= 7) > 0) {
243 do {
244 NO_CHECK_ITER;
245 } while (--count != 0);
246 }
247 }
248 if ((count = range.fCount2) > 0) {
249 sk_memset32_dither(dstC,
250 cache[toggle + range.fV1],
reed@google.com55853db2013-02-01 19:34:59 +0000251 cache[next_dither_toggle(toggle) + range.fV1],
rileya@google.com589708b2012-07-26 20:04:23 +0000252 count);
253 }
254}
255
reedcaf7e932014-12-18 12:43:08 -0800256void shadeSpan_linear_mirror(TileProc proc, SkGradFixed dx, SkGradFixed fx,
rileya@google.com589708b2012-07-26 20:04:23 +0000257 SkPMColor* SK_RESTRICT dstC,
258 const SkPMColor* SK_RESTRICT cache,
259 int toggle, int count) {
260 do {
reedcaf7e932014-12-18 12:43:08 -0800261 unsigned fi = mirror_8bits(SkGradFixedToFixed(fx) >> 8);
rileya@google.com589708b2012-07-26 20:04:23 +0000262 SkASSERT(fi <= 0xFF);
263 fx += dx;
264 *dstC++ = cache[toggle + fi];
reed@google.com55853db2013-02-01 19:34:59 +0000265 toggle = next_dither_toggle(toggle);
rileya@google.com589708b2012-07-26 20:04:23 +0000266 } while (--count != 0);
267}
268
reedcaf7e932014-12-18 12:43:08 -0800269void shadeSpan_linear_repeat(TileProc proc, SkGradFixed dx, SkGradFixed fx,
rileya@google.com589708b2012-07-26 20:04:23 +0000270 SkPMColor* SK_RESTRICT dstC,
271 const SkPMColor* SK_RESTRICT cache,
272 int toggle, int count) {
273 do {
reedcaf7e932014-12-18 12:43:08 -0800274 unsigned fi = repeat_8bits(SkGradFixedToFixed(fx) >> 8);
rileya@google.com589708b2012-07-26 20:04:23 +0000275 SkASSERT(fi <= 0xFF);
276 fx += dx;
277 *dstC++ = cache[toggle + fi];
reed@google.com55853db2013-02-01 19:34:59 +0000278 toggle = next_dither_toggle(toggle);
rileya@google.com589708b2012-07-26 20:04:23 +0000279 } while (--count != 0);
280}
281
282}
283
commit-bot@chromium.org87fcd952014-04-23 19:10:51 +0000284void SkLinearGradient::LinearGradientContext::shadeSpan(int x, int y, SkPMColor* SK_RESTRICT dstC,
285 int count) {
rileya@google.com589708b2012-07-26 20:04:23 +0000286 SkASSERT(count > 0);
commit-bot@chromium.org87fcd952014-04-23 19:10:51 +0000287 const SkLinearGradient& linearGradient = static_cast<const SkLinearGradient&>(fShader);
288
Florin Malita4d41b8f2017-07-12 14:35:46 -0400289 if (SkShader::kClamp_TileMode == linearGradient.fTileMode) {
reedf3182eb2015-11-17 08:12:19 -0800290 this->shade4_clamp(x, y, dstC, count);
291 return;
292 }
reedf3182eb2015-11-17 08:12:19 -0800293
rileya@google.com589708b2012-07-26 20:04:23 +0000294 SkPoint srcPt;
295 SkMatrix::MapXYProc dstProc = fDstToIndexProc;
commit-bot@chromium.org87fcd952014-04-23 19:10:51 +0000296 TileProc proc = linearGradient.fTileProc;
297 const SkPMColor* SK_RESTRICT cache = fCache->getCache32();
reed@google.com55853db2013-02-01 19:34:59 +0000298 int toggle = init_dither_toggle(x, y);
rileya@google.com589708b2012-07-26 20:04:23 +0000299
Florin Malita4d41b8f2017-07-12 14:35:46 -0400300 dstProc(fDstToIndex, SkIntToScalar(x) + SK_ScalarHalf,
301 SkIntToScalar(y) + SK_ScalarHalf, &srcPt);
302 SkGradFixed fx = SkScalarPinToGradFixed(srcPt.fX),
303 dx = SkScalarPinToGradFixed(fDstToIndex.getScaleX());
rileya@google.com589708b2012-07-26 20:04:23 +0000304
Florin Malita4d41b8f2017-07-12 14:35:46 -0400305 LinearShadeProc shadeProc = shadeSpan_linear_repeat;
306 if (0 == dx) {
307 shadeProc = shadeSpan_linear_vertical_lerp;
308 } else if (SkShader::kClamp_TileMode == linearGradient.fTileMode) {
309 shadeProc = shadeSpan_linear_clamp;
310 } else if (SkShader::kMirror_TileMode == linearGradient.fTileMode) {
311 shadeProc = shadeSpan_linear_mirror;
rileya@google.com589708b2012-07-26 20:04:23 +0000312 } else {
Florin Malita4d41b8f2017-07-12 14:35:46 -0400313 SkASSERT(SkShader::kRepeat_TileMode == linearGradient.fTileMode);
rileya@google.com589708b2012-07-26 20:04:23 +0000314 }
Florin Malita4d41b8f2017-07-12 14:35:46 -0400315 (*shadeProc)(proc, dx, fx, dstC, cache, toggle, count);
rileya@google.com589708b2012-07-26 20:04:23 +0000316}
317
rileya@google.com589708b2012-07-26 20:04:23 +0000318SkShader::GradientType SkLinearGradient::asAGradient(GradientInfo* info) const {
319 if (info) {
320 commonAsAGradient(info);
321 info->fPoint[0] = fStart;
322 info->fPoint[1] = fEnd;
323 }
324 return kLinear_GradientType;
325}
326
bsalomon@google.comcf8fb1f2012-08-02 14:03:32 +0000327#if SK_SUPPORT_GPU
328
brianosmanb9c51372016-09-15 11:09:45 -0700329#include "GrColorSpaceXform.h"
Brian Salomon94efbf52016-11-29 13:43:05 -0500330#include "GrShaderCaps.h"
egdaniel7ea439b2015-12-03 09:20:44 -0800331#include "glsl/GrGLSLFragmentShaderBuilder.h"
dandov9de5b512014-06-10 14:38:28 -0700332#include "SkGr.h"
bsalomon@google.com2eaaefd2012-10-29 19:51:22 +0000333
rileya@google.comd7cc6512012-07-27 14:00:39 +0000334/////////////////////////////////////////////////////////////////////
335
rileya@google.com98e8b6d2012-07-31 20:38:06 +0000336class GrLinearGradient : public GrGradientEffect {
337public:
fmenozzi55d318d2016-08-09 08:05:57 -0700338 class GLSLLinearProcessor;
rileya@google.com98e8b6d2012-07-31 20:38:06 +0000339
Brian Salomonaff329b2017-08-11 09:40:37 -0400340 static std::unique_ptr<GrFragmentProcessor> Make(const CreateArgs& args) {
341 auto processor = std::unique_ptr<GrLinearGradient>(new GrLinearGradient(args));
Brian Salomon6af27012017-06-09 08:21:42 -0400342 return processor->isValid() ? std::move(processor) : nullptr;
bsalomon@google.com0ac6af42013-01-16 15:16:18 +0000343 }
344
mtklein36352bf2015-03-25 18:17:31 -0700345 const char* name() const override { return "Linear Gradient"; }
joshualitteb2a6762014-12-04 11:35:33 -0800346
Brian Salomonaff329b2017-08-11 09:40:37 -0400347 std::unique_ptr<GrFragmentProcessor> clone() const override {
348 return std::unique_ptr<GrFragmentProcessor>(new GrLinearGradient(*this));
Brian Salomonf8480b92017-07-27 15:45:59 -0400349 }
350
rileya@google.com98e8b6d2012-07-31 20:38:06 +0000351private:
Brian Salomonf8480b92017-07-27 15:45:59 -0400352 explicit GrLinearGradient(const CreateArgs& args)
353 : INHERITED(args, args.fShader->colorsAreOpaque()) {
354 this->initClassID<GrLinearGradient>();
355 }
356
357 explicit GrLinearGradient(const GrLinearGradient& that) : INHERITED(that) {
joshualitteb2a6762014-12-04 11:35:33 -0800358 this->initClassID<GrLinearGradient>();
359 }
wangyix4b3050b2015-08-04 07:59:37 -0700360
fmenozzi55d318d2016-08-09 08:05:57 -0700361 GrGLSLFragmentProcessor* onCreateGLSLInstance() const override;
wangyixb1daa862015-08-18 11:29:31 -0700362
Brian Salomon94efbf52016-11-29 13:43:05 -0500363 virtual void onGetGLSLProcessorKey(const GrShaderCaps& caps,
fmenozzi55d318d2016-08-09 08:05:57 -0700364 GrProcessorKeyBuilder* b) const override;
wangyix4b3050b2015-08-04 07:59:37 -0700365
Brian Salomon0c26a9d2017-07-06 10:09:38 -0400366 GR_DECLARE_FRAGMENT_PROCESSOR_TEST
rileya@google.com98e8b6d2012-07-31 20:38:06 +0000367
368 typedef GrGradientEffect INHERITED;
369};
370
371/////////////////////////////////////////////////////////////////////
372
fmenozzi55d318d2016-08-09 08:05:57 -0700373class GrLinearGradient::GLSLLinearProcessor : public GrGradientEffect::GLSLProcessor {
374public:
375 GLSLLinearProcessor(const GrProcessor&) {}
376
fmenozzi55d318d2016-08-09 08:05:57 -0700377 virtual void emitCode(EmitArgs&) override;
378
Brian Salomon94efbf52016-11-29 13:43:05 -0500379 static void GenKey(const GrProcessor& processor, const GrShaderCaps&, GrProcessorKeyBuilder* b) {
fmenozzi55d318d2016-08-09 08:05:57 -0700380 b->add32(GenBaseGradientKey(processor));
381 }
382
383private:
384 typedef GrGradientEffect::GLSLProcessor INHERITED;
385};
386
387/////////////////////////////////////////////////////////////////////
388
389GrGLSLFragmentProcessor* GrLinearGradient::onCreateGLSLInstance() const {
390 return new GrLinearGradient::GLSLLinearProcessor(*this);
391}
392
Brian Salomon94efbf52016-11-29 13:43:05 -0500393void GrLinearGradient::onGetGLSLProcessorKey(const GrShaderCaps& caps,
fmenozzi55d318d2016-08-09 08:05:57 -0700394 GrProcessorKeyBuilder* b) const {
395 GrLinearGradient::GLSLLinearProcessor::GenKey(*this, caps, b);
396}
397
398/////////////////////////////////////////////////////////////////////
399
joshualittb0a8a372014-09-23 09:50:21 -0700400GR_DEFINE_FRAGMENT_PROCESSOR_TEST(GrLinearGradient);
bsalomon@google.comd4726202012-08-03 14:34:46 +0000401
Hal Canary6f6961e2017-01-31 13:50:44 -0500402#if GR_TEST_UTILS
Brian Salomonaff329b2017-08-11 09:40:37 -0400403std::unique_ptr<GrFragmentProcessor> GrLinearGradient::TestCreate(GrProcessorTestData* d) {
joshualitt0067ff52015-07-08 14:26:19 -0700404 SkPoint points[] = {{d->fRandom->nextUScalar1(), d->fRandom->nextUScalar1()},
405 {d->fRandom->nextUScalar1(), d->fRandom->nextUScalar1()}};
bsalomon@google.comd4726202012-08-03 14:34:46 +0000406
Brian Osman3f748602016-10-03 18:29:03 -0400407 RandomGradientParams params(d->fRandom);
Brian Osmana2196532016-10-17 12:48:13 -0400408 auto shader = params.fUseColors4f ?
409 SkGradientShader::MakeLinear(points, params.fColors4f, params.fColorSpace, params.fStops,
410 params.fColorCount, params.fTileMode) :
411 SkGradientShader::MakeLinear(points, params.fColors, params.fStops,
412 params.fColorCount, params.fTileMode);
Brian Osman9f532a32016-10-19 11:12:09 -0400413 GrTest::TestAsFPArgs asFPArgs(d);
Brian Salomonaff329b2017-08-11 09:40:37 -0400414 std::unique_ptr<GrFragmentProcessor> fp = as_SB(shader)->asFragmentProcessor(asFPArgs.args());
bsalomonc21b09e2015-08-28 18:46:56 -0700415 GrAlwaysAssert(fp);
joshualittb0a8a372014-09-23 09:50:21 -0700416 return fp;
bsalomon@google.comd4726202012-08-03 14:34:46 +0000417}
Hal Canary6f6961e2017-01-31 13:50:44 -0500418#endif
bsalomon@google.comd4726202012-08-03 14:34:46 +0000419
420/////////////////////////////////////////////////////////////////////
421
fmenozzi55d318d2016-08-09 08:05:57 -0700422void GrLinearGradient::GLSLLinearProcessor::emitCode(EmitArgs& args) {
wangyix7c157a92015-07-22 15:08:53 -0700423 const GrLinearGradient& ge = args.fFp.cast<GrLinearGradient>();
egdaniel7ea439b2015-12-03 09:20:44 -0800424 this->emitUniforms(args.fUniformHandler, ge);
bsalomon1a1aa932016-09-12 09:30:36 -0700425 SkString t = args.fFragBuilder->ensureCoords2D(args.fTransformedCoords[0]);
bsalomon@google.comd8b5fac2012-11-01 17:02:46 +0000426 t.append(".x");
egdaniel7ea439b2015-12-03 09:20:44 -0800427 this->emitColor(args.fFragBuilder,
428 args.fUniformHandler,
Brian Salomon1edc5b92016-11-29 13:43:46 -0500429 args.fShaderCaps,
fmenozzi55d318d2016-08-09 08:05:57 -0700430 ge,
431 t.c_str(),
egdaniel4ca2e602015-11-18 08:01:26 -0800432 args.fOutputColor,
433 args.fInputColor,
cdalton3f6f76f2016-04-11 12:18:09 -0700434 args.fTexSamplers);
rileya@google.comd7cc6512012-07-27 14:00:39 +0000435}
436
437/////////////////////////////////////////////////////////////////////
438
Brian Salomonaff329b2017-08-11 09:40:37 -0400439std::unique_ptr<GrFragmentProcessor> SkLinearGradient::asFragmentProcessor(
440 const AsFPArgs& args) const {
brianosman839345d2016-07-22 11:04:53 -0700441 SkASSERT(args.fContext);
mtklein3f3b3d02014-12-01 11:47:08 -0800442
bsalomon@google.comdfdb7e52012-10-16 15:19:45 +0000443 SkMatrix matrix;
bsalomon@google.comf94b3a42012-10-31 18:09:01 +0000444 if (!this->getLocalMatrix().invert(&matrix)) {
bsalomonc21b09e2015-08-28 18:46:56 -0700445 return nullptr;
bsalomon@google.comdfdb7e52012-10-16 15:19:45 +0000446 }
brianosman839345d2016-07-22 11:04:53 -0700447 if (args.fLocalMatrix) {
commit-bot@chromium.org96fb7482014-05-09 20:28:11 +0000448 SkMatrix inv;
brianosman839345d2016-07-22 11:04:53 -0700449 if (!args.fLocalMatrix->invert(&inv)) {
bsalomonc21b09e2015-08-28 18:46:56 -0700450 return nullptr;
commit-bot@chromium.org96fb7482014-05-09 20:28:11 +0000451 }
452 matrix.postConcat(inv);
453 }
bsalomon@google.comf94b3a42012-10-31 18:09:01 +0000454 matrix.postConcat(fPtsToUnit);
mtklein3f3b3d02014-12-01 11:47:08 -0800455
brianosmanb9c51372016-09-15 11:09:45 -0700456 sk_sp<GrColorSpaceXform> colorSpaceXform = GrColorSpaceXform::Make(fColorSpace.get(),
457 args.fDstColorSpace);
Brian Salomonaff329b2017-08-11 09:40:37 -0400458 auto inner = GrLinearGradient::Make(GrGradientEffect::CreateArgs(
459 args.fContext, this, &matrix, fTileMode, std::move(colorSpaceXform),
460 SkToBool(args.fDstColorSpace)));
Brian Salomon6af27012017-06-09 08:21:42 -0400461 if (!inner) {
462 return nullptr;
463 }
bungeman06ca8ec2016-06-09 08:01:03 -0700464 return GrFragmentProcessor::MulOutputByInputAlpha(std::move(inner));
rileya@google.comd7cc6512012-07-27 14:00:39 +0000465}
466
bsalomon@google.comcf8fb1f2012-08-02 14:03:32 +0000467
468#endif
robertphillips@google.com76f9e932013-01-15 20:17:47 +0000469
commit-bot@chromium.org0f10f7b2014-03-13 18:02:17 +0000470#ifndef SK_IGNORE_TO_STRING
robertphillips@google.com76f9e932013-01-15 20:17:47 +0000471void SkLinearGradient::toString(SkString* str) const {
472 str->append("SkLinearGradient (");
473
474 str->appendf("start: (%f, %f)", fStart.fX, fStart.fY);
475 str->appendf(" end: (%f, %f) ", fEnd.fX, fEnd.fY);
476
477 this->INHERITED::toString(str);
478
479 str->append(")");
480}
481#endif
reedf3182eb2015-11-17 08:12:19 -0800482
483///////////////////////////////////////////////////////////////////////////////////////////////////
484
485#include "SkNx.h"
486
487static const SkLinearGradient::LinearGradientContext::Rec*
488find_forward(const SkLinearGradient::LinearGradientContext::Rec rec[], float tiledX) {
489 SkASSERT(tiledX >= 0 && tiledX <= 1);
490
491 SkASSERT(rec[0].fPos >= 0 && rec[0].fPos <= 1);
492 SkASSERT(rec[1].fPos >= 0 && rec[1].fPos <= 1);
493 SkASSERT(rec[0].fPos <= rec[1].fPos);
494 rec += 1;
lsalzmanf2b86622016-01-22 14:03:02 -0800495 while (rec->fPos < tiledX || rec->fPosScale == 0) {
reedf3182eb2015-11-17 08:12:19 -0800496 SkASSERT(rec[0].fPos >= 0 && rec[0].fPos <= 1);
497 SkASSERT(rec[1].fPos >= 0 && rec[1].fPos <= 1);
498 SkASSERT(rec[0].fPos <= rec[1].fPos);
499 rec += 1;
500 }
501 return rec - 1;
502}
503
504static const SkLinearGradient::LinearGradientContext::Rec*
505find_backward(const SkLinearGradient::LinearGradientContext::Rec rec[], float tiledX) {
506 SkASSERT(tiledX >= 0 && tiledX <= 1);
507
508 SkASSERT(rec[0].fPos >= 0 && rec[0].fPos <= 1);
509 SkASSERT(rec[1].fPos >= 0 && rec[1].fPos <= 1);
510 SkASSERT(rec[0].fPos <= rec[1].fPos);
lsalzmanf2b86622016-01-22 14:03:02 -0800511 while (tiledX < rec->fPos || rec[1].fPosScale == 0) {
reedf3182eb2015-11-17 08:12:19 -0800512 rec -= 1;
513 SkASSERT(rec[0].fPos >= 0 && rec[0].fPos <= 1);
514 SkASSERT(rec[1].fPos >= 0 && rec[1].fPos <= 1);
515 SkASSERT(rec[0].fPos <= rec[1].fPos);
516 }
517 return rec;
518}
519
fmalita0ce4f232016-12-06 08:57:47 -0800520// As an optimization, we can apply the dither bias before interpolation -- but only when
521// operating in premul space (apply_alpha == false). When apply_alpha == true, we must
522// defer the bias application until after premul.
523//
524// The following two helpers encapsulate this logic: pre_bias is called before interpolation,
525// and effects the bias when apply_alpha == false, while post_bias is called after premul and
526// effects the bias for the apply_alpha == true case.
527
528template <bool apply_alpha>
529Sk4f pre_bias(const Sk4f& x, const Sk4f& bias) {
fmalita0ce4f232016-12-06 08:57:47 -0800530 return apply_alpha ? x : x + bias;
fmalita0ce4f232016-12-06 08:57:47 -0800531}
532
533template <bool apply_alpha>
534Sk4f post_bias(const Sk4f& x, const Sk4f& bias) {
fmalita0ce4f232016-12-06 08:57:47 -0800535 return apply_alpha ? x + bias : x;
fmalita0ce4f232016-12-06 08:57:47 -0800536}
537
538template <bool apply_alpha> SkPMColor trunc_from_255(const Sk4f& x, const Sk4f& bias) {
reedf3182eb2015-11-17 08:12:19 -0800539 SkPMColor c;
fmalita0ce4f232016-12-06 08:57:47 -0800540 Sk4f c4f255 = x;
541 if (apply_alpha) {
Lee Salzmana8362672017-06-01 14:45:29 -0400542 // Due to use of multiplication by the 1/255 reciprocal instead of division by 255,
543 // non-integer alpha values very close to their ceiling can push the color values
544 // above the alpha value, which will become an invalid premultiplied color. So nudge
545 // alpha up slightly by a compensating scale to keep it above the color values.
546 // To do this, multiply alpha by a number slightly greater than 1 to compensate
547 // for error in scaling from the 1/255 approximation. Since this error is then
548 // scaled by the alpha value, we need to scale the epsilon by 255 to get a safe
549 // upper bound on the error.
550 static constexpr float alphaScale = 1 + 255*std::numeric_limits<float>::epsilon();
Florin Malita15200bd2017-06-19 15:40:45 -0400551
fmalita0ce4f232016-12-06 08:57:47 -0800552 const float scale = x[SkPM4f::A] * (1 / 255.f);
Lee Salzmana8362672017-06-01 14:45:29 -0400553 c4f255 *= Sk4f(scale, scale, scale, alphaScale);
fmalita0ce4f232016-12-06 08:57:47 -0800554 }
555 SkNx_cast<uint8_t>(post_bias<apply_alpha>(c4f255, bias)).store(&c);
Florin Malitaaaa6d772016-12-07 14:57:04 -0500556
reedf3182eb2015-11-17 08:12:19 -0800557 return c;
558}
559
560template <bool apply_alpha> void fill(SkPMColor dst[], int count,
fmalita0ce4f232016-12-06 08:57:47 -0800561 const Sk4f& c4, const Sk4f& bias0, const Sk4f& bias1) {
562 const SkPMColor c0 = trunc_from_255<apply_alpha>(pre_bias<apply_alpha>(c4, bias0), bias0);
563 const SkPMColor c1 = trunc_from_255<apply_alpha>(pre_bias<apply_alpha>(c4, bias1), bias1);
564 sk_memset32_dither(dst, c0, c1, count);
reedf3182eb2015-11-17 08:12:19 -0800565}
566
567template <bool apply_alpha> void fill(SkPMColor dst[], int count, const Sk4f& c4) {
568 // Assumes that c4 does not need to be dithered.
fmalita0ce4f232016-12-06 08:57:47 -0800569 sk_memset32(dst, trunc_from_255<apply_alpha>(c4, 0), count);
reedf3182eb2015-11-17 08:12:19 -0800570}
571
572/*
573 * TODOs
574 *
575 * - tilemodes
576 * - interp before or after premul
577 * - perspective
578 * - optimizations
579 * - use fixed (32bit or 16bit) instead of floats?
580 */
581
582static Sk4f lerp_color(float fx, const SkLinearGradient::LinearGradientContext::Rec* rec) {
reedde3aac82015-11-22 13:00:04 -0800583 SkASSERT(fx >= rec[0].fPos);
584 SkASSERT(fx <= rec[1].fPos);
585
reedf3182eb2015-11-17 08:12:19 -0800586 const float p0 = rec[0].fPos;
587 const Sk4f c0 = rec[0].fColor;
588 const Sk4f c1 = rec[1].fColor;
589 const Sk4f diffc = c1 - c0;
590 const float scale = rec[1].fPosScale;
591 const float t = (fx - p0) * scale;
592 return c0 + Sk4f(t) * diffc;
593}
594
595template <bool apply_alpha> void ramp(SkPMColor dstC[], int n, const Sk4f& c, const Sk4f& dc,
596 const Sk4f& dither0, const Sk4f& dither1) {
597 Sk4f dc2 = dc + dc;
598 Sk4f dc4 = dc2 + dc2;
fmalita0ce4f232016-12-06 08:57:47 -0800599 Sk4f cd0 = pre_bias<apply_alpha>(c , dither0);
600 Sk4f cd1 = pre_bias<apply_alpha>(c + dc, dither1);
reedf3182eb2015-11-17 08:12:19 -0800601 Sk4f cd2 = cd0 + dc2;
602 Sk4f cd3 = cd1 + dc2;
603 while (n >= 4) {
mtklein9db43ac2015-12-01 07:10:21 -0800604 if (!apply_alpha) {
mtklein6f37b4a2015-12-14 11:25:18 -0800605 Sk4f_ToBytes((uint8_t*)dstC, cd0, cd1, cd2, cd3);
mtklein9db43ac2015-12-01 07:10:21 -0800606 dstC += 4;
607 } else {
fmalita0ce4f232016-12-06 08:57:47 -0800608 *dstC++ = trunc_from_255<apply_alpha>(cd0, dither0);
609 *dstC++ = trunc_from_255<apply_alpha>(cd1, dither1);
610 *dstC++ = trunc_from_255<apply_alpha>(cd2, dither0);
611 *dstC++ = trunc_from_255<apply_alpha>(cd3, dither1);
mtklein9db43ac2015-12-01 07:10:21 -0800612 }
reedf3182eb2015-11-17 08:12:19 -0800613 cd0 = cd0 + dc4;
614 cd1 = cd1 + dc4;
615 cd2 = cd2 + dc4;
616 cd3 = cd3 + dc4;
617 n -= 4;
618 }
619 if (n & 2) {
fmalita0ce4f232016-12-06 08:57:47 -0800620 *dstC++ = trunc_from_255<apply_alpha>(cd0, dither0);
621 *dstC++ = trunc_from_255<apply_alpha>(cd1, dither1);
reedf3182eb2015-11-17 08:12:19 -0800622 cd0 = cd0 + dc2;
623 }
624 if (n & 1) {
fmalita0ce4f232016-12-06 08:57:47 -0800625 *dstC++ = trunc_from_255<apply_alpha>(cd0, dither0);
reedf3182eb2015-11-17 08:12:19 -0800626 }
627}
628
Florin Malita2045e3b2017-08-07 11:45:00 -0400629static inline uint32_t clamped_advance(float advance) {
630 SkASSERT(advance >= 0);
631 return sk_float_floor2int(SkTMin<float>(advance, std::numeric_limits<int>::max() - 1)) + 1;
632}
633
reedf3182eb2015-11-17 08:12:19 -0800634template <bool apply_alpha, bool dx_is_pos>
635void SkLinearGradient::LinearGradientContext::shade4_dx_clamp(SkPMColor dstC[], int count,
636 float fx, float dx, float invDx,
637 const float dither[2]) {
638 Sk4f dither0(dither[0]);
639 Sk4f dither1(dither[1]);
640 const Rec* rec = fRecs.begin();
641
642 const Sk4f dx4 = Sk4f(dx);
643 SkDEBUGCODE(SkPMColor* endDstC = dstC + count;)
644
645 if (dx_is_pos) {
646 if (fx < 0) {
fmalita7b38e3c2016-05-26 11:13:52 -0700647 // count is guaranteed to be positive, but the first arg may overflow int32 after
648 // increment => casting to uint32 ensures correct clamping.
Florin Malita2045e3b2017-08-07 11:45:00 -0400649 int n = SkTMin<uint32_t>(clamped_advance(-fx * invDx), count);
fmalita7b38e3c2016-05-26 11:13:52 -0700650 SkASSERT(n > 0);
reedf3182eb2015-11-17 08:12:19 -0800651 fill<apply_alpha>(dstC, n, rec[0].fColor);
652 count -= n;
653 dstC += n;
654 fx += n * dx;
655 SkASSERT(0 == count || fx >= 0);
656 if (n & 1) {
657 SkTSwap(dither0, dither1);
658 }
659 }
660 } else { // dx < 0
661 if (fx > 1) {
fmalita7b38e3c2016-05-26 11:13:52 -0700662 // count is guaranteed to be positive, but the first arg may overflow int32 after
663 // increment => casting to uint32 ensures correct clamping.
Florin Malita2045e3b2017-08-07 11:45:00 -0400664 int n = SkTMin<uint32_t>(clamped_advance((1 - fx) * invDx), count);
fmalita7b38e3c2016-05-26 11:13:52 -0700665 SkASSERT(n > 0);
reedf3182eb2015-11-17 08:12:19 -0800666 fill<apply_alpha>(dstC, n, rec[fRecs.count() - 1].fColor);
667 count -= n;
668 dstC += n;
669 fx += n * dx;
670 SkASSERT(0 == count || fx <= 1);
671 if (n & 1) {
672 SkTSwap(dither0, dither1);
673 }
674 }
675 }
676 SkASSERT(count >= 0);
677
678 const Rec* r;
679 if (dx_is_pos) {
680 r = fRecs.begin(); // start at the beginning
681 } else {
682 r = fRecs.begin() + fRecs.count() - 2; // start at the end
683 }
684
685 while (count > 0) {
686 if (dx_is_pos) {
687 if (fx >= 1) {
688 fill<apply_alpha>(dstC, count, rec[fRecs.count() - 1].fColor);
689 return;
690 }
691 } else { // dx < 0
692 if (fx <= 0) {
693 fill<apply_alpha>(dstC, count, rec[0].fColor);
694 return;
695 }
696 }
697
698 if (dx_is_pos) {
699 r = find_forward(r, fx);
700 } else {
701 r = find_backward(r, fx);
702 }
703 SkASSERT(r >= fRecs.begin() && r < fRecs.begin() + fRecs.count() - 1);
704
705 const float p0 = r[0].fPos;
706 const Sk4f c0 = r[0].fColor;
707 const float p1 = r[1].fPos;
708 const Sk4f diffc = Sk4f(r[1].fColor) - c0;
709 const float scale = r[1].fPosScale;
710 const float t = (fx - p0) * scale;
711 const Sk4f c = c0 + Sk4f(t) * diffc;
712 const Sk4f dc = diffc * dx4 * Sk4f(scale);
713
714 int n;
715 if (dx_is_pos) {
716 n = SkTMin((int)((p1 - fx) * invDx) + 1, count);
717 } else {
718 n = SkTMin((int)((p0 - fx) * invDx) + 1, count);
719 }
720
721 fx += n * dx;
reedaeab8ea2016-01-05 10:01:38 -0800722 // fx should now outside of the p0..p1 interval. However, due to float precision loss,
723 // its possible that fx is slightly too small/large, so we clamp it.
reedf3182eb2015-11-17 08:12:19 -0800724 if (dx_is_pos) {
reedaeab8ea2016-01-05 10:01:38 -0800725 fx = SkTMax(fx, p1);
reedf3182eb2015-11-17 08:12:19 -0800726 } else {
reedaeab8ea2016-01-05 10:01:38 -0800727 fx = SkTMin(fx, p0);
reedf3182eb2015-11-17 08:12:19 -0800728 }
729
730 ramp<apply_alpha>(dstC, n, c, dc, dither0, dither1);
731 dstC += n;
732 SkASSERT(dstC <= endDstC);
mtklein9db43ac2015-12-01 07:10:21 -0800733
reedf3182eb2015-11-17 08:12:19 -0800734 if (n & 1) {
735 SkTSwap(dither0, dither1);
736 }
reedaeab8ea2016-01-05 10:01:38 -0800737
738 count -= n;
739 SkASSERT(count >= 0);
reedf3182eb2015-11-17 08:12:19 -0800740 }
741}
742
743void SkLinearGradient::LinearGradientContext::shade4_clamp(int x, int y, SkPMColor dstC[],
744 int count) {
745 SkASSERT(count > 0);
reedf3182eb2015-11-17 08:12:19 -0800746
747 SkPoint srcPt;
748 fDstToIndexProc(fDstToIndex, x + SK_ScalarHalf, y + SK_ScalarHalf, &srcPt);
749 float fx = srcPt.x();
750 const float dx = fDstToIndex.getScaleX();
751
752 // Default our dither bias values to 1/2, (rounding), which is no dithering
753 float dither0 = 0.5f;
754 float dither1 = 0.5f;
755 if (fDither) {
756 const float ditherCell[] = {
757 1/8.0f, 5/8.0f,
758 7/8.0f, 3/8.0f,
759 };
760 const int rowIndex = (y & 1) << 1;
761 dither0 = ditherCell[rowIndex];
762 dither1 = ditherCell[rowIndex + 1];
763 if (x & 1) {
764 SkTSwap(dither0, dither1);
765 }
766 }
767 const float dither[2] = { dither0, dither1 };
reedf3182eb2015-11-17 08:12:19 -0800768
fmalita2b469132015-11-23 08:30:23 -0800769 if (SkScalarNearlyZero(dx * count)) { // gradient is vertical
reedde3aac82015-11-22 13:00:04 -0800770 const float pinFx = SkTPin(fx, 0.0f, 1.0f);
771 Sk4f c = lerp_color(pinFx, find_forward(fRecs.begin(), pinFx));
reedf3182eb2015-11-17 08:12:19 -0800772 if (fApplyAlphaAfterInterp) {
fmalita0ce4f232016-12-06 08:57:47 -0800773 fill<true>(dstC, count, c, dither0, dither1);
reedf3182eb2015-11-17 08:12:19 -0800774 } else {
fmalita0ce4f232016-12-06 08:57:47 -0800775 fill<false>(dstC, count, c, dither0, dither1);
reedf3182eb2015-11-17 08:12:19 -0800776 }
777 return;
778 }
779
James Zern44e91c92016-11-09 19:22:46 -0800780 SkASSERT(0.f != dx);
781 const float invDx = 1 / dx;
reedf3182eb2015-11-17 08:12:19 -0800782 if (dx > 0) {
783 if (fApplyAlphaAfterInterp) {
784 this->shade4_dx_clamp<true, true>(dstC, count, fx, dx, invDx, dither);
785 } else {
786 this->shade4_dx_clamp<false, true>(dstC, count, fx, dx, invDx, dither);
787 }
788 } else {
789 if (fApplyAlphaAfterInterp) {
790 this->shade4_dx_clamp<true, false>(dstC, count, fx, dx, invDx, dither);
791 } else {
792 this->shade4_dx_clamp<false, false>(dstC, count, fx, dx, invDx, dither);
793 }
794 }
795}