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