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