X-Git-Url: http://info.iut-bm.univ-fcomte.fr/pub/gitweb/simgrid.git/blobdiff_plain/fa222c38f9b796be07ab4351ffc810a61a8fd705..d37695654af494c87f28017306376b8c229aaec0:/src/xbt/mmalloc/mfree.c diff --git a/src/xbt/mmalloc/mfree.c b/src/xbt/mmalloc/mfree.c index a08c7dde9a..e08aba34f4 100644 --- a/src/xbt/mmalloc/mfree.c +++ b/src/xbt/mmalloc/mfree.c @@ -1,7 +1,6 @@ /* Free a block of memory allocated by `mmalloc'. */ -/* Copyright (c) 2010-2015. 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. */ @@ -21,25 +20,21 @@ /* Return memory to the heap. */ void mfree(struct mdesc *mdp, void *ptr) { - int type; - size_t block, frag_nb; + size_t frag_nb; size_t i; int it; - mmalloc_paranoia(mdp); -// fprintf(stderr,"free(%p)\n",ptr); - if (ptr == NULL) return; - block = BLOCK(ptr); + size_t block = BLOCK(ptr); if ((char *) ptr < (char *) mdp->heapbase || block > mdp->heapsize) { fprintf(stderr,"Ouch, this pointer is not mine, I refuse to free it. Give me valid pointers, or give me death!!\n"); abort(); } - type = mdp->heapinfo[block].type; + int type = mdp->heapinfo[block].type; switch (type) { case MMALLOC_TYPE_HEAPINFO: @@ -60,10 +55,8 @@ void mfree(struct mdesc *mdp, void *ptr) mdp -> heapstats.bytes_free += mdp -> heapinfo[block].busy_block.size * BLOCKSIZE; - if(MC_is_active()){ - if(mdp->heapinfo[block].busy_block.ignore > 0) - MC_remove_ignore_heap(ptr, mdp -> heapinfo[block].busy_block.busy_size); - } + if (MC_is_active() && mdp->heapinfo[block].busy_block.ignore > 0) + MC_unignore_heap(ptr, mdp->heapinfo[block].busy_block.busy_size); /* Find the free cluster previous to this one in the free list. Start searching at the last block referenced; this may benefit @@ -98,7 +91,6 @@ void mfree(struct mdesc *mdp, void *ptr) block = i; } else { - //fprintf(stderr,"Free block %d to %d (as a new chunck)\n",block,block+mdp->heapinfo[block].busy_block.size); /* Really link this block back into the free list. */ mdp->heapinfo[block].free_block.size = mdp->heapinfo[block].busy_block.size; mdp->heapinfo[block].free_block.next = mdp->heapinfo[i].free_block.next; @@ -131,7 +123,8 @@ void mfree(struct mdesc *mdp, void *ptr) } /* Now see if we can return stuff to the system. */ - /* blocks = mdp -> heapinfo[block].free.size; +#if 0 + blocks = mdp -> heapinfo[block].free.size; if (blocks >= FINAL_FREE_BLOCKS && block + blocks == mdp -> heaplimit && mdp -> morecore (mdp, 0) == ADDRESS (block + blocks)) { @@ -145,7 +138,8 @@ void mfree(struct mdesc *mdp, void *ptr) block = mdp -> heapinfo[block].free.prev; mdp -> heapstats.chunks_free--; mdp -> heapstats.bytes_free -= bytes; - } */ + } +#endif /* Set the next search to begin at this block. This is probably important to the trick where realloc returns the block to @@ -172,16 +166,13 @@ void mfree(struct mdesc *mdp, void *ptr) THROWF(system_error, 0, "Asked to free a fragment that is already free. I'm puzzled\n"); } - if(MC_is_active()){ - if(mdp->heapinfo[block].busy_frag.ignore[frag_nb] > 0) - MC_remove_ignore_heap(ptr, mdp->heapinfo[block].busy_frag.frag_size[frag_nb]); - } + if (MC_is_active() && mdp->heapinfo[block].busy_frag.ignore[frag_nb] > 0) + MC_unignore_heap(ptr, mdp->heapinfo[block].busy_frag.frag_size[frag_nb]); /* Set size used in the fragment to -1 */ mdp->heapinfo[block].busy_frag.frag_size[frag_nb] = -1; mdp->heapinfo[block].busy_frag.ignore[frag_nb] = 0; -// fprintf(stderr,"nfree:%zu capa:%d\n", mdp->heapinfo[block].busy_frag.nfree,(BLOCKSIZE >> type)); if (mdp->heapinfo[block].busy_frag.nfree == (BLOCKSIZE >> type) - 1) { /* If all fragments of this block are free, remove this block from its swag and free the whole block. */