1 /* 2 * Copyright (c) 2001, 2018, Oracle and/or its affiliates. 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 Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 20 * or visit www.oracle.com if you need additional information or have any 21 * questions. 22 * 23 */ 24 25 #ifndef SHARE_VM_GC_G1_G1_GLOBALS_HPP 26 #define SHARE_VM_GC_G1_G1_GLOBALS_HPP 27 28 #include <float.h> // for DBL_MAX 29 // 30 // Defines all globals flags used by the garbage-first compiler. 31 // 32 33 #define GC_G1_FLAGS(develop, \ 34 develop_pd, \ 35 product, \ 36 product_pd, \ 37 diagnostic, \ 38 diagnostic_pd, \ 39 experimental, \ 40 notproduct, \ 41 manageable, \ 42 product_rw, \ 43 lp64_product, \ 44 range, \ 45 constraint, \ 46 writeable) \ 47 \ 48 product(bool, G1UseAdaptiveIHOP, true, \ 49 "Adaptively adjust the initiating heap occupancy from the " \ 50 "initial value of InitiatingHeapOccupancyPercent. The policy " \ 51 "attempts to start marking in time based on application " \ 52 "behavior.") \ 53 \ 54 experimental(size_t, G1AdaptiveIHOPNumInitialSamples, 3, \ 55 "How many completed time periods from initial mark to first " \ 56 "mixed gc are required to use the input values for prediction " \ 57 "of the optimal occupancy to start marking.") \ 58 range(1, max_intx) \ 59 \ 60 product(uintx, G1ConfidencePercent, 50, \ 61 "Confidence level for MMU/pause predictions") \ 62 range(0, 100) \ 63 \ 64 diagnostic(intx, G1SummarizeRSetStatsPeriod, 0, \ 65 "The period (in number of GCs) at which we will generate " \ 66 "update buffer processing info " \ 67 "(0 means do not periodically generate this info); " \ 68 "it also requires that logging is enabled on the trace" \ 69 "level for gc+remset") \ 70 range(0, max_intx) \ 71 \ 72 product(double, G1ConcMarkStepDurationMillis, 10.0, \ 73 "Target duration of individual concurrent marking steps " \ 74 "in milliseconds.") \ 75 range(1.0, DBL_MAX) \ 76 \ 77 product(uint, G1RefProcDrainInterval, 1000, \ 78 "The number of discovered reference objects to process before " \ 79 "draining concurrent marking work queues.") \ 80 range(1, INT_MAX) \ 81 \ 82 experimental(bool, G1UseReferencePrecleaning, true, \ 83 "Concurrently preclean java.lang.ref.references instances " \ 84 "before the Remark pause.") \ 85 \ 86 experimental(double, G1LastPLABAverageOccupancy, 50.0, \ 87 "The expected average occupancy of the last PLAB in " \ 88 "percent.") \ 89 range(0.001, 100.0) \ 90 \ 91 product(size_t, G1SATBBufferSize, 1*K, \ 92 "Number of entries in an SATB log buffer.") \ 93 range(1, max_uintx) \ 94 \ 95 develop(intx, G1SATBProcessCompletedThreshold, 20, \ 96 "Number of completed buffers that triggers log processing.") \ 97 range(0, max_jint) \ 98 \ 99 product(uintx, G1SATBBufferEnqueueingThresholdPercent, 60, \ 100 "Before enqueueing them, each mutator thread tries to do some " \ 101 "filtering on the SATB buffers it generates. If post-filtering " \ 102 "the percentage of retained entries is over this threshold " \ 103 "the buffer will be enqueued for processing. A value of 0 " \ 104 "specifies that mutator threads should not do such filtering.") \ 105 range(0, 100) \ 106 \ 107 experimental(intx, G1ExpandByPercentOfAvailable, 20, \ 108 "When expanding, % of uncommitted space to claim.") \ 109 range(0, 100) \ 110 \ 111 product(size_t, G1UpdateBufferSize, 256, \ 112 "Size of an update buffer") \ 113 range(1, NOT_LP64(32*M) LP64_ONLY(1*G)) \ 114 \ 115 product(size_t, G1ConcRefinementYellowZone, 0, \ 116 "Number of enqueued update buffers that will " \ 117 "trigger concurrent processing. Will be selected ergonomically " \ 118 "by default.") \ 119 range(0, max_intx) \ 120 \ 121 product(size_t, G1ConcRefinementRedZone, 0, \ 122 "Maximum number of enqueued update buffers before mutator " \ 123 "threads start processing new ones instead of enqueueing them. " \ 124 "Will be selected ergonomically by default.") \ 125 range(0, max_intx) \ 126 \ 127 product(size_t, G1ConcRefinementGreenZone, 0, \ 128 "The number of update buffers that are left in the queue by the " \ 129 "concurrent processing threads. Will be selected ergonomically " \ 130 "by default.") \ 131 range(0, max_intx) \ 132 \ 133 product(uintx, G1ConcRefinementServiceIntervalMillis, 300, \ 134 "The last concurrent refinement thread wakes up every " \ 135 "specified number of milliseconds to do miscellaneous work.") \ 136 range(0, max_jint) \ 137 \ 138 product(size_t, G1ConcRefinementThresholdStep, 2, \ 139 "Each time the rset update queue increases by this amount " \ 140 "activate the next refinement thread if available. " \ 141 "The actual step size will be selected ergonomically by " \ 142 "default, with this value used to determine a lower bound.") \ 143 range(1, SIZE_MAX) \ 144 \ 145 product(intx, G1RSetUpdatingPauseTimePercent, 10, \ 146 "A target percentage of time that is allowed to be spend on " \ 147 "process RS update buffers during the collection pause.") \ 148 range(0, 100) \ 149 \ 150 product(bool, G1UseAdaptiveConcRefinement, true, \ 151 "Select green, yellow and red zones adaptively to meet the " \ 152 "the pause requirements.") \ 153 \ 154 product(size_t, G1ConcRSLogCacheSize, 10, \ 155 "Log base 2 of the length of conc RS hot-card cache.") \ 156 range(0, 27) \ 157 \ 158 product(uintx, G1ConcRSHotCardLimit, 4, \ 159 "The threshold that defines (>=) a hot card.") \ 160 range(0, max_jubyte) \ 161 \ 162 develop(intx, G1RSetRegionEntriesBase, 256, \ 163 "Max number of regions in a fine-grain table per MB.") \ 164 range(1, max_jint/wordSize) \ 165 \ 166 product(intx, G1RSetRegionEntries, 0, \ 167 "Max number of regions for which we keep bitmaps." \ 168 "Will be set ergonomically by default") \ 169 range(0, max_jint/wordSize) \ 170 constraint(G1RSetRegionEntriesConstraintFunc,AfterErgo) \ 171 \ 172 develop(intx, G1RSetSparseRegionEntriesBase, 4, \ 173 "Max number of entries per region in a sparse table " \ 174 "per MB.") \ 175 range(1, max_jint/wordSize) \ 176 \ 177 product(intx, G1RSetSparseRegionEntries, 0, \ 178 "Max number of entries per region in a sparse table." \ 179 "Will be set ergonomically by default.") \ 180 range(0, max_jint/wordSize) \ 181 constraint(G1RSetSparseRegionEntriesConstraintFunc,AfterErgo) \ 182 \ 183 develop(intx, G1MaxVerifyFailures, -1, \ 184 "The maximum number of verification failures to print. " \ 185 "-1 means print all.") \ 186 range(-1, max_jint) \ 187 \ 188 product(uintx, G1ReservePercent, 10, \ 189 "It determines the minimum reserve we should have in the heap " \ 190 "to minimize the probability of promotion failure.") \ 191 range(0, 50) \ 192 \ 193 develop(bool, G1HRRSUseSparseTable, true, \ 194 "When true, use sparse table to save space.") \ 195 \ 196 product(size_t, G1HeapRegionSize, 0, \ 197 "Size of the G1 regions.") \ 198 range(0, 32*M) \ 199 constraint(G1HeapRegionSizeConstraintFunc,AfterMemoryInit) \ 200 \ 201 product(uint, G1ConcRefinementThreads, 0, \ 202 "The number of parallel rem set update threads. " \ 203 "Will be set ergonomically by default.") \ 204 range(0, (max_jint-1)/wordSize) \ 205 \ 206 develop(bool, G1VerifyCTCleanup, false, \ 207 "Verify card table cleanup.") \ 208 \ 209 product(size_t, G1RSetScanBlockSize, 64, \ 210 "Size of a work unit of cards claimed by a worker thread" \ 211 "during RSet scanning.") \ 212 range(1, max_uintx) \ 213 \ 214 develop(uintx, G1DummyRegionsPerGC, 0, \ 215 "The number of dummy regions G1 will allocate at the end of " \ 216 "each evacuation pause in order to artificially fill up the " \ 217 "heap and stress the marking implementation.") \ 218 \ 219 develop(bool, G1ExitOnExpansionFailure, false, \ 220 "Raise a fatal VM exit out of memory failure in the event " \ 221 " that heap expansion fails due to running out of swap.") \ 222 \ 223 experimental(uintx, G1MaxNewSizePercent, 60, \ 224 "Percentage (0-100) of the heap size to use as default " \ 225 " maximum young gen size.") \ 226 range(0, 100) \ 227 constraint(G1MaxNewSizePercentConstraintFunc,AfterErgo) \ 228 \ 229 experimental(uintx, G1NewSizePercent, 5, \ 230 "Percentage (0-100) of the heap size to use as default " \ 231 "minimum young gen size.") \ 232 range(0, 100) \ 233 constraint(G1NewSizePercentConstraintFunc,AfterErgo) \ 234 \ 235 experimental(uintx, G1MixedGCLiveThresholdPercent, 85, \ 236 "Threshold for regions to be considered for inclusion in the " \ 237 "collection set of mixed GCs. " \ 238 "Regions with live bytes exceeding this will not be collected.") \ 239 range(0, 100) \ 240 \ 241 product(uintx, G1HeapWastePercent, 5, \ 242 "Amount of space, expressed as a percentage of the heap size, " \ 243 "that G1 is willing not to collect to avoid expensive GCs.") \ 244 range(0, 100) \ 245 \ 246 product(uintx, G1MixedGCCountTarget, 8, \ 247 "The target number of mixed GCs after a marking cycle.") \ 248 range(0, max_uintx) \ 249 \ 250 experimental(bool, G1PretouchAuxiliaryMemory, false, \ 251 "Pre-touch large auxiliary data structures used by the GC.") \ 252 \ 253 experimental(bool, G1EagerReclaimHumongousObjects, true, \ 254 "Try to reclaim dead large objects at every young GC.") \ 255 \ 256 experimental(bool, G1EagerReclaimHumongousObjectsWithStaleRefs, true, \ 257 "Try to reclaim dead large objects that have a few stale " \ 258 "references at every young GC.") \ 259 \ 260 experimental(size_t, G1RebuildRemSetChunkSize, 256 * K, \ 261 "Chunk size used for rebuilding the remembered set.") \ 262 range(4 * K, 32 * M) \ 263 \ 264 experimental(uintx, G1OldCSetRegionThresholdPercent, 10, \ 265 "An upper bound for the number of old CSet regions expressed " \ 266 "as a percentage of the heap size.") \ 267 range(0, 100) \ 268 \ 269 notproduct(bool, G1EvacuationFailureALot, false, \ 270 "Force use of evacuation failure handling during certain " \ 271 "evacuation pauses") \ 272 \ 273 develop(uintx, G1EvacuationFailureALotCount, 1000, \ 274 "Number of successful evacuations between evacuation failures " \ 275 "occurring at object copying") \ 276 \ 277 develop(uintx, G1EvacuationFailureALotInterval, 5, \ 278 "Total collections between forced triggering of evacuation " \ 279 "failures") \ 280 \ 281 develop(bool, G1EvacuationFailureALotDuringConcMark, true, \ 282 "Force use of evacuation failure handling during evacuation " \ 283 "pauses when marking is in progress") \ 284 \ 285 develop(bool, G1EvacuationFailureALotDuringInitialMark, true, \ 286 "Force use of evacuation failure handling during initial mark " \ 287 "evacuation pauses") \ 288 \ 289 develop(bool, G1EvacuationFailureALotDuringYoungGC, true, \ 290 "Force use of evacuation failure handling during young " \ 291 "evacuation pauses") \ 292 \ 293 develop(bool, G1EvacuationFailureALotDuringMixedGC, true, \ 294 "Force use of evacuation failure handling during mixed " \ 295 "evacuation pauses") \ 296 \ 297 diagnostic(bool, G1VerifyRSetsDuringFullGC, false, \ 298 "If true, perform verification of each heap region's " \ 299 "remembered set when verifying the heap during a full GC.") \ 300 \ 301 diagnostic(bool, G1VerifyHeapRegionCodeRoots, false, \ 302 "Verify the code root lists attached to each heap region.") \ 303 \ 304 develop(bool, G1VerifyBitmaps, false, \ 305 "Verifies the consistency of the marking bitmaps") \ 306 \ 307 product(bool, G1UseLegacyMonitoring, false, \ 308 "Use legacy GarbageCollector/MemoryPool MXBean and jstat " \ 309 "counter definitions") 310 311 #endif // SHARE_VM_GC_G1_G1_GLOBALS_HPP