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