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