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