1 /* -----------------------------------------------------------------------------
2 * $Id: BlockAlloc.c,v 1.5 1999/03/26 14:54:43 simonm Exp $
4 * (c) The GHC Team 1998-1999
6 * The block allocator and free list manager.
8 * This is the architecture independent part of the block allocator.
9 * It requires only the following support from the operating system:
13 * returns the address of an MBLOCK_SIZE region of memory, aligned on
14 * an MBLOCK_SIZE boundary. There is no requirement for successive
15 * calls to getMBlock to return strictly increasing addresses.
17 * ---------------------------------------------------------------------------*/
22 #include "BlockAlloc.h"
25 static void initMBlock(void *mblock);
26 static bdescr *allocMegaGroup(nat mblocks);
27 static void freeMegaGroup(bdescr *bd);
29 static bdescr *free_list;
31 /* -----------------------------------------------------------------------------
33 -------------------------------------------------------------------------- */
35 void initBlockAllocator(void)
40 /* -----------------------------------------------------------------------------
42 -------------------------------------------------------------------------- */
45 initGroup(nat n, bdescr *head)
52 head->free = head->start;
53 for (i=1, bd = head+1; i < n; i++, bd++) {
66 if (n > BLOCKS_PER_MBLOCK) {
67 return allocMegaGroup(BLOCKS_TO_MBLOCKS(n));
71 for (bd = free_list; bd != NULL; bd = bd->link) {
72 if (bd->blocks == n) { /* exactly the right size! */
74 /* no initialisation necessary - this is already a
75 * self-contained block group. */
78 if (bd->blocks > n) { /* block too big... */
79 bd->blocks -= n; /* take a chunk off the *end* */
81 initGroup(n, bd); /* initialise it */
87 mblock = getMBlock(); /* get a new megablock */
88 initMBlock(mblock); /* initialise the start fields */
89 bd = FIRST_BDESCR(mblock);
90 initGroup(n,bd); /* we know the group will fit */
91 if (n < BLOCKS_PER_MBLOCK) {
92 initGroup(BLOCKS_PER_MBLOCK-n, bd+n);
93 freeGroup(bd+n); /* add the rest on to the free list */
101 return allocGroup(1);
104 /* -----------------------------------------------------------------------------
105 Any request larger than BLOCKS_PER_MBLOCK needs a megablock group.
106 First, search the free list for enough contiguous megablocks to
107 fulfill the request - if we don't have enough, we need to
108 allocate some new ones.
110 A megablock group looks just like a normal block group, except that
111 the blocks field in the head will be larger than BLOCKS_PER_MBLOCK.
113 Note that any objects placed in this group must start in the first
114 megablock, since the other blocks don't have block descriptors.
115 -------------------------------------------------------------------------- */
118 allocMegaGroup(nat n)
121 bdescr *bd, *last, *grp_start, *grp_prev;
127 for (bd = free_list; bd != NULL; bd = bd->link) {
129 if (bd->blocks == BLOCKS_PER_MBLOCK) { /* whole megablock found */
131 if (grp_start == NULL) { /* is it the first one we've found? */
139 if (mbs_found == n) { /* found enough contig megablocks? */
144 else { /* only a partial megablock, start again */
151 /* found all the megablocks we need on the free list
153 if (mbs_found == n) {
154 /* remove the megablocks from the free list */
155 if (grp_prev == NULL) { /* bd now points to the last mblock */
156 free_list = bd->link;
158 grp_prev->link = bd->link;
162 /* the free list wasn't sufficient, allocate all new mblocks.
165 void *mblock = getMBlocks(n);
166 initMBlock(mblock); /* only need to init the 1st one */
167 grp_start = FIRST_BDESCR(mblock);
170 /* set up the megablock group */
171 initGroup(BLOCKS_PER_MBLOCK, grp_start);
172 grp_start->blocks = MBLOCK_GROUP_BLOCKS(n);
176 /* -----------------------------------------------------------------------------
178 -------------------------------------------------------------------------- */
180 /* coalesce the group p with p->link if possible.
182 * Returns p->link if no coalescing was done, otherwise returns a
183 * pointer to the newly enlarged group p.
186 static inline bdescr *
193 if (q != NULL && p->start + p->blocks * BLOCK_SIZE_W == q->start) {
195 p->blocks += q->blocks;
197 for (i = 0, bd = q; i < q->blocks; bd++, i++) {
211 /* are we dealing with a megablock group? */
212 if (p->blocks > BLOCKS_PER_MBLOCK) {
218 p->free = (void *)-1; /* indicates that this block is free */
221 /* fill the block group with garbage if sanity checking is on */
222 IF_DEBUG(sanity,memset(p->start, 0xaa, p->blocks * BLOCK_SIZE));
225 /* find correct place in free list to place new group */
227 for (bd = free_list; bd != NULL && bd->start < p->start;
232 /* now, last = previous group (or NULL) */
237 /* coalesce with previous group if possible */
238 p->link = last->link;
243 /* coalesce with next group if possible */
245 IF_DEBUG(sanity, checkFreeListSanity());
249 freeMegaGroup(bdescr *p)
253 n = p->blocks * BLOCK_SIZE / MBLOCK_SIZE + 1;
254 for (; n > 0; (W_)p += MBLOCK_SIZE, n--) {
255 initMBlock((void *)((W_)p & ~MBLOCK_MASK));
256 initGroup(BLOCKS_PER_MBLOCK, p);
262 freeChain(bdescr *bd)
273 initMBlock(void *mblock)
278 /* the first few Bdescr's in a block are unused, so we don't want to
279 * put them all on the free list.
281 block = FIRST_BLOCK(mblock);
282 bd = FIRST_BDESCR(mblock);
284 /* Initialise the start field of each block descriptor
286 for (; block <= LAST_BLOCK(mblock); bd += 1, (lnat)block += BLOCK_SIZE) {
291 /* -----------------------------------------------------------------------------
293 -------------------------------------------------------------------------- */
297 checkFreeListSanity(void)
301 for (bd = free_list; bd != NULL; bd = bd->link) {
302 IF_DEBUG(block_alloc,
303 fprintf(stderr,"group at 0x%x, length %d blocks\n",
304 (nat)bd->start, bd->blocks));
305 ASSERT(bd->blocks > 0);
306 if (bd->link != NULL) {
307 /* make sure we're fully coalesced */
308 ASSERT(bd->start + bd->blocks * BLOCK_SIZE_W != bd->link->start);
309 ASSERT(bd->start < bd->link->start);
318 lnat total_blocks = 0;
320 for (bd = free_list; bd != NULL; bd = bd->link) {
321 total_blocks += bd->blocks;