annotate src/fftw-3.3.5/mpi/rearrange.c @ 169:223a55898ab9 tip default

Add null config files
author Chris Cannam <cannam@all-day-breakfast.com>
date Mon, 02 Mar 2020 14:03:47 +0000
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 #include "ifftw-mpi.h"
cannam@127 22
cannam@127 23 /* common functions for rearrangements of the data for the *-rank1-bigvec
cannam@127 24 solvers */
cannam@127 25
cannam@127 26 static int div_mult(INT b, INT a) {
cannam@127 27 return (a > b && a % b == 0);
cannam@127 28 }
cannam@127 29 static int div_mult2(INT b, INT a, INT n) {
cannam@127 30 return (div_mult(b, a) && div_mult(n, b));
cannam@127 31 }
cannam@127 32
cannam@127 33 int XM(rearrange_applicable)(rearrangement rearrange,
cannam@127 34 ddim dim0, INT vn, int n_pes)
cannam@127 35 {
cannam@127 36 /* note: it is important that cases other than CONTIG be
cannam@127 37 applicable only when the resulting transpose dimension
cannam@127 38 is divisible by n_pes; otherwise, the allocation size
cannam@127 39 returned by the API will be incorrect */
cannam@127 40 return ((rearrange != DISCONTIG || div_mult(n_pes, vn))
cannam@127 41 && (rearrange != SQUARE_BEFORE
cannam@127 42 || div_mult2(dim0.b[IB], vn, n_pes))
cannam@127 43 && (rearrange != SQUARE_AFTER
cannam@127 44 || (dim0.b[IB] != dim0.b[OB]
cannam@127 45 && div_mult2(dim0.b[OB], vn, n_pes)))
cannam@127 46 && (rearrange != SQUARE_MIDDLE
cannam@127 47 || div_mult(dim0.n * n_pes, vn)));
cannam@127 48 }
cannam@127 49
cannam@127 50 INT XM(rearrange_ny)(rearrangement rearrange, ddim dim0, INT vn, int n_pes)
cannam@127 51 {
cannam@127 52 switch (rearrange) {
cannam@127 53 case CONTIG:
cannam@127 54 return vn;
cannam@127 55 case DISCONTIG:
cannam@127 56 return n_pes;
cannam@127 57 case SQUARE_BEFORE:
cannam@127 58 return dim0.b[IB];
cannam@127 59 case SQUARE_AFTER:
cannam@127 60 return dim0.b[OB];
cannam@127 61 case SQUARE_MIDDLE:
cannam@127 62 return dim0.n * n_pes;
cannam@127 63 }
cannam@127 64 return 0;
cannam@127 65 }