btl_portals.c
来自「MPI stands for the Message Passing Inter」· C语言 代码 · 共 558 行 · 第 1/2 页
C
558 行
/* * 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 <sys/types.h>#include <unistd.h>#include <stdio.h>#include <errno.h>#include "ompi/constants.h"#include "opal/util/output.h"#include "ompi/mca/pml/pml.h"#include "ompi/mca/btl/btl.h"#include "ompi/datatype/convertor.h"#include "ompi/datatype/datatype.h"#include "btl_portals.h"#include "btl_portals_endpoint.h"#include "btl_portals_recv.h"#include "btl_portals_frag.h"mca_btl_portals_module_t mca_btl_portals_module = { { &mca_btl_portals_component.super, /* NOTE: All these default values are set in component_open() */ 0, /* max size of first frag */ 0, /* min send size */ 0, /* max send size */ 0, /* min rdma size */ 0, /* max rdma size */ 0, /* exclusivity - higher than sm, lower than self */ 0, /* latency */ 0, /* bandwidth */ 0, /* btl flags */ mca_btl_portals_add_procs, mca_btl_portals_del_procs, mca_btl_portals_register, mca_btl_portals_finalize, mca_btl_portals_alloc, mca_btl_portals_free, mca_btl_portals_prepare_src, mca_btl_portals_prepare_dst, mca_btl_portals_send, mca_btl_portals_put, mca_btl_portals_get, mca_btl_base_dump, NULL, /* mpool */ NULL /* register error */ },};intmca_btl_portals_add_procs(struct mca_btl_base_module_t* btl_base, size_t nprocs, struct ompi_proc_t **procs, struct mca_btl_base_endpoint_t** peers, ompi_bitmap_t* reachable){ int ret; struct ompi_proc_t *curr_proc = NULL; ptl_process_id_t *portals_procs = NULL; size_t i; unsigned long distance; bool need_activate = false; assert(&mca_btl_portals_module == (mca_btl_portals_module_t*) btl_base); opal_output_verbose(50, mca_btl_portals_component.portals_output, "Adding %d procs (%d)", nprocs, mca_btl_portals_module.portals_num_procs); /* if we havne't already, get our network handle */ if (mca_btl_portals_module.portals_ni_h == PTL_INVALID_HANDLE) { ret = ompi_common_portals_ni_initialize(&mca_btl_portals_module.portals_ni_h); if (OMPI_SUCCESS != ret) return ret; } portals_procs = malloc(nprocs * sizeof(ptl_process_id_t)); ret = ompi_common_portals_get_procs(nprocs, procs, portals_procs); if (OMPI_SUCCESS != ret) return ret; if (0 == mca_btl_portals_module.portals_num_procs) { need_activate = true; } /* loop through all procs, setting our reachable flag */ for (i= 0; i < nprocs ; ++i) { curr_proc = procs[i]; /* portals doesn't support heterogeneous yet... */ if (ompi_proc_local()->proc_arch != curr_proc->proc_arch) { continue; } peers[i] = malloc(sizeof(mca_btl_base_endpoint_t)); if (NULL == peers[i]) return OMPI_ERROR; *((mca_btl_base_endpoint_t*) peers[i]) = portals_procs[i]; /* make sure we can reach the process - this is supposed to be a cheap-ish operation */ ret = PtlNIDist(mca_btl_portals_module.portals_ni_h, portals_procs[i], &distance); if (ret != PTL_OK) { opal_output_verbose(10, mca_btl_portals_component.portals_output, "Could not find distance to process %d", i); continue; } OPAL_THREAD_ADD32(&mca_btl_portals_module.portals_num_procs, 1); /* and here we can reach */ ompi_bitmap_set_bit(reachable, i); } if (NULL != portals_procs) free(portals_procs); if (need_activate && mca_btl_portals_module.portals_num_procs > 0) { /* create eqs */ int i; opal_output_verbose(50, mca_btl_portals_component.portals_output, "Enabling progress"); for (i = 0 ; i < OMPI_BTL_PORTALS_EQ_SIZE ; ++i) { int ptl_ret = PtlEQAlloc(mca_btl_portals_module.portals_ni_h, mca_btl_portals_module.portals_eq_sizes[i], PTL_EQ_HANDLER_NONE, &(mca_btl_portals_module.portals_eq_handles[i])); if (PTL_OK != ptl_ret) { opal_output(mca_btl_portals_component.portals_output, "Error creating EQ %d: %d", i, ptl_ret); /* BWB - better error code? */ return OMPI_ERROR; } } ret = mca_btl_portals_recv_enable(&mca_btl_portals_module); /* fill in send memory descriptor */ mca_btl_portals_module.md_send.start = NULL; mca_btl_portals_module.md_send.length = 0; mca_btl_portals_module.md_send.threshold = PTL_MD_THRESH_INF; mca_btl_portals_module.md_send.max_size = 0; mca_btl_portals_module.md_send.options = PTL_MD_EVENT_START_DISABLE; mca_btl_portals_module.md_send.user_ptr = NULL; mca_btl_portals_module.md_send.eq_handle = mca_btl_portals_module.portals_eq_handles[OMPI_BTL_PORTALS_EQ_SEND]; } else { ret = OMPI_SUCCESS; } return ret;}intmca_btl_portals_del_procs(struct mca_btl_base_module_t *btl_base, size_t nprocs, struct ompi_proc_t **procs, struct mca_btl_base_endpoint_t **peers){ size_t i = 0; int ret = OMPI_SUCCESS; assert(&mca_btl_portals_module == (mca_btl_portals_module_t*) btl_base); opal_output_verbose(50, mca_btl_portals_component.portals_output, "Removing %d procs (%d)", nprocs, mca_btl_portals_module.portals_num_procs); for (i = 0 ; i < nprocs ; ++i) { free(peers[i]); OPAL_THREAD_ADD32(&mca_btl_portals_module.portals_num_procs, -1); } if (0 == mca_btl_portals_module.portals_num_procs) { int i; opal_output_verbose(50, mca_btl_portals_component.portals_output, "Disabling progress"); ret = mca_btl_portals_recv_disable(&mca_btl_portals_module); /* destroy eqs */ for (i = 0 ; i < OMPI_BTL_PORTALS_EQ_SIZE ; ++i) { int ptl_ret = PtlEQFree(mca_btl_portals_module.portals_eq_handles[i]); if (PTL_OK != ptl_ret) { opal_output(mca_btl_portals_component.portals_output, "Error freeing EQ %d: %d", i, ptl_ret); } } } else { ret = OMPI_SUCCESS; } return ret;}intmca_btl_portals_register(struct mca_btl_base_module_t* btl_base, mca_btl_base_tag_t tag, mca_btl_base_module_recv_cb_fn_t cbfunc, void* cbdata){ assert(&mca_btl_portals_module == (mca_btl_portals_module_t*) btl_base); mca_btl_portals_module.portals_reg[tag].cbfunc = cbfunc; mca_btl_portals_module.portals_reg[tag].cbdata = cbdata; return OMPI_SUCCESS;}mca_btl_base_descriptor_t*mca_btl_portals_alloc(struct mca_btl_base_module_t* btl_base, size_t size){ int rc; mca_btl_portals_frag_t* frag; assert(&mca_btl_portals_module == (mca_btl_portals_module_t*) btl_base); if (size <= mca_btl_portals_module.super.btl_eager_limit) { OMPI_BTL_PORTALS_FRAG_ALLOC_EAGER(&mca_btl_portals_module, frag, rc); if (OMPI_SUCCESS != rc) return NULL; frag->segments[0].seg_len = size <= mca_btl_portals_module.super.btl_eager_limit ? size : mca_btl_portals_module.super.btl_eager_limit ; } else { OMPI_BTL_PORTALS_FRAG_ALLOC_MAX(&mca_btl_portals_module, frag, rc); if (OMPI_SUCCESS != rc) return NULL; frag->segments[0].seg_len = size <= mca_btl_portals_module.super.btl_max_send_size ? size : mca_btl_portals_module.super.btl_max_send_size ; } frag->base.des_src_cnt = 1; frag->base.des_flags = 0; return &frag->base;}intmca_btl_portals_free(struct mca_btl_base_module_t* btl_base, mca_btl_base_descriptor_t* des) { mca_btl_portals_frag_t* frag = (mca_btl_portals_frag_t*) des; assert(&mca_btl_portals_module == (mca_btl_portals_module_t*) btl_base); if (BTL_PORTALS_FRAG_TYPE_EAGER == frag->type) { /* don't ever unlink eager frags */ OMPI_BTL_PORTALS_FRAG_RETURN_EAGER(&mca_btl_portals_module.super, frag); } else if (BTL_PORTALS_FRAG_TYPE_MAX == frag->type) { if (frag->md_h != PTL_INVALID_HANDLE) {
⌨️ 快捷键说明
复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?