Tue, 04 Oct 2011 14:30:04 -0700
6865265: JVM crashes with "missing exception handler" error
Summary: Retry the call to fast_exception_handler_bci_for() after it returned with a pending exception. Don't cache the exception handler pc computed by compute_compiled_exc_handler() if the handler is for another (nested) exception.
Reviewed-by: kamg, kvn
Contributed-by: volker.simonis@gmail.com
duke@435 | 1 | /* |
trims@2708 | 2 | * Copyright (c) 2000, 2011, 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 |
stefank@2314 | 38 | #ifdef TARGET_OS_FAMILY_linux |
stefank@2314 | 39 | # include "c2_globals_linux.hpp" |
stefank@2314 | 40 | #endif |
stefank@2314 | 41 | #ifdef TARGET_OS_FAMILY_solaris |
stefank@2314 | 42 | # include "c2_globals_solaris.hpp" |
stefank@2314 | 43 | #endif |
stefank@2314 | 44 | #ifdef TARGET_OS_FAMILY_windows |
stefank@2314 | 45 | # include "c2_globals_windows.hpp" |
stefank@2314 | 46 | #endif |
never@3156 | 47 | #ifdef TARGET_OS_FAMILY_bsd |
never@3156 | 48 | # include "c2_globals_bsd.hpp" |
never@3156 | 49 | #endif |
stefank@2314 | 50 | |
duke@435 | 51 | // |
duke@435 | 52 | // Defines all globals flags used by the server compiler. |
duke@435 | 53 | // |
duke@435 | 54 | |
never@1515 | 55 | #define C2_FLAGS(develop, develop_pd, product, product_pd, diagnostic, experimental, notproduct) \ |
duke@435 | 56 | \ |
duke@435 | 57 | notproduct(intx, CompileZapFirst, 0, \ |
duke@435 | 58 | "If +ZapDeadCompiledLocals, " \ |
duke@435 | 59 | "skip this many before compiling in zap calls") \ |
duke@435 | 60 | \ |
duke@435 | 61 | notproduct(intx, CompileZapLast, -1, \ |
duke@435 | 62 | "If +ZapDeadCompiledLocals, " \ |
duke@435 | 63 | "compile this many after skipping (incl. skip count, -1 = all)") \ |
duke@435 | 64 | \ |
duke@435 | 65 | notproduct(intx, ZapDeadCompiledLocalsFirst, 0, \ |
duke@435 | 66 | "If +ZapDeadCompiledLocals, " \ |
duke@435 | 67 | "skip this many before really doing it") \ |
duke@435 | 68 | \ |
duke@435 | 69 | notproduct(intx, ZapDeadCompiledLocalsLast, -1, \ |
duke@435 | 70 | "If +ZapDeadCompiledLocals, " \ |
duke@435 | 71 | "do this many after skipping (incl. skip count, -1 = all)") \ |
duke@435 | 72 | \ |
duke@435 | 73 | develop(intx, OptoPrologueNops, 0, \ |
duke@435 | 74 | "Insert this many extra nop instructions " \ |
duke@435 | 75 | "in the prologue of every nmethod") \ |
duke@435 | 76 | \ |
duke@435 | 77 | product_pd(intx, InteriorEntryAlignment, \ |
duke@435 | 78 | "Code alignment for interior entry points " \ |
duke@435 | 79 | "in generated code (in bytes)") \ |
duke@435 | 80 | \ |
duke@435 | 81 | product(intx, MaxLoopPad, (OptoLoopAlignment-1), \ |
duke@435 | 82 | "Align a loop if padding size in bytes is less or equal to this value") \ |
duke@435 | 83 | \ |
duke@435 | 84 | product(intx, NumberOfLoopInstrToAlign, 4, \ |
duke@435 | 85 | "Number of first instructions in a loop to align") \ |
duke@435 | 86 | \ |
duke@435 | 87 | notproduct(intx, IndexSetWatch, 0, \ |
duke@435 | 88 | "Trace all operations on this IndexSet (-1 means all, 0 none)") \ |
duke@435 | 89 | \ |
duke@435 | 90 | develop(intx, OptoNodeListSize, 4, \ |
duke@435 | 91 | "Starting allocation size of Node_List data structures") \ |
duke@435 | 92 | \ |
duke@435 | 93 | develop(intx, OptoBlockListSize, 8, \ |
duke@435 | 94 | "Starting allocation size of Block_List data structures") \ |
duke@435 | 95 | \ |
duke@435 | 96 | develop(intx, OptoPeepholeAt, -1, \ |
duke@435 | 97 | "Apply peephole optimizations to this peephole rule") \ |
duke@435 | 98 | \ |
duke@435 | 99 | notproduct(bool, PrintIdeal, false, \ |
duke@435 | 100 | "Print ideal graph before code generation") \ |
duke@435 | 101 | \ |
duke@435 | 102 | notproduct(bool, PrintOpto, false, \ |
duke@435 | 103 | "Print compiler2 attempts") \ |
duke@435 | 104 | \ |
duke@435 | 105 | notproduct(bool, PrintOptoInlining, false, \ |
duke@435 | 106 | "Print compiler2 inlining decisions") \ |
duke@435 | 107 | \ |
duke@435 | 108 | notproduct(bool, VerifyOpto, false, \ |
duke@435 | 109 | "Apply more time consuming verification during compilation") \ |
duke@435 | 110 | \ |
duke@435 | 111 | notproduct(bool, VerifyOptoOopOffsets, false, \ |
duke@435 | 112 | "Check types of base addresses in field references") \ |
duke@435 | 113 | \ |
duke@435 | 114 | develop(bool, IdealizedNumerics, false, \ |
duke@435 | 115 | "Check performance difference allowing FP " \ |
duke@435 | 116 | "associativity and commutativity...") \ |
duke@435 | 117 | \ |
duke@435 | 118 | develop(bool, OptoBreakpoint, false, \ |
duke@435 | 119 | "insert breakpoint at method entry") \ |
duke@435 | 120 | \ |
duke@435 | 121 | notproduct(bool, OptoBreakpointOSR, false, \ |
duke@435 | 122 | "insert breakpoint at osr method entry") \ |
duke@435 | 123 | \ |
duke@435 | 124 | notproduct(intx, BreakAtNode, 0, \ |
duke@435 | 125 | "Break at construction of this Node (either _idx or _debug_idx)") \ |
duke@435 | 126 | \ |
duke@435 | 127 | notproduct(bool, OptoBreakpointC2R, false, \ |
duke@435 | 128 | "insert breakpoint at runtime stub entry") \ |
duke@435 | 129 | \ |
duke@435 | 130 | notproduct(bool, OptoNoExecute, false, \ |
duke@435 | 131 | "Attempt to parse and compile but do not execute generated code") \ |
duke@435 | 132 | \ |
duke@435 | 133 | notproduct(bool, PrintOptoStatistics, false, \ |
duke@435 | 134 | "Print New compiler statistics") \ |
duke@435 | 135 | \ |
duke@435 | 136 | notproduct(bool, PrintOptoAssembly, false, \ |
duke@435 | 137 | "Print New compiler assembly output") \ |
duke@435 | 138 | \ |
duke@435 | 139 | develop_pd(bool, OptoPeephole, \ |
duke@435 | 140 | "Apply peephole optimizations after register allocation") \ |
duke@435 | 141 | \ |
duke@435 | 142 | develop(bool, OptoRemoveUseless, true, \ |
duke@435 | 143 | "Remove useless nodes after parsing") \ |
duke@435 | 144 | \ |
duke@435 | 145 | notproduct(bool, PrintFrameConverterAssembly, false, \ |
duke@435 | 146 | "Print New compiler assembly output for frame converters") \ |
duke@435 | 147 | \ |
duke@435 | 148 | notproduct(bool, PrintParseStatistics, false, \ |
duke@435 | 149 | "Print nodes, transforms and new values made per bytecode parsed")\ |
duke@435 | 150 | \ |
duke@435 | 151 | notproduct(bool, PrintOptoPeephole, false, \ |
duke@435 | 152 | "Print New compiler peephole replacements") \ |
duke@435 | 153 | \ |
duke@435 | 154 | develop(bool, PrintCFGBlockFreq, false, \ |
duke@435 | 155 | "Print CFG block freqencies") \ |
duke@435 | 156 | \ |
duke@435 | 157 | develop(bool, TraceOptoParse, false, \ |
duke@435 | 158 | "Trace bytecode parse and control-flow merge") \ |
duke@435 | 159 | \ |
duke@435 | 160 | product_pd(intx, LoopUnrollLimit, \ |
duke@435 | 161 | "Unroll loop bodies with node count less than this") \ |
duke@435 | 162 | \ |
duke@435 | 163 | product(intx, LoopUnrollMin, 4, \ |
duke@435 | 164 | "Minimum number of unroll loop bodies before checking progress" \ |
duke@435 | 165 | "of rounds of unroll,optimize,..") \ |
duke@435 | 166 | \ |
duke@435 | 167 | develop(intx, UnrollLimitForProfileCheck, 1, \ |
duke@435 | 168 | "Don't use profile_trip_cnt() to restrict unrolling until " \ |
duke@435 | 169 | "unrolling would push the number of unrolled iterations above " \ |
duke@435 | 170 | "UnrollLimitForProfileCheck. A higher value allows more " \ |
duke@435 | 171 | "unrolling. Zero acts as a very large value." ) \ |
duke@435 | 172 | \ |
duke@435 | 173 | product(intx, MultiArrayExpandLimit, 6, \ |
duke@435 | 174 | "Maximum number of individual allocations in an inline-expanded " \ |
duke@435 | 175 | "multianewarray instruction") \ |
duke@435 | 176 | \ |
duke@435 | 177 | notproduct(bool, TraceProfileTripCount, false, \ |
duke@435 | 178 | "Trace profile loop trip count information") \ |
duke@435 | 179 | \ |
cfang@1607 | 180 | product(bool, UseLoopPredicate, true, \ |
cfang@1607 | 181 | "Generate a predicate to select fast/slow loop versions") \ |
cfang@1607 | 182 | \ |
cfang@1607 | 183 | develop(bool, TraceLoopPredicate, false, \ |
cfang@1607 | 184 | "Trace generation of loop predicates") \ |
cfang@1607 | 185 | \ |
kvn@2665 | 186 | develop(bool, TraceLoopOpts, false, \ |
kvn@2665 | 187 | "Trace executed loop optimizations") \ |
kvn@2665 | 188 | \ |
kvn@2877 | 189 | diagnostic(bool, LoopLimitCheck, true, \ |
kvn@2877 | 190 | "Generate a loop limits check for overflow") \ |
kvn@2877 | 191 | \ |
kvn@2877 | 192 | develop(bool, TraceLoopLimitCheck, false, \ |
kvn@2877 | 193 | "Trace generation of loop limits checks") \ |
kvn@2877 | 194 | \ |
kvn@2877 | 195 | diagnostic(bool, RangeLimitCheck, true, \ |
kvn@2877 | 196 | "Additional overflow checks during range check elimination") \ |
kvn@2877 | 197 | \ |
kvn@2877 | 198 | develop(bool, TraceRangeLimitCheck, false, \ |
kvn@2877 | 199 | "Trace additional overflow checks in RCE") \ |
kvn@2877 | 200 | \ |
kvn@2877 | 201 | diagnostic(bool, UnrollLimitCheck, true, \ |
kvn@2877 | 202 | "Additional overflow checks during loop unroll") \ |
kvn@2877 | 203 | \ |
never@2118 | 204 | product(bool, OptimizeFill, false, \ |
never@2118 | 205 | "convert fill/copy loops into intrinsic") \ |
never@2118 | 206 | \ |
never@2118 | 207 | develop(bool, TraceOptimizeFill, false, \ |
never@2118 | 208 | "print detailed information about fill conversion") \ |
never@2118 | 209 | \ |
duke@435 | 210 | develop(bool, OptoCoalesce, true, \ |
duke@435 | 211 | "Use Conservative Copy Coalescing in the Register Allocator") \ |
duke@435 | 212 | \ |
duke@435 | 213 | develop(bool, UseUniqueSubclasses, true, \ |
duke@435 | 214 | "Narrow an abstract reference to the unique concrete subclass") \ |
duke@435 | 215 | \ |
duke@435 | 216 | develop(bool, UseExactTypes, true, \ |
duke@435 | 217 | "Use exact types to eliminate array store checks and v-calls") \ |
duke@435 | 218 | \ |
duke@435 | 219 | product(intx, TrackedInitializationLimit, 50, \ |
duke@435 | 220 | "When initializing fields, track up to this many words") \ |
duke@435 | 221 | \ |
duke@435 | 222 | product(bool, ReduceFieldZeroing, true, \ |
duke@435 | 223 | "When initializing fields, try to avoid needless zeroing") \ |
duke@435 | 224 | \ |
duke@435 | 225 | product(bool, ReduceInitialCardMarks, true, \ |
duke@435 | 226 | "When initializing fields, try to avoid needless card marks") \ |
duke@435 | 227 | \ |
duke@435 | 228 | product(bool, ReduceBulkZeroing, true, \ |
duke@435 | 229 | "When bulk-initializing, try to avoid needless zeroing") \ |
duke@435 | 230 | \ |
never@2085 | 231 | product(bool, UseFPUForSpilling, false, \ |
never@2085 | 232 | "Spill integer registers to FPU instead of stack when possible") \ |
never@2085 | 233 | \ |
duke@435 | 234 | develop_pd(intx, RegisterCostAreaRatio, \ |
duke@435 | 235 | "Spill selection in reg allocator: scale area by (X/64K) before " \ |
duke@435 | 236 | "adding cost") \ |
duke@435 | 237 | \ |
duke@435 | 238 | develop_pd(bool, UseCISCSpill, \ |
duke@435 | 239 | "Use ADLC supplied cisc instructions during allocation") \ |
duke@435 | 240 | \ |
duke@435 | 241 | notproduct(bool, VerifyGraphEdges , false, \ |
duke@435 | 242 | "Verify Bi-directional Edges") \ |
duke@435 | 243 | \ |
duke@435 | 244 | notproduct(bool, VerifyDUIterators, true, \ |
duke@435 | 245 | "Verify the safety of all iterations of Bi-directional Edges") \ |
duke@435 | 246 | \ |
duke@435 | 247 | notproduct(bool, VerifyHashTableKeys, true, \ |
duke@435 | 248 | "Verify the immutability of keys in the VN hash tables") \ |
duke@435 | 249 | \ |
kvn@985 | 250 | notproduct(bool, VerifyRegisterAllocator , false, \ |
kvn@985 | 251 | "Verify Register Allocator") \ |
kvn@985 | 252 | \ |
duke@435 | 253 | develop_pd(intx, FLOATPRESSURE, \ |
duke@435 | 254 | "Number of float LRG's that constitute high register pressure") \ |
duke@435 | 255 | \ |
duke@435 | 256 | develop_pd(intx, INTPRESSURE, \ |
duke@435 | 257 | "Number of integer LRG's that constitute high register pressure") \ |
duke@435 | 258 | \ |
duke@435 | 259 | notproduct(bool, TraceOptoPipelining, false, \ |
duke@435 | 260 | "Trace pipelining information") \ |
duke@435 | 261 | \ |
duke@435 | 262 | notproduct(bool, TraceOptoOutput, false, \ |
duke@435 | 263 | "Trace pipelining information") \ |
duke@435 | 264 | \ |
duke@435 | 265 | product_pd(bool, OptoScheduling, \ |
duke@435 | 266 | "Instruction Scheduling after register allocation") \ |
duke@435 | 267 | \ |
duke@435 | 268 | product(bool, PartialPeelLoop, true, \ |
duke@435 | 269 | "Partial peel (rotate) loops") \ |
duke@435 | 270 | \ |
duke@435 | 271 | product(intx, PartialPeelNewPhiDelta, 0, \ |
duke@435 | 272 | "Additional phis that can be created by partial peeling") \ |
duke@435 | 273 | \ |
duke@435 | 274 | notproduct(bool, TracePartialPeeling, false, \ |
duke@435 | 275 | "Trace partial peeling (loop rotation) information") \ |
duke@435 | 276 | \ |
duke@435 | 277 | product(bool, PartialPeelAtUnsignedTests, true, \ |
duke@435 | 278 | "Partial peel at unsigned tests if no signed test exists") \ |
duke@435 | 279 | \ |
duke@435 | 280 | product(bool, ReassociateInvariants, true, \ |
duke@435 | 281 | "Enable reassociation of expressions with loop invariants.") \ |
duke@435 | 282 | \ |
duke@435 | 283 | product(bool, LoopUnswitching, true, \ |
duke@435 | 284 | "Enable loop unswitching (a form of invariant test hoisting)") \ |
duke@435 | 285 | \ |
duke@435 | 286 | notproduct(bool, TraceLoopUnswitching, false, \ |
duke@435 | 287 | "Trace loop unswitching") \ |
duke@435 | 288 | \ |
duke@435 | 289 | product(bool, UseSuperWord, true, \ |
duke@435 | 290 | "Transform scalar operations into superword operations") \ |
duke@435 | 291 | \ |
duke@435 | 292 | develop(bool, SuperWordRTDepCheck, false, \ |
duke@435 | 293 | "Enable runtime dependency checks.") \ |
duke@435 | 294 | \ |
duke@435 | 295 | product(bool, TraceSuperWord, false, \ |
duke@435 | 296 | "Trace superword transforms") \ |
duke@435 | 297 | \ |
duke@435 | 298 | product_pd(bool, OptoBundling, \ |
duke@435 | 299 | "Generate nops to fill i-cache lines") \ |
duke@435 | 300 | \ |
duke@435 | 301 | product_pd(intx, ConditionalMoveLimit, \ |
duke@435 | 302 | "Limit of ops to make speculative when using CMOVE") \ |
duke@435 | 303 | \ |
duke@435 | 304 | /* Set BranchOnRegister == false. See 4965987. */ \ |
duke@435 | 305 | product(bool, BranchOnRegister, false, \ |
duke@435 | 306 | "Use Sparc V9 branch-on-register opcodes") \ |
duke@435 | 307 | \ |
duke@435 | 308 | develop(bool, SparcV9RegsHiBitsZero, true, \ |
duke@435 | 309 | "Assume Sparc V9 I&L registers on V8+ systems are zero-extended") \ |
duke@435 | 310 | \ |
twisti@2350 | 311 | product(bool, UseRDPCForConstantTableBase, false, \ |
twisti@2350 | 312 | "Use Sparc RDPC instruction for the constant table base.") \ |
twisti@2350 | 313 | \ |
duke@435 | 314 | develop(intx, PrintIdealGraphLevel, 0, \ |
duke@435 | 315 | "Print ideal graph to XML file / network interface. " \ |
duke@435 | 316 | "By default attempts to connect to the visualizer on a socket.") \ |
duke@435 | 317 | \ |
duke@435 | 318 | develop(intx, PrintIdealGraphPort, 4444, \ |
duke@435 | 319 | "Ideal graph printer to network port") \ |
duke@435 | 320 | \ |
kvn@869 | 321 | notproduct(ccstr, PrintIdealGraphAddress, "127.0.0.1", \ |
duke@435 | 322 | "IP address to connect to visualizer") \ |
duke@435 | 323 | \ |
kvn@869 | 324 | notproduct(ccstr, PrintIdealGraphFile, NULL, \ |
duke@435 | 325 | "File to dump ideal graph to. If set overrides the " \ |
duke@435 | 326 | "use of the network") \ |
duke@435 | 327 | \ |
duke@435 | 328 | product(bool, UseOldInlining, true, \ |
duke@435 | 329 | "Enable the 1.3 inlining strategy") \ |
duke@435 | 330 | \ |
duke@435 | 331 | product(bool, UseBimorphicInlining, true, \ |
duke@435 | 332 | "Profiling based inlining for two receivers") \ |
duke@435 | 333 | \ |
duke@435 | 334 | product(bool, UseOnlyInlinedBimorphic, true, \ |
duke@435 | 335 | "Don't use BimorphicInlining if can't inline a second method") \ |
duke@435 | 336 | \ |
duke@435 | 337 | product(bool, InsertMemBarAfterArraycopy, true, \ |
duke@435 | 338 | "Insert memory barrier after arraycopy call") \ |
duke@435 | 339 | \ |
kvn@2040 | 340 | develop(bool, SubsumeLoads, true, \ |
kvn@2040 | 341 | "Attempt to compile while subsuming loads into machine instructions.") \ |
kvn@2040 | 342 | \ |
kvn@2040 | 343 | develop(bool, StressRecompilation, false, \ |
kvn@2040 | 344 | "Recompile each compiled method without subsuming loads or escape analysis.") \ |
kvn@2040 | 345 | \ |
duke@435 | 346 | /* controls for tier 1 compilations */ \ |
duke@435 | 347 | \ |
duke@435 | 348 | develop(bool, Tier1CountInvocations, true, \ |
duke@435 | 349 | "Generate code, during tier 1, to update invocation counter") \ |
duke@435 | 350 | \ |
duke@435 | 351 | product(intx, Tier1Inline, false, \ |
duke@435 | 352 | "enable inlining during tier 1") \ |
duke@435 | 353 | \ |
duke@435 | 354 | product(intx, Tier1MaxInlineSize, 8, \ |
duke@435 | 355 | "maximum bytecode size of a method to be inlined, during tier 1") \ |
duke@435 | 356 | \ |
duke@435 | 357 | product(intx, Tier1FreqInlineSize, 35, \ |
duke@435 | 358 | "max bytecode size of a frequent method to be inlined, tier 1") \ |
duke@435 | 359 | \ |
duke@435 | 360 | develop(intx, ImplicitNullCheckThreshold, 3, \ |
duke@435 | 361 | "Don't do implicit null checks if NPE's in a method exceeds limit") \ |
duke@435 | 362 | \ |
duke@435 | 363 | /* controls for loop optimization */ \ |
duke@435 | 364 | product(intx, Tier1LoopOptsCount, 0, \ |
duke@435 | 365 | "Set level of loop optimization for tier 1 compiles") \ |
duke@435 | 366 | \ |
duke@435 | 367 | product(intx, LoopOptsCount, 43, \ |
duke@435 | 368 | "Set level of loop optimization for tier 1 compiles") \ |
duke@435 | 369 | \ |
duke@435 | 370 | /* controls for heat-based inlining */ \ |
duke@435 | 371 | \ |
duke@435 | 372 | develop(intx, NodeCountInliningCutoff, 18000, \ |
duke@435 | 373 | "If parser node generation exceeds limit stop inlining") \ |
duke@435 | 374 | \ |
duke@435 | 375 | develop(intx, NodeCountInliningStep, 1000, \ |
duke@435 | 376 | "Target size of warm calls inlined between optimization passes") \ |
duke@435 | 377 | \ |
duke@435 | 378 | develop(bool, InlineWarmCalls, false, \ |
duke@435 | 379 | "Use a heat-based priority queue to govern inlining") \ |
duke@435 | 380 | \ |
duke@435 | 381 | develop(intx, HotCallCountThreshold, 999999, \ |
duke@435 | 382 | "large numbers of calls (per method invocation) force hotness") \ |
duke@435 | 383 | \ |
duke@435 | 384 | develop(intx, HotCallProfitThreshold, 999999, \ |
duke@435 | 385 | "highly profitable inlining opportunities force hotness") \ |
duke@435 | 386 | \ |
duke@435 | 387 | develop(intx, HotCallTrivialWork, -1, \ |
duke@435 | 388 | "trivial execution time (no larger than this) forces hotness") \ |
duke@435 | 389 | \ |
duke@435 | 390 | develop(intx, HotCallTrivialSize, -1, \ |
duke@435 | 391 | "trivial methods (no larger than this) force calls to be hot") \ |
duke@435 | 392 | \ |
duke@435 | 393 | develop(intx, WarmCallMinCount, -1, \ |
duke@435 | 394 | "number of calls (per method invocation) to enable inlining") \ |
duke@435 | 395 | \ |
duke@435 | 396 | develop(intx, WarmCallMinProfit, -1, \ |
duke@435 | 397 | "number of calls (per method invocation) to enable inlining") \ |
duke@435 | 398 | \ |
duke@435 | 399 | develop(intx, WarmCallMaxWork, 999999, \ |
duke@435 | 400 | "execution time of the largest inlinable method") \ |
duke@435 | 401 | \ |
duke@435 | 402 | develop(intx, WarmCallMaxSize, 999999, \ |
duke@435 | 403 | "size of the largest inlinable method") \ |
duke@435 | 404 | \ |
duke@435 | 405 | product(intx, MaxNodeLimit, 65000, \ |
duke@435 | 406 | "Maximum number of nodes") \ |
duke@435 | 407 | \ |
duke@435 | 408 | product(intx, NodeLimitFudgeFactor, 1000, \ |
duke@435 | 409 | "Fudge Factor for certain optimizations") \ |
duke@435 | 410 | \ |
duke@435 | 411 | product(bool, UseJumpTables, true, \ |
duke@435 | 412 | "Use JumpTables instead of a binary search tree for switches") \ |
duke@435 | 413 | \ |
duke@435 | 414 | product(bool, UseDivMod, true, \ |
duke@435 | 415 | "Use combined DivMod instruction if available") \ |
duke@435 | 416 | \ |
duke@435 | 417 | product(intx, MinJumpTableSize, 18, \ |
duke@435 | 418 | "Minimum number of targets in a generated jump table") \ |
duke@435 | 419 | \ |
duke@435 | 420 | product(intx, MaxJumpTableSize, 65000, \ |
duke@435 | 421 | "Maximum number of targets in a generated jump table") \ |
duke@435 | 422 | \ |
duke@435 | 423 | product(intx, MaxJumpTableSparseness, 5, \ |
duke@435 | 424 | "Maximum sparseness for jumptables") \ |
duke@435 | 425 | \ |
duke@435 | 426 | product(bool, EliminateLocks, true, \ |
duke@435 | 427 | "Coarsen locks when possible") \ |
duke@435 | 428 | \ |
duke@435 | 429 | notproduct(bool, PrintLockStatistics, false, \ |
duke@435 | 430 | "Print precise statistics on the dynamic lock usage") \ |
duke@435 | 431 | \ |
duke@435 | 432 | diagnostic(bool, PrintPreciseBiasedLockingStatistics, false, \ |
duke@435 | 433 | "Print per-lock-site statistics of biased locking in JVM") \ |
duke@435 | 434 | \ |
duke@435 | 435 | notproduct(bool, PrintEliminateLocks, false, \ |
duke@435 | 436 | "Print out when locks are eliminated") \ |
duke@435 | 437 | \ |
never@452 | 438 | diagnostic(bool, EliminateAutoBox, false, \ |
never@452 | 439 | "Private flag to control optimizations for autobox elimination") \ |
never@452 | 440 | \ |
never@452 | 441 | product(intx, AutoBoxCacheMax, 128, \ |
never@452 | 442 | "Sets max value cached by the java.lang.Integer autobox cache") \ |
never@452 | 443 | \ |
kvn@1365 | 444 | product(bool, DoEscapeAnalysis, true, \ |
duke@435 | 445 | "Perform escape analysis") \ |
duke@435 | 446 | \ |
duke@435 | 447 | notproduct(bool, PrintEscapeAnalysis, false, \ |
duke@435 | 448 | "Print the results of escape analysis") \ |
duke@435 | 449 | \ |
duke@435 | 450 | product(bool, EliminateAllocations, true, \ |
duke@435 | 451 | "Use escape analysis to eliminate allocations") \ |
duke@435 | 452 | \ |
kvn@500 | 453 | notproduct(bool, PrintEliminateAllocations, false, \ |
kvn@500 | 454 | "Print out when allocations are eliminated") \ |
kvn@500 | 455 | \ |
kvn@500 | 456 | product(intx, EliminateAllocationArraySizeLimit, 64, \ |
kvn@500 | 457 | "Array size (number of elements) limit for scalar replacement") \ |
kvn@500 | 458 | \ |
kvn@1108 | 459 | product(bool, UseOptoBiasInlining, true, \ |
kvn@855 | 460 | "Generate biased locking code in C2 ideal graph") \ |
kvn@855 | 461 | \ |
cfang@1516 | 462 | product(bool, OptimizeStringConcat, false, \ |
never@1515 | 463 | "Optimize the construction of Strings by StringBuilder") \ |
never@1515 | 464 | \ |
never@1515 | 465 | notproduct(bool, PrintOptimizeStringConcat, false, \ |
never@1515 | 466 | "Print information about transformations performed on Strings") \ |
never@1515 | 467 | \ |
kvn@688 | 468 | product(intx, ValueSearchLimit, 1000, \ |
kvn@688 | 469 | "Recursion limit in PhaseMacroExpand::value_from_mem_phi") \ |
kvn@688 | 470 | \ |
duke@435 | 471 | product(intx, MaxLabelRootDepth, 1100, \ |
duke@435 | 472 | "Maximum times call Label_Root to prevent stack overflow") \ |
kvn@590 | 473 | \ |
kvn@590 | 474 | diagnostic(intx, DominatorSearchLimit, 1000, \ |
kvn@590 | 475 | "Iterations limit in Node::dominates") \ |
rasbold@853 | 476 | \ |
rasbold@853 | 477 | product(bool, BlockLayoutByFrequency, true, \ |
rasbold@853 | 478 | "Use edge frequencies to drive block ordering") \ |
rasbold@853 | 479 | \ |
rasbold@853 | 480 | product(intx, BlockLayoutMinDiamondPercentage, 20, \ |
rasbold@853 | 481 | "Miniumum %% of a successor (predecessor) for which block layout "\ |
rasbold@853 | 482 | "a will allow a fork (join) in a single chain") \ |
rasbold@853 | 483 | \ |
kvn@1108 | 484 | product(bool, BlockLayoutRotateLoops, true, \ |
rasbold@853 | 485 | "Allow back branches to be fall throughs in the block layour") \ |
duke@435 | 486 | |
never@1515 | 487 | 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 | 488 | |
stefank@2314 | 489 | #endif // SHARE_VM_OPTO_C2_GLOBALS_HPP |