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