Chris@19: /*
Chris@19:  * Copyright (c) 2003, 2007-14 Matteo Frigo
Chris@19:  * Copyright (c) 2003, 2007-14 Massachusetts Institute of Technology
Chris@19:  *
Chris@19:  * This program is free software; you can redistribute it and/or modify
Chris@19:  * it under the terms of the GNU General Public License as published by
Chris@19:  * the Free Software Foundation; either version 2 of the License, or
Chris@19:  * (at your option) any later version.
Chris@19:  *
Chris@19:  * This program is distributed in the hope that it will be useful,
Chris@19:  * but WITHOUT ANY WARRANTY; without even the implied warranty of
Chris@19:  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
Chris@19:  * GNU General Public License for more details.
Chris@19:  *
Chris@19:  * You should have received a copy of the GNU General Public License
Chris@19:  * along with this program; if not, write to the Free Software
Chris@19:  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
Chris@19:  *
Chris@19:  */
Chris@19: 
Chris@19: #if defined(FFTW_LDOUBLE) || defined(FFTW_QUAD)
Chris@19: #  error "SSE/SSE2 only works in single/double precision"
Chris@19: #endif
Chris@19: 
Chris@19: #ifdef FFTW_SINGLE
Chris@19: #  define DS(d,s) s /* single-precision option */
Chris@19: #  define SUFF(name) name ## s
Chris@19: #else
Chris@19: #  define DS(d,s) d /* double-precision option */
Chris@19: #  define SUFF(name) name ## d
Chris@19: #endif
Chris@19: 
Chris@19: #define SIMD_SUFFIX  _sse2  /* for renaming */
Chris@19: #define VL DS(1,2)         /* SIMD vector length, in term of complex numbers */
Chris@19: #define SIMD_VSTRIDE_OKA(x) DS(1,((x) == 2))
Chris@19: #define SIMD_STRIDE_OKPAIR SIMD_STRIDE_OK
Chris@19: 
Chris@19: #if defined(__GNUC__) && !defined(FFTW_SINGLE) && !defined(__SSE2__)
Chris@19: #  error "compiling simd-sse2.h in double precision without -msse2"
Chris@19: #elif defined(__GNUC__) && defined(FFTW_SINGLE) && !defined(__SSE__)
Chris@19: #  error "compiling simd-sse2.h in single precision without -msse"
Chris@19: #endif
Chris@19: 
Chris@19: #ifdef _MSC_VER
Chris@19: #ifndef inline
Chris@19: #define inline __inline
Chris@19: #endif
Chris@19: #endif
Chris@19: 
Chris@19: /* some versions of glibc's sys/cdefs.h define __inline to be empty,
Chris@19:    which is wrong because emmintrin.h defines several inline
Chris@19:    procedures */
Chris@19: #ifndef _MSC_VER
Chris@19: #undef __inline
Chris@19: #endif
Chris@19: 
Chris@19: #ifdef FFTW_SINGLE
Chris@19: #  include <xmmintrin.h>
Chris@19: #else
Chris@19: #  include <emmintrin.h>
Chris@19: #endif
Chris@19: 
Chris@19: typedef DS(__m128d,__m128) V;
Chris@19: #define VADD SUFF(_mm_add_p)
Chris@19: #define VSUB SUFF(_mm_sub_p)
Chris@19: #define VMUL SUFF(_mm_mul_p)
Chris@19: #define VXOR SUFF(_mm_xor_p)
Chris@19: #define SHUF SUFF(_mm_shuffle_p)
Chris@19: #define UNPCKL SUFF(_mm_unpacklo_p)
Chris@19: #define UNPCKH SUFF(_mm_unpackhi_p)
Chris@19: 
Chris@19: #define SHUFVALS(fp0,fp1,fp2,fp3) \
Chris@19:    (((fp3) << 6) | ((fp2) << 4) | ((fp1) << 2) | ((fp0)))
Chris@19: 
Chris@19: #define VDUPL(x) DS(UNPCKL(x, x), SHUF(x, x, SHUFVALS(0, 0, 2, 2)))
Chris@19: #define VDUPH(x) DS(UNPCKH(x, x), SHUF(x, x, SHUFVALS(1, 1, 3, 3)))
Chris@19: #define STOREH(a, v) DS(_mm_storeh_pd(a, v), _mm_storeh_pi((__m64 *)(a), v))
Chris@19: #define STOREL(a, v) DS(_mm_storel_pd(a, v), _mm_storel_pi((__m64 *)(a), v))
Chris@19: 
Chris@19: 
Chris@19: #ifdef __GNUC__
Chris@19:   /*
Chris@19:    * gcc-3.3 generates slow code for mm_set_ps (write all elements to
Chris@19:    * the stack and load __m128 from the stack).
Chris@19:    *
Chris@19:    * gcc-3.[34] generates slow code for mm_set_ps1 (load into low element
Chris@19:    * and shuffle).
Chris@19:    *
Chris@19:    * This hack forces gcc to generate a constant __m128 at compile time.
Chris@19:    */
Chris@19:   union rvec {
Chris@19:        R r[DS(2,4)];
Chris@19:        V v;
Chris@19:   };
Chris@19: 
Chris@19: #  ifdef FFTW_SINGLE
Chris@19: #    define DVK(var, val) V var = __extension__ ({ \
Chris@19:          static const union rvec _var = { {val,val,val,val} }; _var.v; })
Chris@19: #  else
Chris@19: #    define DVK(var, val) V var = __extension__ ({ \
Chris@19:          static const union rvec _var = { {val,val} }; _var.v; })
Chris@19: #  endif
Chris@19: #  define LDK(x) x
Chris@19: #else
Chris@19: #  define DVK(var, val) const R var = K(val)
Chris@19: #  define LDK(x) DS(_mm_set1_pd,_mm_set_ps1)(x)
Chris@19: #endif
Chris@19: 
Chris@19: union uvec {
Chris@19:      unsigned u[4];
Chris@19:      V v;
Chris@19: };
Chris@19: 
Chris@19: static inline V LDA(const R *x, INT ivs, const R *aligned_like)
Chris@19: {
Chris@19:      (void)aligned_like; /* UNUSED */
Chris@19:      (void)ivs; /* UNUSED */
Chris@19:      return *(const V *)x;
Chris@19: }
Chris@19: 
Chris@19: static inline void STA(R *x, V v, INT ovs, const R *aligned_like)
Chris@19: {
Chris@19:      (void)aligned_like; /* UNUSED */
Chris@19:      (void)ovs; /* UNUSED */
Chris@19:      *(V *)x = v;
Chris@19: }
Chris@19: 
Chris@19: #ifdef FFTW_SINGLE
Chris@19: 
Chris@19: #  ifdef _MSC_VER
Chris@19:      /* Temporarily disable the warning "uninitialized local variable
Chris@19: 	'name' used" and runtime checks for using a variable before it is
Chris@19: 	defined which is erroneously triggered by the LOADL0 / LOADH macros
Chris@19: 	as they only modify VAL partly each. */
Chris@19: #    pragma warning(disable : 4700)
Chris@19: #    pragma runtime_checks("u", off)
Chris@19: #  endif
Chris@19: 
Chris@19: static inline V LD(const R *x, INT ivs, const R *aligned_like)
Chris@19: {
Chris@19:      V var;
Chris@19:      (void)aligned_like; /* UNUSED */
Chris@19: #  ifdef __GNUC__
Chris@19:      /* We use inline asm because gcc-3.x generates slow code for
Chris@19: 	_mm_loadh_pi().  gcc-3.x insists upon having an existing variable for
Chris@19: 	VAL, which is however never used.  Thus, it generates code to move
Chris@19: 	values in and out the variable.  Worse still, gcc-4.0 stores VAL on
Chris@19: 	the stack, causing valgrind to complain about uninitialized reads. */  
Chris@19:      __asm__("movlps %1, %0\n\tmovhps %2, %0"
Chris@19: 	     : "=x"(var) : "m"(x[0]), "m"(x[ivs]));
Chris@19: #  else
Chris@19: #    define LOADH(addr, val) _mm_loadh_pi(val, (const __m64 *)(addr))
Chris@19: #    define LOADL0(addr, val) _mm_loadl_pi(val, (const __m64 *)(addr))
Chris@19:      var = LOADL0(x, var);
Chris@19:      var = LOADH(x + ivs, var);
Chris@19: #  endif
Chris@19:      return var;
Chris@19: }
Chris@19: 
Chris@19: #  ifdef _MSC_VER
Chris@19: #    pragma warning(default : 4700)
Chris@19: #    pragma runtime_checks("u", restore)
Chris@19: #  endif
Chris@19: 
Chris@19: static inline void ST(R *x, V v, INT ovs, const R *aligned_like)
Chris@19: {
Chris@19:      (void)aligned_like; /* UNUSED */
Chris@19:      /* WARNING: the extra_iter hack depends upon STOREL occurring
Chris@19: 	after STOREH */
Chris@19:      STOREH(x + ovs, v);
Chris@19:      STOREL(x, v);
Chris@19: }
Chris@19: 
Chris@19: #else /* ! FFTW_SINGLE */
Chris@19: #  define LD LDA
Chris@19: #  define ST STA
Chris@19: #endif
Chris@19: 
Chris@19: #define STM2 DS(STA,ST)
Chris@19: #define STN2(x, v0, v1, ovs) /* nop */
Chris@19: 
Chris@19: #ifdef FFTW_SINGLE
Chris@19: #  define STM4(x, v, ovs, aligned_like) /* no-op */
Chris@19: /* STN4 is a macro, not a function, thanks to Visual C++ developers
Chris@19:    deciding "it would be infrequent that people would want to pass more
Chris@19:    than 3 [__m128 parameters] by value."  3 parameters ought to be enough
Chris@19:    for anybody. */
Chris@19: #  define STN4(x, v0, v1, v2, v3, ovs)			\
Chris@19: {							\
Chris@19:      V xxx0, xxx1, xxx2, xxx3;				\
Chris@19:      xxx0 = UNPCKL(v0, v2);				\
Chris@19:      xxx1 = UNPCKH(v0, v2);				\
Chris@19:      xxx2 = UNPCKL(v1, v3);				\
Chris@19:      xxx3 = UNPCKH(v1, v3);				\
Chris@19:      STA(x, UNPCKL(xxx0, xxx2), 0, 0);			\
Chris@19:      STA(x + ovs, UNPCKH(xxx0, xxx2), 0, 0);		\
Chris@19:      STA(x + 2 * ovs, UNPCKL(xxx1, xxx3), 0, 0);	\
Chris@19:      STA(x + 3 * ovs, UNPCKH(xxx1, xxx3), 0, 0);	\
Chris@19: }
Chris@19: #else /* !FFTW_SINGLE */
Chris@19: static inline void STM4(R *x, V v, INT ovs, const R *aligned_like)
Chris@19: {
Chris@19:      (void)aligned_like; /* UNUSED */
Chris@19:      STOREL(x, v);
Chris@19:      STOREH(x + ovs, v);
Chris@19: }
Chris@19: #  define STN4(x, v0, v1, v2, v3, ovs) /* nothing */
Chris@19: #endif
Chris@19: 
Chris@19: static inline V FLIP_RI(V x)
Chris@19: {
Chris@19:      return SHUF(x, x, DS(1, SHUFVALS(1, 0, 3, 2)));
Chris@19: }
Chris@19: 
Chris@19: extern const union uvec X(sse2_pm);
Chris@19: static inline V VCONJ(V x)
Chris@19: {
Chris@19:      return VXOR(X(sse2_pm).v, x);
Chris@19: }
Chris@19: 
Chris@19: static inline V VBYI(V x)
Chris@19: {
Chris@19:      x = VCONJ(x);
Chris@19:      x = FLIP_RI(x);
Chris@19:      return x;
Chris@19: }
Chris@19: 
Chris@19: /* FMA support */
Chris@19: #define VFMA(a, b, c) VADD(c, VMUL(a, b))
Chris@19: #define VFNMS(a, b, c) VSUB(c, VMUL(a, b))
Chris@19: #define VFMS(a, b, c) VSUB(VMUL(a, b), c)
Chris@19: #define VFMAI(b, c) VADD(c, VBYI(b))
Chris@19: #define VFNMSI(b, c) VSUB(c, VBYI(b))
Chris@19: #define VFMACONJ(b,c)  VADD(VCONJ(b),c)
Chris@19: #define VFMSCONJ(b,c)  VSUB(VCONJ(b),c)
Chris@19: #define VFNMSCONJ(b,c) VSUB(c, VCONJ(b))
Chris@19: 
Chris@19: static inline V VZMUL(V tx, V sr)
Chris@19: {
Chris@19:      V tr = VDUPL(tx);
Chris@19:      V ti = VDUPH(tx);
Chris@19:      tr = VMUL(sr, tr);
Chris@19:      sr = VBYI(sr);
Chris@19:      return VFMA(ti, sr, tr);
Chris@19: }
Chris@19: 
Chris@19: static inline V VZMULJ(V tx, V sr)
Chris@19: {
Chris@19:      V tr = VDUPL(tx);
Chris@19:      V ti = VDUPH(tx);
Chris@19:      tr = VMUL(sr, tr);
Chris@19:      sr = VBYI(sr);
Chris@19:      return VFNMS(ti, sr, tr);
Chris@19: }
Chris@19: 
Chris@19: static inline V VZMULI(V tx, V sr)
Chris@19: {
Chris@19:      V tr = VDUPL(tx);
Chris@19:      V ti = VDUPH(tx);
Chris@19:      ti = VMUL(ti, sr);
Chris@19:      sr = VBYI(sr);
Chris@19:      return VFMS(tr, sr, ti);
Chris@19: }
Chris@19: 
Chris@19: static inline V VZMULIJ(V tx, V sr)
Chris@19: {
Chris@19:      V tr = VDUPL(tx);
Chris@19:      V ti = VDUPH(tx);
Chris@19:      ti = VMUL(ti, sr);
Chris@19:      sr = VBYI(sr);
Chris@19:      return VFMA(tr, sr, ti);
Chris@19: }
Chris@19: 
Chris@19: /* twiddle storage #1: compact, slower */
Chris@19: #ifdef FFTW_SINGLE
Chris@19: #  define VTW1(v,x)  \
Chris@19:   {TW_COS, v, x}, {TW_COS, v+1, x}, {TW_SIN, v, x}, {TW_SIN, v+1, x}
Chris@19: static inline V BYTW1(const R *t, V sr)
Chris@19: {
Chris@19:      const V *twp = (const V *)t;
Chris@19:      V tx = twp[0];
Chris@19:      V tr = UNPCKL(tx, tx);
Chris@19:      V ti = UNPCKH(tx, tx);
Chris@19:      tr = VMUL(tr, sr);
Chris@19:      sr = VBYI(sr);
Chris@19:      return VFMA(ti, sr, tr);
Chris@19: }
Chris@19: static inline V BYTWJ1(const R *t, V sr)
Chris@19: {
Chris@19:      const V *twp = (const V *)t;
Chris@19:      V tx = twp[0];
Chris@19:      V tr = UNPCKL(tx, tx);
Chris@19:      V ti = UNPCKH(tx, tx);
Chris@19:      tr = VMUL(tr, sr);
Chris@19:      sr = VBYI(sr);
Chris@19:      return VFNMS(ti, sr, tr);
Chris@19: }
Chris@19: #else /* !FFTW_SINGLE */
Chris@19: #  define VTW1(v,x) {TW_CEXP, v, x}
Chris@19: static inline V BYTW1(const R *t, V sr)
Chris@19: {
Chris@19:      V tx = LD(t, 1, t);
Chris@19:      return VZMUL(tx, sr);
Chris@19: }
Chris@19: static inline V BYTWJ1(const R *t, V sr)
Chris@19: {
Chris@19:      V tx = LD(t, 1, t);
Chris@19:      return VZMULJ(tx, sr);
Chris@19: }
Chris@19: #endif
Chris@19: #define TWVL1 (VL)
Chris@19: 
Chris@19: /* twiddle storage #2: twice the space, faster (when in cache) */
Chris@19: #ifdef FFTW_SINGLE
Chris@19: #  define VTW2(v,x)							\
Chris@19:   {TW_COS, v, x}, {TW_COS, v, x}, {TW_COS, v+1, x}, {TW_COS, v+1, x},	\
Chris@19:   {TW_SIN, v, -x}, {TW_SIN, v, x}, {TW_SIN, v+1, -x}, {TW_SIN, v+1, x}
Chris@19: #else /* !FFTW_SINGLE */
Chris@19: #  define VTW2(v,x)							\
Chris@19:   {TW_COS, v, x}, {TW_COS, v, x}, {TW_SIN, v, -x}, {TW_SIN, v, x}
Chris@19: #endif
Chris@19: #define TWVL2 (2 * VL)
Chris@19: static inline V BYTW2(const R *t, V sr)
Chris@19: {
Chris@19:      const V *twp = (const V *)t;
Chris@19:      V si = FLIP_RI(sr);
Chris@19:      V tr = twp[0], ti = twp[1];
Chris@19:      return VFMA(tr, sr, VMUL(ti, si));
Chris@19: }
Chris@19: static inline V BYTWJ2(const R *t, V sr)
Chris@19: {
Chris@19:      const V *twp = (const V *)t;
Chris@19:      V si = FLIP_RI(sr);
Chris@19:      V tr = twp[0], ti = twp[1];
Chris@19:      return VFNMS(ti, si, VMUL(tr, sr));
Chris@19: }
Chris@19: 
Chris@19: /* twiddle storage #3 */
Chris@19: #ifdef FFTW_SINGLE
Chris@19: #  define VTW3(v,x) {TW_CEXP, v, x}, {TW_CEXP, v+1, x}
Chris@19: #  define TWVL3 (VL)
Chris@19: #else
Chris@19: #  define VTW3(v,x) VTW1(v,x)
Chris@19: #  define TWVL3 TWVL1
Chris@19: #endif
Chris@19: 
Chris@19: /* twiddle storage for split arrays */
Chris@19: #ifdef FFTW_SINGLE
Chris@19: #  define VTWS(v,x)							  \
Chris@19:     {TW_COS, v, x}, {TW_COS, v+1, x}, {TW_COS, v+2, x}, {TW_COS, v+3, x}, \
Chris@19:     {TW_SIN, v, x}, {TW_SIN, v+1, x}, {TW_SIN, v+2, x}, {TW_SIN, v+3, x}
Chris@19: #else
Chris@19: #  define VTWS(v,x)							  \
Chris@19:     {TW_COS, v, x}, {TW_COS, v+1, x}, {TW_SIN, v, x}, {TW_SIN, v+1, x}
Chris@19: #endif
Chris@19: #define TWVLS (2 * VL)
Chris@19: 
Chris@19: #define VLEAVE() /* nothing */
Chris@19: 
Chris@19: #include "simd-common.h"