1 /* Memory allocator `malloc'.
2 Copyright 1990, 1991, 1992 Free Software Foundation
4 Written May 1989 by Mike Haertel.
5 Heavily modified Mar 1992 by Fred Fish for mmap'd version. */
7 /* Copyright (c) 2010. The SimGrid Team.
8 * All rights reserved. */
10 /* This program is free software; you can redistribute it and/or modify it
11 * under the terms of the license (GNU LGPL) which comes with this package. */
13 #include <string.h> /* Prototypes for memcpy, memmove, memset, etc */
15 #include "mmprivate.h"
17 /* Prototypes for local functions */
19 static int initialize(struct mdesc *mdp);
20 static void *morecore(struct mdesc *mdp, size_t size);
21 static void *align(struct mdesc *mdp, size_t size);
23 /* Aligned allocation. */
25 static void *align(struct mdesc *mdp, size_t size)
28 unsigned long int adj;
30 result = mmorecore(mdp, size);
31 adj = RESIDUAL(result, BLOCKSIZE);
33 adj = BLOCKSIZE - adj;
35 result = (char *) result + adj;
40 /* Set everything up and remember that we have. */
42 static int initialize(struct mdesc *mdp)
44 mdp->heapsize = HEAP / BLOCKSIZE;
45 mdp->heapinfo = (malloc_info *)
46 align(mdp, mdp->heapsize * sizeof(malloc_info));
47 if (mdp->heapinfo == NULL) {
50 memset((void *) mdp->heapinfo, 0, mdp->heapsize * sizeof(malloc_info));
51 mdp->heapinfo[0].free.size = 0;
52 mdp->heapinfo[0].free.next = mdp->heapinfo[0].free.prev = 0;
54 mdp->heapbase = (void *) mdp->heapinfo;
55 mdp->flags |= MMALLOC_INITIALIZED;
59 /* Get neatly aligned memory, initializing or
60 growing the heap info table as necessary. */
62 static void *morecore(struct mdesc *mdp, size_t size)
65 malloc_info *newinfo, *oldinfo;
68 result = align(mdp, size);
73 /* Check if we need to grow the info table. */
74 if ((size_t) BLOCK((char *) result + size) > mdp->heapsize) {
75 newsize = mdp->heapsize;
76 while ((size_t) BLOCK((char *) result + size) > newsize) {
79 newinfo = (malloc_info *) align(mdp, newsize * sizeof(malloc_info));
80 if (newinfo == NULL) {
81 mmorecore(mdp, -size);
84 memset((void *) newinfo, 0, newsize * sizeof(malloc_info));
85 memcpy((void *) newinfo, (void *) mdp->heapinfo,
86 mdp->heapsize * sizeof(malloc_info));
87 oldinfo = mdp->heapinfo;
88 newinfo[BLOCK(oldinfo)].busy.type = 0;
89 newinfo[BLOCK(oldinfo)].busy.info.block.size
90 = BLOCKIFY(mdp->heapsize * sizeof(malloc_info));
91 newinfo[BLOCK(oldinfo)].busy.info.block.busy_size = size;
92 mdp->heapinfo = newinfo;
93 __mmalloc_free(mdp, (void *) oldinfo);
94 mdp->heapsize = newsize;
97 mdp->heaplimit = BLOCK((char *) result + size);
101 /* Allocate memory from the heap. */
103 void *mmalloc(void *md, size_t size)
107 size_t block, blocks, lastblocks, start;
112 /* Work even if the user was stupid enough to ask a 0-byte block, ie return a valid block that can be realloced or freed
113 * glibc malloc does not use this trick but return a constant pointer, but my hack is quicker to implement ;)
119 // printf("(%s) Mallocing %d bytes on %p (default: %p)...",xbt_thread_self_name(),size,mdp,__mmalloc_default_mdp);fflush(stdout);
121 if (!(mdp->flags & MMALLOC_INITIALIZED)) {
122 if (!initialize(mdp)) {
127 if (size < sizeof(struct list)) {
128 size = sizeof(struct list);
131 /* Determine the allocation policy based on the request size. */
132 if (size <= BLOCKSIZE / 2) {
133 /* Small allocation to receive a fragment of a block.
134 Determine the logarithm to base two of the fragment size. */
137 while ((size /= 2) != 0) {
141 /* Look in the fragment lists for a
142 free fragment of the desired size. */
143 next = mdp->fraghead[log].next;
145 /* There are free fragments of this size.
146 Pop a fragment out of the fragment list and return it.
147 Update the block's nfree and first counters. */
148 result = (void *) next;
149 next->prev->next = next->next;
150 if (next->next != NULL) {
151 next->next->prev = next->prev;
153 block = BLOCK(result);
154 if (--mdp->heapinfo[block].busy.info.frag.nfree != 0) {
155 mdp->heapinfo[block].busy.info.frag.first =
156 RESIDUAL(next->next, BLOCKSIZE) >> log;
160 /* No free fragments of the desired size, so get a new block
161 and break it into fragments, returning the first. */
162 //printf("(%s) No free fragment...",xbt_thread_self_name());
163 result = mmalloc(md, BLOCKSIZE);
164 //printf("(%s) Fragment: %p...",xbt_thread_self_name(),result);
165 if (result == NULL) {
169 /* Link all fragments but the first into the free list. */
170 for (i = 1; i < (size_t) (BLOCKSIZE >> log); ++i) {
171 next = (struct list *) ((char *) result + (i << log));
172 next->next = mdp->fraghead[log].next;
173 next->prev = &mdp->fraghead[log];
174 next->prev->next = next;
175 if (next->next != NULL) {
176 next->next->prev = next;
180 /* Initialize the nfree and first counters for this block. */
181 block = BLOCK(result);
182 mdp->heapinfo[block].busy.type = log;
183 mdp->heapinfo[block].busy.info.frag.nfree = i - 1;
184 mdp->heapinfo[block].busy.info.frag.first = i - 1;
187 /* Large allocation to receive one or more blocks.
188 Search the free list in a circle starting at the last place visited.
189 If we loop completely around without finding a large enough
190 space we will have to get more memory from the system. */
191 blocks = BLOCKIFY(size);
192 start = block = MALLOC_SEARCH_START;
193 while (mdp->heapinfo[block].free.size < blocks) {
194 block = mdp->heapinfo[block].free.next;
195 if (block == start) {
196 /* Need to get more from the system. Check to see if
197 the new core will be contiguous with the final free
198 block; if so we don't need to get as much. */
199 block = mdp->heapinfo[0].free.prev;
200 lastblocks = mdp->heapinfo[block].free.size;
201 if (mdp->heaplimit != 0 &&
202 block + lastblocks == mdp->heaplimit &&
203 mmorecore(mdp, 0) == ADDRESS(block + lastblocks) &&
204 (morecore(mdp, (blocks - lastblocks) * BLOCKSIZE)) != NULL) {
205 /* Which block we are extending (the `final free
206 block' referred to above) might have changed, if
207 it got combined with a freed info table. */
208 block = mdp->heapinfo[0].free.prev;
210 mdp->heapinfo[block].free.size += (blocks - lastblocks);
213 result = morecore(mdp, blocks * BLOCKSIZE);
214 if (result == NULL) {
217 block = BLOCK(result);
218 mdp->heapinfo[block].busy.type = 0;
219 mdp->heapinfo[block].busy.info.block.size = blocks;
220 mdp->heapinfo[block].busy.info.block.busy_size = size;
225 /* At this point we have found a suitable free list entry.
226 Figure out how to remove what we need from the list. */
227 result = ADDRESS(block);
228 if (mdp->heapinfo[block].free.size > blocks) {
229 /* The block we found has a bit left over,
230 so relink the tail end back into the free list. */
231 mdp->heapinfo[block + blocks].free.size
232 = mdp->heapinfo[block].free.size - blocks;
233 mdp->heapinfo[block + blocks].free.next
234 = mdp->heapinfo[block].free.next;
235 mdp->heapinfo[block + blocks].free.prev
236 = mdp->heapinfo[block].free.prev;
237 mdp->heapinfo[mdp->heapinfo[block].free.prev].free.next
238 = mdp->heapinfo[mdp->heapinfo[block].free.next].free.prev
239 = mdp->heapindex = block + blocks;
241 /* The block exactly matches our requirements,
242 so just remove it from the list. */
243 mdp->heapinfo[mdp->heapinfo[block].free.next].free.prev
244 = mdp->heapinfo[block].free.prev;
245 mdp->heapinfo[mdp->heapinfo[block].free.prev].free.next
246 = mdp->heapindex = mdp->heapinfo[block].free.next;
249 mdp->heapinfo[block].busy.type = 0;
250 mdp->heapinfo[block].busy.info.block.size = blocks;
251 mdp->heapinfo[block].busy.info.block.busy_size = size;
253 //printf("(%s) Done mallocing. Result is %p\n",xbt_thread_self_name(),result);fflush(stdout);