|
1 /* |
|
2 * Copyright 1997-2007 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 */ |
|
24 |
|
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 Node; |
|
35 class Node_Array; |
|
36 class Node_Notes; |
|
37 class OptoReg; |
|
38 class PhaseCFG; |
|
39 class PhaseGVN; |
|
40 class PhaseRegAlloc; |
|
41 class PhaseCCP; |
|
42 class PhaseCCP_DCE; |
|
43 class RootNode; |
|
44 class relocInfo; |
|
45 class Scope; |
|
46 class StartNode; |
|
47 class SafePointNode; |
|
48 class JVMState; |
|
49 class TypeData; |
|
50 class TypePtr; |
|
51 class TypeFunc; |
|
52 class Unique_Node_List; |
|
53 class nmethod; |
|
54 class WarmCallInfo; |
|
55 #ifdef ENABLE_ZAP_DEAD_LOCALS |
|
56 class MachSafePointNode; |
|
57 #endif |
|
58 |
|
59 //------------------------------Compile---------------------------------------- |
|
60 // This class defines a top-level Compiler invocation. |
|
61 |
|
62 class Compile : public Phase { |
|
63 public: |
|
64 // Fixed alias indexes. (See also MergeMemNode.) |
|
65 enum { |
|
66 AliasIdxTop = 1, // pseudo-index, aliases to nothing (used as sentinel value) |
|
67 AliasIdxBot = 2, // pseudo-index, aliases to everything |
|
68 AliasIdxRaw = 3 // hard-wired index for TypeRawPtr::BOTTOM |
|
69 }; |
|
70 |
|
71 // Variant of TraceTime(NULL, &_t_accumulator, TimeCompiler); |
|
72 // Integrated with logging. If logging is turned on, and dolog is true, |
|
73 // then brackets are put into the log, with time stamps and node counts. |
|
74 // (The time collection itself is always conditionalized on TimeCompiler.) |
|
75 class TracePhase : public TraceTime { |
|
76 private: |
|
77 Compile* C; |
|
78 CompileLog* _log; |
|
79 public: |
|
80 TracePhase(const char* name, elapsedTimer* accumulator, bool dolog); |
|
81 ~TracePhase(); |
|
82 }; |
|
83 |
|
84 // Information per category of alias (memory slice) |
|
85 class AliasType { |
|
86 private: |
|
87 friend class Compile; |
|
88 |
|
89 int _index; // unique index, used with MergeMemNode |
|
90 const TypePtr* _adr_type; // normalized address type |
|
91 ciField* _field; // relevant instance field, or null if none |
|
92 bool _is_rewritable; // false if the memory is write-once only |
|
93 int _general_index; // if this is type is an instance, the general |
|
94 // type that this is an instance of |
|
95 |
|
96 void Init(int i, const TypePtr* at); |
|
97 |
|
98 public: |
|
99 int index() const { return _index; } |
|
100 const TypePtr* adr_type() const { return _adr_type; } |
|
101 ciField* field() const { return _field; } |
|
102 bool is_rewritable() const { return _is_rewritable; } |
|
103 bool is_volatile() const { return (_field ? _field->is_volatile() : false); } |
|
104 int general_index() const { return (_general_index != 0) ? _general_index : _index; } |
|
105 |
|
106 void set_rewritable(bool z) { _is_rewritable = z; } |
|
107 void set_field(ciField* f) { |
|
108 assert(!_field,""); |
|
109 _field = f; |
|
110 if (f->is_final()) _is_rewritable = false; |
|
111 } |
|
112 |
|
113 void print_on(outputStream* st) PRODUCT_RETURN; |
|
114 }; |
|
115 |
|
116 enum { |
|
117 logAliasCacheSize = 6, |
|
118 AliasCacheSize = (1<<logAliasCacheSize) |
|
119 }; |
|
120 struct AliasCacheEntry { const TypePtr* _adr_type; int _index; }; // simple duple type |
|
121 enum { |
|
122 trapHistLength = methodDataOopDesc::_trap_hist_limit |
|
123 }; |
|
124 |
|
125 private: |
|
126 // Fixed parameters to this compilation. |
|
127 const int _compile_id; |
|
128 const bool _save_argument_registers; // save/restore arg regs for trampolines |
|
129 const bool _subsume_loads; // Load can be matched as part of a larger op. |
|
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 |
|
137 |
|
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; |
|
147 |
|
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 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_count_invocations; // True if we generate code to count invocations |
|
159 bool _do_method_data_update; // True if we generate code to update methodDataOops |
|
160 int _AliasLevel; // Locally-adjusted version of AliasLevel flag. |
|
161 bool _print_assembly; // True if we should dump assembly code for this compilation |
|
162 #ifndef PRODUCT |
|
163 bool _trace_opto_output; |
|
164 #endif |
|
165 |
|
166 // Compilation environment. |
|
167 Arena _comp_arena; // Arena with lifetime equivalent to Compile |
|
168 ciEnv* _env; // CI interface |
|
169 CompileLog* _log; // from CompilerThread |
|
170 const char* _failure_reason; // for record_failure/failing pattern |
|
171 GrowableArray<CallGenerator*>* _intrinsics; // List of intrinsics. |
|
172 GrowableArray<Node*>* _macro_nodes; // List of nodes which need to be expanded before matching. |
|
173 ConnectionGraph* _congraph; |
|
174 #ifndef PRODUCT |
|
175 IdealGraphPrinter* _printer; |
|
176 #endif |
|
177 |
|
178 // Node management |
|
179 uint _unique; // Counter for unique Node indices |
|
180 debug_only(static int _debug_idx;) // Monotonic counter (not reset), use -XX:BreakAtNode=<idx> |
|
181 Arena _node_arena; // Arena for new-space Nodes |
|
182 Arena _old_arena; // Arena for old-space Nodes, lifetime during xform |
|
183 RootNode* _root; // Unique root of compilation, or NULL after bail-out. |
|
184 Node* _top; // Unique top node. (Reset by various phases.) |
|
185 |
|
186 Node* _immutable_memory; // Initial memory state |
|
187 |
|
188 Node* _recent_alloc_obj; |
|
189 Node* _recent_alloc_ctl; |
|
190 |
|
191 // Blocked array of debugging and profiling information, |
|
192 // tracked per node. |
|
193 enum { _log2_node_notes_block_size = 8, |
|
194 _node_notes_block_size = (1<<_log2_node_notes_block_size) |
|
195 }; |
|
196 GrowableArray<Node_Notes*>* _node_note_array; |
|
197 Node_Notes* _default_node_notes; // default notes for new nodes |
|
198 |
|
199 // After parsing and every bulk phase we hang onto the Root instruction. |
|
200 // The RootNode instruction is where the whole program begins. It produces |
|
201 // the initial Control and BOTTOM for everybody else. |
|
202 |
|
203 // Type management |
|
204 Arena _Compile_types; // Arena for all types |
|
205 Arena* _type_arena; // Alias for _Compile_types except in Initialize_shared() |
|
206 Dict* _type_dict; // Intern table |
|
207 void* _type_hwm; // Last allocation (see Type::operator new/delete) |
|
208 size_t _type_last_size; // Last allocation size (see Type::operator new/delete) |
|
209 ciMethod* _last_tf_m; // Cache for |
|
210 const TypeFunc* _last_tf; // TypeFunc::make |
|
211 AliasType** _alias_types; // List of alias types seen so far. |
|
212 int _num_alias_types; // Logical length of _alias_types |
|
213 int _max_alias_types; // Physical length of _alias_types |
|
214 AliasCacheEntry _alias_cache[AliasCacheSize]; // Gets aliases w/o data structure walking |
|
215 |
|
216 // Parsing, optimization |
|
217 PhaseGVN* _initial_gvn; // Results of parse-time PhaseGVN |
|
218 Unique_Node_List* _for_igvn; // Initial work-list for next round of Iterative GVN |
|
219 WarmCallInfo* _warm_calls; // Sorted work-list for heat-based inlining. |
|
220 |
|
221 // Matching, CFG layout, allocation, code generation |
|
222 PhaseCFG* _cfg; // Results of CFG finding |
|
223 bool _select_24_bit_instr; // We selected an instruction with a 24-bit result |
|
224 bool _in_24_bit_fp_mode; // We are emitting instructions with 24-bit results |
|
225 bool _has_java_calls; // True if the method has java calls |
|
226 Matcher* _matcher; // Engine to map ideal to machine instructions |
|
227 PhaseRegAlloc* _regalloc; // Results of register allocation. |
|
228 int _frame_slots; // Size of total frame in stack slots |
|
229 CodeOffsets _code_offsets; // Offsets into the code for various interesting entries |
|
230 RegMask _FIRST_STACK_mask; // All stack slots usable for spills (depends on frame layout) |
|
231 Arena* _indexSet_arena; // control IndexSet allocation within PhaseChaitin |
|
232 void* _indexSet_free_block_list; // free list of IndexSet bit blocks |
|
233 |
|
234 uint _node_bundling_limit; |
|
235 Bundle* _node_bundling_base; // Information for instruction bundling |
|
236 |
|
237 // Instruction bits passed off to the VM |
|
238 int _method_size; // Size of nmethod code segment in bytes |
|
239 CodeBuffer _code_buffer; // Where the code is assembled |
|
240 int _first_block_size; // Size of unvalidated entry point code / OSR poison code |
|
241 ExceptionHandlerTable _handler_table; // Table of native-code exception handlers |
|
242 ImplicitExceptionTable _inc_table; // Table of implicit null checks in native code |
|
243 OopMapSet* _oop_map_set; // Table of oop maps (one for each safepoint location) |
|
244 static int _CompiledZap_count; // counter compared against CompileZap[First/Last] |
|
245 BufferBlob* _scratch_buffer_blob; // For temporary code buffers. |
|
246 relocInfo* _scratch_locs_memory; // For temporary code buffers. |
|
247 |
|
248 public: |
|
249 // Accessors |
|
250 |
|
251 // The Compile instance currently active in this (compiler) thread. |
|
252 static Compile* current() { |
|
253 return (Compile*) ciEnv::current()->compiler_data(); |
|
254 } |
|
255 |
|
256 // ID for this compilation. Useful for setting breakpoints in the debugger. |
|
257 int compile_id() const { return _compile_id; } |
|
258 |
|
259 // Does this compilation allow instructions to subsume loads? User |
|
260 // instructions that subsume a load may result in an unschedulable |
|
261 // instruction sequence. |
|
262 bool subsume_loads() const { return _subsume_loads; } |
|
263 bool save_argument_registers() const { return _save_argument_registers; } |
|
264 |
|
265 |
|
266 // Other fixed compilation parameters. |
|
267 ciMethod* method() const { return _method; } |
|
268 int entry_bci() const { return _entry_bci; } |
|
269 bool is_osr_compilation() const { return _entry_bci != InvocationEntryBci; } |
|
270 bool is_method_compilation() const { return (_method != NULL && !_method->flags().is_native()); } |
|
271 const TypeFunc* tf() const { assert(_tf!=NULL, ""); return _tf; } |
|
272 void init_tf(const TypeFunc* tf) { assert(_tf==NULL, ""); _tf = tf; } |
|
273 InlineTree* ilt() const { return _ilt; } |
|
274 address stub_function() const { return _stub_function; } |
|
275 const char* stub_name() const { return _stub_name; } |
|
276 address stub_entry_point() const { return _stub_entry_point; } |
|
277 |
|
278 // Control of this compilation. |
|
279 int fixed_slots() const { assert(_fixed_slots >= 0, ""); return _fixed_slots; } |
|
280 void set_fixed_slots(int n) { _fixed_slots = n; } |
|
281 int major_progress() const { return _major_progress; } |
|
282 void set_major_progress() { _major_progress++; } |
|
283 void clear_major_progress() { _major_progress = 0; } |
|
284 int num_loop_opts() const { return _num_loop_opts; } |
|
285 void set_num_loop_opts(int n) { _num_loop_opts = n; } |
|
286 int max_inline_size() const { return _max_inline_size; } |
|
287 void set_freq_inline_size(int n) { _freq_inline_size = n; } |
|
288 int freq_inline_size() const { return _freq_inline_size; } |
|
289 void set_max_inline_size(int n) { _max_inline_size = n; } |
|
290 bool deopt_happens() const { return _deopt_happens; } |
|
291 bool has_loops() const { return _has_loops; } |
|
292 void set_has_loops(bool z) { _has_loops = z; } |
|
293 bool has_split_ifs() const { return _has_split_ifs; } |
|
294 void set_has_split_ifs(bool z) { _has_split_ifs = z; } |
|
295 bool has_unsafe_access() const { return _has_unsafe_access; } |
|
296 void set_has_unsafe_access(bool z) { _has_unsafe_access = z; } |
|
297 void set_trap_count(uint r, uint c) { assert(r < trapHistLength, "oob"); _trap_hist[r] = c; } |
|
298 uint trap_count(uint r) const { assert(r < trapHistLength, "oob"); return _trap_hist[r]; } |
|
299 bool trap_can_recompile() const { return _trap_can_recompile; } |
|
300 void set_trap_can_recompile(bool z) { _trap_can_recompile = z; } |
|
301 uint decompile_count() const { return _decompile_count; } |
|
302 void set_decompile_count(uint c) { _decompile_count = c; } |
|
303 bool allow_range_check_smearing() const; |
|
304 bool do_inlining() const { return _do_inlining; } |
|
305 void set_do_inlining(bool z) { _do_inlining = z; } |
|
306 bool do_scheduling() const { return _do_scheduling; } |
|
307 void set_do_scheduling(bool z) { _do_scheduling = z; } |
|
308 bool do_count_invocations() const{ return _do_count_invocations; } |
|
309 void set_do_count_invocations(bool z){ _do_count_invocations = z; } |
|
310 bool do_method_data_update() const { return _do_method_data_update; } |
|
311 void set_do_method_data_update(bool z) { _do_method_data_update = z; } |
|
312 int AliasLevel() const { return _AliasLevel; } |
|
313 bool print_assembly() const { return _print_assembly; } |
|
314 void set_print_assembly(bool z) { _print_assembly = z; } |
|
315 // check the CompilerOracle for special behaviours for this compile |
|
316 bool method_has_option(const char * option) { |
|
317 return method() != NULL && method()->has_option(option); |
|
318 } |
|
319 #ifndef PRODUCT |
|
320 bool trace_opto_output() const { return _trace_opto_output; } |
|
321 #endif |
|
322 |
|
323 void begin_method() { |
|
324 #ifndef PRODUCT |
|
325 if (_printer) _printer->begin_method(this); |
|
326 #endif |
|
327 } |
|
328 void print_method(const char * name, int level = 1) { |
|
329 #ifndef PRODUCT |
|
330 if (_printer) _printer->print_method(this, name, level); |
|
331 #endif |
|
332 } |
|
333 void end_method() { |
|
334 #ifndef PRODUCT |
|
335 if (_printer) _printer->end_method(); |
|
336 #endif |
|
337 } |
|
338 |
|
339 int macro_count() { return _macro_nodes->length(); } |
|
340 Node* macro_node(int idx) { return _macro_nodes->at(idx); } |
|
341 ConnectionGraph* congraph() { return _congraph;} |
|
342 void add_macro_node(Node * n) { |
|
343 //assert(n->is_macro(), "must be a macro node"); |
|
344 assert(!_macro_nodes->contains(n), " duplicate entry in expand list"); |
|
345 _macro_nodes->append(n); |
|
346 } |
|
347 void remove_macro_node(Node * n) { |
|
348 // this function may be called twice for a node so check |
|
349 // that the node is in the array before attempting to remove it |
|
350 if (_macro_nodes->contains(n)) |
|
351 _macro_nodes->remove(n); |
|
352 } |
|
353 |
|
354 // Compilation environment. |
|
355 Arena* comp_arena() { return &_comp_arena; } |
|
356 ciEnv* env() const { return _env; } |
|
357 CompileLog* log() const { return _log; } |
|
358 bool failing() const { return _env->failing() || _failure_reason != NULL; } |
|
359 const char* failure_reason() { return _failure_reason; } |
|
360 bool failure_reason_is(const char* r) { return (r==_failure_reason) || (r!=NULL && _failure_reason!=NULL && strcmp(r, _failure_reason)==0); } |
|
361 |
|
362 void record_failure(const char* reason); |
|
363 void record_method_not_compilable(const char* reason, bool all_tiers = false) { |
|
364 // All bailouts cover "all_tiers" when TieredCompilation is off. |
|
365 if (!TieredCompilation) all_tiers = true; |
|
366 env()->record_method_not_compilable(reason, all_tiers); |
|
367 // Record failure reason. |
|
368 record_failure(reason); |
|
369 } |
|
370 void record_method_not_compilable_all_tiers(const char* reason) { |
|
371 record_method_not_compilable(reason, true); |
|
372 } |
|
373 bool check_node_count(uint margin, const char* reason) { |
|
374 if (unique() + margin > (uint)MaxNodeLimit) { |
|
375 record_method_not_compilable(reason); |
|
376 return true; |
|
377 } else { |
|
378 return false; |
|
379 } |
|
380 } |
|
381 |
|
382 // Node management |
|
383 uint unique() const { return _unique; } |
|
384 uint next_unique() { return _unique++; } |
|
385 void set_unique(uint i) { _unique = i; } |
|
386 static int debug_idx() { return debug_only(_debug_idx)+0; } |
|
387 static void set_debug_idx(int i) { debug_only(_debug_idx = i); } |
|
388 Arena* node_arena() { return &_node_arena; } |
|
389 Arena* old_arena() { return &_old_arena; } |
|
390 RootNode* root() const { return _root; } |
|
391 void set_root(RootNode* r) { _root = r; } |
|
392 StartNode* start() const; // (Derived from root.) |
|
393 void init_start(StartNode* s); |
|
394 Node* immutable_memory(); |
|
395 |
|
396 Node* recent_alloc_ctl() const { return _recent_alloc_ctl; } |
|
397 Node* recent_alloc_obj() const { return _recent_alloc_obj; } |
|
398 void set_recent_alloc(Node* ctl, Node* obj) { |
|
399 _recent_alloc_ctl = ctl; |
|
400 _recent_alloc_obj = obj; |
|
401 } |
|
402 |
|
403 // Handy undefined Node |
|
404 Node* top() const { return _top; } |
|
405 |
|
406 // these are used by guys who need to know about creation and transformation of top: |
|
407 Node* cached_top_node() { return _top; } |
|
408 void set_cached_top_node(Node* tn); |
|
409 |
|
410 GrowableArray<Node_Notes*>* node_note_array() const { return _node_note_array; } |
|
411 void set_node_note_array(GrowableArray<Node_Notes*>* arr) { _node_note_array = arr; } |
|
412 Node_Notes* default_node_notes() const { return _default_node_notes; } |
|
413 void set_default_node_notes(Node_Notes* n) { _default_node_notes = n; } |
|
414 |
|
415 Node_Notes* node_notes_at(int idx) { |
|
416 return locate_node_notes(_node_note_array, idx, false); |
|
417 } |
|
418 inline bool set_node_notes_at(int idx, Node_Notes* value); |
|
419 |
|
420 // Copy notes from source to dest, if they exist. |
|
421 // Overwrite dest only if source provides something. |
|
422 // Return true if information was moved. |
|
423 bool copy_node_notes_to(Node* dest, Node* source); |
|
424 |
|
425 // Workhorse function to sort out the blocked Node_Notes array: |
|
426 inline Node_Notes* locate_node_notes(GrowableArray<Node_Notes*>* arr, |
|
427 int idx, bool can_grow = false); |
|
428 |
|
429 void grow_node_notes(GrowableArray<Node_Notes*>* arr, int grow_by); |
|
430 |
|
431 // Type management |
|
432 Arena* type_arena() { return _type_arena; } |
|
433 Dict* type_dict() { return _type_dict; } |
|
434 void* type_hwm() { return _type_hwm; } |
|
435 size_t type_last_size() { return _type_last_size; } |
|
436 int num_alias_types() { return _num_alias_types; } |
|
437 |
|
438 void init_type_arena() { _type_arena = &_Compile_types; } |
|
439 void set_type_arena(Arena* a) { _type_arena = a; } |
|
440 void set_type_dict(Dict* d) { _type_dict = d; } |
|
441 void set_type_hwm(void* p) { _type_hwm = p; } |
|
442 void set_type_last_size(size_t sz) { _type_last_size = sz; } |
|
443 |
|
444 const TypeFunc* last_tf(ciMethod* m) { |
|
445 return (m == _last_tf_m) ? _last_tf : NULL; |
|
446 } |
|
447 void set_last_tf(ciMethod* m, const TypeFunc* tf) { |
|
448 assert(m != NULL || tf == NULL, ""); |
|
449 _last_tf_m = m; |
|
450 _last_tf = tf; |
|
451 } |
|
452 |
|
453 AliasType* alias_type(int idx) { assert(idx < num_alias_types(), "oob"); return _alias_types[idx]; } |
|
454 AliasType* alias_type(const TypePtr* adr_type) { return find_alias_type(adr_type, false); } |
|
455 bool have_alias_type(const TypePtr* adr_type); |
|
456 AliasType* alias_type(ciField* field); |
|
457 |
|
458 int get_alias_index(const TypePtr* at) { return alias_type(at)->index(); } |
|
459 const TypePtr* get_adr_type(uint aidx) { return alias_type(aidx)->adr_type(); } |
|
460 int get_general_index(uint aidx) { return alias_type(aidx)->general_index(); } |
|
461 |
|
462 // Building nodes |
|
463 void rethrow_exceptions(JVMState* jvms); |
|
464 void return_values(JVMState* jvms); |
|
465 JVMState* build_start_state(StartNode* start, const TypeFunc* tf); |
|
466 |
|
467 // Decide how to build a call. |
|
468 // The profile factor is a discount to apply to this site's interp. profile. |
|
469 CallGenerator* call_generator(ciMethod* call_method, int vtable_index, bool call_is_virtual, JVMState* jvms, bool allow_inline, float profile_factor); |
|
470 |
|
471 // Report if there were too many traps at a current method and bci. |
|
472 // Report if a trap was recorded, and/or PerMethodTrapLimit was exceeded. |
|
473 // If there is no MDO at all, report no trap unless told to assume it. |
|
474 bool too_many_traps(ciMethod* method, int bci, Deoptimization::DeoptReason reason); |
|
475 // This version, unspecific to a particular bci, asks if |
|
476 // PerMethodTrapLimit was exceeded for all inlined methods seen so far. |
|
477 bool too_many_traps(Deoptimization::DeoptReason reason, |
|
478 // Privately used parameter for logging: |
|
479 ciMethodData* logmd = NULL); |
|
480 // Report if there were too many recompiles at a method and bci. |
|
481 bool too_many_recompiles(ciMethod* method, int bci, Deoptimization::DeoptReason reason); |
|
482 |
|
483 // Parsing, optimization |
|
484 PhaseGVN* initial_gvn() { return _initial_gvn; } |
|
485 Unique_Node_List* for_igvn() { return _for_igvn; } |
|
486 inline void record_for_igvn(Node* n); // Body is after class Unique_Node_List. |
|
487 void record_for_escape_analysis(Node* n); |
|
488 void set_initial_gvn(PhaseGVN *gvn) { _initial_gvn = gvn; } |
|
489 void set_for_igvn(Unique_Node_List *for_igvn) { _for_igvn = for_igvn; } |
|
490 |
|
491 void identify_useful_nodes(Unique_Node_List &useful); |
|
492 void remove_useless_nodes (Unique_Node_List &useful); |
|
493 |
|
494 WarmCallInfo* warm_calls() const { return _warm_calls; } |
|
495 void set_warm_calls(WarmCallInfo* l) { _warm_calls = l; } |
|
496 WarmCallInfo* pop_warm_call(); |
|
497 |
|
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; |
|
517 |
|
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; } |
|
522 |
|
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 } |
|
528 |
|
529 void set_has_java_calls(bool z) { _has_java_calls = z; } |
|
530 |
|
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; } |
|
547 |
|
548 // emit to scratch blob, report resulting size |
|
549 uint scratch_emit_size(const Node* n); |
|
550 |
|
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 }; |
|
557 |
|
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); |
|
564 |
|
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); |
|
572 |
|
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); |
|
576 |
|
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); |
|
580 |
|
581 // Are we compiling a method? |
|
582 bool has_method() { return method() != NULL; } |
|
583 |
|
584 // Maybe print some information about this compile. |
|
585 void print_compile_messages(); |
|
586 |
|
587 // Final graph reshaping, a post-pass after the regular optimizer is done. |
|
588 bool final_graph_reshaping(); |
|
589 |
|
590 // returns true if adr is completely contained in the given alias category |
|
591 bool must_alias(const TypePtr* adr, int alias_idx); |
|
592 |
|
593 // returns true if adr overlaps with the given alias category |
|
594 bool can_alias(const TypePtr* adr, int alias_idx); |
|
595 |
|
596 // Driver for converting compiler's IR into machine code bits |
|
597 void Output(); |
|
598 |
|
599 // Accessors for node bundling info. |
|
600 Bundle* node_bundling(const Node *n); |
|
601 bool valid_bundle_info(const Node *n); |
|
602 |
|
603 // Schedule and Bundle the instructions |
|
604 void ScheduleAndBundle(); |
|
605 |
|
606 // Build OopMaps for each GC point |
|
607 void BuildOopMaps(); |
|
608 // Append debug info for the node to the array |
|
609 void FillLocArray( int idx, Node *local, GrowableArray<ScopeValue*> *array ); |
|
610 |
|
611 // Process an OopMap Element while emitting nodes |
|
612 void Process_OopMap_Node(MachNode *mach, int code_offset); |
|
613 |
|
614 // Write out basic block data to code buffer |
|
615 void Fill_buffer(); |
|
616 |
|
617 // Determine which variable sized branches can be shortened |
|
618 void Shorten_branches(Label *labels, int& code_size, int& reloc_size, int& stub_size, int& const_size); |
|
619 |
|
620 // Compute the size of first NumberOfLoopInstrToAlign instructions |
|
621 // at the head of a loop. |
|
622 void compute_loop_first_inst_sizes(); |
|
623 |
|
624 // Compute the information for the exception tables |
|
625 void FillExceptionTables(uint cnt, uint *call_returns, uint *inct_starts, Label *blk_labels); |
|
626 |
|
627 // Stack slots that may be unused by the calling convention but must |
|
628 // otherwise be preserved. On Intel this includes the return address. |
|
629 // On PowerPC it includes the 4 words holding the old TOC & LR glue. |
|
630 uint in_preserve_stack_slots(); |
|
631 |
|
632 // "Top of Stack" slots that may be unused by the calling convention but must |
|
633 // otherwise be preserved. |
|
634 // On Intel these are not necessary and the value can be zero. |
|
635 // On Sparc this describes the words reserved for storing a register window |
|
636 // when an interrupt occurs. |
|
637 static uint out_preserve_stack_slots(); |
|
638 |
|
639 // Number of outgoing stack slots killed above the out_preserve_stack_slots |
|
640 // for calls to C. Supports the var-args backing area for register parms. |
|
641 uint varargs_C_out_slots_killed() const; |
|
642 |
|
643 // Number of Stack Slots consumed by a synchronization entry |
|
644 int sync_stack_slots() const; |
|
645 |
|
646 // Compute the name of old_SP. See <arch>.ad for frame layout. |
|
647 OptoReg::Name compute_old_SP(); |
|
648 |
|
649 #ifdef ENABLE_ZAP_DEAD_LOCALS |
|
650 static bool is_node_getting_a_safepoint(Node*); |
|
651 void Insert_zap_nodes(); |
|
652 Node* call_zap_node(MachSafePointNode* n, int block_no); |
|
653 #endif |
|
654 |
|
655 private: |
|
656 // Phase control: |
|
657 void Init(int aliaslevel); // Prepare for a single compilation |
|
658 int Inline_Warm(); // Find more inlining work. |
|
659 void Finish_Warm(); // Give up on further inlines. |
|
660 void Optimize(); // Given a graph, optimize it |
|
661 void Code_Gen(); // Generate code from a graph |
|
662 |
|
663 // Management of the AliasType table. |
|
664 void grow_alias_types(); |
|
665 AliasCacheEntry* probe_alias_cache(const TypePtr* adr_type); |
|
666 const TypePtr *flatten_alias_type(const TypePtr* adr_type) const; |
|
667 AliasType* find_alias_type(const TypePtr* adr_type, bool no_create); |
|
668 |
|
669 void verify_top(Node*) const PRODUCT_RETURN; |
|
670 |
|
671 // Intrinsic setup. |
|
672 void register_library_intrinsics(); // initializer |
|
673 CallGenerator* make_vm_intrinsic(ciMethod* m, bool is_virtual); // constructor |
|
674 int intrinsic_insertion_index(ciMethod* m, bool is_virtual); // helper |
|
675 CallGenerator* find_intrinsic(ciMethod* m, bool is_virtual); // query fn |
|
676 void register_intrinsic(CallGenerator* cg); // update fn |
|
677 |
|
678 #ifndef PRODUCT |
|
679 static juint _intrinsic_hist_count[vmIntrinsics::ID_LIMIT]; |
|
680 static jubyte _intrinsic_hist_flags[vmIntrinsics::ID_LIMIT]; |
|
681 #endif |
|
682 |
|
683 public: |
|
684 |
|
685 // Note: Histogram array size is about 1 Kb. |
|
686 enum { // flag bits: |
|
687 _intrinsic_worked = 1, // succeeded at least once |
|
688 _intrinsic_failed = 2, // tried it but it failed |
|
689 _intrinsic_disabled = 4, // was requested but disabled (e.g., -XX:-InlineUnsafeOps) |
|
690 _intrinsic_virtual = 8, // was seen in the virtual form (rare) |
|
691 _intrinsic_both = 16 // was seen in the non-virtual form (usual) |
|
692 }; |
|
693 // Update histogram. Return boolean if this is a first-time occurrence. |
|
694 static bool gather_intrinsic_statistics(vmIntrinsics::ID id, |
|
695 bool is_virtual, int flags) PRODUCT_RETURN0; |
|
696 static void print_intrinsic_statistics() PRODUCT_RETURN; |
|
697 |
|
698 // Graph verification code |
|
699 // Walk the node list, verifying that there is a one-to-one |
|
700 // correspondence between Use-Def edges and Def-Use edges |
|
701 // The option no_dead_code enables stronger checks that the |
|
702 // graph is strongly connected from root in both directions. |
|
703 void verify_graph_edges(bool no_dead_code = false) PRODUCT_RETURN; |
|
704 |
|
705 // Print bytecodes, including the scope inlining tree |
|
706 void print_codes(); |
|
707 |
|
708 // End-of-run dumps. |
|
709 static void print_statistics() PRODUCT_RETURN; |
|
710 |
|
711 // Dump formatted assembly |
|
712 void dump_asm(int *pcs = NULL, uint pc_limit = 0) PRODUCT_RETURN; |
|
713 void dump_pc(int *pcs, int pc_limit, Node *n); |
|
714 |
|
715 // Verify ADLC assumptions during startup |
|
716 static void adlc_verification() PRODUCT_RETURN; |
|
717 |
|
718 // Definitions of pd methods |
|
719 static void pd_compiler2_init(); |
|
720 }; |