Mercurial > jdk8-mips64-public > hotspot / file revision
src/share/vm/opto/c2_globals.hpp@fd13a567f179
src/share/vm/opto/c2_globals.hpp
Thu, 24 May 2018 19:26:50 +0800
- author
- aoqi
- date
- Thu, 24 May 2018 19:26:50 +0800
- changeset 8862
- fd13a567f179
- parent 8604
- 04d83ba48607
- child 9852
- 70aa912cebe5
- permissions
- -rw-r--r--
#7046 C2 supports long branch
Contributed-by: fujie
1 /*
2 * Copyright (c) 2000, 2013, Oracle and/or its affiliates. All rights reserved.
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 *
5 * This code is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU General Public License version 2 only, as
7 * published by the Free Software Foundation.
8 *
9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 * version 2 for more details (a copy is included in the LICENSE file that
13 * accompanied this code).
14 *
15 * You should have received a copy of the GNU General Public License version
16 * 2 along with this work; if not, write to the Free Software Foundation,
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 *
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
25 /*
26 * This file has been modified by Loongson Technology in 2015. These
27 * modifications are Copyright (c) 2015 Loongson Technology, and are made
28 * available on the same license terms set forth above.
29 */
31 #ifndef SHARE_VM_OPTO_C2_GLOBALS_HPP
32 #define SHARE_VM_OPTO_C2_GLOBALS_HPP
34 #include "runtime/globals.hpp"
35 #ifdef TARGET_ARCH_x86
36 # include "c2_globals_x86.hpp"
37 #endif
38 #ifdef TARGET_ARCH_sparc
39 # include "c2_globals_sparc.hpp"
40 #endif
41 #ifdef TARGET_ARCH_mips
42 # include "c2_globals_mips.hpp"
43 #endif
44 #ifdef TARGET_ARCH_arm
45 # include "c2_globals_arm.hpp"
46 #endif
47 #ifdef TARGET_ARCH_ppc
48 # include "c2_globals_ppc.hpp"
49 #endif
50 #ifdef TARGET_OS_FAMILY_linux
51 # include "c2_globals_linux.hpp"
52 #endif
53 #ifdef TARGET_OS_FAMILY_solaris
54 # include "c2_globals_solaris.hpp"
55 #endif
56 #ifdef TARGET_OS_FAMILY_windows
57 # include "c2_globals_windows.hpp"
58 #endif
59 #ifdef TARGET_OS_FAMILY_aix
60 # include "c2_globals_aix.hpp"
61 #endif
62 #ifdef TARGET_OS_FAMILY_bsd
63 # include "c2_globals_bsd.hpp"
64 #endif
66 //
67 // Defines all globals flags used by the server compiler.
68 //
70 #define C2_FLAGS(develop, develop_pd, product, product_pd, diagnostic, experimental, notproduct) \
71 \
72 develop(bool, StressLCM, false, \
73 "Randomize instruction scheduling in LCM") \
74 \
75 develop(bool, StressGCM, false, \
76 "Randomize instruction scheduling in GCM") \
77 \
78 notproduct(intx, CompileZapFirst, 0, \
79 "If +ZapDeadCompiledLocals, " \
80 "skip this many before compiling in zap calls") \
81 \
82 notproduct(intx, CompileZapLast, -1, \
83 "If +ZapDeadCompiledLocals, " \
84 "compile this many after skipping (incl. skip count, -1 = all)") \
85 \
86 notproduct(intx, ZapDeadCompiledLocalsFirst, 0, \
87 "If +ZapDeadCompiledLocals, " \
88 "skip this many before really doing it") \
89 \
90 notproduct(intx, ZapDeadCompiledLocalsLast, -1, \
91 "If +ZapDeadCompiledLocals, " \
92 "do this many after skipping (incl. skip count, -1 = all)") \
93 \
94 develop(intx, OptoPrologueNops, 0, \
95 "Insert this many extra nop instructions " \
96 "in the prologue of every nmethod") \
97 \
98 product_pd(intx, InteriorEntryAlignment, \
99 "Code alignment for interior entry points " \
100 "in generated code (in bytes)") \
101 \
102 product(intx, MaxLoopPad, (OptoLoopAlignment-1), \
103 "Align a loop if padding size in bytes is less or equal to this value") \
104 \
105 product(intx, MaxVectorSize, 32, \
106 "Max vector size in bytes, " \
107 "actual size could be less depending on elements type") \
108 \
109 product(bool, AlignVector, true, \
110 "Perform vector store/load alignment in loop") \
111 \
112 product(intx, NumberOfLoopInstrToAlign, 4, \
113 "Number of first instructions in a loop to align") \
114 \
115 notproduct(intx, IndexSetWatch, 0, \
116 "Trace all operations on this IndexSet (-1 means all, 0 none)") \
117 \
118 develop(intx, OptoNodeListSize, 4, \
119 "Starting allocation size of Node_List data structures") \
120 \
121 develop(intx, OptoBlockListSize, 8, \
122 "Starting allocation size of Block_List data structures") \
123 \
124 develop(intx, OptoPeepholeAt, -1, \
125 "Apply peephole optimizations to this peephole rule") \
126 \
127 notproduct(bool, PrintIdeal, false, \
128 "Print ideal graph before code generation") \
129 \
130 notproduct(bool, PrintOpto, false, \
131 "Print compiler2 attempts") \
132 \
133 notproduct(bool, PrintOptoInlining, false, \
134 "Print compiler2 inlining decisions") \
135 \
136 notproduct(bool, VerifyOpto, false, \
137 "Apply more time consuming verification during compilation") \
138 \
139 notproduct(bool, VerifyIdealNodeCount, false, \
140 "Verify that tracked dead ideal node count is accurate") \
141 \
142 notproduct(bool, PrintIdealNodeCount, false, \
143 "Print liveness counts of ideal nodes") \
144 \
145 notproduct(bool, VerifyOptoOopOffsets, false, \
146 "Check types of base addresses in field references") \
147 \
148 develop(bool, IdealizedNumerics, false, \
149 "Check performance difference allowing FP " \
150 "associativity and commutativity...") \
151 \
152 develop(bool, OptoBreakpoint, false, \
153 "insert breakpoint at method entry") \
154 \
155 notproduct(bool, OptoBreakpointOSR, false, \
156 "insert breakpoint at osr method entry") \
157 \
158 notproduct(intx, BreakAtNode, 0, \
159 "Break at construction of this Node (either _idx or _debug_idx)") \
160 \
161 notproduct(bool, OptoBreakpointC2R, false, \
162 "insert breakpoint at runtime stub entry") \
163 \
164 notproduct(bool, OptoNoExecute, false, \
165 "Attempt to parse and compile but do not execute generated code") \
166 \
167 notproduct(bool, PrintOptoStatistics, false, \
168 "Print New compiler statistics") \
169 \
170 notproduct(bool, PrintOptoAssembly, false, \
171 "Print New compiler assembly output") \
172 \
173 develop_pd(bool, OptoPeephole, \
174 "Apply peephole optimizations after register allocation") \
175 \
176 develop(bool, OptoRemoveUseless, true, \
177 "Remove useless nodes after parsing") \
178 \
179 notproduct(bool, PrintFrameConverterAssembly, false, \
180 "Print New compiler assembly output for frame converters") \
181 \
182 notproduct(bool, PrintParseStatistics, false, \
183 "Print nodes, transforms and new values made per bytecode parsed")\
184 \
185 notproduct(bool, PrintOptoPeephole, false, \
186 "Print New compiler peephole replacements") \
187 \
188 develop(bool, PrintCFGBlockFreq, false, \
189 "Print CFG block freqencies") \
190 \
191 develop(bool, TraceOptoParse, false, \
192 "Trace bytecode parse and control-flow merge") \
193 \
194 product_pd(intx, LoopUnrollLimit, \
195 "Unroll loop bodies with node count less than this") \
196 \
197 product(intx, LoopMaxUnroll, 16, \
198 "Maximum number of unrolls for main loop") \
199 \
200 product(intx, LoopUnrollMin, 4, \
201 "Minimum number of unroll loop bodies before checking progress" \
202 "of rounds of unroll,optimize,..") \
203 \
204 develop(intx, UnrollLimitForProfileCheck, 1, \
205 "Don't use profile_trip_cnt() to restrict unrolling until " \
206 "unrolling would push the number of unrolled iterations above " \
207 "UnrollLimitForProfileCheck. A higher value allows more " \
208 "unrolling. Zero acts as a very large value." ) \
209 \
210 product(intx, MultiArrayExpandLimit, 6, \
211 "Maximum number of individual allocations in an inline-expanded " \
212 "multianewarray instruction") \
213 \
214 notproduct(bool, TraceProfileTripCount, false, \
215 "Trace profile loop trip count information") \
216 \
217 product(bool, UseCountedLoopSafepoints, false, \
218 "Force counted loops to keep a safepoint") \
219 \
220 product(bool, UseLoopPredicate, true, \
221 "Generate a predicate to select fast/slow loop versions") \
222 \
223 develop(bool, TraceLoopPredicate, false, \
224 "Trace generation of loop predicates") \
225 \
226 develop(bool, TraceLoopOpts, false, \
227 "Trace executed loop optimizations") \
228 \
229 diagnostic(bool, LoopLimitCheck, true, \
230 "Generate a loop limits check for overflow") \
231 \
232 develop(bool, TraceLoopLimitCheck, false, \
233 "Trace generation of loop limits checks") \
234 \
235 diagnostic(bool, RangeLimitCheck, true, \
236 "Additional overflow checks during range check elimination") \
237 \
238 develop(bool, TraceRangeLimitCheck, false, \
239 "Trace additional overflow checks in RCE") \
240 \
241 diagnostic(bool, UnrollLimitCheck, true, \
242 "Additional overflow checks during loop unroll") \
243 \
244 /* OptimizeFill not yet supported on PowerPC. */ \
245 product(bool, OptimizeFill, true PPC64_ONLY(&& false), \
246 "convert fill/copy loops into intrinsic") \
247 \
248 develop(bool, TraceOptimizeFill, false, \
249 "print detailed information about fill conversion") \
250 \
251 develop(bool, OptoCoalesce, true, \
252 "Use Conservative Copy Coalescing in the Register Allocator") \
253 \
254 develop(bool, UseUniqueSubclasses, true, \
255 "Narrow an abstract reference to the unique concrete subclass") \
256 \
257 develop(bool, UseExactTypes, true, \
258 "Use exact types to eliminate array store checks and v-calls") \
259 \
260 product(intx, TrackedInitializationLimit, 50, \
261 "When initializing fields, track up to this many words") \
262 \
263 product(bool, ReduceFieldZeroing, true, \
264 "When initializing fields, try to avoid needless zeroing") \
265 \
266 product(bool, ReduceInitialCardMarks, true, \
267 "When initializing fields, try to avoid needless card marks") \
268 \
269 product(bool, ReduceBulkZeroing, true, \
270 "When bulk-initializing, try to avoid needless zeroing") \
271 \
272 product(bool, UseFPUForSpilling, false, \
273 "Spill integer registers to FPU instead of stack when possible") \
274 \
275 develop_pd(intx, RegisterCostAreaRatio, \
276 "Spill selection in reg allocator: scale area by (X/64K) before " \
277 "adding cost") \
278 \
279 develop_pd(bool, UseCISCSpill, \
280 "Use ADLC supplied cisc instructions during allocation") \
281 \
282 notproduct(bool, VerifyGraphEdges , false, \
283 "Verify Bi-directional Edges") \
284 \
285 notproduct(bool, VerifyDUIterators, true, \
286 "Verify the safety of all iterations of Bi-directional Edges") \
287 \
288 notproduct(bool, VerifyHashTableKeys, true, \
289 "Verify the immutability of keys in the VN hash tables") \
290 \
291 notproduct(bool, VerifyRegisterAllocator , false, \
292 "Verify Register Allocator") \
293 \
294 develop_pd(intx, FLOATPRESSURE, \
295 "Number of float LRG's that constitute high register pressure") \
296 \
297 develop_pd(intx, INTPRESSURE, \
298 "Number of integer LRG's that constitute high register pressure") \
299 \
300 notproduct(bool, TraceOptoPipelining, false, \
301 "Trace pipelining information") \
302 \
303 notproduct(bool, TraceOptoOutput, false, \
304 "Trace pipelining information") \
305 \
306 product_pd(bool, OptoScheduling, \
307 "Instruction Scheduling after register allocation") \
308 \
309 product(bool, PartialPeelLoop, true, \
310 "Partial peel (rotate) loops") \
311 \
312 product(intx, PartialPeelNewPhiDelta, 0, \
313 "Additional phis that can be created by partial peeling") \
314 \
315 notproduct(bool, TracePartialPeeling, false, \
316 "Trace partial peeling (loop rotation) information") \
317 \
318 product(bool, PartialPeelAtUnsignedTests, true, \
319 "Partial peel at unsigned tests if no signed test exists") \
320 \
321 product(bool, ReassociateInvariants, true, \
322 "Enable reassociation of expressions with loop invariants.") \
323 \
324 product(bool, LoopUnswitching, true, \
325 "Enable loop unswitching (a form of invariant test hoisting)") \
326 \
327 notproduct(bool, TraceLoopUnswitching, false, \
328 "Trace loop unswitching") \
329 \
330 product(bool, UseSuperWord, true, \
331 "Transform scalar operations into superword operations") \
332 \
333 develop(bool, SuperWordRTDepCheck, false, \
334 "Enable runtime dependency checks.") \
335 \
336 notproduct(bool, TraceSuperWord, false, \
337 "Trace superword transforms") \
338 \
339 notproduct(bool, TraceNewVectors, false, \
340 "Trace creation of Vector nodes") \
341 \
342 product_pd(bool, OptoBundling, \
343 "Generate nops to fill i-cache lines") \
344 \
345 product_pd(intx, ConditionalMoveLimit, \
346 "Limit of ops to make speculative when using CMOVE") \
347 \
348 /* Set BranchOnRegister == false. See 4965987. */ \
349 product(bool, BranchOnRegister, false, \
350 "Use Sparc V9 branch-on-register opcodes") \
351 \
352 develop(bool, SparcV9RegsHiBitsZero, true, \
353 "Assume Sparc V9 I&L registers on V8+ systems are zero-extended") \
354 \
355 product(bool, UseRDPCForConstantTableBase, false, \
356 "Use Sparc RDPC instruction for the constant table base.") \
357 \
358 develop(intx, PrintIdealGraphLevel, 0, \
359 "Print ideal graph to XML file / network interface. " \
360 "By default attempts to connect to the visualizer on a socket.") \
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, UseOldInlining, true, \
373 "Enable the 1.3 inlining strategy") \
374 \
375 product(bool, UseBimorphicInlining, true, \
376 "Profiling based inlining for two receivers") \
377 \
378 product(bool, UseOnlyInlinedBimorphic, true, \
379 "Don't use BimorphicInlining if can't inline a second method") \
380 \
381 product(bool, InsertMemBarAfterArraycopy, true, \
382 "Insert memory barrier after arraycopy call") \
383 \
384 develop(bool, SubsumeLoads, true, \
385 "Attempt to compile while subsuming loads into machine instructions.") \
386 \
387 develop(bool, StressRecompilation, false, \
388 "Recompile each compiled method without subsuming loads or escape analysis.") \
389 \
390 develop(intx, ImplicitNullCheckThreshold, 3, \
391 "Don't do implicit null checks if NPE's in a method exceeds 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 layout "\
538 "a will allow a fork (join) in a single chain") \
539 \
540 product(bool, BlockLayoutRotateLoops, true, \
541 "Allow back branches to be fall throughs in the block layour") \
542 \
543 develop(bool, InlineReflectionGetCallerClass, true, \
544 "inline sun.reflect.Reflection.getCallerClass(), known to be part "\
545 "of base library DLL") \
546 \
547 develop(bool, InlineObjectCopy, true, \
548 "inline Object.clone and Arrays.copyOf[Range] intrinsics") \
549 \
550 develop(bool, SpecialStringCompareTo, true, \
551 "special version of string compareTo") \
552 \
553 develop(bool, SpecialStringIndexOf, true, \
554 "special version of string indexOf") \
555 \
556 develop(bool, SpecialStringEquals, true, \
557 "special version of string equals") \
558 \
559 develop(bool, SpecialArraysEquals, true, \
560 "special version of Arrays.equals(char[],char[])") \
561 \
562 product(bool, SpecialEncodeISOArray, true, \
563 "special version of ISO_8859_1$Encoder.encodeISOArray") \
564 \
565 develop(bool, BailoutToInterpreterForThrows, false, \
566 "Compiled methods which throws/catches exceptions will be " \
567 "deopt and intp.") \
568 \
569 develop(bool, ConvertCmpD2CmpF, true, \
570 "Convert cmpD to cmpF when one input is constant in float range") \
571 \
572 develop(bool, ConvertFloat2IntClipping, true, \
573 "Convert float2int clipping idiom to integer clipping") \
574 \
575 develop(bool, Use24BitFPMode, true, \
576 "Set 24-bit FPU mode on a per-compile basis ") \
577 \
578 develop(bool, Use24BitFP, true, \
579 "use FP instructions that produce 24-bit precise results") \
580 \
581 develop(bool, MonomorphicArrayCheck, true, \
582 "Uncommon-trap array store checks that require full type check") \
583 \
584 notproduct(bool, TracePhaseCCP, false, \
585 "Print progress during Conditional Constant Propagation") \
586 \
587 develop(bool, PrintDominators, false, \
588 "Print out dominator trees for GVN") \
589 \
590 notproduct(bool, TraceSpilling, false, \
591 "Trace spilling") \
592 \
593 diagnostic(bool, TraceTypeProfile, false, \
594 "Trace type profile") \
595 \
596 develop(bool, PoisonOSREntry, true, \
597 "Detect abnormal calls to OSR code") \
598 \
599 product(bool, UseCondCardMark, false, \
600 "Check for already marked card before updating card table") \
601 \
602 develop(bool, SoftMatchFailure, trueInProduct, \
603 "If the DFA fails to match a node, print a message and bail out") \
604 \
605 develop(bool, InlineAccessors, true, \
606 "inline accessor methods (get/set)") \
607 \
608 product(intx, TypeProfileMajorReceiverPercent, 90, \
609 "% of major receiver type to all profiled receivers") \
610 \
611 notproduct(bool, TimeCompiler2, false, \
612 "detailed time the compiler (requires +TimeCompiler)") \
613 \
614 diagnostic(bool, PrintIntrinsics, false, \
615 "prints attempted and successful inlining of intrinsics") \
616 \
617 diagnostic(ccstrlist, DisableIntrinsic, "", \
618 "do not expand intrinsics whose (internal) names appear here") \
619 \
620 develop(bool, StressReflectiveCode, false, \
621 "Use inexact types at allocations, etc., to test reflection") \
622 \
623 diagnostic(bool, DebugInlinedCalls, true, \
624 "If false, restricts profiled locations to the root method only") \
625 \
626 notproduct(bool, VerifyLoopOptimizations, false, \
627 "verify major loop optimizations") \
628 \
629 diagnostic(bool, ProfileDynamicTypes, true, \
630 "do extra type profiling and use it more aggressively") \
631 \
632 develop(bool, TraceIterativeGVN, false, \
633 "Print progress during Iterative Global Value Numbering") \
634 \
635 develop(bool, VerifyIterativeGVN, false, \
636 "Verify Def-Use modifications during sparse Iterative Global " \
637 "Value Numbering") \
638 \
639 notproduct(bool, TraceCISCSpill, false, \
640 "Trace allocators use of cisc spillable instructions") \
641 \
642 product(bool, SplitIfBlocks, true, \
643 "Clone compares and control flow through merge points to fold " \
644 "some branches") \
645 \
646 develop(intx, FreqCountInvocations, 1, \
647 "Scaling factor for branch frequencies (deprecated)") \
648 \
649 product(intx, AliasLevel, 3, \
650 "0 for no aliasing, 1 for oop/field/static/array split, " \
651 "2 for class split, 3 for unique instances") \
652 \
653 develop(bool, VerifyAliases, false, \
654 "perform extra checks on the results of alias analysis") \
655 \
656 product(bool, IncrementalInline, true, \
657 "do post parse inlining") \
658 \
659 develop(bool, AlwaysIncrementalInline, false, \
660 "do all inlining incrementally") \
661 \
662 product(intx, LiveNodeCountInliningCutoff, 40000, \
663 "max number of live nodes in a method") \
664 \
665 diagnostic(bool, OptimizeExpensiveOps, true, \
666 "Find best control for expensive operations") \
667 \
668 product(bool, UseMathExactIntrinsics, true, \
669 "Enables intrinsification of various java.lang.Math functions") \
670 \
671 product(bool, UseMultiplyToLenIntrinsic, false, \
672 "Enables intrinsification of BigInteger.multiplyToLen()") \
673 \
674 product(bool, UseSquareToLenIntrinsic, false, \
675 "Enables intrinsification of BigInteger.squareToLen()") \
676 \
677 product(bool, UseMulAddIntrinsic, false, \
678 "Enables intrinsification of BigInteger.mulAdd()") \
679 \
680 product(bool, UseMontgomeryMultiplyIntrinsic, false, \
681 "Enables intrinsification of BigInteger.montgomeryMultiply()") \
682 \
683 product(bool, UseMontgomerySquareIntrinsic, false, \
684 "Enables intrinsification of BigInteger.montgomerySquare()") \
685 \
686 product(bool, UseTypeSpeculation, true, \
687 "Speculatively propagate types from profiles") \
688 \
689 diagnostic(bool, UseInlineDepthForSpeculativeTypes, true, \
690 "Carry inline depth of profile point with speculative type " \
691 "and give priority to profiling from lower inline depth") \
692 \
693 product_pd(bool, TrapBasedRangeChecks, \
694 "Generate code for range checks that uses a cmp and trap " \
695 "instruction raising SIGTRAP. Used on PPC64.") \
696 \
697 develop(bool, RenumberLiveNodes, true, \
698 "Renumber live nodes") \
700 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)
702 #endif // SHARE_VM_OPTO_C2_GLOBALS_HPP
