1 /* Change the size of a block allocated by `mmalloc'. */
3 /* Copyright (c) 2010-2014. The SimGrid Team.
4 * All rights reserved. */
6 /* This program is free software; you can redistribute it and/or modify it
7 * under the terms of the license (GNU LGPL) which comes with this package. */
9 /* Copyright 1990, 1991 Free Software Foundation
10 Written May 1989 by Mike Haertel. */
12 #include <string.h> /* Prototypes for memcpy, memmove, memset, etc */
13 #include <stdlib.h> /* abort */
15 #include "mmprivate.h"
17 /* Resize the given region to the new size, returning a pointer
18 to the (possibly moved) region. This is optimized for speed;
19 some benchmarks seem to indicate that greater compactness is
20 achieved by unconditionally allocating and copying to a
21 new region. This module has incestuous knowledge of the
22 internals of both mfree and mmalloc. */
24 void *mrealloc(xbt_mheap_t mdp, void *ptr, size_t size)
28 size_t block, blocks, oldlimit;
30 /* Only keep real realloc, and reroute hidden malloc and free to the relevant functions */
33 return mmalloc(mdp, 0);
34 } else if (ptr == NULL) {
35 return mmalloc(mdp, size);
38 //printf("(%s)realloc %p to %d...",xbt_thread_self_name(),ptr,(int)size);
40 if ((char *) ptr < (char *) mdp->heapbase || BLOCK(ptr) > mdp->heapsize) {
42 ("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");
43 result = mmalloc(mdp, size);
48 size_t requested_size = size; // The amount of memory requested by user, for real
50 /* Work even if the user was stupid enough to ask a ridicullously small block (even 0-length),
51 * ie return a valid block that can be realloced and freed.
52 * glibc malloc does not use this trick but return a constant pointer, but we need to enlist the free fragments later on.
54 if (size < SMALLEST_POSSIBLE_MALLOC)
55 size = SMALLEST_POSSIBLE_MALLOC;
59 type = mdp->heapinfo[block].type;
63 fprintf(stderr, "Asked realloc a fragment coming from a *free* block. I'm puzzled.\n");
68 /* Maybe reallocate a large block to a small fragment. */
70 if (size <= BLOCKSIZE / 2) { // Full block -> Fragment; no need to optimize for time
72 result = mmalloc(mdp, size);
73 if (result != NULL) { // useless (mmalloc never returns NULL), but harmless
74 memcpy(result, ptr, requested_size);
80 /* Full blocks -> Full blocks; see if we can hold it in place. */
81 blocks = BLOCKIFY(size);
82 if (blocks < mdp->heapinfo[block].busy_block.size) {
84 /* The new size is smaller; return excess memory to the free list. */
85 //printf("(%s) return excess memory...",xbt_thread_self_name());
86 for (it= block+blocks; it< mdp->heapinfo[block].busy_block.size ; it++){
87 mdp->heapinfo[it].type = 0; // FIXME that should be useless, type should already be 0 here
88 mdp->heapinfo[it].busy_block.ignore = 0;
91 mdp->heapinfo[block + blocks].busy_block.size
92 = mdp->heapinfo[block].busy_block.size - blocks;
93 mfree(mdp, ADDRESS(block + blocks));
95 mdp->heapinfo[block].busy_block.size = blocks;
96 mdp->heapinfo[block].busy_block.busy_size = requested_size;
97 mdp->heapinfo[block].busy_block.ignore = 0;
100 } else if (blocks == mdp->heapinfo[block].busy_block.size) {
102 /* No block size change necessary; only update the requested size */
104 mdp->heapinfo[block].busy_block.busy_size = requested_size;
105 mdp->heapinfo[block].busy_block.ignore = 0;
108 /* Won't fit, so allocate a new region that will.
109 Free the old region first in case there is sufficient adjacent free space to grow without moving.
110 This trick mandates using a specific version of mmalloc that does not memset the memory to 0 after
111 action for obvious reasons. */
112 blocks = mdp->heapinfo[block].busy_block.size;
113 /* Prevent free from actually returning memory to the system. */
114 oldlimit = mdp->heaplimit;
117 mdp->heaplimit = oldlimit;
119 result = mmalloc_no_memset(mdp, requested_size);
120 //fprintf(stderr,"remalloc(%zu)~>%p\n",requested_size,result);
123 memmove(result, ptr, blocks * BLOCKSIZE);
124 /* FIXME: we should memset the end of the recently area */
128 default: /* Fragment -> ??; type=logarithm to base two of the fragment size. */
130 if (size > (size_t) (1 << (type - 1)) && size <= (size_t) (1 << type)) {
131 /* The new size is the same kind of fragment. */
132 //printf("(%s) new size is same kind of fragment...",xbt_thread_self_name());
135 int frag_nb = RESIDUAL(result, BLOCKSIZE) >> type;
136 mdp->heapinfo[block].busy_frag.frag_size[frag_nb] = requested_size;
137 mdp->heapinfo[block].busy_frag.ignore[frag_nb] = 0;
139 } else { /* fragment -> Either other fragment, or block */
140 /* The new size is different; allocate a new space,
141 and copy the lesser of the new size and the old. */
142 //printf("(%s) new size is different...",xbt_thread_self_name());
144 result = mmalloc(mdp, requested_size);
146 memcpy(result, ptr, MIN(requested_size, (size_t) 1 << type));
151 //printf("(%s) Done reallocing: %p\n",xbt_thread_self_name(),result);fflush(stdout);