annotate src/share/vm/runtime/globals.hpp @ 747:93c14e5562c4

6823354: Add intrinsics for {Integer,Long}.{numberOfLeadingZeros,numberOfTrailingZeros}() Summary: These methods can be instrinsified by using bit scan, bit test, and population count instructions. Reviewed-by: kvn, never
author twisti
date Wed, 06 May 2009 00:27:52 -0700
parents be93aad57795
children d0e0d6d824d8
rev   line source
duke@0 1 /*
twisti@620 2 * Copyright 1997-2009 Sun Microsystems, Inc. All Rights Reserved.
duke@0 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
duke@0 4 *
duke@0 5 * This code is free software; you can redistribute it and/or modify it
duke@0 6 * under the terms of the GNU General Public License version 2 only, as
duke@0 7 * published by the Free Software Foundation.
duke@0 8 *
duke@0 9 * This code is distributed in the hope that it will be useful, but WITHOUT
duke@0 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
duke@0 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
duke@0 12 * version 2 for more details (a copy is included in the LICENSE file that
duke@0 13 * accompanied this code).
duke@0 14 *
duke@0 15 * You should have received a copy of the GNU General Public License version
duke@0 16 * 2 along with this work; if not, write to the Free Software Foundation,
duke@0 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
duke@0 18 *
duke@0 19 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
duke@0 20 * CA 95054 USA or visit www.sun.com if you need additional information or
duke@0 21 * have any questions.
duke@0 22 *
duke@0 23 */
duke@0 24
duke@0 25 #if !defined(COMPILER1) && !defined(COMPILER2)
duke@0 26 define_pd_global(bool, BackgroundCompilation, false);
duke@0 27 define_pd_global(bool, UseTLAB, false);
duke@0 28 define_pd_global(bool, CICompileOSR, false);
duke@0 29 define_pd_global(bool, UseTypeProfile, false);
duke@0 30 define_pd_global(bool, UseOnStackReplacement, false);
duke@0 31 define_pd_global(bool, InlineIntrinsics, false);
duke@0 32 define_pd_global(bool, PreferInterpreterNativeStubs, true);
duke@0 33 define_pd_global(bool, ProfileInterpreter, false);
duke@0 34 define_pd_global(bool, ProfileTraps, false);
duke@0 35 define_pd_global(bool, TieredCompilation, false);
duke@0 36
duke@0 37 define_pd_global(intx, CompileThreshold, 0);
duke@0 38 define_pd_global(intx, Tier2CompileThreshold, 0);
duke@0 39 define_pd_global(intx, Tier3CompileThreshold, 0);
duke@0 40 define_pd_global(intx, Tier4CompileThreshold, 0);
duke@0 41
duke@0 42 define_pd_global(intx, BackEdgeThreshold, 0);
duke@0 43 define_pd_global(intx, Tier2BackEdgeThreshold, 0);
duke@0 44 define_pd_global(intx, Tier3BackEdgeThreshold, 0);
duke@0 45 define_pd_global(intx, Tier4BackEdgeThreshold, 0);
duke@0 46
duke@0 47 define_pd_global(intx, OnStackReplacePercentage, 0);
duke@0 48 define_pd_global(bool, ResizeTLAB, false);
duke@0 49 define_pd_global(intx, FreqInlineSize, 0);
kvn@656 50 define_pd_global(intx, InlineSmallCode, 0);
duke@0 51 define_pd_global(intx, NewSizeThreadIncrease, 4*K);
duke@0 52 define_pd_global(intx, NewRatio, 4);
duke@0 53 define_pd_global(intx, InlineClassNatives, true);
duke@0 54 define_pd_global(intx, InlineUnsafeOps, true);
duke@0 55 define_pd_global(intx, InitialCodeCacheSize, 160*K);
duke@0 56 define_pd_global(intx, ReservedCodeCacheSize, 32*M);
duke@0 57 define_pd_global(intx, CodeCacheExpansionSize, 32*K);
duke@0 58 define_pd_global(intx, CodeCacheMinBlockLength, 1);
duke@0 59 define_pd_global(uintx,PermSize, ScaleForWordSize(4*M));
duke@0 60 define_pd_global(uintx,MaxPermSize, ScaleForWordSize(64*M));
duke@0 61 define_pd_global(bool, NeverActAsServerClassMachine, true);
duke@0 62 define_pd_global(uintx, DefaultMaxRAM, 1*G);
duke@0 63 #define CI_COMPILER_COUNT 0
duke@0 64 #else
duke@0 65
duke@0 66 #ifdef COMPILER2
duke@0 67 #define CI_COMPILER_COUNT 2
duke@0 68 #else
duke@0 69 #define CI_COMPILER_COUNT 1
duke@0 70 #endif // COMPILER2
duke@0 71
duke@0 72 #endif // no compilers
duke@0 73
duke@0 74
duke@0 75 // string type aliases used only in this file
duke@0 76 typedef const char* ccstr;
duke@0 77 typedef const char* ccstrlist; // represents string arguments which accumulate
duke@0 78
duke@0 79 enum FlagValueOrigin {
duke@0 80 DEFAULT = 0,
duke@0 81 COMMAND_LINE = 1,
duke@0 82 ENVIRON_VAR = 2,
duke@0 83 CONFIG_FILE = 3,
duke@0 84 MANAGEMENT = 4,
duke@0 85 ERGONOMIC = 5,
duke@0 86 ATTACH_ON_DEMAND = 6,
duke@0 87 INTERNAL = 99
duke@0 88 };
duke@0 89
duke@0 90 struct Flag {
duke@0 91 const char *type;
duke@0 92 const char *name;
duke@0 93 void* addr;
duke@0 94 const char *kind;
duke@0 95 FlagValueOrigin origin;
duke@0 96
duke@0 97 // points to all Flags static array
duke@0 98 static Flag *flags;
duke@0 99
duke@0 100 // number of flags
duke@0 101 static size_t numFlags;
duke@0 102
duke@0 103 static Flag* find_flag(char* name, size_t length);
duke@0 104
duke@0 105 bool is_bool() const { return strcmp(type, "bool") == 0; }
duke@0 106 bool get_bool() const { return *((bool*) addr); }
duke@0 107 void set_bool(bool value) { *((bool*) addr) = value; }
duke@0 108
duke@0 109 bool is_intx() const { return strcmp(type, "intx") == 0; }
duke@0 110 intx get_intx() const { return *((intx*) addr); }
duke@0 111 void set_intx(intx value) { *((intx*) addr) = value; }
duke@0 112
duke@0 113 bool is_uintx() const { return strcmp(type, "uintx") == 0; }
duke@0 114 uintx get_uintx() const { return *((uintx*) addr); }
duke@0 115 void set_uintx(uintx value) { *((uintx*) addr) = value; }
duke@0 116
duke@0 117 bool is_double() const { return strcmp(type, "double") == 0; }
duke@0 118 double get_double() const { return *((double*) addr); }
duke@0 119 void set_double(double value) { *((double*) addr) = value; }
duke@0 120
duke@0 121 bool is_ccstr() const { return strcmp(type, "ccstr") == 0 || strcmp(type, "ccstrlist") == 0; }
duke@0 122 bool ccstr_accumulates() const { return strcmp(type, "ccstrlist") == 0; }
duke@0 123 ccstr get_ccstr() const { return *((ccstr*) addr); }
duke@0 124 void set_ccstr(ccstr value) { *((ccstr*) addr) = value; }
duke@0 125
duke@0 126 bool is_unlocker() const;
duke@0 127 bool is_unlocked() const;
duke@0 128 bool is_writeable() const;
duke@0 129 bool is_external() const;
duke@0 130
duke@0 131 void print_on(outputStream* st);
duke@0 132 void print_as_flag(outputStream* st);
duke@0 133 };
duke@0 134
duke@0 135 // debug flags control various aspects of the VM and are global accessible
duke@0 136
duke@0 137 // use FlagSetting to temporarily change some debug flag
duke@0 138 // e.g. FlagSetting fs(DebugThisAndThat, true);
duke@0 139 // restored to previous value upon leaving scope
duke@0 140 class FlagSetting {
duke@0 141 bool val;
duke@0 142 bool* flag;
duke@0 143 public:
duke@0 144 FlagSetting(bool& fl, bool newValue) { flag = &fl; val = fl; fl = newValue; }
duke@0 145 ~FlagSetting() { *flag = val; }
duke@0 146 };
duke@0 147
duke@0 148
duke@0 149 class CounterSetting {
duke@0 150 intx* counter;
duke@0 151 public:
duke@0 152 CounterSetting(intx* cnt) { counter = cnt; (*counter)++; }
duke@0 153 ~CounterSetting() { (*counter)--; }
duke@0 154 };
duke@0 155
duke@0 156
duke@0 157 class IntFlagSetting {
duke@0 158 intx val;
duke@0 159 intx* flag;
duke@0 160 public:
duke@0 161 IntFlagSetting(intx& fl, intx newValue) { flag = &fl; val = fl; fl = newValue; }
duke@0 162 ~IntFlagSetting() { *flag = val; }
duke@0 163 };
duke@0 164
duke@0 165
duke@0 166 class DoubleFlagSetting {
duke@0 167 double val;
duke@0 168 double* flag;
duke@0 169 public:
duke@0 170 DoubleFlagSetting(double& fl, double newValue) { flag = &fl; val = fl; fl = newValue; }
duke@0 171 ~DoubleFlagSetting() { *flag = val; }
duke@0 172 };
duke@0 173
duke@0 174
duke@0 175 class CommandLineFlags {
duke@0 176 public:
duke@0 177 static bool boolAt(char* name, size_t len, bool* value);
duke@0 178 static bool boolAt(char* name, bool* value) { return boolAt(name, strlen(name), value); }
duke@0 179 static bool boolAtPut(char* name, size_t len, bool* value, FlagValueOrigin origin);
duke@0 180 static bool boolAtPut(char* name, bool* value, FlagValueOrigin origin) { return boolAtPut(name, strlen(name), value, origin); }
duke@0 181
duke@0 182 static bool intxAt(char* name, size_t len, intx* value);
duke@0 183 static bool intxAt(char* name, intx* value) { return intxAt(name, strlen(name), value); }
duke@0 184 static bool intxAtPut(char* name, size_t len, intx* value, FlagValueOrigin origin);
duke@0 185 static bool intxAtPut(char* name, intx* value, FlagValueOrigin origin) { return intxAtPut(name, strlen(name), value, origin); }
duke@0 186
duke@0 187 static bool uintxAt(char* name, size_t len, uintx* value);
duke@0 188 static bool uintxAt(char* name, uintx* value) { return uintxAt(name, strlen(name), value); }
duke@0 189 static bool uintxAtPut(char* name, size_t len, uintx* value, FlagValueOrigin origin);
duke@0 190 static bool uintxAtPut(char* name, uintx* value, FlagValueOrigin origin) { return uintxAtPut(name, strlen(name), value, origin); }
duke@0 191
duke@0 192 static bool doubleAt(char* name, size_t len, double* value);
duke@0 193 static bool doubleAt(char* name, double* value) { return doubleAt(name, strlen(name), value); }
duke@0 194 static bool doubleAtPut(char* name, size_t len, double* value, FlagValueOrigin origin);
duke@0 195 static bool doubleAtPut(char* name, double* value, FlagValueOrigin origin) { return doubleAtPut(name, strlen(name), value, origin); }
duke@0 196
duke@0 197 static bool ccstrAt(char* name, size_t len, ccstr* value);
duke@0 198 static bool ccstrAt(char* name, ccstr* value) { return ccstrAt(name, strlen(name), value); }
duke@0 199 static bool ccstrAtPut(char* name, size_t len, ccstr* value, FlagValueOrigin origin);
duke@0 200 static bool ccstrAtPut(char* name, ccstr* value, FlagValueOrigin origin) { return ccstrAtPut(name, strlen(name), value, origin); }
duke@0 201
duke@0 202 // Returns false if name is not a command line flag.
duke@0 203 static bool wasSetOnCmdline(const char* name, bool* value);
duke@0 204 static void printSetFlags();
duke@0 205
duke@0 206 static void printFlags() PRODUCT_RETURN;
duke@0 207
duke@0 208 static void verify() PRODUCT_RETURN;
duke@0 209 };
duke@0 210
duke@0 211 // use this for flags that are true by default in the debug version but
duke@0 212 // false in the optimized version, and vice versa
duke@0 213 #ifdef ASSERT
duke@0 214 #define trueInDebug true
duke@0 215 #define falseInDebug false
duke@0 216 #else
duke@0 217 #define trueInDebug false
duke@0 218 #define falseInDebug true
duke@0 219 #endif
duke@0 220
duke@0 221 // use this for flags that are true per default in the product build
duke@0 222 // but false in development builds, and vice versa
duke@0 223 #ifdef PRODUCT
duke@0 224 #define trueInProduct true
duke@0 225 #define falseInProduct false
duke@0 226 #else
duke@0 227 #define trueInProduct false
duke@0 228 #define falseInProduct true
duke@0 229 #endif
duke@0 230
duke@0 231 // use this for flags that are true per default in the tiered build
duke@0 232 // but false in non-tiered builds, and vice versa
duke@0 233 #ifdef TIERED
duke@0 234 #define trueInTiered true
duke@0 235 #define falseInTiered false
duke@0 236 #else
duke@0 237 #define trueInTiered false
duke@0 238 #define falseInTiered true
duke@0 239 #endif
duke@0 240
duke@0 241 // develop flags are settable / visible only during development and are constant in the PRODUCT version
duke@0 242 // product flags are always settable / visible
duke@0 243 // notproduct flags are settable / visible only during development and are not declared in the PRODUCT version
duke@0 244
duke@0 245 // A flag must be declared with one of the following types:
duke@0 246 // bool, intx, uintx, ccstr.
duke@0 247 // The type "ccstr" is an alias for "const char*" and is used
duke@0 248 // only in this file, because the macrology requires single-token type names.
duke@0 249
duke@0 250 // Note: Diagnostic options not meant for VM tuning or for product modes.
duke@0 251 // They are to be used for VM quality assurance or field diagnosis
duke@0 252 // of VM bugs. They are hidden so that users will not be encouraged to
duke@0 253 // try them as if they were VM ordinary execution options. However, they
duke@0 254 // are available in the product version of the VM. Under instruction
duke@0 255 // from support engineers, VM customers can turn them on to collect
duke@0 256 // diagnostic information about VM problems. To use a VM diagnostic
duke@0 257 // option, you must first specify +UnlockDiagnosticVMOptions.
duke@0 258 // (This master switch also affects the behavior of -Xprintflags.)
ysr@352 259 //
ysr@352 260 // experimental flags are in support of features that are not
ysr@352 261 // part of the officially supported product, but are available
ysr@352 262 // for experimenting with. They could, for example, be performance
ysr@352 263 // features that may not have undergone full or rigorous QA, but which may
ysr@352 264 // help performance in some cases and released for experimentation
ysr@352 265 // by the community of users and developers. This flag also allows one to
ysr@352 266 // be able to build a fully supported product that nonetheless also
ysr@352 267 // ships with some unsupported, lightly tested, experimental features.
ysr@352 268 // Like the UnlockDiagnosticVMOptions flag above, there is a corresponding
ysr@352 269 // UnlockExperimentalVMOptions flag, which allows the control and
ysr@352 270 // modification of the experimental flags.
ysr@352 271 //
duke@0 272 // manageable flags are writeable external product flags.
duke@0 273 // They are dynamically writeable through the JDK management interface
duke@0 274 // (com.sun.management.HotSpotDiagnosticMXBean API) and also through JConsole.
duke@0 275 // These flags are external exported interface (see CCC). The list of
duke@0 276 // manageable flags can be queried programmatically through the management
duke@0 277 // interface.
duke@0 278 //
duke@0 279 // A flag can be made as "manageable" only if
duke@0 280 // - the flag is defined in a CCC as an external exported interface.
duke@0 281 // - the VM implementation supports dynamic setting of the flag.
duke@0 282 // This implies that the VM must *always* query the flag variable
duke@0 283 // and not reuse state related to the flag state at any given time.
duke@0 284 // - you want the flag to be queried programmatically by the customers.
duke@0 285 //
duke@0 286 // product_rw flags are writeable internal product flags.
duke@0 287 // They are like "manageable" flags but for internal/private use.
duke@0 288 // The list of product_rw flags are internal/private flags which
duke@0 289 // may be changed/removed in a future release. It can be set
duke@0 290 // through the management interface to get/set value
duke@0 291 // when the name of flag is supplied.
duke@0 292 //
duke@0 293 // A flag can be made as "product_rw" only if
duke@0 294 // - the VM implementation supports dynamic setting of the flag.
duke@0 295 // This implies that the VM must *always* query the flag variable
duke@0 296 // and not reuse state related to the flag state at any given time.
duke@0 297 //
duke@0 298 // Note that when there is a need to support develop flags to be writeable,
duke@0 299 // it can be done in the same way as product_rw.
duke@0 300
ysr@352 301 #define RUNTIME_FLAGS(develop, develop_pd, product, product_pd, diagnostic, experimental, notproduct, manageable, product_rw, lp64_product) \
coleenp@108 302 \
coleenp@108 303 lp64_product(bool, UseCompressedOops, false, \
coleenp@108 304 "Use 32-bit object references in 64-bit VM. " \
coleenp@108 305 "lp64_product means flag is always constant in 32 bit VM") \
duke@0 306 \
kvn@619 307 notproduct(bool, CheckCompressedOops, true, \
kvn@619 308 "generate checks in encoding/decoding code in debug VM") \
kvn@619 309 \
kvn@619 310 product_pd(uintx, HeapBaseMinAddress, \
kvn@619 311 "OS specific low limit for heap base address") \
kvn@619 312 \
kvn@619 313 diagnostic(bool, PrintCompressedOopsMode, false, \
kvn@619 314 "Print compressed oops base address and encoding mode") \
coleenp@327 315 \
duke@0 316 /* UseMembar is theoretically a temp flag used for memory barrier \
duke@0 317 * removal testing. It was supposed to be removed before FCS but has \
duke@0 318 * been re-added (see 6401008) */ \
duke@0 319 product(bool, UseMembar, false, \
duke@0 320 "(Unstable) Issues membars on thread state transitions") \
duke@0 321 \
duke@0 322 product(bool, PrintCommandLineFlags, false, \
duke@0 323 "Prints flags that appeared on the command line") \
duke@0 324 \
duke@0 325 diagnostic(bool, UnlockDiagnosticVMOptions, trueInDebug, \
ysr@352 326 "Enable normal processing of flags relating to field diagnostics")\
ysr@352 327 \
ysr@352 328 experimental(bool, UnlockExperimentalVMOptions, false, \
ysr@352 329 "Enable normal processing of flags relating to experimental features")\
duke@0 330 \
duke@0 331 product(bool, JavaMonitorsInStackTrace, true, \
duke@0 332 "Print info. about Java monitor locks when the stacks are dumped")\
duke@0 333 \
duke@0 334 product_pd(bool, UseLargePages, \
duke@0 335 "Use large page memory") \
duke@0 336 \
jmasa@390 337 product_pd(bool, UseLargePagesIndividualAllocation, \
jmasa@390 338 "Allocate large pages individually for better affinity") \
jmasa@390 339 \
jmasa@390 340 develop(bool, LargePagesIndividualAllocationInjectError, false, \
jmasa@390 341 "Fail large pages individual allocation") \
jmasa@390 342 \
duke@0 343 develop(bool, TracePageSizes, false, \
duke@0 344 "Trace page size selection and usage.") \
duke@0 345 \
duke@0 346 product(bool, UseNUMA, false, \
duke@0 347 "Use NUMA if available") \
duke@0 348 \
iveresov@463 349 product(bool, ForceNUMA, false, \
iveresov@463 350 "Force NUMA optimizations on single-node/UMA systems") \
iveresov@463 351 \
duke@0 352 product(intx, NUMAChunkResizeWeight, 20, \
duke@0 353 "Percentage (0-100) used to weight the current sample when " \
duke@0 354 "computing exponentially decaying average for " \
duke@0 355 "AdaptiveNUMAChunkSizing") \
duke@0 356 \
duke@0 357 product(intx, NUMASpaceResizeRate, 1*G, \
duke@0 358 "Do not reallocate more that this amount per collection") \
duke@0 359 \
duke@0 360 product(bool, UseAdaptiveNUMAChunkSizing, true, \
duke@0 361 "Enable adaptive chunk sizing for NUMA") \
duke@0 362 \
duke@0 363 product(bool, NUMAStats, false, \
duke@0 364 "Print NUMA stats in detailed heap information") \
duke@0 365 \
duke@0 366 product(intx, NUMAPageScanRate, 256, \
duke@0 367 "Maximum number of pages to include in the page scan procedure") \
duke@0 368 \
duke@0 369 product_pd(bool, NeedsDeoptSuspend, \
duke@0 370 "True for register window machines (sparc/ia64)") \
duke@0 371 \
duke@0 372 product(intx, UseSSE, 99, \
duke@0 373 "Highest supported SSE instructions set on x86/x64") \
duke@0 374 \
duke@0 375 product(uintx, LargePageSizeInBytes, 0, \
duke@0 376 "Large page size (0 to let VM choose the page size") \
duke@0 377 \
duke@0 378 product(uintx, LargePageHeapSizeThreshold, 128*M, \
duke@0 379 "Use large pages if max heap is at least this big") \
duke@0 380 \
duke@0 381 product(bool, ForceTimeHighResolution, false, \
duke@0 382 "Using high time resolution(For Win32 only)") \
duke@0 383 \
duke@0 384 develop(bool, TraceItables, false, \
duke@0 385 "Trace initialization and use of itables") \
duke@0 386 \
duke@0 387 develop(bool, TracePcPatching, false, \
duke@0 388 "Trace usage of frame::patch_pc") \
duke@0 389 \
duke@0 390 develop(bool, TraceJumps, false, \
duke@0 391 "Trace assembly jumps in thread ring buffer") \
duke@0 392 \
duke@0 393 develop(bool, TraceRelocator, false, \
duke@0 394 "Trace the bytecode relocator") \
duke@0 395 \
duke@0 396 develop(bool, TraceLongCompiles, false, \
duke@0 397 "Print out every time compilation is longer than " \
duke@0 398 "a given threashold") \
duke@0 399 \
duke@0 400 develop(bool, SafepointALot, false, \
duke@0 401 "Generates a lot of safepoints. Works with " \
duke@0 402 "GuaranteedSafepointInterval") \
duke@0 403 \
duke@0 404 product_pd(bool, BackgroundCompilation, \
duke@0 405 "A thread requesting compilation is not blocked during " \
duke@0 406 "compilation") \
duke@0 407 \
duke@0 408 product(bool, PrintVMQWaitTime, false, \
duke@0 409 "Prints out the waiting time in VM operation queue") \
duke@0 410 \
duke@0 411 develop(bool, BailoutToInterpreterForThrows, false, \
duke@0 412 "Compiled methods which throws/catches exceptions will be " \
duke@0 413 "deopt and intp.") \
duke@0 414 \
duke@0 415 develop(bool, NoYieldsInMicrolock, false, \
duke@0 416 "Disable yields in microlock") \
duke@0 417 \
duke@0 418 develop(bool, TraceOopMapGeneration, false, \
duke@0 419 "Shows oopmap generation") \
duke@0 420 \
duke@0 421 product(bool, MethodFlushing, true, \
duke@0 422 "Reclamation of zombie and not-entrant methods") \
duke@0 423 \
duke@0 424 develop(bool, VerifyStack, false, \
duke@0 425 "Verify stack of each thread when it is entering a runtime call") \
duke@0 426 \
duke@0 427 develop(bool, ForceUnreachable, false, \
duke@0 428 "(amd64) Make all non code cache addresses to be unreachable with rip-rel forcing use of 64bit literal fixups") \
duke@0 429 \
duke@0 430 notproduct(bool, StressDerivedPointers, false, \
duke@0 431 "Force scavenge when a derived pointers is detected on stack " \
duke@0 432 "after rtm call") \
duke@0 433 \
duke@0 434 develop(bool, TraceDerivedPointers, false, \
duke@0 435 "Trace traversal of derived pointers on stack") \
duke@0 436 \
duke@0 437 notproduct(bool, TraceCodeBlobStacks, false, \
duke@0 438 "Trace stack-walk of codeblobs") \
duke@0 439 \
duke@0 440 product(bool, PrintJNIResolving, false, \
duke@0 441 "Used to implement -v:jni") \
duke@0 442 \
duke@0 443 notproduct(bool, PrintRewrites, false, \
duke@0 444 "Print methods that are being rewritten") \
duke@0 445 \
duke@0 446 product(bool, UseInlineCaches, true, \
duke@0 447 "Use Inline Caches for virtual calls ") \
duke@0 448 \
duke@0 449 develop(bool, InlineArrayCopy, true, \
duke@0 450 "inline arraycopy native that is known to be part of " \
duke@0 451 "base library DLL") \
duke@0 452 \
duke@0 453 develop(bool, InlineObjectHash, true, \
duke@0 454 "inline Object::hashCode() native that is known to be part " \
duke@0 455 "of base library DLL") \
duke@0 456 \
duke@0 457 develop(bool, InlineObjectCopy, true, \
duke@0 458 "inline Object.clone and Arrays.copyOf[Range] intrinsics") \
duke@0 459 \
duke@0 460 develop(bool, InlineNatives, true, \
duke@0 461 "inline natives that are known to be part of base library DLL") \
duke@0 462 \
duke@0 463 develop(bool, InlineMathNatives, true, \
duke@0 464 "inline SinD, CosD, etc.") \
duke@0 465 \
duke@0 466 develop(bool, InlineClassNatives, true, \
duke@0 467 "inline Class.isInstance, etc") \
duke@0 468 \
duke@0 469 develop(bool, InlineAtomicLong, true, \
duke@0 470 "inline sun.misc.AtomicLong") \
duke@0 471 \
duke@0 472 develop(bool, InlineThreadNatives, true, \
duke@0 473 "inline Thread.currentThread, etc") \
duke@0 474 \
duke@0 475 develop(bool, InlineReflectionGetCallerClass, true, \
duke@0 476 "inline sun.reflect.Reflection.getCallerClass(), known to be part "\
duke@0 477 "of base library DLL") \
duke@0 478 \
duke@0 479 develop(bool, InlineUnsafeOps, true, \
duke@0 480 "inline memory ops (native methods) from sun.misc.Unsafe") \
duke@0 481 \
duke@0 482 develop(bool, ConvertCmpD2CmpF, true, \
duke@0 483 "Convert cmpD to cmpF when one input is constant in float range") \
duke@0 484 \
duke@0 485 develop(bool, ConvertFloat2IntClipping, true, \
duke@0 486 "Convert float2int clipping idiom to integer clipping") \
duke@0 487 \
duke@0 488 develop(bool, SpecialStringCompareTo, true, \
duke@0 489 "special version of string compareTo") \
duke@0 490 \
duke@0 491 develop(bool, SpecialStringIndexOf, true, \
duke@0 492 "special version of string indexOf") \
duke@0 493 \
cfang@674 494 develop(bool, SpecialStringEquals, true, \
cfang@674 495 "special version of string equals") \
cfang@674 496 \
cfang@674 497 develop(bool, SpecialArraysEquals, true, \
rasbold@157 498 "special version of Arrays.equals(char[],char[])") \
rasbold@157 499 \
cfang@674 500 product(bool, UseSSE42Intrinsics, false, \
cfang@674 501 "SSE4.2 versions of intrinsics") \
cfang@674 502 \
duke@0 503 develop(bool, TraceCallFixup, false, \
duke@0 504 "traces all call fixups") \
duke@0 505 \
duke@0 506 develop(bool, DeoptimizeALot, false, \
duke@0 507 "deoptimize at every exit from the runtime system") \
duke@0 508 \
kvn@428 509 notproduct(ccstrlist, DeoptimizeOnlyAt, "", \
duke@0 510 "a comma separated list of bcis to deoptimize at") \
duke@0 511 \
duke@0 512 product(bool, DeoptimizeRandom, false, \
duke@0 513 "deoptimize random frames on random exit from the runtime system")\
duke@0 514 \
duke@0 515 notproduct(bool, ZombieALot, false, \
duke@0 516 "creates zombies (non-entrant) at exit from the runt. system") \
duke@0 517 \
duke@0 518 notproduct(bool, WalkStackALot, false, \
duke@0 519 "trace stack (no print) at every exit from the runtime system") \
duke@0 520 \
duke@0 521 develop(bool, Debugging, false, \
duke@0 522 "set when executing debug methods in debug.ccp " \
duke@0 523 "(to prevent triggering assertions)") \
duke@0 524 \
duke@0 525 notproduct(bool, StrictSafepointChecks, trueInDebug, \
duke@0 526 "Enable strict checks that safepoints cannot happen for threads " \
duke@0 527 "that used No_Safepoint_Verifier") \
duke@0 528 \
duke@0 529 notproduct(bool, VerifyLastFrame, false, \
duke@0 530 "Verify oops on last frame on entry to VM") \
duke@0 531 \
duke@0 532 develop(bool, TraceHandleAllocation, false, \
duke@0 533 "Prints out warnings when suspicious many handles are allocated") \
duke@0 534 \
duke@0 535 product(bool, UseCompilerSafepoints, true, \
duke@0 536 "Stop at safepoints in compiled code") \
duke@0 537 \
duke@0 538 product(bool, UseSplitVerifier, true, \
duke@0 539 "use split verifier with StackMapTable attributes") \
duke@0 540 \
duke@0 541 product(bool, FailOverToOldVerifier, true, \
duke@0 542 "fail over to old verifier when split verifier fails") \
duke@0 543 \
duke@0 544 develop(bool, ShowSafepointMsgs, false, \
duke@0 545 "Show msg. about safepoint synch.") \
duke@0 546 \
duke@0 547 product(bool, SafepointTimeout, false, \
duke@0 548 "Time out and warn or fail after SafepointTimeoutDelay " \
duke@0 549 "milliseconds if failed to reach safepoint") \
duke@0 550 \
duke@0 551 develop(bool, DieOnSafepointTimeout, false, \
duke@0 552 "Die upon failure to reach safepoint (see SafepointTimeout)") \
duke@0 553 \
duke@0 554 /* 50 retries * (5 * current_retry_count) millis = ~6.375 seconds */ \
duke@0 555 /* typically, at most a few retries are needed */ \
duke@0 556 product(intx, SuspendRetryCount, 50, \
duke@0 557 "Maximum retry count for an external suspend request") \
duke@0 558 \
duke@0 559 product(intx, SuspendRetryDelay, 5, \
duke@0 560 "Milliseconds to delay per retry (* current_retry_count)") \
duke@0 561 \
duke@0 562 product(bool, AssertOnSuspendWaitFailure, false, \
duke@0 563 "Assert/Guarantee on external suspend wait failure") \
duke@0 564 \
duke@0 565 product(bool, TraceSuspendWaitFailures, false, \
duke@0 566 "Trace external suspend wait failures") \
duke@0 567 \
duke@0 568 product(bool, MaxFDLimit, true, \
duke@0 569 "Bump the number of file descriptors to max in solaris.") \
duke@0 570 \
duke@0 571 notproduct(bool, LogEvents, trueInDebug, \
duke@0 572 "Enable Event log") \
duke@0 573 \
duke@0 574 product(bool, BytecodeVerificationRemote, true, \
duke@0 575 "Enables the Java bytecode verifier for remote classes") \
duke@0 576 \
duke@0 577 product(bool, BytecodeVerificationLocal, false, \
duke@0 578 "Enables the Java bytecode verifier for local classes") \
duke@0 579 \
duke@0 580 develop(bool, ForceFloatExceptions, trueInDebug, \
duke@0 581 "Force exceptions on FP stack under/overflow") \
duke@0 582 \
duke@0 583 develop(bool, SoftMatchFailure, trueInProduct, \
duke@0 584 "If the DFA fails to match a node, print a message and bail out") \
duke@0 585 \
duke@0 586 develop(bool, VerifyStackAtCalls, false, \
duke@0 587 "Verify that the stack pointer is unchanged after calls") \
duke@0 588 \
duke@0 589 develop(bool, TraceJavaAssertions, false, \
duke@0 590 "Trace java language assertions") \
duke@0 591 \
duke@0 592 notproduct(bool, CheckAssertionStatusDirectives, false, \
duke@0 593 "temporary - see javaClasses.cpp") \
duke@0 594 \
duke@0 595 notproduct(bool, PrintMallocFree, false, \
duke@0 596 "Trace calls to C heap malloc/free allocation") \
duke@0 597 \
duke@0 598 notproduct(bool, PrintOopAddress, false, \
duke@0 599 "Always print the location of the oop") \
duke@0 600 \
duke@0 601 notproduct(bool, VerifyCodeCacheOften, false, \
duke@0 602 "Verify compiled-code cache often") \
duke@0 603 \
duke@0 604 develop(bool, ZapDeadCompiledLocals, false, \
duke@0 605 "Zap dead locals in compiler frames") \
duke@0 606 \
duke@0 607 notproduct(bool, ZapDeadLocalsOld, false, \
duke@0 608 "Zap dead locals (old version, zaps all frames when " \
duke@0 609 "entering the VM") \
duke@0 610 \
duke@0 611 notproduct(bool, CheckOopishValues, false, \
duke@0 612 "Warn if value contains oop ( requires ZapDeadLocals)") \
duke@0 613 \
duke@0 614 develop(bool, UseMallocOnly, false, \
duke@0 615 "use only malloc/free for allocation (no resource area/arena)") \
duke@0 616 \
duke@0 617 develop(bool, PrintMalloc, false, \
duke@0 618 "print all malloc/free calls") \
duke@0 619 \
duke@0 620 develop(bool, ZapResourceArea, trueInDebug, \
duke@0 621 "Zap freed resource/arena space with 0xABABABAB") \
duke@0 622 \
duke@0 623 notproduct(bool, ZapVMHandleArea, trueInDebug, \
duke@0 624 "Zap freed VM handle space with 0xBCBCBCBC") \
duke@0 625 \
duke@0 626 develop(bool, ZapJNIHandleArea, trueInDebug, \
duke@0 627 "Zap freed JNI handle space with 0xFEFEFEFE") \
duke@0 628 \
jmasa@264 629 develop(bool, ZapUnusedHeapArea, trueInDebug, \
duke@0 630 "Zap unused heap space with 0xBAADBABE") \
duke@0 631 \
jmasa@264 632 develop(bool, TraceZapUnusedHeapArea, false, \
jmasa@264 633 "Trace zapping of unused heap space") \
jmasa@264 634 \
jmasa@264 635 develop(bool, CheckZapUnusedHeapArea, false, \
jmasa@264 636 "Check zapping of unused heap space") \
jmasa@264 637 \
jcoomes@481 638 develop(bool, ZapFillerObjects, trueInDebug, \
jcoomes@481 639 "Zap filler objects with 0xDEAFBABE") \
jcoomes@481 640 \
duke@0 641 develop(bool, PrintVMMessages, true, \
duke@0 642 "Print vm messages on console") \
duke@0 643 \
duke@0 644 product(bool, PrintGCApplicationConcurrentTime, false, \
duke@0 645 "Print the time the application has been running") \
duke@0 646 \
duke@0 647 product(bool, PrintGCApplicationStoppedTime, false, \
duke@0 648 "Print the time the application has been stopped") \
duke@0 649 \
duke@0 650 develop(bool, Verbose, false, \
duke@0 651 "Prints additional debugging information from other modes") \
duke@0 652 \
duke@0 653 develop(bool, PrintMiscellaneous, false, \
duke@0 654 "Prints uncategorized debugging information (requires +Verbose)") \
duke@0 655 \
duke@0 656 develop(bool, WizardMode, false, \
duke@0 657 "Prints much more debugging information") \
duke@0 658 \
duke@0 659 product(bool, ShowMessageBoxOnError, false, \
duke@0 660 "Keep process alive on VM fatal error") \
duke@0 661 \
duke@0 662 product_pd(bool, UseOSErrorReporting, \
duke@0 663 "Let VM fatal error propagate to the OS (ie. WER on Windows)") \
duke@0 664 \
duke@0 665 product(bool, SuppressFatalErrorMessage, false, \
duke@0 666 "Do NO Fatal Error report [Avoid deadlock]") \
duke@0 667 \
duke@0 668 product(ccstrlist, OnError, "", \
duke@0 669 "Run user-defined commands on fatal error; see VMError.cpp " \
duke@0 670 "for examples") \
duke@0 671 \
duke@0 672 product(ccstrlist, OnOutOfMemoryError, "", \
duke@0 673 "Run user-defined commands on first java.lang.OutOfMemoryError") \
duke@0 674 \
ysr@611 675 manageable(bool, HeapDumpBeforeFullGC, false, \
ysr@611 676 "Dump heap to file before any major stop-world GC") \
ysr@611 677 \
ysr@611 678 manageable(bool, HeapDumpAfterFullGC, false, \
ysr@611 679 "Dump heap to file after any major stop-world GC") \
ysr@611 680 \
duke@0 681 manageable(bool, HeapDumpOnOutOfMemoryError, false, \
duke@0 682 "Dump heap to file when java.lang.OutOfMemoryError is thrown") \
duke@0 683 \
duke@0 684 manageable(ccstr, HeapDumpPath, NULL, \
duke@0 685 "When HeapDumpOnOutOfMemoryError is on, the path (filename or" \
duke@0 686 "directory) of the dump file (defaults to java_pid<pid>.hprof" \
duke@0 687 "in the working directory)") \
duke@0 688 \
duke@0 689 develop(uintx, SegmentedHeapDumpThreshold, 2*G, \
duke@0 690 "Generate a segmented heap dump (JAVA PROFILE 1.0.2 format) " \
duke@0 691 "when the heap usage is larger than this") \
duke@0 692 \
duke@0 693 develop(uintx, HeapDumpSegmentSize, 1*G, \
duke@0 694 "Approximate segment size when generating a segmented heap dump") \
duke@0 695 \
duke@0 696 develop(bool, BreakAtWarning, false, \
duke@0 697 "Execute breakpoint upon encountering VM warning") \
duke@0 698 \
duke@0 699 product_pd(bool, UseVectoredExceptions, \
duke@0 700 "Temp Flag - Use Vectored Exceptions rather than SEH (Windows Only)") \
duke@0 701 \
duke@0 702 develop(bool, TraceVMOperation, false, \
duke@0 703 "Trace vm operations") \
duke@0 704 \
duke@0 705 develop(bool, UseFakeTimers, false, \
duke@0 706 "Tells whether the VM should use system time or a fake timer") \
duke@0 707 \
duke@0 708 diagnostic(bool, LogCompilation, false, \
duke@0 709 "Log compilation activity in detail to hotspot.log or LogFile") \
duke@0 710 \
duke@0 711 product(bool, PrintCompilation, false, \
duke@0 712 "Print compilations") \
duke@0 713 \
duke@0 714 diagnostic(bool, TraceNMethodInstalls, false, \
duke@0 715 "Trace nmethod intallation") \
duke@0 716 \
duke@0 717 diagnostic(bool, TraceOSRBreakpoint, false, \
duke@0 718 "Trace OSR Breakpoint ") \
duke@0 719 \
duke@0 720 diagnostic(bool, TraceCompileTriggered, false, \
duke@0 721 "Trace compile triggered") \
duke@0 722 \
duke@0 723 diagnostic(bool, TraceTriggers, false, \
duke@0 724 "Trace triggers") \
duke@0 725 \
duke@0 726 product(bool, AlwaysRestoreFPU, false, \
duke@0 727 "Restore the FPU control word after every JNI call (expensive)") \
duke@0 728 \
duke@0 729 notproduct(bool, PrintCompilation2, false, \
duke@0 730 "Print additional statistics per compilation") \
duke@0 731 \
jrose@78 732 diagnostic(bool, PrintAdapterHandlers, false, \
duke@0 733 "Print code generated for i2c/c2i adapters") \
duke@0 734 \
jrose@78 735 diagnostic(bool, PrintAssembly, false, \
jrose@78 736 "Print assembly code (using external disassembler.so)") \
jrose@78 737 \
never@337 738 diagnostic(ccstr, PrintAssemblyOptions, NULL, \
jrose@78 739 "Options string passed to disassembler.so") \
jrose@78 740 \
jrose@78 741 diagnostic(bool, PrintNMethods, false, \
duke@0 742 "Print assembly code for nmethods when generated") \
duke@0 743 \
jrose@78 744 diagnostic(bool, PrintNativeNMethods, false, \
duke@0 745 "Print assembly code for native nmethods when generated") \
duke@0 746 \
duke@0 747 develop(bool, PrintDebugInfo, false, \
duke@0 748 "Print debug information for all nmethods when generated") \
duke@0 749 \
duke@0 750 develop(bool, PrintRelocations, false, \
duke@0 751 "Print relocation information for all nmethods when generated") \
duke@0 752 \
duke@0 753 develop(bool, PrintDependencies, false, \
duke@0 754 "Print dependency information for all nmethods when generated") \
duke@0 755 \
duke@0 756 develop(bool, PrintExceptionHandlers, false, \
duke@0 757 "Print exception handler tables for all nmethods when generated") \
duke@0 758 \
duke@0 759 develop(bool, InterceptOSException, false, \
duke@0 760 "Starts debugger when an implicit OS (e.g., NULL) " \
duke@0 761 "exception happens") \
duke@0 762 \
duke@0 763 notproduct(bool, PrintCodeCache, false, \
duke@0 764 "Print the compiled_code cache when exiting") \
duke@0 765 \
duke@0 766 develop(bool, PrintCodeCache2, false, \
duke@0 767 "Print detailed info on the compiled_code cache when exiting") \
duke@0 768 \
jrose@78 769 diagnostic(bool, PrintStubCode, false, \
duke@0 770 "Print generated stub code") \
duke@0 771 \
duke@0 772 product(bool, StackTraceInThrowable, true, \
duke@0 773 "Collect backtrace in throwable when exception happens") \
duke@0 774 \
duke@0 775 product(bool, OmitStackTraceInFastThrow, true, \
duke@0 776 "Omit backtraces for some 'hot' exceptions in optimized code") \
duke@0 777 \
duke@0 778 product(bool, ProfilerPrintByteCodeStatistics, false, \
duke@0 779 "Prints byte code statictics when dumping profiler output") \
duke@0 780 \
duke@0 781 product(bool, ProfilerRecordPC, false, \
duke@0 782 "Collects tick for each 16 byte interval of compiled code") \
duke@0 783 \
duke@0 784 product(bool, ProfileVM, false, \
duke@0 785 "Profiles ticks that fall within VM (either in the VM Thread " \
duke@0 786 "or VM code called through stubs)") \
duke@0 787 \
duke@0 788 product(bool, ProfileIntervals, false, \
duke@0 789 "Prints profiles for each interval (see ProfileIntervalsTicks)") \
duke@0 790 \
duke@0 791 notproduct(bool, ProfilerCheckIntervals, false, \
duke@0 792 "Collect and print info on spacing of profiler ticks") \
duke@0 793 \
duke@0 794 develop(bool, PrintJVMWarnings, false, \
duke@0 795 "Prints warnings for unimplemented JVM functions") \
duke@0 796 \
duke@0 797 notproduct(uintx, WarnOnStalledSpinLock, 0, \
duke@0 798 "Prints warnings for stalled SpinLocks") \
duke@0 799 \
duke@0 800 develop(bool, InitializeJavaLangSystem, true, \
duke@0 801 "Initialize java.lang.System - turn off for individual " \
duke@0 802 "method debugging") \
duke@0 803 \
duke@0 804 develop(bool, InitializeJavaLangString, true, \
duke@0 805 "Initialize java.lang.String - turn off for individual " \
duke@0 806 "method debugging") \
duke@0 807 \
duke@0 808 develop(bool, InitializeJavaLangExceptionsErrors, true, \
duke@0 809 "Initialize various error and exception classes - turn off for " \
duke@0 810 "individual method debugging") \
duke@0 811 \
duke@0 812 product(bool, RegisterFinalizersAtInit, true, \
duke@0 813 "Register finalizable objects at end of Object.<init> or " \
duke@0 814 "after allocation.") \
duke@0 815 \
duke@0 816 develop(bool, RegisterReferences, true, \
duke@0 817 "Tells whether the VM should register soft/weak/final/phantom " \
duke@0 818 "references") \
duke@0 819 \
duke@0 820 develop(bool, IgnoreRewrites, false, \
duke@0 821 "Supress rewrites of bytecodes in the oopmap generator. " \
duke@0 822 "This is unsafe!") \
duke@0 823 \
duke@0 824 develop(bool, PrintCodeCacheExtension, false, \
duke@0 825 "Print extension of code cache") \
duke@0 826 \
duke@0 827 develop(bool, UsePrivilegedStack, true, \
duke@0 828 "Enable the security JVM functions") \
duke@0 829 \
duke@0 830 develop(bool, IEEEPrecision, true, \
duke@0 831 "Enables IEEE precision (for INTEL only)") \
duke@0 832 \
duke@0 833 develop(bool, ProtectionDomainVerification, true, \
duke@0 834 "Verifies protection domain before resolution in system " \
duke@0 835 "dictionary") \
duke@0 836 \
duke@0 837 product(bool, ClassUnloading, true, \
duke@0 838 "Do unloading of classes") \
duke@0 839 \
jrose@461 840 diagnostic(bool, LinkWellKnownClasses, false, \
jrose@131 841 "Resolve a well known class as soon as its name is seen") \
jrose@131 842 \
duke@0 843 develop(bool, DisableStartThread, false, \
duke@0 844 "Disable starting of additional Java threads " \
duke@0 845 "(for debugging only)") \
duke@0 846 \
duke@0 847 develop(bool, MemProfiling, false, \
duke@0 848 "Write memory usage profiling to log file") \
duke@0 849 \
duke@0 850 notproduct(bool, PrintSystemDictionaryAtExit, false, \
duke@0 851 "Prints the system dictionary at exit") \
duke@0 852 \
duke@0 853 diagnostic(bool, UnsyncloadClass, false, \
acorn@530 854 "Unstable: VM calls loadClass unsynchronized. Custom " \
acorn@530 855 "class loader must call VM synchronized for findClass " \
acorn@530 856 "and defineClass.") \
acorn@530 857 \
acorn@530 858 product(bool, AlwaysLockClassLoader, false, \
acorn@530 859 "Require the VM to acquire the class loader lock before calling " \
acorn@530 860 "loadClass() even for class loaders registering " \
acorn@530 861 "as parallel capable. Default false. ") \
acorn@530 862 \
acorn@530 863 product(bool, AllowParallelDefineClass, false, \
acorn@530 864 "Allow parallel defineClass requests for class loaders " \
acorn@530 865 "registering as parallel capable. Default false") \
acorn@530 866 \
acorn@530 867 product(bool, MustCallLoadClassInternal, false, \
acorn@530 868 "Call loadClassInternal() rather than loadClass().Default false") \
duke@0 869 \
duke@0 870 product_pd(bool, DontYieldALot, \
duke@0 871 "Throw away obvious excess yield calls (for SOLARIS only)") \
duke@0 872 \
duke@0 873 product_pd(bool, ConvertSleepToYield, \
duke@0 874 "Converts sleep(0) to thread yield " \
duke@0 875 "(may be off for SOLARIS to improve GUI)") \
duke@0 876 \
duke@0 877 product(bool, ConvertYieldToSleep, false, \
duke@0 878 "Converts yield to a sleep of MinSleepInterval to simulate Win32 "\
duke@0 879 "behavior (SOLARIS only)") \
duke@0 880 \
duke@0 881 product(bool, UseBoundThreads, true, \
duke@0 882 "Bind user level threads to kernel threads (for SOLARIS only)") \
duke@0 883 \
duke@0 884 develop(bool, UseDetachedThreads, true, \
duke@0 885 "Use detached threads that are recycled upon termination " \
duke@0 886 "(for SOLARIS only)") \
duke@0 887 \
duke@0 888 product(bool, UseLWPSynchronization, true, \
duke@0 889 "Use LWP-based instead of libthread-based synchronization " \
duke@0 890 "(SPARC only)") \
duke@0 891 \
never@337 892 product(ccstr, SyncKnobs, NULL, \
duke@0 893 "(Unstable) Various monitor synchronization tunables") \
duke@0 894 \
duke@0 895 product(intx, EmitSync, 0, \
duke@0 896 "(Unsafe,Unstable) " \
duke@0 897 " Controls emission of inline sync fast-path code") \
duke@0 898 \
duke@0 899 product(intx, AlwaysInflate, 0, "(Unstable) Force inflation") \
duke@0 900 \
duke@0 901 product(intx, Atomics, 0, \
duke@0 902 "(Unsafe,Unstable) Diagnostic - Controls emission of atomics") \
duke@0 903 \
duke@0 904 product(intx, FenceInstruction, 0, \
duke@0 905 "(Unsafe,Unstable) Experimental") \
duke@0 906 \
duke@0 907 product(intx, SyncFlags, 0, "(Unsafe,Unstable) Experimental Sync flags" ) \
duke@0 908 \
duke@0 909 product(intx, SyncVerbose, 0, "(Unstable)" ) \
duke@0 910 \
duke@0 911 product(intx, ClearFPUAtPark, 0, "(Unsafe,Unstable)" ) \
duke@0 912 \
duke@0 913 product(intx, hashCode, 0, \
duke@0 914 "(Unstable) select hashCode generation algorithm" ) \
duke@0 915 \
duke@0 916 product(intx, WorkAroundNPTLTimedWaitHang, 1, \
duke@0 917 "(Unstable, Linux-specific)" \
duke@0 918 " avoid NPTL-FUTEX hang pthread_cond_timedwait" ) \
duke@0 919 \
duke@0 920 product(bool, FilterSpuriousWakeups , true, \
duke@0 921 "Prevent spurious or premature wakeups from object.wait" \
duke@0 922 "(Solaris only)") \
duke@0 923 \
duke@0 924 product(intx, NativeMonitorTimeout, -1, "(Unstable)" ) \
duke@0 925 product(intx, NativeMonitorFlags, 0, "(Unstable)" ) \
duke@0 926 product(intx, NativeMonitorSpinLimit, 20, "(Unstable)" ) \
duke@0 927 \
duke@0 928 develop(bool, UsePthreads, false, \
duke@0 929 "Use pthread-based instead of libthread-based synchronization " \
duke@0 930 "(SPARC only)") \
duke@0 931 \
duke@0 932 product(bool, AdjustConcurrency, false, \
duke@0 933 "call thr_setconcurrency at thread create time to avoid " \
duke@0 934 "LWP starvation on MP systems (For Solaris Only)") \
duke@0 935 \
duke@0 936 develop(bool, UpdateHotSpotCompilerFileOnError, true, \
duke@0 937 "Should the system attempt to update the compiler file when " \
duke@0 938 "an error occurs?") \
duke@0 939 \
duke@0 940 product(bool, ReduceSignalUsage, false, \
duke@0 941 "Reduce the use of OS signals in Java and/or the VM") \
duke@0 942 \
duke@0 943 notproduct(bool, ValidateMarkSweep, false, \
duke@0 944 "Do extra validation during MarkSweep collection") \
duke@0 945 \
duke@0 946 notproduct(bool, RecordMarkSweepCompaction, false, \
duke@0 947 "Enable GC-to-GC recording and querying of compaction during " \
duke@0 948 "MarkSweep") \
duke@0 949 \
duke@0 950 develop_pd(bool, ShareVtableStubs, \
duke@0 951 "Share vtable stubs (smaller code but worse branch prediction") \
duke@0 952 \
duke@0 953 develop(bool, LoadLineNumberTables, true, \
duke@0 954 "Tells whether the class file parser loads line number tables") \
duke@0 955 \
duke@0 956 develop(bool, LoadLocalVariableTables, true, \
duke@0 957 "Tells whether the class file parser loads local variable tables")\
duke@0 958 \
duke@0 959 develop(bool, LoadLocalVariableTypeTables, true, \
duke@0 960 "Tells whether the class file parser loads local variable type tables")\
duke@0 961 \
duke@0 962 product(bool, AllowUserSignalHandlers, false, \
duke@0 963 "Do not complain if the application installs signal handlers " \
duke@0 964 "(Solaris & Linux only)") \
duke@0 965 \
duke@0 966 product(bool, UseSignalChaining, true, \
duke@0 967 "Use signal-chaining to invoke signal handlers installed " \
duke@0 968 "by the application (Solaris & Linux only)") \
duke@0 969 \
duke@0 970 product(bool, UseAltSigs, false, \
duke@0 971 "Use alternate signals instead of SIGUSR1 & SIGUSR2 for VM " \
duke@0 972 "internal signals. (Solaris only)") \
duke@0 973 \
duke@0 974 product(bool, UseSpinning, false, \
duke@0 975 "Use spinning in monitor inflation and before entry") \
duke@0 976 \
duke@0 977 product(bool, PreSpinYield, false, \
duke@0 978 "Yield before inner spinning loop") \
duke@0 979 \
duke@0 980 product(bool, PostSpinYield, true, \
duke@0 981 "Yield after inner spinning loop") \
duke@0 982 \
duke@0 983 product(bool, AllowJNIEnvProxy, false, \
duke@0 984 "Allow JNIEnv proxies for jdbx") \
duke@0 985 \
duke@0 986 product(bool, JNIDetachReleasesMonitors, true, \
duke@0 987 "JNI DetachCurrentThread releases monitors owned by thread") \
duke@0 988 \
duke@0 989 product(bool, RestoreMXCSROnJNICalls, false, \
duke@0 990 "Restore MXCSR when returning from JNI calls") \
duke@0 991 \
duke@0 992 product(bool, CheckJNICalls, false, \
duke@0 993 "Verify all arguments to JNI calls") \
duke@0 994 \
duke@0 995 product(bool, UseFastJNIAccessors, true, \
duke@0 996 "Use optimized versions of Get<Primitive>Field") \
duke@0 997 \
duke@0 998 product(bool, EagerXrunInit, false, \
duke@0 999 "Eagerly initialize -Xrun libraries; allows startup profiling, " \
duke@0 1000 " but not all -Xrun libraries may support the state of the VM at this time") \
duke@0 1001 \
duke@0 1002 product(bool, PreserveAllAnnotations, false, \
duke@0 1003 "Preserve RuntimeInvisibleAnnotations as well as RuntimeVisibleAnnotations") \
duke@0 1004 \
duke@0 1005 develop(uintx, PreallocatedOutOfMemoryErrorCount, 4, \
duke@0 1006 "Number of OutOfMemoryErrors preallocated with backtrace") \
duke@0 1007 \
duke@0 1008 product(bool, LazyBootClassLoader, true, \
duke@0 1009 "Enable/disable lazy opening of boot class path entries") \
duke@0 1010 \
duke@0 1011 diagnostic(bool, UseIncDec, true, \
duke@0 1012 "Use INC, DEC instructions on x86") \
duke@0 1013 \
kvn@215 1014 product(bool, UseNewLongLShift, false, \
kvn@215 1015 "Use optimized bitwise shift left") \
kvn@215 1016 \
duke@0 1017 product(bool, UseStoreImmI16, true, \
duke@0 1018 "Use store immediate 16-bits value instruction on x86") \
duke@0 1019 \
duke@0 1020 product(bool, UseAddressNop, false, \
duke@0 1021 "Use '0F 1F [addr]' NOP instructions on x86 cpus") \
duke@0 1022 \
duke@0 1023 product(bool, UseXmmLoadAndClearUpper, true, \
duke@0 1024 "Load low part of XMM register and clear upper part") \
duke@0 1025 \
duke@0 1026 product(bool, UseXmmRegToRegMoveAll, false, \
duke@0 1027 "Copy all XMM register bits when moving value between registers") \
duke@0 1028 \
kvn@54 1029 product(bool, UseXmmI2D, false, \
kvn@54 1030 "Use SSE2 CVTDQ2PD instruction to convert Integer to Double") \
kvn@54 1031 \
kvn@54 1032 product(bool, UseXmmI2F, false, \
kvn@54 1033 "Use SSE2 CVTDQ2PS instruction to convert Integer to Float") \
kvn@54 1034 \
kvn@387 1035 product(bool, UseXMMForArrayCopy, false, \
kvn@387 1036 "Use SSE2 MOVQ instruction for Arraycopy") \
kvn@387 1037 \
kvn@387 1038 product(bool, UseUnalignedLoadStores, false, \
kvn@387 1039 "Use SSE2 MOVDQU instruction for Arraycopy") \
kvn@387 1040 \
duke@0 1041 product(intx, FieldsAllocationStyle, 1, \
duke@0 1042 "0 - type based with oops first, 1 - with oops last") \
duke@0 1043 \
duke@0 1044 product(bool, CompactFields, true, \
duke@0 1045 "Allocate nonstatic fields in gaps between previous fields") \
duke@0 1046 \
duke@0 1047 notproduct(bool, PrintCompactFieldsSavings, false, \
duke@0 1048 "Print how many words were saved with CompactFields") \
duke@0 1049 \
duke@0 1050 product(bool, UseBiasedLocking, true, \
duke@0 1051 "Enable biased locking in JVM") \
duke@0 1052 \
duke@0 1053 product(intx, BiasedLockingStartupDelay, 4000, \
duke@0 1054 "Number of milliseconds to wait before enabling biased locking") \
duke@0 1055 \
duke@0 1056 diagnostic(bool, PrintBiasedLockingStatistics, false, \
duke@0 1057 "Print statistics of biased locking in JVM") \
duke@0 1058 \
duke@0 1059 product(intx, BiasedLockingBulkRebiasThreshold, 20, \
duke@0 1060 "Threshold of number of revocations per type to try to " \
duke@0 1061 "rebias all objects in the heap of that type") \
duke@0 1062 \
duke@0 1063 product(intx, BiasedLockingBulkRevokeThreshold, 40, \
duke@0 1064 "Threshold of number of revocations per type to permanently " \
duke@0 1065 "revoke biases of all objects in the heap of that type") \
duke@0 1066 \
duke@0 1067 product(intx, BiasedLockingDecayTime, 25000, \
duke@0 1068 "Decay time (in milliseconds) to re-enable bulk rebiasing of a " \
duke@0 1069 "type after previous bulk rebias") \
duke@0 1070 \
duke@0 1071 /* tracing */ \
duke@0 1072 \
duke@0 1073 notproduct(bool, TraceRuntimeCalls, false, \
duke@0 1074 "Trace run-time calls") \
duke@0 1075 \
duke@0 1076 develop(bool, TraceJNICalls, false, \
duke@0 1077 "Trace JNI calls") \
duke@0 1078 \
duke@0 1079 notproduct(bool, TraceJVMCalls, false, \
duke@0 1080 "Trace JVM calls") \
duke@0 1081 \
never@337 1082 product(ccstr, TraceJVMTI, NULL, \
duke@0 1083 "Trace flags for JVMTI functions and events") \
duke@0 1084 \
duke@0 1085 /* This option can change an EMCP method into an obsolete method. */ \
duke@0 1086 /* This can affect tests that except specific methods to be EMCP. */ \
duke@0 1087 /* This option should be used with caution. */ \
duke@0 1088 product(bool, StressLdcRewrite, false, \
duke@0 1089 "Force ldc -> ldc_w rewrite during RedefineClasses") \
duke@0 1090 \
duke@0 1091 product(intx, TraceRedefineClasses, 0, \
duke@0 1092 "Trace level for JVMTI RedefineClasses") \
duke@0 1093 \
duke@0 1094 /* change to false by default sometime after Mustang */ \
duke@0 1095 product(bool, VerifyMergedCPBytecodes, true, \
duke@0 1096 "Verify bytecodes after RedefineClasses constant pool merging") \
duke@0 1097 \
duke@0 1098 develop(bool, TraceJNIHandleAllocation, false, \
duke@0 1099 "Trace allocation/deallocation of JNI handle blocks") \
duke@0 1100 \
duke@0 1101 develop(bool, TraceThreadEvents, false, \
duke@0 1102 "Trace all thread events") \
duke@0 1103 \
duke@0 1104 develop(bool, TraceBytecodes, false, \
duke@0 1105 "Trace bytecode execution") \
duke@0 1106 \
duke@0 1107 develop(bool, TraceClassInitialization, false, \
duke@0 1108 "Trace class initialization") \
duke@0 1109 \
duke@0 1110 develop(bool, TraceExceptions, false, \
duke@0 1111 "Trace exceptions") \
duke@0 1112 \
duke@0 1113 develop(bool, TraceICs, false, \
duke@0 1114 "Trace inline cache changes") \
duke@0 1115 \
duke@0 1116 notproduct(bool, TraceInvocationCounterOverflow, false, \
duke@0 1117 "Trace method invocation counter overflow") \
duke@0 1118 \
duke@0 1119 develop(bool, TraceInlineCacheClearing, false, \
duke@0 1120 "Trace clearing of inline caches in nmethods") \
duke@0 1121 \
duke@0 1122 develop(bool, TraceDependencies, false, \
duke@0 1123 "Trace dependencies") \
duke@0 1124 \
duke@0 1125 develop(bool, VerifyDependencies, trueInDebug, \
duke@0 1126 "Exercise and verify the compilation dependency mechanism") \
duke@0 1127 \
duke@0 1128 develop(bool, TraceNewOopMapGeneration, false, \
duke@0 1129 "Trace OopMapGeneration") \
duke@0 1130 \
duke@0 1131 develop(bool, TraceNewOopMapGenerationDetailed, false, \
duke@0 1132 "Trace OopMapGeneration: print detailed cell states") \
duke@0 1133 \
duke@0 1134 develop(bool, TimeOopMap, false, \
duke@0 1135 "Time calls to GenerateOopMap::compute_map() in sum") \
duke@0 1136 \
duke@0 1137 develop(bool, TimeOopMap2, false, \
duke@0 1138 "Time calls to GenerateOopMap::compute_map() individually") \
duke@0 1139 \
duke@0 1140 develop(bool, TraceMonitorMismatch, false, \
duke@0 1141 "Trace monitor matching failures during OopMapGeneration") \
duke@0 1142 \
duke@0 1143 develop(bool, TraceOopMapRewrites, false, \
duke@0 1144 "Trace rewritting of method oops during oop map generation") \
duke@0 1145 \
duke@0 1146 develop(bool, TraceSafepoint, false, \
duke@0 1147 "Trace safepoint operations") \
duke@0 1148 \
duke@0 1149 develop(bool, TraceICBuffer, false, \
duke@0 1150 "Trace usage of IC buffer") \
duke@0 1151 \
duke@0 1152 develop(bool, TraceCompiledIC, false, \
duke@0 1153 "Trace changes of compiled IC") \
duke@0 1154 \
duke@0 1155 notproduct(bool, TraceZapDeadLocals, false, \
duke@0 1156 "Trace zapping dead locals") \
duke@0 1157 \
duke@0 1158 develop(bool, TraceStartupTime, false, \
duke@0 1159 "Trace setup time") \
duke@0 1160 \
duke@0 1161 develop(bool, TraceHPI, false, \
duke@0 1162 "Trace Host Porting Interface (HPI)") \
duke@0 1163 \
duke@0 1164 product(ccstr, HPILibPath, NULL, \
duke@0 1165 "Specify alternate path to HPI library") \
duke@0 1166 \
duke@0 1167 develop(bool, TraceProtectionDomainVerification, false, \
duke@0 1168 "Trace protection domain verifcation") \
duke@0 1169 \
duke@0 1170 develop(bool, TraceClearedExceptions, false, \
duke@0 1171 "Prints when an exception is forcibly cleared") \
duke@0 1172 \
duke@0 1173 product(bool, TraceClassResolution, false, \
duke@0 1174 "Trace all constant pool resolutions (for debugging)") \
duke@0 1175 \
duke@0 1176 product(bool, TraceBiasedLocking, false, \
duke@0 1177 "Trace biased locking in JVM") \
duke@0 1178 \
duke@0 1179 product(bool, TraceMonitorInflation, false, \
duke@0 1180 "Trace monitor inflation in JVM") \
duke@0 1181 \
duke@0 1182 /* assembler */ \
duke@0 1183 product(bool, Use486InstrsOnly, false, \
duke@0 1184 "Use 80486 Compliant instruction subset") \
duke@0 1185 \
duke@0 1186 /* gc */ \
duke@0 1187 \
duke@0 1188 product(bool, UseSerialGC, false, \
ysr@344 1189 "Use the serial garbage collector") \
ysr@344 1190 \
ysr@352 1191 experimental(bool, UseG1GC, false, \
ysr@344 1192 "Use the Garbage-First garbage collector") \
duke@0 1193 \
duke@0 1194 product(bool, UseParallelGC, false, \
duke@0 1195 "Use the Parallel Scavenge garbage collector") \
duke@0 1196 \
duke@0 1197 product(bool, UseParallelOldGC, false, \
duke@0 1198 "Use the Parallel Old garbage collector") \
duke@0 1199 \
duke@0 1200 product(bool, UseParallelOldGCCompacting, true, \
duke@0 1201 "In the Parallel Old garbage collector use parallel compaction") \
duke@0 1202 \
duke@0 1203 product(bool, UseParallelDensePrefixUpdate, true, \
duke@0 1204 "In the Parallel Old garbage collector use parallel dense" \
duke@0 1205 " prefix update") \
duke@0 1206 \
duke@0 1207 product(uintx, HeapMaximumCompactionInterval, 20, \
duke@0 1208 "How often should we maximally compact the heap (not allowing " \
duke@0 1209 "any dead space)") \
duke@0 1210 \
duke@0 1211 product(uintx, HeapFirstMaximumCompactionCount, 3, \
duke@0 1212 "The collection count for the first maximum compaction") \
duke@0 1213 \
duke@0 1214 product(bool, UseMaximumCompactionOnSystemGC, true, \
duke@0 1215 "In the Parallel Old garbage collector maximum compaction for " \
duke@0 1216 "a system GC") \
duke@0 1217 \
duke@0 1218 product(uintx, ParallelOldDeadWoodLimiterMean, 50, \
duke@0 1219 "The mean used by the par compact dead wood" \
duke@0 1220 "limiter (a number between 0-100).") \
duke@0 1221 \
duke@0 1222 product(uintx, ParallelOldDeadWoodLimiterStdDev, 80, \
duke@0 1223 "The standard deviation used by the par compact dead wood" \
duke@0 1224 "limiter (a number between 0-100).") \
duke@0 1225 \
duke@0 1226 product(bool, UseParallelOldGCDensePrefix, true, \
duke@0 1227 "Use a dense prefix with the Parallel Old garbage collector") \
duke@0 1228 \
duke@0 1229 product(uintx, ParallelGCThreads, 0, \
duke@0 1230 "Number of parallel threads parallel gc will use") \
duke@0 1231 \
duke@0 1232 product(uintx, ParallelCMSThreads, 0, \
duke@0 1233 "Max number of threads CMS will use for concurrent work") \
duke@0 1234 \
jcoomes@483 1235 develop(bool, ParallelOldGCSplitALot, false, \
jcoomes@483 1236 "Provoke splitting (copying data from a young gen space to" \
jcoomes@483 1237 "multiple destination spaces)") \
jcoomes@483 1238 \
jcoomes@483 1239 develop(uintx, ParallelOldGCSplitInterval, 3, \
jcoomes@483 1240 "How often to provoke splitting a young gen space") \
duke@0 1241 \
jcoomes@373 1242 develop(bool, TraceRegionTasksQueuing, false, \
jcoomes@373 1243 "Trace the queuing of the region tasks") \
duke@0 1244 \
ysr@344 1245 product(uintx, ParallelMarkingThreads, 0, \
ysr@344 1246 "Number of marking threads concurrent gc will use") \
ysr@344 1247 \
duke@0 1248 product(uintx, YoungPLABSize, 4096, \
duke@0 1249 "Size of young gen promotion labs (in HeapWords)") \
duke@0 1250 \
duke@0 1251 product(uintx, OldPLABSize, 1024, \
duke@0 1252 "Size of old gen promotion labs (in HeapWords)") \
duke@0 1253 \
duke@0 1254 product(uintx, GCTaskTimeStampEntries, 200, \
duke@0 1255 "Number of time stamp entries per gc worker thread") \
duke@0 1256 \
duke@0 1257 product(bool, AlwaysTenure, false, \
duke@0 1258 "Always tenure objects in eden. (ParallelGC only)") \
duke@0 1259 \
duke@0 1260 product(bool, NeverTenure, false, \
duke@0 1261 "Never tenure objects in eden, May tenure on overflow" \
duke@0 1262 " (ParallelGC only)") \
duke@0 1263 \
duke@0 1264 product(bool, ScavengeBeforeFullGC, true, \
duke@0 1265 "Scavenge youngest generation before each full GC," \
duke@0 1266 " used with UseParallelGC") \
duke@0 1267 \
duke@0 1268 develop(bool, ScavengeWithObjectsInToSpace, false, \
duke@0 1269 "Allow scavenges to occur when to_space contains objects.") \
duke@0 1270 \
duke@0 1271 product(bool, UseConcMarkSweepGC, false, \
duke@0 1272 "Use Concurrent Mark-Sweep GC in the old generation") \
duke@0 1273 \
duke@0 1274 product(bool, ExplicitGCInvokesConcurrent, false, \
duke@0 1275 "A System.gc() request invokes a concurrent collection;" \
duke@0 1276 " (effective only when UseConcMarkSweepGC)") \
duke@0 1277 \
duke@0 1278 product(bool, ExplicitGCInvokesConcurrentAndUnloadsClasses, false, \
duke@0 1279 "A System.gc() request invokes a concurrent collection and" \
duke@0 1280 " also unloads classes during such a concurrent gc cycle " \
duke@0 1281 " (effective only when UseConcMarkSweepGC)") \
duke@0 1282 \
duke@0 1283 develop(bool, UseCMSAdaptiveFreeLists, true, \
duke@0 1284 "Use Adaptive Free Lists in the CMS generation") \
duke@0 1285 \
duke@0 1286 develop(bool, UseAsyncConcMarkSweepGC, true, \
duke@0 1287 "Use Asynchronous Concurrent Mark-Sweep GC in the old generation")\
duke@0 1288 \
duke@0 1289 develop(bool, RotateCMSCollectionTypes, false, \
duke@0 1290 "Rotate the CMS collections among concurrent and STW") \
duke@0 1291 \
duke@0 1292 product(bool, UseCMSBestFit, true, \
duke@0 1293 "Use CMS best fit allocation strategy") \
duke@0 1294 \
duke@0 1295 product(bool, UseCMSCollectionPassing, true, \
duke@0 1296 "Use passing of collection from background to foreground") \
duke@0 1297 \
duke@0 1298 product(bool, UseParNewGC, false, \
duke@0 1299 "Use parallel threads in the new generation.") \
duke@0 1300 \
duke@0 1301 product(bool, ParallelGCVerbose, false, \
duke@0 1302 "Verbose output for parallel GC.") \
duke@0 1303 \
duke@0 1304 product(intx, ParallelGCBufferWastePct, 10, \
duke@0 1305 "wasted fraction of parallel allocation buffer.") \
duke@0 1306 \
duke@0 1307 product(bool, ParallelGCRetainPLAB, true, \
duke@0 1308 "Retain parallel allocation buffers across scavenges.") \
duke@0 1309 \
duke@0 1310 product(intx, TargetPLABWastePct, 10, \
duke@0 1311 "target wasted space in last buffer as pct of overall allocation")\
duke@0 1312 \
duke@0 1313 product(uintx, PLABWeight, 75, \
duke@0 1314 "Percentage (0-100) used to weight the current sample when" \
duke@0 1315 "computing exponentially decaying average for ResizePLAB.") \
duke@0 1316 \
duke@0 1317 product(bool, ResizePLAB, true, \
duke@0 1318 "Dynamically resize (survivor space) promotion labs") \
duke@0 1319 \
duke@0 1320 product(bool, PrintPLAB, false, \
duke@0 1321 "Print (survivor space) promotion labs sizing decisions") \
duke@0 1322 \
duke@0 1323 product(intx, ParGCArrayScanChunk, 50, \
duke@0 1324 "Scan a subset and push remainder, if array is bigger than this") \
duke@0 1325 \
ysr@696 1326 product(bool, ParGCUseLocalOverflow, false, \
ysr@696 1327 "Instead of a global overflow list, use local overflow stacks") \
ysr@696 1328 \
ysr@680 1329 product(bool, ParGCTrimOverflow, true, \
ysr@696 1330 "Eagerly trim the local overflow lists (when ParGCUseLocalOverflow") \
ysr@680 1331 \
ysr@550 1332 notproduct(bool, ParGCWorkQueueOverflowALot, false, \
ysr@550 1333 "Whether we should simulate work queue overflow in ParNew") \
ysr@550 1334 \
ysr@550 1335 notproduct(uintx, ParGCWorkQueueOverflowInterval, 1000, \
ysr@550 1336 "An `interval' counter that determines how frequently" \
ysr@550 1337 " we simulate overflow; a smaller number increases frequency") \
ysr@550 1338 \
ysr@550 1339 product(uintx, ParGCDesiredObjsFromOverflowList, 20, \
duke@0 1340 "The desired number of objects to claim from the overflow list") \
duke@0 1341 \
duke@0 1342 product(uintx, CMSParPromoteBlocksToClaim, 50, \
duke@0 1343 "Number of blocks to attempt to claim when refilling CMS LAB for "\
duke@0 1344 "parallel GC.") \
duke@0 1345 \
duke@0 1346 product(bool, AlwaysPreTouch, false, \
duke@0 1347 "It forces all freshly committed pages to be pre-touched.") \
duke@0 1348 \
duke@0 1349 product(bool, CMSUseOldDefaults, false, \
duke@0 1350 "A flag temporarily introduced to allow reverting to some older" \
duke@0 1351 "default settings; older as of 6.0 ") \
duke@0 1352 \
duke@0 1353 product(intx, CMSYoungGenPerWorker, 16*M, \
duke@0 1354 "The amount of young gen chosen by default per GC worker " \
duke@0 1355 "thread available ") \
duke@0 1356 \
ysr@344 1357 product(bool, GCOverheadReporting, false, \
ysr@344 1358 "Enables the GC overhead reporting facility") \
ysr@344 1359 \
ysr@344 1360 product(intx, GCOverheadReportingPeriodMS, 100, \
ysr@344 1361 "Reporting period for conc GC overhead reporting, in ms ") \
ysr@344 1362 \
duke@0 1363 product(bool, CMSIncrementalMode, false, \
duke@0 1364 "Whether CMS GC should operate in \"incremental\" mode") \
duke@0 1365 \
duke@0 1366 product(uintx, CMSIncrementalDutyCycle, 10, \
duke@0 1367 "CMS incremental mode duty cycle (a percentage, 0-100). If" \
duke@0 1368 "CMSIncrementalPacing is enabled, then this is just the initial" \
duke@0 1369 "value") \
duke@0 1370 \
duke@0 1371 product(bool, CMSIncrementalPacing, true, \
duke@0 1372 "Whether the CMS incremental mode duty cycle should be " \
duke@0 1373 "automatically adjusted") \
duke@0 1374 \
duke@0 1375 product(uintx, CMSIncrementalDutyCycleMin, 0, \
duke@0 1376 "Lower bound on the duty cycle when CMSIncrementalPacing is" \
duke@0 1377 "enabled (a percentage, 0-100).") \
duke@0 1378 \
duke@0 1379 product(uintx, CMSIncrementalSafetyFactor, 10, \
duke@0 1380 "Percentage (0-100) used to add conservatism when computing the" \
duke@0 1381 "duty cycle.") \
duke@0 1382 \
duke@0 1383 product(uintx, CMSIncrementalOffset, 0, \
duke@0 1384 "Percentage (0-100) by which the CMS incremental mode duty cycle" \
duke@0 1385 "is shifted to the right within the period between young GCs") \
duke@0 1386 \
duke@0 1387 product(uintx, CMSExpAvgFactor, 25, \
duke@0 1388 "Percentage (0-100) used to weight the current sample when" \
duke@0 1389 "computing exponential averages for CMS statistics.") \
duke@0 1390 \
duke@0 1391 product(uintx, CMS_FLSWeight, 50, \
duke@0 1392 "Percentage (0-100) used to weight the current sample when" \
duke@0 1393 "computing exponentially decating averages for CMS FLS statistics.") \
duke@0 1394 \
duke@0 1395 product(uintx, CMS_FLSPadding, 2, \
duke@0 1396 "The multiple of deviation from mean to use for buffering" \
duke@0 1397 "against volatility in free list demand.") \
duke@0 1398 \
duke@0 1399 product(uintx, FLSCoalescePolicy, 2, \
duke@0 1400 "CMS: Aggression level for coalescing, increasing from 0 to 4") \
duke@0 1401 \
duke@0 1402 product(uintx, CMS_SweepWeight, 50, \
duke@0 1403 "Percentage (0-100) used to weight the current sample when" \
duke@0 1404 "computing exponentially decaying average for inter-sweep duration.") \
duke@0 1405 \
duke@0 1406 product(uintx, CMS_SweepPadding, 2, \
duke@0 1407 "The multiple of deviation from mean to use for buffering" \
duke@0 1408 "against volatility in inter-sweep duration.") \
duke@0 1409 \
duke@0 1410 product(uintx, CMS_SweepTimerThresholdMillis, 10, \
duke@0 1411 "Skip block flux-rate sampling for an epoch unless inter-sweep " \
duke@0 1412 " duration exceeds this threhold in milliseconds") \
duke@0 1413 \
duke@0 1414 develop(bool, CMSTraceIncrementalMode, false, \
duke@0 1415 "Trace CMS incremental mode") \
duke@0 1416 \
duke@0 1417 develop(bool, CMSTraceIncrementalPacing, false, \
duke@0 1418 "Trace CMS incremental mode pacing computation") \
duke@0 1419 \
duke@0 1420 develop(bool, CMSTraceThreadState, false, \
duke@0 1421 "Trace the CMS thread state (enable the trace_state() method)") \
duke@0 1422 \
duke@0 1423 product(bool, CMSClassUnloadingEnabled, false, \
duke@0 1424 "Whether class unloading enabled when using CMS GC") \
duke@0 1425 \
ysr@94 1426 product(uintx, CMSClassUnloadingMaxInterval, 0, \
ysr@94 1427 "When CMS class unloading is enabled, the maximum CMS cycle count"\
ysr@94 1428 " for which classes may not be unloaded") \
ysr@94 1429 \
duke@0 1430 product(bool, CMSCompactWhenClearAllSoftRefs, true, \
duke@0 1431 "Compact when asked to collect CMS gen with clear_all_soft_refs") \
duke@0 1432 \
duke@0 1433 product(bool, UseCMSCompactAtFullCollection, true, \
duke@0 1434 "Use mark sweep compact at full collections") \
duke@0 1435 \
duke@0 1436 product(uintx, CMSFullGCsBeforeCompaction, 0, \
duke@0 1437 "Number of CMS full collection done before compaction if > 0") \
duke@0 1438 \
duke@0 1439 develop(intx, CMSDictionaryChoice, 0, \
duke@0 1440 "Use BinaryTreeDictionary as default in the CMS generation") \
duke@0 1441 \
duke@0 1442 product(uintx, CMSIndexedFreeListReplenish, 4, \
duke@0 1443 "Replenish and indexed free list with this number of chunks") \
duke@0 1444 \
duke@0 1445 product(bool, CMSLoopWarn, false, \
duke@0 1446 "Warn in case of excessive CMS looping") \
duke@0 1447 \
duke@0 1448 develop(bool, CMSOverflowEarlyRestoration, false, \
duke@0 1449 "Whether preserved marks should be restored early") \
duke@0 1450 \
ysr@557 1451 product(uintx, CMSMarkStackSize, NOT_LP64(32*K) LP64_ONLY(4*M), \
duke@0 1452 "Size of CMS marking stack") \
duke@0 1453 \
ysr@557 1454 product(uintx, CMSMarkStackSizeMax, NOT_LP64(4*M) LP64_ONLY(512*M), \
duke@0 1455 "Max size of CMS marking stack") \
duke@0 1456 \
duke@0 1457 notproduct(bool, CMSMarkStackOverflowALot, false, \
duke@0 1458 "Whether we should simulate frequent marking stack / work queue" \
duke@0 1459 " overflow") \
duke@0 1460 \
ysr@550 1461 notproduct(uintx, CMSMarkStackOverflowInterval, 1000, \
ysr@550 1462 "An `interval' counter that determines how frequently" \
duke@0 1463 " we simulate overflow; a smaller number increases frequency") \
duke@0 1464 \
duke@0 1465 product(uintx, CMSMaxAbortablePrecleanLoops, 0, \
duke@0 1466 "(Temporary, subject to experimentation)" \
duke@0 1467 "Maximum number of abortable preclean iterations, if > 0") \
duke@0 1468 \
duke@0 1469 product(intx, CMSMaxAbortablePrecleanTime, 5000, \
duke@0 1470 "(Temporary, subject to experimentation)" \
duke@0 1471 "Maximum time in abortable preclean in ms") \
duke@0 1472 \
duke@0 1473 product(uintx, CMSAbortablePrecleanMinWorkPerIteration, 100, \
duke@0 1474 "(Temporary, subject to experimentation)" \
duke@0 1475 "Nominal minimum work per abortable preclean iteration") \
duke@0 1476 \
duke@0 1477 product(intx, CMSAbortablePrecleanWaitMillis, 100, \
duke@0 1478 "(Temporary, subject to experimentation)" \
duke@0 1479 " Time that we sleep between iterations when not given" \
duke@0 1480 " enough work per iteration") \
duke@0 1481 \
duke@0 1482 product(uintx, CMSRescanMultiple, 32, \
duke@0 1483 "Size (in cards) of CMS parallel rescan task") \
duke@0 1484 \
duke@0 1485 product(uintx, CMSConcMarkMultiple, 32, \
duke@0 1486 "Size (in cards) of CMS concurrent MT marking task") \
duke@0 1487 \
duke@0 1488 product(uintx, CMSRevisitStackSize, 1*M, \
duke@0 1489 "Size of CMS KlassKlass revisit stack") \
duke@0 1490 \
duke@0 1491 product(bool, CMSAbortSemantics, false, \
duke@0 1492 "Whether abort-on-overflow semantics is implemented") \
duke@0 1493 \
duke@0 1494 product(bool, CMSParallelRemarkEnabled, true, \
duke@0 1495 "Whether parallel remark enabled (only if ParNewGC)") \
duke@0 1496 \
duke@0 1497 product(bool, CMSParallelSurvivorRemarkEnabled, true, \
duke@0 1498 "Whether parallel remark of survivor space" \
duke@0 1499 " enabled (effective only if CMSParallelRemarkEnabled)") \
duke@0 1500 \
duke@0 1501 product(bool, CMSPLABRecordAlways, true, \
duke@0 1502 "Whether to always record survivor space PLAB bdries" \
duke@0 1503 " (effective only if CMSParallelSurvivorRemarkEnabled)") \
duke@0 1504 \
duke@0 1505 product(bool, CMSConcurrentMTEnabled, true, \
duke@0 1506 "Whether multi-threaded concurrent work enabled (if ParNewGC)") \
duke@0 1507 \
duke@0 1508 product(bool, CMSPermGenPrecleaningEnabled, true, \
duke@0 1509 "Whether concurrent precleaning enabled in perm gen" \
duke@0 1510 " (effective only when CMSPrecleaningEnabled is true)") \
duke@0 1511 \
duke@0 1512 product(bool, CMSPrecleaningEnabled, true, \
duke@0 1513 "Whether concurrent precleaning enabled") \
duke@0 1514 \
duke@0 1515 product(uintx, CMSPrecleanIter, 3, \
duke@0 1516 "Maximum number of precleaning iteration passes") \
duke@0 1517 \
duke@0 1518 product(uintx, CMSPrecleanNumerator, 2, \
duke@0 1519 "CMSPrecleanNumerator:CMSPrecleanDenominator yields convergence" \
duke@0 1520 " ratio") \
duke@0 1521 \
duke@0 1522 product(uintx, CMSPrecleanDenominator, 3, \
duke@0 1523 "CMSPrecleanNumerator:CMSPrecleanDenominator yields convergence" \
duke@0 1524 " ratio") \
duke@0 1525 \
ysr@453 1526 product(bool, CMSPrecleanRefLists1, true, \
duke@0 1527 "Preclean ref lists during (initial) preclean phase") \
duke@0 1528 \
duke@0 1529 product(bool, CMSPrecleanRefLists2, false, \
duke@0 1530 "Preclean ref lists during abortable preclean phase") \
duke@0 1531 \
duke@0 1532 product(bool, CMSPrecleanSurvivors1, false, \
duke@0 1533 "Preclean survivors during (initial) preclean phase") \
duke@0 1534 \
duke@0 1535 product(bool, CMSPrecleanSurvivors2, true, \
duke@0 1536 "Preclean survivors during abortable preclean phase") \
duke@0 1537 \
duke@0 1538 product(uintx, CMSPrecleanThreshold, 1000, \
duke@0 1539 "Don't re-iterate if #dirty cards less than this") \
duke@0 1540 \
duke@0 1541 product(bool, CMSCleanOnEnter, true, \
duke@0 1542 "Clean-on-enter optimization for reducing number of dirty cards") \
duke@0 1543 \
duke@0 1544 product(uintx, CMSRemarkVerifyVariant, 1, \
duke@0 1545 "Choose variant (1,2) of verification following remark") \
duke@0 1546 \
duke@0 1547 product(uintx, CMSScheduleRemarkEdenSizeThreshold, 2*M, \
duke@0 1548 "If Eden used is below this value, don't try to schedule remark") \
duke@0 1549 \
duke@0 1550 product(uintx, CMSScheduleRemarkEdenPenetration, 50, \
duke@0 1551 "The Eden occupancy % at which to try and schedule remark pause") \
duke@0 1552 \
duke@0 1553 product(uintx, CMSScheduleRemarkSamplingRatio, 5, \
duke@0 1554 "Start sampling Eden top at least before yg occupancy reaches" \
duke@0 1555 " 1/<ratio> of the size at which we plan to schedule remark") \
duke@0 1556 \
duke@0 1557 product(uintx, CMSSamplingGrain, 16*K, \
duke@0 1558 "The minimum distance between eden samples for CMS (see above)") \
duke@0 1559 \
duke@0 1560 product(bool, CMSScavengeBeforeRemark, false, \
duke@0 1561 "Attempt scavenge before the CMS remark step") \
duke@0 1562 \
duke@0 1563 develop(bool, CMSTraceSweeper, false, \
duke@0 1564 "Trace some actions of the CMS sweeper") \
duke@0 1565 \
duke@0 1566 product(uintx, CMSWorkQueueDrainThreshold, 10, \
duke@0 1567 "Don't drain below this size per parallel worker/thief") \
duke@0 1568 \
duke@0 1569 product(intx, CMSWaitDuration, 2000, \
duke@0 1570 "Time in milliseconds that CMS thread waits for young GC") \
duke@0 1571 \
duke@0 1572 product(bool, CMSYield, true, \
duke@0 1573 "Yield between steps of concurrent mark & sweep") \
duke@0 1574 \
duke@0 1575 product(uintx, CMSBitMapYieldQuantum, 10*M, \
duke@0 1576 "Bitmap operations should process at most this many bits" \
duke@0 1577 "between yields") \
duke@0 1578 \
duke@0 1579 diagnostic(bool, FLSVerifyAllHeapReferences, false, \
duke@0 1580 "Verify that all refs across the FLS boundary " \
duke@0 1581 " are to valid objects") \
duke@0 1582 \
duke@0 1583 diagnostic(bool, FLSVerifyLists, false, \
duke@0 1584 "Do lots of (expensive) FreeListSpace verification") \
duke@0 1585 \
duke@0 1586 diagnostic(bool, FLSVerifyIndexTable, false, \
duke@0 1587 "Do lots of (expensive) FLS index table verification") \
duke@0 1588 \
duke@0 1589 develop(bool, FLSVerifyDictionary, false, \
duke@0 1590 "Do lots of (expensive) FLS dictionary verification") \
duke@0 1591 \
duke@0 1592 develop(bool, VerifyBlockOffsetArray, false, \
duke@0 1593 "Do (expensive!) block offset array verification") \
duke@0 1594 \
duke@0 1595 product(bool, BlockOffsetArrayUseUnallocatedBlock, trueInDebug, \
duke@0 1596 "Maintain _unallocated_block in BlockOffsetArray" \
duke@0 1597 " (currently applicable only to CMS collector)") \
duke@0 1598 \
duke@0 1599 develop(bool, TraceCMSState, false, \
duke@0 1600 "Trace the state of the CMS collection") \
duke@0 1601 \
duke@0 1602 product(intx, RefDiscoveryPolicy, 0, \
duke@0 1603 "Whether reference-based(0) or referent-based(1)") \
duke@0 1604 \
duke@0 1605 product(bool, ParallelRefProcEnabled, false, \
duke@0 1606 "Enable parallel reference processing whenever possible") \
duke@0 1607 \
duke@0 1608 product(bool, ParallelRefProcBalancingEnabled, true, \
duke@0 1609 "Enable balancing of reference processing queues") \
duke@0 1610 \
duke@0 1611 product(intx, CMSTriggerRatio, 80, \
duke@0 1612 "Percentage of MinHeapFreeRatio in CMS generation that is " \
duke@0 1613 " allocated before a CMS collection cycle commences") \
duke@0 1614 \
ysr@94 1615 product(intx, CMSTriggerPermRatio, 80, \
ysr@94 1616 "Percentage of MinHeapFreeRatio in the CMS perm generation that" \
ysr@94 1617 " is allocated before a CMS collection cycle commences, that " \
ysr@94 1618 " also collects the perm generation") \
ysr@94 1619 \
ysr@94 1620 product(uintx, CMSBootstrapOccupancy, 50, \
duke@0 1621 "Percentage CMS generation occupancy at which to " \
duke@0 1622 " initiate CMS collection for bootstrapping collection stats") \
duke@0 1623 \
duke@0 1624 product(intx, CMSInitiatingOccupancyFraction, -1, \
duke@0 1625 "Percentage CMS generation occupancy to start a CMS collection " \
ysr@94 1626 " cycle (A negative value means that CMSTriggerRatio is used)") \
ysr@94 1627 \
ysr@94 1628 product(intx, CMSInitiatingPermOccupancyFraction, -1, \
ysr@94 1629 "Percentage CMS perm generation occupancy to start a CMScollection"\
ysr@94 1630 " cycle (A negative value means that CMSTriggerPermRatio is used)")\
duke@0 1631 \
duke@0 1632 product(bool, UseCMSInitiatingOccupancyOnly, false, \
duke@0 1633 "Only use occupancy as a crierion for starting a CMS collection") \
duke@0 1634 \
ysr@94 1635 product(intx, CMSIsTooFullPercentage, 98, \
ysr@94 1636 "An absolute ceiling above which CMS will always consider the" \
ysr@94 1637 " perm gen ripe for collection") \
ysr@94 1638 \
duke@0 1639 develop(bool, CMSTestInFreeList, false, \
duke@0 1640 "Check if the coalesced range is already in the " \
duke@0 1641 "free lists as claimed.") \
duke@0 1642 \
duke@0 1643 notproduct(bool, CMSVerifyReturnedBytes, false, \
duke@0 1644 "Check that all the garbage collected was returned to the " \
duke@0 1645 "free lists.") \
duke@0 1646 \
duke@0 1647 notproduct(bool, ScavengeALot, false, \
duke@0 1648 "Force scavenge at every Nth exit from the runtime system " \
duke@0 1649 "(N=ScavengeALotInterval)") \
duke@0 1650 \
duke@0 1651 develop(bool, FullGCALot, false, \
duke@0 1652 "Force full gc at every Nth exit from the runtime system " \
duke@0 1653 "(N=FullGCALotInterval)") \
duke@0 1654 \
duke@0 1655 notproduct(bool, GCALotAtAllSafepoints, false, \
duke@0 1656 "Enforce ScavengeALot/GCALot at all potential safepoints") \
duke@0 1657 \
duke@0 1658 product(bool, HandlePromotionFailure, true, \
duke@0 1659 "The youngest generation collection does not require" \
duke@0 1660 " a guarantee of full promotion of all live objects.") \
duke@0 1661 \
duke@0 1662 notproduct(bool, PromotionFailureALot, false, \
duke@0 1663 "Use promotion failure handling on every youngest generation " \
duke@0 1664 "collection") \
duke@0 1665 \
duke@0 1666 develop(uintx, PromotionFailureALotCount, 1000, \
duke@0 1667 "Number of promotion failures occurring at ParGCAllocBuffer" \
duke@0 1668 "refill attempts (ParNew) or promotion attempts " \
duke@0 1669 "(other young collectors) ") \
duke@0 1670 \
duke@0 1671 develop(uintx, PromotionFailureALotInterval, 5, \
duke@0 1672 "Total collections between promotion failures alot") \
duke@0 1673 \
duke@0 1674 develop(intx, WorkStealingSleepMillis, 1, \
duke@0 1675 "Sleep time when sleep is used for yields") \
duke@0 1676 \
duke@0 1677 develop(uintx, WorkStealingYieldsBeforeSleep, 1000, \
duke@0 1678 "Number of yields before a sleep is done during workstealing") \
duke@0 1679 \
jmasa@562 1680 develop(uintx, WorkStealingHardSpins, 4096, \
jmasa@562 1681 "Number of iterations in a spin loop between checks on " \
jmasa@562 1682 "time out of hard spin") \
jmasa@562 1683 \
jmasa@562 1684 develop(uintx, WorkStealingSpinToYieldRatio, 10, \
jmasa@562 1685 "Ratio of hard spins to calls to yield") \
jmasa@562 1686 \
ysr@550 1687 product(uintx, PreserveMarkStackSize, 1024, \
duke@0 1688 "Size for stack used in promotion failure handling") \
duke@0 1689 \
duke@0 1690 product_pd(bool, UseTLAB, "Use thread-local object allocation") \
duke@0 1691 \
duke@0 1692 product_pd(bool, ResizeTLAB, \
duke@0 1693 "Dynamically resize tlab size for threads") \
duke@0 1694 \
duke@0 1695 product(bool, ZeroTLAB, false, \
duke@0 1696 "Zero out the newly created TLAB") \
duke@0 1697 \
ysr@344 1698 product(bool, FastTLABRefill, true, \
ysr@344 1699 "Use fast TLAB refill code") \
ysr@344 1700 \
duke@0 1701 product(bool, PrintTLAB, false, \
duke@0 1702 "Print various TLAB related information") \
duke@0 1703 \
duke@0 1704 product(bool, TLABStats, true, \
duke@0 1705 "Print various TLAB related information") \
duke@0 1706 \
duke@0 1707 product_pd(bool, NeverActAsServerClassMachine, \
duke@0 1708 "Never act like a server-class machine") \
duke@0 1709 \
duke@0 1710 product(bool, AlwaysActAsServerClassMachine, false, \
duke@0 1711 "Always act like a server-class machine") \
duke@0 1712 \
duke@0 1713 product_pd(uintx, DefaultMaxRAM, \
duke@0 1714 "Maximum real memory size for setting server class heap size") \
duke@0 1715 \
duke@0 1716 product(uintx, DefaultMaxRAMFraction, 4, \
duke@0 1717 "Fraction (1/n) of real memory used for server class max heap") \
duke@0 1718 \
duke@0 1719 product(uintx, DefaultInitialRAMFraction, 64, \
duke@0 1720 "Fraction (1/n) of real memory used for server class initial heap") \
duke@0 1721 \
duke@0 1722 product(bool, UseAutoGCSelectPolicy, false, \
duke@0 1723 "Use automatic collection selection policy") \
duke@0 1724 \
duke@0 1725 product(uintx, AutoGCSelectPauseMillis, 5000, \
duke@0 1726 "Automatic GC selection pause threshhold in ms") \
duke@0 1727 \
duke@0 1728 product(bool, UseAdaptiveSizePolicy, true, \
duke@0 1729 "Use adaptive generation sizing policies") \
duke@0 1730 \
duke@0 1731 product(bool, UsePSAdaptiveSurvivorSizePolicy, true, \
duke@0 1732 "Use adaptive survivor sizing policies") \
duke@0 1733 \
duke@0 1734 product(bool, UseAdaptiveGenerationSizePolicyAtMinorCollection, true, \
duke@0 1735 "Use adaptive young-old sizing policies at minor collections") \
duke@0 1736 \
duke@0 1737 product(bool, UseAdaptiveGenerationSizePolicyAtMajorCollection, true, \
duke@0 1738 "Use adaptive young-old sizing policies at major collections") \
duke@0 1739 \
duke@0 1740 product(bool, UseAdaptiveSizePolicyWithSystemGC, false, \
duke@0 1741 "Use statistics from System.GC for adaptive size policy") \
duke@0 1742 \
duke@0 1743 product(bool, UseAdaptiveGCBoundary, false, \
duke@0 1744 "Allow young-old boundary to move") \
duke@0 1745 \
duke@0 1746 develop(bool, TraceAdaptiveGCBoundary, false, \
duke@0 1747 "Trace young-old boundary moves") \
duke@0 1748 \
duke@0 1749 develop(intx, PSAdaptiveSizePolicyResizeVirtualSpaceAlot, -1, \
duke@0 1750 "Resize the virtual spaces of the young or old generations") \
duke@0 1751 \
duke@0 1752 product(uintx, AdaptiveSizeThroughPutPolicy, 0, \
duke@0 1753 "Policy for changeing generation size for throughput goals") \
duke@0 1754 \
duke@0 1755 product(uintx, AdaptiveSizePausePolicy, 0, \
duke@0 1756 "Policy for changing generation size for pause goals") \
duke@0 1757 \
duke@0 1758 develop(bool, PSAdjustTenuredGenForMinorPause, false, \
duke@0 1759 "Adjust tenured generation to achive a minor pause goal") \
duke@0 1760 \
duke@0 1761 develop(bool, PSAdjustYoungGenForMajorPause, false, \
duke@0 1762 "Adjust young generation to achive a major pause goal") \
duke@0 1763 \
duke@0 1764 product(uintx, AdaptiveSizePolicyInitializingSteps, 20, \
duke@0 1765 "Number of steps where heuristics is used before data is used") \
duke@0 1766 \
duke@0 1767 develop(uintx, AdaptiveSizePolicyReadyThreshold, 5, \
duke@0 1768 "Number of collections before the adaptive sizing is started") \
duke@0 1769 \
duke@0 1770 product(uintx, AdaptiveSizePolicyOutputInterval, 0, \
duke@0 1771 "Collecton interval for printing information, zero => never") \
duke@0 1772 \
duke@0 1773 product(bool, UseAdaptiveSizePolicyFootprintGoal, true, \
duke@0 1774 "Use adaptive minimum footprint as a goal") \
duke@0 1775 \
duke@0 1776 product(uintx, AdaptiveSizePolicyWeight, 10, \
duke@0 1777 "Weight given to exponential resizing, between 0 and 100") \
duke@0 1778 \
duke@0 1779 product(uintx, AdaptiveTimeWeight, 25, \
duke@0 1780 "Weight given to time in adaptive policy, between 0 and 100") \
duke@0 1781 \
duke@0 1782 product(uintx, PausePadding, 1, \
duke@0 1783 "How much buffer to keep for pause time") \
duke@0 1784 \
duke@0 1785 product(uintx, PromotedPadding, 3, \
duke@0 1786 "How much buffer to keep for promotion failure") \
duke@0 1787 \
duke@0 1788 product(uintx, SurvivorPadding, 3, \
duke@0 1789 "How much buffer to keep for survivor overflow") \
duke@0 1790 \
duke@0 1791 product(uintx, AdaptivePermSizeWeight, 20, \
duke@0 1792 "Weight for perm gen exponential resizing, between 0 and 100") \
duke@0 1793 \
duke@0 1794 product(uintx, PermGenPadding, 3, \
duke@0 1795 "How much buffer to keep for perm gen sizing") \
duke@0 1796 \
duke@0 1797 product(uintx, ThresholdTolerance, 10, \
duke@0 1798 "Allowed collection cost difference between generations") \
duke@0 1799 \
duke@0 1800 product(uintx, AdaptiveSizePolicyCollectionCostMargin, 50, \
duke@0 1801 "If collection costs are within margin, reduce both by full delta") \
duke@0 1802 \
duke@0 1803 product(uintx, YoungGenerationSizeIncrement, 20, \
duke@0 1804 "Adaptive size percentage change in young generation") \
duke@0 1805 \
duke@0 1806 product(uintx, YoungGenerationSizeSupplement, 80, \
duke@0 1807 "Supplement to YoungedGenerationSizeIncrement used at startup") \
duke@0 1808 \
duke@0 1809 product(uintx, YoungGenerationSizeSupplementDecay, 8, \
duke@0 1810 "Decay factor to YoungedGenerationSizeSupplement") \
duke@0 1811 \
duke@0 1812 product(uintx, TenuredGenerationSizeIncrement, 20, \
duke@0 1813 "Adaptive size percentage change in tenured generation") \
duke@0 1814 \
duke@0 1815 product(uintx, TenuredGenerationSizeSupplement, 80, \
duke@0 1816 "Supplement to TenuredGenerationSizeIncrement used at startup") \
duke@0 1817 \
duke@0 1818 product(uintx, TenuredGenerationSizeSupplementDecay, 2, \
duke@0 1819 "Decay factor to TenuredGenerationSizeIncrement") \
duke@0 1820 \
duke@0 1821 product(uintx, MaxGCPauseMillis, max_uintx, \
duke@0 1822 "Adaptive size policy maximum GC pause time goal in msec") \
duke@0 1823 \
duke@0 1824 product(uintx, MaxGCMinorPauseMillis, max_uintx, \
duke@0 1825 "Adaptive size policy maximum GC minor pause time goal in msec") \
duke@0 1826 \
duke@0 1827 product(uintx, GCTimeRatio, 99, \
duke@0 1828 "Adaptive size policy application time to GC time ratio") \
duke@0 1829 \
duke@0 1830 product(uintx, AdaptiveSizeDecrementScaleFactor, 4, \
duke@0 1831 "Adaptive size scale down factor for shrinking") \
duke@0 1832 \
duke@0 1833 product(bool, UseAdaptiveSizeDecayMajorGCCost, true, \
duke@0 1834 "Adaptive size decays the major cost for long major intervals") \
duke@0 1835 \
duke@0 1836 product(uintx, AdaptiveSizeMajorGCDecayTimeScale, 10, \
duke@0 1837 "Time scale over which major costs decay") \
duke@0 1838 \
duke@0 1839 product(uintx, MinSurvivorRatio, 3, \
duke@0 1840 "Minimum ratio of young generation/survivor space size") \
duke@0 1841 \
duke@0 1842 product(uintx, InitialSurvivorRatio, 8, \
duke@0 1843 "Initial ratio of eden/survivor space size") \
duke@0 1844 \
duke@0 1845 product(uintx, BaseFootPrintEstimate, 256*M, \
duke@0 1846 "Estimate of footprint other than Java Heap") \
duke@0 1847 \
duke@0 1848 product(bool, UseGCOverheadLimit, true, \
duke@0 1849 "Use policy to limit of proportion of time spent in GC " \
duke@0 1850 "before an OutOfMemory error is thrown") \
duke@0 1851 \
duke@0 1852 product(uintx, GCTimeLimit, 98, \
duke@0 1853 "Limit of proportion of time spent in GC before an OutOfMemory" \
duke@0 1854 "error is thrown (used with GCHeapFreeLimit)") \
duke@0 1855 \
duke@0 1856 product(uintx, GCHeapFreeLimit, 2, \
duke@0 1857 "Minimum percentage of free space after a full GC before an " \
duke@0 1858 "OutOfMemoryError is thrown (used with GCTimeLimit)") \
duke@0 1859 \
duke@0 1860 develop(uintx, AdaptiveSizePolicyGCTimeLimitThreshold, 5, \
duke@0 1861 "Number of consecutive collections before gc time limit fires") \
duke@0 1862 \
duke@0 1863 product(bool, PrintAdaptiveSizePolicy, false, \
duke@0 1864 "Print information about AdaptiveSizePolicy") \
duke@0 1865 \
duke@0 1866 product(intx, PrefetchCopyIntervalInBytes, -1, \
duke@0 1867 "How far ahead to prefetch destination area (<= 0 means off)") \
duke@0 1868 \
duke@0 1869 product(intx, PrefetchScanIntervalInBytes, -1, \
duke@0 1870 "How far ahead to prefetch scan area (<= 0 means off)") \
duke@0 1871 \
duke@0 1872 product(intx, PrefetchFieldsAhead, -1, \
duke@0 1873 "How many fields ahead to prefetch in oop scan (<= 0 means off)") \
duke@0 1874 \
duke@0 1875 develop(bool, UsePrefetchQueue, true, \
duke@0 1876 "Use the prefetch queue during PS promotion") \
duke@0 1877 \
duke@0 1878 diagnostic(bool, VerifyBeforeExit, trueInDebug, \
duke@0 1879 "Verify system before exiting") \
duke@0 1880 \
duke@0 1881 diagnostic(bool, VerifyBeforeGC, false, \
duke@0 1882 "Verify memory system before GC") \
duke@0 1883 \
duke@0 1884 diagnostic(bool, VerifyAfterGC, false, \
duke@0 1885 "Verify memory system after GC") \
duke@0 1886 \
duke@0 1887 diagnostic(bool, VerifyDuringGC, false, \
duke@0 1888 "Verify memory system during GC (between phases)") \
duke@0 1889 \
tonyp@391 1890 diagnostic(bool, GCParallelVerificationEnabled, true, \
tonyp@391 1891 "Enable parallel memory system verification") \
tonyp@391 1892 \
duke@0 1893 diagnostic(bool, VerifyRememberedSets, false, \
duke@0 1894 "Verify GC remembered sets") \
duke@0 1895 \
duke@0 1896 diagnostic(bool, VerifyObjectStartArray, true, \
duke@0 1897 "Verify GC object start array if verify before/after") \
duke@0 1898 \
duke@0 1899 product(bool, DisableExplicitGC, false, \
duke@0 1900 "Tells whether calling System.gc() does a full GC") \
duke@0 1901 \
duke@0 1902 notproduct(bool, CheckMemoryInitialization, false, \
duke@0 1903 "Checks memory initialization") \
duke@0 1904 \
duke@0 1905 product(bool, CollectGen0First, false, \
duke@0 1906 "Collect youngest generation before each full GC") \
duke@0 1907 \
duke@0 1908 diagnostic(bool, BindCMSThreadToCPU, false, \
duke@0 1909 "Bind CMS Thread to CPU if possible") \
duke@0 1910 \
duke@0 1911 diagnostic(uintx, CPUForCMSThread, 0, \
duke@0 1912 "When BindCMSThreadToCPU is true, the CPU to bind CMS thread to") \
duke@0 1913 \
duke@0 1914 product(bool, BindGCTaskThreadsToCPUs, false, \
duke@0 1915 "Bind GCTaskThreads to CPUs if possible") \
duke@0 1916 \
duke@0 1917 product(bool, UseGCTaskAffinity, false, \
duke@0 1918 "Use worker affinity when asking for GCTasks") \
duke@0 1919 \
duke@0 1920 product(uintx, ProcessDistributionStride, 4, \
duke@0 1921 "Stride through processors when distributing processes") \
duke@0 1922 \
duke@0 1923 product(uintx, CMSCoordinatorYieldSleepCount, 10, \
duke@0 1924 "number of times the coordinator GC thread will sleep while " \
duke@0 1925 "yielding before giving up and resuming GC") \
duke@0 1926 \
duke@0 1927 product(uintx, CMSYieldSleepCount, 0, \
duke@0 1928 "number of times a GC thread (minus the coordinator) " \
duke@0 1929 "will sleep while yielding before giving up and resuming GC") \
duke@0 1930 \
jmasa@39 1931 notproduct(bool, PrintFlagsFinal, false, \
jmasa@39 1932 "Print all command line flags after argument processing") \
jmasa@39 1933 \
duke@0 1934 /* gc tracing */ \
duke@0 1935 manageable(bool, PrintGC, false, \
duke@0 1936 "Print message at garbage collect") \
duke@0 1937 \
duke@0 1938 manageable(bool, PrintGCDetails, false, \
duke@0 1939 "Print more details at garbage collect") \
duke@0 1940 \
duke@0 1941 manageable(bool, PrintGCDateStamps, false, \
duke@0 1942 "Print date stamps at garbage collect") \
duke@0 1943 \
duke@0 1944 manageable(bool, PrintGCTimeStamps, false, \
duke@0 1945 "Print timestamps at garbage collect") \
duke@0 1946 \
duke@0 1947 product(bool, PrintGCTaskTimeStamps, false, \
duke@0 1948 "Print timestamps for individual gc worker thread tasks") \
duke@0 1949 \
duke@0 1950 develop(intx, ConcGCYieldTimeout, 0, \
duke@0 1951 "If non-zero, assert that GC threads yield within this # of ms.") \
duke@0 1952 \
duke@0 1953 notproduct(bool, TraceMarkSweep, false, \
duke@0 1954 "Trace mark sweep") \
duke@0 1955 \
duke@0 1956 product(bool, PrintReferenceGC, false, \
duke@0 1957 "Print times spent handling reference objects during GC " \
duke@0 1958 " (enabled only when PrintGCDetails)") \
duke@0 1959 \
duke@0 1960 develop(bool, TraceReferenceGC, false, \
duke@0 1961 "Trace handling of soft/weak/final/phantom references") \
duke@0 1962 \
duke@0 1963 develop(bool, TraceFinalizerRegistration, false, \
duke@0 1964 "Trace registration of final references") \
duke@0 1965 \
duke@0 1966 notproduct(bool, TraceScavenge, false, \
duke@0 1967 "Trace scavenge") \
duke@0 1968 \
duke@0 1969 product_rw(bool, TraceClassLoading, false, \
duke@0 1970 "Trace all classes loaded") \
duke@0 1971 \
duke@0 1972 product(bool, TraceClassLoadingPreorder, false, \
duke@0 1973 "Trace all classes loaded in order referenced (not loaded)") \
duke@0 1974 \
duke@0 1975 product_rw(bool, TraceClassUnloading, false, \
duke@0 1976 "Trace unloading of classes") \
duke@0 1977 \
duke@0 1978 product_rw(bool, TraceLoaderConstraints, false, \
duke@0 1979 "Trace loader constraints") \
duke@0 1980 \
duke@0 1981 product(bool, TraceGen0Time, false, \
duke@0 1982 "Trace accumulated time for Gen 0 collection") \
duke@0 1983 \
duke@0 1984 product(bool, TraceGen1Time, false, \
duke@0 1985 "Trace accumulated time for Gen 1 collection") \
duke@0 1986 \
duke@0 1987 product(bool, PrintTenuringDistribution, false, \
duke@0 1988 "Print tenuring age information") \
duke@0 1989 \
duke@0 1990 product_rw(bool, PrintHeapAtGC, false, \
duke@0 1991 "Print heap layout before and after each GC") \
duke@0 1992 \
duke@0 1993 product(bool, PrintHeapAtSIGBREAK, true, \
duke@0 1994 "Print heap layout in response to SIGBREAK") \
duke@0 1995 \
ysr@611 1996 manageable(bool, PrintClassHistogramBeforeFullGC, false, \
ysr@611 1997 "Print a class histogram before any major stop-world GC") \
ysr@611 1998 \
ysr@611 1999 manageable(bool, PrintClassHistogramAfterFullGC, false, \
ysr@611 2000 "Print a class histogram after any major stop-world GC") \
ysr@611 2001 \
duke@0 2002 manageable(bool, PrintClassHistogram, false, \
duke@0 2003 "Print a histogram of class instances") \
duke@0 2004 \
duke@0 2005 develop(bool, TraceWorkGang, false, \
duke@0 2006 "Trace activities of work gangs") \
duke@0 2007 \
duke@0 2008 product(bool, TraceParallelOldGCTasks, false, \
duke@0 2009 "Trace multithreaded GC activity") \
duke@0 2010 \
duke@0 2011 develop(bool, TraceBlockOffsetTable, false, \
duke@0 2012 "Print BlockOffsetTable maps") \
duke@0 2013 \
duke@0 2014 develop(bool, TraceCardTableModRefBS, false, \
duke@0 2015 "Print CardTableModRefBS maps") \
duke@0 2016 \
duke@0 2017 develop(bool, TraceGCTaskManager, false, \
duke@0 2018 "Trace actions of the GC task manager") \
duke@0 2019 \
duke@0 2020 develop(bool, TraceGCTaskQueue, false, \
duke@0 2021 "Trace actions of the GC task queues") \
duke@0 2022 \
duke@0 2023 develop(bool, TraceGCTaskThread, false, \
duke@0 2024 "Trace actions of the GC task threads") \
duke@0 2025 \
duke@0 2026 product(bool, PrintParallelOldGCPhaseTimes, false, \
duke@0 2027 "Print the time taken by each parallel old gc phase." \
duke@0 2028 "PrintGCDetails must also be enabled.") \
duke@0 2029 \
duke@0 2030 develop(bool, TraceParallelOldGCMarkingPhase, false, \
duke@0 2031 "Trace parallel old gc marking phase") \
duke@0 2032 \
duke@0 2033 develop(bool, TraceParallelOldGCSummaryPhase, false, \
duke@0 2034 "Trace parallel old gc summary phase") \
duke@0 2035 \
duke@0 2036 develop(bool, TraceParallelOldGCCompactionPhase, false, \
duke@0 2037 "Trace parallel old gc compaction phase") \
duke@0 2038 \
duke@0 2039 develop(bool, TraceParallelOldGCDensePrefix, false, \
duke@0 2040 "Trace parallel old gc dense prefix computation") \
duke@0 2041 \
duke@0 2042 develop(bool, IgnoreLibthreadGPFault, false, \
duke@0 2043 "Suppress workaround for libthread GP fault") \
duke@0 2044 \
apetrusenko@139 2045 product(bool, PrintJNIGCStalls, false, \
apetrusenko@139 2046 "Print diagnostic message when GC is stalled" \
apetrusenko@139 2047 "by JNI critical section") \
apetrusenko@139 2048 \
duke@0 2049 /* JVMTI heap profiling */ \
duke@0 2050 \
duke@0 2051 diagnostic(bool, TraceJVMTIObjectTagging, false, \
duke@0 2052 "Trace JVMTI object tagging calls") \
duke@0 2053 \
duke@0 2054 diagnostic(bool, VerifyBeforeIteration, false, \
duke@0 2055 "Verify memory system before JVMTI iteration") \
duke@0 2056 \
duke@0 2057 /* compiler interface */ \
duke@0 2058 \
duke@0 2059 develop(bool, CIPrintCompilerName, false, \
duke@0 2060 "when CIPrint is active, print the name of the active compiler") \
duke@0 2061 \
duke@0 2062 develop(bool, CIPrintCompileQueue, false, \
duke@0 2063 "display the contents of the compile queue whenever a " \
duke@0 2064 "compilation is enqueued") \
duke@0 2065 \
duke@0 2066 develop(bool, CIPrintRequests, false, \
duke@0 2067 "display every request for compilation") \
duke@0 2068 \
duke@0 2069 product(bool, CITime, false, \
duke@0 2070 "collect timing information for compilation") \
duke@0 2071 \
duke@0 2072 develop(bool, CITimeEach, false, \
duke@0 2073 "display timing information after each successful compilation") \
duke@0 2074 \
duke@0 2075 develop(bool, CICountOSR, true, \
duke@0 2076 "use a separate counter when assigning ids to osr compilations") \
duke@0 2077 \
duke@0 2078 develop(bool, CICompileNatives, true, \
duke@0 2079 "compile native methods if supported by the compiler") \
duke@0 2080 \
duke@0 2081 develop_pd(bool, CICompileOSR, \
duke@0 2082 "compile on stack replacement methods if supported by the " \
duke@0 2083 "compiler") \
duke@0 2084 \
duke@0 2085 develop(bool, CIPrintMethodCodes, false, \
duke@0 2086 "print method bytecodes of the compiled code") \
duke@0 2087 \
duke@0 2088 develop(bool, CIPrintTypeFlow, false, \
duke@0 2089 "print the results of ciTypeFlow analysis") \
duke@0 2090 \
duke@0 2091 develop(bool, CITraceTypeFlow, false, \
duke@0 2092 "detailed per-bytecode tracing of ciTypeFlow analysis") \
duke@0 2093 \
duke@0 2094 develop(intx, CICloneLoopTestLimit, 100, \
duke@0 2095 "size limit for blocks heuristically cloned in ciTypeFlow") \
duke@0 2096 \
duke@0 2097 /* temp diagnostics */ \
duke@0 2098 \
duke@0 2099 diagnostic(bool, TraceRedundantCompiles, false, \
duke@0 2100 "Have compile broker print when a request already in the queue is"\
duke@0 2101 " requested again") \
duke@0 2102 \
duke@0 2103 diagnostic(bool, InitialCompileFast, false, \
duke@0 2104 "Initial compile at CompLevel_fast_compile") \
duke@0 2105 \
duke@0 2106 diagnostic(bool, InitialCompileReallyFast, false, \
duke@0 2107 "Initial compile at CompLevel_really_fast_compile (no profile)") \
duke@0 2108 \
duke@0 2109 diagnostic(bool, FullProfileOnReInterpret, true, \
duke@0 2110 "On re-interpret unc-trap compile next at CompLevel_fast_compile")\
duke@0 2111 \
duke@0 2112 /* compiler */ \
duke@0 2113 \
duke@0 2114 product(intx, CICompilerCount, CI_COMPILER_COUNT, \
duke@0 2115 "Number of compiler threads to run") \
duke@0 2116 \
duke@0 2117 product(intx, CompilationPolicyChoice, 0, \
duke@0 2118 "which compilation policy (0/1)") \
duke@0 2119 \
duke@0 2120 develop(bool, UseStackBanging, true, \
duke@0 2121 "use stack banging for stack overflow checks (required for " \
duke@0 2122 "proper StackOverflow handling; disable only to measure cost " \
duke@0 2123 "of stackbanging)") \
duke@0 2124 \
duke@0 2125 develop(bool, Use24BitFPMode, true, \
duke@0 2126 "Set 24-bit FPU mode on a per-compile basis ") \
duke@0 2127 \
duke@0 2128 develop(bool, Use24BitFP, true, \
duke@0 2129 "use FP instructions that produce 24-bit precise results") \
duke@0 2130 \
duke@0 2131 develop(bool, UseStrictFP, true, \
duke@0 2132 "use strict fp if modifier strictfp is set") \
duke@0 2133 \
duke@0 2134 develop(bool, GenerateSynchronizationCode, true, \
duke@0 2135 "generate locking/unlocking code for synchronized methods and " \
duke@0 2136 "monitors") \
duke@0 2137 \
duke@0 2138 develop(bool, GenerateCompilerNullChecks, true, \
duke@0 2139 "Generate explicit null checks for loads/stores/calls") \
duke@0 2140 \
duke@0 2141 develop(bool, GenerateRangeChecks, true, \
duke@0 2142 "Generate range checks for array accesses") \
duke@0 2143 \
duke@0 2144 develop_pd(bool, ImplicitNullChecks, \
duke@0 2145 "generate code for implicit null checks") \
duke@0 2146 \
duke@0 2147 product(bool, PrintSafepointStatistics, false, \
duke@0 2148 "print statistics about safepoint synchronization") \
duke@0 2149 \
duke@0 2150 product(intx, PrintSafepointStatisticsCount, 300, \
duke@0 2151 "total number of safepoint statistics collected " \
duke@0 2152 "before printing them out") \
duke@0 2153 \
duke@0 2154 product(intx, PrintSafepointStatisticsTimeout, -1, \
duke@0 2155 "print safepoint statistics only when safepoint takes" \
duke@0 2156 " more than PrintSafepointSatisticsTimeout in millis") \
duke@0 2157 \
duke@0 2158 develop(bool, InlineAccessors, true, \
duke@0 2159 "inline accessor methods (get/set)") \
duke@0 2160 \
duke@0 2161 product(bool, Inline, true, \
duke@0 2162 "enable inlining") \
duke@0 2163 \
duke@0 2164 product(bool, ClipInlining, true, \
duke@0 2165 "clip inlining if aggregate method exceeds DesiredMethodLimit") \
duke@0 2166 \
duke@0 2167 develop(bool, UseCHA, true, \
duke@0 2168 "enable CHA") \
duke@0 2169 \
duke@0 2170 product(bool, UseTypeProfile, true, \
duke@0 2171 "Check interpreter profile for historically monomorphic calls") \
duke@0 2172 \
duke@0 2173 product(intx, TypeProfileMajorReceiverPercent, 90, \
duke@0 2174 "% of major receiver type to all profiled receivers") \
duke@0 2175 \
duke@0 2176 notproduct(bool, TimeCompiler, false, \
duke@0 2177 "time the compiler") \
duke@0 2178 \
duke@0 2179 notproduct(bool, TimeCompiler2, false, \
duke@0 2180 "detailed time the compiler (requires +TimeCompiler)") \
duke@0 2181 \
duke@0 2182 diagnostic(bool, PrintInlining, false, \
duke@0 2183 "prints inlining optimizations") \
duke@0 2184 \
duke@0 2185 diagnostic(bool, PrintIntrinsics, false, \
duke@0 2186 "prints attempted and successful inlining of intrinsics") \
duke@0 2187 \
twisti@747 2188 product(bool, UseCountLeadingZerosInstruction, false, \
twisti@747 2189 "Use count leading zeros instruction") \
twisti@747 2190 \
twisti@620 2191 product(bool, UsePopCountInstruction, false, \
twisti@620 2192 "Use population count instruction") \
twisti@620 2193 \
duke@0 2194 diagnostic(ccstrlist, DisableIntrinsic, "", \
duke@0 2195 "do not expand intrinsics whose (internal) names appear here") \
duke@0 2196 \
duke@0 2197 develop(bool, StressReflectiveCode, false, \
duke@0 2198 "Use inexact types at allocations, etc., to test reflection") \
duke@0 2199 \
duke@0 2200 develop(bool, EagerInitialization, false, \
duke@0 2201 "Eagerly initialize classes if possible") \
duke@0 2202 \
duke@0 2203 product(bool, Tier1UpdateMethodData, trueInTiered, \
duke@0 2204 "Update methodDataOops in Tier1-generated code") \
duke@0 2205 \
duke@0 2206 develop(bool, TraceMethodReplacement, false, \
duke@0 2207 "Print when methods are replaced do to recompilation") \
duke@0 2208 \
duke@0 2209 develop(bool, PrintMethodFlushing, false, \
duke@0 2210 "print the nmethods being flushed") \
duke@0 2211 \
duke@0 2212 notproduct(bool, LogMultipleMutexLocking, false, \
duke@0 2213 "log locking and unlocking of mutexes (only if multiple locks " \
duke@0 2214 "are held)") \
duke@0 2215 \
duke@0 2216 develop(bool, UseRelocIndex, false, \
duke@0 2217 "use an index to speed random access to relocations") \
duke@0 2218 \
duke@0 2219 develop(bool, StressCodeBuffers, false, \
duke@0 2220 "Exercise code buffer expansion and other rare state changes") \
duke@0 2221 \
duke@0 2222 diagnostic(bool, DebugNonSafepoints, trueInDebug, \
duke@0 2223 "Generate extra debugging info for non-safepoints in nmethods") \
duke@0 2224 \
duke@0 2225 diagnostic(bool, DebugInlinedCalls, true, \
duke@0 2226 "If false, restricts profiled locations to the root method only") \
duke@0 2227 \
duke@0 2228 product(bool, PrintVMOptions, trueInDebug, \
duke@0 2229 "print VM flag settings") \
duke@0 2230 \
kvn@521 2231 product(bool, IgnoreUnrecognizedVMOptions, false, \
kvn@521 2232 "Ignore unrecognized VM options") \
kvn@521 2233 \
duke@0 2234 diagnostic(bool, SerializeVMOutput, true, \
duke@0 2235 "Use a mutex to serialize output to tty and hotspot.log") \
duke@0 2236 \
duke@0 2237 diagnostic(bool, DisplayVMOutput, true, \
duke@0 2238 "Display all VM output on the tty, independently of LogVMOutput") \
duke@0 2239 \
duke@0 2240 diagnostic(bool, LogVMOutput, trueInDebug, \
duke@0 2241 "Save VM output to hotspot.log, or to LogFile") \
duke@0 2242 \
duke@0 2243 diagnostic(ccstr, LogFile, NULL, \
duke@0 2244 "If LogVMOutput is on, save VM output to this file [hotspot.log]") \
duke@0 2245 \
duke@0 2246 product(ccstr, ErrorFile, NULL, \
duke@0 2247 "If an error occurs, save the error data to this file " \
duke@0 2248 "[default: ./hs_err_pid%p.log] (%p replaced with pid)") \
duke@0 2249 \
duke@0 2250 product(bool, DisplayVMOutputToStderr, false, \
duke@0 2251 "If DisplayVMOutput is true, display all VM output to stderr") \
duke@0 2252 \
duke@0 2253 product(bool, DisplayVMOutputToStdout, false, \
duke@0 2254 "If DisplayVMOutput is true, display all VM output to stdout") \
duke@0 2255 \
duke@0 2256 product(bool, UseHeavyMonitors, false, \
duke@0 2257 "use heavyweight instead of lightweight Java monitors") \
duke@0 2258 \
duke@0 2259 notproduct(bool, PrintSymbolTableSizeHistogram, false, \
duke@0 2260 "print histogram of the symbol table") \
duke@0 2261 \
duke@0 2262 notproduct(bool, ExitVMOnVerifyError, false, \
duke@0 2263 "standard exit from VM if bytecode verify error " \
duke@0 2264 "(only in debug mode)") \
duke@0 2265 \
duke@0 2266 notproduct(ccstr, AbortVMOnException, NULL, \
duke@0 2267 "Call fatal if this exception is thrown. Example: " \
duke@0 2268 "java -XX:AbortVMOnException=java.lang.NullPointerException Foo") \
duke@0 2269 \
duke@0 2270 develop(bool, DebugVtables, false, \
duke@0 2271 "add debugging code to vtable dispatch") \
duke@0 2272 \
duke@0 2273 develop(bool, PrintVtables, false, \
duke@0 2274 "print vtables when printing klass") \
duke@0 2275 \
duke@0 2276 notproduct(bool, PrintVtableStats, false, \
duke@0 2277 "print vtables stats at end of run") \
duke@0 2278 \
duke@0 2279 develop(bool, TraceCreateZombies, false, \
duke@0 2280 "trace creation of zombie nmethods") \
duke@0 2281 \
duke@0 2282 notproduct(bool, IgnoreLockingAssertions, false, \
duke@0 2283 "disable locking assertions (for speed)") \
duke@0 2284 \
duke@0 2285 notproduct(bool, VerifyLoopOptimizations, false, \
duke@0 2286 "verify major loop optimizations") \
duke@0 2287 \
duke@0 2288 product(bool, RangeCheckElimination, true, \
duke@0 2289 "Split loop iterations to eliminate range checks") \
duke@0 2290 \
duke@0 2291 develop_pd(bool, UncommonNullCast, \
duke@0 2292 "track occurrences of null in casts; adjust compiler tactics") \
duke@0 2293 \
duke@0 2294 develop(bool, TypeProfileCasts, true, \
duke@0 2295 "treat casts like calls for purposes of type profiling") \
duke@0 2296 \
duke@0 2297 develop(bool, MonomorphicArrayCheck, true, \
duke@0 2298 "Uncommon-trap array store checks that require full type check") \
duke@0 2299 \
duke@0 2300 develop(bool, DelayCompilationDuringStartup, true, \
duke@0 2301 "Delay invoking the compiler until main application class is " \
duke@0 2302 "loaded") \
duke@0 2303 \
duke@0 2304 develop(bool, CompileTheWorld, false, \
duke@0 2305 "Compile all methods in all classes in bootstrap class path " \
duke@0 2306 "(stress test)") \
duke@0 2307 \
duke@0 2308 develop(bool, CompileTheWorldPreloadClasses, true, \
duke@0 2309 "Preload all classes used by a class before start loading") \
duke@0 2310 \
duke@0 2311 notproduct(bool, CompileTheWorldIgnoreInitErrors, false, \
duke@0 2312 "Compile all methods although class initializer failed") \
duke@0 2313 \
duke@0 2314 develop(bool, TraceIterativeGVN, false, \
duke@0 2315 "Print progress during Iterative Global Value Numbering") \
duke@0 2316 \
duke@0 2317 develop(bool, FillDelaySlots, true, \
duke@0 2318 "Fill delay slots (on SPARC only)") \
duke@0 2319 \
duke@0 2320 develop(bool, VerifyIterativeGVN, false, \
duke@0 2321 "Verify Def-Use modifications during sparse Iterative Global " \
duke@0 2322 "Value Numbering") \
duke@0 2323 \
duke@0 2324 notproduct(bool, TracePhaseCCP, false, \
duke@0 2325 "Print progress during Conditional Constant Propagation") \
duke@0 2326 \
duke@0 2327 develop(bool, TimeLivenessAnalysis, false, \
duke@0 2328 "Time computation of bytecode liveness analysis") \
duke@0 2329 \
duke@0 2330 develop(bool, TraceLivenessGen, false, \
duke@0 2331 "Trace the generation of liveness analysis information") \
duke@0 2332 \
duke@0 2333 notproduct(bool, TraceLivenessQuery, false, \
duke@0 2334 "Trace queries of liveness analysis information") \
duke@0 2335 \
duke@0 2336 notproduct(bool, CollectIndexSetStatistics, false, \
duke@0 2337 "Collect information about IndexSets") \
duke@0 2338 \
duke@0 2339 develop(bool, PrintDominators, false, \
duke@0 2340 "Print out dominator trees for GVN") \
duke@0 2341 \
duke@0 2342 develop(bool, UseLoopSafepoints, true, \
duke@0 2343 "Generate Safepoint nodes in every loop") \
duke@0 2344 \
duke@0 2345 notproduct(bool, TraceCISCSpill, false, \
duke@0 2346 "Trace allocators use of cisc spillable instructions") \
duke@0 2347 \
duke@0 2348 notproduct(bool, TraceSpilling, false, \
duke@0 2349 "Trace spilling") \
duke@0 2350 \
duke@0 2351 develop(bool, DeutschShiffmanExceptions, true, \
duke@0 2352 "Fast check to find exception handler for precisely typed " \
duke@0 2353 "exceptions") \
duke@0 2354 \
duke@0 2355 product(bool, SplitIfBlocks, true, \
duke@0 2356 "Clone compares and control flow through merge points to fold " \
duke@0 2357 "some branches") \
duke@0 2358 \
duke@0 2359 develop(intx, FastAllocateSizeLimit, 128*K, \
duke@0 2360 /* Note: This value is zero mod 1<<13 for a cheap sparc set. */ \
duke@0 2361 "Inline allocations larger than this in doublewords must go slow")\
duke@0 2362 \
duke@0 2363 product(bool, AggressiveOpts, false, \
duke@0 2364 "Enable aggressive optimizations - see arguments.cpp") \
duke@0 2365 \
kvn@193 2366 product(bool, UseStringCache, false, \
kvn@193 2367 "Enable String cache capabilities on String.java") \
kvn@193 2368 \
duke@0 2369 /* statistics */ \
duke@0 2370 develop(bool, UseVTune, false, \
duke@0 2371 "enable support for Intel's VTune profiler") \
duke@0 2372 \
duke@0 2373 develop(bool, CountCompiledCalls, false, \
duke@0 2374 "counts method invocations") \
duke@0 2375 \
duke@0 2376 notproduct(bool, CountRuntimeCalls, false, \
duke@0 2377 "counts VM runtime calls") \
duke@0 2378 \
duke@0 2379 develop(bool, CountJNICalls, false, \
duke@0 2380 "counts jni method invocations") \
duke@0 2381 \
duke@0 2382 notproduct(bool, CountJVMCalls, false, \
duke@0 2383 "counts jvm method invocations") \
duke@0 2384 \
duke@0 2385 notproduct(bool, CountRemovableExceptions, false, \
duke@0 2386 "count exceptions that could be replaced by branches due to " \
duke@0 2387 "inlining") \
duke@0 2388 \
duke@0 2389 notproduct(bool, ICMissHistogram, false, \
duke@0 2390 "produce histogram of IC misses") \
duke@0 2391 \
duke@0 2392 notproduct(bool, PrintClassStatistics, false, \
duke@0 2393 "prints class statistics at end of run") \
duke@0 2394 \
duke@0 2395 notproduct(bool, PrintMethodStatistics, false, \
duke@0 2396 "prints method statistics at end of run") \
duke@0 2397 \
duke@0 2398 /* interpreter */ \
duke@0 2399 develop(bool, ClearInterpreterLocals, false, \
duke@0 2400 "Always clear local variables of interpreter activations upon " \
duke@0 2401 "entry") \
duke@0 2402 \
duke@0 2403 product_pd(bool, RewriteBytecodes, \
duke@0 2404 "Allow rewriting of bytecodes (bytecodes are not immutable)") \
duke@0 2405 \
duke@0 2406 product_pd(bool, RewriteFrequentPairs, \
duke@0 2407 "Rewrite frequently used bytecode pairs into a single bytecode") \
duke@0 2408 \
jrose@78 2409 diagnostic(bool, PrintInterpreter, false, \
duke@0 2410 "Prints the generated interpreter code") \
duke@0 2411 \
duke@0 2412 product(bool, UseInterpreter, true, \
duke@0 2413 "Use interpreter for non-compiled methods") \
duke@0 2414 \
duke@0 2415 develop(bool, UseFastSignatureHandlers, true, \
duke@0 2416 "Use fast signature handlers for native calls") \
duke@0 2417 \
duke@0 2418 develop(bool, UseV8InstrsOnly, false, \
duke@0 2419 "Use SPARC-V8 Compliant instruction subset") \
duke@0 2420 \
duke@0 2421 product(bool, UseNiagaraInstrs, false, \
duke@0 2422 "Use Niagara-efficient instruction subset") \
duke@0 2423 \
duke@0 2424 develop(bool, UseCASForSwap, false, \
duke@0 2425 "Do not use swap instructions, but only CAS (in a loop) on SPARC")\
duke@0 2426 \
duke@0 2427 product(bool, UseLoopCounter, true, \
duke@0 2428 "Increment invocation counter on backward branch") \
duke@0 2429 \
duke@0 2430 product(bool, UseFastEmptyMethods, true, \
duke@0 2431 "Use fast method entry code for empty methods") \
duke@0 2432 \
duke@0 2433 product(bool, UseFastAccessorMethods, true, \
duke@0 2434 "Use fast method entry code for accessor methods") \
duke@0 2435 \
duke@0 2436 product_pd(bool, UseOnStackReplacement, \
duke@0 2437 "Use on stack replacement, calls runtime if invoc. counter " \
duke@0 2438 "overflows in loop") \
duke@0 2439 \
duke@0 2440 notproduct(bool, TraceOnStackReplacement, false, \
duke@0 2441 "Trace on stack replacement") \
duke@0 2442 \
duke@0 2443 develop(bool, PoisonOSREntry, true, \
duke@0 2444 "Detect abnormal calls to OSR code") \
duke@0 2445 \
duke@0 2446 product_pd(bool, PreferInterpreterNativeStubs, \
duke@0 2447 "Use always interpreter stubs for native methods invoked via " \
duke@0 2448 "interpreter") \
duke@0 2449 \
duke@0 2450 develop(bool, CountBytecodes, false, \
duke@0 2451 "Count number of bytecodes executed") \
duke@0 2452 \
duke@0 2453 develop(bool, PrintBytecodeHistogram, false, \
duke@0 2454 "Print histogram of the executed bytecodes") \
duke@0 2455 \
duke@0 2456 develop(bool, PrintBytecodePairHistogram, false, \
duke@0 2457 "Print histogram of the executed bytecode pairs") \
duke@0 2458 \
jrose@78 2459 diagnostic(bool, PrintSignatureHandlers, false, \
duke@0 2460 "Print code generated for native method signature handlers") \
duke@0 2461 \
duke@0 2462 develop(bool, VerifyOops, false, \
duke@0 2463 "Do plausibility checks for oops") \
duke@0 2464 \
duke@0 2465 develop(bool, CheckUnhandledOops, false, \
duke@0 2466 "Check for unhandled oops in VM code") \
duke@0 2467 \
duke@0 2468 develop(bool, VerifyJNIFields, trueInDebug, \
duke@0 2469 "Verify jfieldIDs for instance fields") \
duke@0 2470 \
duke@0 2471 notproduct(bool, VerifyJNIEnvThread, false, \
duke@0 2472 "Verify JNIEnv.thread == Thread::current() when entering VM " \
duke@0 2473 "from JNI") \
duke@0 2474 \
duke@0 2475 develop(bool, VerifyFPU, false, \
duke@0 2476 "Verify FPU state (check for NaN's, etc.)") \
duke@0 2477 \
duke@0 2478 develop(bool, VerifyThread, false, \
duke@0 2479 "Watch the thread register for corruption (SPARC only)") \
duke@0 2480 \
duke@0 2481 develop(bool, VerifyActivationFrameSize, false, \
duke@0 2482 "Verify that activation frame didn't become smaller than its " \
duke@0 2483 "minimal size") \
duke@0 2484 \
duke@0 2485 develop(bool, TraceFrequencyInlining, false, \
duke@0 2486 "Trace frequency based inlining") \
duke@0 2487 \
duke@0 2488 notproduct(bool, TraceTypeProfile, false, \
duke@0 2489 "Trace type profile") \
duke@0 2490 \
duke@0 2491 develop_pd(bool, InlineIntrinsics, \
duke@0 2492 "Inline intrinsics that can be statically resolved") \
duke@0 2493 \
duke@0 2494 product_pd(bool, ProfileInterpreter, \
duke@0 2495 "Profile at the bytecode level during interpretation") \
duke@0 2496 \
duke@0 2497 develop_pd(bool, ProfileTraps, \
duke@0 2498 "Profile deoptimization traps at the bytecode level") \
duke@0 2499 \
duke@0 2500 product(intx, ProfileMaturityPercentage, 20, \
duke@0 2501 "number of method invocations/branches (expressed as % of " \
duke@0 2502 "CompileThreshold) before using the method's profile") \
duke@0 2503 \
duke@0 2504 develop(bool, PrintMethodData, false, \
duke@0 2505 "Print the results of +ProfileInterpreter at end of run") \
duke@0 2506 \
duke@0 2507 develop(bool, VerifyDataPointer, trueInDebug, \
duke@0 2508 "Verify the method data pointer during interpreter profiling") \
duke@0 2509 \
duke@0 2510 develop(bool, VerifyCompiledCode, false, \
duke@0 2511 "Include miscellaneous runtime verifications in nmethod code; " \
duke@0 2512 "off by default because it disturbs nmethod size heuristics.") \
duke@0 2513 \
duke@0 2514 \
duke@0 2515 /* compilation */ \
duke@0 2516 product(bool, UseCompiler, true, \
duke@0 2517 "use compilation") \
duke@0 2518 \
duke@0 2519 develop(bool, TraceCompilationPolicy, false, \
duke@0 2520 "Trace compilation policy") \
duke@0 2521 \
duke@0 2522 develop(bool, TimeCompilationPolicy, false, \
duke@0 2523 "Time the compilation policy") \
duke@0 2524 \
duke@0 2525 product(bool, UseCounterDecay, true, \
duke@0 2526 "adjust recompilation counters") \
duke@0 2527 \
duke@0 2528 develop(intx, CounterHalfLifeTime, 30, \
duke@0 2529 "half-life time of invocation counters (in secs)") \
duke@0 2530 \
duke@0 2531 develop(intx, CounterDecayMinIntervalLength, 500, \
duke@0 2532 "Min. ms. between invocation of CounterDecay") \
duke@0 2533 \
duke@0 2534 product(bool, AlwaysCompileLoopMethods, false, \
duke@0 2535 "when using recompilation, never interpret methods " \
duke@0 2536 "containing loops") \
duke@0 2537 \
duke@0 2538 product(bool, DontCompileHugeMethods, true, \
duke@0 2539 "don't compile methods > HugeMethodLimit") \
duke@0 2540 \
duke@0 2541 /* Bytecode escape analysis estimation. */ \
duke@0 2542 product(bool, EstimateArgEscape, true, \
duke@0 2543 "Analyze bytecodes to estimate escape state of arguments") \
duke@0 2544 \
duke@0 2545 product(intx, BCEATraceLevel, 0, \
duke@0 2546 "How much tracing to do of bytecode escape analysis estimates") \
duke@0 2547 \
duke@0 2548 product(intx, MaxBCEAEstimateLevel, 5, \
duke@0 2549 "Maximum number of nested calls that are analyzed by BC EA.") \
duke@0 2550 \
duke@0 2551 product(intx, MaxBCEAEstimateSize, 150, \
duke@0 2552 "Maximum bytecode size of a method to be analyzed by BC EA.") \
duke@0 2553 \
duke@0 2554 product(intx, AllocatePrefetchStyle, 1, \
duke@0 2555 "0 = no prefetch, " \
duke@0 2556 "1 = prefetch instructions for each allocation, " \
duke@0 2557 "2 = use TLAB watermark to gate allocation prefetch") \
duke@0 2558 \
duke@0 2559 product(intx, AllocatePrefetchDistance, -1, \
duke@0 2560 "Distance to prefetch ahead of allocation pointer") \
duke@0 2561 \
duke@0 2562 product(intx, AllocatePrefetchLines, 1, \
duke@0 2563 "Number of lines to prefetch ahead of allocation pointer") \
duke@0 2564 \
duke@0 2565 product(intx, AllocatePrefetchStepSize, 16, \
duke@0 2566 "Step size in bytes of sequential prefetch instructions") \
duke@0 2567 \
duke@0 2568 product(intx, AllocatePrefetchInstr, 0, \
duke@0 2569 "Prefetch instruction to prefetch ahead of allocation pointer") \
duke@0 2570 \
duke@0 2571 product(intx, ReadPrefetchInstr, 0, \
duke@0 2572 "Prefetch instruction to prefetch ahead") \
duke@0 2573 \
duke@0 2574 /* deoptimization */ \
duke@0 2575 develop(bool, TraceDeoptimization, false, \
duke@0 2576 "Trace deoptimization") \
duke@0 2577 \
duke@0 2578 develop(bool, DebugDeoptimization, false, \
duke@0 2579 "Tracing various information while debugging deoptimization") \
duke@0 2580 \
duke@0 2581 product(intx, SelfDestructTimer, 0, \
duke@0 2582 "Will cause VM to terminate after a given time (in minutes) " \
duke@0 2583 "(0 means off)") \
duke@0 2584 \
duke@0 2585 product(intx, MaxJavaStackTraceDepth, 1024, \
duke@0 2586 "Max. no. of lines in the stack trace for Java exceptions " \
duke@0 2587 "(0 means all)") \
duke@0 2588 \
duke@0 2589 develop(intx, GuaranteedSafepointInterval, 1000, \
duke@0 2590 "Guarantee a safepoint (at least) every so many milliseconds " \
duke@0 2591 "(0 means none)") \
duke@0 2592 \
duke@0 2593 product(intx, SafepointTimeoutDelay, 10000, \
duke@0 2594 "Delay in milliseconds for option SafepointTimeout") \
duke@0 2595 \
duke@0 2596 product(intx, NmethodSweepFraction, 4, \
duke@0 2597 "Number of invocations of sweeper to cover all nmethods") \
duke@0 2598 \
duke@0 2599 notproduct(intx, MemProfilingInterval, 500, \
duke@0 2600 "Time between each invocation of the MemProfiler") \
duke@0 2601 \
duke@0 2602 develop(intx, MallocCatchPtr, -1, \
duke@0 2603 "Hit breakpoint when mallocing/freeing this pointer") \
duke@0 2604 \
duke@0 2605 notproduct(intx, AssertRepeat, 1, \
duke@0 2606 "number of times to evaluate expression in assert " \
duke@0 2607 "(to estimate overhead); only works with -DUSE_REPEATED_ASSERTS") \
duke@0 2608 \
duke@0 2609 notproduct(ccstrlist, SuppressErrorAt, "", \
duke@0 2610 "List of assertions (file:line) to muzzle") \
duke@0 2611 \
duke@0 2612 notproduct(uintx, HandleAllocationLimit, 1024, \
duke@0 2613 "Threshold for HandleMark allocation when +TraceHandleAllocation "\
duke@0 2614 "is used") \
duke@0 2615 \
duke@0 2616 develop(uintx, TotalHandleAllocationLimit, 1024, \
duke@0 2617 "Threshold for total handle allocation when " \
duke@0 2618 "+TraceHandleAllocation is used") \
duke@0 2619 \
duke@0 2620 develop(intx, StackPrintLimit, 100, \
duke@0 2621 "number of stack frames to print in VM-level stack dump") \
duke@0 2622 \
duke@0 2623 notproduct(intx, MaxElementPrintSize, 256, \
duke@0 2624 "maximum number of elements to print") \
duke@0 2625 \
duke@0 2626 notproduct(intx, MaxSubklassPrintSize, 4, \
duke@0 2627 "maximum number of subklasses to print when printing klass") \
duke@0 2628 \
duke@0 2629 develop(intx, MaxInlineLevel, 9, \
duke@0 2630 "maximum number of nested calls that are inlined") \
duke@0 2631 \
duke@0 2632 develop(intx, MaxRecursiveInlineLevel, 1, \
duke@0 2633 "maximum number of nested recursive calls that are inlined") \
duke@0 2634 \
kvn@656 2635 product_pd(intx, InlineSmallCode, \
duke@0 2636 "Only inline already compiled methods if their code size is " \
duke@0 2637 "less than this") \
duke@0 2638 \
duke@0 2639 product(intx, MaxInlineSize, 35, \
duke@0 2640 "maximum bytecode size of a method to be inlined") \
duke@0 2641 \
duke@0 2642 product_pd(intx, FreqInlineSize, \
duke@0 2643 "maximum bytecode size of a frequent method to be inlined") \
duke@0 2644 \
duke@0 2645 develop(intx, MaxTrivialSize, 6, \
duke@0 2646 "maximum bytecode size of a trivial method to be inlined") \
duke@0 2647 \
duke@0 2648 develop(intx, MinInliningThreshold, 250, \
duke@0 2649 "min. invocation count a method needs to have to be inlined") \
duke@0 2650 \
duke@0 2651 develop(intx, AlignEntryCode, 4, \
duke@0 2652 "aligns entry code to specified value (in bytes)") \
duke@0 2653 \
duke@0 2654 develop(intx, MethodHistogramCutoff, 100, \
duke@0 2655 "cutoff value for method invoc. histogram (+CountCalls)") \
duke@0 2656 \
duke@0 2657 develop(intx, ProfilerNumberOfInterpretedMethods, 25, \
duke@0 2658 "# of interpreted methods to show in profile") \
duke@0 2659 \
duke@0 2660 develop(intx, ProfilerNumberOfCompiledMethods, 25, \
duke@0 2661 "# of compiled methods to show in profile") \
duke@0 2662 \
duke@0 2663 develop(intx, ProfilerNumberOfStubMethods, 25, \
duke@0 2664 "# of stub methods to show in profile") \
duke@0 2665 \
duke@0 2666 develop(intx, ProfilerNumberOfRuntimeStubNodes, 25, \
duke@0 2667 "# of runtime stub nodes to show in profile") \
duke@0 2668 \
duke@0 2669 product(intx, ProfileIntervalsTicks, 100, \
duke@0 2670 "# of ticks between printing of interval profile " \
duke@0 2671 "(+ProfileIntervals)") \
duke@0 2672 \
duke@0 2673 notproduct(intx, ScavengeALotInterval, 1, \
duke@0 2674 "Interval between which scavenge will occur with +ScavengeALot") \
duke@0 2675 \
duke@0 2676 notproduct(intx, FullGCALotInterval, 1, \
duke@0 2677 "Interval between which full gc will occur with +FullGCALot") \
duke@0 2678 \
duke@0 2679 notproduct(intx, FullGCALotStart, 0, \
duke@0 2680 "For which invocation to start FullGCAlot") \
duke@0 2681 \
duke@0 2682 notproduct(intx, FullGCALotDummies, 32*K, \
duke@0 2683 "Dummy object allocated with +FullGCALot, forcing all objects " \
duke@0 2684 "to move") \
duke@0 2685 \
duke@0 2686 develop(intx, DontYieldALotInterval, 10, \
duke@0 2687 "Interval between which yields will be dropped (milliseconds)") \
duke@0 2688 \
duke@0 2689 develop(intx, MinSleepInterval, 1, \
duke@0 2690 "Minimum sleep() interval (milliseconds) when " \
duke@0 2691 "ConvertSleepToYield is off (used for SOLARIS)") \
duke@0 2692 \
duke@0 2693 product(intx, EventLogLength, 2000, \
duke@0 2694 "maximum nof events in event log") \
duke@0 2695 \
duke@0 2696 develop(intx, ProfilerPCTickThreshold, 15, \
duke@0 2697 "Number of ticks in a PC buckets to be a hotspot") \
duke@0 2698 \
duke@0 2699 notproduct(intx, DeoptimizeALotInterval, 5, \
duke@0 2700 "Number of exits until DeoptimizeALot kicks in") \
duke@0 2701 \
duke@0 2702 notproduct(intx, ZombieALotInterval, 5, \
duke@0 2703 "Number of exits until ZombieALot kicks in") \
duke@0 2704 \
duke@0 2705 develop(bool, StressNonEntrant, false, \
duke@0 2706 "Mark nmethods non-entrant at registration") \
duke@0 2707 \
duke@0 2708 diagnostic(intx, MallocVerifyInterval, 0, \
duke@0 2709 "if non-zero, verify C heap after every N calls to " \
duke@0 2710 "malloc/realloc/free") \
duke@0 2711 \
duke@0 2712 diagnostic(intx, MallocVerifyStart, 0, \
duke@0 2713 "if non-zero, start verifying C heap after Nth call to " \
duke@0 2714 "malloc/realloc/free") \
duke@0 2715 \
duke@0 2716 product(intx, TypeProfileWidth, 2, \
duke@0 2717 "number of receiver types to record in call/cast profile") \
duke@0 2718 \
duke@0 2719 develop(intx, BciProfileWidth, 2, \
duke@0 2720 "number of return bci's to record in ret profile") \
duke@0 2721 \
duke@0 2722 product(intx, PerMethodRecompilationCutoff, 400, \
duke@0 2723 "After recompiling N times, stay in the interpreter (-1=>'Inf')") \
duke@0 2724 \
duke@0 2725 product(intx, PerBytecodeRecompilationCutoff, 100, \
duke@0 2726 "Per-BCI limit on repeated recompilation (-1=>'Inf')") \
duke@0 2727 \
duke@0 2728 product(intx, PerMethodTrapLimit, 100, \
duke@0 2729 "Limit on traps (of one kind) in a method (includes inlines)") \
duke@0 2730 \
duke@0 2731 product(intx, PerBytecodeTrapLimit, 4, \
duke@0 2732 "Limit on traps (of one kind) at a particular BCI") \
duke@0 2733 \
duke@0 2734 develop(intx, FreqCountInvocations, 1, \
duke@0 2735 "Scaling factor for branch frequencies (deprecated)") \
duke@0 2736 \
duke@0 2737 develop(intx, InlineFrequencyRatio, 20, \
duke@0 2738 "Ratio of call site execution to caller method invocation") \
duke@0 2739 \
duke@0 2740 develop_pd(intx, InlineFrequencyCount, \
duke@0 2741 "Count of call site execution necessary to trigger frequent " \
duke@0 2742 "inlining") \
duke@0 2743 \
duke@0 2744 develop(intx, InlineThrowCount, 50, \
duke@0 2745 "Force inlining of interpreted methods that throw this often") \
duke@0 2746 \
duke@0 2747 develop(intx, InlineThrowMaxSize, 200, \
duke@0 2748 "Force inlining of throwing methods smaller than this") \
duke@0 2749 \
duke@0 2750 product(intx, AliasLevel, 3, \
duke@0 2751 "0 for no aliasing, 1 for oop/field/static/array split, " \
duke@0 2752 "2 for class split, 3 for unique instances") \
duke@0 2753 \
duke@0 2754 develop(bool, VerifyAliases, false, \
duke@0 2755 "perform extra checks on the results of alias analysis") \
duke@0 2756 \
duke@0 2757 develop(intx, ProfilerNodeSize, 1024, \
duke@0 2758 "Size in K to allocate for the Profile Nodes of each thread") \
duke@0 2759 \
duke@0 2760 develop(intx, V8AtomicOperationUnderLockSpinCount, 50, \
duke@0 2761 "Number of times to spin wait on a v8 atomic operation lock") \
duke@0 2762 \
duke@0 2763 product(intx, ReadSpinIterations, 100, \
duke@0 2764 "Number of read attempts before a yield (spin inner loop)") \
duke@0 2765 \
duke@0 2766 product_pd(intx, PreInflateSpin, \
duke@0 2767 "Number of times to spin wait before inflation") \
duke@0 2768 \
duke@0 2769 product(intx, PreBlockSpin, 10, \
duke@0 2770 "Number of times to spin in an inflated lock before going to " \
duke@0 2771 "an OS lock") \
duke@0 2772 \
duke@0 2773 /* gc parameters */ \
duke@0 2774 product(uintx, MaxHeapSize, ScaleForWordSize(64*M), \
duke@0 2775 "Default maximum size for object heap (in bytes)") \
duke@0 2776 \
duke@0 2777 product_pd(uintx, NewSize, \
duke@0 2778 "Default size of new generation (in bytes)") \
duke@0 2779 \
duke@0 2780 product(uintx, MaxNewSize, max_uintx, \
duke@0 2781 "Maximum size of new generation (in bytes)") \
duke@0 2782 \
duke@0 2783 product(uintx, PretenureSizeThreshold, 0, \
duke@0 2784 "Max size in bytes of objects allocated in DefNew generation") \
duke@0 2785 \
duke@0 2786 product_pd(uintx, TLABSize, \
duke@0 2787 "Default (or starting) size of TLAB (in bytes)") \
duke@0 2788 \
duke@0 2789 product(uintx, MinTLABSize, 2*K, \
duke@0 2790 "Minimum allowed TLAB size (in bytes)") \
duke@0 2791 \
duke@0 2792 product(uintx, TLABAllocationWeight, 35, \
duke@0 2793 "Allocation averaging weight") \
duke@0 2794 \
duke@0 2795 product(uintx, TLABWasteTargetPercent, 1, \
duke@0 2796 "Percentage of Eden that can be wasted") \
duke@0 2797 \
duke@0 2798 product(uintx, TLABRefillWasteFraction, 64, \
duke@0 2799 "Max TLAB waste at a refill (internal fragmentation)") \
duke@0 2800 \
duke@0 2801 product(uintx, TLABWasteIncrement, 4, \
duke@0 2802 "Increment allowed waste at slow allocation") \
duke@0 2803 \
duke@0 2804 product_pd(intx, SurvivorRatio, \
duke@0 2805 "Ratio of eden/survivor space size") \
duke@0 2806 \
duke@0 2807 product_pd(intx, NewRatio, \
duke@0 2808 "Ratio of new/old generation sizes") \
duke@0 2809 \
duke@0 2810 product(uintx, MaxLiveObjectEvacuationRatio, 100, \
duke@0 2811 "Max percent of eden objects that will be live at scavenge") \
duke@0 2812 \
duke@0 2813 product_pd(uintx, NewSizeThreadIncrease, \
duke@0 2814 "Additional size added to desired new generation size per " \
duke@0 2815 "non-daemon thread (in bytes)") \
duke@0 2816 \
duke@0 2817 product(uintx, OldSize, ScaleForWordSize(4096*K), \
duke@0 2818 "Default size of tenured generation (in bytes)") \
duke@0 2819 \
duke@0 2820 product_pd(uintx, PermSize, \
duke@0 2821 "Default size of permanent generation (in bytes)") \
duke@0 2822 \
duke@0 2823 product_pd(uintx, MaxPermSize, \
duke@0 2824 "Maximum size of permanent generation (in bytes)") \
duke@0 2825 \
duke@0 2826 product(uintx, MinHeapFreeRatio, 40, \
duke@0 2827 "Min percentage of heap free after GC to avoid expansion") \
duke@0 2828 \
duke@0 2829 product(uintx, MaxHeapFreeRatio, 70, \
duke@0 2830 "Max percentage of heap free after GC to avoid shrinking") \
duke@0 2831 \
duke@0 2832 product(intx, SoftRefLRUPolicyMSPerMB, 1000, \
duke@0 2833 "Number of milliseconds per MB of free space in the heap") \
duke@0 2834 \
duke@0 2835 product(uintx, MinHeapDeltaBytes, ScaleForWordSize(128*K), \
duke@0 2836 "Min change in heap space due to GC (in bytes)") \
duke@0 2837 \
duke@0 2838 product(uintx, MinPermHeapExpansion, ScaleForWordSize(256*K), \
duke@0 2839 "Min expansion of permanent heap (in bytes)") \
duke@0 2840 \
duke@0 2841 product(uintx, MaxPermHeapExpansion, ScaleForWordSize(4*M), \
duke@0 2842 "Max expansion of permanent heap without full GC (in bytes)") \
duke@0 2843 \
duke@0 2844 product(intx, QueuedAllocationWarningCount, 0, \
duke@0 2845 "Number of times an allocation that queues behind a GC " \
duke@0 2846 "will retry before printing a warning") \
duke@0 2847 \
duke@0 2848 diagnostic(uintx, VerifyGCStartAt, 0, \
duke@0 2849 "GC invoke count where +VerifyBefore/AfterGC kicks in") \
duke@0 2850 \
duke@0 2851 diagnostic(intx, VerifyGCLevel, 0, \
duke@0 2852 "Generation level at which to start +VerifyBefore/AfterGC") \
duke@0 2853 \
duke@0 2854 develop(uintx, ExitAfterGCNum, 0, \
duke@0 2855 "If non-zero, exit after this GC.") \
duke@0 2856 \
duke@0 2857 product(intx, MaxTenuringThreshold, 15, \
duke@0 2858 "Maximum value for tenuring threshold") \
duke@0 2859 \
duke@0 2860 product(intx, InitialTenuringThreshold, 7, \
duke@0 2861 "Initial value for tenuring threshold") \
duke@0 2862 \
duke@0 2863 product(intx, TargetSurvivorRatio, 50, \
duke@0 2864 "Desired percentage of survivor space used after scavenge") \
duke@0 2865 \
jcoomes@437 2866 product(uintx, MarkSweepDeadRatio, 5, \
duke@0 2867 "Percentage (0-100) of the old gen allowed as dead wood." \
duke@0 2868 "Serial mark sweep treats this as both the min and max value." \
duke@0 2869 "CMS uses this value only if it falls back to mark sweep." \
duke@0 2870 "Par compact uses a variable scale based on the density of the" \
duke@0 2871 "generation and treats this as the max value when the heap is" \
duke@0 2872 "either completely full or completely empty. Par compact also" \
duke@0 2873 "has a smaller default value; see arguments.cpp.") \
duke@0 2874 \
jcoomes@437 2875 product(uintx, PermMarkSweepDeadRatio, 20, \
duke@0 2876 "Percentage (0-100) of the perm gen allowed as dead wood." \
duke@0 2877 "See MarkSweepDeadRatio for collector-specific comments.") \
duke@0 2878 \
duke@0 2879 product(intx, MarkSweepAlwaysCompactCount, 4, \
duke@0 2880 "How often should we fully compact the heap (ignoring the dead " \
duke@0 2881 "space parameters)") \
duke@0 2882 \
duke@0 2883 product(intx, PrintCMSStatistics, 0, \
duke@0 2884 "Statistics for CMS") \
duke@0 2885 \
duke@0 2886 product(bool, PrintCMSInitiationStatistics, false, \
duke@0 2887 "Statistics for initiating a CMS collection") \
duke@0 2888 \
duke@0 2889 product(intx, PrintFLSStatistics, 0, \
duke@0 2890 "Statistics for CMS' FreeListSpace") \
duke@0 2891 \
duke@0 2892 product(intx, PrintFLSCensus, 0, \
duke@0 2893 "Census for CMS' FreeListSpace") \
duke@0 2894 \
duke@0 2895 develop(uintx, GCExpandToAllocateDelayMillis, 0, \
duke@0 2896 "Delay in ms between expansion and allocation") \
duke@0 2897 \
duke@0 2898 product(intx, DeferThrSuspendLoopCount, 4000, \
duke@0 2899 "(Unstable) Number of times to iterate in safepoint loop " \
duke@0 2900 " before blocking VM threads ") \
duke@0 2901 \
duke@0 2902 product(intx, DeferPollingPageLoopCount, -1, \
duke@0 2903 "(Unsafe,Unstable) Number of iterations in safepoint loop " \
duke@0 2904 "before changing safepoint polling page to RO ") \
duke@0 2905 \
duke@0 2906 product(intx, SafepointSpinBeforeYield, 2000, "(Unstable)") \
duke@0 2907 \
duke@0 2908 product(bool, UseDepthFirstScavengeOrder, true, \
duke@0 2909 "true: the scavenge order will be depth-first, " \
duke@0 2910 "false: the scavenge order will be breadth-first") \
duke@0 2911 \
duke@0 2912 product(bool, PSChunkLargeArrays, true, \
duke@0 2913 "true: process large arrays in chunks") \
duke@0 2914 \
duke@0 2915 product(uintx, GCDrainStackTargetSize, 64, \
duke@0 2916 "how many entries we'll try to leave on the stack during " \
duke@0 2917 "parallel GC") \
duke@0 2918 \
ysr@344 2919 product(intx, DCQBarrierQueueBufferSize, 256, \
ysr@344 2920 "Number of elements in a dirty card queue buffer") \
ysr@344 2921 \
ysr@344 2922 product(intx, DCQBarrierProcessCompletedThreshold, 5, \
ysr@344 2923 "Number of completed dirty card buffers to trigger processing.") \
ysr@344 2924 \
duke@0 2925 /* stack parameters */ \
duke@0 2926 product_pd(intx, StackYellowPages, \
duke@0 2927 "Number of yellow zone (recoverable overflows) pages") \
duke@0 2928 \
duke@0 2929 product_pd(intx, StackRedPages, \
duke@0 2930 "Number of red zone (unrecoverable overflows) pages") \
duke@0 2931 \
duke@0 2932 product_pd(intx, StackShadowPages, \
duke@0 2933 "Number of shadow zone (for overflow checking) pages" \
duke@0 2934 " this should exceed the depth of the VM and native call stack") \
duke@0 2935 \
duke@0 2936 product_pd(intx, ThreadStackSize, \
duke@0 2937 "Thread Stack Size (in Kbytes)") \
duke@0 2938 \
duke@0 2939 product_pd(intx, VMThreadStackSize, \
duke@0 2940 "Non-Java Thread Stack Size (in Kbytes)") \
duke@0 2941 \
duke@0 2942 product_pd(intx, CompilerThreadStackSize, \
duke@0 2943 "Compiler Thread Stack Size (in Kbytes)") \
duke@0 2944 \
duke@0 2945 develop_pd(uintx, JVMInvokeMethodSlack, \
duke@0 2946 "Stack space (bytes) required for JVM_InvokeMethod to complete") \
duke@0 2947 \
duke@0 2948 product(uintx, ThreadSafetyMargin, 50*M, \
duke@0 2949 "Thread safety margin is used on fixed-stack LinuxThreads (on " \
duke@0 2950 "Linux/x86 only) to prevent heap-stack collision. Set to 0 to " \
duke@0 2951 "disable this feature") \
duke@0 2952 \
duke@0 2953 /* code cache parameters */ \
duke@0 2954 develop(uintx, CodeCacheSegmentSize, 64, \
duke@0 2955 "Code cache segment size (in bytes) - smallest unit of " \
duke@0 2956 "allocation") \
duke@0 2957 \
duke@0 2958 develop_pd(intx, CodeEntryAlignment, \
duke@0 2959 "Code entry alignment for generated code (in bytes)") \
duke@0 2960 \
duke@0 2961 product_pd(uintx, InitialCodeCacheSize, \
duke@0 2962 "Initial code cache size (in bytes)") \
duke@0 2963 \
duke@0 2964 product_pd(uintx, ReservedCodeCacheSize, \
duke@0 2965 "Reserved code cache size (in bytes) - maximum code cache size") \
duke@0 2966 \
duke@0 2967 product(uintx, CodeCacheMinimumFreeSpace, 500*K, \
duke@0 2968 "When less than X space left, we stop compiling.") \
duke@0 2969 \
duke@0 2970 product_pd(uintx, CodeCacheExpansionSize, \
duke@0 2971 "Code cache expansion size (in bytes)") \
duke@0 2972 \
duke@0 2973 develop_pd(uintx, CodeCacheMinBlockLength, \
duke@0 2974 "Minimum number of segments in a code cache block.") \
duke@0 2975 \
duke@0 2976 notproduct(bool, ExitOnFullCodeCache, false, \
duke@0 2977 "Exit the VM if we fill the code cache.") \
duke@0 2978 \
duke@0 2979 /* interpreter debugging */ \
duke@0 2980 develop(intx, BinarySwitchThreshold, 5, \
duke@0 2981 "Minimal number of lookupswitch entries for rewriting to binary " \
duke@0 2982 "switch") \
duke@0 2983 \
duke@0 2984 develop(intx, StopInterpreterAt, 0, \
duke@0 2985 "Stops interpreter execution at specified bytecode number") \
duke@0 2986 \
duke@0 2987 develop(intx, TraceBytecodesAt, 0, \
duke@0 2988 "Traces bytecodes starting with specified bytecode number") \
duke@0 2989 \
duke@0 2990 /* compiler interface */ \
duke@0 2991 develop(intx, CIStart, 0, \
duke@0 2992 "the id of the first compilation to permit") \
duke@0 2993 \
duke@0 2994 develop(intx, CIStop, -1, \
duke@0 2995 "the id of the last compilation to permit") \
duke@0 2996 \
duke@0 2997 develop(intx, CIStartOSR, 0, \
duke@0 2998 "the id of the first osr compilation to permit " \
duke@0 2999 "(CICountOSR must be on)") \
duke@0 3000 \
duke@0 3001 develop(intx, CIStopOSR, -1, \
duke@0 3002 "the id of the last osr compilation to permit " \
duke@0 3003 "(CICountOSR must be on)") \
duke@0 3004 \
duke@0 3005 develop(intx, CIBreakAtOSR, -1, \
duke@0 3006 "id of osr compilation to break at") \
duke@0 3007 \
duke@0 3008 develop(intx, CIBreakAt, -1, \
duke@0 3009 "id of compilation to break at") \
duke@0 3010 \
duke@0 3011 product(ccstrlist, CompileOnly, "", \
duke@0 3012 "List of methods (pkg/class.name) to restrict compilation to") \
duke@0 3013 \
duke@0 3014 product(ccstr, CompileCommandFile, NULL, \
duke@0 3015 "Read compiler commands from this file [.hotspot_compiler]") \
duke@0 3016 \
duke@0 3017 product(ccstrlist, CompileCommand, "", \
duke@0 3018 "Prepend to .hotspot_compiler; e.g. log,java/lang/String.<init>") \
duke@0 3019 \
duke@0 3020 product(bool, CICompilerCountPerCPU, false, \
duke@0 3021 "1 compiler thread for log(N CPUs)") \
duke@0 3022 \
duke@0 3023 develop(intx, CIFireOOMAt, -1, \
duke@0 3024 "Fire OutOfMemoryErrors throughout CI for testing the compiler " \
duke@0 3025 "(non-negative value throws OOM after this many CI accesses " \
duke@0 3026 "in each compile)") \
duke@0 3027 \
duke@0 3028 develop(intx, CIFireOOMAtDelay, -1, \
duke@0 3029 "Wait for this many CI accesses to occur in all compiles before " \
duke@0 3030 "beginning to throw OutOfMemoryErrors in each compile") \
duke@0 3031 \
duke@0 3032 /* Priorities */ \
duke@0 3033 product_pd(bool, UseThreadPriorities, "Use native thread priorities") \
duke@0 3034 \
duke@0 3035 product(intx, ThreadPriorityPolicy, 0, \
duke@0 3036 "0 : Normal. "\
duke@0 3037 " VM chooses priorities that are appropriate for normal "\
duke@0 3038 " applications. On Solaris NORM_PRIORITY and above are mapped "\
duke@0 3039 " to normal native priority. Java priorities below NORM_PRIORITY"\
duke@0 3040 " map to lower native priority values. On Windows applications"\
duke@0 3041 " are allowed to use higher native priorities. However, with "\
duke@0 3042 " ThreadPriorityPolicy=0, VM will not use the highest possible"\
duke@0 3043 " native priority, THREAD_PRIORITY_TIME_CRITICAL, as it may "\
duke@0 3044 " interfere with system threads. On Linux thread priorities "\
duke@0 3045 " are ignored because the OS does not support static priority "\
duke@0 3046 " in SCHED_OTHER scheduling class which is the only choice for"\
duke@0 3047 " non-root, non-realtime applications. "\
duke@0 3048 "1 : Aggressive. "\
duke@0 3049 " Java thread priorities map over to the entire range of "\
duke@0 3050 " native thread priorities. Higher Java thread priorities map "\
duke@0 3051 " to higher native thread priorities. This policy should be "\
duke@0 3052 " used with care, as sometimes it can cause performance "\
duke@0 3053 " degradation in the application and/or the entire system. On "\
duke@0 3054 " Linux this policy requires root privilege.") \
duke@0 3055 \
duke@0 3056 product(bool, ThreadPriorityVerbose, false, \
duke@0 3057 "print priority changes") \
duke@0 3058 \
duke@0 3059 product(intx, DefaultThreadPriority, -1, \
duke@0 3060 "what native priority threads run at if not specified elsewhere (-1 means no change)") \
duke@0 3061 \
duke@0 3062 product(intx, CompilerThreadPriority, -1, \
duke@0 3063 "what priority should compiler threads run at (-1 means no change)") \
duke@0 3064 \
duke@0 3065 product(intx, VMThreadPriority, -1, \
duke@0 3066 "what priority should VM threads run at (-1 means no change)") \
duke@0 3067 \
duke@0 3068 product(bool, CompilerThreadHintNoPreempt, true, \
duke@0 3069 "(Solaris only) Give compiler threads an extra quanta") \
duke@0 3070 \
duke@0 3071 product(bool, VMThreadHintNoPreempt, false, \
duke@0 3072 "(Solaris only) Give VM thread an extra quanta") \
duke@0 3073 \
duke@0 3074 product(intx, JavaPriority1_To_OSPriority, -1, "Map Java priorities to OS priorities") \
duke@0 3075 product(intx, JavaPriority2_To_OSPriority, -1, "Map Java priorities to OS priorities") \
duke@0 3076 product(intx, JavaPriority3_To_OSPriority, -1, "Map Java priorities to OS priorities") \
duke@0 3077 product(intx, JavaPriority4_To_OSPriority, -1, "Map Java priorities to OS priorities") \
duke@0 3078 product(intx, JavaPriority5_To_OSPriority, -1, "Map Java priorities to OS priorities") \
duke@0 3079 product(intx, JavaPriority6_To_OSPriority, -1, "Map Java priorities to OS priorities") \
duke@0 3080 product(intx, JavaPriority7_To_OSPriority, -1, "Map Java priorities to OS priorities") \
duke@0 3081 product(intx, JavaPriority8_To_OSPriority, -1, "Map Java priorities to OS priorities") \
duke@0 3082 product(intx, JavaPriority9_To_OSPriority, -1, "Map Java priorities to OS priorities") \
duke@0 3083 product(intx, JavaPriority10_To_OSPriority,-1, "Map Java priorities to OS priorities") \
duke@0 3084 \
duke@0 3085 /* compiler debugging */ \
duke@0 3086 notproduct(intx, CompileTheWorldStartAt, 1, \
duke@0 3087 "First class to consider when using +CompileTheWorld") \
duke@0 3088 \
duke@0 3089 notproduct(intx, CompileTheWorldStopAt, max_jint, \
duke@0 3090 "Last class to consider when using +CompileTheWorld") \
duke@0 3091 \
duke@0 3092 develop(intx, NewCodeParameter, 0, \
duke@0 3093 "Testing Only: Create a dedicated integer parameter before " \
duke@0 3094 "putback") \
duke@0 3095 \
duke@0 3096 /* new oopmap storage allocation */ \
duke@0 3097 develop(intx, MinOopMapAllocation, 8, \
duke@0 3098 "Minimum number of OopMap entries in an OopMapSet") \
duke@0 3099 \
duke@0 3100 /* Background Compilation */ \
duke@0 3101 develop(intx, LongCompileThreshold, 50, \
duke@0 3102 "Used with +TraceLongCompiles") \
duke@0 3103 \
duke@0 3104 product(intx, StarvationMonitorInterval, 200, \
duke@0 3105 "Pause between each check in ms") \
duke@0 3106 \
duke@0 3107 /* recompilation */ \
duke@0 3108 product_pd(intx, CompileThreshold, \
duke@0 3109 "number of interpreted method invocations before (re-)compiling") \
duke@0 3110 \
duke@0 3111 product_pd(intx, BackEdgeThreshold, \
duke@0 3112 "Interpreter Back edge threshold at which an OSR compilation is invoked")\
duke@0 3113 \
duke@0 3114 product(intx, Tier1BytecodeLimit, 10, \
duke@0 3115 "Must have at least this many bytecodes before tier1" \
duke@0 3116 "invocation counters are used") \
duke@0 3117 \
duke@0 3118 product_pd(intx, Tier2CompileThreshold, \
duke@0 3119 "threshold at which a tier 2 compilation is invoked") \
duke@0 3120 \
duke@0 3121 product_pd(intx, Tier2BackEdgeThreshold, \
duke@0 3122 "Back edge threshold at which a tier 2 compilation is invoked") \
duke@0 3123 \
duke@0 3124 product_pd(intx, Tier3CompileThreshold, \
duke@0 3125 "threshold at which a tier 3 compilation is invoked") \
duke@0 3126 \
duke@0 3127 product_pd(intx, Tier3BackEdgeThreshold, \
duke@0 3128 "Back edge threshold at which a tier 3 compilation is invoked") \
duke@0 3129 \
duke@0 3130 product_pd(intx, Tier4CompileThreshold, \
duke@0 3131 "threshold at which a tier 4 compilation is invoked") \
duke@0 3132 \
duke@0 3133 product_pd(intx, Tier4BackEdgeThreshold, \
duke@0 3134 "Back edge threshold at which a tier 4 compilation is invoked") \
duke@0 3135 \
duke@0 3136 product_pd(bool, TieredCompilation, \
duke@0 3137 "Enable two-tier compilation") \
duke@0 3138 \
duke@0 3139 product(bool, StressTieredRuntime, false, \
duke@0 3140 "Alternate client and server compiler on compile requests") \
duke@0 3141 \
duke@0 3142 product_pd(intx, OnStackReplacePercentage, \
duke@0 3143 "NON_TIERED number of method invocations/branches (expressed as %"\
duke@0 3144 "of CompileThreshold) before (re-)compiling OSR code") \
duke@0 3145 \
duke@0 3146 product(intx, InterpreterProfilePercentage, 33, \
duke@0 3147 "NON_TIERED number of method invocations/branches (expressed as %"\
duke@0 3148 "of CompileThreshold) before profiling in the interpreter") \
duke@0 3149 \
duke@0 3150 develop(intx, MaxRecompilationSearchLength, 10, \
duke@0 3151 "max. # frames to inspect searching for recompilee") \
duke@0 3152 \
duke@0 3153 develop(intx, MaxInterpretedSearchLength, 3, \
duke@0 3154 "max. # interp. frames to skip when searching for recompilee") \
duke@0 3155 \
duke@0 3156 develop(intx, DesiredMethodLimit, 8000, \
duke@0 3157 "desired max. method size (in bytecodes) after inlining") \
duke@0 3158 \
duke@0 3159 develop(intx, HugeMethodLimit, 8000, \
duke@0 3160 "don't compile methods larger than this if " \
duke@0 3161 "+DontCompileHugeMethods") \
duke@0 3162 \
duke@0 3163 /* New JDK 1.4 reflection implementation */ \
duke@0 3164 \
duke@0 3165 develop(bool, UseNewReflection, true, \
duke@0 3166 "Temporary flag for transition to reflection based on dynamic " \
duke@0 3167 "bytecode generation in 1.4; can no longer be turned off in 1.4 " \
duke@0 3168 "JDK, and is unneeded in 1.3 JDK, but marks most places VM "