cannam@95: /*
cannam@95:  * Copyright (c) 2003, 2007-11 Matteo Frigo
cannam@95:  * Copyright (c) 2003, 2007-11 Massachusetts Institute of Technology
cannam@95:  *
cannam@95:  * This program is free software; you can redistribute it and/or modify
cannam@95:  * it under the terms of the GNU General Public License as published by
cannam@95:  * the Free Software Foundation; either version 2 of the License, or
cannam@95:  * (at your option) any later version.
cannam@95:  *
cannam@95:  * This program is distributed in the hope that it will be useful,
cannam@95:  * but WITHOUT ANY WARRANTY; without even the implied warranty of
cannam@95:  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
cannam@95:  * GNU General Public License for more details.
cannam@95:  *
cannam@95:  * You should have received a copy of the GNU General Public License
cannam@95:  * along with this program; if not, write to the Free Software
cannam@95:  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
cannam@95:  *
cannam@95:  */
cannam@95: 
cannam@95: #include "ifftw.h"
cannam@95: 
cannam@95: /* in place square transposition, iterative */
cannam@95: void X(transpose)(R *I, INT n, INT s0, INT s1, INT vl)
cannam@95: {
cannam@95:      INT i0, i1, v;
cannam@95: 
cannam@95:      switch (vl) {
cannam@95: 	 case 1:
cannam@95: 	      for (i1 = 1; i1 < n; ++i1) {
cannam@95: 		   for (i0 = 0; i0 < i1; ++i0) {
cannam@95: 			R x0 = I[i1 * s0 + i0 * s1];
cannam@95: 			R y0 = I[i1 * s1 + i0 * s0];
cannam@95: 			I[i1 * s1 + i0 * s0] = x0;
cannam@95: 			I[i1 * s0 + i0 * s1] = y0;
cannam@95: 		   }
cannam@95: 	      }
cannam@95: 	      break;
cannam@95: 	 case 2:
cannam@95: 	      for (i1 = 1; i1 < n; ++i1) {
cannam@95: 		   for (i0 = 0; i0 < i1; ++i0) {
cannam@95: 			R x0 = I[i1 * s0 + i0 * s1];
cannam@95: 			R x1 = I[i1 * s0 + i0 * s1 + 1];
cannam@95: 			R y0 = I[i1 * s1 + i0 * s0];
cannam@95: 			R y1 = I[i1 * s1 + i0 * s0 + 1];
cannam@95: 			I[i1 * s1 + i0 * s0] = x0;
cannam@95: 			I[i1 * s1 + i0 * s0 + 1] = x1;
cannam@95: 			I[i1 * s0 + i0 * s1] = y0;
cannam@95: 			I[i1 * s0 + i0 * s1 + 1] = y1;
cannam@95: 		   }
cannam@95: 	      }
cannam@95: 	      break;
cannam@95: 	 default:
cannam@95: 	      for (i1 = 1; i1 < n; ++i1) {
cannam@95: 		   for (i0 = 0; i0 < i1; ++i0) {
cannam@95: 			for (v = 0; v < vl; ++v) {
cannam@95: 			     R x0 = I[i1 * s0 + i0 * s1 + v];
cannam@95: 			     R y0 = I[i1 * s1 + i0 * s0 + v];
cannam@95: 			     I[i1 * s1 + i0 * s0 + v] = x0;
cannam@95: 			     I[i1 * s0 + i0 * s1 + v] = y0;
cannam@95: 			}
cannam@95: 		   }
cannam@95: 	      }
cannam@95: 	      break;
cannam@95:      }
cannam@95: }
cannam@95: 
cannam@95: struct transpose_closure {
cannam@95:      R *I;
cannam@95:      INT s0, s1, vl, tilesz;
cannam@95:      R *buf0, *buf1; 
cannam@95: };
cannam@95: 
cannam@95: static void dotile(INT n0l, INT n0u, INT n1l, INT n1u, void *args)
cannam@95: {
cannam@95:      struct transpose_closure *k = (struct transpose_closure *)args;
cannam@95:      R *I = k->I;
cannam@95:      INT s0 = k->s0, s1 = k->s1, vl = k->vl;
cannam@95:      INT i0, i1, v;
cannam@95: 
cannam@95:      switch (vl) {
cannam@95: 	 case 1:
cannam@95: 	      for (i1 = n1l; i1 < n1u; ++i1) {
cannam@95: 		   for (i0 = n0l; i0 < n0u; ++i0) {
cannam@95: 			R x0 = I[i1 * s0 + i0 * s1];
cannam@95: 			R y0 = I[i1 * s1 + i0 * s0];
cannam@95: 			I[i1 * s1 + i0 * s0] = x0;
cannam@95: 			I[i1 * s0 + i0 * s1] = y0;
cannam@95: 		   }
cannam@95: 	      }
cannam@95: 	      break;
cannam@95: 	 case 2:
cannam@95: 	      for (i1 = n1l; i1 < n1u; ++i1) {
cannam@95: 		   for (i0 = n0l; i0 < n0u; ++i0) {
cannam@95: 			R x0 = I[i1 * s0 + i0 * s1];
cannam@95: 			R x1 = I[i1 * s0 + i0 * s1 + 1];
cannam@95: 			R y0 = I[i1 * s1 + i0 * s0];
cannam@95: 			R y1 = I[i1 * s1 + i0 * s0 + 1];
cannam@95: 			I[i1 * s1 + i0 * s0] = x0;
cannam@95: 			I[i1 * s1 + i0 * s0 + 1] = x1;
cannam@95: 			I[i1 * s0 + i0 * s1] = y0;
cannam@95: 			I[i1 * s0 + i0 * s1 + 1] = y1;
cannam@95: 		   }
cannam@95: 	      }
cannam@95: 	      break;
cannam@95: 	 default:
cannam@95: 	      for (i1 = n1l; i1 < n1u; ++i1) {
cannam@95: 		   for (i0 = n0l; i0 < n0u; ++i0) {
cannam@95: 			for (v = 0; v < vl; ++v) {
cannam@95: 			     R x0 = I[i1 * s0 + i0 * s1 + v];
cannam@95: 			     R y0 = I[i1 * s1 + i0 * s0 + v];
cannam@95: 			     I[i1 * s1 + i0 * s0 + v] = x0;
cannam@95: 			     I[i1 * s0 + i0 * s1 + v] = y0;
cannam@95: 			}
cannam@95: 		   }
cannam@95: 	      }
cannam@95:      }
cannam@95: }
cannam@95: 
cannam@95: static void dotile_buf(INT n0l, INT n0u, INT n1l, INT n1u, void *args)
cannam@95: {
cannam@95:      struct transpose_closure *k = (struct transpose_closure *)args;
cannam@95:      X(cpy2d_ci)(k->I + n0l * k->s0 + n1l * k->s1,
cannam@95: 		 k->buf0,
cannam@95: 		 n0u - n0l, k->s0, k->vl,
cannam@95: 		 n1u - n1l, k->s1, k->vl * (n0u - n0l),
cannam@95: 		 k->vl);
cannam@95:      X(cpy2d_ci)(k->I + n0l * k->s1 + n1l * k->s0,
cannam@95: 		 k->buf1,
cannam@95: 		 n0u - n0l, k->s1, k->vl,
cannam@95: 		 n1u - n1l, k->s0, k->vl * (n0u - n0l),
cannam@95: 		 k->vl);
cannam@95:      X(cpy2d_co)(k->buf1,
cannam@95: 		 k->I + n0l * k->s0 + n1l * k->s1,
cannam@95: 		 n0u - n0l, k->vl, k->s0,
cannam@95: 		 n1u - n1l, k->vl * (n0u - n0l), k->s1,
cannam@95: 		 k->vl);
cannam@95:      X(cpy2d_co)(k->buf0,
cannam@95: 		 k->I + n0l * k->s1 + n1l * k->s0,
cannam@95: 		 n0u - n0l, k->vl, k->s1,
cannam@95: 		 n1u - n1l, k->vl * (n0u - n0l), k->s0,
cannam@95: 		 k->vl);
cannam@95: }
cannam@95: 
cannam@95: static void transpose_rec(R *I, INT n,
cannam@95: 			  void (*f)(INT n0l, INT n0u, INT n1l, INT n1u,
cannam@95: 				    void *args),
cannam@95: 			  struct transpose_closure *k)
cannam@95: {
cannam@95:    tail:
cannam@95:      if (n > 1) {
cannam@95: 	  INT n2 = n / 2;
cannam@95: 	  k->I = I;
cannam@95: 	  X(tile2d)(0, n2, n2, n, k->tilesz, f, k);
cannam@95: 	  transpose_rec(I, n2, f, k);
cannam@95: 	  I += n2 * (k->s0 + k->s1); n -= n2; goto tail;
cannam@95:      }
cannam@95: }
cannam@95: 
cannam@95: void X(transpose_tiled)(R *I, INT n, INT s0, INT s1, INT vl) 
cannam@95: {
cannam@95:      struct transpose_closure k;
cannam@95:      k.s0 = s0;
cannam@95:      k.s1 = s1;
cannam@95:      k.vl = vl;
cannam@95:      /* two blocks must be in cache, to be swapped */
cannam@95:      k.tilesz = X(compute_tilesz)(vl, 2);
cannam@95:      k.buf0 = k.buf1 = 0; /* unused */
cannam@95:      transpose_rec(I, n, dotile, &k);
cannam@95: }
cannam@95: 
cannam@95: void X(transpose_tiledbuf)(R *I, INT n, INT s0, INT s1, INT vl) 
cannam@95: {
cannam@95:      struct transpose_closure k;
cannam@95:      /* Assume that the the rows of I conflict into the same cache
cannam@95:         lines, and therefore we don't need to reserve cache space for
cannam@95:         the input.  If the rows don't conflict, there is no reason
cannam@95: 	to use tiledbuf at all.*/
cannam@95:      R buf0[CACHESIZE / (2 * sizeof(R))];
cannam@95:      R buf1[CACHESIZE / (2 * sizeof(R))];
cannam@95:      k.s0 = s0;
cannam@95:      k.s1 = s1;
cannam@95:      k.vl = vl;
cannam@95:      k.tilesz = X(compute_tilesz)(vl, 2);
cannam@95:      k.buf0 = buf0;
cannam@95:      k.buf1 = buf1;
cannam@95:      A(k.tilesz * k.tilesz * vl * sizeof(R) <= sizeof(buf0));
cannam@95:      A(k.tilesz * k.tilesz * vl * sizeof(R) <= sizeof(buf1));
cannam@95:      transpose_rec(I, n, dotile_buf, &k);
cannam@95: }
cannam@95: