• file
• revisions
• annotate
• diff
• comparison
• raw

src/share/vm/opto/c2_globals.hpp@2c673161698a (annotated)

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

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