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