Chromium Code Reviews| OLD | NEW |
|---|---|
| (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 #include <arm_neon.h> | |
| 6 | |
| 7 // Template metaprogramming to map scalar types to vector types. | |
| 8 template <typename T> struct SkScalarToSIMD; | |
| 9 template <> struct SkScalarToSIMD<float> { typedef float32x4_t Type; }; | |
| 10 template <> struct SkScalarToSIMD<int32_t> { typedef int32x4_t Type; }; | |
| 11 | |
| 12 #elif defined(SK4X_PRIVATE) | |
| 13 Sk4x(float32x4_t); | |
| 14 Sk4x(int32x4_t); | |
| 15 | |
| 16 typename SkScalarToSIMD<T>::Type fVec; | |
| 17 | |
| 18 #else | |
| 19 | |
| 20 // Vector Constructors | |
| 21 template <> inline Sk4f::Sk4x(int32x4_t v) : fVec(vcvtq_f32_s32(v)) {} | |
|
mtklein
2015/03/04 19:16:33
delete?
| |
| 22 template <> inline Sk4f::Sk4x(float32x4_t v) : fVec(v) {} | |
| 23 template <> inline Sk4i::Sk4x(int32x4_t v) : fVec(v) {} | |
| 24 template <> inline Sk4i::Sk4x(float32x4_t v) : fVec(vcvtq_s32_f32(v)) {} | |
|
mtklein
2015/03/04 19:16:33
delete?
| |
| 25 | |
| 26 // Generic Methods | |
| 27 template <typename T> Sk4x<T>::Sk4x() {} | |
| 28 template <typename T> Sk4x<T>::Sk4x(const Sk4x& other) { *this = other; } | |
| 29 template <typename T> Sk4x<T>& Sk4x<T>::operator=(const Sk4x<T>& other) { | |
| 30 fVec = other.fVec; | |
| 31 return *this; | |
| 32 } | |
| 33 | |
| 34 // Sk4f Methods | |
| 35 #define M(...) template <> inline __VA_ARGS__ Sk4f:: | |
| 36 | |
| 37 M() Sk4x(float v) : fVec(vdupq_n_f32(v)) {} | |
| 38 M() Sk4x(float a, float b, float c, float d) { | |
| 39 // NEON lacks an intrinsic to make this easy. It is recommended to avoid | |
| 40 // this constructor unless it is absolutely necessary. | |
| 41 | |
| 42 // I am choosing to use the set lane intrinsics. Particularly, in the case | |
| 43 // of floating point, it is likely that the values are already in the right | |
| 44 // register file, so this may be the best approach. However, I am not | |
| 45 // certain that this is the fastest approach and experimentation might be | |
| 46 // useful. | |
| 47 fVec = vsetq_lane_f32(a, fVec, 0); | |
| 48 fVec = vsetq_lane_f32(b, fVec, 1); | |
| 49 fVec = vsetq_lane_f32(c, fVec, 2); | |
| 50 fVec = vsetq_lane_f32(d, fVec, 3); | |
| 51 } | |
| 52 | |
| 53 // As far as I can tell, it's not possible to provide an alignment hint to | |
| 54 // NEON using intrinsics. However, I think it is possible at the assembly | |
| 55 // level if we want to get into that. | |
| 56 // TODO: Write our own aligned load and store. | |
| 57 M(Sk4f) Load (const float fs[4]) { return vld1q_f32(fs); } | |
| 58 M(Sk4f) LoadAligned(const float fs[4]) { return vld1q_f32(fs); } | |
| 59 M(void) store (float fs[4]) const { vst1q_f32(fs, fVec); } | |
| 60 M(void) storeAligned(float fs[4]) const { vst1q_f32 (fs, fVec); } | |
| 61 | |
| 62 template <> | |
| 63 M(Sk4i) reinterpret<Sk4i>() const { return vreinterpretq_s32_f32(fVec); } | |
| 64 | |
| 65 template <> | |
| 66 M(Sk4i) cast<Sk4i>() const { return vcvtq_s32_f32(fVec); } | |
| 67 | |
| 68 // We're going to skip allTrue(), anyTrue(), and bit-manipulators | |
| 69 // for Sk4f. Code that calls them probably does so accidentally. | |
| 70 // Ask msarett or mtklein to fill these in if you really need them. | |
| 71 M(Sk4f) add (const Sk4f& o) const { return vaddq_f32(fVec, o.fVec); } | |
| 72 M(Sk4f) subtract(const Sk4f& o) const { return vsubq_f32(fVec, o.fVec); } | |
| 73 M(Sk4f) multiply(const Sk4f& o) const { return vmulq_f32(fVec, o.fVec); } | |
| 74 M(Sk4f) divide (const Sk4f& o) const { return vmulq_f32(fVec, vrecpeq_f32(o.fVe c)); } | |
| 75 | |
| 76 M(Sk4f) rsqrt() const { return vrsqrteq_f32(fVec); } | |
| 77 M(Sk4f) sqrt() const { return vrecpeq_f32(this->rsqrt().fVec); } | |
| 78 | |
| 79 M(Sk4i) equal (const Sk4f& o) const { return vreinterpretq_s32_u32(vce qq_f32(fVec, o.fVec)); } | |
| 80 M(Sk4i) notEqual (const Sk4f& o) const { return vreinterpretq_s32_u32(vmv nq_u32(vceqq_f32(fVec, o.fVec))); } | |
| 81 M(Sk4i) lessThan (const Sk4f& o) const { return vreinterpretq_s32_u32(vcl tq_f32(fVec, o.fVec)); } | |
| 82 M(Sk4i) greaterThan (const Sk4f& o) const { return vreinterpretq_s32_u32(vcg tq_f32(fVec, o.fVec)); } | |
| 83 M(Sk4i) lessThanEqual (const Sk4f& o) const { return vreinterpretq_s32_u32(vcl eq_f32(fVec, o.fVec)); } | |
| 84 M(Sk4i) greaterThanEqual(const Sk4f& o) const { return vreinterpretq_s32_u32(vcg eq_f32(fVec, o.fVec)); } | |
| 85 | |
| 86 M(Sk4f) Min(const Sk4f& a, const Sk4f& b) { return vminq_f32(a.fVec, b.fVec); } | |
| 87 M(Sk4f) Max(const Sk4f& a, const Sk4f& b) { return vmaxq_f32(a.fVec, b.fVec); } | |
| 88 | |
| 89 // These shuffle operations are implemented more efficiently with SSE. | |
| 90 // NEON has efficient zip, unzip, and transpose, but it is more costly to | |
| 91 // exploit zip and unzip in order to shuffle. | |
| 92 M(Sk4f) zwxy() const { | |
| 93 float32x4x2_t zip = vzipq_f32(fVec, vdupq_n_f32(0.0)); | |
| 94 return vuzpq_f32(zip.val[1], zip.val[0]).val[0]; | |
| 95 } | |
| 96 // Note that XYAB and ZWCD share code. If both are needed, they could be | |
| 97 // implemented more efficiently together. Also, ABXY and CDZW are available | |
| 98 // as well. | |
| 99 M(Sk4f) XYAB(const Sk4f& xyzw, const Sk4f& abcd) { | |
| 100 float32x4x2_t xayb_zcwd = vzipq_f32(xyzw.fVec, abcd.fVec); | |
| 101 float32x4x2_t axby_czdw = vzipq_f32(abcd.fVec, xyzw.fVec); | |
| 102 return vuzpq_f32(xayb_zcwd.val[0], axby_czdw.val[0]).val[0]; | |
| 103 } | |
| 104 M(Sk4f) ZWCD(const Sk4f& xyzw, const Sk4f& abcd) { | |
| 105 float32x4x2_t xayb_zcwd = vzipq_f32(xyzw.fVec, abcd.fVec); | |
| 106 float32x4x2_t axby_czdw = vzipq_f32(abcd.fVec, xyzw.fVec); | |
| 107 return vuzpq_f32(xayb_zcwd.val[1], axby_czdw.val[1]).val[0]; | |
| 108 } | |
| 109 | |
| 110 // Sk4i Methods | |
| 111 #undef M | |
| 112 #define M(...) template <> inline __VA_ARGS__ Sk4i:: | |
| 113 | |
| 114 M() Sk4x(int32_t v) : fVec(vdupq_n_s32(v)) {} | |
| 115 M() Sk4x(int32_t a, int32_t b, int32_t c, int32_t d) { | |
| 116 // NEON lacks an intrinsic to make this easy. It is recommended to avoid | |
| 117 // this constructor unless it is absolutely necessary. | |
| 118 | |
| 119 // There are a few different implementation strategies. | |
| 120 | |
| 121 // uint64_t ab_i = ((uint32_t) a) | (((uint64_t) b) << 32); | |
| 122 // uint64_t cd_i = ((uint32_t) c) | (((uint64_t) d) << 32); | |
| 123 // int32x2_t ab = vcreate_s32(ab_i); | |
| 124 // int32x2_t cd = vcreate_s32(cd_i); | |
| 125 // fVec = vcombine_s32(ab, cd); | |
| 126 // This might not be a bad idea for the integer case. Either way I think, | |
| 127 // we will need to move values from general registers to NEON registers. | |
| 128 | |
| 129 // I am choosing to use the set lane intrinsics. I am not certain that | |
| 130 // this is the fastest approach. It may be useful to try the above code | |
| 131 // for integers. | |
| 132 fVec = vsetq_lane_s32(a, fVec, 0); | |
| 133 fVec = vsetq_lane_s32(b, fVec, 1); | |
| 134 fVec = vsetq_lane_s32(c, fVec, 2); | |
| 135 fVec = vsetq_lane_s32(d, fVec, 3); | |
| 136 } | |
| 137 | |
| 138 // As far as I can tell, it's not possible to provide an alignment hint to | |
| 139 // NEON using intrinsics. However, I think it is possible at the assembly | |
| 140 // level if we want to get into that. | |
| 141 M(Sk4i) Load (const int32_t is[4]) { return vld1q_s32(is); } | |
| 142 M(Sk4i) LoadAligned(const int32_t is[4]) { return vld1q_s32(is); } | |
| 143 M(void) store (int32_t is[4]) const { vst1q_s32(is, fVec); } | |
| 144 M(void) storeAligned(int32_t is[4]) const { vst1q_s32 (is, fVec); } | |
| 145 | |
| 146 template <> | |
| 147 M(Sk4f) reinterpret<Sk4f>() const { return vreinterpretq_f32_s32(fVec); } | |
| 148 | |
| 149 template <> | |
| 150 M(Sk4f) cast<Sk4f>() const { return vcvtq_f32_s32(fVec); } | |
| 151 | |
| 152 M(bool) allTrue() const { | |
| 153 int32_t a = vgetq_lane_s32(fVec, 0); | |
| 154 int32_t b = vgetq_lane_s32(fVec, 1); | |
| 155 int32_t c = vgetq_lane_s32(fVec, 2); | |
| 156 int32_t d = vgetq_lane_s32(fVec, 3); | |
| 157 return a & b & c & d; | |
| 158 } | |
| 159 M(bool) anyTrue() const { | |
| 160 int32_t a = vgetq_lane_s32(fVec, 0); | |
| 161 int32_t b = vgetq_lane_s32(fVec, 1); | |
| 162 int32_t c = vgetq_lane_s32(fVec, 2); | |
| 163 int32_t d = vgetq_lane_s32(fVec, 3); | |
| 164 return a | b | c | d; | |
| 165 } | |
| 166 | |
| 167 M(Sk4i) bitNot() const { return vmvnq_s32(fVec); } | |
| 168 M(Sk4i) bitAnd(const Sk4i& o) const { return vandq_s32(fVec, o.fVec); } | |
| 169 M(Sk4i) bitOr (const Sk4i& o) const { return vorrq_s32(fVec, o.fVec); } | |
| 170 | |
| 171 M(Sk4i) equal (const Sk4i& o) const { return vreinterpretq_s32_u32(vce qq_s32(fVec, o.fVec)); } | |
| 172 M(Sk4i) notEqual (const Sk4i& o) const { return vreinterpretq_s32_u32(vmv nq_u32(vceqq_s32(fVec, o.fVec))); } | |
| 173 M(Sk4i) lessThan (const Sk4i& o) const { return vreinterpretq_s32_u32(vcl tq_s32(fVec, o.fVec)); } | |
| 174 M(Sk4i) greaterThan (const Sk4i& o) const { return vreinterpretq_s32_u32(vcg tq_s32(fVec, o.fVec)); } | |
| 175 M(Sk4i) lessThanEqual (const Sk4i& o) const { return vreinterpretq_s32_u32(vcl eq_s32(fVec, o.fVec)); } | |
| 176 M(Sk4i) greaterThanEqual(const Sk4i& o) const { return vreinterpretq_s32_u32(vcg eq_s32(fVec, o.fVec)); } | |
| 177 | |
| 178 M(Sk4i) add (const Sk4i& o) const { return vaddq_s32(fVec, o.fVec); } | |
| 179 M(Sk4i) subtract(const Sk4i& o) const { return vsubq_s32(fVec, o.fVec); } | |
| 180 M(Sk4i) multiply(const Sk4i& o) const { return vmulq_s32(fVec, o.fVec); } | |
| 181 // NEON does not have integer reciprocal, sqrt, or division. | |
| 182 M(Sk4i) Min(const Sk4i& a, const Sk4i& b) { return vminq_s32(a.fVec, b.fVec); } | |
| 183 M(Sk4i) Max(const Sk4i& a, const Sk4i& b) { return vmaxq_s32(a.fVec, b.fVec); } | |
| 184 | |
| 185 // These shuffle operations are implemented more efficiently with SSE. | |
| 186 // NEON has efficient zip, unzip, and transpose, but it is more costly to | |
| 187 // exploit zip and unzip in order to shuffle. | |
| 188 M(Sk4i) zwxy() const { | |
| 189 int32x4x2_t zip = vzipq_s32(fVec, vdupq_n_s32(0.0)); | |
| 190 return vuzpq_s32(zip.val[1], zip.val[0]).val[0]; | |
| 191 } | |
| 192 // Note that XYAB and ZWCD share code. If both are needed, they could be | |
| 193 // implemented more efficiently together. Also, ABXY and CDZW are available | |
| 194 // as well. | |
| 195 M(Sk4i) XYAB(const Sk4i& xyzw, const Sk4i& abcd) { | |
| 196 int32x4x2_t xayb_zcwd = vzipq_s32(xyzw.fVec, abcd.fVec); | |
| 197 int32x4x2_t axby_czdw = vzipq_s32(abcd.fVec, xyzw.fVec); | |
| 198 return vuzpq_s32(xayb_zcwd.val[0], axby_czdw.val[0]).val[0]; | |
| 199 } | |
| 200 M(Sk4i) ZWCD(const Sk4i& xyzw, const Sk4i& abcd) { | |
| 201 int32x4x2_t xayb_zcwd = vzipq_s32(xyzw.fVec, abcd.fVec); | |
| 202 int32x4x2_t axby_czdw = vzipq_s32(abcd.fVec, xyzw.fVec); | |
| 203 return vuzpq_s32(xayb_zcwd.val[1], axby_czdw.val[1]).val[0]; | |
| 204 } | |
| 205 | |
| 206 #undef M | |
| 207 | |
| 208 #endif | |
| OLD | NEW |