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