1 /* 2 * Copyright 2015 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 SkNx_DEFINED 9 #define SkNx_DEFINED 10 11 #include "include/core/SkScalar.h" 12 #include "include/core/SkTypes.h" 13 #include "include/private/SkSafe_math.h" 14 15 #include <algorithm> 16 #include <limits> 17 #include <type_traits> 18 19 // Every single SkNx method wants to be fully inlined. (We know better than MSVC). 20 #define AI SK_ALWAYS_INLINE 21 22 namespace { // NOLINT(google-build-namespaces) 23 24 // The default SkNx<N,T> just proxies down to a pair of SkNx<N/2, T>. 25 template <int N, typename T> 26 struct SkNx { 27 typedef SkNx<N/2, T> Half; 28 29 Half fLo, fHi; 30 31 AI SkNx() = default; SkNxSkNx32 AI SkNx(const Half& lo, const Half& hi) : fLo(lo), fHi(hi) {} 33 SkNxSkNx34 AI SkNx(T v) : fLo(v), fHi(v) {} 35 SkNxSkNx36 AI SkNx(T a, T b) : fLo(a) , fHi(b) { static_assert(N==2, ""); } SkNxSkNx37 AI SkNx(T a, T b, T c, T d) : fLo(a,b), fHi(c,d) { static_assert(N==4, ""); } SkNxSkNx38 AI SkNx(T a, T b, T c, T d, T e, T f, T g, T h) : fLo(a,b,c,d), fHi(e,f,g,h) { 39 static_assert(N==8, ""); 40 } SkNxSkNx41 AI SkNx(T a, T b, T c, T d, T e, T f, T g, T h, 42 T i, T j, T k, T l, T m, T n, T o, T p) 43 : fLo(a,b,c,d, e,f,g,h), fHi(i,j,k,l, m,n,o,p) { 44 static_assert(N==16, ""); 45 } 46 47 AI T operator[](int k) const { 48 SkASSERT(0 <= k && k < N); 49 return k < N/2 ? fLo[k] : fHi[k-N/2]; 50 } 51 LoadSkNx52 AI static SkNx Load(const void* vptr) { 53 auto ptr = (const char*)vptr; 54 return { Half::Load(ptr), Half::Load(ptr + N/2*sizeof(T)) }; 55 } storeSkNx56 AI void store(void* vptr) const { 57 auto ptr = (char*)vptr; 58 fLo.store(ptr); 59 fHi.store(ptr + N/2*sizeof(T)); 60 } 61 Load4SkNx62 AI static void Load4(const void* vptr, SkNx* a, SkNx* b, SkNx* c, SkNx* d) { 63 auto ptr = (const char*)vptr; 64 Half al, bl, cl, dl, 65 ah, bh, ch, dh; 66 Half::Load4(ptr , &al, &bl, &cl, &dl); 67 Half::Load4(ptr + 4*N/2*sizeof(T), &ah, &bh, &ch, &dh); 68 *a = SkNx{al, ah}; 69 *b = SkNx{bl, bh}; 70 *c = SkNx{cl, ch}; 71 *d = SkNx{dl, dh}; 72 } Load3SkNx73 AI static void Load3(const void* vptr, SkNx* a, SkNx* b, SkNx* c) { 74 auto ptr = (const char*)vptr; 75 Half al, bl, cl, 76 ah, bh, ch; 77 Half::Load3(ptr , &al, &bl, &cl); 78 Half::Load3(ptr + 3*N/2*sizeof(T), &ah, &bh, &ch); 79 *a = SkNx{al, ah}; 80 *b = SkNx{bl, bh}; 81 *c = SkNx{cl, ch}; 82 } Load2SkNx83 AI static void Load2(const void* vptr, SkNx* a, SkNx* b) { 84 auto ptr = (const char*)vptr; 85 Half al, bl, 86 ah, bh; 87 Half::Load2(ptr , &al, &bl); 88 Half::Load2(ptr + 2*N/2*sizeof(T), &ah, &bh); 89 *a = SkNx{al, ah}; 90 *b = SkNx{bl, bh}; 91 } Store4SkNx92 AI static void Store4(void* vptr, const SkNx& a, const SkNx& b, const SkNx& c, const SkNx& d) { 93 auto ptr = (char*)vptr; 94 Half::Store4(ptr, a.fLo, b.fLo, c.fLo, d.fLo); 95 Half::Store4(ptr + 4*N/2*sizeof(T), a.fHi, b.fHi, c.fHi, d.fHi); 96 } Store3SkNx97 AI static void Store3(void* vptr, const SkNx& a, const SkNx& b, const SkNx& c) { 98 auto ptr = (char*)vptr; 99 Half::Store3(ptr, a.fLo, b.fLo, c.fLo); 100 Half::Store3(ptr + 3*N/2*sizeof(T), a.fHi, b.fHi, c.fHi); 101 } Store2SkNx102 AI static void Store2(void* vptr, const SkNx& a, const SkNx& b) { 103 auto ptr = (char*)vptr; 104 Half::Store2(ptr, a.fLo, b.fLo); 105 Half::Store2(ptr + 2*N/2*sizeof(T), a.fHi, b.fHi); 106 } 107 minSkNx108 AI T min() const { return std::min(fLo.min(), fHi.min()); } maxSkNx109 AI T max() const { return std::max(fLo.max(), fHi.max()); } anyTrueSkNx110 AI bool anyTrue() const { return fLo.anyTrue() || fHi.anyTrue(); } allTrueSkNx111 AI bool allTrue() const { return fLo.allTrue() && fHi.allTrue(); } 112 absSkNx113 AI SkNx abs() const { return { fLo. abs(), fHi. abs() }; } sqrtSkNx114 AI SkNx sqrt() const { return { fLo. sqrt(), fHi. sqrt() }; } floorSkNx115 AI SkNx floor() const { return { fLo. floor(), fHi. floor() }; } 116 117 AI SkNx operator!() const { return { !fLo, !fHi }; } 118 AI SkNx operator-() const { return { -fLo, -fHi }; } 119 AI SkNx operator~() const { return { ~fLo, ~fHi }; } 120 121 AI SkNx operator<<(int bits) const { return { fLo << bits, fHi << bits }; } 122 AI SkNx operator>>(int bits) const { return { fLo >> bits, fHi >> bits }; } 123 124 AI SkNx operator+(const SkNx& y) const { return { fLo + y.fLo, fHi + y.fHi }; } 125 AI SkNx operator-(const SkNx& y) const { return { fLo - y.fLo, fHi - y.fHi }; } 126 AI SkNx operator*(const SkNx& y) const { return { fLo * y.fLo, fHi * y.fHi }; } 127 AI SkNx operator/(const SkNx& y) const { return { fLo / y.fLo, fHi / y.fHi }; } 128 129 AI SkNx operator&(const SkNx& y) const { return { fLo & y.fLo, fHi & y.fHi }; } 130 AI SkNx operator|(const SkNx& y) const { return { fLo | y.fLo, fHi | y.fHi }; } 131 AI SkNx operator^(const SkNx& y) const { return { fLo ^ y.fLo, fHi ^ y.fHi }; } 132 133 AI SkNx operator==(const SkNx& y) const { return { fLo == y.fLo, fHi == y.fHi }; } 134 AI SkNx operator!=(const SkNx& y) const { return { fLo != y.fLo, fHi != y.fHi }; } 135 AI SkNx operator<=(const SkNx& y) const { return { fLo <= y.fLo, fHi <= y.fHi }; } 136 AI SkNx operator>=(const SkNx& y) const { return { fLo >= y.fLo, fHi >= y.fHi }; } 137 AI SkNx operator< (const SkNx& y) const { return { fLo < y.fLo, fHi < y.fHi }; } 138 AI SkNx operator> (const SkNx& y) const { return { fLo > y.fLo, fHi > y.fHi }; } 139 saturatedAddSkNx140 AI SkNx saturatedAdd(const SkNx& y) const { 141 return { fLo.saturatedAdd(y.fLo), fHi.saturatedAdd(y.fHi) }; 142 } 143 mulHiSkNx144 AI SkNx mulHi(const SkNx& m) const { 145 return { fLo.mulHi(m.fLo), fHi.mulHi(m.fHi) }; 146 } thenElseSkNx147 AI SkNx thenElse(const SkNx& t, const SkNx& e) const { 148 return { fLo.thenElse(t.fLo, e.fLo), fHi.thenElse(t.fHi, e.fHi) }; 149 } MinSkNx150 AI static SkNx Min(const SkNx& x, const SkNx& y) { 151 return { Half::Min(x.fLo, y.fLo), Half::Min(x.fHi, y.fHi) }; 152 } MaxSkNx153 AI static SkNx Max(const SkNx& x, const SkNx& y) { 154 return { Half::Max(x.fLo, y.fLo), Half::Max(x.fHi, y.fHi) }; 155 } 156 }; 157 158 // The N -> N/2 recursion bottoms out at N == 1, a scalar value. 159 template <typename T> 160 struct SkNx<1,T> { 161 T fVal; 162 163 AI SkNx() = default; 164 AI SkNx(T v) : fVal(v) {} 165 166 // Android complains against unused parameters, so we guard it 167 AI T operator[](int SkDEBUGCODE(k)) const { 168 SkASSERT(k == 0); 169 return fVal; 170 } 171 172 AI static SkNx Load(const void* ptr) { 173 SkNx v; 174 memcpy(&v, ptr, sizeof(T)); 175 return v; 176 } 177 AI void store(void* ptr) const { memcpy(ptr, &fVal, sizeof(T)); } 178 179 AI static void Load4(const void* vptr, SkNx* a, SkNx* b, SkNx* c, SkNx* d) { 180 auto ptr = (const char*)vptr; 181 *a = Load(ptr + 0*sizeof(T)); 182 *b = Load(ptr + 1*sizeof(T)); 183 *c = Load(ptr + 2*sizeof(T)); 184 *d = Load(ptr + 3*sizeof(T)); 185 } 186 AI static void Load3(const void* vptr, SkNx* a, SkNx* b, SkNx* c) { 187 auto ptr = (const char*)vptr; 188 *a = Load(ptr + 0*sizeof(T)); 189 *b = Load(ptr + 1*sizeof(T)); 190 *c = Load(ptr + 2*sizeof(T)); 191 } 192 AI static void Load2(const void* vptr, SkNx* a, SkNx* b) { 193 auto ptr = (const char*)vptr; 194 *a = Load(ptr + 0*sizeof(T)); 195 *b = Load(ptr + 1*sizeof(T)); 196 } 197 AI static void Store4(void* vptr, const SkNx& a, const SkNx& b, const SkNx& c, const SkNx& d) { 198 auto ptr = (char*)vptr; 199 a.store(ptr + 0*sizeof(T)); 200 b.store(ptr + 1*sizeof(T)); 201 c.store(ptr + 2*sizeof(T)); 202 d.store(ptr + 3*sizeof(T)); 203 } 204 AI static void Store3(void* vptr, const SkNx& a, const SkNx& b, const SkNx& c) { 205 auto ptr = (char*)vptr; 206 a.store(ptr + 0*sizeof(T)); 207 b.store(ptr + 1*sizeof(T)); 208 c.store(ptr + 2*sizeof(T)); 209 } 210 AI static void Store2(void* vptr, const SkNx& a, const SkNx& b) { 211 auto ptr = (char*)vptr; 212 a.store(ptr + 0*sizeof(T)); 213 b.store(ptr + 1*sizeof(T)); 214 } 215 216 AI T min() const { return fVal; } 217 AI T max() const { return fVal; } 218 AI bool anyTrue() const { return fVal != 0; } 219 AI bool allTrue() const { return fVal != 0; } 220 221 AI SkNx abs() const { return Abs(fVal); } 222 AI SkNx sqrt() const { return Sqrt(fVal); } 223 AI SkNx floor() const { return Floor(fVal); } 224 225 AI SkNx operator!() const { return !fVal; } 226 AI SkNx operator-() const { return -fVal; } 227 AI SkNx operator~() const { return FromBits(~ToBits(fVal)); } 228 229 AI SkNx operator<<(int bits) const { return fVal << bits; } 230 AI SkNx operator>>(int bits) const { return fVal >> bits; } 231 232 AI SkNx operator+(const SkNx& y) const { return fVal + y.fVal; } 233 AI SkNx operator-(const SkNx& y) const { return fVal - y.fVal; } 234 AI SkNx operator*(const SkNx& y) const { return fVal * y.fVal; } 235 AI SkNx operator/(const SkNx& y) const { return fVal / y.fVal; } 236 237 AI SkNx operator&(const SkNx& y) const { return FromBits(ToBits(fVal) & ToBits(y.fVal)); } 238 AI SkNx operator|(const SkNx& y) const { return FromBits(ToBits(fVal) | ToBits(y.fVal)); } 239 AI SkNx operator^(const SkNx& y) const { return FromBits(ToBits(fVal) ^ ToBits(y.fVal)); } 240 241 AI SkNx operator==(const SkNx& y) const { return FromBits(fVal == y.fVal ? ~0 : 0); } 242 AI SkNx operator!=(const SkNx& y) const { return FromBits(fVal != y.fVal ? ~0 : 0); } 243 AI SkNx operator<=(const SkNx& y) const { return FromBits(fVal <= y.fVal ? ~0 : 0); } 244 AI SkNx operator>=(const SkNx& y) const { return FromBits(fVal >= y.fVal ? ~0 : 0); } 245 AI SkNx operator< (const SkNx& y) const { return FromBits(fVal < y.fVal ? ~0 : 0); } 246 AI SkNx operator> (const SkNx& y) const { return FromBits(fVal > y.fVal ? ~0 : 0); } 247 248 AI static SkNx Min(const SkNx& x, const SkNx& y) { return x.fVal < y.fVal ? x : y; } 249 AI static SkNx Max(const SkNx& x, const SkNx& y) { return x.fVal > y.fVal ? x : y; } 250 251 AI SkNx saturatedAdd(const SkNx& y) const { 252 static_assert(std::is_unsigned<T>::value, ""); 253 T sum = fVal + y.fVal; 254 return sum < fVal ? std::numeric_limits<T>::max() : sum; 255 } 256 257 AI SkNx mulHi(const SkNx& m) const { 258 static_assert(std::is_unsigned<T>::value, ""); 259 static_assert(sizeof(T) <= 4, ""); 260 return static_cast<T>((static_cast<uint64_t>(fVal) * m.fVal) >> (sizeof(T)*8)); 261 } 262 263 AI SkNx thenElse(const SkNx& t, const SkNx& e) const { return fVal != 0 ? t : e; } 264 265 private: 266 // Helper functions to choose the right float/double methods. (In <cmath> madness lies...) 267 AI static int Abs(int val) { return val < 0 ? -val : val; } 268 269 AI static float Abs(float val) { return ::fabsf(val); } 270 AI static float Sqrt(float val) { return ::sqrtf(val); } 271 AI static float Floor(float val) { return ::floorf(val); } 272 273 AI static double Abs(double val) { return ::fabs(val); } 274 AI static double Sqrt(double val) { return ::sqrt(val); } 275 AI static double Floor(double val) { return ::floor(val); } 276 277 // Helper functions for working with floats/doubles as bit patterns. 278 template <typename U> 279 AI static U ToBits(U v) { return v; } 280 AI static int32_t ToBits(float v) { int32_t bits; memcpy(&bits, &v, sizeof(v)); return bits; } 281 AI static int64_t ToBits(double v) { int64_t bits; memcpy(&bits, &v, sizeof(v)); return bits; } 282 283 template <typename Bits> 284 AI static T FromBits(Bits bits) { 285 static_assert(std::is_pod<T >::value && 286 std::is_pod<Bits>::value && 287 sizeof(T) <= sizeof(Bits), ""); 288 T val; 289 memcpy(&val, &bits, sizeof(T)); 290 return val; 291 } 292 }; 293 294 // Allow scalars on the left or right of binary operators, and things like +=, &=, etc. 295 #define V template <int N, typename T> AI static SkNx<N,T> 296 V operator+ (T x, const SkNx<N,T>& y) { return SkNx<N,T>(x) + y; } 297 V operator- (T x, const SkNx<N,T>& y) { return SkNx<N,T>(x) - y; } 298 V operator* (T x, const SkNx<N,T>& y) { return SkNx<N,T>(x) * y; } 299 V operator/ (T x, const SkNx<N,T>& y) { return SkNx<N,T>(x) / y; } 300 V operator& (T x, const SkNx<N,T>& y) { return SkNx<N,T>(x) & y; } 301 V operator| (T x, const SkNx<N,T>& y) { return SkNx<N,T>(x) | y; } 302 V operator^ (T x, const SkNx<N,T>& y) { return SkNx<N,T>(x) ^ y; } 303 V operator==(T x, const SkNx<N,T>& y) { return SkNx<N,T>(x) == y; } 304 V operator!=(T x, const SkNx<N,T>& y) { return SkNx<N,T>(x) != y; } 305 V operator<=(T x, const SkNx<N,T>& y) { return SkNx<N,T>(x) <= y; } 306 V operator>=(T x, const SkNx<N,T>& y) { return SkNx<N,T>(x) >= y; } 307 V operator< (T x, const SkNx<N,T>& y) { return SkNx<N,T>(x) < y; } 308 V operator> (T x, const SkNx<N,T>& y) { return SkNx<N,T>(x) > y; } 309 310 V operator+ (const SkNx<N,T>& x, T y) { return x + SkNx<N,T>(y); } 311 V operator- (const SkNx<N,T>& x, T y) { return x - SkNx<N,T>(y); } 312 V operator* (const SkNx<N,T>& x, T y) { return x * SkNx<N,T>(y); } 313 V operator/ (const SkNx<N,T>& x, T y) { return x / SkNx<N,T>(y); } 314 V operator& (const SkNx<N,T>& x, T y) { return x & SkNx<N,T>(y); } 315 V operator| (const SkNx<N,T>& x, T y) { return x | SkNx<N,T>(y); } 316 V operator^ (const SkNx<N,T>& x, T y) { return x ^ SkNx<N,T>(y); } 317 V operator==(const SkNx<N,T>& x, T y) { return x == SkNx<N,T>(y); } 318 V operator!=(const SkNx<N,T>& x, T y) { return x != SkNx<N,T>(y); } 319 V operator<=(const SkNx<N,T>& x, T y) { return x <= SkNx<N,T>(y); } 320 V operator>=(const SkNx<N,T>& x, T y) { return x >= SkNx<N,T>(y); } 321 V operator< (const SkNx<N,T>& x, T y) { return x < SkNx<N,T>(y); } 322 V operator> (const SkNx<N,T>& x, T y) { return x > SkNx<N,T>(y); } 323 324 V& operator<<=(SkNx<N,T>& x, int bits) { return (x = x << bits); } 325 V& operator>>=(SkNx<N,T>& x, int bits) { return (x = x >> bits); } 326 327 V& operator +=(SkNx<N,T>& x, const SkNx<N,T>& y) { return (x = x + y); } 328 V& operator -=(SkNx<N,T>& x, const SkNx<N,T>& y) { return (x = x - y); } 329 V& operator *=(SkNx<N,T>& x, const SkNx<N,T>& y) { return (x = x * y); } 330 V& operator /=(SkNx<N,T>& x, const SkNx<N,T>& y) { return (x = x / y); } 331 V& operator &=(SkNx<N,T>& x, const SkNx<N,T>& y) { return (x = x & y); } 332 V& operator |=(SkNx<N,T>& x, const SkNx<N,T>& y) { return (x = x | y); } 333 V& operator ^=(SkNx<N,T>& x, const SkNx<N,T>& y) { return (x = x ^ y); } 334 335 V& operator +=(SkNx<N,T>& x, T y) { return (x = x + SkNx<N,T>(y)); } 336 V& operator -=(SkNx<N,T>& x, T y) { return (x = x - SkNx<N,T>(y)); } 337 V& operator *=(SkNx<N,T>& x, T y) { return (x = x * SkNx<N,T>(y)); } 338 V& operator /=(SkNx<N,T>& x, T y) { return (x = x / SkNx<N,T>(y)); } 339 V& operator &=(SkNx<N,T>& x, T y) { return (x = x & SkNx<N,T>(y)); } 340 V& operator |=(SkNx<N,T>& x, T y) { return (x = x | SkNx<N,T>(y)); } 341 V& operator ^=(SkNx<N,T>& x, T y) { return (x = x ^ SkNx<N,T>(y)); } 342 #undef V 343 344 // SkNx<N,T> ~~> SkNx<N/2,T> + SkNx<N/2,T> 345 template <int N, typename T> 346 AI static void SkNx_split(const SkNx<N,T>& v, SkNx<N/2,T>* lo, SkNx<N/2,T>* hi) { 347 *lo = v.fLo; 348 *hi = v.fHi; 349 } 350 351 // SkNx<N/2,T> + SkNx<N/2,T> ~~> SkNx<N,T> 352 template <int N, typename T> 353 AI static SkNx<N*2,T> SkNx_join(const SkNx<N,T>& lo, const SkNx<N,T>& hi) { 354 return { lo, hi }; 355 } 356 357 // A very generic shuffle. Can reorder, duplicate, contract, expand... 358 // Sk4f v = { R,G,B,A }; 359 // SkNx_shuffle<2,1,0,3>(v) ~~> {B,G,R,A} 360 // SkNx_shuffle<2,1>(v) ~~> {B,G} 361 // SkNx_shuffle<2,1,2,1,2,1,2,1>(v) ~~> {B,G,B,G,B,G,B,G} 362 // SkNx_shuffle<3,3,3,3>(v) ~~> {A,A,A,A} 363 template <int... Ix, int N, typename T> 364 AI static SkNx<sizeof...(Ix),T> SkNx_shuffle(const SkNx<N,T>& v) { 365 return { v[Ix]... }; 366 } 367 368 // Cast from SkNx<N, Src> to SkNx<N, Dst>, as if you called static_cast<Dst>(Src). 369 template <typename Dst, typename Src, int N> 370 AI static SkNx<N,Dst> SkNx_cast(const SkNx<N,Src>& v) { 371 return { SkNx_cast<Dst>(v.fLo), SkNx_cast<Dst>(v.fHi) }; 372 } 373 template <typename Dst, typename Src> 374 AI static SkNx<1,Dst> SkNx_cast(const SkNx<1,Src>& v) { 375 return static_cast<Dst>(v.fVal); 376 } 377 378 template <int N, typename T> 379 AI static SkNx<N,T> SkNx_fma(const SkNx<N,T>& f, const SkNx<N,T>& m, const SkNx<N,T>& a) { 380 return f*m+a; 381 } 382 383 } // namespace 384 385 typedef SkNx<2, float> Sk2f; 386 typedef SkNx<4, float> Sk4f; 387 typedef SkNx<8, float> Sk8f; 388 typedef SkNx<16, float> Sk16f; 389 390 typedef SkNx<2, SkScalar> Sk2s; 391 typedef SkNx<4, SkScalar> Sk4s; 392 typedef SkNx<8, SkScalar> Sk8s; 393 typedef SkNx<16, SkScalar> Sk16s; 394 395 typedef SkNx<4, uint8_t> Sk4b; 396 typedef SkNx<8, uint8_t> Sk8b; 397 typedef SkNx<16, uint8_t> Sk16b; 398 399 typedef SkNx<4, uint16_t> Sk4h; 400 typedef SkNx<8, uint16_t> Sk8h; 401 typedef SkNx<16, uint16_t> Sk16h; 402 403 typedef SkNx<4, int32_t> Sk4i; 404 typedef SkNx<8, int32_t> Sk8i; 405 typedef SkNx<4, uint32_t> Sk4u; 406 407 // Include platform specific specializations if available. 408 #if !defined(SKNX_NO_SIMD) && SK_CPU_SSE_LEVEL >= SK_CPU_SSE_LEVEL_SSE2 409 #include "include/private/SkNx_sse.h" 410 #elif !defined(SKNX_NO_SIMD) && defined(SK_ARM_HAS_NEON) 411 #include "include/private/SkNx_neon.h" 412 #else 413 414 AI static Sk4i Sk4f_round(const Sk4f& x) { 415 return { (int) lrintf (x[0]), 416 (int) lrintf (x[1]), 417 (int) lrintf (x[2]), 418 (int) lrintf (x[3]), }; 419 } 420 421 #endif 422 423 AI static void Sk4f_ToBytes(uint8_t p[16], 424 const Sk4f& a, const Sk4f& b, const Sk4f& c, const Sk4f& d) { 425 SkNx_cast<uint8_t>(SkNx_join(SkNx_join(a,b), SkNx_join(c,d))).store(p); 426 } 427 428 #undef AI 429 430 #endif//SkNx_DEFINED 431