802 строки
29 KiB
C
802 строки
29 KiB
C
|
/* -*- Mode: C; c-basic-offset:4 ; -*- */
|
||
|
|
/*
|
||
|
|
* Copyright (c) 2004-2008 The Trustees of Indiana University and Indiana
|
||
|
|
* University Research and Technology
|
||
|
|
* Corporation. All rights reserved.
|
||
|
|
* Copyright (c) 2004-2009 The University of Tennessee and The University
|
||
|
|
* of Tennessee Research Foundation. All rights
|
||
|
|
* reserved.
|
||
|
|
* Copyright (c) 2004-2005 High Performance Computing Center Stuttgart,
|
||
|
|
* University of Stuttgart. All rights reserved.
|
||
|
|
* Copyright (c) 2004-2005 The Regents of the University of California.
|
||
|
|
* All rights reserved.
|
||
|
|
* Copyright (c) 2008 UT-Battelle, LLC. All rights reserved.
|
||
|
|
* Copyright (c) 2006-2008 University of Houston. All rights reserved.
|
||
|
|
* Copyright (c) 2009 IBM Corporation. All rights reserved.
|
||
|
|
* Copyright (c) 2009 Los Alamos National Security, LLC. All rights
|
||
|
|
* reserved.
|
||
|
|
* $COPYRIGHT$
|
||
|
|
*
|
||
|
|
* Additional copyrights may follow
|
||
|
|
*
|
||
|
|
* $HEADER$
|
||
|
|
*/
|
||
|
|
|
||
|
|
#include "ompi_config.h"
|
||
|
|
|
||
|
|
#include <stdlib.h>
|
||
|
|
#include <string.h>
|
||
|
|
|
||
|
|
#include "opal/class/opal_bitmap.h"
|
||
|
|
#include "ompi/mca/pml/pml.h"
|
||
|
|
#include "ompi/mca/pml/base/base.h"
|
||
|
|
#include "ompi/mca/btl/btl.h"
|
||
|
|
#include "ompi/mca/pml/base/base.h"
|
||
|
|
#include "ompi/mca/btl/base/base.h"
|
||
|
|
#include "pml_csum.h"
|
||
|
|
#include "pml_csum_component.h"
|
||
|
|
#include "pml_csum_comm.h"
|
||
|
|
#include "pml_csum_hdr.h"
|
||
|
|
#include "pml_csum_recvfrag.h"
|
||
|
|
#include "pml_csum_sendreq.h"
|
||
|
|
#include "pml_csum_recvreq.h"
|
||
|
|
#include "pml_csum_rdmafrag.h"
|
||
|
|
#include "ompi/mca/bml/base/base.h"
|
||
|
|
#include "orte/mca/errmgr/errmgr.h"
|
||
|
|
#include "orte/mca/grpcomm/grpcomm.h"
|
||
|
|
#include "orte/util/name_fns.h"
|
||
|
|
#include "orte/runtime/orte_globals.h"
|
||
|
|
#include "opal/util/crc.h"
|
||
|
|
#include "ompi/runtime/ompi_cr.h"
|
||
|
|
#include "ompi/runtime/ompi_module_exchange.h"
|
||
|
|
|
||
|
|
mca_pml_csum_t mca_pml_csum = {
|
||
|
|
{
|
||
|
|
mca_pml_csum_add_procs,
|
||
|
|
mca_pml_csum_del_procs,
|
||
|
|
mca_pml_csum_enable,
|
||
|
|
mca_pml_csum_progress,
|
||
|
|
mca_pml_csum_add_comm,
|
||
|
|
mca_pml_csum_del_comm,
|
||
|
|
mca_pml_csum_irecv_init,
|
||
|
|
mca_pml_csum_irecv,
|
||
|
|
mca_pml_csum_recv,
|
||
|
|
mca_pml_csum_isend_init,
|
||
|
|
mca_pml_csum_isend,
|
||
|
|
mca_pml_csum_send,
|
||
|
|
mca_pml_csum_iprobe,
|
||
|
|
mca_pml_csum_probe,
|
||
|
|
mca_pml_csum_start,
|
||
|
|
mca_pml_csum_dump,
|
||
|
|
mca_pml_csum_ft_event,
|
||
|
|
32768,
|
||
|
|
INT_MAX
|
||
|
|
}
|
||
|
|
};
|
||
|
|
|
||
|
|
|
||
|
|
void mca_pml_csum_error_handler( struct mca_btl_base_module_t* btl,
|
||
|
|
int32_t flags );
|
||
|
|
|
||
|
|
int mca_pml_csum_enable(bool enable)
|
||
|
|
{
|
||
|
|
if( false == enable ) {
|
||
|
|
return OMPI_SUCCESS;
|
||
|
|
}
|
||
|
|
|
||
|
|
OBJ_CONSTRUCT(&mca_pml_csum.lock, opal_mutex_t);
|
||
|
|
|
||
|
|
/* fragments */
|
||
|
|
OBJ_CONSTRUCT(&mca_pml_csum.rdma_frags, ompi_free_list_t);
|
||
|
|
ompi_free_list_init_new( &mca_pml_csum.rdma_frags,
|
||
|
|
sizeof(mca_pml_csum_rdma_frag_t),
|
||
|
|
CACHE_LINE_SIZE,
|
||
|
|
OBJ_CLASS(mca_pml_csum_rdma_frag_t),
|
||
|
|
0,CACHE_LINE_SIZE,
|
||
|
|
mca_pml_csum.free_list_num,
|
||
|
|
mca_pml_csum.free_list_max,
|
||
|
|
mca_pml_csum.free_list_inc,
|
||
|
|
NULL );
|
||
|
|
|
||
|
|
OBJ_CONSTRUCT(&mca_pml_csum.recv_frags, ompi_free_list_t);
|
||
|
|
|
||
|
|
ompi_free_list_init_new( &mca_pml_csum.recv_frags,
|
||
|
|
sizeof(mca_pml_csum_recv_frag_t) + mca_pml_csum.unexpected_limit,
|
||
|
|
CACHE_LINE_SIZE,
|
||
|
|
OBJ_CLASS(mca_pml_csum_recv_frag_t),
|
||
|
|
0,CACHE_LINE_SIZE,
|
||
|
|
mca_pml_csum.free_list_num,
|
||
|
|
mca_pml_csum.free_list_max,
|
||
|
|
mca_pml_csum.free_list_inc,
|
||
|
|
NULL );
|
||
|
|
|
||
|
|
OBJ_CONSTRUCT(&mca_pml_csum.pending_pckts, ompi_free_list_t);
|
||
|
|
ompi_free_list_init_new( &mca_pml_csum.pending_pckts,
|
||
|
|
sizeof(mca_pml_csum_pckt_pending_t),
|
||
|
|
CACHE_LINE_SIZE,
|
||
|
|
OBJ_CLASS(mca_pml_csum_pckt_pending_t),
|
||
|
|
0,CACHE_LINE_SIZE,
|
||
|
|
mca_pml_csum.free_list_num,
|
||
|
|
mca_pml_csum.free_list_max,
|
||
|
|
mca_pml_csum.free_list_inc,
|
||
|
|
NULL );
|
||
|
|
|
||
|
|
|
||
|
|
OBJ_CONSTRUCT(&mca_pml_csum.buffers, ompi_free_list_t);
|
||
|
|
OBJ_CONSTRUCT(&mca_pml_csum.send_ranges, ompi_free_list_t);
|
||
|
|
ompi_free_list_init_new( &mca_pml_csum.send_ranges,
|
||
|
|
sizeof(mca_pml_csum_send_range_t) +
|
||
|
|
(mca_pml_csum.max_send_per_range - 1) * sizeof(mca_pml_csum_com_btl_t),
|
||
|
|
CACHE_LINE_SIZE,
|
||
|
|
OBJ_CLASS(mca_pml_csum_send_range_t),
|
||
|
|
0,CACHE_LINE_SIZE,
|
||
|
|
mca_pml_csum.free_list_num,
|
||
|
|
mca_pml_csum.free_list_max,
|
||
|
|
mca_pml_csum.free_list_inc,
|
||
|
|
NULL );
|
||
|
|
|
||
|
|
/* pending operations */
|
||
|
|
OBJ_CONSTRUCT(&mca_pml_csum.send_pending, opal_list_t);
|
||
|
|
OBJ_CONSTRUCT(&mca_pml_csum.recv_pending, opal_list_t);
|
||
|
|
OBJ_CONSTRUCT(&mca_pml_csum.pckt_pending, opal_list_t);
|
||
|
|
OBJ_CONSTRUCT(&mca_pml_csum.rdma_pending, opal_list_t);
|
||
|
|
/* missing communicator pending list */
|
||
|
|
OBJ_CONSTRUCT(&mca_pml_csum.non_existing_communicator_pending, opal_list_t);
|
||
|
|
|
||
|
|
/**
|
||
|
|
* If we get here this is the PML who get selected for the run. We
|
||
|
|
* should get ownership for the send and receive requests list, and
|
||
|
|
* initialize them with the size of our own requests.
|
||
|
|
*/
|
||
|
|
ompi_free_list_init_new( &mca_pml_base_send_requests,
|
||
|
|
sizeof(mca_pml_csum_send_request_t) +
|
||
|
|
(mca_pml_csum.max_rdma_per_request - 1) *
|
||
|
|
sizeof(mca_pml_csum_com_btl_t),
|
||
|
|
CACHE_LINE_SIZE,
|
||
|
|
OBJ_CLASS(mca_pml_csum_send_request_t),
|
||
|
|
0,CACHE_LINE_SIZE,
|
||
|
|
mca_pml_csum.free_list_num,
|
||
|
|
mca_pml_csum.free_list_max,
|
||
|
|
mca_pml_csum.free_list_inc,
|
||
|
|
NULL );
|
||
|
|
|
||
|
|
ompi_free_list_init_new( &mca_pml_base_recv_requests,
|
||
|
|
sizeof(mca_pml_csum_recv_request_t) +
|
||
|
|
(mca_pml_csum.max_rdma_per_request - 1) *
|
||
|
|
sizeof(mca_pml_csum_com_btl_t),
|
||
|
|
CACHE_LINE_SIZE,
|
||
|
|
OBJ_CLASS(mca_pml_csum_recv_request_t),
|
||
|
|
0,CACHE_LINE_SIZE,
|
||
|
|
mca_pml_csum.free_list_num,
|
||
|
|
mca_pml_csum.free_list_max,
|
||
|
|
mca_pml_csum.free_list_inc,
|
||
|
|
NULL );
|
||
|
|
|
||
|
|
mca_pml_csum.enabled = true;
|
||
|
|
return OMPI_SUCCESS;
|
||
|
|
}
|
||
|
|
|
||
|
|
int mca_pml_csum_add_comm(ompi_communicator_t* comm)
|
||
|
|
{
|
||
|
|
/* allocate pml specific comm data */
|
||
|
|
mca_pml_csum_comm_t* pml_comm = OBJ_NEW(mca_pml_csum_comm_t);
|
||
|
|
opal_list_item_t *item, *next_item;
|
||
|
|
mca_pml_csum_recv_frag_t* frag;
|
||
|
|
mca_pml_csum_comm_proc_t* pml_proc;
|
||
|
|
mca_pml_csum_match_hdr_t* hdr;
|
||
|
|
int i;
|
||
|
|
|
||
|
|
if (NULL == pml_comm) {
|
||
|
|
return OMPI_ERR_OUT_OF_RESOURCE;
|
||
|
|
}
|
||
|
|
mca_pml_csum_comm_init_size(pml_comm, comm->c_remote_group->grp_proc_count);
|
||
|
|
comm->c_pml_comm = pml_comm;
|
||
|
|
|
||
|
|
for( i = 0; i < comm->c_remote_group->grp_proc_count; i++ ) {
|
||
|
|
pml_comm->procs[i].ompi_proc = ompi_group_peer_lookup(comm->c_remote_group,i);
|
||
|
|
}
|
||
|
|
/* Grab all related messages from the non_existing_communicator pending queue */
|
||
|
|
for( item = opal_list_get_first(&mca_pml_csum.non_existing_communicator_pending);
|
||
|
|
item != opal_list_get_end(&mca_pml_csum.non_existing_communicator_pending);
|
||
|
|
item = next_item ) {
|
||
|
|
frag = (mca_pml_csum_recv_frag_t*)item;
|
||
|
|
next_item = opal_list_get_next(item);
|
||
|
|
hdr = &frag->hdr.hdr_match;
|
||
|
|
|
||
|
|
/* Is this fragment for the current communicator ? */
|
||
|
|
if( frag->hdr.hdr_match.hdr_ctx != comm->c_contextid )
|
||
|
|
continue;
|
||
|
|
|
||
|
|
/* As we now know we work on a fragment for this communicator
|
||
|
|
* we should remove it from the
|
||
|
|
* non_existing_communicator_pending list. */
|
||
|
|
opal_list_remove_item( &mca_pml_csum.non_existing_communicator_pending,
|
||
|
|
item );
|
||
|
|
|
||
|
|
add_fragment_to_unexpected:
|
||
|
|
|
||
|
|
/* We generate the MSG_ARRIVED event as soon as the PML is aware
|
||
|
|
* of a matching fragment arrival. Independing if it is received
|
||
|
|
* on the correct order or not. This will allow the tools to
|
||
|
|
* figure out if the messages are not received in the correct
|
||
|
|
* order (if multiple network interfaces).
|
||
|
|
*/
|
||
|
|
PERUSE_TRACE_MSG_EVENT(PERUSE_COMM_MSG_ARRIVED, comm,
|
||
|
|
hdr->hdr_src, hdr->hdr_tag, PERUSE_RECV);
|
||
|
|
|
||
|
|
/* There is no matching to be done, and no lock to be held on the communicator as
|
||
|
|
* we know at this point that the communicator has not yet been returned to the user.
|
||
|
|
* The only required protection is around the non_existing_communicator_pending queue.
|
||
|
|
* We just have to push the fragment into the unexpected list of the corresponding
|
||
|
|
* proc, or into the out-of-order (cant_match) list.
|
||
|
|
*/
|
||
|
|
pml_proc = &(pml_comm->procs[hdr->hdr_src]);
|
||
|
|
|
||
|
|
if( ((uint16_t)hdr->hdr_seq) == ((uint16_t)pml_proc->expected_sequence) ) {
|
||
|
|
/* We're now expecting the next sequence number. */
|
||
|
|
pml_proc->expected_sequence++;
|
||
|
|
opal_list_append( &pml_proc->unexpected_frags, (opal_list_item_t*)frag );
|
||
|
|
PERUSE_TRACE_MSG_EVENT(PERUSE_COMM_MSG_INSERT_IN_UNEX_Q, comm,
|
||
|
|
hdr->hdr_src, hdr->hdr_tag, PERUSE_RECV);
|
||
|
|
/* And now the ugly part. As some fragments can be inserted in the cant_match list,
|
||
|
|
* every time we succesfully add a fragment in the unexpected list we have to make
|
||
|
|
* sure the next one is not in the cant_match. Otherwise, we will endup in a deadlock
|
||
|
|
* situation as the cant_match is only checked when a new fragment is received from
|
||
|
|
* the network.
|
||
|
|
*/
|
||
|
|
for(frag = (mca_pml_csum_recv_frag_t *)opal_list_get_first(&pml_proc->frags_cant_match);
|
||
|
|
frag != (mca_pml_csum_recv_frag_t *)opal_list_get_end(&pml_proc->frags_cant_match);
|
||
|
|
frag = (mca_pml_csum_recv_frag_t *)opal_list_get_next(frag)) {
|
||
|
|
hdr = &frag->hdr.hdr_match;
|
||
|
|
/* If the message has the next expected seq from that proc... */
|
||
|
|
if(hdr->hdr_seq != pml_proc->expected_sequence)
|
||
|
|
continue;
|
||
|
|
|
||
|
|
opal_list_remove_item(&pml_proc->frags_cant_match, (opal_list_item_t*)frag);
|
||
|
|
goto add_fragment_to_unexpected;
|
||
|
|
}
|
||
|
|
} else {
|
||
|
|
opal_list_append( &pml_proc->frags_cant_match, (opal_list_item_t*)frag );
|
||
|
|
}
|
||
|
|
}
|
||
|
|
return OMPI_SUCCESS;
|
||
|
|
}
|
||
|
|
|
||
|
|
int mca_pml_csum_del_comm(ompi_communicator_t* comm)
|
||
|
|
{
|
||
|
|
OBJ_RELEASE(comm->c_pml_comm);
|
||
|
|
comm->c_pml_comm = NULL;
|
||
|
|
return OMPI_SUCCESS;
|
||
|
|
}
|
||
|
|
|
||
|
|
|
||
|
|
/*
|
||
|
|
* For each proc setup a datastructure that indicates the BTLs
|
||
|
|
* that can be used to reach the destination.
|
||
|
|
*
|
||
|
|
*/
|
||
|
|
|
||
|
|
int mca_pml_csum_add_procs(ompi_proc_t** procs, size_t nprocs)
|
||
|
|
{
|
||
|
|
opal_bitmap_t reachable;
|
||
|
|
int rc;
|
||
|
|
size_t i;
|
||
|
|
|
||
|
|
if(nprocs == 0)
|
||
|
|
return OMPI_SUCCESS;
|
||
|
|
|
||
|
|
/* we don't have any endpoint data we need to cache on the
|
||
|
|
ompi_proc_t, so set proc_pml to NULL */
|
||
|
|
for (i = 0 ; i < nprocs ; ++i) {
|
||
|
|
procs[i]->proc_pml = NULL;
|
||
|
|
}
|
||
|
|
|
||
|
|
OBJ_CONSTRUCT(&reachable, opal_bitmap_t);
|
||
|
|
rc = opal_bitmap_init(&reachable, (int)nprocs);
|
||
|
|
if(OMPI_SUCCESS != rc)
|
||
|
|
return rc;
|
||
|
|
|
||
|
|
/*
|
||
|
|
* JJH: Disable this in FT enabled builds since
|
||
|
|
* we use a wrapper PML. It will cause this check to
|
||
|
|
* return failure as all processes will return the wrapper PML
|
||
|
|
* component in use instead of the wrapped PML component underneath.
|
||
|
|
*/
|
||
|
|
#if OPAL_ENABLE_FT == 0
|
||
|
|
/* make sure remote procs are using the same PML as us */
|
||
|
|
if (OMPI_SUCCESS != (rc = mca_pml_base_pml_check_selected("csum",
|
||
|
|
procs,
|
||
|
|
nprocs))) {
|
||
|
|
return rc;
|
||
|
|
}
|
||
|
|
#endif
|
||
|
|
|
||
|
|
rc = mca_bml.bml_add_procs( nprocs,
|
||
|
|
procs,
|
||
|
|
&reachable );
|
||
|
|
if(OMPI_SUCCESS != rc)
|
||
|
|
goto cleanup_and_return;
|
||
|
|
|
||
|
|
rc = mca_bml.bml_register( MCA_PML_CSUM_HDR_TYPE_MATCH,
|
||
|
|
mca_pml_csum_recv_frag_callback_match,
|
||
|
|
NULL );
|
||
|
|
if(OMPI_SUCCESS != rc)
|
||
|
|
goto cleanup_and_return;
|
||
|
|
|
||
|
|
rc = mca_bml.bml_register( MCA_PML_CSUM_HDR_TYPE_RNDV,
|
||
|
|
mca_pml_csum_recv_frag_callback_rndv,
|
||
|
|
NULL );
|
||
|
|
if(OMPI_SUCCESS != rc)
|
||
|
|
goto cleanup_and_return;
|
||
|
|
|
||
|
|
rc = mca_bml.bml_register( MCA_PML_CSUM_HDR_TYPE_RGET,
|
||
|
|
mca_pml_csum_recv_frag_callback_rget,
|
||
|
|
NULL );
|
||
|
|
if(OMPI_SUCCESS != rc)
|
||
|
|
goto cleanup_and_return;
|
||
|
|
|
||
|
|
rc = mca_bml.bml_register( MCA_PML_CSUM_HDR_TYPE_ACK,
|
||
|
|
mca_pml_csum_recv_frag_callback_ack,
|
||
|
|
NULL );
|
||
|
|
if(OMPI_SUCCESS != rc)
|
||
|
|
goto cleanup_and_return;
|
||
|
|
|
||
|
|
rc = mca_bml.bml_register( MCA_PML_CSUM_HDR_TYPE_FRAG,
|
||
|
|
mca_pml_csum_recv_frag_callback_frag,
|
||
|
|
NULL );
|
||
|
|
if(OMPI_SUCCESS != rc)
|
||
|
|
goto cleanup_and_return;
|
||
|
|
|
||
|
|
rc = mca_bml.bml_register( MCA_PML_CSUM_HDR_TYPE_PUT,
|
||
|
|
mca_pml_csum_recv_frag_callback_put,
|
||
|
|
NULL );
|
||
|
|
if(OMPI_SUCCESS != rc)
|
||
|
|
goto cleanup_and_return;
|
||
|
|
|
||
|
|
rc = mca_bml.bml_register( MCA_PML_CSUM_HDR_TYPE_FIN,
|
||
|
|
mca_pml_csum_recv_frag_callback_fin,
|
||
|
|
NULL );
|
||
|
|
if(OMPI_SUCCESS != rc)
|
||
|
|
goto cleanup_and_return;
|
||
|
|
|
||
|
|
/* register error handlers */
|
||
|
|
rc = mca_bml.bml_register_error(mca_pml_csum_error_handler);
|
||
|
|
if(OMPI_SUCCESS != rc)
|
||
|
|
goto cleanup_and_return;
|
||
|
|
|
||
|
|
cleanup_and_return:
|
||
|
|
OBJ_DESTRUCT(&reachable);
|
||
|
|
|
||
|
|
return rc;
|
||
|
|
}
|
||
|
|
|
||
|
|
/*
|
||
|
|
* iterate through each proc and notify any PTLs associated
|
||
|
|
* with the proc that it is/has gone away
|
||
|
|
*/
|
||
|
|
|
||
|
|
int mca_pml_csum_del_procs(ompi_proc_t** procs, size_t nprocs)
|
||
|
|
{
|
||
|
|
return mca_bml.bml_del_procs(nprocs, procs);
|
||
|
|
}
|
||
|
|
|
||
|
|
/*
|
||
|
|
* diagnostics
|
||
|
|
*/
|
||
|
|
|
||
|
|
int mca_pml_csum_dump(struct ompi_communicator_t* comm, int verbose)
|
||
|
|
{
|
||
|
|
struct mca_pml_comm_t* pml_comm = comm->c_pml_comm;
|
||
|
|
int i;
|
||
|
|
|
||
|
|
/* iterate through all procs on communicator */
|
||
|
|
for( i = 0; i < (int)pml_comm->num_procs; i++ ) {
|
||
|
|
mca_pml_csum_comm_proc_t* proc = &pml_comm->procs[i];
|
||
|
|
mca_bml_base_endpoint_t* ep = (mca_bml_base_endpoint_t*)proc->ompi_proc->proc_bml;
|
||
|
|
size_t n;
|
||
|
|
|
||
|
|
opal_output(0, "[Rank %d]\n", i);
|
||
|
|
/* dump all receive queues */
|
||
|
|
|
||
|
|
/* dump all btls */
|
||
|
|
for(n=0; n<ep->btl_eager.arr_size; n++) {
|
||
|
|
mca_bml_base_btl_t* bml_btl = &ep->btl_eager.bml_btls[n];
|
||
|
|
bml_btl->btl->btl_dump(bml_btl->btl, bml_btl->btl_endpoint, verbose);
|
||
|
|
}
|
||
|
|
}
|
||
|
|
return OMPI_SUCCESS;
|
||
|
|
}
|
||
|
|
|
||
|
|
static void mca_pml_csum_fin_completion( mca_btl_base_module_t* btl,
|
||
|
|
struct mca_btl_base_endpoint_t* ep,
|
||
|
|
struct mca_btl_base_descriptor_t* des,
|
||
|
|
int status )
|
||
|
|
{
|
||
|
|
|
||
|
|
mca_bml_base_btl_t* bml_btl = (mca_bml_base_btl_t*) des->des_context;
|
||
|
|
|
||
|
|
/* check for pending requests */
|
||
|
|
MCA_PML_CSUM_PROGRESS_PENDING(bml_btl);
|
||
|
|
}
|
||
|
|
|
||
|
|
int mca_pml_csum_send_fin( ompi_proc_t* proc,
|
||
|
|
mca_bml_base_btl_t* bml_btl,
|
||
|
|
void *hdr_des,
|
||
|
|
uint8_t order,
|
||
|
|
uint32_t status )
|
||
|
|
{
|
||
|
|
mca_btl_base_descriptor_t* fin;
|
||
|
|
mca_pml_csum_fin_hdr_t* hdr;
|
||
|
|
int rc;
|
||
|
|
bool do_csum = mca_pml_csum.enable_csum &&
|
||
|
|
(bml_btl->btl_flags & MCA_BTL_FLAGS_NEED_CSUM);
|
||
|
|
mca_bml_base_alloc(bml_btl, &fin, order, sizeof(mca_pml_csum_fin_hdr_t),
|
||
|
|
MCA_BTL_DES_FLAGS_PRIORITY | MCA_BTL_DES_FLAGS_BTL_OWNERSHIP);
|
||
|
|
|
||
|
|
if(NULL == fin) {
|
||
|
|
MCA_PML_CSUM_ADD_FIN_TO_PENDING(proc, hdr_des, bml_btl, order, status);
|
||
|
|
return OMPI_ERR_OUT_OF_RESOURCE;
|
||
|
|
}
|
||
|
|
fin->des_cbfunc = mca_pml_csum_fin_completion;
|
||
|
|
fin->des_cbdata = NULL;
|
||
|
|
|
||
|
|
/* fill in header */
|
||
|
|
hdr = (mca_pml_csum_fin_hdr_t*)fin->des_src->seg_addr.pval;
|
||
|
|
hdr->hdr_common.hdr_flags = 0;
|
||
|
|
hdr->hdr_common.hdr_type = MCA_PML_CSUM_HDR_TYPE_FIN;
|
||
|
|
hdr->hdr_common.hdr_csum = 0;
|
||
|
|
hdr->hdr_des.pval = hdr_des;
|
||
|
|
hdr->hdr_fail = status;
|
||
|
|
hdr->hdr_common.hdr_csum = (do_csum ?
|
||
|
|
opal_csum16(hdr, sizeof(mca_pml_csum_fin_hdr_t)) : OPAL_CSUM_ZERO);
|
||
|
|
if(do_csum) {
|
||
|
|
OMPI_CSUM_CSUM_DEBUG((0, "%s: Sending \'FIN\' with header csum:0x%04x\n",
|
||
|
|
ORTE_NAME_PRINT(ORTE_PROC_MY_NAME), hdr->hdr_common.hdr_csum));
|
||
|
|
}
|
||
|
|
|
||
|
|
csum_hdr_hton(hdr, MCA_PML_CSUM_HDR_TYPE_FIN, proc);
|
||
|
|
|
||
|
|
/* queue request */
|
||
|
|
rc = mca_bml_base_send( bml_btl,
|
||
|
|
fin,
|
||
|
|
MCA_PML_CSUM_HDR_TYPE_FIN );
|
||
|
|
if( OPAL_LIKELY( rc >= 0 ) ) {
|
||
|
|
if( OPAL_LIKELY( 1 == rc ) ) {
|
||
|
|
MCA_PML_CSUM_PROGRESS_PENDING(bml_btl);
|
||
|
|
}
|
||
|
|
return OMPI_SUCCESS;
|
||
|
|
}
|
||
|
|
mca_bml_base_free(bml_btl, fin);
|
||
|
|
MCA_PML_CSUM_ADD_FIN_TO_PENDING(proc, hdr_des, bml_btl, order, status);
|
||
|
|
return OMPI_ERR_OUT_OF_RESOURCE;
|
||
|
|
}
|
||
|
|
|
||
|
|
void mca_pml_csum_process_pending_packets(mca_bml_base_btl_t* bml_btl)
|
||
|
|
{
|
||
|
|
mca_pml_csum_pckt_pending_t *pckt;
|
||
|
|
int32_t i, rc, s = (int32_t)opal_list_get_size(&mca_pml_csum.pckt_pending);
|
||
|
|
|
||
|
|
for(i = 0; i < s; i++) {
|
||
|
|
mca_bml_base_btl_t *send_dst = NULL;
|
||
|
|
OPAL_THREAD_LOCK(&mca_pml_csum.lock);
|
||
|
|
pckt = (mca_pml_csum_pckt_pending_t*)
|
||
|
|
opal_list_remove_first(&mca_pml_csum.pckt_pending);
|
||
|
|
OPAL_THREAD_UNLOCK(&mca_pml_csum.lock);
|
||
|
|
if(NULL == pckt)
|
||
|
|
break;
|
||
|
|
if(pckt->bml_btl != NULL &&
|
||
|
|
pckt->bml_btl->btl == bml_btl->btl) {
|
||
|
|
send_dst = pckt->bml_btl;
|
||
|
|
} else {
|
||
|
|
send_dst = mca_bml_base_btl_array_find(
|
||
|
|
&pckt->proc->proc_bml->btl_eager, bml_btl->btl);
|
||
|
|
}
|
||
|
|
if(NULL == send_dst) {
|
||
|
|
OPAL_THREAD_LOCK(&mca_pml_csum.lock);
|
||
|
|
opal_list_append(&mca_pml_csum.pckt_pending,
|
||
|
|
(opal_list_item_t*)pckt);
|
||
|
|
OPAL_THREAD_UNLOCK(&mca_pml_csum.lock);
|
||
|
|
continue;
|
||
|
|
}
|
||
|
|
|
||
|
|
switch(pckt->hdr.hdr_common.hdr_type) {
|
||
|
|
case MCA_PML_CSUM_HDR_TYPE_ACK:
|
||
|
|
rc = mca_pml_csum_recv_request_ack_send_btl(pckt->proc,
|
||
|
|
send_dst,
|
||
|
|
pckt->hdr.hdr_ack.hdr_src_req.lval,
|
||
|
|
pckt->hdr.hdr_ack.hdr_dst_req.pval,
|
||
|
|
pckt->hdr.hdr_ack.hdr_send_offset,
|
||
|
|
pckt->hdr.hdr_common.hdr_flags & MCA_PML_CSUM_HDR_FLAGS_NORDMA);
|
||
|
|
MCA_PML_CSUM_PCKT_PENDING_RETURN(pckt);
|
||
|
|
if(OMPI_ERR_OUT_OF_RESOURCE == rc) {
|
||
|
|
MCA_PML_CSUM_ADD_ACK_TO_PENDING(pckt->proc,
|
||
|
|
pckt->hdr.hdr_ack.hdr_src_req.lval,
|
||
|
|
pckt->hdr.hdr_ack.hdr_dst_req.pval,
|
||
|
|
pckt->hdr.hdr_ack.hdr_send_offset);
|
||
|
|
return;
|
||
|
|
}
|
||
|
|
break;
|
||
|
|
case MCA_PML_CSUM_HDR_TYPE_FIN:
|
||
|
|
rc = mca_pml_csum_send_fin(pckt->proc, send_dst,
|
||
|
|
pckt->hdr.hdr_fin.hdr_des.pval,
|
||
|
|
pckt->order,
|
||
|
|
pckt->hdr.hdr_fin.hdr_fail);
|
||
|
|
MCA_PML_CSUM_PCKT_PENDING_RETURN(pckt);
|
||
|
|
if(OMPI_ERR_OUT_OF_RESOURCE == rc)
|
||
|
|
return;
|
||
|
|
break;
|
||
|
|
default:
|
||
|
|
opal_output(0, "[%s:%d] wrong header type\n",
|
||
|
|
__FILE__, __LINE__);
|
||
|
|
break;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
void mca_pml_csum_process_pending_rdma(void)
|
||
|
|
{
|
||
|
|
mca_pml_csum_rdma_frag_t* frag;
|
||
|
|
int32_t i, rc, s = (int32_t)opal_list_get_size(&mca_pml_csum.rdma_pending);
|
||
|
|
|
||
|
|
for(i = 0; i < s; i++) {
|
||
|
|
OPAL_THREAD_LOCK(&mca_pml_csum.lock);
|
||
|
|
frag = (mca_pml_csum_rdma_frag_t*)
|
||
|
|
opal_list_remove_first(&mca_pml_csum.rdma_pending);
|
||
|
|
OPAL_THREAD_UNLOCK(&mca_pml_csum.lock);
|
||
|
|
if(NULL == frag)
|
||
|
|
break;
|
||
|
|
if(frag->rdma_state == MCA_PML_CSUM_RDMA_PUT) {
|
||
|
|
frag->retries++;
|
||
|
|
rc = mca_pml_csum_send_request_put_frag(frag);
|
||
|
|
} else {
|
||
|
|
rc = mca_pml_csum_recv_request_get_frag(frag);
|
||
|
|
}
|
||
|
|
if(OMPI_ERR_OUT_OF_RESOURCE == rc)
|
||
|
|
break;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
|
||
|
|
void mca_pml_csum_error_handler(
|
||
|
|
struct mca_btl_base_module_t* btl,
|
||
|
|
int32_t flags) {
|
||
|
|
orte_errmgr.abort(-1, NULL);
|
||
|
|
}
|
||
|
|
|
||
|
|
#if OPAL_ENABLE_FT == 0
|
||
|
|
int mca_pml_csum_ft_event( int state ) {
|
||
|
|
return OMPI_SUCCESS;
|
||
|
|
}
|
||
|
|
#else
|
||
|
|
int mca_pml_csum_ft_event( int state )
|
||
|
|
{
|
||
|
|
static bool first_continue_pass = false;
|
||
|
|
ompi_proc_t** procs = NULL;
|
||
|
|
size_t num_procs;
|
||
|
|
int ret, p;
|
||
|
|
|
||
|
|
if(OPAL_CRS_CHECKPOINT == state) {
|
||
|
|
if( opal_cr_timing_barrier_enabled ) {
|
||
|
|
OPAL_CR_SET_TIMER(OPAL_CR_TIMER_CRCPBR1);
|
||
|
|
orte_grpcomm.barrier();
|
||
|
|
}
|
||
|
|
|
||
|
|
OPAL_CR_SET_TIMER(OPAL_CR_TIMER_P2P0);
|
||
|
|
}
|
||
|
|
else if(OPAL_CRS_CONTINUE == state) {
|
||
|
|
first_continue_pass = !first_continue_pass;
|
||
|
|
|
||
|
|
if( !first_continue_pass ) {
|
||
|
|
if( opal_cr_timing_barrier_enabled ) {
|
||
|
|
OPAL_CR_SET_TIMER(OPAL_CR_TIMER_COREBR0);
|
||
|
|
orte_grpcomm.barrier();
|
||
|
|
}
|
||
|
|
OPAL_CR_SET_TIMER(OPAL_CR_TIMER_P2P2);
|
||
|
|
}
|
||
|
|
|
||
|
|
if( ompi_cr_continue_like_restart && !first_continue_pass ) {
|
||
|
|
/*
|
||
|
|
* Get a list of processes
|
||
|
|
*/
|
||
|
|
procs = ompi_proc_all(&num_procs);
|
||
|
|
if(NULL == procs) {
|
||
|
|
return OMPI_ERR_OUT_OF_RESOURCE;
|
||
|
|
}
|
||
|
|
|
||
|
|
/*
|
||
|
|
* Refresh the proc structure, and publish our proc info in the modex.
|
||
|
|
* NOTE: Do *not* call ompi_proc_finalize as there are many places in
|
||
|
|
* the code that point to indv. procs in this strucutre. For our
|
||
|
|
* needs here we only need to fix up the modex, bml and pml
|
||
|
|
* references.
|
||
|
|
*/
|
||
|
|
if (OMPI_SUCCESS != (ret = ompi_proc_refresh())) {
|
||
|
|
opal_output(0,
|
||
|
|
"pml:csum: ft_event(Restart): proc_refresh Failed %d",
|
||
|
|
ret);
|
||
|
|
for(p = 0; p < (int)num_procs; ++p) {
|
||
|
|
OBJ_RELEASE(procs[p]);
|
||
|
|
}
|
||
|
|
free (procs);
|
||
|
|
return ret;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
else if(OPAL_CRS_RESTART_PRE == state ) {
|
||
|
|
/* Nothing here */
|
||
|
|
}
|
||
|
|
else if(OPAL_CRS_RESTART == state ) {
|
||
|
|
/*
|
||
|
|
* Get a list of processes
|
||
|
|
*/
|
||
|
|
procs = ompi_proc_all(&num_procs);
|
||
|
|
if(NULL == procs) {
|
||
|
|
return OMPI_ERR_OUT_OF_RESOURCE;
|
||
|
|
}
|
||
|
|
|
||
|
|
/*
|
||
|
|
* Clean out the modex information since it is invalid now.
|
||
|
|
* orte_grpcomm.purge_proc_attrs();
|
||
|
|
* This happens at the ORTE level, so doing it again here will cause
|
||
|
|
* some issues with socket caching.
|
||
|
|
*/
|
||
|
|
|
||
|
|
|
||
|
|
/*
|
||
|
|
* Refresh the proc structure, and publish our proc info in the modex.
|
||
|
|
* NOTE: Do *not* call ompi_proc_finalize as there are many places in
|
||
|
|
* the code that point to indv. procs in this strucutre. For our
|
||
|
|
* needs here we only need to fix up the modex, bml and pml
|
||
|
|
* references.
|
||
|
|
*/
|
||
|
|
if (OMPI_SUCCESS != (ret = ompi_proc_refresh())) {
|
||
|
|
opal_output(0,
|
||
|
|
"pml:csum: ft_event(Restart): proc_refresh Failed %d",
|
||
|
|
ret);
|
||
|
|
for(p = 0; p < (int)num_procs; ++p) {
|
||
|
|
OBJ_RELEASE(procs[p]);
|
||
|
|
}
|
||
|
|
free (procs);
|
||
|
|
return ret;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
else if(OPAL_CRS_TERM == state ) {
|
||
|
|
;
|
||
|
|
}
|
||
|
|
else {
|
||
|
|
;
|
||
|
|
}
|
||
|
|
|
||
|
|
/* Call the BML
|
||
|
|
* BML is expected to call ft_event in
|
||
|
|
* - BTL(s)
|
||
|
|
* - MPool(s)
|
||
|
|
*/
|
||
|
|
if( OMPI_SUCCESS != (ret = mca_bml.bml_ft_event(state))) {
|
||
|
|
opal_output(0, "pml:base: ft_event: BML ft_event function failed: %d\n",
|
||
|
|
ret);
|
||
|
|
}
|
||
|
|
|
||
|
|
if(OPAL_CRS_CHECKPOINT == state) {
|
||
|
|
OPAL_CR_SET_TIMER(OPAL_CR_TIMER_P2P1);
|
||
|
|
|
||
|
|
if( opal_cr_timing_barrier_enabled ) {
|
||
|
|
OPAL_CR_SET_TIMER(OPAL_CR_TIMER_P2PBR0);
|
||
|
|
/* JJH Cannot barrier here due to progress engine -- orte_grpcomm.barrier();*/
|
||
|
|
}
|
||
|
|
}
|
||
|
|
else if(OPAL_CRS_CONTINUE == state) {
|
||
|
|
if( !first_continue_pass ) {
|
||
|
|
if( opal_cr_timing_barrier_enabled ) {
|
||
|
|
OPAL_CR_SET_TIMER(OPAL_CR_TIMER_P2PBR1);
|
||
|
|
orte_grpcomm.barrier();
|
||
|
|
}
|
||
|
|
OPAL_CR_SET_TIMER(OPAL_CR_TIMER_P2P3);
|
||
|
|
}
|
||
|
|
|
||
|
|
if( ompi_cr_continue_like_restart && !first_continue_pass ) {
|
||
|
|
/*
|
||
|
|
* Exchange the modex information once again.
|
||
|
|
* BTLs will have republished their modex information.
|
||
|
|
*/
|
||
|
|
if (OMPI_SUCCESS != (ret = orte_grpcomm.modex(NULL))) {
|
||
|
|
opal_output(0,
|
||
|
|
"pml:csum: ft_event(Restart): Failed orte_grpcomm.modex() = %d",
|
||
|
|
ret);
|
||
|
|
return ret;
|
||
|
|
}
|
||
|
|
|
||
|
|
/*
|
||
|
|
* Startup the PML stack now that the modex is running again
|
||
|
|
* Add the new procs (BTLs redo modex recv's)
|
||
|
|
*/
|
||
|
|
if( OMPI_SUCCESS != (ret = mca_pml_csum_add_procs(procs, num_procs) ) ) {
|
||
|
|
opal_output(0, "pml:csum: ft_event(Restart): Failed in add_procs (%d)", ret);
|
||
|
|
return ret;
|
||
|
|
}
|
||
|
|
|
||
|
|
/* Is this barrier necessary ? JJH */
|
||
|
|
if (OMPI_SUCCESS != (ret = orte_grpcomm.barrier())) {
|
||
|
|
opal_output(0, "pml:csum: ft_event(Restart): Failed in orte_grpcomm.barrier (%d)", ret);
|
||
|
|
return ret;
|
||
|
|
}
|
||
|
|
|
||
|
|
if( NULL != procs ) {
|
||
|
|
for(p = 0; p < (int)num_procs; ++p) {
|
||
|
|
OBJ_RELEASE(procs[p]);
|
||
|
|
}
|
||
|
|
free(procs);
|
||
|
|
procs = NULL;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
if( !first_continue_pass ) {
|
||
|
|
if( opal_cr_timing_barrier_enabled ) {
|
||
|
|
OPAL_CR_SET_TIMER(OPAL_CR_TIMER_P2PBR2);
|
||
|
|
orte_grpcomm.barrier();
|
||
|
|
}
|
||
|
|
OPAL_CR_SET_TIMER(OPAL_CR_TIMER_CRCP1);
|
||
|
|
}
|
||
|
|
}
|
||
|
|
else if(OPAL_CRS_RESTART_PRE == state ) {
|
||
|
|
/* Nothing here */
|
||
|
|
}
|
||
|
|
else if(OPAL_CRS_RESTART == state ) {
|
||
|
|
/*
|
||
|
|
* Exchange the modex information once again.
|
||
|
|
* BTLs will have republished their modex information.
|
||
|
|
*/
|
||
|
|
if (OMPI_SUCCESS != (ret = orte_grpcomm.modex(NULL))) {
|
||
|
|
opal_output(0,
|
||
|
|
"pml:csum: ft_event(Restart): Failed orte_grpcomm.modex() = %d",
|
||
|
|
ret);
|
||
|
|
return ret;
|
||
|
|
}
|
||
|
|
|
||
|
|
/*
|
||
|
|
* Startup the PML stack now that the modex is running again
|
||
|
|
* Add the new procs (BTLs redo modex recv's)
|
||
|
|
*/
|
||
|
|
if( OMPI_SUCCESS != (ret = mca_pml_csum_add_procs(procs, num_procs) ) ) {
|
||
|
|
opal_output(0, "pml:csum: ft_event(Restart): Failed in add_procs (%d)", ret);
|
||
|
|
return ret;
|
||
|
|
}
|
||
|
|
|
||
|
|
/* Is this barrier necessary ? JJH */
|
||
|
|
if (OMPI_SUCCESS != (ret = orte_grpcomm.barrier())) {
|
||
|
|
opal_output(0, "pml:csum: ft_event(Restart): Failed in orte_grpcomm.barrier (%d)", ret);
|
||
|
|
return ret;
|
||
|
|
}
|
||
|
|
|
||
|
|
if( NULL != procs ) {
|
||
|
|
for(p = 0; p < (int)num_procs; ++p) {
|
||
|
|
OBJ_RELEASE(procs[p]);
|
||
|
|
}
|
||
|
|
free(procs);
|
||
|
|
procs = NULL;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
else if(OPAL_CRS_TERM == state ) {
|
||
|
|
;
|
||
|
|
}
|
||
|
|
else {
|
||
|
|
;
|
||
|
|
}
|
||
|
|
|
||
|
|
return OMPI_SUCCESS;
|
||
|
|
}
|
||
|
|
#endif /* OPAL_ENABLE_FT */
|
||
|
|
|
||
|
|
int mca_pml_csum_com_btl_comp(const void *v1, const void *v2)
|
||
|
|
{
|
||
|
|
const mca_pml_csum_com_btl_t *b1 = (const mca_pml_csum_com_btl_t *) v1;
|
||
|
|
const mca_pml_csum_com_btl_t *b2 = (const mca_pml_csum_com_btl_t *) v2;
|
||
|
|
|
||
|
|
if(b1->bml_btl->btl_weight < b2->bml_btl->btl_weight)
|
||
|
|
return 1;
|
||
|
|
if(b1->bml_btl->btl_weight > b2->bml_btl->btl_weight)
|
||
|
|
return -1;
|
||
|
|
|
||
|
|
return 0;
|
||
|
|
}
|
||
|
|
|