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

src/share/vm/c1/c1_IR.hpp@f02a8bbe6ed4 (annotated)

src/share/vm/c1/c1_IR.hpp

Tue, 29 Dec 2009 19:08:54 +0100

author

roland

date

Tue, 29 Dec 2009 19:08:54 +0100

changeset 2174

f02a8bbe6ed4

parent 1939

b812ff5abc73

child 2314

f95d63e2154a

permissions

-rw-r--r--

6986046: C1 valuestack cleanup
Summary: fixes an historical oddity in C1 with inlining where all of the expression stacks are kept in the topmost ValueStack instead of being in their respective ValueStacks.
Reviewed-by: never
Contributed-by: Christian Wimmer <cwimmer@uci.edu>

duke@435	1	/*
trims@1907	2	* Copyright (c) 1999, 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
duke@435	25	// An XHandler is a C1 internal description for an exception handler
duke@435	26
duke@435	27	class XHandler: public CompilationResourceObj {
duke@435	28	private:
duke@435	29	ciExceptionHandler* _desc;
duke@435	30
duke@435	31	BlockBegin* _entry_block; // Entry block of xhandler
duke@435	32	LIR_List* _entry_code; // LIR-operations that must be executed before jumping to entry_block
duke@435	33	int _entry_pco; // pco where entry_code (or entry_block if no entry_code) starts
duke@435	34	int _phi_operand; // For resolving of phi functions at begin of entry_block
duke@435	35	int _scope_count; // for filling ExceptionRangeEntry::scope_count
duke@435	36
duke@435	37	#ifdef ASSERT
duke@435	38	int _lir_op_id; // op_id of the LIR-operation throwing to this handler
duke@435	39	#endif
duke@435	40
duke@435	41	public:
duke@435	42	// creation
duke@435	43	XHandler(ciExceptionHandler* desc)
duke@435	44	: _desc(desc)
duke@435	45	, _entry_block(NULL)
duke@435	46	, _entry_code(NULL)
duke@435	47	, _entry_pco(-1)
duke@435	48	, _phi_operand(-1)
duke@435	49	, _scope_count(-1)
duke@435	50	#ifdef ASSERT
duke@435	51	, _lir_op_id(-1)
duke@435	52	#endif
duke@435	53	{ }
duke@435	54
duke@435	55	XHandler(XHandler* other)
duke@435	56	: _desc(other->_desc)
duke@435	57	, _entry_block(other->_entry_block)
duke@435	58	, _entry_code(other->_entry_code)
duke@435	59	, _entry_pco(other->_entry_pco)
duke@435	60	, _phi_operand(other->_phi_operand)
duke@435	61	, _scope_count(other->_scope_count)
duke@435	62	#ifdef ASSERT
duke@435	63	, _lir_op_id(other->_lir_op_id)
duke@435	64	#endif
duke@435	65	{ }
duke@435	66
duke@435	67	// accessors for data of ciExceptionHandler
duke@435	68	int beg_bci() const { return _desc->start(); }
duke@435	69	int end_bci() const { return _desc->limit(); }
duke@435	70	int handler_bci() const { return _desc->handler_bci(); }
duke@435	71	bool is_catch_all() const { return _desc->is_catch_all(); }
duke@435	72	int catch_type() const { return _desc->catch_klass_index(); }
duke@435	73	ciInstanceKlass* catch_klass() const { return _desc->catch_klass(); }
duke@435	74	bool covers(int bci) const { return beg_bci() <= bci && bci < end_bci(); }
duke@435	75
duke@435	76	// accessors for additional fields
duke@435	77	BlockBegin* entry_block() const { return _entry_block; }
duke@435	78	LIR_List* entry_code() const { return _entry_code; }
duke@435	79	int entry_pco() const { return _entry_pco; }
duke@435	80	int phi_operand() const { assert(_phi_operand != -1, "not set"); return _phi_operand; }
duke@435	81	int scope_count() const { assert(_scope_count != -1, "not set"); return _scope_count; }
duke@435	82	DEBUG_ONLY(int lir_op_id() const { return _lir_op_id; });
duke@435	83
duke@435	84	void set_entry_block(BlockBegin* entry_block) {
duke@435	85	assert(entry_block->is_set(BlockBegin::exception_entry_flag), "must be an exception handler entry");
duke@435	86	assert(entry_block->bci() == handler_bci(), "bci's must correspond");
duke@435	87	_entry_block = entry_block;
duke@435	88	}
duke@435	89	void set_entry_code(LIR_List* entry_code) { _entry_code = entry_code; }
duke@435	90	void set_entry_pco(int entry_pco) { _entry_pco = entry_pco; }
duke@435	91	void set_phi_operand(int phi_operand) { _phi_operand = phi_operand; }
duke@435	92	void set_scope_count(int scope_count) { _scope_count = scope_count; }
duke@435	93	DEBUG_ONLY(void set_lir_op_id(int lir_op_id) { _lir_op_id = lir_op_id; });
duke@435	94
duke@435	95	bool equals(XHandler* other) const;
duke@435	96	};
duke@435	97
duke@435	98	define_array(_XHandlerArray, XHandler*)
duke@435	99	define_stack(_XHandlerList, _XHandlerArray)
duke@435	100
duke@435	101
duke@435	102	// XHandlers is the C1 internal list of exception handlers for a method
duke@435	103	class XHandlers: public CompilationResourceObj {
duke@435	104	private:
duke@435	105	_XHandlerList _list;
duke@435	106
duke@435	107	public:
duke@435	108	// creation
duke@435	109	XHandlers() : _list() { }
duke@435	110	XHandlers(ciMethod* method);
duke@435	111	XHandlers(XHandlers* other);
duke@435	112
duke@435	113	// accessors
duke@435	114	int length() const { return _list.length(); }
duke@435	115	XHandler* handler_at(int i) const { return _list.at(i); }
duke@435	116	bool has_handlers() const { return _list.length() > 0; }
duke@435	117	void append(XHandler* h) { _list.append(h); }
duke@435	118	XHandler* remove_last() { return _list.pop(); }
duke@435	119
duke@435	120	bool could_catch(ciInstanceKlass* klass, bool type_is_exact) const;
duke@435	121	bool equals(XHandlers* others) const;
duke@435	122	};
duke@435	123
duke@435	124
duke@435	125	class IRScope;
duke@435	126	define_array(IRScopeArray, IRScope*)
duke@435	127	define_stack(IRScopeList, IRScopeArray)
duke@435	128
duke@435	129	class Compilation;
duke@435	130	class IRScope: public CompilationResourceObj {
duke@435	131	private:
duke@435	132	// hierarchy
duke@435	133	Compilation* _compilation; // the current compilation
duke@435	134	IRScope* _caller; // the caller scope, or NULL
duke@435	135	int _level; // the inlining level
duke@435	136	ciMethod* _method; // the corresponding method
duke@435	137	IRScopeList _callees; // the inlined method scopes
duke@435	138
duke@435	139	// graph
duke@435	140	XHandlers* _xhandlers; // the exception handlers
duke@435	141	int _number_of_locks; // the number of monitor lock slots needed
duke@435	142	bool _monitor_pairing_ok; // the monitor pairing info
duke@435	143	BlockBegin* _start; // the start block, successsors are method entries
duke@435	144
duke@435	145	BitMap _requires_phi_function; // bit is set if phi functions at loop headers are necessary for a local variable
duke@435	146
duke@435	147	// helper functions
duke@435	148	BlockBegin* build_graph(Compilation* compilation, int osr_bci);
duke@435	149
duke@435	150	public:
duke@435	151	// creation
duke@435	152	IRScope(Compilation* compilation, IRScope* caller, int caller_bci, ciMethod* method, int osr_bci, bool create_graph = false);
duke@435	153
duke@435	154	// accessors
duke@435	155	Compilation* compilation() const { return _compilation; }
duke@435	156	IRScope* caller() const { return _caller; }
duke@435	157	int level() const { return _level; }
duke@435	158	ciMethod* method() const { return _method; }
duke@435	159	int max_stack() const; // NOTE: expensive
duke@435	160	BitMap& requires_phi_function() { return _requires_phi_function; }
duke@435	161
duke@435	162	// hierarchy
duke@435	163	bool is_top_scope() const { return _caller == NULL; }
duke@435	164	void add_callee(IRScope* callee) { _callees.append(callee); }
duke@435	165	int number_of_callees() const { return _callees.length(); }
duke@435	166	IRScope* callee_no(int i) const { return _callees.at(i); }
duke@435	167
duke@435	168	// accessors, graph
duke@435	169	bool is_valid() const { return start() != NULL; }
duke@435	170	XHandlers* xhandlers() const { return _xhandlers; }
duke@435	171	int number_of_locks() const { return _number_of_locks; }
duke@435	172	void set_min_number_of_locks(int n) { if (n > _number_of_locks) _number_of_locks = n; }
duke@435	173	bool monitor_pairing_ok() const { return _monitor_pairing_ok; }
duke@435	174	BlockBegin* start() const { return _start; }
duke@435	175	};
duke@435	176
duke@435	177
duke@435	178	//
duke@435	179	// IRScopeDebugInfo records the debug information for a particular IRScope
duke@435	180	// in a particular CodeEmitInfo. This allows the information to be computed
duke@435	181	// once early enough for the OopMap to be available to the LIR and also to be
duke@435	182	// reemited for different pcs using the same CodeEmitInfo without recomputing
duke@435	183	// everything.
duke@435	184	//
duke@435	185
duke@435	186	class IRScopeDebugInfo: public CompilationResourceObj {
duke@435	187	private:
duke@435	188	IRScope* _scope;
duke@435	189	int _bci;
duke@435	190	GrowableArray<ScopeValue*>* _locals;
duke@435	191	GrowableArray<ScopeValue*>* _expressions;
duke@435	192	GrowableArray<MonitorValue*>* _monitors;
duke@435	193	IRScopeDebugInfo* _caller;
duke@435	194
duke@435	195	public:
duke@435	196	IRScopeDebugInfo(IRScope* scope,
duke@435	197	int bci,
duke@435	198	GrowableArray<ScopeValue*>* locals,
duke@435	199	GrowableArray<ScopeValue*>* expressions,
duke@435	200	GrowableArray<MonitorValue*>* monitors,
duke@435	201	IRScopeDebugInfo* caller):
duke@435	202	_scope(scope)
duke@435	203	, _locals(locals)
duke@435	204	, _bci(bci)
duke@435	205	, _expressions(expressions)
duke@435	206	, _monitors(monitors)
duke@435	207	, _caller(caller) {}
duke@435	208
duke@435	209
duke@435	210	IRScope* scope() { return _scope; }
duke@435	211	int bci() { return _bci; }
duke@435	212	GrowableArray<ScopeValue*>* locals() { return _locals; }
duke@435	213	GrowableArray<ScopeValue*>* expressions() { return _expressions; }
duke@435	214	GrowableArray<MonitorValue*>* monitors() { return _monitors; }
duke@435	215	IRScopeDebugInfo* caller() { return _caller; }
duke@435	216
cfang@1335	217	//Whether we should reexecute this bytecode for deopt
cfang@1335	218	bool should_reexecute();
cfang@1335	219
twisti@1730	220	void record_debug_info(DebugInformationRecorder* recorder, int pc_offset, bool topmost, bool is_method_handle_invoke = false) {
duke@435	221	if (caller() != NULL) {
duke@435	222	// Order is significant: Must record caller first.
cfang@1335	223	caller()->record_debug_info(recorder, pc_offset, false/*topmost*/);
duke@435	224	}
duke@435	225	DebugToken* locvals = recorder->create_scope_values(locals());
duke@435	226	DebugToken* expvals = recorder->create_scope_values(expressions());
duke@435	227	DebugToken* monvals = recorder->create_monitor_values(monitors());
cfang@1335	228	// reexecute allowed only for the topmost frame
twisti@1570	229	bool reexecute = topmost ? should_reexecute() : false;
kvn@1688	230	bool return_oop = false; // This flag will be ignored since it used only for C2 with escape analysis.
kvn@1688	231	recorder->describe_scope(pc_offset, scope()->method(), bci(), reexecute, is_method_handle_invoke, return_oop, locvals, expvals, monvals);
duke@435	232	}
duke@435	233	};
duke@435	234
duke@435	235
duke@435	236	class CodeEmitInfo: public CompilationResourceObj {
duke@435	237	friend class LinearScan;
duke@435	238	private:
duke@435	239	IRScopeDebugInfo* _scope_debug_info;
duke@435	240	IRScope* _scope;
duke@435	241	XHandlers* _exception_handlers;
duke@435	242	OopMap* _oop_map;
duke@435	243	ValueStack* _stack; // used by deoptimization (contains also monitors
twisti@1919	244	bool _is_method_handle_invoke; // true if the associated call site is a MethodHandle call site.
duke@435	245
duke@435	246	FrameMap* frame_map() const { return scope()->compilation()->frame_map(); }
duke@435	247	Compilation* compilation() const { return scope()->compilation(); }
duke@435	248
duke@435	249	public:
duke@435	250
duke@435	251	// use scope from ValueStack
roland@2174	252	CodeEmitInfo(ValueStack* stack, XHandlers* exception_handlers);
duke@435	253
duke@435	254	// make a copy
roland@2174	255	CodeEmitInfo(CodeEmitInfo* info, ValueStack* stack = NULL);
duke@435	256
duke@435	257	// accessors
duke@435	258	OopMap* oop_map() { return _oop_map; }
duke@435	259	ciMethod* method() const { return _scope->method(); }
duke@435	260	IRScope* scope() const { return _scope; }
duke@435	261	XHandlers* exception_handlers() const { return _exception_handlers; }
duke@435	262	ValueStack* stack() const { return _stack; }
duke@435	263
duke@435	264	void add_register_oop(LIR_Opr opr);
twisti@1919	265	void record_debug_info(DebugInformationRecorder* recorder, int pc_offset);
duke@435	266
twisti@1919	267	bool is_method_handle_invoke() const { return _is_method_handle_invoke; }
twisti@1919	268	void set_is_method_handle_invoke(bool x) { _is_method_handle_invoke = x; }
duke@435	269	};
duke@435	270
duke@435	271
duke@435	272	class IR: public CompilationResourceObj {
duke@435	273	private:
duke@435	274	Compilation* _compilation; // the current compilation
duke@435	275	IRScope* _top_scope; // the root of the scope hierarchy
duke@435	276	WordSize _locals_size; // the space required for all locals
duke@435	277	int _num_loops; // Total number of loops
duke@435	278	BlockList* _code; // the blocks in code generation order w/ use counts
duke@435	279
duke@435	280	public:
duke@435	281	// creation
duke@435	282	IR(Compilation* compilation, ciMethod* method, int osr_bci);
duke@435	283
duke@435	284	// accessors
duke@435	285	bool is_valid() const { return top_scope()->is_valid(); }
duke@435	286	Compilation* compilation() const { return _compilation; }
duke@435	287	IRScope* top_scope() const { return _top_scope; }
duke@435	288	int number_of_locks() const { return top_scope()->number_of_locks(); }
duke@435	289	ciMethod* method() const { return top_scope()->method(); }
duke@435	290	BlockBegin* start() const { return top_scope()->start(); }
duke@435	291	BlockBegin* std_entry() const { return start()->end()->as_Base()->std_entry(); }
duke@435	292	BlockBegin* osr_entry() const { return start()->end()->as_Base()->osr_entry(); }
duke@435	293	WordSize locals_size() const { return _locals_size; }
duke@435	294	int locals_size_in_words() const { return in_words(_locals_size); }
duke@435	295	BlockList* code() const { return _code; }
duke@435	296	int num_loops() const { return _num_loops; }
duke@435	297	int max_stack() const { return top_scope()->max_stack(); } // expensive
duke@435	298
duke@435	299	// ir manipulation
duke@435	300	void optimize();
duke@435	301	void compute_predecessors();
duke@435	302	void split_critical_edges();
duke@435	303	void compute_code();
duke@435	304	void compute_use_counts();
duke@435	305
duke@435	306	// The linear-scan order and the code emission order are equal, but
duke@435	307	// this may change in future
duke@435	308	BlockList* linear_scan_order() { assert(_code != NULL, "not computed"); return _code; }
duke@435	309
duke@435	310	// iteration
duke@435	311	void iterate_preorder (BlockClosure* closure);
duke@435	312	void iterate_postorder (BlockClosure* closure);
duke@435	313	void iterate_linear_scan_order(BlockClosure* closure);
duke@435	314
duke@435	315	// debugging
duke@435	316	static void print(BlockBegin* start, bool cfg_only, bool live_only = false) PRODUCT_RETURN;
duke@435	317	void print(bool cfg_only, bool live_only = false) PRODUCT_RETURN;
duke@435	318	void verify() PRODUCT_RETURN;
duke@435	319	};
duke@435	320
duke@435	321
duke@435	322	// Globally do instruction substitution and remove substituted
duke@435	323	// instructions from the instruction list.
duke@435	324	//
duke@435	325
iveresov@1939	326	class SubstitutionResolver: public BlockClosure, ValueVisitor {
iveresov@1939	327	virtual void visit(Value* v);
duke@435	328
duke@435	329	public:
duke@435	330	SubstitutionResolver(IR* hir) {
duke@435	331	hir->iterate_preorder(this);
duke@435	332	}
duke@435	333
duke@435	334	SubstitutionResolver(BlockBegin* block) {
duke@435	335	block->iterate_preorder(this);
duke@435	336	}
duke@435	337
duke@435	338	virtual void block_do(BlockBegin* block);
duke@435	339	};