3619N/A * Copyright (c) 2000, 2012, Oracle and/or its affiliates. All rights reserved. 0N/A * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 0N/A * This code is free software; you can redistribute it and/or modify it 0N/A * under the terms of the GNU General Public License version 2 only, as 0N/A * published by the Free Software Foundation. 0N/A * This code is distributed in the hope that it will be useful, but WITHOUT 0N/A * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 0N/A * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 0N/A * version 2 for more details (a copy is included in the LICENSE file that 0N/A * accompanied this code). 0N/A * You should have received a copy of the GNU General Public License version 0N/A * 2 along with this work; if not, write to the Free Software Foundation, 0N/A * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 1472N/A * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 0N/A// Defines all globals flags used by the server compiler. 0N/A "If +ZapDeadCompiledLocals, " \
0N/A "skip this many before compiling in zap calls") \
0N/A "If +ZapDeadCompiledLocals, " \
0N/A "compile this many after skipping (incl. skip count, -1 = all)") \
0N/A "If +ZapDeadCompiledLocals, " \
0N/A "skip this many before really doing it") \
0N/A "If +ZapDeadCompiledLocals, " \
0N/A "do this many after skipping (incl. skip count, -1 = all)") \
0N/A "Insert this many extra nop instructions " \
0N/A "in the prologue of every nmethod") \
0N/A "Code alignment for interior entry points " \
0N/A "in generated code (in bytes)") \
0N/A "Align a loop if padding size in bytes is less or equal to this value") \
3845N/A "Max vector size in bytes, " \
3845N/A "actual size could be less depending on elements type") \
0N/A "Number of first instructions in a loop to align") \
0N/A "Trace all operations on this IndexSet (-1 means all, 0 none)") \
0N/A "Starting allocation size of Node_List data structures") \
0N/A "Starting allocation size of Block_List data structures") \
0N/A "Apply peephole optimizations to this peephole rule") \
0N/A "Print ideal graph before code generation") \
0N/A "Print compiler2 attempts") \
0N/A "Print compiler2 inlining decisions") \
0N/A "Apply more time consuming verification during compilation") \
4123N/A "Verify that tracked dead ideal node count is accurate") \
4123N/A "Print liveness counts of ideal nodes") \
0N/A "Check types of base addresses in field references") \
0N/A "Check performance difference allowing FP " \
0N/A "associativity and commutativity...") \
0N/A "insert breakpoint at method entry") \
0N/A "insert breakpoint at osr method entry") \
0N/A "Break at construction of this Node (either _idx or _debug_idx)") \
0N/A "insert breakpoint at runtime stub entry") \
0N/A "Attempt to parse and compile but do not execute generated code") \
0N/A "Print New compiler statistics") \
0N/A "Print New compiler assembly output") \
0N/A "Apply peephole optimizations after register allocation") \
0N/A "Remove useless nodes after parsing") \
0N/A "Print New compiler assembly output for frame converters") \
0N/A "Print nodes, transforms and new values made per bytecode parsed")\
0N/A "Print New compiler peephole replacements") \
0N/A "Print CFG block freqencies") \
0N/A "Trace bytecode parse and control-flow merge") \
0N/A "Unroll loop bodies with node count less than this") \
0N/A "Minimum number of unroll loop bodies before checking progress" \
0N/A "of rounds of unroll,optimize,..") \
0N/A "Don't use profile_trip_cnt() to restrict unrolling until " \
0N/A "unrolling would push the number of unrolled iterations above " \
0N/A "UnrollLimitForProfileCheck. A higher value allows more " \
0N/A "unrolling. Zero acts as a very large value." ) \
0N/A "Maximum number of individual allocations in an inline-expanded " \
0N/A "multianewarray instruction") \
0N/A "Trace profile loop trip count information") \
1172N/A "Trace generation of loop predicates") \
2230N/A "Trace executed loop optimizations") \
2442N/A "Generate a loop limits check for overflow") \
2442N/A "Trace generation of loop limits checks") \
2442N/A "Additional overflow checks during range check elimination") \
2442N/A "Trace additional overflow checks in RCE") \
2442N/A "Additional overflow checks during loop unroll") \
1683N/A "print detailed information about fill conversion") \
0N/A "Use Conservative Copy Coalescing in the Register Allocator") \
0N/A "Narrow an abstract reference to the unique concrete subclass") \
0N/A "Use exact types to eliminate array store checks and v-calls") \
0N/A "When initializing fields, track up to this many words") \
0N/A "When initializing fields, try to avoid needless zeroing") \
0N/A "When initializing fields, try to avoid needless card marks") \
0N/A "When bulk-initializing, try to avoid needless zeroing") \
1650N/A "Spill integer registers to FPU instead of stack when possible") \
0N/A "Spill selection in reg allocator: scale area by (X/64K) before " \
0N/A "Use ADLC supplied cisc instructions during allocation") \
0N/A "Verify Bi-directional Edges") \
0N/A "Verify the safety of all iterations of Bi-directional Edges") \
0N/A "Verify the immutability of keys in the VN hash tables") \
550N/A "Verify Register Allocator") \
0N/A "Number of float LRG's that constitute high register pressure") \
0N/A "Number of integer LRG's that constitute high register pressure") \
0N/A "Trace pipelining information") \
0N/A "Trace pipelining information") \
0N/A "Instruction Scheduling after register allocation") \
0N/A "Partial peel (rotate) loops") \
0N/A "Additional phis that can be created by partial peeling") \
0N/A "Trace partial peeling (loop rotation) information") \
0N/A "Partial peel at unsigned tests if no signed test exists") \
0N/A "Enable reassociation of expressions with loop invariants.") \
0N/A "Enable loop unswitching (a form of invariant test hoisting)") \
0N/A "Trace loop unswitching") \
0N/A "Transform scalar operations into superword operations") \
0N/A "Enable runtime dependency checks.") \
0N/A "Trace superword transforms") \
3849N/A "Trace creation of Vector nodes") \
0N/A "Generate nops to fill i-cache lines") \
0N/A "Limit of ops to make speculative when using CMOVE") \
0N/A /* Set BranchOnRegister == false. See 4965987. */ \
0N/A "Use Sparc V9 branch-on-register opcodes") \
0N/A "Assume Sparc V9 I&L registers on V8+ systems are zero-extended") \
1915N/A "Use Sparc RDPC instruction for the constant table base.") \
0N/A "Print ideal graph to XML file / network interface. " \
0N/A "By default attempts to connect to the visualizer on a socket.") \
0N/A "Ideal graph printer to network port") \
0N/A "IP address to connect to visualizer") \
0N/A "File to dump ideal graph to. If set overrides the " \
0N/A "use of the network") \
0N/A "Enable the 1.3 inlining strategy") \
0N/A "Profiling based inlining for two receivers") \
0N/A "Don't use BimorphicInlining if can't inline a second method") \
0N/A "Insert memory barrier after arraycopy call") \
1605N/A "Attempt to compile while subsuming loads into machine instructions.") \
1605N/A "Recompile each compiled method without subsuming loads or escape analysis.") \
0N/A "Don't do implicit null checks if NPE's in a method exceeds limit") \
0N/A "Set level of loop optimization for tier 1 compiles") \
0N/A /* controls for heat-based inlining */ \
0N/A "If parser node generation exceeds limit stop inlining") \
0N/A "Target size of warm calls inlined between optimization passes") \
0N/A "Use a heat-based priority queue to govern inlining") \
0N/A "large numbers of calls (per method invocation) force hotness") \
0N/A "highly profitable inlining opportunities force hotness") \
0N/A "trivial execution time (no larger than this) forces hotness") \
0N/A "trivial methods (no larger than this) force calls to be hot") \
0N/A "number of calls (per method invocation) to enable inlining") \
0N/A "number of calls (per method invocation) to enable inlining") \
0N/A "execution time of the largest inlinable method") \
0N/A "size of the largest inlinable method") \
0N/A "Maximum number of nodes") \
0N/A "Fudge Factor for certain optimizations") \
0N/A "Use JumpTables instead of a binary search tree for switches") \
0N/A "Use combined DivMod instruction if available") \
0N/A "Minimum number of targets in a generated jump table") \
0N/A "Maximum number of targets in a generated jump table") \
0N/A "Maximum sparseness for jumptables") \
0N/A "Coarsen locks when possible") \
3057N/A "Eliminate nested locks of the same object when possible") \
0N/A "Print precise statistics on the dynamic lock usage") \
0N/A "Print per-lock-site statistics of biased locking in JVM") \
0N/A "Print out when locks are eliminated") \
17N/A "Private flag to control optimizations for autobox elimination") \
17N/A "Sets max value cached by the java.lang.Integer autobox cache") \
0N/A "Perform escape analysis") \
4040N/A "Exit or throw assert in EA when it reaches time limit") \
0N/A "Print the results of escape analysis") \
0N/A "Use escape analysis to eliminate allocations") \
65N/A "Print out when allocations are eliminated") \
65N/A "Array size (number of elements) limit for scalar replacement") \
2956N/A "Use escape analysis to optimize pointers compare") \
2956N/A "Print information about optimized pointers compare") \
3619N/A "Verify Connection Graph construction in Escape Analysis") \
420N/A "Generate biased locking code in C2 ideal graph") \
1080N/A "Optimize the construction of Strings by StringBuilder") \
1080N/A "Print information about transformations performed on Strings") \
253N/A "Recursion limit in PhaseMacroExpand::value_from_mem_phi") \
0N/A "Maximum times call Label_Root to prevent stack overflow") \
155N/A "Iterations limit in Node::dominates") \
418N/A "Use edge frequencies to drive block ordering") \
418N/A "Miniumum %% of a successor (predecessor) for which block layout "\
418N/A "a will allow a fork (join) in a single chain") \
418N/A "Allow back branches to be fall throughs in the block layour") \
3983N/A "inline sun.reflect.Reflection.getCallerClass(), known to be part "\
3983N/A "special version of string compareTo") \
3983N/A "special version of string indexOf") \
3983N/A "special version of string equals") \
3983N/A "special version of Arrays.equals(char[],char[])") \
3983N/A "Convert cmpD to cmpF when one input is constant in float range") \
3983N/A "Convert float2int clipping idiom to integer clipping") \
3983N/A "Set 24-bit FPU mode on a per-compile basis ") \
3983N/A "use FP instructions that produce 24-bit precise results") \
3983N/A "Uncommon-trap array store checks that require full type check") \
3983N/A "Print progress during Conditional Constant Propagation") \
3983N/A "Print out dominator trees for GVN") \
3983N/A "Detect abnormal calls to OSR code") \
3983N/A "Check for already marked card before updating card table") \
3983N/A "If the DFA fails to match a node, print a message and bail out") \
3983N/A "% of major receiver type to all profiled receivers") \
3983N/A "detailed time the compiler (requires +TimeCompiler)") \
3983N/A "prints attempted and successful inlining of intrinsics") \
3983N/A "do not expand intrinsics whose (internal) names appear here") \
3983N/A "Use inexact types at allocations, etc., to test reflection") \
3983N/A "If false, restricts profiled locations to the root method only") \
3983N/A "verify major loop optimizations") \
3983N/A "do extra type profiling and use it more aggressively") \
3983N/A "Print progress during Iterative Global Value Numbering") \
3983N/A "Verify Def-Use modifications during sparse Iterative Global " \
3983N/A "Trace allocators use of cisc spillable instructions") \
3983N/A "Clone compares and control flow through merge points to fold " \
3983N/A "Scaling factor for branch frequencies (deprecated)") \
3983N/A "2 for class split, 3 for unique instances") \
3983N/A "perform extra checks on the results of alias analysis") \
4132N/A "do post parse inlining") \
4132N/A "do all inlining incrementally") \
4132N/A "max number of live nodes in a method") \
4321N/A "Find best control for expensive operations") \
1879N/A#
endif // SHARE_VM_OPTO_C2_GLOBALS_HPP