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