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(intx, LoopUnrollMin, 4, \ 197 "Minimum number of unroll loop bodies before checking progress" \ 198 "of rounds of unroll,optimize,..") \ 199 \ 200 develop(intx, UnrollLimitForProfileCheck, 1, \ 201 "Don't use profile_trip_cnt() to restrict unrolling until " \ 202 "unrolling would push the number of unrolled iterations above " \ 203 "UnrollLimitForProfileCheck. A higher value allows more " \ 204 "unrolling. Zero acts as a very large value." ) \ 205 \ 206 product(intx, MultiArrayExpandLimit, 6, \ 207 "Maximum number of individual allocations in an inline-expanded " \ 208 "multianewarray instruction") \ 209 \ 210 notproduct(bool, TraceProfileTripCount, false, \ 211 "Trace profile loop trip count information") \ 212 \ 213 product(bool, UseLoopPredicate, true, \ 214 "Generate a predicate to select fast/slow loop versions") \ 215 \ 216 develop(bool, TraceLoopPredicate, false, \ 217 "Trace generation of loop predicates") \ 218 \ 219 develop(bool, TraceLoopOpts, false, \ 220 "Trace executed loop optimizations") \ 221 \ 222 diagnostic(bool, LoopLimitCheck, true, \ 223 "Generate a loop limits check for overflow") \ 224 \ 225 develop(bool, TraceLoopLimitCheck, false, \ 226 "Trace generation of loop limits checks") \ 227 \ 228 diagnostic(bool, RangeLimitCheck, true, \ 229 "Additional overflow checks during range check elimination") \ 230 \ 231 develop(bool, TraceRangeLimitCheck, false, \ 232 "Trace additional overflow checks in RCE") \ 233 \ 234 diagnostic(bool, UnrollLimitCheck, true, \ 235 "Additional overflow checks during loop unroll") \ 236 \ 237 /* OptimizeFill not yet supported on PowerPC. */ \ 238 product(bool, OptimizeFill, true PPC64_ONLY(&& false), \ 239 "convert fill/copy loops into intrinsic") \ 240 \ 241 develop(bool, TraceOptimizeFill, false, \ 242 "print detailed information about fill conversion") \ 243 \ 244 develop(bool, OptoCoalesce, true, \ 245 "Use Conservative Copy Coalescing in the Register Allocator") \ 246 \ 247 develop(bool, UseUniqueSubclasses, true, \ 248 "Narrow an abstract reference to the unique concrete subclass") \ 249 \ 250 develop(bool, UseExactTypes, true, \ 251 "Use exact types to eliminate array store checks and v-calls") \ 252 \ 253 product(intx, TrackedInitializationLimit, 50, \ 254 "When initializing fields, track up to this many words") \ 255 \ 256 product(bool, ReduceFieldZeroing, true, \ 257 "When initializing fields, try to avoid needless zeroing") \ 258 \ 259 product(bool, ReduceInitialCardMarks, true, \ 260 "When initializing fields, try to avoid needless card marks") \ 261 \ 262 product(bool, ReduceBulkZeroing, true, \ 263 "When bulk-initializing, try to avoid needless zeroing") \ 264 \ 265 product(bool, UseFPUForSpilling, false, \ 266 "Spill integer registers to FPU instead of stack when possible") \ 267 \ 268 develop_pd(intx, RegisterCostAreaRatio, \ 269 "Spill selection in reg allocator: scale area by (X/64K) before " \ 270 "adding cost") \ 271 \ 272 develop_pd(bool, UseCISCSpill, \ 273 "Use ADLC supplied cisc instructions during allocation") \ 274 \ 275 notproduct(bool, VerifyGraphEdges , false, \ 276 "Verify Bi-directional Edges") \ 277 \ 278 notproduct(bool, VerifyDUIterators, true, \ 279 "Verify the safety of all iterations of Bi-directional Edges") \ 280 \ 281 notproduct(bool, VerifyHashTableKeys, true, \ 282 "Verify the immutability of keys in the VN hash tables") \ 283 \ 284 notproduct(bool, VerifyRegisterAllocator , false, \ 285 "Verify Register Allocator") \ 286 \ 287 develop_pd(intx, FLOATPRESSURE, \ 288 "Number of float LRG's that constitute high register pressure") \ 289 \ 290 develop_pd(intx, INTPRESSURE, \ 291 "Number of integer LRG's that constitute high register pressure") \ 292 \ 293 notproduct(bool, TraceOptoPipelining, false, \ 294 "Trace pipelining information") \ 295 \ 296 notproduct(bool, TraceOptoOutput, false, \ 297 "Trace pipelining information") \ 298 \ 299 product_pd(bool, OptoScheduling, \ 300 "Instruction Scheduling after register allocation") \ 301 \ 302 product(bool, PartialPeelLoop, true, \ 303 "Partial peel (rotate) loops") \ 304 \ 305 product(intx, PartialPeelNewPhiDelta, 0, \ 306 "Additional phis that can be created by partial peeling") \ 307 \ 308 notproduct(bool, TracePartialPeeling, false, \ 309 "Trace partial peeling (loop rotation) information") \ 310 \ 311 product(bool, PartialPeelAtUnsignedTests, true, \ 312 "Partial peel at unsigned tests if no signed test exists") \ 313 \ 314 product(bool, ReassociateInvariants, true, \ 315 "Enable reassociation of expressions with loop invariants.") \ 316 \ 317 product(bool, LoopUnswitching, true, \ 318 "Enable loop unswitching (a form of invariant test hoisting)") \ 319 \ 320 notproduct(bool, TraceLoopUnswitching, false, \ 321 "Trace loop unswitching") \ 322 \ 323 product(bool, AllowVectorizeOnDemand, true, \ 324 "Globally supress vectorization set in VectorizeMethod") \ 325 \ 326 product(bool, UseSuperWord, true, \ 327 "Transform scalar operations into superword operations") \ 328 \ 329 develop(bool, SuperWordRTDepCheck, false, \ 330 "Enable runtime dependency checks.") \ 331 \ 332 product(bool, SuperWordReductions, true, \ 333 "Enable reductions support in superword.") \ 334 \ 335 notproduct(bool, TraceSuperWord, false, \ 336 "Trace superword transforms") \ 337 \ 338 notproduct(bool, TraceNewVectors, false, \ 339 "Trace creation of Vector nodes") \ 340 \ 341 product_pd(bool, OptoBundling, \ 342 "Generate nops to fill i-cache lines") \ 343 \ 344 product_pd(intx, ConditionalMoveLimit, \ 345 "Limit of ops to make speculative when using CMOVE") \ 346 \ 347 /* Set BranchOnRegister == false. See 4965987. */ \ 348 product(bool, BranchOnRegister, false, \ 349 "Use Sparc V9 branch-on-register opcodes") \ 350 \ 351 develop(bool, SparcV9RegsHiBitsZero, true, \ 352 "Assume Sparc V9 I&L registers on V8+ systems are zero-extended") \ 353 \ 354 product(bool, UseRDPCForConstantTableBase, false, \ 355 "Use Sparc RDPC instruction for the constant table base.") \ 356 \ 357 develop(bool, PrintIdealGraph, false, \ 358 "Print ideal graph to XML file / network interface. " \ 359 "By default attempts to connect to the visualizer on a socket.") \ 360 \ 361 develop(intx, PrintIdealGraphLevel, 0, \ 362 "Level of detail of the ideal graph printout. " \ 363 "System-wide value, 0=nothing is printed, 3=all details printed. "\ 364 "Level of detail of printouts can be set on a per-method level " \ 365 "as well by using CompileCommand=option.") \ 366 range(0, 3) \ 367 \ 368 develop(intx, PrintIdealGraphPort, 4444, \ 369 "Ideal graph printer to network port") \ 370 \ 371 notproduct(ccstr, PrintIdealGraphAddress, "127.0.0.1", \ 372 "IP address to connect to visualizer") \ 373 \ 374 notproduct(ccstr, PrintIdealGraphFile, NULL, \ 375 "File to dump ideal graph to. If set overrides the " \ 376 "use of the network") \ 377 \ 378 product(bool, UseBimorphicInlining, true, \ 379 "Profiling based inlining for two receivers") \ 380 \ 381 product(bool, UseOnlyInlinedBimorphic, true, \ 382 "Don't use BimorphicInlining if can't inline a second method") \ 383 \ 384 product(bool, InsertMemBarAfterArraycopy, true, \ 385 "Insert memory barrier after arraycopy call") \ 386 \ 387 develop(bool, SubsumeLoads, true, \ 388 "Attempt to compile while subsuming loads into machine " \ 389 "instructions.") \ 390 \ 391 develop(bool, StressRecompilation, false, \ 392 "Recompile each compiled method without subsuming loads " \ 393 "or escape analysis.") \ 394 \ 395 develop(intx, ImplicitNullCheckThreshold, 3, \ 396 "Don't do implicit null checks if NPE's in a method exceeds " \ 397 "limit") \ 398 \ 399 product(intx, LoopOptsCount, 43, \ 400 "Set level of loop optimization for tier 1 compiles") \ 401 \ 402 /* controls for heat-based inlining */ \ 403 \ 404 develop(intx, NodeCountInliningCutoff, 18000, \ 405 "If parser node generation exceeds limit stop inlining") \ 406 \ 407 develop(intx, NodeCountInliningStep, 1000, \ 408 "Target size of warm calls inlined between optimization passes") \ 409 \ 410 develop(bool, InlineWarmCalls, false, \ 411 "Use a heat-based priority queue to govern inlining") \ 412 \ 413 develop(intx, HotCallCountThreshold, 999999, \ 414 "large numbers of calls (per method invocation) force hotness") \ 415 \ 416 develop(intx, HotCallProfitThreshold, 999999, \ 417 "highly profitable inlining opportunities force hotness") \ 418 \ 419 develop(intx, HotCallTrivialWork, -1, \ 420 "trivial execution time (no larger than this) forces hotness") \ 421 \ 422 develop(intx, HotCallTrivialSize, -1, \ 423 "trivial methods (no larger than this) force calls to be hot") \ 424 \ 425 develop(intx, WarmCallMinCount, -1, \ 426 "number of calls (per method invocation) to enable inlining") \ 427 \ 428 develop(intx, WarmCallMinProfit, -1, \ 429 "number of calls (per method invocation) to enable inlining") \ 430 \ 431 develop(intx, WarmCallMaxWork, 999999, \ 432 "execution time of the largest inlinable method") \ 433 \ 434 develop(intx, WarmCallMaxSize, 999999, \ 435 "size of the largest inlinable method") \ 436 \ 437 product(intx, MaxNodeLimit, 80000, \ 438 "Maximum number of nodes") \ 439 \ 440 product(intx, NodeLimitFudgeFactor, 2000, \ 441 "Fudge Factor for certain optimizations") \ 442 \ 443 product(bool, UseJumpTables, true, \ 444 "Use JumpTables instead of a binary search tree for switches") \ 445 \ 446 product(bool, UseDivMod, true, \ 447 "Use combined DivMod instruction if available") \ 448 \ 449 product_pd(intx, MinJumpTableSize, \ 450 "Minimum number of targets in a generated jump table") \ 451 \ 452 product(intx, MaxJumpTableSize, 65000, \ 453 "Maximum number of targets in a generated jump table") \ 454 \ 455 product(intx, MaxJumpTableSparseness, 5, \ 456 "Maximum sparseness for jumptables") \ 457 \ 458 product(bool, EliminateLocks, true, \ 459 "Coarsen locks when possible") \ 460 \ 461 product(bool, EliminateNestedLocks, true, \ 462 "Eliminate nested locks of the same object when possible") \ 463 \ 464 notproduct(bool, PrintLockStatistics, false, \ 465 "Print precise statistics on the dynamic lock usage") \ 466 \ 467 diagnostic(bool, PrintPreciseBiasedLockingStatistics, false, \ 468 "Print per-lock-site statistics of biased locking in JVM") \ 469 \ 470 diagnostic(bool, PrintPreciseRTMLockingStatistics, false, \ 471 "Print per-lock-site statistics of rtm locking in JVM") \ 472 \ 473 notproduct(bool, PrintEliminateLocks, false, \ 474 "Print out when locks are eliminated") \ 475 \ 476 product(bool, EliminateAutoBox, true, \ 477 "Control optimizations for autobox elimination") \ 478 \ 479 diagnostic(bool, UseImplicitStableValues, true, \ 480 "Mark well-known stable fields as such (e.g. String.value)") \ 481 \ 482 product(intx, AutoBoxCacheMax, 128, \ 483 "Sets max value cached by the java.lang.Integer autobox cache") \ 484 \ 485 experimental(bool, AggressiveUnboxing, false, \ 486 "Control optimizations for aggressive boxing elimination") \ 487 \ 488 develop(bool, TracePostallocExpand, false, "Trace expanding nodes after" \ 489 " register allocation.") \ 490 \ 491 product(bool, DoEscapeAnalysis, true, \ 492 "Perform escape analysis") \ 493 \ 494 product(double, EscapeAnalysisTimeout, 20. DEBUG_ONLY(+40.), \ 495 "Abort EA when it reaches time limit (in sec)") \ 496 \ 497 develop(bool, ExitEscapeAnalysisOnTimeout, true, \ 498 "Exit or throw assert in EA when it reaches time limit") \ 499 \ 500 notproduct(bool, PrintEscapeAnalysis, false, \ 501 "Print the results of escape analysis") \ 502 \ 503 product(bool, EliminateAllocations, true, \ 504 "Use escape analysis to eliminate allocations") \ 505 \ 506 notproduct(bool, PrintEliminateAllocations, false, \ 507 "Print out when allocations are eliminated") \ 508 \ 509 product(intx, EliminateAllocationArraySizeLimit, 64, \ 510 "Array size (number of elements) limit for scalar replacement") \ 511 \ 512 product(bool, OptimizePtrCompare, true, \ 513 "Use escape analysis to optimize pointers compare") \ 514 \ 515 notproduct(bool, PrintOptimizePtrCompare, false, \ 516 "Print information about optimized pointers compare") \ 517 \ 518 notproduct(bool, VerifyConnectionGraph , true, \ 519 "Verify Connection Graph construction in Escape Analysis") \ 520 \ 521 product(bool, UseOptoBiasInlining, true, \ 522 "Generate biased locking code in C2 ideal graph") \ 523 \ 524 product(bool, OptimizeStringConcat, true, \ 525 "Optimize the construction of Strings by StringBuilder") \ 526 \ 527 notproduct(bool, PrintOptimizeStringConcat, false, \ 528 "Print information about transformations performed on Strings") \ 529 \ 530 product(intx, ValueSearchLimit, 1000, \ 531 "Recursion limit in PhaseMacroExpand::value_from_mem_phi") \ 532 \ 533 product(intx, MaxLabelRootDepth, 1100, \ 534 "Maximum times call Label_Root to prevent stack overflow") \ 535 \ 536 diagnostic(intx, DominatorSearchLimit, 1000, \ 537 "Iterations limit in Node::dominates") \ 538 \ 539 product(bool, BlockLayoutByFrequency, true, \ 540 "Use edge frequencies to drive block ordering") \ 541 \ 542 product(intx, BlockLayoutMinDiamondPercentage, 20, \ 543 "Miniumum %% of a successor (predecessor) for which block " \ 544 "layout a will allow a fork (join) in a single chain") \ 545 range(0, 100) \ 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 " \ 552 "part 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 range(0, 100) \ 615 \ 616 diagnostic(bool, PrintIntrinsics, false, \ 617 "prints attempted and successful inlining of intrinsics") \ 618 \ 619 diagnostic(ccstrlist, DisableIntrinsic, "", \ 620 "do not expand intrinsics whose (internal) names appear here") \ 621 \ 622 develop(bool, StressReflectiveCode, false, \ 623 "Use inexact types at allocations, etc., to test reflection") \ 624 \ 625 diagnostic(bool, DebugInlinedCalls, true, \ 626 "If false, restricts profiled locations to the root method only") \ 627 \ 628 notproduct(bool, VerifyLoopOptimizations, false, \ 629 "verify major loop optimizations") \ 630 \ 631 diagnostic(bool, ProfileDynamicTypes, true, \ 632 "do extra type profiling and use it more aggressively") \ 633 \ 634 develop(bool, TraceIterativeGVN, false, \ 635 "Print progress during Iterative Global Value Numbering") \ 636 \ 637 develop(bool, VerifyIterativeGVN, false, \ 638 "Verify Def-Use modifications during sparse Iterative Global " \ 639 "Value Numbering") \ 640 \ 641 notproduct(bool, TraceCISCSpill, false, \ 642 "Trace allocators use of cisc spillable instructions") \ 643 \ 644 product(bool, SplitIfBlocks, true, \ 645 "Clone compares and control flow through merge points to fold " \ 646 "some branches") \ 647 \ 648 develop(intx, FreqCountInvocations, 1, \ 649 "Scaling factor for branch frequencies (deprecated)") \ 650 \ 651 product(intx, AliasLevel, 3, \ 652 "0 for no aliasing, 1 for oop/field/static/array split, " \ 653 "2 for class split, 3 for unique instances") \ 654 range(0, 3) \ 655 constraint(AliasLevelConstraintFunc) \ 656 \ 657 develop(bool, VerifyAliases, false, \ 658 "perform extra checks on the results of alias analysis") \ 659 \ 660 product(bool, IncrementalInline, true, \ 661 "do post parse inlining") \ 662 \ 663 develop(bool, AlwaysIncrementalInline, false, \ 664 "do all inlining incrementally") \ 665 \ 666 product(intx, LiveNodeCountInliningCutoff, 40000, \ 667 "max number of live nodes in a method") \ 668 \ 669 diagnostic(bool, OptimizeExpensiveOps, true, \ 670 "Find best control for expensive operations") \ 671 \ 672 product(bool, UseMathExactIntrinsics, true, \ 673 "Enables intrinsification of various java.lang.Math functions") \ 674 \ 675 product(bool, UseMultiplyToLenIntrinsic, false, \ 676 "Enables intrinsification of BigInteger.multiplyToLen()") \ 677 \ 678 product(bool, UseTypeSpeculation, true, \ 679 "Speculatively propagate types from profiles") \ 680 \ 681 diagnostic(bool, UseInlineDepthForSpeculativeTypes, true, \ 682 "Carry inline depth of profile point with speculative type " \ 683 "and give priority to profiling from lower inline depth") \ 684 \ 685 product_pd(bool, TrapBasedRangeChecks, \ 686 "Generate code for range checks that uses a cmp and trap " \ 687 "instruction raising SIGTRAP. Used on PPC64.") \ 688 \ 689 product(intx, ArrayCopyLoadStoreMaxElem, 8, \ 690 "Maximum number of arraycopy elements inlined as a sequence of" \ 691 "loads/stores") \ 692 \ 693 develop(bool, StressArrayCopyMacroNode, false, \ 694 "Perform ArrayCopy load/store replacement during IGVN only") 695 696 C2_FLAGS(DECLARE_DEVELOPER_FLAG, \ 697 DECLARE_PD_DEVELOPER_FLAG, \ 698 DECLARE_PRODUCT_FLAG, \ 699 DECLARE_PD_PRODUCT_FLAG, \ 700 DECLARE_DIAGNOSTIC_FLAG, \ 701 DECLARE_EXPERIMENTAL_FLAG, \ 702 DECLARE_NOTPRODUCT_FLAG, \ 703 IGNORE_RANGE, \ 704 IGNORE_CONSTRAINT) 705 706 #endif // SHARE_VM_OPTO_C2_GLOBALS_HPP