annotate fft/fftw/fftw-3.3.4/simd-support/simd-altivec.h @ 40:223f770b5341 kissfft-double tip

Try a double-precision kissfft
author Chris Cannam
date Wed, 07 Sep 2016 10:40:32 +0100
parents 26056e866c29
children
rev   line source
Chris@19 1 /*
Chris@19 2 * Copyright (c) 2003, 2007-14 Matteo Frigo
Chris@19 3 * Copyright (c) 2003, 2007-14 Massachusetts Institute of Technology
Chris@19 4 *
Chris@19 5 * This program is free software; you can redistribute it and/or modify
Chris@19 6 * it under the terms of the GNU General Public License as published by
Chris@19 7 * the Free Software Foundation; either version 2 of the License, or
Chris@19 8 * (at your option) any later version.
Chris@19 9 *
Chris@19 10 * This program is distributed in the hope that it will be useful,
Chris@19 11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
Chris@19 12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
Chris@19 13 * GNU General Public License for more details.
Chris@19 14 *
Chris@19 15 * You should have received a copy of the GNU General Public License
Chris@19 16 * along with this program; if not, write to the Free Software
Chris@19 17 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
Chris@19 18 *
Chris@19 19 */
Chris@19 20
Chris@19 21 #ifndef FFTW_SINGLE
Chris@19 22 #error "ALTIVEC only works in single precision"
Chris@19 23 #endif
Chris@19 24
Chris@19 25 /* define these unconditionally, because they are used by
Chris@19 26 taint.c which is compiled without altivec */
Chris@19 27 #define SIMD_SUFFIX _altivec /* for renaming */
Chris@19 28 #define VL 2 /* SIMD complex vector length */
Chris@19 29 #define SIMD_VSTRIDE_OKA(x) ((x) == 2)
Chris@19 30 #define SIMD_STRIDE_OKPAIR SIMD_STRIDE_OKA
Chris@19 31
Chris@19 32 #if !defined(__VEC__) && !defined(FAKE__VEC__)
Chris@19 33 # error "compiling simd-altivec.h requires -maltivec or equivalent"
Chris@19 34 #endif
Chris@19 35
Chris@19 36 #ifdef HAVE_ALTIVEC_H
Chris@19 37 # include <altivec.h>
Chris@19 38 #endif
Chris@19 39
Chris@19 40 typedef vector float V;
Chris@19 41 #define VLIT(x0, x1, x2, x3) {x0, x1, x2, x3}
Chris@19 42 #define LDK(x) x
Chris@19 43 #define DVK(var, val) const V var = VLIT(val, val, val, val)
Chris@19 44
Chris@19 45 static inline V VADD(V a, V b) { return vec_add(a, b); }
Chris@19 46 static inline V VSUB(V a, V b) { return vec_sub(a, b); }
Chris@19 47 static inline V VFMA(V a, V b, V c) { return vec_madd(a, b, c); }
Chris@19 48 static inline V VFNMS(V a, V b, V c) { return vec_nmsub(a, b, c); }
Chris@19 49
Chris@19 50 static inline V VMUL(V a, V b)
Chris@19 51 {
Chris@19 52 DVK(zero, -0.0);
Chris@19 53 return VFMA(a, b, zero);
Chris@19 54 }
Chris@19 55
Chris@19 56 static inline V VFMS(V a, V b, V c) { return VSUB(VMUL(a, b), c); }
Chris@19 57
Chris@19 58 static inline V LDA(const R *x, INT ivs, const R *aligned_like)
Chris@19 59 {
Chris@19 60 UNUSED(ivs);
Chris@19 61 UNUSED(aligned_like);
Chris@19 62 return vec_ld(0, x);
Chris@19 63 }
Chris@19 64
Chris@19 65 static inline V LD(const R *x, INT ivs, const R *aligned_like)
Chris@19 66 {
Chris@19 67 /* common subexpressions */
Chris@19 68 const INT fivs = sizeof(R) * ivs;
Chris@19 69 /* you are not expected to understand this: */
Chris@19 70 const vector unsigned int perm = VLIT(0, 0, 0xFFFFFFFF, 0xFFFFFFFF);
Chris@19 71 vector unsigned char ml = vec_lvsr(fivs + 8, aligned_like);
Chris@19 72 vector unsigned char mh = vec_lvsl(0, aligned_like);
Chris@19 73 vector unsigned char msk =
Chris@19 74 (vector unsigned char)vec_sel((V)mh, (V)ml, perm);
Chris@19 75 /* end of common subexpressions */
Chris@19 76
Chris@19 77 return vec_perm(vec_ld(0, x), vec_ld(fivs, x), msk);
Chris@19 78 }
Chris@19 79
Chris@19 80 /* store lower half */
Chris@19 81 static inline void STH(R *x, V v, R *aligned_like)
Chris@19 82 {
Chris@19 83 v = vec_perm(v, v, vec_lvsr(0, aligned_like));
Chris@19 84 vec_ste(v, 0, x);
Chris@19 85 vec_ste(v, sizeof(R), x);
Chris@19 86 }
Chris@19 87
Chris@19 88 static inline void STL(R *x, V v, INT ovs, R *aligned_like)
Chris@19 89 {
Chris@19 90 const INT fovs = sizeof(R) * ovs;
Chris@19 91 v = vec_perm(v, v, vec_lvsr(fovs + 8, aligned_like));
Chris@19 92 vec_ste(v, fovs, x);
Chris@19 93 vec_ste(v, sizeof(R) + fovs, x);
Chris@19 94 }
Chris@19 95
Chris@19 96 static inline void STA(R *x, V v, INT ovs, R *aligned_like)
Chris@19 97 {
Chris@19 98 UNUSED(ovs);
Chris@19 99 UNUSED(aligned_like);
Chris@19 100 vec_st(v, 0, x);
Chris@19 101 }
Chris@19 102
Chris@19 103 static inline void ST(R *x, V v, INT ovs, R *aligned_like)
Chris@19 104 {
Chris@19 105 /* WARNING: the extra_iter hack depends upon STH occurring after
Chris@19 106 STL */
Chris@19 107 STL(x, v, ovs, aligned_like);
Chris@19 108 STH(x, v, aligned_like);
Chris@19 109 }
Chris@19 110
Chris@19 111 #define STM2(x, v, ovs, aligned_like) /* no-op */
Chris@19 112
Chris@19 113 static inline void STN2(R *x, V v0, V v1, INT ovs)
Chris@19 114 {
Chris@19 115 const INT fovs = sizeof(R) * ovs;
Chris@19 116 const vector unsigned int even =
Chris@19 117 VLIT(0x00010203, 0x04050607, 0x10111213, 0x14151617);
Chris@19 118 const vector unsigned int odd =
Chris@19 119 VLIT(0x08090a0b, 0x0c0d0e0f, 0x18191a1b, 0x1c1d1e1f);
Chris@19 120 vec_st(vec_perm(v0, v1, (vector unsigned char)even), 0, x);
Chris@19 121 vec_st(vec_perm(v0, v1, (vector unsigned char)odd), fovs, x);
Chris@19 122 }
Chris@19 123
Chris@19 124 #define STM4(x, v, ovs, aligned_like) /* no-op */
Chris@19 125
Chris@19 126 static inline void STN4(R *x, V v0, V v1, V v2, V v3, INT ovs)
Chris@19 127 {
Chris@19 128 const INT fovs = sizeof(R) * ovs;
Chris@19 129 V x0 = vec_mergeh(v0, v2);
Chris@19 130 V x1 = vec_mergel(v0, v2);
Chris@19 131 V x2 = vec_mergeh(v1, v3);
Chris@19 132 V x3 = vec_mergel(v1, v3);
Chris@19 133 V y0 = vec_mergeh(x0, x2);
Chris@19 134 V y1 = vec_mergel(x0, x2);
Chris@19 135 V y2 = vec_mergeh(x1, x3);
Chris@19 136 V y3 = vec_mergel(x1, x3);
Chris@19 137 vec_st(y0, 0, x);
Chris@19 138 vec_st(y1, fovs, x);
Chris@19 139 vec_st(y2, 2 * fovs, x);
Chris@19 140 vec_st(y3, 3 * fovs, x);
Chris@19 141 }
Chris@19 142
Chris@19 143 static inline V FLIP_RI(V x)
Chris@19 144 {
Chris@19 145 const vector unsigned int perm =
Chris@19 146 VLIT(0x04050607, 0x00010203, 0x0c0d0e0f, 0x08090a0b);
Chris@19 147 return vec_perm(x, x, (vector unsigned char)perm);
Chris@19 148 }
Chris@19 149
Chris@19 150 static inline V VCONJ(V x)
Chris@19 151 {
Chris@19 152 const V pmpm = VLIT(0.0, -0.0, 0.0, -0.0);
Chris@19 153 return vec_xor(x, pmpm);
Chris@19 154 }
Chris@19 155
Chris@19 156 static inline V VBYI(V x)
Chris@19 157 {
Chris@19 158 return FLIP_RI(VCONJ(x));
Chris@19 159 }
Chris@19 160
Chris@19 161 static inline V VFMAI(V b, V c)
Chris@19 162 {
Chris@19 163 const V mpmp = VLIT(-1.0, 1.0, -1.0, 1.0);
Chris@19 164 return VFMA(FLIP_RI(b), mpmp, c);
Chris@19 165 }
Chris@19 166
Chris@19 167 static inline V VFNMSI(V b, V c)
Chris@19 168 {
Chris@19 169 const V mpmp = VLIT(-1.0, 1.0, -1.0, 1.0);
Chris@19 170 return VFNMS(FLIP_RI(b), mpmp, c);
Chris@19 171 }
Chris@19 172
Chris@19 173 static inline V VFMACONJ(V b, V c)
Chris@19 174 {
Chris@19 175 const V pmpm = VLIT(1.0, -1.0, 1.0, -1.0);
Chris@19 176 return VFMA(b, pmpm, c);
Chris@19 177 }
Chris@19 178
Chris@19 179 static inline V VFNMSCONJ(V b, V c)
Chris@19 180 {
Chris@19 181 const V pmpm = VLIT(1.0, -1.0, 1.0, -1.0);
Chris@19 182 return VFNMS(b, pmpm, c);
Chris@19 183 }
Chris@19 184
Chris@19 185 static inline V VFMSCONJ(V b, V c)
Chris@19 186 {
Chris@19 187 return VSUB(VCONJ(b), c);
Chris@19 188 }
Chris@19 189
Chris@19 190 static inline V VZMUL(V tx, V sr)
Chris@19 191 {
Chris@19 192 const vector unsigned int real =
Chris@19 193 VLIT(0x00010203, 0x00010203, 0x08090a0b, 0x08090a0b);
Chris@19 194 const vector unsigned int imag =
Chris@19 195 VLIT(0x04050607, 0x04050607, 0x0c0d0e0f, 0x0c0d0e0f);
Chris@19 196 V si = VBYI(sr);
Chris@19 197 V tr = vec_perm(tx, tx, (vector unsigned char)real);
Chris@19 198 V ti = vec_perm(tx, tx, (vector unsigned char)imag);
Chris@19 199 return VFMA(ti, si, VMUL(tr, sr));
Chris@19 200 }
Chris@19 201
Chris@19 202 static inline V VZMULJ(V tx, V sr)
Chris@19 203 {
Chris@19 204 const vector unsigned int real =
Chris@19 205 VLIT(0x00010203, 0x00010203, 0x08090a0b, 0x08090a0b);
Chris@19 206 const vector unsigned int imag =
Chris@19 207 VLIT(0x04050607, 0x04050607, 0x0c0d0e0f, 0x0c0d0e0f);
Chris@19 208 V si = VBYI(sr);
Chris@19 209 V tr = vec_perm(tx, tx, (vector unsigned char)real);
Chris@19 210 V ti = vec_perm(tx, tx, (vector unsigned char)imag);
Chris@19 211 return VFNMS(ti, si, VMUL(tr, sr));
Chris@19 212 }
Chris@19 213
Chris@19 214 static inline V VZMULI(V tx, V si)
Chris@19 215 {
Chris@19 216 const vector unsigned int real =
Chris@19 217 VLIT(0x00010203, 0x00010203, 0x08090a0b, 0x08090a0b);
Chris@19 218 const vector unsigned int imag =
Chris@19 219 VLIT(0x04050607, 0x04050607, 0x0c0d0e0f, 0x0c0d0e0f);
Chris@19 220 V sr = VBYI(si);
Chris@19 221 V tr = vec_perm(tx, tx, (vector unsigned char)real);
Chris@19 222 V ti = vec_perm(tx, tx, (vector unsigned char)imag);
Chris@19 223 return VFNMS(ti, si, VMUL(tr, sr));
Chris@19 224 }
Chris@19 225
Chris@19 226 static inline V VZMULIJ(V tx, V si)
Chris@19 227 {
Chris@19 228 const vector unsigned int real =
Chris@19 229 VLIT(0x00010203, 0x00010203, 0x08090a0b, 0x08090a0b);
Chris@19 230 const vector unsigned int imag =
Chris@19 231 VLIT(0x04050607, 0x04050607, 0x0c0d0e0f, 0x0c0d0e0f);
Chris@19 232 V sr = VBYI(si);
Chris@19 233 V tr = vec_perm(tx, tx, (vector unsigned char)real);
Chris@19 234 V ti = vec_perm(tx, tx, (vector unsigned char)imag);
Chris@19 235 return VFMA(ti, si, VMUL(tr, sr));
Chris@19 236 }
Chris@19 237
Chris@19 238 /* twiddle storage #1: compact, slower */
Chris@19 239 #define VTW1(v,x) \
Chris@19 240 {TW_COS, v, x}, {TW_COS, v+1, x}, {TW_SIN, v, x}, {TW_SIN, v+1, x}
Chris@19 241 #define TWVL1 (VL)
Chris@19 242
Chris@19 243 static inline V BYTW1(const R *t, V sr)
Chris@19 244 {
Chris@19 245 const V *twp = (const V *)t;
Chris@19 246 V si = VBYI(sr);
Chris@19 247 V tx = twp[0];
Chris@19 248 V tr = vec_mergeh(tx, tx);
Chris@19 249 V ti = vec_mergel(tx, tx);
Chris@19 250 return VFMA(ti, si, VMUL(tr, sr));
Chris@19 251 }
Chris@19 252
Chris@19 253 static inline V BYTWJ1(const R *t, V sr)
Chris@19 254 {
Chris@19 255 const V *twp = (const V *)t;
Chris@19 256 V si = VBYI(sr);
Chris@19 257 V tx = twp[0];
Chris@19 258 V tr = vec_mergeh(tx, tx);
Chris@19 259 V ti = vec_mergel(tx, tx);
Chris@19 260 return VFNMS(ti, si, VMUL(tr, sr));
Chris@19 261 }
Chris@19 262
Chris@19 263 /* twiddle storage #2: twice the space, faster (when in cache) */
Chris@19 264 #define VTW2(v,x) \
Chris@19 265 {TW_COS, v, x}, {TW_COS, v, x}, {TW_COS, v+1, x}, {TW_COS, v+1, x}, \
Chris@19 266 {TW_SIN, v, -x}, {TW_SIN, v, x}, {TW_SIN, v+1, -x}, {TW_SIN, v+1, x}
Chris@19 267 #define TWVL2 (2 * VL)
Chris@19 268
Chris@19 269 static inline V BYTW2(const R *t, V sr)
Chris@19 270 {
Chris@19 271 const V *twp = (const V *)t;
Chris@19 272 V si = FLIP_RI(sr);
Chris@19 273 V tr = twp[0], ti = twp[1];
Chris@19 274 return VFMA(ti, si, VMUL(tr, sr));
Chris@19 275 }
Chris@19 276
Chris@19 277 static inline V BYTWJ2(const R *t, V sr)
Chris@19 278 {
Chris@19 279 const V *twp = (const V *)t;
Chris@19 280 V si = FLIP_RI(sr);
Chris@19 281 V tr = twp[0], ti = twp[1];
Chris@19 282 return VFNMS(ti, si, VMUL(tr, sr));
Chris@19 283 }
Chris@19 284
Chris@19 285 /* twiddle storage #3 */
Chris@19 286 #define VTW3(v,x) {TW_CEXP, v, x}, {TW_CEXP, v+1, x}
Chris@19 287 #define TWVL3 (VL)
Chris@19 288
Chris@19 289 /* twiddle storage for split arrays */
Chris@19 290 #define VTWS(v,x) \
Chris@19 291 {TW_COS, v, x}, {TW_COS, v+1, x}, {TW_COS, v+2, x}, {TW_COS, v+3, x}, \
Chris@19 292 {TW_SIN, v, x}, {TW_SIN, v+1, x}, {TW_SIN, v+2, x}, {TW_SIN, v+3, x}
Chris@19 293 #define TWVLS (2 * VL)
Chris@19 294
Chris@19 295 #define VLEAVE() /* nothing */
Chris@19 296
Chris@19 297 #include "simd-common.h"