X-Git-Url: http://info.iut-bm.univ-fcomte.fr/pub/gitweb/simgrid.git/blobdiff_plain/f23b0fb864cb60978c1fcfd48d50f62dd054fe31..4e62e76d104a17f0c9aaf9135ac605e9c8c87141:/src/xbt/mmalloc/mrealloc.c diff --git a/src/xbt/mmalloc/mrealloc.c b/src/xbt/mmalloc/mrealloc.c index 753eda8cd5..20a0290647 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 (c) 2010-2018. The SimGrid Team. +/* Copyright (c) 2010-2019. The SimGrid Team. * All rights reserved. */ /* This program is free software; you can redistribute it and/or modify it @@ -14,6 +14,10 @@ #include "mmprivate.h" +#ifndef MIN +#define MIN(a, b) ((a) < (b) ? (a) : (b)) +#endif + /* Resize the given region to the new size, returning a pointer to the (possibly moved) region. This is optimized for * speed; some benchmarks seem to indicate that greater compactness is achieved by unconditionally allocating and * copying to a new region. This module has incestuous knowledge of the internals of both mfree and mmalloc. */ @@ -31,8 +35,6 @@ void *mrealloc(xbt_mheap_t mdp, void *ptr, size_t size) return mmalloc(mdp, size); } - //printf("(%s)realloc %p to %d...",xbt_thread_self_name(),ptr,(int)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"); @@ -41,7 +43,7 @@ void *mrealloc(xbt_mheap_t mdp, void *ptr, size_t size) size_t requested_size = size; // The amount of memory requested by user, for real - /* Work even if the user was stupid enough to ask a ridicullously small block (even 0-length), + /* Work even if the user was stupid enough to ask a ridiculously small block (even 0-length), * ie return a valid block that can be realloced and freed. * glibc malloc does not use this trick but return a constant pointer, but we need to enlist the free fragments later on. */ @@ -79,7 +81,6 @@ void *mrealloc(xbt_mheap_t mdp, void *ptr, size_t size) if (blocks < mdp->heapinfo[block].busy_block.size) { int it; /* 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 = MMALLOC_TYPE_UNFRAGMENTED; // FIXME that should be useless, type should already be 0 here mdp->heapinfo[it].busy_block.ignore = 0; @@ -115,7 +116,6 @@ void *mrealloc(xbt_mheap_t mdp, void *ptr, size_t size) mdp->heaplimit = oldlimit; result = mmalloc_no_memset(mdp, requested_size); - //fprintf(stderr,"remalloc(%zu)~>%p\n",requested_size,result); if (ptr != result) memmove(result, ptr, blocks * BLOCKSIZE); @@ -132,7 +132,6 @@ void *mrealloc(xbt_mheap_t mdp, void *ptr, size_t size) if (size > (size_t) (1 << (type - 1)) && size <= (size_t) (1 << type)) { /* The new size is the same kind of fragment. */ - //printf("(%s) new size is same kind of fragment...",xbt_thread_self_name()); result = ptr; int frag_nb = RESIDUAL(result, BLOCKSIZE) >> type; @@ -142,7 +141,6 @@ void *mrealloc(xbt_mheap_t mdp, void *ptr, size_t size) } else { /* fragment -> Either other fragment, or block */ /* The new size is different; allocate a new space, and copy the lesser of the new size and the old. */ - //printf("(%s) new size is different...",xbt_thread_self_name()); result = mmalloc(mdp, requested_size); @@ -151,6 +149,5 @@ void *mrealloc(xbt_mheap_t mdp, void *ptr, size_t size) } break; } - //printf("(%s) Done reallocing: %p\n",xbt_thread_self_name(),result);fflush(stdout); return (result); }