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 to the (possibly moved) region. This is optimized for
18 * speed; some benchmarks seem to indicate that greater compactness is achieved by unconditionally allocating and
19 * copying to a new region. This module has incestuous knowledge of the internals of both mfree and mmalloc. */
21 void *mrealloc(xbt_mheap_t mdp, void *ptr, size_t size)
26 /* Only keep real realloc, and reroute hidden malloc and free to the relevant functions */
29 return mmalloc(mdp, 0);
30 } else if (ptr == NULL) {
31 return mmalloc(mdp, size);
34 //printf("(%s)realloc %p to %d...",xbt_thread_self_name(),ptr,(int)size);
36 if ((char *) ptr < (char *) mdp->heapbase || BLOCK(ptr) > mdp->heapsize) {
37 printf("FIXME. Ouch, this pointer is not mine, refusing to proceed (another solution would be to malloc "
38 "it instead of reallocing it, see source code)\n");
39 result = mmalloc(mdp, size);
44 size_t requested_size = size; // The amount of memory requested by user, for real
46 /* Work even if the user was stupid enough to ask a ridicullously small block (even 0-length),
47 * ie return a valid block that can be realloced and freed.
48 * glibc malloc does not use this trick but return a constant pointer, but we need to enlist the free fragments later on.
50 if (size < SMALLEST_POSSIBLE_MALLOC)
51 size = SMALLEST_POSSIBLE_MALLOC;
53 size_t block = BLOCK(ptr);
55 int type = mdp->heapinfo[block].type;
58 case MMALLOC_TYPE_HEAPINFO:
59 fprintf(stderr, "Asked realloc a fragment coming from a heapinfo block. I'm confused.\n");
63 case MMALLOC_TYPE_FREE:
64 fprintf(stderr, "Asked realloc a fragment coming from a *free* block. I'm puzzled.\n");
68 case MMALLOC_TYPE_UNFRAGMENTED:
69 /* Maybe reallocate a large block to a small fragment. */
71 if (size <= BLOCKSIZE / 2) { // Full block -> Fragment; no need to optimize for time
73 result = mmalloc(mdp, size);
74 if (result != NULL) { // useless (mmalloc never returns NULL), but harmless
75 memcpy(result, ptr, requested_size);
81 /* Full blocks -> Full blocks; see if we can hold it in place. */
82 blocks = BLOCKIFY(size);
83 if (blocks < mdp->heapinfo[block].busy_block.size) {
85 /* The new size is smaller; return excess memory to the free list. */
86 //printf("(%s) return excess memory...",xbt_thread_self_name());
87 for (it= block+blocks; it< mdp->heapinfo[block].busy_block.size ; it++){
88 mdp->heapinfo[it].type = MMALLOC_TYPE_UNFRAGMENTED; // FIXME that should be useless, type should already be 0 here
89 mdp->heapinfo[it].busy_block.ignore = 0;
90 mdp->heapinfo[it].busy_block.size = 0;
91 mdp->heapinfo[it].busy_block.busy_size = 0;
94 mdp->heapinfo[block + blocks].busy_block.size = mdp->heapinfo[block].busy_block.size - blocks;
95 mfree(mdp, ADDRESS(block + blocks));
97 mdp->heapinfo[block].busy_block.size = blocks;
98 mdp->heapinfo[block].busy_block.busy_size = requested_size;
99 mdp->heapinfo[block].busy_block.ignore = 0;
102 } else if (blocks == mdp->heapinfo[block].busy_block.size) {
104 /* No block size change necessary; only update the requested size */
106 mdp->heapinfo[block].busy_block.busy_size = requested_size;
107 mdp->heapinfo[block].busy_block.ignore = 0;
110 /* Won't fit, so allocate a new region that will.
111 Free the old region first in case there is sufficient adjacent free space to grow without moving.
112 This trick mandates using a specific version of mmalloc that does not memset the memory to 0 after
113 action for obvious reasons. */
114 blocks = mdp->heapinfo[block].busy_block.size;
115 /* Prevent free from actually returning memory to the system. */
116 size_t oldlimit = mdp->heaplimit;
119 mdp->heaplimit = oldlimit;
121 result = mmalloc_no_memset(mdp, requested_size);
122 //fprintf(stderr,"remalloc(%zu)~>%p\n",requested_size,result);
125 memmove(result, ptr, blocks * BLOCKSIZE);
126 /* FIXME: we should memset the end of the recently area */
130 default: /* Fragment -> ??; type=logarithm to base two of the fragment size. */
133 fprintf(stderr, "Unkown mmalloc block type.\n");
137 if (size > (size_t) (1 << (type - 1)) && size <= (size_t) (1 << type)) {
138 /* The new size is the same kind of fragment. */
139 //printf("(%s) new size is same kind of fragment...",xbt_thread_self_name());
142 int frag_nb = RESIDUAL(result, BLOCKSIZE) >> type;
143 mdp->heapinfo[block].busy_frag.frag_size[frag_nb] = requested_size;
144 mdp->heapinfo[block].busy_frag.ignore[frag_nb] = 0;
146 } else { /* fragment -> Either other fragment, or block */
147 /* The new size is different; allocate a new space,
148 and copy the lesser of the new size and the old. */
149 //printf("(%s) new size is different...",xbt_thread_self_name());
151 result = mmalloc(mdp, requested_size);
153 memcpy(result, ptr, MIN(requested_size, (size_t) 1 << type));
158 //printf("(%s) Done reallocing: %p\n",xbt_thread_self_name(),result);fflush(stdout);