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