X-Git-Url: http://info.iut-bm.univ-fcomte.fr/pub/gitweb/simgrid.git/blobdiff_plain/c7b463c9c17665403d001fc59cb649551e93d950..9a5bef704c2690a8fc084dd6765fcb347d55ecc8:/src/xbt/mmalloc/mrealloc.c diff --git a/src/xbt/mmalloc/mrealloc.c b/src/xbt/mmalloc/mrealloc.c index 7b803fee3c..dc31fa19e2 100644 --- a/src/xbt/mmalloc/mrealloc.c +++ b/src/xbt/mmalloc/mrealloc.c @@ -1,6 +1,6 @@ /* Change the size of a block allocated by `mmalloc'. Copyright 1990, 1991 Free Software Foundation - Written May 1989 by Mike Haertel. */ + Written May 1989 by Mike Haertel. */ /* Copyright (c) 2010. The SimGrid Team. * All rights reserved. */ @@ -38,7 +38,7 @@ void *mrealloc(xbt_mheap_t mdp, void *ptr, size_t size) if ((char *) ptr < (char *) mdp->heapbase || BLOCK(ptr) > mdp->heapsize) { printf - ("FIXME. Ouch, this pointer is not mine, refusing to proceed (another solution would be to malloc it instead of reallocing it, see source code)\n"); + ("FIXME. Ouch, this pointer is not mine, refusing to proceed (another solution would be to malloc it instead of reallocing it, see source code)\n"); result = mmalloc(mdp, size); abort(); return result; @@ -83,14 +83,16 @@ void *mrealloc(xbt_mheap_t mdp, void *ptr, size_t size) /* The new size is smaller; return excess memory to the free list. */ //printf("(%s) return excess memory...",xbt_thread_self_name()); for (it= block+blocks; it< mdp->heapinfo[block].busy_block.size ; it++) - mdp->heapinfo[it].type = 0; // FIXME that should be useless, type should already be 0 here + mdp->heapinfo[it].type = 0; // FIXME that should be useless, type should already be 0 here mdp->heapinfo[block + blocks].busy_block.size - = mdp->heapinfo[block].busy_block.size - blocks; + = mdp->heapinfo[block].busy_block.size - blocks; mfree(mdp, ADDRESS(block + blocks)); mdp->heapinfo[block].busy_block.size = blocks; mdp->heapinfo[block].busy_block.busy_size = requested_size; + mdp->heapinfo[block].busy_block.ignore = 0; + mdp->heapinfo[block].busy_block.equal_to = NULL; result = ptr; } else if (blocks == mdp->heapinfo[block].busy_block.size) { @@ -98,11 +100,14 @@ void *mrealloc(xbt_mheap_t mdp, void *ptr, size_t size) /* No block size change necessary; only update the requested size */ result = ptr; mdp->heapinfo[block].busy_block.busy_size = requested_size; + mdp->heapinfo[block].busy_block.ignore = 0; + mdp->heapinfo[block].busy_block.equal_to = NULL; } else { /* Won't fit, so allocate a new region that will. - Free the old region first in case there is sufficient - adjacent free space to grow without moving. */ + Free the old region first in case there is sufficient adjacent free space to grow without moving. + This trick mandates using a specific version of mmalloc that does not memset the memory to 0 after + action for obvious reasons. */ blocks = mdp->heapinfo[block].busy_block.size; /* Prevent free from actually returning memory to the system. */ oldlimit = mdp->heaplimit; @@ -110,9 +115,12 @@ void *mrealloc(xbt_mheap_t mdp, void *ptr, size_t size) mfree(mdp, ptr); mdp->heaplimit = oldlimit; - result = mmalloc(mdp, requested_size); + result = mmalloc_no_memset(mdp, requested_size); + //fprintf(stderr,"remalloc(%zu)~>%p\n",requested_size,result); + if (ptr != result) memmove(result, ptr, blocks * BLOCKSIZE); + /* FIXME: we should memset the end of the recently area */ } break; @@ -125,6 +133,8 @@ void *mrealloc(xbt_mheap_t mdp, void *ptr, size_t size) result = ptr; int frag_nb = RESIDUAL(result, BLOCKSIZE) >> type; mdp->heapinfo[block].busy_frag.frag_size[frag_nb] = requested_size; + mdp->heapinfo[block].busy_frag.ignore[frag_nb] = 0; + mdp->heapinfo[block].busy_frag.equal_to[frag_nb] = NULL; } else { /* fragment -> Either other fragment, or block */ /* The new size is different; allocate a new space,