src/share/vm/gc_implementation/g1/g1_globals.hpp

changeset 777
37f87013dfd8
child 785
d28aa69f0959
equal deleted inserted replaced
624:0b27f3512f9e 777:37f87013dfd8
1 /*
2 * Copyright 2001-2007 Sun Microsystems, Inc. All Rights Reserved.
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 *
5 * This code is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU General Public License version 2 only, as
7 * published by the Free Software Foundation.
8 *
9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 * version 2 for more details (a copy is included in the LICENSE file that
13 * accompanied this code).
14 *
15 * You should have received a copy of the GNU General Public License version
16 * 2 along with this work; if not, write to the Free Software Foundation,
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 *
19 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
20 * CA 95054 USA or visit www.sun.com if you need additional information or
21 * have any questions.
22 *
23 */
24
25 //
26 // Defines all globals flags used by the garbage-first compiler.
27 //
28
29 #define G1_FLAGS(develop, develop_pd, product, product_pd, diagnostic, notproduct, manageable, product_rw) \
30 \
31 product(intx, ParallelGCG1AllocBufferSize, 4*K, \
32 "Size of parallel G1 allocation buffers in to-space.") \
33 \
34 product(intx, G1TimeSliceMS, 500, \
35 "Time slice for MMU specification") \
36 \
37 product(intx, G1MaxPauseTimeMS, 200, \
38 "Max GC time per MMU time slice") \
39 \
40 product(intx, G1ConfidencePerc, 50, \
41 "Confidence level for MMU/pause predictions") \
42 \
43 product(intx, G1MarkingOverheadPerc, 0, \
44 "Overhead of concurrent marking") \
45 \
46 product(bool, G1AccountConcurrentOverhead, false, \
47 "Whether soft real-time compliance in G1 will take into account" \
48 "concurrent overhead") \
49 \
50 product(intx, G1YoungGenSize, 0, \
51 "Size of the G1 young generation, 0 is the adaptive policy") \
52 \
53 product(bool, G1Gen, true, \
54 "If true, it will enable the generational G1") \
55 \
56 develop(intx, G1GCPct, 10, \
57 "The desired percent time spent on GC") \
58 \
59 product(intx, G1PolicyVerbose, 0, \
60 "The verbosity level on G1 policy decisions") \
61 \
62 develop(bool, G1UseHRIntoRS, true, \
63 "Determines whether the 'advanced' HR Into rem set is used.") \
64 \
65 product(bool, G1VerifyRemSet, false, \
66 "If true, verify the rem set functioning at each GC") \
67 \
68 product(bool, G1VerifyConcMark, false, \
69 "If true, verify the conc marking code at full GC time") \
70 \
71 develop(intx, G1MarkingVerboseLevel, 0, \
72 "Level (0-4) of verboseness of the marking code") \
73 \
74 develop(bool, G1VerifyConcMarkPrintReachable, true, \
75 "If conc mark verification fails, print reachable objects") \
76 \
77 develop(bool, G1TraceMarkStackOverflow, false, \
78 "If true, extra debugging code for CM restart for ovflw.") \
79 \
80 product(bool, G1VerifyMarkingInEvac, false, \
81 "If true, verify marking info during evacuation") \
82 \
83 develop(intx, G1PausesBtwnConcMark, -1, \
84 "If positive, fixed number of pauses between conc markings") \
85 \
86 product(intx, G1EfficiencyPctCausesMark, 80, \
87 "The cum gc efficiency since mark fall-off that causes " \
88 "new marking") \
89 \
90 product(bool, TraceConcurrentMark, false, \
91 "Trace concurrent mark") \
92 \
93 product(bool, SummarizeG1ConcMark, false, \
94 "Summarize concurrent mark info") \
95 \
96 product(bool, SummarizeG1RSStats, false, \
97 "Summarize remembered set processing info") \
98 \
99 product(bool, SummarizeG1ZFStats, false, \
100 "Summarize zero-filling info") \
101 \
102 product(bool, TraceG1Refine, false, \
103 "Trace G1 concurrent refinement") \
104 \
105 develop(bool, G1ConcMark, true, \
106 "If true, run concurrent marking for G1") \
107 \
108 product(intx, G1CMStackSize, 2 * 1024 * 1024, \
109 "Size of the mark stack for concurrent marking.") \
110 \
111 product(intx, G1CMRegionStackSize, 1024 * 1024, \
112 "Size of the region stack for concurrent marking.") \
113 \
114 develop(bool, G1ConcRefine, true, \
115 "If true, run concurrent rem set refinement for G1") \
116 \
117 develop(intx, G1ConcRefineTargTraversals, 4, \
118 "Number of concurrent refinement we try to achieve") \
119 \
120 develop(intx, G1ConcRefineInitialDelta, 4, \
121 "Number of heap regions of alloc ahead of starting collection " \
122 "pause to start concurrent refinement (initially)") \
123 \
124 product(bool, G1SmoothConcRefine, true, \
125 "Attempts to smooth out the overhead of concurrent refinement") \
126 \
127 develop(bool, G1ConcZeroFill, true, \
128 "If true, run concurrent zero-filling thread") \
129 \
130 develop(intx, G1ConcZFMaxRegions, 1, \
131 "Stop zero-filling when # of zf'd regions reaches") \
132 \
133 product(intx, G1SteadyStateUsed, 90, \
134 "If non-0, try to maintain 'used' at this pct (of max)") \
135 \
136 product(intx, G1SteadyStateUsedDelta, 30, \
137 "If G1SteadyStateUsed is non-0, then do pause this number of " \
138 "of percentage points earlier if no marking is in progress.") \
139 \
140 develop(bool, G1SATBBarrierPrintNullPreVals, false, \
141 "If true, count frac of ptr writes with null pre-vals.") \
142 \
143 product(intx, G1SATBLogBufferSize, 1*K, \
144 "Number of entries in an SATB log buffer.") \
145 \
146 product(intx, G1SATBProcessCompletedThreshold, 20, \
147 "Number of completed buffers that triggers log processing.") \
148 \
149 develop(intx, G1ExtraRegionSurvRate, 33, \
150 "If the young survival rate is S, and there's room left in " \
151 "to-space, we will allow regions whose survival rate is up to " \
152 "S + (1 - S)*X, where X is this parameter (as a fraction.)") \
153 \
154 develop(intx, G1InitYoungSurvRatio, 50, \
155 "Expected Survival Rate for newly allocated bytes") \
156 \
157 develop(bool, G1SATBPrintStubs, false, \
158 "If true, print generated stubs for the SATB barrier") \
159 \
160 product(intx, G1ExpandByPctOfAvail, 20, \
161 "When expanding, % of uncommitted space to claim.") \
162 \
163 develop(bool, G1RSBarrierRegionFilter, true, \
164 "If true, generate region filtering code in RS barrier") \
165 \
166 develop(bool, G1RSBarrierNullFilter, true, \
167 "If true, generate null-pointer filtering code in RS barrier") \
168 \
169 develop(bool, G1PrintCTFilterStats, false, \
170 "If true, print stats on RS filtering effectiveness") \
171 \
172 develop(bool, G1RSBarrierUseQueue, true, \
173 "If true, use queueing RS barrier") \
174 \
175 develop(bool, G1RSLogCheckCardTable, false, \
176 "If true, verify that no dirty cards remain after RS log " \
177 "processing.") \
178 \
179 product(intx, G1MinPausesBetweenMarks, 2, \
180 "Number of inefficient pauses necessary to trigger marking.") \
181 \
182 product(intx, G1InefficientPausePct, 80, \
183 "Threshold of an 'inefficient' pauses (as % of cum efficiency.") \
184 \
185 product(intx, G1RSPopLimit, 32768, \
186 "Limit that defines popularity. Should go away! XXX") \
187 \
188 develop(bool, G1RSCountHisto, false, \
189 "If true, print a histogram of RS occupancies after each pause") \
190 \
191 product(intx, G1ObjPopLimit, 256, \
192 "Limit that defines popularity for an object.") \
193 \
194 product(bool, G1TraceFileOverwrite, false, \
195 "Allow the trace file to be overwritten") \
196 \
197 develop(intx, G1PrintRegionLivenessInfo, 0, \
198 "When > 0, print the occupancies of the <n> best and worst" \
199 "regions.") \
200 \
201 develop(bool, G1TracePopularity, false, \
202 "When true, provide detailed tracing of popularity.") \
203 \
204 product(bool, G1SummarizePopularity, false, \
205 "When true, provide end-of-run-summarization of popularity.") \
206 \
207 product(intx, G1NumPopularRegions, 1, \
208 "Number of regions reserved to hold popular objects. " \
209 "Should go away later.") \
210 \
211 develop(bool, G1PrintParCleanupStats, false, \
212 "When true, print extra stats about parallel cleanup.") \
213 \
214 product(bool, G1DoAgeCohortChecks, false, \
215 "When true, check well-formedness of age cohort structures.") \
216 \
217 develop(bool, G1DisablePreBarrier, false, \
218 "Disable generation of pre-barrier (i.e., marking barrier) ") \
219 \
220 develop(bool, G1DisablePostBarrier, false, \
221 "Disable generation of post-barrier (i.e., RS barrier) ") \
222 \
223 product(intx, G1DirtyCardQueueMax, 30, \
224 "Maximum number of completed RS buffers before mutator threads " \
225 "start processing them.") \
226 \
227 develop(intx, G1ConcRSLogCacheSize, 10, \
228 "Log base 2 of the length of conc RS hot-card cache.") \
229 \
230 product(bool, G1ConcRSCountTraversals, false, \
231 "If true, gather data about the number of times CR traverses " \
232 "cards ") \
233 \
234 product(intx, G1ConcRSHotCardLimit, 4, \
235 "The threshold that defines (>=) a hot card.") \
236 \
237 develop(bool, G1PrintOopAppls, false, \
238 "When true, print applications of closures to external locs.") \
239 \
240 product(intx, G1LogRSRegionEntries, 7, \
241 "Log_2 of max number of regions for which we keep bitmaps.") \
242 \
243 develop(bool, G1RecordHRRSOops, false, \
244 "When true, record recent calls to rem set operations.") \
245 \
246 develop(bool, G1RecordHRRSEvents, false, \
247 "When true, record recent calls to rem set operations.") \
248 \
249 develop(intx, G1MaxVerifyFailures, -1, \
250 "The maximum number of verification failrues to print. " \
251 "-1 means print all.") \
252 \
253 develop(bool, G1ScrubRemSets, true, \
254 "When true, do RS scrubbing after cleanup.") \
255 \
256 develop(bool, G1RSScrubVerbose, false, \
257 "When true, do RS scrubbing with verbose output.") \
258 \
259 develop(bool, G1YoungSurvRateVerbose, false, \
260 "print out the survival rate of young regions according to age.") \
261 \
262 develop(intx, G1YoungSurvRateNumRegionsSummary, 0, \
263 "the number of regions for which we'll print a surv rate " \
264 "summary.") \
265 \
266 product(bool, G1UseScanOnlyPrefix, false, \
267 "It determines whether the system will calculate an optimum " \
268 "scan-only set.") \
269 \
270 product(intx, G1MinReservePerc, 10, \
271 "It determines the minimum reserve we should have in the heap " \
272 "to minimize the probability of promotion failure.") \
273 \
274 product(bool, G1TraceRegions, false, \
275 "If set G1 will print information on which regions are being " \
276 "allocated and which are reclaimed.") \
277 \
278 develop(bool, G1HRRSUseSparseTable, true, \
279 "When true, use sparse table to save space.") \
280 \
281 develop(bool, G1HRRSFlushLogBuffersOnVerify, false, \
282 "Forces flushing of log buffers before verification.") \
283 \
284 product(intx, G1MaxSurvivorRegions, 0, \
285 "The maximum number of survivor regions")
286
287 G1_FLAGS(DECLARE_DEVELOPER_FLAG, DECLARE_PD_DEVELOPER_FLAG, DECLARE_PRODUCT_FLAG, DECLARE_PD_PRODUCT_FLAG, DECLARE_DIAGNOSTIC_FLAG, DECLARE_NOTPRODUCT_FLAG, DECLARE_MANAGEABLE_FLAG, DECLARE_PRODUCT_RW_FLAG)

mercurial