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