VM Options Explorer - GraalVM EE JDK17

Enables instruction profiling on assembler level. Valid values are a
comma separated list of supported instructions. Compare with subclasses
of Assembler.InstructionCounter.

Abort VM with SIGILL if benchmark counters controlled by the
(Generic|Timed|Benchmark)DynamicCounters
option overflow.  WARNING: No descriptive error message will be printed! In
case of an overflow, manual inspection of the emitted code is required.

Overwrites the available number of processors provided by the OS. Any
value <= 0 means using the processor count from the OS.

File to which aggregated metrics are dumped at shutdown. A CSV format
is used if the file ends with .csv otherwise a more human readable
format is used. If not specified, metrics are dumped to the console.

Model all array type flows using a unique elements type flow
abstraction.

The minimum size in bytes required for printing an allocation profiling
entry

A context sensitive heap means that each heap allocated object is
modeled by using at least the allocation site.

Unconditionally inline intrinsics

Force all freshly committed pages to be pre-touched. G1 GC only.

Controls the static analysis context sensitivity. Available values:
insens (context insensitive analysis), allocsens (context insensitive
analysis, context insensitive heap, allocation site sensitive heap),
_1obj (1 object sensitive analysis with a context insensitive heap),
_2obj1h (2 object sensitive with a 1 context sensitive heap)

The maximum size of type and method profiles returned by the static
analysis. -1 indicates no limitation.

Analysis results statistics file.

Array region equality checks will be evaluated at compile time if the
receiver is a constant and its length is smaller than this value.

Record stack trace along with scoped foreign object reference wrappers to debug issue with a wrapper being used after its scope has closed.

Determines if the reference handling is executed automatically or
manually.

The base target spending used to estimate the inlining threshold; the
higher, the likelier it is to inline.

Use a cutoff to print only most significant counters.

Dump dynamic counters

Dump static counters

File to which benchmark counters are dumped. A CSV format is used if
the file ends with .csv otherwise a more human readable format is used.
The fields in the CSV format are: category, group, name, value

Turn on the benchmark counters. The format of this option is:
          
  (err|out),start pattern,end pattern
  
Start counting when the start pattern matches on the given stream and stop when the end pattern occurs.
You can use "~" to match 1 or more digits.
Examples:
          
  err, starting =====, PASSED in
  out,Iteration ~ (~s) begins:,Iteration ~ (~s) ends:
  
The first pattern matches DaCapo output and the second matches SPECjvm2008 output.
          
As a more detailed example, here are the options to use for getting statistics
about allocations within the DaCapo pmd benchmark:
          
  -XX:JVMCICounterSize= -XX:-JVMCICountersExcludeCompiler \
  -Dgraal.BenchmarkDynamicCounters="err, starting ====, PASSED in " \
  -Dgraal.ProfileAllocations=true
  
The JVMCICounterSize value depends on the granularity of the profiling -
10000 should be sufficient. Omit JVMCICountersExcludeCompiler to exclude
counting allocations on the compiler threads.
The counters can be further configured by the ProfileAllocationsContext option.
          
We highly recommend the use of -Dgraal.AbortOnBenchmarkCounterOverflow=true to
detect counter overflows eagerly.

Blind constants in code with a random key.

Do not compile anything on bootstrap but just initialize the compiler.

Maximum time in minutes to spend bootstrapping (0 to disable this
limit).

Ratio of the maximum compilation rate below which the bootstrap
compilation rate must not fall (0 or less disables monitoring).

Enable native intrinsics for BouncyCastle.

Break chained phis

Controls the maximum number of compiler nodes that can appear in the
call graph

Controls the maximum size of the call graph before ceasing inlining.

Reduces the likelihood of exploring call graph subtrees that are large.

Exclude virtual nodes when dumping canonical text for graphs.

Exclude virtual nodes when dumping canonical text for graphs.

Attempts to remove object identity hashes when dumping canonical text
for graphs.

Clear the debug metrics after bootstrap.

Prepend the size and label of each element to the stream when serializing HotSpotCompiledCode to verify both ends of the protocol agree on the format. Defaults to true in non-product builds.

Collect information during image build about devirtualized invokes and
bytecode exceptions.

Determines if a full GC collects the young generation separately or
together with the old generation. Serial GC only.

Treat compilation bailouts like compilation failures.

The number of compilations allowed for any method before the VM exits
(a value of 0 means there is no limit).

Exclude certain phases from compilation, either unconditionally or with
a method filter. Multiple exclusions can be specified separated by ':'.
Phase names are matched as substrings, e.g.:
CompilationExcludePhases=PartialEscape:Loop=A.*,B.foo excludes
PartialEscapePhase from all compilations and any phase containing
'Loop' in its name from compilations of all methods in class A and of
method B.foo.

Time limit in seconds before a compilation expires (0 to disable the
limit). A non-zero value for this option is doubled if assertions are
enabled and quadrupled if DetailedAsserts is true.

Specifies the action to take when compilation fails.
          
The accepted values are:
    Silent  - Print nothing to the console.
     Print  - Print a stack trace to the console.
  Diagnose* - Retry the compilation with extra diagnostics.
    ExitVM  - Same as Diagnose except that the VM process exits after retrying.
    
* If "Diagnose" is set compilation will be retried with extra diagnostics enabled including dumping (see file:doc-files/DumpHelp.txt). 
  In such a scenario DiagnoseDumpLevel can be used to specify the dump level (DebugContext dump levels) accordingly.
      

Size of the reserved address space of each compilation isolate (0:
default for new isolates).

Delay in seconds before watch dog monitors a compilation (0 disables
monitoring).

Number of seconds after which a compilation appearing to make no
progress causes the VM to exit (0 disables VM exiting).

In tiered mode compile Graal and JVMCI using optimized first tier code.

Activate runtime compilation in separate isolates (enable support
during image build with option SupportCompileInIsolates).

Create one reusable isolate per compilation thread as opposed to one
isolate per compilation (enable through CompileInIsolates).

Names the compiler configuration to use. If omitted, the compiler
configuration with the highest auto-selection priority is used. To see
the set of available configurations, supply the value 'help' to this
option.

Controls the likelihood of exploring subtrees that already have a lot
of code during inlining.

Selects the system compiler. This must match the getCompilerName() value returned by a jdk.vm.ci.runtime.JVMCICompilerFactory provider. An empty string or the value "null" selects a compiler that will raise an exception upon receiving a compilation request.

Number of concurrent GC threads G1 will use.

Consider the vectorizability of loop during the duplication of a merge
inside a loop.There are rare cases where duplication can destroy
vectorization.

Use the option to avoid the initial value of the
enterSamplingCodeMethodId constant folding. The value of this option
must never be set to true in order to keep the correct information in
the variable.

