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

src/share/vm/opto/c2_globals.hpp@6f8f439e247d (annotated)

src/share/vm/opto/c2_globals.hpp

Tue, 19 Jun 2012 15:12:56 -0700

author

kvn

date

Tue, 19 Jun 2012 15:12:56 -0700

changeset 3886

6f8f439e247d

parent 3882

8c92982cbbc4

child 4020

a5dd6e3ef9f3

permissions

-rw-r--r--

7177923: SIGBUS on sparc in compiled code for java.util.Calendar.clear()
Summary: disable vectorization of a memory access with more elements per vector than one which is used for alignment on sparc
Reviewed-by: twisti

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