d4afb16f5a
This commit rewrites both the mpool and rcache frameworks. Summary of changes: - Before this change a significant portion of the rcache functionality lived in mpool components. This meant that it was impossible to add a new memory pool to use with rdma networks (ugni, openib, etc) without duplicating the functionality of an existing mpool component. All the registration functionality has been removed from the mpool and placed in the rcache framework. - All registration cache mpools components (udreg, grdma, gpusm, rgpusm) have been changed to rcache components. rcaches are allocated and released in the same way mpool components were. - It is now valid to pass NULL as the resources argument when creating an rcache. At this time the gpusm and rgpusm components support this. All other rcache components require non-NULL resources. - A new mpool component has been added: hugepage. This component supports huge page allocations on linux. - Memory pools are now allocated using "hints". Each mpool component is queried with the hints and returns a priority. The current hints supported are NULL (uses posix_memalign/malloc), page_size=x (huge page mpool), and mpool=x. - The sm mpool has been moved to common/sm. This reflects that the sm mpool is specialized and not meant for any general allocations. This mpool may be moved back into the mpool framework if there is any objection. - The opal_free_list_init arguments have been updated. The unused0 argument is not used to pass in the registration cache module. The mpool registration flags are now rcache registration flags. - All components have been updated to make use of the new framework interfaces. As this commit makes significant changes to both the mpool and rcache frameworks both versions have been bumped to 3.0.0. Signed-off-by: Nathan Hjelm <hjelmn@lanl.gov>
101 строка
3.0 KiB
C
101 строка
3.0 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-2006 The Regents of the University of California.
|
|
* All rights reserved.
|
|
* Copyright (c) 2007 Cisco Systems, Inc. All rights reserved.
|
|
* Copyright (c) 2015 Los Alamos National Security, LLC. All rights
|
|
* reserved.
|
|
* $COPYRIGHT$
|
|
*
|
|
* Additional copyrights may follow
|
|
*
|
|
* $HEADER$
|
|
*/
|
|
|
|
#ifndef MCA_MPOOL_BASE_TREE_H
|
|
#define MCA_MPOOL_BASE_TREE_H
|
|
|
|
#include "opal_config.h"
|
|
|
|
#define MCA_MPOOL_BASE_TREE_MAX 8
|
|
#include "opal/mca/mca.h"
|
|
#include "opal/mca/mpool/mpool.h"
|
|
#include "opal/mca/rcache/rcache.h"
|
|
|
|
BEGIN_C_DECLS
|
|
|
|
/*
|
|
* Data structures for the tree of allocated memory
|
|
* used for MPI_Alloc_mem and MPI_Free_mem
|
|
*/
|
|
|
|
/**
|
|
* The item in the tree itself
|
|
*/
|
|
struct mca_mpool_base_tree_item_t
|
|
{
|
|
opal_free_list_item_t super; /**< the parent class */
|
|
void* key; /**< the address this was alloc'd on */
|
|
size_t num_bytes; /**< the number of bytes in this alloc, only for
|
|
debugging reporting with
|
|
mpi_show_mpi_alloc_mem_leaks */
|
|
mca_mpool_base_module_t *mpool;
|
|
mca_rcache_base_module_t *rcaches[MCA_MPOOL_BASE_TREE_MAX]; /**< the registration caches */
|
|
mca_rcache_base_registration_t *regs[MCA_MPOOL_BASE_TREE_MAX]; /**< the registrations */
|
|
uint8_t count; /**< length of the mpools/regs array */
|
|
};
|
|
typedef struct mca_mpool_base_tree_item_t mca_mpool_base_tree_item_t;
|
|
|
|
OPAL_DECLSPEC OBJ_CLASS_DECLARATION(mca_mpool_base_tree_item_t);
|
|
|
|
/*
|
|
* initialize/finalize the rb tree
|
|
*/
|
|
int mca_mpool_base_tree_init(void);
|
|
int mca_mpool_base_tree_fini(void);
|
|
|
|
/*
|
|
* insert an item in the rb tree
|
|
*/
|
|
int mca_mpool_base_tree_insert(mca_mpool_base_tree_item_t* item);
|
|
|
|
/*
|
|
* remove an item from the rb tree
|
|
*/
|
|
int mca_mpool_base_tree_delete(mca_mpool_base_tree_item_t* item);
|
|
|
|
|
|
/**
|
|
* find the item in the rb tree
|
|
*/
|
|
mca_mpool_base_tree_item_t* mca_mpool_base_tree_find(void* base);
|
|
|
|
/*
|
|
* get a tree item from the free list
|
|
*/
|
|
mca_mpool_base_tree_item_t* mca_mpool_base_tree_item_get(void);
|
|
|
|
/*
|
|
* put tree item back into the free list
|
|
*/
|
|
void mca_mpool_base_tree_item_put(mca_mpool_base_tree_item_t* item);
|
|
|
|
/*
|
|
* For debugging, print a show_help kind of message if there are items
|
|
* left in the tree. The argument is the number of items to be printed
|
|
* before becoming silent.
|
|
*/
|
|
void mca_mpool_base_tree_print(int);
|
|
|
|
END_C_DECLS
|
|
|
|
#endif /* MCA_MPOOL_BASE_TREE_H */
|