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"
20 #include <semaphore.h>
30 #define MMALLOC_MAGIC "mmalloc" /* Mapped file magic number */
31 #define MMALLOC_MAGIC_SIZE 8 /* Size of magic number buf */
32 #define MMALLOC_VERSION 2 /* Current mmalloc version */
34 /* The allocator divides the heap into blocks of fixed size; large
35 requests receive one or more whole blocks, and small requests
36 receive a fragment of a block. Fragment sizes are powers of two,
37 and all fragments of a block are the same size. When all the
38 fragments in a block have been freed, the block itself is freed.
40 FIXME: we are not targeting 16bits machines anymore; update values */
42 #define INT_BIT (CHAR_BIT * sizeof(int))
43 #define BLOCKLOG (INT_BIT > 16 ? 12 : 9)
44 #define BLOCKSIZE ((unsigned int) 1 << BLOCKLOG)
45 #define BLOCKIFY(SIZE) (((SIZE) + BLOCKSIZE - 1) / BLOCKSIZE)
47 /* We keep fragment-specific meta-data for introspection purposes, and these
48 * information are kept in fixed lenght arrays. Here is the computation of
51 * Never make SMALLEST_POSSIBLE_MALLOC smaller than sizeof(list) because we
52 * need to enlist the free fragments.
55 #define SMALLEST_POSSIBLE_MALLOC (sizeof(struct list))
56 #define MAX_FRAGMENT_PER_BLOCK (BLOCKSIZE / SMALLEST_POSSIBLE_MALLOC)
58 /* The difference between two pointers is a signed int. On machines where
59 the data addresses have the high bit set, we need to ensure that the
60 difference becomes an unsigned int when we are using the address as an
61 integral value. In addition, when using with the '%' operator, the
62 sign of the result is machine dependent for negative values, so force
63 it to be treated as an unsigned int. */
65 #define ADDR2UINT(addr) ((unsigned int) ((char*) (addr) - (char*) NULL))
66 #define RESIDUAL(addr,bsize) ((unsigned int) (ADDR2UINT (addr) % (bsize)))
68 /* Determine the amount of memory spanned by the initial heap table
69 (not an absolute limit). */
71 #define HEAP (INT_BIT > 16 ? 4194304 : 65536)
73 /* Number of contiguous free blocks allowed to build up at the end of
74 memory before they will be returned to the system.
75 FIXME: this is not used anymore: we never return memory to the system. */
76 #define FINAL_FREE_BLOCKS 8
78 /* Where to start searching the free list when looking for new memory.
79 The two possible values are 0 and heapindex. Starting at 0 seems
80 to reduce total memory usage, while starting at heapindex seems to
83 #define MALLOC_SEARCH_START mdp -> heapindex
85 /* Address to block number and vice versa. */
87 #define BLOCK(A) (((char*) (A) - (char*) mdp -> heapbase) / BLOCKSIZE + 1)
89 #define ADDRESS(B) ((void*) (((ADDR2UINT(B)) - 1) * BLOCKSIZE + (char*) mdp -> heapbase))
91 /* Doubly linked lists of free fragments. */
97 /* Data structure giving per-block information.
99 * There is one such structure in the mdp->heapinfo array per block used in that heap,
100 * the array index is the block number.
102 * There is several types of blocks in memory:
103 * - full busy blocks: used when we are asked to malloc a block which size is > BLOCKSIZE/2
104 * In this situation, the full block is given to the malloc.
106 * - fragmented busy blocks: when asked for smaller amount of memory.
107 * Fragment sizes are only power of 2. When looking for such a free fragment,
108 * we get one from mdp->fraghead (that contains a linked list of blocks fragmented at that
109 * size and containing a free fragment), or we get a fresh block that we fragment.
111 * - free blocks are grouped by clusters, that are chained together.
112 * When looking for free blocks, we traverse the mdp->heapinfo looking
113 * for a cluster of free blocks that would be large enough.
115 * The size of the cluster is only to be trusted in the first block of the cluster, not in the middle blocks.
117 * The type field is consistently updated for every blocks, even within clusters of blocks.
118 * You can crawl the array and rely on that value.
121 * - make room to store the backtrace of where the blocks and fragment were malloced, too.
124 int type; /* 0: busy large block
125 >0: busy fragmented (fragments of size 2^type bytes)
128 /* Heap information for a busy block. */
130 size_t nfree; /* Free fragments in a fragmented block. */
131 size_t first; /* First free fragment of the block. */
132 unsigned short frag_size[MAX_FRAGMENT_PER_BLOCK];
133 //void *bt[XBT_BACKTRACE_SIZE][MAX_FRAGMENT_PER_BLOCK]; /* Where it was malloced (or realloced lastly) */
136 size_t size; /* Size (in blocks) of a large cluster. */
137 size_t busy_size; /* Actually used space, in bytes */
138 void *bt[XBT_BACKTRACE_SIZE]; /* Where it was malloced (or realloced lastly) */
141 /* Heap information for a free block (that may be the first of a free cluster). */
143 size_t size; /* Size (in blocks) of a free cluster. */
144 size_t next; /* Index of next free cluster. */
145 size_t prev; /* Index of previous free cluster. */
150 /* Internal structure that defines the format of the malloc-descriptor.
151 This gets written to the base address of the region that mmalloc is
152 managing, and thus also becomes the file header for the mapped file,
153 if such a file exists. */
157 /* Semaphore locking the access to the heap */
161 /* Number of processes that attached the heap */
162 unsigned int refcount;
164 /* Chained lists of mdescs */
165 struct mdesc *next_mdesc;
167 /* The "magic number" for an mmalloc file. */
168 char magic[MMALLOC_MAGIC_SIZE];
170 /* The size in bytes of this structure, used as a sanity check when reusing
171 a previously created mapped file. */
172 unsigned int headersize;
174 /* The version number of the mmalloc package that created this file. */
175 unsigned char version;
177 /* Some flag bits to keep track of various internal things. */
180 /* Number of info entries. */
183 /* Pointer to first block of the heap (base of the first block). */
186 /* Current search index for the heap table. */
187 /* Search index in the info table. */
190 /* Limit of valid info table indices. */
193 /* Block information table.
194 Allocated with malign/mfree (not mmalloc/mfree). */
195 /* Table indexed by block number giving per-block information. */
196 malloc_info *heapinfo;
198 /* List of all blocks containing free fragments of this size. The array indice is the log2 of requested size */
199 struct list fraghead[BLOCKLOG];
201 /* The base address of the memory region for this malloc heap. This
202 is the location where the bookkeeping data for mmap and for malloc
207 /* The current location in the memory region for this malloc heap which
208 represents the end of memory in use. */
212 /* The end of the current memory region for this malloc heap. This is
213 the first location past the end of mapped memory. */
217 /* Open file descriptor for the file to which this malloc heap is mapped.
218 This will always be a valid file descriptor, since /dev/zero is used
219 by default if no open file is supplied by the client. Also note that
220 it may change each time the region is mapped and unmapped. */
226 int mmalloc_compare_mdesc(struct mdesc *mdp1, struct mdesc *mdp2, void *std_heap_addr);
228 void mmalloc_display_info(void *h);
230 /* Bits to look at in the malloc descriptor flags word */
232 #define MMALLOC_DEVZERO (1 << 0) /* Have mapped to /dev/zero */
233 #define MMALLOC_ANONYMOUS (1 << 1) /* Use anonymous mapping */
234 #define MMALLOC_INITIALIZED (1 << 2) /* Initialized mmalloc */
236 /* A default malloc descriptor for the single sbrk() managed region. */
238 extern struct mdesc *__mmalloc_default_mdp;
240 /* Remap a mmalloc region that was previously mapped. */
242 extern void *__mmalloc_remap_core(xbt_mheap_t mdp);
244 /* Get core for the memory region specified by MDP, using SIZE as the
245 amount to either add to or subtract from the existing region. Works
246 like sbrk(), but using mmap(). */
247 extern void *mmorecore(struct mdesc *mdp, int size);
249 /* Thread-safety (if the sem is already created) FIXME: KILLIT*/
250 #define LOCK(mdp) do { \
252 fprintf(stderr,"panic! I'm not reintrant\n"); \
253 sem_wait(&mdp->sem); \
258 #define UNLOCK(mdp) do { \
259 sem_post(&mdp->sem); \
263 #endif /* __MMPRIVATE_H */