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