PullThroughPhiOptimization: Abstract cost for the creation of a new
live value: new values can have a negativeimpact on register
allocation, therefore we penalize it.

PullThroughPhiOptimization: Cost/Benefit heuristic for EE floating node
duplication: reduce cost by a constant factor when comparing with
relative benefit.

Pattern for specifying scopes in which counters are enabled. See the
Dump option for the pattern syntax. An empty value enables all counters
unconditionally.

Code size budget of the strip mining transformation in terms of
NodeCostSize.

The max number of iterations the counted inner loop takes.

Print counter phi values on each outer and inner loop iteration.

Minimal frequency to consider a loop for strip mining.

Code size in NodeSize defining when code size heuristics starts capping
strip mining.

Comma separated names of counters that are enabled irrespective of the
value for Count option. An empty value enables all counters
unconditionally.

Converts an exception triggered by the CrashAt option into a fatal
error if a non-null pointer was passed in the _fatal option to
JNI_CreateJavaVM. This option exists for the purpose of testing fatal
error handling in libgraal.

Pattern for method(s) that will trigger an exception when compiled.
This option exists to test handling compilation crashes gracefully. See
the MethodFilter option for the pattern syntax. A ':Bailout' suffix
will raise a bailout exception and a ':PermanentBailout' suffix will
raise a permanent bailout exception.

Controls the likelihood of further exploring subtrees with a lot of
code during inlining.

Debug simulation synonyms during simulation-based loop peeling.

Enable debug output for stub code generation and snippet preparation.

Default frequency for loops with unknown local frequency.

Default unswitching factor for control split node with unkown profile
data

Deoptimize OSR compiled code when the OSR entry loop is finished if
there is no mature profile available for the rest of the method.

Enable expensive assertions if normal assertions (i.e. -ea or -esa) are
enabled.

Specify the dump level if CompilationFailureAction#Diagnose is used.See
CompilationFailureAction for details.
file:doc-files/CompilationFailureActionHelp.txt

Specifies how many details are printed for certain diagnostic thunks,
e.g.: 'DumpThreads:1,DumpRegisters:2'. A value of 1 will result in the
maximum amount of information, higher values will print less
information. By default, the most detailed output is enabled for all
diagnostic thunks. Wildcards (*) are supported in the name of the
diagnostic thunk.

Ignore calls to System.gc().

Disable intercepting exceptions in debug scopes.

Disable intrinsics matching the given method filter (see MethodFilter
option for details). For example, 'DisableIntrinsics=String.equals'
disables intrinsics for any method named 'equals' in a class whose
simple name is 'String'. You can append ':verbose' at the end of the
filter value to print out disabled intrinsics as they are encountered
during compilation (e.g., 'String.equals:verbose').

Analysis: Detect methods that return one of their parameters and
hardwire the parameter straight to the return.

Dump the current graph after every bci to IGV.

Gather statistics on local variables and their lifetimes relative to
FrameStates.

Debug flag to dump loop frequency differences computed based on loop
end or exit nodes.If the frequencies diverge a lot, this may indicate
missing profiles on control flowinside the loop body.

Create a heap dump and exit.

Dump a JSON array containing all methods included in the image and
exit.

Send compiler IR to dump handlers on error.

Dump a before and after graph if the named phase changes the
graph.%nThe argument is substring matched against the simple name of
the phase class

The directory where various Graal dump files are written.

Dump serialized code during code installation for code whose simple name (a stub) or fully qualified name (an nmethod) contains this option's value as a substring.

Filter pattern for specifying scopes in which dumping is enabled.
          
A filter is a list of comma-separated terms of the form:
 
  [:]
 
If  contains a "*" or "?" character, it is interpreted as a glob pattern.
Otherwise, it is interpreted as a substring. If  is empty, it
matches every scope. If : is omitted, it defaults to 1. The term
~ is a shorthand for :0 to disable a debug facility for a pattern.
          
The default log level is 0 (disabled). Terms with an empty pattern set
the default log level to the specified value. The last
matching term with a non-empty pattern selects the level specified. If
no term matches, the log level is the default level. A filter with no
terms matches every scope with a log level of 1.
          
Examples of debug filters:
--------- 
  (empty string)
          
  Matches any scope with level 1.
--------- 
  :1
          
  Matches any scope with level 1.
--------- 
  *
          
  Matches any scope with level 1.
--------- 
  CodeGen,CodeInstall
          
  Matches scopes containing "CodeGen" or "CodeInstall", both with level 1.
--------- 
  CodeGen:2,CodeInstall:1
          
  Matches scopes containing "CodeGen" with level 2, or "CodeInstall" with level 1.
---------
  Outer:2,Inner:0}
          
  Matches scopes containing "Outer" with log level 2, or "Inner" with log level 0. If the scope
  name contains both patterns then the log level will be 0. This is useful for silencing subscopes.
---------
  :1,Dead:2
          
  Matches scopes containing "Dead" with level 2, and all other scopes with level 1.
--------- 
  Dead:0,:1
          
  Matches all scopes with level 1, except those containing "Dead".   Note that the location of
  the :1 doesn't matter since it's specifying the default log level so it's the same as
  specifying :1,Dead:0.
--------- 
  Code*
          
  Matches scopes starting with "Code" with level 1.
--------- 
  Code,~Dead
          
  Matches scopes containing "Code" but not "Dead", with level 1.

Treat any exceptions during dumping as fatal.

Perform Duplications as long as there is any sane improvement.

Percentage in node cost graph size for the late duplication budget.
Computed relative to the methods code size.

Percentage in node cost graph size for the duplication budget. Computed
relative to the methods code size.

Cost/Benefit heuristic for EE simulation-based code duplication: reduce
cost by a constant factor when comparing with relative benefit.

Ignore low frequency branches during duplication.

Use grouping separators for number printing

Eagerly construct extra snippet info.

Enable early code emission order computation instead of late code
emission order computation

Perform early global value numbering.

Perform early loop invariant code motion.

Emit substitutions for String methods

Enables signal handling

Try to eliminate array clone operations by handling clone operations in
early read elimination.

Enterprise PEA Iterations.

Perform an extended version of early global value numbering on a
graph.Considers only graphs without floating guards.

Enterprise Loop Inversion for GVN

Run more read eliminations early in the compilation pipeline.

Enable EE version of partial loop unrolling that considers more loop
shapes for unrolling.

Log all range check sub values to stdout.

Perform range check elimination for java long type range checks.

Maximum ergonomically set heap size (in bytes); zero means use MaxRAM *
MaxRAMPercentage / 100. G1 GC only.

Exclude compilations that MethodFilter.match this string from the
duplication optimization.

Scan all objects reachable from roots for analysis. By default false.

