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