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