1 /* 2 * Copyright (c) 2000, 2013, Oracle and/or its affiliates. All rights reserved. 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 4 * 5 * This code is free software; you can redistribute it and/or modify it 6 * under the terms of the GNU General Public License version 2 only, as 7 * published by the Free Software Foundation. 8 * 9 * This code is distributed in the hope that it will be useful, but WITHOUT 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 12 * version 2 for more details (a copy is included in the LICENSE file that 13 * accompanied this code). 14 * 15 * You should have received a copy of the GNU General Public License version 16 * 2 along with this work; if not, write to the Free Software Foundation, 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 18 * 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 20 * or visit www.oracle.com if you need additional information or have any 21 * questions. 22 * 23 */ 24 25 #ifndef SHARE_VM_OPTO_C2_GLOBALS_HPP 26 #define SHARE_VM_OPTO_C2_GLOBALS_HPP 27 28 #include "runtime/globals.hpp" 29 #ifdef TARGET_ARCH_x86 30 # include "c2_globals_x86.hpp" 31 #endif 32 #ifdef TARGET_ARCH_sparc 33 # include "c2_globals_sparc.hpp" 34 #endif 35 #ifdef TARGET_ARCH_arm 36 # include "c2_globals_arm.hpp" 37 #endif 38 #ifdef TARGET_ARCH_ppc 39 # include "c2_globals_ppc.hpp" 40 #endif 41 #ifdef TARGET_OS_FAMILY_linux 42 # include "c2_globals_linux.hpp" 43 #endif 44 #ifdef TARGET_OS_FAMILY_solaris 45 # include "c2_globals_solaris.hpp" 46 #endif 47 #ifdef TARGET_OS_FAMILY_windows 48 # include "c2_globals_windows.hpp" 49 #endif 50 #ifdef TARGET_OS_FAMILY_aix 51 # include "c2_globals_aix.hpp" 52 #endif 53 #ifdef TARGET_OS_FAMILY_bsd 54 # include "c2_globals_bsd.hpp" 55 #endif 56 57 // 58 // Defines all globals flags used by the server compiler. 59 // 60 61 #define C2_FLAGS(develop, develop_pd, product, product_pd, diagnostic, experimental, notproduct) \ 62 \ 63 develop(bool, StressLCM, false, \ 64 "Randomize instruction scheduling in LCM") \ 65 \ 66 develop(bool, StressGCM, false, \ 67 "Randomize instruction scheduling in GCM") \ 68 \ 69 notproduct(intx, CompileZapFirst, 0, \ 70 "If +ZapDeadCompiledLocals, " \ 71 "skip this many before compiling in zap calls") \ 72 \ 73 notproduct(intx, CompileZapLast, -1, \ 74 "If +ZapDeadCompiledLocals, " \ 75 "compile this many after skipping (incl. skip count, -1 = all)") \ 76 \ 77 notproduct(intx, ZapDeadCompiledLocalsFirst, 0, \ 78 "If +ZapDeadCompiledLocals, " \ 79 "skip this many before really doing it") \ 80 \ 81 notproduct(intx, ZapDeadCompiledLocalsLast, -1, \ 82 "If +ZapDeadCompiledLocals, " \ 83 "do this many after skipping (incl. skip count, -1 = all)") \ 84 \ 85 develop(intx, OptoPrologueNops, 0, \ 86 "Insert this many extra nop instructions " \ 87 "in the prologue of every nmethod") \ 88 \ 89 product_pd(intx, InteriorEntryAlignment, \ 90 "Code alignment for interior entry points " \ 91 "in generated code (in bytes)") \ 92 \ 93 product(intx, MaxLoopPad, (OptoLoopAlignment-1), \ 94 "Align a loop if padding size in bytes is less or equal to this value") \ 95 \ 96 product(intx, MaxVectorSize, 32, \ 97 "Max vector size in bytes, " \ 98 "actual size could be less depending on elements type") \ 99 \ 100 product(bool, AlignVector, true, \ 101 "Perform vector store/load alignment in loop") \ 102 \ 103 product(intx, NumberOfLoopInstrToAlign, 4, \ 104 "Number of first instructions in a loop to align") \ 105 \ 106 notproduct(intx, IndexSetWatch, 0, \ 107 "Trace all operations on this IndexSet (-1 means all, 0 none)") \ 108 \ 109 develop(intx, OptoNodeListSize, 4, \ 110 "Starting allocation size of Node_List data structures") \ 111 \ 112 develop(intx, OptoBlockListSize, 8, \ 113 "Starting allocation size of Block_List data structures") \ 114 \ 115 develop(intx, OptoPeepholeAt, -1, \ 116 "Apply peephole optimizations to this peephole rule") \ 117 \ 118 notproduct(bool, PrintIdeal, false, \ 119 "Print ideal graph before code generation") \ 120 \ 121 notproduct(bool, PrintOpto, false, \ 122 "Print compiler2 attempts") \ 123 \ 124 notproduct(bool, PrintOptoInlining, false, \ 125 "Print compiler2 inlining decisions") \ 126 \ 127 notproduct(bool, VerifyOpto, false, \ 128 "Apply more time consuming verification during compilation") \ 129 \ 130 notproduct(bool, VerifyIdealNodeCount, false, \ 131 "Verify that tracked dead ideal node count is accurate") \ 132 \ 133 notproduct(bool, PrintIdealNodeCount, false, \ 134 "Print liveness counts of ideal nodes") \ 135 \ 136 notproduct(bool, VerifyOptoOopOffsets, false, \ 137 "Check types of base addresses in field references") \ 138 \ 139 develop(bool, IdealizedNumerics, false, \ 140 "Check performance difference allowing FP " \ 141 "associativity and commutativity...") \ 142 \ 143 develop(bool, OptoBreakpoint, false, \ 144 "insert breakpoint at method entry") \ 145 \ 146 notproduct(bool, OptoBreakpointOSR, false, \ 147 "insert breakpoint at osr method entry") \ 148 \ 149 notproduct(intx, BreakAtNode, 0, \ 150 "Break at construction of this Node (either _idx or _debug_idx)") \ 151 \ 152 notproduct(bool, OptoBreakpointC2R, false, \ 153 "insert breakpoint at runtime stub entry") \ 154 \ 155 notproduct(bool, OptoNoExecute, false, \ 156 "Attempt to parse and compile but do not execute generated code") \ 157 \ 158 notproduct(bool, PrintOptoStatistics, false, \ 159 "Print New compiler statistics") \ 160 \ 161 notproduct(bool, PrintOptoAssembly, false, \ 162 "Print New compiler assembly output") \ 163 \ 164 develop_pd(bool, OptoPeephole, \ 165 "Apply peephole optimizations after register allocation") \ 166 \ 167 develop(bool, OptoRemoveUseless, true, \ 168 "Remove useless nodes after parsing") \ 169 \ 170 notproduct(bool, PrintFrameConverterAssembly, false, \ 171 "Print New compiler assembly output for frame converters") \ 172 \ 173 notproduct(bool, PrintParseStatistics, false, \ 174 "Print nodes, transforms and new values made per bytecode parsed")\ 175 \ 176 notproduct(bool, PrintOptoPeephole, false, \ 177 "Print New compiler peephole replacements") \ 178 \ 179 develop(bool, PrintCFGBlockFreq, false, \ 180 "Print CFG block freqencies") \ 181 \ 182 develop(bool, TraceOptoParse, false, \ 183 "Trace bytecode parse and control-flow merge") \ 184 \ 185 product_pd(intx, LoopUnrollLimit, \ 186 "Unroll loop bodies with node count less than this") \ 187 \ 188 product(intx, LoopMaxUnroll, 16, \ 189 "Maximum number of unrolls for main loop") \ 190 \ 191 product(intx, LoopUnrollMin, 4, \ 192 "Minimum number of unroll loop bodies before checking progress" \ 193 "of rounds of unroll,optimize,..") \ 194 \ 195 develop(intx, UnrollLimitForProfileCheck, 1, \ 196 "Don't use profile_trip_cnt() to restrict unrolling until " \ 197 "unrolling would push the number of unrolled iterations above " \ 198 "UnrollLimitForProfileCheck. A higher value allows more " \ 199 "unrolling. Zero acts as a very large value." ) \ 200 \ 201 product(intx, MultiArrayExpandLimit, 6, \ 202 "Maximum number of individual allocations in an inline-expanded " \ 203 "multianewarray instruction") \ 204 \ 205 notproduct(bool, TraceProfileTripCount, false, \ 206 "Trace profile loop trip count information") \ 207 \ 208 product(bool, UseLoopPredicate, true, \ 209 "Generate a predicate to select fast/slow loop versions") \ 210 \ 211 develop(bool, TraceLoopPredicate, false, \ 212 "Trace generation of loop predicates") \ 213 \ 214 develop(bool, TraceLoopOpts, false, \ 215 "Trace executed loop optimizations") \ 216 \ 217 diagnostic(bool, LoopLimitCheck, true, \ 218 "Generate a loop limits check for overflow") \ 219 \ 220 develop(bool, TraceLoopLimitCheck, false, \ 221 "Trace generation of loop limits checks") \ 222 \ 223 diagnostic(bool, RangeLimitCheck, true, \ 224 "Additional overflow checks during range check elimination") \ 225 \ 226 develop(bool, TraceRangeLimitCheck, false, \ 227 "Trace additional overflow checks in RCE") \ 228 \ 229 diagnostic(bool, UnrollLimitCheck, true, \ 230 "Additional overflow checks during loop unroll") \ 231 \ 232 /* OptimizeFill not yet supported on PowerPC. */ \ 233 product(bool, OptimizeFill, true PPC64_ONLY(&& false), \ 234 "convert fill/copy loops into intrinsic") \ 235 \ 236 develop(bool, TraceOptimizeFill, false, \ 237 "print detailed information about fill conversion") \ 238 \ 239 develop(bool, OptoCoalesce, true, \ 240 "Use Conservative Copy Coalescing in the Register Allocator") \ 241 \ 242 develop(bool, UseUniqueSubclasses, true, \ 243 "Narrow an abstract reference to the unique concrete subclass") \ 244 \ 245 develop(bool, UseExactTypes, true, \ 246 "Use exact types to eliminate array store checks and v-calls") \ 247 \ 248 product(intx, TrackedInitializationLimit, 50, \ 249 "When initializing fields, track up to this many words") \ 250 \ 251 product(bool, ReduceFieldZeroing, true, \ 252 "When initializing fields, try to avoid needless zeroing") \ 253 \ 254 product(bool, ReduceInitialCardMarks, true, \ 255 "When initializing fields, try to avoid needless card marks") \ 256 \ 257 product(bool, ReduceBulkZeroing, true, \ 258 "When bulk-initializing, try to avoid needless zeroing") \ 259 \ 260 product(bool, UseFPUForSpilling, false, \ 261 "Spill integer registers to FPU instead of stack when possible") \ 262 \ 263 develop_pd(intx, RegisterCostAreaRatio, \ 264 "Spill selection in reg allocator: scale area by (X/64K) before " \ 265 "adding cost") \ 266 \ 267 develop_pd(bool, UseCISCSpill, \ 268 "Use ADLC supplied cisc instructions during allocation") \ 269 \ 270 notproduct(bool, VerifyGraphEdges , false, \ 271 "Verify Bi-directional Edges") \ 272 \ 273 notproduct(bool, VerifyDUIterators, true, \ 274 "Verify the safety of all iterations of Bi-directional Edges") \ 275 \ 276 notproduct(bool, VerifyHashTableKeys, true, \ 277 "Verify the immutability of keys in the VN hash tables") \ 278 \ 279 notproduct(bool, VerifyRegisterAllocator , false, \ 280 "Verify Register Allocator") \ 281 \ 282 develop_pd(intx, FLOATPRESSURE, \ 283 "Number of float LRG's that constitute high register pressure") \ 284 \ 285 develop_pd(intx, INTPRESSURE, \ 286 "Number of integer LRG's that constitute high register pressure") \ 287 \ 288 notproduct(bool, TraceOptoPipelining, false, \ 289 "Trace pipelining information") \ 290 \ 291 notproduct(bool, TraceOptoOutput, false, \ 292 "Trace pipelining information") \ 293 \ 294 product_pd(bool, OptoScheduling, \ 295 "Instruction Scheduling after register allocation") \ 296 \ 297 product(bool, PartialPeelLoop, true, \ 298 "Partial peel (rotate) loops") \ 299 \ 300 product(intx, PartialPeelNewPhiDelta, 0, \ 301 "Additional phis that can be created by partial peeling") \ 302 \ 303 notproduct(bool, TracePartialPeeling, false, \ 304 "Trace partial peeling (loop rotation) information") \ 305 \ 306 product(bool, PartialPeelAtUnsignedTests, true, \ 307 "Partial peel at unsigned tests if no signed test exists") \ 308 \ 309 product(bool, ReassociateInvariants, true, \ 310 "Enable reassociation of expressions with loop invariants.") \ 311 \ 312 product(bool, LoopUnswitching, true, \ 313 "Enable loop unswitching (a form of invariant test hoisting)") \ 314 \ 315 notproduct(bool, TraceLoopUnswitching, false, \ 316 "Trace loop unswitching") \ 317 \ 318 product(bool, UseSuperWord, true, \ 319 "Transform scalar operations into superword operations") \ 320 \ 321 develop(bool, SuperWordRTDepCheck, false, \ 322 "Enable runtime dependency checks.") \ 323 \ 324 notproduct(bool, TraceSuperWord, false, \ 325 "Trace superword transforms") \ 326 \ 327 notproduct(bool, TraceNewVectors, false, \ 328 "Trace creation of Vector nodes") \ 329 \ 330 product_pd(bool, OptoBundling, \ 331 "Generate nops to fill i-cache lines") \ 332 \ 333 product_pd(intx, ConditionalMoveLimit, \ 334 "Limit of ops to make speculative when using CMOVE") \ 335 \ 336 /* Set BranchOnRegister == false. See 4965987. */ \ 337 product(bool, BranchOnRegister, false, \ 338 "Use Sparc V9 branch-on-register opcodes") \ 339 \ 340 develop(bool, SparcV9RegsHiBitsZero, true, \ 341 "Assume Sparc V9 I&L registers on V8+ systems are zero-extended") \ 342 \ 343 product(bool, UseRDPCForConstantTableBase, false, \ 344 "Use Sparc RDPC instruction for the constant table base.") \ 345 \ 346 develop(intx, PrintIdealGraphLevel, 0, \ 347 "Print ideal graph to XML file / network interface. " \ 348 "By default attempts to connect to the visualizer on a socket.") \ 349 \ 350 develop(intx, PrintIdealGraphPort, 4444, \ 351 "Ideal graph printer to network port") \ 352 \ 353 notproduct(ccstr, PrintIdealGraphAddress, "127.0.0.1", \ 354 "IP address to connect to visualizer") \ 355 \ 356 notproduct(ccstr, PrintIdealGraphFile, NULL, \ 357 "File to dump ideal graph to. If set overrides the " \ 358 "use of the network") \ 359 \ 360 product(bool, UseOldInlining, true, \ 361 "Enable the 1.3 inlining strategy") \ 362 \ 363 product(bool, UseBimorphicInlining, true, \ 364 "Profiling based inlining for two receivers") \ 365 \ 366 product(bool, UseOnlyInlinedBimorphic, true, \ 367 "Don't use BimorphicInlining if can't inline a second method") \ 368 \ 369 product(bool, InsertMemBarAfterArraycopy, true, \ 370 "Insert memory barrier after arraycopy call") \ 371 \ 372 develop(bool, SubsumeLoads, true, \ 373 "Attempt to compile while subsuming loads into machine instructions.") \ 374 \ 375 develop(bool, StressRecompilation, false, \ 376 "Recompile each compiled method without subsuming loads or escape analysis.") \ 377 \ 378 develop(intx, ImplicitNullCheckThreshold, 3, \ 379 "Don't do implicit null checks if NPE's in a method exceeds limit") \ 380 \ 381 product(intx, LoopOptsCount, 43, \ 382 "Set level of loop optimization for tier 1 compiles") \ 383 \ 384 /* controls for heat-based inlining */ \ 385 \ 386 develop(intx, NodeCountInliningCutoff, 18000, \ 387 "If parser node generation exceeds limit stop inlining") \ 388 \ 389 develop(intx, NodeCountInliningStep, 1000, \ 390 "Target size of warm calls inlined between optimization passes") \ 391 \ 392 develop(bool, InlineWarmCalls, false, \ 393 "Use a heat-based priority queue to govern inlining") \ 394 \ 395 develop(intx, HotCallCountThreshold, 999999, \ 396 "large numbers of calls (per method invocation) force hotness") \ 397 \ 398 develop(intx, HotCallProfitThreshold, 999999, \ 399 "highly profitable inlining opportunities force hotness") \ 400 \ 401 develop(intx, HotCallTrivialWork, -1, \ 402 "trivial execution time (no larger than this) forces hotness") \ 403 \ 404 develop(intx, HotCallTrivialSize, -1, \ 405 "trivial methods (no larger than this) force calls to be hot") \ 406 \ 407 develop(intx, WarmCallMinCount, -1, \ 408 "number of calls (per method invocation) to enable inlining") \ 409 \ 410 develop(intx, WarmCallMinProfit, -1, \ 411 "number of calls (per method invocation) to enable inlining") \ 412 \ 413 develop(intx, WarmCallMaxWork, 999999, \ 414 "execution time of the largest inlinable method") \ 415 \ 416 develop(intx, WarmCallMaxSize, 999999, \ 417 "size of the largest inlinable method") \ 418 \ 419 product(intx, MaxNodeLimit, 80000, \ 420 "Maximum number of nodes") \ 421 \ 422 product(intx, NodeLimitFudgeFactor, 2000, \ 423 "Fudge Factor for certain optimizations") \ 424 \ 425 product(bool, UseJumpTables, true, \ 426 "Use JumpTables instead of a binary search tree for switches") \ 427 \ 428 product(bool, UseDivMod, true, \ 429 "Use combined DivMod instruction if available") \ 430 \ 431 product_pd(intx, MinJumpTableSize, \ 432 "Minimum number of targets in a generated jump table") \ 433 \ 434 product(intx, MaxJumpTableSize, 65000, \ 435 "Maximum number of targets in a generated jump table") \ 436 \ 437 product(intx, MaxJumpTableSparseness, 5, \ 438 "Maximum sparseness for jumptables") \ 439 \ 440 product(bool, EliminateLocks, true, \ 441 "Coarsen locks when possible") \ 442 \ 443 product(bool, EliminateNestedLocks, true, \ 444 "Eliminate nested locks of the same object when possible") \ 445 \ 446 notproduct(bool, PrintLockStatistics, false, \ 447 "Print precise statistics on the dynamic lock usage") \ 448 \ 449 diagnostic(bool, PrintPreciseBiasedLockingStatistics, false, \ 450 "Print per-lock-site statistics of biased locking in JVM") \ 451 \ 452 diagnostic(bool, PrintPreciseRTMLockingStatistics, false, \ 453 "Print per-lock-site statistics of rtm locking in JVM") \ 454 \ 455 notproduct(bool, PrintEliminateLocks, false, \ 456 "Print out when locks are eliminated") \ 457 \ 458 product(bool, EliminateAutoBox, true, \ 459 "Control optimizations for autobox elimination") \ 460 \ 461 diagnostic(bool, UseImplicitStableValues, true, \ 462 "Mark well-known stable fields as such (e.g. String.value)") \ 463 \ 464 product(intx, AutoBoxCacheMax, 128, \ 465 "Sets max value cached by the java.lang.Integer autobox cache") \ 466 \ 467 experimental(bool, AggressiveUnboxing, false, \ 468 "Control optimizations for aggressive boxing elimination") \ 469 \ 470 develop(bool, TracePostallocExpand, false, "Trace expanding nodes after" \ 471 " register allocation.") \ 472 \ 473 product(bool, DoEscapeAnalysis, true, \ 474 "Perform escape analysis") \ 475 \ 476 product(double, EscapeAnalysisTimeout, 20. DEBUG_ONLY(+40.), \ 477 "Abort EA when it reaches time limit (in sec)") \ 478 \ 479 develop(bool, ExitEscapeAnalysisOnTimeout, true, \ 480 "Exit or throw assert in EA when it reaches time limit") \ 481 \ 482 notproduct(bool, PrintEscapeAnalysis, false, \ 483 "Print the results of escape analysis") \ 484 \ 485 product(bool, EliminateAllocations, true, \ 486 "Use escape analysis to eliminate allocations") \ 487 \ 488 notproduct(bool, PrintEliminateAllocations, false, \ 489 "Print out when allocations are eliminated") \ 490 \ 491 product(intx, EliminateAllocationArraySizeLimit, 64, \ 492 "Array size (number of elements) limit for scalar replacement") \ 493 \ 494 product(bool, OptimizePtrCompare, true, \ 495 "Use escape analysis to optimize pointers compare") \ 496 \ 497 notproduct(bool, PrintOptimizePtrCompare, false, \ 498 "Print information about optimized pointers compare") \ 499 \ 500 notproduct(bool, VerifyConnectionGraph , true, \ 501 "Verify Connection Graph construction in Escape Analysis") \ 502 \ 503 product(bool, UseOptoBiasInlining, true, \ 504 "Generate biased locking code in C2 ideal graph") \ 505 \ 506 product(bool, OptimizeStringConcat, true, \ 507 "Optimize the construction of Strings by StringBuilder") \ 508 \ 509 notproduct(bool, PrintOptimizeStringConcat, false, \ 510 "Print information about transformations performed on Strings") \ 511 \ 512 product(intx, ValueSearchLimit, 1000, \ 513 "Recursion limit in PhaseMacroExpand::value_from_mem_phi") \ 514 \ 515 product(intx, MaxLabelRootDepth, 1100, \ 516 "Maximum times call Label_Root to prevent stack overflow") \ 517 \ 518 diagnostic(intx, DominatorSearchLimit, 1000, \ 519 "Iterations limit in Node::dominates") \ 520 \ 521 product(bool, BlockLayoutByFrequency, true, \ 522 "Use edge frequencies to drive block ordering") \ 523 \ 524 product(intx, BlockLayoutMinDiamondPercentage, 20, \ 525 "Miniumum %% of a successor (predecessor) for which block layout "\ 526 "a will allow a fork (join) in a single chain") \ 527 \ 528 product(bool, BlockLayoutRotateLoops, true, \ 529 "Allow back branches to be fall throughs in the block layour") \ 530 \ 531 develop(bool, InlineReflectionGetCallerClass, true, \ 532 "inline sun.reflect.Reflection.getCallerClass(), known to be part "\ 533 "of base library DLL") \ 534 \ 535 develop(bool, InlineObjectCopy, true, \ 536 "inline Object.clone and Arrays.copyOf[Range] intrinsics") \ 537 \ 538 develop(bool, SpecialStringCompareTo, true, \ 539 "special version of string compareTo") \ 540 \ 541 develop(bool, SpecialStringIndexOf, true, \ 542 "special version of string indexOf") \ 543 \ 544 develop(bool, SpecialStringEquals, true, \ 545 "special version of string equals") \ 546 \ 547 develop(bool, SpecialArraysEquals, true, \ 548 "special version of Arrays.equals(char[],char[])") \ 549 \ 550 product(bool, SpecialEncodeISOArray, true, \ 551 "special version of ISO_8859_1$Encoder.encodeISOArray") \ 552 \ 553 develop(bool, BailoutToInterpreterForThrows, false, \ 554 "Compiled methods which throws/catches exceptions will be " \ 555 "deopt and intp.") \ 556 \ 557 develop(bool, ConvertCmpD2CmpF, true, \ 558 "Convert cmpD to cmpF when one input is constant in float range") \ 559 \ 560 develop(bool, ConvertFloat2IntClipping, true, \ 561 "Convert float2int clipping idiom to integer clipping") \ 562 \ 563 develop(bool, Use24BitFPMode, true, \ 564 "Set 24-bit FPU mode on a per-compile basis ") \ 565 \ 566 develop(bool, Use24BitFP, true, \ 567 "use FP instructions that produce 24-bit precise results") \ 568 \ 569 develop(bool, MonomorphicArrayCheck, true, \ 570 "Uncommon-trap array store checks that require full type check") \ 571 \ 572 notproduct(bool, TracePhaseCCP, false, \ 573 "Print progress during Conditional Constant Propagation") \ 574 \ 575 develop(bool, PrintDominators, false, \ 576 "Print out dominator trees for GVN") \ 577 \ 578 notproduct(bool, TraceSpilling, false, \ 579 "Trace spilling") \ 580 \ 581 diagnostic(bool, TraceTypeProfile, false, \ 582 "Trace type profile") \ 583 \ 584 develop(bool, PoisonOSREntry, true, \ 585 "Detect abnormal calls to OSR code") \ 586 \ 587 product(bool, UseCondCardMark, false, \ 588 "Check for already marked card before updating card table") \ 589 \ 590 develop(bool, SoftMatchFailure, trueInProduct, \ 591 "If the DFA fails to match a node, print a message and bail out") \ 592 \ 593 develop(bool, InlineAccessors, true, \ 594 "inline accessor methods (get/set)") \ 595 \ 596 product(intx, TypeProfileMajorReceiverPercent, 90, \ 597 "% of major receiver type to all profiled receivers") \ 598 \ 599 notproduct(bool, TimeCompiler2, false, \ 600 "detailed time the compiler (requires +TimeCompiler)") \ 601 \ 602 diagnostic(bool, PrintIntrinsics, false, \ 603 "prints attempted and successful inlining of intrinsics") \ 604 \ 605 diagnostic(ccstrlist, DisableIntrinsic, "", \ 606 "do not expand intrinsics whose (internal) names appear here") \ 607 \ 608 develop(bool, StressReflectiveCode, false, \ 609 "Use inexact types at allocations, etc., to test reflection") \ 610 \ 611 diagnostic(bool, DebugInlinedCalls, true, \ 612 "If false, restricts profiled locations to the root method only") \ 613 \ 614 notproduct(bool, VerifyLoopOptimizations, false, \ 615 "verify major loop optimizations") \ 616 \ 617 diagnostic(bool, ProfileDynamicTypes, true, \ 618 "do extra type profiling and use it more aggressively") \ 619 \ 620 develop(bool, TraceIterativeGVN, false, \ 621 "Print progress during Iterative Global Value Numbering") \ 622 \ 623 develop(bool, VerifyIterativeGVN, false, \ 624 "Verify Def-Use modifications during sparse Iterative Global " \ 625 "Value Numbering") \ 626 \ 627 notproduct(bool, TraceCISCSpill, false, \ 628 "Trace allocators use of cisc spillable instructions") \ 629 \ 630 product(bool, SplitIfBlocks, true, \ 631 "Clone compares and control flow through merge points to fold " \ 632 "some branches") \ 633 \ 634 develop(intx, FreqCountInvocations, 1, \ 635 "Scaling factor for branch frequencies (deprecated)") \ 636 \ 637 product(intx, AliasLevel, 3, \ 638 "0 for no aliasing, 1 for oop/field/static/array split, " \ 639 "2 for class split, 3 for unique instances") \ 640 \ 641 develop(bool, VerifyAliases, false, \ 642 "perform extra checks on the results of alias analysis") \ 643 \ 644 product(bool, IncrementalInline, true, \ 645 "do post parse inlining") \ 646 \ 647 develop(bool, AlwaysIncrementalInline, false, \ 648 "do all inlining incrementally") \ 649 \ 650 product(intx, LiveNodeCountInliningCutoff, 40000, \ 651 "max number of live nodes in a method") \ 652 \ 653 diagnostic(bool, OptimizeExpensiveOps, true, \ 654 "Find best control for expensive operations") \ 655 \ 656 product(bool, UseMathExactIntrinsics, true, \ 657 "Enables intrinsification of various java.lang.Math functions") \ 658 \ 659 product(bool, UseMultiplyToLenIntrinsic, false, \ 660 "Enables intrinsification of BigInteger.multiplyToLen()") \ 661 \ 662 product(bool, UseTypeSpeculation, true, \ 663 "Speculatively propagate types from profiles") \ 664 \ 665 diagnostic(bool, UseInlineDepthForSpeculativeTypes, true, \ 666 "Carry inline depth of profile point with speculative type " \ 667 "and give priority to profiling from lower inline depth") \ 668 \ 669 product_pd(bool, TrapBasedRangeChecks, \ 670 "Generate code for range checks that uses a cmp and trap " \ 671 "instruction raising SIGTRAP. Used on PPC64.") \ 672 \ 673 develop(bool, RenumberLiveNodes, true, \ 674 "Renumber live nodes") \ 675 676 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) 677 678 #endif // SHARE_VM_OPTO_C2_GLOBALS_HPP