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