Chris@19: /* Chris@19: * Copyright (c) 2003, 2007-14 Matteo Frigo Chris@19: * Copyright (c) 2003, 2007-14 Massachusetts Institute of Technology Chris@19: * Chris@19: * This program is free software; you can redistribute it and/or modify Chris@19: * it under the terms of the GNU General Public License as published by Chris@19: * the Free Software Foundation; either version 2 of the License, or Chris@19: * (at your option) any later version. Chris@19: * Chris@19: * This program is distributed in the hope that it will be useful, Chris@19: * but WITHOUT ANY WARRANTY; without even the implied warranty of Chris@19: * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the Chris@19: * GNU General Public License for more details. Chris@19: * Chris@19: * You should have received a copy of the GNU General Public License Chris@19: * along with this program; if not, write to the Free Software Chris@19: * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA Chris@19: * Chris@19: */ Chris@19: Chris@19: #include "ifftw-mpi.h" Chris@19: Chris@19: /* During planning, if any process fails to create a plan then Chris@19: all of the processes must fail. This synchronization is implemented Chris@19: by the following routine. Chris@19: Chris@19: Instead of Chris@19: if (failure) goto nada; Chris@19: we instead do: Chris@19: if (any_true(failure, comm)) goto nada; Chris@19: */ Chris@19: Chris@19: int XM(any_true)(int condition, MPI_Comm comm) Chris@19: { Chris@19: int result; Chris@19: MPI_Allreduce(&condition, &result, 1, MPI_INT, MPI_LOR, comm); Chris@19: return result; Chris@19: } Chris@19: Chris@19: /***********************************************************************/ Chris@19: Chris@19: #if defined(FFTW_DEBUG) Chris@19: /* for debugging, we include an assertion to make sure that Chris@19: MPI problems all produce equal hashes, as checked by this routine: */ Chris@19: Chris@19: int XM(md5_equal)(md5 m, MPI_Comm comm) Chris@19: { Chris@19: unsigned long s0[4]; Chris@19: int i, eq_me, eq_all; Chris@19: Chris@19: X(md5end)(&m); Chris@19: for (i = 0; i < 4; ++i) s0[i] = m.s[i]; Chris@19: MPI_Bcast(s0, 4, MPI_UNSIGNED_LONG, 0, comm); Chris@19: for (i = 0; i < 4 && s0[i] == m.s[i]; ++i) ; Chris@19: eq_me = i == 4; Chris@19: MPI_Allreduce(&eq_me, &eq_all, 1, MPI_INT, MPI_LAND, comm); Chris@19: return eq_all; Chris@19: } Chris@19: #endif