duke@435: /* drchase@5285: * Copyright (c) 2000, 2013, Oracle and/or its affiliates. All rights reserved. duke@435: * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. duke@435: * duke@435: * This code is free software; you can redistribute it and/or modify it duke@435: * under the terms of the GNU General Public License version 2 only, as duke@435: * published by the Free Software Foundation. duke@435: * duke@435: * This code is distributed in the hope that it will be useful, but WITHOUT duke@435: * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or duke@435: * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License duke@435: * version 2 for more details (a copy is included in the LICENSE file that duke@435: * accompanied this code). duke@435: * duke@435: * You should have received a copy of the GNU General Public License version duke@435: * 2 along with this work; if not, write to the Free Software Foundation, duke@435: * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. duke@435: * trims@1907: * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA trims@1907: * or visit www.oracle.com if you need additional information or have any trims@1907: * questions. duke@435: * duke@435: */ duke@435: stefank@2314: #ifndef SHARE_VM_OPTO_C2_GLOBALS_HPP stefank@2314: #define SHARE_VM_OPTO_C2_GLOBALS_HPP stefank@2314: stefank@2314: #include "runtime/globals.hpp" stefank@2314: #ifdef TARGET_ARCH_x86 stefank@2314: # include "c2_globals_x86.hpp" stefank@2314: #endif stefank@2314: #ifdef TARGET_ARCH_sparc stefank@2314: # include "c2_globals_sparc.hpp" stefank@2314: #endif bobv@2508: #ifdef TARGET_ARCH_arm bobv@2508: # include "c2_globals_arm.hpp" bobv@2508: #endif goetz@6441: #ifdef TARGET_ARCH_ppc goetz@6441: # include "c2_globals_ppc.hpp" goetz@6441: #endif stefank@2314: #ifdef TARGET_OS_FAMILY_linux stefank@2314: # include "c2_globals_linux.hpp" stefank@2314: #endif stefank@2314: #ifdef TARGET_OS_FAMILY_solaris stefank@2314: # include "c2_globals_solaris.hpp" stefank@2314: #endif stefank@2314: #ifdef TARGET_OS_FAMILY_windows stefank@2314: # include "c2_globals_windows.hpp" stefank@2314: #endif goetz@6461: #ifdef TARGET_OS_FAMILY_aix goetz@6461: # include "c2_globals_aix.hpp" goetz@6461: #endif never@3156: #ifdef TARGET_OS_FAMILY_bsd never@3156: # include "c2_globals_bsd.hpp" never@3156: #endif stefank@2314: duke@435: // duke@435: // Defines all globals flags used by the server compiler. duke@435: // duke@435: never@1515: #define C2_FLAGS(develop, develop_pd, product, product_pd, diagnostic, experimental, notproduct) \ duke@435: \ shade@4691: develop(bool, StressLCM, false, \ shade@4691: "Randomize instruction scheduling in LCM") \ shade@4691: \ shade@4691: develop(bool, StressGCM, false, \ shade@4691: "Randomize instruction scheduling in GCM") \ shade@4691: \ duke@435: notproduct(intx, CompileZapFirst, 0, \ duke@435: "If +ZapDeadCompiledLocals, " \ duke@435: "skip this many before compiling in zap calls") \ duke@435: \ duke@435: notproduct(intx, CompileZapLast, -1, \ duke@435: "If +ZapDeadCompiledLocals, " \ duke@435: "compile this many after skipping (incl. skip count, -1 = all)") \ duke@435: \ duke@435: notproduct(intx, ZapDeadCompiledLocalsFirst, 0, \ duke@435: "If +ZapDeadCompiledLocals, " \ duke@435: "skip this many before really doing it") \ duke@435: \ duke@435: notproduct(intx, ZapDeadCompiledLocalsLast, -1, \ duke@435: "If +ZapDeadCompiledLocals, " \ duke@435: "do this many after skipping (incl. skip count, -1 = all)") \ duke@435: \ duke@435: develop(intx, OptoPrologueNops, 0, \ duke@435: "Insert this many extra nop instructions " \ duke@435: "in the prologue of every nmethod") \ duke@435: \ duke@435: product_pd(intx, InteriorEntryAlignment, \ duke@435: "Code alignment for interior entry points " \ duke@435: "in generated code (in bytes)") \ duke@435: \ duke@435: product(intx, MaxLoopPad, (OptoLoopAlignment-1), \ duke@435: "Align a loop if padding size in bytes is less or equal to this value") \ duke@435: \ kvn@3882: product(intx, MaxVectorSize, 32, \ kvn@3882: "Max vector size in bytes, " \ kvn@3882: "actual size could be less depending on elements type") \ kvn@3882: \ kvn@4105: product(bool, AlignVector, true, \ kvn@3882: "Perform vector store/load alignment in loop") \ kvn@3882: \ duke@435: product(intx, NumberOfLoopInstrToAlign, 4, \ duke@435: "Number of first instructions in a loop to align") \ duke@435: \ duke@435: notproduct(intx, IndexSetWatch, 0, \ duke@435: "Trace all operations on this IndexSet (-1 means all, 0 none)") \ duke@435: \ duke@435: develop(intx, OptoNodeListSize, 4, \ duke@435: "Starting allocation size of Node_List data structures") \ duke@435: \ duke@435: develop(intx, OptoBlockListSize, 8, \ duke@435: "Starting allocation size of Block_List data structures") \ duke@435: \ duke@435: develop(intx, OptoPeepholeAt, -1, \ duke@435: "Apply peephole optimizations to this peephole rule") \ duke@435: \ duke@435: notproduct(bool, PrintIdeal, false, \ duke@435: "Print ideal graph before code generation") \ duke@435: \ duke@435: notproduct(bool, PrintOpto, false, \ duke@435: "Print compiler2 attempts") \ duke@435: \ duke@435: notproduct(bool, PrintOptoInlining, false, \ duke@435: "Print compiler2 inlining decisions") \ duke@435: \ duke@435: notproduct(bool, VerifyOpto, false, \ duke@435: "Apply more time consuming verification during compilation") \ duke@435: \ bharadwaj@4315: notproduct(bool, VerifyIdealNodeCount, false, \ bharadwaj@4315: "Verify that tracked dead ideal node count is accurate") \ bharadwaj@4315: \ bharadwaj@4315: notproduct(bool, PrintIdealNodeCount, false, \ bharadwaj@4315: "Print liveness counts of ideal nodes") \ bharadwaj@4315: \ duke@435: notproduct(bool, VerifyOptoOopOffsets, false, \ duke@435: "Check types of base addresses in field references") \ duke@435: \ duke@435: develop(bool, IdealizedNumerics, false, \ duke@435: "Check performance difference allowing FP " \ duke@435: "associativity and commutativity...") \ duke@435: \ duke@435: develop(bool, OptoBreakpoint, false, \ duke@435: "insert breakpoint at method entry") \ duke@435: \ duke@435: notproduct(bool, OptoBreakpointOSR, false, \ duke@435: "insert breakpoint at osr method entry") \ duke@435: \ duke@435: notproduct(intx, BreakAtNode, 0, \ duke@435: "Break at construction of this Node (either _idx or _debug_idx)") \ duke@435: \ duke@435: notproduct(bool, OptoBreakpointC2R, false, \ duke@435: "insert breakpoint at runtime stub entry") \ duke@435: \ duke@435: notproduct(bool, OptoNoExecute, false, \ duke@435: "Attempt to parse and compile but do not execute generated code") \ duke@435: \ duke@435: notproduct(bool, PrintOptoStatistics, false, \ duke@435: "Print New compiler statistics") \ duke@435: \ duke@435: notproduct(bool, PrintOptoAssembly, false, \ duke@435: "Print New compiler assembly output") \ duke@435: \ duke@435: develop_pd(bool, OptoPeephole, \ duke@435: "Apply peephole optimizations after register allocation") \ duke@435: \ duke@435: develop(bool, OptoRemoveUseless, true, \ duke@435: "Remove useless nodes after parsing") \ duke@435: \ duke@435: notproduct(bool, PrintFrameConverterAssembly, false, \ duke@435: "Print New compiler assembly output for frame converters") \ duke@435: \ duke@435: notproduct(bool, PrintParseStatistics, false, \ duke@435: "Print nodes, transforms and new values made per bytecode parsed")\ duke@435: \ duke@435: notproduct(bool, PrintOptoPeephole, false, \ duke@435: "Print New compiler peephole replacements") \ duke@435: \ duke@435: develop(bool, PrintCFGBlockFreq, false, \ duke@435: "Print CFG block freqencies") \ duke@435: \ duke@435: develop(bool, TraceOptoParse, false, \ duke@435: "Trace bytecode parse and control-flow merge") \ duke@435: \ duke@435: product_pd(intx, LoopUnrollLimit, \ duke@435: "Unroll loop bodies with node count less than this") \ duke@435: \ kvn@5513: product(intx, LoopMaxUnroll, 16, \ kvn@5513: "Maximum number of unrolls for main loop") \ kvn@5513: \ duke@435: product(intx, LoopUnrollMin, 4, \ duke@435: "Minimum number of unroll loop bodies before checking progress" \ duke@435: "of rounds of unroll,optimize,..") \ duke@435: \ duke@435: develop(intx, UnrollLimitForProfileCheck, 1, \ duke@435: "Don't use profile_trip_cnt() to restrict unrolling until " \ duke@435: "unrolling would push the number of unrolled iterations above " \ duke@435: "UnrollLimitForProfileCheck. A higher value allows more " \ duke@435: "unrolling. Zero acts as a very large value." ) \ duke@435: \ duke@435: product(intx, MultiArrayExpandLimit, 6, \ duke@435: "Maximum number of individual allocations in an inline-expanded " \ duke@435: "multianewarray instruction") \ duke@435: \ duke@435: notproduct(bool, TraceProfileTripCount, false, \ duke@435: "Trace profile loop trip count information") \ duke@435: \ cfang@1607: product(bool, UseLoopPredicate, true, \ cfang@1607: "Generate a predicate to select fast/slow loop versions") \ cfang@1607: \ cfang@1607: develop(bool, TraceLoopPredicate, false, \ cfang@1607: "Trace generation of loop predicates") \ cfang@1607: \ kvn@2665: develop(bool, TraceLoopOpts, false, \ kvn@2665: "Trace executed loop optimizations") \ kvn@2665: \ kvn@2877: diagnostic(bool, LoopLimitCheck, true, \ kvn@2877: "Generate a loop limits check for overflow") \ kvn@2877: \ kvn@2877: develop(bool, TraceLoopLimitCheck, false, \ kvn@2877: "Trace generation of loop limits checks") \ kvn@2877: \ kvn@2877: diagnostic(bool, RangeLimitCheck, true, \ kvn@2877: "Additional overflow checks during range check elimination") \ kvn@2877: \ kvn@2877: develop(bool, TraceRangeLimitCheck, false, \ kvn@2877: "Trace additional overflow checks in RCE") \ kvn@2877: \ kvn@2877: diagnostic(bool, UnrollLimitCheck, true, \ kvn@2877: "Additional overflow checks during loop unroll") \ kvn@2877: \ goetz@6487: /* OptimizeFill not yet supported on PowerPC. */ \ goetz@6487: product(bool, OptimizeFill, true PPC64_ONLY(&& false), \ never@2118: "convert fill/copy loops into intrinsic") \ never@2118: \ never@2118: develop(bool, TraceOptimizeFill, false, \ never@2118: "print detailed information about fill conversion") \ never@2118: \ duke@435: develop(bool, OptoCoalesce, true, \ duke@435: "Use Conservative Copy Coalescing in the Register Allocator") \ duke@435: \ duke@435: develop(bool, UseUniqueSubclasses, true, \ duke@435: "Narrow an abstract reference to the unique concrete subclass") \ duke@435: \ duke@435: develop(bool, UseExactTypes, true, \ duke@435: "Use exact types to eliminate array store checks and v-calls") \ duke@435: \ duke@435: product(intx, TrackedInitializationLimit, 50, \ duke@435: "When initializing fields, track up to this many words") \ duke@435: \ duke@435: product(bool, ReduceFieldZeroing, true, \ duke@435: "When initializing fields, try to avoid needless zeroing") \ duke@435: \ duke@435: product(bool, ReduceInitialCardMarks, true, \ duke@435: "When initializing fields, try to avoid needless card marks") \ duke@435: \ duke@435: product(bool, ReduceBulkZeroing, true, \ duke@435: "When bulk-initializing, try to avoid needless zeroing") \ duke@435: \ never@2085: product(bool, UseFPUForSpilling, false, \ never@2085: "Spill integer registers to FPU instead of stack when possible") \ never@2085: \ duke@435: develop_pd(intx, RegisterCostAreaRatio, \ duke@435: "Spill selection in reg allocator: scale area by (X/64K) before " \ duke@435: "adding cost") \ duke@435: \ duke@435: develop_pd(bool, UseCISCSpill, \ duke@435: "Use ADLC supplied cisc instructions during allocation") \ duke@435: \ duke@435: notproduct(bool, VerifyGraphEdges , false, \ duke@435: "Verify Bi-directional Edges") \ duke@435: \ duke@435: notproduct(bool, VerifyDUIterators, true, \ duke@435: "Verify the safety of all iterations of Bi-directional Edges") \ duke@435: \ duke@435: notproduct(bool, VerifyHashTableKeys, true, \ duke@435: "Verify the immutability of keys in the VN hash tables") \ duke@435: \ kvn@985: notproduct(bool, VerifyRegisterAllocator , false, \ kvn@985: "Verify Register Allocator") \ kvn@985: \ duke@435: develop_pd(intx, FLOATPRESSURE, \ duke@435: "Number of float LRG's that constitute high register pressure") \ duke@435: \ duke@435: develop_pd(intx, INTPRESSURE, \ duke@435: "Number of integer LRG's that constitute high register pressure") \ duke@435: \ duke@435: notproduct(bool, TraceOptoPipelining, false, \ duke@435: "Trace pipelining information") \ duke@435: \ duke@435: notproduct(bool, TraceOptoOutput, false, \ duke@435: "Trace pipelining information") \ duke@435: \ duke@435: product_pd(bool, OptoScheduling, \ duke@435: "Instruction Scheduling after register allocation") \ duke@435: \ duke@435: product(bool, PartialPeelLoop, true, \ duke@435: "Partial peel (rotate) loops") \ duke@435: \ duke@435: product(intx, PartialPeelNewPhiDelta, 0, \ duke@435: "Additional phis that can be created by partial peeling") \ duke@435: \ duke@435: notproduct(bool, TracePartialPeeling, false, \ duke@435: "Trace partial peeling (loop rotation) information") \ duke@435: \ duke@435: product(bool, PartialPeelAtUnsignedTests, true, \ duke@435: "Partial peel at unsigned tests if no signed test exists") \ duke@435: \ duke@435: product(bool, ReassociateInvariants, true, \ duke@435: "Enable reassociation of expressions with loop invariants.") \ duke@435: \ duke@435: product(bool, LoopUnswitching, true, \ duke@435: "Enable loop unswitching (a form of invariant test hoisting)") \ duke@435: \ duke@435: notproduct(bool, TraceLoopUnswitching, false, \ duke@435: "Trace loop unswitching") \ duke@435: \ duke@435: product(bool, UseSuperWord, true, \ duke@435: "Transform scalar operations into superword operations") \ duke@435: \ duke@435: develop(bool, SuperWordRTDepCheck, false, \ duke@435: "Enable runtime dependency checks.") \ duke@435: \ kvn@3886: notproduct(bool, TraceSuperWord, false, \ duke@435: "Trace superword transforms") \ duke@435: \ kvn@3886: notproduct(bool, TraceNewVectors, false, \ kvn@3886: "Trace creation of Vector nodes") \ kvn@3886: \ duke@435: product_pd(bool, OptoBundling, \ duke@435: "Generate nops to fill i-cache lines") \ duke@435: \ duke@435: product_pd(intx, ConditionalMoveLimit, \ duke@435: "Limit of ops to make speculative when using CMOVE") \ duke@435: \ duke@435: /* Set BranchOnRegister == false. See 4965987. */ \ duke@435: product(bool, BranchOnRegister, false, \ duke@435: "Use Sparc V9 branch-on-register opcodes") \ duke@435: \ duke@435: develop(bool, SparcV9RegsHiBitsZero, true, \ duke@435: "Assume Sparc V9 I&L registers on V8+ systems are zero-extended") \ duke@435: \ twisti@2350: product(bool, UseRDPCForConstantTableBase, false, \ twisti@2350: "Use Sparc RDPC instruction for the constant table base.") \ twisti@2350: \ duke@435: develop(intx, PrintIdealGraphLevel, 0, \ duke@435: "Print ideal graph to XML file / network interface. " \ duke@435: "By default attempts to connect to the visualizer on a socket.") \ duke@435: \ duke@435: develop(intx, PrintIdealGraphPort, 4444, \ duke@435: "Ideal graph printer to network port") \ duke@435: \ kvn@869: notproduct(ccstr, PrintIdealGraphAddress, "127.0.0.1", \ duke@435: "IP address to connect to visualizer") \ duke@435: \ kvn@869: notproduct(ccstr, PrintIdealGraphFile, NULL, \ duke@435: "File to dump ideal graph to. If set overrides the " \ duke@435: "use of the network") \ duke@435: \ duke@435: product(bool, UseBimorphicInlining, true, \ duke@435: "Profiling based inlining for two receivers") \ duke@435: \ duke@435: product(bool, UseOnlyInlinedBimorphic, true, \ duke@435: "Don't use BimorphicInlining if can't inline a second method") \ duke@435: \ duke@435: product(bool, InsertMemBarAfterArraycopy, true, \ duke@435: "Insert memory barrier after arraycopy call") \ duke@435: \ kvn@2040: develop(bool, SubsumeLoads, true, \ kvn@2040: "Attempt to compile while subsuming loads into machine instructions.") \ kvn@2040: \ kvn@2040: develop(bool, StressRecompilation, false, \ kvn@2040: "Recompile each compiled method without subsuming loads or escape analysis.") \ kvn@2040: \ duke@435: develop(intx, ImplicitNullCheckThreshold, 3, \ duke@435: "Don't do implicit null checks if NPE's in a method exceeds limit") \ duke@435: \ duke@435: product(intx, LoopOptsCount, 43, \ duke@435: "Set level of loop optimization for tier 1 compiles") \ duke@435: \ duke@435: /* controls for heat-based inlining */ \ duke@435: \ duke@435: develop(intx, NodeCountInliningCutoff, 18000, \ duke@435: "If parser node generation exceeds limit stop inlining") \ duke@435: \ duke@435: develop(intx, NodeCountInliningStep, 1000, \ duke@435: "Target size of warm calls inlined between optimization passes") \ duke@435: \ duke@435: develop(bool, InlineWarmCalls, false, \ duke@435: "Use a heat-based priority queue to govern inlining") \ duke@435: \ duke@435: develop(intx, HotCallCountThreshold, 999999, \ duke@435: "large numbers of calls (per method invocation) force hotness") \ duke@435: \ duke@435: develop(intx, HotCallProfitThreshold, 999999, \ duke@435: "highly profitable inlining opportunities force hotness") \ duke@435: \ duke@435: develop(intx, HotCallTrivialWork, -1, \ duke@435: "trivial execution time (no larger than this) forces hotness") \ duke@435: \ duke@435: develop(intx, HotCallTrivialSize, -1, \ duke@435: "trivial methods (no larger than this) force calls to be hot") \ duke@435: \ duke@435: develop(intx, WarmCallMinCount, -1, \ duke@435: "number of calls (per method invocation) to enable inlining") \ duke@435: \ duke@435: develop(intx, WarmCallMinProfit, -1, \ duke@435: "number of calls (per method invocation) to enable inlining") \ duke@435: \ duke@435: develop(intx, WarmCallMaxWork, 999999, \ duke@435: "execution time of the largest inlinable method") \ duke@435: \ duke@435: develop(intx, WarmCallMaxSize, 999999, \ duke@435: "size of the largest inlinable method") \ duke@435: \ drchase@5285: product(intx, MaxNodeLimit, 80000, \ duke@435: "Maximum number of nodes") \ duke@435: \ drchase@5285: product(intx, NodeLimitFudgeFactor, 2000, \ duke@435: "Fudge Factor for certain optimizations") \ duke@435: \ duke@435: product(bool, UseJumpTables, true, \ duke@435: "Use JumpTables instead of a binary search tree for switches") \ duke@435: \ duke@435: product(bool, UseDivMod, true, \ duke@435: "Use combined DivMod instruction if available") \ duke@435: \ adlertz@5660: product_pd(intx, MinJumpTableSize, \ duke@435: "Minimum number of targets in a generated jump table") \ duke@435: \ duke@435: product(intx, MaxJumpTableSize, 65000, \ duke@435: "Maximum number of targets in a generated jump table") \ duke@435: \ duke@435: product(intx, MaxJumpTableSparseness, 5, \ duke@435: "Maximum sparseness for jumptables") \ duke@435: \ duke@435: product(bool, EliminateLocks, true, \ duke@435: "Coarsen locks when possible") \ duke@435: \ kvn@3406: product(bool, EliminateNestedLocks, true, \ kvn@3406: "Eliminate nested locks of the same object when possible") \ kvn@3406: \ duke@435: notproduct(bool, PrintLockStatistics, false, \ duke@435: "Print precise statistics on the dynamic lock usage") \ duke@435: \ duke@435: diagnostic(bool, PrintPreciseBiasedLockingStatistics, false, \ duke@435: "Print per-lock-site statistics of biased locking in JVM") \ duke@435: \ duke@435: notproduct(bool, PrintEliminateLocks, false, \ duke@435: "Print out when locks are eliminated") \ duke@435: \ kvn@6293: product(bool, EliminateAutoBox, false, \ kvn@5110: "Control optimizations for autobox elimination") \ never@452: \ vlivanov@5658: experimental(bool, UseImplicitStableValues, false, \ vlivanov@5658: "Mark well-known stable fields as such (e.g. String.value)") \ vlivanov@5658: \ never@452: product(intx, AutoBoxCacheMax, 128, \ never@452: "Sets max value cached by the java.lang.Integer autobox cache") \ never@452: \ kvn@5110: experimental(bool, AggressiveUnboxing, false, \ kvn@5110: "Control optimizations for aggressive boxing elimination") \ kvn@5110: \ goetz@6478: develop(bool, TracePostallocExpand, false, "Trace expanding nodes after" \ goetz@6478: " register allocation.") \ goetz@6478: \ kvn@1365: product(bool, DoEscapeAnalysis, true, \ duke@435: "Perform escape analysis") \ duke@435: \ kvn@4206: develop(bool, ExitEscapeAnalysisOnTimeout, true, \ kvn@4206: "Exit or throw assert in EA when it reaches time limit") \ kvn@4206: \ duke@435: notproduct(bool, PrintEscapeAnalysis, false, \ duke@435: "Print the results of escape analysis") \ duke@435: \ duke@435: product(bool, EliminateAllocations, true, \ duke@435: "Use escape analysis to eliminate allocations") \ duke@435: \ kvn@500: notproduct(bool, PrintEliminateAllocations, false, \ kvn@500: "Print out when allocations are eliminated") \ kvn@500: \ kvn@500: product(intx, EliminateAllocationArraySizeLimit, 64, \ kvn@500: "Array size (number of elements) limit for scalar replacement") \ kvn@500: \ kvn@3309: product(bool, OptimizePtrCompare, true, \ kvn@3309: "Use escape analysis to optimize pointers compare") \ kvn@3309: \ kvn@3309: notproduct(bool, PrintOptimizePtrCompare, false, \ kvn@3309: "Print information about optimized pointers compare") \ kvn@3309: \ kvn@3651: notproduct(bool, VerifyConnectionGraph , true, \ kvn@3651: "Verify Connection Graph construction in Escape Analysis") \ kvn@3651: \ kvn@1108: product(bool, UseOptoBiasInlining, true, \ kvn@855: "Generate biased locking code in C2 ideal graph") \ kvn@855: \ never@3235: product(bool, OptimizeStringConcat, true, \ never@1515: "Optimize the construction of Strings by StringBuilder") \ never@1515: \ never@1515: notproduct(bool, PrintOptimizeStringConcat, false, \ never@1515: "Print information about transformations performed on Strings") \ never@1515: \ kvn@688: product(intx, ValueSearchLimit, 1000, \ kvn@688: "Recursion limit in PhaseMacroExpand::value_from_mem_phi") \ kvn@688: \ duke@435: product(intx, MaxLabelRootDepth, 1100, \ duke@435: "Maximum times call Label_Root to prevent stack overflow") \ kvn@590: \ kvn@590: diagnostic(intx, DominatorSearchLimit, 1000, \ kvn@590: "Iterations limit in Node::dominates") \ rasbold@853: \ rasbold@853: product(bool, BlockLayoutByFrequency, true, \ rasbold@853: "Use edge frequencies to drive block ordering") \ rasbold@853: \ rasbold@853: product(intx, BlockLayoutMinDiamondPercentage, 20, \ rasbold@853: "Miniumum %% of a successor (predecessor) for which block layout "\ rasbold@853: "a will allow a fork (join) in a single chain") \ rasbold@853: \ kvn@1108: product(bool, BlockLayoutRotateLoops, true, \ rasbold@853: "Allow back branches to be fall throughs in the block layour") \ twisti@4020: \ twisti@4020: develop(bool, InlineReflectionGetCallerClass, true, \ twisti@4020: "inline sun.reflect.Reflection.getCallerClass(), known to be part "\ twisti@4020: "of base library DLL") \ twisti@4020: \ twisti@4020: develop(bool, InlineObjectCopy, true, \ twisti@4020: "inline Object.clone and Arrays.copyOf[Range] intrinsics") \ twisti@4020: \ twisti@4020: develop(bool, SpecialStringCompareTo, true, \ twisti@4020: "special version of string compareTo") \ twisti@4020: \ twisti@4020: develop(bool, SpecialStringIndexOf, true, \ twisti@4020: "special version of string indexOf") \ twisti@4020: \ twisti@4020: develop(bool, SpecialStringEquals, true, \ twisti@4020: "special version of string equals") \ twisti@4020: \ twisti@4020: develop(bool, SpecialArraysEquals, true, \ twisti@4020: "special version of Arrays.equals(char[],char[])") \ twisti@4020: \ kvn@4479: product(bool, SpecialEncodeISOArray, true, \ kvn@4479: "special version of ISO_8859_1$Encoder.encodeISOArray") \ kvn@4479: \ twisti@4020: develop(bool, BailoutToInterpreterForThrows, false, \ twisti@4020: "Compiled methods which throws/catches exceptions will be " \ twisti@4020: "deopt and intp.") \ twisti@4020: \ twisti@4020: develop(bool, ConvertCmpD2CmpF, true, \ twisti@4020: "Convert cmpD to cmpF when one input is constant in float range") \ twisti@4020: \ twisti@4020: develop(bool, ConvertFloat2IntClipping, true, \ twisti@4020: "Convert float2int clipping idiom to integer clipping") \ twisti@4020: \ twisti@4020: develop(bool, Use24BitFPMode, true, \ twisti@4020: "Set 24-bit FPU mode on a per-compile basis ") \ twisti@4020: \ twisti@4020: develop(bool, Use24BitFP, true, \ twisti@4020: "use FP instructions that produce 24-bit precise results") \ twisti@4020: \ twisti@4020: develop(bool, MonomorphicArrayCheck, true, \ twisti@4020: "Uncommon-trap array store checks that require full type check") \ twisti@4020: \ twisti@4020: notproduct(bool, TracePhaseCCP, false, \ twisti@4020: "Print progress during Conditional Constant Propagation") \ twisti@4020: \ twisti@4020: develop(bool, PrintDominators, false, \ twisti@4020: "Print out dominator trees for GVN") \ twisti@4020: \ twisti@4020: notproduct(bool, TraceSpilling, false, \ twisti@4020: "Trace spilling") \ twisti@4020: \ twisti@4104: diagnostic(bool, TraceTypeProfile, false, \ twisti@4020: "Trace type profile") \ twisti@4020: \ twisti@4020: develop(bool, PoisonOSREntry, true, \ twisti@4020: "Detect abnormal calls to OSR code") \ twisti@4020: \ twisti@4020: product(bool, UseCondCardMark, false, \ twisti@4020: "Check for already marked card before updating card table") \ twisti@4020: \ twisti@4020: develop(bool, SoftMatchFailure, trueInProduct, \ twisti@4020: "If the DFA fails to match a node, print a message and bail out") \ twisti@4020: \ twisti@4020: develop(bool, InlineAccessors, true, \ twisti@4020: "inline accessor methods (get/set)") \ twisti@4020: \ twisti@4020: product(intx, TypeProfileMajorReceiverPercent, 90, \ twisti@4020: "% of major receiver type to all profiled receivers") \ twisti@4020: \ twisti@4020: notproduct(bool, TimeCompiler2, false, \ twisti@4020: "detailed time the compiler (requires +TimeCompiler)") \ twisti@4020: \ twisti@4020: diagnostic(bool, PrintIntrinsics, false, \ twisti@4020: "prints attempted and successful inlining of intrinsics") \ twisti@4020: \ twisti@4020: diagnostic(ccstrlist, DisableIntrinsic, "", \ twisti@4020: "do not expand intrinsics whose (internal) names appear here") \ twisti@4020: \ twisti@4020: develop(bool, StressReflectiveCode, false, \ twisti@4020: "Use inexact types at allocations, etc., to test reflection") \ twisti@4020: \ twisti@4020: diagnostic(bool, DebugInlinedCalls, true, \ twisti@4020: "If false, restricts profiled locations to the root method only") \ twisti@4020: \ twisti@4020: notproduct(bool, VerifyLoopOptimizations, false, \ twisti@4020: "verify major loop optimizations") \ twisti@4020: \ twisti@4020: diagnostic(bool, ProfileDynamicTypes, true, \ twisti@4020: "do extra type profiling and use it more aggressively") \ twisti@4020: \ twisti@4020: develop(bool, TraceIterativeGVN, false, \ twisti@4020: "Print progress during Iterative Global Value Numbering") \ twisti@4020: \ twisti@4020: develop(bool, VerifyIterativeGVN, false, \ twisti@4020: "Verify Def-Use modifications during sparse Iterative Global " \ twisti@4020: "Value Numbering") \ twisti@4020: \ twisti@4020: notproduct(bool, TraceCISCSpill, false, \ twisti@4020: "Trace allocators use of cisc spillable instructions") \ twisti@4020: \ twisti@4020: product(bool, SplitIfBlocks, true, \ twisti@4020: "Clone compares and control flow through merge points to fold " \ twisti@4020: "some branches") \ twisti@4020: \ twisti@4020: develop(intx, FreqCountInvocations, 1, \ twisti@4020: "Scaling factor for branch frequencies (deprecated)") \ twisti@4020: \ twisti@4020: product(intx, AliasLevel, 3, \ twisti@4020: "0 for no aliasing, 1 for oop/field/static/array split, " \ twisti@4020: "2 for class split, 3 for unique instances") \ twisti@4020: \ twisti@4020: develop(bool, VerifyAliases, false, \ twisti@4020: "perform extra checks on the results of alias analysis") \ roland@4409: \ roland@4409: product(bool, IncrementalInline, true, \ roland@4409: "do post parse inlining") \ roland@4409: \ roland@4409: develop(bool, AlwaysIncrementalInline, false, \ roland@4409: "do all inlining incrementally") \ roland@4409: \ roland@4409: product(intx, LiveNodeCountInliningCutoff, 20000, \ roland@4409: "max number of live nodes in a method") \ roland@4589: \ roland@4589: diagnostic(bool, OptimizeExpensiveOps, true, \ roland@4589: "Find best control for expensive operations") \ rbackman@5791: \ rbackman@6152: experimental(bool, UseMathExactIntrinsics, false, \ roland@5981: "Enables intrinsification of various java.lang.Math functions") \ roland@5981: \ roland@5981: experimental(bool, ReplaceInParentMaps, false, \ roland@5991: "Propagate type improvements in callers of inlinee if possible") \ roland@5991: \ roland@5991: experimental(bool, UseTypeSpeculation, false, \ goetz@6490: "Speculatively propagate types from profiles") \ goetz@6490: \ goetz@6490: product_pd(bool, TrapBasedRangeChecks, \ goetz@6490: "Generate code for range checks that uses a cmp and trap " \ goetz@6490: "instruction raising SIGTRAP. Used on PPC64.") \ duke@435: never@1515: C2_FLAGS(DECLARE_DEVELOPER_FLAG, DECLARE_PD_DEVELOPER_FLAG, DECLARE_PRODUCT_FLAG, DECLARE_PD_PRODUCT_FLAG, DECLARE_DIAGNOSTIC_FLAG, DECLARE_EXPERIMENTAL_FLAG, DECLARE_NOTPRODUCT_FLAG) stefank@2314: stefank@2314: #endif // SHARE_VM_OPTO_C2_GLOBALS_HPP