Exit on the first occurrence of an out-of-memory error that is thrown
because the Java heap is out of memory.

Alias for CompilationFailureAction=ExitVM.

The inertia at which the expand-all proximity bonus decreases with the
number of yet unexpanded nodes.

The decrease in call graph expansion pressure when there are few call
nodes left to explore.

The slowness at which the expansion pressure grows with code size; the
higher it is, the slower the pressure growth.

The extra slowness at which the expansion pressure grows with the code
size, for each extra invoke node.

The max slowness at which the expansion pressure grows with the code
size.

A System.gc() request invokes a concurrent collection. G1 GC only.

Enable extended asserts which slow down analysis.

Do not bail out but throw an exception on failed loop explosion.

Internal option used to specify runtime java arguments for
FallbackExecutor.

Usage: -XX:FlightRecorderLogging=[tag1[+tag2...][*][=level][,...]]
          
When this option is not set, logging is enabled at a level of WARNING.
When this option is set to the empty string, logging is enabled at a level of INFO.
When this option is set to "disable", logging is disabled entirely.
          
Otherwise, this option expects a comma separated list of tag combinations, each with an optional wildcard (*) and level.
A tag combination without a level is given a default level of INFO.
Messages with tags that match a given tag combination are set to log at that tag combination's level.
If a tag combination does not have a wildcard, then only messages with exactly the same tags are matched.
Otherwise, messages whose tags are a subset of the tag combination are matched.
Specifying "all" instead of a tag combination matches all tag combinations.
If more than one tag combination matches a message's tags, the rightmost one will apply.
Messages with tags that do not have any matching tag combinations are set to log at a default level of WARNING.
This option is case insensitive.
          
Available log levels:
[trace, debug, info, warning, error, off]
          
Available log tags:
[jfr, system, event, setting, bytecode, parser, metadata, dcmd]

Enable Java Flight Recorder.

Try to float non-constant division operations to expose global value
numbering of divisions.

Place N-byte constants in the data section such that they are
misaligned with respect to N*2. For example, place 4 byte constants at
offset 4, 12 or 20, etc. This layout is used to detect instructions
that load constants with alignment smaller than the fetch size. For
instance, an XORPS instruction that does a 16-byte fetch of a 4-byte
float not aligned to 16 bytes will cause a segfault.

Force-dump graphs before compilation

Force an explicit compiler node for Reference.reachabilityFence,
instead of relying on FrameState liveness

Forces HotSpotJVMCIRuntime.translate to throw an exception in the context of the peer runtime. The value is a filter that can restrict the forced failure to matching translated objects. See HotSpotJVMCIRuntime.postTranslation for more details. This option exists soley to test correct handling of translation failure.

Force partial unrolling of loops if at all possible.

Gather statistics on local variables and their lifetimes relative to
FrameStates.

Perform full unrolling as a Partial Escape Analysis Cleanup

Maximum factor by which full unrolling can increase code size for large
graphs. The FullUnrollSmallGraphThreshold option determines which
graphs are small

Maximum factor by which full unrolling can increase code size for small
graphs. The FullUnrollSmallGraphThreshold option determines which
graphs are small

The threshold in terms of NodeSize for a graph to be considered small
for the purpose of full unrolling. Applied in conjunction with the
FullUnrollCodeSizeBudgetFactorForSmallGraphs and
FullUnrollCodeSizeBudgetFactorForLargeGraphs options.

Target duration of individual concurrent marking steps in milliseconds.

The threshold that defines (>=) a hot card.

Log base 2 of the length of conc RS hot-card cache.

The number of update buffers that are left in the queue by the
concurrent processing threads. Will be selected ergonomically by
default.

Maximum number of enqueued update buffers before mutator threads start
processing new ones instead of enqueueing them. Will be selected
ergonomically by default.

The last concurrent refinement thread wakes up every specified number
of milliseconds to do miscellaneous work.

The number of parallel remembered set update threads. Will be set
ergonomically by default.

Each time the remembered set update queue increases by this amount
activate the next refinement thread if available. The actual step size
will be selected ergonomically by default, with this value used to
determine a lower bound.

Number of enqueued update buffers that will trigger concurrent
processing. Will be selected ergonomically by default.

Confidence level for MMU/pause predictions.

Amount of space, expressed as a percentage of the heap size, that G1 is
willing not to collect to avoid expensive GCs.

The target number of mixed GCs after a marking cycle.

Number of milliseconds after a previous GC to wait before triggering a
periodic gc. A value of zero disables periodically enforced gc cycles.

Determines the kind of periodic GC. Set to true to have G1 perform a
concurrent GC as periodic GC, otherwise use a STW Full GC.

Maximum recent system wide load as returned by the 1m value of
getloadavg() at which G1 triggers a periodic GC. A load above this
value cancels a given periodic GC. A value of zero disables this check.

A target percentage of time that is allowed to be spend on processing
remembered set update buffers during the collection pause.

The number of discovered reference objects to process before draining
concurrent marking work queues.

It determines the minimum reserve we should have in the heap to
minimize the probability of promotion failure.

Before enqueueing them, each mutator thread tries to do some filtering
on the SATB buffers it generates. If post-filtering the percentage of
retained entries is over this threshold the buffer will be enqueued for
processing. A value of 0 specifies that mutator threads should not do
such filtering.

Number of entries in an SATB log buffer.

Size of an update buffer.

Select green, yellow and red zones adaptively to meet the the pause
requirements.

Adaptively adjust the initiating heap occupancy from the initial value
of InitiatingHeapOccupancyPercent. The policy attempts to start marking
in time based on application behavior.

Verify the code root lists attached to each heap region.

If true, perform verification of each heap region's remembered set when
verifying the heap during a full GC.

Start tracing compiled GC barriers after N garbage collections
(disabled if N <= 0).

Number of entries we will try to leave on the stack during gc. G1 GC
only.

Time slice for MMU specification. G1 GC only.

Adaptive size policy application time to GC time ratio. G1 GC only.

Generate debuginfo for runtime-compiled code.

Turn on the benchmark counters, and displays the results on VM shutdown

Use Graal arithmetic stubs instead of HotSpot stubs where possible

A filter applied to a method the VM has selected for compilation by
Graal. A method not matching the filter is redirected to a lower tier
compiler. The filter format is the same as for the MethodFilter option.

Graal graph compression is performed when percent of live nodes falls
below this value

Duplicate only loops up to this estimated size

Duplicate only loops with at least this frequency

Duplicate only loops in methods executed at least this number of times

Duplicate certain loops and eliminate their guards

Size of heap (bytes) per GC thread used in calculating the number of GC
threads. G1 GC only.

Control heap verifier verbosity level: 0 - quiet, 1 - info, 2 -
warning, 3 - all.

