Chris@42: /* Chris@42: * Copyright (c) 2003, 2007-14 Matteo Frigo Chris@42: * Copyright (c) 2003, 2007-14 Massachusetts Institute of Technology Chris@42: * Chris@42: * This program is free software; you can redistribute it and/or modify Chris@42: * it under the terms of the GNU General Public License as published by Chris@42: * the Free Software Foundation; either version 2 of the License, or Chris@42: * (at your option) any later version. Chris@42: * Chris@42: * This program is distributed in the hope that it will be useful, Chris@42: * but WITHOUT ANY WARRANTY; without even the implied warranty of Chris@42: * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the Chris@42: * GNU General Public License for more details. Chris@42: * Chris@42: * You should have received a copy of the GNU General Public License Chris@42: * along with this program; if not, write to the Free Software Chris@42: * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA Chris@42: * Chris@42: */ Chris@42: Chris@42: #include "codelet-dft.h" Chris@42: #include SIMD_HEADER Chris@42: Chris@42: #define EXTERN_CONST(t, x) extern const t x; const t x Chris@42: Chris@42: static int n1b_okp(const kdft_desc *d, Chris@42: const R *ri, const R *ii, const R *ro, const R *io, Chris@42: INT is, INT os, INT vl, INT ivs, INT ovs, Chris@42: const planner *plnr) Chris@42: { Chris@42: return (1 Chris@42: && ALIGNED(ii) Chris@42: && ALIGNED(io) Chris@42: && !NO_SIMDP(plnr) Chris@42: && SIMD_STRIDE_OK(is) Chris@42: && SIMD_STRIDE_OK(os) Chris@42: && SIMD_VSTRIDE_OK(ivs) Chris@42: && SIMD_VSTRIDE_OK(ovs) Chris@42: && ri == ii + 1 Chris@42: && ro == io + 1 Chris@42: && (vl % VL) == 0 Chris@42: && (!d->is || (d->is == is)) Chris@42: && (!d->os || (d->os == os)) Chris@42: && (!d->ivs || (d->ivs == ivs)) Chris@42: && (!d->ovs || (d->ovs == ovs)) Chris@42: ); Chris@42: } Chris@42: Chris@42: EXTERN_CONST(kdft_genus, XSIMD(dft_n1bsimd_genus)) = { n1b_okp, VL }; Chris@42: Chris@42: static int n1f_okp(const kdft_desc *d, Chris@42: const R *ri, const R *ii, const R *ro, const R *io, Chris@42: INT is, INT os, INT vl, INT ivs, INT ovs, Chris@42: const planner *plnr) Chris@42: { Chris@42: return (1 Chris@42: && ALIGNED(ri) Chris@42: && ALIGNED(ro) Chris@42: && !NO_SIMDP(plnr) Chris@42: && SIMD_STRIDE_OK(is) Chris@42: && SIMD_STRIDE_OK(os) Chris@42: && SIMD_VSTRIDE_OK(ivs) Chris@42: && SIMD_VSTRIDE_OK(ovs) Chris@42: && ii == ri + 1 Chris@42: && io == ro + 1 Chris@42: && (vl % VL) == 0 Chris@42: && (!d->is || (d->is == is)) Chris@42: && (!d->os || (d->os == os)) Chris@42: && (!d->ivs || (d->ivs == ivs)) Chris@42: && (!d->ovs || (d->ovs == ovs)) Chris@42: ); Chris@42: } Chris@42: Chris@42: EXTERN_CONST(kdft_genus, XSIMD(dft_n1fsimd_genus)) = { n1f_okp, VL }; Chris@42: Chris@42: static int n2b_okp(const kdft_desc *d, Chris@42: const R *ri, const R *ii, const R *ro, const R *io, Chris@42: INT is, INT os, INT vl, INT ivs, INT ovs, Chris@42: const planner *plnr) Chris@42: { Chris@42: return (1 Chris@42: && ALIGNEDA(ii) Chris@42: && ALIGNEDA(io) Chris@42: && !NO_SIMDP(plnr) Chris@42: && SIMD_STRIDE_OKA(is) Chris@42: && SIMD_VSTRIDE_OKA(ivs) Chris@42: && SIMD_VSTRIDE_OKA(os) /* os == 2 enforced by codelet */ Chris@42: && SIMD_STRIDE_OKPAIR(ovs) Chris@42: && ri == ii + 1 Chris@42: && ro == io + 1 Chris@42: && (vl % VL) == 0 Chris@42: && (!d->is || (d->is == is)) Chris@42: && (!d->os || (d->os == os)) Chris@42: && (!d->ivs || (d->ivs == ivs)) Chris@42: && (!d->ovs || (d->ovs == ovs)) Chris@42: ); Chris@42: } Chris@42: Chris@42: EXTERN_CONST(kdft_genus, XSIMD(dft_n2bsimd_genus)) = { n2b_okp, VL }; Chris@42: Chris@42: static int n2f_okp(const kdft_desc *d, Chris@42: const R *ri, const R *ii, const R *ro, const R *io, Chris@42: INT is, INT os, INT vl, INT ivs, INT ovs, Chris@42: const planner *plnr) Chris@42: { Chris@42: return (1 Chris@42: && ALIGNEDA(ri) Chris@42: && ALIGNEDA(ro) Chris@42: && !NO_SIMDP(plnr) Chris@42: && SIMD_STRIDE_OKA(is) Chris@42: && SIMD_VSTRIDE_OKA(ivs) Chris@42: && SIMD_VSTRIDE_OKA(os) /* os == 2 enforced by codelet */ Chris@42: && SIMD_STRIDE_OKPAIR(ovs) Chris@42: && ii == ri + 1 Chris@42: && io == ro + 1 Chris@42: && (vl % VL) == 0 Chris@42: && (!d->is || (d->is == is)) Chris@42: && (!d->os || (d->os == os)) Chris@42: && (!d->ivs || (d->ivs == ivs)) Chris@42: && (!d->ovs || (d->ovs == ovs)) Chris@42: ); Chris@42: } Chris@42: Chris@42: EXTERN_CONST(kdft_genus, XSIMD(dft_n2fsimd_genus)) = { n2f_okp, VL }; Chris@42: Chris@42: static int n2s_okp(const kdft_desc *d, Chris@42: const R *ri, const R *ii, const R *ro, const R *io, Chris@42: INT is, INT os, INT vl, INT ivs, INT ovs, Chris@42: const planner *plnr) Chris@42: { Chris@42: return (1 Chris@42: && !NO_SIMDP(plnr) Chris@42: && ALIGNEDA(ri) Chris@42: && ALIGNEDA(ii) Chris@42: && ALIGNEDA(ro) Chris@42: && ALIGNEDA(io) Chris@42: && SIMD_STRIDE_OKA(is) Chris@42: && ivs == 1 Chris@42: && os == 1 Chris@42: && SIMD_STRIDE_OKA(ovs) Chris@42: && (vl % (2 * VL)) == 0 Chris@42: && (!d->is || (d->is == is)) Chris@42: && (!d->os || (d->os == os)) Chris@42: && (!d->ivs || (d->ivs == ivs)) Chris@42: && (!d->ovs || (d->ovs == ovs)) Chris@42: ); Chris@42: } Chris@42: Chris@42: EXTERN_CONST(kdft_genus, XSIMD(dft_n2ssimd_genus)) = { n2s_okp, 2 * VL }; Chris@42: Chris@42: static int q1b_okp(const ct_desc *d, Chris@42: const R *rio, const R *iio, Chris@42: INT rs, INT vs, INT m, INT mb, INT me, INT ms, Chris@42: const planner *plnr) Chris@42: { Chris@42: return (1 Chris@42: && ALIGNED(iio) Chris@42: && !NO_SIMDP(plnr) Chris@42: && SIMD_STRIDE_OK(rs) Chris@42: && SIMD_STRIDE_OK(vs) Chris@42: && SIMD_VSTRIDE_OK(ms) Chris@42: && rio == iio + 1 Chris@42: && (m % VL) == 0 Chris@42: && (mb % VL) == 0 Chris@42: && (me % VL) == 0 Chris@42: && (!d->rs || (d->rs == rs)) Chris@42: && (!d->vs || (d->vs == vs)) Chris@42: && (!d->ms || (d->ms == ms)) Chris@42: ); Chris@42: } Chris@42: EXTERN_CONST(ct_genus, XSIMD(dft_q1bsimd_genus)) = { q1b_okp, VL }; Chris@42: Chris@42: static int q1f_okp(const ct_desc *d, Chris@42: const R *rio, const R *iio, Chris@42: INT rs, INT vs, INT m, INT mb, INT me, INT ms, Chris@42: const planner *plnr) Chris@42: { Chris@42: return (1 Chris@42: && ALIGNED(rio) Chris@42: && !NO_SIMDP(plnr) Chris@42: && SIMD_STRIDE_OK(rs) Chris@42: && SIMD_STRIDE_OK(vs) Chris@42: && SIMD_VSTRIDE_OK(ms) Chris@42: && iio == rio + 1 Chris@42: && (m % VL) == 0 Chris@42: && (mb % VL) == 0 Chris@42: && (me % VL) == 0 Chris@42: && (!d->rs || (d->rs == rs)) Chris@42: && (!d->vs || (d->vs == vs)) Chris@42: && (!d->ms || (d->ms == ms)) Chris@42: ); Chris@42: } Chris@42: EXTERN_CONST(ct_genus, XSIMD(dft_q1fsimd_genus)) = { q1f_okp, VL }; Chris@42: Chris@42: static int t_okp_common(const ct_desc *d, Chris@42: const R *rio, const R *iio, Chris@42: INT rs, INT vs, INT m, INT mb, INT me, INT ms, Chris@42: const planner *plnr) Chris@42: { Chris@42: UNUSED(rio); UNUSED(iio); Chris@42: return (1 Chris@42: && !NO_SIMDP(plnr) Chris@42: && SIMD_STRIDE_OKA(rs) Chris@42: && SIMD_VSTRIDE_OKA(ms) Chris@42: && (m % VL) == 0 Chris@42: && (mb % VL) == 0 Chris@42: && (me % VL) == 0 Chris@42: && (!d->rs || (d->rs == rs)) Chris@42: && (!d->vs || (d->vs == vs)) Chris@42: && (!d->ms || (d->ms == ms)) Chris@42: ); Chris@42: } Chris@42: Chris@42: static int t_okp_commonu(const ct_desc *d, Chris@42: const R *rio, const R *iio, Chris@42: INT rs, INT vs, INT m, INT mb, INT me, INT ms, Chris@42: const planner *plnr) Chris@42: { Chris@42: UNUSED(rio); UNUSED(iio); UNUSED(m); Chris@42: return (1 Chris@42: && !NO_SIMDP(plnr) Chris@42: && SIMD_STRIDE_OK(rs) Chris@42: && SIMD_VSTRIDE_OK(ms) Chris@42: && (mb % VL) == 0 Chris@42: && (me % VL) == 0 Chris@42: && (!d->rs || (d->rs == rs)) Chris@42: && (!d->vs || (d->vs == vs)) Chris@42: && (!d->ms || (d->ms == ms)) Chris@42: ); Chris@42: } Chris@42: Chris@42: static int t_okp_t1f(const ct_desc *d, Chris@42: const R *rio, const R *iio, Chris@42: INT rs, INT vs, INT m, INT mb, INT me, INT ms, Chris@42: const planner *plnr) Chris@42: { Chris@42: return t_okp_common(d, rio, iio, rs, vs, m, mb, me, ms, plnr) Chris@42: && iio == rio + 1 Chris@42: && ALIGNEDA(rio); Chris@42: } Chris@42: Chris@42: EXTERN_CONST(ct_genus, XSIMD(dft_t1fsimd_genus)) = { t_okp_t1f, VL }; Chris@42: Chris@42: static int t_okp_t1fu(const ct_desc *d, Chris@42: const R *rio, const R *iio, Chris@42: INT rs, INT vs, INT m, INT mb, INT me, INT ms, Chris@42: const planner *plnr) Chris@42: { Chris@42: return t_okp_commonu(d, rio, iio, rs, vs, m, mb, me, ms, plnr) Chris@42: && iio == rio + 1 Chris@42: && ALIGNED(rio); Chris@42: } Chris@42: Chris@42: EXTERN_CONST(ct_genus, XSIMD(dft_t1fusimd_genus)) = { t_okp_t1fu, VL }; Chris@42: Chris@42: static int t_okp_t1b(const ct_desc *d, Chris@42: const R *rio, const R *iio, Chris@42: INT rs, INT vs, INT m, INT mb, INT me, INT ms, Chris@42: const planner *plnr) Chris@42: { Chris@42: return t_okp_common(d, rio, iio, rs, vs, m, mb, me, ms, plnr) Chris@42: && rio == iio + 1 Chris@42: && ALIGNEDA(iio); Chris@42: } Chris@42: Chris@42: EXTERN_CONST(ct_genus, XSIMD(dft_t1bsimd_genus)) = { t_okp_t1b, VL }; Chris@42: Chris@42: static int t_okp_t1bu(const ct_desc *d, Chris@42: const R *rio, const R *iio, Chris@42: INT rs, INT vs, INT m, INT mb, INT me, INT ms, Chris@42: const planner *plnr) Chris@42: { Chris@42: return t_okp_commonu(d, rio, iio, rs, vs, m, mb, me, ms, plnr) Chris@42: && rio == iio + 1 Chris@42: && ALIGNED(iio); Chris@42: } Chris@42: Chris@42: EXTERN_CONST(ct_genus, XSIMD(dft_t1busimd_genus)) = { t_okp_t1bu, VL }; Chris@42: Chris@42: /* use t2* codelets only when n = m*radix is small, because Chris@42: t2* codelets use ~2n twiddle factors (instead of ~n) */ Chris@42: static int small_enough(const ct_desc *d, INT m) Chris@42: { Chris@42: return m * d->radix <= 16384; Chris@42: } Chris@42: Chris@42: static int t_okp_t2f(const ct_desc *d, Chris@42: const R *rio, const R *iio, Chris@42: INT rs, INT vs, INT m, INT mb, INT me, INT ms, Chris@42: const planner *plnr) Chris@42: { Chris@42: return t_okp_t1f(d, rio, iio, rs, vs, m, mb, me, ms, plnr) Chris@42: && small_enough(d, m); Chris@42: } Chris@42: Chris@42: EXTERN_CONST(ct_genus, XSIMD(dft_t2fsimd_genus)) = { t_okp_t2f, VL }; Chris@42: Chris@42: static int t_okp_t2b(const ct_desc *d, Chris@42: const R *rio, const R *iio, Chris@42: INT rs, INT vs, INT m, INT mb, INT me, INT ms, Chris@42: const planner *plnr) Chris@42: { Chris@42: return t_okp_t1b(d, rio, iio, rs, vs, m, mb, me, ms, plnr) Chris@42: && small_enough(d, m); Chris@42: } Chris@42: Chris@42: EXTERN_CONST(ct_genus, XSIMD(dft_t2bsimd_genus)) = { t_okp_t2b, VL }; Chris@42: Chris@42: static int ts_okp(const ct_desc *d, Chris@42: const R *rio, const R *iio, Chris@42: INT rs, INT vs, INT m, INT mb, INT me, INT ms, Chris@42: const planner *plnr) Chris@42: { Chris@42: UNUSED(rio); Chris@42: UNUSED(iio); Chris@42: return (1 Chris@42: && !NO_SIMDP(plnr) Chris@42: && ALIGNEDA(rio) Chris@42: && ALIGNEDA(iio) Chris@42: && SIMD_STRIDE_OKA(rs) Chris@42: && ms == 1 Chris@42: && (m % (2 * VL)) == 0 Chris@42: && (mb % (2 * VL)) == 0 Chris@42: && (me % (2 * VL)) == 0 Chris@42: && (!d->rs || (d->rs == rs)) Chris@42: && (!d->vs || (d->vs == vs)) Chris@42: && (!d->ms || (d->ms == ms)) Chris@42: ); Chris@42: } Chris@42: Chris@42: EXTERN_CONST(ct_genus, XSIMD(dft_tssimd_genus)) = { ts_okp, 2 * VL };