1 /*
2 * Copyright (c) 1997, 2014, Oracle and/or its affiliates. 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 Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
24
25 #ifndef SHARE_VM_OPTO_COMPILE_HPP
26 #define SHARE_VM_OPTO_COMPILE_HPP
27
28 #include "asm/codeBuffer.hpp"
29 #include "ci/compilerInterface.hpp"
30 #include "code/debugInfoRec.hpp"
31 #include "code/exceptionHandlerTable.hpp"
32 #include "compiler/compilerOracle.hpp"
33 #include "compiler/compileBroker.hpp"
34 #include "libadt/dict.hpp"
35 #include "libadt/vectset.hpp"
36 #include "memory/resourceArea.hpp"
37 #include "opto/idealGraphPrinter.hpp"
38 #include "opto/phasetype.hpp"
39 #include "opto/phase.hpp"
40 #include "opto/regmask.hpp"
41 #include "runtime/deoptimization.hpp"
42 #include "runtime/vmThread.hpp"
43 #include "trace/tracing.hpp"
44 #include "utilities/ticks.hpp"
45
46 class Block;
47 class Bundle;
48 class C2Compiler;
49 class CallGenerator;
50 class ConnectionGraph;
51 class InlineTree;
52 class Int_Array;
53 class Matcher;
54 class MachConstantNode;
55 class MachConstantBaseNode;
56 class MachNode;
57 class MachOper;
58 class MachSafePointNode;
59 class Node;
60 class Node_Array;
61 class Node_Notes;
62 class OptoReg;
63 class PhaseCFG;
64 class PhaseGVN;
65 class PhaseIterGVN;
66 class PhaseRegAlloc;
67 class PhaseCCP;
68 class PhaseCCP_DCE;
69 class RootNode;
70 class relocInfo;
71 class Scope;
72 class StartNode;
73 class SafePointNode;
74 class JVMState;
75 class Type;
76 class TypeData;
77 class TypePtr;
78 class TypeOopPtr;
79 class TypeFunc;
80 class Unique_Node_List;
81 class nmethod;
82 class WarmCallInfo;
83 class Node_Stack;
84 struct Final_Reshape_Counts;
85
86 //------------------------------Compile----------------------------------------
87 // This class defines a top-level Compiler invocation.
88
89 class Compile : public Phase {
90 friend class VMStructs;
91
92 public:
93 // Fixed alias indexes. (See also MergeMemNode.)
94 enum {
95 AliasIdxTop = 1, // pseudo-index, aliases to nothing (used as sentinel value)
96 AliasIdxBot = 2, // pseudo-index, aliases to everything
97 AliasIdxRaw = 3 // hard-wired index for TypeRawPtr::BOTTOM
98 };
99
100 // Variant of TraceTime(NULL, &_t_accumulator, TimeCompiler);
101 // Integrated with logging. If logging is turned on, and dolog is true,
102 // then brackets are put into the log, with time stamps and node counts.
103 // (The time collection itself is always conditionalized on TimeCompiler.)
104 class TracePhase : public TraceTime {
105 private:
106 Compile* C;
107 CompileLog* _log;
108 const char* _phase_name;
109 bool _dolog;
110 public:
111 TracePhase(const char* name, elapsedTimer* accumulator, bool dolog);
112 ~TracePhase();
113 };
114
115 // Information per category of alias (memory slice)
116 class AliasType {
117 private:
118 friend class Compile;
119
120 int _index; // unique index, used with MergeMemNode
121 const TypePtr* _adr_type; // normalized address type
122 ciField* _field; // relevant instance field, or null if none
123 const Type* _element; // relevant array element type, or null if none
124 bool _is_rewritable; // false if the memory is write-once only
125 int _general_index; // if this is type is an instance, the general
126 // type that this is an instance of
127
128 void Init(int i, const TypePtr* at);
129
130 public:
131 int index() const { return _index; }
132 const TypePtr* adr_type() const { return _adr_type; }
133 ciField* field() const { return _field; }
134 const Type* element() const { return _element; }
135 bool is_rewritable() const { return _is_rewritable; }
136 bool is_volatile() const { return (_field ? _field->is_volatile() : false); }
137 int general_index() const { return (_general_index != 0) ? _general_index : _index; }
138
139 void set_rewritable(bool z) { _is_rewritable = z; }
140 void set_field(ciField* f) {
141 assert(!_field,"");
142 _field = f;
143 if (f->is_final() || f->is_stable()) {
144 // In the case of @Stable, multiple writes are possible but may be assumed to be no-ops.
145 _is_rewritable = false;
146 }
147 }
148 void set_element(const Type* e) {
149 assert(_element == NULL, "");
150 _element = e;
151 }
152
153 void print_on(outputStream* st) PRODUCT_RETURN;
154 };
155
156 enum {
157 logAliasCacheSize = 6,
158 AliasCacheSize = (1<<logAliasCacheSize)
159 };
160 struct AliasCacheEntry { const TypePtr* _adr_type; int _index; }; // simple duple type
161 enum {
162 trapHistLength = MethodData::_trap_hist_limit
163 };
164
165 // Constant entry of the constant table.
166 class Constant {
167 private:
168 BasicType _type;
169 union {
170 jvalue _value;
171 Metadata* _metadata;
172 } _v;
173 int _offset; // offset of this constant (in bytes) relative to the constant table base.
174 float _freq;
175 bool _can_be_reused; // true (default) if the value can be shared with other users.
176
177 public:
178 Constant() : _type(T_ILLEGAL), _offset(-1), _freq(0.0f), _can_be_reused(true) { _v._value.l = 0; }
179 Constant(BasicType type, jvalue value, float freq = 0.0f, bool can_be_reused = true) :
180 _type(type),
181 _offset(-1),
182 _freq(freq),
183 _can_be_reused(can_be_reused)
184 {
185 assert(type != T_METADATA, "wrong constructor");
186 _v._value = value;
187 }
188 Constant(Metadata* metadata, bool can_be_reused = true) :
189 _type(T_METADATA),
190 _offset(-1),
191 _freq(0.0f),
192 _can_be_reused(can_be_reused)
193 {
194 _v._metadata = metadata;
195 }
196
197 bool operator==(const Constant& other);
198
199 BasicType type() const { return _type; }
200
201 jlong get_jlong() const { return _v._value.j; }
202 jfloat get_jfloat() const { return _v._value.f; }
203 jdouble get_jdouble() const { return _v._value.d; }
204 jobject get_jobject() const { return _v._value.l; }
205
206 Metadata* get_metadata() const { return _v._metadata; }
207
208 int offset() const { return _offset; }
209 void set_offset(int offset) { _offset = offset; }
210
211 float freq() const { return _freq; }
212 void inc_freq(float freq) { _freq += freq; }
213
214 bool can_be_reused() const { return _can_be_reused; }
215 };
216
217 // Constant table.
218 class ConstantTable {
219 private:
220 GrowableArray<Constant> _constants; // Constants of this table.
221 int _size; // Size in bytes the emitted constant table takes (including padding).
222 int _table_base_offset; // Offset of the table base that gets added to the constant offsets.
223 int _nof_jump_tables; // Number of jump-tables in this constant table.
224
225 static int qsort_comparator(Constant* a, Constant* b);
226
227 // We use negative frequencies to keep the order of the
228 // jump-tables in which they were added. Otherwise we get into
229 // trouble with relocation.
230 float next_jump_table_freq() { return -1.0f * (++_nof_jump_tables); }
231
232 public:
233 ConstantTable() :
234 _size(-1),
235 _table_base_offset(-1), // We can use -1 here since the constant table is always bigger than 2 bytes (-(size / 2), see MachConstantBaseNode::emit).
236 _nof_jump_tables(0)
237 {}
238
239 int size() const { assert(_size != -1, "not calculated yet"); return _size; }
240
241 int calculate_table_base_offset() const; // AD specific
242 void set_table_base_offset(int x) { assert(_table_base_offset == -1 || x == _table_base_offset, "can't change"); _table_base_offset = x; }
243 int table_base_offset() const { assert(_table_base_offset != -1, "not set yet"); return _table_base_offset; }
244
245 void emit(CodeBuffer& cb);
246
247 // Returns the offset of the last entry (the top) of the constant table.
248 int top_offset() const { assert(_constants.top().offset() != -1, "not bound yet"); return _constants.top().offset(); }
249
250 void calculate_offsets_and_size();
251 int find_offset(Constant& con) const;
252
253 void add(Constant& con);
254 Constant add(MachConstantNode* n, BasicType type, jvalue value);
255 Constant add(Metadata* metadata);
256 Constant add(MachConstantNode* n, MachOper* oper);
257 Constant add(MachConstantNode* n, jfloat f) {
258 jvalue value; value.f = f;
259 return add(n, T_FLOAT, value);
260 }
261 Constant add(MachConstantNode* n, jdouble d) {
262 jvalue value; value.d = d;
263 return add(n, T_DOUBLE, value);
264 }
265
266 // Jump-table
267 Constant add_jump_table(MachConstantNode* n);
268 void fill_jump_table(CodeBuffer& cb, MachConstantNode* n, GrowableArray<Label*> labels) const;
269 };
270
271 private:
272 // Fixed parameters to this compilation.
273 const int _compile_id;
274 const bool _save_argument_registers; // save/restore arg regs for trampolines
275 const bool _subsume_loads; // Load can be matched as part of a larger op.
276 const bool _do_escape_analysis; // Do escape analysis.
277 const bool _eliminate_boxing; // Do boxing elimination.
278 ciMethod* _method; // The method being compiled.
279 int _entry_bci; // entry bci for osr methods.
280 const TypeFunc* _tf; // My kind of signature
281 InlineTree* _ilt; // Ditto (temporary).
282 address _stub_function; // VM entry for stub being compiled, or NULL
283 const char* _stub_name; // Name of stub or adapter being compiled, or NULL
284 address _stub_entry_point; // Compile code entry for generated stub, or NULL
285
286 // Control of this compilation.
287 int _num_loop_opts; // Number of iterations for doing loop optimiztions
288 int _max_inline_size; // Max inline size for this compilation
289 int _freq_inline_size; // Max hot method inline size for this compilation
290 int _fixed_slots; // count of frame slots not allocated by the register
291 // allocator i.e. locks, original deopt pc, etc.
292 // For deopt
293 int _orig_pc_slot;
294 int _orig_pc_slot_offset_in_bytes;
295
296 int _major_progress; // Count of something big happening
297 bool _inlining_progress; // progress doing incremental inlining?
298 bool _inlining_incrementally;// Are we doing incremental inlining (post parse)
299 bool _has_loops; // True if the method _may_ have some loops
300 bool _has_split_ifs; // True if the method _may_ have some split-if
301 bool _has_unsafe_access; // True if the method _may_ produce faults in unsafe loads or stores.
302 bool _has_stringbuilder; // True StringBuffers or StringBuilders are allocated
303 bool _has_boxed_value; // True if a boxed object is allocated
304 int _max_vector_size; // Maximum size of generated vectors
305 uint _trap_hist[trapHistLength]; // Cumulative traps
306 bool _trap_can_recompile; // Have we emitted a recompiling trap?
307 uint _decompile_count; // Cumulative decompilation counts.
308 bool _do_inlining; // True if we intend to do inlining
309 bool _do_scheduling; // True if we intend to do scheduling
310 bool _do_freq_based_layout; // True if we intend to do frequency based block layout
311 bool _do_count_invocations; // True if we generate code to count invocations
312 bool _do_method_data_update; // True if we generate code to update MethodData*s
313 bool _age_code; // True if we need to profile code age (decrement the aging counter)
314 int _AliasLevel; // Locally-adjusted version of AliasLevel flag.
315 bool _print_assembly; // True if we should dump assembly code for this compilation
316 bool _print_inlining; // True if we should print inlining for this compilation
317 bool _print_intrinsics; // True if we should print intrinsics for this compilation
318 #ifndef PRODUCT
319 bool _trace_opto_output;
320 bool _parsed_irreducible_loop; // True if ciTypeFlow detected irreducible loops during parsing
321 #endif
322 bool _has_irreducible_loop; // Found irreducible loops
323 // JSR 292
324 bool _has_method_handle_invokes; // True if this method has MethodHandle invokes.
325 RTMState _rtm_state; // State of Restricted Transactional Memory usage
326
327 // Compilation environment.
328 Arena _comp_arena; // Arena with lifetime equivalent to Compile
329 ciEnv* _env; // CI interface
330 CompileLog* _log; // from CompilerThread
331 const char* _failure_reason; // for record_failure/failing pattern
332 GrowableArray<CallGenerator*>* _intrinsics; // List of intrinsics.
333 GrowableArray<Node*>* _macro_nodes; // List of nodes which need to be expanded before matching.
334 GrowableArray<Node*>* _predicate_opaqs; // List of Opaque1 nodes for the loop predicates.
335 GrowableArray<Node*>* _expensive_nodes; // List of nodes that are expensive to compute and that we'd better not let the GVN freely common
336 ConnectionGraph* _congraph;
337 #ifndef PRODUCT
338 IdealGraphPrinter* _printer;
339 #endif
340
341
342 // Node management
343 uint _unique; // Counter for unique Node indices
344 VectorSet _dead_node_list; // Set of dead nodes
345 uint _dead_node_count; // Number of dead nodes; VectorSet::Size() is O(N).
346 // So use this to keep count and make the call O(1).
347 debug_only(static int _debug_idx;) // Monotonic counter (not reset), use -XX:BreakAtNode=<idx>
348 Arena _node_arena; // Arena for new-space Nodes
349 Arena _old_arena; // Arena for old-space Nodes, lifetime during xform
350 RootNode* _root; // Unique root of compilation, or NULL after bail-out.
351 Node* _top; // Unique top node. (Reset by various phases.)
352
353 Node* _immutable_memory; // Initial memory state
354
355 Node* _recent_alloc_obj;
356 Node* _recent_alloc_ctl;
357
358 // Constant table
359 ConstantTable _constant_table; // The constant table for this compile.
360 MachConstantBaseNode* _mach_constant_base_node; // Constant table base node singleton.
361
362
363 // Blocked array of debugging and profiling information,
364 // tracked per node.
365 enum { _log2_node_notes_block_size = 8,
366 _node_notes_block_size = (1<<_log2_node_notes_block_size)
367 };
368 GrowableArray<Node_Notes*>* _node_note_array;
369 Node_Notes* _default_node_notes; // default notes for new nodes
370
371 // After parsing and every bulk phase we hang onto the Root instruction.
372 // The RootNode instruction is where the whole program begins. It produces
373 // the initial Control and BOTTOM for everybody else.
374
375 // Type management
376 Arena _Compile_types; // Arena for all types
377 Arena* _type_arena; // Alias for _Compile_types except in Initialize_shared()
378 Dict* _type_dict; // Intern table
379 void* _type_hwm; // Last allocation (see Type::operator new/delete)
380 size_t _type_last_size; // Last allocation size (see Type::operator new/delete)
381 ciMethod* _last_tf_m; // Cache for
382 const TypeFunc* _last_tf; // TypeFunc::make
383 AliasType** _alias_types; // List of alias types seen so far.
384 int _num_alias_types; // Logical length of _alias_types
385 int _max_alias_types; // Physical length of _alias_types
386 AliasCacheEntry _alias_cache[AliasCacheSize]; // Gets aliases w/o data structure walking
387
388 // Parsing, optimization
389 PhaseGVN* _initial_gvn; // Results of parse-time PhaseGVN
390 Unique_Node_List* _for_igvn; // Initial work-list for next round of Iterative GVN
391 WarmCallInfo* _warm_calls; // Sorted work-list for heat-based inlining.
392
393 GrowableArray<CallGenerator*> _late_inlines; // List of CallGenerators to be revisited after
394 // main parsing has finished.
395 GrowableArray<CallGenerator*> _string_late_inlines; // same but for string operations
396
397 GrowableArray<CallGenerator*> _boxing_late_inlines; // same but for boxing operations
398
399 int _late_inlines_pos; // Where in the queue should the next late inlining candidate go (emulate depth first inlining)
400 uint _number_of_mh_late_inlines; // number of method handle late inlining still pending
401
402
403 // Inlining may not happen in parse order which would make
404 // PrintInlining output confusing. Keep track of PrintInlining
405 // pieces in order.
406 class PrintInliningBuffer : public ResourceObj {
407 private:
408 CallGenerator* _cg;
409 stringStream* _ss;
410
411 public:
412 PrintInliningBuffer()
413 : _cg(NULL) { _ss = new stringStream(); }
414
415 stringStream* ss() const { return _ss; }
416 CallGenerator* cg() const { return _cg; }
417 void set_cg(CallGenerator* cg) { _cg = cg; }
418 };
419
420 stringStream* _print_inlining_stream;
421 GrowableArray<PrintInliningBuffer>* _print_inlining_list;
422 int _print_inlining_idx;
423
424 // Only keep nodes in the expensive node list that need to be optimized
425 void cleanup_expensive_nodes(PhaseIterGVN &igvn);
426 // Use for sorting expensive nodes to bring similar nodes together
427 static int cmp_expensive_nodes(Node** n1, Node** n2);
428 // Expensive nodes list already sorted?
429 bool expensive_nodes_sorted() const;
430 // Remove the speculative part of types and clean up the graph
431 void remove_speculative_types(PhaseIterGVN &igvn);
432
433 void* _replay_inline_data; // Pointer to data loaded from file
434
435 void print_inlining_init();
436 void print_inlining_reinit();
437 void print_inlining_commit();
438 void print_inlining_push();
439 PrintInliningBuffer& print_inlining_current();
440
441 void log_late_inline_failure(CallGenerator* cg, const char* msg);
442
443 public:
444
445 outputStream* print_inlining_stream() const {
446 assert(print_inlining() || print_intrinsics(), "PrintInlining off?");
447 return _print_inlining_stream;
448 }
449
450 void print_inlining_update(CallGenerator* cg);
451 void print_inlining_update_delayed(CallGenerator* cg);
452 void print_inlining_move_to(CallGenerator* cg);
453 void print_inlining_assert_ready();
454 void print_inlining_reset();
455
456 void print_inlining(ciMethod* method, int inline_level, int bci, const char* msg = NULL) {
457 stringStream ss;
458 CompileTask::print_inlining(&ss, method, inline_level, bci, msg);
459 print_inlining_stream()->print("%s", ss.as_string());
460 }
461
462 void log_late_inline(CallGenerator* cg);
463 void log_inline_id(CallGenerator* cg);
464 void log_inline_failure(const char* msg);
465
466 void* replay_inline_data() const { return _replay_inline_data; }
467
468 // Dump inlining replay data to the stream.
469 void dump_inline_data(outputStream* out);
470
471 private:
472 // Matching, CFG layout, allocation, code generation
473 PhaseCFG* _cfg; // Results of CFG finding
474 bool _select_24_bit_instr; // We selected an instruction with a 24-bit result
475 bool _in_24_bit_fp_mode; // We are emitting instructions with 24-bit results
476 int _java_calls; // Number of java calls in the method
477 int _inner_loops; // Number of inner loops in the method
478 Matcher* _matcher; // Engine to map ideal to machine instructions
479 PhaseRegAlloc* _regalloc; // Results of register allocation.
480 int _frame_slots; // Size of total frame in stack slots
481 CodeOffsets _code_offsets; // Offsets into the code for various interesting entries
482 RegMask _FIRST_STACK_mask; // All stack slots usable for spills (depends on frame layout)
483 Arena* _indexSet_arena; // control IndexSet allocation within PhaseChaitin
484 void* _indexSet_free_block_list; // free list of IndexSet bit blocks
485 int _interpreter_frame_size;
486
487 uint _node_bundling_limit;
488 Bundle* _node_bundling_base; // Information for instruction bundling
489
490 // Instruction bits passed off to the VM
491 int _method_size; // Size of nmethod code segment in bytes
492 CodeBuffer _code_buffer; // Where the code is assembled
493 int _first_block_size; // Size of unvalidated entry point code / OSR poison code
494 ExceptionHandlerTable _handler_table; // Table of native-code exception handlers
495 ImplicitExceptionTable _inc_table; // Table of implicit null checks in native code
496 OopMapSet* _oop_map_set; // Table of oop maps (one for each safepoint location)
497 static int _CompiledZap_count; // counter compared against CompileZap[First/Last]
498 BufferBlob* _scratch_buffer_blob; // For temporary code buffers.
499 relocInfo* _scratch_locs_memory; // For temporary code buffers.
500 int _scratch_const_size; // For temporary code buffers.
501 bool _in_scratch_emit_size; // true when in scratch_emit_size.
502
503 public:
504 // Accessors
505
506 // The Compile instance currently active in this (compiler) thread.
507 static Compile* current() {
508 return (Compile*) ciEnv::current()->compiler_data();
509 }
510
511 // ID for this compilation. Useful for setting breakpoints in the debugger.
512 int compile_id() const { return _compile_id; }
513
514 // Does this compilation allow instructions to subsume loads? User
515 // instructions that subsume a load may result in an unschedulable
516 // instruction sequence.
517 bool subsume_loads() const { return _subsume_loads; }
518 /** Do escape analysis. */
519 bool do_escape_analysis() const { return _do_escape_analysis; }
520 /** Do boxing elimination. */
521 bool eliminate_boxing() const { return _eliminate_boxing; }
522 /** Do aggressive boxing elimination. */
523 bool aggressive_unboxing() const { return _eliminate_boxing && AggressiveUnboxing; }
524 bool save_argument_registers() const { return _save_argument_registers; }
525
526
527 // Other fixed compilation parameters.
528 ciMethod* method() const { return _method; }
529 int entry_bci() const { return _entry_bci; }
530 bool is_osr_compilation() const { return _entry_bci != InvocationEntryBci; }
531 bool is_method_compilation() const { return (_method != NULL && !_method->flags().is_native()); }
532 const TypeFunc* tf() const { assert(_tf!=NULL, ""); return _tf; }
533 void init_tf(const TypeFunc* tf) { assert(_tf==NULL, ""); _tf = tf; }
534 InlineTree* ilt() const { return _ilt; }
535 address stub_function() const { return _stub_function; }
536 const char* stub_name() const { return _stub_name; }
537 address stub_entry_point() const { return _stub_entry_point; }
538
539 // Control of this compilation.
540 int fixed_slots() const { assert(_fixed_slots >= 0, ""); return _fixed_slots; }
541 void set_fixed_slots(int n) { _fixed_slots = n; }
542 int major_progress() const { return _major_progress; }
543 void set_inlining_progress(bool z) { _inlining_progress = z; }
544 int inlining_progress() const { return _inlining_progress; }
545 void set_inlining_incrementally(bool z) { _inlining_incrementally = z; }
546 int inlining_incrementally() const { return _inlining_incrementally; }
547 void set_major_progress() { _major_progress++; }
548 void clear_major_progress() { _major_progress = 0; }
549 int num_loop_opts() const { return _num_loop_opts; }
550 void set_num_loop_opts(int n) { _num_loop_opts = n; }
551 int max_inline_size() const { return _max_inline_size; }
552 void set_freq_inline_size(int n) { _freq_inline_size = n; }
553 int freq_inline_size() const { return _freq_inline_size; }
554 void set_max_inline_size(int n) { _max_inline_size = n; }
555 bool has_loops() const { return _has_loops; }
556 void set_has_loops(bool z) { _has_loops = z; }
557 bool has_split_ifs() const { return _has_split_ifs; }
558 void set_has_split_ifs(bool z) { _has_split_ifs = z; }
559 bool has_unsafe_access() const { return _has_unsafe_access; }
560 void set_has_unsafe_access(bool z) { _has_unsafe_access = z; }
561 bool has_stringbuilder() const { return _has_stringbuilder; }
562 void set_has_stringbuilder(bool z) { _has_stringbuilder = z; }
563 bool has_boxed_value() const { return _has_boxed_value; }
564 void set_has_boxed_value(bool z) { _has_boxed_value = z; }
565 int max_vector_size() const { return _max_vector_size; }
566 void set_max_vector_size(int s) { _max_vector_size = s; }
567 void set_trap_count(uint r, uint c) { assert(r < trapHistLength, "oob"); _trap_hist[r] = c; }
568 uint trap_count(uint r) const { assert(r < trapHistLength, "oob"); return _trap_hist[r]; }
569 bool trap_can_recompile() const { return _trap_can_recompile; }
570 void set_trap_can_recompile(bool z) { _trap_can_recompile = z; }
571 uint decompile_count() const { return _decompile_count; }
572 void set_decompile_count(uint c) { _decompile_count = c; }
573 bool allow_range_check_smearing() const;
574 bool do_inlining() const { return _do_inlining; }
575 void set_do_inlining(bool z) { _do_inlining = z; }
576 bool do_scheduling() const { return _do_scheduling; }
577 void set_do_scheduling(bool z) { _do_scheduling = z; }
578 bool do_freq_based_layout() const{ return _do_freq_based_layout; }
579 void set_do_freq_based_layout(bool z){ _do_freq_based_layout = z; }
580 bool do_count_invocations() const{ return _do_count_invocations; }
581 void set_do_count_invocations(bool z){ _do_count_invocations = z; }
582 bool do_method_data_update() const { return _do_method_data_update; }
583 void set_do_method_data_update(bool z) { _do_method_data_update = z; }
584 bool age_code() const { return _age_code; }
585 void set_age_code(bool z) { _age_code = z; }
586 int AliasLevel() const { return _AliasLevel; }
587 bool print_assembly() const { return _print_assembly; }
588 void set_print_assembly(bool z) { _print_assembly = z; }
589 bool print_inlining() const { return _print_inlining; }
590 void set_print_inlining(bool z) { _print_inlining = z; }
591 bool print_intrinsics() const { return _print_intrinsics; }
592 void set_print_intrinsics(bool z) { _print_intrinsics = z; }
593 RTMState rtm_state() const { return _rtm_state; }
594 void set_rtm_state(RTMState s) { _rtm_state = s; }
595 bool use_rtm() const { return (_rtm_state & NoRTM) == 0; }
596 bool profile_rtm() const { return _rtm_state == ProfileRTM; }
597 // check the CompilerOracle for special behaviours for this compile
598 bool method_has_option(const char * option) {
599 return method() != NULL && method()->has_option(option);
600 }
601 #ifndef PRODUCT
602 bool trace_opto_output() const { return _trace_opto_output; }
603 bool parsed_irreducible_loop() const { return _parsed_irreducible_loop; }
604 void set_parsed_irreducible_loop(bool z) { _parsed_irreducible_loop = z; }
605 int _in_dump_cnt; // Required for dumping ir nodes.
606 #endif
607 bool has_irreducible_loop() const { return _has_irreducible_loop; }
608 void set_has_irreducible_loop(bool z) { _has_irreducible_loop = z; }
609
610 // JSR 292
611 bool has_method_handle_invokes() const { return _has_method_handle_invokes; }
612 void set_has_method_handle_invokes(bool z) { _has_method_handle_invokes = z; }
613
614 Ticks _latest_stage_start_counter;
615
616 void begin_method() {
617 #ifndef PRODUCT
618 if (_printer) _printer->begin_method(this);
619 #endif
620 C->_latest_stage_start_counter.stamp();
621 }
622
623 void print_method(CompilerPhaseType cpt, int level = 1) {
624 EventCompilerPhase event;
625 if (event.should_commit()) {
626 event.set_starttime(C->_latest_stage_start_counter);
627 event.set_phase((u1) cpt);
628 event.set_compileID(C->_compile_id);
629 event.set_phaseLevel(level);
630 event.commit();
631 }
632
633
634 #ifndef PRODUCT
635 if (_printer) _printer->print_method(this, CompilerPhaseTypeHelper::to_string(cpt), level);
636 #endif
637 C->_latest_stage_start_counter.stamp();
638 }
639
640 void end_method(int level = 1) {
641 EventCompilerPhase event;
642 if (event.should_commit()) {
643 event.set_starttime(C->_latest_stage_start_counter);
644 event.set_phase((u1) PHASE_END);
645 event.set_compileID(C->_compile_id);
646 event.set_phaseLevel(level);
647 event.commit();
648 }
649 #ifndef PRODUCT
650 if (_printer) _printer->end_method();
651 #endif
652 }
653
654 int macro_count() const { return _macro_nodes->length(); }
655 int predicate_count() const { return _predicate_opaqs->length();}
656 int expensive_count() const { return _expensive_nodes->length(); }
657 Node* macro_node(int idx) const { return _macro_nodes->at(idx); }
658 Node* predicate_opaque1_node(int idx) const { return _predicate_opaqs->at(idx);}
659 Node* expensive_node(int idx) const { return _expensive_nodes->at(idx); }
660 ConnectionGraph* congraph() { return _congraph;}
661 void set_congraph(ConnectionGraph* congraph) { _congraph = congraph;}
662 void add_macro_node(Node * n) {
663 //assert(n->is_macro(), "must be a macro node");
664 assert(!_macro_nodes->contains(n), " duplicate entry in expand list");
665 _macro_nodes->append(n);
666 }
667 void remove_macro_node(Node * n) {
668 // this function may be called twice for a node so check
669 // that the node is in the array before attempting to remove it
670 if (_macro_nodes->contains(n))
671 _macro_nodes->remove(n);
672 // remove from _predicate_opaqs list also if it is there
673 if (predicate_count() > 0 && _predicate_opaqs->contains(n)){
674 _predicate_opaqs->remove(n);
675 }
676 }
677 void add_expensive_node(Node * n);
678 void remove_expensive_node(Node * n) {
679 if (_expensive_nodes->contains(n)) {
680 _expensive_nodes->remove(n);
681 }
682 }
683 void add_predicate_opaq(Node * n) {
684 assert(!_predicate_opaqs->contains(n), " duplicate entry in predicate opaque1");
685 assert(_macro_nodes->contains(n), "should have already been in macro list");
686 _predicate_opaqs->append(n);
687 }
688 // remove the opaque nodes that protect the predicates so that the unused checks and
689 // uncommon traps will be eliminated from the graph.
690 void cleanup_loop_predicates(PhaseIterGVN &igvn);
691 bool is_predicate_opaq(Node * n) {
692 return _predicate_opaqs->contains(n);
693 }
694
695 // Are there candidate expensive nodes for optimization?
696 bool should_optimize_expensive_nodes(PhaseIterGVN &igvn);
697 // Check whether n1 and n2 are similar
698 static int cmp_expensive_nodes(Node* n1, Node* n2);
699 // Sort expensive nodes to locate similar expensive nodes
700 void sort_expensive_nodes();
701
702 // Compilation environment.
703 Arena* comp_arena() { return &_comp_arena; }
704 ciEnv* env() const { return _env; }
705 CompileLog* log() const { return _log; }
706 bool failing() const { return _env->failing() || _failure_reason != NULL; }
707 const char* failure_reason() { return _failure_reason; }
708 bool failure_reason_is(const char* r) { return (r==_failure_reason) || (r!=NULL && _failure_reason!=NULL && strcmp(r, _failure_reason)==0); }
709
710 void record_failure(const char* reason);
711 void record_method_not_compilable(const char* reason, bool all_tiers = false) {
712 // All bailouts cover "all_tiers" when TieredCompilation is off.
713 if (!TieredCompilation) all_tiers = true;
714 env()->record_method_not_compilable(reason, all_tiers);
715 // Record failure reason.
716 record_failure(reason);
717 }
718 void record_method_not_compilable_all_tiers(const char* reason) {
719 record_method_not_compilable(reason, true);
720 }
721 bool check_node_count(uint margin, const char* reason) {
722 if (live_nodes() + margin > (uint)MaxNodeLimit) {
723 record_method_not_compilable(reason);
724 return true;
725 } else {
726 return false;
727 }
728 }
729
730 // Node management
731 uint unique() const { return _unique; }
732 uint next_unique() { return _unique++; }
733 void set_unique(uint i) { _unique = i; }
734 static int debug_idx() { return debug_only(_debug_idx)+0; }
735 static void set_debug_idx(int i) { debug_only(_debug_idx = i); }
736 Arena* node_arena() { return &_node_arena; }
737 Arena* old_arena() { return &_old_arena; }
738 RootNode* root() const { return _root; }
739 void set_root(RootNode* r) { _root = r; }
740 StartNode* start() const; // (Derived from root.)
741 void init_start(StartNode* s);
742 Node* immutable_memory();
743
744 Node* recent_alloc_ctl() const { return _recent_alloc_ctl; }
745 Node* recent_alloc_obj() const { return _recent_alloc_obj; }
746 void set_recent_alloc(Node* ctl, Node* obj) {
747 _recent_alloc_ctl = ctl;
748 _recent_alloc_obj = obj;
749 }
750 void record_dead_node(uint idx) { if (_dead_node_list.test_set(idx)) return;
751 _dead_node_count++;
752 }
753 bool is_dead_node(uint idx) { return _dead_node_list.test(idx) != 0; }
754 uint dead_node_count() { return _dead_node_count; }
755 void reset_dead_node_list() { _dead_node_list.Reset();
756 _dead_node_count = 0;
757 }
758 uint live_nodes() const {
759 int val = _unique - _dead_node_count;
760 assert (val >= 0, err_msg_res("number of tracked dead nodes %d more than created nodes %d", _unique, _dead_node_count));
761 return (uint) val;
762 }
763 #ifdef ASSERT
764 uint count_live_nodes_by_graph_walk();
765 void print_missing_nodes();
766 #endif
767
768 // Constant table
769 ConstantTable& constant_table() { return _constant_table; }
770
771 MachConstantBaseNode* mach_constant_base_node();
772 bool has_mach_constant_base_node() const { return _mach_constant_base_node != NULL; }
773 // Generated by adlc, true if CallNode requires MachConstantBase.
774 bool needs_clone_jvms();
775
776 // Handy undefined Node
777 Node* top() const { return _top; }
778
779 // these are used by guys who need to know about creation and transformation of top:
780 Node* cached_top_node() { return _top; }
781 void set_cached_top_node(Node* tn);
782
783 GrowableArray<Node_Notes*>* node_note_array() const { return _node_note_array; }
784 void set_node_note_array(GrowableArray<Node_Notes*>* arr) { _node_note_array = arr; }
785 Node_Notes* default_node_notes() const { return _default_node_notes; }
786 void set_default_node_notes(Node_Notes* n) { _default_node_notes = n; }
787
788 Node_Notes* node_notes_at(int idx) {
789 return locate_node_notes(_node_note_array, idx, false);
790 }
791 inline bool set_node_notes_at(int idx, Node_Notes* value);
792
793 // Copy notes from source to dest, if they exist.
794 // Overwrite dest only if source provides something.
795 // Return true if information was moved.
796 bool copy_node_notes_to(Node* dest, Node* source);
797
798 // Workhorse function to sort out the blocked Node_Notes array:
799 inline Node_Notes* locate_node_notes(GrowableArray<Node_Notes*>* arr,
800 int idx, bool can_grow = false);
801
802 void grow_node_notes(GrowableArray<Node_Notes*>* arr, int grow_by);
803
804 // Type management
805 Arena* type_arena() { return _type_arena; }
806 Dict* type_dict() { return _type_dict; }
807 void* type_hwm() { return _type_hwm; }
808 size_t type_last_size() { return _type_last_size; }
809 int num_alias_types() { return _num_alias_types; }
810
811 void init_type_arena() { _type_arena = &_Compile_types; }
812 void set_type_arena(Arena* a) { _type_arena = a; }
813 void set_type_dict(Dict* d) { _type_dict = d; }
814 void set_type_hwm(void* p) { _type_hwm = p; }
815 void set_type_last_size(size_t sz) { _type_last_size = sz; }
816
817 const TypeFunc* last_tf(ciMethod* m) {
818 return (m == _last_tf_m) ? _last_tf : NULL;
819 }
820 void set_last_tf(ciMethod* m, const TypeFunc* tf) {
821 assert(m != NULL || tf == NULL, "");
822 _last_tf_m = m;
823 _last_tf = tf;
824 }
825
826 AliasType* alias_type(int idx) { assert(idx < num_alias_types(), "oob"); return _alias_types[idx]; }
827 AliasType* alias_type(const TypePtr* adr_type, ciField* field = NULL) { return find_alias_type(adr_type, false, field); }
828 bool have_alias_type(const TypePtr* adr_type);
829 AliasType* alias_type(ciField* field);
830
831 int get_alias_index(const TypePtr* at) { return alias_type(at)->index(); }
832 const TypePtr* get_adr_type(uint aidx) { return alias_type(aidx)->adr_type(); }
833 int get_general_index(uint aidx) { return alias_type(aidx)->general_index(); }
834
835 // Building nodes
836 void rethrow_exceptions(JVMState* jvms);
837 void return_values(JVMState* jvms);
838 JVMState* build_start_state(StartNode* start, const TypeFunc* tf);
839
840 // Decide how to build a call.
841 // The profile factor is a discount to apply to this site's interp. profile.
842 CallGenerator* call_generator(ciMethod* call_method, int vtable_index, bool call_does_dispatch,
843 JVMState* jvms, bool allow_inline, float profile_factor, ciKlass* speculative_receiver_type = NULL,
844 bool allow_intrinsics = true, bool delayed_forbidden = false);
845 bool should_delay_inlining(ciMethod* call_method, JVMState* jvms) {
846 return should_delay_string_inlining(call_method, jvms) ||
847 should_delay_boxing_inlining(call_method, jvms);
848 }
849 bool should_delay_string_inlining(ciMethod* call_method, JVMState* jvms);
850 bool should_delay_boxing_inlining(ciMethod* call_method, JVMState* jvms);
851
852 // Helper functions to identify inlining potential at call-site
853 ciMethod* optimize_virtual_call(ciMethod* caller, int bci, ciInstanceKlass* klass,
854 ciMethod* callee, const TypeOopPtr* receiver_type,
855 bool is_virtual,
856 bool &call_does_dispatch, int &vtable_index);
857 ciMethod* optimize_inlining(ciMethod* caller, int bci, ciInstanceKlass* klass,
858 ciMethod* callee, const TypeOopPtr* receiver_type);
859
860 // Report if there were too many traps at a current method and bci.
861 // Report if a trap was recorded, and/or PerMethodTrapLimit was exceeded.
862 // If there is no MDO at all, report no trap unless told to assume it.
863 bool too_many_traps(ciMethod* method, int bci, Deoptimization::DeoptReason reason);
864 // This version, unspecific to a particular bci, asks if
865 // PerMethodTrapLimit was exceeded for all inlined methods seen so far.
866 bool too_many_traps(Deoptimization::DeoptReason reason,
867 // Privately used parameter for logging:
868 ciMethodData* logmd = NULL);
869 // Report if there were too many recompiles at a method and bci.
870 bool too_many_recompiles(ciMethod* method, int bci, Deoptimization::DeoptReason reason);
871 // Return a bitset with the reasons where deoptimization is allowed,
872 // i.e., where there were not too many uncommon traps.
873 int _allowed_reasons;
874 int allowed_deopt_reasons() { return _allowed_reasons; }
875 void set_allowed_deopt_reasons();
876
877 // Parsing, optimization
878 PhaseGVN* initial_gvn() { return _initial_gvn; }
879 Unique_Node_List* for_igvn() { return _for_igvn; }
880 inline void record_for_igvn(Node* n); // Body is after class Unique_Node_List.
881 void set_initial_gvn(PhaseGVN *gvn) { _initial_gvn = gvn; }
882 void set_for_igvn(Unique_Node_List *for_igvn) { _for_igvn = for_igvn; }
883
884 // Replace n by nn using initial_gvn, calling hash_delete and
885 // record_for_igvn as needed.
886 void gvn_replace_by(Node* n, Node* nn);
887
888
889 void identify_useful_nodes(Unique_Node_List &useful);
890 void update_dead_node_list(Unique_Node_List &useful);
891 void remove_useless_nodes (Unique_Node_List &useful);
892
893 WarmCallInfo* warm_calls() const { return _warm_calls; }
894 void set_warm_calls(WarmCallInfo* l) { _warm_calls = l; }
895 WarmCallInfo* pop_warm_call();
896
897 // Record this CallGenerator for inlining at the end of parsing.
898 void add_late_inline(CallGenerator* cg) {
899 _late_inlines.insert_before(_late_inlines_pos, cg);
900 _late_inlines_pos++;
901 }
902
903 void prepend_late_inline(CallGenerator* cg) {
904 _late_inlines.insert_before(0, cg);
905 }
906
907 void add_string_late_inline(CallGenerator* cg) {
908 _string_late_inlines.push(cg);
909 }
910
911 void add_boxing_late_inline(CallGenerator* cg) {
912 _boxing_late_inlines.push(cg);
913 }
914
915 void remove_useless_late_inlines(GrowableArray<CallGenerator*>* inlines, Unique_Node_List &useful);
916
917 void dump_inlining();
918
919 bool over_inlining_cutoff() const {
920 if (!inlining_incrementally()) {
921 return unique() > (uint)NodeCountInliningCutoff;
922 } else {
923 return live_nodes() > (uint)LiveNodeCountInliningCutoff;
924 }
925 }
926
927 void inc_number_of_mh_late_inlines() { _number_of_mh_late_inlines++; }
928 void dec_number_of_mh_late_inlines() { assert(_number_of_mh_late_inlines > 0, "_number_of_mh_late_inlines < 0 !"); _number_of_mh_late_inlines--; }
929 bool has_mh_late_inlines() const { return _number_of_mh_late_inlines > 0; }
930
931 void inline_incrementally_one(PhaseIterGVN& igvn);
932 void inline_incrementally(PhaseIterGVN& igvn);
933 void inline_string_calls(bool parse_time);
934 void inline_boxing_calls(PhaseIterGVN& igvn);
935
936 // Matching, CFG layout, allocation, code generation
937 PhaseCFG* cfg() { return _cfg; }
938 bool select_24_bit_instr() const { return _select_24_bit_instr; }
939 bool in_24_bit_fp_mode() const { return _in_24_bit_fp_mode; }
940 bool has_java_calls() const { return _java_calls > 0; }
941 int java_calls() const { return _java_calls; }
942 int inner_loops() const { return _inner_loops; }
943 Matcher* matcher() { return _matcher; }
944 PhaseRegAlloc* regalloc() { return _regalloc; }
945 int frame_slots() const { return _frame_slots; }
946 int frame_size_in_words() const; // frame_slots in units of the polymorphic 'words'
947 int frame_size_in_bytes() const { return _frame_slots << LogBytesPerInt; }
948 RegMask& FIRST_STACK_mask() { return _FIRST_STACK_mask; }
949 Arena* indexSet_arena() { return _indexSet_arena; }
950 void* indexSet_free_block_list() { return _indexSet_free_block_list; }
951 uint node_bundling_limit() { return _node_bundling_limit; }
952 Bundle* node_bundling_base() { return _node_bundling_base; }
953 void set_node_bundling_limit(uint n) { _node_bundling_limit = n; }
954 void set_node_bundling_base(Bundle* b) { _node_bundling_base = b; }
955 bool starts_bundle(const Node *n) const;
956 bool need_stack_bang(int frame_size_in_bytes) const;
957 bool need_register_stack_bang() const;
958
959 void update_interpreter_frame_size(int size) {
960 if (_interpreter_frame_size < size) {
961 _interpreter_frame_size = size;
962 }
963 }
964 int bang_size_in_bytes() const;
965
966 void set_matcher(Matcher* m) { _matcher = m; }
967 //void set_regalloc(PhaseRegAlloc* ra) { _regalloc = ra; }
968 void set_indexSet_arena(Arena* a) { _indexSet_arena = a; }
969 void set_indexSet_free_block_list(void* p) { _indexSet_free_block_list = p; }
970
971 // Remember if this compilation changes hardware mode to 24-bit precision
972 void set_24_bit_selection_and_mode(bool selection, bool mode) {
973 _select_24_bit_instr = selection;
974 _in_24_bit_fp_mode = mode;
975 }
976
977 void set_java_calls(int z) { _java_calls = z; }
978 void set_inner_loops(int z) { _inner_loops = z; }
979
980 // Instruction bits passed off to the VM
981 int code_size() { return _method_size; }
982 CodeBuffer* code_buffer() { return &_code_buffer; }
983 int first_block_size() { return _first_block_size; }
984 void set_frame_complete(int off) { _code_offsets.set_value(CodeOffsets::Frame_Complete, off); }
985 ExceptionHandlerTable* handler_table() { return &_handler_table; }
986 ImplicitExceptionTable* inc_table() { return &_inc_table; }
987 OopMapSet* oop_map_set() { return _oop_map_set; }
988 DebugInformationRecorder* debug_info() { return env()->debug_info(); }
989 Dependencies* dependencies() { return env()->dependencies(); }
990 static int CompiledZap_count() { return _CompiledZap_count; }
991 BufferBlob* scratch_buffer_blob() { return _scratch_buffer_blob; }
992 void init_scratch_buffer_blob(int const_size);
993 void clear_scratch_buffer_blob();
994 void set_scratch_buffer_blob(BufferBlob* b) { _scratch_buffer_blob = b; }
995 relocInfo* scratch_locs_memory() { return _scratch_locs_memory; }
996 void set_scratch_locs_memory(relocInfo* b) { _scratch_locs_memory = b; }
997
998 // emit to scratch blob, report resulting size
999 uint scratch_emit_size(const Node* n);
1000 void set_in_scratch_emit_size(bool x) { _in_scratch_emit_size = x; }
1001 bool in_scratch_emit_size() const { return _in_scratch_emit_size; }
1002
1003 enum ScratchBufferBlob {
1004 MAX_inst_size = 1024,
1005 MAX_locs_size = 128, // number of relocInfo elements
1006 MAX_const_size = 128,
1007 MAX_stubs_size = 128
1008 };
1009
1010 // Major entry point. Given a Scope, compile the associated method.
1011 // For normal compilations, entry_bci is InvocationEntryBci. For on stack
1012 // replacement, entry_bci indicates the bytecode for which to compile a
1013 // continuation.
1014 Compile(ciEnv* ci_env, C2Compiler* compiler, ciMethod* target,
1015 int entry_bci, bool subsume_loads, bool do_escape_analysis,
1016 bool eliminate_boxing);
1017
1018 // Second major entry point. From the TypeFunc signature, generate code
1019 // to pass arguments from the Java calling convention to the C calling
1020 // convention.
1021 Compile(ciEnv* ci_env, const TypeFunc *(*gen)(),
1022 address stub_function, const char *stub_name,
1023 int is_fancy_jump, bool pass_tls,
1024 bool save_arg_registers, bool return_pc);
1025
1026 // From the TypeFunc signature, generate code to pass arguments
1027 // from Compiled calling convention to Interpreter's calling convention
1028 void Generate_Compiled_To_Interpreter_Graph(const TypeFunc *tf, address interpreter_entry);
1029
1030 // From the TypeFunc signature, generate code to pass arguments
1031 // from Interpreter's calling convention to Compiler's calling convention
1032 void Generate_Interpreter_To_Compiled_Graph(const TypeFunc *tf);
1033
1034 // Are we compiling a method?
1035 bool has_method() { return method() != NULL; }
1036
1037 // Maybe print some information about this compile.
1038 void print_compile_messages();
1039
1040 // Final graph reshaping, a post-pass after the regular optimizer is done.
1041 bool final_graph_reshaping();
1042
1043 // returns true if adr is completely contained in the given alias category
1044 bool must_alias(const TypePtr* adr, int alias_idx);
1045
1046 // returns true if adr overlaps with the given alias category
1047 bool can_alias(const TypePtr* adr, int alias_idx);
1048
1049 // Driver for converting compiler's IR into machine code bits
1050 void Output();
1051
1052 // Accessors for node bundling info.
1053 Bundle* node_bundling(const Node *n);
1054 bool valid_bundle_info(const Node *n);
1055
1056 // Schedule and Bundle the instructions
1057 void ScheduleAndBundle();
1058
1059 // Build OopMaps for each GC point
1060 void BuildOopMaps();
1061
1062 // Append debug info for the node "local" at safepoint node "sfpt" to the
1063 // "array", May also consult and add to "objs", which describes the
1064 // scalar-replaced objects.
1065 void FillLocArray( int idx, MachSafePointNode* sfpt,
1066 Node *local, GrowableArray<ScopeValue*> *array,
1067 GrowableArray<ScopeValue*> *objs );
1068
1069 // If "objs" contains an ObjectValue whose id is "id", returns it, else NULL.
1070 static ObjectValue* sv_for_node_id(GrowableArray<ScopeValue*> *objs, int id);
1071 // Requres that "objs" does not contains an ObjectValue whose id matches
1072 // that of "sv. Appends "sv".
1073 static void set_sv_for_object_node(GrowableArray<ScopeValue*> *objs,
1074 ObjectValue* sv );
1075
1076 // Process an OopMap Element while emitting nodes
1077 void Process_OopMap_Node(MachNode *mach, int code_offset);
1078
1079 // Initialize code buffer
1080 CodeBuffer* init_buffer(uint* blk_starts);
1081
1082 // Write out basic block data to code buffer
1083 void fill_buffer(CodeBuffer* cb, uint* blk_starts);
1084
1085 // Determine which variable sized branches can be shortened
1086 void shorten_branches(uint* blk_starts, int& code_size, int& reloc_size, int& stub_size);
1087
1088 // Compute the size of first NumberOfLoopInstrToAlign instructions
1089 // at the head of a loop.
1090 void compute_loop_first_inst_sizes();
1091
1092 // Compute the information for the exception tables
1093 void FillExceptionTables(uint cnt, uint *call_returns, uint *inct_starts, Label *blk_labels);
1094
1095 // Stack slots that may be unused by the calling convention but must
1096 // otherwise be preserved. On Intel this includes the return address.
1097 // On PowerPC it includes the 4 words holding the old TOC & LR glue.
1098 uint in_preserve_stack_slots();
1099
1100 // "Top of Stack" slots that may be unused by the calling convention but must
1101 // otherwise be preserved.
1102 // On Intel these are not necessary and the value can be zero.
1103 // On Sparc this describes the words reserved for storing a register window
1104 // when an interrupt occurs.
1105 static uint out_preserve_stack_slots();
1106
1107 // Number of outgoing stack slots killed above the out_preserve_stack_slots
1108 // for calls to C. Supports the var-args backing area for register parms.
1109 uint varargs_C_out_slots_killed() const;
1110
1111 // Number of Stack Slots consumed by a synchronization entry
1112 int sync_stack_slots() const;
1113
1114 // Compute the name of old_SP. See <arch>.ad for frame layout.
1115 OptoReg::Name compute_old_SP();
1116
1117 #ifdef ENABLE_ZAP_DEAD_LOCALS
1118 static bool is_node_getting_a_safepoint(Node*);
1119 void Insert_zap_nodes();
1120 Node* call_zap_node(MachSafePointNode* n, int block_no);
1121 #endif
1122
1123 private:
1124 // Phase control:
1125 void Init(int aliaslevel); // Prepare for a single compilation
1126 int Inline_Warm(); // Find more inlining work.
1127 void Finish_Warm(); // Give up on further inlines.
1128 void Optimize(); // Given a graph, optimize it
1129 void Code_Gen(); // Generate code from a graph
1130
1131 // Management of the AliasType table.
1132 void grow_alias_types();
1133 AliasCacheEntry* probe_alias_cache(const TypePtr* adr_type);
1134 const TypePtr *flatten_alias_type(const TypePtr* adr_type) const;
1135 AliasType* find_alias_type(const TypePtr* adr_type, bool no_create, ciField* field);
1136
1137 void verify_top(Node*) const PRODUCT_RETURN;
1138
1139 // Intrinsic setup.
1140 void register_library_intrinsics(); // initializer
1141 CallGenerator* make_vm_intrinsic(ciMethod* m, bool is_virtual); // constructor
1142 int intrinsic_insertion_index(ciMethod* m, bool is_virtual); // helper
1143 CallGenerator* find_intrinsic(ciMethod* m, bool is_virtual); // query fn
1144 void register_intrinsic(CallGenerator* cg); // update fn
1145
1146 #ifndef PRODUCT
1147 static juint _intrinsic_hist_count[vmIntrinsics::ID_LIMIT];
1148 static jubyte _intrinsic_hist_flags[vmIntrinsics::ID_LIMIT];
1149 #endif
1150 // Function calls made by the public function final_graph_reshaping.
1151 // No need to be made public as they are not called elsewhere.
1152 void final_graph_reshaping_impl( Node *n, Final_Reshape_Counts &frc);
1153 void final_graph_reshaping_walk( Node_Stack &nstack, Node *root, Final_Reshape_Counts &frc );
1154 void eliminate_redundant_card_marks(Node* n);
1155
1156 public:
1157
1158 // Note: Histogram array size is about 1 Kb.
1159 enum { // flag bits:
1160 _intrinsic_worked = 1, // succeeded at least once
1161 _intrinsic_failed = 2, // tried it but it failed
1162 _intrinsic_disabled = 4, // was requested but disabled (e.g., -XX:-InlineUnsafeOps)
1163 _intrinsic_virtual = 8, // was seen in the virtual form (rare)
1164 _intrinsic_both = 16 // was seen in the non-virtual form (usual)
1165 };
1166 // Update histogram. Return boolean if this is a first-time occurrence.
1167 static bool gather_intrinsic_statistics(vmIntrinsics::ID id,
1168 bool is_virtual, int flags) PRODUCT_RETURN0;
1169 static void print_intrinsic_statistics() PRODUCT_RETURN;
1170
1171 // Graph verification code
1172 // Walk the node list, verifying that there is a one-to-one
1173 // correspondence between Use-Def edges and Def-Use edges
1174 // The option no_dead_code enables stronger checks that the
1175 // graph is strongly connected from root in both directions.
1176 void verify_graph_edges(bool no_dead_code = false) PRODUCT_RETURN;
1177
1178 // Verify GC barrier patterns
1179 void verify_barriers() PRODUCT_RETURN;
1180
1181 // End-of-run dumps.
1182 static void print_statistics() PRODUCT_RETURN;
1183
1184 // Dump formatted assembly
1185 void dump_asm(int *pcs = NULL, uint pc_limit = 0) PRODUCT_RETURN;
1186 void dump_pc(int *pcs, int pc_limit, Node *n);
1187
1188 // Verify ADLC assumptions during startup
1189 static void adlc_verification() PRODUCT_RETURN;
1190
1191 // Definitions of pd methods
1192 static void pd_compiler2_init();
1193
1194 // Auxiliary method for randomized fuzzing/stressing
1195 static bool randomized_select(int count);
1196 };
1197
1198 #endif // SHARE_VM_OPTO_COMPILE_HPP