Enable EE partial unrolling in high tier.

Indicates whether a compilation unit is frequently invoked.

Testing only option that forces deopts for exception throws

Testing only option that forces deopts for exception throws

Print inlining optimizations

The minimal percentage of the time spent in the method invoked from the
specific calling-context compared to the total time spent.

Enable hybrid context for static methods, i.e. uses invocation site as
context for static methods.

Ignore duplications with a bad benefit cost relation.

File for printing image build statistics

Override the default suppression of specified roots. See: Reports.md.

Override the default suppression of specified types. See: Reports.md.

Suppress the expansion of specified roots. See: Reports.md.

Suppress the expansion of specified types. See: Reports.md.

Limit of the number of dominating if nodes to consider in infeasible
path correlation to avoid compile time explosion.

Specifies if initialization timing is enabled.

Initial heap size (in bytes); zero means use ergonomics. G1 GC only.

Percentage of real memory used for initial heap size. G1 GC only.

The percent occupancy (IHOP) of the current old generation capacity
above which a concurrent mark cycle will be initiated. Its value may
change over time if adaptive IHOP is enabled, otherwise the value
remains constant. In the latter case a value of 0 will result as
frequent as possible concurrent marking cycles. A value of 100 disables
concurrent marking. Fragmentation waste in the old generation is not
considered free space in this calculation. G1 GC only.

The number of seconds by which to slow down each compilation. The
compilations slowed down can be restricted with MethodFilter. This
option exists to test the compilation watchdog.

The bonus applied to call nodes that can be fully inlined.

Inline methods before static analysis

Maximum depth when inlining during bytecode parsing.

Inlines trivial methods during bytecode parsing.

Embed all the emitted code for Graal-generated stubs.

Inline calls with megamorphic type profile (i.e., not all types could
be recorded).

Inline calls with monomorphic type profile.

Inlines partial intrinsic exits during bytecode parsing when possible.
A partial intrinsic exit is a call within an intrinsic to the method
being intrinsified and denotes semantics of the original method that
the intrinsic does not support.

Inline calls with polymorphic type profile.

Enable inlining

Controls the maximum number of compiler nodes that can be inlined into
the compiled method.

The coefficient used to compute the inlining threshold; the higher, the
more to inline.

Maximum inlining depth during partial evaluation before reporting an
infinite recursion

Do not unroll the main loop, only create pre-main-post.

Inspect analysis graphs.

Path to the contents of the Inspect web server.

Install segfault handler that prints register contents and full Java
stacktrace. Default: enabled for an executable, disabled for a shared
library.

Intercept also bailout exceptions

Use compiler intrinsifications.

Minimal loop frequency for a loop to be considered for inversion.

Minimal relative frequency for a loop to be considered for inversion.

Alignment in bytes for loop header blocks that have no fall through
paths.

Allow iterative peeling of loops up to this many times (each time the
peeling phase runs).

Allow iterative peeling of loops with an outer frequency bonus above
this value.

Enable dynamic move profiling per method.

Path to jar file containing LIR instruction verifier.

Enable constant load optimization.

Enable spill move elimination.

Enable spill position optimization

Use linear scan stack slot allocation.

Enable LIR level optimizations.

Enables profiling of methods.

Enables profiling of move types on LIR level. Move types are for
example stores (register to stack), constant loads (constant to
register) or copies (register to register).

LSRA optimization: Only split but do not reassign

Enable LSRA optimization

Reduces the likelihood of exploring call graphs that have a lot of
children below the root.

Enable a limit for the number of objects recorded for each type of a
type state before disabling heap sensitivity for that type. The
analysis must be heap sensitive.

Lists on the console at VM shutdown the metric names available to the
Timers, Counters and MemUseTrackers options. Note that this only lists
the metrics that were initialized during the VM execution and so will
not include metrics for compiler code that is not executed.

Use a VM runtime call to load and clear the exception object from the
thread at the start of a compiled exception handler.

File to which logging is sent. A %p in the name will be replaced with a
string identifying the process, usually the process id and %t will be
replaced by System.currentTimeMillis(). If the current runtime is in an
isolate, then %i will be replaced by '' otherwise %i is
removed. An %I is the same as %i except that the replacement is
'@'. Using %o as filename sends logging to
System.out whereas %e sends logging to System.err.

Enable more verbose log output when available

Pattern for specifying scopes in which logging is enabled. See the Dump
option for the pattern syntax.

Try to improve counted loop detection by finding more precise loop
bounds.

Scaling factor of frequency difference computed based on loop ends or
exits

Alignment in bytes for loop header blocks.

Execute an endless loop before printing diagnostics for a fatal error.

Restricts LoopPredication to only focus on array bounds checks that
dominate the back edge of a loop.

Hoists array bounds checks out of simple loops. This is ignored if
SpeculativeGuardMovement is enabled.

Maximum size in NodeSize of the code to be duplicated during rotation.

Enable Loop Rotation to let the compiler detect more loops as counted.

Number of nodes allowed for a loop unswitching per loop frequency. The
number of nodes allowed for the unswitching is proportional to the
relative frequency of the loop by this constant.

Maximun value for the frequency factor of an invariant.

Minimum value for the frequency factor of an invariant.

Maximum loop unswitching code size increase in nodes.

Lower bound for the minimun frequency of an invariant condition to be
unswitched.

Number of nodes allowed for a loop unswitching regardless of the loop
frequency.

Maximum size of marking stack. G1 GC only.

Size of marking stack. G1 GC only.

Allow backend to match complex expressions.

The maximum length of the methods context chains.

The maximum number of contexts to record for a method. It only affects
the analysis when the max and min calling context depth are different.

The maximum number of compilation failures to handle with the action
specified by CompilationFailureAction before changing to a less verbose
action. This does not apply to the ExitVM action.

The maximum number of constant objects recorded for each type before
merging the constants into one unique constant object per type. The
analysis must be heap sensitive. It has a minimum value of 1.

Upper bound on the number of cpu locals per counter. It has to be a
power of 2.

Maximum total size of NIO direct-buffer allocations

Max amount of extra effort to expend handling irreducible loops. A
value <= 1 disables support for irreducible loops.

Adaptive size policy maximum GC pause time goal in millisecond, or the
maximum GC time per MMU time slice. G1 GC only.

Maximum node cost graph size for duplication. If a graph is bigger
duplication will stop.

The maximum length of the context used to model a heap object in
addition to the allocation site; used only when ContextSensitiveHeap is
enabled.

The maximum number of contexts to record for a heap object. It only
affects the analysis when the max and min calling context depth are
different.

The maximum free bytes reserved for allocations, in bytes (0 for
automatic according to GC policy). Serial GC only.

The maximum heap size at run-time, in bytes.

