root/ompi/mpi/c/graph_neighbors_count.c

DEFINITIONS

1. MPI_Graph_neighbors_count

   1 /*
   2  * Copyright (c) 2004-2007 The Trustees of Indiana University and Indiana
   3  *                         University Research and Technology
   4  *                         Corporation.  All rights reserved.
   5  * Copyright (c) 2004-2013 The University of Tennessee and The University
   6  *                         of Tennessee Research Foundation.  All rights
   7  *                         reserved.
   8  * Copyright (c) 2004-2008 High Performance Computing Center Stuttgart,
   9  *                         University of Stuttgart.  All rights reserved.
  10  * Copyright (c) 2004-2005 The Regents of the University of California.
  11  *                         All rights reserved.
  12  * Copyright (c) 2007      Cisco Systems, Inc.  All rights reserved.
  13  * Copyright (c) 2012-2013 Inria.  All rights reserved.
  14  * Copyright (c) 2015      Research Organization for Information Science
  15  *                         and Technology (RIST). All rights reserved.
  16  * $COPYRIGHT$
  17  *
  18  * Additional copyrights may follow
  19  *
  20  * $HEADER$
  21  */
  22 #include "ompi_config.h"
  23 #include <stdio.h>
  24 
  25 #include "ompi/mpi/c/bindings.h"
  26 #include "ompi/runtime/params.h"
  27 #include "ompi/communicator/communicator.h"
  28 #include "ompi/errhandler/errhandler.h"
  29 #include "ompi/mca/topo/topo.h"
  30 #include "ompi/memchecker.h"
  31 
  32 #if OMPI_BUILD_MPI_PROFILING
  33 #if OPAL_HAVE_WEAK_SYMBOLS
  34 #pragma weak MPI_Graph_neighbors_count = PMPI_Graph_neighbors_count
  35 #endif
  36 #define MPI_Graph_neighbors_count PMPI_Graph_neighbors_count
  37 #endif
  38 
  39 static const char FUNC_NAME[] = "MPI_Graph_neighbors_count";
  40 
  41 
  42 int MPI_Graph_neighbors_count(MPI_Comm comm, int rank, int *nneighbors)
  43 {
  44     int err;
  45 
  46     MEMCHECKER(
  47         memchecker_comm(comm);
  48     );
  49 
  50     /* check the arguments */
  51     if (MPI_PARAM_CHECK) {
  52         OMPI_ERR_INIT_FINALIZE(FUNC_NAME);
  53         if (ompi_comm_invalid(comm)) {
  54             return OMPI_ERRHANDLER_INVOKE (MPI_COMM_WORLD, MPI_ERR_COMM,
  55                                            FUNC_NAME);
  56         }
  57         if (OMPI_COMM_IS_INTER(comm)) {
  58             return OMPI_ERRHANDLER_INVOKE (comm, MPI_ERR_COMM,
  59                                            FUNC_NAME);
  60         }
  61         if ((0 > rank) || (rank > ompi_group_size(comm->c_local_group))) {
  62             return OMPI_ERRHANDLER_INVOKE (comm, MPI_ERR_RANK,
  63                                            FUNC_NAME);
  64         }
  65         if (NULL == nneighbors) {
  66             return OMPI_ERRHANDLER_INVOKE (comm, MPI_ERR_ARG,
  67                                            FUNC_NAME);
  68         }
  69     }
  70 
  71     if (!OMPI_COMM_IS_GRAPH(comm)) {
  72         return OMPI_ERRHANDLER_INVOKE (comm, MPI_ERR_TOPOLOGY,
  73                                        FUNC_NAME);
  74     }
  75     OPAL_CR_ENTER_LIBRARY();
  76 
  77     err = comm->c_topo->topo.graph.graph_neighbors_count(comm, rank, nneighbors);
  78     OPAL_CR_EXIT_LIBRARY();
  79 
  80     OMPI_ERRHANDLER_RETURN(err, comm, err, FUNC_NAME);
  81 }