1e0ea9dd6d
This commit fixes issues with HPL runs on node counts > 4. This commit was SVN r8793.
206 строки
6.5 KiB
C
206 строки
6.5 KiB
C
/*
|
|
* Copyright (c) 2004-2005 The Trustees of Indiana University and Indiana
|
|
* University Research and Technology
|
|
* Corporation. All rights reserved.
|
|
* Copyright (c) 2004-2005 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$
|
|
*
|
|
* Additional copyrights may follow
|
|
*
|
|
* $HEADER$
|
|
*/
|
|
|
|
|
|
/*%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%*/
|
|
|
|
#include "ompi_config.h"
|
|
#include "ompi/include/constants.h"
|
|
#include "orte/util/proc_info.h"
|
|
#include "mca/pml/pml.h"
|
|
#include "mca/btl/btl.h"
|
|
#include "mca/bml/bml.h"
|
|
#include "mca/ns/ns_types.h"
|
|
#include "mca/mpool/mpool.h"
|
|
#include "pml_ob1.h"
|
|
#include "pml_ob1_rdma.h"
|
|
|
|
/*
|
|
* Check to see if memory is registered or can be registered. Build a
|
|
* set of registrations on the request.
|
|
*/
|
|
|
|
size_t mca_pml_ob1_rdma_btls(
|
|
mca_bml_base_endpoint_t* bml_endpoint,
|
|
unsigned char* base,
|
|
size_t size,
|
|
mca_pml_ob1_rdma_btl_t* rdma_btls)
|
|
{
|
|
size_t num_btls = mca_bml_base_btl_array_get_size(&bml_endpoint->btl_rdma);
|
|
ompi_pointer_array_t regs;
|
|
size_t num_btls_used = 0;
|
|
size_t n;
|
|
int rc;
|
|
|
|
/* shortcut when there are no rdma capable btls */
|
|
if(num_btls == 0) {
|
|
return 0;
|
|
}
|
|
|
|
/* check to see if memory is registered */
|
|
OBJ_CONSTRUCT(®s, ompi_pointer_array_t);
|
|
for(n = 0; n < num_btls && num_btls_used < MCA_PML_OB1_MAX_RDMA_PER_REQUEST; n++) {
|
|
|
|
mca_bml_base_btl_t* bml_btl = mca_bml_base_btl_array_get_index(&bml_endpoint->btl_rdma, n);
|
|
mca_mpool_base_registration_t* fit = NULL;
|
|
mca_mpool_base_module_t* btl_mpool = bml_btl->btl_mpool;
|
|
uint32_t reg_cnt;
|
|
size_t r;
|
|
|
|
/* btl is rdma capable and registration is not required */
|
|
if(NULL == btl_mpool) {
|
|
rdma_btls[num_btls_used].bml_btl = bml_btl;
|
|
rdma_btls[num_btls_used].btl_reg = NULL;
|
|
num_btls_used++;
|
|
continue;
|
|
}
|
|
|
|
/* look through existing registrations */
|
|
ompi_pointer_array_remove_all(®s);
|
|
btl_mpool->mpool_find(btl_mpool,
|
|
base,
|
|
size,
|
|
®s,
|
|
®_cnt);
|
|
|
|
/*
|
|
* find the best fit when there are multiple registrations
|
|
*/
|
|
for(r = 0; r < reg_cnt; r++) {
|
|
mca_mpool_base_registration_t* reg = ompi_pointer_array_get_item(®s, r);
|
|
size_t reg_len = reg->bound - base + 1;
|
|
|
|
if(reg->flags & MCA_MPOOL_FLAGS_CACHE) {
|
|
assert(reg->ref_count >= 3);
|
|
}
|
|
if(reg->base <= base && reg_len >= size) {
|
|
fit = reg;
|
|
} else if(mca_pml_ob1.leave_pinned){
|
|
btl_mpool->mpool_deregister(btl_mpool, reg);
|
|
} else {
|
|
btl_mpool->mpool_release(btl_mpool, reg);
|
|
}
|
|
|
|
}
|
|
|
|
|
|
/* if the leave pinned option is set - and there is not an existing
|
|
* registration that satisfies this request, create one.
|
|
*/
|
|
if(NULL == fit && mca_pml_ob1.leave_pinned) {
|
|
/* register the memory */
|
|
rc = btl_mpool->mpool_register(
|
|
btl_mpool,
|
|
base,
|
|
size,
|
|
MCA_MPOOL_FLAGS_CACHE,
|
|
&fit);
|
|
if(ORTE_SUCCESS != rc || NULL == fit) {
|
|
opal_output(0, "[%s:%d] mpool_register(%p,%lu) failed, \n", __FILE__, __LINE__, base, size);
|
|
continue;
|
|
}
|
|
assert(fit->ref_count == 3);
|
|
}
|
|
|
|
|
|
if(NULL != fit) {
|
|
rdma_btls[num_btls_used].bml_btl = bml_btl;
|
|
rdma_btls[num_btls_used].btl_reg = fit;
|
|
num_btls_used++;
|
|
}
|
|
}
|
|
return num_btls_used;
|
|
}
|
|
|
|
|
|
/*
|
|
* For a given btl - find the best fit registration or
|
|
* optionally create one for leave pinned.
|
|
*/
|
|
|
|
mca_mpool_base_registration_t* mca_pml_ob1_rdma_registration(
|
|
mca_bml_base_btl_t* bml_btl,
|
|
unsigned char* base,
|
|
size_t size)
|
|
{
|
|
ompi_pointer_array_t regs;
|
|
mca_mpool_base_registration_t* fit = NULL;
|
|
mca_mpool_base_module_t* btl_mpool = bml_btl->btl_mpool;
|
|
uint32_t reg_cnt;
|
|
size_t r;
|
|
int rc;
|
|
|
|
/* btl is rdma capable and registration is not required */
|
|
if(NULL == btl_mpool) {
|
|
return NULL;
|
|
}
|
|
|
|
/* check to see if memory is registered */
|
|
OBJ_CONSTRUCT(®s, ompi_pointer_array_t);
|
|
ompi_pointer_array_remove_all(®s);
|
|
|
|
/* look through existing registrations */
|
|
btl_mpool->mpool_find(btl_mpool,
|
|
base,
|
|
size,
|
|
®s,
|
|
®_cnt);
|
|
|
|
|
|
/*
|
|
* find the best fit when there are multiple registrations
|
|
*/
|
|
for(r = 0; r < reg_cnt; r++) {
|
|
mca_mpool_base_registration_t* reg = ompi_pointer_array_get_item(®s, r);
|
|
size_t reg_len = reg->bound - base + 1;
|
|
|
|
if(reg->flags & MCA_MPOOL_FLAGS_CACHE) {
|
|
assert(reg->ref_count >= 3);
|
|
}
|
|
if(reg->base <= base && reg_len >= size) {
|
|
fit = reg;
|
|
} else if(mca_pml_ob1.leave_pinned){
|
|
btl_mpool->mpool_deregister(btl_mpool, reg);
|
|
} else {
|
|
btl_mpool->mpool_release(btl_mpool, reg);
|
|
}
|
|
}
|
|
|
|
|
|
/* if the leave pinned option is set - and there is not an existing
|
|
* registration that satisfies this request, create one.
|
|
*/
|
|
if(NULL == fit && mca_pml_ob1.leave_pinned) {
|
|
/* register the memory */
|
|
rc = btl_mpool->mpool_register(
|
|
btl_mpool,
|
|
base,
|
|
size,
|
|
MCA_MPOOL_FLAGS_CACHE,
|
|
&fit);
|
|
if(ORTE_SUCCESS != rc || NULL == fit) {
|
|
opal_output(0, "[%s:%d] mpool_register(%p,%lu) failed, \n", __FILE__, __LINE__, base, size);
|
|
return NULL;
|
|
}
|
|
assert(fit->ref_count == 3);
|
|
}
|
|
|
|
OBJ_DESTRUCT(®s);
|
|
return fit;
|
|
}
|