annotate src/fftw-3.3.5/kernel/cpy2d-pair.c @ 148:b4bfdf10c4b3

Update Win64 capnp builds to v0.6
author Chris Cannam <cannam@all-day-breakfast.com>
date Mon, 22 May 2017 18:56:49 +0100
parents 7867fa7e1b6b
children
rev   line source
cannam@127 1 /*
cannam@127 2 * Copyright (c) 2003, 2007-14 Matteo Frigo
cannam@127 3 * Copyright (c) 2003, 2007-14 Massachusetts Institute of Technology
cannam@127 4 *
cannam@127 5 * This program is free software; you can redistribute it and/or modify
cannam@127 6 * it under the terms of the GNU General Public License as published by
cannam@127 7 * the Free Software Foundation; either version 2 of the License, or
cannam@127 8 * (at your option) any later version.
cannam@127 9 *
cannam@127 10 * This program is distributed in the hope that it will be useful,
cannam@127 11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
cannam@127 12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
cannam@127 13 * GNU General Public License for more details.
cannam@127 14 *
cannam@127 15 * You should have received a copy of the GNU General Public License
cannam@127 16 * along with this program; if not, write to the Free Software
cannam@127 17 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
cannam@127 18 *
cannam@127 19 */
cannam@127 20
cannam@127 21 /* out of place copy routines for pairs of isomorphic 2D arrays */
cannam@127 22 #include "ifftw.h"
cannam@127 23
cannam@127 24 void X(cpy2d_pair)(R *I0, R *I1, R *O0, R *O1,
cannam@127 25 INT n0, INT is0, INT os0,
cannam@127 26 INT n1, INT is1, INT os1)
cannam@127 27 {
cannam@127 28 INT i0, i1;
cannam@127 29
cannam@127 30 for (i1 = 0; i1 < n1; ++i1)
cannam@127 31 for (i0 = 0; i0 < n0; ++i0) {
cannam@127 32 R x0 = I0[i0 * is0 + i1 * is1];
cannam@127 33 R x1 = I1[i0 * is0 + i1 * is1];
cannam@127 34 O0[i0 * os0 + i1 * os1] = x0;
cannam@127 35 O1[i0 * os0 + i1 * os1] = x1;
cannam@127 36 }
cannam@127 37 }
cannam@127 38
cannam@127 39 void X(zero1d_pair)(R *O0, R *O1, INT n0, INT os0)
cannam@127 40 {
cannam@127 41 INT i0;
cannam@127 42 for (i0 = 0; i0 < n0; ++i0) {
cannam@127 43 O0[i0 * os0] = 0;
cannam@127 44 O1[i0 * os0] = 0;
cannam@127 45 }
cannam@127 46 }
cannam@127 47
cannam@127 48 /* like cpy2d_pair, but read input contiguously if possible */
cannam@127 49 void X(cpy2d_pair_ci)(R *I0, R *I1, R *O0, R *O1,
cannam@127 50 INT n0, INT is0, INT os0,
cannam@127 51 INT n1, INT is1, INT os1)
cannam@127 52 {
cannam@127 53 if (IABS(is0) < IABS(is1)) /* inner loop is for n0 */
cannam@127 54 X(cpy2d_pair) (I0, I1, O0, O1, n0, is0, os0, n1, is1, os1);
cannam@127 55 else
cannam@127 56 X(cpy2d_pair) (I0, I1, O0, O1, n1, is1, os1, n0, is0, os0);
cannam@127 57 }
cannam@127 58
cannam@127 59 /* like cpy2d_pair, but write output contiguously if possible */
cannam@127 60 void X(cpy2d_pair_co)(R *I0, R *I1, R *O0, R *O1,
cannam@127 61 INT n0, INT is0, INT os0,
cannam@127 62 INT n1, INT is1, INT os1)
cannam@127 63 {
cannam@127 64 if (IABS(os0) < IABS(os1)) /* inner loop is for n0 */
cannam@127 65 X(cpy2d_pair) (I0, I1, O0, O1, n0, is0, os0, n1, is1, os1);
cannam@127 66 else
cannam@127 67 X(cpy2d_pair) (I0, I1, O0, O1, n1, is1, os1, n0, is0, os0);
cannam@127 68 }