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