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

src/share/vm/opto/c2_globals.hpp@0fbdb4381b99 (annotated)

src/share/vm/opto/c2_globals.hpp

Mon, 09 Mar 2009 13:28:46 -0700

author

xdono

date

Mon, 09 Mar 2009 13:28:46 -0700

changeset 1014

0fbdb4381b99

parent 985

96964ebdb154

child 1108

fbc12e71c476

permissions

-rw-r--r--

6814575: Update copyright year
Summary: Update copyright for files that have been modified in 2009, up to 03/09
Reviewed-by: katleman, tbell, ohair

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