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