cannam@95: /*
cannam@95:  * Copyright (c) 2003, 2007-11 Matteo Frigo
cannam@95:  * Copyright (c) 2003, 2007-11 Massachusetts Institute of Technology
cannam@95:  *
cannam@95:  * This program is free software; you can redistribute it and/or modify
cannam@95:  * it under the terms of the GNU General Public License as published by
cannam@95:  * the Free Software Foundation; either version 2 of the License, or
cannam@95:  * (at your option) any later version.
cannam@95:  *
cannam@95:  * This program is distributed in the hope that it will be useful,
cannam@95:  * but WITHOUT ANY WARRANTY; without even the implied warranty of
cannam@95:  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
cannam@95:  * GNU General Public License for more details.
cannam@95:  *
cannam@95:  * You should have received a copy of the GNU General Public License
cannam@95:  * along with this program; if not, write to the Free Software
cannam@95:  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
cannam@95:  *
cannam@95:  */
cannam@95: 
cannam@95: #include "fftw3-mpi.h"
cannam@95: #include "ifftw-mpi.h"
cannam@95: #include <string.h>
cannam@95: 
cannam@95: #if SIZEOF_SIZE_T == SIZEOF_UNSIGNED_INT
cannam@95: #  define FFTW_MPI_SIZE_T MPI_UNSIGNED
cannam@95: #elif SIZEOF_SIZE_T == SIZEOF_UNSIGNED_LONG
cannam@95: #  define FFTW_MPI_SIZE_T MPI_UNSIGNED_LONG
cannam@95: #elif SIZEOF_SIZE_T == SIZEOF_UNSIGNED_LONG_LONG
cannam@95: #  define FFTW_MPI_SIZE_T MPI_UNSIGNED_LONG_LONG
cannam@95: #else
cannam@95: #  error MPI type for size_t is unknown
cannam@95: #  define FFTW_MPI_SIZE_T MPI_UNSIGNED_LONG
cannam@95: #endif
cannam@95: 
cannam@95: /* Import wisdom from all processes to process 0, as prelude to
cannam@95:    exporting a single wisdom file (this is convenient when we are
cannam@95:    running on identical processors, to avoid the annoyance of having
cannam@95:    per-process wisdom files).  In order to make the time for this
cannam@95:    operation logarithmic in the number of processors (rather than
cannam@95:    linear), we employ a tree reduction algorithm.  This means that the
cannam@95:    wisdom is modified on processes other than root, which shouldn't
cannam@95:    matter in practice. */
cannam@95: void XM(gather_wisdom)(MPI_Comm comm_)
cannam@95: {
cannam@95:      MPI_Comm comm, comm2;
cannam@95:      int my_pe, n_pes;
cannam@95:      char *wis;
cannam@95:      size_t wislen;
cannam@95:      MPI_Status status;
cannam@95: 
cannam@95:      MPI_Comm_dup(comm_, &comm);
cannam@95:      MPI_Comm_rank(comm, &my_pe);
cannam@95:      MPI_Comm_size(comm, &n_pes);
cannam@95: 
cannam@95:      if (n_pes > 2) { /* recursively split into even/odd processes */
cannam@95: 	  MPI_Comm_split(comm, my_pe % 2, my_pe, &comm2);
cannam@95: 	  XM(gather_wisdom)(comm2);
cannam@95: 	  MPI_Comm_free(&comm2);
cannam@95:      }
cannam@95:      if (n_pes > 1 && my_pe < 2) { /* import process 1 -> 0 */
cannam@95: 	  if (my_pe == 1) {
cannam@95: 	       wis = X(export_wisdom_to_string)();
cannam@95: 	       wislen = strlen(wis) + 1;
cannam@95: 	       MPI_Send(&wislen, 1, FFTW_MPI_SIZE_T, 0, 111, comm);
cannam@95: 	       MPI_Send(wis, wislen, MPI_CHAR, 0, 222, comm);
cannam@95: 	       free(wis);
cannam@95: 	  }
cannam@95: 	  else /* my_pe == 0 */ {
cannam@95: 	       MPI_Recv(&wislen, 1, FFTW_MPI_SIZE_T, 1, 111, comm, &status);
cannam@95: 	       wis = (char *) MALLOC(wislen * sizeof(char), OTHER);
cannam@95: 	       MPI_Recv(wis, wislen, MPI_CHAR, 1, 222, comm, &status);
cannam@95: 	       if (!X(import_wisdom_from_string)(wis))
cannam@95: 		    MPI_Abort(comm, 1);
cannam@95: 	       X(ifree)(wis);
cannam@95: 	  }
cannam@95:      }
cannam@95:      MPI_Comm_free(&comm);
cannam@95: }
cannam@95: 
cannam@95: /* broadcast wisdom from process 0 to all other processes; this
cannam@95:    is useful so that we can import wisdom once and not worry
cannam@95:    about parallel I/O or process-specific wisdom, although of
cannam@95:    course it assumes that all the processes have identical
cannam@95:    performance characteristics (i.e. identical hardware). */
cannam@95: void XM(broadcast_wisdom)(MPI_Comm comm_)
cannam@95: {
cannam@95:      MPI_Comm comm;
cannam@95:      int my_pe;
cannam@95:      char *wis;
cannam@95:      size_t wislen;
cannam@95: 
cannam@95:      MPI_Comm_dup(comm_, &comm);
cannam@95:      MPI_Comm_rank(comm, &my_pe);
cannam@95: 
cannam@95:      if (my_pe != 0) {
cannam@95: 	  MPI_Bcast(&wislen, 1, FFTW_MPI_SIZE_T, 0, comm);
cannam@95: 	  wis = (char *) MALLOC(wislen * sizeof(char), OTHER);
cannam@95: 	  MPI_Bcast(wis, wislen, MPI_CHAR, 0, comm);
cannam@95: 	  if (!X(import_wisdom_from_string)(wis))
cannam@95: 	       MPI_Abort(comm, 1);
cannam@95: 	  X(ifree)(wis);
cannam@95:      }
cannam@95:      else /* my_pe == 0 */ {
cannam@95: 	  wis = X(export_wisdom_to_string)();
cannam@95: 	  wislen = strlen(wis) + 1;
cannam@95: 	  MPI_Bcast(&wislen, 1, FFTW_MPI_SIZE_T, 0, comm);
cannam@95: 	  MPI_Bcast(wis, wislen, MPI_CHAR, 0, comm);
cannam@95: 	  X(free)(wis);
cannam@95:      }
cannam@95:      MPI_Comm_free(&comm);
cannam@95: }