The maximum number of lines in the stack trace for Java exceptions (0
means all)

Abstract measure of the cost of branch misprediction. Higher values
make generation of conditional moves more likely.

The maximum size of the young generation at run-time, in bytes

The maximum number of objects recorded for each type of a type state
before disabling heap sensitivity for that type. The analysis must be
heap sensitive. It has a minimum value of 1.

The maximum number of dispatches in guarded polymorphic inlining.

Max number of precise inlining peeling iterations.

Maximum percentage of real memory used for maximum heap size. G1 GC
only.

Real memory size (in bytes) used to set maximum heap size. G1 GC only.

Maximum simulation-duplication iterations of the duplication
optimization per invocation.

Maximum value for tenuring threshold. G1 GC only.

Maximum number of unrolled alignment instructions

Maximum length of linear-code vector operations

Maximum desired size of the compiler graph in nodes.

The maximum length of an array that will be escape analyzed.

The maximum heap size as percent of physical memory. Serial and epsilon
GC only.

Inlining is explored up to this number of nodes in the graph for each
call site.

Max number of loop explosions per method.

Maximum level of recursive inlining.

PullThroughPhiOptimization: Maximum number of algorithm iterations per
optimization invocation.

The maximum size of the young generation as a percentage of the maximum
heap size. Serial and epsilon GC only.

Minimum probability for methods to be inlined for megamorphic type
profiles.

Comma separated names of memory usage trackers that are enabled
irrespective of the value for TrackMemUse option. An empty value
enables all memory usage trackers unconditionally.

Only check MethodFilter against the root method in the context if true,
otherwise check all methods

Pattern for matching methods. The syntax for a pattern is:
          
  SourcePatterns = SourcePattern ["," SourcePatterns] .
  SourcePattern = [ "~" ] [ Class "." ] method [ "(" [ Parameter { ";" Parameter } ] ")" ] .
  Parameter = Class | "int" | "long" | "float" | "double" | "short" | "char" | "boolean" .
  Class = { package "." } class .
          
Glob pattern matching (*, ?) is allowed in all parts of the source pattern.
The "~" prefix negates the pattern.
          
Positive patterns are joined by an "or" operator: "A,B" matches anything
matched by "A" or "B". Negative patterns are joined by "and not": "~A,~B"
matches anything not matched by "A" and not matched by "B". "A,~B,~C,D"
matches anything matched by "A" or "D" and not matched by "B" and not
matched by "C".
          
A set of patterns containing negative patterns but no positive ones contains
an implicit positive "*" pattern: "~A,~B" is equivalent to "*,~A,~B".
          
Examples of method filters:
---------
  *
          
  Matches all methods in all classes.
---------
  canonical(CanonicalizerTool;LogicNode;LogicNode)
          
  Matches all methods named "canonical", with the first parameter of type
  "CanonicalizerTool", and the second and third parameters of type
  "LogicNode".
  The packages of the parameter types are irrelevant.
---------
  arraycopy(Object;;;;)
          
  Matches all methods named "arraycopy", with the first parameter
  of type "Object", and four more parameters of any type. The
  packages of the parameter types are irrelevant.
---------
  List.set
          
  Matches all methods named "set" in a class whose simple name is "List".
---------
  *List.set
          
  Matches all methods named "set" in a class whose simple name ends with "List".
---------
  org.graalvm.compiler.nodes.PhiNode.*
          
  Matches all methods in the class "org.graalvm.compiler.nodes.PhiNode".
---------
  org.graalvm.compiler.nodes.*.canonical
          
  Matches all methods named "canonical" in classes in the package
  "org.graalvm.compiler.nodes".
---------
  arraycopy,toString
          
  Matches all methods named "arraycopy" or "toString", meaning that ',' acts
  as an "or" operator.
---------
  java.util.*.*.,~java.util.*Array*.*
  java.util.*.*.,~*Array*.*
          
  These patterns are equivalent and match all methods in the package
  "java.util" except for classes that have "Array" in their name.
---------
  ~java.util.*.*
          
  Matches all methods in all classes in all packages except for anything in
  the "java.util" package.

Per-compilation method inlining exploration limit before giving up (use
0 to disable)

File to which metrics are dumped per compilation.
A CSV format is used if the file ends with .csv otherwise a more
human readable format is used. The fields in the CSV format are:
           compilable - method being compiled
  compilable_identity - identity hash code of compilable
       compilation_nr - where this compilation lies in the ordered
                        sequence of all compilations identified by
                        compilable_identity
       compilation_id - runtime issued identifier for the compilation
          metric_name - name of metric
         metric_value - value of metric

Enable EE partial unrolling in mid tier.

PullThroughPhiOptimization: Ignore low frequency branches during
duplication.

The minimum length of the methods context chains.

The minimum length of the context used to model a heap object in
addition to the allocation site; used only when ContextSensitiveHeap is
enabled.

The minimum change in heap space due to GC (in bytes). G1 GC only.

The minimum percentage of heap free after GC to avoid expansion. G1 GC
only.

The minimum heap size at run-time, in bytes.

The minimum probability for using a dispatch in guarded polymorphic
inlining.

Minimum percentage of real memory used for maximum heap size on systems
with small physical memory size. G1 GC only.

Minimum allowed TLAB size (in bytes). G1 GC only.

Break chained phis

If applicable, use bulk zeroing instructions when the zeroing size in
bytes exceeds this threshold.

Minimal size in NodeSize to check the graph size increases of phases.

Try to reduce duplication code size to the minimal amount of code.

Minimum size (in bytes) of constants to blind.

Move guard nodes to earlier places in the dominator tree if all
successors of basic block share a common guard condition.

Cost/Benefit heuristic for EE unrolling: If a loop has multiple exits,
cost is increased by this value for every sinking loop exit.

Cost/Benefit heuristic for EE unrolling: If a loop has multiple exits,
cost is increased by this value for every none-sinking loop exit.

Run level for NoDeadCodeVerifyHandler (0 = off, 1 = info, 2 = verbose,
3 = fatal)

Ratio of old/new generation sizes. G1 GC only.

Initial new generation size (in bytes). G1 GC only.

Counts the number of instances of each node class.

Benefit boost for strip mined non counted loops.

Code size budget of the non-counted strip mining transformation in
terms of NodeCostSize.

Force non-counted strip mining for all loops (also counted ones), test
flag only.

Ignore small loops from strip mining, the iv overhead can cause
slowdowns.

The max number of iterations the counted inner loop takes. If -1, the
frequency of the loop will be used to derive an inner frequency.

If NonCountedStripMiningInnerLoopTrips == -1: Maximum loop trips for
strip mined non-counted loops.

Minimal loop frequency to consider a non-counted loop for strip mining.

