Wed, 16 Jul 2008 16:04:39 -0700
6723160: Nightly failure: Error: meet not symmetric
Summary: Add missing _instance_id settings and other EA fixes.
Reviewed-by: rasbold
1 /*
2 * Copyright 1997-2008 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 uint _trap_hist[trapHistLength]; // Cumulative traps
153 bool _trap_can_recompile; // Have we emitted a recompiling trap?
154 uint _decompile_count; // Cumulative decompilation counts.
155 bool _do_inlining; // True if we intend to do inlining
156 bool _do_scheduling; // True if we intend to do scheduling
157 bool _do_count_invocations; // True if we generate code to count invocations
158 bool _do_method_data_update; // True if we generate code to update methodDataOops
159 int _AliasLevel; // Locally-adjusted version of AliasLevel flag.
160 bool _print_assembly; // True if we should dump assembly code for this compilation
161 #ifndef PRODUCT
162 bool _trace_opto_output;
163 #endif
165 // Compilation environment.
166 Arena _comp_arena; // Arena with lifetime equivalent to Compile
167 ciEnv* _env; // CI interface
168 CompileLog* _log; // from CompilerThread
169 const char* _failure_reason; // for record_failure/failing pattern
170 GrowableArray<CallGenerator*>* _intrinsics; // List of intrinsics.
171 GrowableArray<Node*>* _macro_nodes; // List of nodes which need to be expanded before matching.
172 ConnectionGraph* _congraph;
173 #ifndef PRODUCT
174 IdealGraphPrinter* _printer;
175 #endif
177 // Node management
178 uint _unique; // Counter for unique Node indices
179 debug_only(static int _debug_idx;) // Monotonic counter (not reset), use -XX:BreakAtNode=<idx>
180 Arena _node_arena; // Arena for new-space Nodes
181 Arena _old_arena; // Arena for old-space Nodes, lifetime during xform
182 RootNode* _root; // Unique root of compilation, or NULL after bail-out.
183 Node* _top; // Unique top node. (Reset by various phases.)
185 Node* _immutable_memory; // Initial memory state
187 Node* _recent_alloc_obj;
188 Node* _recent_alloc_ctl;
190 // Blocked array of debugging and profiling information,
191 // tracked per node.
192 enum { _log2_node_notes_block_size = 8,
193 _node_notes_block_size = (1<<_log2_node_notes_block_size)
194 };
195 GrowableArray<Node_Notes*>* _node_note_array;
196 Node_Notes* _default_node_notes; // default notes for new nodes
198 // After parsing and every bulk phase we hang onto the Root instruction.
199 // The RootNode instruction is where the whole program begins. It produces
200 // the initial Control and BOTTOM for everybody else.
202 // Type management
203 Arena _Compile_types; // Arena for all types
204 Arena* _type_arena; // Alias for _Compile_types except in Initialize_shared()
205 Dict* _type_dict; // Intern table
206 void* _type_hwm; // Last allocation (see Type::operator new/delete)
207 size_t _type_last_size; // Last allocation size (see Type::operator new/delete)
208 ciMethod* _last_tf_m; // Cache for
209 const TypeFunc* _last_tf; // TypeFunc::make
210 AliasType** _alias_types; // List of alias types seen so far.
211 int _num_alias_types; // Logical length of _alias_types
212 int _max_alias_types; // Physical length of _alias_types
213 AliasCacheEntry _alias_cache[AliasCacheSize]; // Gets aliases w/o data structure walking
215 // Parsing, optimization
216 PhaseGVN* _initial_gvn; // Results of parse-time PhaseGVN
217 Unique_Node_List* _for_igvn; // Initial work-list for next round of Iterative GVN
218 WarmCallInfo* _warm_calls; // Sorted work-list for heat-based inlining.
220 // Matching, CFG layout, allocation, code generation
221 PhaseCFG* _cfg; // Results of CFG finding
222 bool _select_24_bit_instr; // We selected an instruction with a 24-bit result
223 bool _in_24_bit_fp_mode; // We are emitting instructions with 24-bit results
224 bool _has_java_calls; // True if the method has java calls
225 Matcher* _matcher; // Engine to map ideal to machine instructions
226 PhaseRegAlloc* _regalloc; // Results of register allocation.
227 int _frame_slots; // Size of total frame in stack slots
228 CodeOffsets _code_offsets; // Offsets into the code for various interesting entries
229 RegMask _FIRST_STACK_mask; // All stack slots usable for spills (depends on frame layout)
230 Arena* _indexSet_arena; // control IndexSet allocation within PhaseChaitin
231 void* _indexSet_free_block_list; // free list of IndexSet bit blocks
233 uint _node_bundling_limit;
234 Bundle* _node_bundling_base; // Information for instruction bundling
236 // Instruction bits passed off to the VM
237 int _method_size; // Size of nmethod code segment in bytes
238 CodeBuffer _code_buffer; // Where the code is assembled
239 int _first_block_size; // Size of unvalidated entry point code / OSR poison code
240 ExceptionHandlerTable _handler_table; // Table of native-code exception handlers
241 ImplicitExceptionTable _inc_table; // Table of implicit null checks in native code
242 OopMapSet* _oop_map_set; // Table of oop maps (one for each safepoint location)
243 static int _CompiledZap_count; // counter compared against CompileZap[First/Last]
244 BufferBlob* _scratch_buffer_blob; // For temporary code buffers.
245 relocInfo* _scratch_locs_memory; // For temporary code buffers.
247 public:
248 // Accessors
250 // The Compile instance currently active in this (compiler) thread.
251 static Compile* current() {
252 return (Compile*) ciEnv::current()->compiler_data();
253 }
255 // ID for this compilation. Useful for setting breakpoints in the debugger.
256 int compile_id() const { return _compile_id; }
258 // Does this compilation allow instructions to subsume loads? User
259 // instructions that subsume a load may result in an unschedulable
260 // instruction sequence.
261 bool subsume_loads() const { return _subsume_loads; }
262 // Do escape analysis.
263 bool do_escape_analysis() const { return _do_escape_analysis; }
264 bool save_argument_registers() const { return _save_argument_registers; }
267 // Other fixed compilation parameters.
268 ciMethod* method() const { return _method; }
269 int entry_bci() const { return _entry_bci; }
270 bool is_osr_compilation() const { return _entry_bci != InvocationEntryBci; }
271 bool is_method_compilation() const { return (_method != NULL && !_method->flags().is_native()); }
272 const TypeFunc* tf() const { assert(_tf!=NULL, ""); return _tf; }
273 void init_tf(const TypeFunc* tf) { assert(_tf==NULL, ""); _tf = tf; }
274 InlineTree* ilt() const { return _ilt; }
275 address stub_function() const { return _stub_function; }
276 const char* stub_name() const { return _stub_name; }
277 address stub_entry_point() const { return _stub_entry_point; }
279 // Control of this compilation.
280 int fixed_slots() const { assert(_fixed_slots >= 0, ""); return _fixed_slots; }
281 void set_fixed_slots(int n) { _fixed_slots = n; }
282 int major_progress() const { return _major_progress; }
283 void set_major_progress() { _major_progress++; }
284 void clear_major_progress() { _major_progress = 0; }
285 int num_loop_opts() const { return _num_loop_opts; }
286 void set_num_loop_opts(int n) { _num_loop_opts = n; }
287 int max_inline_size() const { return _max_inline_size; }
288 void set_freq_inline_size(int n) { _freq_inline_size = n; }
289 int freq_inline_size() const { return _freq_inline_size; }
290 void set_max_inline_size(int n) { _max_inline_size = n; }
291 bool deopt_happens() const { return _deopt_happens; }
292 bool has_loops() const { return _has_loops; }
293 void set_has_loops(bool z) { _has_loops = z; }
294 bool has_split_ifs() const { return _has_split_ifs; }
295 void set_has_split_ifs(bool z) { _has_split_ifs = z; }
296 bool has_unsafe_access() const { return _has_unsafe_access; }
297 void set_has_unsafe_access(bool z) { _has_unsafe_access = z; }
298 void set_trap_count(uint r, uint c) { assert(r < trapHistLength, "oob"); _trap_hist[r] = c; }
299 uint trap_count(uint r) const { assert(r < trapHistLength, "oob"); return _trap_hist[r]; }
300 bool trap_can_recompile() const { return _trap_can_recompile; }
301 void set_trap_can_recompile(bool z) { _trap_can_recompile = z; }
302 uint decompile_count() const { return _decompile_count; }
303 void set_decompile_count(uint c) { _decompile_count = c; }
304 bool allow_range_check_smearing() const;
305 bool do_inlining() const { return _do_inlining; }
306 void set_do_inlining(bool z) { _do_inlining = z; }
307 bool do_scheduling() const { return _do_scheduling; }
308 void set_do_scheduling(bool z) { _do_scheduling = z; }
309 bool do_count_invocations() const{ return _do_count_invocations; }
310 void set_do_count_invocations(bool z){ _do_count_invocations = z; }
311 bool do_method_data_update() const { return _do_method_data_update; }
312 void set_do_method_data_update(bool z) { _do_method_data_update = z; }
313 int AliasLevel() const { return _AliasLevel; }
314 bool print_assembly() const { return _print_assembly; }
315 void set_print_assembly(bool z) { _print_assembly = z; }
316 // check the CompilerOracle for special behaviours for this compile
317 bool method_has_option(const char * option) {
318 return method() != NULL && method()->has_option(option);
319 }
320 #ifndef PRODUCT
321 bool trace_opto_output() const { return _trace_opto_output; }
322 #endif
324 void begin_method() {
325 #ifndef PRODUCT
326 if (_printer) _printer->begin_method(this);
327 #endif
328 }
329 void print_method(const char * name, int level = 1) {
330 #ifndef PRODUCT
331 if (_printer) _printer->print_method(this, name, level);
332 #endif
333 }
334 void end_method() {
335 #ifndef PRODUCT
336 if (_printer) _printer->end_method();
337 #endif
338 }
340 int macro_count() { return _macro_nodes->length(); }
341 Node* macro_node(int idx) { return _macro_nodes->at(idx); }
342 ConnectionGraph* congraph() { return _congraph;}
343 void add_macro_node(Node * n) {
344 //assert(n->is_macro(), "must be a macro node");
345 assert(!_macro_nodes->contains(n), " duplicate entry in expand list");
346 _macro_nodes->append(n);
347 }
348 void remove_macro_node(Node * n) {
349 // this function may be called twice for a node so check
350 // that the node is in the array before attempting to remove it
351 if (_macro_nodes->contains(n))
352 _macro_nodes->remove(n);
353 }
355 // Compilation environment.
356 Arena* comp_arena() { return &_comp_arena; }
357 ciEnv* env() const { return _env; }
358 CompileLog* log() const { return _log; }
359 bool failing() const { return _env->failing() || _failure_reason != NULL; }
360 const char* failure_reason() { return _failure_reason; }
361 bool failure_reason_is(const char* r) { return (r==_failure_reason) || (r!=NULL && _failure_reason!=NULL && strcmp(r, _failure_reason)==0); }
363 void record_failure(const char* reason);
364 void record_method_not_compilable(const char* reason, bool all_tiers = false) {
365 // All bailouts cover "all_tiers" when TieredCompilation is off.
366 if (!TieredCompilation) all_tiers = true;
367 env()->record_method_not_compilable(reason, all_tiers);
368 // Record failure reason.
369 record_failure(reason);
370 }
371 void record_method_not_compilable_all_tiers(const char* reason) {
372 record_method_not_compilable(reason, true);
373 }
374 bool check_node_count(uint margin, const char* reason) {
375 if (unique() + margin > (uint)MaxNodeLimit) {
376 record_method_not_compilable(reason);
377 return true;
378 } else {
379 return false;
380 }
381 }
383 // Node management
384 uint unique() const { return _unique; }
385 uint next_unique() { return _unique++; }
386 void set_unique(uint i) { _unique = i; }
387 static int debug_idx() { return debug_only(_debug_idx)+0; }
388 static void set_debug_idx(int i) { debug_only(_debug_idx = i); }
389 Arena* node_arena() { return &_node_arena; }
390 Arena* old_arena() { return &_old_arena; }
391 RootNode* root() const { return _root; }
392 void set_root(RootNode* r) { _root = r; }
393 StartNode* start() const; // (Derived from root.)
394 void init_start(StartNode* s);
395 Node* immutable_memory();
397 Node* recent_alloc_ctl() const { return _recent_alloc_ctl; }
398 Node* recent_alloc_obj() const { return _recent_alloc_obj; }
399 void set_recent_alloc(Node* ctl, Node* obj) {
400 _recent_alloc_ctl = ctl;
401 _recent_alloc_obj = obj;
402 }
404 // Handy undefined Node
405 Node* top() const { return _top; }
407 // these are used by guys who need to know about creation and transformation of top:
408 Node* cached_top_node() { return _top; }
409 void set_cached_top_node(Node* tn);
411 GrowableArray<Node_Notes*>* node_note_array() const { return _node_note_array; }
412 void set_node_note_array(GrowableArray<Node_Notes*>* arr) { _node_note_array = arr; }
413 Node_Notes* default_node_notes() const { return _default_node_notes; }
414 void set_default_node_notes(Node_Notes* n) { _default_node_notes = n; }
416 Node_Notes* node_notes_at(int idx) {
417 return locate_node_notes(_node_note_array, idx, false);
418 }
419 inline bool set_node_notes_at(int idx, Node_Notes* value);
421 // Copy notes from source to dest, if they exist.
422 // Overwrite dest only if source provides something.
423 // Return true if information was moved.
424 bool copy_node_notes_to(Node* dest, Node* source);
426 // Workhorse function to sort out the blocked Node_Notes array:
427 inline Node_Notes* locate_node_notes(GrowableArray<Node_Notes*>* arr,
428 int idx, bool can_grow = false);
430 void grow_node_notes(GrowableArray<Node_Notes*>* arr, int grow_by);
432 // Type management
433 Arena* type_arena() { return _type_arena; }
434 Dict* type_dict() { return _type_dict; }
435 void* type_hwm() { return _type_hwm; }
436 size_t type_last_size() { return _type_last_size; }
437 int num_alias_types() { return _num_alias_types; }
439 void init_type_arena() { _type_arena = &_Compile_types; }
440 void set_type_arena(Arena* a) { _type_arena = a; }
441 void set_type_dict(Dict* d) { _type_dict = d; }
442 void set_type_hwm(void* p) { _type_hwm = p; }
443 void set_type_last_size(size_t sz) { _type_last_size = sz; }
445 const TypeFunc* last_tf(ciMethod* m) {
446 return (m == _last_tf_m) ? _last_tf : NULL;
447 }
448 void set_last_tf(ciMethod* m, const TypeFunc* tf) {
449 assert(m != NULL || tf == NULL, "");
450 _last_tf_m = m;
451 _last_tf = tf;
452 }
454 AliasType* alias_type(int idx) { assert(idx < num_alias_types(), "oob"); return _alias_types[idx]; }
455 AliasType* alias_type(const TypePtr* adr_type) { return find_alias_type(adr_type, false); }
456 bool have_alias_type(const TypePtr* adr_type);
457 AliasType* alias_type(ciField* field);
459 int get_alias_index(const TypePtr* at) { return alias_type(at)->index(); }
460 const TypePtr* get_adr_type(uint aidx) { return alias_type(aidx)->adr_type(); }
461 int get_general_index(uint aidx) { return alias_type(aidx)->general_index(); }
463 // Building nodes
464 void rethrow_exceptions(JVMState* jvms);
465 void return_values(JVMState* jvms);
466 JVMState* build_start_state(StartNode* start, const TypeFunc* tf);
468 // Decide how to build a call.
469 // The profile factor is a discount to apply to this site's interp. profile.
470 CallGenerator* call_generator(ciMethod* call_method, int vtable_index, bool call_is_virtual, JVMState* jvms, bool allow_inline, float profile_factor);
472 // Report if there were too many traps at a current method and bci.
473 // Report if a trap was recorded, and/or PerMethodTrapLimit was exceeded.
474 // If there is no MDO at all, report no trap unless told to assume it.
475 bool too_many_traps(ciMethod* method, int bci, Deoptimization::DeoptReason reason);
476 // This version, unspecific to a particular bci, asks if
477 // PerMethodTrapLimit was exceeded for all inlined methods seen so far.
478 bool too_many_traps(Deoptimization::DeoptReason reason,
479 // Privately used parameter for logging:
480 ciMethodData* logmd = NULL);
481 // Report if there were too many recompiles at a method and bci.
482 bool too_many_recompiles(ciMethod* method, int bci, Deoptimization::DeoptReason reason);
484 // Parsing, optimization
485 PhaseGVN* initial_gvn() { return _initial_gvn; }
486 Unique_Node_List* for_igvn() { return _for_igvn; }
487 inline void record_for_igvn(Node* n); // Body is after class Unique_Node_List.
488 void set_initial_gvn(PhaseGVN *gvn) { _initial_gvn = gvn; }
489 void set_for_igvn(Unique_Node_List *for_igvn) { _for_igvn = for_igvn; }
491 void identify_useful_nodes(Unique_Node_List &useful);
492 void remove_useless_nodes (Unique_Node_List &useful);
494 WarmCallInfo* warm_calls() const { return _warm_calls; }
495 void set_warm_calls(WarmCallInfo* l) { _warm_calls = l; }
496 WarmCallInfo* pop_warm_call();
498 // Matching, CFG layout, allocation, code generation
499 PhaseCFG* cfg() { return _cfg; }
500 bool select_24_bit_instr() const { return _select_24_bit_instr; }
501 bool in_24_bit_fp_mode() const { return _in_24_bit_fp_mode; }
502 bool has_java_calls() const { return _has_java_calls; }
503 Matcher* matcher() { return _matcher; }
504 PhaseRegAlloc* regalloc() { return _regalloc; }
505 int frame_slots() const { return _frame_slots; }
506 int frame_size_in_words() const; // frame_slots in units of the polymorphic 'words'
507 RegMask& FIRST_STACK_mask() { return _FIRST_STACK_mask; }
508 Arena* indexSet_arena() { return _indexSet_arena; }
509 void* indexSet_free_block_list() { return _indexSet_free_block_list; }
510 uint node_bundling_limit() { return _node_bundling_limit; }
511 Bundle* node_bundling_base() { return _node_bundling_base; }
512 void set_node_bundling_limit(uint n) { _node_bundling_limit = n; }
513 void set_node_bundling_base(Bundle* b) { _node_bundling_base = b; }
514 bool starts_bundle(const Node *n) const;
515 bool need_stack_bang(int frame_size_in_bytes) const;
516 bool need_register_stack_bang() const;
518 void set_matcher(Matcher* m) { _matcher = m; }
519 //void set_regalloc(PhaseRegAlloc* ra) { _regalloc = ra; }
520 void set_indexSet_arena(Arena* a) { _indexSet_arena = a; }
521 void set_indexSet_free_block_list(void* p) { _indexSet_free_block_list = p; }
523 // Remember if this compilation changes hardware mode to 24-bit precision
524 void set_24_bit_selection_and_mode(bool selection, bool mode) {
525 _select_24_bit_instr = selection;
526 _in_24_bit_fp_mode = mode;
527 }
529 void set_has_java_calls(bool z) { _has_java_calls = z; }
531 // Instruction bits passed off to the VM
532 int code_size() { return _method_size; }
533 CodeBuffer* code_buffer() { return &_code_buffer; }
534 int first_block_size() { return _first_block_size; }
535 void set_frame_complete(int off) { _code_offsets.set_value(CodeOffsets::Frame_Complete, off); }
536 ExceptionHandlerTable* handler_table() { return &_handler_table; }
537 ImplicitExceptionTable* inc_table() { return &_inc_table; }
538 OopMapSet* oop_map_set() { return _oop_map_set; }
539 DebugInformationRecorder* debug_info() { return env()->debug_info(); }
540 Dependencies* dependencies() { return env()->dependencies(); }
541 static int CompiledZap_count() { return _CompiledZap_count; }
542 BufferBlob* scratch_buffer_blob() { return _scratch_buffer_blob; }
543 void init_scratch_buffer_blob();
544 void set_scratch_buffer_blob(BufferBlob* b) { _scratch_buffer_blob = b; }
545 relocInfo* scratch_locs_memory() { return _scratch_locs_memory; }
546 void set_scratch_locs_memory(relocInfo* b) { _scratch_locs_memory = b; }
548 // emit to scratch blob, report resulting size
549 uint scratch_emit_size(const Node* n);
551 enum ScratchBufferBlob {
552 MAX_inst_size = 1024,
553 MAX_locs_size = 128, // number of relocInfo elements
554 MAX_const_size = 128,
555 MAX_stubs_size = 128
556 };
558 // Major entry point. Given a Scope, compile the associated method.
559 // For normal compilations, entry_bci is InvocationEntryBci. For on stack
560 // replacement, entry_bci indicates the bytecode for which to compile a
561 // continuation.
562 Compile(ciEnv* ci_env, C2Compiler* compiler, ciMethod* target,
563 int entry_bci, bool subsume_loads, bool do_escape_analysis);
565 // Second major entry point. From the TypeFunc signature, generate code
566 // to pass arguments from the Java calling convention to the C calling
567 // convention.
568 Compile(ciEnv* ci_env, const TypeFunc *(*gen)(),
569 address stub_function, const char *stub_name,
570 int is_fancy_jump, bool pass_tls,
571 bool save_arg_registers, bool return_pc);
573 // From the TypeFunc signature, generate code to pass arguments
574 // from Compiled calling convention to Interpreter's calling convention
575 void Generate_Compiled_To_Interpreter_Graph(const TypeFunc *tf, address interpreter_entry);
577 // From the TypeFunc signature, generate code to pass arguments
578 // from Interpreter's calling convention to Compiler's calling convention
579 void Generate_Interpreter_To_Compiled_Graph(const TypeFunc *tf);
581 // Are we compiling a method?
582 bool has_method() { return method() != NULL; }
584 // Maybe print some information about this compile.
585 void print_compile_messages();
587 // Final graph reshaping, a post-pass after the regular optimizer is done.
588 bool final_graph_reshaping();
590 // returns true if adr is completely contained in the given alias category
591 bool must_alias(const TypePtr* adr, int alias_idx);
593 // returns true if adr overlaps with the given alias category
594 bool can_alias(const TypePtr* adr, int alias_idx);
596 // Driver for converting compiler's IR into machine code bits
597 void Output();
599 // Accessors for node bundling info.
600 Bundle* node_bundling(const Node *n);
601 bool valid_bundle_info(const Node *n);
603 // Schedule and Bundle the instructions
604 void ScheduleAndBundle();
606 // Build OopMaps for each GC point
607 void BuildOopMaps();
609 // Append debug info for the node "local" at safepoint node "sfpt" to the
610 // "array", May also consult and add to "objs", which describes the
611 // scalar-replaced objects.
612 void FillLocArray( int idx, MachSafePointNode* sfpt,
613 Node *local, GrowableArray<ScopeValue*> *array,
614 GrowableArray<ScopeValue*> *objs );
616 // If "objs" contains an ObjectValue whose id is "id", returns it, else NULL.
617 static ObjectValue* sv_for_node_id(GrowableArray<ScopeValue*> *objs, int id);
618 // Requres that "objs" does not contains an ObjectValue whose id matches
619 // that of "sv. Appends "sv".
620 static void set_sv_for_object_node(GrowableArray<ScopeValue*> *objs,
621 ObjectValue* sv );
623 // Process an OopMap Element while emitting nodes
624 void Process_OopMap_Node(MachNode *mach, int code_offset);
626 // Write out basic block data to code buffer
627 void Fill_buffer();
629 // Determine which variable sized branches can be shortened
630 void Shorten_branches(Label *labels, int& code_size, int& reloc_size, int& stub_size, int& const_size);
632 // Compute the size of first NumberOfLoopInstrToAlign instructions
633 // at the head of a loop.
634 void compute_loop_first_inst_sizes();
636 // Compute the information for the exception tables
637 void FillExceptionTables(uint cnt, uint *call_returns, uint *inct_starts, Label *blk_labels);
639 // Stack slots that may be unused by the calling convention but must
640 // otherwise be preserved. On Intel this includes the return address.
641 // On PowerPC it includes the 4 words holding the old TOC & LR glue.
642 uint in_preserve_stack_slots();
644 // "Top of Stack" slots that may be unused by the calling convention but must
645 // otherwise be preserved.
646 // On Intel these are not necessary and the value can be zero.
647 // On Sparc this describes the words reserved for storing a register window
648 // when an interrupt occurs.
649 static uint out_preserve_stack_slots();
651 // Number of outgoing stack slots killed above the out_preserve_stack_slots
652 // for calls to C. Supports the var-args backing area for register parms.
653 uint varargs_C_out_slots_killed() const;
655 // Number of Stack Slots consumed by a synchronization entry
656 int sync_stack_slots() const;
658 // Compute the name of old_SP. See <arch>.ad for frame layout.
659 OptoReg::Name compute_old_SP();
661 #ifdef ENABLE_ZAP_DEAD_LOCALS
662 static bool is_node_getting_a_safepoint(Node*);
663 void Insert_zap_nodes();
664 Node* call_zap_node(MachSafePointNode* n, int block_no);
665 #endif
667 private:
668 // Phase control:
669 void Init(int aliaslevel); // Prepare for a single compilation
670 int Inline_Warm(); // Find more inlining work.
671 void Finish_Warm(); // Give up on further inlines.
672 void Optimize(); // Given a graph, optimize it
673 void Code_Gen(); // Generate code from a graph
675 // Management of the AliasType table.
676 void grow_alias_types();
677 AliasCacheEntry* probe_alias_cache(const TypePtr* adr_type);
678 const TypePtr *flatten_alias_type(const TypePtr* adr_type) const;
679 AliasType* find_alias_type(const TypePtr* adr_type, bool no_create);
681 void verify_top(Node*) const PRODUCT_RETURN;
683 // Intrinsic setup.
684 void register_library_intrinsics(); // initializer
685 CallGenerator* make_vm_intrinsic(ciMethod* m, bool is_virtual); // constructor
686 int intrinsic_insertion_index(ciMethod* m, bool is_virtual); // helper
687 CallGenerator* find_intrinsic(ciMethod* m, bool is_virtual); // query fn
688 void register_intrinsic(CallGenerator* cg); // update fn
690 #ifndef PRODUCT
691 static juint _intrinsic_hist_count[vmIntrinsics::ID_LIMIT];
692 static jubyte _intrinsic_hist_flags[vmIntrinsics::ID_LIMIT];
693 #endif
695 public:
697 // Note: Histogram array size is about 1 Kb.
698 enum { // flag bits:
699 _intrinsic_worked = 1, // succeeded at least once
700 _intrinsic_failed = 2, // tried it but it failed
701 _intrinsic_disabled = 4, // was requested but disabled (e.g., -XX:-InlineUnsafeOps)
702 _intrinsic_virtual = 8, // was seen in the virtual form (rare)
703 _intrinsic_both = 16 // was seen in the non-virtual form (usual)
704 };
705 // Update histogram. Return boolean if this is a first-time occurrence.
706 static bool gather_intrinsic_statistics(vmIntrinsics::ID id,
707 bool is_virtual, int flags) PRODUCT_RETURN0;
708 static void print_intrinsic_statistics() PRODUCT_RETURN;
710 // Graph verification code
711 // Walk the node list, verifying that there is a one-to-one
712 // correspondence between Use-Def edges and Def-Use edges
713 // The option no_dead_code enables stronger checks that the
714 // graph is strongly connected from root in both directions.
715 void verify_graph_edges(bool no_dead_code = false) PRODUCT_RETURN;
717 // Print bytecodes, including the scope inlining tree
718 void print_codes();
720 // End-of-run dumps.
721 static void print_statistics() PRODUCT_RETURN;
723 // Dump formatted assembly
724 void dump_asm(int *pcs = NULL, uint pc_limit = 0) PRODUCT_RETURN;
725 void dump_pc(int *pcs, int pc_limit, Node *n);
727 // Verify ADLC assumptions during startup
728 static void adlc_verification() PRODUCT_RETURN;
730 // Definitions of pd methods
731 static void pd_compiler2_init();
732 };