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