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

src/share/vm/opto/c2_globals.hpp@8033953d67ff (annotated)

src/share/vm/opto/c2_globals.hpp

Fri, 11 Mar 2011 22:34:57 -0800

author

jrose

date

Fri, 11 Mar 2011 22:34:57 -0800

changeset 2639

8033953d67ff

parent 2508

b92c45f2bc75

child 2665

9dc311b8473e

permissions

-rw-r--r--

7012648: move JSR 292 to package java.lang.invoke and adjust names
Summary: package and class renaming only; delete unused methods and classes
Reviewed-by: twisti

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