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