241
242 // flag kind
243 KIND_PRODUCT = 1 << 4,
244 KIND_MANAGEABLE = 1 << 5,
245 KIND_DIAGNOSTIC = 1 << 6,
246 KIND_EXPERIMENTAL = 1 << 7,
247 KIND_NOT_PRODUCT = 1 << 8,
248 KIND_DEVELOP = 1 << 9,
249 KIND_PLATFORM_DEPENDENT = 1 << 10,
250 KIND_READ_WRITE = 1 << 11,
251 KIND_C1 = 1 << 12,
252 KIND_C2 = 1 << 13,
253 KIND_ARCH = 1 << 14,
254 KIND_SHARK = 1 << 15,
255 KIND_LP64_PRODUCT = 1 << 16,
256 KIND_COMMERCIAL = 1 << 17,
257
258 KIND_MASK = ~VALUE_ORIGIN_MASK
259 };
260
261 const char* _type;
262 const char* _name;
263 void* _addr;
264 NOT_PRODUCT(const char* _doc;)
265 Flags _flags;
266
267 // points to all Flags static array
268 static Flag* flags;
269
270 // number of flags
271 static size_t numFlags;
272
273 static Flag* find_flag(const char* name, size_t length, bool allow_locked = false, bool return_flag = false);
274 static Flag* fuzzy_match(const char* name, size_t length, bool allow_locked = false);
275
276 void check_writable();
277
278 bool is_bool() const;
279 bool get_bool() const;
280 void set_bool(bool value);
281
282 bool is_intx() const;
283 intx get_intx() const;
284 void set_intx(intx value);
285
286 bool is_uintx() const;
287 uintx get_uintx() const;
288 void set_uintx(uintx value);
289
290 bool is_uint64_t() const;
291 uint64_t get_uint64_t() const;
292 void set_uint64_t(uint64_t value);
320 bool is_read_write() const;
321 bool is_commercial() const;
322
323 bool is_constant_in_binary() const;
324
325 bool is_unlocker() const;
326 bool is_unlocked() const;
327 bool is_writeable() const;
328 bool is_external() const;
329
330 bool is_unlocker_ext() const;
331 bool is_unlocked_ext() const;
332 bool is_writeable_ext() const;
333 bool is_external_ext() const;
334
335 void unlock_diagnostic();
336
337 void get_locked_message(char*, int) const;
338 void get_locked_message_ext(char*, int) const;
339
340 void print_on(outputStream* st, bool withComments = false );
341 void print_kind(outputStream* st);
342 void print_as_flag(outputStream* st);
343 };
344
345 // debug flags control various aspects of the VM and are global accessible
346
347 // use FlagSetting to temporarily change some debug flag
348 // e.g. FlagSetting fs(DebugThisAndThat, true);
349 // restored to previous value upon leaving scope
350 class FlagSetting {
351 bool val;
352 bool* flag;
353 public:
354 FlagSetting(bool& fl, bool newValue) { flag = &fl; val = fl; fl = newValue; }
355 ~FlagSetting() { *flag = val; }
356 };
357
358
359 class CounterSetting {
360 intx* counter;
373 };
374
375 class DoubleFlagSetting {
376 double val;
377 double* flag;
378 public:
379 DoubleFlagSetting(double& fl, double newValue) { flag = &fl; val = fl; fl = newValue; }
380 ~DoubleFlagSetting() { *flag = val; }
381 };
382
383 class SizeTFlagSetting {
384 size_t val;
385 size_t* flag;
386 public:
387 SizeTFlagSetting(size_t& fl, size_t newValue) { flag = &fl; val = fl; fl = newValue; }
388 ~SizeTFlagSetting() { *flag = val; }
389 };
390
391
392 class CommandLineFlags {
393 public:
394 static bool boolAt(const char* name, size_t len, bool* value, bool allow_locked = false, bool return_flag = false);
395 static bool boolAt(const char* name, bool* value, bool allow_locked = false, bool return_flag = false) { return boolAt(name, strlen(name), value, allow_locked, return_flag); }
396 static bool boolAtPut(const char* name, size_t len, bool* value, Flag::Flags origin);
397 static bool boolAtPut(const char* name, bool* value, Flag::Flags origin) { return boolAtPut(name, strlen(name), value, origin); }
398
399 static bool intxAt(const char* name, size_t len, intx* value, bool allow_locked = false, bool return_flag = false);
400 static bool intxAt(const char* name, intx* value, bool allow_locked = false, bool return_flag = false) { return intxAt(name, strlen(name), value, allow_locked, return_flag); }
401 static bool intxAtPut(const char* name, size_t len, intx* value, Flag::Flags origin);
402 static bool intxAtPut(const char* name, intx* value, Flag::Flags origin) { return intxAtPut(name, strlen(name), value, origin); }
403
404 static bool uintxAt(const char* name, size_t len, uintx* value, bool allow_locked = false, bool return_flag = false);
405 static bool uintxAt(const char* name, uintx* value, bool allow_locked = false, bool return_flag = false) { return uintxAt(name, strlen(name), value, allow_locked, return_flag); }
406 static bool uintxAtPut(const char* name, size_t len, uintx* value, Flag::Flags origin);
407 static bool uintxAtPut(const char* name, uintx* value, Flag::Flags origin) { return uintxAtPut(name, strlen(name), value, origin); }
408
409 static bool size_tAt(const char* name, size_t len, size_t* value, bool allow_locked = false, bool return_flag = false);
410 static bool size_tAt(const char* name, size_t* value, bool allow_locked = false, bool return_flag = false) { return size_tAt(name, strlen(name), value, allow_locked, return_flag); }
411 static bool size_tAtPut(const char* name, size_t len, size_t* value, Flag::Flags origin);
412 static bool size_tAtPut(const char* name, size_t* value, Flag::Flags origin) { return size_tAtPut(name, strlen(name), value, origin); }
413
414 static bool uint64_tAt(const char* name, size_t len, uint64_t* value, bool allow_locked = false, bool return_flag = false);
415 static bool uint64_tAt(const char* name, uint64_t* value, bool allow_locked = false, bool return_flag = false) { return uint64_tAt(name, strlen(name), value, allow_locked, return_flag); }
416 static bool uint64_tAtPut(const char* name, size_t len, uint64_t* value, Flag::Flags origin);
417 static bool uint64_tAtPut(const char* name, uint64_t* value, Flag::Flags origin) { return uint64_tAtPut(name, strlen(name), value, origin); }
418
419 static bool doubleAt(const char* name, size_t len, double* value, bool allow_locked = false, bool return_flag = false);
420 static bool doubleAt(const char* name, double* value, bool allow_locked = false, bool return_flag = false) { return doubleAt(name, strlen(name), value, allow_locked, return_flag); }
421 static bool doubleAtPut(const char* name, size_t len, double* value, Flag::Flags origin);
422 static bool doubleAtPut(const char* name, double* value, Flag::Flags origin) { return doubleAtPut(name, strlen(name), value, origin); }
423
424 static bool ccstrAt(const char* name, size_t len, ccstr* value, bool allow_locked = false, bool return_flag = false);
425 static bool ccstrAt(const char* name, ccstr* value, bool allow_locked = false, bool return_flag = false) { return ccstrAt(name, strlen(name), value, allow_locked, return_flag); }
426 // Contract: Flag will make private copy of the incoming value.
427 // Outgoing value is always malloc-ed, and caller MUST call free.
428 static bool ccstrAtPut(const char* name, size_t len, ccstr* value, Flag::Flags origin);
429 static bool ccstrAtPut(const char* name, ccstr* value, Flag::Flags origin) { return ccstrAtPut(name, strlen(name), value, origin); }
430
431 // Returns false if name is not a command line flag.
432 static bool wasSetOnCmdline(const char* name, bool* value);
433 static void printSetFlags(outputStream* out);
434
435 static void printFlags(outputStream* out, bool withComments);
436
437 static void verify() PRODUCT_RETURN;
438 };
439
440 // use this for flags that are true by default in the debug version but
441 // false in the optimized version, and vice versa
442 #ifdef ASSERT
443 #define trueInDebug true
444 #define falseInDebug false
445 #else
446 #define trueInDebug false
447 #define falseInDebug true
448 #endif
449
450 // use this for flags that are true per default in the product build
451 // but false in development builds, and vice versa
452 #ifdef PRODUCT
453 #define trueInProduct true
454 #define falseInProduct false
455 #else
509 // - the flag is defined in a CCC as an external exported interface.
510 // - the VM implementation supports dynamic setting of the flag.
511 // This implies that the VM must *always* query the flag variable
512 // and not reuse state related to the flag state at any given time.
513 // - you want the flag to be queried programmatically by the customers.
514 //
515 // product_rw flags are writeable internal product flags.
516 // They are like "manageable" flags but for internal/private use.
517 // The list of product_rw flags are internal/private flags which
518 // may be changed/removed in a future release. It can be set
519 // through the management interface to get/set value
520 // when the name of flag is supplied.
521 //
522 // A flag can be made as "product_rw" only if
523 // - the VM implementation supports dynamic setting of the flag.
524 // This implies that the VM must *always* query the flag variable
525 // and not reuse state related to the flag state at any given time.
526 //
527 // Note that when there is a need to support develop flags to be writeable,
528 // it can be done in the same way as product_rw.
529
530 #define RUNTIME_FLAGS(develop, develop_pd, product, product_pd, diagnostic, experimental, notproduct, manageable, product_rw, lp64_product) \
531 \
532 lp64_product(bool, UseCompressedOops, false, \
533 "Use 32-bit object references in 64-bit VM. " \
534 "lp64_product means flag is always constant in 32 bit VM") \
535 \
536 lp64_product(bool, UseCompressedClassPointers, false, \
537 "Use 32-bit class pointers in 64-bit VM. " \
538 "lp64_product means flag is always constant in 32 bit VM") \
539 \
540 notproduct(bool, CheckCompressedOops, true, \
541 "Generate checks in encoding/decoding code in debug VM") \
542 \
543 product_pd(size_t, HeapBaseMinAddress, \
544 "OS specific low limit for heap base address") \
545 \
546 product(uintx, HeapSearchSteps, 3 PPC64_ONLY(+17), \
547 "Heap allocation steps through preferred address regions to find" \
548 " where it can allocate the heap. Number of steps to take per " \
549 "region.") \
550 \
551 diagnostic(bool, PrintCompressedOopsMode, false, \
552 "Print compressed oops base address and encoding mode") \
553 \
554 lp64_product(intx, ObjectAlignmentInBytes, 8, \
555 "Default object alignment in bytes, 8 is minimum") \
556 \
557 product(bool, AssumeMP, false, \
558 "Instruct the VM to assume multiple processors are available") \
559 \
560 /* UseMembar is theoretically a temp flag used for memory barrier \
561 * removal testing. It was supposed to be removed before FCS but has \
562 * been re-added (see 6401008) */ \
563 product_pd(bool, UseMembar, \
564 "(Unstable) Issues membars on thread state transitions") \
565 \
566 develop(bool, CleanChunkPoolAsync, falseInEmbedded, \
567 "Clean the chunk pool asynchronously") \
568 \
569 experimental(bool, AlwaysSafeConstructors, false, \
570 "Force safe construction, as if all fields are final.") \
571 \
572 /* Temporary: See 6948537 */ \
573 experimental(bool, UseMemSetInBOT, true, \
574 "(Unstable) uses memset in BOT updates in GC code") \
575 \
576 diagnostic(bool, UnlockDiagnosticVMOptions, trueInDebug, \
577 "Enable normal processing of flags relating to field diagnostics")\
578 \
579 experimental(bool, UnlockExperimentalVMOptions, false, \
580 "Enable normal processing of flags relating to experimental " \
581 "features") \
582 \
599 \
600 develop(bool, TracePageSizes, false, \
601 "Trace page size selection and usage") \
602 \
603 product(bool, UseNUMA, false, \
604 "Use NUMA if available") \
605 \
606 product(bool, UseNUMAInterleaving, false, \
607 "Interleave memory across NUMA nodes if available") \
608 \
609 product(size_t, NUMAInterleaveGranularity, 2*M, \
610 "Granularity to use for NUMA interleaving on Windows OS") \
611 \
612 product(bool, ForceNUMA, false, \
613 "Force NUMA optimizations on single-node/UMA systems") \
614 \
615 product(uintx, NUMAChunkResizeWeight, 20, \
616 "Percentage (0-100) used to weight the current sample when " \
617 "computing exponentially decaying average for " \
618 "AdaptiveNUMAChunkSizing") \
619 \
620 product(size_t, NUMASpaceResizeRate, 1*G, \
621 "Do not reallocate more than this amount per collection") \
622 \
623 product(bool, UseAdaptiveNUMAChunkSizing, true, \
624 "Enable adaptive chunk sizing for NUMA") \
625 \
626 product(bool, NUMAStats, false, \
627 "Print NUMA stats in detailed heap information") \
628 \
629 product(uintx, NUMAPageScanRate, 256, \
630 "Maximum number of pages to include in the page scan procedure") \
631 \
632 product_pd(bool, NeedsDeoptSuspend, \
633 "True for register window machines (sparc/ia64)") \
634 \
635 product(intx, UseSSE, 99, \
636 "Highest supported SSE instructions set on x86/x64") \
637 \
638 product(bool, UseAES, false, \
809 product(intx, SuspendRetryCount, 50, \
810 "Maximum retry count for an external suspend request") \
811 \
812 product(intx, SuspendRetryDelay, 5, \
813 "Milliseconds to delay per retry (* current_retry_count)") \
814 \
815 product(bool, AssertOnSuspendWaitFailure, false, \
816 "Assert/Guarantee on external suspend wait failure") \
817 \
818 product(bool, TraceSuspendWaitFailures, false, \
819 "Trace external suspend wait failures") \
820 \
821 product(bool, MaxFDLimit, true, \
822 "Bump the number of file descriptors to maximum in Solaris") \
823 \
824 diagnostic(bool, LogEvents, true, \
825 "Enable the various ring buffer event logs") \
826 \
827 diagnostic(uintx, LogEventsBufferEntries, 10, \
828 "Number of ring buffer event logs") \
829 \
830 product(bool, BytecodeVerificationRemote, true, \
831 "Enable the Java bytecode verifier for remote classes") \
832 \
833 product(bool, BytecodeVerificationLocal, false, \
834 "Enable the Java bytecode verifier for local classes") \
835 \
836 develop(bool, ForceFloatExceptions, trueInDebug, \
837 "Force exceptions on FP stack under/overflow") \
838 \
839 develop(bool, VerifyStackAtCalls, false, \
840 "Verify that the stack pointer is unchanged after calls") \
841 \
842 develop(bool, TraceJavaAssertions, false, \
843 "Trace java language assertions") \
844 \
845 notproduct(bool, CheckAssertionStatusDirectives, false, \
846 "Temporary - see javaClasses.cpp") \
847 \
848 notproduct(bool, PrintMallocFree, false, \
981 \
982 product(ccstr, NativeMemoryTracking, "off", \
983 "Native memory tracking options") \
984 \
985 diagnostic(bool, PrintNMTStatistics, false, \
986 "Print native memory tracking summary data if it is on") \
987 \
988 diagnostic(bool, LogCompilation, false, \
989 "Log compilation activity in detail to LogFile") \
990 \
991 product(bool, PrintCompilation, false, \
992 "Print compilations") \
993 \
994 diagnostic(bool, TraceNMethodInstalls, false, \
995 "Trace nmethod installation") \
996 \
997 diagnostic(intx, ScavengeRootsInCode, 2, \
998 "0: do not allow scavengable oops in the code cache; " \
999 "1: allow scavenging from the code cache; " \
1000 "2: emit as many constants as the compiler can see") \
1001 \
1002 product(bool, AlwaysRestoreFPU, false, \
1003 "Restore the FPU control word after every JNI call (expensive)") \
1004 \
1005 diagnostic(bool, PrintCompilation2, false, \
1006 "Print additional statistics per compilation") \
1007 \
1008 diagnostic(bool, PrintAdapterHandlers, false, \
1009 "Print code generated for i2c/c2i adapters") \
1010 \
1011 diagnostic(bool, VerifyAdapterCalls, trueInDebug, \
1012 "Verify that i2c/c2i adapters are called properly") \
1013 \
1014 develop(bool, VerifyAdapterSharing, false, \
1015 "Verify that the code for shared adapters is the equivalent") \
1016 \
1017 diagnostic(bool, PrintAssembly, false, \
1018 "Print assembly code (using external disassembler.so)") \
1019 \
1020 diagnostic(ccstr, PrintAssemblyOptions, NULL, \
1254 \
1255 product(bool, EagerXrunInit, false, \
1256 "Eagerly initialize -Xrun libraries; allows startup profiling, " \
1257 "but not all -Xrun libraries may support the state of the VM " \
1258 "at this time") \
1259 \
1260 product(bool, PreserveAllAnnotations, false, \
1261 "Preserve RuntimeInvisibleAnnotations as well " \
1262 "as RuntimeVisibleAnnotations") \
1263 \
1264 develop(uintx, PreallocatedOutOfMemoryErrorCount, 4, \
1265 "Number of OutOfMemoryErrors preallocated with backtrace") \
1266 \
1267 product(bool, LazyBootClassLoader, true, \
1268 "Enable/disable lazy opening of boot class path entries") \
1269 \
1270 product(bool, UseXMMForArrayCopy, false, \
1271 "Use SSE2 MOVQ instruction for Arraycopy") \
1272 \
1273 product(intx, FieldsAllocationStyle, 1, \
1274 "0 - type based with oops first, 1 - with oops last, " \
1275 "2 - oops in super and sub classes are together") \
1276 \
1277 product(bool, CompactFields, true, \
1278 "Allocate nonstatic fields in gaps between previous fields") \
1279 \
1280 notproduct(bool, PrintFieldLayout, false, \
1281 "Print field layout for each class") \
1282 \
1283 product(intx, ContendedPaddingWidth, 128, \
1284 "How many bytes to pad the fields/classes marked @Contended with")\
1285 \
1286 product(bool, EnableContended, true, \
1287 "Enable @Contended annotation support") \
1288 \
1289 product(bool, RestrictContended, true, \
1290 "Restrict @Contended to trusted classes") \
1291 \
1292 product(bool, UseBiasedLocking, true, \
1293 "Enable biased locking in JVM") \
1294 \
1295 product(intx, BiasedLockingStartupDelay, 4000, \
1296 "Number of milliseconds to wait before enabling biased locking") \
1297 \
1298 diagnostic(bool, PrintBiasedLockingStatistics, false, \
1299 "Print statistics of biased locking in JVM") \
1300 \
1301 product(intx, BiasedLockingBulkRebiasThreshold, 20, \
1302 "Threshold of number of revocations per type to try to " \
1303 "rebias all objects in the heap of that type") \
1304 \
1426 product(bool, UseParallelGC, false, \
1427 "Use the Parallel Scavenge garbage collector") \
1428 \
1429 product(bool, UseParallelOldGC, false, \
1430 "Use the Parallel Old garbage collector") \
1431 \
1432 product(uintx, HeapMaximumCompactionInterval, 20, \
1433 "How often should we maximally compact the heap (not allowing " \
1434 "any dead space)") \
1435 \
1436 product(uintx, HeapFirstMaximumCompactionCount, 3, \
1437 "The collection count for the first maximum compaction") \
1438 \
1439 product(bool, UseMaximumCompactionOnSystemGC, true, \
1440 "Use maximum compaction in the Parallel Old garbage collector " \
1441 "for a system GC") \
1442 \
1443 product(uintx, ParallelOldDeadWoodLimiterMean, 50, \
1444 "The mean used by the parallel compact dead wood " \
1445 "limiter (a number between 0-100)") \
1446 \
1447 product(uintx, ParallelOldDeadWoodLimiterStdDev, 80, \
1448 "The standard deviation used by the parallel compact dead wood " \
1449 "limiter (a number between 0-100)") \
1450 \
1451 product(uintx, ParallelGCThreads, 0, \
1452 "Number of parallel threads parallel gc will use") \
1453 \
1454 product(bool, UseDynamicNumberOfGCThreads, false, \
1455 "Dynamically choose the number of parallel threads " \
1456 "parallel gc will use") \
1457 \
1458 diagnostic(bool, ForceDynamicNumberOfGCThreads, false, \
1459 "Force dynamic selection of the number of " \
1460 "parallel threads parallel gc will use to aid debugging") \
1461 \
1462 product(size_t, HeapSizePerGCThread, ScaleForWordSize(64*M), \
1463 "Size of heap (bytes) per GC thread used in calculating the " \
1464 "number of GC threads") \
1465 \
1466 product(bool, TraceDynamicGCThreads, false, \
1467 "Trace the dynamic GC thread usage") \
1468 \
1469 develop(bool, ParallelOldGCSplitALot, false, \
1470 "Provoke splitting (copying data from a young gen space to " \
1471 "multiple destination spaces)") \
1472 \
1473 develop(uintx, ParallelOldGCSplitInterval, 3, \
1474 "How often to provoke splitting a young gen space") \
1475 \
1476 product(uintx, ConcGCThreads, 0, \
1477 "Number of threads concurrent gc will use") \
1478 \
1479 product(size_t, YoungPLABSize, 4096, \
1480 "Size of young gen promotion LAB's (in HeapWords)") \
1481 \
1482 product(size_t, OldPLABSize, 1024, \
1483 "Size of old gen promotion LAB's (in HeapWords), or Number \
1484 of blocks to attempt to claim when refilling CMS LAB's") \
1485 \
1486 product(uintx, GCTaskTimeStampEntries, 200, \
1487 "Number of time stamp entries per gc worker thread") \
1488 \
1489 product(bool, AlwaysTenure, false, \
1490 "Always tenure objects in eden (ParallelGC only)") \
1491 \
1492 product(bool, NeverTenure, false, \
1493 "Never tenure objects in eden, may tenure on overflow " \
1494 "(ParallelGC only)") \
1495 \
1496 product(bool, ScavengeBeforeFullGC, true, \
1497 "Scavenge youngest generation before each full GC.") \
1498 \
1499 develop(bool, ScavengeWithObjectsInToSpace, false, \
1500 "Allow scavenges to occur when to-space contains objects") \
1501 \
1502 product(bool, UseConcMarkSweepGC, false, \
1503 "Use Concurrent Mark-Sweep GC in the old generation") \
1504 \
1505 product(bool, ExplicitGCInvokesConcurrent, false, \
1506 "A System.gc() request invokes a concurrent collection; " \
1507 "(effective only when using concurrent collectors)") \
1508 \
1509 product(bool, ExplicitGCInvokesConcurrentAndUnloadsClasses, false, \
1510 "A System.gc() request invokes a concurrent collection and " \
1511 "also unloads classes during such a concurrent gc cycle " \
1512 "(effective only when UseConcMarkSweepGC)") \
1513 \
1514 product(bool, GCLockerInvokesConcurrent, false, \
1515 "The exit of a JNI critical section necessitating a scavenge, " \
1516 "also kicks off a background concurrent collection") \
1517 \
1518 product(uintx, GCLockerEdenExpansionPercent, 5, \
1519 "How much the GC can expand the eden by while the GC locker " \
1520 "is active (as a percentage)") \
1521 \
1522 diagnostic(uintx, GCLockerRetryAllocationCount, 2, \
1523 "Number of times to retry allocations when " \
1524 "blocked by the GC locker") \
1525 \
1526 develop(bool, UseCMSAdaptiveFreeLists, true, \
1527 "Use adaptive free lists in the CMS generation") \
1528 \
1529 develop(bool, UseAsyncConcMarkSweepGC, true, \
1530 "Use Asynchronous Concurrent Mark-Sweep GC in the old generation")\
1531 \
1532 product(bool, UseCMSBestFit, true, \
1533 "Use CMS best fit allocation strategy") \
1534 \
1535 product(bool, UseParNewGC, false, \
1536 "Use parallel threads in the new generation") \
1537 \
1538 product(bool, PrintTaskqueue, false, \
1539 "Print taskqueue statistics for parallel collectors") \
1540 \
1541 product(bool, PrintTerminationStats, false, \
1542 "Print termination statistics for parallel collectors") \
1543 \
1544 product(uintx, ParallelGCBufferWastePct, 10, \
1545 "Wasted fraction of parallel allocation buffer") \
1546 \
1547 product(uintx, TargetPLABWastePct, 10, \
1548 "Target wasted space in last buffer as percent of overall " \
1549 "allocation") \
1550 \
1551 product(uintx, PLABWeight, 75, \
1552 "Percentage (0-100) used to weight the current sample when " \
1553 "computing exponentially decaying average for ResizePLAB") \
1554 \
1555 product(bool, ResizePLAB, true, \
1556 "Dynamically resize (survivor space) promotion LAB's") \
1557 \
1558 product(bool, PrintPLAB, false, \
1559 "Print (survivor space) promotion LAB's sizing decisions") \
1560 \
1561 product(intx, ParGCArrayScanChunk, 50, \
1562 "Scan a subset of object array and push remainder, if array is " \
1563 "bigger than this") \
1564 \
1565 product(bool, ParGCUseLocalOverflow, false, \
1566 "Instead of a global overflow list, use local overflow stacks") \
1567 \
1568 product(bool, ParGCTrimOverflow, true, \
1569 "Eagerly trim the local overflow lists " \
1570 "(when ParGCUseLocalOverflow)") \
1571 \
1572 notproduct(bool, ParGCWorkQueueOverflowALot, false, \
1573 "Simulate work queue overflow in ParNew") \
1574 \
1575 notproduct(uintx, ParGCWorkQueueOverflowInterval, 1000, \
1576 "An `interval' counter that determines how frequently " \
1577 "we simulate overflow; a smaller number increases frequency") \
1578 \
1579 product(uintx, ParGCDesiredObjsFromOverflowList, 20, \
1580 "The desired number of objects to claim from the overflow list") \
1581 \
1582 diagnostic(uintx, ParGCStridesPerThread, 2, \
1583 "The number of strides per worker thread that we divide up the " \
1584 "card table scanning work into") \
1585 \
1586 diagnostic(intx, ParGCCardsPerStrideChunk, 256, \
1587 "The number of cards in each chunk of the parallel chunks used " \
1588 "during card table scanning") \
1589 \
1590 product(uintx, OldPLABWeight, 50, \
1591 "Percentage (0-100) used to weight the current sample when " \
1592 "computing exponentially decaying average for resizing " \
1593 "OldPLABSize") \
1594 \
1595 product(bool, ResizeOldPLAB, true, \
1596 "Dynamically resize (old gen) promotion LAB's") \
1597 \
1598 product(bool, PrintOldPLAB, false, \
1599 "Print (old gen) promotion LAB's sizing decisions") \
1600 \
1601 product(size_t, CMSOldPLABMin, 16, \
1602 "Minimum size of CMS gen promotion LAB caches per worker " \
1603 "per block size") \
1604 \
1605 product(size_t, CMSOldPLABMax, 1024, \
1606 "Maximum size of CMS gen promotion LAB caches per worker " \
1607 "per block size") \
1608 \
1609 product(uintx, CMSOldPLABNumRefills, 4, \
1610 "Nominal number of refills of CMS gen promotion LAB cache " \
1611 "per worker per block size") \
1612 \
1613 product(bool, CMSOldPLABResizeQuicker, false, \
1614 "React on-the-fly during a scavenge to a sudden " \
1615 "change in block demand rate") \
1616 \
1617 product(uintx, CMSOldPLABToleranceFactor, 4, \
1618 "The tolerance of the phase-change detector for on-the-fly " \
1619 "PLAB resizing during a scavenge") \
1620 \
1621 product(uintx, CMSOldPLABReactivityFactor, 2, \
1622 "The gain in the feedback loop for on-the-fly PLAB resizing " \
1623 "during a scavenge") \
1624 \
1625 product(bool, AlwaysPreTouch, false, \
1626 "Force all freshly committed pages to be pre-touched") \
1627 \
1628 product_pd(size_t, CMSYoungGenPerWorker, \
1629 "The maximum size of young gen chosen by default per GC worker " \
1630 "thread available") \
1631 \
1632 product(uintx, CMSIncrementalSafetyFactor, 10, \
1633 "Percentage (0-100) used to add conservatism when computing the " \
1634 "duty cycle") \
1635 \
1636 product(uintx, CMSExpAvgFactor, 50, \
1637 "Percentage (0-100) used to weight the current sample when " \
1638 "computing exponential averages for CMS statistics") \
1639 \
1640 product(uintx, CMS_FLSWeight, 75, \
1641 "Percentage (0-100) used to weight the current sample when " \
1642 "computing exponentially decaying averages for CMS FLS " \
1643 "statistics") \
1644 \
1645 product(uintx, CMS_FLSPadding, 1, \
1646 "The multiple of deviation from mean to use for buffering " \
1647 "against volatility in free list demand") \
1648 \
1649 product(uintx, FLSCoalescePolicy, 2, \
1650 "CMS: aggressiveness level for coalescing, increasing " \
1651 "from 0 to 4") \
1652 \
1653 product(bool, FLSAlwaysCoalesceLarge, false, \
1654 "CMS: larger free blocks are always available for coalescing") \
1655 \
1656 product(double, FLSLargestBlockCoalesceProximity, 0.99, \
1657 "CMS: the smaller the percentage the greater the coalescing " \
1658 "force") \
1659 \
1660 product(double, CMSSmallCoalSurplusPercent, 1.05, \
1661 "CMS: the factor by which to inflate estimated demand of small " \
1662 "block sizes to prevent coalescing with an adjoining block") \
1663 \
1664 product(double, CMSLargeCoalSurplusPercent, 0.95, \
1665 "CMS: the factor by which to inflate estimated demand of large " \
1666 "block sizes to prevent coalescing with an adjoining block") \
1667 \
1668 product(double, CMSSmallSplitSurplusPercent, 1.10, \
1669 "CMS: the factor by which to inflate estimated demand of small " \
1670 "block sizes to prevent splitting to supply demand for smaller " \
1671 "blocks") \
1672 \
1673 product(double, CMSLargeSplitSurplusPercent, 1.00, \
1674 "CMS: the factor by which to inflate estimated demand of large " \
1675 "block sizes to prevent splitting to supply demand for smaller " \
1676 "blocks") \
1677 \
1678 product(bool, CMSExtrapolateSweep, false, \
1679 "CMS: cushion for block demand during sweep") \
1680 \
1681 product(uintx, CMS_SweepWeight, 75, \
1682 "Percentage (0-100) used to weight the current sample when " \
1683 "computing exponentially decaying average for inter-sweep " \
1684 "duration") \
1685 \
1686 product(uintx, CMS_SweepPadding, 1, \
1687 "The multiple of deviation from mean to use for buffering " \
1688 "against volatility in inter-sweep duration") \
1689 \
1690 product(uintx, CMS_SweepTimerThresholdMillis, 10, \
1691 "Skip block flux-rate sampling for an epoch unless inter-sweep " \
1692 "duration exceeds this threshold in milliseconds") \
1693 \
1694 product(bool, CMSClassUnloadingEnabled, true, \
1695 "Whether class unloading enabled when using CMS GC") \
1696 \
1697 product(uintx, CMSClassUnloadingMaxInterval, 0, \
1698 "When CMS class unloading is enabled, the maximum CMS cycle " \
1699 "count for which classes may not be unloaded") \
1700 \
1701 develop(intx, CMSDictionaryChoice, 0, \
1702 "Use BinaryTreeDictionary as default in the CMS generation") \
1703 \
1704 product(uintx, CMSIndexedFreeListReplenish, 4, \
1705 "Replenish an indexed free list with this number of chunks") \
1706 \
1707 product(bool, CMSReplenishIntermediate, true, \
1708 "Replenish all intermediate free-list caches") \
1709 \
1710 product(bool, CMSSplitIndexedFreeListBlocks, true, \
1711 "When satisfying batched demand, split blocks from the " \
1712 "IndexedFreeList whose size is a multiple of requested size") \
1713 \
1714 product(bool, CMSLoopWarn, false, \
1715 "Warn in case of excessive CMS looping") \
1716 \
1717 develop(bool, CMSOverflowEarlyRestoration, false, \
1718 "Restore preserved marks early") \
1719 \
1720 product(size_t, MarkStackSize, NOT_LP64(32*K) LP64_ONLY(4*M), \
1721 "Size of marking stack") \
1722 \
1723 product(size_t, MarkStackSizeMax, NOT_LP64(4*M) LP64_ONLY(512*M), \
1724 "Maximum size of marking stack") \
1725 \
1726 notproduct(bool, CMSMarkStackOverflowALot, false, \
1727 "Simulate frequent marking stack / work queue overflow") \
1728 \
1729 notproduct(uintx, CMSMarkStackOverflowInterval, 1000, \
1730 "An \"interval\" counter that determines how frequently " \
1731 "to simulate overflow; a smaller number increases frequency") \
1732 \
1733 product(uintx, CMSMaxAbortablePrecleanLoops, 0, \
1734 "Maximum number of abortable preclean iterations, if > 0") \
1735 \
1736 product(intx, CMSMaxAbortablePrecleanTime, 5000, \
1737 "Maximum time in abortable preclean (in milliseconds)") \
1738 \
1739 product(uintx, CMSAbortablePrecleanMinWorkPerIteration, 100, \
1740 "Nominal minimum work per abortable preclean iteration") \
1741 \
1742 manageable(intx, CMSAbortablePrecleanWaitMillis, 100, \
1743 "Time that we sleep between iterations when not given " \
1744 "enough work per iteration") \
1745 \
1746 product(size_t, CMSRescanMultiple, 32, \
1747 "Size (in cards) of CMS parallel rescan task") \
1748 \
1749 product(size_t, CMSConcMarkMultiple, 32, \
1750 "Size (in cards) of CMS concurrent MT marking task") \
1751 \
1752 product(bool, CMSAbortSemantics, false, \
1753 "Whether abort-on-overflow semantics is implemented") \
1754 \
1755 product(bool, CMSParallelInitialMarkEnabled, true, \
1756 "Use the parallel initial mark.") \
1757 \
1758 product(bool, CMSParallelRemarkEnabled, true, \
1759 "Whether parallel remark enabled (only if ParNewGC)") \
1760 \
1761 product(bool, CMSParallelSurvivorRemarkEnabled, true, \
1762 "Whether parallel remark of survivor space " \
1763 "enabled (effective only if CMSParallelRemarkEnabled)") \
1764 \
1765 product(bool, CMSPLABRecordAlways, true, \
1766 "Always record survivor space PLAB boundaries (effective only " \
1767 "if CMSParallelSurvivorRemarkEnabled)") \
1768 \
1769 product(bool, CMSEdenChunksRecordAlways, true, \
1770 "Always record eden chunks used for the parallel initial mark " \
1771 "or remark of eden") \
1772 \
1773 product(bool, CMSPrintEdenSurvivorChunks, false, \
1774 "Print the eden and the survivor chunks used for the parallel " \
1775 "initial mark or remark of the eden/survivor spaces") \
1776 \
1777 product(bool, CMSConcurrentMTEnabled, true, \
1778 "Whether multi-threaded concurrent work enabled " \
1779 "(effective only if ParNewGC)") \
1780 \
1781 product(bool, CMSPrecleaningEnabled, true, \
1782 "Whether concurrent precleaning enabled") \
1783 \
1784 product(uintx, CMSPrecleanIter, 3, \
1785 "Maximum number of precleaning iteration passes") \
1786 \
1787 product(uintx, CMSPrecleanNumerator, 2, \
1788 "CMSPrecleanNumerator:CMSPrecleanDenominator yields convergence " \
1789 "ratio") \
1790 \
1791 product(uintx, CMSPrecleanDenominator, 3, \
1792 "CMSPrecleanNumerator:CMSPrecleanDenominator yields convergence " \
1793 "ratio") \
1794 \
1795 product(bool, CMSPrecleanRefLists1, true, \
1796 "Preclean ref lists during (initial) preclean phase") \
1797 \
1798 product(bool, CMSPrecleanRefLists2, false, \
1799 "Preclean ref lists during abortable preclean phase") \
1800 \
1801 product(bool, CMSPrecleanSurvivors1, false, \
1802 "Preclean survivors during (initial) preclean phase") \
1803 \
1804 product(bool, CMSPrecleanSurvivors2, true, \
1805 "Preclean survivors during abortable preclean phase") \
1806 \
1807 product(uintx, CMSPrecleanThreshold, 1000, \
1808 "Do not iterate again if number of dirty cards is less than this")\
1809 \
1810 product(bool, CMSCleanOnEnter, true, \
1811 "Clean-on-enter optimization for reducing number of dirty cards") \
1812 \
1813 product(uintx, CMSRemarkVerifyVariant, 1, \
1814 "Choose variant (1,2) of verification following remark") \
1815 \
1816 product(size_t, CMSScheduleRemarkEdenSizeThreshold, 2*M, \
1817 "If Eden size is below this, do not try to schedule remark") \
1818 \
1819 product(uintx, CMSScheduleRemarkEdenPenetration, 50, \
1820 "The Eden occupancy percentage (0-100) at which " \
1821 "to try and schedule remark pause") \
1822 \
1823 product(uintx, CMSScheduleRemarkSamplingRatio, 5, \
1824 "Start sampling eden top at least before young gen " \
1825 "occupancy reaches 1/<ratio> of the size at which " \
1826 "we plan to schedule remark") \
1827 \
1828 product(uintx, CMSSamplingGrain, 16*K, \
1829 "The minimum distance between eden samples for CMS (see above)") \
1830 \
1831 product(bool, CMSScavengeBeforeRemark, false, \
1832 "Attempt scavenge before the CMS remark step") \
1833 \
1834 develop(bool, CMSTraceSweeper, false, \
1835 "Trace some actions of the CMS sweeper") \
1836 \
1837 product(uintx, CMSWorkQueueDrainThreshold, 10, \
1838 "Don't drain below this size per parallel worker/thief") \
1839 \
1840 manageable(intx, CMSWaitDuration, 2000, \
1841 "Time in milliseconds that CMS thread waits for young GC") \
1842 \
1843 develop(uintx, CMSCheckInterval, 1000, \
1844 "Interval in milliseconds that CMS thread checks if it " \
1845 "should start a collection cycle") \
1846 \
1847 product(bool, CMSYield, true, \
1848 "Yield between steps of CMS") \
1849 \
1850 product(size_t, CMSBitMapYieldQuantum, 10*M, \
1851 "Bitmap operations should process at most this many bits " \
1852 "between yields") \
1853 \
1854 product(bool, CMSDumpAtPromotionFailure, false, \
1855 "Dump useful information about the state of the CMS old " \
1856 "generation upon a promotion failure") \
1857 \
1858 product(bool, CMSPrintChunksInDump, false, \
1859 "In a dump enabled by CMSDumpAtPromotionFailure, include " \
1860 "more detailed information about the free chunks") \
1861 \
1862 product(bool, CMSPrintObjectsInDump, false, \
1863 "In a dump enabled by CMSDumpAtPromotionFailure, include " \
1864 "more detailed information about the allocated objects") \
1865 \
1866 diagnostic(bool, FLSVerifyAllHeapReferences, false, \
1867 "Verify that all references across the FLS boundary " \
1868 "are to valid objects") \
1869 \
1870 diagnostic(bool, FLSVerifyLists, false, \
1871 "Do lots of (expensive) FreeListSpace verification") \
1872 \
1873 diagnostic(bool, FLSVerifyIndexTable, false, \
1874 "Do lots of (expensive) FLS index table verification") \
1875 \
1876 develop(bool, FLSVerifyDictionary, false, \
1877 "Do lots of (expensive) FLS dictionary verification") \
1878 \
1879 develop(bool, VerifyBlockOffsetArray, false, \
1880 "Do (expensive) block offset array verification") \
1881 \
1882 diagnostic(bool, BlockOffsetArrayUseUnallocatedBlock, false, \
1883 "Maintain _unallocated_block in BlockOffsetArray " \
1884 "(currently applicable only to CMS collector)") \
1885 \
1886 develop(bool, TraceCMSState, false, \
1887 "Trace the state of the CMS collection") \
1888 \
1889 product(intx, RefDiscoveryPolicy, 0, \
1890 "Select type of reference discovery policy: " \
1891 "reference-based(0) or referent-based(1)") \
1892 \
1893 product(bool, ParallelRefProcEnabled, false, \
1894 "Enable parallel reference processing whenever possible") \
1895 \
1896 product(bool, ParallelRefProcBalancingEnabled, true, \
1897 "Enable balancing of reference processing queues") \
1898 \
1899 product(uintx, CMSTriggerRatio, 80, \
1900 "Percentage of MinHeapFreeRatio in CMS generation that is " \
1901 "allocated before a CMS collection cycle commences") \
1902 \
1903 product(uintx, CMSBootstrapOccupancy, 50, \
1904 "Percentage CMS generation occupancy at which to " \
1905 "initiate CMS collection for bootstrapping collection stats") \
1906 \
1907 product(intx, CMSInitiatingOccupancyFraction, -1, \
1908 "Percentage CMS generation occupancy to start a CMS collection " \
1909 "cycle. A negative value means that CMSTriggerRatio is used") \
1910 \
1911 product(uintx, InitiatingHeapOccupancyPercent, 45, \
1912 "Percentage of the (entire) heap occupancy to start a " \
1913 "concurrent GC cycle. It is used by GCs that trigger a " \
1914 "concurrent GC cycle based on the occupancy of the entire heap, " \
1915 "not just one of the generations (e.g., G1). A value of 0 " \
1916 "denotes 'do constant GC cycles'.") \
1917 \
1918 manageable(intx, CMSTriggerInterval, -1, \
1919 "Commence a CMS collection cycle (at least) every so many " \
1920 "milliseconds (0 permanently, -1 disabled)") \
1921 \
1922 product(bool, UseCMSInitiatingOccupancyOnly, false, \
1923 "Only use occupancy as a criterion for starting a CMS collection")\
1924 \
1925 product(uintx, CMSIsTooFullPercentage, 98, \
1926 "An absolute ceiling above which CMS will always consider the " \
1927 "unloading of classes when class unloading is enabled") \
1928 \
1929 develop(bool, CMSTestInFreeList, false, \
1930 "Check if the coalesced range is already in the " \
1931 "free lists as claimed") \
1932 \
1933 notproduct(bool, CMSVerifyReturnedBytes, false, \
1934 "Check that all the garbage collected was returned to the " \
1935 "free lists") \
1936 \
1937 notproduct(bool, ScavengeALot, false, \
1938 "Force scavenge at every Nth exit from the runtime system " \
1939 "(N=ScavengeALotInterval)") \
1940 \
1941 develop(bool, FullGCALot, false, \
1942 "Force full gc at every Nth exit from the runtime system " \
1943 "(N=FullGCALotInterval)") \
1944 \
1945 notproduct(bool, GCALotAtAllSafepoints, false, \
1946 "Enforce ScavengeALot/GCALot at all potential safepoints") \
1947 \
2017 product(bool, TLABStats, true, \
2018 "Provide more detailed and expensive TLAB statistics " \
2019 "(with PrintTLAB)") \
2020 \
2021 product_pd(bool, NeverActAsServerClassMachine, \
2022 "Never act like a server-class machine") \
2023 \
2024 product(bool, AlwaysActAsServerClassMachine, false, \
2025 "Always act like a server-class machine") \
2026 \
2027 product_pd(uint64_t, MaxRAM, \
2028 "Real memory size (in bytes) used to set maximum heap size") \
2029 \
2030 product(size_t, ErgoHeapSizeLimit, 0, \
2031 "Maximum ergonomically set heap size (in bytes); zero means use " \
2032 "MaxRAM / MaxRAMFraction") \
2033 \
2034 product(uintx, MaxRAMFraction, 4, \
2035 "Maximum fraction (1/n) of real memory used for maximum heap " \
2036 "size") \
2037 \
2038 product(uintx, DefaultMaxRAMFraction, 4, \
2039 "Maximum fraction (1/n) of real memory used for maximum heap " \
2040 "size; deprecated: to be renamed to MaxRAMFraction") \
2041 \
2042 product(uintx, MinRAMFraction, 2, \
2043 "Minimum fraction (1/n) of real memory used for maximum heap " \
2044 "size on systems with small physical memory size") \
2045 \
2046 product(uintx, InitialRAMFraction, 64, \
2047 "Fraction (1/n) of real memory used for initial heap size") \
2048 \
2049 develop(uintx, MaxVirtMemFraction, 2, \
2050 "Maximum fraction (1/n) of virtual memory used for ergonomically "\
2051 "determining maximum heap size") \
2052 \
2053 product(bool, UseAutoGCSelectPolicy, false, \
2054 "Use automatic collection selection policy") \
2055 \
2056 product(uintx, AutoGCSelectPauseMillis, 5000, \
2057 "Automatic GC selection pause threshold in milliseconds") \
2058 \
2059 product(bool, UseAdaptiveSizePolicy, true, \
2060 "Use adaptive generation sizing policies") \
2061 \
2062 product(bool, UsePSAdaptiveSurvivorSizePolicy, true, \
2063 "Use adaptive survivor sizing policies") \
2064 \
2065 product(bool, UseAdaptiveGenerationSizePolicyAtMinorCollection, true, \
2066 "Use adaptive young-old sizing policies at minor collections") \
2067 \
2086 develop(bool, PSAdjustTenuredGenForMinorPause, false, \
2087 "Adjust tenured generation to achieve a minor pause goal") \
2088 \
2089 develop(bool, PSAdjustYoungGenForMajorPause, false, \
2090 "Adjust young generation to achieve a major pause goal") \
2091 \
2092 product(uintx, AdaptiveSizePolicyInitializingSteps, 20, \
2093 "Number of steps where heuristics is used before data is used") \
2094 \
2095 develop(uintx, AdaptiveSizePolicyReadyThreshold, 5, \
2096 "Number of collections before the adaptive sizing is started") \
2097 \
2098 product(uintx, AdaptiveSizePolicyOutputInterval, 0, \
2099 "Collection interval for printing information; zero means never") \
2100 \
2101 product(bool, UseAdaptiveSizePolicyFootprintGoal, true, \
2102 "Use adaptive minimum footprint as a goal") \
2103 \
2104 product(uintx, AdaptiveSizePolicyWeight, 10, \
2105 "Weight given to exponential resizing, between 0 and 100") \
2106 \
2107 product(uintx, AdaptiveTimeWeight, 25, \
2108 "Weight given to time in adaptive policy, between 0 and 100") \
2109 \
2110 product(uintx, PausePadding, 1, \
2111 "How much buffer to keep for pause time") \
2112 \
2113 product(uintx, PromotedPadding, 3, \
2114 "How much buffer to keep for promotion failure") \
2115 \
2116 product(uintx, SurvivorPadding, 3, \
2117 "How much buffer to keep for survivor overflow") \
2118 \
2119 product(uintx, ThresholdTolerance, 10, \
2120 "Allowed collection cost difference between generations") \
2121 \
2122 product(uintx, AdaptiveSizePolicyCollectionCostMargin, 50, \
2123 "If collection costs are within margin, reduce both by full " \
2124 "delta") \
2125 \
2126 product(uintx, YoungGenerationSizeIncrement, 20, \
2127 "Adaptive size percentage change in young generation") \
2128 \
2129 product(uintx, YoungGenerationSizeSupplement, 80, \
2130 "Supplement to YoungedGenerationSizeIncrement used at startup") \
2131 \
2132 product(uintx, YoungGenerationSizeSupplementDecay, 8, \
2133 "Decay factor to YoungedGenerationSizeSupplement") \
2134 \
2135 product(uintx, TenuredGenerationSizeIncrement, 20, \
2136 "Adaptive size percentage change in tenured generation") \
2137 \
2138 product(uintx, TenuredGenerationSizeSupplement, 80, \
2139 "Supplement to TenuredGenerationSizeIncrement used at startup") \
2140 \
2141 product(uintx, TenuredGenerationSizeSupplementDecay, 2, \
2142 "Decay factor to TenuredGenerationSizeIncrement") \
2143 \
2144 product(uintx, MaxGCPauseMillis, max_uintx, \
2145 "Adaptive size policy maximum GC pause time goal in millisecond, "\
2146 "or (G1 Only) the maximum GC time per MMU time slice") \
2147 \
2148 product(uintx, GCPauseIntervalMillis, 0, \
2149 "Time slice for MMU specification") \
2150 \
2151 product(uintx, MaxGCMinorPauseMillis, max_uintx, \
2152 "Adaptive size policy maximum GC minor pause time goal " \
2153 "in millisecond") \
2154 \
2155 product(uintx, GCTimeRatio, 99, \
2156 "Adaptive size policy application time to GC time ratio") \
2157 \
2158 product(uintx, AdaptiveSizeDecrementScaleFactor, 4, \
2159 "Adaptive size scale down factor for shrinking") \
2160 \
2161 product(bool, UseAdaptiveSizeDecayMajorGCCost, true, \
2162 "Adaptive size decays the major cost for long major intervals") \
2163 \
2164 product(uintx, AdaptiveSizeMajorGCDecayTimeScale, 10, \
2165 "Time scale over which major costs decay") \
2166 \
2167 product(uintx, MinSurvivorRatio, 3, \
2168 "Minimum ratio of young generation/survivor space size") \
2169 \
2170 product(uintx, InitialSurvivorRatio, 8, \
2171 "Initial ratio of young generation/survivor space size") \
2172 \
2173 product(size_t, BaseFootPrintEstimate, 256*M, \
2174 "Estimate of footprint other than Java Heap") \
2175 \
2176 product(bool, UseGCOverheadLimit, true, \
2177 "Use policy to limit of proportion of time spent in GC " \
2178 "before an OutOfMemory error is thrown") \
2179 \
2180 product(uintx, GCTimeLimit, 98, \
2181 "Limit of the proportion of time spent in GC before " \
2182 "an OutOfMemoryError is thrown (used with GCHeapFreeLimit)") \
2183 \
2184 product(uintx, GCHeapFreeLimit, 2, \
2185 "Minimum percentage of free space after a full GC before an " \
2186 "OutOfMemoryError is thrown (used with GCTimeLimit)") \
2187 \
2188 develop(uintx, AdaptiveSizePolicyGCTimeLimitThreshold, 5, \
2189 "Number of consecutive collections before gc time limit fires") \
2190 \
2191 product(bool, PrintAdaptiveSizePolicy, false, \
2192 "Print information about AdaptiveSizePolicy") \
2193 \
2194 product(intx, PrefetchCopyIntervalInBytes, -1, \
2195 "How far ahead to prefetch destination area (<= 0 means off)") \
2196 \
2197 product(intx, PrefetchScanIntervalInBytes, -1, \
2198 "How far ahead to prefetch scan area (<= 0 means off)") \
2199 \
2200 product(intx, PrefetchFieldsAhead, -1, \
2201 "How many fields ahead to prefetch in oop scan (<= 0 means off)") \
2202 \
2203 diagnostic(bool, VerifySilently, false, \
2204 "Do not print the verification progress") \
2205 \
2206 diagnostic(bool, VerifyDuringStartup, false, \
2451 "compile native methods if supported by the compiler") \
2452 \
2453 develop_pd(bool, CICompileOSR, \
2454 "compile on stack replacement methods if supported by the " \
2455 "compiler") \
2456 \
2457 develop(bool, CIPrintMethodCodes, false, \
2458 "print method bytecodes of the compiled code") \
2459 \
2460 develop(bool, CIPrintTypeFlow, false, \
2461 "print the results of ciTypeFlow analysis") \
2462 \
2463 develop(bool, CITraceTypeFlow, false, \
2464 "detailed per-bytecode tracing of ciTypeFlow analysis") \
2465 \
2466 develop(intx, OSROnlyBCI, -1, \
2467 "OSR only at this bci. Negative values mean exclude that bci") \
2468 \
2469 /* compiler */ \
2470 \
2471 product(intx, CICompilerCount, CI_COMPILER_COUNT, \
2472 "Number of compiler threads to run") \
2473 \
2474 product(intx, CompilationPolicyChoice, 0, \
2475 "which compilation policy (0-3)") \
2476 \
2477 develop(bool, UseStackBanging, true, \
2478 "use stack banging for stack overflow checks (required for " \
2479 "proper StackOverflow handling; disable only to measure cost " \
2480 "of stackbanging)") \
2481 \
2482 develop(bool, UseStrictFP, true, \
2483 "use strict fp if modifier strictfp is set") \
2484 \
2485 develop(bool, GenerateSynchronizationCode, true, \
2486 "generate locking/unlocking code for synchronized methods and " \
2487 "monitors") \
2488 \
2489 develop(bool, GenerateCompilerNullChecks, true, \
2490 "Generate explicit null checks for loads/stores/calls") \
2491 \
2492 develop(bool, GenerateRangeChecks, true, \
2493 "Generate range checks for array accesses") \
2494 \
2495 develop_pd(bool, ImplicitNullChecks, \
2572 \
2573 product(bool, PrintVMOptions, false, \
2574 "Print flags that appeared on the command line") \
2575 \
2576 product(bool, IgnoreUnrecognizedVMOptions, false, \
2577 "Ignore unrecognized VM options") \
2578 \
2579 product(bool, PrintCommandLineFlags, false, \
2580 "Print flags specified on command line or set by ergonomics") \
2581 \
2582 product(bool, PrintFlagsInitial, false, \
2583 "Print all VM flags before argument processing and exit VM") \
2584 \
2585 product(bool, PrintFlagsFinal, false, \
2586 "Print all VM flags after argument and ergonomic processing") \
2587 \
2588 notproduct(bool, PrintFlagsWithComments, false, \
2589 "Print all VM flags with default values and descriptions and " \
2590 "exit") \
2591 \
2592 diagnostic(bool, SerializeVMOutput, true, \
2593 "Use a mutex to serialize output to tty and LogFile") \
2594 \
2595 diagnostic(bool, DisplayVMOutput, true, \
2596 "Display all VM output on the tty, independently of LogVMOutput") \
2597 \
2598 diagnostic(bool, LogVMOutput, false, \
2599 "Save VM output to LogFile") \
2600 \
2601 diagnostic(ccstr, LogFile, NULL, \
2602 "If LogVMOutput or LogCompilation is on, save VM output to " \
2603 "this file [default: ./hotspot_pid%p.log] (%p replaced with pid)")\
2604 \
2605 product(ccstr, ErrorFile, NULL, \
2606 "If an error occurs, save the error data to this file " \
2607 "[default: ./hs_err_pid%p.log] (%p replaced with pid)") \
2608 \
2609 product(bool, DisplayVMOutputToStderr, false, \
2610 "If DisplayVMOutput is true, display all VM output to stderr") \
2611 \
2810 develop(bool, TraceFrequencyInlining, false, \
2811 "Trace frequency based inlining") \
2812 \
2813 develop_pd(bool, InlineIntrinsics, \
2814 "Inline intrinsics that can be statically resolved") \
2815 \
2816 product_pd(bool, ProfileInterpreter, \
2817 "Profile at the bytecode level during interpretation") \
2818 \
2819 develop(bool, TraceProfileInterpreter, false, \
2820 "Trace profiling at the bytecode level during interpretation. " \
2821 "This outputs the profiling information collected to improve " \
2822 "jit compilation.") \
2823 \
2824 develop_pd(bool, ProfileTraps, \
2825 "Profile deoptimization traps at the bytecode level") \
2826 \
2827 product(intx, ProfileMaturityPercentage, 20, \
2828 "number of method invocations/branches (expressed as % of " \
2829 "CompileThreshold) before using the method's profile") \
2830 \
2831 diagnostic(bool, PrintMethodData, false, \
2832 "Print the results of +ProfileInterpreter at end of run") \
2833 \
2834 develop(bool, VerifyDataPointer, trueInDebug, \
2835 "Verify the method data pointer during interpreter profiling") \
2836 \
2837 develop(bool, VerifyCompiledCode, false, \
2838 "Include miscellaneous runtime verifications in nmethod code; " \
2839 "default off because it disturbs nmethod size heuristics") \
2840 \
2841 notproduct(bool, CrashGCForDumpingJavaThread, false, \
2842 "Manually make GC thread crash then dump java stack trace; " \
2843 "Test only") \
2844 \
2845 /* compilation */ \
2846 product(bool, UseCompiler, true, \
2847 "Use Just-In-Time compilation") \
2848 \
2849 develop(bool, TraceCompilationPolicy, false, \
2870 "Do not compile methods > HugeMethodLimit") \
2871 \
2872 /* Bytecode escape analysis estimation. */ \
2873 product(bool, EstimateArgEscape, true, \
2874 "Analyze bytecodes to estimate escape state of arguments") \
2875 \
2876 product(intx, BCEATraceLevel, 0, \
2877 "How much tracing to do of bytecode escape analysis estimates") \
2878 \
2879 product(intx, MaxBCEAEstimateLevel, 5, \
2880 "Maximum number of nested calls that are analyzed by BC EA") \
2881 \
2882 product(intx, MaxBCEAEstimateSize, 150, \
2883 "Maximum bytecode size of a method to be analyzed by BC EA") \
2884 \
2885 product(intx, AllocatePrefetchStyle, 1, \
2886 "0 = no prefetch, " \
2887 "1 = prefetch instructions for each allocation, " \
2888 "2 = use TLAB watermark to gate allocation prefetch, " \
2889 "3 = use BIS instruction on Sparc for allocation prefetch") \
2890 \
2891 product(intx, AllocatePrefetchDistance, -1, \
2892 "Distance to prefetch ahead of allocation pointer") \
2893 \
2894 product(intx, AllocatePrefetchLines, 3, \
2895 "Number of lines to prefetch ahead of array allocation pointer") \
2896 \
2897 product(intx, AllocateInstancePrefetchLines, 1, \
2898 "Number of lines to prefetch ahead of instance allocation " \
2899 "pointer") \
2900 \
2901 product(intx, AllocatePrefetchStepSize, 16, \
2902 "Step size in bytes of sequential prefetch instructions") \
2903 \
2904 product(intx, AllocatePrefetchInstr, 0, \
2905 "Prefetch instruction to prefetch ahead of allocation pointer") \
2906 \
2907 /* deoptimization */ \
2908 develop(bool, TraceDeoptimization, false, \
2909 "Trace deoptimization") \
2916 "(0 means off)") \
2917 \
2918 product(intx, MaxJavaStackTraceDepth, 1024, \
2919 "The maximum number of lines in the stack trace for Java " \
2920 "exceptions (0 means all)") \
2921 \
2922 NOT_EMBEDDED(diagnostic(intx, GuaranteedSafepointInterval, 1000, \
2923 "Guarantee a safepoint (at least) every so many milliseconds " \
2924 "(0 means none)")) \
2925 \
2926 EMBEDDED_ONLY(product(intx, GuaranteedSafepointInterval, 0, \
2927 "Guarantee a safepoint (at least) every so many milliseconds " \
2928 "(0 means none)")) \
2929 \
2930 product(intx, SafepointTimeoutDelay, 10000, \
2931 "Delay in milliseconds for option SafepointTimeout") \
2932 \
2933 product(intx, NmethodSweepActivity, 10, \
2934 "Removes cold nmethods from code cache if > 0. Higher values " \
2935 "result in more aggressive sweeping") \
2936 \
2937 notproduct(bool, LogSweeper, false, \
2938 "Keep a ring buffer of sweeper activity") \
2939 \
2940 notproduct(intx, SweeperLogEntries, 1024, \
2941 "Number of records in the ring buffer of sweeper activity") \
2942 \
2943 notproduct(intx, MemProfilingInterval, 500, \
2944 "Time between each invocation of the MemProfiler") \
2945 \
2946 develop(intx, MallocCatchPtr, -1, \
2947 "Hit breakpoint when mallocing/freeing this pointer") \
2948 \
2949 notproduct(ccstrlist, SuppressErrorAt, "", \
2950 "List of assertions (file:line) to muzzle") \
2951 \
2952 notproduct(size_t, HandleAllocationLimit, 1024, \
2953 "Threshold for HandleMark allocation when +TraceHandleAllocation "\
2954 "is used") \
2955 \
3044 diagnostic(intx, MallocVerifyInterval, 0, \
3045 "If non-zero, verify C heap after every N calls to " \
3046 "malloc/realloc/free") \
3047 \
3048 diagnostic(intx, MallocVerifyStart, 0, \
3049 "If non-zero, start verifying C heap after Nth call to " \
3050 "malloc/realloc/free") \
3051 \
3052 diagnostic(uintx, MallocMaxTestWords, 0, \
3053 "If non-zero, maximum number of words that malloc/realloc can " \
3054 "allocate (for testing only)") \
3055 \
3056 product(intx, TypeProfileWidth, 2, \
3057 "Number of receiver types to record in call/cast profile") \
3058 \
3059 develop(intx, BciProfileWidth, 2, \
3060 "Number of return bci's to record in ret profile") \
3061 \
3062 product(intx, PerMethodRecompilationCutoff, 400, \
3063 "After recompiling N times, stay in the interpreter (-1=>'Inf')") \
3064 \
3065 product(intx, PerBytecodeRecompilationCutoff, 200, \
3066 "Per-BCI limit on repeated recompilation (-1=>'Inf')") \
3067 \
3068 product(intx, PerMethodTrapLimit, 100, \
3069 "Limit on traps (of one kind) in a method (includes inlines)") \
3070 \
3071 experimental(intx, PerMethodSpecTrapLimit, 5000, \
3072 "Limit on speculative traps (of one kind) in a method (includes inlines)") \
3073 \
3074 product(intx, PerBytecodeTrapLimit, 4, \
3075 "Limit on traps (of one kind) at a particular BCI") \
3076 \
3077 experimental(intx, SpecTrapLimitExtraEntries, 3, \
3078 "Extra method data trap entries for speculation") \
3079 \
3080 develop(intx, InlineFrequencyRatio, 20, \
3081 "Ratio of call site execution to caller method invocation") \
3082 \
3083 develop_pd(intx, InlineFrequencyCount, \
3084 "Count of call site execution necessary to trigger frequent " \
3085 "inlining") \
3086 \
3087 develop(intx, InlineThrowCount, 50, \
3088 "Force inlining of interpreted methods that throw this often") \
3089 \
3090 develop(intx, InlineThrowMaxSize, 200, \
3091 "Force inlining of throwing methods smaller than this") \
3092 \
3105 \
3106 product(size_t, OldSize, ScaleForWordSize(4*M), \
3107 "Initial tenured generation size (in bytes)") \
3108 \
3109 product(size_t, NewSize, ScaleForWordSize(1*M), \
3110 "Initial new generation size (in bytes)") \
3111 \
3112 product(size_t, MaxNewSize, max_uintx, \
3113 "Maximum new generation size (in bytes), max_uintx means set " \
3114 "ergonomically") \
3115 \
3116 product(size_t, PretenureSizeThreshold, 0, \
3117 "Maximum size in bytes of objects allocated in DefNew " \
3118 "generation; zero means no maximum") \
3119 \
3120 product(size_t, TLABSize, 0, \
3121 "Starting TLAB size (in bytes); zero means set ergonomically") \
3122 \
3123 product(size_t, MinTLABSize, 2*K, \
3124 "Minimum allowed TLAB size (in bytes)") \
3125 \
3126 product(uintx, TLABAllocationWeight, 35, \
3127 "Allocation averaging weight") \
3128 \
3129 product(uintx, TLABWasteTargetPercent, 1, \
3130 "Percentage of Eden that can be wasted") \
3131 \
3132 product(uintx, TLABRefillWasteFraction, 64, \
3133 "Maximum TLAB waste at a refill (internal fragmentation)") \
3134 \
3135 product(uintx, TLABWasteIncrement, 4, \
3136 "Increment allowed waste at slow allocation") \
3137 \
3138 product(uintx, SurvivorRatio, 8, \
3139 "Ratio of eden/survivor space size") \
3140 \
3141 product(uintx, NewRatio, 2, \
3142 "Ratio of old/new generation sizes") \
3143 \
3144 product_pd(size_t, NewSizeThreadIncrease, \
3145 "Additional size added to desired new generation size per " \
3146 "non-daemon thread (in bytes)") \
3147 \
3148 product_pd(size_t, MetaspaceSize, \
3149 "Initial size of Metaspaces (in bytes)") \
3150 \
3151 product(size_t, MaxMetaspaceSize, max_uintx, \
3152 "Maximum size of Metaspaces (in bytes)") \
3153 \
3154 product(size_t, CompressedClassSpaceSize, 1*G, \
3155 "Maximum size of class area in Metaspace when compressed " \
3156 "class pointers are used") \
3157 \
3158 manageable(uintx, MinHeapFreeRatio, 40, \
3159 "The minimum percentage of heap free after GC to avoid expansion."\
3160 " For most GCs this applies to the old generation. In G1 and" \
3161 " ParallelGC it applies to the whole heap.") \
3162 \
3163 manageable(uintx, MaxHeapFreeRatio, 70, \
3164 "The maximum percentage of heap free after GC to avoid shrinking."\
3165 " For most GCs this applies to the old generation. In G1 and" \
3166 " ParallelGC it applies to the whole heap.") \
3167 \
3168 product(intx, SoftRefLRUPolicyMSPerMB, 1000, \
3169 "Number of milliseconds per MB of free space in the heap") \
3170 \
3171 product(size_t, MinHeapDeltaBytes, ScaleForWordSize(128*K), \
3172 "The minimum change in heap space due to GC (in bytes)") \
3173 \
3174 product(size_t, MinMetaspaceExpansion, ScaleForWordSize(256*K), \
3175 "The minimum expansion of Metaspace (in bytes)") \
3176 \
3177 product(uintx, MinMetaspaceFreeRatio, 40, \
3178 "The minimum percentage of Metaspace free after GC to avoid " \
3179 "expansion") \
3180 \
3181 product(uintx, MaxMetaspaceFreeRatio, 70, \
3182 "The maximum percentage of Metaspace free after GC to avoid " \
3183 "shrinking") \
3184 \
3185 product(size_t, MaxMetaspaceExpansion, ScaleForWordSize(4*M), \
3186 "The maximum expansion of Metaspace without full GC (in bytes)") \
3187 \
3188 product(uintx, QueuedAllocationWarningCount, 0, \
3189 "Number of times an allocation that queues behind a GC " \
3190 "will retry before printing a warning") \
3191 \
3192 diagnostic(uintx, VerifyGCStartAt, 0, \
3193 "GC invoke count where +VerifyBefore/AfterGC kicks in") \
3194 \
3195 diagnostic(intx, VerifyGCLevel, 0, \
3196 "Generation level at which to start +VerifyBefore/AfterGC") \
3197 \
3198 product(uintx, MaxTenuringThreshold, 15, \
3199 "Maximum value for tenuring threshold") \
3200 \
3201 product(uintx, InitialTenuringThreshold, 7, \
3202 "Initial value for tenuring threshold") \
3203 \
3204 product(uintx, TargetSurvivorRatio, 50, \
3205 "Desired percentage of survivor space used after scavenge") \
3206 \
3207 product(uintx, MarkSweepDeadRatio, 5, \
3208 "Percentage (0-100) of the old gen allowed as dead wood. " \
3209 "Serial mark sweep treats this as both the minimum and maximum " \
3210 "value. " \
3211 "CMS uses this value only if it falls back to mark sweep. " \
3212 "Par compact uses a variable scale based on the density of the " \
3213 "generation and treats this as the maximum value when the heap " \
3214 "is either completely full or completely empty. Par compact " \
3215 "also has a smaller default value; see arguments.cpp.") \
3216 \
3217 product(uintx, MarkSweepAlwaysCompactCount, 4, \
3218 "How often should we fully compact the heap (ignoring the dead " \
3219 "space parameters)") \
3220 \
3221 product(intx, PrintCMSStatistics, 0, \
3222 "Statistics for CMS") \
3223 \
3224 product(bool, PrintCMSInitiationStatistics, false, \
3225 "Statistics for initiating a CMS collection") \
3226 \
3227 product(intx, PrintFLSStatistics, 0, \
3228 "Statistics for CMS' FreeListSpace") \
3229 \
3230 product(intx, PrintFLSCensus, 0, \
3231 "Census for CMS' FreeListSpace") \
3232 \
3233 develop(uintx, GCExpandToAllocateDelayMillis, 0, \
3234 "Delay between expansion and allocation (in milliseconds)") \
3235 \
3236 develop(uintx, GCWorkerDelayMillis, 0, \
3237 "Delay in scheduling GC workers (in milliseconds)") \
3238 \
3239 product(intx, DeferThrSuspendLoopCount, 4000, \
3240 "(Unstable) Number of times to iterate in safepoint loop " \
3241 "before blocking VM threads ") \
3242 \
3243 product(intx, DeferPollingPageLoopCount, -1, \
3244 "(Unsafe,Unstable) Number of iterations in safepoint loop " \
3245 "before changing safepoint polling page to RO ") \
3246 \
3247 product(intx, SafepointSpinBeforeYield, 2000, "(Unstable)") \
3248 \
3249 product(bool, PSChunkLargeArrays, true, \
3250 "Process large arrays in chunks") \
3251 \
3252 product(uintx, GCDrainStackTargetSize, 64, \
3253 "Number of entries we will try to leave on the stack " \
3254 "during parallel gc") \
3255 \
3256 /* stack parameters */ \
3257 product_pd(intx, StackYellowPages, \
3258 "Number of yellow zone (recoverable overflows) pages") \
3259 \
3260 product_pd(intx, StackRedPages, \
3261 "Number of red zone (unrecoverable overflows) pages") \
3262 \
3263 product_pd(intx, StackShadowPages, \
3264 "Number of shadow zone (for overflow checking) pages " \
3265 "this should exceed the depth of the VM and native call stack") \
3266 \
3267 product_pd(intx, ThreadStackSize, \
3268 "Thread Stack Size (in Kbytes)") \
3269 \
3270 product_pd(intx, VMThreadStackSize, \
3271 "Non-Java Thread Stack Size (in Kbytes)") \
3272 \
3273 product_pd(intx, CompilerThreadStackSize, \
3274 "Compiler Thread Stack Size (in Kbytes)") \
3275 \
3276 develop_pd(size_t, JVMInvokeMethodSlack, \
3277 "Stack space (bytes) required for JVM_InvokeMethod to complete") \
3278 \
3279 product(size_t, ThreadSafetyMargin, 50*M, \
3280 "Thread safety margin is used on fixed-stack LinuxThreads (on " \
3281 "Linux/x86 only) to prevent heap-stack collision. Set to 0 to " \
3282 "disable this feature") \
3283 \
3284 /* code cache parameters */ \
3285 /* ppc64/tiered compilation has large code-entry alignment. */ \
3286 develop(uintx, CodeCacheSegmentSize, 64 PPC64_ONLY(+64) NOT_PPC64(TIERED_ONLY(+64)),\
3287 "Code cache segment size (in bytes) - smallest unit of " \
3288 "allocation") \
3289 \
3290 develop_pd(intx, CodeEntryAlignment, \
3291 "Code entry alignment for generated code (in bytes)") \
3292 \
3293 product_pd(intx, OptoLoopAlignment, \
3294 "Align inner loops to zero relative to this modulus") \
3295 \
3296 product_pd(uintx, InitialCodeCacheSize, \
3297 "Initial code cache size (in bytes)") \
3298 \
3299 develop_pd(uintx, CodeCacheMinimumUseSpace, \
3300 "Minimum code cache size (in bytes) required to start VM.") \
3301 \
3302 product(bool, SegmentedCodeCache, false, \
3303 "Use a segmented code cache") \
3304 \
3305 product_pd(uintx, ReservedCodeCacheSize, \
3306 "Reserved code cache size (in bytes) - maximum code cache size") \
3307 \
3308 product_pd(uintx, NonProfiledCodeHeapSize, \
3309 "Size of code heap with non-profiled methods (in bytes)") \
3310 \
3311 product_pd(uintx, ProfiledCodeHeapSize, \
3312 "Size of code heap with profiled methods (in bytes)") \
3313 \
3314 product_pd(uintx, NonNMethodCodeHeapSize, \
3315 "Size of code heap with non-nmethods (in bytes)") \
3316 \
3317 product_pd(uintx, CodeCacheExpansionSize, \
3318 "Code cache expansion size (in bytes)") \
3319 \
3320 develop_pd(uintx, CodeCacheMinBlockLength, \
3321 "Minimum number of segments in a code cache block") \
3322 \
3323 notproduct(bool, ExitOnFullCodeCache, false, \
3324 "Exit the VM if we fill the code cache") \
3325 \
3326 product(bool, UseCodeCacheFlushing, true, \
3327 "Remove cold/old nmethods from the code cache") \
3328 \
3329 product(uintx, StartAggressiveSweepingAt, 10, \
3330 "Start aggressive sweeping if X[%] of the code cache is free." \
3331 "Segmented code cache: X[%] of the non-profiled heap." \
3332 "Non-segmented code cache: X[%] of the total code cache") \
3333 \
3334 /* interpreter debugging */ \
3335 develop(intx, BinarySwitchThreshold, 5, \
3336 "Minimal number of lookupswitch entries for rewriting to binary " \
3337 "switch") \
3338 \
3339 develop(intx, StopInterpreterAt, 0, \
3340 "Stop interpreter execution at specified bytecode number") \
3341 \
3342 develop(intx, TraceBytecodesAt, 0, \
3343 "Trace bytecodes starting with specified bytecode number") \
3344 \
3345 /* compiler interface */ \
3346 develop(intx, CIStart, 0, \
3347 "The id of the first compilation to permit") \
3348 \
3349 develop(intx, CIStop, max_jint, \
3350 "The id of the last compilation to permit") \
3351 \
3352 develop(intx, CIStartOSR, 0, \
3373 "Prepend to .hotspot_compiler; e.g. log,java/lang/String.<init>") \
3374 \
3375 develop(bool, ReplayCompiles, false, \
3376 "Enable replay of compilations from ReplayDataFile") \
3377 \
3378 product(ccstr, ReplayDataFile, NULL, \
3379 "File containing compilation replay information" \
3380 "[default: ./replay_pid%p.log] (%p replaced with pid)") \
3381 \
3382 product(ccstr, InlineDataFile, NULL, \
3383 "File containing inlining replay information" \
3384 "[default: ./inline_pid%p.log] (%p replaced with pid)") \
3385 \
3386 develop(intx, ReplaySuppressInitializers, 2, \
3387 "Control handling of class initialization during replay: " \
3388 "0 - don't do anything special; " \
3389 "1 - treat all class initializers as empty; " \
3390 "2 - treat class initializers for application classes as empty; " \
3391 "3 - allow all class initializers to run during bootstrap but " \
3392 " pretend they are empty after starting replay") \
3393 \
3394 develop(bool, ReplayIgnoreInitErrors, false, \
3395 "Ignore exceptions thrown during initialization for replay") \
3396 \
3397 product(bool, DumpReplayDataOnError, true, \
3398 "Record replay data for crashing compiler threads") \
3399 \
3400 product(bool, CICompilerCountPerCPU, false, \
3401 "1 compiler thread for log(N CPUs)") \
3402 \
3403 develop(intx, CIFireOOMAt, -1, \
3404 "Fire OutOfMemoryErrors throughout CI for testing the compiler " \
3405 "(non-negative value throws OOM after this many CI accesses " \
3406 "in each compile)") \
3407 notproduct(intx, CICrashAt, -1, \
3408 "id of compilation to trigger assert in compiler thread for " \
3409 "the purpose of testing, e.g. generation of replay data") \
3410 notproduct(bool, CIObjectFactoryVerify, false, \
3411 "enable potentially expensive verification in ciObjectFactory") \
3412 \
3417 "0 : Normal. "\
3418 " VM chooses priorities that are appropriate for normal "\
3419 " applications. On Solaris NORM_PRIORITY and above are mapped "\
3420 " to normal native priority. Java priorities below " \
3421 " NORM_PRIORITY map to lower native priority values. On "\
3422 " Windows applications are allowed to use higher native "\
3423 " priorities. However, with ThreadPriorityPolicy=0, VM will "\
3424 " not use the highest possible native priority, "\
3425 " THREAD_PRIORITY_TIME_CRITICAL, as it may interfere with "\
3426 " system threads. On Linux thread priorities are ignored "\
3427 " because the OS does not support static priority in "\
3428 " SCHED_OTHER scheduling class which is the only choice for "\
3429 " non-root, non-realtime applications. "\
3430 "1 : Aggressive. "\
3431 " Java thread priorities map over to the entire range of "\
3432 " native thread priorities. Higher Java thread priorities map "\
3433 " to higher native thread priorities. This policy should be "\
3434 " used with care, as sometimes it can cause performance "\
3435 " degradation in the application and/or the entire system. On "\
3436 " Linux this policy requires root privilege.") \
3437 \
3438 product(bool, ThreadPriorityVerbose, false, \
3439 "Print priority changes") \
3440 \
3441 product(intx, CompilerThreadPriority, -1, \
3442 "The native priority at which compiler threads should run " \
3443 "(-1 means no change)") \
3444 \
3445 product(intx, VMThreadPriority, -1, \
3446 "The native priority at which the VM thread should run " \
3447 "(-1 means no change)") \
3448 \
3449 product(bool, CompilerThreadHintNoPreempt, true, \
3450 "(Solaris only) Give compiler threads an extra quanta") \
3451 \
3452 product(bool, VMThreadHintNoPreempt, false, \
3453 "(Solaris only) Give VM thread an extra quanta") \
3454 \
3455 product(intx, JavaPriority1_To_OSPriority, -1, \
3456 "Map Java priorities to OS priorities") \
3600 "reaches this amount per compiler thread") \
3601 \
3602 product(intx, Tier4LoadFeedback, 3, \
3603 "Tier 4 thresholds will increase twofold when C2 queue size " \
3604 "reaches this amount per compiler thread") \
3605 \
3606 product(intx, TieredCompileTaskTimeout, 50, \
3607 "Kill compile task if method was not used within " \
3608 "given timeout in milliseconds") \
3609 \
3610 product(intx, TieredStopAtLevel, 4, \
3611 "Stop at given compilation level") \
3612 \
3613 product(intx, Tier0ProfilingStartPercentage, 200, \
3614 "Start profiling in interpreter if the counters exceed tier 3 " \
3615 "thresholds by the specified percentage") \
3616 \
3617 product(uintx, IncreaseFirstTierCompileThresholdAt, 50, \
3618 "Increase the compile threshold for C1 compilation if the code " \
3619 "cache is filled by the specified percentage") \
3620 \
3621 product(intx, TieredRateUpdateMinTime, 1, \
3622 "Minimum rate sampling interval (in milliseconds)") \
3623 \
3624 product(intx, TieredRateUpdateMaxTime, 25, \
3625 "Maximum rate sampling interval (in milliseconds)") \
3626 \
3627 product_pd(bool, TieredCompilation, \
3628 "Enable tiered compilation") \
3629 \
3630 product(bool, PrintTieredEvents, false, \
3631 "Print tiered events notifications") \
3632 \
3633 product_pd(intx, OnStackReplacePercentage, \
3634 "NON_TIERED number of method invocations/branches (expressed as " \
3635 "% of CompileThreshold) before (re-)compiling OSR code") \
3636 \
3637 product(intx, InterpreterProfilePercentage, 33, \
3638 "NON_TIERED number of method invocations/branches (expressed as " \
3639 "% of CompileThreshold) before profiling in the interpreter") \
3640 \
3641 develop(intx, MaxRecompilationSearchLength, 10, \
3642 "The maximum number of frames to inspect when searching for " \
3643 "recompilee") \
3644 \
3645 develop(intx, MaxInterpretedSearchLength, 3, \
3646 "The maximum number of interpreted frames to skip when searching "\
3647 "for recompilee") \
3648 \
3649 develop(intx, DesiredMethodLimit, 8000, \
3650 "The desired maximum method size (in bytecodes) after inlining") \
3651 \
3652 develop(intx, HugeMethodLimit, 8000, \
3653 "Don't compile methods larger than this if " \
3654 "+DontCompileHugeMethods") \
3655 \
3656 /* New JDK 1.4 reflection implementation */ \
3657 \
3658 develop(intx, FastSuperclassLimit, 8, \
3659 "Depth of hardwired instanceof accelerator array") \
3699 \
3700 product(bool, PerfDisableSharedMem, false, \
3701 "Store performance data in standard memory") \
3702 \
3703 product(intx, PerfDataMemorySize, 32*K, \
3704 "Size of performance data memory region. Will be rounded " \
3705 "up to a multiple of the native os page size.") \
3706 \
3707 product(intx, PerfMaxStringConstLength, 1024, \
3708 "Maximum PerfStringConstant string length before truncation") \
3709 \
3710 product(bool, PerfAllowAtExitRegistration, false, \
3711 "Allow registration of atexit() methods") \
3712 \
3713 product(bool, PerfBypassFileSystemCheck, false, \
3714 "Bypass Win32 file system criteria checks (Windows Only)") \
3715 \
3716 product(intx, UnguardOnExecutionViolation, 0, \
3717 "Unguard page and retry on no-execute fault (Win32 only) " \
3718 "0=off, 1=conservative, 2=aggressive") \
3719 \
3720 /* Serviceability Support */ \
3721 \
3722 product(bool, ManagementServer, false, \
3723 "Create JMX Management Server") \
3724 \
3725 product(bool, DisableAttachMechanism, false, \
3726 "Disable mechanism that allows tools to attach to this VM") \
3727 \
3728 product(bool, StartAttachListener, false, \
3729 "Always start Attach Listener at VM startup") \
3730 \
3731 manageable(bool, PrintConcurrentLocks, false, \
3732 "Print java.util.concurrent locks in thread dump") \
3733 \
3734 product(bool, TransmitErrorReport, false, \
3735 "Enable error report transmission on erroneous termination") \
3736 \
3737 product(ccstr, ErrorReportServer, NULL, \
3738 "Override built-in error report server address") \
3819 diagnostic(bool, PauseAtExit, false, \
3820 "Pause and wait for keypress on exit if a debugger is attached") \
3821 \
3822 product(bool, ExtendedDTraceProbes, false, \
3823 "Enable performance-impacting dtrace probes") \
3824 \
3825 product(bool, DTraceMethodProbes, false, \
3826 "Enable dtrace probes for method-entry and method-exit") \
3827 \
3828 product(bool, DTraceAllocProbes, false, \
3829 "Enable dtrace probes for object allocation") \
3830 \
3831 product(bool, DTraceMonitorProbes, false, \
3832 "Enable dtrace probes for monitor events") \
3833 \
3834 product(bool, RelaxAccessControlCheck, false, \
3835 "Relax the access control checks in the verifier") \
3836 \
3837 product(uintx, StringTableSize, defaultStringTableSize, \
3838 "Number of buckets in the interned String table") \
3839 \
3840 experimental(uintx, SymbolTableSize, defaultSymbolTableSize, \
3841 "Number of buckets in the JVM internal Symbol table") \
3842 \
3843 product(bool, UseStringDeduplication, false, \
3844 "Use string deduplication") \
3845 \
3846 product(bool, PrintStringDeduplicationStatistics, false, \
3847 "Print string deduplication statistics") \
3848 \
3849 product(uintx, StringDeduplicationAgeThreshold, 3, \
3850 "A string must reach this age (or be promoted to an old region) " \
3851 "to be considered for deduplication") \
3852 \
3853 diagnostic(bool, StringDeduplicationResizeALot, false, \
3854 "Force table resize every time the table is scanned") \
3855 \
3856 diagnostic(bool, StringDeduplicationRehashALot, false, \
3857 "Force table rehash every time the table is scanned") \
3858 \
3859 develop(bool, TraceDefaultMethods, false, \
3860 "Trace the default method processing steps") \
3861 \
3862 develop(bool, VerifyGenericSignatures, false, \
3863 "Abort VM on erroneous or inconsistent generic signatures") \
3864 \
3865 diagnostic(bool, WhiteBoxAPI, false, \
3866 "Enable internal testing APIs") \
3867 \
3868 product(bool, PrintGCCause, true, \
3869 "Include GC cause in GC logging") \
3870 \
3871 experimental(intx, SurvivorAlignmentInBytes, 0, \
3872 "Default survivor space alignment in bytes") \
3873 \
3874 product(bool , AllowNonVirtualCalls, false, \
3875 "Obey the ACC_SUPER flag and allow invokenonvirtual calls") \
3876 \
3877 product(ccstr, DumpLoadedClassList, NULL, \
3878 "Dump the names all loaded classes, that could be stored into " \
3879 "the CDS archive, in the specified file") \
3880 \
3881 product(ccstr, SharedClassListFile, NULL, \
3882 "Override the default CDS class list") \
3883 \
3884 diagnostic(ccstr, SharedArchiveFile, NULL, \
3885 "Override the default location of the CDS archive file") \
3886 \
3887 product(ccstr, ExtraSharedClassListFile, NULL, \
3888 "Extra classlist for building the CDS archive file") \
3889 \
3890 experimental(size_t, ArrayAllocatorMallocLimit, \
3891 SOLARIS_ONLY(64*K) NOT_SOLARIS((size_t)-1), \
3892 "Allocation less than this value will be allocated " \
3910
3911 /*
3912 * Macros for factoring of globals
3913 */
3914
3915 // Interface macros
3916 #define DECLARE_PRODUCT_FLAG(type, name, value, doc) extern "C" type name;
3917 #define DECLARE_PD_PRODUCT_FLAG(type, name, doc) extern "C" type name;
3918 #define DECLARE_DIAGNOSTIC_FLAG(type, name, value, doc) extern "C" type name;
3919 #define DECLARE_EXPERIMENTAL_FLAG(type, name, value, doc) extern "C" type name;
3920 #define DECLARE_MANAGEABLE_FLAG(type, name, value, doc) extern "C" type name;
3921 #define DECLARE_PRODUCT_RW_FLAG(type, name, value, doc) extern "C" type name;
3922 #ifdef PRODUCT
3923 #define DECLARE_DEVELOPER_FLAG(type, name, value, doc) extern "C" type CONST_##name; const type name = value;
3924 #define DECLARE_PD_DEVELOPER_FLAG(type, name, doc) extern "C" type CONST_##name; const type name = pd_##name;
3925 #define DECLARE_NOTPRODUCT_FLAG(type, name, value, doc) extern "C" type CONST_##name;
3926 #else
3927 #define DECLARE_DEVELOPER_FLAG(type, name, value, doc) extern "C" type name;
3928 #define DECLARE_PD_DEVELOPER_FLAG(type, name, doc) extern "C" type name;
3929 #define DECLARE_NOTPRODUCT_FLAG(type, name, value, doc) extern "C" type name;
3930 #endif
3931 // Special LP64 flags, product only needed for now.
3932 #ifdef _LP64
3933 #define DECLARE_LP64_PRODUCT_FLAG(type, name, value, doc) extern "C" type name;
3934 #else
3935 #define DECLARE_LP64_PRODUCT_FLAG(type, name, value, doc) const type name = value;
3936 #endif // _LP64
3937
3938 // Implementation macros
3939 #define MATERIALIZE_PRODUCT_FLAG(type, name, value, doc) type name = value;
3940 #define MATERIALIZE_PD_PRODUCT_FLAG(type, name, doc) type name = pd_##name;
3941 #define MATERIALIZE_DIAGNOSTIC_FLAG(type, name, value, doc) type name = value;
3942 #define MATERIALIZE_EXPERIMENTAL_FLAG(type, name, value, doc) type name = value;
3943 #define MATERIALIZE_MANAGEABLE_FLAG(type, name, value, doc) type name = value;
3944 #define MATERIALIZE_PRODUCT_RW_FLAG(type, name, value, doc) type name = value;
3945 #ifdef PRODUCT
3946 #define MATERIALIZE_DEVELOPER_FLAG(type, name, value, doc) type CONST_##name = value;
3947 #define MATERIALIZE_PD_DEVELOPER_FLAG(type, name, doc) type CONST_##name = pd_##name;
3948 #define MATERIALIZE_NOTPRODUCT_FLAG(type, name, value, doc) type CONST_##name = value;
3949 #else
3950 #define MATERIALIZE_DEVELOPER_FLAG(type, name, value, doc) type name = value;
3951 #define MATERIALIZE_PD_DEVELOPER_FLAG(type, name, doc) type name = pd_##name;
3952 #define MATERIALIZE_NOTPRODUCT_FLAG(type, name, value, doc) type name = value;
3953 #endif
3954 #ifdef _LP64
3955 #define MATERIALIZE_LP64_PRODUCT_FLAG(type, name, value, doc) type name = value;
3956 #else
3957 #define MATERIALIZE_LP64_PRODUCT_FLAG(type, name, value, doc) /* flag is constant */
3958 #endif // _LP64
3959
3960 RUNTIME_FLAGS(DECLARE_DEVELOPER_FLAG, DECLARE_PD_DEVELOPER_FLAG, DECLARE_PRODUCT_FLAG, DECLARE_PD_PRODUCT_FLAG, DECLARE_DIAGNOSTIC_FLAG, DECLARE_EXPERIMENTAL_FLAG, DECLARE_NOTPRODUCT_FLAG, DECLARE_MANAGEABLE_FLAG, DECLARE_PRODUCT_RW_FLAG, DECLARE_LP64_PRODUCT_FLAG)
3961
3962 RUNTIME_OS_FLAGS(DECLARE_DEVELOPER_FLAG, DECLARE_PD_DEVELOPER_FLAG, DECLARE_PRODUCT_FLAG, DECLARE_PD_PRODUCT_FLAG, DECLARE_DIAGNOSTIC_FLAG, DECLARE_NOTPRODUCT_FLAG)
3963
3964 ARCH_FLAGS(DECLARE_DEVELOPER_FLAG, DECLARE_PRODUCT_FLAG, DECLARE_DIAGNOSTIC_FLAG, DECLARE_EXPERIMENTAL_FLAG, DECLARE_NOTPRODUCT_FLAG)
3965
3966 // Extensions
3967
3968 #include "runtime/globals_ext.hpp"
3969
3970 #endif // SHARE_VM_RUNTIME_GLOBALS_HPP
|
241
242 // flag kind
243 KIND_PRODUCT = 1 << 4,
244 KIND_MANAGEABLE = 1 << 5,
245 KIND_DIAGNOSTIC = 1 << 6,
246 KIND_EXPERIMENTAL = 1 << 7,
247 KIND_NOT_PRODUCT = 1 << 8,
248 KIND_DEVELOP = 1 << 9,
249 KIND_PLATFORM_DEPENDENT = 1 << 10,
250 KIND_READ_WRITE = 1 << 11,
251 KIND_C1 = 1 << 12,
252 KIND_C2 = 1 << 13,
253 KIND_ARCH = 1 << 14,
254 KIND_SHARK = 1 << 15,
255 KIND_LP64_PRODUCT = 1 << 16,
256 KIND_COMMERCIAL = 1 << 17,
257
258 KIND_MASK = ~VALUE_ORIGIN_MASK
259 };
260
261 enum Error {
262 // no error
263 SUCCESS = 0,
264 // flag name is missing
265 MISSING_NAME,
266 // flag value is missing
267 MISSING_VALUE,
268 // error parsing the textual form of the value
269 WRONG_FORMAT,
270 // flag is not writeable
271 NON_WRITABLE,
272 // flag value is outside of its bounds
273 OUT_OF_BOUNDS,
274 // flag value violates its constraint
275 VIOLATES_CONSTRAINT,
276 // there is no flag with the given name
277 INVALID_FLAG,
278 // other, unspecified error related to setting the flag
279 ERR_OTHER
280 };
281
282 const char* _type;
283 const char* _name;
284 void* _addr;
285 NOT_PRODUCT(const char* _doc;)
286 Flags _flags;
287
288 // points to all Flags static array
289 static Flag* flags;
290
291 // number of flags
292 static size_t numFlags;
293
294 static Flag* find_flag(const char* name) { return find_flag(name, strlen(name), true, true); };
295 static Flag* find_flag(const char* name, size_t length, bool allow_locked = false, bool return_flag = false);
296 static Flag* fuzzy_match(const char* name, size_t length, bool allow_locked = false);
297
298 void check_writable();
299
300 bool is_bool() const;
301 bool get_bool() const;
302 void set_bool(bool value);
303
304 bool is_intx() const;
305 intx get_intx() const;
306 void set_intx(intx value);
307
308 bool is_uintx() const;
309 uintx get_uintx() const;
310 void set_uintx(uintx value);
311
312 bool is_uint64_t() const;
313 uint64_t get_uint64_t() const;
314 void set_uint64_t(uint64_t value);
342 bool is_read_write() const;
343 bool is_commercial() const;
344
345 bool is_constant_in_binary() const;
346
347 bool is_unlocker() const;
348 bool is_unlocked() const;
349 bool is_writeable() const;
350 bool is_external() const;
351
352 bool is_unlocker_ext() const;
353 bool is_unlocked_ext() const;
354 bool is_writeable_ext() const;
355 bool is_external_ext() const;
356
357 void unlock_diagnostic();
358
359 void get_locked_message(char*, int) const;
360 void get_locked_message_ext(char*, int) const;
361
362 void print_on(outputStream* st, bool printRanges = false, bool withComments = false );
363 void print_kind(outputStream* st);
364 void print_as_flag(outputStream* st);
365 };
366
367 // debug flags control various aspects of the VM and are global accessible
368
369 // use FlagSetting to temporarily change some debug flag
370 // e.g. FlagSetting fs(DebugThisAndThat, true);
371 // restored to previous value upon leaving scope
372 class FlagSetting {
373 bool val;
374 bool* flag;
375 public:
376 FlagSetting(bool& fl, bool newValue) { flag = &fl; val = fl; fl = newValue; }
377 ~FlagSetting() { *flag = val; }
378 };
379
380
381 class CounterSetting {
382 intx* counter;
395 };
396
397 class DoubleFlagSetting {
398 double val;
399 double* flag;
400 public:
401 DoubleFlagSetting(double& fl, double newValue) { flag = &fl; val = fl; fl = newValue; }
402 ~DoubleFlagSetting() { *flag = val; }
403 };
404
405 class SizeTFlagSetting {
406 size_t val;
407 size_t* flag;
408 public:
409 SizeTFlagSetting(size_t& fl, size_t newValue) { flag = &fl; val = fl; fl = newValue; }
410 ~SizeTFlagSetting() { *flag = val; }
411 };
412
413
414 class CommandLineFlags {
415 static bool _finished_initializing;
416 public:
417 static Flag::Error boolAt(const char* name, size_t len, bool* value, bool allow_locked = false, bool return_flag = false);
418 static Flag::Error boolAt(const char* name, bool* value, bool allow_locked = false, bool return_flag = false) { return boolAt(name, strlen(name), value, allow_locked, return_flag); }
419 static Flag::Error boolAtPut(const char* name, size_t len, bool* value, Flag::Flags origin);
420 static Flag::Error boolAtPut(const char* name, bool* value, Flag::Flags origin) { return boolAtPut(name, strlen(name), value, origin); }
421
422 static Flag::Error intxAt(const char* name, size_t len, intx* value, bool allow_locked = false, bool return_flag = false);
423 static Flag::Error intxAt(const char* name, intx* value, bool allow_locked = false, bool return_flag = false) { return intxAt(name, strlen(name), value, allow_locked, return_flag); }
424 static Flag::Error intxAtPut(const char* name, size_t len, intx* value, Flag::Flags origin);
425 static Flag::Error intxAtPut(const char* name, intx* value, Flag::Flags origin) { return intxAtPut(name, strlen(name), value, origin); }
426
427 static Flag::Error uintxAt(const char* name, size_t len, uintx* value, bool allow_locked = false, bool return_flag = false);
428 static Flag::Error uintxAt(const char* name, uintx* value, bool allow_locked = false, bool return_flag = false) { return uintxAt(name, strlen(name), value, allow_locked, return_flag); }
429 static Flag::Error uintxAtPut(const char* name, size_t len, uintx* value, Flag::Flags origin);
430 static Flag::Error uintxAtPut(const char* name, uintx* value, Flag::Flags origin) { return uintxAtPut(name, strlen(name), value, origin); }
431
432 static Flag::Error size_tAt(const char* name, size_t len, size_t* value, bool allow_locked = false, bool return_flag = false);
433 static Flag::Error size_tAt(const char* name, size_t* value, bool allow_locked = false, bool return_flag = false) { return size_tAt(name, strlen(name), value, allow_locked, return_flag); }
434 static Flag::Error size_tAtPut(const char* name, size_t len, size_t* value, Flag::Flags origin);
435 static Flag::Error size_tAtPut(const char* name, size_t* value, Flag::Flags origin) { return size_tAtPut(name, strlen(name), value, origin); }
436
437 static Flag::Error uint64_tAt(const char* name, size_t len, uint64_t* value, bool allow_locked = false, bool return_flag = false);
438 static Flag::Error uint64_tAt(const char* name, uint64_t* value, bool allow_locked = false, bool return_flag = false) { return uint64_tAt(name, strlen(name), value, allow_locked, return_flag); }
439 static Flag::Error uint64_tAtPut(const char* name, size_t len, uint64_t* value, Flag::Flags origin);
440 static Flag::Error uint64_tAtPut(const char* name, uint64_t* value, Flag::Flags origin) { return uint64_tAtPut(name, strlen(name), value, origin); }
441
442 static Flag::Error doubleAt(const char* name, size_t len, double* value, bool allow_locked = false, bool return_flag = false);
443 static Flag::Error doubleAt(const char* name, double* value, bool allow_locked = false, bool return_flag = false) { return doubleAt(name, strlen(name), value, allow_locked, return_flag); }
444 static Flag::Error doubleAtPut(const char* name, size_t len, double* value, Flag::Flags origin);
445 static Flag::Error doubleAtPut(const char* name, double* value, Flag::Flags origin) { return doubleAtPut(name, strlen(name), value, origin); }
446
447 static Flag::Error ccstrAt(const char* name, size_t len, ccstr* value, bool allow_locked = false, bool return_flag = false);
448 static Flag::Error ccstrAt(const char* name, ccstr* value, bool allow_locked = false, bool return_flag = false) { return ccstrAt(name, strlen(name), value, allow_locked, return_flag); }
449 // Contract: Flag will make private copy of the incoming value.
450 // Outgoing value is always malloc-ed, and caller MUST call free.
451 static Flag::Error ccstrAtPut(const char* name, size_t len, ccstr* value, Flag::Flags origin);
452 static Flag::Error ccstrAtPut(const char* name, ccstr* value, Flag::Flags origin) { return ccstrAtPut(name, strlen(name), value, origin); }
453
454 // Returns false if name is not a command line flag.
455 static bool wasSetOnCmdline(const char* name, bool* value);
456 static void printSetFlags(outputStream* out);
457
458 static void printFlags(outputStream* out, bool withComments, bool printRanges = false);
459
460 // Returns true if all flags have their final values set (ready for ranges and constraint check)
461 static bool finishedInitializing() { return _finished_initializing; }
462
463 // Check the final values of all flags for ranges and constraints
464 static bool check_all_ranges_and_constraints();
465
466 static void verify() PRODUCT_RETURN;
467 };
468
469 // use this for flags that are true by default in the debug version but
470 // false in the optimized version, and vice versa
471 #ifdef ASSERT
472 #define trueInDebug true
473 #define falseInDebug false
474 #else
475 #define trueInDebug false
476 #define falseInDebug true
477 #endif
478
479 // use this for flags that are true per default in the product build
480 // but false in development builds, and vice versa
481 #ifdef PRODUCT
482 #define trueInProduct true
483 #define falseInProduct false
484 #else
538 // - the flag is defined in a CCC as an external exported interface.
539 // - the VM implementation supports dynamic setting of the flag.
540 // This implies that the VM must *always* query the flag variable
541 // and not reuse state related to the flag state at any given time.
542 // - you want the flag to be queried programmatically by the customers.
543 //
544 // product_rw flags are writeable internal product flags.
545 // They are like "manageable" flags but for internal/private use.
546 // The list of product_rw flags are internal/private flags which
547 // may be changed/removed in a future release. It can be set
548 // through the management interface to get/set value
549 // when the name of flag is supplied.
550 //
551 // A flag can be made as "product_rw" only if
552 // - the VM implementation supports dynamic setting of the flag.
553 // This implies that the VM must *always* query the flag variable
554 // and not reuse state related to the flag state at any given time.
555 //
556 // Note that when there is a need to support develop flags to be writeable,
557 // it can be done in the same way as product_rw.
558 //
559 // range is a macro that will expand to min and max arguments for range
560 // checking code if provided - see commandLineFlagRangeList.hpp
561 //
562 // constraint is a macro that will expand to custom function call
563 // for constraint checking if provided - see commandLineFlagConstraintList.hpp
564 //
565
566 #define RUNTIME_FLAGS(develop, develop_pd, product, product_pd, diagnostic, experimental, notproduct, manageable, product_rw, lp64_product, range, constraint) \
567 \
568 lp64_product(bool, UseCompressedOops, false, \
569 "Use 32-bit object references in 64-bit VM. " \
570 "lp64_product means flag is always constant in 32 bit VM") \
571 \
572 lp64_product(bool, UseCompressedClassPointers, false, \
573 "Use 32-bit class pointers in 64-bit VM. " \
574 "lp64_product means flag is always constant in 32 bit VM") \
575 \
576 notproduct(bool, CheckCompressedOops, true, \
577 "Generate checks in encoding/decoding code in debug VM") \
578 \
579 product_pd(size_t, HeapBaseMinAddress, \
580 "OS specific low limit for heap base address") \
581 \
582 product(uintx, HeapSearchSteps, 3 PPC64_ONLY(+17), \
583 "Heap allocation steps through preferred address regions to find" \
584 " where it can allocate the heap. Number of steps to take per " \
585 "region.") \
586 range(1, max_uintx) \
587 \
588 diagnostic(bool, PrintCompressedOopsMode, false, \
589 "Print compressed oops base address and encoding mode") \
590 \
591 lp64_product(intx, ObjectAlignmentInBytes, 8, \
592 "Default object alignment in bytes, 8 is minimum") \
593 range(8, 256) \
594 constraint(ObjectAlignmentInBytesConstraintFunc) \
595 \
596 product(bool, AssumeMP, false, \
597 "Instruct the VM to assume multiple processors are available") \
598 \
599 /* UseMembar is theoretically a temp flag used for memory barrier */ \
600 /* removal testing. It was supposed to be removed before FCS but has */ \
601 /* been re-added (see 6401008) */ \
602 product_pd(bool, UseMembar, \
603 "(Unstable) Issues membars on thread state transitions") \
604 \
605 develop(bool, CleanChunkPoolAsync, falseInEmbedded, \
606 "Clean the chunk pool asynchronously") \
607 \
608 experimental(bool, AlwaysSafeConstructors, false, \
609 "Force safe construction, as if all fields are final.") \
610 \
611 /* Temporary: See 6948537 */ \
612 experimental(bool, UseMemSetInBOT, true, \
613 "(Unstable) uses memset in BOT updates in GC code") \
614 \
615 diagnostic(bool, UnlockDiagnosticVMOptions, trueInDebug, \
616 "Enable normal processing of flags relating to field diagnostics")\
617 \
618 experimental(bool, UnlockExperimentalVMOptions, false, \
619 "Enable normal processing of flags relating to experimental " \
620 "features") \
621 \
638 \
639 develop(bool, TracePageSizes, false, \
640 "Trace page size selection and usage") \
641 \
642 product(bool, UseNUMA, false, \
643 "Use NUMA if available") \
644 \
645 product(bool, UseNUMAInterleaving, false, \
646 "Interleave memory across NUMA nodes if available") \
647 \
648 product(size_t, NUMAInterleaveGranularity, 2*M, \
649 "Granularity to use for NUMA interleaving on Windows OS") \
650 \
651 product(bool, ForceNUMA, false, \
652 "Force NUMA optimizations on single-node/UMA systems") \
653 \
654 product(uintx, NUMAChunkResizeWeight, 20, \
655 "Percentage (0-100) used to weight the current sample when " \
656 "computing exponentially decaying average for " \
657 "AdaptiveNUMAChunkSizing") \
658 range(0, 100) \
659 \
660 product(size_t, NUMASpaceResizeRate, 1*G, \
661 "Do not reallocate more than this amount per collection") \
662 \
663 product(bool, UseAdaptiveNUMAChunkSizing, true, \
664 "Enable adaptive chunk sizing for NUMA") \
665 \
666 product(bool, NUMAStats, false, \
667 "Print NUMA stats in detailed heap information") \
668 \
669 product(uintx, NUMAPageScanRate, 256, \
670 "Maximum number of pages to include in the page scan procedure") \
671 \
672 product_pd(bool, NeedsDeoptSuspend, \
673 "True for register window machines (sparc/ia64)") \
674 \
675 product(intx, UseSSE, 99, \
676 "Highest supported SSE instructions set on x86/x64") \
677 \
678 product(bool, UseAES, false, \
849 product(intx, SuspendRetryCount, 50, \
850 "Maximum retry count for an external suspend request") \
851 \
852 product(intx, SuspendRetryDelay, 5, \
853 "Milliseconds to delay per retry (* current_retry_count)") \
854 \
855 product(bool, AssertOnSuspendWaitFailure, false, \
856 "Assert/Guarantee on external suspend wait failure") \
857 \
858 product(bool, TraceSuspendWaitFailures, false, \
859 "Trace external suspend wait failures") \
860 \
861 product(bool, MaxFDLimit, true, \
862 "Bump the number of file descriptors to maximum in Solaris") \
863 \
864 diagnostic(bool, LogEvents, true, \
865 "Enable the various ring buffer event logs") \
866 \
867 diagnostic(uintx, LogEventsBufferEntries, 10, \
868 "Number of ring buffer event logs") \
869 range(1, NOT_LP64(1*K) LP64_ONLY(1*M)) \
870 \
871 product(bool, BytecodeVerificationRemote, true, \
872 "Enable the Java bytecode verifier for remote classes") \
873 \
874 product(bool, BytecodeVerificationLocal, false, \
875 "Enable the Java bytecode verifier for local classes") \
876 \
877 develop(bool, ForceFloatExceptions, trueInDebug, \
878 "Force exceptions on FP stack under/overflow") \
879 \
880 develop(bool, VerifyStackAtCalls, false, \
881 "Verify that the stack pointer is unchanged after calls") \
882 \
883 develop(bool, TraceJavaAssertions, false, \
884 "Trace java language assertions") \
885 \
886 notproduct(bool, CheckAssertionStatusDirectives, false, \
887 "Temporary - see javaClasses.cpp") \
888 \
889 notproduct(bool, PrintMallocFree, false, \
1022 \
1023 product(ccstr, NativeMemoryTracking, "off", \
1024 "Native memory tracking options") \
1025 \
1026 diagnostic(bool, PrintNMTStatistics, false, \
1027 "Print native memory tracking summary data if it is on") \
1028 \
1029 diagnostic(bool, LogCompilation, false, \
1030 "Log compilation activity in detail to LogFile") \
1031 \
1032 product(bool, PrintCompilation, false, \
1033 "Print compilations") \
1034 \
1035 diagnostic(bool, TraceNMethodInstalls, false, \
1036 "Trace nmethod installation") \
1037 \
1038 diagnostic(intx, ScavengeRootsInCode, 2, \
1039 "0: do not allow scavengable oops in the code cache; " \
1040 "1: allow scavenging from the code cache; " \
1041 "2: emit as many constants as the compiler can see") \
1042 range(0, 2) \
1043 \
1044 product(bool, AlwaysRestoreFPU, false, \
1045 "Restore the FPU control word after every JNI call (expensive)") \
1046 \
1047 diagnostic(bool, PrintCompilation2, false, \
1048 "Print additional statistics per compilation") \
1049 \
1050 diagnostic(bool, PrintAdapterHandlers, false, \
1051 "Print code generated for i2c/c2i adapters") \
1052 \
1053 diagnostic(bool, VerifyAdapterCalls, trueInDebug, \
1054 "Verify that i2c/c2i adapters are called properly") \
1055 \
1056 develop(bool, VerifyAdapterSharing, false, \
1057 "Verify that the code for shared adapters is the equivalent") \
1058 \
1059 diagnostic(bool, PrintAssembly, false, \
1060 "Print assembly code (using external disassembler.so)") \
1061 \
1062 diagnostic(ccstr, PrintAssemblyOptions, NULL, \
1296 \
1297 product(bool, EagerXrunInit, false, \
1298 "Eagerly initialize -Xrun libraries; allows startup profiling, " \
1299 "but not all -Xrun libraries may support the state of the VM " \
1300 "at this time") \
1301 \
1302 product(bool, PreserveAllAnnotations, false, \
1303 "Preserve RuntimeInvisibleAnnotations as well " \
1304 "as RuntimeVisibleAnnotations") \
1305 \
1306 develop(uintx, PreallocatedOutOfMemoryErrorCount, 4, \
1307 "Number of OutOfMemoryErrors preallocated with backtrace") \
1308 \
1309 product(bool, LazyBootClassLoader, true, \
1310 "Enable/disable lazy opening of boot class path entries") \
1311 \
1312 product(bool, UseXMMForArrayCopy, false, \
1313 "Use SSE2 MOVQ instruction for Arraycopy") \
1314 \
1315 product(intx, FieldsAllocationStyle, 1, \
1316 "0 - type based with oops first, " \
1317 "1 - with oops last, " \
1318 "2 - oops in super and sub classes are together") \
1319 range(0, 2) \
1320 \
1321 product(bool, CompactFields, true, \
1322 "Allocate nonstatic fields in gaps between previous fields") \
1323 \
1324 notproduct(bool, PrintFieldLayout, false, \
1325 "Print field layout for each class") \
1326 \
1327 /* Need to limit the extent of the padding to reasonable size. */\
1328 /* 8K is well beyond the reasonable HW cache line size, even with */\
1329 /* aggressive prefetching, while still leaving the room for segregating */\
1330 /* among the distinct pages. */\
1331 product(intx, ContendedPaddingWidth, 128, \
1332 "How many bytes to pad the fields/classes marked @Contended with")\
1333 range(0, 8192) \
1334 constraint(ContendedPaddingWidthConstraintFunc) \
1335 \
1336 product(bool, EnableContended, true, \
1337 "Enable @Contended annotation support") \
1338 \
1339 product(bool, RestrictContended, true, \
1340 "Restrict @Contended to trusted classes") \
1341 \
1342 product(bool, UseBiasedLocking, true, \
1343 "Enable biased locking in JVM") \
1344 \
1345 product(intx, BiasedLockingStartupDelay, 4000, \
1346 "Number of milliseconds to wait before enabling biased locking") \
1347 \
1348 diagnostic(bool, PrintBiasedLockingStatistics, false, \
1349 "Print statistics of biased locking in JVM") \
1350 \
1351 product(intx, BiasedLockingBulkRebiasThreshold, 20, \
1352 "Threshold of number of revocations per type to try to " \
1353 "rebias all objects in the heap of that type") \
1354 \
1476 product(bool, UseParallelGC, false, \
1477 "Use the Parallel Scavenge garbage collector") \
1478 \
1479 product(bool, UseParallelOldGC, false, \
1480 "Use the Parallel Old garbage collector") \
1481 \
1482 product(uintx, HeapMaximumCompactionInterval, 20, \
1483 "How often should we maximally compact the heap (not allowing " \
1484 "any dead space)") \
1485 \
1486 product(uintx, HeapFirstMaximumCompactionCount, 3, \
1487 "The collection count for the first maximum compaction") \
1488 \
1489 product(bool, UseMaximumCompactionOnSystemGC, true, \
1490 "Use maximum compaction in the Parallel Old garbage collector " \
1491 "for a system GC") \
1492 \
1493 product(uintx, ParallelOldDeadWoodLimiterMean, 50, \
1494 "The mean used by the parallel compact dead wood " \
1495 "limiter (a number between 0-100)") \
1496 range(0, 100) \
1497 \
1498 product(uintx, ParallelOldDeadWoodLimiterStdDev, 80, \
1499 "The standard deviation used by the parallel compact dead wood " \
1500 "limiter (a number between 0-100)") \
1501 range(0, 100) \
1502 \
1503 product(uintx, ParallelGCThreads, 0, \
1504 "Number of parallel threads parallel gc will use") \
1505 \
1506 product(bool, UseDynamicNumberOfGCThreads, false, \
1507 "Dynamically choose the number of parallel threads " \
1508 "parallel gc will use") \
1509 \
1510 diagnostic(bool, ForceDynamicNumberOfGCThreads, false, \
1511 "Force dynamic selection of the number of " \
1512 "parallel threads parallel gc will use to aid debugging") \
1513 \
1514 product(size_t, HeapSizePerGCThread, ScaleForWordSize(64*M), \
1515 "Size of heap (bytes) per GC thread used in calculating the " \
1516 "number of GC threads") \
1517 range((uintx)os::vm_page_size(), max_uintx) \
1518 \
1519 product(bool, TraceDynamicGCThreads, false, \
1520 "Trace the dynamic GC thread usage") \
1521 \
1522 develop(bool, ParallelOldGCSplitALot, false, \
1523 "Provoke splitting (copying data from a young gen space to " \
1524 "multiple destination spaces)") \
1525 \
1526 develop(uintx, ParallelOldGCSplitInterval, 3, \
1527 "How often to provoke splitting a young gen space") \
1528 range(0, max_uintx) \
1529 \
1530 product(uintx, ConcGCThreads, 0, \
1531 "Number of threads concurrent gc will use") \
1532 \
1533 product(size_t, YoungPLABSize, 4096, \
1534 "Size of young gen promotion LAB's (in HeapWords)") \
1535 \
1536 product(size_t, OldPLABSize, 1024, \
1537 "Size of old gen promotion LAB's (in HeapWords), or Number \
1538 of blocks to attempt to claim when refilling CMS LAB's") \
1539 \
1540 product(uintx, GCTaskTimeStampEntries, 200, \
1541 "Number of time stamp entries per gc worker thread") \
1542 range(1, max_uintx) \
1543 \
1544 product(bool, AlwaysTenure, false, \
1545 "Always tenure objects in eden (ParallelGC only)") \
1546 \
1547 product(bool, NeverTenure, false, \
1548 "Never tenure objects in eden, may tenure on overflow " \
1549 "(ParallelGC only)") \
1550 \
1551 product(bool, ScavengeBeforeFullGC, true, \
1552 "Scavenge youngest generation before each full GC.") \
1553 \
1554 develop(bool, ScavengeWithObjectsInToSpace, false, \
1555 "Allow scavenges to occur when to-space contains objects") \
1556 \
1557 product(bool, UseConcMarkSweepGC, false, \
1558 "Use Concurrent Mark-Sweep GC in the old generation") \
1559 \
1560 product(bool, ExplicitGCInvokesConcurrent, false, \
1561 "A System.gc() request invokes a concurrent collection; " \
1562 "(effective only when using concurrent collectors)") \
1563 \
1564 product(bool, ExplicitGCInvokesConcurrentAndUnloadsClasses, false, \
1565 "A System.gc() request invokes a concurrent collection and " \
1566 "also unloads classes during such a concurrent gc cycle " \
1567 "(effective only when UseConcMarkSweepGC)") \
1568 \
1569 product(bool, GCLockerInvokesConcurrent, false, \
1570 "The exit of a JNI critical section necessitating a scavenge, " \
1571 "also kicks off a background concurrent collection") \
1572 \
1573 product(uintx, GCLockerEdenExpansionPercent, 5, \
1574 "How much the GC can expand the eden by while the GC locker " \
1575 "is active (as a percentage)") \
1576 range(0, 100) \
1577 \
1578 diagnostic(uintx, GCLockerRetryAllocationCount, 2, \
1579 "Number of times to retry allocations when " \
1580 "blocked by the GC locker") \
1581 \
1582 develop(bool, UseCMSAdaptiveFreeLists, true, \
1583 "Use adaptive free lists in the CMS generation") \
1584 \
1585 develop(bool, UseAsyncConcMarkSweepGC, true, \
1586 "Use Asynchronous Concurrent Mark-Sweep GC in the old generation")\
1587 \
1588 product(bool, UseCMSBestFit, true, \
1589 "Use CMS best fit allocation strategy") \
1590 \
1591 product(bool, UseParNewGC, false, \
1592 "Use parallel threads in the new generation") \
1593 \
1594 product(bool, PrintTaskqueue, false, \
1595 "Print taskqueue statistics for parallel collectors") \
1596 \
1597 product(bool, PrintTerminationStats, false, \
1598 "Print termination statistics for parallel collectors") \
1599 \
1600 product(uintx, ParallelGCBufferWastePct, 10, \
1601 "Wasted fraction of parallel allocation buffer") \
1602 range(0, 100) \
1603 \
1604 product(uintx, TargetPLABWastePct, 10, \
1605 "Target wasted space in last buffer as percent of overall " \
1606 "allocation") \
1607 range(1, 100) \
1608 \
1609 product(uintx, PLABWeight, 75, \
1610 "Percentage (0-100) used to weight the current sample when " \
1611 "computing exponentially decaying average for ResizePLAB") \
1612 range(0, 100) \
1613 \
1614 product(bool, ResizePLAB, true, \
1615 "Dynamically resize (survivor space) promotion LAB's") \
1616 \
1617 product(bool, PrintPLAB, false, \
1618 "Print (survivor space) promotion LAB's sizing decisions") \
1619 \
1620 product(intx, ParGCArrayScanChunk, 50, \
1621 "Scan a subset of object array and push remainder, if array is " \
1622 "bigger than this") \
1623 range(1, max_intx) \
1624 \
1625 product(bool, ParGCUseLocalOverflow, false, \
1626 "Instead of a global overflow list, use local overflow stacks") \
1627 \
1628 product(bool, ParGCTrimOverflow, true, \
1629 "Eagerly trim the local overflow lists " \
1630 "(when ParGCUseLocalOverflow)") \
1631 \
1632 notproduct(bool, ParGCWorkQueueOverflowALot, false, \
1633 "Simulate work queue overflow in ParNew") \
1634 \
1635 notproduct(uintx, ParGCWorkQueueOverflowInterval, 1000, \
1636 "An `interval' counter that determines how frequently " \
1637 "we simulate overflow; a smaller number increases frequency") \
1638 \
1639 product(uintx, ParGCDesiredObjsFromOverflowList, 20, \
1640 "The desired number of objects to claim from the overflow list") \
1641 \
1642 diagnostic(uintx, ParGCStridesPerThread, 2, \
1643 "The number of strides per worker thread that we divide up the " \
1644 "card table scanning work into") \
1645 range(1, max_uintx) \
1646 \
1647 diagnostic(intx, ParGCCardsPerStrideChunk, 256, \
1648 "The number of cards in each chunk of the parallel chunks used " \
1649 "during card table scanning") \
1650 range(1, max_intx) \
1651 \
1652 product(uintx, OldPLABWeight, 50, \
1653 "Percentage (0-100) used to weight the current sample when " \
1654 "computing exponentially decaying average for resizing " \
1655 "OldPLABSize") \
1656 range(0, 100) \
1657 \
1658 product(bool, ResizeOldPLAB, true, \
1659 "Dynamically resize (old gen) promotion LAB's") \
1660 \
1661 product(bool, PrintOldPLAB, false, \
1662 "Print (old gen) promotion LAB's sizing decisions") \
1663 \
1664 product(size_t, CMSOldPLABMax, 1024, \
1665 "Maximum size of CMS gen promotion LAB caches per worker " \
1666 "per block size") \
1667 range(1, max_uintx) \
1668 constraint(CMSOldPLABMaxConstraintFunc) \
1669 \
1670 product(size_t, CMSOldPLABMin, 16, \
1671 "Minimum size of CMS gen promotion LAB caches per worker " \
1672 "per block size") \
1673 range(1, max_uintx) \
1674 constraint(CMSOldPLABMinConstraintFunc) \
1675 \
1676 product(uintx, CMSOldPLABNumRefills, 4, \
1677 "Nominal number of refills of CMS gen promotion LAB cache " \
1678 "per worker per block size") \
1679 range(1, max_uintx) \
1680 \
1681 product(bool, CMSOldPLABResizeQuicker, false, \
1682 "React on-the-fly during a scavenge to a sudden " \
1683 "change in block demand rate") \
1684 \
1685 product(uintx, CMSOldPLABToleranceFactor, 4, \
1686 "The tolerance of the phase-change detector for on-the-fly " \
1687 "PLAB resizing during a scavenge") \
1688 range(1, max_uintx) \
1689 \
1690 product(uintx, CMSOldPLABReactivityFactor, 2, \
1691 "The gain in the feedback loop for on-the-fly PLAB resizing " \
1692 "during a scavenge") \
1693 \
1694 product(bool, AlwaysPreTouch, false, \
1695 "Force all freshly committed pages to be pre-touched") \
1696 \
1697 product_pd(size_t, CMSYoungGenPerWorker, \
1698 "The maximum size of young gen chosen by default per GC worker " \
1699 "thread available") \
1700 range(1, max_uintx) \
1701 \
1702 product(uintx, CMSIncrementalSafetyFactor, 10, \
1703 "Percentage (0-100) used to add conservatism when computing the " \
1704 "duty cycle") \
1705 range(0, 100) \
1706 \
1707 product(uintx, CMSExpAvgFactor, 50, \
1708 "Percentage (0-100) used to weight the current sample when " \
1709 "computing exponential averages for CMS statistics") \
1710 range(0, 100) \
1711 \
1712 product(uintx, CMS_FLSWeight, 75, \
1713 "Percentage (0-100) used to weight the current sample when " \
1714 "computing exponentially decaying averages for CMS FLS " \
1715 "statistics") \
1716 range(0, 100) \
1717 \
1718 product(uintx, CMS_FLSPadding, 1, \
1719 "The multiple of deviation from mean to use for buffering " \
1720 "against volatility in free list demand") \
1721 \
1722 product(uintx, FLSCoalescePolicy, 2, \
1723 "CMS: aggressiveness level for coalescing, increasing " \
1724 "from 0 to 4") \
1725 range(0, 4) \
1726 \
1727 product(bool, FLSAlwaysCoalesceLarge, false, \
1728 "CMS: larger free blocks are always available for coalescing") \
1729 \
1730 product(double, FLSLargestBlockCoalesceProximity, 0.99, \
1731 "CMS: the smaller the percentage the greater the coalescing " \
1732 "force") \
1733 \
1734 product(double, CMSSmallCoalSurplusPercent, 1.05, \
1735 "CMS: the factor by which to inflate estimated demand of small " \
1736 "block sizes to prevent coalescing with an adjoining block") \
1737 \
1738 product(double, CMSLargeCoalSurplusPercent, 0.95, \
1739 "CMS: the factor by which to inflate estimated demand of large " \
1740 "block sizes to prevent coalescing with an adjoining block") \
1741 \
1742 product(double, CMSSmallSplitSurplusPercent, 1.10, \
1743 "CMS: the factor by which to inflate estimated demand of small " \
1744 "block sizes to prevent splitting to supply demand for smaller " \
1745 "blocks") \
1746 \
1747 product(double, CMSLargeSplitSurplusPercent, 1.00, \
1748 "CMS: the factor by which to inflate estimated demand of large " \
1749 "block sizes to prevent splitting to supply demand for smaller " \
1750 "blocks") \
1751 \
1752 product(bool, CMSExtrapolateSweep, false, \
1753 "CMS: cushion for block demand during sweep") \
1754 \
1755 product(uintx, CMS_SweepWeight, 75, \
1756 "Percentage (0-100) used to weight the current sample when " \
1757 "computing exponentially decaying average for inter-sweep " \
1758 "duration") \
1759 range(0, 100) \
1760 \
1761 product(uintx, CMS_SweepPadding, 1, \
1762 "The multiple of deviation from mean to use for buffering " \
1763 "against volatility in inter-sweep duration") \
1764 \
1765 product(uintx, CMS_SweepTimerThresholdMillis, 10, \
1766 "Skip block flux-rate sampling for an epoch unless inter-sweep " \
1767 "duration exceeds this threshold in milliseconds") \
1768 \
1769 product(bool, CMSClassUnloadingEnabled, true, \
1770 "Whether class unloading enabled when using CMS GC") \
1771 \
1772 product(uintx, CMSClassUnloadingMaxInterval, 0, \
1773 "When CMS class unloading is enabled, the maximum CMS cycle " \
1774 "count for which classes may not be unloaded") \
1775 \
1776 develop(intx, CMSDictionaryChoice, 0, \
1777 "Use BinaryTreeDictionary as default in the CMS generation") \
1778 \
1779 product(uintx, CMSIndexedFreeListReplenish, 4, \
1780 "Replenish an indexed free list with this number of chunks") \
1781 \
1782 product(bool, CMSReplenishIntermediate, true, \
1783 "Replenish all intermediate free-list caches") \
1784 \
1785 product(bool, CMSSplitIndexedFreeListBlocks, true, \
1786 "When satisfying batched demand, split blocks from the " \
1787 "IndexedFreeList whose size is a multiple of requested size") \
1788 \
1789 product(bool, CMSLoopWarn, false, \
1790 "Warn in case of excessive CMS looping") \
1791 \
1792 develop(bool, CMSOverflowEarlyRestoration, false, \
1793 "Restore preserved marks early") \
1794 \
1795 product(size_t, MarkStackSize, NOT_LP64(32*K) LP64_ONLY(4*M), \
1796 "Size of marking stack") \
1797 \
1798 product(size_t, MarkStackSizeMax, NOT_LP64(4*M) LP64_ONLY(512*M), \
1799 "Maximum size of marking stack") \
1800 range(1, (max_jint - 1)) \
1801 \
1802 notproduct(bool, CMSMarkStackOverflowALot, false, \
1803 "Simulate frequent marking stack / work queue overflow") \
1804 \
1805 notproduct(uintx, CMSMarkStackOverflowInterval, 1000, \
1806 "An \"interval\" counter that determines how frequently " \
1807 "to simulate overflow; a smaller number increases frequency") \
1808 \
1809 product(uintx, CMSMaxAbortablePrecleanLoops, 0, \
1810 "Maximum number of abortable preclean iterations, if > 0") \
1811 \
1812 product(intx, CMSMaxAbortablePrecleanTime, 5000, \
1813 "Maximum time in abortable preclean (in milliseconds)") \
1814 \
1815 product(uintx, CMSAbortablePrecleanMinWorkPerIteration, 100, \
1816 "Nominal minimum work per abortable preclean iteration") \
1817 \
1818 manageable(intx, CMSAbortablePrecleanWaitMillis, 100, \
1819 "Time that we sleep between iterations when not given " \
1820 "enough work per iteration") \
1821 \
1822 product(size_t, CMSRescanMultiple, 32, \
1823 "Size (in cards) of CMS parallel rescan task") \
1824 range(1, max_uintx) \
1825 \
1826 product(size_t, CMSConcMarkMultiple, 32, \
1827 "Size (in cards) of CMS concurrent MT marking task") \
1828 range(1, max_uintx) \
1829 \
1830 product(bool, CMSAbortSemantics, false, \
1831 "Whether abort-on-overflow semantics is implemented") \
1832 \
1833 product(bool, CMSParallelInitialMarkEnabled, true, \
1834 "Use the parallel initial mark.") \
1835 \
1836 product(bool, CMSParallelRemarkEnabled, true, \
1837 "Whether parallel remark enabled (only if ParNewGC)") \
1838 \
1839 product(bool, CMSParallelSurvivorRemarkEnabled, true, \
1840 "Whether parallel remark of survivor space " \
1841 "enabled (effective only if CMSParallelRemarkEnabled)") \
1842 \
1843 product(bool, CMSPLABRecordAlways, true, \
1844 "Always record survivor space PLAB boundaries (effective only " \
1845 "if CMSParallelSurvivorRemarkEnabled)") \
1846 \
1847 product(bool, CMSEdenChunksRecordAlways, true, \
1848 "Always record eden chunks used for the parallel initial mark " \
1849 "or remark of eden") \
1850 \
1851 product(bool, CMSPrintEdenSurvivorChunks, false, \
1852 "Print the eden and the survivor chunks used for the parallel " \
1853 "initial mark or remark of the eden/survivor spaces") \
1854 \
1855 product(bool, CMSConcurrentMTEnabled, true, \
1856 "Whether multi-threaded concurrent work enabled " \
1857 "(effective only if ParNewGC)") \
1858 \
1859 product(bool, CMSPrecleaningEnabled, true, \
1860 "Whether concurrent precleaning enabled") \
1861 \
1862 product(uintx, CMSPrecleanIter, 3, \
1863 "Maximum number of precleaning iteration passes") \
1864 range(0, 9) \
1865 \
1866 product(uintx, CMSPrecleanDenominator, 3, \
1867 "CMSPrecleanNumerator:CMSPrecleanDenominator yields convergence " \
1868 "ratio") \
1869 range(1, max_uintx) \
1870 constraint(CMSPrecleanDenominatorConstraintFunc) \
1871 \
1872 product(uintx, CMSPrecleanNumerator, 2, \
1873 "CMSPrecleanNumerator:CMSPrecleanDenominator yields convergence " \
1874 "ratio") \
1875 range(0, max_uintx-1) \
1876 constraint(CMSPrecleanNumeratorConstraintFunc) \
1877 \
1878 product(bool, CMSPrecleanRefLists1, true, \
1879 "Preclean ref lists during (initial) preclean phase") \
1880 \
1881 product(bool, CMSPrecleanRefLists2, false, \
1882 "Preclean ref lists during abortable preclean phase") \
1883 \
1884 product(bool, CMSPrecleanSurvivors1, false, \
1885 "Preclean survivors during (initial) preclean phase") \
1886 \
1887 product(bool, CMSPrecleanSurvivors2, true, \
1888 "Preclean survivors during abortable preclean phase") \
1889 \
1890 product(uintx, CMSPrecleanThreshold, 1000, \
1891 "Do not iterate again if number of dirty cards is less than this")\
1892 range(100, max_uintx) \
1893 \
1894 product(bool, CMSCleanOnEnter, true, \
1895 "Clean-on-enter optimization for reducing number of dirty cards") \
1896 \
1897 product(uintx, CMSRemarkVerifyVariant, 1, \
1898 "Choose variant (1,2) of verification following remark") \
1899 range(1, 2) \
1900 \
1901 product(size_t, CMSScheduleRemarkEdenSizeThreshold, 2*M, \
1902 "If Eden size is below this, do not try to schedule remark") \
1903 \
1904 product(uintx, CMSScheduleRemarkEdenPenetration, 50, \
1905 "The Eden occupancy percentage (0-100) at which " \
1906 "to try and schedule remark pause") \
1907 range(0, 100) \
1908 \
1909 product(uintx, CMSScheduleRemarkSamplingRatio, 5, \
1910 "Start sampling eden top at least before young gen " \
1911 "occupancy reaches 1/<ratio> of the size at which " \
1912 "we plan to schedule remark") \
1913 range(1, max_uintx) \
1914 \
1915 product(uintx, CMSSamplingGrain, 16*K, \
1916 "The minimum distance between eden samples for CMS (see above)") \
1917 range(1, max_uintx) \
1918 \
1919 product(bool, CMSScavengeBeforeRemark, false, \
1920 "Attempt scavenge before the CMS remark step") \
1921 \
1922 develop(bool, CMSTraceSweeper, false, \
1923 "Trace some actions of the CMS sweeper") \
1924 \
1925 product(uintx, CMSWorkQueueDrainThreshold, 10, \
1926 "Don't drain below this size per parallel worker/thief") \
1927 \
1928 manageable(intx, CMSWaitDuration, 2000, \
1929 "Time in milliseconds that CMS thread waits for young GC") \
1930 \
1931 develop(uintx, CMSCheckInterval, 1000, \
1932 "Interval in milliseconds that CMS thread checks if it " \
1933 "should start a collection cycle") \
1934 \
1935 product(bool, CMSYield, true, \
1936 "Yield between steps of CMS") \
1937 \
1938 product(size_t, CMSBitMapYieldQuantum, 10*M, \
1939 "Bitmap operations should process at most this many bits " \
1940 "between yields") \
1941 range(1, max_uintx) \
1942 \
1943 product(bool, CMSDumpAtPromotionFailure, false, \
1944 "Dump useful information about the state of the CMS old " \
1945 "generation upon a promotion failure") \
1946 \
1947 product(bool, CMSPrintChunksInDump, false, \
1948 "In a dump enabled by CMSDumpAtPromotionFailure, include " \
1949 "more detailed information about the free chunks") \
1950 \
1951 product(bool, CMSPrintObjectsInDump, false, \
1952 "In a dump enabled by CMSDumpAtPromotionFailure, include " \
1953 "more detailed information about the allocated objects") \
1954 \
1955 diagnostic(bool, FLSVerifyAllHeapReferences, false, \
1956 "Verify that all references across the FLS boundary " \
1957 "are to valid objects") \
1958 \
1959 diagnostic(bool, FLSVerifyLists, false, \
1960 "Do lots of (expensive) FreeListSpace verification") \
1961 \
1962 diagnostic(bool, FLSVerifyIndexTable, false, \
1963 "Do lots of (expensive) FLS index table verification") \
1964 \
1965 develop(bool, FLSVerifyDictionary, false, \
1966 "Do lots of (expensive) FLS dictionary verification") \
1967 \
1968 develop(bool, VerifyBlockOffsetArray, false, \
1969 "Do (expensive) block offset array verification") \
1970 \
1971 diagnostic(bool, BlockOffsetArrayUseUnallocatedBlock, false, \
1972 "Maintain _unallocated_block in BlockOffsetArray " \
1973 "(currently applicable only to CMS collector)") \
1974 \
1975 develop(bool, TraceCMSState, false, \
1976 "Trace the state of the CMS collection") \
1977 \
1978 product(intx, RefDiscoveryPolicy, 0, \
1979 "Select type of reference discovery policy: " \
1980 "reference-based(0) or referent-based(1)") \
1981 range(ReferenceProcessor::DiscoveryPolicyMin, \
1982 ReferenceProcessor::DiscoveryPolicyMax) \
1983 \
1984 product(bool, ParallelRefProcEnabled, false, \
1985 "Enable parallel reference processing whenever possible") \
1986 \
1987 product(bool, ParallelRefProcBalancingEnabled, true, \
1988 "Enable balancing of reference processing queues") \
1989 \
1990 product(uintx, CMSTriggerRatio, 80, \
1991 "Percentage of MinHeapFreeRatio in CMS generation that is " \
1992 "allocated before a CMS collection cycle commences") \
1993 range(0, 100) \
1994 \
1995 product(uintx, CMSBootstrapOccupancy, 50, \
1996 "Percentage CMS generation occupancy at which to " \
1997 "initiate CMS collection for bootstrapping collection stats") \
1998 range(0, 100) \
1999 \
2000 product(intx, CMSInitiatingOccupancyFraction, -1, \
2001 "Percentage CMS generation occupancy to start a CMS collection " \
2002 "cycle. A negative value means that CMSTriggerRatio is used") \
2003 range(min_intx, 100) \
2004 \
2005 product(uintx, InitiatingHeapOccupancyPercent, 45, \
2006 "Percentage of the (entire) heap occupancy to start a " \
2007 "concurrent GC cycle. It is used by GCs that trigger a " \
2008 "concurrent GC cycle based on the occupancy of the entire heap, " \
2009 "not just one of the generations (e.g., G1). A value of 0 " \
2010 "denotes 'do constant GC cycles'.") \
2011 range(0, 100) \
2012 \
2013 manageable(intx, CMSTriggerInterval, -1, \
2014 "Commence a CMS collection cycle (at least) every so many " \
2015 "milliseconds (0 permanently, -1 disabled)") \
2016 range(-1, 0) \
2017 \
2018 product(bool, UseCMSInitiatingOccupancyOnly, false, \
2019 "Only use occupancy as a criterion for starting a CMS collection")\
2020 \
2021 product(uintx, CMSIsTooFullPercentage, 98, \
2022 "An absolute ceiling above which CMS will always consider the " \
2023 "unloading of classes when class unloading is enabled") \
2024 range(0, 100) \
2025 \
2026 develop(bool, CMSTestInFreeList, false, \
2027 "Check if the coalesced range is already in the " \
2028 "free lists as claimed") \
2029 \
2030 notproduct(bool, CMSVerifyReturnedBytes, false, \
2031 "Check that all the garbage collected was returned to the " \
2032 "free lists") \
2033 \
2034 notproduct(bool, ScavengeALot, false, \
2035 "Force scavenge at every Nth exit from the runtime system " \
2036 "(N=ScavengeALotInterval)") \
2037 \
2038 develop(bool, FullGCALot, false, \
2039 "Force full gc at every Nth exit from the runtime system " \
2040 "(N=FullGCALotInterval)") \
2041 \
2042 notproduct(bool, GCALotAtAllSafepoints, false, \
2043 "Enforce ScavengeALot/GCALot at all potential safepoints") \
2044 \
2114 product(bool, TLABStats, true, \
2115 "Provide more detailed and expensive TLAB statistics " \
2116 "(with PrintTLAB)") \
2117 \
2118 product_pd(bool, NeverActAsServerClassMachine, \
2119 "Never act like a server-class machine") \
2120 \
2121 product(bool, AlwaysActAsServerClassMachine, false, \
2122 "Always act like a server-class machine") \
2123 \
2124 product_pd(uint64_t, MaxRAM, \
2125 "Real memory size (in bytes) used to set maximum heap size") \
2126 \
2127 product(size_t, ErgoHeapSizeLimit, 0, \
2128 "Maximum ergonomically set heap size (in bytes); zero means use " \
2129 "MaxRAM / MaxRAMFraction") \
2130 \
2131 product(uintx, MaxRAMFraction, 4, \
2132 "Maximum fraction (1/n) of real memory used for maximum heap " \
2133 "size") \
2134 range(1, max_uintx) \
2135 \
2136 product(uintx, DefaultMaxRAMFraction, 4, \
2137 "Maximum fraction (1/n) of real memory used for maximum heap " \
2138 "size; deprecated: to be renamed to MaxRAMFraction") \
2139 range(1, max_uintx) \
2140 \
2141 product(uintx, MinRAMFraction, 2, \
2142 "Minimum fraction (1/n) of real memory used for maximum heap " \
2143 "size on systems with small physical memory size") \
2144 range(1, max_uintx) \
2145 \
2146 product(uintx, InitialRAMFraction, 64, \
2147 "Fraction (1/n) of real memory used for initial heap size") \
2148 range(1, max_uintx) \
2149 \
2150 develop(uintx, MaxVirtMemFraction, 2, \
2151 "Maximum fraction (1/n) of virtual memory used for ergonomically "\
2152 "determining maximum heap size") \
2153 \
2154 product(bool, UseAutoGCSelectPolicy, false, \
2155 "Use automatic collection selection policy") \
2156 \
2157 product(uintx, AutoGCSelectPauseMillis, 5000, \
2158 "Automatic GC selection pause threshold in milliseconds") \
2159 \
2160 product(bool, UseAdaptiveSizePolicy, true, \
2161 "Use adaptive generation sizing policies") \
2162 \
2163 product(bool, UsePSAdaptiveSurvivorSizePolicy, true, \
2164 "Use adaptive survivor sizing policies") \
2165 \
2166 product(bool, UseAdaptiveGenerationSizePolicyAtMinorCollection, true, \
2167 "Use adaptive young-old sizing policies at minor collections") \
2168 \
2187 develop(bool, PSAdjustTenuredGenForMinorPause, false, \
2188 "Adjust tenured generation to achieve a minor pause goal") \
2189 \
2190 develop(bool, PSAdjustYoungGenForMajorPause, false, \
2191 "Adjust young generation to achieve a major pause goal") \
2192 \
2193 product(uintx, AdaptiveSizePolicyInitializingSteps, 20, \
2194 "Number of steps where heuristics is used before data is used") \
2195 \
2196 develop(uintx, AdaptiveSizePolicyReadyThreshold, 5, \
2197 "Number of collections before the adaptive sizing is started") \
2198 \
2199 product(uintx, AdaptiveSizePolicyOutputInterval, 0, \
2200 "Collection interval for printing information; zero means never") \
2201 \
2202 product(bool, UseAdaptiveSizePolicyFootprintGoal, true, \
2203 "Use adaptive minimum footprint as a goal") \
2204 \
2205 product(uintx, AdaptiveSizePolicyWeight, 10, \
2206 "Weight given to exponential resizing, between 0 and 100") \
2207 range(0, 100) \
2208 \
2209 product(uintx, AdaptiveTimeWeight, 25, \
2210 "Weight given to time in adaptive policy, between 0 and 100") \
2211 range(0, 100) \
2212 \
2213 product(uintx, PausePadding, 1, \
2214 "How much buffer to keep for pause time") \
2215 \
2216 product(uintx, PromotedPadding, 3, \
2217 "How much buffer to keep for promotion failure") \
2218 \
2219 product(uintx, SurvivorPadding, 3, \
2220 "How much buffer to keep for survivor overflow") \
2221 \
2222 product(uintx, ThresholdTolerance, 10, \
2223 "Allowed collection cost difference between generations") \
2224 range(0, 100) \
2225 \
2226 product(uintx, AdaptiveSizePolicyCollectionCostMargin, 50, \
2227 "If collection costs are within margin, reduce both by full " \
2228 "delta") \
2229 \
2230 product(uintx, YoungGenerationSizeIncrement, 20, \
2231 "Adaptive size percentage change in young generation") \
2232 range(0, 100) \
2233 \
2234 product(uintx, YoungGenerationSizeSupplement, 80, \
2235 "Supplement to YoungedGenerationSizeIncrement used at startup") \
2236 range(0, 100) \
2237 \
2238 product(uintx, YoungGenerationSizeSupplementDecay, 8, \
2239 "Decay factor to YoungedGenerationSizeSupplement") \
2240 range(1, max_uintx) \
2241 \
2242 product(uintx, TenuredGenerationSizeIncrement, 20, \
2243 "Adaptive size percentage change in tenured generation") \
2244 range(0, 100) \
2245 \
2246 product(uintx, TenuredGenerationSizeSupplement, 80, \
2247 "Supplement to TenuredGenerationSizeIncrement used at startup") \
2248 range(0, 100) \
2249 \
2250 product(uintx, TenuredGenerationSizeSupplementDecay, 2, \
2251 "Decay factor to TenuredGenerationSizeIncrement") \
2252 range(1, max_uintx) \
2253 \
2254 product(uintx, MaxGCPauseMillis, max_uintx, \
2255 "Adaptive size policy maximum GC pause time goal in millisecond, "\
2256 "or (G1 Only) the maximum GC time per MMU time slice") \
2257 \
2258 product(uintx, GCPauseIntervalMillis, 0, \
2259 "Time slice for MMU specification") \
2260 \
2261 product(uintx, MaxGCMinorPauseMillis, max_uintx, \
2262 "Adaptive size policy maximum GC minor pause time goal " \
2263 "in millisecond") \
2264 \
2265 product(uintx, GCTimeRatio, 99, \
2266 "Adaptive size policy application time to GC time ratio") \
2267 \
2268 product(uintx, AdaptiveSizeDecrementScaleFactor, 4, \
2269 "Adaptive size scale down factor for shrinking") \
2270 range(1, max_uintx) \
2271 \
2272 product(bool, UseAdaptiveSizeDecayMajorGCCost, true, \
2273 "Adaptive size decays the major cost for long major intervals") \
2274 \
2275 product(uintx, AdaptiveSizeMajorGCDecayTimeScale, 10, \
2276 "Time scale over which major costs decay") \
2277 \
2278 product(uintx, MinSurvivorRatio, 3, \
2279 "Minimum ratio of young generation/survivor space size") \
2280 \
2281 product(uintx, InitialSurvivorRatio, 8, \
2282 "Initial ratio of young generation/survivor space size") \
2283 \
2284 product(size_t, BaseFootPrintEstimate, 256*M, \
2285 "Estimate of footprint other than Java Heap") \
2286 \
2287 product(bool, UseGCOverheadLimit, true, \
2288 "Use policy to limit of proportion of time spent in GC " \
2289 "before an OutOfMemory error is thrown") \
2290 \
2291 product(uintx, GCTimeLimit, 98, \
2292 "Limit of the proportion of time spent in GC before " \
2293 "an OutOfMemoryError is thrown (used with GCHeapFreeLimit)") \
2294 range(0, 100) \
2295 \
2296 product(uintx, GCHeapFreeLimit, 2, \
2297 "Minimum percentage of free space after a full GC before an " \
2298 "OutOfMemoryError is thrown (used with GCTimeLimit)") \
2299 range(0, 100) \
2300 \
2301 develop(uintx, AdaptiveSizePolicyGCTimeLimitThreshold, 5, \
2302 "Number of consecutive collections before gc time limit fires") \
2303 \
2304 product(bool, PrintAdaptiveSizePolicy, false, \
2305 "Print information about AdaptiveSizePolicy") \
2306 \
2307 product(intx, PrefetchCopyIntervalInBytes, -1, \
2308 "How far ahead to prefetch destination area (<= 0 means off)") \
2309 \
2310 product(intx, PrefetchScanIntervalInBytes, -1, \
2311 "How far ahead to prefetch scan area (<= 0 means off)") \
2312 \
2313 product(intx, PrefetchFieldsAhead, -1, \
2314 "How many fields ahead to prefetch in oop scan (<= 0 means off)") \
2315 \
2316 diagnostic(bool, VerifySilently, false, \
2317 "Do not print the verification progress") \
2318 \
2319 diagnostic(bool, VerifyDuringStartup, false, \
2564 "compile native methods if supported by the compiler") \
2565 \
2566 develop_pd(bool, CICompileOSR, \
2567 "compile on stack replacement methods if supported by the " \
2568 "compiler") \
2569 \
2570 develop(bool, CIPrintMethodCodes, false, \
2571 "print method bytecodes of the compiled code") \
2572 \
2573 develop(bool, CIPrintTypeFlow, false, \
2574 "print the results of ciTypeFlow analysis") \
2575 \
2576 develop(bool, CITraceTypeFlow, false, \
2577 "detailed per-bytecode tracing of ciTypeFlow analysis") \
2578 \
2579 develop(intx, OSROnlyBCI, -1, \
2580 "OSR only at this bci. Negative values mean exclude that bci") \
2581 \
2582 /* compiler */ \
2583 \
2584 /* notice: the max range value here is max_jint, not max_intx */ \
2585 /* because of overflow issue */ \
2586 product(intx, CICompilerCount, CI_COMPILER_COUNT, \
2587 "Number of compiler threads to run") \
2588 range((intx)Arguments::get_min_number_of_compiler_threads(), \
2589 max_jint) \
2590 \
2591 product(intx, CompilationPolicyChoice, 0, \
2592 "which compilation policy (0-3)") \
2593 range(0, 3) \
2594 \
2595 develop(bool, UseStackBanging, true, \
2596 "use stack banging for stack overflow checks (required for " \
2597 "proper StackOverflow handling; disable only to measure cost " \
2598 "of stackbanging)") \
2599 \
2600 develop(bool, UseStrictFP, true, \
2601 "use strict fp if modifier strictfp is set") \
2602 \
2603 develop(bool, GenerateSynchronizationCode, true, \
2604 "generate locking/unlocking code for synchronized methods and " \
2605 "monitors") \
2606 \
2607 develop(bool, GenerateCompilerNullChecks, true, \
2608 "Generate explicit null checks for loads/stores/calls") \
2609 \
2610 develop(bool, GenerateRangeChecks, true, \
2611 "Generate range checks for array accesses") \
2612 \
2613 develop_pd(bool, ImplicitNullChecks, \
2690 \
2691 product(bool, PrintVMOptions, false, \
2692 "Print flags that appeared on the command line") \
2693 \
2694 product(bool, IgnoreUnrecognizedVMOptions, false, \
2695 "Ignore unrecognized VM options") \
2696 \
2697 product(bool, PrintCommandLineFlags, false, \
2698 "Print flags specified on command line or set by ergonomics") \
2699 \
2700 product(bool, PrintFlagsInitial, false, \
2701 "Print all VM flags before argument processing and exit VM") \
2702 \
2703 product(bool, PrintFlagsFinal, false, \
2704 "Print all VM flags after argument and ergonomic processing") \
2705 \
2706 notproduct(bool, PrintFlagsWithComments, false, \
2707 "Print all VM flags with default values and descriptions and " \
2708 "exit") \
2709 \
2710 product(bool, PrintFlagsRanges, false, \
2711 "Print VM flags and their ranges and exit VM") \
2712 \
2713 diagnostic(bool, SerializeVMOutput, true, \
2714 "Use a mutex to serialize output to tty and LogFile") \
2715 \
2716 diagnostic(bool, DisplayVMOutput, true, \
2717 "Display all VM output on the tty, independently of LogVMOutput") \
2718 \
2719 diagnostic(bool, LogVMOutput, false, \
2720 "Save VM output to LogFile") \
2721 \
2722 diagnostic(ccstr, LogFile, NULL, \
2723 "If LogVMOutput or LogCompilation is on, save VM output to " \
2724 "this file [default: ./hotspot_pid%p.log] (%p replaced with pid)")\
2725 \
2726 product(ccstr, ErrorFile, NULL, \
2727 "If an error occurs, save the error data to this file " \
2728 "[default: ./hs_err_pid%p.log] (%p replaced with pid)") \
2729 \
2730 product(bool, DisplayVMOutputToStderr, false, \
2731 "If DisplayVMOutput is true, display all VM output to stderr") \
2732 \
2931 develop(bool, TraceFrequencyInlining, false, \
2932 "Trace frequency based inlining") \
2933 \
2934 develop_pd(bool, InlineIntrinsics, \
2935 "Inline intrinsics that can be statically resolved") \
2936 \
2937 product_pd(bool, ProfileInterpreter, \
2938 "Profile at the bytecode level during interpretation") \
2939 \
2940 develop(bool, TraceProfileInterpreter, false, \
2941 "Trace profiling at the bytecode level during interpretation. " \
2942 "This outputs the profiling information collected to improve " \
2943 "jit compilation.") \
2944 \
2945 develop_pd(bool, ProfileTraps, \
2946 "Profile deoptimization traps at the bytecode level") \
2947 \
2948 product(intx, ProfileMaturityPercentage, 20, \
2949 "number of method invocations/branches (expressed as % of " \
2950 "CompileThreshold) before using the method's profile") \
2951 range(0, 100) \
2952 \
2953 diagnostic(bool, PrintMethodData, false, \
2954 "Print the results of +ProfileInterpreter at end of run") \
2955 \
2956 develop(bool, VerifyDataPointer, trueInDebug, \
2957 "Verify the method data pointer during interpreter profiling") \
2958 \
2959 develop(bool, VerifyCompiledCode, false, \
2960 "Include miscellaneous runtime verifications in nmethod code; " \
2961 "default off because it disturbs nmethod size heuristics") \
2962 \
2963 notproduct(bool, CrashGCForDumpingJavaThread, false, \
2964 "Manually make GC thread crash then dump java stack trace; " \
2965 "Test only") \
2966 \
2967 /* compilation */ \
2968 product(bool, UseCompiler, true, \
2969 "Use Just-In-Time compilation") \
2970 \
2971 develop(bool, TraceCompilationPolicy, false, \
2992 "Do not compile methods > HugeMethodLimit") \
2993 \
2994 /* Bytecode escape analysis estimation. */ \
2995 product(bool, EstimateArgEscape, true, \
2996 "Analyze bytecodes to estimate escape state of arguments") \
2997 \
2998 product(intx, BCEATraceLevel, 0, \
2999 "How much tracing to do of bytecode escape analysis estimates") \
3000 \
3001 product(intx, MaxBCEAEstimateLevel, 5, \
3002 "Maximum number of nested calls that are analyzed by BC EA") \
3003 \
3004 product(intx, MaxBCEAEstimateSize, 150, \
3005 "Maximum bytecode size of a method to be analyzed by BC EA") \
3006 \
3007 product(intx, AllocatePrefetchStyle, 1, \
3008 "0 = no prefetch, " \
3009 "1 = prefetch instructions for each allocation, " \
3010 "2 = use TLAB watermark to gate allocation prefetch, " \
3011 "3 = use BIS instruction on Sparc for allocation prefetch") \
3012 range(0, 3) \
3013 \
3014 product(intx, AllocatePrefetchDistance, -1, \
3015 "Distance to prefetch ahead of allocation pointer") \
3016 \
3017 product(intx, AllocatePrefetchLines, 3, \
3018 "Number of lines to prefetch ahead of array allocation pointer") \
3019 \
3020 product(intx, AllocateInstancePrefetchLines, 1, \
3021 "Number of lines to prefetch ahead of instance allocation " \
3022 "pointer") \
3023 \
3024 product(intx, AllocatePrefetchStepSize, 16, \
3025 "Step size in bytes of sequential prefetch instructions") \
3026 \
3027 product(intx, AllocatePrefetchInstr, 0, \
3028 "Prefetch instruction to prefetch ahead of allocation pointer") \
3029 \
3030 /* deoptimization */ \
3031 develop(bool, TraceDeoptimization, false, \
3032 "Trace deoptimization") \
3039 "(0 means off)") \
3040 \
3041 product(intx, MaxJavaStackTraceDepth, 1024, \
3042 "The maximum number of lines in the stack trace for Java " \
3043 "exceptions (0 means all)") \
3044 \
3045 NOT_EMBEDDED(diagnostic(intx, GuaranteedSafepointInterval, 1000, \
3046 "Guarantee a safepoint (at least) every so many milliseconds " \
3047 "(0 means none)")) \
3048 \
3049 EMBEDDED_ONLY(product(intx, GuaranteedSafepointInterval, 0, \
3050 "Guarantee a safepoint (at least) every so many milliseconds " \
3051 "(0 means none)")) \
3052 \
3053 product(intx, SafepointTimeoutDelay, 10000, \
3054 "Delay in milliseconds for option SafepointTimeout") \
3055 \
3056 product(intx, NmethodSweepActivity, 10, \
3057 "Removes cold nmethods from code cache if > 0. Higher values " \
3058 "result in more aggressive sweeping") \
3059 range(0, 2000) \
3060 \
3061 notproduct(bool, LogSweeper, false, \
3062 "Keep a ring buffer of sweeper activity") \
3063 \
3064 notproduct(intx, SweeperLogEntries, 1024, \
3065 "Number of records in the ring buffer of sweeper activity") \
3066 \
3067 notproduct(intx, MemProfilingInterval, 500, \
3068 "Time between each invocation of the MemProfiler") \
3069 \
3070 develop(intx, MallocCatchPtr, -1, \
3071 "Hit breakpoint when mallocing/freeing this pointer") \
3072 \
3073 notproduct(ccstrlist, SuppressErrorAt, "", \
3074 "List of assertions (file:line) to muzzle") \
3075 \
3076 notproduct(size_t, HandleAllocationLimit, 1024, \
3077 "Threshold for HandleMark allocation when +TraceHandleAllocation "\
3078 "is used") \
3079 \
3168 diagnostic(intx, MallocVerifyInterval, 0, \
3169 "If non-zero, verify C heap after every N calls to " \
3170 "malloc/realloc/free") \
3171 \
3172 diagnostic(intx, MallocVerifyStart, 0, \
3173 "If non-zero, start verifying C heap after Nth call to " \
3174 "malloc/realloc/free") \
3175 \
3176 diagnostic(uintx, MallocMaxTestWords, 0, \
3177 "If non-zero, maximum number of words that malloc/realloc can " \
3178 "allocate (for testing only)") \
3179 \
3180 product(intx, TypeProfileWidth, 2, \
3181 "Number of receiver types to record in call/cast profile") \
3182 \
3183 develop(intx, BciProfileWidth, 2, \
3184 "Number of return bci's to record in ret profile") \
3185 \
3186 product(intx, PerMethodRecompilationCutoff, 400, \
3187 "After recompiling N times, stay in the interpreter (-1=>'Inf')") \
3188 range(-1, max_intx) \
3189 \
3190 product(intx, PerBytecodeRecompilationCutoff, 200, \
3191 "Per-BCI limit on repeated recompilation (-1=>'Inf')") \
3192 range(-1, max_intx) \
3193 \
3194 product(intx, PerMethodTrapLimit, 100, \
3195 "Limit on traps (of one kind) in a method (includes inlines)") \
3196 \
3197 experimental(intx, PerMethodSpecTrapLimit, 5000, \
3198 "Limit on speculative traps (of one kind) in a method " \
3199 "(includes inlines)") \
3200 \
3201 product(intx, PerBytecodeTrapLimit, 4, \
3202 "Limit on traps (of one kind) at a particular BCI") \
3203 \
3204 experimental(intx, SpecTrapLimitExtraEntries, 3, \
3205 "Extra method data trap entries for speculation") \
3206 \
3207 develop(intx, InlineFrequencyRatio, 20, \
3208 "Ratio of call site execution to caller method invocation") \
3209 \
3210 develop_pd(intx, InlineFrequencyCount, \
3211 "Count of call site execution necessary to trigger frequent " \
3212 "inlining") \
3213 \
3214 develop(intx, InlineThrowCount, 50, \
3215 "Force inlining of interpreted methods that throw this often") \
3216 \
3217 develop(intx, InlineThrowMaxSize, 200, \
3218 "Force inlining of throwing methods smaller than this") \
3219 \
3232 \
3233 product(size_t, OldSize, ScaleForWordSize(4*M), \
3234 "Initial tenured generation size (in bytes)") \
3235 \
3236 product(size_t, NewSize, ScaleForWordSize(1*M), \
3237 "Initial new generation size (in bytes)") \
3238 \
3239 product(size_t, MaxNewSize, max_uintx, \
3240 "Maximum new generation size (in bytes), max_uintx means set " \
3241 "ergonomically") \
3242 \
3243 product(size_t, PretenureSizeThreshold, 0, \
3244 "Maximum size in bytes of objects allocated in DefNew " \
3245 "generation; zero means no maximum") \
3246 \
3247 product(size_t, TLABSize, 0, \
3248 "Starting TLAB size (in bytes); zero means set ergonomically") \
3249 \
3250 product(size_t, MinTLABSize, 2*K, \
3251 "Minimum allowed TLAB size (in bytes)") \
3252 range(1, max_uintx) \
3253 \
3254 product(uintx, TLABAllocationWeight, 35, \
3255 "Allocation averaging weight") \
3256 range(0, 100) \
3257 \
3258 /* Limit the lower bound of this flag to 1 as it is used */ \
3259 /* in a division expression. */ \
3260 product(uintx, TLABWasteTargetPercent, 1, \
3261 "Percentage of Eden that can be wasted") \
3262 range(1, 100) \
3263 \
3264 product(uintx, TLABRefillWasteFraction, 64, \
3265 "Maximum TLAB waste at a refill (internal fragmentation)") \
3266 range(1, max_uintx) \
3267 \
3268 product(uintx, TLABWasteIncrement, 4, \
3269 "Increment allowed waste at slow allocation") \
3270 \
3271 product(uintx, SurvivorRatio, 8, \
3272 "Ratio of eden/survivor space size") \
3273 \
3274 product(uintx, NewRatio, 2, \
3275 "Ratio of old/new generation sizes") \
3276 \
3277 product_pd(size_t, NewSizeThreadIncrease, \
3278 "Additional size added to desired new generation size per " \
3279 "non-daemon thread (in bytes)") \
3280 \
3281 product_pd(size_t, MetaspaceSize, \
3282 "Initial size of Metaspaces (in bytes)") \
3283 \
3284 product(size_t, MaxMetaspaceSize, max_uintx, \
3285 "Maximum size of Metaspaces (in bytes)") \
3286 \
3287 product(size_t, CompressedClassSpaceSize, 1*G, \
3288 "Maximum size of class area in Metaspace when compressed " \
3289 "class pointers are used") \
3290 range(1*M, 3*G) \
3291 \
3292 manageable(uintx, MinHeapFreeRatio, 40, \
3293 "The minimum percentage of heap free after GC to avoid expansion."\
3294 " For most GCs this applies to the old generation. In G1 and" \
3295 " ParallelGC it applies to the whole heap.") \
3296 range(0, 100) \
3297 constraint(MinHeapFreeRatioConstraintFunc) \
3298 \
3299 manageable(uintx, MaxHeapFreeRatio, 70, \
3300 "The maximum percentage of heap free after GC to avoid shrinking."\
3301 " For most GCs this applies to the old generation. In G1 and" \
3302 " ParallelGC it applies to the whole heap.") \
3303 range(0, 100) \
3304 constraint(MaxHeapFreeRatioConstraintFunc) \
3305 \
3306 product(intx, SoftRefLRUPolicyMSPerMB, 1000, \
3307 "Number of milliseconds per MB of free space in the heap") \
3308 \
3309 product(size_t, MinHeapDeltaBytes, ScaleForWordSize(128*K), \
3310 "The minimum change in heap space due to GC (in bytes)") \
3311 \
3312 product(size_t, MinMetaspaceExpansion, ScaleForWordSize(256*K), \
3313 "The minimum expansion of Metaspace (in bytes)") \
3314 \
3315 product(uintx, MaxMetaspaceFreeRatio, 70, \
3316 "The maximum percentage of Metaspace free after GC to avoid " \
3317 "shrinking") \
3318 range(0, 100) \
3319 constraint(MaxMetaspaceFreeRatioConstraintFunc) \
3320 \
3321 product(uintx, MinMetaspaceFreeRatio, 40, \
3322 "The minimum percentage of Metaspace free after GC to avoid " \
3323 "expansion") \
3324 range(0, 100) \
3325 constraint(MinMetaspaceFreeRatioConstraintFunc) \
3326 \
3327 product(size_t, MaxMetaspaceExpansion, ScaleForWordSize(4*M), \
3328 "The maximum expansion of Metaspace without full GC (in bytes)") \
3329 \
3330 product(uintx, QueuedAllocationWarningCount, 0, \
3331 "Number of times an allocation that queues behind a GC " \
3332 "will retry before printing a warning") \
3333 \
3334 diagnostic(uintx, VerifyGCStartAt, 0, \
3335 "GC invoke count where +VerifyBefore/AfterGC kicks in") \
3336 \
3337 diagnostic(intx, VerifyGCLevel, 0, \
3338 "Generation level at which to start +VerifyBefore/AfterGC") \
3339 \
3340 product(uintx, MaxTenuringThreshold, 15, \
3341 "Maximum value for tenuring threshold") \
3342 range(0, markOopDesc::max_age + 1) \
3343 constraint(MaxTenuringThresholdConstraintFunc) \
3344 \
3345 product(uintx, InitialTenuringThreshold, 7, \
3346 "Initial value for tenuring threshold") \
3347 range(0, markOopDesc::max_age + 1) \
3348 constraint(InitialTenuringThresholdConstraintFunc) \
3349 \
3350 product(uintx, TargetSurvivorRatio, 50, \
3351 "Desired percentage of survivor space used after scavenge") \
3352 range(0, 100) \
3353 \
3354 product(uintx, MarkSweepDeadRatio, 5, \
3355 "Percentage (0-100) of the old gen allowed as dead wood. " \
3356 "Serial mark sweep treats this as both the minimum and maximum " \
3357 "value. " \
3358 "CMS uses this value only if it falls back to mark sweep. " \
3359 "Par compact uses a variable scale based on the density of the " \
3360 "generation and treats this as the maximum value when the heap " \
3361 "is either completely full or completely empty. Par compact " \
3362 "also has a smaller default value; see arguments.cpp.") \
3363 range(0, 100) \
3364 \
3365 product(uintx, MarkSweepAlwaysCompactCount, 4, \
3366 "How often should we fully compact the heap (ignoring the dead " \
3367 "space parameters)") \
3368 range(1, max_uintx) \
3369 \
3370 product(intx, PrintCMSStatistics, 0, \
3371 "Statistics for CMS") \
3372 \
3373 product(bool, PrintCMSInitiationStatistics, false, \
3374 "Statistics for initiating a CMS collection") \
3375 \
3376 product(intx, PrintFLSStatistics, 0, \
3377 "Statistics for CMS' FreeListSpace") \
3378 \
3379 product(intx, PrintFLSCensus, 0, \
3380 "Census for CMS' FreeListSpace") \
3381 \
3382 develop(uintx, GCExpandToAllocateDelayMillis, 0, \
3383 "Delay between expansion and allocation (in milliseconds)") \
3384 \
3385 develop(uintx, GCWorkerDelayMillis, 0, \
3386 "Delay in scheduling GC workers (in milliseconds)") \
3387 \
3388 product(intx, DeferThrSuspendLoopCount, 4000, \
3389 "(Unstable) Number of times to iterate in safepoint loop " \
3390 "before blocking VM threads ") \
3391 \
3392 product(intx, DeferPollingPageLoopCount, -1, \
3393 "(Unsafe,Unstable) Number of iterations in safepoint loop " \
3394 "before changing safepoint polling page to RO ") \
3395 \
3396 product(intx, SafepointSpinBeforeYield, 2000, "(Unstable)") \
3397 \
3398 product(bool, PSChunkLargeArrays, true, \
3399 "Process large arrays in chunks") \
3400 \
3401 product(uintx, GCDrainStackTargetSize, 64, \
3402 "Number of entries we will try to leave on the stack " \
3403 "during parallel gc") \
3404 \
3405 /* stack parameters */ \
3406 product_pd(intx, StackYellowPages, \
3407 "Number of yellow zone (recoverable overflows) pages") \
3408 range(1, max_intx) \
3409 \
3410 product_pd(intx, StackRedPages, \
3411 "Number of red zone (unrecoverable overflows) pages") \
3412 range(1, max_intx) \
3413 \
3414 /* greater stack shadow pages can't generate instruction to bang stack */ \
3415 product_pd(intx, StackShadowPages, \
3416 "Number of shadow zone (for overflow checking) pages " \
3417 "this should exceed the depth of the VM and native call stack") \
3418 range(1, 50) \
3419 \
3420 product_pd(intx, ThreadStackSize, \
3421 "Thread Stack Size (in Kbytes)") \
3422 \
3423 product_pd(intx, VMThreadStackSize, \
3424 "Non-Java Thread Stack Size (in Kbytes)") \
3425 \
3426 product_pd(intx, CompilerThreadStackSize, \
3427 "Compiler Thread Stack Size (in Kbytes)") \
3428 \
3429 develop_pd(size_t, JVMInvokeMethodSlack, \
3430 "Stack space (bytes) required for JVM_InvokeMethod to complete") \
3431 \
3432 product(size_t, ThreadSafetyMargin, 50*M, \
3433 "Thread safety margin is used on fixed-stack LinuxThreads (on " \
3434 "Linux/x86 only) to prevent heap-stack collision. Set to 0 to " \
3435 "disable this feature") \
3436 \
3437 /* code cache parameters */ \
3438 /* ppc64/tiered compilation has large code-entry alignment. */ \
3439 develop(uintx, CodeCacheSegmentSize, 64 PPC64_ONLY(+64) NOT_PPC64(TIERED_ONLY(+64)),\
3440 "Code cache segment size (in bytes) - smallest unit of " \
3441 "allocation") \
3442 range(1, 1024) \
3443 \
3444 develop_pd(intx, CodeEntryAlignment, \
3445 "Code entry alignment for generated code (in bytes)") \
3446 \
3447 product_pd(intx, OptoLoopAlignment, \
3448 "Align inner loops to zero relative to this modulus") \
3449 \
3450 product_pd(uintx, InitialCodeCacheSize, \
3451 "Initial code cache size (in bytes)") \
3452 \
3453 develop_pd(uintx, CodeCacheMinimumUseSpace, \
3454 "Minimum code cache size (in bytes) required to start VM.") \
3455 \
3456 product(bool, SegmentedCodeCache, false, \
3457 "Use a segmented code cache") \
3458 \
3459 product_pd(uintx, ReservedCodeCacheSize, \
3460 "Reserved code cache size (in bytes) - maximum code cache size") \
3461 \
3462 product_pd(uintx, NonProfiledCodeHeapSize, \
3463 "Size of code heap with non-profiled methods (in bytes)") \
3464 \
3465 product_pd(uintx, ProfiledCodeHeapSize, \
3466 "Size of code heap with profiled methods (in bytes)") \
3467 \
3468 product_pd(uintx, NonNMethodCodeHeapSize, \
3469 "Size of code heap with non-nmethods (in bytes)") \
3470 \
3471 product_pd(uintx, CodeCacheExpansionSize, \
3472 "Code cache expansion size (in bytes)") \
3473 \
3474 develop_pd(uintx, CodeCacheMinBlockLength, \
3475 "Minimum number of segments in a code cache block") \
3476 range(1, 100) \
3477 \
3478 notproduct(bool, ExitOnFullCodeCache, false, \
3479 "Exit the VM if we fill the code cache") \
3480 \
3481 product(bool, UseCodeCacheFlushing, true, \
3482 "Remove cold/old nmethods from the code cache") \
3483 \
3484 product(uintx, StartAggressiveSweepingAt, 10, \
3485 "Start aggressive sweeping if X[%] of the code cache is free." \
3486 "Segmented code cache: X[%] of the non-profiled heap." \
3487 "Non-segmented code cache: X[%] of the total code cache") \
3488 range(0, 100) \
3489 \
3490 /* interpreter debugging */ \
3491 develop(intx, BinarySwitchThreshold, 5, \
3492 "Minimal number of lookupswitch entries for rewriting to binary " \
3493 "switch") \
3494 \
3495 develop(intx, StopInterpreterAt, 0, \
3496 "Stop interpreter execution at specified bytecode number") \
3497 \
3498 develop(intx, TraceBytecodesAt, 0, \
3499 "Trace bytecodes starting with specified bytecode number") \
3500 \
3501 /* compiler interface */ \
3502 develop(intx, CIStart, 0, \
3503 "The id of the first compilation to permit") \
3504 \
3505 develop(intx, CIStop, max_jint, \
3506 "The id of the last compilation to permit") \
3507 \
3508 develop(intx, CIStartOSR, 0, \
3529 "Prepend to .hotspot_compiler; e.g. log,java/lang/String.<init>") \
3530 \
3531 develop(bool, ReplayCompiles, false, \
3532 "Enable replay of compilations from ReplayDataFile") \
3533 \
3534 product(ccstr, ReplayDataFile, NULL, \
3535 "File containing compilation replay information" \
3536 "[default: ./replay_pid%p.log] (%p replaced with pid)") \
3537 \
3538 product(ccstr, InlineDataFile, NULL, \
3539 "File containing inlining replay information" \
3540 "[default: ./inline_pid%p.log] (%p replaced with pid)") \
3541 \
3542 develop(intx, ReplaySuppressInitializers, 2, \
3543 "Control handling of class initialization during replay: " \
3544 "0 - don't do anything special; " \
3545 "1 - treat all class initializers as empty; " \
3546 "2 - treat class initializers for application classes as empty; " \
3547 "3 - allow all class initializers to run during bootstrap but " \
3548 " pretend they are empty after starting replay") \
3549 range(0, 3) \
3550 \
3551 develop(bool, ReplayIgnoreInitErrors, false, \
3552 "Ignore exceptions thrown during initialization for replay") \
3553 \
3554 product(bool, DumpReplayDataOnError, true, \
3555 "Record replay data for crashing compiler threads") \
3556 \
3557 product(bool, CICompilerCountPerCPU, false, \
3558 "1 compiler thread for log(N CPUs)") \
3559 \
3560 develop(intx, CIFireOOMAt, -1, \
3561 "Fire OutOfMemoryErrors throughout CI for testing the compiler " \
3562 "(non-negative value throws OOM after this many CI accesses " \
3563 "in each compile)") \
3564 notproduct(intx, CICrashAt, -1, \
3565 "id of compilation to trigger assert in compiler thread for " \
3566 "the purpose of testing, e.g. generation of replay data") \
3567 notproduct(bool, CIObjectFactoryVerify, false, \
3568 "enable potentially expensive verification in ciObjectFactory") \
3569 \
3574 "0 : Normal. "\
3575 " VM chooses priorities that are appropriate for normal "\
3576 " applications. On Solaris NORM_PRIORITY and above are mapped "\
3577 " to normal native priority. Java priorities below " \
3578 " NORM_PRIORITY map to lower native priority values. On "\
3579 " Windows applications are allowed to use higher native "\
3580 " priorities. However, with ThreadPriorityPolicy=0, VM will "\
3581 " not use the highest possible native priority, "\
3582 " THREAD_PRIORITY_TIME_CRITICAL, as it may interfere with "\
3583 " system threads. On Linux thread priorities are ignored "\
3584 " because the OS does not support static priority in "\
3585 " SCHED_OTHER scheduling class which is the only choice for "\
3586 " non-root, non-realtime applications. "\
3587 "1 : Aggressive. "\
3588 " Java thread priorities map over to the entire range of "\
3589 " native thread priorities. Higher Java thread priorities map "\
3590 " to higher native thread priorities. This policy should be "\
3591 " used with care, as sometimes it can cause performance "\
3592 " degradation in the application and/or the entire system. On "\
3593 " Linux this policy requires root privilege.") \
3594 range(0, 1) \
3595 \
3596 product(bool, ThreadPriorityVerbose, false, \
3597 "Print priority changes") \
3598 \
3599 product(intx, CompilerThreadPriority, -1, \
3600 "The native priority at which compiler threads should run " \
3601 "(-1 means no change)") \
3602 \
3603 product(intx, VMThreadPriority, -1, \
3604 "The native priority at which the VM thread should run " \
3605 "(-1 means no change)") \
3606 \
3607 product(bool, CompilerThreadHintNoPreempt, true, \
3608 "(Solaris only) Give compiler threads an extra quanta") \
3609 \
3610 product(bool, VMThreadHintNoPreempt, false, \
3611 "(Solaris only) Give VM thread an extra quanta") \
3612 \
3613 product(intx, JavaPriority1_To_OSPriority, -1, \
3614 "Map Java priorities to OS priorities") \
3758 "reaches this amount per compiler thread") \
3759 \
3760 product(intx, Tier4LoadFeedback, 3, \
3761 "Tier 4 thresholds will increase twofold when C2 queue size " \
3762 "reaches this amount per compiler thread") \
3763 \
3764 product(intx, TieredCompileTaskTimeout, 50, \
3765 "Kill compile task if method was not used within " \
3766 "given timeout in milliseconds") \
3767 \
3768 product(intx, TieredStopAtLevel, 4, \
3769 "Stop at given compilation level") \
3770 \
3771 product(intx, Tier0ProfilingStartPercentage, 200, \
3772 "Start profiling in interpreter if the counters exceed tier 3 " \
3773 "thresholds by the specified percentage") \
3774 \
3775 product(uintx, IncreaseFirstTierCompileThresholdAt, 50, \
3776 "Increase the compile threshold for C1 compilation if the code " \
3777 "cache is filled by the specified percentage") \
3778 range(0, 99) \
3779 \
3780 product(intx, TieredRateUpdateMinTime, 1, \
3781 "Minimum rate sampling interval (in milliseconds)") \
3782 \
3783 product(intx, TieredRateUpdateMaxTime, 25, \
3784 "Maximum rate sampling interval (in milliseconds)") \
3785 \
3786 product_pd(bool, TieredCompilation, \
3787 "Enable tiered compilation") \
3788 \
3789 product(bool, PrintTieredEvents, false, \
3790 "Print tiered events notifications") \
3791 \
3792 product_pd(intx, OnStackReplacePercentage, \
3793 "NON_TIERED number of method invocations/branches (expressed as " \
3794 "% of CompileThreshold) before (re-)compiling OSR code") \
3795 \
3796 product(intx, InterpreterProfilePercentage, 33, \
3797 "NON_TIERED number of method invocations/branches (expressed as " \
3798 "% of CompileThreshold) before profiling in the interpreter") \
3799 range(0, 100) \
3800 \
3801 develop(intx, MaxRecompilationSearchLength, 10, \
3802 "The maximum number of frames to inspect when searching for " \
3803 "recompilee") \
3804 \
3805 develop(intx, MaxInterpretedSearchLength, 3, \
3806 "The maximum number of interpreted frames to skip when searching "\
3807 "for recompilee") \
3808 \
3809 develop(intx, DesiredMethodLimit, 8000, \
3810 "The desired maximum method size (in bytecodes) after inlining") \
3811 \
3812 develop(intx, HugeMethodLimit, 8000, \
3813 "Don't compile methods larger than this if " \
3814 "+DontCompileHugeMethods") \
3815 \
3816 /* New JDK 1.4 reflection implementation */ \
3817 \
3818 develop(intx, FastSuperclassLimit, 8, \
3819 "Depth of hardwired instanceof accelerator array") \
3859 \
3860 product(bool, PerfDisableSharedMem, false, \
3861 "Store performance data in standard memory") \
3862 \
3863 product(intx, PerfDataMemorySize, 32*K, \
3864 "Size of performance data memory region. Will be rounded " \
3865 "up to a multiple of the native os page size.") \
3866 \
3867 product(intx, PerfMaxStringConstLength, 1024, \
3868 "Maximum PerfStringConstant string length before truncation") \
3869 \
3870 product(bool, PerfAllowAtExitRegistration, false, \
3871 "Allow registration of atexit() methods") \
3872 \
3873 product(bool, PerfBypassFileSystemCheck, false, \
3874 "Bypass Win32 file system criteria checks (Windows Only)") \
3875 \
3876 product(intx, UnguardOnExecutionViolation, 0, \
3877 "Unguard page and retry on no-execute fault (Win32 only) " \
3878 "0=off, 1=conservative, 2=aggressive") \
3879 range(0, 2) \
3880 \
3881 /* Serviceability Support */ \
3882 \
3883 product(bool, ManagementServer, false, \
3884 "Create JMX Management Server") \
3885 \
3886 product(bool, DisableAttachMechanism, false, \
3887 "Disable mechanism that allows tools to attach to this VM") \
3888 \
3889 product(bool, StartAttachListener, false, \
3890 "Always start Attach Listener at VM startup") \
3891 \
3892 manageable(bool, PrintConcurrentLocks, false, \
3893 "Print java.util.concurrent locks in thread dump") \
3894 \
3895 product(bool, TransmitErrorReport, false, \
3896 "Enable error report transmission on erroneous termination") \
3897 \
3898 product(ccstr, ErrorReportServer, NULL, \
3899 "Override built-in error report server address") \
3980 diagnostic(bool, PauseAtExit, false, \
3981 "Pause and wait for keypress on exit if a debugger is attached") \
3982 \
3983 product(bool, ExtendedDTraceProbes, false, \
3984 "Enable performance-impacting dtrace probes") \
3985 \
3986 product(bool, DTraceMethodProbes, false, \
3987 "Enable dtrace probes for method-entry and method-exit") \
3988 \
3989 product(bool, DTraceAllocProbes, false, \
3990 "Enable dtrace probes for object allocation") \
3991 \
3992 product(bool, DTraceMonitorProbes, false, \
3993 "Enable dtrace probes for monitor events") \
3994 \
3995 product(bool, RelaxAccessControlCheck, false, \
3996 "Relax the access control checks in the verifier") \
3997 \
3998 product(uintx, StringTableSize, defaultStringTableSize, \
3999 "Number of buckets in the interned String table") \
4000 range(minimumStringTableSize, 111*defaultStringTableSize) \
4001 \
4002 experimental(uintx, SymbolTableSize, defaultSymbolTableSize, \
4003 "Number of buckets in the JVM internal Symbol table") \
4004 range(minimumSymbolTableSize, 111*defaultSymbolTableSize) \
4005 \
4006 product(bool, UseStringDeduplication, false, \
4007 "Use string deduplication") \
4008 \
4009 product(bool, PrintStringDeduplicationStatistics, false, \
4010 "Print string deduplication statistics") \
4011 \
4012 product(uintx, StringDeduplicationAgeThreshold, 3, \
4013 "A string must reach this age (or be promoted to an old region) " \
4014 "to be considered for deduplication") \
4015 range(1, markOopDesc::max_age) \
4016 \
4017 diagnostic(bool, StringDeduplicationResizeALot, false, \
4018 "Force table resize every time the table is scanned") \
4019 \
4020 diagnostic(bool, StringDeduplicationRehashALot, false, \
4021 "Force table rehash every time the table is scanned") \
4022 \
4023 develop(bool, TraceDefaultMethods, false, \
4024 "Trace the default method processing steps") \
4025 \
4026 develop(bool, VerifyGenericSignatures, false, \
4027 "Abort VM on erroneous or inconsistent generic signatures") \
4028 \
4029 diagnostic(bool, WhiteBoxAPI, false, \
4030 "Enable internal testing APIs") \
4031 \
4032 product(bool, PrintGCCause, true, \
4033 "Include GC cause in GC logging") \
4034 \
4035 experimental(intx, SurvivorAlignmentInBytes, 0, \
4036 "Default survivor space alignment in bytes") \
4037 constraint(SurvivorAlignmentInBytesConstraintFunc) \
4038 \
4039 product(bool , AllowNonVirtualCalls, false, \
4040 "Obey the ACC_SUPER flag and allow invokenonvirtual calls") \
4041 \
4042 product(ccstr, DumpLoadedClassList, NULL, \
4043 "Dump the names all loaded classes, that could be stored into " \
4044 "the CDS archive, in the specified file") \
4045 \
4046 product(ccstr, SharedClassListFile, NULL, \
4047 "Override the default CDS class list") \
4048 \
4049 diagnostic(ccstr, SharedArchiveFile, NULL, \
4050 "Override the default location of the CDS archive file") \
4051 \
4052 product(ccstr, ExtraSharedClassListFile, NULL, \
4053 "Extra classlist for building the CDS archive file") \
4054 \
4055 experimental(size_t, ArrayAllocatorMallocLimit, \
4056 SOLARIS_ONLY(64*K) NOT_SOLARIS((size_t)-1), \
4057 "Allocation less than this value will be allocated " \
4075
4076 /*
4077 * Macros for factoring of globals
4078 */
4079
4080 // Interface macros
4081 #define DECLARE_PRODUCT_FLAG(type, name, value, doc) extern "C" type name;
4082 #define DECLARE_PD_PRODUCT_FLAG(type, name, doc) extern "C" type name;
4083 #define DECLARE_DIAGNOSTIC_FLAG(type, name, value, doc) extern "C" type name;
4084 #define DECLARE_EXPERIMENTAL_FLAG(type, name, value, doc) extern "C" type name;
4085 #define DECLARE_MANAGEABLE_FLAG(type, name, value, doc) extern "C" type name;
4086 #define DECLARE_PRODUCT_RW_FLAG(type, name, value, doc) extern "C" type name;
4087 #ifdef PRODUCT
4088 #define DECLARE_DEVELOPER_FLAG(type, name, value, doc) extern "C" type CONST_##name; const type name = value;
4089 #define DECLARE_PD_DEVELOPER_FLAG(type, name, doc) extern "C" type CONST_##name; const type name = pd_##name;
4090 #define DECLARE_NOTPRODUCT_FLAG(type, name, value, doc) extern "C" type CONST_##name;
4091 #else
4092 #define DECLARE_DEVELOPER_FLAG(type, name, value, doc) extern "C" type name;
4093 #define DECLARE_PD_DEVELOPER_FLAG(type, name, doc) extern "C" type name;
4094 #define DECLARE_NOTPRODUCT_FLAG(type, name, value, doc) extern "C" type name;
4095 #endif // PRODUCT
4096 // Special LP64 flags, product only needed for now.
4097 #ifdef _LP64
4098 #define DECLARE_LP64_PRODUCT_FLAG(type, name, value, doc) extern "C" type name;
4099 #else
4100 #define DECLARE_LP64_PRODUCT_FLAG(type, name, value, doc) const type name = value;
4101 #endif // _LP64
4102
4103 // Implementation macros
4104 #define MATERIALIZE_PRODUCT_FLAG(type, name, value, doc) type name = value;
4105 #define MATERIALIZE_PD_PRODUCT_FLAG(type, name, doc) type name = pd_##name;
4106 #define MATERIALIZE_DIAGNOSTIC_FLAG(type, name, value, doc) type name = value;
4107 #define MATERIALIZE_EXPERIMENTAL_FLAG(type, name, value, doc) type name = value;
4108 #define MATERIALIZE_MANAGEABLE_FLAG(type, name, value, doc) type name = value;
4109 #define MATERIALIZE_PRODUCT_RW_FLAG(type, name, value, doc) type name = value;
4110 #ifdef PRODUCT
4111 #define MATERIALIZE_DEVELOPER_FLAG(type, name, value, doc) type CONST_##name = value;
4112 #define MATERIALIZE_PD_DEVELOPER_FLAG(type, name, doc) type CONST_##name = pd_##name;
4113 #define MATERIALIZE_NOTPRODUCT_FLAG(type, name, value, doc) type CONST_##name = value;
4114 #else
4115 #define MATERIALIZE_DEVELOPER_FLAG(type, name, value, doc) type name = value;
4116 #define MATERIALIZE_PD_DEVELOPER_FLAG(type, name, doc) type name = pd_##name;
4117 #define MATERIALIZE_NOTPRODUCT_FLAG(type, name, value, doc) type name = value;
4118 #endif // PRODUCT
4119 #ifdef _LP64
4120 #define MATERIALIZE_LP64_PRODUCT_FLAG(type, name, value, doc) type name = value;
4121 #else
4122 #define MATERIALIZE_LP64_PRODUCT_FLAG(type, name, value, doc) /* flag is constant */
4123 #endif // _LP64
4124
4125 // Only materialize src code for range checking when required, ignore otherwise
4126 #define IGNORE_RANGE(a, b)
4127 // Only materialize src code for contraint checking when required, ignore otherwise
4128 #define IGNORE_CONSTRAINT(func)
4129
4130 RUNTIME_FLAGS(DECLARE_DEVELOPER_FLAG, \
4131 DECLARE_PD_DEVELOPER_FLAG, \
4132 DECLARE_PRODUCT_FLAG, \
4133 DECLARE_PD_PRODUCT_FLAG, \
4134 DECLARE_DIAGNOSTIC_FLAG, \
4135 DECLARE_EXPERIMENTAL_FLAG, \
4136 DECLARE_NOTPRODUCT_FLAG, \
4137 DECLARE_MANAGEABLE_FLAG, \
4138 DECLARE_PRODUCT_RW_FLAG, \
4139 DECLARE_LP64_PRODUCT_FLAG, \
4140 IGNORE_RANGE, \
4141 IGNORE_CONSTRAINT)
4142
4143 RUNTIME_OS_FLAGS(DECLARE_DEVELOPER_FLAG, \
4144 DECLARE_PD_DEVELOPER_FLAG, \
4145 DECLARE_PRODUCT_FLAG, \
4146 DECLARE_PD_PRODUCT_FLAG, \
4147 DECLARE_DIAGNOSTIC_FLAG, \
4148 DECLARE_NOTPRODUCT_FLAG, \
4149 IGNORE_RANGE, \
4150 IGNORE_CONSTRAINT)
4151
4152 ARCH_FLAGS(DECLARE_DEVELOPER_FLAG, \
4153 DECLARE_PRODUCT_FLAG, \
4154 DECLARE_DIAGNOSTIC_FLAG, \
4155 DECLARE_EXPERIMENTAL_FLAG, \
4156 DECLARE_NOTPRODUCT_FLAG, \
4157 IGNORE_RANGE, \
4158 IGNORE_CONSTRAINT)
4159
4160 // Extensions
4161
4162 #include "runtime/globals_ext.hpp"
4163
4164 #endif // SHARE_VM_RUNTIME_GLOBALS_HPP
|