/* Only keep real realloc and hidden malloc and free to the relevant functions */
if (size == 0) {
+ fprintf(stderr,"free from realloc...");
mfree(mdp, ptr);
+ fprintf(stderr,"done\n");
return mmalloc(mdp, 0);
} else if (ptr == NULL) {
return mmalloc(mdp, size);
switch (type) {
case 0:
/* Maybe reallocate a large block to a small fragment. */
- if (size <= BLOCKSIZE / 2) {
- //printf("(%s) alloc large block...",xbt_thread_self_name());
+
+ if (size <= BLOCKSIZE / 2) { // Full block -> Fragment; no need to optimize for time
+
result = mmalloc(mdp, size);
- if (result != NULL) {
+ if (result != NULL) { // useless (mmalloc never returns NULL), but harmless
memcpy(result, ptr, size);
mfree(mdp, ptr);
return (result);
see if we can hold it in place. */
blocks = BLOCKIFY(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());
- mdp->heapinfo[block + blocks].type = 0;
+ for (it= block+blocks; it< mdp->heapinfo[block].busy_block.size ; it++)
+ mdp->heapinfo[it].type = 0;
mdp->heapinfo[block + blocks].busy_block.size
= mdp->heapinfo[block].busy_block.size - blocks;
mdp->heapinfo[block].busy_block.size = blocks;
mdp->heapinfo[block].busy_block.busy_size = size;
+
mfree(mdp, ADDRESS(block + blocks));
result = ptr;
} else if (blocks == mdp->heapinfo[block].busy_block.size) {