projects
/
ghc-hetmet.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
[project @ 2003-06-27 18:28:31 by sof]
[ghc-hetmet.git]
/
ghc
/
rts
/
BlockAlloc.c
diff --git
a/ghc/rts/BlockAlloc.c
b/ghc/rts/BlockAlloc.c
index
e0ded8e
..
8e09d0c
100644
(file)
--- a/
ghc/rts/BlockAlloc.c
+++ b/
ghc/rts/BlockAlloc.c
@@
-1,6
+1,8
@@
/* -----------------------------------------------------------------------------
/* -----------------------------------------------------------------------------
- * $Id: BlockAlloc.c,v 1.2 1998/12/02 13:28:12 simonm Exp $
+ * $Id: BlockAlloc.c,v 1.16 2003/02/18 05:47:53 sof Exp $
*
*
+ * (c) The GHC Team 1998-2000
+ *
* The block allocator and free list manager.
*
* This is the architecture independent part of the block allocator.
* The block allocator and free list manager.
*
* This is the architecture independent part of the block allocator.
@@
-14,17
+16,20
@@
*
* ---------------------------------------------------------------------------*/
*
* ---------------------------------------------------------------------------*/
+#include "PosixSource.h"
#include "Rts.h"
#include "RtsFlags.h"
#include "RtsUtils.h"
#include "BlockAlloc.h"
#include "MBlock.h"
#include "Rts.h"
#include "RtsFlags.h"
#include "RtsUtils.h"
#include "BlockAlloc.h"
#include "MBlock.h"
+#include <string.h>
+
static void initMBlock(void *mblock);
static bdescr *allocMegaGroup(nat mblocks);
static void freeMegaGroup(bdescr *bd);
static void initMBlock(void *mblock);
static bdescr *allocMegaGroup(nat mblocks);
static void freeMegaGroup(bdescr *bd);
-static bdescr *free_list;
+static bdescr *free_list = NULL;
/* -----------------------------------------------------------------------------
Initialisation
/* -----------------------------------------------------------------------------
Initialisation
@@
-32,7
+37,7
@@
static bdescr *free_list;
void initBlockAllocator(void)
{
void initBlockAllocator(void)
{
- free_list = NULL;
+ // The free list starts off NULL
}
/* -----------------------------------------------------------------------------
}
/* -----------------------------------------------------------------------------
@@
-50,6
+55,7
@@
initGroup(nat n, bdescr *head)
head->free = head->start;
for (i=1, bd = head+1; i < n; i++, bd++) {
bd->free = 0;
head->free = head->start;
for (i=1, bd = head+1; i < n; i++, bd++) {
bd->free = 0;
+ bd->blocks = 0;
bd->link = head;
}
}
bd->link = head;
}
}
@@
-61,6
+67,8
@@
allocGroup(nat n)
void *mblock;
bdescr *bd, **last;
void *mblock;
bdescr *bd, **last;
+ ASSERT(n != 0);
+
if (n > BLOCKS_PER_MBLOCK) {
return allocMegaGroup(BLOCKS_TO_MBLOCKS(n));
}
if (n > BLOCKS_PER_MBLOCK) {
return allocMegaGroup(BLOCKS_TO_MBLOCKS(n));
}
@@
-71,6
+79,9
@@
allocGroup(nat n)
*last = bd->link;
/* no initialisation necessary - this is already a
* self-contained block group. */
*last = bd->link;
/* no initialisation necessary - this is already a
* self-contained block group. */
+#ifdef DEBUG
+ bd->free = bd->start; /* block isn't free now */
+#endif
return bd;
}
if (bd->blocks > n) { /* block too big... */
return bd;
}
if (bd->blocks > n) { /* block too big... */
@@
-86,8
+97,10
@@
allocGroup(nat n)
initMBlock(mblock); /* initialise the start fields */
bd = FIRST_BDESCR(mblock);
initGroup(n,bd); /* we know the group will fit */
initMBlock(mblock); /* initialise the start fields */
bd = FIRST_BDESCR(mblock);
initGroup(n,bd); /* we know the group will fit */
- initGroup(BLOCKS_PER_MBLOCK-n, bd+n);
- freeGroup(bd+n); /* add the rest on to the free list */
+ if (n < BLOCKS_PER_MBLOCK) {
+ initGroup(BLOCKS_PER_MBLOCK-n, bd+n);
+ freeGroup(bd+n); /* add the rest on to the free list */
+ }
return bd;
}
return bd;
}
@@
-124,7
+137,9
@@
allocMegaGroup(nat n)
if (bd->blocks == BLOCKS_PER_MBLOCK) { /* whole megablock found */
if (bd->blocks == BLOCKS_PER_MBLOCK) { /* whole megablock found */
- if (grp_start == NULL) { /* is it the first one we've found? */
+ /* is it the first one we've found or a non-contiguous megablock? */
+ if (grp_start == NULL ||
+ bd->start != last->start + MBLOCK_SIZE/sizeof(W_)) {
grp_start = bd;
grp_prev = last;
mbs_found = 1;
grp_start = bd;
grp_prev = last;
mbs_found = 1;
@@
-183,15
+198,17
@@
static inline bdescr *
coalesce(bdescr *p)
{
bdescr *bd, *q;
coalesce(bdescr *p)
{
bdescr *bd, *q;
- nat i;
+ nat i, blocks;
q = p->link;
if (q != NULL && p->start + p->blocks * BLOCK_SIZE_W == q->start) {
/* can coalesce */
p->blocks += q->blocks;
p->link = q->link;
q = p->link;
if (q != NULL && p->start + p->blocks * BLOCK_SIZE_W == q->start) {
/* can coalesce */
p->blocks += q->blocks;
p->link = q->link;
- for (i = 0, bd = q; i < q->blocks; bd++, i++) {
+ blocks = q->blocks;
+ for (i = 0, bd = q; i < blocks; bd++, i++) {
bd->free = 0;
bd->free = 0;
+ bd->blocks = 0;
bd->link = p;
}
return p;
bd->link = p;
}
return p;
@@
-210,6
+227,14
@@
freeGroup(bdescr *p)
return;
}
return;
}
+#ifdef DEBUG
+ p->free = (void *)-1; /* indicates that this block is free */
+ p->step = NULL;
+ p->gen_no = 0;
+ /* fill the block group with garbage if sanity checking is on */
+ IF_DEBUG(sanity,memset(p->start, 0xaa, p->blocks * BLOCK_SIZE));
+#endif
+
/* find correct place in free list to place new group */
last = NULL;
for (bd = free_list; bd != NULL && bd->start < p->start;
/* find correct place in free list to place new group */
last = NULL;
for (bd = free_list; bd != NULL && bd->start < p->start;
@@
-240,7
+265,7
@@
freeMegaGroup(bdescr *p)
n = p->blocks * BLOCK_SIZE / MBLOCK_SIZE + 1;
for (; n > 0; (W_)p += MBLOCK_SIZE, n--) {
n = p->blocks * BLOCK_SIZE / MBLOCK_SIZE + 1;
for (; n > 0; (W_)p += MBLOCK_SIZE, n--) {
- initMBlock((void *)((W_)p & ~MBLOCK_MASK));
+ initMBlock(MBLOCK_ROUND_DOWN(p));
initGroup(BLOCKS_PER_MBLOCK, p);
freeGroup(p);
}
initGroup(BLOCKS_PER_MBLOCK, p);
freeGroup(p);
}
@@
-252,9
+277,6
@@
freeChain(bdescr *bd)
bdescr *next_bd;
while (bd != NULL) {
next_bd = bd->link;
bdescr *next_bd;
while (bd != NULL) {
next_bd = bd->link;
-#ifdef DEBUG
- bd->free = (void *)-1; /* indicates that this block is free */
-#endif
freeGroup(bd);
bd = next_bd;
}
freeGroup(bd);
bd = next_bd;
}
@@
-284,6
+306,18
@@
initMBlock(void *mblock)
-------------------------------------------------------------------------- */
#ifdef DEBUG
-------------------------------------------------------------------------- */
#ifdef DEBUG
+static void
+checkWellFormedGroup( bdescr *bd )
+{
+ nat i;
+
+ for (i = 1; i < bd->blocks; i++) {
+ ASSERT(bd[i].blocks == 0);
+ ASSERT(bd[i].free == 0);
+ ASSERT(bd[i].link == bd);
+ }
+}
+
void
checkFreeListSanity(void)
{
void
checkFreeListSanity(void)
{
@@
-294,6
+328,7
@@
checkFreeListSanity(void)
fprintf(stderr,"group at 0x%x, length %d blocks\n",
(nat)bd->start, bd->blocks));
ASSERT(bd->blocks > 0);
fprintf(stderr,"group at 0x%x, length %d blocks\n",
(nat)bd->start, bd->blocks));
ASSERT(bd->blocks > 0);
+ checkWellFormedGroup(bd);
if (bd->link != NULL) {
/* make sure we're fully coalesced */
ASSERT(bd->start + bd->blocks * BLOCK_SIZE_W != bd->link->start);
if (bd->link != NULL) {
/* make sure we're fully coalesced */
ASSERT(bd->start + bd->blocks * BLOCK_SIZE_W != bd->link->start);
@@
-301,4
+336,16
@@
checkFreeListSanity(void)
}
}
}
}
}
}
+
+nat /* BLOCKS */
+countFreeList(void)
+{
+ bdescr *bd;
+ lnat total_blocks = 0;
+
+ for (bd = free_list; bd != NULL; bd = bd->link) {
+ total_blocks += bd->blocks;
+ }
+ return total_blocks;
+}
#endif
#endif