smpi.h

#ifndef H_SMPI_
#define H_SMPI_
 
typedef struct {
  int size;         /* the size of the buffer - in bytes */
  int nitem;            /* the number of items in the buffer */
  int type;         /* the type of buffer */
  int sd;           /* the processor the message is being send to */
  int pos;          /* current position in the buffer */
  void *buffer;         /* the buffer */
} MESSG_BUFFER;         /* message buffer */
 
//************************************************************//
//************************************************************//
 
typedef struct {
  int size;         /* the size of the key */
  int *key;         /* the key */
} MESSG_KEY;            /* message key */
 
//************************************************************//
//************************************************************//
 
typedef struct {
  int rnode;            /* the relative node number - local node number on owning processor */
  int sd;           /* the owning processor */
  int global_num;       /* global node number */
} GLOBAL_NODE;          /* the global node number */
 
/***********************************************************/
/* struct methods ---------------------------------------- */
 
/* Message Passing Data */
typedef struct {
  int npes;        /* number of processors */
  int myid;        /* local processor identification # */
#ifdef _MESSG
  double msg_starttime;    /* the start time of the model */
  time_t msg_timestart;    /* the start time of the model */
  MESSG_BUFFER *send_msg;  /* the send message buffers */
  MESSG_BUFFER *recv_msg;  /* the receive message buffers */
  MESSG_BUFFER *send_edge_msg; /* send buffer for the edge messages in adaption */
  MESSG_BUFFER *recv_edge_msg; /* receive buffer for the edge messages in adaption */
  MESSG_KEY *send_key; /* the key to load the send message */
  MESSG_KEY *send_key_surf; /* the key to load the send message */
  int *recv_init;      /* the beginning position to unload the message */
  int *recv_init_surf;      /* the beginning position to unload the message */
  int *nsend;      /* the number of items to send */
  int *nrecv;      /* the number of items to receive */
  int *nsend_surf;      /* the number of items to send */
  int *nrecv_surf;      /* the number of items to receive */
  int *nsend_edge;     /* the number of edges to send to the given pe */
  int *nrecv_edge;     /* the number of edges to receive from the given pe */
  EDGE_LIST_ITEM ***send_edge_key; /* the key for the edges being sent to the given pe
                       NOTE:  the key is actually a pointer into the hash table
                       for the given edge */
  EDGE_LIST_ITEM ***recv_edge_key; /* the key for the edges being received from the given pe
                       NOTE:  the key is actually a pointer into the hash table
                       for the given edge */
  int nmsg_counter;    /* the number of outstanding messages */
  int nmsg_status;     /* the number of status structures allocated */
  int nmsg_request;    /* the number of request structures allocated */
  int max_nmsg_status; /* the number of status structures allocated */
  int max_nmsg_request;    /* the number of request structures allocated */
 
  MPI_Comm ADH_COMM;   /* Alias for actual communicator used */
 
  //Mark adding this, may need to go into its own structure
  //all neighborhood communicators
  MPI_Comm ADH_NEIGH;
  MESSG_BUFFER buffer_send_neigh;
  MESSG_BUFFER buffer_recv_neigh;
  int indegree; //number of PEs in neighborhood we will recieve from
  int *sources; //array [indegree] of the PEs that are sources (NEEDS TO BE ORDERED!!!)
  int *source_weights; // array [indegree] of the PEs that are the number of data to recieve from each PE
  int *source_displs; // array [indegree] of the indices to read in the buffer from each PE
  int recv_ind; //since contiguous just need first adress
  int nrecv_neigh;
  //the source_indices are just nodes my_nnodes:nnodes for nodal variables
 
  int outdegree; //number of PEs in neighborhood we will send to
  int *dest; // array [outdegree] of the PEs that are destinations (local node ghosted on other PE)
  int *dest_weights; // array[outdegree] of the number of indices per neighbor PE it is sending to
                     // will double as the sendcounts argument
  int nsend_neigh;
  int *dest_displs; // array of [outdegree] that we will send to each Neighboring PE
                     // info is redundant with dest_weights but needed for MPI Calls
  int *dest_indices; // array of (sum dest_weights) OR (dest_displs[outdegree-1]) that will be
                     // used to extract data from a data source and pack into buffer
 
 
  MPI_Status *msg_status;  /* return flag for MPI receives */
  MPI_Request *msg_request;    /* request handle for asynchronous communication */
 
  int *partition_info; /* partition number for each node */
  int *surface_partition_info; /* 3d surface partition info */
  int partition_flag; /* flags if the grid has been previously partitioned */
#endif
} SMPI;
 
#endif
 
//+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
//+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
void smpi_init(SMPI *smpi
#ifdef _MESSG
               , MPI_Comm input_comm
#endif
);
void smpi_free(SMPI *smpi);
void smpi_defaults(SMPI *smpi);
void smpi_realloc(SMPI *smpi
#ifdef _MESSG
                  , MPI_Comm input_comm
#endif
);
 
//+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
//+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++