/* This file is part of FFTS -- The Fastest Fourier Transform in the South Copyright (c) 2012, Anthony M. Blake Copyright (c) 2012, The University of Waikato All rights reserved. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * Neither the name of the organization nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL ANTHONY M. BLAKE BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #include "ffts_nd.h" #include "ffts_internal.h" #ifdef HAVE_NEON #include "neon.h" #include #elif HAVE_SSE #include #endif #define TSIZE 8 static void ffts_free_nd(ffts_plan_t *p) { if (p->plans) { int i; for (i = 0; i < p->rank; i++) { ffts_plan_t *plan = p->plans[i]; if (plan) { int k; for (k = 0; k < i; k++) { if (p->Ms[i] == p->Ms[k]) { plan = NULL; break; } } if (plan) { ffts_free(plan); } } } free(p->plans); } if (p->Ns) { free(p->Ns); } if (p->Ms) { free(p->Ms); } if (p->buf) { ffts_aligned_free(p->buf); } if (p->transpose_buf) { ffts_aligned_free(p->transpose_buf); } free(p); } static void ffts_transpose(uint64_t *in, uint64_t *out, int w, int h, uint64_t *buf) { #ifdef HAVE_NEON size_t i, j, k; int linebytes = 8 * w; for (j = 0; j < h; j += 8) { for (i = 0; i < w; i += 8) { neon_transpose_to_buf(in + j*w + i, buf, w); uint64_t *p = out + i*h + j; uint64_t *pbuf = buf; uint64_t *ptemp; __asm__ __volatile__( "mov %[ptemp], %[p]\n\t" "add %[p], %[p], %[w], lsl #3\n\t" "vld1.32 {q8,q9}, [%[pbuf], :128]!\n\t" "vld1.32 {q10,q11}, [%[pbuf], :128]!\n\t" "vld1.32 {q12,q13}, [%[pbuf], :128]!\n\t" "vld1.32 {q14,q15}, [%[pbuf], :128]!\n\t" "vst1.32 {q8,q9}, [%[ptemp], :128]!\n\t" "vst1.32 {q10,q11}, [%[ptemp], :128]!\n\t" "mov %[ptemp], %[p]\n\t" "add %[p], %[p], %[w], lsl #3\n\t" "vst1.32 {q12,q13}, [%[ptemp], :128]!\n\t" "vst1.32 {q14,q15}, [%[ptemp], :128]!\n\t" "mov %[ptemp], %[p]\n\t" "add %[p], %[p], %[w], lsl #3\n\t" "vld1.32 {q8,q9}, [%[pbuf], :128]!\n\t" "vld1.32 {q10,q11}, [%[pbuf], :128]!\n\t" "vld1.32 {q12,q13}, [%[pbuf], :128]!\n\t" "vld1.32 {q14,q15}, [%[pbuf], :128]!\n\t" "vst1.32 {q8,q9}, [%[ptemp], :128]!\n\t" "vst1.32 {q10,q11}, [%[ptemp], :128]!\n\t" "mov %[ptemp], %[p]\n\t" "add %[p], %[p], %[w], lsl #3\n\t" "vst1.32 {q12,q13}, [%[ptemp], :128]!\n\t" "vst1.32 {q14,q15}, [%[ptemp], :128]!\n\t" "mov %[ptemp], %[p]\n\t" "add %[p], %[p], %[w], lsl #3\n\t" "vld1.32 {q8,q9}, [%[pbuf], :128]!\n\t" "vld1.32 {q10,q11}, [%[pbuf], :128]!\n\t" "vld1.32 {q12,q13}, [%[pbuf], :128]!\n\t" "vld1.32 {q14,q15}, [%[pbuf], :128]!\n\t" "vst1.32 {q8,q9}, [%[ptemp], :128]!\n\t" "vst1.32 {q10,q11}, [%[ptemp], :128]!\n\t" "mov %[ptemp], %[p]\n\t" "add %[p], %[p], %[w], lsl #3\n\t" "vst1.32 {q12,q13}, [%[ptemp], :128]!\n\t" "vst1.32 {q14,q15}, [%[ptemp], :128]!\n\t" "mov %[ptemp], %[p]\n\t" "add %[p], %[p], %[w], lsl #3\n\t" "vld1.32 {q8,q9}, [%[pbuf], :128]!\n\t" "vld1.32 {q10,q11}, [%[pbuf], :128]!\n\t" "vld1.32 {q12,q13}, [%[pbuf], :128]!\n\t" "vld1.32 {q14,q15}, [%[pbuf], :128]!\n\t" "vst1.32 {q8,q9}, [%[ptemp], :128]!\n\t" "vst1.32 {q10,q11}, [%[ptemp], :128]!\n\t" "mov %[ptemp], %[p]\n\t" "vst1.32 {q12,q13}, [%[ptemp], :128]!\n\t" "vst1.32 {q14,q15}, [%[ptemp], :128]!\n\t" : [p] "+r" (p), [pbuf] "+r" (pbuf), [ptemp] "+r" (ptemp) : [w] "r" (w) : "memory", "q8", "q9", "q10", "q11" ); /* out[i*h + j] = in[j*w + i]; */ } } #else #ifdef HAVE_SSE uint64_t FFTS_ALIGN(64) tmp[TSIZE*TSIZE]; int tx, ty; /* int x; */ int y; int tw = w / TSIZE; int th = h / TSIZE; for (ty = 0; ty < th; ty++) { for (tx = 0; tx < tw; tx++) { uint64_t *ip0 = in + w*TSIZE*ty + tx * TSIZE; uint64_t *op0 = tmp; /* out + h*TSIZE*tx + ty*TSIZE; */ /* copy/transpose to tmp */ for (y = 0; y < TSIZE; y += 2) { /* for (x=0;xbuf; uint64_t *dout = (uint64_t*) out; ffts_plan_t *plan; int i; size_t j; plan = p->plans[0]; for (j = 0; j < p->Ns[0]; j++) { plan->transform(plan, din + (j * p->Ms[0]), buf + (j * p->Ms[0])); } ffts_transpose(buf, dout, p->Ms[0], p->Ns[0], p->transpose_buf); for (i = 1; i < p->rank; i++) { plan = p->plans[i]; for (j = 0; j < p->Ns[i]; j++) { plan->transform(plan, dout + (j * p->Ms[i]), buf + (j * p->Ms[i])); } ffts_transpose(buf, dout, p->Ms[i], p->Ns[i], p->transpose_buf); } } ffts_plan_t *ffts_init_nd(int rank, size_t *Ns, int sign) { ffts_plan_t *p; size_t vol; int i; p = calloc(1, sizeof(*p)); if (!p) { return NULL; } p->transform = &ffts_execute_nd; p->destroy = &ffts_free_nd; p->rank = rank; p->Ms = malloc(rank * sizeof(*p->Ms)); if (!p->Ms) { goto cleanup; } p->Ns = malloc(rank * sizeof(*p->Ns)); if (!p->Ns) { goto cleanup; } vol = p->Ns[0] = Ns[0]; for (i = 1; i < rank; i++) { p->Ns[i] = Ns[i]; vol *= Ns[i]; } p->buf = ffts_aligned_malloc(2 * vol * sizeof(float)); if (!p->buf) { goto cleanup; } p->transpose_buf = ffts_aligned_malloc(2 * 8 * 8 * sizeof(float)); if (!p->transpose_buf) { goto cleanup; } p->plans = calloc(rank, sizeof(*p->plans)); if (!p->plans) { goto cleanup; } for (i = 0; i < rank; i++) { int k; p->Ms[i] = vol / p->Ns[i]; for (k = 0; k < i; k++) { if (p->Ms[k] == p->Ms[i]) { p->plans[i] = p->plans[k]; break; } } if (!p->plans[i]) { p->plans[i] = ffts_init_1d(p->Ms[i], sign); if (!p->plans) { goto cleanup; } } } return p; cleanup: ffts_free_nd(p); return NULL; } ffts_plan_t *ffts_init_2d(size_t N1, size_t N2, int sign) { size_t Ns[2]; Ns[0] = N1; Ns[1] = N2; return ffts_init_nd(2, Ns, sign); }