cannam@167: /*
cannam@167:  * Copyright (c) 2003, 2007-14 Matteo Frigo
cannam@167:  * Copyright (c) 2003, 2007-14 Massachusetts Institute of Technology
cannam@167:  *
cannam@167:  * This program is free software; you can redistribute it and/or modify
cannam@167:  * it under the terms of the GNU General Public License as published by
cannam@167:  * the Free Software Foundation; either version 2 of the License, or
cannam@167:  * (at your option) any later version.
cannam@167:  *
cannam@167:  * This program is distributed in the hope that it will be useful,
cannam@167:  * but WITHOUT ANY WARRANTY; without even the implied warranty of
cannam@167:  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
cannam@167:  * GNU General Public License for more details.
cannam@167:  *
cannam@167:  * You should have received a copy of the GNU General Public License
cannam@167:  * along with this program; if not, write to the Free Software
cannam@167:  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
cannam@167:  *
cannam@167:  */
cannam@167: 
cannam@167: /* out of place 2D copy routines */
cannam@167: #include "kernel/ifftw.h"
cannam@167: 
cannam@167: void X(tile2d)(INT n0l, INT n0u, INT n1l, INT n1u, INT tilesz,
cannam@167: 	       void (*f)(INT n0l, INT n0u, INT n1l, INT n1u, void *args),
cannam@167: 	       void *args)
cannam@167: {
cannam@167:      INT d0, d1;
cannam@167: 
cannam@167:      A(tilesz > 0); /* infinite loops otherwise */
cannam@167:      
cannam@167:  tail:
cannam@167:      d0 = n0u - n0l;
cannam@167:      d1 = n1u - n1l;
cannam@167: 
cannam@167:      if (d0 >= d1 && d0 > tilesz) {
cannam@167: 	  INT n0m = (n0u + n0l) / 2;
cannam@167: 	  X(tile2d)(n0l, n0m, n1l, n1u, tilesz, f, args);
cannam@167: 	  n0l = n0m; goto tail;
cannam@167:      } else if (/* d1 >= d0 && */ d1 > tilesz) {
cannam@167: 	  INT n1m = (n1u + n1l) / 2;
cannam@167: 	  X(tile2d)(n0l, n0u, n1l, n1m, tilesz, f, args);
cannam@167: 	  n1l = n1m; goto tail;
cannam@167:      } else {
cannam@167: 	  f(n0l, n0u, n1l, n1u, args);
cannam@167:      }
cannam@167: }
cannam@167: 
cannam@167: INT X(compute_tilesz)(INT vl, int how_many_tiles_in_cache)
cannam@167: {
cannam@167:      return X(isqrt)(CACHESIZE / 
cannam@167: 		     (((INT)sizeof(R)) * vl * (INT)how_many_tiles_in_cache));
cannam@167: }