X-Git-Url: http://info.iut-bm.univ-fcomte.fr/pub/gitweb/simgrid.git/blobdiff_plain/e2b455e834089e4512c6311872052ba441b487ec..d37695654af494c87f28017306376b8c229aaec0:/src/xbt/mmalloc/mfree.c diff --git a/src/xbt/mmalloc/mfree.c b/src/xbt/mmalloc/mfree.c index 38b5fc02d9..e08aba34f4 100644 --- a/src/xbt/mmalloc/mfree.c +++ b/src/xbt/mmalloc/mfree.c @@ -1,6 +1,6 @@ /* Free a block of memory allocated by `mmalloc'. */ -/* Copyright (c) 2010-2017. 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. */ @@ -24,9 +24,6 @@ void mfree(struct mdesc *mdp, void *ptr) size_t i; int it; - mmalloc_paranoia(mdp); -// fprintf(stderr,"free(%p)\n",ptr); - if (ptr == NULL) return; @@ -59,7 +56,7 @@ void mfree(struct mdesc *mdp, void *ptr) mdp -> heapinfo[block].busy_block.size * BLOCKSIZE; if (MC_is_active() && mdp->heapinfo[block].busy_block.ignore > 0) - MC_remove_ignore_heap(ptr, mdp->heapinfo[block].busy_block.busy_size); + 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 @@ -94,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; @@ -127,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)) { @@ -141,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 @@ -169,13 +167,12 @@ void mfree(struct mdesc *mdp, void *ptr) } if (MC_is_active() && mdp->heapinfo[block].busy_frag.ignore[frag_nb] > 0) - MC_remove_ignore_heap(ptr, mdp->heapinfo[block].busy_frag.frag_size[frag_nb]); + 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. */