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