graphnbrcntf.c

MPICH是MPI的重要研究,提供了一系列的接口函数,为并行计算的实现提供了编程环境.

/* graph_nbr_cnt.c */
/* Custom Fortran interface file */
#include "mpi_fortimpl.h"

#if defined(MPI_BUILD_PROFILING) || defined(HAVE_WEAK_SYMBOLS)

#if defined(HAVE_WEAK_SYMBOLS)
#if defined(HAVE_PRAGMA_WEAK)
#if defined(F77_NAME_UPPER)
#pragma weak MPI_GRAPH_NEIGHBORS_COUNT = PMPI_GRAPH_NEIGHBORS_COUNT
void MPI_GRAPH_NEIGHBORS_COUNT ( MPI_Fint *, MPI_Fint *, MPI_Fint *, MPI_Fint * );
#elif defined(F77_NAME_LOWER_2USCORE)
#pragma weak mpi_graph_neighbors_count__ = pmpi_graph_neighbors_count__
void mpi_graph_neighbors_count__ ( MPI_Fint *, MPI_Fint *, MPI_Fint *, MPI_Fint * );
#elif !defined(F77_NAME_LOWER_USCORE)
#pragma weak mpi_graph_neighbors_count = pmpi_graph_neighbors_count
void mpi_graph_neighbors_count ( MPI_Fint *, MPI_Fint *, MPI_Fint *, MPI_Fint * );
#else
#pragma weak mpi_graph_neighbors_count_ = pmpi_graph_neighbors_count_
void mpi_graph_neighbors_count_ ( MPI_Fint *, MPI_Fint *, MPI_Fint *, MPI_Fint * );
#endif

#elif defined(HAVE_PRAGMA_HP_SEC_DEF)
#if defined(F77_NAME_UPPER)
#pragma _HP_SECONDARY_DEF PMPI_GRAPH_NEIGHBORS_COUNT  MPI_GRAPH_NEIGHBORS_COUNT
#elif defined(F77_NAME_LOWER_2USCORE)
#pragma _HP_SECONDARY_DEF pmpi_graph_neighbors_count__  mpi_graph_neighbors_count__
#elif !defined(F77_NAME_LOWER_USCORE)
#pragma _HP_SECONDARY_DEF pmpi_graph_neighbors_count  mpi_graph_neighbors_count
#else
#pragma _HP_SECONDARY_DEF pmpi_graph_neighbors_count_  mpi_graph_neighbors_count_
#endif

#elif defined(HAVE_PRAGMA_CRI_DUP)
#if defined(F77_NAME_UPPER)
#pragma _CRI duplicate MPI_GRAPH_NEIGHBORS_COUNT as PMPI_GRAPH_NEIGHBORS_COUNT
#elif defined(F77_NAME_LOWER_2USCORE)
#pragma _CRI duplicate mpi_graph_neighbors_count__ as pmpi_graph_neighbors_count__
#elif !defined(F77_NAME_LOWER_USCORE)
#pragma _CRI duplicate mpi_graph_neighbors_count as pmpi_graph_neighbors_count
#else
#pragma _CRI duplicate mpi_graph_neighbors_count_ as pmpi_graph_neighbors_count_
#endif

/* end of weak pragmas */
#endif

/* Include mapping from MPI->PMPI */
#include "mpiprof.h"
/* Insert the prototypes for the PMPI routines */
#undef __MPI_BINDINGS
#include "binding.h"
#endif

#ifdef F77_NAME_UPPER
#define mpi_graph_neighbors_count_ PMPI_GRAPH_NEIGHBORS_COUNT
#elif defined(F77_NAME_LOWER_2USCORE)
#define mpi_graph_neighbors_count_ pmpi_graph_neighbors_count__
#elif !defined(F77_NAME_LOWER_USCORE)
#define mpi_graph_neighbors_count_ pmpi_graph_neighbors_count
#else
#define mpi_graph_neighbors_count_ pmpi_graph_neighbors_count_
#endif

#else

#ifdef F77_NAME_UPPER
#define mpi_graph_neighbors_count_ MPI_GRAPH_NEIGHBORS_COUNT
#elif defined(F77_NAME_LOWER_2USCORE)
#define mpi_graph_neighbors_count_ mpi_graph_neighbors_count__
#elif !defined(F77_NAME_LOWER_USCORE)
#define mpi_graph_neighbors_count_ mpi_graph_neighbors_count
#endif
#endif


/* Prototype to suppress warnings about missing prototypes */
FORTRAN_API void FORT_CALL mpi_graph_neighbors_count_ ( MPI_Fint *, MPI_Fint *, 
                                            MPI_Fint *, MPI_Fint * );

FORTRAN_API void FORT_CALL mpi_graph_neighbors_count_ ( MPI_Fint *comm, MPI_Fint *rank, MPI_Fint *nneighbors, MPI_Fint *__ierr )
{
    int lnneighbors;

    *__ierr = MPI_Graph_neighbors_count(MPI_Comm_f2c(*comm), (int)*rank,
                                        &lnneighbors);
    *nneighbors = (MPI_Fint)lnneighbors;
}