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