Chromium Code Reviews
chromiumcodereview-hr@appspot.gserviceaccount.com (chromiumcodereview-hr) | Please choose your nickname with Settings | Help | Chromium Project | Gerrit Changes | Sign out
(217)

Side by Side Diff: src/core/Sk4x_portable.h

Issue 704923003: start again on Sk4x with portable version and unit tests (Closed) Base URL: https://skia.googlesource.com/skia.git@master
Patch Set: memcpy Created 6 years, 1 month ago
Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.
Jump to:
View unified diff | Download patch
OLDNEW
(Empty)
1 // It is important _not_ to put header guards here.
2 // This file will be intentionally included three times.
3
4 #if defined(SK4X_PREAMBLE)
5
6 #elif defined(SK4X_PRIVATE)
7 typedef T Vector[4];
8
9 Vector fVec;
10
11 template <int m, int a, int s, int k>
12 static Sk4x Shuffle(const Sk4x&, const Sk4x&);
13
14 void set(const T vals[4]) { for (int i = 0; i < 4; i++) { fVec[i] = vals[i]; } }
15
16 #else
17
18 #define M(...) template <typename T> __VA_ARGS__ Sk4x<T>::
19
20 M() Sk4x() {}
21 M() Sk4x(T a, T b, T c, T d) { fVec[0] = a; fVec[1] = b; fVec[2] = c; fVec[3] = d; }
22
23 M() Sk4x(const Sk4x<T>& other) { this->set(other.fVec); }
24 M(Sk4x<T>&) operator=(const Sk4x<T>& other) { this->set(other.fVec); return *thi s; }
25
26 M(Sk4x<T>) Load (const T vals[4]) { Sk4x r; r.set(vals); return r; }
27 M(Sk4x<T>) LoadAligned(const T vals[4]) { return Load(vals); }
28
29 M(void) store (T vals[4]) const { for (int i = 0; i < 4; i++) { vals[i] = fVec[i]; } }
30 M(void) storeAligned(T vals[4]) const { this->store(vals); }
31
32 M(template <typename Dst> Dst) reinterpret() const {
33 Dst d;
34 memcpy(&d.fVec, fVec, sizeof(fVec));
35 return d;
36 }
37 M(template <typename Dst> Dst) cast() const {
38 return Dst(fVec[0], fVec[1], fVec[2], fVec[3]);
39 }
40
41 M(bool) allTrue() const { return fVec[0] & fVec[1] & fVec[2] & fVec[3]; }
42 M(bool) anyTrue() const { return fVec[0] | fVec[1] | fVec[2] | fVec[3]; }
43
44 M(Sk4x<T>) bitNot() const { return Sk4x(~fVec[0], ~fVec[1], ~fVec[2], ~fVec[3]); }
45
46 #define BINOP(op) fVec[0] op other.fVec[0], \
47 fVec[1] op other.fVec[1], \
48 fVec[2] op other.fVec[2], \
49 fVec[3] op other.fVec[3]
50 M(Sk4x<T>) bitAnd(const Sk4x& other) const { return Sk4x(BINOP(&)); }
51 M(Sk4x<T>) bitOr(const Sk4x& other) const { return Sk4x(BINOP(|)); }
52 M(Sk4x<T>) add(const Sk4x<T>& other) const { return Sk4x(BINOP(+)); }
53 M(Sk4x<T>) subtract(const Sk4x<T>& other) const { return Sk4x(BINOP(-)); }
54 M(Sk4x<T>) multiply(const Sk4x<T>& other) const { return Sk4x(BINOP(*)); }
55 M(Sk4x<T>) divide(const Sk4x<T>& other) const { return Sk4x(BINOP(/)); }
56 #undef BINOP
57
58 #define BOOL_BINOP(op) fVec[0] op other.fVec[0] ? -1 : 0, \
59 fVec[1] op other.fVec[1] ? -1 : 0, \
60 fVec[2] op other.fVec[2] ? -1 : 0, \
61 fVec[3] op other.fVec[3] ? -1 : 0
62 M(Sk4i) equal(const Sk4x<T>& other) const { return Sk4i(BOOL_BINOP(== )); }
63 M(Sk4i) notEqual(const Sk4x<T>& other) const { return Sk4i(BOOL_BINOP(!= )); }
64 M(Sk4i) lessThan(const Sk4x<T>& other) const { return Sk4i(BOOL_BINOP( < )); }
65 M(Sk4i) greaterThan(const Sk4x<T>& other) const { return Sk4i(BOOL_BINOP( > )); }
66 M(Sk4i) lessThanEqual(const Sk4x<T>& other) const { return Sk4i(BOOL_BINOP(<= )); }
67 M(Sk4i) greaterThanEqual(const Sk4x<T>& other) const { return Sk4i(BOOL_BINOP(>= )); }
68 #undef BOOL_BINOP
69
70 M(Sk4x<T>) Min(const Sk4x<T>& a, const Sk4x<T>& b) {
71 return Sk4x(SkTMin(a.fVec[0], b.fVec[0]),
72 SkTMin(a.fVec[1], b.fVec[1]),
73 SkTMin(a.fVec[2], b.fVec[2]),
74 SkTMin(a.fVec[3], b.fVec[3]));
75 }
76
77 M(Sk4x<T>) Max(const Sk4x<T>& a, const Sk4x<T>& b) {
78 return Sk4x(SkTMax(a.fVec[0], b.fVec[0]),
79 SkTMax(a.fVec[1], b.fVec[1]),
80 SkTMax(a.fVec[2], b.fVec[2]),
81 SkTMax(a.fVec[3], b.fVec[3]));
82 }
83
84 M(template <int m, int a, int s, int k> Sk4x<T>) Shuffle(const Sk4x<T>& x, const Sk4x<T>& y) {
85 return Sk4x(m < 4 ? x.fVec[m] : y.fVec[m-4],
86 a < 4 ? x.fVec[a] : y.fVec[a-4],
87 s < 4 ? x.fVec[s] : y.fVec[s-4],
88 k < 4 ? x.fVec[k] : y.fVec[k-4]);
89 }
90
91 M(Sk4x<T>) zwxy() const { return Shuffle<2,3,0,1>(*t his, *this); }
92 M(Sk4x<T>) XYAB(const Sk4x& xyzw, const Sk4x& abcd) { return Shuffle<0,1,4,5>( x yzw, abcd); }
93 M(Sk4x<T>) ZWCD(const Sk4x& xyzw, const Sk4x& abcd) { return Shuffle<2,3,6,7>( x yzw, abcd); }
94
95 #undef M
96
97 #endif
OLDNEW
« src/core/Sk4x.h ('K') | « src/core/Sk4x.h ('k') | tests/Sk4xTest.cpp » ('j') | no next file with comments »

Powered by Google App Engine
This is Rietveld 408576698