1 /* Copyright (c) 2010. The SimGrid Team.
2 * All rights reserved. */
4 /* This program is free software; you can redistribute it and/or modify it
5 * under the terms of the license (GNU LGPL) which comes with this package. */
7 /* Redefine the classical malloc/free/realloc functions so that they fit well in the mmalloc framework */
10 #include "gras_config.h"
13 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(xbt_mm_legacy, xbt,
14 "Logging specific to mm_legacy in mmalloc");
16 static void *__mmalloc_current_heap = NULL; /* The heap we are currently using. */
18 #include "xbt_modinter.h"
20 void *mmalloc_get_current_heap(void)
22 return __mmalloc_current_heap;
25 void mmalloc_set_current_heap(void *new_heap)
27 __mmalloc_current_heap = new_heap;
30 #ifdef MMALLOC_WANT_OVERIDE_LEGACY
31 void *malloc(size_t n)
33 void *mdp = __mmalloc_current_heap;
39 void *ret = mmalloc(mdp, n);
45 void *calloc(size_t nmemb, size_t size)
47 size_t total_size = nmemb * size;
48 void *mdp = __mmalloc_current_heap;
54 void *ret = mmalloc(mdp, total_size);
57 /* Fill the allocated memory with zeroes to mimic calloc behaviour */
58 memset(ret, '\0', total_size);
63 void *realloc(void *p, size_t s)
66 void *mdp = __mmalloc_current_heap;
74 ret = mrealloc(mdp, p, s);
76 ret = mmalloc(mdp, s);
87 void *mdp = __mmalloc_current_heap;
97 /* Make sure it works with md==NULL */
99 /* Safety gap from the heap's break address.
100 * Try to increase this first if you experience strange errors under
102 #define HEAP_OFFSET (128UL<<20)
104 void *mmalloc_get_default_md(void)
106 xbt_assert(__mmalloc_default_mdp);
107 return __mmalloc_default_mdp;
110 static void mmalloc_fork_prepare(void)
112 struct mdesc* mdp = NULL;
113 if ((mdp =__mmalloc_default_mdp)){
119 mdp = mdp->next_mdesc;
124 static void mmalloc_fork_parent(void)
126 struct mdesc* mdp = NULL;
127 if ((mdp =__mmalloc_default_mdp)){
131 mdp = mdp->next_mdesc;
136 static void mmalloc_fork_child(void)
138 struct mdesc* mdp = NULL;
139 if ((mdp =__mmalloc_default_mdp)){
142 mdp = mdp->next_mdesc;
147 /* Initialize the default malloc descriptor. */
148 void mmalloc_preinit(void)
151 if (!__mmalloc_default_mdp) {
152 unsigned long mask = ~((unsigned long)getpagesize() - 1);
153 void *addr = (void*)(((unsigned long)sbrk(0) + HEAP_OFFSET) & mask);
154 __mmalloc_default_mdp = mmalloc_attach(-1, addr);
155 /* Fixme? only the default mdp in protected against forks */
156 res = xbt_os_thread_atfork(mmalloc_fork_prepare,
157 mmalloc_fork_parent, mmalloc_fork_child);
159 THROWF(system_error,0,"xbt_os_thread_atfork() failed: return value %d",res);
161 xbt_assert(__mmalloc_default_mdp != NULL);
164 void mmalloc_postexit(void)
166 /* Do not detach the default mdp or ldl won't be able to free the memory it allocated since we're in memory */
167 // mmalloc_detach(__mmalloc_default_mdp);
168 mmalloc_pre_detach(__mmalloc_default_mdp);
171 int mmalloc_compare_heap(void *h1, void *h2){
173 if(h1 == NULL && h2 == NULL){
174 XBT_DEBUG("Malloc descriptors null");
178 struct mdesc *mdp1, *mdp2;
179 mdp1 = MD_TO_MDP(h1);
180 mdp2 = MD_TO_MDP(h2);
182 return mmalloc_compare_mdesc(mdp1, mdp2))
186 int mmalloc_compare_mdesc(struct mdesc *mdp1, struct mdesc *mdp2){
188 if(mdp1->headersize != mdp2->headersize){
189 XBT_DEBUG("Different size of the file header for the mapped files");
193 if(mdp1->refcount != mdp2->refcount){
194 XBT_DEBUG("Different number of processes that attached the heap");
198 if(strcmp(mdp1->magic, mdp2->magic) != 0){
199 XBT_DEBUG("Different magic number");
203 if(mdp1->flags != mdp2->flags){
204 XBT_DEBUG("Different flags");
208 if(mdp1->heapsize != mdp2->heapsize){
209 XBT_DEBUG("Different number of info entries");
213 //XBT_DEBUG("Heap size : %Zu", mdp1->heapsize);
215 if(mdp1->heapbase != mdp2->heapbase){
216 XBT_DEBUG("Different first block of the heap");
221 if(mdp1->heapindex != mdp2->heapindex){
222 XBT_DEBUG("Different index for the heap table : %Zu - %Zu", mdp1->heapindex, mdp2->heapindex);
226 //XBT_DEBUG("Heap index : %Zu", mdp1->heapindex);
228 if(mdp1->base != mdp2->base){
229 XBT_DEBUG("Different base address of the memory region");
233 if(mdp1->breakval != mdp2->breakval){
234 XBT_DEBUG("Different current location in the memory region");
238 if(mdp1->top != mdp2->top){
239 XBT_DEBUG("Different end of the current location in the memory region");
243 if(mdp1->heaplimit != mdp2->heaplimit){
244 XBT_DEBUG("Different limit of valid info table indices");
248 //XBT_DEBUG("Heap limit : %Zu", mdp1->heaplimit);
251 if(mdp1->fd != mdp2->fd){
252 XBT_DEBUG("Different file descriptor for the file to which this malloc heap is mapped");
256 if(mdp1->saved_errno != mdp2->saved_errno){
257 XBT_DEBUG("Different errno");
261 if(mdp1->version != mdp2->version){
262 XBT_DEBUG("Different version of the mmalloc package");
267 size_t block_free1, block_free2 , next_block_free, first_block_free, block_free ;
269 void *addr_block1, *addr_block2;
273 /* Search index of the first free block */
275 block_free1 = mdp1->heapindex;
276 block_free2 = mdp2->heapindex;
278 while(mdp1->heapinfo[block_free1].free.prev != 0){
279 block_free1 = mdp1->heapinfo[block_free1].free.prev;
282 while(mdp2->heapinfo[block_free2].free.prev != 0){
283 block_free2 = mdp1->heapinfo[block_free2].free.prev;
286 if(block_free1 != block_free2){
287 XBT_DEBUG("Different first free block");
291 first_block_free = block_free1;
293 if(mdp1->heapinfo[first_block_free].free.size != mdp2->heapinfo[first_block_free].free.size){
294 XBT_DEBUG("Different size (in blocks) of the first free cluster");
298 /* Check busy blocks (circular checking)*/
300 i = first_block_free + mdp1->heapinfo[first_block_free].free.size;
302 if(mdp1->heapinfo[first_block_free].free.next != mdp2->heapinfo[first_block_free].free.next){
303 XBT_DEBUG("Different next block free");
307 block_free = first_block_free;
308 next_block_free = mdp1->heapinfo[first_block_free].free.next;
310 //XBT_DEBUG("First block free : %Zu (size=%Zu), Next block free : %Zu", first_block_free, mdp1->heapinfo[block_free1].free.size, next_block_free);
312 if(next_block_free == 0)
313 next_block_free = mdp1->heaplimit;
316 while(i != first_block_free){
318 while(i<next_block_free){
320 if(mdp1->heapinfo[i].busy.type != mdp2->heapinfo[i].busy.type){
321 XBT_DEBUG("Different type of busy block");
325 addr_block1 = (char *)mdp1 + sizeof(struct mdesc) + ((i-1) * BLOCKSIZE);
326 addr_block2 = (char *)mdp2 + sizeof(struct mdesc) + ((i-1) * BLOCKSIZE);
328 switch(mdp1->heapinfo[i].busy.type){
330 if(mdp1->heapinfo[i].busy.info.size != mdp2->heapinfo[i].busy.info.size){
331 XBT_DEBUG("Different size of a large cluster");
334 if(memcmp(addr_block1, addr_block2, (mdp1->heapinfo[i].busy.info.size * BLOCKSIZE)) != 0){
335 XBT_DEBUG("Different data in block %Zu", i);
339 i = i+mdp1->heapinfo[i].busy.info.size;
342 if(mdp1->heapinfo[i].busy.info.frag.nfree != mdp2->heapinfo[i].busy.info.frag.nfree){
343 XBT_DEBUG("Different free fragments in the fragmented block %Zu", i);
346 if(mdp1->heapinfo[i].busy.info.frag.first != mdp2->heapinfo[i].busy.info.frag.first){
347 XBT_DEBUG("Different first free fragments in the block %Zu", i);
350 frag_size = pow(2,mdp1->heapinfo[i].busy.type);
351 for(j=0 ; j< (BLOCKSIZE/frag_size); j++){
352 if(memcmp((char *)addr_block1 + (j * frag_size), (char *)addr_block2 + (j * frag_size), frag_size) != 0){
353 XBT_DEBUG("Different data in fragment %d of block %Zu", j + 1, i);
366 if(mdp1->heapinfo[block_free].free.next != mdp2->heapinfo[block_free].free.next){
367 XBT_DEBUG("Different next block free");
371 block_free = mdp1->heapinfo[block_free].free.next;
372 next_block_free = mdp1->heapinfo[block_free].free.next;
373 if(i != first_block_free){
375 if(mdp1->heapinfo[block_free].free.size != mdp2->heapinfo[block_free].free.size){
376 XBT_DEBUG("Different size of block free");
379 i = block_free + mdp1->heapinfo[block_free].free.size;