annotate src/fftw-3.3.3/mpi/rearrange.c @ 23:619f715526df sv_v2.1

Update Vamp plugin SDK to 2.5
author Chris Cannam
date Thu, 09 May 2013 10:52:46 +0100
parents 37bf6b4a2645
children
rev   line source
Chris@10 1 /*
Chris@10 2 * Copyright (c) 2003, 2007-11 Matteo Frigo
Chris@10 3 * Copyright (c) 2003, 2007-11 Massachusetts Institute of Technology
Chris@10 4 *
Chris@10 5 * This program is free software; you can redistribute it and/or modify
Chris@10 6 * it under the terms of the GNU General Public License as published by
Chris@10 7 * the Free Software Foundation; either version 2 of the License, or
Chris@10 8 * (at your option) any later version.
Chris@10 9 *
Chris@10 10 * This program is distributed in the hope that it will be useful,
Chris@10 11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
Chris@10 12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
Chris@10 13 * GNU General Public License for more details.
Chris@10 14 *
Chris@10 15 * You should have received a copy of the GNU General Public License
Chris@10 16 * along with this program; if not, write to the Free Software
Chris@10 17 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
Chris@10 18 *
Chris@10 19 */
Chris@10 20
Chris@10 21 #include "ifftw-mpi.h"
Chris@10 22
Chris@10 23 /* common functions for rearrangements of the data for the *-rank1-bigvec
Chris@10 24 solvers */
Chris@10 25
Chris@10 26 static int div_mult(INT b, INT a) {
Chris@10 27 return (a > b && a % b == 0);
Chris@10 28 }
Chris@10 29 static int div_mult2(INT b, INT a, INT n) {
Chris@10 30 return (div_mult(b, a) && div_mult(n, b));
Chris@10 31 }
Chris@10 32
Chris@10 33 int XM(rearrange_applicable)(rearrangement rearrange,
Chris@10 34 ddim dim0, INT vn, int n_pes)
Chris@10 35 {
Chris@10 36 /* note: it is important that cases other than CONTIG be
Chris@10 37 applicable only when the resulting transpose dimension
Chris@10 38 is divisible by n_pes; otherwise, the allocation size
Chris@10 39 returned by the API will be incorrect */
Chris@10 40 return ((rearrange != DISCONTIG || div_mult(n_pes, vn))
Chris@10 41 && (rearrange != SQUARE_BEFORE
Chris@10 42 || div_mult2(dim0.b[IB], vn, n_pes))
Chris@10 43 && (rearrange != SQUARE_AFTER
Chris@10 44 || (dim0.b[IB] != dim0.b[OB]
Chris@10 45 && div_mult2(dim0.b[OB], vn, n_pes)))
Chris@10 46 && (rearrange != SQUARE_MIDDLE
Chris@10 47 || div_mult(dim0.n * n_pes, vn)));
Chris@10 48 }
Chris@10 49
Chris@10 50 INT XM(rearrange_ny)(rearrangement rearrange, ddim dim0, INT vn, int n_pes)
Chris@10 51 {
Chris@10 52 switch (rearrange) {
Chris@10 53 case CONTIG:
Chris@10 54 return vn;
Chris@10 55 case DISCONTIG:
Chris@10 56 return n_pes;
Chris@10 57 case SQUARE_BEFORE:
Chris@10 58 return dim0.b[IB];
Chris@10 59 case SQUARE_AFTER:
Chris@10 60 return dim0.b[OB];
Chris@10 61 case SQUARE_MIDDLE:
Chris@10 62 return dim0.n * n_pes;
Chris@10 63 }
Chris@10 64 return 0;
Chris@10 65 }