• file
• revisions
• annotate
• diff
• comparison
• raw

src/share/vm/opto/compile.hpp@2f644f85485d (annotated)

src/share/vm/opto/compile.hpp

Fri, 03 Dec 2010 01:34:31 -0800

author

twisti

date

Fri, 03 Dec 2010 01:34:31 -0800

changeset 2350

2f644f85485d

parent 2314

f95d63e2154a

child 2658

c7f3d0b4570f

permissions

-rw-r--r--

6961690: load oops from constant table on SPARC
Summary: oops should be loaded from the constant table of an nmethod instead of materializing them with a long code sequence.
Reviewed-by: never, kvn

duke@435	1	/*
trims@1907	2	* Copyright (c) 1997, 2010, Oracle and/or its affiliates. All rights reserved.
duke@435	3	* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
duke@435	4	*
duke@435	5	* This code is free software; you can redistribute it and/or modify it
duke@435	6	* under the terms of the GNU General Public License version 2 only, as
duke@435	7	* published by the Free Software Foundation.
duke@435	8	*
duke@435	9	* This code is distributed in the hope that it will be useful, but WITHOUT
duke@435	10	* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
duke@435	11	* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
duke@435	12	* version 2 for more details (a copy is included in the LICENSE file that
duke@435	13	* accompanied this code).
duke@435	14	*
duke@435	15	* You should have received a copy of the GNU General Public License version
duke@435	16	* 2 along with this work; if not, write to the Free Software Foundation,
duke@435	17	* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
duke@435	18	*
trims@1907	19	* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
trims@1907	20	* or visit www.oracle.com if you need additional information or have any
trims@1907	21	* questions.
duke@435	22	*
duke@435	23	*/
duke@435	24
stefank@2314	25	#ifndef SHARE_VM_OPTO_COMPILE_HPP
stefank@2314	26	#define SHARE_VM_OPTO_COMPILE_HPP
stefank@2314	27
stefank@2314	28	#include "asm/codeBuffer.hpp"
stefank@2314	29	#include "ci/compilerInterface.hpp"
stefank@2314	30	#include "code/debugInfoRec.hpp"
stefank@2314	31	#include "code/exceptionHandlerTable.hpp"
stefank@2314	32	#include "compiler/compilerOracle.hpp"
stefank@2314	33	#include "libadt/dict.hpp"
stefank@2314	34	#include "libadt/port.hpp"
stefank@2314	35	#include "libadt/vectset.hpp"
stefank@2314	36	#include "memory/resourceArea.hpp"
stefank@2314	37	#include "opto/idealGraphPrinter.hpp"
stefank@2314	38	#include "opto/phase.hpp"
stefank@2314	39	#include "opto/regmask.hpp"
stefank@2314	40	#include "runtime/deoptimization.hpp"
stefank@2314	41	#include "runtime/vmThread.hpp"
stefank@2314	42
duke@435	43	class Block;
duke@435	44	class Bundle;
duke@435	45	class C2Compiler;
duke@435	46	class CallGenerator;
duke@435	47	class ConnectionGraph;
duke@435	48	class InlineTree;
duke@435	49	class Int_Array;
duke@435	50	class Matcher;
twisti@2350	51	class MachConstantNode;
twisti@2350	52	class MachConstantBaseNode;
duke@435	53	class MachNode;
twisti@2350	54	class MachOper;
kvn@473	55	class MachSafePointNode;
duke@435	56	class Node;
duke@435	57	class Node_Array;
duke@435	58	class Node_Notes;
duke@435	59	class OptoReg;
duke@435	60	class PhaseCFG;
duke@435	61	class PhaseGVN;
cfang@1607	62	class PhaseIterGVN;
duke@435	63	class PhaseRegAlloc;
duke@435	64	class PhaseCCP;
duke@435	65	class PhaseCCP_DCE;
duke@435	66	class RootNode;
duke@435	67	class relocInfo;
duke@435	68	class Scope;
duke@435	69	class StartNode;
duke@435	70	class SafePointNode;
duke@435	71	class JVMState;
duke@435	72	class TypeData;
duke@435	73	class TypePtr;
duke@435	74	class TypeFunc;
duke@435	75	class Unique_Node_List;
duke@435	76	class nmethod;
duke@435	77	class WarmCallInfo;
duke@435	78
duke@435	79	//------------------------------Compile----------------------------------------
duke@435	80	// This class defines a top-level Compiler invocation.
duke@435	81
duke@435	82	class Compile : public Phase {
duke@435	83	public:
duke@435	84	// Fixed alias indexes. (See also MergeMemNode.)
duke@435	85	enum {
duke@435	86	AliasIdxTop = 1, // pseudo-index, aliases to nothing (used as sentinel value)
duke@435	87	AliasIdxBot = 2, // pseudo-index, aliases to everything
duke@435	88	AliasIdxRaw = 3 // hard-wired index for TypeRawPtr::BOTTOM
duke@435	89	};
duke@435	90
duke@435	91	// Variant of TraceTime(NULL, &_t_accumulator, TimeCompiler);
duke@435	92	// Integrated with logging. If logging is turned on, and dolog is true,
duke@435	93	// then brackets are put into the log, with time stamps and node counts.
duke@435	94	// (The time collection itself is always conditionalized on TimeCompiler.)
duke@435	95	class TracePhase : public TraceTime {
duke@435	96	private:
duke@435	97	Compile* C;
duke@435	98	CompileLog* _log;
duke@435	99	public:
duke@435	100	TracePhase(const char* name, elapsedTimer* accumulator, bool dolog);
duke@435	101	~TracePhase();
duke@435	102	};
duke@435	103
duke@435	104	// Information per category of alias (memory slice)
duke@435	105	class AliasType {
duke@435	106	private:
duke@435	107	friend class Compile;
duke@435	108
duke@435	109	int _index; // unique index, used with MergeMemNode
duke@435	110	const TypePtr* _adr_type; // normalized address type
duke@435	111	ciField* _field; // relevant instance field, or null if none
duke@435	112	bool _is_rewritable; // false if the memory is write-once only
duke@435	113	int _general_index; // if this is type is an instance, the general
duke@435	114	// type that this is an instance of
duke@435	115
duke@435	116	void Init(int i, const TypePtr* at);
duke@435	117
duke@435	118	public:
duke@435	119	int index() const { return _index; }
duke@435	120	const TypePtr* adr_type() const { return _adr_type; }
duke@435	121	ciField* field() const { return _field; }
duke@435	122	bool is_rewritable() const { return _is_rewritable; }
duke@435	123	bool is_volatile() const { return (_field ? _field->is_volatile() : false); }
duke@435	124	int general_index() const { return (_general_index != 0) ? _general_index : _index; }
duke@435	125
duke@435	126	void set_rewritable(bool z) { _is_rewritable = z; }
duke@435	127	void set_field(ciField* f) {
duke@435	128	assert(!_field,"");
duke@435	129	_field = f;
duke@435	130	if (f->is_final()) _is_rewritable = false;
duke@435	131	}
duke@435	132
duke@435	133	void print_on(outputStream* st) PRODUCT_RETURN;
duke@435	134	};
duke@435	135
duke@435	136	enum {
duke@435	137	logAliasCacheSize = 6,
duke@435	138	AliasCacheSize = (1<<logAliasCacheSize)
duke@435	139	};
duke@435	140	struct AliasCacheEntry { const TypePtr* _adr_type; int _index; }; // simple duple type
duke@435	141	enum {
duke@435	142	trapHistLength = methodDataOopDesc::_trap_hist_limit
duke@435	143	};
duke@435	144
twisti@2350	145	// Constant entry of the constant table.
twisti@2350	146	class Constant {
twisti@2350	147	private:
twisti@2350	148	BasicType _type;
twisti@2350	149	jvalue _value;
twisti@2350	150	int _offset; // offset of this constant (in bytes) relative to the constant table base.
twisti@2350	151	bool _can_be_reused; // true (default) if the value can be shared with other users.
twisti@2350	152
twisti@2350	153	public:
twisti@2350	154	Constant() : _type(T_ILLEGAL), _offset(-1), _can_be_reused(true) { _value.l = 0; }
twisti@2350	155	Constant(BasicType type, jvalue value, bool can_be_reused = true) :
twisti@2350	156	_type(type),
twisti@2350	157	_value(value),
twisti@2350	158	_offset(-1),
twisti@2350	159	_can_be_reused(can_be_reused)
twisti@2350	160	{}
twisti@2350	161
twisti@2350	162	bool operator==(const Constant& other);
twisti@2350	163
twisti@2350	164	BasicType type() const { return _type; }
twisti@2350	165
twisti@2350	166	jlong get_jlong() const { return _value.j; }
twisti@2350	167	jfloat get_jfloat() const { return _value.f; }
twisti@2350	168	jdouble get_jdouble() const { return _value.d; }
twisti@2350	169	jobject get_jobject() const { return _value.l; }
twisti@2350	170
twisti@2350	171	int offset() const { return _offset; }
twisti@2350	172	void set_offset(int offset) { _offset = offset; }
twisti@2350	173
twisti@2350	174	bool can_be_reused() const { return _can_be_reused; }
twisti@2350	175	};
twisti@2350	176
twisti@2350	177	// Constant table.
twisti@2350	178	class ConstantTable {
twisti@2350	179	private:
twisti@2350	180	GrowableArray<Constant> _constants; // Constants of this table.
twisti@2350	181	int _size; // Size in bytes the emitted constant table takes (including padding).
twisti@2350	182	int _table_base_offset; // Offset of the table base that gets added to the constant offsets.
twisti@2350	183
twisti@2350	184	public:
twisti@2350	185	ConstantTable() :
twisti@2350	186	_size(-1),
twisti@2350	187	_table_base_offset(-1) // We can use -1 here since the constant table is always bigger than 2 bytes (-(size / 2), see MachConstantBaseNode::emit).
twisti@2350	188	{}
twisti@2350	189
twisti@2350	190	int size() const { assert(_size != -1, "size not yet calculated"); return _size; }
twisti@2350	191
twisti@2350	192	void set_table_base_offset(int x) { assert(_table_base_offset == -1, "set only once"); _table_base_offset = x; }
twisti@2350	193	int table_base_offset() const { assert(_table_base_offset != -1, "table base offset not yet set"); return _table_base_offset; }
twisti@2350	194
twisti@2350	195	void emit(CodeBuffer& cb);
twisti@2350	196
twisti@2350	197	// Returns the offset of the last entry (the top) of the constant table.
twisti@2350	198	int top_offset() const { assert(_constants.top().offset() != -1, "constant not yet bound"); return _constants.top().offset(); }
twisti@2350	199
twisti@2350	200	void calculate_offsets_and_size();
twisti@2350	201	int find_offset(Constant& con) const;
twisti@2350	202
twisti@2350	203	void add(Constant& con);
twisti@2350	204	Constant add(BasicType type, jvalue value);
twisti@2350	205	Constant add(MachOper* oper);
twisti@2350	206	Constant add(jfloat f) {
twisti@2350	207	jvalue value; value.f = f;
twisti@2350	208	return add(T_FLOAT, value);
twisti@2350	209	}
twisti@2350	210	Constant add(jdouble d) {
twisti@2350	211	jvalue value; value.d = d;
twisti@2350	212	return add(T_DOUBLE, value);
twisti@2350	213	}
twisti@2350	214
twisti@2350	215	// Jump table
twisti@2350	216	Constant allocate_jump_table(MachConstantNode* n);
twisti@2350	217	void fill_jump_table(CodeBuffer& cb, MachConstantNode* n, GrowableArray<Label*> labels) const;
twisti@2350	218	};
twisti@2350	219
duke@435	220	private:
duke@435	221	// Fixed parameters to this compilation.
duke@435	222	const int _compile_id;
duke@435	223	const bool _save_argument_registers; // save/restore arg regs for trampolines
duke@435	224	const bool _subsume_loads; // Load can be matched as part of a larger op.
kvn@473	225	const bool _do_escape_analysis; // Do escape analysis.
duke@435	226	ciMethod* _method; // The method being compiled.
duke@435	227	int _entry_bci; // entry bci for osr methods.
duke@435	228	const TypeFunc* _tf; // My kind of signature
duke@435	229	InlineTree* _ilt; // Ditto (temporary).
duke@435	230	address _stub_function; // VM entry for stub being compiled, or NULL
duke@435	231	const char* _stub_name; // Name of stub or adapter being compiled, or NULL
duke@435	232	address _stub_entry_point; // Compile code entry for generated stub, or NULL
duke@435	233
duke@435	234	// Control of this compilation.
duke@435	235	int _num_loop_opts; // Number of iterations for doing loop optimiztions
duke@435	236	int _max_inline_size; // Max inline size for this compilation
duke@435	237	int _freq_inline_size; // Max hot method inline size for this compilation
duke@435	238	int _fixed_slots; // count of frame slots not allocated by the register
duke@435	239	// allocator i.e. locks, original deopt pc, etc.
duke@435	240	// For deopt
duke@435	241	int _orig_pc_slot;
duke@435	242	int _orig_pc_slot_offset_in_bytes;
duke@435	243
duke@435	244	int _major_progress; // Count of something big happening
duke@435	245	bool _has_loops; // True if the method _may_ have some loops
duke@435	246	bool _has_split_ifs; // True if the method _may_ have some split-if
duke@435	247	bool _has_unsafe_access; // True if the method _may_ produce faults in unsafe loads or stores.
never@1515	248	bool _has_stringbuilder; // True StringBuffers or StringBuilders are allocated
duke@435	249	uint _trap_hist[trapHistLength]; // Cumulative traps
duke@435	250	bool _trap_can_recompile; // Have we emitted a recompiling trap?
duke@435	251	uint _decompile_count; // Cumulative decompilation counts.
duke@435	252	bool _do_inlining; // True if we intend to do inlining
duke@435	253	bool _do_scheduling; // True if we intend to do scheduling
rasbold@853	254	bool _do_freq_based_layout; // True if we intend to do frequency based block layout
duke@435	255	bool _do_count_invocations; // True if we generate code to count invocations
duke@435	256	bool _do_method_data_update; // True if we generate code to update methodDataOops
duke@435	257	int _AliasLevel; // Locally-adjusted version of AliasLevel flag.
duke@435	258	bool _print_assembly; // True if we should dump assembly code for this compilation
duke@435	259	#ifndef PRODUCT
duke@435	260	bool _trace_opto_output;
never@802	261	bool _parsed_irreducible_loop; // True if ciTypeFlow detected irreducible loops during parsing
duke@435	262	#endif
duke@435	263
twisti@1700	264	// JSR 292
twisti@1700	265	bool _has_method_handle_invokes; // True if this method has MethodHandle invokes.
twisti@1700	266
duke@435	267	// Compilation environment.
duke@435	268	Arena _comp_arena; // Arena with lifetime equivalent to Compile
duke@435	269	ciEnv* _env; // CI interface
duke@435	270	CompileLog* _log; // from CompilerThread
duke@435	271	const char* _failure_reason; // for record_failure/failing pattern
duke@435	272	GrowableArray<CallGenerator*>* _intrinsics; // List of intrinsics.
duke@435	273	GrowableArray<Node*>* _macro_nodes; // List of nodes which need to be expanded before matching.
cfang@1607	274	GrowableArray<Node*>* _predicate_opaqs; // List of Opaque1 nodes for the loop predicates.
duke@435	275	ConnectionGraph* _congraph;
duke@435	276	#ifndef PRODUCT
duke@435	277	IdealGraphPrinter* _printer;
duke@435	278	#endif
duke@435	279
duke@435	280	// Node management
duke@435	281	uint _unique; // Counter for unique Node indices
duke@435	282	debug_only(static int _debug_idx;) // Monotonic counter (not reset), use -XX:BreakAtNode=<idx>
duke@435	283	Arena _node_arena; // Arena for new-space Nodes
duke@435	284	Arena _old_arena; // Arena for old-space Nodes, lifetime during xform
duke@435	285	RootNode* _root; // Unique root of compilation, or NULL after bail-out.
duke@435	286	Node* _top; // Unique top node. (Reset by various phases.)
duke@435	287
duke@435	288	Node* _immutable_memory; // Initial memory state
duke@435	289
duke@435	290	Node* _recent_alloc_obj;
duke@435	291	Node* _recent_alloc_ctl;
duke@435	292
twisti@2350	293	// Constant table
twisti@2350	294	ConstantTable _constant_table; // The constant table for this compile.
twisti@2350	295	MachConstantBaseNode* _mach_constant_base_node; // Constant table base node singleton.
twisti@2350	296
twisti@2350	297
duke@435	298	// Blocked array of debugging and profiling information,
duke@435	299	// tracked per node.
duke@435	300	enum { _log2_node_notes_block_size = 8,
duke@435	301	_node_notes_block_size = (1<<_log2_node_notes_block_size)
duke@435	302	};
duke@435	303	GrowableArray<Node_Notes*>* _node_note_array;
duke@435	304	Node_Notes* _default_node_notes; // default notes for new nodes
duke@435	305
duke@435	306	// After parsing and every bulk phase we hang onto the Root instruction.
duke@435	307	// The RootNode instruction is where the whole program begins. It produces
duke@435	308	// the initial Control and BOTTOM for everybody else.
duke@435	309
duke@435	310	// Type management
duke@435	311	Arena _Compile_types; // Arena for all types
duke@435	312	Arena* _type_arena; // Alias for _Compile_types except in Initialize_shared()
duke@435	313	Dict* _type_dict; // Intern table
duke@435	314	void* _type_hwm; // Last allocation (see Type::operator new/delete)
duke@435	315	size_t _type_last_size; // Last allocation size (see Type::operator new/delete)
duke@435	316	ciMethod* _last_tf_m; // Cache for
duke@435	317	const TypeFunc* _last_tf; // TypeFunc::make
duke@435	318	AliasType** _alias_types; // List of alias types seen so far.
duke@435	319	int _num_alias_types; // Logical length of _alias_types
duke@435	320	int _max_alias_types; // Physical length of _alias_types
duke@435	321	AliasCacheEntry _alias_cache[AliasCacheSize]; // Gets aliases w/o data structure walking
duke@435	322
duke@435	323	// Parsing, optimization
duke@435	324	PhaseGVN* _initial_gvn; // Results of parse-time PhaseGVN
duke@435	325	Unique_Node_List* _for_igvn; // Initial work-list for next round of Iterative GVN
duke@435	326	WarmCallInfo* _warm_calls; // Sorted work-list for heat-based inlining.
duke@435	327
never@1515	328	GrowableArray<CallGenerator*> _late_inlines; // List of CallGenerators to be revisited after
never@1515	329	// main parsing has finished.
never@1515	330
duke@435	331	// Matching, CFG layout, allocation, code generation
duke@435	332	PhaseCFG* _cfg; // Results of CFG finding
duke@435	333	bool _select_24_bit_instr; // We selected an instruction with a 24-bit result
duke@435	334	bool _in_24_bit_fp_mode; // We are emitting instructions with 24-bit results
kvn@1294	335	int _java_calls; // Number of java calls in the method
kvn@1294	336	int _inner_loops; // Number of inner loops in the method
duke@435	337	Matcher* _matcher; // Engine to map ideal to machine instructions
duke@435	338	PhaseRegAlloc* _regalloc; // Results of register allocation.
duke@435	339	int _frame_slots; // Size of total frame in stack slots
duke@435	340	CodeOffsets _code_offsets; // Offsets into the code for various interesting entries
duke@435	341	RegMask _FIRST_STACK_mask; // All stack slots usable for spills (depends on frame layout)
duke@435	342	Arena* _indexSet_arena; // control IndexSet allocation within PhaseChaitin
duke@435	343	void* _indexSet_free_block_list; // free list of IndexSet bit blocks
duke@435	344
duke@435	345	uint _node_bundling_limit;
duke@435	346	Bundle* _node_bundling_base; // Information for instruction bundling
duke@435	347
duke@435	348	// Instruction bits passed off to the VM
duke@435	349	int _method_size; // Size of nmethod code segment in bytes
duke@435	350	CodeBuffer _code_buffer; // Where the code is assembled
duke@435	351	int _first_block_size; // Size of unvalidated entry point code / OSR poison code
duke@435	352	ExceptionHandlerTable _handler_table; // Table of native-code exception handlers
duke@435	353	ImplicitExceptionTable _inc_table; // Table of implicit null checks in native code
duke@435	354	OopMapSet* _oop_map_set; // Table of oop maps (one for each safepoint location)
duke@435	355	static int _CompiledZap_count; // counter compared against CompileZap[First/Last]
duke@435	356	BufferBlob* _scratch_buffer_blob; // For temporary code buffers.
duke@435	357	relocInfo* _scratch_locs_memory; // For temporary code buffers.
twisti@2350	358	int _scratch_const_size; // For temporary code buffers.
twisti@2350	359	bool _in_scratch_emit_size; // true when in scratch_emit_size.
duke@435	360
duke@435	361	public:
duke@435	362	// Accessors
duke@435	363
duke@435	364	// The Compile instance currently active in this (compiler) thread.
duke@435	365	static Compile* current() {
duke@435	366	return (Compile*) ciEnv::current()->compiler_data();
duke@435	367	}
duke@435	368
duke@435	369	// ID for this compilation. Useful for setting breakpoints in the debugger.
duke@435	370	int compile_id() const { return _compile_id; }
duke@435	371
duke@435	372	// Does this compilation allow instructions to subsume loads? User
duke@435	373	// instructions that subsume a load may result in an unschedulable
duke@435	374	// instruction sequence.
duke@435	375	bool subsume_loads() const { return _subsume_loads; }
kvn@473	376	// Do escape analysis.
kvn@473	377	bool do_escape_analysis() const { return _do_escape_analysis; }
duke@435	378	bool save_argument_registers() const { return _save_argument_registers; }
duke@435	379
duke@435	380
duke@435	381	// Other fixed compilation parameters.
duke@435	382	ciMethod* method() const { return _method; }
duke@435	383	int entry_bci() const { return _entry_bci; }
duke@435	384	bool is_osr_compilation() const { return _entry_bci != InvocationEntryBci; }
duke@435	385	bool is_method_compilation() const { return (_method != NULL && !_method->flags().is_native()); }
duke@435	386	const TypeFunc* tf() const { assert(_tf!=NULL, ""); return _tf; }
duke@435	387	void init_tf(const TypeFunc* tf) { assert(_tf==NULL, ""); _tf = tf; }
duke@435	388	InlineTree* ilt() const { return _ilt; }
duke@435	389	address stub_function() const { return _stub_function; }
duke@435	390	const char* stub_name() const { return _stub_name; }
duke@435	391	address stub_entry_point() const { return _stub_entry_point; }
duke@435	392
duke@435	393	// Control of this compilation.
duke@435	394	int fixed_slots() const { assert(_fixed_slots >= 0, ""); return _fixed_slots; }
duke@435	395	void set_fixed_slots(int n) { _fixed_slots = n; }
duke@435	396	int major_progress() const { return _major_progress; }
duke@435	397	void set_major_progress() { _major_progress++; }
duke@435	398	void clear_major_progress() { _major_progress = 0; }
duke@435	399	int num_loop_opts() const { return _num_loop_opts; }
duke@435	400	void set_num_loop_opts(int n) { _num_loop_opts = n; }
duke@435	401	int max_inline_size() const { return _max_inline_size; }
duke@435	402	void set_freq_inline_size(int n) { _freq_inline_size = n; }
duke@435	403	int freq_inline_size() const { return _freq_inline_size; }
duke@435	404	void set_max_inline_size(int n) { _max_inline_size = n; }
duke@435	405	bool has_loops() const { return _has_loops; }
duke@435	406	void set_has_loops(bool z) { _has_loops = z; }
duke@435	407	bool has_split_ifs() const { return _has_split_ifs; }
duke@435	408	void set_has_split_ifs(bool z) { _has_split_ifs = z; }
duke@435	409	bool has_unsafe_access() const { return _has_unsafe_access; }
duke@435	410	void set_has_unsafe_access(bool z) { _has_unsafe_access = z; }
never@1515	411	bool has_stringbuilder() const { return _has_stringbuilder; }
never@1515	412	void set_has_stringbuilder(bool z) { _has_stringbuilder = z; }
duke@435	413	void set_trap_count(uint r, uint c) { assert(r < trapHistLength, "oob"); _trap_hist[r] = c; }
duke@435	414	uint trap_count(uint r) const { assert(r < trapHistLength, "oob"); return _trap_hist[r]; }
duke@435	415	bool trap_can_recompile() const { return _trap_can_recompile; }
duke@435	416	void set_trap_can_recompile(bool z) { _trap_can_recompile = z; }
duke@435	417	uint decompile_count() const { return _decompile_count; }
duke@435	418	void set_decompile_count(uint c) { _decompile_count = c; }
duke@435	419	bool allow_range_check_smearing() const;
duke@435	420	bool do_inlining() const { return _do_inlining; }
duke@435	421	void set_do_inlining(bool z) { _do_inlining = z; }
duke@435	422	bool do_scheduling() const { return _do_scheduling; }
duke@435	423	void set_do_scheduling(bool z) { _do_scheduling = z; }
rasbold@853	424	bool do_freq_based_layout() const{ return _do_freq_based_layout; }
rasbold@853	425	void set_do_freq_based_layout(bool z){ _do_freq_based_layout = z; }
duke@435	426	bool do_count_invocations() const{ return _do_count_invocations; }
duke@435	427	void set_do_count_invocations(bool z){ _do_count_invocations = z; }
duke@435	428	bool do_method_data_update() const { return _do_method_data_update; }
duke@435	429	void set_do_method_data_update(bool z) { _do_method_data_update = z; }
duke@435	430	int AliasLevel() const { return _AliasLevel; }
duke@435	431	bool print_assembly() const { return _print_assembly; }
duke@435	432	void set_print_assembly(bool z) { _print_assembly = z; }
duke@435	433	// check the CompilerOracle for special behaviours for this compile
duke@435	434	bool method_has_option(const char * option) {
duke@435	435	return method() != NULL && method()->has_option(option);
duke@435	436	}
duke@435	437	#ifndef PRODUCT
duke@435	438	bool trace_opto_output() const { return _trace_opto_output; }
never@802	439	bool parsed_irreducible_loop() const { return _parsed_irreducible_loop; }
never@802	440	void set_parsed_irreducible_loop(bool z) { _parsed_irreducible_loop = z; }
duke@435	441	#endif
duke@435	442
twisti@1700	443	// JSR 292
twisti@1700	444	bool has_method_handle_invokes() const { return _has_method_handle_invokes; }
twisti@1700	445	void set_has_method_handle_invokes(bool z) { _has_method_handle_invokes = z; }
twisti@1700	446
duke@435	447	void begin_method() {
duke@435	448	#ifndef PRODUCT
duke@435	449	if (_printer) _printer->begin_method(this);
duke@435	450	#endif
duke@435	451	}
duke@435	452	void print_method(const char * name, int level = 1) {
duke@435	453	#ifndef PRODUCT
duke@435	454	if (_printer) _printer->print_method(this, name, level);
duke@435	455	#endif
duke@435	456	}
duke@435	457	void end_method() {
duke@435	458	#ifndef PRODUCT
duke@435	459	if (_printer) _printer->end_method();
duke@435	460	#endif
duke@435	461	}
duke@435	462
duke@435	463	int macro_count() { return _macro_nodes->length(); }
cfang@1607	464	int predicate_count() { return _predicate_opaqs->length();}
duke@435	465	Node* macro_node(int idx) { return _macro_nodes->at(idx); }
cfang@1607	466	Node* predicate_opaque1_node(int idx) { return _predicate_opaqs->at(idx);}
duke@435	467	ConnectionGraph* congraph() { return _congraph;}
kvn@1989	468	void set_congraph(ConnectionGraph* congraph) { _congraph = congraph;}
duke@435	469	void add_macro_node(Node * n) {
duke@435	470	//assert(n->is_macro(), "must be a macro node");
duke@435	471	assert(!_macro_nodes->contains(n), " duplicate entry in expand list");
duke@435	472	_macro_nodes->append(n);
duke@435	473	}
duke@435	474	void remove_macro_node(Node * n) {
duke@435	475	// this function may be called twice for a node so check
duke@435	476	// that the node is in the array before attempting to remove it
duke@435	477	if (_macro_nodes->contains(n))
duke@435	478	_macro_nodes->remove(n);
cfang@1607	479	// remove from _predicate_opaqs list also if it is there
cfang@1607	480	if (predicate_count() > 0 && _predicate_opaqs->contains(n)){
cfang@1607	481	_predicate_opaqs->remove(n);
cfang@1607	482	}
duke@435	483	}
cfang@1607	484	void add_predicate_opaq(Node * n) {
cfang@1607	485	assert(!_predicate_opaqs->contains(n), " duplicate entry in predicate opaque1");
cfang@1607	486	assert(_macro_nodes->contains(n), "should have already been in macro list");
cfang@1607	487	_predicate_opaqs->append(n);
cfang@1607	488	}
cfang@1607	489	// remove the opaque nodes that protect the predicates so that the unused checks and
cfang@1607	490	// uncommon traps will be eliminated from the graph.
cfang@1607	491	void cleanup_loop_predicates(PhaseIterGVN &igvn);
duke@435	492
duke@435	493	// Compilation environment.
duke@435	494	Arena* comp_arena() { return &_comp_arena; }
duke@435	495	ciEnv* env() const { return _env; }
duke@435	496	CompileLog* log() const { return _log; }
duke@435	497	bool failing() const { return _env->failing() || _failure_reason != NULL; }
duke@435	498	const char* failure_reason() { return _failure_reason; }
duke@435	499	bool failure_reason_is(const char* r) { return (r==_failure_reason) || (r!=NULL && _failure_reason!=NULL && strcmp(r, _failure_reason)==0); }
duke@435	500
duke@435	501	void record_failure(const char* reason);
duke@435	502	void record_method_not_compilable(const char* reason, bool all_tiers = false) {
duke@435	503	// All bailouts cover "all_tiers" when TieredCompilation is off.
duke@435	504	if (!TieredCompilation) all_tiers = true;
duke@435	505	env()->record_method_not_compilable(reason, all_tiers);
duke@435	506	// Record failure reason.
duke@435	507	record_failure(reason);
duke@435	508	}
duke@435	509	void record_method_not_compilable_all_tiers(const char* reason) {
duke@435	510	record_method_not_compilable(reason, true);
duke@435	511	}
duke@435	512	bool check_node_count(uint margin, const char* reason) {
duke@435	513	if (unique() + margin > (uint)MaxNodeLimit) {
duke@435	514	record_method_not_compilable(reason);
duke@435	515	return true;
duke@435	516	} else {
duke@435	517	return false;
duke@435	518	}
duke@435	519	}
duke@435	520
duke@435	521	// Node management
duke@435	522	uint unique() const { return _unique; }
duke@435	523	uint next_unique() { return _unique++; }
duke@435	524	void set_unique(uint i) { _unique = i; }
duke@435	525	static int debug_idx() { return debug_only(_debug_idx)+0; }
duke@435	526	static void set_debug_idx(int i) { debug_only(_debug_idx = i); }
duke@435	527	Arena* node_arena() { return &_node_arena; }
duke@435	528	Arena* old_arena() { return &_old_arena; }
duke@435	529	RootNode* root() const { return _root; }
duke@435	530	void set_root(RootNode* r) { _root = r; }
duke@435	531	StartNode* start() const; // (Derived from root.)
duke@435	532	void init_start(StartNode* s);
duke@435	533	Node* immutable_memory();
duke@435	534
duke@435	535	Node* recent_alloc_ctl() const { return _recent_alloc_ctl; }
duke@435	536	Node* recent_alloc_obj() const { return _recent_alloc_obj; }
duke@435	537	void set_recent_alloc(Node* ctl, Node* obj) {
duke@435	538	_recent_alloc_ctl = ctl;
duke@435	539	_recent_alloc_obj = obj;
duke@435	540	}
duke@435	541
twisti@2350	542	// Constant table
twisti@2350	543	ConstantTable& constant_table() { return _constant_table; }
twisti@2350	544
twisti@2350	545	MachConstantBaseNode* mach_constant_base_node();
twisti@2350	546	bool has_mach_constant_base_node() const { return _mach_constant_base_node != NULL; }
twisti@2350	547
duke@435	548	// Handy undefined Node
duke@435	549	Node* top() const { return _top; }
duke@435	550
duke@435	551	// these are used by guys who need to know about creation and transformation of top:
duke@435	552	Node* cached_top_node() { return _top; }
duke@435	553	void set_cached_top_node(Node* tn);
duke@435	554
duke@435	555	GrowableArray<Node_Notes*>* node_note_array() const { return _node_note_array; }
duke@435	556	void set_node_note_array(GrowableArray<Node_Notes*>* arr) { _node_note_array = arr; }
duke@435	557	Node_Notes* default_node_notes() const { return _default_node_notes; }
duke@435	558	void set_default_node_notes(Node_Notes* n) { _default_node_notes = n; }
duke@435	559
duke@435	560	Node_Notes* node_notes_at(int idx) {
duke@435	561	return locate_node_notes(_node_note_array, idx, false);
duke@435	562	}
duke@435	563	inline bool set_node_notes_at(int idx, Node_Notes* value);
duke@435	564
duke@435	565	// Copy notes from source to dest, if they exist.
duke@435	566	// Overwrite dest only if source provides something.
duke@435	567	// Return true if information was moved.
duke@435	568	bool copy_node_notes_to(Node* dest, Node* source);
duke@435	569
duke@435	570	// Workhorse function to sort out the blocked Node_Notes array:
duke@435	571	inline Node_Notes* locate_node_notes(GrowableArray<Node_Notes*>* arr,
duke@435	572	int idx, bool can_grow = false);
duke@435	573
duke@435	574	void grow_node_notes(GrowableArray<Node_Notes*>* arr, int grow_by);
duke@435	575
duke@435	576	// Type management
duke@435	577	Arena* type_arena() { return _type_arena; }
duke@435	578	Dict* type_dict() { return _type_dict; }
duke@435	579	void* type_hwm() { return _type_hwm; }
duke@435	580	size_t type_last_size() { return _type_last_size; }
duke@435	581	int num_alias_types() { return _num_alias_types; }
duke@435	582
duke@435	583	void init_type_arena() { _type_arena = &_Compile_types; }
duke@435	584	void set_type_arena(Arena* a) { _type_arena = a; }
duke@435	585	void set_type_dict(Dict* d) { _type_dict = d; }
duke@435	586	void set_type_hwm(void* p) { _type_hwm = p; }
duke@435	587	void set_type_last_size(size_t sz) { _type_last_size = sz; }
duke@435	588
duke@435	589	const TypeFunc* last_tf(ciMethod* m) {
duke@435	590	return (m == _last_tf_m) ? _last_tf : NULL;
duke@435	591	}
duke@435	592	void set_last_tf(ciMethod* m, const TypeFunc* tf) {
duke@435	593	assert(m != NULL || tf == NULL, "");
duke@435	594	_last_tf_m = m;
duke@435	595	_last_tf = tf;
duke@435	596	}
duke@435	597
duke@435	598	AliasType* alias_type(int idx) { assert(idx < num_alias_types(), "oob"); return _alias_types[idx]; }
duke@435	599	AliasType* alias_type(const TypePtr* adr_type) { return find_alias_type(adr_type, false); }
duke@435	600	bool have_alias_type(const TypePtr* adr_type);
duke@435	601	AliasType* alias_type(ciField* field);
duke@435	602
duke@435	603	int get_alias_index(const TypePtr* at) { return alias_type(at)->index(); }
duke@435	604	const TypePtr* get_adr_type(uint aidx) { return alias_type(aidx)->adr_type(); }
duke@435	605	int get_general_index(uint aidx) { return alias_type(aidx)->general_index(); }
duke@435	606
duke@435	607	// Building nodes
duke@435	608	void rethrow_exceptions(JVMState* jvms);
duke@435	609	void return_values(JVMState* jvms);
duke@435	610	JVMState* build_start_state(StartNode* start, const TypeFunc* tf);
duke@435	611
duke@435	612	// Decide how to build a call.
duke@435	613	// The profile factor is a discount to apply to this site's interp. profile.
duke@435	614	CallGenerator* call_generator(ciMethod* call_method, int vtable_index, bool call_is_virtual, JVMState* jvms, bool allow_inline, float profile_factor);
never@1515	615	bool should_delay_inlining(ciMethod* call_method, JVMState* jvms);
duke@435	616
duke@435	617	// Report if there were too many traps at a current method and bci.
duke@435	618	// Report if a trap was recorded, and/or PerMethodTrapLimit was exceeded.
duke@435	619	// If there is no MDO at all, report no trap unless told to assume it.
duke@435	620	bool too_many_traps(ciMethod* method, int bci, Deoptimization::DeoptReason reason);
duke@435	621	// This version, unspecific to a particular bci, asks if
duke@435	622	// PerMethodTrapLimit was exceeded for all inlined methods seen so far.
duke@435	623	bool too_many_traps(Deoptimization::DeoptReason reason,
duke@435	624	// Privately used parameter for logging:
duke@435	625	ciMethodData* logmd = NULL);
duke@435	626	// Report if there were too many recompiles at a method and bci.
duke@435	627	bool too_many_recompiles(ciMethod* method, int bci, Deoptimization::DeoptReason reason);
duke@435	628
duke@435	629	// Parsing, optimization
duke@435	630	PhaseGVN* initial_gvn() { return _initial_gvn; }
duke@435	631	Unique_Node_List* for_igvn() { return _for_igvn; }
duke@435	632	inline void record_for_igvn(Node* n); // Body is after class Unique_Node_List.
duke@435	633	void set_initial_gvn(PhaseGVN *gvn) { _initial_gvn = gvn; }
duke@435	634	void set_for_igvn(Unique_Node_List *for_igvn) { _for_igvn = for_igvn; }
duke@435	635
never@1515	636	// Replace n by nn using initial_gvn, calling hash_delete and
never@1515	637	// record_for_igvn as needed.
never@1515	638	void gvn_replace_by(Node* n, Node* nn);
never@1515	639
never@1515	640
duke@435	641	void identify_useful_nodes(Unique_Node_List &useful);
duke@435	642	void remove_useless_nodes (Unique_Node_List &useful);
duke@435	643
duke@435	644	WarmCallInfo* warm_calls() const { return _warm_calls; }
duke@435	645	void set_warm_calls(WarmCallInfo* l) { _warm_calls = l; }
duke@435	646	WarmCallInfo* pop_warm_call();
duke@435	647
never@1515	648	// Record this CallGenerator for inlining at the end of parsing.
never@1515	649	void add_late_inline(CallGenerator* cg) { _late_inlines.push(cg); }
never@1515	650
duke@435	651	// Matching, CFG layout, allocation, code generation
duke@435	652	PhaseCFG* cfg() { return _cfg; }
duke@435	653	bool select_24_bit_instr() const { return _select_24_bit_instr; }
duke@435	654	bool in_24_bit_fp_mode() const { return _in_24_bit_fp_mode; }
kvn@1294	655	bool has_java_calls() const { return _java_calls > 0; }
kvn@1294	656	int java_calls() const { return _java_calls; }
kvn@1294	657	int inner_loops() const { return _inner_loops; }
duke@435	658	Matcher* matcher() { return _matcher; }
duke@435	659	PhaseRegAlloc* regalloc() { return _regalloc; }
duke@435	660	int frame_slots() const { return _frame_slots; }
duke@435	661	int frame_size_in_words() const; // frame_slots in units of the polymorphic 'words'
duke@435	662	RegMask& FIRST_STACK_mask() { return _FIRST_STACK_mask; }
duke@435	663	Arena* indexSet_arena() { return _indexSet_arena; }
duke@435	664	void* indexSet_free_block_list() { return _indexSet_free_block_list; }
duke@435	665	uint node_bundling_limit() { return _node_bundling_limit; }
duke@435	666	Bundle* node_bundling_base() { return _node_bundling_base; }
duke@435	667	void set_node_bundling_limit(uint n) { _node_bundling_limit = n; }
duke@435	668	void set_node_bundling_base(Bundle* b) { _node_bundling_base = b; }
duke@435	669	bool starts_bundle(const Node *n) const;
duke@435	670	bool need_stack_bang(int frame_size_in_bytes) const;
duke@435	671	bool need_register_stack_bang() const;
duke@435	672
duke@435	673	void set_matcher(Matcher* m) { _matcher = m; }
duke@435	674	//void set_regalloc(PhaseRegAlloc* ra) { _regalloc = ra; }
duke@435	675	void set_indexSet_arena(Arena* a) { _indexSet_arena = a; }
duke@435	676	void set_indexSet_free_block_list(void* p) { _indexSet_free_block_list = p; }
duke@435	677
duke@435	678	// Remember if this compilation changes hardware mode to 24-bit precision
duke@435	679	void set_24_bit_selection_and_mode(bool selection, bool mode) {
duke@435	680	_select_24_bit_instr = selection;
duke@435	681	_in_24_bit_fp_mode = mode;
duke@435	682	}
duke@435	683
kvn@1294	684	void set_java_calls(int z) { _java_calls = z; }
kvn@1294	685	void set_inner_loops(int z) { _inner_loops = z; }
duke@435	686
duke@435	687	// Instruction bits passed off to the VM
duke@435	688	int code_size() { return _method_size; }
duke@435	689	CodeBuffer* code_buffer() { return &_code_buffer; }
duke@435	690	int first_block_size() { return _first_block_size; }
duke@435	691	void set_frame_complete(int off) { _code_offsets.set_value(CodeOffsets::Frame_Complete, off); }
duke@435	692	ExceptionHandlerTable* handler_table() { return &_handler_table; }
duke@435	693	ImplicitExceptionTable* inc_table() { return &_inc_table; }
duke@435	694	OopMapSet* oop_map_set() { return _oop_map_set; }
duke@435	695	DebugInformationRecorder* debug_info() { return env()->debug_info(); }
duke@435	696	Dependencies* dependencies() { return env()->dependencies(); }
duke@435	697	static int CompiledZap_count() { return _CompiledZap_count; }
duke@435	698	BufferBlob* scratch_buffer_blob() { return _scratch_buffer_blob; }
twisti@2350	699	void init_scratch_buffer_blob(int const_size);
twisti@2350	700	void clear_scratch_buffer_blob();
duke@435	701	void set_scratch_buffer_blob(BufferBlob* b) { _scratch_buffer_blob = b; }
duke@435	702	relocInfo* scratch_locs_memory() { return _scratch_locs_memory; }
duke@435	703	void set_scratch_locs_memory(relocInfo* b) { _scratch_locs_memory = b; }
duke@435	704
duke@435	705	// emit to scratch blob, report resulting size
duke@435	706	uint scratch_emit_size(const Node* n);
twisti@2350	707	void set_in_scratch_emit_size(bool x) { _in_scratch_emit_size = x; }
twisti@2350	708	bool in_scratch_emit_size() const { return _in_scratch_emit_size; }
duke@435	709
duke@435	710	enum ScratchBufferBlob {
duke@435	711	MAX_inst_size = 1024,
duke@435	712	MAX_locs_size = 128, // number of relocInfo elements
duke@435	713	MAX_const_size = 128,
duke@435	714	MAX_stubs_size = 128
duke@435	715	};
duke@435	716
duke@435	717	// Major entry point. Given a Scope, compile the associated method.
duke@435	718	// For normal compilations, entry_bci is InvocationEntryBci. For on stack
duke@435	719	// replacement, entry_bci indicates the bytecode for which to compile a
duke@435	720	// continuation.
duke@435	721	Compile(ciEnv* ci_env, C2Compiler* compiler, ciMethod* target,
kvn@473	722	int entry_bci, bool subsume_loads, bool do_escape_analysis);
duke@435	723
duke@435	724	// Second major entry point. From the TypeFunc signature, generate code
duke@435	725	// to pass arguments from the Java calling convention to the C calling
duke@435	726	// convention.
duke@435	727	Compile(ciEnv* ci_env, const TypeFunc *(*gen)(),
duke@435	728	address stub_function, const char *stub_name,
duke@435	729	int is_fancy_jump, bool pass_tls,
duke@435	730	bool save_arg_registers, bool return_pc);
duke@435	731
duke@435	732	// From the TypeFunc signature, generate code to pass arguments
duke@435	733	// from Compiled calling convention to Interpreter's calling convention
duke@435	734	void Generate_Compiled_To_Interpreter_Graph(const TypeFunc *tf, address interpreter_entry);
duke@435	735
duke@435	736	// From the TypeFunc signature, generate code to pass arguments
duke@435	737	// from Interpreter's calling convention to Compiler's calling convention
duke@435	738	void Generate_Interpreter_To_Compiled_Graph(const TypeFunc *tf);
duke@435	739
duke@435	740	// Are we compiling a method?
duke@435	741	bool has_method() { return method() != NULL; }
duke@435	742
duke@435	743	// Maybe print some information about this compile.
duke@435	744	void print_compile_messages();
duke@435	745
duke@435	746	// Final graph reshaping, a post-pass after the regular optimizer is done.
duke@435	747	bool final_graph_reshaping();
duke@435	748
duke@435	749	// returns true if adr is completely contained in the given alias category
duke@435	750	bool must_alias(const TypePtr* adr, int alias_idx);
duke@435	751
duke@435	752	// returns true if adr overlaps with the given alias category
duke@435	753	bool can_alias(const TypePtr* adr, int alias_idx);
duke@435	754
duke@435	755	// Driver for converting compiler's IR into machine code bits
duke@435	756	void Output();
duke@435	757
duke@435	758	// Accessors for node bundling info.
duke@435	759	Bundle* node_bundling(const Node *n);
duke@435	760	bool valid_bundle_info(const Node *n);
duke@435	761
duke@435	762	// Schedule and Bundle the instructions
duke@435	763	void ScheduleAndBundle();
duke@435	764
duke@435	765	// Build OopMaps for each GC point
duke@435	766	void BuildOopMaps();
kvn@498	767
kvn@498	768	// Append debug info for the node "local" at safepoint node "sfpt" to the
kvn@498	769	// "array", May also consult and add to "objs", which describes the
kvn@498	770	// scalar-replaced objects.
kvn@498	771	void FillLocArray( int idx, MachSafePointNode* sfpt,
kvn@498	772	Node *local, GrowableArray<ScopeValue*> *array,
kvn@498	773	GrowableArray<ScopeValue*> *objs );
kvn@498	774
kvn@498	775	// If "objs" contains an ObjectValue whose id is "id", returns it, else NULL.
kvn@498	776	static ObjectValue* sv_for_node_id(GrowableArray<ScopeValue*> *objs, int id);
kvn@498	777	// Requres that "objs" does not contains an ObjectValue whose id matches
kvn@498	778	// that of "sv. Appends "sv".
kvn@498	779	static void set_sv_for_object_node(GrowableArray<ScopeValue*> *objs,
kvn@498	780	ObjectValue* sv );
duke@435	781
duke@435	782	// Process an OopMap Element while emitting nodes
duke@435	783	void Process_OopMap_Node(MachNode *mach, int code_offset);
duke@435	784
duke@435	785	// Write out basic block data to code buffer
duke@435	786	void Fill_buffer();
duke@435	787
duke@435	788	// Determine which variable sized branches can be shortened
twisti@2350	789	void Shorten_branches(Label *labels, int& code_size, int& reloc_size, int& stub_size);
duke@435	790
duke@435	791	// Compute the size of first NumberOfLoopInstrToAlign instructions
duke@435	792	// at the head of a loop.
duke@435	793	void compute_loop_first_inst_sizes();
duke@435	794
duke@435	795	// Compute the information for the exception tables
duke@435	796	void FillExceptionTables(uint cnt, uint *call_returns, uint *inct_starts, Label *blk_labels);
duke@435	797
duke@435	798	// Stack slots that may be unused by the calling convention but must
duke@435	799	// otherwise be preserved. On Intel this includes the return address.
duke@435	800	// On PowerPC it includes the 4 words holding the old TOC & LR glue.
duke@435	801	uint in_preserve_stack_slots();
duke@435	802
duke@435	803	// "Top of Stack" slots that may be unused by the calling convention but must
duke@435	804	// otherwise be preserved.
duke@435	805	// On Intel these are not necessary and the value can be zero.
duke@435	806	// On Sparc this describes the words reserved for storing a register window
duke@435	807	// when an interrupt occurs.
duke@435	808	static uint out_preserve_stack_slots();
duke@435	809
duke@435	810	// Number of outgoing stack slots killed above the out_preserve_stack_slots
duke@435	811	// for calls to C. Supports the var-args backing area for register parms.
duke@435	812	uint varargs_C_out_slots_killed() const;
duke@435	813
duke@435	814	// Number of Stack Slots consumed by a synchronization entry
duke@435	815	int sync_stack_slots() const;
duke@435	816
duke@435	817	// Compute the name of old_SP. See <arch>.ad for frame layout.
duke@435	818	OptoReg::Name compute_old_SP();
duke@435	819
duke@435	820	#ifdef ENABLE_ZAP_DEAD_LOCALS
duke@435	821	static bool is_node_getting_a_safepoint(Node*);
duke@435	822	void Insert_zap_nodes();
duke@435	823	Node* call_zap_node(MachSafePointNode* n, int block_no);
duke@435	824	#endif
duke@435	825
duke@435	826	private:
duke@435	827	// Phase control:
duke@435	828	void Init(int aliaslevel); // Prepare for a single compilation
duke@435	829	int Inline_Warm(); // Find more inlining work.
duke@435	830	void Finish_Warm(); // Give up on further inlines.
duke@435	831	void Optimize(); // Given a graph, optimize it
duke@435	832	void Code_Gen(); // Generate code from a graph
duke@435	833
duke@435	834	// Management of the AliasType table.
duke@435	835	void grow_alias_types();
duke@435	836	AliasCacheEntry* probe_alias_cache(const TypePtr* adr_type);
duke@435	837	const TypePtr *flatten_alias_type(const TypePtr* adr_type) const;
duke@435	838	AliasType* find_alias_type(const TypePtr* adr_type, bool no_create);
duke@435	839
duke@435	840	void verify_top(Node*) const PRODUCT_RETURN;
duke@435	841
duke@435	842	// Intrinsic setup.
duke@435	843	void register_library_intrinsics(); // initializer
duke@435	844	CallGenerator* make_vm_intrinsic(ciMethod* m, bool is_virtual); // constructor
duke@435	845	int intrinsic_insertion_index(ciMethod* m, bool is_virtual); // helper
duke@435	846	CallGenerator* find_intrinsic(ciMethod* m, bool is_virtual); // query fn
duke@435	847	void register_intrinsic(CallGenerator* cg); // update fn
duke@435	848
duke@435	849	#ifndef PRODUCT
duke@435	850	static juint _intrinsic_hist_count[vmIntrinsics::ID_LIMIT];
duke@435	851	static jubyte _intrinsic_hist_flags[vmIntrinsics::ID_LIMIT];
duke@435	852	#endif
duke@435	853
duke@435	854	public:
duke@435	855
duke@435	856	// Note: Histogram array size is about 1 Kb.
duke@435	857	enum { // flag bits:
duke@435	858	_intrinsic_worked = 1, // succeeded at least once
duke@435	859	_intrinsic_failed = 2, // tried it but it failed
duke@435	860	_intrinsic_disabled = 4, // was requested but disabled (e.g., -XX:-InlineUnsafeOps)
duke@435	861	_intrinsic_virtual = 8, // was seen in the virtual form (rare)
duke@435	862	_intrinsic_both = 16 // was seen in the non-virtual form (usual)
duke@435	863	};
duke@435	864	// Update histogram. Return boolean if this is a first-time occurrence.
duke@435	865	static bool gather_intrinsic_statistics(vmIntrinsics::ID id,
duke@435	866	bool is_virtual, int flags) PRODUCT_RETURN0;
duke@435	867	static void print_intrinsic_statistics() PRODUCT_RETURN;
duke@435	868
duke@435	869	// Graph verification code
duke@435	870	// Walk the node list, verifying that there is a one-to-one
duke@435	871	// correspondence between Use-Def edges and Def-Use edges
duke@435	872	// The option no_dead_code enables stronger checks that the
duke@435	873	// graph is strongly connected from root in both directions.
duke@435	874	void verify_graph_edges(bool no_dead_code = false) PRODUCT_RETURN;
duke@435	875
duke@435	876	// Print bytecodes, including the scope inlining tree
duke@435	877	void print_codes();
duke@435	878
duke@435	879	// End-of-run dumps.
duke@435	880	static void print_statistics() PRODUCT_RETURN;
duke@435	881
duke@435	882	// Dump formatted assembly
duke@435	883	void dump_asm(int *pcs = NULL, uint pc_limit = 0) PRODUCT_RETURN;
duke@435	884	void dump_pc(int *pcs, int pc_limit, Node *n);
duke@435	885
duke@435	886	// Verify ADLC assumptions during startup
duke@435	887	static void adlc_verification() PRODUCT_RETURN;
duke@435	888
duke@435	889	// Definitions of pd methods
duke@435	890	static void pd_compiler2_init();
duke@435	891	};
stefank@2314	892
stefank@2314	893	#endif // SHARE_VM_OPTO_COMPILE_HPP