annotate src/share/vm/opto/c2_globals.hpp @ 196:d1605aabd0a1

6719955: Update copyright year Summary: Update copyright year for files that have been modified in 2008 Reviewed-by: ohair, tbell
author xdono
date Wed, 02 Jul 2008 12:55:16 -0700
parents 723be81c1212
children 4a4c365f777d
rev   line source
duke@0 1 /*
xdono@196 2 * Copyright 2000-2008 Sun Microsystems, Inc. All Rights Reserved.
duke@0 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
duke@0 4 *
duke@0 5 * This code is free software; you can redistribute it and/or modify it
duke@0 6 * under the terms of the GNU General Public License version 2 only, as
duke@0 7 * published by the Free Software Foundation.
duke@0 8 *
duke@0 9 * This code is distributed in the hope that it will be useful, but WITHOUT
duke@0 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
duke@0 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
duke@0 12 * version 2 for more details (a copy is included in the LICENSE file that
duke@0 13 * accompanied this code).
duke@0 14 *
duke@0 15 * You should have received a copy of the GNU General Public License version
duke@0 16 * 2 along with this work; if not, write to the Free Software Foundation,
duke@0 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
duke@0 18 *
duke@0 19 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
duke@0 20 * CA 95054 USA or visit www.sun.com if you need additional information or
duke@0 21 * have any questions.
duke@0 22 *
duke@0 23 */
duke@0 24
duke@0 25 //
duke@0 26 // Defines all globals flags used by the server compiler.
duke@0 27 //
duke@0 28
duke@0 29 #define C2_FLAGS(develop, develop_pd, product, product_pd, diagnostic, notproduct) \
duke@0 30 \
duke@0 31 notproduct(intx, CompileZapFirst, 0, \
duke@0 32 "If +ZapDeadCompiledLocals, " \
duke@0 33 "skip this many before compiling in zap calls") \
duke@0 34 \
duke@0 35 notproduct(intx, CompileZapLast, -1, \
duke@0 36 "If +ZapDeadCompiledLocals, " \
duke@0 37 "compile this many after skipping (incl. skip count, -1 = all)") \
duke@0 38 \
duke@0 39 notproduct(intx, ZapDeadCompiledLocalsFirst, 0, \
duke@0 40 "If +ZapDeadCompiledLocals, " \
duke@0 41 "skip this many before really doing it") \
duke@0 42 \
duke@0 43 notproduct(intx, ZapDeadCompiledLocalsLast, -1, \
duke@0 44 "If +ZapDeadCompiledLocals, " \
duke@0 45 "do this many after skipping (incl. skip count, -1 = all)") \
duke@0 46 \
duke@0 47 develop(intx, OptoPrologueNops, 0, \
duke@0 48 "Insert this many extra nop instructions " \
duke@0 49 "in the prologue of every nmethod") \
duke@0 50 \
duke@0 51 product_pd(intx, InteriorEntryAlignment, \
duke@0 52 "Code alignment for interior entry points " \
duke@0 53 "in generated code (in bytes)") \
duke@0 54 \
duke@0 55 product_pd(intx, OptoLoopAlignment, \
duke@0 56 "Align inner loops to zero relative to this modulus") \
duke@0 57 \
duke@0 58 product(intx, MaxLoopPad, (OptoLoopAlignment-1), \
duke@0 59 "Align a loop if padding size in bytes is less or equal to this value") \
duke@0 60 \
duke@0 61 product(intx, NumberOfLoopInstrToAlign, 4, \
duke@0 62 "Number of first instructions in a loop to align") \
duke@0 63 \
duke@0 64 notproduct(intx, IndexSetWatch, 0, \
duke@0 65 "Trace all operations on this IndexSet (-1 means all, 0 none)") \
duke@0 66 \
duke@0 67 develop(intx, OptoNodeListSize, 4, \
duke@0 68 "Starting allocation size of Node_List data structures") \
duke@0 69 \
duke@0 70 develop(intx, OptoBlockListSize, 8, \
duke@0 71 "Starting allocation size of Block_List data structures") \
duke@0 72 \
duke@0 73 develop(intx, OptoPeepholeAt, -1, \
duke@0 74 "Apply peephole optimizations to this peephole rule") \
duke@0 75 \
duke@0 76 notproduct(bool, PrintIdeal, false, \
duke@0 77 "Print ideal graph before code generation") \
duke@0 78 \
duke@0 79 notproduct(bool, PrintOpto, false, \
duke@0 80 "Print compiler2 attempts") \
duke@0 81 \
duke@0 82 notproduct(bool, PrintOptoInlining, false, \
duke@0 83 "Print compiler2 inlining decisions") \
duke@0 84 \
duke@0 85 notproduct(bool, VerifyOpto, false, \
duke@0 86 "Apply more time consuming verification during compilation") \
duke@0 87 \
duke@0 88 notproduct(bool, VerifyOptoOopOffsets, false, \
duke@0 89 "Check types of base addresses in field references") \
duke@0 90 \
duke@0 91 develop(bool, IdealizedNumerics, false, \
duke@0 92 "Check performance difference allowing FP " \
duke@0 93 "associativity and commutativity...") \
duke@0 94 \
duke@0 95 develop(bool, OptoBreakpoint, false, \
duke@0 96 "insert breakpoint at method entry") \
duke@0 97 \
duke@0 98 notproduct(bool, OptoBreakpointOSR, false, \
duke@0 99 "insert breakpoint at osr method entry") \
duke@0 100 \
duke@0 101 notproduct(intx, BreakAtNode, 0, \
duke@0 102 "Break at construction of this Node (either _idx or _debug_idx)") \
duke@0 103 \
duke@0 104 notproduct(bool, OptoBreakpointC2R, false, \
duke@0 105 "insert breakpoint at runtime stub entry") \
duke@0 106 \
duke@0 107 notproduct(bool, OptoNoExecute, false, \
duke@0 108 "Attempt to parse and compile but do not execute generated code") \
duke@0 109 \
duke@0 110 notproduct(bool, PrintOptoStatistics, false, \
duke@0 111 "Print New compiler statistics") \
duke@0 112 \
duke@0 113 notproduct(bool, PrintOptoAssembly, false, \
duke@0 114 "Print New compiler assembly output") \
duke@0 115 \
duke@0 116 develop_pd(bool, OptoPeephole, \
duke@0 117 "Apply peephole optimizations after register allocation") \
duke@0 118 \
duke@0 119 develop(bool, OptoRemoveUseless, true, \
duke@0 120 "Remove useless nodes after parsing") \
duke@0 121 \
duke@0 122 notproduct(bool, PrintFrameConverterAssembly, false, \
duke@0 123 "Print New compiler assembly output for frame converters") \
duke@0 124 \
duke@0 125 notproduct(bool, PrintParseStatistics, false, \
duke@0 126 "Print nodes, transforms and new values made per bytecode parsed")\
duke@0 127 \
duke@0 128 notproduct(bool, PrintOptoPeephole, false, \
duke@0 129 "Print New compiler peephole replacements") \
duke@0 130 \
duke@0 131 develop(bool, PrintCFGBlockFreq, false, \
duke@0 132 "Print CFG block freqencies") \
duke@0 133 \
duke@0 134 develop(bool, TraceOptoParse, false, \
duke@0 135 "Trace bytecode parse and control-flow merge") \
duke@0 136 \
duke@0 137 product_pd(intx, LoopUnrollLimit, \
duke@0 138 "Unroll loop bodies with node count less than this") \
duke@0 139 \
duke@0 140 product(intx, LoopUnrollMin, 4, \
duke@0 141 "Minimum number of unroll loop bodies before checking progress" \
duke@0 142 "of rounds of unroll,optimize,..") \
duke@0 143 \
duke@0 144 develop(intx, UnrollLimitForProfileCheck, 1, \
duke@0 145 "Don't use profile_trip_cnt() to restrict unrolling until " \
duke@0 146 "unrolling would push the number of unrolled iterations above " \
duke@0 147 "UnrollLimitForProfileCheck. A higher value allows more " \
duke@0 148 "unrolling. Zero acts as a very large value." ) \
duke@0 149 \
duke@0 150 product(intx, MultiArrayExpandLimit, 6, \
duke@0 151 "Maximum number of individual allocations in an inline-expanded " \
duke@0 152 "multianewarray instruction") \
duke@0 153 \
duke@0 154 notproduct(bool, TraceProfileTripCount, false, \
duke@0 155 "Trace profile loop trip count information") \
duke@0 156 \
duke@0 157 develop(bool, OptoCoalesce, true, \
duke@0 158 "Use Conservative Copy Coalescing in the Register Allocator") \
duke@0 159 \
duke@0 160 develop(bool, UseUniqueSubclasses, true, \
duke@0 161 "Narrow an abstract reference to the unique concrete subclass") \
duke@0 162 \
duke@0 163 develop(bool, UseExactTypes, true, \
duke@0 164 "Use exact types to eliminate array store checks and v-calls") \
duke@0 165 \
duke@0 166 product(intx, TrackedInitializationLimit, 50, \
duke@0 167 "When initializing fields, track up to this many words") \
duke@0 168 \
duke@0 169 product(bool, ReduceFieldZeroing, true, \
duke@0 170 "When initializing fields, try to avoid needless zeroing") \
duke@0 171 \
duke@0 172 product(bool, ReduceInitialCardMarks, true, \
duke@0 173 "When initializing fields, try to avoid needless card marks") \
duke@0 174 \
duke@0 175 product(bool, ReduceBulkZeroing, true, \
duke@0 176 "When bulk-initializing, try to avoid needless zeroing") \
duke@0 177 \
duke@0 178 develop_pd(intx, RegisterCostAreaRatio, \
duke@0 179 "Spill selection in reg allocator: scale area by (X/64K) before " \
duke@0 180 "adding cost") \
duke@0 181 \
duke@0 182 develop_pd(bool, UseCISCSpill, \
duke@0 183 "Use ADLC supplied cisc instructions during allocation") \
duke@0 184 \
duke@0 185 notproduct(bool, VerifyGraphEdges , false, \
duke@0 186 "Verify Bi-directional Edges") \
duke@0 187 \
duke@0 188 notproduct(bool, VerifyDUIterators, true, \
duke@0 189 "Verify the safety of all iterations of Bi-directional Edges") \
duke@0 190 \
duke@0 191 notproduct(bool, VerifyHashTableKeys, true, \
duke@0 192 "Verify the immutability of keys in the VN hash tables") \
duke@0 193 \
duke@0 194 develop_pd(intx, FLOATPRESSURE, \
duke@0 195 "Number of float LRG's that constitute high register pressure") \
duke@0 196 \
duke@0 197 develop_pd(intx, INTPRESSURE, \
duke@0 198 "Number of integer LRG's that constitute high register pressure") \
duke@0 199 \
duke@0 200 notproduct(bool, TraceOptoPipelining, false, \
duke@0 201 "Trace pipelining information") \
duke@0 202 \
duke@0 203 notproduct(bool, TraceOptoOutput, false, \
duke@0 204 "Trace pipelining information") \
duke@0 205 \
duke@0 206 product_pd(bool, OptoScheduling, \
duke@0 207 "Instruction Scheduling after register allocation") \
duke@0 208 \
duke@0 209 product(bool, PartialPeelLoop, true, \
duke@0 210 "Partial peel (rotate) loops") \
duke@0 211 \
duke@0 212 product(intx, PartialPeelNewPhiDelta, 0, \
duke@0 213 "Additional phis that can be created by partial peeling") \
duke@0 214 \
duke@0 215 notproduct(bool, TracePartialPeeling, false, \
duke@0 216 "Trace partial peeling (loop rotation) information") \
duke@0 217 \
duke@0 218 product(bool, PartialPeelAtUnsignedTests, true, \
duke@0 219 "Partial peel at unsigned tests if no signed test exists") \
duke@0 220 \
duke@0 221 product(bool, ReassociateInvariants, true, \
duke@0 222 "Enable reassociation of expressions with loop invariants.") \
duke@0 223 \
duke@0 224 product(bool, LoopUnswitching, true, \
duke@0 225 "Enable loop unswitching (a form of invariant test hoisting)") \
duke@0 226 \
duke@0 227 notproduct(bool, TraceLoopUnswitching, false, \
duke@0 228 "Trace loop unswitching") \
duke@0 229 \
duke@0 230 product(bool, UseSuperWord, true, \
duke@0 231 "Transform scalar operations into superword operations") \
duke@0 232 \
duke@0 233 develop(bool, SuperWordRTDepCheck, false, \
duke@0 234 "Enable runtime dependency checks.") \
duke@0 235 \
duke@0 236 product(bool, TraceSuperWord, false, \
duke@0 237 "Trace superword transforms") \
duke@0 238 \
duke@0 239 product_pd(bool, OptoBundling, \
duke@0 240 "Generate nops to fill i-cache lines") \
duke@0 241 \
duke@0 242 product_pd(intx, ConditionalMoveLimit, \
duke@0 243 "Limit of ops to make speculative when using CMOVE") \
duke@0 244 \
duke@0 245 /* Set BranchOnRegister == false. See 4965987. */ \
duke@0 246 product(bool, BranchOnRegister, false, \
duke@0 247 "Use Sparc V9 branch-on-register opcodes") \
duke@0 248 \
duke@0 249 develop(bool, SparcV9RegsHiBitsZero, true, \
duke@0 250 "Assume Sparc V9 I&L registers on V8+ systems are zero-extended") \
duke@0 251 \
duke@0 252 develop(intx, PrintIdealGraphLevel, 0, \
duke@0 253 "Print ideal graph to XML file / network interface. " \
duke@0 254 "By default attempts to connect to the visualizer on a socket.") \
duke@0 255 \
duke@0 256 develop(intx, PrintIdealGraphPort, 4444, \
duke@0 257 "Ideal graph printer to network port") \
duke@0 258 \
duke@0 259 develop(ccstr, PrintIdealGraphAddress, "127.0.0.1", \
duke@0 260 "IP address to connect to visualizer") \
duke@0 261 \
duke@0 262 develop(ccstr, PrintIdealGraphFile, NULL, \
duke@0 263 "File to dump ideal graph to. If set overrides the " \
duke@0 264 "use of the network") \
duke@0 265 \
duke@0 266 product(bool, UseOldInlining, true, \
duke@0 267 "Enable the 1.3 inlining strategy") \
duke@0 268 \
duke@0 269 product(bool, UseBimorphicInlining, true, \
duke@0 270 "Profiling based inlining for two receivers") \
duke@0 271 \
duke@0 272 product(bool, UseOnlyInlinedBimorphic, true, \
duke@0 273 "Don't use BimorphicInlining if can't inline a second method") \
duke@0 274 \
duke@0 275 product(bool, InsertMemBarAfterArraycopy, true, \
duke@0 276 "Insert memory barrier after arraycopy call") \
duke@0 277 \
duke@0 278 /* controls for tier 1 compilations */ \
duke@0 279 \
duke@0 280 develop(bool, Tier1CountInvocations, true, \
duke@0 281 "Generate code, during tier 1, to update invocation counter") \
duke@0 282 \
duke@0 283 product(intx, Tier1Inline, false, \
duke@0 284 "enable inlining during tier 1") \
duke@0 285 \
duke@0 286 product(intx, Tier1MaxInlineSize, 8, \
duke@0 287 "maximum bytecode size of a method to be inlined, during tier 1") \
duke@0 288 \
duke@0 289 product(intx, Tier1FreqInlineSize, 35, \
duke@0 290 "max bytecode size of a frequent method to be inlined, tier 1") \
duke@0 291 \
duke@0 292 develop(intx, ImplicitNullCheckThreshold, 3, \
duke@0 293 "Don't do implicit null checks if NPE's in a method exceeds limit") \
duke@0 294 \
duke@0 295 /* controls for loop optimization */ \
duke@0 296 product(intx, Tier1LoopOptsCount, 0, \
duke@0 297 "Set level of loop optimization for tier 1 compiles") \
duke@0 298 \
duke@0 299 product(intx, LoopOptsCount, 43, \
duke@0 300 "Set level of loop optimization for tier 1 compiles") \
duke@0 301 \
duke@0 302 /* controls for heat-based inlining */ \
duke@0 303 \
duke@0 304 develop(intx, NodeCountInliningCutoff, 18000, \
duke@0 305 "If parser node generation exceeds limit stop inlining") \
duke@0 306 \
duke@0 307 develop(intx, NodeCountInliningStep, 1000, \
duke@0 308 "Target size of warm calls inlined between optimization passes") \
duke@0 309 \
duke@0 310 develop(bool, InlineWarmCalls, false, \
duke@0 311 "Use a heat-based priority queue to govern inlining") \
duke@0 312 \
duke@0 313 develop(intx, HotCallCountThreshold, 999999, \
duke@0 314 "large numbers of calls (per method invocation) force hotness") \
duke@0 315 \
duke@0 316 develop(intx, HotCallProfitThreshold, 999999, \
duke@0 317 "highly profitable inlining opportunities force hotness") \
duke@0 318 \
duke@0 319 develop(intx, HotCallTrivialWork, -1, \
duke@0 320 "trivial execution time (no larger than this) forces hotness") \
duke@0 321 \
duke@0 322 develop(intx, HotCallTrivialSize, -1, \
duke@0 323 "trivial methods (no larger than this) force calls to be hot") \
duke@0 324 \
duke@0 325 develop(intx, WarmCallMinCount, -1, \
duke@0 326 "number of calls (per method invocation) to enable inlining") \
duke@0 327 \
duke@0 328 develop(intx, WarmCallMinProfit, -1, \
duke@0 329 "number of calls (per method invocation) to enable inlining") \
duke@0 330 \
duke@0 331 develop(intx, WarmCallMaxWork, 999999, \
duke@0 332 "execution time of the largest inlinable method") \
duke@0 333 \
duke@0 334 develop(intx, WarmCallMaxSize, 999999, \
duke@0 335 "size of the largest inlinable method") \
duke@0 336 \
duke@0 337 product(intx, MaxNodeLimit, 65000, \
duke@0 338 "Maximum number of nodes") \
duke@0 339 \
duke@0 340 product(intx, NodeLimitFudgeFactor, 1000, \
duke@0 341 "Fudge Factor for certain optimizations") \
duke@0 342 \
duke@0 343 product(bool, UseJumpTables, true, \
duke@0 344 "Use JumpTables instead of a binary search tree for switches") \
duke@0 345 \
duke@0 346 product(bool, UseDivMod, true, \
duke@0 347 "Use combined DivMod instruction if available") \
duke@0 348 \
duke@0 349 product(intx, MinJumpTableSize, 18, \
duke@0 350 "Minimum number of targets in a generated jump table") \
duke@0 351 \
duke@0 352 product(intx, MaxJumpTableSize, 65000, \
duke@0 353 "Maximum number of targets in a generated jump table") \
duke@0 354 \
duke@0 355 product(intx, MaxJumpTableSparseness, 5, \
duke@0 356 "Maximum sparseness for jumptables") \
duke@0 357 \
duke@0 358 product(bool, EliminateLocks, true, \
duke@0 359 "Coarsen locks when possible") \
duke@0 360 \
duke@0 361 notproduct(bool, PrintLockStatistics, false, \
duke@0 362 "Print precise statistics on the dynamic lock usage") \
duke@0 363 \
duke@0 364 diagnostic(bool, PrintPreciseBiasedLockingStatistics, false, \
duke@0 365 "Print per-lock-site statistics of biased locking in JVM") \
duke@0 366 \
duke@0 367 notproduct(bool, PrintEliminateLocks, false, \
duke@0 368 "Print out when locks are eliminated") \
duke@0 369 \
never@17 370 diagnostic(bool, EliminateAutoBox, false, \
never@17 371 "Private flag to control optimizations for autobox elimination") \
never@17 372 \
never@17 373 product(intx, AutoBoxCacheMax, 128, \
never@17 374 "Sets max value cached by the java.lang.Integer autobox cache") \
never@17 375 \
duke@0 376 product(bool, DoEscapeAnalysis, false, \
duke@0 377 "Perform escape analysis") \
duke@0 378 \
duke@0 379 notproduct(bool, PrintEscapeAnalysis, false, \
duke@0 380 "Print the results of escape analysis") \
duke@0 381 \
duke@0 382 product(bool, EliminateAllocations, true, \
duke@0 383 "Use escape analysis to eliminate allocations") \
duke@0 384 \
kvn@65 385 notproduct(bool, PrintEliminateAllocations, false, \
kvn@65 386 "Print out when allocations are eliminated") \
kvn@65 387 \
kvn@65 388 product(intx, EliminateAllocationArraySizeLimit, 64, \
kvn@65 389 "Array size (number of elements) limit for scalar replacement") \
kvn@65 390 \
duke@0 391 product(intx, MaxLabelRootDepth, 1100, \
duke@0 392 "Maximum times call Label_Root to prevent stack overflow") \
kvn@155 393 \
kvn@155 394 diagnostic(intx, DominatorSearchLimit, 1000, \
kvn@155 395 "Iterations limit in Node::dominates") \
duke@0 396
duke@0 397 C2_FLAGS(DECLARE_DEVELOPER_FLAG, DECLARE_PD_DEVELOPER_FLAG, DECLARE_PRODUCT_FLAG, DECLARE_PD_PRODUCT_FLAG, DECLARE_DIAGNOSTIC_FLAG, DECLARE_NOTPRODUCT_FLAG)