If NonCountedStripMiningInnerLoopTrips == -1: Minimum loop trips for
strip mined non-counted loops.

Try to reuse pre-existing induction variables inside non-counted loops
for the strip-mined loop's exit check.

Comma separated list of candidate GNU objdump executables. If not
specified, disassembling via GNU objdump is disabled. Otherwise, the
first existing executable in the list is used.

Size of old gen promotion LAB's (in HeapWords). G1 GC only.

Initial tenured generation size (in bytes). G1 GC only.

The fully qualified name of a no-arg, void, static method to be invoked
in HotSpot from libgraal when the libgraal isolate is being
shutdown.This option exists for the purpose of testing callbacks in
this context.

Optimize simple if branches with conditional moves

Straighten monitor enter/exit paths through duplication

Inject stamps on induction variables.

Propagate equality into dominated nodes.

Dump graphs to help debug operation

Dump graphs to help debug operation

Optimize StringBuilder construction

Eliminate redundant write barriers.

Perform write sinking.

Enable access node optimizations for loops

Percentage (0-100) used to weight the current sample when computing
exponentially decaying average for ResizePLAB. G1 GC only.

Scan a subset of object array and push remainder, if array is bigger
than this. G1 GC only.

Wasted fraction of parallel allocation buffer. G1 GC only.

Number of parallel threads G1 will use.

Enable balancing of reference processing queues. G1 GC only.

Enable parallel reference processing whenever possible. G1 GC only.

Enable partial redundancy elimination

Cost/Benefit heuristic for EE unrolling in high tier: reduce cost by a
constant factor when comparing with relative benefit.

Cost/Benefit heuristic for EE unrolling in mid tier: reduce cost by a
constant factor when comparing with relative benefit.

Maximum number of iterations to unroll for a high tier main loop.

Maximum number of iterations to unroll for a mid tier main loop.

Maximum node cost size of a loop to be considered for high tier
unrolling.

Maximum node cost size of a loop to be considered for mid tier tier
unrolling.

Minimal loop frequency to consider a loop for partial unrolling

The limit on the number of paths at control-flow merges. Decreasing
this value reduces the number of paths, but also shortens them.

Dump information for path profile (null or file name). If set to null,
then dumping is disabled.

Maximum acceptable number of paths coming from the inbound of a merge
if both of them are frequent.

If some block's relative frequency drops below this number times the
maximum relative frequency in the graph, then the block is considered
infrequent.

If the ratio of the merge's frequency with its inbound's frequency is
greater than this threshold, then the inbound is considered infrequent.

Maximum number of counters to use in path profiling for all
instrumented methods.

Enable or disable the path-profiling algorithm. If it enables it, it
also allows to select which mode to execute.

Controls whether the path-regeneration algorithm is executed.

Minimal loop body iterations necessary to consider peeling.

Minimal relative frequency of loop begin necessary to consider peeling.

Cost/Benefit heuristic for EE simulation-based loop peeling in high
tier: reduce cost by a constant factor when comparing with relative
benefit.

Cost/Benefit heuristic for EE simulation-based loop peeling in mid
tier: reduce cost by a constant factor when comparing with relative
benefit.

Increase the cost of duplicating control flow splits inside loops if
they are not foldable.The generally tend to complicate control flow and
generate worse code in the backend.

Percentage of total collection time that should be spent on young
generation collections. Serial GC with collection policy
'BySpaceAndTime' only.

Size of performance data memory region. Will be rounded up to a
multiple of the native os page size.

Jvmstat instrumentation sampling interval (in milliseconds)

Maximum PerfStringConstant string length before truncation

Minimal loop frequency to consider a loop for inverted phi minifaction.

Per-thread chunk size for parallel memory pre-touch. G1 GC only.

Calculate the container CPU availability based on the value of quotas
(if set), when true. Otherwise, use the CPU shares value, provided it
is less than quota.

How far ahead to prefetch destination area (<= 0 means off). G1 GC
only.

How far ahead to prefetch scan area (<= 0 means off). G1 GC only.

Change the output format of the analysis call tree, available options
are TXT and CSV. See: Reports.md.

Print analysis call tree, a breadth-first tree reduction of the call
graph.

Print analysis results statistics.

Enables dumping of basic blocks relative PC and frequencies in the dump
directory.

Enable dumping scheduled HIR, LIR, register allocation and code
generation info to the C1Visualizer.

Enable dumping CFG built during initial BciBlockMapping

Print call edges with other analysis results statistics.

Choose format used when dumping canonical text for graphs: 0 gives a
scheduled graph (better for spotting changes involving the schedule)
while 1 gives a CFG containing expressions rooted at fixed nodes
(better for spotting small structure differences)

Enable dumping canonical text from for graphs.

Print an informational line to the console for each completed
compilation.

Prints VM configuration available via JVMCI.

Print detailed information for each allocation site

Print extra help, if available, based on comma-separated option names.
Pass * to show all options that contain extra help.

Show available options based on comma-separated option-types (allowed
categories: User, Expert, Debug).

Print summary GC information after application main method returns.
Serial GC only.

Print a time stamp at each collection, if +PrintGC or +VerboseGC.
Serial GC only.

Print the time for each of the phases of each collection, if
+VerboseGC. Serial GC only.

Print summary GC information after each collection.

Setting to true sets PrintGraph=file, setting to false sets
PrintGraph=network

Host part of the address to which graphs are dumped.

Port part of the address to which graphs are dumped in binary format.

Prints the difference in the graph state caused by each phase of the
suite.

Schedule graphs as they are dumped.

Where IdealGraphVisualizer graph dumps triggered by Dump or DumpOnError
should be written.
The accepted values are:
      File - Dump IGV graphs to the local file system (see DumpPath).
   Network - Dump IGV graphs to the network destination specified by PrintGraphHost and PrintGraphPort.
             If a network connection cannot be opened, dumping falls back to file dumping. 
   Disable - Do not dump IGV graphs.

Print the shape of the heap before and after each collection, if
+VerboseGC. Serial GC only.

Print HIR along side LIR as the latter is generated

Print image object hierarchy.

Include the LIR as comments with the final assembly.

Report analysis statistics.

Print profiling information when parsing a method's bytecode

Print types used for Java synchronization.

Dump a graph even if it has not changed since it was last dumped.
Change detection is based on adding and deleting nodes or changing
inputs.

The policy to use, must be empty for automatic resolution.

Comma-separated list of analysis policies for exploring the methods in
the call graph and for inlining, empty for no policy.

Control the naming and granularity of the counters when using
ProfileAllocations.
The accepted values are:
        AllocatingMethod - a counter per method
         InstanceOrArray - one counter for all instance allocations and
                           one counter for all array allocations 
           AllocatedType - one counter per allocated type
  AllocatedTypesInMethod - one counter per allocated type, per method
 

