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

src/share/vm/opto/compile.hpp@72c5366e5d86 (annotated)

src/share/vm/opto/compile.hpp

Thu, 06 Nov 2008 14:59:10 -0800

author

rasbold

date

Thu, 06 Nov 2008 14:59:10 -0800

changeset 853

72c5366e5d86

parent 802

194b8e3a2fc4

child 1294

ea3f9723b5cf

permissions

-rw-r--r--

6743900: frequency based block layout
Summary: post-register allocation pass that drives block layout by edge frequencies
Reviewed-by: never, kvn

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