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