1 /* Declarations for `mmalloc' and friends.
2 Copyright 1990, 1991, 1992 Free Software Foundation
4 Written May 1989 by Mike Haertel.
5 Heavily modified Mar 1992 by Fred Fish. (fnf@cygnus.com) */
7 /* Copyright (c) 2010. The SimGrid Team.
8 * All rights reserved. */
10 /* This program is free software; you can redistribute it and/or modify it
11 * under the terms of the license (GNU LGPL) which comes with this package. */
14 #define __MMPRIVATE_H 1
17 #include "xbt/xbt_os_thread.h"
18 #include "xbt/mmalloc.h"
19 #include <semaphore.h>
30 # define MIN(A, B) ((A) < (B) ? (A) : (B))
33 #define MMALLOC_MAGIC "mmalloc" /* Mapped file magic number */
34 #define MMALLOC_MAGIC_SIZE 8 /* Size of magic number buf */
35 #define MMALLOC_VERSION 1 /* Current mmalloc version */
36 #define MMALLOC_KEYS 16 /* Keys for application use */
38 /* The allocator divides the heap into blocks of fixed size; large
39 requests receive one or more whole blocks, and small requests
40 receive a fragment of a block. Fragment sizes are powers of two,
41 and all fragments of a block are the same size. When all the
42 fragments in a block have been freed, the block itself is freed. */
44 #define INT_BIT (CHAR_BIT * sizeof(int))
45 #define BLOCKLOG (INT_BIT > 16 ? 12 : 9)
46 #define BLOCKSIZE ((unsigned int) 1 << BLOCKLOG)
47 #define BLOCKIFY(SIZE) (((SIZE) + BLOCKSIZE - 1) / BLOCKSIZE)
49 /* The difference between two pointers is a signed int. On machines where
50 the data addresses have the high bit set, we need to ensure that the
51 difference becomes an unsigned int when we are using the address as an
52 integral value. In addition, when using with the '%' operator, the
53 sign of the result is machine dependent for negative values, so force
54 it to be treated as an unsigned int. */
56 #define ADDR2UINT(addr) ((unsigned int) ((char*) (addr) - (char*) NULL))
57 #define RESIDUAL(addr,bsize) ((unsigned int) (ADDR2UINT (addr) % (bsize)))
59 /* Determine the amount of memory spanned by the initial heap table
60 (not an absolute limit). */
62 #define HEAP (INT_BIT > 16 ? 4194304 : 65536)
64 /* Number of contiguous free blocks allowed to build up at the end of
65 memory before they will be returned to the system. */
67 #define FINAL_FREE_BLOCKS 8
69 /* Where to start searching the free list when looking for new memory.
70 The two possible values are 0 and heapindex. Starting at 0 seems
71 to reduce total memory usage, while starting at heapindex seems to
74 #define MALLOC_SEARCH_START mdp -> heapindex
76 /* Address to block number and vice versa. */
78 #define BLOCK(A) (((char*) (A) - (char*) mdp -> heapbase) / BLOCKSIZE + 1)
80 #define ADDRESS(B) ((void*) (((ADDR2UINT(B)) - 1) * BLOCKSIZE + (char*) mdp -> heapbase))
82 const char *xbt_thread_self_name(void);
84 /* Data structure giving per-block information. */
86 /* Heap information for a busy block. */
88 /* Zero for a large block, or positive giving the
89 logarithm to the base two of the fragment size. */
93 size_t nfree; /* Free fragments in a fragmented block. */
94 size_t first; /* First free fragment of the block. */
97 size_t size; /* Size (in blocks) of a large cluster. */
102 /* Heap information for a free block (that may be the first of
105 size_t size; /* Size (in blocks) of a free cluster. */
106 size_t next; /* Index of next free cluster. */
107 size_t prev; /* Index of previous free cluster. */
111 /* List of blocks allocated with `mmemalign' (or `mvalloc'). */
114 struct alignlist *next;
115 void *aligned; /* The address that mmemaligned returned. */
116 void *exact; /* The address that malloc returned. */
119 /* Doubly linked lists of free fragments. */
126 /* Statistics available to the user.
127 FIXME: By design, the internals of the malloc package are no longer
128 exported to the user via an include file, so access to this data needs
129 to be via some other mechanism, such as mmstat_<something> where the
130 return value is the <something> the user is interested in. */
133 size_t bytes_total; /* Total size of the heap. */
134 size_t chunks_used; /* Chunks allocated by the user. */
135 size_t bytes_used; /* Byte total of user-allocated chunks. */
136 size_t chunks_free; /* Chunks in the free list. */
137 size_t bytes_free; /* Byte total of chunks in the free list. */
140 /* Internal structure that defines the format of the malloc-descriptor.
141 This gets written to the base address of the region that mmalloc is
142 managing, and thus also becomes the file header for the mapped file,
143 if such a file exists. */
147 /* Semaphore locking the access to the heap */
150 /* Number of processes that attached the heap */
151 unsigned int refcount;
153 /* Chained lists of mdescs */
154 struct mdesc *next_mdesc;
156 /* The "magic number" for an mmalloc file. */
157 char magic[MMALLOC_MAGIC_SIZE];
159 /* The size in bytes of this structure, used as a sanity check when reusing
160 a previously created mapped file. */
161 unsigned int headersize;
163 /* The version number of the mmalloc package that created this file. */
164 unsigned char version;
166 /* Some flag bits to keep track of various internal things. */
169 /* If a system call made by the mmalloc package fails, the errno is
170 preserved for future examination. */
173 /* Pointer to the function that is used to get more core, or return core
174 to the system, for requests using this malloc descriptor. For memory
175 mapped regions, this is the mmap() based routine. There may also be
176 a single malloc descriptor that points to an sbrk() based routine
177 for systems without mmap() or for applications that call the mmalloc()
178 package with a NULL malloc descriptor.
180 FIXME: For mapped regions shared by more than one process, this
181 needs to be maintained on a per-process basis. */
182 void *(*morecore) (struct mdesc * mdp, int size);
184 /* Pointer to the function that causes an abort when the memory checking
185 features are activated. By default this is set to abort(), but can
186 be set to another function by the application using mmalloc().
188 FIXME: For mapped regions shared by more than one process, this
189 needs to be maintained on a per-process basis. */
190 void (*abortfunc) (void);
192 /* Debugging hook for free.
194 FIXME: For mapped regions shared by more than one process, this
195 needs to be maintained on a per-process basis. */
196 void (*mfree_hook) (void *mdp, void *ptr);
198 /* Debugging hook for `malloc'.
200 FIXME: For mapped regions shared by more than one process, this
201 needs to be maintained on a per-process basis. */
202 void *(*mmalloc_hook) (void *mdp, size_t size);
204 /* Debugging hook for realloc.
206 FIXME: For mapped regions shared by more than one process, this
207 needs to be maintained on a per-process basis. */
208 void *(*mrealloc_hook) (void *mdp, void *ptr, size_t size);
210 /* Number of info entries. */
213 /* Pointer to first block of the heap (base of the first block). */
216 /* Current search index for the heap table. */
217 /* Search index in the info table. */
220 /* Limit of valid info table indices. */
223 /* Block information table.
224 Allocated with malign/__mmalloc_free (not mmalloc/mfree). */
225 /* Table indexed by block number giving per-block information. */
227 malloc_info *heapinfo;
229 /* Instrumentation. */
231 struct mstats heapstats;
233 /* Free list headers for each fragment size. */
234 /* Free lists for each fragment size. */
236 struct list fraghead[BLOCKLOG];
238 /* List of blocks allocated by memalign. */
240 struct alignlist *aligned_blocks;
242 /* The base address of the memory region for this malloc heap. This
243 is the location where the bookkeeping data for mmap and for malloc
248 /* The current location in the memory region for this malloc heap which
249 represents the end of memory in use. */
253 /* The end of the current memory region for this malloc heap. This is
254 the first location past the end of mapped memory. */
258 /* Open file descriptor for the file to which this malloc heap is mapped.
259 This will always be a valid file descriptor, since /dev/zero is used
260 by default if no open file is supplied by the client. Also note that
261 it may change each time the region is mapped and unmapped. */
265 /* An array of keys to data within the mapped region, for use by the
268 void *keys[MMALLOC_KEYS];
272 int mmalloc_compare_heap(void *h1, void *h2, void *std_heap_addr);
274 int mmalloc_compare_mdesc(struct mdesc *mdp1, struct mdesc *mdp2, void *std_heap_addr);
276 void mmalloc_display_info(void *h);
278 /* Bits to look at in the malloc descriptor flags word */
280 #define MMALLOC_DEVZERO (1 << 0) /* Have mapped to /dev/zero */
281 #define MMALLOC_ANONYMOUS (1 << 1) /* Use anonymous mapping */
282 #define MMALLOC_INITIALIZED (1 << 2) /* Initialized mmalloc */
283 #define MMALLOC_MMCHECK_USED (1 << 3) /* mmcheckf() called already */
285 /* Internal version of `mfree' used in `morecore'. */
287 extern void __mmalloc_free(struct mdesc *mdp, void *ptr);
289 /* A default malloc descriptor for the single sbrk() managed region. */
291 extern struct mdesc *__mmalloc_default_mdp;
293 /* Initialize the first use of the default malloc descriptor, which uses
296 extern struct mdesc *__mmalloc_create_default_mdp(void);
298 /* Grow or shrink a contiguous mapped region using mmap().
299 Works much like sbrk(), only faster */
301 extern void *__mmalloc_mmap_morecore(struct mdesc *mdp, int size);
304 /* Remap a mmalloc region that was previously mapped. */
306 extern void *__mmalloc_remap_core(struct mdesc *mdp);
308 /* Macro to convert from a user supplied malloc descriptor to pointer to the
309 internal malloc descriptor. If the user supplied descriptor is NULL, then
310 use the default internal version, initializing it if necessary. Otherwise
311 just cast the user supplied version (which is void *) to the proper type
314 #define MD_TO_MDP(md) \
316 ? __mmalloc_default_mdp \
317 : (struct mdesc *) (md))
319 /* Thread-safety (if the sem is already created)*/
322 struct mdesc *lock_local_mdp = MD_TO_MDP(md); \
323 sem_wait(&lock_local_mdp->sem); \
328 struct mdesc *unlock_local_mdp = MD_TO_MDP(md); \
329 sem_post(&unlock_local_mdp->sem); \
332 #endif /* __MMPRIVATE_H */