|
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 /* During planning, if any process fails to create a plan then
|
|
Chris@42
|
24 all of the processes must fail. This synchronization is implemented
|
|
Chris@42
|
25 by the following routine.
|
|
Chris@42
|
26
|
|
Chris@42
|
27 Instead of
|
|
Chris@42
|
28 if (failure) goto nada;
|
|
Chris@42
|
29 we instead do:
|
|
Chris@42
|
30 if (any_true(failure, comm)) goto nada;
|
|
Chris@42
|
31 */
|
|
Chris@42
|
32
|
|
Chris@42
|
33 int XM(any_true)(int condition, MPI_Comm comm)
|
|
Chris@42
|
34 {
|
|
Chris@42
|
35 int result;
|
|
Chris@42
|
36 MPI_Allreduce(&condition, &result, 1, MPI_INT, MPI_LOR, comm);
|
|
Chris@42
|
37 return result;
|
|
Chris@42
|
38 }
|
|
Chris@42
|
39
|
|
Chris@42
|
40 /***********************************************************************/
|
|
Chris@42
|
41
|
|
Chris@42
|
42 #if defined(FFTW_DEBUG)
|
|
Chris@42
|
43 /* for debugging, we include an assertion to make sure that
|
|
Chris@42
|
44 MPI problems all produce equal hashes, as checked by this routine: */
|
|
Chris@42
|
45
|
|
Chris@42
|
46 int XM(md5_equal)(md5 m, MPI_Comm comm)
|
|
Chris@42
|
47 {
|
|
Chris@42
|
48 unsigned long s0[4];
|
|
Chris@42
|
49 int i, eq_me, eq_all;
|
|
Chris@42
|
50
|
|
Chris@42
|
51 X(md5end)(&m);
|
|
Chris@42
|
52 for (i = 0; i < 4; ++i) s0[i] = m.s[i];
|
|
Chris@42
|
53 MPI_Bcast(s0, 4, MPI_UNSIGNED_LONG, 0, comm);
|
|
Chris@42
|
54 for (i = 0; i < 4 && s0[i] == m.s[i]; ++i) ;
|
|
Chris@42
|
55 eq_me = i == 4;
|
|
Chris@42
|
56 MPI_Allreduce(&eq_me, &eq_all, 1, MPI_INT, MPI_LAND, comm);
|
|
Chris@42
|
57 return eq_all;
|
|
Chris@42
|
58 }
|
|
Chris@42
|
59 #endif
|
