1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
|
/* -----------------------------------------------------------------------------
*
* (c) The GHC Team 1998-2008
*
* MegaBlock Allocator Interface. This file contains all the dirty
* architecture-dependent hackery required to get a chunk of aligned
* memory from the operating system.
*
* ---------------------------------------------------------------------------*/
#include "PosixSource.h"
#include "Rts.h"
#include "RtsUtils.h"
#include "BlockAlloc.h"
#include "Trace.h"
#include "OSMem.h"
#include <string.h>
lnat mblocks_allocated = 0;
lnat mpc_misses = 0;
/* -----------------------------------------------------------------------------
The MBlock Map: provides our implementation of HEAP_ALLOCED()
-------------------------------------------------------------------------- */
#if SIZEOF_VOID_P == 4
StgWord8 mblock_map[MBLOCK_MAP_SIZE]; // initially all zeros
static void
markHeapAlloced(void *p)
{
mblock_map[MBLOCK_MAP_ENTRY(p)] = 1;
}
#elif SIZEOF_VOID_P == 8
MBlockMap **mblock_maps = NULL;
nat mblock_map_count = 0;
MbcCacheLine mblock_cache[MBC_ENTRIES];
static MBlockMap *
findMBlockMap(void *p)
{
nat i;
StgWord32 hi = (StgWord32) (((StgWord)p) >> 32);
for( i = 0; i < mblock_map_count; i++ )
{
if(mblock_maps[i]->addrHigh32 == hi)
{
return mblock_maps[i];
}
}
return NULL;
}
StgBool HEAP_ALLOCED_miss(StgWord mblock, void *p)
{
MBlockMap *map;
MBlockMapLine value;
nat entry_no;
entry_no = mblock & (MBC_ENTRIES-1);
map = findMBlockMap(p);
if (map)
{
mpc_misses++;
value = map->lines[MBLOCK_MAP_LINE(p)];
mblock_cache[entry_no] = (mblock<<1) | value;
return value;
}
else
{
mblock_cache[entry_no] = (mblock<<1);
return 0;
}
}
static void
markHeapAlloced(void *p)
{
MBlockMap *map = findMBlockMap(p);
if(map == NULL)
{
mblock_map_count++;
mblock_maps = realloc(mblock_maps,
sizeof(MBlockMap*) * mblock_map_count);
map = mblock_maps[mblock_map_count-1] =
stgMallocBytes(sizeof(MBlockMap),"markHeapAlloced");
memset(map,0,sizeof(MBlockMap));
map->addrHigh32 = (StgWord32) (((StgWord)p) >> 32);
}
map->lines[MBLOCK_MAP_LINE(p)] = 1;
{
StgWord mblock;
nat entry_no;
mblock = (StgWord)p >> MBLOCK_SHIFT;
entry_no = mblock & (MBC_ENTRIES-1);
mblock_cache[entry_no] = (mblock << 1) + 1;
}
}
#endif
/* ----------------------------------------------------------------------------
Debugging code for traversing the allocated MBlocks
This is used for searching for lost blocks when a memory leak is
detected; see Blocks.c:findUnmarkedBlock().
------------------------------------------------------------------------ */
#ifdef DEBUG
#if SIZEOF_VOID_P == 4
STATIC_INLINE
void * mapEntryToMBlock(nat i)
{
return (void *)((StgWord)i << MBLOCK_SHIFT);
}
void * getFirstMBlock(void)
{
nat i;
for (i = 0; i < MBLOCK_MAP_SIZE; i++) {
if (mblock_map[i]) return mapEntryToMBlock(i);
}
return NULL;
}
void * getNextMBlock(void *mblock)
{
nat i;
for (i = MBLOCK_MAP_ENTRY(mblock) + 1; i < MBLOCK_MAP_SIZE; i++) {
if (mblock_map[i]) return mapEntryToMBlock(i);
}
return NULL;
}
#elif SIZEOF_VOID_P == 8
void * getNextMBlock(void *p)
{
MBlockMap *map;
nat off, j;
nat line_no;
MBlockMapLine line;
for (j = 0; j < mblock_map_count; j++) {
map = mblock_maps[j];
if (map->addrHigh32 == (StgWord)p >> 32) break;
}
if (j == mblock_map_count) return NULL;
for (; j < mblock_map_count; j++) {
map = mblock_maps[j];
if (map->addrHigh32 == (StgWord)p >> 32) {
line_no = MBLOCK_MAP_LINE(p);
off = (((StgWord)p >> MBLOCK_SHIFT) & (MBC_LINE_SIZE-1)) + 1;
// + 1 because we want the *next* mblock
} else {
line_no = 0; off = 0;
}
for (; line_no < MBLOCK_MAP_ENTRIES; line_no++) {
line = map->lines[line_no];
for (; off < MBC_LINE_SIZE; off++) {
if (line & (1<<off)) {
return (void*)(((StgWord)map->addrHigh32 << 32) +
line_no * MBC_LINE_SIZE * MBLOCK_SIZE +
off * MBLOCK_SIZE);
}
}
off = 0;
}
}
return NULL;
}
void * getFirstMBlock(void)
{
MBlockMap *map = mblock_maps[0];
nat line_no, off;
MbcCacheLine line;
for (line_no = 0; line_no < MBLOCK_MAP_ENTRIES; line_no++) {
line = map->lines[line_no];
if (line) {
for (off = 0; off < MBC_LINE_SIZE; off++) {
if (line & (1<<off)) {
return (void*)(((StgWord)map->addrHigh32 << 32) +
line_no * MBC_LINE_SIZE * MBLOCK_SIZE +
off * MBLOCK_SIZE);
}
}
}
}
return NULL;
}
#endif // SIZEOF_VOID_P
#endif // DEBUG
/* -----------------------------------------------------------------------------
Allocate new mblock(s)
-------------------------------------------------------------------------- */
void *
getMBlock(void)
{
return getMBlocks(1);
}
// The external interface: allocate 'n' mblocks, and return the
// address.
void *
getMBlocks(nat n)
{
nat i;
void *ret;
ret = osGetMBlocks(n);
debugTrace(DEBUG_gc, "allocated %d megablock(s) at %p",n,ret);
// fill in the table
for (i = 0; i < n; i++) {
markHeapAlloced( (StgWord8*)ret + i * MBLOCK_SIZE );
}
mblocks_allocated += n;
return ret;
}
void
freeAllMBlocks(void)
{
osFreeAllMBlocks();
}
void
initMBlocks(void)
{
osMemInit();
#if SIZEOF_VOID_P == 8
memset(mblock_cache,0xff,sizeof(mblock_cache));
#endif
}
|
