1 /* -----------------------------------------------------------------------------
3 * (c) The GHC Team 1998-2008
5 * MegaBlock Allocator Interface. This file contains all the dirty
6 * architecture-dependent hackery required to get a chunk of aligned
7 * memory from the operating system.
9 * ---------------------------------------------------------------------------*/
11 #include "PosixSource.h"
15 #include "BlockAlloc.h"
21 lnat peak_mblocks_allocated = 0;
22 lnat mblocks_allocated = 0;
25 /* -----------------------------------------------------------------------------
26 The MBlock Map: provides our implementation of HEAP_ALLOCED()
27 -------------------------------------------------------------------------- */
29 #if SIZEOF_VOID_P == 4
30 StgWord8 mblock_map[MBLOCK_MAP_SIZE]; // initially all zeros
33 setHeapAlloced(void *p, StgWord8 i)
35 mblock_map[MBLOCK_MAP_ENTRY(p)] = i;
38 #elif SIZEOF_VOID_P == 8
40 MBlockMap **mblock_maps = NULL;
42 nat mblock_map_count = 0;
44 MbcCacheLine mblock_cache[MBC_ENTRIES];
47 findMBlockMap(void *p)
50 StgWord32 hi = (StgWord32) (((StgWord)p) >> 32);
51 for( i = 0; i < mblock_map_count; i++ )
53 if(mblock_maps[i]->addrHigh32 == hi)
55 return mblock_maps[i];
61 StgBool HEAP_ALLOCED_miss(StgWord mblock, void *p)
67 entry_no = mblock & (MBC_ENTRIES-1);
69 map = findMBlockMap(p);
73 value = map->lines[MBLOCK_MAP_LINE(p)];
74 mblock_cache[entry_no] = (mblock<<1) | value;
79 mblock_cache[entry_no] = (mblock<<1);
85 setHeapAlloced(void *p, StgWord8 i)
87 MBlockMap *map = findMBlockMap(p);
91 mblock_maps = stgReallocBytes(mblock_maps,
92 sizeof(MBlockMap*) * mblock_map_count,
93 "markHeapAlloced(1)");
94 map = mblock_maps[mblock_map_count-1] =
95 stgMallocBytes(sizeof(MBlockMap),"markHeapAlloced(2)");
96 memset(map,0,sizeof(MBlockMap));
97 map->addrHigh32 = (StgWord32) (((StgWord)p) >> 32);
100 map->lines[MBLOCK_MAP_LINE(p)] = i;
106 mblock = (StgWord)p >> MBLOCK_SHIFT;
107 entry_no = mblock & (MBC_ENTRIES-1);
108 mblock_cache[entry_no] = (mblock << 1) + i;
114 markHeapAlloced(void *p)
116 setHeapAlloced(p, 1);
120 markHeapUnalloced(void *p)
122 setHeapAlloced(p, 0);
125 #if SIZEOF_VOID_P == 4
128 void * mapEntryToMBlock(nat i)
130 return (void *)((StgWord)i << MBLOCK_SHIFT);
133 void * getFirstMBlock(void)
137 for (i = 0; i < MBLOCK_MAP_SIZE; i++) {
138 if (mblock_map[i]) return mapEntryToMBlock(i);
143 void * getNextMBlock(void *mblock)
147 for (i = MBLOCK_MAP_ENTRY(mblock) + 1; i < MBLOCK_MAP_SIZE; i++) {
148 if (mblock_map[i]) return mapEntryToMBlock(i);
153 #elif SIZEOF_VOID_P == 8
155 void * getNextMBlock(void *p)
162 for (j = 0; j < mblock_map_count; j++) {
163 map = mblock_maps[j];
164 if (map->addrHigh32 == (StgWord)p >> 32) break;
166 if (j == mblock_map_count) return NULL;
168 for (; j < mblock_map_count; j++) {
169 map = mblock_maps[j];
170 if (map->addrHigh32 == (StgWord)p >> 32) {
171 line_no = MBLOCK_MAP_LINE(p);
172 off = (((StgWord)p >> MBLOCK_SHIFT) & (MBC_LINE_SIZE-1)) + 1;
173 // + 1 because we want the *next* mblock
175 line_no = 0; off = 0;
177 for (; line_no < MBLOCK_MAP_ENTRIES; line_no++) {
178 line = map->lines[line_no];
179 for (; off < MBC_LINE_SIZE; off++) {
180 if (line & (1<<off)) {
181 return (void*)(((StgWord)map->addrHigh32 << 32) +
182 line_no * MBC_LINE_SIZE * MBLOCK_SIZE +
192 void * getFirstMBlock(void)
194 MBlockMap *map = mblock_maps[0];
198 for (line_no = 0; line_no < MBLOCK_MAP_ENTRIES; line_no++) {
199 line = map->lines[line_no];
201 for (off = 0; off < MBC_LINE_SIZE; off++) {
202 if (line & (1<<off)) {
203 return (void*)(((StgWord)map->addrHigh32 << 32) +
204 line_no * MBC_LINE_SIZE * MBLOCK_SIZE +
213 #endif // SIZEOF_VOID_P
215 /* -----------------------------------------------------------------------------
216 Allocate new mblock(s)
217 -------------------------------------------------------------------------- */
222 return getMBlocks(1);
225 // The external interface: allocate 'n' mblocks, and return the
234 ret = osGetMBlocks(n);
236 debugTrace(DEBUG_gc, "allocated %d megablock(s) at %p",n,ret);
239 for (i = 0; i < n; i++) {
240 markHeapAlloced( (StgWord8*)ret + i * MBLOCK_SIZE );
243 mblocks_allocated += n;
244 peak_mblocks_allocated = stg_max(peak_mblocks_allocated, mblocks_allocated);
250 freeMBlocks(void *addr, nat n)
254 debugTrace(DEBUG_gc, "freeing %d megablock(s) at %p",n,addr);
256 mblocks_allocated -= n;
258 for (i = 0; i < n; i++) {
259 markHeapUnalloced( (StgWord8*)addr + i * MBLOCK_SIZE );
262 osFreeMBlocks(addr, n);
268 debugTrace(DEBUG_gc, "freeing all megablocks");
272 #if SIZEOF_VOID_P == 8
274 for (n = 0; n < mblock_map_count; n++) {
275 stgFree(mblock_maps[n]);
277 stgFree(mblock_maps);
285 #if SIZEOF_VOID_P == 8
286 memset(mblock_cache,0xff,sizeof(mblock_cache));