ee3517427e
Add a framework to support different types of threading models including user space thread packages such as Qthreads and argobot: https://github.com/pmodels/argobots https://github.com/Qthreads/qthreads The default threading model is pthreads. Alternate thread models are specificed at configure time using the --with-threads=X option. The framework is static. The theading model to use is selected at Open MPI configure/build time. mca/threads: implement Argobots threading layer config: fix thread configury - Add double quotations - Change Argobot to Argobots config: implement Argobots check If the poll time is too long, MPI hangs. This quick fix just sets it to 0, but it is not good for the Pthreads version. Need to find a good way to abstract it. Note that even 1 (= 1 millisecond) causes disastrous performance degradation. rework threads MCA framework configury It now works more like the ompi/mca/rte configury, modulo some edge items that are special for threading package linking, etc. qthreads module some argobots cleanup Signed-off-by: Noah Evans <noah.evans@gmail.com> Signed-off-by: Shintaro Iwasaki <siwasaki@anl.gov> Signed-off-by: Howard Pritchard <howardp@lanl.gov>
130 строки
3.9 KiB
C
130 строки
3.9 KiB
C
/* -*- Mode: C; c-basic-offset:4 ; indent-tabs-mode:nil -*- */
|
|
/*
|
|
* Copyright (c) 2004-2005 The Trustees of Indiana University and Indiana
|
|
* University Research and Technology
|
|
* Corporation. All rights reserved.
|
|
* Copyright (c) 2004-2006 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) 2009 Sun Microsystems, Inc. All rights reserved.
|
|
* Copyright (c) 2010-2017 IBM Corporation. All rights reserved.
|
|
* Copyright (c) 2015 Los Alamos National Security, LLC. All rights
|
|
* reserved.
|
|
* Copyright (c) 2017 Research Organization for Information Science
|
|
* and Technology (RIST). All rights reserved.
|
|
* $COPYRIGHT$
|
|
*
|
|
* Additional copyrights may follow
|
|
*
|
|
* $HEADER$
|
|
*/
|
|
|
|
#include "opal_config.h"
|
|
#include <stdint.h>
|
|
#include <string.h>
|
|
#include "opal/mca/mpool/mpool.h"
|
|
#include "base.h"
|
|
#include "mpool_base_tree.h"
|
|
#include "opal/mca/threads/mutex.h"
|
|
#include "opal/util/info.h"
|
|
#include "opal/align.h"
|
|
|
|
|
|
static void unregister_tree_item(mca_mpool_base_tree_item_t *mpool_tree_item)
|
|
{
|
|
mca_mpool_base_module_t *mpool;
|
|
|
|
mpool = mpool_tree_item->mpool;
|
|
mpool->mpool_free(mpool, mpool_tree_item->key);
|
|
}
|
|
|
|
/**
|
|
* Function to allocate special memory according to what the user requests in
|
|
* the info object.
|
|
*
|
|
* If the info parameter is MPI_INFO_NULL, then this function will try to allocate
|
|
* the memory with the optionally named mpool or malloc and try to register the
|
|
* pointer with as many registration caches as possible. Registration caches that
|
|
* fail to register the region will be ignored. The mpool name can optionally be
|
|
* specified in the info object.
|
|
*
|
|
* @param size the size of the memory area to allocate
|
|
* @param info an info object which tells us what kind of memory to allocate
|
|
*
|
|
* @retval pointer to the allocated memory
|
|
* @retval NULL on failure
|
|
*/
|
|
void *mca_mpool_base_alloc(size_t size, opal_info_t *info, const char *hints)
|
|
{
|
|
mca_mpool_base_tree_item_t *mpool_tree_item = NULL;
|
|
mca_mpool_base_module_t *mpool;
|
|
void *mem = NULL;
|
|
#if defined(TODO_BTL_GB)
|
|
int flag = 0;
|
|
#endif /* defined(TODO_BTL_GB) */
|
|
|
|
mpool_tree_item = mca_mpool_base_tree_item_get ();
|
|
if (!mpool_tree_item) {
|
|
return NULL;
|
|
}
|
|
|
|
mpool_tree_item->num_bytes = size;
|
|
mpool_tree_item->count = 0;
|
|
|
|
mpool = mca_mpool_base_module_lookup (hints);
|
|
if (NULL != mpool) {
|
|
mem = mpool->mpool_alloc (mpool, size, OPAL_ALIGN_MIN, 0);
|
|
}
|
|
|
|
if (NULL == mem) {
|
|
/* fall back on malloc */
|
|
mem = malloc(size);
|
|
|
|
mca_mpool_base_tree_item_put (mpool_tree_item);
|
|
} else {
|
|
mpool_tree_item->mpool = mpool;
|
|
mpool_tree_item->key = mem;
|
|
mca_mpool_base_tree_insert (mpool_tree_item);
|
|
}
|
|
|
|
return mem;
|
|
}
|
|
|
|
/**
|
|
* Function to free memory previously allocated by mca_mpool_base_alloc
|
|
*
|
|
* @param base pointer to the memory to free
|
|
*
|
|
* @retval OPAL_SUCCESS
|
|
* @retval OPAL_ERR_BAD_PARAM if the passed base pointer was invalid
|
|
*/
|
|
int mca_mpool_base_free(void *base)
|
|
{
|
|
mca_mpool_base_tree_item_t *mpool_tree_item = NULL;
|
|
int rc;
|
|
|
|
if(!base) {
|
|
return OPAL_ERROR;
|
|
}
|
|
|
|
mpool_tree_item = mca_mpool_base_tree_find(base);
|
|
|
|
if(!mpool_tree_item) {
|
|
/* nothing in the tree this was just plain old malloc'd memory */
|
|
free(base);
|
|
return OPAL_SUCCESS;
|
|
}
|
|
|
|
rc = mca_mpool_base_tree_delete(mpool_tree_item);
|
|
if(OPAL_SUCCESS == rc) {
|
|
unregister_tree_item(mpool_tree_item);
|
|
mca_mpool_base_tree_item_put(mpool_tree_item);
|
|
}
|
|
|
|
return rc;
|
|
}
|