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