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, LoopUnrollMin, 4, \ 189 "Minimum number of unroll loop bodies before checking progress" \ 190 "of rounds of unroll,optimize,..") \ 191 \ 192 develop(intx, UnrollLimitForProfileCheck, 1, \ 193 "Don't use profile_trip_cnt() to restrict unrolling until " \ 194 "unrolling would push the number of unrolled iterations above " \ 195 "UnrollLimitForProfileCheck. A higher value allows more " \ 196 "unrolling. Zero acts as a very large value." ) \ 197 \ 198 product(intx, MultiArrayExpandLimit, 6, \ 199 "Maximum number of individual allocations in an inline-expanded " \ 200 "multianewarray instruction") \ 201 \ 202 notproduct(bool, TraceProfileTripCount, false, \ 203 "Trace profile loop trip count information") \ 204 \ 205 product(bool, UseLoopPredicate, true, \ 206 "Generate a predicate to select fast/slow loop versions") \ 207 \ 208 develop(bool, TraceLoopPredicate, false, \ 209 "Trace generation of loop predicates") \ 210 \ 211 develop(bool, TraceLoopOpts, false, \ 212 "Trace executed loop optimizations") \ 213 \ 214 diagnostic(bool, LoopLimitCheck, true, \ 215 "Generate a loop limits check for overflow") \ 216 \ 217 develop(bool, TraceLoopLimitCheck, false, \ 218 "Trace generation of loop limits checks") \ 219 \ 220 diagnostic(bool, RangeLimitCheck, true, \ 221 "Additional overflow checks during range check elimination") \ 222 \ 223 develop(bool, TraceRangeLimitCheck, false, \ 224 "Trace additional overflow checks in RCE") \ 225 \ 226 diagnostic(bool, UnrollLimitCheck, true, \ 227 "Additional overflow checks during loop unroll") \ 228 \ 229 product(bool, OptimizeFill, true, \ 230 "convert fill/copy loops into intrinsic") \ 231 \ 232 develop(bool, TraceOptimizeFill, false, \ 233 "print detailed information about fill conversion") \ 234 \ 235 develop(bool, OptoCoalesce, true, \ 236 "Use Conservative Copy Coalescing in the Register Allocator") \ 237 \ 238 develop(bool, UseUniqueSubclasses, true, \ 239 "Narrow an abstract reference to the unique concrete subclass") \ 240 \ 241 develop(bool, UseExactTypes, true, \ 242 "Use exact types to eliminate array store checks and v-calls") \ 243 \ 244 product(intx, TrackedInitializationLimit, 50, \ 245 "When initializing fields, track up to this many words") \ 246 \ 247 product(bool, ReduceFieldZeroing, true, \ 248 "When initializing fields, try to avoid needless zeroing") \ 249 \ 250 product(bool, ReduceInitialCardMarks, true, \ 251 "When initializing fields, try to avoid needless card marks") \ 252 \ 253 product(bool, ReduceBulkZeroing, true, \ 254 "When bulk-initializing, try to avoid needless zeroing") \ 255 \ 256 product(bool, UseFPUForSpilling, false, \ 257 "Spill integer registers to FPU instead of stack when possible") \ 258 \ 259 develop_pd(intx, RegisterCostAreaRatio, \ 260 "Spill selection in reg allocator: scale area by (X/64K) before " \ 261 "adding cost") \ 262 \ 263 develop_pd(bool, UseCISCSpill, \ 264 "Use ADLC supplied cisc instructions during allocation") \ 265 \ 266 notproduct(bool, VerifyGraphEdges , false, \ 267 "Verify Bi-directional Edges") \ 268 \ 269 notproduct(bool, VerifyDUIterators, true, \ 270 "Verify the safety of all iterations of Bi-directional Edges") \ 271 \ 272 notproduct(bool, VerifyHashTableKeys, true, \ 273 "Verify the immutability of keys in the VN hash tables") \ 274 \ 275 notproduct(bool, VerifyRegisterAllocator , false, \ 276 "Verify Register Allocator") \ 277 \ 278 develop_pd(intx, FLOATPRESSURE, \ 279 "Number of float LRG's that constitute high register pressure") \ 280 \ 281 develop_pd(intx, INTPRESSURE, \ 282 "Number of integer LRG's that constitute high register pressure") \ 283 \ 284 notproduct(bool, TraceOptoPipelining, false, \ 285 "Trace pipelining information") \ 286 \ 287 notproduct(bool, TraceOptoOutput, false, \ 288 "Trace pipelining information") \ 289 \ 290 product_pd(bool, OptoScheduling, \ 291 "Instruction Scheduling after register allocation") \ 292 \ 293 product(bool, PartialPeelLoop, true, \ 294 "Partial peel (rotate) loops") \ 295 \ 296 product(intx, PartialPeelNewPhiDelta, 0, \ 297 "Additional phis that can be created by partial peeling") \ 298 \ 299 notproduct(bool, TracePartialPeeling, false, \ 300 "Trace partial peeling (loop rotation) information") \ 301 \ 302 product(bool, PartialPeelAtUnsignedTests, true, \ 303 "Partial peel at unsigned tests if no signed test exists") \ 304 \ 305 product(bool, ReassociateInvariants, true, \ 306 "Enable reassociation of expressions with loop invariants.") \ 307 \ 308 product(bool, LoopUnswitching, true, \ 309 "Enable loop unswitching (a form of invariant test hoisting)") \ 310 \ 311 notproduct(bool, TraceLoopUnswitching, false, \ 312 "Trace loop unswitching") \ 313 \ 314 product(bool, UseSuperWord, true, \ 315 "Transform scalar operations into superword operations") \ 316 \ 317 develop(bool, SuperWordRTDepCheck, false, \ 318 "Enable runtime dependency checks.") \ 319 \ 320 notproduct(bool, TraceSuperWord, false, \ 321 "Trace superword transforms") \ 322 \ 323 notproduct(bool, TraceNewVectors, false, \ 324 "Trace creation of Vector nodes") \ 325 \ 326 product_pd(bool, OptoBundling, \ 327 "Generate nops to fill i-cache lines") \ 328 \ 329 product_pd(intx, ConditionalMoveLimit, \ 330 "Limit of ops to make speculative when using CMOVE") \ 331 \ 332 /* Set BranchOnRegister == false. See 4965987. */ \ 333 product(bool, BranchOnRegister, false, \ 334 "Use Sparc V9 branch-on-register opcodes") \ 335 \ 336 develop(bool, SparcV9RegsHiBitsZero, true, \ 337 "Assume Sparc V9 I&L registers on V8+ systems are zero-extended") \ 338 \ 339 product(bool, UseRDPCForConstantTableBase, false, \ 340 "Use Sparc RDPC instruction for the constant table base.") \ 341 \ 342 develop(intx, PrintIdealGraphLevel, 0, \ 343 "Print ideal graph to XML file / network interface. " \ 344 "By default attempts to connect to the visualizer on a socket.") \ 345 \ 346 develop(intx, PrintIdealGraphPort, 4444, \ 347 "Ideal graph printer to network port") \ 348 \ 349 notproduct(ccstr, PrintIdealGraphAddress, "127.0.0.1", \ 350 "IP address to connect to visualizer") \ 351 \ 352 notproduct(ccstr, PrintIdealGraphFile, NULL, \ 353 "File to dump ideal graph to. If set overrides the " \ 354 "use of the network") \ 355 \ 356 product(bool, UseOldInlining, true, \ 357 "Enable the 1.3 inlining strategy") \ 358 \ 359 product(bool, UseBimorphicInlining, true, \ 360 "Profiling based inlining for two receivers") \ 361 \ 362 product(bool, UseOnlyInlinedBimorphic, true, \ 363 "Don't use BimorphicInlining if can't inline a second method") \ 364 \ 365 product(bool, InsertMemBarAfterArraycopy, true, \ 366 "Insert memory barrier after arraycopy call") \ 367 \ 368 develop(bool, SubsumeLoads, true, \ 369 "Attempt to compile while subsuming loads into machine instructions.") \ 370 \ 371 develop(bool, StressRecompilation, false, \ 372 "Recompile each compiled method without subsuming loads or escape analysis.") \ 373 \ 374 develop(intx, ImplicitNullCheckThreshold, 3, \ 375 "Don't do implicit null checks if NPE's in a method exceeds limit") \ 376 \ 377 product(intx, LoopOptsCount, 43, \ 378 "Set level of loop optimization for tier 1 compiles") \ 379 \ 380 /* controls for heat-based inlining */ \ 381 \ 382 develop(intx, NodeCountInliningCutoff, 18000, \ 383 "If parser node generation exceeds limit stop inlining") \ 384 \ 385 develop(intx, NodeCountInliningStep, 1000, \ 386 "Target size of warm calls inlined between optimization passes") \ 387 \ 388 develop(bool, InlineWarmCalls, false, \ 389 "Use a heat-based priority queue to govern inlining") \ 390 \ 391 develop(intx, HotCallCountThreshold, 999999, \ 392 "large numbers of calls (per method invocation) force hotness") \ 393 \ 394 develop(intx, HotCallProfitThreshold, 999999, \ 395 "highly profitable inlining opportunities force hotness") \ 396 \ 397 develop(intx, HotCallTrivialWork, -1, \ 398 "trivial execution time (no larger than this) forces hotness") \ 399 \ 400 develop(intx, HotCallTrivialSize, -1, \ 401 "trivial methods (no larger than this) force calls to be hot") \ 402 \ 403 develop(intx, WarmCallMinCount, -1, \ 404 "number of calls (per method invocation) to enable inlining") \ 405 \ 406 develop(intx, WarmCallMinProfit, -1, \ 407 "number of calls (per method invocation) to enable inlining") \ 408 \ 409 develop(intx, WarmCallMaxWork, 999999, \ 410 "execution time of the largest inlinable method") \ 411 \ 412 develop(intx, WarmCallMaxSize, 999999, \ 413 "size of the largest inlinable method") \ 414 \ 415 product(intx, MaxNodeLimit, 80000, \ 416 "Maximum number of nodes") \ 417 \ 418 product(intx, NodeLimitFudgeFactor, 2000, \ 419 "Fudge Factor for certain optimizations") \ 420 \ 421 product(bool, UseJumpTables, true, \ 422 "Use JumpTables instead of a binary search tree for switches") \ 423 \ 424 product(bool, UseDivMod, true, \ 425 "Use combined DivMod instruction if available") \ 426 \ 427 product(intx, MinJumpTableSize, 18, \ 428 "Minimum number of targets in a generated jump table") \ 429 \ 430 product(intx, MaxJumpTableSize, 65000, \ 431 "Maximum number of targets in a generated jump table") \ 432 \ 433 product(intx, MaxJumpTableSparseness, 5, \ 434 "Maximum sparseness for jumptables") \ 435 \ 436 product(bool, EliminateLocks, true, \ 437 "Coarsen locks when possible") \ 438 \ 439 product(bool, EliminateNestedLocks, true, \ 440 "Eliminate nested locks of the same object when possible") \ 441 \ 442 notproduct(bool, PrintLockStatistics, false, \ 443 "Print precise statistics on the dynamic lock usage") \ 444 \ 445 diagnostic(bool, PrintPreciseBiasedLockingStatistics, false, \ 446 "Print per-lock-site statistics of biased locking in JVM") \ 447 \ 448 notproduct(bool, PrintEliminateLocks, false, \ 449 "Print out when locks are eliminated") \ 450 \ 451 product(bool, EliminateAutoBox, true, \ 452 "Control optimizations for autobox elimination") \ 453 \ 454 product(intx, AutoBoxCacheMax, 128, \ 455 "Sets max value cached by the java.lang.Integer autobox cache") \ 456 \ 457 experimental(bool, AggressiveUnboxing, false, \ 458 "Control optimizations for aggressive boxing elimination") \ 459 \ 460 product(bool, DoEscapeAnalysis, true, \ 461 "Perform escape analysis") \ 462 \ 463 develop(bool, ExitEscapeAnalysisOnTimeout, true, \ 464 "Exit or throw assert in EA when it reaches time limit") \ 465 \ 466 notproduct(bool, PrintEscapeAnalysis, false, \ 467 "Print the results of escape analysis") \ 468 \ 469 product(bool, EliminateAllocations, true, \ 470 "Use escape analysis to eliminate allocations") \ 471 \ 472 notproduct(bool, PrintEliminateAllocations, false, \ 473 "Print out when allocations are eliminated") \ 474 \ 475 product(intx, EliminateAllocationArraySizeLimit, 64, \ 476 "Array size (number of elements) limit for scalar replacement") \ 477 \ 478 product(bool, OptimizePtrCompare, true, \ 479 "Use escape analysis to optimize pointers compare") \ 480 \ 481 notproduct(bool, PrintOptimizePtrCompare, false, \ 482 "Print information about optimized pointers compare") \ 483 \ 484 notproduct(bool, VerifyConnectionGraph , true, \ 485 "Verify Connection Graph construction in Escape Analysis") \ 486 \ 487 product(bool, UseOptoBiasInlining, true, \ 488 "Generate biased locking code in C2 ideal graph") \ 489 \ 490 product(bool, OptimizeStringConcat, true, \ 491 "Optimize the construction of Strings by StringBuilder") \ 492 \ 493 notproduct(bool, PrintOptimizeStringConcat, false, \ 494 "Print information about transformations performed on Strings") \ 495 \ 496 product(intx, ValueSearchLimit, 1000, \ 497 "Recursion limit in PhaseMacroExpand::value_from_mem_phi") \ 498 \ 499 product(intx, MaxLabelRootDepth, 1100, \ 500 "Maximum times call Label_Root to prevent stack overflow") \ 501 \ 502 diagnostic(intx, DominatorSearchLimit, 1000, \ 503 "Iterations limit in Node::dominates") \ 504 \ 505 product(bool, BlockLayoutByFrequency, true, \ 506 "Use edge frequencies to drive block ordering") \ 507 \ 508 product(intx, BlockLayoutMinDiamondPercentage, 20, \ 509 "Miniumum %% of a successor (predecessor) for which block layout "\ 510 "a will allow a fork (join) in a single chain") \ 511 \ 512 product(bool, BlockLayoutRotateLoops, true, \ 513 "Allow back branches to be fall throughs in the block layour") \ 514 \ 515 develop(bool, InlineReflectionGetCallerClass, true, \ 516 "inline sun.reflect.Reflection.getCallerClass(), known to be part "\ 517 "of base library DLL") \ 518 \ 519 develop(bool, InlineObjectCopy, true, \ 520 "inline Object.clone and Arrays.copyOf[Range] intrinsics") \ 521 \ 522 develop(bool, SpecialStringCompareTo, true, \ 523 "special version of string compareTo") \ 524 \ 525 develop(bool, SpecialStringIndexOf, true, \ 526 "special version of string indexOf") \ 527 \ 528 develop(bool, SpecialStringEquals, true, \ 529 "special version of string equals") \ 530 \ 531 develop(bool, SpecialArraysEquals, true, \ 532 "special version of Arrays.equals(char[],char[])") \ 533 \ 534 product(bool, SpecialEncodeISOArray, true, \ 535 "special version of ISO_8859_1$Encoder.encodeISOArray") \ 536 \ 537 develop(bool, BailoutToInterpreterForThrows, false, \ 538 "Compiled methods which throws/catches exceptions will be " \ 539 "deopt and intp.") \ 540 \ 541 develop(bool, ConvertCmpD2CmpF, true, \ 542 "Convert cmpD to cmpF when one input is constant in float range") \ 543 \ 544 develop(bool, ConvertFloat2IntClipping, true, \ 545 "Convert float2int clipping idiom to integer clipping") \ 546 \ 547 develop(bool, Use24BitFPMode, true, \ 548 "Set 24-bit FPU mode on a per-compile basis ") \ 549 \ 550 develop(bool, Use24BitFP, true, \ 551 "use FP instructions that produce 24-bit precise results") \ 552 \ 553 develop(bool, MonomorphicArrayCheck, true, \ 554 "Uncommon-trap array store checks that require full type check") \ 555 \ 556 notproduct(bool, TracePhaseCCP, false, \ 557 "Print progress during Conditional Constant Propagation") \ 558 \ 559 develop(bool, PrintDominators, false, \ 560 "Print out dominator trees for GVN") \ 561 \ 562 notproduct(bool, TraceSpilling, false, \ 563 "Trace spilling") \ 564 \ 565 diagnostic(bool, TraceTypeProfile, false, \ 566 "Trace type profile") \ 567 \ 568 develop(bool, PoisonOSREntry, true, \ 569 "Detect abnormal calls to OSR code") \ 570 \ 571 product(bool, UseCondCardMark, false, \ 572 "Check for already marked card before updating card table") \ 573 \ 574 develop(bool, SoftMatchFailure, trueInProduct, \ 575 "If the DFA fails to match a node, print a message and bail out") \ 576 \ 577 develop(bool, InlineAccessors, true, \ 578 "inline accessor methods (get/set)") \ 579 \ 580 product(intx, TypeProfileMajorReceiverPercent, 90, \ 581 "% of major receiver type to all profiled receivers") \ 582 \ 583 notproduct(bool, TimeCompiler2, false, \ 584 "detailed time the compiler (requires +TimeCompiler)") \ 585 \ 586 diagnostic(bool, PrintIntrinsics, false, \ 587 "prints attempted and successful inlining of intrinsics") \ 588 \ 589 diagnostic(ccstrlist, DisableIntrinsic, "", \ 590 "do not expand intrinsics whose (internal) names appear here") \ 591 \ 592 develop(bool, StressReflectiveCode, false, \ 593 "Use inexact types at allocations, etc., to test reflection") \ 594 \ 595 diagnostic(bool, DebugInlinedCalls, true, \ 596 "If false, restricts profiled locations to the root method only") \ 597 \ 598 notproduct(bool, VerifyLoopOptimizations, false, \ 599 "verify major loop optimizations") \ 600 \ 601 diagnostic(bool, ProfileDynamicTypes, true, \ 602 "do extra type profiling and use it more aggressively") \ 603 \ 604 develop(bool, TraceIterativeGVN, false, \ 605 "Print progress during Iterative Global Value Numbering") \ 606 \ 607 develop(bool, VerifyIterativeGVN, false, \ 608 "Verify Def-Use modifications during sparse Iterative Global " \ 609 "Value Numbering") \ 610 \ 611 notproduct(bool, TraceCISCSpill, false, \ 612 "Trace allocators use of cisc spillable instructions") \ 613 \ 614 product(bool, SplitIfBlocks, true, \ 615 "Clone compares and control flow through merge points to fold " \ 616 "some branches") \ 617 \ 618 develop(intx, FreqCountInvocations, 1, \ 619 "Scaling factor for branch frequencies (deprecated)") \ 620 \ 621 product(intx, AliasLevel, 3, \ 622 "0 for no aliasing, 1 for oop/field/static/array split, " \ 623 "2 for class split, 3 for unique instances") \ 624 \ 625 develop(bool, VerifyAliases, false, \ 626 "perform extra checks on the results of alias analysis") \ 627 \ 628 product(bool, IncrementalInline, true, \ 629 "do post parse inlining") \ 630 \ 631 develop(bool, AlwaysIncrementalInline, false, \ 632 "do all inlining incrementally") \ 633 \ 634 product(intx, LiveNodeCountInliningCutoff, 20000, \ 635 "max number of live nodes in a method") \ 636 \ 637 diagnostic(bool, OptimizeExpensiveOps, true, \ 638 "Find best control for expensive operations") \ 639 640 641 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) 642 643 #endif // SHARE_VM_OPTO_C2_GLOBALS_HPP