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