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: /* out of place 2D copy routines */
Chris@42: #include "ifftw.h"
Chris@42: 
Chris@42: void X(tile2d)(INT n0l, INT n0u, INT n1l, INT n1u, INT tilesz,
Chris@42: 	       void (*f)(INT n0l, INT n0u, INT n1l, INT n1u, void *args),
Chris@42: 	       void *args)
Chris@42: {
Chris@42:      INT d0, d1;
Chris@42: 
Chris@42:      A(tilesz > 0); /* infinite loops otherwise */
Chris@42:      
Chris@42:  tail:
Chris@42:      d0 = n0u - n0l;
Chris@42:      d1 = n1u - n1l;
Chris@42: 
Chris@42:      if (d0 >= d1 && d0 > tilesz) {
Chris@42: 	  INT n0m = (n0u + n0l) / 2;
Chris@42: 	  X(tile2d)(n0l, n0m, n1l, n1u, tilesz, f, args);
Chris@42: 	  n0l = n0m; goto tail;
Chris@42:      } else if (/* d1 >= d0 && */ d1 > tilesz) {
Chris@42: 	  INT n1m = (n1u + n1l) / 2;
Chris@42: 	  X(tile2d)(n0l, n0u, n1l, n1m, tilesz, f, args);
Chris@42: 	  n1l = n1m; goto tail;
Chris@42:      } else {
Chris@42: 	  f(n0l, n0u, n1l, n1u, args);
Chris@42:      }
Chris@42: }
Chris@42: 
Chris@42: INT X(compute_tilesz)(INT vl, int how_many_tiles_in_cache)
Chris@42: {
Chris@42:      return X(isqrt)(CACHESIZE / 
Chris@42: 		     (((INT)sizeof(R)) * vl * (INT)how_many_tiles_in_cache));
Chris@42: }