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
|
/* Copyright (C) 2009-2010 Matthew Fluet.
* Copyright (C) 1999-2008 Henry Cejtin, Matthew Fluet, Suresh
* Jagannathan, and Stephen Weeks.
* Copyright (C) 1997-2000 NEC Research Institute.
*
* MLton is released under a BSD-style license.
* See the file MLton-LICENSE for details.
*/
void minorGC (GC_state s) {
minorCheneyCopyGC (s);
}
void majorGC (GC_state s, size_t bytesRequested, bool mayResize) {
uintmax_t numGCs;
size_t desiredSize;
s->lastMajorStatistics.numMinorGCs = 0;
numGCs =
s->cumulativeStatistics.numCopyingGCs
+ s->cumulativeStatistics.numMarkCompactGCs;
if (0 < numGCs
and ((float)(s->cumulativeStatistics.numHashConsGCs) / (float)(numGCs)
< s->controls.ratios.hashCons))
s->hashConsDuringGC = TRUE;
desiredSize =
sizeofHeapDesired (s, s->lastMajorStatistics.bytesLive + bytesRequested, 0);
if (not FORCE_MARK_COMPACT
and not s->hashConsDuringGC // only markCompact can hash cons
and s->heap.withMapsSize < s->sysvals.ram
and (not isHeapInit (&s->secondaryHeap)
or createHeapSecondary (s, desiredSize)))
majorCheneyCopyGC (s);
else
majorMarkCompactGC (s);
s->hashConsDuringGC = FALSE;
s->lastMajorStatistics.bytesLive = s->heap.oldGenSize;
if (s->lastMajorStatistics.bytesLive > s->cumulativeStatistics.maxBytesLive)
s->cumulativeStatistics.maxBytesLive = s->lastMajorStatistics.bytesLive;
/* Notice that the s->lastMajorStatistics.bytesLive below is
* different than the s->lastMajorStatistics.bytesLive used as an
* argument to createHeapSecondary above. Above, it was an
* estimate. Here, it is exactly how much was live after the GC.
*/
if (mayResize) {
resizeHeap (s, s->lastMajorStatistics.bytesLive + bytesRequested);
}
setCardMapAndCrossMap (s);
resizeHeapSecondary (s);
assert (s->heap.oldGenSize + bytesRequested <= s->heap.size);
}
void growStackCurrent (GC_state s) {
size_t reserved;
GC_stack stack;
reserved = sizeofStackGrowReserved (s, getStackCurrent(s));
if (DEBUG_STACKS or s->controls.messages)
fprintf (stderr,
"[GC: Growing stack of size %s bytes to size %s bytes, using %s bytes.]\n",
uintmaxToCommaString(getStackCurrent(s)->reserved),
uintmaxToCommaString(reserved),
uintmaxToCommaString(getStackCurrent(s)->used));
assert (hasHeapBytesFree (s, sizeofStackWithHeader (s, reserved), 0));
stack = newStack (s, reserved, TRUE);
copyStack (s, getStackCurrent(s), stack);
getThreadCurrent(s)->stack = pointerToObjptr ((pointer)stack, s->heap.start);
markCard (s, objptrToPointer (getThreadCurrentObjptr(s), s->heap.start));
}
void enterGC (GC_state s) {
if (s->profiling.isOn) {
/* We don't need to profileEnter for count profiling because it
* has already bumped the counter. If we did allow the bump, then
* the count would look like function(s) had run an extra time.
*/
if (s->profiling.stack
and not (PROFILE_COUNT == s->profiling.kind))
GC_profileEnter (s);
}
s->amInGC = TRUE;
}
void leaveGC (GC_state s) {
if (s->profiling.isOn) {
if (s->profiling.stack
and not (PROFILE_COUNT == s->profiling.kind))
GC_profileLeave (s);
}
s->amInGC = FALSE;
}
void performGC (GC_state s,
size_t oldGenBytesRequested,
size_t nurseryBytesRequested,
bool forceMajor,
bool mayResize) {
uintmax_t gcTime;
bool stackTopOk;
size_t stackBytesRequested;
struct rusage ru_start;
size_t totalBytesRequested;
enterGC (s);
s->cumulativeStatistics.numGCs++;
if (DEBUG or s->controls.messages) {
size_t nurserySize = s->heap.size - (s->heap.nursery - s->heap.start);
size_t nurseryUsed = s->frontier - s->heap.nursery;
fprintf (stderr,
"[GC: Starting gc #%s; requesting %s nursery bytes and %s old-gen bytes,]\n",
uintmaxToCommaString(s->cumulativeStatistics.numGCs),
uintmaxToCommaString(nurseryBytesRequested),
uintmaxToCommaString(oldGenBytesRequested));
fprintf (stderr,
"[GC:\theap at "FMTPTR" of size %s bytes (+ %s bytes card/cross map),]\n",
(uintptr_t)(s->heap.start),
uintmaxToCommaString(s->heap.size),
uintmaxToCommaString(s->heap.withMapsSize - s->heap.size));
fprintf (stderr,
"[GC:\twith old-gen of size %s bytes (%.1f%% of heap),]\n",
uintmaxToCommaString(s->heap.oldGenSize),
100.0 * ((double)(s->heap.oldGenSize) / (double)(s->heap.size)));
fprintf (stderr,
"[GC:\tand nursery of size %s bytes (%.1f%% of heap),]\n",
uintmaxToCommaString(nurserySize),
100.0 * ((double)(nurserySize) / (double)(s->heap.size)));
fprintf (stderr,
"[GC:\tand nursery using %s bytes (%.1f%% of heap, %.1f%% of nursery).]\n",
uintmaxToCommaString(nurseryUsed),
100.0 * ((double)(nurseryUsed) / (double)(s->heap.size)),
100.0 * ((double)(nurseryUsed) / (double)(nurserySize)));
}
assert (invariantForGC (s));
if (needGCTime (s))
startTiming (&ru_start);
minorGC (s);
stackTopOk = invariantForMutatorStack (s);
stackBytesRequested =
stackTopOk
? 0
: sizeofStackWithHeader (s, sizeofStackGrowReserved (s, getStackCurrent (s)));
totalBytesRequested =
oldGenBytesRequested
+ nurseryBytesRequested
+ stackBytesRequested;
if (forceMajor
or totalBytesRequested > s->heap.size - s->heap.oldGenSize)
majorGC (s, totalBytesRequested, mayResize);
setGCStateCurrentHeap (s, oldGenBytesRequested + stackBytesRequested,
nurseryBytesRequested);
assert (hasHeapBytesFree (s, oldGenBytesRequested + stackBytesRequested,
nurseryBytesRequested));
unless (stackTopOk)
growStackCurrent (s);
setGCStateCurrentThreadAndStack (s);
if (needGCTime (s)) {
gcTime = stopTiming (&ru_start, &s->cumulativeStatistics.ru_gc);
s->cumulativeStatistics.maxPauseTime =
max (s->cumulativeStatistics.maxPauseTime, gcTime);
} else
gcTime = 0; /* Assign gcTime to quell gcc warning. */
if (DEBUG or s->controls.messages) {
size_t nurserySize = s->heap.size - (s->heap.nursery - s->heap.start);
fprintf (stderr,
"[GC: Finished gc #%s; time %s ms,]\n",
uintmaxToCommaString(s->cumulativeStatistics.numGCs),
uintmaxToCommaString(gcTime));
fprintf (stderr,
"[GC:\theap at "FMTPTR" of size %s bytes (+ %s bytes card/cross map),]\n",
(uintptr_t)(s->heap.start),
uintmaxToCommaString(s->heap.size),
uintmaxToCommaString(s->heap.withMapsSize - s->heap.size));
fprintf (stderr,
"[GC:\twith old-gen of size %s bytes (%.1f%% of heap),]\n",
uintmaxToCommaString(s->heap.oldGenSize),
100.0 * ((double)(s->heap.oldGenSize) / (double)(s->heap.size)));
fprintf (stderr,
"[GC:\tand nursery of size %s bytes (%.1f%% of heap).]\n",
uintmaxToCommaString(nurserySize),
100.0 * ((double)(nurserySize) / (double)(s->heap.size)));
}
/* Send a GC signal. */
if (s->signalsInfo.gcSignalHandled
and s->signalHandlerThread != BOGUS_OBJPTR) {
if (DEBUG_SIGNALS)
fprintf (stderr, "GC Signal pending.\n");
s->signalsInfo.gcSignalPending = TRUE;
unless (s->signalsInfo.amInSignalHandler)
s->signalsInfo.signalIsPending = TRUE;
}
if (DEBUG)
displayGCState (s, stderr);
assert (hasHeapBytesFree (s, oldGenBytesRequested, nurseryBytesRequested));
assert (invariantForGC (s));
leaveGC (s);
}
void ensureInvariantForMutator (GC_state s, bool force) {
if (force
or not (invariantForMutatorFrontier(s))
or not (invariantForMutatorStack(s))) {
/* This GC will grow the stack, if necessary. */
performGC (s, 0, getThreadCurrent(s)->bytesNeeded, force, TRUE);
}
assert (invariantForMutatorFrontier(s));
assert (invariantForMutatorStack(s));
}
/* ensureHasHeapBytesFree (s, oldGen, nursery)
*/
void ensureHasHeapBytesFree (GC_state s,
size_t oldGenBytesRequested,
size_t nurseryBytesRequested) {
assert (s->heap.nursery <= s->limitPlusSlop);
assert (s->frontier <= s->limitPlusSlop);
if (not hasHeapBytesFree (s, oldGenBytesRequested, nurseryBytesRequested))
performGC (s, oldGenBytesRequested, nurseryBytesRequested, FALSE, TRUE);
assert (hasHeapBytesFree (s, oldGenBytesRequested, nurseryBytesRequested));
}
void GC_collect (GC_state s, size_t bytesRequested, bool force) {
enter (s);
/* When the mutator requests zero bytes, it may actually need as
* much as GC_HEAP_LIMIT_SLOP.
*/
if (0 == bytesRequested)
bytesRequested = GC_HEAP_LIMIT_SLOP;
getThreadCurrent(s)->bytesNeeded = bytesRequested;
switchToSignalHandlerThreadIfNonAtomicAndSignalPending (s);
ensureInvariantForMutator (s, force);
assert (invariantForMutatorFrontier(s));
assert (invariantForMutatorStack(s));
leave (s);
}
|