Enable profiling of allocation sites.

Track the progress of the static analysis.

Track the creation of constant objects.

Restrict profile inference to methods matching the regex (a list of
comma separated, optionally negated filter patterns).

Enable profiling of monitor operations.

Excludes time spent in invoked methods; measures total time including
subcalls when turned off.

Value should point to a profile dump file.

Integer greater than zero representing the duration in seconds that
will be used to trigger a profile capture. Any integer less than one
disables periodic dumps.

Emit a message to stderr after dumping a profile.

Maximum depth of dependency when propagating equals property.

PullThroughPhiOptimization: Percentage in node cost graph size for the
floating node duplication budget. Computed relative to the method's
graph size.

Number of times an allocation that queues behind a GC will retry before
printing a warning. G1 GC only.

Chose the scheduling strategy for inserting the read proxies.

Re-associate loop invariants and constants.

Disable optional dead code eliminations

Select type of reference discovery policy: reference-based(0) or
referent-based(1). G1 GC only.

Comma separated list of registers that register allocation is limited
to.

The coefficient used to compute the inlining threshold; the higher, the
hard to inline.

Allow a type flow state to contain types not compatible with its
declared type.

Enable the type flow saturation analysis performance optimization.

Dynamically resize (survivor space) promotion LAB's. G1 GC only.

Dynamically resize TLAB size for threads. G1 GC only.

Try avoid unrolling vectorizable loops.

Rewrite the counter of a strip mined loop to have a 32bit type.

Minimal loop frequency for a loop to be considered for rotation.

Minimal relative frequency for a loop to be considered for rotation.

Directory where Java source-files will be placed for the debugger

Minimum vector length for matching SIMD arithmetic reduce patterns.

Allow SIMDVectorization to vectorize load to store opportunities when
there are no matching SIMD operations between load and store

Enable matching of singleton groups to increase corner-case matching

Allow load grouping to include grouping of volatile loads. Note
currently this may generate incorrect results.

Allow store grouping to include grouping of volatile writes. Note
currently this may generate incorrect results.

Set the number of dominating and dominated blocks scanned per block

Exit the VM if I can not come to a safepoint in this many nanoseconds.
0 implies forever.

Print a warning if I can not come to a safepoint in this many
nanoseconds. 0 implies forever.

Allow sampling-based profiling. Default: disabled in execution.

Object scanning in parallel

Simulation can either only process fixed nodes or schedule the graph
and also process floating nodes.

Writes to the VM log information about the compiler configuration
selected.

Print the name of each dump file path as it's created.

Controls whether the source position information of snippets and method
substitutions are exposed to HotSpot. Can be useful when profiling to
get more precise position information.

Handle simple cases for inflated monitors in the fast-path.

Use DBDS algorithm to simulate the impact of peeling on a loop.

Ignore low frequency branches during simulation.

If the previous low-level graph size of the method exceeds the
threshold, it is not inlined.

See 'DuplicationBudgetFactor': for small graphs.

Node cost graph size for a graph to be considered 'small'.

Reduces the likelihood of exploring call graphs with IR size much
larger than the root.

Enable counters for various paths in snippets.

Number of milliseconds per MB of free space in the heap. G1 GC only.

Select a strategy to mitigate speculative bounds check bypass (aka
Spectre-PHT or Spectre V1).
This is an experimental option - execution of untrusted code is not supported by GraalVM CE.
The accepted values are:
                  None - No mitigations are used in JIT compiled code.
            AllTargets - Speculative execution on all conditional branch targets is
                         stopped using speculative execution barrier instructions.
          GuardTargets - Branch targets relevant to Java memory safety are instrumented
                         with barrier instructions. This option has less performance impact
                         than AllTargets. 
  NonDeoptGuardTargets - Same as GuardTargets, except that branches which deoptimize are not
                         protected since they can not be executed repeatedly and are thus less
                         likely to be successfully exploited in an attack.
          
                         
Note that all modes except "None" will also instrument branch target blocks containing UNSAFE memory accesses
with barrier instructions.

Mask indices to scope access to allocation size after bounds check.

Move loop invariant guards (e.g., array bounds checks) out of loops.

Speculates that arrays have exact type to optimize store checks

The size of each thread stack at run-time, in bytes.

Start flight recording with options.

Stress the code emitting explicit exception throwing code.

Stress the code emitting invokes with explicit exception edges.

Stress the code by emitting reads at earliest instead of latest point.

Perform checks that guards and deopts aren't introduced in graphs that
should handle exceptions explicitly

String.indexOf invocations will be evaluated at compile time if the
receiver is a constant and its length is smaller than this value.

Force strip mining of all loops that can be strip mined.

Strip mine inverted loops.

Support OSR compilations with locks. If DeoptAfterOSR is true we can
per definition not have unbalanced enter/exits mappings. If
DeoptAfterOSR is false insert artificial monitor enters after the
OSRStart to have balanced enter/exits in the graph.

Ratio of eden/survivor space size. G1 GC only.

Allocation averaging weight. G1 GC only.

Maximum TLAB waste at a refill (internal fragmentation). G1 GC only.

Starting TLAB size (in bytes); zero means set ergonomically. G1 GC
only.

Increment allowed waste at slow allocation. G1 GC only.

Percentage of Eden that can be wasted. G1 GC only.

Target wasted space in last buffer as percent of overall allocation. G1
GC only.

Desired percentage of survivor space used after scavenge. G1 GC only.

The number of nanoseconds before tearing down an isolate gives a
failure message. 0 implies no message.

The number of nanoseconds before and between which tearing down an
isolate gives a warning message. 0 implies no warning.

Profile method execution time.

Pattern for specifying scopes in which timing is enabled. See the Dump
option for the pattern syntax. An empty value enables all timers
unconditionally.

Turn on the benchmark counters, and displays the results every n
milliseconds

Comma separated names of timers that are enabled irrespective of the
value for Time option. An empty value enables all timers
unconditionally.

Enables detailed tracing of auxiliary image events.

Enables detailed tracing of auxiliary image events.

The trace level for the bytecode parser. A value of 1 enables
instruction tracing and any greater value emits a frame state trace
just prior to each instruction trace.Instruction tracing output from
multiple compiler threads will be interleaved so use of this option
make most sense for single threaded compilation. The MethodFilter
option can be used to refine tracing to selected methods.

Print logging information for runtime code cache modifications

Print verbose logging information for every deoptimization

Print logging information for every deoptimization

Trace execution of stub used to handle an exception thrown by a callee.

Trace heap chunks during collections, if +VerboseGC and
+PrintHeapShape. Serial GC only.

Traces inlining performed during bytecode parsing.

