X-Git-Url: http://info.iut-bm.univ-fcomte.fr/pub/gitweb/simgrid.git/blobdiff_plain/669af35fa6a1fb42422d0844ba289c51554ee4ac..b8df87e176f27b25534f27d7e240defa32ca35bc:/src/xbt/mmalloc/mmprivate.h diff --git a/src/xbt/mmalloc/mmprivate.h b/src/xbt/mmalloc/mmprivate.h index 09cb4be8b2..c05e9e356b 100644 --- a/src/xbt/mmalloc/mmprivate.h +++ b/src/xbt/mmalloc/mmprivate.h @@ -1,7 +1,6 @@ /* Declarations for `mmalloc' and friends. */ -/* Copyright (c) 2010-2014. The SimGrid Team. - * All rights reserved. */ +/* Copyright (c) 2010-2019. The SimGrid Team. All rights reserved. */ /* This program is free software; you can redistribute it and/or modify it * under the terms of the license (GNU LGPL) which comes with this package. */ @@ -11,18 +10,29 @@ Written May 1989 by Mike Haertel. Heavily modified Mar 1992 by Fred Fish. (fnf@cygnus.com) */ -#ifndef __MMPRIVATE_H -#define __MMPRIVATE_H 1 +#ifndef XBT_MMPRIVATE_H +#define XBT_MMPRIVATE_H 1 -#include "portable.h" +#include +#include + +#include "swag.h" +#include "src/internal_config.h" #include "xbt/xbt_os_thread.h" #include "xbt/mmalloc.h" #include "xbt/ex.h" #include "xbt/dynar.h" -#include "xbt/swag.h" -#include + +#include #include +#ifndef MIN +#define MIN(a, b) ((a) < (b) ? (a) : (b)) +#endif +#ifndef MAX +#define MAX(a, b) ((a) > (b) ? (a) : (b)) +#endif + #ifdef HAVE_LIMITS_H # include #else @@ -93,6 +103,8 @@ #define ADDRESS(B) ((void*) (((ADDR2UINT(B)) - 1) * BLOCKSIZE + (char*) mdp -> heapbase)) +SG_BEGIN_DECL() + /* Doubly linked lists of free fragments. */ struct list { struct list *next; @@ -109,19 +121,6 @@ struct mstats size_t bytes_free; /* Byte total of chunks in the free list. */ }; -typedef struct s_heap_area{ - int valid; - int block; - int fragment; -}s_heap_area_t, *heap_area_t; - -typedef struct s_heap_area_pair{ - int block1; - int fragment1; - int block2; - int fragment2; -}s_heap_area_pair_t, *heap_area_pair_t; - #define MMALLOC_TYPE_HEAPINFO (-2) #define MMALLOC_TYPE_FREE (-1) #define MMALLOC_TYPE_UNFRAGMENTED 0 @@ -156,7 +155,7 @@ typedef struct { int type; /* 0: busy large block >0: busy fragmented (fragments of size 2^type bytes) <0: free block */ - + union { /* Heap information for a busy block. */ struct { @@ -190,8 +189,8 @@ typedef struct { * */ struct mdesc { - /** @brief Semaphore locking the access to the heap */ - sem_t sem; + /** @brief Mutex locking the access to the heap */ + pthread_mutex_t mutex; /** @brief Number of processes that attached the heap */ unsigned int refcount; @@ -285,39 +284,27 @@ struct mdesc { /* A default malloc descriptor for the single sbrk() managed region. */ -XBT_PUBLIC( struct mdesc ) *__mmalloc_default_mdp; +XBT_PUBLIC_DATA struct mdesc* __mmalloc_default_mdp; /* Remap a mmalloc region that was previously mapped. */ -XBT_PUBLIC( void *)__mmalloc_remap_core(xbt_mheap_t mdp); +XBT_PUBLIC void* __mmalloc_remap_core(xbt_mheap_t mdp); -XBT_PUBLIC( void *)mmorecore(struct mdesc *mdp, ssize_t size); +XBT_PUBLIC void* mmorecore(struct mdesc* mdp, ssize_t size); -/* Thread-safety (if the sem is already created) +/** Thread-safety (if the mutex is already created) * * This is mandatory in the case where the user runs a parallel simulation * in a model-checking enabled tree. Without this protection, our malloc * implementation will not like multi-threading AT ALL. */ -#define LOCK(mdp) sem_wait(&mdp->sem) -#define UNLOCK(mdp) sem_post(&mdp->sem) +#define LOCK(mdp) pthread_mutex_lock(&mdp->mutex) +#define UNLOCK(mdp) pthread_mutex_unlock(&mdp->mutex) -static XBT_INLINE void mmalloc_paranoia(struct mdesc *mdp){ +XBT_PRIVATE int malloc_use_mmalloc(void); - /* nothing to fear for no */ +XBT_PRIVATE size_t mmalloc_get_bytes_used_remote(size_t heaplimit, const malloc_info* heapinfo); -} +SG_END_DECL() -static inline int mmalloc_get_increment(malloc_info* heapinfo) { - if (heapinfo->type < 0) { - return heapinfo->free_block.size; - } else if (heapinfo->type == 0) { - return heapinfo->busy_block.size; - } else { - return 1; - } -} - -void mmcheck(xbt_mheap_t heap); - -#endif /* __MMPRIVATE_H */ +#endif