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