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 product(bool, UseRDPCForConstantTableBase, false, \ 361 "Use Sparc RDPC instruction for the constant table base.") \ 362 \ 363 notproduct(bool, PrintIdealGraph, false, \ 364 "Print ideal graph to XML file / network interface. " \ 365 "By default attempts to connect to the visualizer on a socket.") \ 366 \ 367 notproduct(intx, PrintIdealGraphLevel, 0, \ 368 "Level of detail of the ideal graph printout. " \ 369 "System-wide value, 0=nothing is printed, 4=all details printed. "\ 370 "Level of detail of printouts can be set on a per-method level " \ 371 "as well by using CompileCommand=option.") \ 372 range(0, 4) \ 373 \ 374 notproduct(intx, PrintIdealGraphPort, 4444, \ 375 "Ideal graph printer to network port") \ 376 range(0, SHRT_MAX) \ 377 \ 378 notproduct(ccstr, PrintIdealGraphAddress, "127.0.0.1", \ 379 "IP address to connect to visualizer") \ 380 \ 381 notproduct(ccstr, PrintIdealGraphFile, NULL, \ 382 "File to dump ideal graph to. If set overrides the " \ 383 "use of the network") \ 384 \ 385 product(bool, UseBimorphicInlining, true, \ 386 "Profiling based inlining for two receivers") \ 387 \ 388 product(bool, UseOnlyInlinedBimorphic, true, \ 389 "Don't use BimorphicInlining if can't inline a second method") \ 390 \ 391 product(bool, InsertMemBarAfterArraycopy, true, \ 392 "Insert memory barrier after arraycopy call") \ 393 \ 394 develop(bool, SubsumeLoads, true, \ 395 "Attempt to compile while subsuming loads into machine " \ 396 "instructions.") \ 397 \ 398 develop(bool, StressRecompilation, false, \ 399 "Recompile each compiled method without subsuming loads " \ 400 "or escape analysis.") \ 401 \ 402 develop(intx, ImplicitNullCheckThreshold, 3, \ 403 "Don't do implicit null checks if NPE's in a method exceeds " \ 404 "limit") \ 405 range(0, max_jint) \ 406 \ 407 product(intx, LoopOptsCount, 43, \ 408 "Set level of loop optimization for tier 1 compiles") \ 409 range(5, 43) \ 410 \ 411 /* controls for heat-based inlining */ \ 412 \ 413 develop(intx, NodeCountInliningCutoff, 18000, \ 414 "If parser node generation exceeds limit stop inlining") \ 415 range(0, max_jint) \ 416 \ 417 develop(intx, NodeCountInliningStep, 1000, \ 418 "Target size of warm calls inlined between optimization passes") \ 419 range(0, max_jint) \ 420 \ 421 develop(bool, InlineWarmCalls, false, \ 422 "Use a heat-based priority queue to govern inlining") \ 423 \ 424 /* Max values must not exceed WarmCallInfo::MAX_VALUE(). */ \ 425 develop(intx, HotCallCountThreshold, 999999, \ 426 "large numbers of calls (per method invocation) force hotness") \ 427 range(0, ((intx)MIN2((int64_t)max_intx,(int64_t)(+1.0e10)))) \ 428 \ 429 develop(intx, HotCallProfitThreshold, 999999, \ 430 "highly profitable inlining opportunities force hotness") \ 431 range(0, ((intx)MIN2((int64_t)max_intx,(int64_t)(+1.0e10)))) \ 432 \ 433 develop(intx, HotCallTrivialWork, -1, \ 434 "trivial execution time (no larger than this) forces hotness") \ 435 range(-1, ((intx)MIN2((int64_t)max_intx,(int64_t)(+1.0e10)))) \ 436 \ 437 develop(intx, HotCallTrivialSize, -1, \ 438 "trivial methods (no larger than this) force calls to be hot") \ 439 range(-1, ((intx)MIN2((int64_t)max_intx,(int64_t)(+1.0e10)))) \ 440 \ 441 develop(intx, WarmCallMinCount, -1, \ 442 "number of calls (per method invocation) to enable inlining") \ 443 range(-1, ((intx)MIN2((int64_t)max_intx,(int64_t)(+1.0e10)))) \ 444 \ 445 develop(intx, WarmCallMinProfit, -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, WarmCallMaxWork, 999999, \ 450 "execution time of the largest inlinable method") \ 451 range(0, ((intx)MIN2((int64_t)max_intx,(int64_t)(+1.0e10)))) \ 452 \ 453 develop(intx, WarmCallMaxSize, 999999, \ 454 "size of the largest inlinable method") \ 455 range(0, ((intx)MIN2((int64_t)max_intx,(int64_t)(+1.0e10)))) \ 456 \ 457 product(intx, MaxNodeLimit, 80000, \ 458 "Maximum number of nodes") \ 459 range(1000, max_jint / 3) \ 460 \ 461 product(intx, NodeLimitFudgeFactor, 2000, \ 462 "Fudge Factor for certain optimizations") \ 463 constraint(NodeLimitFudgeFactorConstraintFunc, AfterErgo) \ 464 \ 465 product(bool, UseJumpTables, true, \ 466 "Use JumpTables instead of a binary search tree for switches") \ 467 \ 468 product(bool, UseDivMod, true, \ 469 "Use combined DivMod instruction if available") \ 470 \ 471 product_pd(intx, MinJumpTableSize, \ 472 "Minimum number of targets in a generated jump table") \ 473 range(0, max_intx) \ 474 \ 475 product(intx, MaxJumpTableSize, 65000, \ 476 "Maximum number of targets in a generated jump table") \ 477 range(0, max_intx) \ 478 \ 479 product(intx, MaxJumpTableSparseness, 5, \ 480 "Maximum sparseness for jumptables") \ 481 range(0, max_intx / 4) \ 482 \ 483 product(bool, EliminateLocks, true, \ 484 "Coarsen locks when possible") \ 485 \ 486 product(bool, EliminateNestedLocks, true, \ 487 "Eliminate nested locks of the same object when possible") \ 488 \ 489 notproduct(bool, PrintLockStatistics, false, \ 490 "Print precise statistics on the dynamic lock usage") \ 491 \ 492 diagnostic(bool, PrintPreciseBiasedLockingStatistics, false, \ 493 "(Deprecated) Print per-lock-site statistics of biased locking " \ 494 "in JVM") \ 495 \ 496 diagnostic(bool, PrintPreciseRTMLockingStatistics, false, \ 497 "Print per-lock-site statistics of rtm locking in JVM") \ 498 \ 499 notproduct(bool, PrintEliminateLocks, false, \ 500 "Print out when locks are eliminated") \ 501 \ 502 product(bool, EliminateAutoBox, true, \ 503 "Control optimizations for autobox elimination") \ 504 \ 505 product(intx, AutoBoxCacheMax, 128, \ 506 "Sets max value cached by the java.lang.Integer autobox cache") \ 507 range(0, max_jint) \ 508 \ 509 diagnostic(bool, AggressiveUnboxing, true, \ 510 "Control optimizations for aggressive boxing elimination") \ 511 \ 512 develop(bool, TracePostallocExpand, false, "Trace expanding nodes after" \ 513 " register allocation.") \ 514 \ 515 product(bool, DoEscapeAnalysis, true, \ 516 "Perform escape analysis") \ 517 \ 518 product(double, EscapeAnalysisTimeout, 20. DEBUG_ONLY(+40.), \ 519 "Abort EA when it reaches time limit (in sec)") \ 520 range(0, DBL_MAX) \ 521 \ 522 develop(bool, ExitEscapeAnalysisOnTimeout, true, \ 523 "Exit or throw assert in EA when it reaches time limit") \ 524 \ 525 notproduct(bool, PrintEscapeAnalysis, false, \ 526 "Print the results of escape analysis") \ 527 \ 528 product(bool, EliminateAllocations, true, \ 529 "Use escape analysis to eliminate allocations") \ 530 \ 531 notproduct(bool, PrintEliminateAllocations, false, \ 532 "Print out when allocations are eliminated") \ 533 \ 534 product(intx, EliminateAllocationArraySizeLimit, 64, \ 535 "Array size (number of elements) limit for scalar replacement") \ 536 range(0, max_jint) \ 537 \ 538 product(bool, OptimizePtrCompare, true, \ 539 "Use escape analysis to optimize pointers compare") \ 540 \ 541 notproduct(bool, PrintOptimizePtrCompare, false, \ 542 "Print information about optimized pointers compare") \ 543 \ 544 notproduct(bool, VerifyConnectionGraph , true, \ 545 "Verify Connection Graph construction in Escape Analysis") \ 546 \ 547 product(bool, UseOptoBiasInlining, true, \ 548 "(Deprecated) Generate biased locking code in C2 ideal graph") \ 549 \ 550 product(bool, OptimizeStringConcat, true, \ 551 "Optimize the construction of Strings by StringBuilder") \ 552 \ 553 notproduct(bool, PrintOptimizeStringConcat, false, \ 554 "Print information about transformations performed on Strings") \ 555 \ 556 product(intx, ValueSearchLimit, 1000, \ 557 "Recursion limit in PhaseMacroExpand::value_from_mem_phi") \ 558 range(0, max_jint) \ 559 \ 560 product(intx, MaxLabelRootDepth, 1100, \ 561 "Maximum times call Label_Root to prevent stack overflow") \ 562 range(100, max_jint) \ 563 \ 564 diagnostic(intx, DominatorSearchLimit, 1000, \ 565 "Iterations limit in Node::dominates") \ 566 range(0, max_jint) \ 567 \ 568 product(bool, BlockLayoutByFrequency, true, \ 569 "Use edge frequencies to drive block ordering") \ 570 \ 571 product(intx, BlockLayoutMinDiamondPercentage, 20, \ 572 "Miniumum %% of a successor (predecessor) for which block " \ 573 "layout a will allow a fork (join) in a single chain") \ 574 range(0, 100) \ 575 \ 576 product(bool, BlockLayoutRotateLoops, true, \ 577 "Allow back branches to be fall throughs in the block layout") \ 578 \ 579 diagnostic(bool, InlineReflectionGetCallerClass, true, \ 580 "inline sun.reflect.Reflection.getCallerClass(), known to be " \ 581 "part of base library DLL") \ 582 \ 583 diagnostic(bool, InlineObjectCopy, true, \ 584 "inline Object.clone and Arrays.copyOf[Range] intrinsics") \ 585 \ 586 diagnostic(bool, SpecialStringCompareTo, true, \ 587 "special version of string compareTo") \ 588 \ 589 diagnostic(bool, SpecialStringIndexOf, true, \ 590 "special version of string indexOf") \ 591 \ 592 diagnostic(bool, SpecialStringEquals, true, \ 593 "special version of string equals") \ 594 \ 595 diagnostic(bool, SpecialArraysEquals, true, \ 596 "special version of Arrays.equals(char[],char[])") \ 597 \ 598 diagnostic(bool, SpecialEncodeISOArray, true, \ 599 "special version of ISO_8859_1$Encoder.encodeISOArray") \ 600 \ 601 develop(bool, BailoutToInterpreterForThrows, false, \ 602 "Compiled methods which throws/catches exceptions will be " \ 603 "deopt and intp.") \ 604 \ 605 develop(bool, ConvertCmpD2CmpF, true, \ 606 "Convert cmpD to cmpF when one input is constant in float range") \ 607 \ 608 develop(bool, ConvertFloat2IntClipping, true, \ 609 "Convert float2int clipping idiom to integer clipping") \ 610 \ 611 develop(bool, MonomorphicArrayCheck, true, \ 612 "Uncommon-trap array store checks that require full type check") \ 613 \ 614 notproduct(bool, TracePhaseCCP, false, \ 615 "Print progress during Conditional Constant Propagation") \ 616 \ 617 develop(bool, PrintDominators, false, \ 618 "Print out dominator trees for GVN") \ 619 \ 620 diagnostic(bool, TraceSpilling, false, \ 621 "Trace spilling") \ 622 \ 623 diagnostic(bool, TraceTypeProfile, false, \ 624 "Trace type profile") \ 625 \ 626 develop(bool, PoisonOSREntry, true, \ 627 "Detect abnormal calls to OSR code") \ 628 \ 629 develop(bool, SoftMatchFailure, trueInProduct, \ 630 "If the DFA fails to match a node, print a message and bail out") \ 631 \ 632 develop(bool, InlineAccessors, true, \ 633 "inline accessor methods (get/set)") \ 634 \ 635 product(intx, TypeProfileMajorReceiverPercent, 90, \ 636 "% of major receiver type to all profiled receivers") \ 637 range(0, 100) \ 638 \ 639 diagnostic(bool, PrintIntrinsics, false, \ 640 "prints attempted and successful inlining of intrinsics") \ 641 \ 642 develop(bool, StressReflectiveCode, false, \ 643 "Use inexact types at allocations, etc., to test reflection") \ 644 \ 645 diagnostic(bool, DebugInlinedCalls, true, \ 646 "If false, restricts profiled locations to the root method only") \ 647 \ 648 notproduct(bool, VerifyLoopOptimizations, false, \ 649 "verify major loop optimizations") \ 650 \ 651 diagnostic(bool, ProfileDynamicTypes, true, \ 652 "do extra type profiling and use it more aggressively") \ 653 \ 654 develop(bool, TraceIterativeGVN, false, \ 655 "Print progress during Iterative Global Value Numbering") \ 656 \ 657 develop(bool, VerifyIterativeGVN, false, \ 658 "Verify Def-Use modifications during sparse Iterative Global " \ 659 "Value Numbering") \ 660 \ 661 notproduct(bool, TraceCISCSpill, false, \ 662 "Trace allocators use of cisc spillable instructions") \ 663 \ 664 product(bool, SplitIfBlocks, true, \ 665 "Clone compares and control flow through merge points to fold " \ 666 "some branches") \ 667 \ 668 develop(intx, FreqCountInvocations, 1, \ 669 "Scaling factor for branch frequencies (deprecated)") \ 670 range(1, max_intx) \ 671 \ 672 product(intx, AliasLevel, 3, \ 673 "0 for no aliasing, 1 for oop/field/static/array split, " \ 674 "2 for class split, 3 for unique instances") \ 675 range(0, 3) \ 676 constraint(AliasLevelConstraintFunc,AfterErgo) \ 677 \ 678 develop(bool, VerifyAliases, false, \ 679 "perform extra checks on the results of alias analysis") \ 680 \ 681 product(intx, MaxInlineLevel, 15, \ 682 "maximum number of nested calls that are inlined by high tier " \ 683 "compiler") \ 684 range(0, max_jint) \ 685 \ 686 product(intx, MaxRecursiveInlineLevel, 1, \ 687 "maximum number of nested recursive calls that are inlined by " \ 688 "high tier compiler") \ 689 range(0, max_jint) \ 690 \ 691 product_pd(intx, InlineSmallCode, \ 692 "Only inline already compiled methods if their code size is " \ 693 "less than this") \ 694 range(0, max_jint) \ 695 \ 696 product(intx, MaxInlineSize, 35, \ 697 "The maximum bytecode size of a method to be inlined by high " \ 698 "tier compiler") \ 699 range(0, max_jint) \ 700 \ 701 product_pd(intx, FreqInlineSize, \ 702 "The maximum bytecode size of a frequent method to be inlined") \ 703 range(0, max_jint) \ 704 \ 705 product(intx, MaxTrivialSize, 6, \ 706 "The maximum bytecode size of a trivial method to be inlined by " \ 707 "high tier compiler") \ 708 range(0, max_jint) \ 709 \ 710 product(bool, IncrementalInline, true, \ 711 "do post parse inlining") \ 712 \ 713 develop(bool, AlwaysIncrementalInline, false, \ 714 "do all inlining incrementally") \ 715 \ 716 product(intx, LiveNodeCountInliningCutoff, 40000, \ 717 "max number of live nodes in a method") \ 718 range(0, max_juint / 8) \ 719 \ 720 diagnostic(bool, OptimizeExpensiveOps, true, \ 721 "Find best control for expensive operations") \ 722 \ 723 diagnostic(bool, UseMathExactIntrinsics, true, \ 724 "Enables intrinsification of various java.lang.Math functions") \ 725 \ 726 diagnostic(bool, UseCharacterCompareIntrinsics, false, \ 727 "Enables intrinsification of java.lang.Character functions") \ 728 \ 729 diagnostic(bool, UseMultiplyToLenIntrinsic, false, \ 730 "Enables intrinsification of BigInteger.multiplyToLen()") \ 731 \ 732 diagnostic(bool, UseSquareToLenIntrinsic, false, \ 733 "Enables intrinsification of BigInteger.squareToLen()") \ 734 \ 735 diagnostic(bool, UseMulAddIntrinsic, false, \ 736 "Enables intrinsification of BigInteger.mulAdd()") \ 737 \ 738 diagnostic(bool, UseMontgomeryMultiplyIntrinsic, false, \ 739 "Enables intrinsification of BigInteger.montgomeryMultiply()") \ 740 \ 741 diagnostic(bool, UseMontgomerySquareIntrinsic, false, \ 742 "Enables intrinsification of BigInteger.montgomerySquare()") \ 743 \ 744 product(bool, UseTypeSpeculation, true, \ 745 "Speculatively propagate types from profiles") \ 746 \ 747 diagnostic(bool, UseInlineDepthForSpeculativeTypes, true, \ 748 "Carry inline depth of profile point with speculative type " \ 749 "and give priority to profiling from lower inline depth") \ 750 \ 751 product_pd(bool, TrapBasedRangeChecks, \ 752 "Generate code for range checks that uses a cmp and trap " \ 753 "instruction raising SIGTRAP. Used on PPC64.") \ 754 \ 755 product(intx, ArrayCopyLoadStoreMaxElem, 8, \ 756 "Maximum number of arraycopy elements inlined as a sequence of" \ 757 "loads/stores") \ 758 range(0, max_intx) \ 759 \ 760 develop(bool, StressArrayCopyMacroNode, false, \ 761 "Perform ArrayCopy load/store replacement during IGVN only") \ 762 \ 763 develop(bool, RenumberLiveNodes, true, \ 764 "Renumber live nodes") \ 765 \ 766 product(uintx, LoopStripMiningIter, 0, \ 767 "Number of iterations in strip mined loop") \ 768 range(0, max_juint) \ 769 \ 770 product(uintx, LoopStripMiningIterShortLoop, 0, \ 771 "Loop with fewer iterations are not strip mined") \ 772 range(0, max_juint) \ 773 \ 774 product(bool, UseProfiledLoopPredicate, true, \ 775 "Move predicates out of loops based on profiling data") \ 776 \ 777 diagnostic(bool, ExpandSubTypeCheckAtParseTime, false, \ 778 "Do not use subtype check macro node") \ 779 780 #endif // SHARE_OPTO_C2_GLOBALS_HPP 781