Enable inlining decision tracing in stubs and snippets.

Enable tracing of inlining decisions.
Output format:
  compilation of 'Signature of the compilation root method':
    at 'Signature of the root method' ['Bytecode index']: <'Phase'> 'Child method signature': 'Decision made about this callsite'
      at 'Signature of the child method' ['Bytecode index']: 
         |--<'Phase 1'> 'Grandchild method signature': 'First decision made about this callsite'
         \--<'Phase 2'> 'Grandchild method signature': 'Second decision made about this callsite'
      at 'Signature of the child method' ['Bytecode index']: <'Phase'> 'Another grandchild method signature': 'The only decision made about this callsite.'

The trace level for the LIR generator

Enables tracing of profiling info when read by JVMCI.
Empty value: trace all methods
Non-empty value: trace methods whose fully qualified name contains the value.

Trace monitor operations in methods whose fully qualified name contains
this substring.

Trace monitor operations on objects whose type contains this substring.

Traces use of plugins during bytecode parsing.

Trace execution of the stub that routes an exception to a handler in
the calling frame.

Track the callers for methods and accessing methods for fields.

Enable (if Count is enabled) graph size tracking during every
duplication iteration.

Track IPEA statistics in substratePriorityInliner.

Track inlining statistics (inlining duration, call tree size, compiler
node counts, and the number of callsites). One of: none, interactive

Track the input for type flows.

Pattern for specifying scopes in which memory use tracking is enabled.
See the Dump option for the pattern syntax. An empty value enables all
memory use trackers unconditionally.

Track source stack trace where a node was inserted into the graph.

Track the NodeSourcePosition.

Graphs with less than this number of nodes are trivial and therefore
always inlined.

Loop peeling will consider any loop with a size (in terms of estimated
machine instructions) below this value to be a prime candidate for
peeling. Larger loops will only be considered for peeling if the
simulated benefit of peeling is relatively high. The larger the loop,
the greater the expected benefit has to be.

Select a compiler configuration for Truffle compilation (default: use
Graal system compiler configuration).

Maximum budget for Truffle host inlining for runtime compiled methods.

Maximum budget for Truffle host inlining for runtime compiled methods
with a BytecodeInterpreterSwitch annotation.

Determines the maximum call depth for exploration during host inlining.

Maximum number of subtree invokes for a subtree to get inlined until it
is considered too complex.

When logging is activated for this phase enables printing of only
explored, but ultimately not inlined call trees.

Whether Truffle host inlining is enabled.

Determines whether to treat final fields with default values as
constant.

PullThroughPhiOptimization: Enable floating node duplication over
multiple phi nodes at once.

PullThroughPhiOptimization: Enable floating node duplication over phis
where the target node has different phis as input.

Increases or decreases the time spent exploring inlining opportunities
under the assumption that more time results in better peak performance
and less time reduces time to reach (a lower) peak performance. The
value of the option is clamped between -1 and 1 inclusive. Anything
below 0, reduces the exploration time and anything above 0 increases
exploration time. Note that this option is only a heuristic and should
be tuned for any specific application.

The maximum number of profiled types that will be used when compiling a
profiled type check. Note that TypeCheckMinProfileHitProbability also
influences whether profiling info is used in compiled type checks.

If the probability that a type check will hit one the profiled types
(up to TypeCheckMaxHints) is below this value, the type check will be
compiled without profiling info

How many levels of inputs to print. A value of 0 prints only the target
flow.

How many levels of outputs to print. A value of 0 prints only the
target flow.

The maximum number of types recorded in a type flow. -1 indicates no
limitation.

Denotes the call graph size that is considered medium size.

The increase in estimated typical graph size after inlining, per each
extra invoke.

The maximum in estimated inlined typical graph size.

The typical graph size at which inlining pressure must start growing.

Report unresolved elements as errors.

Unroll empty loops.

Unroll inverted (tail counted) loops.

Unroll loops with multiple loop ends.

Unroll loops with multiple loop exits.

Force branch instructions to align with 32-bytes boundary, to mitigate
the jcc erratum. See
https://www.intel.com/content/dam/support/us/en/documents/processors/mitigations-jump-conditional-code-erratum.pdf
for more details. If not set explicitly, the default value will be
determined according to the CPU model.

Enables CompilationStatistics.

Dynamically choose the number of threads up to a maximum of
ParallelGCThreads that G1 will use for garbage collection work.

Use experimental Reachability Analysis instead of points-to.

Turn on graph caching.

Derive loop frequencies only from backedge frequencies instead of from
loop exit frequencies.

Flag to disable jvmstat instrumentation for performance testing.

Use priority-based inlining.

Use method summaries for Reachability Analysis.

Use a cache for snippet graphs.

Use a LRU cache for snippet templates.

Use traps for null checks instead of explicit null-checks

Use absolute path for source-filenames in VTune events.

Only generate SIMD loops for vector folds expected to iterate at least
this many times.

Enable vectorized array copy intrinsics

Enable vectorized polynomial intrinsics

Unroll vectorized loops

Enable vectorization.

Enable vectorized array initialization

Enable vectorization of conditional code.

Enable vectorization of loops with conditional deopts before writes.

Enable vectorization of loops implementing a higher-order 'fold'
function.

Enable vectorization of vector gather operations.

Enable vectorization of hashCode patterns.

Enable vectorization of integer min/max operations.

Enable vectorization of loops

Enable vectorization of loops implementing a higher-order 'map'
function.

Enable vectorization of loops with negative strides.

Enable vectorization of loops with reachability fences.

Enable detection of SIMD patterns

Enable vectorization of loops with safepoints.

Enable vectorization of sequence values.

Print more information about the heap before and after each collection.

Verify memory system after GC. G1 GC only.

Emit extra code to dynamically check monitor operations are balanced.

Verify memory system before GC. G1 GC only.

Verify memory system during GC (between phases). G1 GC only.

GC invoke count where +VerifyHeap kicks in. G1 GC only.

Perform expensive verification of graph inputs, usages, successors and
predecessors

Verify graphs often during compilation when assertions are turned on

Verify before - after relation of the relative, computed, code size of
a graph

Perform platform dependent validation of the Java heap at returns

Verify that there are no new unused nodes when performing killCFG

Run expensive checks to verify the graph after loop vectorization.

Verifies that the phase plan respects the phase ordering constraints.

Verify GC remembered sets. G1 GC only.

Add code to verify that eliminated barriers weren't needed.

Pattern for specifying scopes in which logging is enabled. See the Dump
option for the pattern syntax.

Print a warning when a missing intrinsic is seen.

Allocate code cache with write access, allowing inlining of objects

Size of young gen promotion LAB's (in HeapWords). G1 GC only.

Zero out the newly created TLAB. G1 GC only.