blob: 00b6ac718b8a31d93fd7940fc006e3e9973e4294 [file] [log] [blame]
Mike Kleinbaaf8ad2016-09-29 09:04:15 -04001/*
2 * Copyright 2016 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
8#ifndef SkRasterPipeline_opts_DEFINED
9#define SkRasterPipeline_opts_DEFINED
10
Mike Klein1f49f262016-10-31 19:49:27 -040011#include "SkColorPriv.h"
raftias25636012016-11-11 15:27:39 -080012#include "SkColorLookUpTable.h"
Matt Sarettdb4d4062016-11-16 16:07:15 -050013#include "SkColorSpaceXform_A2B.h"
14#include "SkColorSpaceXformPriv.h"
Mike Kleinbaaf8ad2016-09-29 09:04:15 -040015#include "SkHalf.h"
Mike Klein46e66a22016-11-21 16:19:34 -050016#include "SkImageShaderContext.h"
Mike Kleina0c4c342016-11-29 13:58:49 -050017#include "SkMSAN.h"
Mike Kleinbaaf8ad2016-09-29 09:04:15 -040018#include "SkPM4f.h"
mtklein125b2aa2016-11-04 13:41:34 -070019#include "SkPM4fPriv.h"
Mike Kleinbaaf8ad2016-09-29 09:04:15 -040020#include "SkRasterPipeline.h"
21#include "SkSRGB.h"
22
Mike Kleinaebfb452016-10-25 10:27:33 -040023namespace {
24
Mike Klein2878e762016-10-19 21:05:17 -040025#if SK_CPU_SSE_LEVEL >= SK_CPU_SSE_LEVEL_AVX2
26 static constexpr int N = 8;
27#else
28 static constexpr int N = 4;
29#endif
30
mtkleina4a44882016-11-04 13:20:07 -070031 using SkNf = SkNx<N, float>;
Mike Kleind5de0132016-11-28 09:33:02 -050032 using SkNi = SkNx<N, int32_t>;
33 using SkNu = SkNx<N, uint32_t>;
mtkleina4a44882016-11-04 13:20:07 -070034 using SkNh = SkNx<N, uint16_t>;
Mike Klein06a65e22016-11-17 12:39:09 -050035 using SkNb = SkNx<N, uint8_t>;
Mike Kleinbaaf8ad2016-09-29 09:04:15 -040036
Mike Klein464e6a12017-01-04 11:04:01 -050037 using Fn = void(SK_VECTORCALL *)(size_t x_tail, void** p, SkNf,SkNf,SkNf,SkNf,
38 SkNf,SkNf,SkNf,SkNf);
Mike Kleinbddd2342016-11-29 12:46:58 -050039 // x_tail encodes two values x and tail as x*N+tail, where 0 <= tail < N.
40 // x is the induction variable we're walking along, incrementing by N each step.
41 // tail == 0 means work with a full N pixels; otherwise use only the low tail pixels.
Mike Klein464e6a12017-01-04 11:04:01 -050042 //
43 // p is our program, a sequence of Fn to call interlaced with any void* context pointers. E.g.
44 // &load_8888
45 // (src ptr)
46 // &from_srgb
Mike Klein8c8cb5b2017-01-06 10:21:56 -050047 // &move_src_dst
48 // &load_f16
Mike Klein464e6a12017-01-04 11:04:01 -050049 // (dst ptr)
Mike Klein8c8cb5b2017-01-06 10:21:56 -050050 // &swap
Mike Klein464e6a12017-01-04 11:04:01 -050051 // &srcover
52 // &store_f16
53 // (dst ptr)
54 // &just_return
Mike Kleinbddd2342016-11-29 12:46:58 -050055
Mike Kleinaebfb452016-10-25 10:27:33 -040056} // namespace
Mike Klein2878e762016-10-19 21:05:17 -040057
Mike Klein04adfda2016-10-12 09:52:55 -040058#define SI static inline
Mike Kleinbaaf8ad2016-09-29 09:04:15 -040059
Mike Klein464e6a12017-01-04 11:04:01 -050060// Basically, return *(*ptr)++, maybe faster than the compiler can do it.
61SI void* load_and_increment(void*** ptr) {
62 // We do this often enough that it's worth hyper-optimizing.
63 // x86 can do this in one instruction if ptr is in rsi.
64 // (This is why p is the second argument to Fn: it's passed in rsi.)
65#if defined(__GNUC__) && defined(__x86_64__)
66 void* rax;
67 __asm__("lodsq" : "=a"(rax), "+S"(*ptr));
68 return rax;
69#else
70 return *(*ptr)++;
71#endif
72}
73
Mike Klein49372e62016-10-20 18:05:23 -040074// Stages are logically a pipeline, and physically are contiguous in an array.
75// To get to the next stage, we just increment our pointer to the next array element.
Mike Klein464e6a12017-01-04 11:04:01 -050076SI void SK_VECTORCALL next(size_t x_tail, void** p, SkNf r, SkNf g, SkNf b, SkNf a,
77 SkNf dr, SkNf dg, SkNf db, SkNf da) {
78 auto next = (Fn)load_and_increment(&p);
79 next(x_tail,p, r,g,b,a, dr,dg,db,da);
Mike Klein49372e62016-10-20 18:05:23 -040080}
81
Mike Klein729b5822016-11-28 18:23:23 -050082// Stages defined below always call next.
83// This is always the last stage, a backstop that actually returns to the caller when done.
Mike Klein464e6a12017-01-04 11:04:01 -050084SI void SK_VECTORCALL just_return(size_t, void**, SkNf, SkNf, SkNf, SkNf,
Mike Klein729b5822016-11-28 18:23:23 -050085 SkNf, SkNf, SkNf, SkNf) {}
86
Mike Klein2cbc33d2016-11-28 16:30:30 -050087#define STAGE(name) \
Mike Klein464e6a12017-01-04 11:04:01 -050088 static SK_ALWAYS_INLINE void name##_kernel(size_t x, size_t tail, \
Mike Kleinaebfb452016-10-25 10:27:33 -040089 SkNf& r, SkNf& g, SkNf& b, SkNf& a, \
90 SkNf& dr, SkNf& dg, SkNf& db, SkNf& da); \
Mike Klein464e6a12017-01-04 11:04:01 -050091 SI void SK_VECTORCALL name(size_t x_tail, void** p, \
Mike Kleinaebfb452016-10-25 10:27:33 -040092 SkNf r, SkNf g, SkNf b, SkNf a, \
93 SkNf dr, SkNf dg, SkNf db, SkNf da) { \
Mike Klein464e6a12017-01-04 11:04:01 -050094 name##_kernel(x_tail/N, x_tail%N, r,g,b,a, dr,dg,db,da); \
95 next(x_tail,p, r,g,b,a, dr,dg,db,da); \
Mike Kleinaebfb452016-10-25 10:27:33 -040096 } \
Mike Klein464e6a12017-01-04 11:04:01 -050097 static SK_ALWAYS_INLINE void name##_kernel(size_t x, size_t tail, \
Mike Kleinaebfb452016-10-25 10:27:33 -040098 SkNf& r, SkNf& g, SkNf& b, SkNf& a, \
Mike Klein04adfda2016-10-12 09:52:55 -040099 SkNf& dr, SkNf& dg, SkNf& db, SkNf& da)
Mike Kleinbaaf8ad2016-09-29 09:04:15 -0400100
Mike Klein464e6a12017-01-04 11:04:01 -0500101#define STAGE_CTX(name, Ctx) \
102 static SK_ALWAYS_INLINE void name##_kernel(Ctx ctx, size_t x, size_t tail, \
103 SkNf& r, SkNf& g, SkNf& b, SkNf& a, \
104 SkNf& dr, SkNf& dg, SkNf& db, SkNf& da); \
105 SI void SK_VECTORCALL name(size_t x_tail, void** p, \
106 SkNf r, SkNf g, SkNf b, SkNf a, \
107 SkNf dr, SkNf dg, SkNf db, SkNf da) { \
108 auto ctx = (Ctx)load_and_increment(&p); \
109 name##_kernel(ctx, x_tail/N, x_tail%N, r,g,b,a, dr,dg,db,da); \
110 next(x_tail,p, r,g,b,a, dr,dg,db,da); \
111 } \
Mike Klein464e6a12017-01-04 11:04:01 -0500112 static SK_ALWAYS_INLINE void name##_kernel(Ctx ctx, size_t x, size_t tail, \
113 SkNf& r, SkNf& g, SkNf& b, SkNf& a, \
114 SkNf& dr, SkNf& dg, SkNf& db, SkNf& da)
Mike Kleinbaaf8ad2016-09-29 09:04:15 -0400115
Mike Klein9161ef02016-10-04 14:03:27 -0400116// Many xfermodes apply the same logic to each channel.
Mike Kleinaebfb452016-10-25 10:27:33 -0400117#define RGBA_XFERMODE(name) \
118 static SK_ALWAYS_INLINE SkNf name##_kernel(const SkNf& s, const SkNf& sa, \
119 const SkNf& d, const SkNf& da); \
Mike Klein464e6a12017-01-04 11:04:01 -0500120 SI void SK_VECTORCALL name(size_t x_tail, void** p, \
Mike Kleinaebfb452016-10-25 10:27:33 -0400121 SkNf r, SkNf g, SkNf b, SkNf a, \
122 SkNf dr, SkNf dg, SkNf db, SkNf da) { \
123 r = name##_kernel(r,a,dr,da); \
124 g = name##_kernel(g,a,dg,da); \
125 b = name##_kernel(b,a,db,da); \
126 a = name##_kernel(a,a,da,da); \
Mike Klein464e6a12017-01-04 11:04:01 -0500127 next(x_tail,p, r,g,b,a, dr,dg,db,da); \
Mike Kleinaebfb452016-10-25 10:27:33 -0400128 } \
129 static SK_ALWAYS_INLINE SkNf name##_kernel(const SkNf& s, const SkNf& sa, \
Mike Klein04adfda2016-10-12 09:52:55 -0400130 const SkNf& d, const SkNf& da)
Mike Klein9161ef02016-10-04 14:03:27 -0400131
132// Most of the rest apply the same logic to color channels and use srcover's alpha logic.
Mike Kleinaebfb452016-10-25 10:27:33 -0400133#define RGB_XFERMODE(name) \
134 static SK_ALWAYS_INLINE SkNf name##_kernel(const SkNf& s, const SkNf& sa, \
135 const SkNf& d, const SkNf& da); \
Mike Klein464e6a12017-01-04 11:04:01 -0500136 SI void SK_VECTORCALL name(size_t x_tail, void** p, \
Mike Kleinaebfb452016-10-25 10:27:33 -0400137 SkNf r, SkNf g, SkNf b, SkNf a, \
138 SkNf dr, SkNf dg, SkNf db, SkNf da) { \
139 r = name##_kernel(r,a,dr,da); \
140 g = name##_kernel(g,a,dg,da); \
141 b = name##_kernel(b,a,db,da); \
142 a = a + (da * (1.0f-a)); \
Mike Klein464e6a12017-01-04 11:04:01 -0500143 next(x_tail,p, r,g,b,a, dr,dg,db,da); \
Mike Kleinaebfb452016-10-25 10:27:33 -0400144 } \
145 static SK_ALWAYS_INLINE SkNf name##_kernel(const SkNf& s, const SkNf& sa, \
Mike Klein04adfda2016-10-12 09:52:55 -0400146 const SkNf& d, const SkNf& da)
147
Mike Klein2cbc33d2016-11-28 16:30:30 -0500148template <typename T>
Mike Kleinaebfb452016-10-25 10:27:33 -0400149SI SkNx<N,T> load(size_t tail, const T* src) {
Mike Klein2cbc33d2016-11-28 16:30:30 -0500150 if (tail) {
Mike Kleinaebfb452016-10-25 10:27:33 -0400151 T buf[8] = {0};
152 switch (tail & (N-1)) {
153 case 7: buf[6] = src[6];
154 case 6: buf[5] = src[5];
155 case 5: buf[4] = src[4];
156 case 4: buf[3] = src[3];
157 case 3: buf[2] = src[2];
158 case 2: buf[1] = src[1];
159 }
160 buf[0] = src[0];
161 return SkNx<N,T>::Load(buf);
162 }
163 return SkNx<N,T>::Load(src);
164}
Mike Klein2cbc33d2016-11-28 16:30:30 -0500165template <typename T>
Mike Klein56b50792016-11-29 08:14:49 -0500166SI SkNx<N,T> gather(size_t tail, const T* src, const SkNi& offset) {
167 if (tail) {
168 T buf[8] = {0};
169 switch (tail & (N-1)) {
170 case 7: buf[6] = src[offset[6]];
171 case 6: buf[5] = src[offset[5]];
172 case 5: buf[4] = src[offset[4]];
173 case 4: buf[3] = src[offset[3]];
174 case 3: buf[2] = src[offset[2]];
175 case 2: buf[1] = src[offset[1]];
176 }
177 buf[0] = src[offset[0]];
178 return SkNx<N,T>::Load(buf);
179 }
180 T buf[8];
181 for (size_t i = 0; i < N; i++) {
182 buf[i] = src[offset[i]];
183 }
184 return SkNx<N,T>::Load(buf);
185}
186template <typename T>
Mike Kleinaebfb452016-10-25 10:27:33 -0400187SI void store(size_t tail, const SkNx<N,T>& v, T* dst) {
Mike Klein2cbc33d2016-11-28 16:30:30 -0500188 if (tail) {
Mike Kleinaebfb452016-10-25 10:27:33 -0400189 switch (tail & (N-1)) {
190 case 7: dst[6] = v[6];
191 case 6: dst[5] = v[5];
192 case 5: dst[4] = v[4];
193 case 4: dst[3] = v[3];
194 case 3: dst[2] = v[2];
195 case 2: dst[1] = v[1];
196 }
197 dst[0] = v[0];
198 return;
199 }
200 v.store(dst);
201}
202
Mike Klein56b50792016-11-29 08:14:49 -0500203#if !defined(SKNX_NO_SIMD) && SK_CPU_SSE_LEVEL >= SK_CPU_SSE_LEVEL_AVX2
204 SI __m256i mask(size_t tail) {
205 static const int masks[][8] = {
206 {~0,~0,~0,~0, ~0,~0,~0,~0 }, // remember, tail == 0 ~~> load all N
207 {~0, 0, 0, 0, 0, 0, 0, 0 },
208 {~0,~0, 0, 0, 0, 0, 0, 0 },
209 {~0,~0,~0, 0, 0, 0, 0, 0 },
210 {~0,~0,~0,~0, 0, 0, 0, 0 },
211 {~0,~0,~0,~0, ~0, 0, 0, 0 },
212 {~0,~0,~0,~0, ~0,~0, 0, 0 },
213 {~0,~0,~0,~0, ~0,~0,~0, 0 },
214 };
215 return SkNi::Load(masks + tail).fVec;
216 }
217
218 SI SkNi load(size_t tail, const int32_t* src) {
219 return tail ? _mm256_maskload_epi32((const int*)src, mask(tail))
220 : SkNi::Load(src);
221 }
222 SI SkNu load(size_t tail, const uint32_t* src) {
223 return tail ? _mm256_maskload_epi32((const int*)src, mask(tail))
224 : SkNu::Load(src);
225 }
Matt Sarettf6878ba2016-12-01 14:46:12 -0500226 SI SkNf load(size_t tail, const float* src) {
227 return tail ? _mm256_maskload_ps((const float*)src, mask(tail))
228 : SkNf::Load(src);
229 }
Mike Klein56b50792016-11-29 08:14:49 -0500230 SI SkNi gather(size_t tail, const int32_t* src, const SkNi& offset) {
Matt Sarettf6878ba2016-12-01 14:46:12 -0500231 auto m = mask(tail);
232 return _mm256_mask_i32gather_epi32(SkNi(0).fVec, (const int*)src, offset.fVec, m, 4);
Mike Klein56b50792016-11-29 08:14:49 -0500233 }
234 SI SkNu gather(size_t tail, const uint32_t* src, const SkNi& offset) {
Matt Sarettf6878ba2016-12-01 14:46:12 -0500235 auto m = mask(tail);
236 return _mm256_mask_i32gather_epi32(SkNi(0).fVec, (const int*)src, offset.fVec, m, 4);
237 }
238 SI SkNf gather(size_t tail, const float* src, const SkNi& offset) {
239 auto m = _mm256_castsi256_ps(mask(tail));
240 return _mm256_mask_i32gather_ps(SkNf(0).fVec, (const float*)src, offset.fVec, m, 4);
Mike Klein56b50792016-11-29 08:14:49 -0500241 }
Mike Kleina0c4c342016-11-29 13:58:49 -0500242
243 static const char* bug = "I don't think MSAN understands maskstore.";
244
Mike Klein56b50792016-11-29 08:14:49 -0500245 SI void store(size_t tail, const SkNi& v, int32_t* dst) {
Mike Kleina0c4c342016-11-29 13:58:49 -0500246 if (tail) {
247 _mm256_maskstore_epi32((int*)dst, mask(tail), v.fVec);
248 return sk_msan_mark_initialized(dst, dst+tail, bug);
249 }
250 v.store(dst);
Mike Klein56b50792016-11-29 08:14:49 -0500251 }
252 SI void store(size_t tail, const SkNu& v, uint32_t* dst) {
Mike Kleina0c4c342016-11-29 13:58:49 -0500253 if (tail) {
254 _mm256_maskstore_epi32((int*)dst, mask(tail), v.fVec);
255 return sk_msan_mark_initialized(dst, dst+tail, bug);
256 }
257 v.store(dst);
Mike Klein56b50792016-11-29 08:14:49 -0500258 }
Matt Sarettf6878ba2016-12-01 14:46:12 -0500259 SI void store(size_t tail, const SkNf& v, float* dst) {
260 if (tail) {
261 _mm256_maskstore_ps((float*)dst, mask(tail), v.fVec);
262 return sk_msan_mark_initialized(dst, dst+tail, bug);
263 }
264 v.store(dst);
265 }
Mike Klein56b50792016-11-29 08:14:49 -0500266#endif
267
Mike Kleine2e2ae22016-12-02 15:21:03 -0500268SI SkNf SkNf_fma(const SkNf& f, const SkNf& m, const SkNf& a) { return SkNx_fma(f,m,a); }
269
270SI SkNi SkNf_round(const SkNf& x, const SkNf& scale) {
271 // Every time I try, _mm_cvtps_epi32 benches as slower than using FMA and _mm_cvttps_epi32. :/
272 return SkNx_cast<int>(SkNf_fma(x,scale, 0.5f));
273}
274
275SI SkNf SkNf_from_byte(const SkNi& x) {
276 // Same trick as in store_8888: 0x470000BB == 32768.0f + BB/256.0f for all bytes BB.
277 auto v = 0x47000000 | x;
278 // Read this as (pun_float(v) - 32768.0f) * (256/255.0f), redistributed to be an FMA.
279 return SkNf_fma(SkNf::Load(&v), 256/255.0f, -32768*256/255.0f);
280}
281SI SkNf SkNf_from_byte(const SkNu& x) { return SkNf_from_byte(SkNi::Load(&x)); }
282SI SkNf SkNf_from_byte(const SkNb& x) { return SkNf_from_byte(SkNx_cast<int>(x)); }
283
Mike Kleind5de0132016-11-28 09:33:02 -0500284SI void from_8888(const SkNu& _8888, SkNf* r, SkNf* g, SkNf* b, SkNf* a) {
Mike Kleine2e2ae22016-12-02 15:21:03 -0500285 *r = SkNf_from_byte((_8888 ) & 0xff);
286 *g = SkNf_from_byte((_8888 >> 8) & 0xff);
287 *b = SkNf_from_byte((_8888 >> 16) & 0xff);
288 *a = SkNf_from_byte((_8888 >> 24) );
Mike Kleind5de0132016-11-28 09:33:02 -0500289}
Mike Klein6b77f1c2016-11-22 15:50:12 -0500290SI void from_4444(const SkNh& _4444, SkNf* r, SkNf* g, SkNf* b, SkNf* a) {
291 auto _32_bit = SkNx_cast<int>(_4444);
292
293 *r = SkNx_cast<float>(_32_bit & (0xF << SK_R4444_SHIFT)) * (1.0f / (0xF << SK_R4444_SHIFT));
294 *g = SkNx_cast<float>(_32_bit & (0xF << SK_G4444_SHIFT)) * (1.0f / (0xF << SK_G4444_SHIFT));
295 *b = SkNx_cast<float>(_32_bit & (0xF << SK_B4444_SHIFT)) * (1.0f / (0xF << SK_B4444_SHIFT));
296 *a = SkNx_cast<float>(_32_bit & (0xF << SK_A4444_SHIFT)) * (1.0f / (0xF << SK_A4444_SHIFT));
297}
Mike Kleinaebfb452016-10-25 10:27:33 -0400298SI void from_565(const SkNh& _565, SkNf* r, SkNf* g, SkNf* b) {
299 auto _32_bit = SkNx_cast<int>(_565);
300
301 *r = SkNx_cast<float>(_32_bit & SK_R16_MASK_IN_PLACE) * (1.0f / SK_R16_MASK_IN_PLACE);
302 *g = SkNx_cast<float>(_32_bit & SK_G16_MASK_IN_PLACE) * (1.0f / SK_G16_MASK_IN_PLACE);
303 *b = SkNx_cast<float>(_32_bit & SK_B16_MASK_IN_PLACE) * (1.0f / SK_B16_MASK_IN_PLACE);
304}
Mike Klein49580062016-12-11 11:42:07 -0500305SI void from_f16(const void* px, SkNf* r, SkNf* g, SkNf* b, SkNf* a) {
306 SkNh rh, gh, bh, ah;
307 SkNh::Load4(px, &rh, &gh, &bh, &ah);
308
309 *r = SkHalfToFloat_finite_ftz(rh);
310 *g = SkHalfToFloat_finite_ftz(gh);
311 *b = SkHalfToFloat_finite_ftz(bh);
312 *a = SkHalfToFloat_finite_ftz(ah);
313}
Mike Kleinaebfb452016-10-25 10:27:33 -0400314
Mike Klein464e6a12017-01-04 11:04:01 -0500315STAGE_CTX(trace, const char*) {
316 SkDebugf("%s\n", ctx);
Mike Kleina9312fd2016-11-16 13:38:15 -0500317}
Mike Klein2cbc33d2016-11-28 16:30:30 -0500318STAGE(registers) {
Mike Kleina9312fd2016-11-16 13:38:15 -0500319 auto print = [](const char* name, const SkNf& v) {
320 SkDebugf("%s:", name);
321 for (int i = 0; i < N; i++) {
322 SkDebugf(" %g", v[i]);
323 }
324 SkDebugf("\n");
325 };
326 print(" r", r);
327 print(" g", g);
328 print(" b", b);
329 print(" a", a);
330 print("dr", dr);
331 print("dg", dg);
332 print("db", db);
333 print("da", da);
334}
335
Mike Klein2cbc33d2016-11-28 16:30:30 -0500336STAGE(clamp_0) {
Mike Klein130863e2016-10-27 11:29:36 -0400337 a = SkNf::Max(a, 0.0f);
338 r = SkNf::Max(r, 0.0f);
339 g = SkNf::Max(g, 0.0f);
340 b = SkNf::Max(b, 0.0f);
341}
Mike Kleind37d5d92016-12-14 13:38:24 +0000342STAGE(clamp_1) {
343 a = SkNf::Min(a, 1.0f);
344 r = SkNf::Min(r, 1.0f);
345 g = SkNf::Min(g, 1.0f);
346 b = SkNf::Min(b, 1.0f);
347}
Mike Klein2cbc33d2016-11-28 16:30:30 -0500348STAGE(clamp_a) {
Mike Klein130863e2016-10-27 11:29:36 -0400349 a = SkNf::Min(a, 1.0f);
350 r = SkNf::Min(r, a);
351 g = SkNf::Min(g, a);
352 b = SkNf::Min(b, a);
353}
Matt Sarettdb4d4062016-11-16 16:07:15 -0500354
Mike Klein2cbc33d2016-11-28 16:30:30 -0500355STAGE(unpremul) {
Mike Klein5a130112016-11-28 09:48:31 -0500356 auto scale = (a == 0.0f).thenElse(0.0f, 1.0f/a);
357 r *= scale;
358 g *= scale;
359 b *= scale;
Mike Kleineea7c162016-11-03 10:20:35 -0400360}
Mike Klein2cbc33d2016-11-28 16:30:30 -0500361STAGE(premul) {
Mike Kleineea7c162016-11-03 10:20:35 -0400362 r *= a;
363 g *= a;
364 b *= a;
365}
366
Mike Klein464e6a12017-01-04 11:04:01 -0500367STAGE_CTX(set_rgb, const float*) {
368 r = ctx[0];
369 g = ctx[1];
370 b = ctx[2];
Mike Klein7a14734d2016-11-29 15:33:39 -0500371}
Mike Klein8c8cb5b2017-01-06 10:21:56 -0500372STAGE(swap_rb) { SkTSwap(r,b); }
Mike Klein7a14734d2016-11-29 15:33:39 -0500373
Mike Klein2cbc33d2016-11-28 16:30:30 -0500374STAGE(move_src_dst) {
Mike Kleinc5093412016-11-04 16:36:39 -0400375 dr = r;
376 dg = g;
377 db = b;
378 da = a;
Mike Kleinaebfb452016-10-25 10:27:33 -0400379}
Mike Klein2cbc33d2016-11-28 16:30:30 -0500380STAGE(move_dst_src) {
Mike Kleind5de0132016-11-28 09:33:02 -0500381 r = dr;
382 g = dg;
383 b = db;
384 a = da;
Mike Kleinfb191da2016-11-15 13:20:33 -0500385}
Mike Klein8c8cb5b2017-01-06 10:21:56 -0500386STAGE(swap) {
387 SkTSwap(r,dr);
388 SkTSwap(g,dg);
389 SkTSwap(b,db);
390 SkTSwap(a,da);
391}
Mike Kleind5de0132016-11-28 09:33:02 -0500392
Mike Klein729b5822016-11-28 18:23:23 -0500393STAGE(from_srgb) {
Mike Kleinb04c3522016-11-28 11:55:58 -0500394 r = sk_linear_from_srgb_math(r);
395 g = sk_linear_from_srgb_math(g);
396 b = sk_linear_from_srgb_math(b);
397}
Mike Klein2cbc33d2016-11-28 16:30:30 -0500398STAGE(to_srgb) {
Mike Kleine03339a2016-11-28 13:24:27 -0500399 r = sk_linear_to_srgb_needs_round(r);
400 g = sk_linear_to_srgb_needs_round(g);
401 b = sk_linear_to_srgb_needs_round(b);
Mike Kleinb04c3522016-11-28 11:55:58 -0500402}
Mike Kleind5de0132016-11-28 09:33:02 -0500403
raftias97524542016-12-14 13:15:05 -0500404STAGE(from_2dot2) {
405 auto from_2dot2 = [](const SkNf& x) {
406 // x^(141/64) = x^(2.20312) is a great approximation of the true value, x^(2.2).
407 // (note: x^(35/16) = x^(2.1875) is an okay one as well and would be quicker)
408 auto x16 = x.rsqrt().rsqrt().rsqrt().rsqrt(); // x^(1/16) = x^(4/64);
409 auto x64 = x16.rsqrt().rsqrt(); // x^(1/64)
410
411 // x^(141/64) = x^(128/64) * x^(12/64) * x^(1/64)
412 return SkNf::Max((x*x) * (x16*x16*x16) * (x64), 0.0f);
413 };
Mike Kleine2b66a72017-01-04 09:59:25 -0500414
raftias97524542016-12-14 13:15:05 -0500415 r = from_2dot2(r);
416 g = from_2dot2(g);
417 b = from_2dot2(b);
418}
Matt Sarettf6878ba2016-12-01 14:46:12 -0500419STAGE(to_2dot2) {
420 auto to_2dot2 = [](const SkNf& x) {
421 // x^(29/64) is a very good approximation of the true value, x^(1/2.2).
422 auto x2 = x.rsqrt(), // x^(-1/2)
423 x32 = x2.rsqrt().rsqrt().rsqrt().rsqrt(), // x^(-1/32)
424 x64 = x32.rsqrt(); // x^(+1/64)
425
426 // 29 = 32 - 2 - 1
Matt Sarettabf8ba32016-12-01 17:02:07 -0500427 return SkNf::Max(x2.invert() * x32 * x64.invert(), 0.0f); // Watch out for NaN.
Matt Sarettf6878ba2016-12-01 14:46:12 -0500428 };
429
430 r = to_2dot2(r);
431 g = to_2dot2(g);
432 b = to_2dot2(b);
433}
434
Mike Kleinaebfb452016-10-25 10:27:33 -0400435// The default shader produces a constant color (from the SkPaint).
Mike Klein464e6a12017-01-04 11:04:01 -0500436STAGE_CTX(constant_color, const SkPM4f*) {
437 r = ctx->r();
438 g = ctx->g();
439 b = ctx->b();
440 a = ctx->a();
Mike Kleinaebfb452016-10-25 10:27:33 -0400441}
442
Mike Kleinbabd93e2016-11-30 16:05:10 -0500443// s' = sc for a scalar c.
Mike Klein464e6a12017-01-04 11:04:01 -0500444STAGE_CTX(scale_1_float, const float*) {
445 SkNf c = *ctx;
Mike Klein66866172016-11-03 12:22:01 -0400446
447 r *= c;
448 g *= c;
449 b *= c;
450 a *= c;
451}
Mike Kleinaebfb452016-10-25 10:27:33 -0400452// s' = sc for 8-bit c.
Mike Klein464e6a12017-01-04 11:04:01 -0500453STAGE_CTX(scale_u8, const uint8_t**) {
454 auto ptr = *ctx + x;
Mike Klein9ea894b2017-01-03 23:42:04 +0000455 SkNf c = SkNf_from_byte(load(tail, ptr));
Mike Klein464e6a12017-01-04 11:04:01 -0500456
Mike Kleinaebfb452016-10-25 10:27:33 -0400457 r = r*c;
458 g = g*c;
459 b = b*c;
460 a = a*c;
461}
462
Mike Klein729b5822016-11-28 18:23:23 -0500463SI SkNf lerp(const SkNf& from, const SkNf& to, const SkNf& cov) {
Mike Klein87185f72016-12-01 18:22:26 -0500464 return SkNf_fma(to-from, cov, from);
Mike Klein729b5822016-11-28 18:23:23 -0500465}
466
Mike Kleinbabd93e2016-11-30 16:05:10 -0500467// s' = d(1-c) + sc, for a scalar c.
Mike Klein464e6a12017-01-04 11:04:01 -0500468STAGE_CTX(lerp_1_float, const float*) {
469 SkNf c = *ctx;
Mike Klein729b5822016-11-28 18:23:23 -0500470
471 r = lerp(dr, r, c);
472 g = lerp(dg, g, c);
473 b = lerp(db, b, c);
474 a = lerp(da, a, c);
475}
476
Mike Kleinaebfb452016-10-25 10:27:33 -0400477// s' = d(1-c) + sc for 8-bit c.
Mike Klein464e6a12017-01-04 11:04:01 -0500478STAGE_CTX(lerp_u8, const uint8_t**) {
479 auto ptr = *ctx + x;
Mike Klein9ea894b2017-01-03 23:42:04 +0000480 SkNf c = SkNf_from_byte(load(tail, ptr));
Mike Klein464e6a12017-01-04 11:04:01 -0500481
Mike Kleinaebfb452016-10-25 10:27:33 -0400482 r = lerp(dr, r, c);
483 g = lerp(dg, g, c);
484 b = lerp(db, b, c);
485 a = lerp(da, a, c);
486}
487
488// s' = d(1-c) + sc for 565 c.
Mike Klein464e6a12017-01-04 11:04:01 -0500489STAGE_CTX(lerp_565, const uint16_t**) {
490 auto ptr = *ctx + x;
Mike Kleinaebfb452016-10-25 10:27:33 -0400491 SkNf cr, cg, cb;
Mike Klein2cbc33d2016-11-28 16:30:30 -0500492 from_565(load(tail, ptr), &cr, &cg, &cb);
Mike Kleinaebfb452016-10-25 10:27:33 -0400493
494 r = lerp(dr, r, cr);
495 g = lerp(dg, g, cg);
496 b = lerp(db, b, cb);
497 a = 1.0f;
498}
499
Mike Kleine71b1672017-01-13 07:59:23 -0500500STAGE_CTX(load_a8, const uint8_t**) {
501 auto ptr = *ctx + x;
502 r = g = b = 0.0f;
503 a = SkNf_from_byte(load(tail, ptr));
504}
505STAGE_CTX(store_a8, uint8_t**) {
506 auto ptr = *ctx + x;
507 store(tail, SkNx_cast<uint8_t>(SkNf_round(255.0f, a)), ptr);
508}
509
Mike Klein464e6a12017-01-04 11:04:01 -0500510STAGE_CTX(load_565, const uint16_t**) {
511 auto ptr = *ctx + x;
Mike Klein2cbc33d2016-11-28 16:30:30 -0500512 from_565(load(tail, ptr), &r,&g,&b);
Mike Kleinaebfb452016-10-25 10:27:33 -0400513 a = 1.0f;
514}
Mike Klein464e6a12017-01-04 11:04:01 -0500515STAGE_CTX(store_565, uint16_t**) {
516 auto ptr = *ctx + x;
Mike Klein9c77ea12016-12-02 08:29:10 -0500517 store(tail, SkNx_cast<uint16_t>( SkNf_round(r, SK_R16_MASK) << SK_R16_SHIFT
518 | SkNf_round(g, SK_G16_MASK) << SK_G16_SHIFT
519 | SkNf_round(b, SK_B16_MASK) << SK_B16_SHIFT), ptr);
Mike Kleinaebfb452016-10-25 10:27:33 -0400520}
521
Mike Kleinaebfb452016-10-25 10:27:33 -0400522
Mike Klein464e6a12017-01-04 11:04:01 -0500523STAGE_CTX(load_f16, const uint64_t**) {
524 auto ptr = *ctx + x;
Mike Kleinaebfb452016-10-25 10:27:33 -0400525
Mike Klein49580062016-12-11 11:42:07 -0500526 const void* src = ptr;
527 SkNx<N, uint64_t> px;
Mike Klein2cbc33d2016-11-28 16:30:30 -0500528 if (tail) {
Mike Klein49580062016-12-11 11:42:07 -0500529 px = load(tail, ptr);
530 src = &px;
Mike Kleinaebfb452016-10-25 10:27:33 -0400531 }
Mike Klein49580062016-12-11 11:42:07 -0500532 from_f16(src, &r, &g, &b, &a);
Mike Kleinaebfb452016-10-25 10:27:33 -0400533}
Mike Klein464e6a12017-01-04 11:04:01 -0500534STAGE_CTX(store_f16, uint64_t**) {
535 auto ptr = *ctx + x;
Mike Kleinaebfb452016-10-25 10:27:33 -0400536
Mike Klein49580062016-12-11 11:42:07 -0500537 SkNx<N, uint64_t> px;
538 SkNh::Store4(tail ? (void*)&px : (void*)ptr, SkFloatToHalf_finite_ftz(r),
539 SkFloatToHalf_finite_ftz(g),
540 SkFloatToHalf_finite_ftz(b),
541 SkFloatToHalf_finite_ftz(a));
Mike Klein2cbc33d2016-11-28 16:30:30 -0500542 if (tail) {
Mike Klein49580062016-12-11 11:42:07 -0500543 store(tail, px, ptr);
Mike Kleinaebfb452016-10-25 10:27:33 -0400544 }
545}
546
Mike Klein464e6a12017-01-04 11:04:01 -0500547STAGE_CTX(store_f32, SkPM4f**) {
548 auto ptr = *ctx + x;
mtkleina4a44882016-11-04 13:20:07 -0700549
Mike Klein49580062016-12-11 11:42:07 -0500550 SkNx<N, SkPM4f> px;
551 SkNf::Store4(tail ? (void*)&px : (void*)ptr, r,g,b,a);
Mike Klein2cbc33d2016-11-28 16:30:30 -0500552 if (tail) {
Mike Klein49580062016-12-11 11:42:07 -0500553 store(tail, px, ptr);
mtkleina4a44882016-11-04 13:20:07 -0700554 }
555}
556
Mike Kleinaebfb452016-10-25 10:27:33 -0400557
Mike Klein464e6a12017-01-04 11:04:01 -0500558STAGE_CTX(load_8888, const uint32_t**) {
559 auto ptr = *ctx + x;
Mike Klein2cbc33d2016-11-28 16:30:30 -0500560 from_8888(load(tail, ptr), &r, &g, &b, &a);
raftias25636012016-11-11 15:27:39 -0800561}
Mike Klein464e6a12017-01-04 11:04:01 -0500562STAGE_CTX(store_8888, uint32_t**) {
Mike Klein3e056712016-12-02 14:22:57 -0500563 auto byte = [](const SkNf& x, int ix) {
564 // Here's a neat trick: 0x47000000 == 32768.0f, and 0x470000ff == 32768.0f + (255/256.0f).
565 auto v = SkNf_fma(255/256.0f, x, 32768.0f);
566 switch (ix) {
567 case 0: return SkNi::Load(&v) & 0xff; // R
568 case 3: return SkNi::Load(&v) << 24; // A
569 }
570 return (SkNi::Load(&v) & 0xff) << (8*ix); // B or G
571 };
572
Mike Klein464e6a12017-01-04 11:04:01 -0500573 auto ptr = *ctx + x;
Mike Klein3e056712016-12-02 14:22:57 -0500574 store(tail, byte(r,0)|byte(g,1)|byte(b,2)|byte(a,3), (int*)ptr);
raftias25636012016-11-11 15:27:39 -0800575}
576
Matt Sarett379938e2017-01-12 18:34:29 -0500577STAGE_CTX(load_u16_be, const uint64_t**) {
578 auto ptr = *ctx + x;
579 const void* src = ptr;
580 SkNx<N, uint64_t> px;
581 if (tail) {
582 px = load(tail, ptr);
583 src = &px;
584 }
585
586 SkNh rh, gh, bh, ah;
587 SkNh::Load4(src, &rh, &gh, &bh, &ah);
588 r = (1.0f / 65535.0f) * SkNx_cast<float>((rh << 8) | (rh >> 8));
589 g = (1.0f / 65535.0f) * SkNx_cast<float>((gh << 8) | (gh >> 8));
590 b = (1.0f / 65535.0f) * SkNx_cast<float>((bh << 8) | (bh >> 8));
591 a = (1.0f / 65535.0f) * SkNx_cast<float>((ah << 8) | (ah >> 8));
592}
593
Matt Sarett5bee0b62017-01-19 12:04:32 -0500594STAGE_CTX(load_rgb_u16_be, const uint16_t**) {
595 auto ptr = *ctx + 3*x;
596 const void* src = ptr;
597 uint16_t buf[N*3] = {0};
598 if (tail) {
599 memcpy(buf, src, tail*3*sizeof(uint16_t));
600 src = buf;
601 }
602
603 SkNh rh, gh, bh;
604 SkNh::Load3(src, &rh, &gh, &bh);
605 r = (1.0f / 65535.0f) * SkNx_cast<float>((rh << 8) | (rh >> 8));
606 g = (1.0f / 65535.0f) * SkNx_cast<float>((gh << 8) | (gh >> 8));
607 b = (1.0f / 65535.0f) * SkNx_cast<float>((bh << 8) | (bh >> 8));
608 a = 1.0f;
609}
610
Matt Sarett1da27ef2017-01-19 17:14:07 -0500611STAGE_CTX(store_u16_be, uint64_t**) {
612 auto to_u16_be = [](const SkNf& x) {
613 SkNh x16 = SkNx_cast<uint16_t>(65535.0f * x);
614 return (x16 << 8) | (x16 >> 8);
615 };
616
617 auto ptr = *ctx + x;
618 SkNx<N, uint64_t> px;
619 SkNh::Store4(tail ? (void*)&px : (void*)ptr, to_u16_be(r),
620 to_u16_be(g),
621 to_u16_be(b),
622 to_u16_be(a));
623 if (tail) {
624 store(tail, px, ptr);
625 }
626}
627
Mike Klein464e6a12017-01-04 11:04:01 -0500628STAGE_CTX(load_tables, const LoadTablesContext*) {
Matt Sarett379938e2017-01-12 18:34:29 -0500629 auto ptr = (const uint32_t*)ctx->fSrc + x;
Matt Sarettf6878ba2016-12-01 14:46:12 -0500630
631 SkNu rgba = load(tail, ptr);
632 auto to_int = [](const SkNu& v) { return SkNi::Load(&v); };
Mike Klein464e6a12017-01-04 11:04:01 -0500633 r = gather(tail, ctx->fR, to_int((rgba >> 0) & 0xff));
634 g = gather(tail, ctx->fG, to_int((rgba >> 8) & 0xff));
635 b = gather(tail, ctx->fB, to_int((rgba >> 16) & 0xff));
Mike Kleine2e2ae22016-12-02 15:21:03 -0500636 a = SkNf_from_byte(rgba >> 24);
Matt Sarettf6878ba2016-12-01 14:46:12 -0500637}
638
Matt Sarett379938e2017-01-12 18:34:29 -0500639STAGE_CTX(load_tables_u16_be, const LoadTablesContext*) {
640 auto ptr = (const uint64_t*)ctx->fSrc + x;
Matt Sarettc55bc9a2017-01-13 13:58:57 -0500641 const void* src = ptr;
642 SkNx<N, uint64_t> px;
643 if (tail) {
644 px = load(tail, ptr);
645 src = &px;
646 }
Matt Sarett379938e2017-01-12 18:34:29 -0500647
648 SkNh rh, gh, bh, ah;
Matt Sarettc55bc9a2017-01-13 13:58:57 -0500649 SkNh::Load4(src, &rh, &gh, &bh, &ah);
Matt Sarett379938e2017-01-12 18:34:29 -0500650
651 // ctx->fSrc is big-endian, so "& 0xff" grabs the 8 most significant bits of each component.
652 r = gather(tail, ctx->fR, SkNx_cast<int>(rh & 0xff));
653 g = gather(tail, ctx->fG, SkNx_cast<int>(gh & 0xff));
654 b = gather(tail, ctx->fB, SkNx_cast<int>(bh & 0xff));
655 a = (1.0f / 65535.0f) * SkNx_cast<float>((ah << 8) | (ah >> 8));
656}
657
Matt Sarett5bee0b62017-01-19 12:04:32 -0500658STAGE_CTX(load_tables_rgb_u16_be, const LoadTablesContext*) {
659 auto ptr = (const uint16_t*)ctx->fSrc + 3*x;
660 const void* src = ptr;
661 uint16_t buf[N*3] = {0};
662 if (tail) {
663 memcpy(buf, src, tail*3*sizeof(uint16_t));
664 src = buf;
665 }
666
667 SkNh rh, gh, bh;
668 SkNh::Load3(src, &rh, &gh, &bh);
669
670 // ctx->fSrc is big-endian, so "& 0xff" grabs the 8 most significant bits of each component.
671 r = gather(tail, ctx->fR, SkNx_cast<int>(rh & 0xff));
672 g = gather(tail, ctx->fG, SkNx_cast<int>(gh & 0xff));
673 b = gather(tail, ctx->fB, SkNx_cast<int>(bh & 0xff));
674 a = 1.0f;
675}
676
Mike Klein464e6a12017-01-04 11:04:01 -0500677STAGE_CTX(store_tables, const StoreTablesContext*) {
678 auto ptr = ctx->fDst + x;
Matt Sarettf6878ba2016-12-01 14:46:12 -0500679
Mike Klein464e6a12017-01-04 11:04:01 -0500680 float scale = ctx->fCount - 1;
Mike Klein9c77ea12016-12-02 08:29:10 -0500681 SkNi ri = SkNf_round(scale, r);
682 SkNi gi = SkNf_round(scale, g);
683 SkNi bi = SkNf_round(scale, b);
Matt Sarettf6878ba2016-12-01 14:46:12 -0500684
Mike Klein464e6a12017-01-04 11:04:01 -0500685 store(tail, ( SkNx_cast<int>(gather(tail, ctx->fR, ri)) << 0
686 | SkNx_cast<int>(gather(tail, ctx->fG, gi)) << 8
687 | SkNx_cast<int>(gather(tail, ctx->fB, bi)) << 16
688 | SkNf_round(255.0f, a) << 24), (int*)ptr);
Matt Sarettf6878ba2016-12-01 14:46:12 -0500689}
690
Mike Klein729b5822016-11-28 18:23:23 -0500691SI SkNf inv(const SkNf& x) { return 1.0f - x; }
692
Mike Kleinaebfb452016-10-25 10:27:33 -0400693RGBA_XFERMODE(clear) { return 0.0f; }
Mike Kleinaebfb452016-10-25 10:27:33 -0400694RGBA_XFERMODE(srcatop) { return s*da + d*inv(sa); }
695RGBA_XFERMODE(srcin) { return s * da; }
696RGBA_XFERMODE(srcout) { return s * inv(da); }
Mike Klein87185f72016-12-01 18:22:26 -0500697RGBA_XFERMODE(srcover) { return SkNf_fma(d, inv(sa), s); }
Mike Kleinaebfb452016-10-25 10:27:33 -0400698RGBA_XFERMODE(dstatop) { return srcatop_kernel(d,da,s,sa); }
699RGBA_XFERMODE(dstin) { return srcin_kernel (d,da,s,sa); }
700RGBA_XFERMODE(dstout) { return srcout_kernel (d,da,s,sa); }
701RGBA_XFERMODE(dstover) { return srcover_kernel(d,da,s,sa); }
702
703RGBA_XFERMODE(modulate) { return s*d; }
704RGBA_XFERMODE(multiply) { return s*inv(da) + d*inv(sa) + s*d; }
705RGBA_XFERMODE(plus_) { return s + d; }
706RGBA_XFERMODE(screen) { return s + d - s*d; }
707RGBA_XFERMODE(xor_) { return s*inv(da) + d*inv(sa); }
708
709RGB_XFERMODE(colorburn) {
710 return (d == da ).thenElse(d + s*inv(da),
711 (s == 0.0f).thenElse(s + d*inv(sa),
712 sa*(da - SkNf::Min(da, (da-d)*sa/s)) + s*inv(da) + d*inv(sa)));
713}
714RGB_XFERMODE(colordodge) {
715 return (d == 0.0f).thenElse(d + s*inv(da),
716 (s == sa ).thenElse(s + d*inv(sa),
717 sa*SkNf::Min(da, (d*sa)/(sa - s)) + s*inv(da) + d*inv(sa)));
718}
719RGB_XFERMODE(darken) { return s + d - SkNf::Max(s*da, d*sa); }
720RGB_XFERMODE(difference) { return s + d - 2.0f*SkNf::Min(s*da,d*sa); }
721RGB_XFERMODE(exclusion) { return s + d - 2.0f*s*d; }
722RGB_XFERMODE(hardlight) {
723 return s*inv(da) + d*inv(sa)
724 + (2.0f*s <= sa).thenElse(2.0f*s*d, sa*da - 2.0f*(da-d)*(sa-s));
725}
726RGB_XFERMODE(lighten) { return s + d - SkNf::Min(s*da, d*sa); }
727RGB_XFERMODE(overlay) { return hardlight_kernel(d,da,s,sa); }
728RGB_XFERMODE(softlight) {
729 SkNf m = (da > 0.0f).thenElse(d / da, 0.0f),
730 s2 = 2.0f*s,
731 m4 = 4.0f*m;
732
733 // The logic forks three ways:
734 // 1. dark src?
735 // 2. light src, dark dst?
736 // 3. light src, light dst?
737 SkNf darkSrc = d*(sa + (s2 - sa)*(1.0f - m)), // Used in case 1.
738 darkDst = (m4*m4 + m4)*(m - 1.0f) + 7.0f*m, // Used in case 2.
739 liteDst = m.rsqrt().invert() - m, // Used in case 3.
740 liteSrc = d*sa + da*(s2 - sa) * (4.0f*d <= da).thenElse(darkDst, liteDst); // 2 or 3?
741 return s*inv(da) + d*inv(sa) + (s2 <= sa).thenElse(darkSrc, liteSrc); // 1 or (2 or 3)?
742}
743
Mike Klein2cbc33d2016-11-28 16:30:30 -0500744STAGE(luminance_to_alpha) {
Mike Klein1f49f262016-10-31 19:49:27 -0400745 a = SK_LUM_COEFF_R*r + SK_LUM_COEFF_G*g + SK_LUM_COEFF_B*b;
746 r = g = b = 0;
747}
748
Mike Klein464e6a12017-01-04 11:04:01 -0500749STAGE_CTX(matrix_2x3, const float*) {
750 auto m = ctx;
Mike Klein06a65e22016-11-17 12:39:09 -0500751
Mike Klein87185f72016-12-01 18:22:26 -0500752 auto R = SkNf_fma(r,m[0], SkNf_fma(g,m[2], m[4])),
753 G = SkNf_fma(r,m[1], SkNf_fma(g,m[3], m[5]));
Mike Klein06a65e22016-11-17 12:39:09 -0500754 r = R;
755 g = G;
756}
Mike Klein464e6a12017-01-04 11:04:01 -0500757STAGE_CTX(matrix_3x4, const float*) {
758 auto m = ctx;
raftias25636012016-11-11 15:27:39 -0800759
Mike Klein87185f72016-12-01 18:22:26 -0500760 auto R = SkNf_fma(r,m[0], SkNf_fma(g,m[3], SkNf_fma(b,m[6], m[ 9]))),
761 G = SkNf_fma(r,m[1], SkNf_fma(g,m[4], SkNf_fma(b,m[7], m[10]))),
762 B = SkNf_fma(r,m[2], SkNf_fma(g,m[5], SkNf_fma(b,m[8], m[11])));
raftias25636012016-11-11 15:27:39 -0800763 r = R;
764 g = G;
765 b = B;
766}
Mike Klein464e6a12017-01-04 11:04:01 -0500767STAGE_CTX(matrix_4x5, const float*) {
768 auto m = ctx;
Mike Kleineea7c162016-11-03 10:20:35 -0400769
Mike Klein87185f72016-12-01 18:22:26 -0500770 auto R = SkNf_fma(r,m[0], SkNf_fma(g,m[4], SkNf_fma(b,m[ 8], SkNf_fma(a,m[12], m[16])))),
771 G = SkNf_fma(r,m[1], SkNf_fma(g,m[5], SkNf_fma(b,m[ 9], SkNf_fma(a,m[13], m[17])))),
772 B = SkNf_fma(r,m[2], SkNf_fma(g,m[6], SkNf_fma(b,m[10], SkNf_fma(a,m[14], m[18])))),
773 A = SkNf_fma(r,m[3], SkNf_fma(g,m[7], SkNf_fma(b,m[11], SkNf_fma(a,m[15], m[19]))));
Mike Kleineea7c162016-11-03 10:20:35 -0400774 r = R;
775 g = G;
776 b = B;
777 a = A;
778}
Mike Klein464e6a12017-01-04 11:04:01 -0500779STAGE_CTX(matrix_perspective, const float*) {
Mike Kleinc01e7df2016-11-17 16:27:10 -0500780 // N.B. unlike the matrix_NxM stages, this takes a row-major matrix.
Mike Klein464e6a12017-01-04 11:04:01 -0500781 auto m = ctx;
Mike Kleinc01e7df2016-11-17 16:27:10 -0500782
Mike Klein87185f72016-12-01 18:22:26 -0500783 auto R = SkNf_fma(r,m[0], SkNf_fma(g,m[1], m[2])),
784 G = SkNf_fma(r,m[3], SkNf_fma(g,m[4], m[5])),
785 Z = SkNf_fma(r,m[6], SkNf_fma(g,m[7], m[8]));
Mike Kleinc01e7df2016-11-17 16:27:10 -0500786 r = R * Z.invert();
787 g = G * Z.invert();
788}
789
Mike Kleincfcf6242016-11-16 09:01:30 -0500790SI SkNf parametric(const SkNf& v, const SkColorSpaceTransferFn& p) {
791 float result[N]; // Unconstrained powf() doesn't vectorize well...
792 for (int i = 0; i < N; i++) {
793 float s = v[i];
Matt Sarett24107172016-12-19 14:33:35 -0500794 result[i] = (s <= p.fD) ? p.fC * s + p.fF
795 : powf(s * p.fA + p.fB, p.fG) + p.fE;
Mike Kleincfcf6242016-11-16 09:01:30 -0500796 }
raftias2979b1a2016-12-05 16:30:41 -0500797 // Clamp the output to [0, 1].
798 // Max(NaN, 0) = 0, but Max(0, NaN) = NaN, so we want this exact order to ensure NaN => 0
799 return SkNf::Min(SkNf::Max(SkNf::Load(result), 0.0f), 1.0f);
Mike Kleincfcf6242016-11-16 09:01:30 -0500800}
Mike Klein464e6a12017-01-04 11:04:01 -0500801STAGE_CTX(parametric_r, const SkColorSpaceTransferFn*) { r = parametric(r, *ctx); }
802STAGE_CTX(parametric_g, const SkColorSpaceTransferFn*) { g = parametric(g, *ctx); }
803STAGE_CTX(parametric_b, const SkColorSpaceTransferFn*) { b = parametric(b, *ctx); }
804STAGE_CTX(parametric_a, const SkColorSpaceTransferFn*) { a = parametric(a, *ctx); }
Mike Kleincfcf6242016-11-16 09:01:30 -0500805
Matt Sarettdb4d4062016-11-16 16:07:15 -0500806SI SkNf table(const SkNf& v, const SkTableTransferFn& table) {
807 float result[N];
Mike Kleincfcf6242016-11-16 09:01:30 -0500808 for (int i = 0; i < N; i++) {
Matt Sarettdb4d4062016-11-16 16:07:15 -0500809 result[i] = interp_lut(v[i], table.fData, table.fSize);
Mike Kleincfcf6242016-11-16 09:01:30 -0500810 }
raftias2979b1a2016-12-05 16:30:41 -0500811 // no need to clamp - tables are by-design [0,1] -> [0,1]
Mike Kleincfcf6242016-11-16 09:01:30 -0500812 return SkNf::Load(result);
813}
Mike Klein464e6a12017-01-04 11:04:01 -0500814STAGE_CTX(table_r, const SkTableTransferFn*) { r = table(r, *ctx); }
815STAGE_CTX(table_g, const SkTableTransferFn*) { g = table(g, *ctx); }
816STAGE_CTX(table_b, const SkTableTransferFn*) { b = table(b, *ctx); }
817STAGE_CTX(table_a, const SkTableTransferFn*) { a = table(a, *ctx); }
raftias25636012016-11-11 15:27:39 -0800818
Mike Klein464e6a12017-01-04 11:04:01 -0500819STAGE_CTX(color_lookup_table, const SkColorLookUpTable*) {
820 const SkColorLookUpTable* colorLUT = ctx;
raftias54761282016-12-01 13:44:07 -0500821 SkASSERT(3 == colorLUT->inputChannels() || 4 == colorLUT->inputChannels());
822 SkASSERT(3 == colorLUT->outputChannels());
raftias25636012016-11-11 15:27:39 -0800823 float result[3][N];
824 for (int i = 0; i < N; ++i) {
raftias54761282016-12-01 13:44:07 -0500825 const float in[4] = { r[i], g[i], b[i], a[i] };
826 float out[3];
827 colorLUT->interp(out, in);
828 for (int j = 0; j < colorLUT->outputChannels(); ++j) {
829 result[j][i] = out[j];
830 }
raftias25636012016-11-11 15:27:39 -0800831 }
832 r = SkNf::Load(result[0]);
833 g = SkNf::Load(result[1]);
834 b = SkNf::Load(result[2]);
raftias54761282016-12-01 13:44:07 -0500835 if (4 == colorLUT->inputChannels()) {
836 // we must set the pixel to opaque, as the alpha channel was used
837 // as input before this.
838 a = 1.f;
839 }
raftias25636012016-11-11 15:27:39 -0800840}
841
Mike Klein2cbc33d2016-11-28 16:30:30 -0500842STAGE(lab_to_xyz) {
raftias25636012016-11-11 15:27:39 -0800843 const auto lab_l = r * 100.0f;
844 const auto lab_a = g * 255.0f - 128.0f;
845 const auto lab_b = b * 255.0f - 128.0f;
846 auto Y = (lab_l + 16.0f) * (1/116.0f);
847 auto X = lab_a * (1/500.0f) + Y;
848 auto Z = Y - (lab_b * (1/200.0f));
849
850 const auto X3 = X*X*X;
851 X = (X3 > 0.008856f).thenElse(X3, (X - (16/116.0f)) * (1/7.787f));
852 const auto Y3 = Y*Y*Y;
853 Y = (Y3 > 0.008856f).thenElse(Y3, (Y - (16/116.0f)) * (1/7.787f));
854 const auto Z3 = Z*Z*Z;
855 Z = (Z3 > 0.008856f).thenElse(Z3, (Z - (16/116.0f)) * (1/7.787f));
856
857 // adjust to D50 illuminant
858 X *= 0.96422f;
859 Y *= 1.00000f;
860 Z *= 0.82521f;
861
862 r = X;
863 g = Y;
864 b = Z;
865}
866
Mike Kleinb273fc42016-11-17 15:42:22 -0500867SI SkNf assert_in_tile(const SkNf& v, float limit) {
868 for (int i = 0; i < N; i++) {
869 SkASSERT(0 <= v[i] && v[i] < limit);
870 }
871 return v;
Mike Klein06a65e22016-11-17 12:39:09 -0500872}
Mike Kleinb273fc42016-11-17 15:42:22 -0500873
874SI SkNf clamp(const SkNf& v, float limit) {
875 SkNf result = SkNf::Max(0, SkNf::Min(v, limit - 0.5f));
876 return assert_in_tile(result, limit);
Mike Klein06a65e22016-11-17 12:39:09 -0500877}
Mike Kleinb273fc42016-11-17 15:42:22 -0500878SI SkNf repeat(const SkNf& v, float limit) {
879 SkNf result = v - (v/limit).floor()*limit;
Mike Kleinb273fc42016-11-17 15:42:22 -0500880 // For small negative v, (v/limit).floor()*limit can dominate v in the subtraction,
881 // which leaves result == limit. We want result < limit, so clamp it one ULP.
882 result = SkNf::Min(result, nextafterf(limit, 0));
Mike Kleinb273fc42016-11-17 15:42:22 -0500883 return assert_in_tile(result, limit);
884}
Mike Klein2e35e8a2016-11-18 15:47:22 -0500885SI SkNf mirror(const SkNf& v, float l/*imit*/) {
886 SkNf result = ((v - l) - ((v - l) / (2*l)).floor()*(2*l) - l).abs();
887 // Same deal as repeat.
888 result = SkNf::Min(result, nextafterf(l, 0));
889 return assert_in_tile(result, l);
890}
Mike Klein464e6a12017-01-04 11:04:01 -0500891STAGE_CTX( clamp_x, const float*) { r = clamp (r, *ctx); }
892STAGE_CTX(repeat_x, const float*) { r = repeat(r, *ctx); }
893STAGE_CTX(mirror_x, const float*) { r = mirror(r, *ctx); }
894STAGE_CTX( clamp_y, const float*) { g = clamp (g, *ctx); }
895STAGE_CTX(repeat_y, const float*) { g = repeat(g, *ctx); }
896STAGE_CTX(mirror_y, const float*) { g = mirror(g, *ctx); }
Mike Klein06a65e22016-11-17 12:39:09 -0500897
Mike Klein464e6a12017-01-04 11:04:01 -0500898STAGE_CTX(save_xy, SkImageShaderContext*) {
899 r.store(ctx->x);
900 g.store(ctx->y);
Mike Klein46e66a22016-11-21 16:19:34 -0500901
Mike Kleinb0b17d12016-12-09 16:25:44 -0500902 // Whether bilinear or bicubic, all sample points have the same fractional offset (fx,fy).
903 // They're either the 4 corners of a logical 1x1 pixel or the 16 corners of a 3x3 grid
904 // surrounding (x,y), all (0.5,0.5) off-center.
Mike Klein886cf532016-12-06 11:31:25 -0500905 auto fract = [](const SkNf& v) { return v - v.floor(); };
Mike Klein464e6a12017-01-04 11:04:01 -0500906 fract(r + 0.5f).store(ctx->fx);
907 fract(g + 0.5f).store(ctx->fy);
Mike Klein886cf532016-12-06 11:31:25 -0500908}
Mike Klein46e66a22016-11-21 16:19:34 -0500909
Mike Klein464e6a12017-01-04 11:04:01 -0500910STAGE_CTX(accumulate, const SkImageShaderContext*) {
Mike Kleinb0b17d12016-12-09 16:25:44 -0500911 // Bilinear and bicubic filtering are both separable, so we'll end up with independent
912 // scale contributions in x and y that we multiply together to get each pixel's scale factor.
Mike Klein464e6a12017-01-04 11:04:01 -0500913 auto scale = SkNf::Load(ctx->scalex) * SkNf::Load(ctx->scaley);
Mike Klein87185f72016-12-01 18:22:26 -0500914 dr = SkNf_fma(scale, r, dr);
915 dg = SkNf_fma(scale, g, dg);
916 db = SkNf_fma(scale, b, db);
917 da = SkNf_fma(scale, a, da);
Mike Kleinb04c3522016-11-28 11:55:58 -0500918}
919
Mike Kleinb0b17d12016-12-09 16:25:44 -0500920// In bilinear interpolation, the 4 pixels at +/- 0.5 offsets from the sample pixel center
921// are combined in direct proportion to their area overlapping that logical query pixel.
922// At positive offsets, the x-axis contribution to that rectangular area is fx; (1-fx)
923// at negative x offsets. The y-axis is treated symmetrically.
924template <int Scale>
Mike Klein464e6a12017-01-04 11:04:01 -0500925SI void bilinear_x(SkImageShaderContext* ctx, SkNf* x) {
926 *x = SkNf::Load(ctx->x) + Scale*0.5f;
927 auto fx = SkNf::Load(ctx->fx);
928 (Scale > 0 ? fx : (1.0f - fx)).store(ctx->scalex);
Mike Kleinb0b17d12016-12-09 16:25:44 -0500929}
930template <int Scale>
Mike Klein464e6a12017-01-04 11:04:01 -0500931SI void bilinear_y(SkImageShaderContext* ctx, SkNf* y) {
932 *y = SkNf::Load(ctx->y) + Scale*0.5f;
933 auto fy = SkNf::Load(ctx->fy);
934 (Scale > 0 ? fy : (1.0f - fy)).store(ctx->scaley);
Mike Kleinb0b17d12016-12-09 16:25:44 -0500935}
Mike Klein464e6a12017-01-04 11:04:01 -0500936STAGE_CTX(bilinear_nx, SkImageShaderContext*) { bilinear_x<-1>(ctx, &r); }
937STAGE_CTX(bilinear_px, SkImageShaderContext*) { bilinear_x<+1>(ctx, &r); }
938STAGE_CTX(bilinear_ny, SkImageShaderContext*) { bilinear_y<-1>(ctx, &g); }
939STAGE_CTX(bilinear_py, SkImageShaderContext*) { bilinear_y<+1>(ctx, &g); }
Mike Kleinb0b17d12016-12-09 16:25:44 -0500940
941
942// In bilinear interpolation, the 16 pixels at +/- 0.5 and +/- 1.5 offsets from the sample
943// pixel center are combined with a non-uniform cubic filter, with high filter values near
944// the center and lower values farther away.
945//
946// We break this filter function into two parts, one for near +/- 0.5 offsets,
947// and one for far +/- 1.5 offsets.
948//
949// See GrBicubicEffect for details about this particular Mitchell-Netravali filter.
950SI SkNf bicubic_near(const SkNf& t) {
951 // 1/18 + 9/18t + 27/18t^2 - 21/18t^3 == t ( t ( -21/18t + 27/18) + 9/18) + 1/18
952 return SkNf_fma(t, SkNf_fma(t, SkNf_fma(-21/18.0f, t, 27/18.0f), 9/18.0f), 1/18.0f);
953}
954SI SkNf bicubic_far(const SkNf& t) {
955 // 0/18 + 0/18*t - 6/18t^2 + 7/18t^3 == t^2 (7/18t - 6/18)
956 return (t*t)*SkNf_fma(7/18.0f, t, -6/18.0f);
957}
958
959template <int Scale>
Mike Klein464e6a12017-01-04 11:04:01 -0500960SI void bicubic_x(SkImageShaderContext* ctx, SkNf* x) {
961 *x = SkNf::Load(ctx->x) + Scale*0.5f;
962 auto fx = SkNf::Load(ctx->fx);
963 if (Scale == -3) { return bicubic_far (1.0f - fx).store(ctx->scalex); }
964 if (Scale == -1) { return bicubic_near(1.0f - fx).store(ctx->scalex); }
965 if (Scale == +1) { return bicubic_near( fx).store(ctx->scalex); }
966 if (Scale == +3) { return bicubic_far ( fx).store(ctx->scalex); }
Mike Kleinb0b17d12016-12-09 16:25:44 -0500967 SkDEBUGFAIL("unreachable");
968}
969template <int Scale>
Mike Klein464e6a12017-01-04 11:04:01 -0500970SI void bicubic_y(SkImageShaderContext* ctx, SkNf* y) {
971 *y = SkNf::Load(ctx->y) + Scale*0.5f;
972 auto fy = SkNf::Load(ctx->fy);
973 if (Scale == -3) { return bicubic_far (1.0f - fy).store(ctx->scaley); }
974 if (Scale == -1) { return bicubic_near(1.0f - fy).store(ctx->scaley); }
975 if (Scale == +1) { return bicubic_near( fy).store(ctx->scaley); }
976 if (Scale == +3) { return bicubic_far ( fy).store(ctx->scaley); }
Mike Kleinb0b17d12016-12-09 16:25:44 -0500977 SkDEBUGFAIL("unreachable");
978}
Mike Klein464e6a12017-01-04 11:04:01 -0500979STAGE_CTX(bicubic_n3x, SkImageShaderContext*) { bicubic_x<-3>(ctx, &r); }
980STAGE_CTX(bicubic_n1x, SkImageShaderContext*) { bicubic_x<-1>(ctx, &r); }
981STAGE_CTX(bicubic_p1x, SkImageShaderContext*) { bicubic_x<+1>(ctx, &r); }
982STAGE_CTX(bicubic_p3x, SkImageShaderContext*) { bicubic_x<+3>(ctx, &r); }
Mike Kleinb0b17d12016-12-09 16:25:44 -0500983
Mike Klein464e6a12017-01-04 11:04:01 -0500984STAGE_CTX(bicubic_n3y, SkImageShaderContext*) { bicubic_y<-3>(ctx, &g); }
985STAGE_CTX(bicubic_n1y, SkImageShaderContext*) { bicubic_y<-1>(ctx, &g); }
986STAGE_CTX(bicubic_p1y, SkImageShaderContext*) { bicubic_y<+1>(ctx, &g); }
987STAGE_CTX(bicubic_p3y, SkImageShaderContext*) { bicubic_y<+3>(ctx, &g); }
Mike Kleinb0b17d12016-12-09 16:25:44 -0500988
989
Mike Kleincb2c12b2016-11-22 13:22:48 -0500990template <typename T>
Mike Klein464e6a12017-01-04 11:04:01 -0500991SI SkNi offset_and_ptr(T** ptr, const SkImageShaderContext* ctx, const SkNf& x, const SkNf& y) {
Mike Kleincb2c12b2016-11-22 13:22:48 -0500992 SkNi ix = SkNx_cast<int>(x),
993 iy = SkNx_cast<int>(y);
Mike Klein464e6a12017-01-04 11:04:01 -0500994 SkNi offset = iy*ctx->stride + ix;
Mike Klein06a65e22016-11-17 12:39:09 -0500995
Mike Klein464e6a12017-01-04 11:04:01 -0500996 *ptr = (const T*)ctx->pixels;
Mike Kleincb2c12b2016-11-22 13:22:48 -0500997 return offset;
998}
999
Mike Klein464e6a12017-01-04 11:04:01 -05001000STAGE_CTX(gather_a8, const SkImageShaderContext*) {
Mike Klein7a14734d2016-11-29 15:33:39 -05001001 const uint8_t* p;
1002 SkNi offset = offset_and_ptr(&p, ctx, r, g);
1003
1004 r = g = b = 0.0f;
Mike Kleine2e2ae22016-12-02 15:21:03 -05001005 a = SkNf_from_byte(gather(tail, p, offset));
Mike Klein7a14734d2016-11-29 15:33:39 -05001006}
Mike Klein464e6a12017-01-04 11:04:01 -05001007STAGE_CTX(gather_i8, const SkImageShaderContext*) {
Mike Kleinf7657e92016-11-29 12:57:22 -05001008 const uint8_t* p;
Mike Klein464e6a12017-01-04 11:04:01 -05001009 SkNi offset = offset_and_ptr(&p, ctx, r, g);
Mike Kleinf7657e92016-11-29 12:57:22 -05001010
1011 SkNi ix = SkNx_cast<int>(gather(tail, p, offset));
Mike Klein464e6a12017-01-04 11:04:01 -05001012 from_8888(gather(tail, ctx->ctable->readColors(), ix), &r, &g, &b, &a);
Mike Kleinf7657e92016-11-29 12:57:22 -05001013}
Mike Klein464e6a12017-01-04 11:04:01 -05001014STAGE_CTX(gather_g8, const SkImageShaderContext*) {
Mike Klein6b77f1c2016-11-22 15:50:12 -05001015 const uint8_t* p;
1016 SkNi offset = offset_and_ptr(&p, ctx, r, g);
1017
Mike Kleine2e2ae22016-12-02 15:21:03 -05001018 r = g = b = SkNf_from_byte(gather(tail, p, offset));
Mike Kleinb04c3522016-11-28 11:55:58 -05001019 a = 1.0f;
Mike Klein6b77f1c2016-11-22 15:50:12 -05001020}
Mike Klein464e6a12017-01-04 11:04:01 -05001021STAGE_CTX(gather_565, const SkImageShaderContext*) {
Mike Kleincb2c12b2016-11-22 13:22:48 -05001022 const uint16_t* p;
1023 SkNi offset = offset_and_ptr(&p, ctx, r, g);
1024
Mike Klein56b50792016-11-29 08:14:49 -05001025 from_565(gather(tail, p, offset), &r, &g, &b);
Mike Kleinb04c3522016-11-28 11:55:58 -05001026 a = 1.0f;
Mike Kleincb2c12b2016-11-22 13:22:48 -05001027}
Mike Klein464e6a12017-01-04 11:04:01 -05001028STAGE_CTX(gather_4444, const SkImageShaderContext*) {
Mike Kleincb5338c2016-11-22 14:58:45 -05001029 const uint16_t* p;
1030 SkNi offset = offset_and_ptr(&p, ctx, r, g);
1031
Mike Klein56b50792016-11-29 08:14:49 -05001032 from_4444(gather(tail, p, offset), &r, &g, &b, &a);
Mike Kleincb5338c2016-11-22 14:58:45 -05001033}
Mike Klein464e6a12017-01-04 11:04:01 -05001034STAGE_CTX(gather_8888, const SkImageShaderContext*) {
Mike Kleincb5338c2016-11-22 14:58:45 -05001035 const uint32_t* p;
1036 SkNi offset = offset_and_ptr(&p, ctx, r, g);
1037
Mike Klein56b50792016-11-29 08:14:49 -05001038 from_8888(gather(tail, p, offset), &r, &g, &b, &a);
Mike Kleincb5338c2016-11-22 14:58:45 -05001039}
Mike Klein464e6a12017-01-04 11:04:01 -05001040STAGE_CTX(gather_f16, const SkImageShaderContext*) {
Mike Kleincb2c12b2016-11-22 13:22:48 -05001041 const uint64_t* p;
1042 SkNi offset = offset_and_ptr(&p, ctx, r, g);
1043
Mike Klein49580062016-12-11 11:42:07 -05001044 auto px = gather(tail, p, offset);
1045 from_f16(&px, &r, &g, &b, &a);
Mike Kleincb2c12b2016-11-22 13:22:48 -05001046}
1047
Mike Klein06a65e22016-11-17 12:39:09 -05001048
Mike Kleinaebfb452016-10-25 10:27:33 -04001049SI Fn enum_to_Fn(SkRasterPipeline::StockStage st) {
1050 switch (st) {
1051 #define M(stage) case SkRasterPipeline::stage: return stage;
1052 SK_RASTER_PIPELINE_STAGES(M)
1053 #undef M
1054 }
1055 SkASSERT(false);
1056 return just_return;
1057}
Mike Klein9161ef02016-10-04 14:03:27 -04001058
Mike Klein0c324962016-12-01 14:05:38 -05001059namespace {
Mike Klein464e6a12017-01-04 11:04:01 -05001060
Mike Kleina2d25ec2017-01-05 15:03:53 -05001061 static void build_program(void** program, const SkRasterPipeline::Stage* stages, int nstages) {
1062 for (int i = 0; i < nstages; i++) {
1063 *program++ = (void*)enum_to_Fn(stages[i].stage);
1064 if (stages[i].ctx) {
1065 *program++ = stages[i].ctx;
1066 }
1067 }
1068 *program++ = (void*)just_return;
1069 }
1070
1071 static void run_program(void** program, size_t x, size_t y, size_t n) {
1072 float dx[] = { 0,1,2,3,4,5,6,7 };
1073 SkNf X = SkNf(x) + SkNf::Load(dx) + 0.5f,
1074 Y = SkNf(y) + 0.5f,
1075 _0 = SkNf(0),
1076 _1 = SkNf(1);
1077
1078 auto start = (Fn)load_and_increment(&program);
1079 while (n >= N) {
1080 start(x*N, program, X,Y,_1,_0, _0,_0,_0,_0);
1081 X += (float)N;
1082 x += N;
1083 n -= N;
1084 }
1085 if (n) {
1086 start(x*N+n, program, X,Y,_1,_0, _0,_0,_0,_0);
1087 }
1088 }
1089
Mike Klein464e6a12017-01-04 11:04:01 -05001090 // Compiled manages its memory manually because it's not safe to use
1091 // std::vector, SkTDArray, etc without setting us up for big ODR violations.
Mike Klein0c324962016-12-01 14:05:38 -05001092 struct Compiled {
Mike Klein464e6a12017-01-04 11:04:01 -05001093 Compiled(const SkRasterPipeline::Stage* stages, int nstages) {
1094 int slots = nstages + 1; // One extra for just_return.
1095 for (int i = 0; i < nstages; i++) {
1096 if (stages[i].ctx) {
1097 slots++;
1098 }
Mike Klein0c324962016-12-01 14:05:38 -05001099 }
Mike Klein464e6a12017-01-04 11:04:01 -05001100 fProgram = (void**)sk_malloc_throw(slots * sizeof(void*));
Mike Kleina2d25ec2017-01-05 15:03:53 -05001101 build_program(fProgram, stages, nstages);
Mike Klein464e6a12017-01-04 11:04:01 -05001102 }
1103 ~Compiled() { sk_free(fProgram); }
1104
1105 Compiled(const Compiled& o) {
1106 int slots = 0;
1107 while (o.fProgram[slots++] != (void*)just_return);
1108
1109 fProgram = (void**)sk_malloc_throw(slots * sizeof(void*));
1110 memcpy(fProgram, o.fProgram, slots * sizeof(void*));
Mike Klein0c324962016-12-01 14:05:38 -05001111 }
1112
1113 void operator()(size_t x, size_t y, size_t n) {
Mike Kleina2d25ec2017-01-05 15:03:53 -05001114 run_program(fProgram, x, y, n);
Mike Klein0c324962016-12-01 14:05:38 -05001115 }
1116
Mike Klein464e6a12017-01-04 11:04:01 -05001117 void** fProgram;
Mike Klein0c324962016-12-01 14:05:38 -05001118 };
1119}
1120
Mike Kleinbaaf8ad2016-09-29 09:04:15 -04001121namespace SK_OPTS_NS {
1122
Mike Kleinaf49b192016-11-15 08:52:04 -05001123 SI std::function<void(size_t, size_t, size_t)>
1124 compile_pipeline(const SkRasterPipeline::Stage* stages, int nstages) {
Mike Klein0c324962016-12-01 14:05:38 -05001125 return Compiled{stages,nstages};
Mike Kleinbaaf8ad2016-09-29 09:04:15 -04001126 }
1127
Mike Kleinc789b612016-11-30 13:45:06 -05001128 SI void run_pipeline(size_t x, size_t y, size_t n,
1129 const SkRasterPipeline::Stage* stages, int nstages) {
Mike Kleina2d25ec2017-01-05 15:03:53 -05001130 static const int kStackMax = 256;
1131 // Worst case is nstages stages with nstages context pointers, and just_return.
1132 if (2*nstages+1 <= kStackMax) {
1133 void* program[kStackMax];
1134 build_program(program, stages, nstages);
1135 run_program(program, x,y,n);
1136 } else {
1137 Compiled{stages,nstages}(x,y,n);
1138 }
Mike Kleinc789b612016-11-30 13:45:06 -05001139 }
1140
Mike Kleinaebfb452016-10-25 10:27:33 -04001141} // namespace SK_OPTS_NS
Mike Kleinbaaf8ad2016-09-29 09:04:15 -04001142
Mike Klein04adfda2016-10-12 09:52:55 -04001143#undef SI
1144#undef STAGE
Mike Klein464e6a12017-01-04 11:04:01 -05001145#undef STAGE_CTX
Mike Klein04adfda2016-10-12 09:52:55 -04001146#undef RGBA_XFERMODE
1147#undef RGB_XFERMODE
Mike Klein9161ef02016-10-04 14:03:27 -04001148
Mike Kleinbaaf8ad2016-09-29 09:04:15 -04001149#endif//SkRasterPipeline_opts_DEFINED