Print this page
rev 1838 : 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/compile.hpp
+++ new/src/share/vm/opto/compile.hpp
1 1 /*
2 2 * Copyright (c) 1997, 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 *
|
↓ open down ↓ |
22 lines elided |
↑ open up ↑ |
23 23 */
24 24
25 25 class Block;
26 26 class Bundle;
27 27 class C2Compiler;
28 28 class CallGenerator;
29 29 class ConnectionGraph;
30 30 class InlineTree;
31 31 class Int_Array;
32 32 class Matcher;
33 +class MachConstantBaseNode;
33 34 class MachNode;
34 35 class MachSafePointNode;
35 36 class Node;
36 37 class Node_Array;
37 38 class Node_Notes;
38 39 class OptoReg;
39 40 class PhaseCFG;
40 41 class PhaseGVN;
41 42 class PhaseIterGVN;
42 43 class PhaseRegAlloc;
43 44 class PhaseCCP;
44 45 class PhaseCCP_DCE;
45 46 class RootNode;
46 47 class relocInfo;
47 48 class Scope;
48 49 class StartNode;
49 50 class SafePointNode;
50 51 class JVMState;
51 52 class TypeData;
52 53 class TypePtr;
53 54 class TypeFunc;
54 55 class Unique_Node_List;
55 56 class nmethod;
56 57 class WarmCallInfo;
57 58
58 59 //------------------------------Compile----------------------------------------
59 60 // This class defines a top-level Compiler invocation.
60 61
61 62 class Compile : public Phase {
62 63 public:
63 64 // Fixed alias indexes. (See also MergeMemNode.)
64 65 enum {
65 66 AliasIdxTop = 1, // pseudo-index, aliases to nothing (used as sentinel value)
66 67 AliasIdxBot = 2, // pseudo-index, aliases to everything
67 68 AliasIdxRaw = 3 // hard-wired index for TypeRawPtr::BOTTOM
68 69 };
69 70
70 71 // Variant of TraceTime(NULL, &_t_accumulator, TimeCompiler);
71 72 // Integrated with logging. If logging is turned on, and dolog is true,
72 73 // then brackets are put into the log, with time stamps and node counts.
73 74 // (The time collection itself is always conditionalized on TimeCompiler.)
74 75 class TracePhase : public TraceTime {
75 76 private:
76 77 Compile* C;
77 78 CompileLog* _log;
78 79 public:
79 80 TracePhase(const char* name, elapsedTimer* accumulator, bool dolog);
80 81 ~TracePhase();
81 82 };
82 83
83 84 // Information per category of alias (memory slice)
84 85 class AliasType {
85 86 private:
86 87 friend class Compile;
87 88
88 89 int _index; // unique index, used with MergeMemNode
89 90 const TypePtr* _adr_type; // normalized address type
90 91 ciField* _field; // relevant instance field, or null if none
91 92 bool _is_rewritable; // false if the memory is write-once only
92 93 int _general_index; // if this is type is an instance, the general
93 94 // type that this is an instance of
94 95
95 96 void Init(int i, const TypePtr* at);
96 97
97 98 public:
98 99 int index() const { return _index; }
99 100 const TypePtr* adr_type() const { return _adr_type; }
100 101 ciField* field() const { return _field; }
101 102 bool is_rewritable() const { return _is_rewritable; }
102 103 bool is_volatile() const { return (_field ? _field->is_volatile() : false); }
103 104 int general_index() const { return (_general_index != 0) ? _general_index : _index; }
104 105
105 106 void set_rewritable(bool z) { _is_rewritable = z; }
106 107 void set_field(ciField* f) {
107 108 assert(!_field,"");
108 109 _field = f;
109 110 if (f->is_final()) _is_rewritable = false;
110 111 }
111 112
112 113 void print_on(outputStream* st) PRODUCT_RETURN;
113 114 };
114 115
115 116 enum {
116 117 logAliasCacheSize = 6,
117 118 AliasCacheSize = (1<<logAliasCacheSize)
118 119 };
119 120 struct AliasCacheEntry { const TypePtr* _adr_type; int _index; }; // simple duple type
120 121 enum {
121 122 trapHistLength = methodDataOopDesc::_trap_hist_limit
122 123 };
123 124
124 125 private:
125 126 // Fixed parameters to this compilation.
126 127 const int _compile_id;
127 128 const bool _save_argument_registers; // save/restore arg regs for trampolines
128 129 const bool _subsume_loads; // Load can be matched as part of a larger op.
129 130 const bool _do_escape_analysis; // Do escape analysis.
130 131 ciMethod* _method; // The method being compiled.
131 132 int _entry_bci; // entry bci for osr methods.
132 133 const TypeFunc* _tf; // My kind of signature
133 134 InlineTree* _ilt; // Ditto (temporary).
134 135 address _stub_function; // VM entry for stub being compiled, or NULL
135 136 const char* _stub_name; // Name of stub or adapter being compiled, or NULL
136 137 address _stub_entry_point; // Compile code entry for generated stub, or NULL
137 138
138 139 // Control of this compilation.
139 140 int _num_loop_opts; // Number of iterations for doing loop optimiztions
140 141 int _max_inline_size; // Max inline size for this compilation
141 142 int _freq_inline_size; // Max hot method inline size for this compilation
142 143 int _fixed_slots; // count of frame slots not allocated by the register
143 144 // allocator i.e. locks, original deopt pc, etc.
144 145 // For deopt
145 146 int _orig_pc_slot;
146 147 int _orig_pc_slot_offset_in_bytes;
147 148
148 149 int _major_progress; // Count of something big happening
149 150 bool _has_loops; // True if the method _may_ have some loops
150 151 bool _has_split_ifs; // True if the method _may_ have some split-if
151 152 bool _has_unsafe_access; // True if the method _may_ produce faults in unsafe loads or stores.
152 153 bool _has_stringbuilder; // True StringBuffers or StringBuilders are allocated
153 154 uint _trap_hist[trapHistLength]; // Cumulative traps
154 155 bool _trap_can_recompile; // Have we emitted a recompiling trap?
155 156 uint _decompile_count; // Cumulative decompilation counts.
156 157 bool _do_inlining; // True if we intend to do inlining
157 158 bool _do_scheduling; // True if we intend to do scheduling
158 159 bool _do_freq_based_layout; // True if we intend to do frequency based block layout
159 160 bool _do_count_invocations; // True if we generate code to count invocations
160 161 bool _do_method_data_update; // True if we generate code to update methodDataOops
161 162 int _AliasLevel; // Locally-adjusted version of AliasLevel flag.
162 163 bool _print_assembly; // True if we should dump assembly code for this compilation
163 164 #ifndef PRODUCT
164 165 bool _trace_opto_output;
165 166 bool _parsed_irreducible_loop; // True if ciTypeFlow detected irreducible loops during parsing
166 167 #endif
167 168
168 169 // JSR 292
169 170 bool _has_method_handle_invokes; // True if this method has MethodHandle invokes.
170 171
171 172 // Compilation environment.
172 173 Arena _comp_arena; // Arena with lifetime equivalent to Compile
173 174 ciEnv* _env; // CI interface
174 175 CompileLog* _log; // from CompilerThread
175 176 const char* _failure_reason; // for record_failure/failing pattern
176 177 GrowableArray<CallGenerator*>* _intrinsics; // List of intrinsics.
177 178 GrowableArray<Node*>* _macro_nodes; // List of nodes which need to be expanded before matching.
178 179 GrowableArray<Node*>* _predicate_opaqs; // List of Opaque1 nodes for the loop predicates.
179 180 ConnectionGraph* _congraph;
180 181 #ifndef PRODUCT
181 182 IdealGraphPrinter* _printer;
182 183 #endif
183 184
184 185 // Node management
185 186 uint _unique; // Counter for unique Node indices
186 187 debug_only(static int _debug_idx;) // Monotonic counter (not reset), use -XX:BreakAtNode=<idx>
|
↓ open down ↓ |
144 lines elided |
↑ open up ↑ |
187 188 Arena _node_arena; // Arena for new-space Nodes
188 189 Arena _old_arena; // Arena for old-space Nodes, lifetime during xform
189 190 RootNode* _root; // Unique root of compilation, or NULL after bail-out.
190 191 Node* _top; // Unique top node. (Reset by various phases.)
191 192
192 193 Node* _immutable_memory; // Initial memory state
193 194
194 195 Node* _recent_alloc_obj;
195 196 Node* _recent_alloc_ctl;
196 197
198 + MachConstantBaseNode* _mach_constant_base_node; // Constant table base node singleton.
199 +
200 +
197 201 // Blocked array of debugging and profiling information,
198 202 // tracked per node.
199 203 enum { _log2_node_notes_block_size = 8,
200 204 _node_notes_block_size = (1<<_log2_node_notes_block_size)
201 205 };
202 206 GrowableArray<Node_Notes*>* _node_note_array;
203 207 Node_Notes* _default_node_notes; // default notes for new nodes
204 208
205 209 // After parsing and every bulk phase we hang onto the Root instruction.
206 210 // The RootNode instruction is where the whole program begins. It produces
207 211 // the initial Control and BOTTOM for everybody else.
208 212
209 213 // Type management
210 214 Arena _Compile_types; // Arena for all types
211 215 Arena* _type_arena; // Alias for _Compile_types except in Initialize_shared()
212 216 Dict* _type_dict; // Intern table
213 217 void* _type_hwm; // Last allocation (see Type::operator new/delete)
214 218 size_t _type_last_size; // Last allocation size (see Type::operator new/delete)
215 219 ciMethod* _last_tf_m; // Cache for
216 220 const TypeFunc* _last_tf; // TypeFunc::make
217 221 AliasType** _alias_types; // List of alias types seen so far.
218 222 int _num_alias_types; // Logical length of _alias_types
219 223 int _max_alias_types; // Physical length of _alias_types
220 224 AliasCacheEntry _alias_cache[AliasCacheSize]; // Gets aliases w/o data structure walking
221 225
222 226 // Parsing, optimization
223 227 PhaseGVN* _initial_gvn; // Results of parse-time PhaseGVN
224 228 Unique_Node_List* _for_igvn; // Initial work-list for next round of Iterative GVN
225 229 WarmCallInfo* _warm_calls; // Sorted work-list for heat-based inlining.
226 230
227 231 GrowableArray<CallGenerator*> _late_inlines; // List of CallGenerators to be revisited after
228 232 // main parsing has finished.
229 233
230 234 // Matching, CFG layout, allocation, code generation
231 235 PhaseCFG* _cfg; // Results of CFG finding
232 236 bool _select_24_bit_instr; // We selected an instruction with a 24-bit result
233 237 bool _in_24_bit_fp_mode; // We are emitting instructions with 24-bit results
234 238 int _java_calls; // Number of java calls in the method
235 239 int _inner_loops; // Number of inner loops in the method
236 240 Matcher* _matcher; // Engine to map ideal to machine instructions
237 241 PhaseRegAlloc* _regalloc; // Results of register allocation.
238 242 int _frame_slots; // Size of total frame in stack slots
239 243 CodeOffsets _code_offsets; // Offsets into the code for various interesting entries
240 244 RegMask _FIRST_STACK_mask; // All stack slots usable for spills (depends on frame layout)
241 245 Arena* _indexSet_arena; // control IndexSet allocation within PhaseChaitin
242 246 void* _indexSet_free_block_list; // free list of IndexSet bit blocks
243 247
244 248 uint _node_bundling_limit;
245 249 Bundle* _node_bundling_base; // Information for instruction bundling
246 250
|
↓ open down ↓ |
40 lines elided |
↑ open up ↑ |
247 251 // Instruction bits passed off to the VM
248 252 int _method_size; // Size of nmethod code segment in bytes
249 253 CodeBuffer _code_buffer; // Where the code is assembled
250 254 int _first_block_size; // Size of unvalidated entry point code / OSR poison code
251 255 ExceptionHandlerTable _handler_table; // Table of native-code exception handlers
252 256 ImplicitExceptionTable _inc_table; // Table of implicit null checks in native code
253 257 OopMapSet* _oop_map_set; // Table of oop maps (one for each safepoint location)
254 258 static int _CompiledZap_count; // counter compared against CompileZap[First/Last]
255 259 BufferBlob* _scratch_buffer_blob; // For temporary code buffers.
256 260 relocInfo* _scratch_locs_memory; // For temporary code buffers.
261 + int _scratch_const_size; // For temporary code buffers.
262 + bool _in_scratch_emit_size; // true when in scratch_emit_size.
257 263
258 264 public:
259 265 // Accessors
260 266
261 267 // The Compile instance currently active in this (compiler) thread.
262 268 static Compile* current() {
263 269 return (Compile*) ciEnv::current()->compiler_data();
264 270 }
265 271
266 272 // ID for this compilation. Useful for setting breakpoints in the debugger.
267 273 int compile_id() const { return _compile_id; }
268 274
269 275 // Does this compilation allow instructions to subsume loads? User
270 276 // instructions that subsume a load may result in an unschedulable
271 277 // instruction sequence.
272 278 bool subsume_loads() const { return _subsume_loads; }
273 279 // Do escape analysis.
274 280 bool do_escape_analysis() const { return _do_escape_analysis; }
275 281 bool save_argument_registers() const { return _save_argument_registers; }
276 282
277 283
278 284 // Other fixed compilation parameters.
279 285 ciMethod* method() const { return _method; }
280 286 int entry_bci() const { return _entry_bci; }
281 287 bool is_osr_compilation() const { return _entry_bci != InvocationEntryBci; }
282 288 bool is_method_compilation() const { return (_method != NULL && !_method->flags().is_native()); }
283 289 const TypeFunc* tf() const { assert(_tf!=NULL, ""); return _tf; }
284 290 void init_tf(const TypeFunc* tf) { assert(_tf==NULL, ""); _tf = tf; }
285 291 InlineTree* ilt() const { return _ilt; }
286 292 address stub_function() const { return _stub_function; }
287 293 const char* stub_name() const { return _stub_name; }
288 294 address stub_entry_point() const { return _stub_entry_point; }
289 295
290 296 // Control of this compilation.
291 297 int fixed_slots() const { assert(_fixed_slots >= 0, ""); return _fixed_slots; }
292 298 void set_fixed_slots(int n) { _fixed_slots = n; }
293 299 int major_progress() const { return _major_progress; }
294 300 void set_major_progress() { _major_progress++; }
295 301 void clear_major_progress() { _major_progress = 0; }
296 302 int num_loop_opts() const { return _num_loop_opts; }
297 303 void set_num_loop_opts(int n) { _num_loop_opts = n; }
298 304 int max_inline_size() const { return _max_inline_size; }
299 305 void set_freq_inline_size(int n) { _freq_inline_size = n; }
300 306 int freq_inline_size() const { return _freq_inline_size; }
301 307 void set_max_inline_size(int n) { _max_inline_size = n; }
302 308 bool has_loops() const { return _has_loops; }
303 309 void set_has_loops(bool z) { _has_loops = z; }
304 310 bool has_split_ifs() const { return _has_split_ifs; }
305 311 void set_has_split_ifs(bool z) { _has_split_ifs = z; }
306 312 bool has_unsafe_access() const { return _has_unsafe_access; }
307 313 void set_has_unsafe_access(bool z) { _has_unsafe_access = z; }
308 314 bool has_stringbuilder() const { return _has_stringbuilder; }
309 315 void set_has_stringbuilder(bool z) { _has_stringbuilder = z; }
310 316 void set_trap_count(uint r, uint c) { assert(r < trapHistLength, "oob"); _trap_hist[r] = c; }
311 317 uint trap_count(uint r) const { assert(r < trapHistLength, "oob"); return _trap_hist[r]; }
312 318 bool trap_can_recompile() const { return _trap_can_recompile; }
313 319 void set_trap_can_recompile(bool z) { _trap_can_recompile = z; }
314 320 uint decompile_count() const { return _decompile_count; }
315 321 void set_decompile_count(uint c) { _decompile_count = c; }
316 322 bool allow_range_check_smearing() const;
317 323 bool do_inlining() const { return _do_inlining; }
318 324 void set_do_inlining(bool z) { _do_inlining = z; }
319 325 bool do_scheduling() const { return _do_scheduling; }
320 326 void set_do_scheduling(bool z) { _do_scheduling = z; }
321 327 bool do_freq_based_layout() const{ return _do_freq_based_layout; }
322 328 void set_do_freq_based_layout(bool z){ _do_freq_based_layout = z; }
323 329 bool do_count_invocations() const{ return _do_count_invocations; }
324 330 void set_do_count_invocations(bool z){ _do_count_invocations = z; }
325 331 bool do_method_data_update() const { return _do_method_data_update; }
326 332 void set_do_method_data_update(bool z) { _do_method_data_update = z; }
327 333 int AliasLevel() const { return _AliasLevel; }
328 334 bool print_assembly() const { return _print_assembly; }
329 335 void set_print_assembly(bool z) { _print_assembly = z; }
330 336 // check the CompilerOracle for special behaviours for this compile
331 337 bool method_has_option(const char * option) {
332 338 return method() != NULL && method()->has_option(option);
333 339 }
334 340 #ifndef PRODUCT
335 341 bool trace_opto_output() const { return _trace_opto_output; }
336 342 bool parsed_irreducible_loop() const { return _parsed_irreducible_loop; }
337 343 void set_parsed_irreducible_loop(bool z) { _parsed_irreducible_loop = z; }
338 344 #endif
339 345
340 346 // JSR 292
341 347 bool has_method_handle_invokes() const { return _has_method_handle_invokes; }
342 348 void set_has_method_handle_invokes(bool z) { _has_method_handle_invokes = z; }
343 349
344 350 void begin_method() {
345 351 #ifndef PRODUCT
346 352 if (_printer) _printer->begin_method(this);
347 353 #endif
348 354 }
349 355 void print_method(const char * name, int level = 1) {
350 356 #ifndef PRODUCT
351 357 if (_printer) _printer->print_method(this, name, level);
352 358 #endif
353 359 }
354 360 void end_method() {
355 361 #ifndef PRODUCT
356 362 if (_printer) _printer->end_method();
357 363 #endif
358 364 }
359 365
360 366 int macro_count() { return _macro_nodes->length(); }
361 367 int predicate_count() { return _predicate_opaqs->length();}
362 368 Node* macro_node(int idx) { return _macro_nodes->at(idx); }
363 369 Node* predicate_opaque1_node(int idx) { return _predicate_opaqs->at(idx);}
364 370 ConnectionGraph* congraph() { return _congraph;}
365 371 void set_congraph(ConnectionGraph* congraph) { _congraph = congraph;}
366 372 void add_macro_node(Node * n) {
367 373 //assert(n->is_macro(), "must be a macro node");
368 374 assert(!_macro_nodes->contains(n), " duplicate entry in expand list");
369 375 _macro_nodes->append(n);
370 376 }
371 377 void remove_macro_node(Node * n) {
372 378 // this function may be called twice for a node so check
373 379 // that the node is in the array before attempting to remove it
374 380 if (_macro_nodes->contains(n))
375 381 _macro_nodes->remove(n);
376 382 // remove from _predicate_opaqs list also if it is there
377 383 if (predicate_count() > 0 && _predicate_opaqs->contains(n)){
378 384 _predicate_opaqs->remove(n);
379 385 }
380 386 }
381 387 void add_predicate_opaq(Node * n) {
382 388 assert(!_predicate_opaqs->contains(n), " duplicate entry in predicate opaque1");
383 389 assert(_macro_nodes->contains(n), "should have already been in macro list");
384 390 _predicate_opaqs->append(n);
385 391 }
386 392 // remove the opaque nodes that protect the predicates so that the unused checks and
387 393 // uncommon traps will be eliminated from the graph.
388 394 void cleanup_loop_predicates(PhaseIterGVN &igvn);
389 395
390 396 // Compilation environment.
391 397 Arena* comp_arena() { return &_comp_arena; }
392 398 ciEnv* env() const { return _env; }
393 399 CompileLog* log() const { return _log; }
394 400 bool failing() const { return _env->failing() || _failure_reason != NULL; }
395 401 const char* failure_reason() { return _failure_reason; }
396 402 bool failure_reason_is(const char* r) { return (r==_failure_reason) || (r!=NULL && _failure_reason!=NULL && strcmp(r, _failure_reason)==0); }
397 403
398 404 void record_failure(const char* reason);
399 405 void record_method_not_compilable(const char* reason, bool all_tiers = false) {
400 406 // All bailouts cover "all_tiers" when TieredCompilation is off.
401 407 if (!TieredCompilation) all_tiers = true;
402 408 env()->record_method_not_compilable(reason, all_tiers);
403 409 // Record failure reason.
404 410 record_failure(reason);
405 411 }
406 412 void record_method_not_compilable_all_tiers(const char* reason) {
407 413 record_method_not_compilable(reason, true);
408 414 }
409 415 bool check_node_count(uint margin, const char* reason) {
410 416 if (unique() + margin > (uint)MaxNodeLimit) {
411 417 record_method_not_compilable(reason);
412 418 return true;
413 419 } else {
414 420 return false;
415 421 }
416 422 }
417 423
418 424 // Node management
419 425 uint unique() const { return _unique; }
420 426 uint next_unique() { return _unique++; }
421 427 void set_unique(uint i) { _unique = i; }
422 428 static int debug_idx() { return debug_only(_debug_idx)+0; }
423 429 static void set_debug_idx(int i) { debug_only(_debug_idx = i); }
424 430 Arena* node_arena() { return &_node_arena; }
425 431 Arena* old_arena() { return &_old_arena; }
426 432 RootNode* root() const { return _root; }
427 433 void set_root(RootNode* r) { _root = r; }
428 434 StartNode* start() const; // (Derived from root.)
|
↓ open down ↓ |
162 lines elided |
↑ open up ↑ |
429 435 void init_start(StartNode* s);
430 436 Node* immutable_memory();
431 437
432 438 Node* recent_alloc_ctl() const { return _recent_alloc_ctl; }
433 439 Node* recent_alloc_obj() const { return _recent_alloc_obj; }
434 440 void set_recent_alloc(Node* ctl, Node* obj) {
435 441 _recent_alloc_ctl = ctl;
436 442 _recent_alloc_obj = obj;
437 443 }
438 444
445 + MachConstantBaseNode* mach_constant_base_node();
446 + bool has_mach_constant_base_node() const { return _mach_constant_base_node != NULL; }
447 +
439 448 // Handy undefined Node
440 449 Node* top() const { return _top; }
441 450
442 451 // these are used by guys who need to know about creation and transformation of top:
443 452 Node* cached_top_node() { return _top; }
444 453 void set_cached_top_node(Node* tn);
445 454
446 455 GrowableArray<Node_Notes*>* node_note_array() const { return _node_note_array; }
447 456 void set_node_note_array(GrowableArray<Node_Notes*>* arr) { _node_note_array = arr; }
448 457 Node_Notes* default_node_notes() const { return _default_node_notes; }
449 458 void set_default_node_notes(Node_Notes* n) { _default_node_notes = n; }
450 459
451 460 Node_Notes* node_notes_at(int idx) {
452 461 return locate_node_notes(_node_note_array, idx, false);
453 462 }
454 463 inline bool set_node_notes_at(int idx, Node_Notes* value);
455 464
456 465 // Copy notes from source to dest, if they exist.
457 466 // Overwrite dest only if source provides something.
458 467 // Return true if information was moved.
459 468 bool copy_node_notes_to(Node* dest, Node* source);
460 469
461 470 // Workhorse function to sort out the blocked Node_Notes array:
462 471 inline Node_Notes* locate_node_notes(GrowableArray<Node_Notes*>* arr,
463 472 int idx, bool can_grow = false);
464 473
465 474 void grow_node_notes(GrowableArray<Node_Notes*>* arr, int grow_by);
466 475
467 476 // Type management
468 477 Arena* type_arena() { return _type_arena; }
469 478 Dict* type_dict() { return _type_dict; }
470 479 void* type_hwm() { return _type_hwm; }
471 480 size_t type_last_size() { return _type_last_size; }
472 481 int num_alias_types() { return _num_alias_types; }
473 482
474 483 void init_type_arena() { _type_arena = &_Compile_types; }
475 484 void set_type_arena(Arena* a) { _type_arena = a; }
476 485 void set_type_dict(Dict* d) { _type_dict = d; }
477 486 void set_type_hwm(void* p) { _type_hwm = p; }
478 487 void set_type_last_size(size_t sz) { _type_last_size = sz; }
479 488
480 489 const TypeFunc* last_tf(ciMethod* m) {
481 490 return (m == _last_tf_m) ? _last_tf : NULL;
482 491 }
483 492 void set_last_tf(ciMethod* m, const TypeFunc* tf) {
484 493 assert(m != NULL || tf == NULL, "");
485 494 _last_tf_m = m;
486 495 _last_tf = tf;
487 496 }
488 497
489 498 AliasType* alias_type(int idx) { assert(idx < num_alias_types(), "oob"); return _alias_types[idx]; }
490 499 AliasType* alias_type(const TypePtr* adr_type) { return find_alias_type(adr_type, false); }
491 500 bool have_alias_type(const TypePtr* adr_type);
492 501 AliasType* alias_type(ciField* field);
493 502
494 503 int get_alias_index(const TypePtr* at) { return alias_type(at)->index(); }
495 504 const TypePtr* get_adr_type(uint aidx) { return alias_type(aidx)->adr_type(); }
496 505 int get_general_index(uint aidx) { return alias_type(aidx)->general_index(); }
497 506
498 507 // Building nodes
499 508 void rethrow_exceptions(JVMState* jvms);
500 509 void return_values(JVMState* jvms);
501 510 JVMState* build_start_state(StartNode* start, const TypeFunc* tf);
502 511
503 512 // Decide how to build a call.
504 513 // The profile factor is a discount to apply to this site's interp. profile.
505 514 CallGenerator* call_generator(ciMethod* call_method, int vtable_index, bool call_is_virtual, JVMState* jvms, bool allow_inline, float profile_factor);
506 515 bool should_delay_inlining(ciMethod* call_method, JVMState* jvms);
507 516
508 517 // Report if there were too many traps at a current method and bci.
509 518 // Report if a trap was recorded, and/or PerMethodTrapLimit was exceeded.
510 519 // If there is no MDO at all, report no trap unless told to assume it.
511 520 bool too_many_traps(ciMethod* method, int bci, Deoptimization::DeoptReason reason);
512 521 // This version, unspecific to a particular bci, asks if
513 522 // PerMethodTrapLimit was exceeded for all inlined methods seen so far.
514 523 bool too_many_traps(Deoptimization::DeoptReason reason,
515 524 // Privately used parameter for logging:
516 525 ciMethodData* logmd = NULL);
517 526 // Report if there were too many recompiles at a method and bci.
518 527 bool too_many_recompiles(ciMethod* method, int bci, Deoptimization::DeoptReason reason);
519 528
520 529 // Parsing, optimization
521 530 PhaseGVN* initial_gvn() { return _initial_gvn; }
522 531 Unique_Node_List* for_igvn() { return _for_igvn; }
523 532 inline void record_for_igvn(Node* n); // Body is after class Unique_Node_List.
524 533 void set_initial_gvn(PhaseGVN *gvn) { _initial_gvn = gvn; }
525 534 void set_for_igvn(Unique_Node_List *for_igvn) { _for_igvn = for_igvn; }
526 535
527 536 // Replace n by nn using initial_gvn, calling hash_delete and
528 537 // record_for_igvn as needed.
529 538 void gvn_replace_by(Node* n, Node* nn);
530 539
531 540
532 541 void identify_useful_nodes(Unique_Node_List &useful);
533 542 void remove_useless_nodes (Unique_Node_List &useful);
534 543
535 544 WarmCallInfo* warm_calls() const { return _warm_calls; }
536 545 void set_warm_calls(WarmCallInfo* l) { _warm_calls = l; }
537 546 WarmCallInfo* pop_warm_call();
538 547
539 548 // Record this CallGenerator for inlining at the end of parsing.
540 549 void add_late_inline(CallGenerator* cg) { _late_inlines.push(cg); }
541 550
542 551 // Matching, CFG layout, allocation, code generation
543 552 PhaseCFG* cfg() { return _cfg; }
544 553 bool select_24_bit_instr() const { return _select_24_bit_instr; }
545 554 bool in_24_bit_fp_mode() const { return _in_24_bit_fp_mode; }
546 555 bool has_java_calls() const { return _java_calls > 0; }
547 556 int java_calls() const { return _java_calls; }
548 557 int inner_loops() const { return _inner_loops; }
549 558 Matcher* matcher() { return _matcher; }
550 559 PhaseRegAlloc* regalloc() { return _regalloc; }
551 560 int frame_slots() const { return _frame_slots; }
552 561 int frame_size_in_words() const; // frame_slots in units of the polymorphic 'words'
553 562 RegMask& FIRST_STACK_mask() { return _FIRST_STACK_mask; }
554 563 Arena* indexSet_arena() { return _indexSet_arena; }
555 564 void* indexSet_free_block_list() { return _indexSet_free_block_list; }
556 565 uint node_bundling_limit() { return _node_bundling_limit; }
557 566 Bundle* node_bundling_base() { return _node_bundling_base; }
558 567 void set_node_bundling_limit(uint n) { _node_bundling_limit = n; }
559 568 void set_node_bundling_base(Bundle* b) { _node_bundling_base = b; }
560 569 bool starts_bundle(const Node *n) const;
561 570 bool need_stack_bang(int frame_size_in_bytes) const;
562 571 bool need_register_stack_bang() const;
563 572
564 573 void set_matcher(Matcher* m) { _matcher = m; }
565 574 //void set_regalloc(PhaseRegAlloc* ra) { _regalloc = ra; }
566 575 void set_indexSet_arena(Arena* a) { _indexSet_arena = a; }
567 576 void set_indexSet_free_block_list(void* p) { _indexSet_free_block_list = p; }
568 577
569 578 // Remember if this compilation changes hardware mode to 24-bit precision
570 579 void set_24_bit_selection_and_mode(bool selection, bool mode) {
571 580 _select_24_bit_instr = selection;
572 581 _in_24_bit_fp_mode = mode;
573 582 }
574 583
575 584 void set_java_calls(int z) { _java_calls = z; }
576 585 void set_inner_loops(int z) { _inner_loops = z; }
577 586
578 587 // Instruction bits passed off to the VM
579 588 int code_size() { return _method_size; }
|
↓ open down ↓ |
131 lines elided |
↑ open up ↑ |
580 589 CodeBuffer* code_buffer() { return &_code_buffer; }
581 590 int first_block_size() { return _first_block_size; }
582 591 void set_frame_complete(int off) { _code_offsets.set_value(CodeOffsets::Frame_Complete, off); }
583 592 ExceptionHandlerTable* handler_table() { return &_handler_table; }
584 593 ImplicitExceptionTable* inc_table() { return &_inc_table; }
585 594 OopMapSet* oop_map_set() { return _oop_map_set; }
586 595 DebugInformationRecorder* debug_info() { return env()->debug_info(); }
587 596 Dependencies* dependencies() { return env()->dependencies(); }
588 597 static int CompiledZap_count() { return _CompiledZap_count; }
589 598 BufferBlob* scratch_buffer_blob() { return _scratch_buffer_blob; }
590 - void init_scratch_buffer_blob();
599 + void init_scratch_buffer_blob(int const_size);
600 + void clear_scratch_buffer_blob();
591 601 void set_scratch_buffer_blob(BufferBlob* b) { _scratch_buffer_blob = b; }
592 602 relocInfo* scratch_locs_memory() { return _scratch_locs_memory; }
593 603 void set_scratch_locs_memory(relocInfo* b) { _scratch_locs_memory = b; }
594 604
595 605 // emit to scratch blob, report resulting size
596 606 uint scratch_emit_size(const Node* n);
607 + void set_in_scratch_emit_size(bool x) { _in_scratch_emit_size = x; }
608 + bool in_scratch_emit_size() const { return _in_scratch_emit_size; }
597 609
598 610 enum ScratchBufferBlob {
599 611 MAX_inst_size = 1024,
600 612 MAX_locs_size = 128, // number of relocInfo elements
601 613 MAX_const_size = 128,
602 614 MAX_stubs_size = 128
603 615 };
604 616
605 617 // Major entry point. Given a Scope, compile the associated method.
606 618 // For normal compilations, entry_bci is InvocationEntryBci. For on stack
607 619 // replacement, entry_bci indicates the bytecode for which to compile a
608 620 // continuation.
609 621 Compile(ciEnv* ci_env, C2Compiler* compiler, ciMethod* target,
610 622 int entry_bci, bool subsume_loads, bool do_escape_analysis);
611 623
612 624 // Second major entry point. From the TypeFunc signature, generate code
613 625 // to pass arguments from the Java calling convention to the C calling
614 626 // convention.
615 627 Compile(ciEnv* ci_env, const TypeFunc *(*gen)(),
616 628 address stub_function, const char *stub_name,
617 629 int is_fancy_jump, bool pass_tls,
618 630 bool save_arg_registers, bool return_pc);
619 631
620 632 // From the TypeFunc signature, generate code to pass arguments
621 633 // from Compiled calling convention to Interpreter's calling convention
622 634 void Generate_Compiled_To_Interpreter_Graph(const TypeFunc *tf, address interpreter_entry);
623 635
624 636 // From the TypeFunc signature, generate code to pass arguments
625 637 // from Interpreter's calling convention to Compiler's calling convention
626 638 void Generate_Interpreter_To_Compiled_Graph(const TypeFunc *tf);
627 639
628 640 // Are we compiling a method?
629 641 bool has_method() { return method() != NULL; }
630 642
631 643 // Maybe print some information about this compile.
632 644 void print_compile_messages();
633 645
634 646 // Final graph reshaping, a post-pass after the regular optimizer is done.
635 647 bool final_graph_reshaping();
636 648
637 649 // returns true if adr is completely contained in the given alias category
638 650 bool must_alias(const TypePtr* adr, int alias_idx);
639 651
640 652 // returns true if adr overlaps with the given alias category
641 653 bool can_alias(const TypePtr* adr, int alias_idx);
642 654
643 655 // Driver for converting compiler's IR into machine code bits
644 656 void Output();
645 657
646 658 // Accessors for node bundling info.
647 659 Bundle* node_bundling(const Node *n);
648 660 bool valid_bundle_info(const Node *n);
649 661
650 662 // Schedule and Bundle the instructions
651 663 void ScheduleAndBundle();
652 664
653 665 // Build OopMaps for each GC point
654 666 void BuildOopMaps();
655 667
656 668 // Append debug info for the node "local" at safepoint node "sfpt" to the
657 669 // "array", May also consult and add to "objs", which describes the
658 670 // scalar-replaced objects.
659 671 void FillLocArray( int idx, MachSafePointNode* sfpt,
660 672 Node *local, GrowableArray<ScopeValue*> *array,
661 673 GrowableArray<ScopeValue*> *objs );
662 674
663 675 // If "objs" contains an ObjectValue whose id is "id", returns it, else NULL.
664 676 static ObjectValue* sv_for_node_id(GrowableArray<ScopeValue*> *objs, int id);
665 677 // Requres that "objs" does not contains an ObjectValue whose id matches
666 678 // that of "sv. Appends "sv".
|
↓ open down ↓ |
60 lines elided |
↑ open up ↑ |
667 679 static void set_sv_for_object_node(GrowableArray<ScopeValue*> *objs,
668 680 ObjectValue* sv );
669 681
670 682 // Process an OopMap Element while emitting nodes
671 683 void Process_OopMap_Node(MachNode *mach, int code_offset);
672 684
673 685 // Write out basic block data to code buffer
674 686 void Fill_buffer();
675 687
676 688 // Determine which variable sized branches can be shortened
677 - void Shorten_branches(Label *labels, int& code_size, int& reloc_size, int& stub_size, int& const_size);
689 + void Shorten_branches(Label *labels, int& code_size, int& reloc_size, int& stub_size);
678 690
679 691 // Compute the size of first NumberOfLoopInstrToAlign instructions
680 692 // at the head of a loop.
681 693 void compute_loop_first_inst_sizes();
682 694
683 695 // Compute the information for the exception tables
684 696 void FillExceptionTables(uint cnt, uint *call_returns, uint *inct_starts, Label *blk_labels);
685 697
686 698 // Stack slots that may be unused by the calling convention but must
687 699 // otherwise be preserved. On Intel this includes the return address.
688 700 // On PowerPC it includes the 4 words holding the old TOC & LR glue.
689 701 uint in_preserve_stack_slots();
690 702
691 703 // "Top of Stack" slots that may be unused by the calling convention but must
692 704 // otherwise be preserved.
693 705 // On Intel these are not necessary and the value can be zero.
694 706 // On Sparc this describes the words reserved for storing a register window
695 707 // when an interrupt occurs.
696 708 static uint out_preserve_stack_slots();
697 709
698 710 // Number of outgoing stack slots killed above the out_preserve_stack_slots
699 711 // for calls to C. Supports the var-args backing area for register parms.
700 712 uint varargs_C_out_slots_killed() const;
701 713
702 714 // Number of Stack Slots consumed by a synchronization entry
703 715 int sync_stack_slots() const;
704 716
705 717 // Compute the name of old_SP. See <arch>.ad for frame layout.
706 718 OptoReg::Name compute_old_SP();
707 719
708 720 #ifdef ENABLE_ZAP_DEAD_LOCALS
709 721 static bool is_node_getting_a_safepoint(Node*);
710 722 void Insert_zap_nodes();
711 723 Node* call_zap_node(MachSafePointNode* n, int block_no);
712 724 #endif
713 725
714 726 private:
715 727 // Phase control:
716 728 void Init(int aliaslevel); // Prepare for a single compilation
717 729 int Inline_Warm(); // Find more inlining work.
718 730 void Finish_Warm(); // Give up on further inlines.
719 731 void Optimize(); // Given a graph, optimize it
720 732 void Code_Gen(); // Generate code from a graph
721 733
722 734 // Management of the AliasType table.
723 735 void grow_alias_types();
724 736 AliasCacheEntry* probe_alias_cache(const TypePtr* adr_type);
725 737 const TypePtr *flatten_alias_type(const TypePtr* adr_type) const;
726 738 AliasType* find_alias_type(const TypePtr* adr_type, bool no_create);
727 739
728 740 void verify_top(Node*) const PRODUCT_RETURN;
729 741
730 742 // Intrinsic setup.
731 743 void register_library_intrinsics(); // initializer
732 744 CallGenerator* make_vm_intrinsic(ciMethod* m, bool is_virtual); // constructor
733 745 int intrinsic_insertion_index(ciMethod* m, bool is_virtual); // helper
734 746 CallGenerator* find_intrinsic(ciMethod* m, bool is_virtual); // query fn
735 747 void register_intrinsic(CallGenerator* cg); // update fn
736 748
737 749 #ifndef PRODUCT
738 750 static juint _intrinsic_hist_count[vmIntrinsics::ID_LIMIT];
739 751 static jubyte _intrinsic_hist_flags[vmIntrinsics::ID_LIMIT];
740 752 #endif
741 753
742 754 public:
743 755
744 756 // Note: Histogram array size is about 1 Kb.
745 757 enum { // flag bits:
746 758 _intrinsic_worked = 1, // succeeded at least once
747 759 _intrinsic_failed = 2, // tried it but it failed
748 760 _intrinsic_disabled = 4, // was requested but disabled (e.g., -XX:-InlineUnsafeOps)
749 761 _intrinsic_virtual = 8, // was seen in the virtual form (rare)
750 762 _intrinsic_both = 16 // was seen in the non-virtual form (usual)
751 763 };
752 764 // Update histogram. Return boolean if this is a first-time occurrence.
753 765 static bool gather_intrinsic_statistics(vmIntrinsics::ID id,
754 766 bool is_virtual, int flags) PRODUCT_RETURN0;
755 767 static void print_intrinsic_statistics() PRODUCT_RETURN;
756 768
757 769 // Graph verification code
758 770 // Walk the node list, verifying that there is a one-to-one
759 771 // correspondence between Use-Def edges and Def-Use edges
760 772 // The option no_dead_code enables stronger checks that the
761 773 // graph is strongly connected from root in both directions.
762 774 void verify_graph_edges(bool no_dead_code = false) PRODUCT_RETURN;
763 775
764 776 // Print bytecodes, including the scope inlining tree
765 777 void print_codes();
766 778
767 779 // End-of-run dumps.
768 780 static void print_statistics() PRODUCT_RETURN;
769 781
770 782 // Dump formatted assembly
771 783 void dump_asm(int *pcs = NULL, uint pc_limit = 0) PRODUCT_RETURN;
772 784 void dump_pc(int *pcs, int pc_limit, Node *n);
773 785
774 786 // Verify ADLC assumptions during startup
775 787 static void adlc_verification() PRODUCT_RETURN;
776 788
777 789 // Definitions of pd methods
778 790 static void pd_compiler2_init();
779 791 };
|
↓ open down ↓ |
92 lines elided |
↑ open up ↑ |
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX