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

src/share/vm/c1/c1_GraphBuilder.cpp@ab102d5d923e (annotated)

src/share/vm/c1/c1_GraphBuilder.cpp

Sun, 23 May 2010 01:38:26 -0700

author

jrose

date

Sun, 23 May 2010 01:38:26 -0700

changeset 1920

ab102d5d923e

parent 1895

99791ad65936

child 1934

e9ff18c4ace7

permissions

-rw-r--r--

6939207: refactor constant pool index processing
Summary: Factored cleanup of instruction decode which prepares for enhanced ldc semantics.
Reviewed-by: twisti

duke@435	1	/*
twisti@1730	2	* Copyright 1999-2010 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	#include "incls/_precompiled.incl"
duke@435	26	#include "incls/_c1_GraphBuilder.cpp.incl"
duke@435	27
duke@435	28	class BlockListBuilder VALUE_OBJ_CLASS_SPEC {
duke@435	29	private:
duke@435	30	Compilation* _compilation;
duke@435	31	IRScope* _scope;
duke@435	32
duke@435	33	BlockList _blocks; // internal list of all blocks
duke@435	34	BlockList* _bci2block; // mapping from bci to blocks for GraphBuilder
duke@435	35
duke@435	36	// fields used by mark_loops
duke@435	37	BitMap _active; // for iteration of control flow graph
duke@435	38	BitMap _visited; // for iteration of control flow graph
duke@435	39	intArray _loop_map; // caches the information if a block is contained in a loop
duke@435	40	int _next_loop_index; // next free loop number
duke@435	41	int _next_block_number; // for reverse postorder numbering of blocks
duke@435	42
duke@435	43	// accessors
duke@435	44	Compilation* compilation() const { return _compilation; }
duke@435	45	IRScope* scope() const { return _scope; }
duke@435	46	ciMethod* method() const { return scope()->method(); }
duke@435	47	XHandlers* xhandlers() const { return scope()->xhandlers(); }
duke@435	48
duke@435	49	// unified bailout support
duke@435	50	void bailout(const char* msg) const { compilation()->bailout(msg); }
duke@435	51	bool bailed_out() const { return compilation()->bailed_out(); }
duke@435	52
duke@435	53	// helper functions
duke@435	54	BlockBegin* make_block_at(int bci, BlockBegin* predecessor);
duke@435	55	void handle_exceptions(BlockBegin* current, int cur_bci);
duke@435	56	void handle_jsr(BlockBegin* current, int sr_bci, int next_bci);
duke@435	57	void store_one(BlockBegin* current, int local);
duke@435	58	void store_two(BlockBegin* current, int local);
duke@435	59	void set_entries(int osr_bci);
duke@435	60	void set_leaders();
duke@435	61
duke@435	62	void make_loop_header(BlockBegin* block);
duke@435	63	void mark_loops();
duke@435	64	int mark_loops(BlockBegin* b, bool in_subroutine);
duke@435	65
duke@435	66	// debugging
duke@435	67	#ifndef PRODUCT
duke@435	68	void print();
duke@435	69	#endif
duke@435	70
duke@435	71	public:
duke@435	72	// creation
duke@435	73	BlockListBuilder(Compilation* compilation, IRScope* scope, int osr_bci);
duke@435	74
duke@435	75	// accessors for GraphBuilder
duke@435	76	BlockList* bci2block() const { return _bci2block; }
duke@435	77	};
duke@435	78
duke@435	79
duke@435	80	// Implementation of BlockListBuilder
duke@435	81
duke@435	82	BlockListBuilder::BlockListBuilder(Compilation* compilation, IRScope* scope, int osr_bci)
duke@435	83	: _compilation(compilation)
duke@435	84	, _scope(scope)
duke@435	85	, _blocks(16)
duke@435	86	, _bci2block(new BlockList(scope->method()->code_size(), NULL))
duke@435	87	, _next_block_number(0)
duke@435	88	, _active() // size not known yet
duke@435	89	, _visited() // size not known yet
duke@435	90	, _next_loop_index(0)
duke@435	91	, _loop_map() // size not known yet
duke@435	92	{
duke@435	93	set_entries(osr_bci);
duke@435	94	set_leaders();
duke@435	95	CHECK_BAILOUT();
duke@435	96
duke@435	97	mark_loops();
duke@435	98	NOT_PRODUCT(if (PrintInitialBlockList) print());
duke@435	99
duke@435	100	#ifndef PRODUCT
duke@435	101	if (PrintCFGToFile) {
duke@435	102	stringStream title;
duke@435	103	title.print("BlockListBuilder ");
duke@435	104	scope->method()->print_name(&title);
duke@435	105	CFGPrinter::print_cfg(_bci2block, title.as_string(), false, false);
duke@435	106	}
duke@435	107	#endif
duke@435	108	}
duke@435	109
duke@435	110
duke@435	111	void BlockListBuilder::set_entries(int osr_bci) {
duke@435	112	// generate start blocks
duke@435	113	BlockBegin* std_entry = make_block_at(0, NULL);
duke@435	114	if (scope()->caller() == NULL) {
duke@435	115	std_entry->set(BlockBegin::std_entry_flag);
duke@435	116	}
duke@435	117	if (osr_bci != -1) {
duke@435	118	BlockBegin* osr_entry = make_block_at(osr_bci, NULL);
duke@435	119	osr_entry->set(BlockBegin::osr_entry_flag);
duke@435	120	}
duke@435	121
duke@435	122	// generate exception entry blocks
duke@435	123	XHandlers* list = xhandlers();
duke@435	124	const int n = list->length();
duke@435	125	for (int i = 0; i < n; i++) {
duke@435	126	XHandler* h = list->handler_at(i);
duke@435	127	BlockBegin* entry = make_block_at(h->handler_bci(), NULL);
duke@435	128	entry->set(BlockBegin::exception_entry_flag);
duke@435	129	h->set_entry_block(entry);
duke@435	130	}
duke@435	131	}
duke@435	132
duke@435	133
duke@435	134	BlockBegin* BlockListBuilder::make_block_at(int cur_bci, BlockBegin* predecessor) {
duke@435	135	assert(method()->bci_block_start().at(cur_bci), "wrong block starts of MethodLivenessAnalyzer");
duke@435	136
duke@435	137	BlockBegin* block = _bci2block->at(cur_bci);
duke@435	138	if (block == NULL) {
duke@435	139	block = new BlockBegin(cur_bci);
duke@435	140	block->init_stores_to_locals(method()->max_locals());
duke@435	141	_bci2block->at_put(cur_bci, block);
duke@435	142	_blocks.append(block);
duke@435	143
duke@435	144	assert(predecessor == NULL || predecessor->bci() < cur_bci, "targets for backward branches must already exist");
duke@435	145	}
duke@435	146
duke@435	147	if (predecessor != NULL) {
duke@435	148	if (block->is_set(BlockBegin::exception_entry_flag)) {
duke@435	149	BAILOUT_("Exception handler can be reached by both normal and exceptional control flow", block);
duke@435	150	}
duke@435	151
duke@435	152	predecessor->add_successor(block);
duke@435	153	block->increment_total_preds();
duke@435	154	}
duke@435	155
duke@435	156	return block;
duke@435	157	}
duke@435	158
duke@435	159
duke@435	160	inline void BlockListBuilder::store_one(BlockBegin* current, int local) {
duke@435	161	current->stores_to_locals().set_bit(local);
duke@435	162	}
duke@435	163	inline void BlockListBuilder::store_two(BlockBegin* current, int local) {
duke@435	164	store_one(current, local);
duke@435	165	store_one(current, local + 1);
duke@435	166	}
duke@435	167
duke@435	168
duke@435	169	void BlockListBuilder::handle_exceptions(BlockBegin* current, int cur_bci) {
duke@435	170	// Draws edges from a block to its exception handlers
duke@435	171	XHandlers* list = xhandlers();
duke@435	172	const int n = list->length();
duke@435	173
duke@435	174	for (int i = 0; i < n; i++) {
duke@435	175	XHandler* h = list->handler_at(i);
duke@435	176
duke@435	177	if (h->covers(cur_bci)) {
duke@435	178	BlockBegin* entry = h->entry_block();
duke@435	179	assert(entry != NULL && entry == _bci2block->at(h->handler_bci()), "entry must be set");
duke@435	180	assert(entry->is_set(BlockBegin::exception_entry_flag), "flag must be set");
duke@435	181
duke@435	182	// add each exception handler only once
duke@435	183	if (!current->is_successor(entry)) {
duke@435	184	current->add_successor(entry);
duke@435	185	entry->increment_total_preds();
duke@435	186	}
duke@435	187
duke@435	188	// stop when reaching catchall
duke@435	189	if (h->catch_type() == 0) break;
duke@435	190	}
duke@435	191	}
duke@435	192	}
duke@435	193
duke@435	194	void BlockListBuilder::handle_jsr(BlockBegin* current, int sr_bci, int next_bci) {
duke@435	195	// start a new block after jsr-bytecode and link this block into cfg
duke@435	196	make_block_at(next_bci, current);
duke@435	197
duke@435	198	// start a new block at the subroutine entry at mark it with special flag
duke@435	199	BlockBegin* sr_block = make_block_at(sr_bci, current);
duke@435	200	if (!sr_block->is_set(BlockBegin::subroutine_entry_flag)) {
duke@435	201	sr_block->set(BlockBegin::subroutine_entry_flag);
duke@435	202	}
duke@435	203	}
duke@435	204
duke@435	205
duke@435	206	void BlockListBuilder::set_leaders() {
duke@435	207	bool has_xhandlers = xhandlers()->has_handlers();
duke@435	208	BlockBegin* current = NULL;
duke@435	209
duke@435	210	// The information which bci starts a new block simplifies the analysis
duke@435	211	// Without it, backward branches could jump to a bci where no block was created
duke@435	212	// during bytecode iteration. This would require the creation of a new block at the
duke@435	213	// branch target and a modification of the successor lists.
duke@435	214	BitMap bci_block_start = method()->bci_block_start();
duke@435	215
duke@435	216	ciBytecodeStream s(method());
duke@435	217	while (s.next() != ciBytecodeStream::EOBC()) {
duke@435	218	int cur_bci = s.cur_bci();
duke@435	219
duke@435	220	if (bci_block_start.at(cur_bci)) {
duke@435	221	current = make_block_at(cur_bci, current);
duke@435	222	}
duke@435	223	assert(current != NULL, "must have current block");
duke@435	224
duke@435	225	if (has_xhandlers && GraphBuilder::can_trap(method(), s.cur_bc())) {
duke@435	226	handle_exceptions(current, cur_bci);
duke@435	227	}
duke@435	228
duke@435	229	switch (s.cur_bc()) {
duke@435	230	// track stores to local variables for selective creation of phi functions
duke@435	231	case Bytecodes::_iinc: store_one(current, s.get_index()); break;
duke@435	232	case Bytecodes::_istore: store_one(current, s.get_index()); break;
duke@435	233	case Bytecodes::_lstore: store_two(current, s.get_index()); break;
duke@435	234	case Bytecodes::_fstore: store_one(current, s.get_index()); break;
duke@435	235	case Bytecodes::_dstore: store_two(current, s.get_index()); break;
duke@435	236	case Bytecodes::_astore: store_one(current, s.get_index()); break;
duke@435	237	case Bytecodes::_istore_0: store_one(current, 0); break;
duke@435	238	case Bytecodes::_istore_1: store_one(current, 1); break;
duke@435	239	case Bytecodes::_istore_2: store_one(current, 2); break;
duke@435	240	case Bytecodes::_istore_3: store_one(current, 3); break;
duke@435	241	case Bytecodes::_lstore_0: store_two(current, 0); break;
duke@435	242	case Bytecodes::_lstore_1: store_two(current, 1); break;
duke@435	243	case Bytecodes::_lstore_2: store_two(current, 2); break;
duke@435	244	case Bytecodes::_lstore_3: store_two(current, 3); break;
duke@435	245	case Bytecodes::_fstore_0: store_one(current, 0); break;
duke@435	246	case Bytecodes::_fstore_1: store_one(current, 1); break;
duke@435	247	case Bytecodes::_fstore_2: store_one(current, 2); break;
duke@435	248	case Bytecodes::_fstore_3: store_one(current, 3); break;
duke@435	249	case Bytecodes::_dstore_0: store_two(current, 0); break;
duke@435	250	case Bytecodes::_dstore_1: store_two(current, 1); break;
duke@435	251	case Bytecodes::_dstore_2: store_two(current, 2); break;
duke@435	252	case Bytecodes::_dstore_3: store_two(current, 3); break;
duke@435	253	case Bytecodes::_astore_0: store_one(current, 0); break;
duke@435	254	case Bytecodes::_astore_1: store_one(current, 1); break;
duke@435	255	case Bytecodes::_astore_2: store_one(current, 2); break;
duke@435	256	case Bytecodes::_astore_3: store_one(current, 3); break;
duke@435	257
duke@435	258	// track bytecodes that affect the control flow
duke@435	259	case Bytecodes::_athrow: // fall through
duke@435	260	case Bytecodes::_ret: // fall through
duke@435	261	case Bytecodes::_ireturn: // fall through
duke@435	262	case Bytecodes::_lreturn: // fall through
duke@435	263	case Bytecodes::_freturn: // fall through
duke@435	264	case Bytecodes::_dreturn: // fall through
duke@435	265	case Bytecodes::_areturn: // fall through
duke@435	266	case Bytecodes::_return:
duke@435	267	current = NULL;
duke@435	268	break;
duke@435	269
duke@435	270	case Bytecodes::_ifeq: // fall through
duke@435	271	case Bytecodes::_ifne: // fall through
duke@435	272	case Bytecodes::_iflt: // fall through
duke@435	273	case Bytecodes::_ifge: // fall through
duke@435	274	case Bytecodes::_ifgt: // fall through
duke@435	275	case Bytecodes::_ifle: // fall through
duke@435	276	case Bytecodes::_if_icmpeq: // fall through
duke@435	277	case Bytecodes::_if_icmpne: // fall through
duke@435	278	case Bytecodes::_if_icmplt: // fall through
duke@435	279	case Bytecodes::_if_icmpge: // fall through
duke@435	280	case Bytecodes::_if_icmpgt: // fall through
duke@435	281	case Bytecodes::_if_icmple: // fall through
duke@435	282	case Bytecodes::_if_acmpeq: // fall through
duke@435	283	case Bytecodes::_if_acmpne: // fall through
duke@435	284	case Bytecodes::_ifnull: // fall through
duke@435	285	case Bytecodes::_ifnonnull:
duke@435	286	make_block_at(s.next_bci(), current);
duke@435	287	make_block_at(s.get_dest(), current);
duke@435	288	current = NULL;
duke@435	289	break;
duke@435	290
duke@435	291	case Bytecodes::_goto:
duke@435	292	make_block_at(s.get_dest(), current);
duke@435	293	current = NULL;
duke@435	294	break;
duke@435	295
duke@435	296	case Bytecodes::_goto_w:
duke@435	297	make_block_at(s.get_far_dest(), current);
duke@435	298	current = NULL;
duke@435	299	break;
duke@435	300
duke@435	301	case Bytecodes::_jsr:
duke@435	302	handle_jsr(current, s.get_dest(), s.next_bci());
duke@435	303	current = NULL;
duke@435	304	break;
duke@435	305
duke@435	306	case Bytecodes::_jsr_w:
duke@435	307	handle_jsr(current, s.get_far_dest(), s.next_bci());
duke@435	308	current = NULL;
duke@435	309	break;
duke@435	310
duke@435	311	case Bytecodes::_tableswitch: {
duke@435	312	// set block for each case
duke@435	313	Bytecode_tableswitch *switch_ = Bytecode_tableswitch_at(s.cur_bcp());
duke@435	314	int l = switch_->length();
duke@435	315	for (int i = 0; i < l; i++) {
duke@435	316	make_block_at(cur_bci + switch_->dest_offset_at(i), current);
duke@435	317	}
duke@435	318	make_block_at(cur_bci + switch_->default_offset(), current);
duke@435	319	current = NULL;
duke@435	320	break;
duke@435	321	}
duke@435	322
duke@435	323	case Bytecodes::_lookupswitch: {
duke@435	324	// set block for each case
duke@435	325	Bytecode_lookupswitch *switch_ = Bytecode_lookupswitch_at(s.cur_bcp());
duke@435	326	int l = switch_->number_of_pairs();
duke@435	327	for (int i = 0; i < l; i++) {
duke@435	328	make_block_at(cur_bci + switch_->pair_at(i)->offset(), current);
duke@435	329	}
duke@435	330	make_block_at(cur_bci + switch_->default_offset(), current);
duke@435	331	current = NULL;
duke@435	332	break;
duke@435	333	}
duke@435	334	}
duke@435	335	}
duke@435	336	}
duke@435	337
duke@435	338
duke@435	339	void BlockListBuilder::mark_loops() {
duke@435	340	ResourceMark rm;
duke@435	341
duke@435	342	_active = BitMap(BlockBegin::number_of_blocks()); _active.clear();
duke@435	343	_visited = BitMap(BlockBegin::number_of_blocks()); _visited.clear();
duke@435	344	_loop_map = intArray(BlockBegin::number_of_blocks(), 0);
duke@435	345	_next_loop_index = 0;
duke@435	346	_next_block_number = _blocks.length();
duke@435	347
duke@435	348	// recursively iterate the control flow graph
duke@435	349	mark_loops(_bci2block->at(0), false);
duke@435	350	assert(_next_block_number >= 0, "invalid block numbers");
duke@435	351	}
duke@435	352
duke@435	353	void BlockListBuilder::make_loop_header(BlockBegin* block) {
duke@435	354	if (block->is_set(BlockBegin::exception_entry_flag)) {
duke@435	355	// exception edges may look like loops but don't mark them as such
duke@435	356	// since it screws up block ordering.
duke@435	357	return;
duke@435	358	}
duke@435	359	if (!block->is_set(BlockBegin::parser_loop_header_flag)) {
duke@435	360	block->set(BlockBegin::parser_loop_header_flag);
duke@435	361
duke@435	362	assert(_loop_map.at(block->block_id()) == 0, "must not be set yet");
duke@435	363	assert(0 <= _next_loop_index && _next_loop_index < BitsPerInt, "_next_loop_index is used as a bit-index in integer");
duke@435	364	_loop_map.at_put(block->block_id(), 1 << _next_loop_index);
duke@435	365	if (_next_loop_index < 31) _next_loop_index++;
duke@435	366	} else {
duke@435	367	// block already marked as loop header
roland@1495	368	assert(is_power_of_2((unsigned int)_loop_map.at(block->block_id())), "exactly one bit must be set");
duke@435	369	}
duke@435	370	}
duke@435	371
duke@435	372	int BlockListBuilder::mark_loops(BlockBegin* block, bool in_subroutine) {
duke@435	373	int block_id = block->block_id();
duke@435	374
duke@435	375	if (_visited.at(block_id)) {
duke@435	376	if (_active.at(block_id)) {
duke@435	377	// reached block via backward branch
duke@435	378	make_loop_header(block);
duke@435	379	}
duke@435	380	// return cached loop information for this block
duke@435	381	return _loop_map.at(block_id);
duke@435	382	}
duke@435	383
duke@435	384	if (block->is_set(BlockBegin::subroutine_entry_flag)) {
duke@435	385	in_subroutine = true;
duke@435	386	}
duke@435	387
duke@435	388	// set active and visited bits before successors are processed
duke@435	389	_visited.set_bit(block_id);
duke@435	390	_active.set_bit(block_id);
duke@435	391
duke@435	392	intptr_t loop_state = 0;
duke@435	393	for (int i = block->number_of_sux() - 1; i >= 0; i--) {
duke@435	394	// recursively process all successors
duke@435	395	loop_state |= mark_loops(block->sux_at(i), in_subroutine);
duke@435	396	}
duke@435	397
duke@435	398	// clear active-bit after all successors are processed
duke@435	399	_active.clear_bit(block_id);
duke@435	400
duke@435	401	// reverse-post-order numbering of all blocks
duke@435	402	block->set_depth_first_number(_next_block_number);
duke@435	403	_next_block_number--;
duke@435	404
duke@435	405	if (loop_state != 0 || in_subroutine ) {
duke@435	406	// block is contained at least in one loop, so phi functions are necessary
duke@435	407	// phi functions are also necessary for all locals stored in a subroutine
duke@435	408	scope()->requires_phi_function().set_union(block->stores_to_locals());
duke@435	409	}
duke@435	410
duke@435	411	if (block->is_set(BlockBegin::parser_loop_header_flag)) {
duke@435	412	int header_loop_state = _loop_map.at(block_id);
duke@435	413	assert(is_power_of_2((unsigned)header_loop_state), "exactly one bit must be set");
duke@435	414
duke@435	415	// If the highest bit is set (i.e. when integer value is negative), the method
duke@435	416	// has 32 or more loops. This bit is never cleared because it is used for multiple loops
duke@435	417	if (header_loop_state >= 0) {
duke@435	418	clear_bits(loop_state, header_loop_state);
duke@435	419	}
duke@435	420	}
duke@435	421
duke@435	422	// cache and return loop information for this block
duke@435	423	_loop_map.at_put(block_id, loop_state);
duke@435	424	return loop_state;
duke@435	425	}
duke@435	426
duke@435	427
duke@435	428	#ifndef PRODUCT
duke@435	429
duke@435	430	int compare_depth_first(BlockBegin** a, BlockBegin** b) {
duke@435	431	return (*a)->depth_first_number() - (*b)->depth_first_number();
duke@435	432	}
duke@435	433
duke@435	434	void BlockListBuilder::print() {
duke@435	435	tty->print("----- initial block list of BlockListBuilder for method ");
duke@435	436	method()->print_short_name();
duke@435	437	tty->cr();
duke@435	438
duke@435	439	// better readability if blocks are sorted in processing order
duke@435	440	_blocks.sort(compare_depth_first);
duke@435	441
duke@435	442	for (int i = 0; i < _blocks.length(); i++) {
duke@435	443	BlockBegin* cur = _blocks.at(i);
duke@435	444	tty->print("%4d: B%-4d bci: %-4d preds: %-4d ", cur->depth_first_number(), cur->block_id(), cur->bci(), cur->total_preds());
duke@435	445
duke@435	446	tty->print(cur->is_set(BlockBegin::std_entry_flag) ? " std" : " ");
duke@435	447	tty->print(cur->is_set(BlockBegin::osr_entry_flag) ? " osr" : " ");
duke@435	448	tty->print(cur->is_set(BlockBegin::exception_entry_flag) ? " ex" : " ");
duke@435	449	tty->print(cur->is_set(BlockBegin::subroutine_entry_flag) ? " sr" : " ");
duke@435	450	tty->print(cur->is_set(BlockBegin::parser_loop_header_flag) ? " lh" : " ");
duke@435	451
duke@435	452	if (cur->number_of_sux() > 0) {
duke@435	453	tty->print(" sux: ");
duke@435	454	for (int j = 0; j < cur->number_of_sux(); j++) {
duke@435	455	BlockBegin* sux = cur->sux_at(j);
duke@435	456	tty->print("B%d ", sux->block_id());
duke@435	457	}
duke@435	458	}
duke@435	459	tty->cr();
duke@435	460	}
duke@435	461	}
duke@435	462
duke@435	463	#endif
duke@435	464
duke@435	465
duke@435	466	// A simple growable array of Values indexed by ciFields
duke@435	467	class FieldBuffer: public CompilationResourceObj {
duke@435	468	private:
duke@435	469	GrowableArray<Value> _values;
duke@435	470
duke@435	471	public:
duke@435	472	FieldBuffer() {}
duke@435	473
duke@435	474	void kill() {
duke@435	475	_values.trunc_to(0);
duke@435	476	}
duke@435	477
duke@435	478	Value at(ciField* field) {
duke@435	479	assert(field->holder()->is_loaded(), "must be a loaded field");
duke@435	480	int offset = field->offset();
duke@435	481	if (offset < _values.length()) {
duke@435	482	return _values.at(offset);
duke@435	483	} else {
duke@435	484	return NULL;
duke@435	485	}
duke@435	486	}
duke@435	487
duke@435	488	void at_put(ciField* field, Value value) {
duke@435	489	assert(field->holder()->is_loaded(), "must be a loaded field");
duke@435	490	int offset = field->offset();
duke@435	491	_values.at_put_grow(offset, value, NULL);
duke@435	492	}
duke@435	493
duke@435	494	};
duke@435	495
duke@435	496
duke@435	497	// MemoryBuffer is fairly simple model of the current state of memory.
duke@435	498	// It partitions memory into several pieces. The first piece is
duke@435	499	// generic memory where little is known about the owner of the memory.
duke@435	500	// This is conceptually represented by the tuple <O, F, V> which says
duke@435	501	// that the field F of object O has value V. This is flattened so
duke@435	502	// that F is represented by the offset of the field and the parallel
duke@435	503	// arrays _objects and _values are used for O and V. Loads of O.F can
duke@435	504	// simply use V. Newly allocated objects are kept in a separate list
duke@435	505	// along with a parallel array for each object which represents the
duke@435	506	// current value of its fields. Stores of the default value to fields
duke@435	507	// which have never been stored to before are eliminated since they
duke@435	508	// are redundant. Once newly allocated objects are stored into
duke@435	509	// another object or they are passed out of the current compile they
duke@435	510	// are treated like generic memory.
duke@435	511
duke@435	512	class MemoryBuffer: public CompilationResourceObj {
duke@435	513	private:
duke@435	514	FieldBuffer _values;
duke@435	515	GrowableArray<Value> _objects;
duke@435	516	GrowableArray<Value> _newobjects;
duke@435	517	GrowableArray<FieldBuffer*> _fields;
duke@435	518
duke@435	519	public:
duke@435	520	MemoryBuffer() {}
duke@435	521
duke@435	522	StoreField* store(StoreField* st) {
duke@435	523	if (!EliminateFieldAccess) {
duke@435	524	return st;
duke@435	525	}
duke@435	526
duke@435	527	Value object = st->obj();
duke@435	528	Value value = st->value();
duke@435	529	ciField* field = st->field();
duke@435	530	if (field->holder()->is_loaded()) {
duke@435	531	int offset = field->offset();
duke@435	532	int index = _newobjects.find(object);
duke@435	533	if (index != -1) {
duke@435	534	// newly allocated object with no other stores performed on this field
duke@435	535	FieldBuffer* buf = _fields.at(index);
duke@435	536	if (buf->at(field) == NULL && is_default_value(value)) {
duke@435	537	#ifndef PRODUCT
duke@435	538	if (PrintIRDuringConstruction && Verbose) {
duke@435	539	tty->print_cr("Eliminated store for object %d:", index);
duke@435	540	st->print_line();
duke@435	541	}
duke@435	542	#endif
duke@435	543	return NULL;
duke@435	544	} else {
duke@435	545	buf->at_put(field, value);
duke@435	546	}
duke@435	547	} else {
duke@435	548	_objects.at_put_grow(offset, object, NULL);
duke@435	549	_values.at_put(field, value);
duke@435	550	}
duke@435	551
duke@435	552	store_value(value);
duke@435	553	} else {
duke@435	554	// if we held onto field names we could alias based on names but
duke@435	555	// we don't know what's being stored to so kill it all.
duke@435	556	kill();
duke@435	557	}
duke@435	558	return st;
duke@435	559	}
duke@435	560
duke@435	561
duke@435	562	// return true if this value correspond to the default value of a field.
duke@435	563	bool is_default_value(Value value) {
duke@435	564	Constant* con = value->as_Constant();
duke@435	565	if (con) {
duke@435	566	switch (con->type()->tag()) {
duke@435	567	case intTag: return con->type()->as_IntConstant()->value() == 0;
duke@435	568	case longTag: return con->type()->as_LongConstant()->value() == 0;
duke@435	569	case floatTag: return jint_cast(con->type()->as_FloatConstant()->value()) == 0;
duke@435	570	case doubleTag: return jlong_cast(con->type()->as_DoubleConstant()->value()) == jlong_cast(0);
duke@435	571	case objectTag: return con->type() == objectNull;
duke@435	572	default: ShouldNotReachHere();
duke@435	573	}
duke@435	574	}
duke@435	575	return false;
duke@435	576	}
duke@435	577
duke@435	578
duke@435	579	// return either the actual value of a load or the load itself
duke@435	580	Value load(LoadField* load) {
duke@435	581	if (!EliminateFieldAccess) {
duke@435	582	return load;
duke@435	583	}
duke@435	584
duke@435	585	if (RoundFPResults && UseSSE < 2 && load->type()->is_float_kind()) {
duke@435	586	// can't skip load since value might get rounded as a side effect
duke@435	587	return load;
duke@435	588	}
duke@435	589
duke@435	590	ciField* field = load->field();
duke@435	591	Value object = load->obj();
duke@435	592	if (field->holder()->is_loaded() && !field->is_volatile()) {
duke@435	593	int offset = field->offset();
duke@435	594	Value result = NULL;
duke@435	595	int index = _newobjects.find(object);
duke@435	596	if (index != -1) {
duke@435	597	result = _fields.at(index)->at(field);
duke@435	598	} else if (_objects.at_grow(offset, NULL) == object) {
duke@435	599	result = _values.at(field);
duke@435	600	}
duke@435	601	if (result != NULL) {
duke@435	602	#ifndef PRODUCT
duke@435	603	if (PrintIRDuringConstruction && Verbose) {
duke@435	604	tty->print_cr("Eliminated load: ");
duke@435	605	load->print_line();
duke@435	606	}
duke@435	607	#endif
duke@435	608	assert(result->type()->tag() == load->type()->tag(), "wrong types");
duke@435	609	return result;
duke@435	610	}
duke@435	611	}
duke@435	612	return load;
duke@435	613	}
duke@435	614
duke@435	615	// Record this newly allocated object
duke@435	616	void new_instance(NewInstance* object) {
duke@435	617	int index = _newobjects.length();
duke@435	618	_newobjects.append(object);
duke@435	619	if (_fields.at_grow(index, NULL) == NULL) {
duke@435	620	_fields.at_put(index, new FieldBuffer());
duke@435	621	} else {
duke@435	622	_fields.at(index)->kill();
duke@435	623	}
duke@435	624	}
duke@435	625
duke@435	626	void store_value(Value value) {
duke@435	627	int index = _newobjects.find(value);
duke@435	628	if (index != -1) {
duke@435	629	// stored a newly allocated object into another object.
duke@435	630	// Assume we've lost track of it as separate slice of memory.
duke@435	631	// We could do better by keeping track of whether individual
duke@435	632	// fields could alias each other.
duke@435	633	_newobjects.remove_at(index);
duke@435	634	// pull out the field info and store it at the end up the list
duke@435	635	// of field info list to be reused later.
duke@435	636	_fields.append(_fields.at(index));
duke@435	637	_fields.remove_at(index);
duke@435	638	}
duke@435	639	}
duke@435	640
duke@435	641	void kill() {
duke@435	642	_newobjects.trunc_to(0);
duke@435	643	_objects.trunc_to(0);
duke@435	644	_values.kill();
duke@435	645	}
duke@435	646	};
duke@435	647
duke@435	648
duke@435	649	// Implementation of GraphBuilder's ScopeData
duke@435	650
duke@435	651	GraphBuilder::ScopeData::ScopeData(ScopeData* parent)
duke@435	652	: _parent(parent)
duke@435	653	, _bci2block(NULL)
duke@435	654	, _scope(NULL)
duke@435	655	, _has_handler(false)
duke@435	656	, _stream(NULL)
duke@435	657	, _work_list(NULL)
duke@435	658	, _parsing_jsr(false)
duke@435	659	, _jsr_xhandlers(NULL)
duke@435	660	, _caller_stack_size(-1)
duke@435	661	, _continuation(NULL)
duke@435	662	, _continuation_state(NULL)
duke@435	663	, _num_returns(0)
duke@435	664	, _cleanup_block(NULL)
duke@435	665	, _cleanup_return_prev(NULL)
duke@435	666	, _cleanup_state(NULL)
duke@435	667	{
duke@435	668	if (parent != NULL) {
duke@435	669	_max_inline_size = (intx) ((float) NestedInliningSizeRatio * (float) parent->max_inline_size() / 100.0f);
duke@435	670	} else {
duke@435	671	_max_inline_size = MaxInlineSize;
duke@435	672	}
duke@435	673	if (_max_inline_size < MaxTrivialSize) {
duke@435	674	_max_inline_size = MaxTrivialSize;
duke@435	675	}
duke@435	676	}
duke@435	677
duke@435	678
duke@435	679	void GraphBuilder::kill_all() {
duke@435	680	if (UseLocalValueNumbering) {
duke@435	681	vmap()->kill_all();
duke@435	682	}
duke@435	683	_memory->kill();
duke@435	684	}
duke@435	685
duke@435	686
duke@435	687	BlockBegin* GraphBuilder::ScopeData::block_at(int bci) {
duke@435	688	if (parsing_jsr()) {
duke@435	689	// It is necessary to clone all blocks associated with a
duke@435	690	// subroutine, including those for exception handlers in the scope
duke@435	691	// of the method containing the jsr (because those exception
duke@435	692	// handlers may contain ret instructions in some cases).
duke@435	693	BlockBegin* block = bci2block()->at(bci);
duke@435	694	if (block != NULL && block == parent()->bci2block()->at(bci)) {
duke@435	695	BlockBegin* new_block = new BlockBegin(block->bci());
duke@435	696	#ifndef PRODUCT
duke@435	697	if (PrintInitialBlockList) {
duke@435	698	tty->print_cr("CFG: cloned block %d (bci %d) as block %d for jsr",
duke@435	699	block->block_id(), block->bci(), new_block->block_id());
duke@435	700	}
duke@435	701	#endif
duke@435	702	// copy data from cloned blocked
duke@435	703	new_block->set_depth_first_number(block->depth_first_number());
duke@435	704	if (block->is_set(BlockBegin::parser_loop_header_flag)) new_block->set(BlockBegin::parser_loop_header_flag);
duke@435	705	// Preserve certain flags for assertion checking
duke@435	706	if (block->is_set(BlockBegin::subroutine_entry_flag)) new_block->set(BlockBegin::subroutine_entry_flag);
duke@435	707	if (block->is_set(BlockBegin::exception_entry_flag)) new_block->set(BlockBegin::exception_entry_flag);
duke@435	708
duke@435	709	// copy was_visited_flag to allow early detection of bailouts
duke@435	710	// if a block that is used in a jsr has already been visited before,
duke@435	711	// it is shared between the normal control flow and a subroutine
duke@435	712	// BlockBegin::try_merge returns false when the flag is set, this leads
duke@435	713	// to a compilation bailout
duke@435	714	if (block->is_set(BlockBegin::was_visited_flag)) new_block->set(BlockBegin::was_visited_flag);
duke@435	715
duke@435	716	bci2block()->at_put(bci, new_block);
duke@435	717	block = new_block;
duke@435	718	}
duke@435	719	return block;
duke@435	720	} else {
duke@435	721	return bci2block()->at(bci);
duke@435	722	}
duke@435	723	}
duke@435	724
duke@435	725
duke@435	726	XHandlers* GraphBuilder::ScopeData::xhandlers() const {
duke@435	727	if (_jsr_xhandlers == NULL) {
duke@435	728	assert(!parsing_jsr(), "");
duke@435	729	return scope()->xhandlers();
duke@435	730	}
duke@435	731	assert(parsing_jsr(), "");
duke@435	732	return _jsr_xhandlers;
duke@435	733	}
duke@435	734
duke@435	735
duke@435	736	void GraphBuilder::ScopeData::set_scope(IRScope* scope) {
duke@435	737	_scope = scope;
duke@435	738	bool parent_has_handler = false;
duke@435	739	if (parent() != NULL) {
duke@435	740	parent_has_handler = parent()->has_handler();
duke@435	741	}
duke@435	742	_has_handler = parent_has_handler || scope->xhandlers()->has_handlers();
duke@435	743	}
duke@435	744
duke@435	745
duke@435	746	void GraphBuilder::ScopeData::set_inline_cleanup_info(BlockBegin* block,
duke@435	747	Instruction* return_prev,
duke@435	748	ValueStack* return_state) {
duke@435	749	_cleanup_block = block;
duke@435	750	_cleanup_return_prev = return_prev;
duke@435	751	_cleanup_state = return_state;
duke@435	752	}
duke@435	753
duke@435	754
duke@435	755	void GraphBuilder::ScopeData::add_to_work_list(BlockBegin* block) {
duke@435	756	if (_work_list == NULL) {
duke@435	757	_work_list = new BlockList();
duke@435	758	}
duke@435	759
duke@435	760	if (!block->is_set(BlockBegin::is_on_work_list_flag)) {
duke@435	761	// Do not start parsing the continuation block while in a
duke@435	762	// sub-scope
duke@435	763	if (parsing_jsr()) {
duke@435	764	if (block == jsr_continuation()) {
duke@435	765	return;
duke@435	766	}
duke@435	767	} else {
duke@435	768	if (block == continuation()) {
duke@435	769	return;
duke@435	770	}
duke@435	771	}
duke@435	772	block->set(BlockBegin::is_on_work_list_flag);
duke@435	773	_work_list->push(block);
duke@435	774
duke@435	775	sort_top_into_worklist(_work_list, block);
duke@435	776	}
duke@435	777	}
duke@435	778
duke@435	779
duke@435	780	void GraphBuilder::sort_top_into_worklist(BlockList* worklist, BlockBegin* top) {
duke@435	781	assert(worklist->top() == top, "");
duke@435	782	// sort block descending into work list
duke@435	783	const int dfn = top->depth_first_number();
duke@435	784	assert(dfn != -1, "unknown depth first number");
duke@435	785	int i = worklist->length()-2;
duke@435	786	while (i >= 0) {
duke@435	787	BlockBegin* b = worklist->at(i);
duke@435	788	if (b->depth_first_number() < dfn) {
duke@435	789	worklist->at_put(i+1, b);
duke@435	790	} else {
duke@435	791	break;
duke@435	792	}
duke@435	793	i --;
duke@435	794	}
duke@435	795	if (i >= -1) worklist->at_put(i + 1, top);
duke@435	796	}
duke@435	797
duke@435	798	int GraphBuilder::ScopeData::caller_stack_size() const {
duke@435	799	ValueStack* state = scope()->caller_state();
duke@435	800	if (state == NULL) {
duke@435	801	return 0;
duke@435	802	}
duke@435	803	return state->stack_size();
duke@435	804	}
duke@435	805
duke@435	806
duke@435	807	BlockBegin* GraphBuilder::ScopeData::remove_from_work_list() {
duke@435	808	if (is_work_list_empty()) {
duke@435	809	return NULL;
duke@435	810	}
duke@435	811	return _work_list->pop();
duke@435	812	}
duke@435	813
duke@435	814
duke@435	815	bool GraphBuilder::ScopeData::is_work_list_empty() const {
duke@435	816	return (_work_list == NULL || _work_list->length() == 0);
duke@435	817	}
duke@435	818
duke@435	819
duke@435	820	void GraphBuilder::ScopeData::setup_jsr_xhandlers() {
duke@435	821	assert(parsing_jsr(), "");
duke@435	822	// clone all the exception handlers from the scope
duke@435	823	XHandlers* handlers = new XHandlers(scope()->xhandlers());
duke@435	824	const int n = handlers->length();
duke@435	825	for (int i = 0; i < n; i++) {
duke@435	826	// The XHandlers need to be adjusted to dispatch to the cloned
duke@435	827	// handler block instead of the default one but the synthetic
duke@435	828	// unlocker needs to be handled specially. The synthetic unlocker
duke@435	829	// should be left alone since there can be only one and all code
duke@435	830	// should dispatch to the same one.
duke@435	831	XHandler* h = handlers->handler_at(i);
never@1813	832	assert(h->handler_bci() != SynchronizationEntryBCI, "must be real");
never@1813	833	h->set_entry_block(block_at(h->handler_bci()));
duke@435	834	}
duke@435	835	_jsr_xhandlers = handlers;
duke@435	836	}
duke@435	837
duke@435	838
duke@435	839	int GraphBuilder::ScopeData::num_returns() {
duke@435	840	if (parsing_jsr()) {
duke@435	841	return parent()->num_returns();
duke@435	842	}
duke@435	843	return _num_returns;
duke@435	844	}
duke@435	845
duke@435	846
duke@435	847	void GraphBuilder::ScopeData::incr_num_returns() {
duke@435	848	if (parsing_jsr()) {
duke@435	849	parent()->incr_num_returns();
duke@435	850	} else {
duke@435	851	++_num_returns;
duke@435	852	}
duke@435	853	}
duke@435	854
duke@435	855
duke@435	856	// Implementation of GraphBuilder
duke@435	857
duke@435	858	#define INLINE_BAILOUT(msg) { inline_bailout(msg); return false; }
duke@435	859
duke@435	860
duke@435	861	void GraphBuilder::load_constant() {
duke@435	862	ciConstant con = stream()->get_constant();
duke@435	863	if (con.basic_type() == T_ILLEGAL) {
duke@435	864	BAILOUT("could not resolve a constant");
duke@435	865	} else {
duke@435	866	ValueType* t = illegalType;
duke@435	867	ValueStack* patch_state = NULL;
duke@435	868	switch (con.basic_type()) {
duke@435	869	case T_BOOLEAN: t = new IntConstant (con.as_boolean()); break;
duke@435	870	case T_BYTE : t = new IntConstant (con.as_byte ()); break;
duke@435	871	case T_CHAR : t = new IntConstant (con.as_char ()); break;
duke@435	872	case T_SHORT : t = new IntConstant (con.as_short ()); break;
duke@435	873	case T_INT : t = new IntConstant (con.as_int ()); break;
duke@435	874	case T_LONG : t = new LongConstant (con.as_long ()); break;
duke@435	875	case T_FLOAT : t = new FloatConstant (con.as_float ()); break;
duke@435	876	case T_DOUBLE : t = new DoubleConstant (con.as_double ()); break;
duke@435	877	case T_ARRAY : t = new ArrayConstant (con.as_object ()->as_array ()); break;
duke@435	878	case T_OBJECT :
duke@435	879	{
duke@435	880	ciObject* obj = con.as_object();
duke@435	881	if (obj->is_klass()) {
duke@435	882	ciKlass* klass = obj->as_klass();
duke@435	883	if (!klass->is_loaded() || PatchALot) {
duke@435	884	patch_state = state()->copy();
duke@435	885	t = new ObjectConstant(obj);
duke@435	886	} else {
duke@435	887	t = new InstanceConstant(klass->java_mirror());
duke@435	888	}
duke@435	889	} else {
duke@435	890	t = new InstanceConstant(obj->as_instance());
duke@435	891	}
duke@435	892	break;
duke@435	893	}
duke@435	894	default : ShouldNotReachHere();
duke@435	895	}
duke@435	896	Value x;
duke@435	897	if (patch_state != NULL) {
duke@435	898	x = new Constant(t, patch_state);
duke@435	899	} else {
duke@435	900	x = new Constant(t);
duke@435	901	}
duke@435	902	push(t, append(x));
duke@435	903	}
duke@435	904	}
duke@435	905
duke@435	906
duke@435	907	void GraphBuilder::load_local(ValueType* type, int index) {
duke@435	908	Value x = state()->load_local(index);
duke@435	909	push(type, x);
duke@435	910	}
duke@435	911
duke@435	912
duke@435	913	void GraphBuilder::store_local(ValueType* type, int index) {
duke@435	914	Value x = pop(type);
duke@435	915	store_local(state(), x, type, index);
duke@435	916	}
duke@435	917
duke@435	918
duke@435	919	void GraphBuilder::store_local(ValueStack* state, Value x, ValueType* type, int index) {
duke@435	920	if (parsing_jsr()) {
duke@435	921	// We need to do additional tracking of the location of the return
duke@435	922	// address for jsrs since we don't handle arbitrary jsr/ret
duke@435	923	// constructs. Here we are figuring out in which circumstances we
duke@435	924	// need to bail out.
duke@435	925	if (x->type()->is_address()) {
duke@435	926	scope_data()->set_jsr_return_address_local(index);
duke@435	927
duke@435	928	// Also check parent jsrs (if any) at this time to see whether
duke@435	929	// they are using this local. We don't handle skipping over a
duke@435	930	// ret.
duke@435	931	for (ScopeData* cur_scope_data = scope_data()->parent();
duke@435	932	cur_scope_data != NULL && cur_scope_data->parsing_jsr() && cur_scope_data->scope() == scope();
duke@435	933	cur_scope_data = cur_scope_data->parent()) {
duke@435	934	if (cur_scope_data->jsr_return_address_local() == index) {
duke@435	935	BAILOUT("subroutine overwrites return address from previous subroutine");
duke@435	936	}
duke@435	937	}
duke@435	938	} else if (index == scope_data()->jsr_return_address_local()) {
duke@435	939	scope_data()->set_jsr_return_address_local(-1);
duke@435	940	}
duke@435	941	}
duke@435	942
duke@435	943	state->store_local(index, round_fp(x));
duke@435	944	}
duke@435	945
duke@435	946
duke@435	947	void GraphBuilder::load_indexed(BasicType type) {
duke@435	948	Value index = ipop();
duke@435	949	Value array = apop();
duke@435	950	Value length = NULL;
duke@435	951	if (CSEArrayLength ||
duke@435	952	(array->as_AccessField() && array->as_AccessField()->field()->is_constant()) ||
duke@435	953	(array->as_NewArray() && array->as_NewArray()->length() && array->as_NewArray()->length()->type()->is_constant())) {
duke@435	954	length = append(new ArrayLength(array, lock_stack()));
duke@435	955	}
duke@435	956	push(as_ValueType(type), append(new LoadIndexed(array, index, length, type, lock_stack())));
duke@435	957	}
duke@435	958
duke@435	959
duke@435	960	void GraphBuilder::store_indexed(BasicType type) {
duke@435	961	Value value = pop(as_ValueType(type));
duke@435	962	Value index = ipop();
duke@435	963	Value array = apop();
duke@435	964	Value length = NULL;
duke@435	965	if (CSEArrayLength ||
duke@435	966	(array->as_AccessField() && array->as_AccessField()->field()->is_constant()) ||
duke@435	967	(array->as_NewArray() && array->as_NewArray()->length() && array->as_NewArray()->length()->type()->is_constant())) {
duke@435	968	length = append(new ArrayLength(array, lock_stack()));
duke@435	969	}
duke@435	970	StoreIndexed* result = new StoreIndexed(array, index, length, type, value, lock_stack());
duke@435	971	append(result);
never@894	972	_memory->store_value(value);
duke@435	973	}
duke@435	974
duke@435	975
duke@435	976	void GraphBuilder::stack_op(Bytecodes::Code code) {
duke@435	977	switch (code) {
duke@435	978	case Bytecodes::_pop:
duke@435	979	{ state()->raw_pop();
duke@435	980	}
duke@435	981	break;
duke@435	982	case Bytecodes::_pop2:
duke@435	983	{ state()->raw_pop();
duke@435	984	state()->raw_pop();
duke@435	985	}
duke@435	986	break;
duke@435	987	case Bytecodes::_dup:
duke@435	988	{ Value w = state()->raw_pop();
duke@435	989	state()->raw_push(w);
duke@435	990	state()->raw_push(w);
duke@435	991	}
duke@435	992	break;
duke@435	993	case Bytecodes::_dup_x1:
duke@435	994	{ Value w1 = state()->raw_pop();
duke@435	995	Value w2 = state()->raw_pop();
duke@435	996	state()->raw_push(w1);
duke@435	997	state()->raw_push(w2);
duke@435	998	state()->raw_push(w1);
duke@435	999	}
duke@435	1000	break;
duke@435	1001	case Bytecodes::_dup_x2:
duke@435	1002	{ Value w1 = state()->raw_pop();
duke@435	1003	Value w2 = state()->raw_pop();
duke@435	1004	Value w3 = state()->raw_pop();
duke@435	1005	state()->raw_push(w1);
duke@435	1006	state()->raw_push(w3);
duke@435	1007	state()->raw_push(w2);
duke@435	1008	state()->raw_push(w1);
duke@435	1009	}
duke@435	1010	break;
duke@435	1011	case Bytecodes::_dup2:
duke@435	1012	{ Value w1 = state()->raw_pop();
duke@435	1013	Value w2 = state()->raw_pop();
duke@435	1014	state()->raw_push(w2);
duke@435	1015	state()->raw_push(w1);
duke@435	1016	state()->raw_push(w2);
duke@435	1017	state()->raw_push(w1);
duke@435	1018	}
duke@435	1019	break;
duke@435	1020	case Bytecodes::_dup2_x1:
duke@435	1021	{ Value w1 = state()->raw_pop();
duke@435	1022	Value w2 = state()->raw_pop();
duke@435	1023	Value w3 = state()->raw_pop();
duke@435	1024	state()->raw_push(w2);
duke@435	1025	state()->raw_push(w1);
duke@435	1026	state()->raw_push(w3);
duke@435	1027	state()->raw_push(w2);
duke@435	1028	state()->raw_push(w1);
duke@435	1029	}
duke@435	1030	break;
duke@435	1031	case Bytecodes::_dup2_x2:
duke@435	1032	{ Value w1 = state()->raw_pop();
duke@435	1033	Value w2 = state()->raw_pop();
duke@435	1034	Value w3 = state()->raw_pop();
duke@435	1035	Value w4 = state()->raw_pop();
duke@435	1036	state()->raw_push(w2);
duke@435	1037	state()->raw_push(w1);
duke@435	1038	state()->raw_push(w4);
duke@435	1039	state()->raw_push(w3);
duke@435	1040	state()->raw_push(w2);
duke@435	1041	state()->raw_push(w1);
duke@435	1042	}
duke@435	1043	break;
duke@435	1044	case Bytecodes::_swap:
duke@435	1045	{ Value w1 = state()->raw_pop();
duke@435	1046	Value w2 = state()->raw_pop();
duke@435	1047	state()->raw_push(w1);
duke@435	1048	state()->raw_push(w2);
duke@435	1049	}
duke@435	1050	break;
duke@435	1051	default:
duke@435	1052	ShouldNotReachHere();
duke@435	1053	break;
duke@435	1054	}
duke@435	1055	}
duke@435	1056
duke@435	1057
duke@435	1058	void GraphBuilder::arithmetic_op(ValueType* type, Bytecodes::Code code, ValueStack* stack) {
duke@435	1059	Value y = pop(type);
duke@435	1060	Value x = pop(type);
duke@435	1061	// NOTE: strictfp can be queried from current method since we don't
duke@435	1062	// inline methods with differing strictfp bits
duke@435	1063	Value res = new ArithmeticOp(code, x, y, method()->is_strict(), stack);
duke@435	1064	// Note: currently single-precision floating-point rounding on Intel is handled at the LIRGenerator level
duke@435	1065	res = append(res);
duke@435	1066	if (method()->is_strict()) {
duke@435	1067	res = round_fp(res);
duke@435	1068	}
duke@435	1069	push(type, res);
duke@435	1070	}
duke@435	1071
duke@435	1072
duke@435	1073	void GraphBuilder::negate_op(ValueType* type) {
duke@435	1074	push(type, append(new NegateOp(pop(type))));
duke@435	1075	}
duke@435	1076
duke@435	1077
duke@435	1078	void GraphBuilder::shift_op(ValueType* type, Bytecodes::Code code) {
duke@435	1079	Value s = ipop();
duke@435	1080	Value x = pop(type);
duke@435	1081	// try to simplify
duke@435	1082	// Note: This code should go into the canonicalizer as soon as it can
duke@435	1083	// can handle canonicalized forms that contain more than one node.
duke@435	1084	if (CanonicalizeNodes && code == Bytecodes::_iushr) {
duke@435	1085	// pattern: x >>> s
duke@435	1086	IntConstant* s1 = s->type()->as_IntConstant();
duke@435	1087	if (s1 != NULL) {
duke@435	1088	// pattern: x >>> s1, with s1 constant
duke@435	1089	ShiftOp* l = x->as_ShiftOp();
duke@435	1090	if (l != NULL && l->op() == Bytecodes::_ishl) {
duke@435	1091	// pattern: (a << b) >>> s1
duke@435	1092	IntConstant* s0 = l->y()->type()->as_IntConstant();
duke@435	1093	if (s0 != NULL) {
duke@435	1094	// pattern: (a << s0) >>> s1
duke@435	1095	const int s0c = s0->value() & 0x1F; // only the low 5 bits are significant for shifts
duke@435	1096	const int s1c = s1->value() & 0x1F; // only the low 5 bits are significant for shifts
duke@435	1097	if (s0c == s1c) {
duke@435	1098	if (s0c == 0) {
duke@435	1099	// pattern: (a << 0) >>> 0 => simplify to: a
duke@435	1100	ipush(l->x());
duke@435	1101	} else {
duke@435	1102	// pattern: (a << s0c) >>> s0c => simplify to: a & m, with m constant
duke@435	1103	assert(0 < s0c && s0c < BitsPerInt, "adjust code below to handle corner cases");
duke@435	1104	const int m = (1 << (BitsPerInt - s0c)) - 1;
duke@435	1105	Value s = append(new Constant(new IntConstant(m)));
duke@435	1106	ipush(append(new LogicOp(Bytecodes::_iand, l->x(), s)));
duke@435	1107	}
duke@435	1108	return;
duke@435	1109	}
duke@435	1110	}
duke@435	1111	}
duke@435	1112	}
duke@435	1113	}
duke@435	1114	// could not simplify
duke@435	1115	push(type, append(new ShiftOp(code, x, s)));
duke@435	1116	}
duke@435	1117
duke@435	1118
duke@435	1119	void GraphBuilder::logic_op(ValueType* type, Bytecodes::Code code) {
duke@435	1120	Value y = pop(type);
duke@435	1121	Value x = pop(type);
duke@435	1122	push(type, append(new LogicOp(code, x, y)));
duke@435	1123	}
duke@435	1124
duke@435	1125
duke@435	1126	void GraphBuilder::compare_op(ValueType* type, Bytecodes::Code code) {
duke@435	1127	ValueStack* state_before = state()->copy();
duke@435	1128	Value y = pop(type);
duke@435	1129	Value x = pop(type);
duke@435	1130	ipush(append(new CompareOp(code, x, y, state_before)));
duke@435	1131	}
duke@435	1132
duke@435	1133
duke@435	1134	void GraphBuilder::convert(Bytecodes::Code op, BasicType from, BasicType to) {
duke@435	1135	push(as_ValueType(to), append(new Convert(op, pop(as_ValueType(from)), as_ValueType(to))));
duke@435	1136	}
duke@435	1137
duke@435	1138
duke@435	1139	void GraphBuilder::increment() {
duke@435	1140	int index = stream()->get_index();
duke@435	1141	int delta = stream()->is_wide() ? (signed short)Bytes::get_Java_u2(stream()->cur_bcp() + 4) : (signed char)(stream()->cur_bcp()[2]);
duke@435	1142	load_local(intType, index);
duke@435	1143	ipush(append(new Constant(new IntConstant(delta))));
duke@435	1144	arithmetic_op(intType, Bytecodes::_iadd);
duke@435	1145	store_local(intType, index);
duke@435	1146	}
duke@435	1147
duke@435	1148
duke@435	1149	void GraphBuilder::_goto(int from_bci, int to_bci) {
duke@435	1150	profile_bci(from_bci);
duke@435	1151	append(new Goto(block_at(to_bci), to_bci <= from_bci));
duke@435	1152	}
duke@435	1153
duke@435	1154
duke@435	1155	void GraphBuilder::if_node(Value x, If::Condition cond, Value y, ValueStack* state_before) {
duke@435	1156	BlockBegin* tsux = block_at(stream()->get_dest());
duke@435	1157	BlockBegin* fsux = block_at(stream()->next_bci());
duke@435	1158	bool is_bb = tsux->bci() < stream()->cur_bci() || fsux->bci() < stream()->cur_bci();
duke@435	1159	If* if_node = append(new If(x, cond, false, y, tsux, fsux, is_bb ? state_before : NULL, is_bb))->as_If();
duke@435	1160	if (profile_branches() && (if_node != NULL)) {
duke@435	1161	if_node->set_profiled_method(method());
duke@435	1162	if_node->set_profiled_bci(bci());
duke@435	1163	if_node->set_should_profile(true);
duke@435	1164	}
duke@435	1165	}
duke@435	1166
duke@435	1167
duke@435	1168	void GraphBuilder::if_zero(ValueType* type, If::Condition cond) {
duke@435	1169	Value y = append(new Constant(intZero));
duke@435	1170	ValueStack* state_before = state()->copy();
duke@435	1171	Value x = ipop();
duke@435	1172	if_node(x, cond, y, state_before);
duke@435	1173	}
duke@435	1174
duke@435	1175
duke@435	1176	void GraphBuilder::if_null(ValueType* type, If::Condition cond) {
duke@435	1177	Value y = append(new Constant(objectNull));
duke@435	1178	ValueStack* state_before = state()->copy();
duke@435	1179	Value x = apop();
duke@435	1180	if_node(x, cond, y, state_before);
duke@435	1181	}
duke@435	1182
duke@435	1183
duke@435	1184	void GraphBuilder::if_same(ValueType* type, If::Condition cond) {
duke@435	1185	ValueStack* state_before = state()->copy();
duke@435	1186	Value y = pop(type);
duke@435	1187	Value x = pop(type);
duke@435	1188	if_node(x, cond, y, state_before);
duke@435	1189	}
duke@435	1190
duke@435	1191
duke@435	1192	void GraphBuilder::jsr(int dest) {
duke@435	1193	// We only handle well-formed jsrs (those which are "block-structured").
duke@435	1194	// If the bytecodes are strange (jumping out of a jsr block) then we
duke@435	1195	// might end up trying to re-parse a block containing a jsr which
duke@435	1196	// has already been activated. Watch for this case and bail out.
duke@435	1197	for (ScopeData* cur_scope_data = scope_data();
duke@435	1198	cur_scope_data != NULL && cur_scope_data->parsing_jsr() && cur_scope_data->scope() == scope();
duke@435	1199	cur_scope_data = cur_scope_data->parent()) {
duke@435	1200	if (cur_scope_data->jsr_entry_bci() == dest) {
duke@435	1201	BAILOUT("too-complicated jsr/ret structure");
duke@435	1202	}
duke@435	1203	}
duke@435	1204
duke@435	1205	push(addressType, append(new Constant(new AddressConstant(next_bci()))));
duke@435	1206	if (!try_inline_jsr(dest)) {
duke@435	1207	return; // bailed out while parsing and inlining subroutine
duke@435	1208	}
duke@435	1209	}
duke@435	1210
duke@435	1211
duke@435	1212	void GraphBuilder::ret(int local_index) {
duke@435	1213	if (!parsing_jsr()) BAILOUT("ret encountered while not parsing subroutine");
duke@435	1214
duke@435	1215	if (local_index != scope_data()->jsr_return_address_local()) {
duke@435	1216	BAILOUT("can not handle complicated jsr/ret constructs");
duke@435	1217	}
duke@435	1218
duke@435	1219	// Rets simply become (NON-SAFEPOINT) gotos to the jsr continuation
duke@435	1220	append(new Goto(scope_data()->jsr_continuation(), false));
duke@435	1221	}
duke@435	1222
duke@435	1223
duke@435	1224	void GraphBuilder::table_switch() {
duke@435	1225	Bytecode_tableswitch* switch_ = Bytecode_tableswitch_at(method()->code() + bci());
duke@435	1226	const int l = switch_->length();
duke@435	1227	if (CanonicalizeNodes && l == 1) {
duke@435	1228	// total of 2 successors => use If instead of switch
duke@435	1229	// Note: This code should go into the canonicalizer as soon as it can
duke@435	1230	// can handle canonicalized forms that contain more than one node.
duke@435	1231	Value key = append(new Constant(new IntConstant(switch_->low_key())));
duke@435	1232	BlockBegin* tsux = block_at(bci() + switch_->dest_offset_at(0));
duke@435	1233	BlockBegin* fsux = block_at(bci() + switch_->default_offset());
duke@435	1234	bool is_bb = tsux->bci() < bci() || fsux->bci() < bci();
duke@435	1235	ValueStack* state_before = is_bb ? state() : NULL;
duke@435	1236	append(new If(ipop(), If::eql, true, key, tsux, fsux, state_before, is_bb));
duke@435	1237	} else {
duke@435	1238	// collect successors
duke@435	1239	BlockList* sux = new BlockList(l + 1, NULL);
duke@435	1240	int i;
duke@435	1241	bool has_bb = false;
duke@435	1242	for (i = 0; i < l; i++) {
duke@435	1243	sux->at_put(i, block_at(bci() + switch_->dest_offset_at(i)));
duke@435	1244	if (switch_->dest_offset_at(i) < 0) has_bb = true;
duke@435	1245	}
duke@435	1246	// add default successor
duke@435	1247	sux->at_put(i, block_at(bci() + switch_->default_offset()));
duke@435	1248	ValueStack* state_before = has_bb ? state() : NULL;
duke@435	1249	append(new TableSwitch(ipop(), sux, switch_->low_key(), state_before, has_bb));
duke@435	1250	}
duke@435	1251	}
duke@435	1252
duke@435	1253
duke@435	1254	void GraphBuilder::lookup_switch() {
duke@435	1255	Bytecode_lookupswitch* switch_ = Bytecode_lookupswitch_at(method()->code() + bci());
duke@435	1256	const int l = switch_->number_of_pairs();
duke@435	1257	if (CanonicalizeNodes && l == 1) {
duke@435	1258	// total of 2 successors => use If instead of switch
duke@435	1259	// Note: This code should go into the canonicalizer as soon as it can
duke@435	1260	// can handle canonicalized forms that contain more than one node.
duke@435	1261	// simplify to If
duke@435	1262	LookupswitchPair* pair = switch_->pair_at(0);
duke@435	1263	Value key = append(new Constant(new IntConstant(pair->match())));
duke@435	1264	BlockBegin* tsux = block_at(bci() + pair->offset());
duke@435	1265	BlockBegin* fsux = block_at(bci() + switch_->default_offset());
duke@435	1266	bool is_bb = tsux->bci() < bci() || fsux->bci() < bci();
duke@435	1267	ValueStack* state_before = is_bb ? state() : NULL;
duke@435	1268	append(new If(ipop(), If::eql, true, key, tsux, fsux, state_before, is_bb));
duke@435	1269	} else {
duke@435	1270	// collect successors & keys
duke@435	1271	BlockList* sux = new BlockList(l + 1, NULL);
duke@435	1272	intArray* keys = new intArray(l, 0);
duke@435	1273	int i;
duke@435	1274	bool has_bb = false;
duke@435	1275	for (i = 0; i < l; i++) {
duke@435	1276	LookupswitchPair* pair = switch_->pair_at(i);
duke@435	1277	if (pair->offset() < 0) has_bb = true;
duke@435	1278	sux->at_put(i, block_at(bci() + pair->offset()));
duke@435	1279	keys->at_put(i, pair->match());
duke@435	1280	}
duke@435	1281	// add default successor
duke@435	1282	sux->at_put(i, block_at(bci() + switch_->default_offset()));
duke@435	1283	ValueStack* state_before = has_bb ? state() : NULL;
duke@435	1284	append(new LookupSwitch(ipop(), sux, keys, state_before, has_bb));
duke@435	1285	}
duke@435	1286	}
duke@435	1287
duke@435	1288	void GraphBuilder::call_register_finalizer() {
duke@435	1289	// If the receiver requires finalization then emit code to perform
duke@435	1290	// the registration on return.
duke@435	1291
duke@435	1292	// Gather some type information about the receiver
duke@435	1293	Value receiver = state()->load_local(0);
duke@435	1294	assert(receiver != NULL, "must have a receiver");
duke@435	1295	ciType* declared_type = receiver->declared_type();
duke@435	1296	ciType* exact_type = receiver->exact_type();
duke@435	1297	if (exact_type == NULL &&
duke@435	1298	receiver->as_Local() &&
duke@435	1299	receiver->as_Local()->java_index() == 0) {
duke@435	1300	ciInstanceKlass* ik = compilation()->method()->holder();
duke@435	1301	if (ik->is_final()) {
duke@435	1302	exact_type = ik;
duke@435	1303	} else if (UseCHA && !(ik->has_subklass() || ik->is_interface())) {
duke@435	1304	// test class is leaf class
duke@435	1305	compilation()->dependency_recorder()->assert_leaf_type(ik);
duke@435	1306	exact_type = ik;
duke@435	1307	} else {
duke@435	1308	declared_type = ik;
duke@435	1309	}
duke@435	1310	}
duke@435	1311
duke@435	1312	// see if we know statically that registration isn't required
duke@435	1313	bool needs_check = true;
duke@435	1314	if (exact_type != NULL) {
duke@435	1315	needs_check = exact_type->as_instance_klass()->has_finalizer();
duke@435	1316	} else if (declared_type != NULL) {
duke@435	1317	ciInstanceKlass* ik = declared_type->as_instance_klass();
duke@435	1318	if (!Dependencies::has_finalizable_subclass(ik)) {
duke@435	1319	compilation()->dependency_recorder()->assert_has_no_finalizable_subclasses(ik);
duke@435	1320	needs_check = false;
duke@435	1321	}
duke@435	1322	}
duke@435	1323
duke@435	1324	if (needs_check) {
duke@435	1325	// Perform the registration of finalizable objects.
duke@435	1326	load_local(objectType, 0);
duke@435	1327	append_split(new Intrinsic(voidType, vmIntrinsics::_Object_init,
duke@435	1328	state()->pop_arguments(1),
duke@435	1329	true, lock_stack(), true));
duke@435	1330	}
duke@435	1331	}
duke@435	1332
duke@435	1333
duke@435	1334	void GraphBuilder::method_return(Value x) {
duke@435	1335	if (RegisterFinalizersAtInit &&
duke@435	1336	method()->intrinsic_id() == vmIntrinsics::_Object_init) {
duke@435	1337	call_register_finalizer();
duke@435	1338	}
duke@435	1339
duke@435	1340	// Check to see whether we are inlining. If so, Return
duke@435	1341	// instructions become Gotos to the continuation point.
duke@435	1342	if (continuation() != NULL) {
duke@435	1343	assert(!method()->is_synchronized() || InlineSynchronizedMethods, "can not inline synchronized methods yet");
duke@435	1344
duke@435	1345	// If the inlined method is synchronized, the monitor must be
duke@435	1346	// released before we jump to the continuation block.
duke@435	1347	if (method()->is_synchronized()) {
duke@435	1348	int i = state()->caller_state()->locks_size();
duke@435	1349	assert(state()->locks_size() == i + 1, "receiver must be locked here");
duke@435	1350	monitorexit(state()->lock_at(i), SynchronizationEntryBCI);
duke@435	1351	}
duke@435	1352
duke@435	1353	state()->truncate_stack(caller_stack_size());
duke@435	1354	if (x != NULL) {
duke@435	1355	state()->push(x->type(), x);
duke@435	1356	}
duke@435	1357	Goto* goto_callee = new Goto(continuation(), false);
duke@435	1358
duke@435	1359	// See whether this is the first return; if so, store off some
duke@435	1360	// of the state for later examination
duke@435	1361	if (num_returns() == 0) {
duke@435	1362	set_inline_cleanup_info(_block, _last, state());
duke@435	1363	}
duke@435	1364
duke@435	1365	// State at end of inlined method is the state of the caller
duke@435	1366	// without the method parameters on stack, including the
duke@435	1367	// return value, if any, of the inlined method on operand stack.
duke@435	1368	set_state(scope_data()->continuation_state()->copy());
duke@435	1369	if (x) {
duke@435	1370	state()->push(x->type(), x);
duke@435	1371	}
duke@435	1372
duke@435	1373	// The current bci() is in the wrong scope, so use the bci() of
duke@435	1374	// the continuation point.
duke@435	1375	append_with_bci(goto_callee, scope_data()->continuation()->bci());
duke@435	1376	incr_num_returns();
duke@435	1377
duke@435	1378	return;
duke@435	1379	}
duke@435	1380
duke@435	1381	state()->truncate_stack(0);
duke@435	1382	if (method()->is_synchronized()) {
duke@435	1383	// perform the unlocking before exiting the method
duke@435	1384	Value receiver;
duke@435	1385	if (!method()->is_static()) {
duke@435	1386	receiver = _initial_state->local_at(0);
duke@435	1387	} else {
duke@435	1388	receiver = append(new Constant(new ClassConstant(method()->holder())));
duke@435	1389	}
duke@435	1390	append_split(new MonitorExit(receiver, state()->unlock()));
duke@435	1391	}
duke@435	1392
duke@435	1393	append(new Return(x));
duke@435	1394	}
duke@435	1395
duke@435	1396
duke@435	1397	void GraphBuilder::access_field(Bytecodes::Code code) {
duke@435	1398	bool will_link;
duke@435	1399	ciField* field = stream()->get_field(will_link);
duke@435	1400	ciInstanceKlass* holder = field->holder();
duke@435	1401	BasicType field_type = field->type()->basic_type();
duke@435	1402	ValueType* type = as_ValueType(field_type);
duke@435	1403	// call will_link again to determine if the field is valid.
duke@435	1404	const bool is_loaded = holder->is_loaded() &&
duke@435	1405	field->will_link(method()->holder(), code);
duke@435	1406	const bool is_initialized = is_loaded && holder->is_initialized();
duke@435	1407
duke@435	1408	ValueStack* state_copy = NULL;
duke@435	1409	if (!is_initialized || PatchALot) {
duke@435	1410	// save state before instruction for debug info when
duke@435	1411	// deoptimization happens during patching
duke@435	1412	state_copy = state()->copy();
duke@435	1413	}
duke@435	1414
duke@435	1415	Value obj = NULL;
duke@435	1416	if (code == Bytecodes::_getstatic || code == Bytecodes::_putstatic) {
duke@435	1417	// commoning of class constants should only occur if the class is
duke@435	1418	// fully initialized and resolved in this constant pool. The will_link test
duke@435	1419	// above essentially checks if this class is resolved in this constant pool
duke@435	1420	// so, the is_initialized flag should be suffiect.
duke@435	1421	if (state_copy != NULL) {
duke@435	1422	// build a patching constant
duke@435	1423	obj = new Constant(new ClassConstant(holder), state_copy);
duke@435	1424	} else {
duke@435	1425	obj = new Constant(new ClassConstant(holder));
duke@435	1426	}
duke@435	1427	}
duke@435	1428
duke@435	1429
duke@435	1430	const int offset = is_loaded ? field->offset() : -1;
duke@435	1431	switch (code) {
duke@435	1432	case Bytecodes::_getstatic: {
duke@435	1433	// check for compile-time constants, i.e., initialized static final fields
duke@435	1434	Instruction* constant = NULL;
duke@435	1435	if (field->is_constant() && !PatchALot) {
duke@435	1436	ciConstant field_val = field->constant_value();
duke@435	1437	BasicType field_type = field_val.basic_type();
duke@435	1438	switch (field_type) {
duke@435	1439	case T_ARRAY:
duke@435	1440	case T_OBJECT:
jrose@1424	1441	if (field_val.as_object()->should_be_constant()) {
duke@435	1442	constant = new Constant(as_ValueType(field_val));
duke@435	1443	}
duke@435	1444	break;
duke@435	1445
duke@435	1446	default:
duke@435	1447	constant = new Constant(as_ValueType(field_val));
duke@435	1448	}
duke@435	1449	}
duke@435	1450	if (constant != NULL) {
duke@435	1451	push(type, append(constant));
duke@435	1452	state_copy = NULL; // Not a potential deoptimization point (see set_state_before logic below)
duke@435	1453	} else {
duke@435	1454	push(type, append(new LoadField(append(obj), offset, field, true,
duke@435	1455	lock_stack(), state_copy, is_loaded, is_initialized)));
duke@435	1456	}
duke@435	1457	break;
duke@435	1458	}
duke@435	1459	case Bytecodes::_putstatic:
duke@435	1460	{ Value val = pop(type);
duke@435	1461	append(new StoreField(append(obj), offset, field, val, true, lock_stack(), state_copy, is_loaded, is_initialized));
duke@435	1462	}
duke@435	1463	break;
duke@435	1464	case Bytecodes::_getfield :
duke@435	1465	{
duke@435	1466	LoadField* load = new LoadField(apop(), offset, field, false, lock_stack(), state_copy, is_loaded, true);
duke@435	1467	Value replacement = is_loaded ? _memory->load(load) : load;
duke@435	1468	if (replacement != load) {
duke@435	1469	assert(replacement->bci() != -99 || replacement->as_Phi() || replacement->as_Local(),
duke@435	1470	"should already by linked");
duke@435	1471	push(type, replacement);
duke@435	1472	} else {
duke@435	1473	push(type, append(load));
duke@435	1474	}
duke@435	1475	break;
duke@435	1476	}
duke@435	1477
duke@435	1478	case Bytecodes::_putfield :
duke@435	1479	{ Value val = pop(type);
duke@435	1480	StoreField* store = new StoreField(apop(), offset, field, val, false, lock_stack(), state_copy, is_loaded, true);
duke@435	1481	if (is_loaded) store = _memory->store(store);
duke@435	1482	if (store != NULL) {
duke@435	1483	append(store);
duke@435	1484	}
duke@435	1485	}
duke@435	1486	break;
duke@435	1487	default :
duke@435	1488	ShouldNotReachHere();
duke@435	1489	break;
duke@435	1490	}
duke@435	1491	}
duke@435	1492
duke@435	1493
duke@435	1494	Dependencies* GraphBuilder::dependency_recorder() const {
duke@435	1495	assert(DeoptC1, "need debug information");
duke@435	1496	return compilation()->dependency_recorder();
duke@435	1497	}
duke@435	1498
duke@435	1499
duke@435	1500	void GraphBuilder::invoke(Bytecodes::Code code) {
duke@435	1501	bool will_link;
duke@435	1502	ciMethod* target = stream()->get_method(will_link);
duke@435	1503	// we have to make sure the argument size (incl. the receiver)
duke@435	1504	// is correct for compilation (the call would fail later during
duke@435	1505	// linkage anyway) - was bug (gri 7/28/99)
duke@435	1506	if (target->is_loaded() && target->is_static() != (code == Bytecodes::_invokestatic)) BAILOUT("will cause link error");
duke@435	1507	ciInstanceKlass* klass = target->holder();
duke@435	1508
duke@435	1509	// check if CHA possible: if so, change the code to invoke_special
duke@435	1510	ciInstanceKlass* calling_klass = method()->holder();
duke@435	1511	ciKlass* holder = stream()->get_declared_method_holder();
duke@435	1512	ciInstanceKlass* callee_holder = ciEnv::get_instance_klass_for_declared_method_holder(holder);
duke@435	1513	ciInstanceKlass* actual_recv = callee_holder;
duke@435	1514
duke@435	1515	// some methods are obviously bindable without any type checks so
duke@435	1516	// convert them directly to an invokespecial.
duke@435	1517	if (target->is_loaded() && !target->is_abstract() &&
duke@435	1518	target->can_be_statically_bound() && code == Bytecodes::_invokevirtual) {
duke@435	1519	code = Bytecodes::_invokespecial;
duke@435	1520	}
duke@435	1521
duke@435	1522	// NEEDS_CLEANUP
duke@435	1523	// I've added the target-is_loaded() test below but I don't really understand
duke@435	1524	// how klass->is_loaded() can be true and yet target->is_loaded() is false.
duke@435	1525	// this happened while running the JCK invokevirtual tests under doit. TKR
duke@435	1526	ciMethod* cha_monomorphic_target = NULL;
duke@435	1527	ciMethod* exact_target = NULL;
twisti@1730	1528	if (UseCHA && DeoptC1 && klass->is_loaded() && target->is_loaded() &&
twisti@1730	1529	!target->is_method_handle_invoke()) {
duke@435	1530	Value receiver = NULL;
duke@435	1531	ciInstanceKlass* receiver_klass = NULL;
duke@435	1532	bool type_is_exact = false;
duke@435	1533	// try to find a precise receiver type
duke@435	1534	if (will_link && !target->is_static()) {
duke@435	1535	int index = state()->stack_size() - (target->arg_size_no_receiver() + 1);
duke@435	1536	receiver = state()->stack_at(index);
duke@435	1537	ciType* type = receiver->exact_type();
duke@435	1538	if (type != NULL && type->is_loaded() &&
duke@435	1539	type->is_instance_klass() && !type->as_instance_klass()->is_interface()) {
duke@435	1540	receiver_klass = (ciInstanceKlass*) type;
duke@435	1541	type_is_exact = true;
duke@435	1542	}
duke@435	1543	if (type == NULL) {
duke@435	1544	type = receiver->declared_type();
duke@435	1545	if (type != NULL && type->is_loaded() &&
duke@435	1546	type->is_instance_klass() && !type->as_instance_klass()->is_interface()) {
duke@435	1547	receiver_klass = (ciInstanceKlass*) type;
duke@435	1548	if (receiver_klass->is_leaf_type() && !receiver_klass->is_final()) {
duke@435	1549	// Insert a dependency on this type since
duke@435	1550	// find_monomorphic_target may assume it's already done.
duke@435	1551	dependency_recorder()->assert_leaf_type(receiver_klass);
duke@435	1552	type_is_exact = true;
duke@435	1553	}
duke@435	1554	}
duke@435	1555	}
duke@435	1556	}
duke@435	1557	if (receiver_klass != NULL && type_is_exact &&
duke@435	1558	receiver_klass->is_loaded() && code != Bytecodes::_invokespecial) {
duke@435	1559	// If we have the exact receiver type we can bind directly to
duke@435	1560	// the method to call.
duke@435	1561	exact_target = target->resolve_invoke(calling_klass, receiver_klass);
duke@435	1562	if (exact_target != NULL) {
duke@435	1563	target = exact_target;
duke@435	1564	code = Bytecodes::_invokespecial;
duke@435	1565	}
duke@435	1566	}
duke@435	1567	if (receiver_klass != NULL &&
duke@435	1568	receiver_klass->is_subtype_of(actual_recv) &&
duke@435	1569	actual_recv->is_initialized()) {
duke@435	1570	actual_recv = receiver_klass;
duke@435	1571	}
duke@435	1572
duke@435	1573	if ((code == Bytecodes::_invokevirtual && callee_holder->is_initialized()) ||
duke@435	1574	(code == Bytecodes::_invokeinterface && callee_holder->is_initialized() && !actual_recv->is_interface())) {
duke@435	1575	// Use CHA on the receiver to select a more precise method.
duke@435	1576	cha_monomorphic_target = target->find_monomorphic_target(calling_klass, callee_holder, actual_recv);
duke@435	1577	} else if (code == Bytecodes::_invokeinterface && callee_holder->is_loaded() && receiver != NULL) {
duke@435	1578	// if there is only one implementor of this interface then we
duke@435	1579	// may be able bind this invoke directly to the implementing
duke@435	1580	// klass but we need both a dependence on the single interface
duke@435	1581	// and on the method we bind to. Additionally since all we know
duke@435	1582	// about the receiver type is the it's supposed to implement the
duke@435	1583	// interface we have to insert a check that it's the class we
duke@435	1584	// expect. Interface types are not checked by the verifier so
duke@435	1585	// they are roughly equivalent to Object.
duke@435	1586	ciInstanceKlass* singleton = NULL;
duke@435	1587	if (target->holder()->nof_implementors() == 1) {
duke@435	1588	singleton = target->holder()->implementor(0);
duke@435	1589	}
duke@435	1590	if (singleton) {
duke@435	1591	cha_monomorphic_target = target->find_monomorphic_target(calling_klass, target->holder(), singleton);
duke@435	1592	if (cha_monomorphic_target != NULL) {
duke@435	1593	// If CHA is able to bind this invoke then update the class
duke@435	1594	// to match that class, otherwise klass will refer to the
duke@435	1595	// interface.
duke@435	1596	klass = cha_monomorphic_target->holder();
duke@435	1597	actual_recv = target->holder();
duke@435	1598
duke@435	1599	// insert a check it's really the expected class.
duke@435	1600	CheckCast* c = new CheckCast(klass, receiver, NULL);
duke@435	1601	c->set_incompatible_class_change_check();
duke@435	1602	c->set_direct_compare(klass->is_final());
duke@435	1603	append_split(c);
duke@435	1604	}
duke@435	1605	}
duke@435	1606	}
duke@435	1607	}
duke@435	1608
duke@435	1609	if (cha_monomorphic_target != NULL) {
duke@435	1610	if (cha_monomorphic_target->is_abstract()) {
duke@435	1611	// Do not optimize for abstract methods
duke@435	1612	cha_monomorphic_target = NULL;
duke@435	1613	}
duke@435	1614	}
duke@435	1615
duke@435	1616	if (cha_monomorphic_target != NULL) {
duke@435	1617	if (!(target->is_final_method())) {
duke@435	1618	// If we inlined because CHA revealed only a single target method,
duke@435	1619	// then we are dependent on that target method not getting overridden
duke@435	1620	// by dynamic class loading. Be sure to test the "static" receiver
duke@435	1621	// dest_method here, as opposed to the actual receiver, which may
duke@435	1622	// falsely lead us to believe that the receiver is final or private.
duke@435	1623	dependency_recorder()->assert_unique_concrete_method(actual_recv, cha_monomorphic_target);
duke@435	1624	}
duke@435	1625	code = Bytecodes::_invokespecial;
duke@435	1626	}
duke@435	1627	// check if we could do inlining
duke@435	1628	if (!PatchALot && Inline && klass->is_loaded() &&
duke@435	1629	(klass->is_initialized() || klass->is_interface() && target->holder()->is_initialized())
duke@435	1630	&& target->will_link(klass, callee_holder, code)) {
duke@435	1631	// callee is known => check if we have static binding
duke@435	1632	assert(target->is_loaded(), "callee must be known");
duke@435	1633	if (code == Bytecodes::_invokestatic
duke@435	1634	|| code == Bytecodes::_invokespecial
duke@435	1635	|| code == Bytecodes::_invokevirtual && target->is_final_method()
duke@435	1636	) {
duke@435	1637	// static binding => check if callee is ok
duke@435	1638	ciMethod* inline_target = (cha_monomorphic_target != NULL)
duke@435	1639	? cha_monomorphic_target
duke@435	1640	: target;
duke@435	1641	bool res = try_inline(inline_target, (cha_monomorphic_target != NULL) || (exact_target != NULL));
duke@435	1642	CHECK_BAILOUT();
duke@435	1643
duke@435	1644	#ifndef PRODUCT
duke@435	1645	// printing
duke@435	1646	if (PrintInlining && !res) {
duke@435	1647	// if it was successfully inlined, then it was already printed.
duke@435	1648	print_inline_result(inline_target, res);
duke@435	1649	}
duke@435	1650	#endif
duke@435	1651	clear_inline_bailout();
duke@435	1652	if (res) {
duke@435	1653	// Register dependence if JVMTI has either breakpoint
duke@435	1654	// setting or hotswapping of methods capabilities since they may
duke@435	1655	// cause deoptimization.
kvn@1215	1656	if (compilation()->env()->jvmti_can_hotswap_or_post_breakpoint()) {
duke@435	1657	dependency_recorder()->assert_evol_method(inline_target);
duke@435	1658	}
duke@435	1659	return;
duke@435	1660	}
duke@435	1661	}
duke@435	1662	}
duke@435	1663	// If we attempted an inline which did not succeed because of a
duke@435	1664	// bailout during construction of the callee graph, the entire
duke@435	1665	// compilation has to be aborted. This is fairly rare and currently
duke@435	1666	// seems to only occur for jasm-generated classes which contain
duke@435	1667	// jsr/ret pairs which are not associated with finally clauses and
duke@435	1668	// do not have exception handlers in the containing method, and are
duke@435	1669	// therefore not caught early enough to abort the inlining without
duke@435	1670	// corrupting the graph. (We currently bail out with a non-empty
duke@435	1671	// stack at a ret in these situations.)
duke@435	1672	CHECK_BAILOUT();
duke@435	1673
duke@435	1674	// inlining not successful => standard invoke
twisti@1730	1675	bool is_loaded = target->is_loaded();
twisti@1730	1676	bool has_receiver =
twisti@1730	1677	code == Bytecodes::_invokespecial ||
twisti@1730	1678	code == Bytecodes::_invokevirtual ||
twisti@1730	1679	code == Bytecodes::_invokeinterface;
twisti@1730	1680	bool is_invokedynamic = code == Bytecodes::_invokedynamic;
duke@435	1681	ValueType* result_type = as_ValueType(target->return_type());
twisti@1730	1682
twisti@1730	1683	// We require the debug info to be the "state before" because
twisti@1730	1684	// invokedynamics may deoptimize.
twisti@1730	1685	ValueStack* state_before = is_invokedynamic ? state()->copy() : NULL;
twisti@1730	1686
duke@435	1687	Values* args = state()->pop_arguments(target->arg_size_no_receiver());
twisti@1730	1688	Value recv = has_receiver ? apop() : NULL;
duke@435	1689	int vtable_index = methodOopDesc::invalid_vtable_index;
duke@435	1690
duke@435	1691	#ifdef SPARC
duke@435	1692	// Currently only supported on Sparc.
duke@435	1693	// The UseInlineCaches only controls dispatch to invokevirtuals for
duke@435	1694	// loaded classes which we weren't able to statically bind.
duke@435	1695	if (!UseInlineCaches && is_loaded && code == Bytecodes::_invokevirtual
duke@435	1696	&& !target->can_be_statically_bound()) {
duke@435	1697	// Find a vtable index if one is available
duke@435	1698	vtable_index = target->resolve_vtable_index(calling_klass, callee_holder);
duke@435	1699	}
duke@435	1700	#endif
duke@435	1701
duke@435	1702	if (recv != NULL &&
duke@435	1703	(code == Bytecodes::_invokespecial ||
duke@435	1704	!is_loaded || target->is_final() ||
duke@435	1705	profile_calls())) {
duke@435	1706	// invokespecial always needs a NULL check. invokevirtual where
duke@435	1707	// the target is final or where it's not known that whether the
duke@435	1708	// target is final requires a NULL check. Otherwise normal
duke@435	1709	// invokevirtual will perform the null check during the lookup
duke@435	1710	// logic or the unverified entry point. Profiling of calls
duke@435	1711	// requires that the null check is performed in all cases.
duke@435	1712	null_check(recv);
duke@435	1713	}
duke@435	1714
duke@435	1715	if (profile_calls()) {
duke@435	1716	assert(cha_monomorphic_target == NULL || exact_target == NULL, "both can not be set");
duke@435	1717	ciKlass* target_klass = NULL;
duke@435	1718	if (cha_monomorphic_target != NULL) {
duke@435	1719	target_klass = cha_monomorphic_target->holder();
duke@435	1720	} else if (exact_target != NULL) {
duke@435	1721	target_klass = exact_target->holder();
duke@435	1722	}
duke@435	1723	profile_call(recv, target_klass);
duke@435	1724	}
duke@435	1725
twisti@1730	1726	Invoke* result = new Invoke(code, result_type, recv, args, vtable_index, target, state_before);
duke@435	1727	// push result
duke@435	1728	append_split(result);
duke@435	1729
duke@435	1730	if (result_type != voidType) {
duke@435	1731	if (method()->is_strict()) {
duke@435	1732	push(result_type, round_fp(result));
duke@435	1733	} else {
duke@435	1734	push(result_type, result);
duke@435	1735	}
duke@435	1736	}
duke@435	1737	}
duke@435	1738
duke@435	1739
duke@435	1740	void GraphBuilder::new_instance(int klass_index) {
duke@435	1741	bool will_link;
duke@435	1742	ciKlass* klass = stream()->get_klass(will_link);
duke@435	1743	assert(klass->is_instance_klass(), "must be an instance klass");
duke@435	1744	NewInstance* new_instance = new NewInstance(klass->as_instance_klass());
duke@435	1745	_memory->new_instance(new_instance);
duke@435	1746	apush(append_split(new_instance));
duke@435	1747	}
duke@435	1748
duke@435	1749
duke@435	1750	void GraphBuilder::new_type_array() {
duke@435	1751	apush(append_split(new NewTypeArray(ipop(), (BasicType)stream()->get_index())));
duke@435	1752	}
duke@435	1753
duke@435	1754
duke@435	1755	void GraphBuilder::new_object_array() {
duke@435	1756	bool will_link;
duke@435	1757	ciKlass* klass = stream()->get_klass(will_link);
duke@435	1758	ValueStack* state_before = !klass->is_loaded() || PatchALot ? state()->copy() : NULL;
duke@435	1759	NewArray* n = new NewObjectArray(klass, ipop(), state_before);
duke@435	1760	apush(append_split(n));
duke@435	1761	}
duke@435	1762
duke@435	1763
duke@435	1764	bool GraphBuilder::direct_compare(ciKlass* k) {
duke@435	1765	if (k->is_loaded() && k->is_instance_klass() && !UseSlowPath) {
duke@435	1766	ciInstanceKlass* ik = k->as_instance_klass();
duke@435	1767	if (ik->is_final()) {
duke@435	1768	return true;
duke@435	1769	} else {
duke@435	1770	if (DeoptC1 && UseCHA && !(ik->has_subklass() || ik->is_interface())) {
duke@435	1771	// test class is leaf class
duke@435	1772	dependency_recorder()->assert_leaf_type(ik);
duke@435	1773	return true;
duke@435	1774	}
duke@435	1775	}
duke@435	1776	}
duke@435	1777	return false;
duke@435	1778	}
duke@435	1779
duke@435	1780
duke@435	1781	void GraphBuilder::check_cast(int klass_index) {
duke@435	1782	bool will_link;
duke@435	1783	ciKlass* klass = stream()->get_klass(will_link);
duke@435	1784	ValueStack* state_before = !klass->is_loaded() || PatchALot ? state()->copy() : NULL;
duke@435	1785	CheckCast* c = new CheckCast(klass, apop(), state_before);
duke@435	1786	apush(append_split(c));
duke@435	1787	c->set_direct_compare(direct_compare(klass));
duke@435	1788	if (profile_checkcasts()) {
duke@435	1789	c->set_profiled_method(method());
duke@435	1790	c->set_profiled_bci(bci());
duke@435	1791	c->set_should_profile(true);
duke@435	1792	}
duke@435	1793	}
duke@435	1794
duke@435	1795
duke@435	1796	void GraphBuilder::instance_of(int klass_index) {
duke@435	1797	bool will_link;
duke@435	1798	ciKlass* klass = stream()->get_klass(will_link);
duke@435	1799	ValueStack* state_before = !klass->is_loaded() || PatchALot ? state()->copy() : NULL;
duke@435	1800	InstanceOf* i = new InstanceOf(klass, apop(), state_before);
duke@435	1801	ipush(append_split(i));
duke@435	1802	i->set_direct_compare(direct_compare(klass));
duke@435	1803	}
duke@435	1804
duke@435	1805
duke@435	1806	void GraphBuilder::monitorenter(Value x, int bci) {
duke@435	1807	// save state before locking in case of deoptimization after a NullPointerException
duke@435	1808	ValueStack* lock_stack_before = lock_stack();
duke@435	1809	append_with_bci(new MonitorEnter(x, state()->lock(scope(), x), lock_stack_before), bci);
duke@435	1810	kill_all();
duke@435	1811	}
duke@435	1812
duke@435	1813
duke@435	1814	void GraphBuilder::monitorexit(Value x, int bci) {
duke@435	1815	// Note: the comment below is only relevant for the case where we do
duke@435	1816	// not deoptimize due to asynchronous exceptions (!(DeoptC1 &&
duke@435	1817	// DeoptOnAsyncException), which is not used anymore)
duke@435	1818
duke@435	1819	// Note: Potentially, the monitor state in an exception handler
duke@435	1820	// can be wrong due to wrong 'initialization' of the handler
duke@435	1821	// via a wrong asynchronous exception path. This can happen,
duke@435	1822	// if the exception handler range for asynchronous exceptions
duke@435	1823	// is too long (see also java bug 4327029, and comment in
duke@435	1824	// GraphBuilder::handle_exception()). This may cause 'under-
duke@435	1825	// flow' of the monitor stack => bailout instead.
duke@435	1826	if (state()->locks_size() < 1) BAILOUT("monitor stack underflow");
duke@435	1827	append_with_bci(new MonitorExit(x, state()->unlock()), bci);
duke@435	1828	kill_all();
duke@435	1829	}
duke@435	1830
duke@435	1831
duke@435	1832	void GraphBuilder::new_multi_array(int dimensions) {
duke@435	1833	bool will_link;
duke@435	1834	ciKlass* klass = stream()->get_klass(will_link);
duke@435	1835	ValueStack* state_before = !klass->is_loaded() || PatchALot ? state()->copy() : NULL;
duke@435	1836
duke@435	1837	Values* dims = new Values(dimensions, NULL);
duke@435	1838	// fill in all dimensions
duke@435	1839	int i = dimensions;
duke@435	1840	while (i-- > 0) dims->at_put(i, ipop());
duke@435	1841	// create array
duke@435	1842	NewArray* n = new NewMultiArray(klass, dims, state_before);
duke@435	1843	apush(append_split(n));
duke@435	1844	}
duke@435	1845
duke@435	1846
duke@435	1847	void GraphBuilder::throw_op(int bci) {
duke@435	1848	// We require that the debug info for a Throw be the "state before"
duke@435	1849	// the Throw (i.e., exception oop is still on TOS)
duke@435	1850	ValueStack* state_before = state()->copy();
duke@435	1851	Throw* t = new Throw(apop(), state_before);
duke@435	1852	append_with_bci(t, bci);
duke@435	1853	}
duke@435	1854
duke@435	1855
duke@435	1856	Value GraphBuilder::round_fp(Value fp_value) {
duke@435	1857	// no rounding needed if SSE2 is used
duke@435	1858	if (RoundFPResults && UseSSE < 2) {
duke@435	1859	// Must currently insert rounding node for doubleword values that
duke@435	1860	// are results of expressions (i.e., not loads from memory or
duke@435	1861	// constants)
duke@435	1862	if (fp_value->type()->tag() == doubleTag &&
duke@435	1863	fp_value->as_Constant() == NULL &&
duke@435	1864	fp_value->as_Local() == NULL && // method parameters need no rounding
duke@435	1865	fp_value->as_RoundFP() == NULL) {
duke@435	1866	return append(new RoundFP(fp_value));
duke@435	1867	}
duke@435	1868	}
duke@435	1869	return fp_value;
duke@435	1870	}
duke@435	1871
duke@435	1872
duke@435	1873	Instruction* GraphBuilder::append_with_bci(Instruction* instr, int bci) {
duke@435	1874	Canonicalizer canon(instr, bci);
duke@435	1875	Instruction* i1 = canon.canonical();
duke@435	1876	if (i1->bci() != -99) {
duke@435	1877	// Canonicalizer returned an instruction which was already
duke@435	1878	// appended so simply return it.
duke@435	1879	return i1;
duke@435	1880	} else if (UseLocalValueNumbering) {
duke@435	1881	// Lookup the instruction in the ValueMap and add it to the map if
duke@435	1882	// it's not found.
duke@435	1883	Instruction* i2 = vmap()->find_insert(i1);
duke@435	1884	if (i2 != i1) {
duke@435	1885	// found an entry in the value map, so just return it.
duke@435	1886	assert(i2->bci() != -1, "should already be linked");
duke@435	1887	return i2;
duke@435	1888	}
never@894	1889	ValueNumberingEffects vne(vmap());
never@894	1890	i1->visit(&vne);
duke@435	1891	}
duke@435	1892
duke@435	1893	if (i1->as_Phi() == NULL && i1->as_Local() == NULL) {
duke@435	1894	// i1 was not eliminated => append it
duke@435	1895	assert(i1->next() == NULL, "shouldn't already be linked");
duke@435	1896	_last = _last->set_next(i1, canon.bci());
duke@435	1897	if (++_instruction_count >= InstructionCountCutoff
duke@435	1898	&& !bailed_out()) {
duke@435	1899	// set the bailout state but complete normal processing. We
duke@435	1900	// might do a little more work before noticing the bailout so we
duke@435	1901	// want processing to continue normally until it's noticed.
duke@435	1902	bailout("Method and/or inlining is too large");
duke@435	1903	}
duke@435	1904
duke@435	1905	#ifndef PRODUCT
duke@435	1906	if (PrintIRDuringConstruction) {
duke@435	1907	InstructionPrinter ip;
duke@435	1908	ip.print_line(i1);
duke@435	1909	if (Verbose) {
duke@435	1910	state()->print();
duke@435	1911	}
duke@435	1912	}
duke@435	1913	#endif
duke@435	1914	assert(_last == i1, "adjust code below");
duke@435	1915	StateSplit* s = i1->as_StateSplit();
duke@435	1916	if (s != NULL && i1->as_BlockEnd() == NULL) {
duke@435	1917	if (EliminateFieldAccess) {
never@894	1918	Intrinsic* intrinsic = s->as_Intrinsic();
duke@435	1919	if (s->as_Invoke() != NULL || (intrinsic && !intrinsic->preserves_state())) {
duke@435	1920	_memory->kill();
duke@435	1921	}
duke@435	1922	}
duke@435	1923	s->set_state(state()->copy());
duke@435	1924	}
duke@435	1925	// set up exception handlers for this instruction if necessary
duke@435	1926	if (i1->can_trap()) {
duke@435	1927	assert(exception_state() != NULL || !has_handler(), "must have setup exception state");
duke@435	1928	i1->set_exception_handlers(handle_exception(bci));
duke@435	1929	}
duke@435	1930	}
duke@435	1931	return i1;
duke@435	1932	}
duke@435	1933
duke@435	1934
duke@435	1935	Instruction* GraphBuilder::append(Instruction* instr) {
duke@435	1936	assert(instr->as_StateSplit() == NULL || instr->as_BlockEnd() != NULL, "wrong append used");
duke@435	1937	return append_with_bci(instr, bci());
duke@435	1938	}
duke@435	1939
duke@435	1940
duke@435	1941	Instruction* GraphBuilder::append_split(StateSplit* instr) {
duke@435	1942	return append_with_bci(instr, bci());
duke@435	1943	}
duke@435	1944
duke@435	1945
duke@435	1946	void GraphBuilder::null_check(Value value) {
duke@435	1947	if (value->as_NewArray() != NULL || value->as_NewInstance() != NULL) {
duke@435	1948	return;
duke@435	1949	} else {
duke@435	1950	Constant* con = value->as_Constant();
duke@435	1951	if (con) {
duke@435	1952	ObjectType* c = con->type()->as_ObjectType();
duke@435	1953	if (c && c->is_loaded()) {
duke@435	1954	ObjectConstant* oc = c->as_ObjectConstant();
duke@435	1955	if (!oc || !oc->value()->is_null_object()) {
duke@435	1956	return;
duke@435	1957	}
duke@435	1958	}
duke@435	1959	}
duke@435	1960	}
duke@435	1961	append(new NullCheck(value, lock_stack()));
duke@435	1962	}
duke@435	1963
duke@435	1964
duke@435	1965
duke@435	1966	XHandlers* GraphBuilder::handle_exception(int cur_bci) {
duke@435	1967	// fast path if it is guaranteed that no exception handlers are present
duke@435	1968	if (!has_handler()) {
duke@435	1969	// TODO: check if return NULL is possible (avoids empty lists)
duke@435	1970	return new XHandlers();
duke@435	1971	}
duke@435	1972
duke@435	1973	XHandlers* exception_handlers = new XHandlers();
duke@435	1974	ScopeData* cur_scope_data = scope_data();
duke@435	1975	ValueStack* s = exception_state();
duke@435	1976	int scope_count = 0;
duke@435	1977
duke@435	1978	assert(s != NULL, "exception state must be set");
duke@435	1979	do {
duke@435	1980	assert(cur_scope_data->scope() == s->scope(), "scopes do not match");
duke@435	1981	assert(cur_bci == SynchronizationEntryBCI || cur_bci == cur_scope_data->stream()->cur_bci(), "invalid bci");
duke@435	1982
duke@435	1983	// join with all potential exception handlers
duke@435	1984	XHandlers* list = cur_scope_data->xhandlers();
duke@435	1985	const int n = list->length();
duke@435	1986	for (int i = 0; i < n; i++) {
duke@435	1987	XHandler* h = list->handler_at(i);
duke@435	1988	if (h->covers(cur_bci)) {
duke@435	1989	// h is a potential exception handler => join it
duke@435	1990	compilation()->set_has_exception_handlers(true);
duke@435	1991
duke@435	1992	BlockBegin* entry = h->entry_block();
duke@435	1993	if (entry == block()) {
duke@435	1994	// It's acceptable for an exception handler to cover itself
duke@435	1995	// but we don't handle that in the parser currently. It's
duke@435	1996	// very rare so we bailout instead of trying to handle it.
duke@435	1997	BAILOUT_("exception handler covers itself", exception_handlers);
duke@435	1998	}
duke@435	1999	assert(entry->bci() == h->handler_bci(), "must match");
duke@435	2000	assert(entry->bci() == -1 || entry == cur_scope_data->block_at(entry->bci()), "blocks must correspond");
duke@435	2001
duke@435	2002	// previously this was a BAILOUT, but this is not necessary
duke@435	2003	// now because asynchronous exceptions are not handled this way.
duke@435	2004	assert(entry->state() == NULL || s->locks_size() == entry->state()->locks_size(), "locks do not match");
duke@435	2005
duke@435	2006	// xhandler start with an empty expression stack
duke@435	2007	s->truncate_stack(cur_scope_data->caller_stack_size());
duke@435	2008
duke@435	2009	// Note: Usually this join must work. However, very
duke@435	2010	// complicated jsr-ret structures where we don't ret from
duke@435	2011	// the subroutine can cause the objects on the monitor
duke@435	2012	// stacks to not match because blocks can be parsed twice.
duke@435	2013	// The only test case we've seen so far which exhibits this
duke@435	2014	// problem is caught by the infinite recursion test in
duke@435	2015	// GraphBuilder::jsr() if the join doesn't work.
duke@435	2016	if (!entry->try_merge(s)) {
duke@435	2017	BAILOUT_("error while joining with exception handler, prob. due to complicated jsr/rets", exception_handlers);
duke@435	2018	}
duke@435	2019
duke@435	2020	// add current state for correct handling of phi functions at begin of xhandler
duke@435	2021	int phi_operand = entry->add_exception_state(s);
duke@435	2022
duke@435	2023	// add entry to the list of xhandlers of this block
duke@435	2024	_block->add_exception_handler(entry);
duke@435	2025
duke@435	2026	// add back-edge from xhandler entry to this block
duke@435	2027	if (!entry->is_predecessor(_block)) {
duke@435	2028	entry->add_predecessor(_block);
duke@435	2029	}
duke@435	2030
duke@435	2031	// clone XHandler because phi_operand and scope_count can not be shared
duke@435	2032	XHandler* new_xhandler = new XHandler(h);
duke@435	2033	new_xhandler->set_phi_operand(phi_operand);
duke@435	2034	new_xhandler->set_scope_count(scope_count);
duke@435	2035	exception_handlers->append(new_xhandler);
duke@435	2036
duke@435	2037	// fill in exception handler subgraph lazily
duke@435	2038	assert(!entry->is_set(BlockBegin::was_visited_flag), "entry must not be visited yet");
duke@435	2039	cur_scope_data->add_to_work_list(entry);
duke@435	2040
duke@435	2041	// stop when reaching catchall
duke@435	2042	if (h->catch_type() == 0) {
duke@435	2043	return exception_handlers;
duke@435	2044	}
duke@435	2045	}
duke@435	2046	}
duke@435	2047
duke@435	2048	// Set up iteration for next time.
duke@435	2049	// If parsing a jsr, do not grab exception handlers from the
duke@435	2050	// parent scopes for this method (already got them, and they
duke@435	2051	// needed to be cloned)
duke@435	2052	if (cur_scope_data->parsing_jsr()) {
duke@435	2053	IRScope* tmp_scope = cur_scope_data->scope();
duke@435	2054	while (cur_scope_data->parent() != NULL &&
duke@435	2055	cur_scope_data->parent()->scope() == tmp_scope) {
duke@435	2056	cur_scope_data = cur_scope_data->parent();
duke@435	2057	}
duke@435	2058	}
duke@435	2059	if (cur_scope_data != NULL) {
duke@435	2060	if (cur_scope_data->parent() != NULL) {
duke@435	2061	// must use pop_scope instead of caller_state to preserve all monitors
duke@435	2062	s = s->pop_scope();
duke@435	2063	}
duke@435	2064	cur_bci = cur_scope_data->scope()->caller_bci();
duke@435	2065	cur_scope_data = cur_scope_data->parent();
duke@435	2066	scope_count++;
duke@435	2067	}
duke@435	2068	} while (cur_scope_data != NULL);
duke@435	2069
duke@435	2070	return exception_handlers;
duke@435	2071	}
duke@435	2072
duke@435	2073
duke@435	2074	// Helper class for simplifying Phis.
duke@435	2075	class PhiSimplifier : public BlockClosure {
duke@435	2076	private:
duke@435	2077	bool _has_substitutions;
duke@435	2078	Value simplify(Value v);
duke@435	2079
duke@435	2080	public:
duke@435	2081	PhiSimplifier(BlockBegin* start) : _has_substitutions(false) {
duke@435	2082	start->iterate_preorder(this);
duke@435	2083	if (_has_substitutions) {
duke@435	2084	SubstitutionResolver sr(start);
duke@435	2085	}
duke@435	2086	}
duke@435	2087	void block_do(BlockBegin* b);
duke@435	2088	bool has_substitutions() const { return _has_substitutions; }
duke@435	2089	};
duke@435	2090
duke@435	2091
duke@435	2092	Value PhiSimplifier::simplify(Value v) {
duke@435	2093	Phi* phi = v->as_Phi();
duke@435	2094
duke@435	2095	if (phi == NULL) {
duke@435	2096	// no phi function
duke@435	2097	return v;
duke@435	2098	} else if (v->has_subst()) {
duke@435	2099	// already substituted; subst can be phi itself -> simplify
duke@435	2100	return simplify(v->subst());
duke@435	2101	} else if (phi->is_set(Phi::cannot_simplify)) {
duke@435	2102	// already tried to simplify phi before
duke@435	2103	return phi;
duke@435	2104	} else if (phi->is_set(Phi::visited)) {
duke@435	2105	// break cycles in phi functions
duke@435	2106	return phi;
duke@435	2107	} else if (phi->type()->is_illegal()) {
duke@435	2108	// illegal phi functions are ignored anyway
duke@435	2109	return phi;
duke@435	2110
duke@435	2111	} else {
duke@435	2112	// mark phi function as processed to break cycles in phi functions
duke@435	2113	phi->set(Phi::visited);
duke@435	2114
duke@435	2115	// simplify x = [y, x] and x = [y, y] to y
duke@435	2116	Value subst = NULL;
duke@435	2117	int opd_count = phi->operand_count();
duke@435	2118	for (int i = 0; i < opd_count; i++) {
duke@435	2119	Value opd = phi->operand_at(i);
duke@435	2120	assert(opd != NULL, "Operand must exist!");
duke@435	2121
duke@435	2122	if (opd->type()->is_illegal()) {
duke@435	2123	// if one operand is illegal, the entire phi function is illegal
duke@435	2124	phi->make_illegal();
duke@435	2125	phi->clear(Phi::visited);
duke@435	2126	return phi;
duke@435	2127	}
duke@435	2128
duke@435	2129	Value new_opd = simplify(opd);
duke@435	2130	assert(new_opd != NULL, "Simplified operand must exist!");
duke@435	2131
duke@435	2132	if (new_opd != phi && new_opd != subst) {
duke@435	2133	if (subst == NULL) {
duke@435	2134	subst = new_opd;
duke@435	2135	} else {
duke@435	2136	// no simplification possible
duke@435	2137	phi->set(Phi::cannot_simplify);
duke@435	2138	phi->clear(Phi::visited);
duke@435	2139	return phi;
duke@435	2140	}
duke@435	2141	}
duke@435	2142	}
duke@435	2143
duke@435	2144	// sucessfully simplified phi function
duke@435	2145	assert(subst != NULL, "illegal phi function");
duke@435	2146	_has_substitutions = true;
duke@435	2147	phi->clear(Phi::visited);
duke@435	2148	phi->set_subst(subst);
duke@435	2149
duke@435	2150	#ifndef PRODUCT
duke@435	2151	if (PrintPhiFunctions) {
duke@435	2152	tty->print_cr("simplified phi function %c%d to %c%d (Block B%d)", phi->type()->tchar(), phi->id(), subst->type()->tchar(), subst->id(), phi->block()->block_id());
duke@435	2153	}
duke@435	2154	#endif
duke@435	2155
duke@435	2156	return subst;
duke@435	2157	}
duke@435	2158	}
duke@435	2159
duke@435	2160
duke@435	2161	void PhiSimplifier::block_do(BlockBegin* b) {
duke@435	2162	for_each_phi_fun(b, phi,
duke@435	2163	simplify(phi);
duke@435	2164	);
duke@435	2165
duke@435	2166	#ifdef ASSERT
duke@435	2167	for_each_phi_fun(b, phi,
duke@435	2168	assert(phi->operand_count() != 1 || phi->subst() != phi, "missed trivial simplification");
duke@435	2169	);
duke@435	2170
duke@435	2171	ValueStack* state = b->state()->caller_state();
duke@435	2172	int index;
duke@435	2173	Value value;
duke@435	2174	for_each_state(state) {
duke@435	2175	for_each_local_value(state, index, value) {
duke@435	2176	Phi* phi = value->as_Phi();
duke@435	2177	assert(phi == NULL || phi->block() != b, "must not have phi function to simplify in caller state");
duke@435	2178	}
duke@435	2179	}
duke@435	2180	#endif
duke@435	2181	}
duke@435	2182
duke@435	2183	// This method is called after all blocks are filled with HIR instructions
duke@435	2184	// It eliminates all Phi functions of the form x = [y, y] and x = [y, x]
duke@435	2185	void GraphBuilder::eliminate_redundant_phis(BlockBegin* start) {
duke@435	2186	PhiSimplifier simplifier(start);
duke@435	2187	}
duke@435	2188
duke@435	2189
duke@435	2190	void GraphBuilder::connect_to_end(BlockBegin* beg) {
duke@435	2191	// setup iteration
duke@435	2192	kill_all();
duke@435	2193	_block = beg;
duke@435	2194	_state = beg->state()->copy();
duke@435	2195	_last = beg;
duke@435	2196	iterate_bytecodes_for_block(beg->bci());
duke@435	2197	}
duke@435	2198
duke@435	2199
duke@435	2200	BlockEnd* GraphBuilder::iterate_bytecodes_for_block(int bci) {
duke@435	2201	#ifndef PRODUCT
duke@435	2202	if (PrintIRDuringConstruction) {
duke@435	2203	tty->cr();
duke@435	2204	InstructionPrinter ip;
duke@435	2205	ip.print_instr(_block); tty->cr();
duke@435	2206	ip.print_stack(_block->state()); tty->cr();
duke@435	2207	ip.print_inline_level(_block);
duke@435	2208	ip.print_head();
duke@435	2209	tty->print_cr("locals size: %d stack size: %d", state()->locals_size(), state()->stack_size());
duke@435	2210	}
duke@435	2211	#endif
duke@435	2212	_skip_block = false;
duke@435	2213	assert(state() != NULL, "ValueStack missing!");
duke@435	2214	ciBytecodeStream s(method());
duke@435	2215	s.reset_to_bci(bci);
duke@435	2216	int prev_bci = bci;
duke@435	2217	scope_data()->set_stream(&s);
duke@435	2218	// iterate
duke@435	2219	Bytecodes::Code code = Bytecodes::_illegal;
duke@435	2220	bool push_exception = false;
duke@435	2221
duke@435	2222	if (block()->is_set(BlockBegin::exception_entry_flag) && block()->next() == NULL) {
duke@435	2223	// first thing in the exception entry block should be the exception object.
duke@435	2224	push_exception = true;
duke@435	2225	}
duke@435	2226
duke@435	2227	while (!bailed_out() && last()->as_BlockEnd() == NULL &&
duke@435	2228	(code = stream()->next()) != ciBytecodeStream::EOBC() &&
duke@435	2229	(block_at(s.cur_bci()) == NULL || block_at(s.cur_bci()) == block())) {
duke@435	2230
duke@435	2231	if (has_handler() && can_trap(method(), code)) {
duke@435	2232	// copy the state because it is modified before handle_exception is called
duke@435	2233	set_exception_state(state()->copy());
duke@435	2234	} else {
duke@435	2235	// handle_exception is not called for this bytecode
duke@435	2236	set_exception_state(NULL);
duke@435	2237	}
duke@435	2238
duke@435	2239	// Check for active jsr during OSR compilation
duke@435	2240	if (compilation()->is_osr_compile()
duke@435	2241	&& scope()->is_top_scope()
duke@435	2242	&& parsing_jsr()
duke@435	2243	&& s.cur_bci() == compilation()->osr_bci()) {
duke@435	2244	bailout("OSR not supported while a jsr is active");
duke@435	2245	}
duke@435	2246
duke@435	2247	if (push_exception) {
duke@435	2248	apush(append(new ExceptionObject()));
duke@435	2249	push_exception = false;
duke@435	2250	}
duke@435	2251
duke@435	2252	// handle bytecode
duke@435	2253	switch (code) {
duke@435	2254	case Bytecodes::_nop : /* nothing to do */ break;
duke@435	2255	case Bytecodes::_aconst_null : apush(append(new Constant(objectNull ))); break;
duke@435	2256	case Bytecodes::_iconst_m1 : ipush(append(new Constant(new IntConstant (-1)))); break;
duke@435	2257	case Bytecodes::_iconst_0 : ipush(append(new Constant(intZero ))); break;
duke@435	2258	case Bytecodes::_iconst_1 : ipush(append(new Constant(intOne ))); break;
duke@435	2259	case Bytecodes::_iconst_2 : ipush(append(new Constant(new IntConstant ( 2)))); break;
duke@435	2260	case Bytecodes::_iconst_3 : ipush(append(new Constant(new IntConstant ( 3)))); break;
duke@435	2261	case Bytecodes::_iconst_4 : ipush(append(new Constant(new IntConstant ( 4)))); break;
duke@435	2262	case Bytecodes::_iconst_5 : ipush(append(new Constant(new IntConstant ( 5)))); break;
duke@435	2263	case Bytecodes::_lconst_0 : lpush(append(new Constant(new LongConstant ( 0)))); break;
duke@435	2264	case Bytecodes::_lconst_1 : lpush(append(new Constant(new LongConstant ( 1)))); break;
duke@435	2265	case Bytecodes::_fconst_0 : fpush(append(new Constant(new FloatConstant ( 0)))); break;
duke@435	2266	case Bytecodes::_fconst_1 : fpush(append(new Constant(new FloatConstant ( 1)))); break;
duke@435	2267	case Bytecodes::_fconst_2 : fpush(append(new Constant(new FloatConstant ( 2)))); break;
duke@435	2268	case Bytecodes::_dconst_0 : dpush(append(new Constant(new DoubleConstant( 0)))); break;
duke@435	2269	case Bytecodes::_dconst_1 : dpush(append(new Constant(new DoubleConstant( 1)))); break;
duke@435	2270	case Bytecodes::_bipush : ipush(append(new Constant(new IntConstant(((signed char*)s.cur_bcp())[1])))); break;
duke@435	2271	case Bytecodes::_sipush : ipush(append(new Constant(new IntConstant((short)Bytes::get_Java_u2(s.cur_bcp()+1))))); break;
duke@435	2272	case Bytecodes::_ldc : // fall through
duke@435	2273	case Bytecodes::_ldc_w : // fall through
duke@435	2274	case Bytecodes::_ldc2_w : load_constant(); break;
duke@435	2275	case Bytecodes::_iload : load_local(intType , s.get_index()); break;
duke@435	2276	case Bytecodes::_lload : load_local(longType , s.get_index()); break;
duke@435	2277	case Bytecodes::_fload : load_local(floatType , s.get_index()); break;
duke@435	2278	case Bytecodes::_dload : load_local(doubleType , s.get_index()); break;
duke@435	2279	case Bytecodes::_aload : load_local(instanceType, s.get_index()); break;
duke@435	2280	case Bytecodes::_iload_0 : load_local(intType , 0); break;
duke@435	2281	case Bytecodes::_iload_1 : load_local(intType , 1); break;
duke@435	2282	case Bytecodes::_iload_2 : load_local(intType , 2); break;
duke@435	2283	case Bytecodes::_iload_3 : load_local(intType , 3); break;
duke@435	2284	case Bytecodes::_lload_0 : load_local(longType , 0); break;
duke@435	2285	case Bytecodes::_lload_1 : load_local(longType , 1); break;
duke@435	2286	case Bytecodes::_lload_2 : load_local(longType , 2); break;
duke@435	2287	case Bytecodes::_lload_3 : load_local(longType , 3); break;
duke@435	2288	case Bytecodes::_fload_0 : load_local(floatType , 0); break;
duke@435	2289	case Bytecodes::_fload_1 : load_local(floatType , 1); break;
duke@435	2290	case Bytecodes::_fload_2 : load_local(floatType , 2); break;
duke@435	2291	case Bytecodes::_fload_3 : load_local(floatType , 3); break;
duke@435	2292	case Bytecodes::_dload_0 : load_local(doubleType, 0); break;
duke@435	2293	case Bytecodes::_dload_1 : load_local(doubleType, 1); break;
duke@435	2294	case Bytecodes::_dload_2 : load_local(doubleType, 2); break;
duke@435	2295	case Bytecodes::_dload_3 : load_local(doubleType, 3); break;
duke@435	2296	case Bytecodes::_aload_0 : load_local(objectType, 0); break;
duke@435	2297	case Bytecodes::_aload_1 : load_local(objectType, 1); break;
duke@435	2298	case Bytecodes::_aload_2 : load_local(objectType, 2); break;
duke@435	2299	case Bytecodes::_aload_3 : load_local(objectType, 3); break;
duke@435	2300	case Bytecodes::_iaload : load_indexed(T_INT ); break;
duke@435	2301	case Bytecodes::_laload : load_indexed(T_LONG ); break;
duke@435	2302	case Bytecodes::_faload : load_indexed(T_FLOAT ); break;
duke@435	2303	case Bytecodes::_daload : load_indexed(T_DOUBLE); break;
duke@435	2304	case Bytecodes::_aaload : load_indexed(T_OBJECT); break;
duke@435	2305	case Bytecodes::_baload : load_indexed(T_BYTE ); break;
duke@435	2306	case Bytecodes::_caload : load_indexed(T_CHAR ); break;
duke@435	2307	case Bytecodes::_saload : load_indexed(T_SHORT ); break;
duke@435	2308	case Bytecodes::_istore : store_local(intType , s.get_index()); break;
duke@435	2309	case Bytecodes::_lstore : store_local(longType , s.get_index()); break;
duke@435	2310	case Bytecodes::_fstore : store_local(floatType , s.get_index()); break;
duke@435	2311	case Bytecodes::_dstore : store_local(doubleType, s.get_index()); break;
duke@435	2312	case Bytecodes::_astore : store_local(objectType, s.get_index()); break;
duke@435	2313	case Bytecodes::_istore_0 : store_local(intType , 0); break;
duke@435	2314	case Bytecodes::_istore_1 : store_local(intType , 1); break;
duke@435	2315	case Bytecodes::_istore_2 : store_local(intType , 2); break;
duke@435	2316	case Bytecodes::_istore_3 : store_local(intType , 3); break;
duke@435	2317	case Bytecodes::_lstore_0 : store_local(longType , 0); break;
duke@435	2318	case Bytecodes::_lstore_1 : store_local(longType , 1); break;
duke@435	2319	case Bytecodes::_lstore_2 : store_local(longType , 2); break;
duke@435	2320	case Bytecodes::_lstore_3 : store_local(longType , 3); break;
duke@435	2321	case Bytecodes::_fstore_0 : store_local(floatType , 0); break;
duke@435	2322	case Bytecodes::_fstore_1 : store_local(floatType , 1); break;
duke@435	2323	case Bytecodes::_fstore_2 : store_local(floatType , 2); break;
duke@435	2324	case Bytecodes::_fstore_3 : store_local(floatType , 3); break;
duke@435	2325	case Bytecodes::_dstore_0 : store_local(doubleType, 0); break;
duke@435	2326	case Bytecodes::_dstore_1 : store_local(doubleType, 1); break;
duke@435	2327	case Bytecodes::_dstore_2 : store_local(doubleType, 2); break;
duke@435	2328	case Bytecodes::_dstore_3 : store_local(doubleType, 3); break;
duke@435	2329	case Bytecodes::_astore_0 : store_local(objectType, 0); break;
duke@435	2330	case Bytecodes::_astore_1 : store_local(objectType, 1); break;
duke@435	2331	case Bytecodes::_astore_2 : store_local(objectType, 2); break;
duke@435	2332	case Bytecodes::_astore_3 : store_local(objectType, 3); break;
duke@435	2333	case Bytecodes::_iastore : store_indexed(T_INT ); break;
duke@435	2334	case Bytecodes::_lastore : store_indexed(T_LONG ); break;
duke@435	2335	case Bytecodes::_fastore : store_indexed(T_FLOAT ); break;
duke@435	2336	case Bytecodes::_dastore : store_indexed(T_DOUBLE); break;
duke@435	2337	case Bytecodes::_aastore : store_indexed(T_OBJECT); break;
duke@435	2338	case Bytecodes::_bastore : store_indexed(T_BYTE ); break;
duke@435	2339	case Bytecodes::_castore : store_indexed(T_CHAR ); break;
duke@435	2340	case Bytecodes::_sastore : store_indexed(T_SHORT ); break;
duke@435	2341	case Bytecodes::_pop : // fall through
duke@435	2342	case Bytecodes::_pop2 : // fall through
duke@435	2343	case Bytecodes::_dup : // fall through
duke@435	2344	case Bytecodes::_dup_x1 : // fall through
duke@435	2345	case Bytecodes::_dup_x2 : // fall through
duke@435	2346	case Bytecodes::_dup2 : // fall through
duke@435	2347	case Bytecodes::_dup2_x1 : // fall through
duke@435	2348	case Bytecodes::_dup2_x2 : // fall through
duke@435	2349	case Bytecodes::_swap : stack_op(code); break;
duke@435	2350	case Bytecodes::_iadd : arithmetic_op(intType , code); break;
duke@435	2351	case Bytecodes::_ladd : arithmetic_op(longType , code); break;
duke@435	2352	case Bytecodes::_fadd : arithmetic_op(floatType , code); break;
duke@435	2353	case Bytecodes::_dadd : arithmetic_op(doubleType, code); break;
duke@435	2354	case Bytecodes::_isub : arithmetic_op(intType , code); break;
duke@435	2355	case Bytecodes::_lsub : arithmetic_op(longType , code); break;
duke@435	2356	case Bytecodes::_fsub : arithmetic_op(floatType , code); break;
duke@435	2357	case Bytecodes::_dsub : arithmetic_op(doubleType, code); break;
duke@435	2358	case Bytecodes::_imul : arithmetic_op(intType , code); break;
duke@435	2359	case Bytecodes::_lmul : arithmetic_op(longType , code); break;
duke@435	2360	case Bytecodes::_fmul : arithmetic_op(floatType , code); break;
duke@435	2361	case Bytecodes::_dmul : arithmetic_op(doubleType, code); break;
duke@435	2362	case Bytecodes::_idiv : arithmetic_op(intType , code, lock_stack()); break;
duke@435	2363	case Bytecodes::_ldiv : arithmetic_op(longType , code, lock_stack()); break;
duke@435	2364	case Bytecodes::_fdiv : arithmetic_op(floatType , code); break;
duke@435	2365	case Bytecodes::_ddiv : arithmetic_op(doubleType, code); break;
duke@435	2366	case Bytecodes::_irem : arithmetic_op(intType , code, lock_stack()); break;
duke@435	2367	case Bytecodes::_lrem : arithmetic_op(longType , code, lock_stack()); break;
duke@435	2368	case Bytecodes::_frem : arithmetic_op(floatType , code); break;
duke@435	2369	case Bytecodes::_drem : arithmetic_op(doubleType, code); break;
duke@435	2370	case Bytecodes::_ineg : negate_op(intType ); break;
duke@435	2371	case Bytecodes::_lneg : negate_op(longType ); break;
duke@435	2372	case Bytecodes::_fneg : negate_op(floatType ); break;
duke@435	2373	case Bytecodes::_dneg : negate_op(doubleType); break;
duke@435	2374	case Bytecodes::_ishl : shift_op(intType , code); break;
duke@435	2375	case Bytecodes::_lshl : shift_op(longType, code); break;
duke@435	2376	case Bytecodes::_ishr : shift_op(intType , code); break;
duke@435	2377	case Bytecodes::_lshr : shift_op(longType, code); break;
duke@435	2378	case Bytecodes::_iushr : shift_op(intType , code); break;
duke@435	2379	case Bytecodes::_lushr : shift_op(longType, code); break;
duke@435	2380	case Bytecodes::_iand : logic_op(intType , code); break;
duke@435	2381	case Bytecodes::_land : logic_op(longType, code); break;
duke@435	2382	case Bytecodes::_ior : logic_op(intType , code); break;
duke@435	2383	case Bytecodes::_lor : logic_op(longType, code); break;
duke@435	2384	case Bytecodes::_ixor : logic_op(intType , code); break;
duke@435	2385	case Bytecodes::_lxor : logic_op(longType, code); break;
duke@435	2386	case Bytecodes::_iinc : increment(); break;
duke@435	2387	case Bytecodes::_i2l : convert(code, T_INT , T_LONG ); break;
duke@435	2388	case Bytecodes::_i2f : convert(code, T_INT , T_FLOAT ); break;
duke@435	2389	case Bytecodes::_i2d : convert(code, T_INT , T_DOUBLE); break;
duke@435	2390	case Bytecodes::_l2i : convert(code, T_LONG , T_INT ); break;
duke@435	2391	case Bytecodes::_l2f : convert(code, T_LONG , T_FLOAT ); break;
duke@435	2392	case Bytecodes::_l2d : convert(code, T_LONG , T_DOUBLE); break;
duke@435	2393	case Bytecodes::_f2i : convert(code, T_FLOAT , T_INT ); break;
duke@435	2394	case Bytecodes::_f2l : convert(code, T_FLOAT , T_LONG ); break;
duke@435	2395	case Bytecodes::_f2d : convert(code, T_FLOAT , T_DOUBLE); break;
duke@435	2396	case Bytecodes::_d2i : convert(code, T_DOUBLE, T_INT ); break;
duke@435	2397	case Bytecodes::_d2l : convert(code, T_DOUBLE, T_LONG ); break;
duke@435	2398	case Bytecodes::_d2f : convert(code, T_DOUBLE, T_FLOAT ); break;
duke@435	2399	case Bytecodes::_i2b : convert(code, T_INT , T_BYTE ); break;
duke@435	2400	case Bytecodes::_i2c : convert(code, T_INT , T_CHAR ); break;
duke@435	2401	case Bytecodes::_i2s : convert(code, T_INT , T_SHORT ); break;
duke@435	2402	case Bytecodes::_lcmp : compare_op(longType , code); break;
duke@435	2403	case Bytecodes::_fcmpl : compare_op(floatType , code); break;
duke@435	2404	case Bytecodes::_fcmpg : compare_op(floatType , code); break;
duke@435	2405	case Bytecodes::_dcmpl : compare_op(doubleType, code); break;
duke@435	2406	case Bytecodes::_dcmpg : compare_op(doubleType, code); break;
duke@435	2407	case Bytecodes::_ifeq : if_zero(intType , If::eql); break;
duke@435	2408	case Bytecodes::_ifne : if_zero(intType , If::neq); break;
duke@435	2409	case Bytecodes::_iflt : if_zero(intType , If::lss); break;
duke@435	2410	case Bytecodes::_ifge : if_zero(intType , If::geq); break;
duke@435	2411	case Bytecodes::_ifgt : if_zero(intType , If::gtr); break;
duke@435	2412	case Bytecodes::_ifle : if_zero(intType , If::leq); break;
duke@435	2413	case Bytecodes::_if_icmpeq : if_same(intType , If::eql); break;
duke@435	2414	case Bytecodes::_if_icmpne : if_same(intType , If::neq); break;
duke@435	2415	case Bytecodes::_if_icmplt : if_same(intType , If::lss); break;
duke@435	2416	case Bytecodes::_if_icmpge : if_same(intType , If::geq); break;
duke@435	2417	case Bytecodes::_if_icmpgt : if_same(intType , If::gtr); break;
duke@435	2418	case Bytecodes::_if_icmple : if_same(intType , If::leq); break;
duke@435	2419	case Bytecodes::_if_acmpeq : if_same(objectType, If::eql); break;
duke@435	2420	case Bytecodes::_if_acmpne : if_same(objectType, If::neq); break;
duke@435	2421	case Bytecodes::_goto : _goto(s.cur_bci(), s.get_dest()); break;
duke@435	2422	case Bytecodes::_jsr : jsr(s.get_dest()); break;
duke@435	2423	case Bytecodes::_ret : ret(s.get_index()); break;
duke@435	2424	case Bytecodes::_tableswitch : table_switch(); break;
duke@435	2425	case Bytecodes::_lookupswitch : lookup_switch(); break;
duke@435	2426	case Bytecodes::_ireturn : method_return(ipop()); break;
duke@435	2427	case Bytecodes::_lreturn : method_return(lpop()); break;
duke@435	2428	case Bytecodes::_freturn : method_return(fpop()); break;
duke@435	2429	case Bytecodes::_dreturn : method_return(dpop()); break;
duke@435	2430	case Bytecodes::_areturn : method_return(apop()); break;
duke@435	2431	case Bytecodes::_return : method_return(NULL ); break;
duke@435	2432	case Bytecodes::_getstatic : // fall through
duke@435	2433	case Bytecodes::_putstatic : // fall through
duke@435	2434	case Bytecodes::_getfield : // fall through
duke@435	2435	case Bytecodes::_putfield : access_field(code); break;
duke@435	2436	case Bytecodes::_invokevirtual : // fall through
duke@435	2437	case Bytecodes::_invokespecial : // fall through
duke@435	2438	case Bytecodes::_invokestatic : // fall through
jrose@1161	2439	case Bytecodes::_invokedynamic : // fall through
duke@435	2440	case Bytecodes::_invokeinterface: invoke(code); break;
jrose@1920	2441	case Bytecodes::_new : new_instance(s.get_index_u2()); break;
duke@435	2442	case Bytecodes::_newarray : new_type_array(); break;
duke@435	2443	case Bytecodes::_anewarray : new_object_array(); break;
duke@435	2444	case Bytecodes::_arraylength : ipush(append(new ArrayLength(apop(), lock_stack()))); break;
duke@435	2445	case Bytecodes::_athrow : throw_op(s.cur_bci()); break;
jrose@1920	2446	case Bytecodes::_checkcast : check_cast(s.get_index_u2()); break;
jrose@1920	2447	case Bytecodes::_instanceof : instance_of(s.get_index_u2()); break;
duke@435	2448	// Note: we do not have special handling for the monitorenter bytecode if DeoptC1 && DeoptOnAsyncException
duke@435	2449	case Bytecodes::_monitorenter : monitorenter(apop(), s.cur_bci()); break;
duke@435	2450	case Bytecodes::_monitorexit : monitorexit (apop(), s.cur_bci()); break;
duke@435	2451	case Bytecodes::_wide : ShouldNotReachHere(); break;
duke@435	2452	case Bytecodes::_multianewarray : new_multi_array(s.cur_bcp()[3]); break;
duke@435	2453	case Bytecodes::_ifnull : if_null(objectType, If::eql); break;
duke@435	2454	case Bytecodes::_ifnonnull : if_null(objectType, If::neq); break;
duke@435	2455	case Bytecodes::_goto_w : _goto(s.cur_bci(), s.get_far_dest()); break;
duke@435	2456	case Bytecodes::_jsr_w : jsr(s.get_far_dest()); break;
duke@435	2457	case Bytecodes::_breakpoint : BAILOUT_("concurrent setting of breakpoint", NULL);
duke@435	2458	default : ShouldNotReachHere(); break;
duke@435	2459	}
duke@435	2460	// save current bci to setup Goto at the end
duke@435	2461	prev_bci = s.cur_bci();
duke@435	2462	}
duke@435	2463	CHECK_BAILOUT_(NULL);
duke@435	2464	// stop processing of this block (see try_inline_full)
duke@435	2465	if (_skip_block) {
duke@435	2466	_skip_block = false;
duke@435	2467	assert(_last && _last->as_BlockEnd(), "");
duke@435	2468	return _last->as_BlockEnd();
duke@435	2469	}
duke@435	2470	// if there are any, check if last instruction is a BlockEnd instruction
duke@435	2471	BlockEnd* end = last()->as_BlockEnd();
duke@435	2472	if (end == NULL) {
duke@435	2473	// all blocks must end with a BlockEnd instruction => add a Goto
duke@435	2474	end = new Goto(block_at(s.cur_bci()), false);
duke@435	2475	_last = _last->set_next(end, prev_bci);
duke@435	2476	}
duke@435	2477	assert(end == last()->as_BlockEnd(), "inconsistency");
duke@435	2478
duke@435	2479	// if the method terminates, we don't need the stack anymore
duke@435	2480	if (end->as_Return() != NULL) {
duke@435	2481	state()->clear_stack();
duke@435	2482	} else if (end->as_Throw() != NULL) {
duke@435	2483	// May have exception handler in caller scopes
duke@435	2484	state()->truncate_stack(scope()->lock_stack_size());
duke@435	2485	}
duke@435	2486
duke@435	2487	// connect to begin & set state
duke@435	2488	// NOTE that inlining may have changed the block we are parsing
duke@435	2489	block()->set_end(end);
duke@435	2490	end->set_state(state());
duke@435	2491	// propagate state
duke@435	2492	for (int i = end->number_of_sux() - 1; i >= 0; i--) {
duke@435	2493	BlockBegin* sux = end->sux_at(i);
duke@435	2494	assert(sux->is_predecessor(block()), "predecessor missing");
duke@435	2495	// be careful, bailout if bytecodes are strange
duke@435	2496	if (!sux->try_merge(state())) BAILOUT_("block join failed", NULL);
duke@435	2497	scope_data()->add_to_work_list(end->sux_at(i));
duke@435	2498	}
duke@435	2499
duke@435	2500	scope_data()->set_stream(NULL);
duke@435	2501
duke@435	2502	// done
duke@435	2503	return end;
duke@435	2504	}
duke@435	2505
duke@435	2506
duke@435	2507	void GraphBuilder::iterate_all_blocks(bool start_in_current_block_for_inlining) {
duke@435	2508	do {
duke@435	2509	if (start_in_current_block_for_inlining && !bailed_out()) {
duke@435	2510	iterate_bytecodes_for_block(0);
duke@435	2511	start_in_current_block_for_inlining = false;
duke@435	2512	} else {
duke@435	2513	BlockBegin* b;
duke@435	2514	while ((b = scope_data()->remove_from_work_list()) != NULL) {
duke@435	2515	if (!b->is_set(BlockBegin::was_visited_flag)) {
duke@435	2516	if (b->is_set(BlockBegin::osr_entry_flag)) {
duke@435	2517	// we're about to parse the osr entry block, so make sure
duke@435	2518	// we setup the OSR edge leading into this block so that
duke@435	2519	// Phis get setup correctly.
duke@435	2520	setup_osr_entry_block();
duke@435	2521	// this is no longer the osr entry block, so clear it.
duke@435	2522	b->clear(BlockBegin::osr_entry_flag);
duke@435	2523	}
duke@435	2524	b->set(BlockBegin::was_visited_flag);
duke@435	2525	connect_to_end(b);
duke@435	2526	}
duke@435	2527	}
duke@435	2528	}
duke@435	2529	} while (!bailed_out() && !scope_data()->is_work_list_empty());
duke@435	2530	}
duke@435	2531
duke@435	2532
duke@435	2533	bool GraphBuilder::_is_initialized = false;
duke@435	2534	bool GraphBuilder::_can_trap [Bytecodes::number_of_java_codes];
duke@435	2535	bool GraphBuilder::_is_async[Bytecodes::number_of_java_codes];
duke@435	2536
duke@435	2537	void GraphBuilder::initialize() {
duke@435	2538	// make sure initialization happens only once (need a
duke@435	2539	// lock here, if we allow the compiler to be re-entrant)
duke@435	2540	if (is_initialized()) return;
duke@435	2541	_is_initialized = true;
duke@435	2542
duke@435	2543	// the following bytecodes are assumed to potentially
duke@435	2544	// throw exceptions in compiled code - note that e.g.
duke@435	2545	// monitorexit & the return bytecodes do not throw
duke@435	2546	// exceptions since monitor pairing proved that they
duke@435	2547	// succeed (if monitor pairing succeeded)
duke@435	2548	Bytecodes::Code can_trap_list[] =
duke@435	2549	{ Bytecodes::_ldc
duke@435	2550	, Bytecodes::_ldc_w
duke@435	2551	, Bytecodes::_ldc2_w
duke@435	2552	, Bytecodes::_iaload
duke@435	2553	, Bytecodes::_laload
duke@435	2554	, Bytecodes::_faload
duke@435	2555	, Bytecodes::_daload
duke@435	2556	, Bytecodes::_aaload
duke@435	2557	, Bytecodes::_baload
duke@435	2558	, Bytecodes::_caload
duke@435	2559	, Bytecodes::_saload
duke@435	2560	, Bytecodes::_iastore
duke@435	2561	, Bytecodes::_lastore
duke@435	2562	, Bytecodes::_fastore
duke@435	2563	, Bytecodes::_dastore
duke@435	2564	, Bytecodes::_aastore
duke@435	2565	, Bytecodes::_bastore
duke@435	2566	, Bytecodes::_castore
duke@435	2567	, Bytecodes::_sastore
duke@435	2568	, Bytecodes::_idiv
duke@435	2569	, Bytecodes::_ldiv
duke@435	2570	, Bytecodes::_irem
duke@435	2571	, Bytecodes::_lrem
duke@435	2572	, Bytecodes::_getstatic
duke@435	2573	, Bytecodes::_putstatic
duke@435	2574	, Bytecodes::_getfield
duke@435	2575	, Bytecodes::_putfield
duke@435	2576	, Bytecodes::_invokevirtual
duke@435	2577	, Bytecodes::_invokespecial
duke@435	2578	, Bytecodes::_invokestatic
jrose@1161	2579	, Bytecodes::_invokedynamic
duke@435	2580	, Bytecodes::_invokeinterface
duke@435	2581	, Bytecodes::_new
duke@435	2582	, Bytecodes::_newarray
duke@435	2583	, Bytecodes::_anewarray
duke@435	2584	, Bytecodes::_arraylength
duke@435	2585	, Bytecodes::_athrow
duke@435	2586	, Bytecodes::_checkcast
duke@435	2587	, Bytecodes::_instanceof
duke@435	2588	, Bytecodes::_monitorenter
duke@435	2589	, Bytecodes::_multianewarray
duke@435	2590	};
duke@435	2591
duke@435	2592	// the following bytecodes are assumed to potentially
duke@435	2593	// throw asynchronous exceptions in compiled code due
duke@435	2594	// to safepoints (note: these entries could be merged
duke@435	2595	// with the can_trap_list - however, we need to know
duke@435	2596	// which ones are asynchronous for now - see also the
duke@435	2597	// comment in GraphBuilder::handle_exception)
duke@435	2598	Bytecodes::Code is_async_list[] =
duke@435	2599	{ Bytecodes::_ifeq
duke@435	2600	, Bytecodes::_ifne
duke@435	2601	, Bytecodes::_iflt
duke@435	2602	, Bytecodes::_ifge
duke@435	2603	, Bytecodes::_ifgt
duke@435	2604	, Bytecodes::_ifle
duke@435	2605	, Bytecodes::_if_icmpeq
duke@435	2606	, Bytecodes::_if_icmpne
duke@435	2607	, Bytecodes::_if_icmplt
duke@435	2608	, Bytecodes::_if_icmpge
duke@435	2609	, Bytecodes::_if_icmpgt
duke@435	2610	, Bytecodes::_if_icmple
duke@435	2611	, Bytecodes::_if_acmpeq
duke@435	2612	, Bytecodes::_if_acmpne
duke@435	2613	, Bytecodes::_goto
duke@435	2614	, Bytecodes::_jsr
duke@435	2615	, Bytecodes::_ret
duke@435	2616	, Bytecodes::_tableswitch
duke@435	2617	, Bytecodes::_lookupswitch
duke@435	2618	, Bytecodes::_ireturn
duke@435	2619	, Bytecodes::_lreturn
duke@435	2620	, Bytecodes::_freturn
duke@435	2621	, Bytecodes::_dreturn
duke@435	2622	, Bytecodes::_areturn
duke@435	2623	, Bytecodes::_return
duke@435	2624	, Bytecodes::_ifnull
duke@435	2625	, Bytecodes::_ifnonnull
duke@435	2626	, Bytecodes::_goto_w
duke@435	2627	, Bytecodes::_jsr_w
duke@435	2628	};
duke@435	2629
duke@435	2630	// inititialize trap tables
duke@435	2631	for (int i = 0; i < Bytecodes::number_of_java_codes; i++) {
duke@435	2632	_can_trap[i] = false;
duke@435	2633	_is_async[i] = false;
duke@435	2634	}
duke@435	2635	// set standard trap info
duke@435	2636	for (uint j = 0; j < ARRAY_SIZE(can_trap_list); j++) {
duke@435	2637	_can_trap[can_trap_list[j]] = true;
duke@435	2638	}
duke@435	2639
duke@435	2640	// We now deoptimize if an asynchronous exception is thrown. This
duke@435	2641	// considerably cleans up corner case issues related to javac's
duke@435	2642	// incorrect exception handler ranges for async exceptions and
duke@435	2643	// allows us to precisely analyze the types of exceptions from
duke@435	2644	// certain bytecodes.
duke@435	2645	if (!(DeoptC1 && DeoptOnAsyncException)) {
duke@435	2646	// set asynchronous trap info
duke@435	2647	for (uint k = 0; k < ARRAY_SIZE(is_async_list); k++) {
duke@435	2648	assert(!_can_trap[is_async_list[k]], "can_trap_list and is_async_list should be disjoint");
duke@435	2649	_can_trap[is_async_list[k]] = true;
duke@435	2650	_is_async[is_async_list[k]] = true;
duke@435	2651	}
duke@435	2652	}
duke@435	2653	}
duke@435	2654
duke@435	2655
duke@435	2656	BlockBegin* GraphBuilder::header_block(BlockBegin* entry, BlockBegin::Flag f, ValueStack* state) {
duke@435	2657	assert(entry->is_set(f), "entry/flag mismatch");
duke@435	2658	// create header block
duke@435	2659	BlockBegin* h = new BlockBegin(entry->bci());
duke@435	2660	h->set_depth_first_number(0);
duke@435	2661
duke@435	2662	Value l = h;
duke@435	2663	if (profile_branches()) {
duke@435	2664	// Increment the invocation count on entry to the method. We
duke@435	2665	// can't use profile_invocation here because append isn't setup to
duke@435	2666	// work properly at this point. The instruction have to be
duke@435	2667	// appended to the instruction stream by hand.
duke@435	2668	Value m = new Constant(new ObjectConstant(compilation()->method()));
duke@435	2669	h->set_next(m, 0);
duke@435	2670	Value p = new ProfileCounter(m, methodOopDesc::interpreter_invocation_counter_offset_in_bytes(), 1);
duke@435	2671	m->set_next(p, 0);
duke@435	2672	l = p;
duke@435	2673	}
duke@435	2674
duke@435	2675	BlockEnd* g = new Goto(entry, false);
duke@435	2676	l->set_next(g, entry->bci());
duke@435	2677	h->set_end(g);
duke@435	2678	h->set(f);
duke@435	2679	// setup header block end state
duke@435	2680	ValueStack* s = state->copy(); // can use copy since stack is empty (=> no phis)
duke@435	2681	assert(s->stack_is_empty(), "must have empty stack at entry point");
duke@435	2682	g->set_state(s);
duke@435	2683	return h;
duke@435	2684	}
duke@435	2685
duke@435	2686
duke@435	2687
duke@435	2688	BlockBegin* GraphBuilder::setup_start_block(int osr_bci, BlockBegin* std_entry, BlockBegin* osr_entry, ValueStack* state) {
duke@435	2689	BlockBegin* start = new BlockBegin(0);
duke@435	2690
duke@435	2691	// This code eliminates the empty start block at the beginning of
duke@435	2692	// each method. Previously, each method started with the
duke@435	2693	// start-block created below, and this block was followed by the
duke@435	2694	// header block that was always empty. This header block is only
duke@435	2695	// necesary if std_entry is also a backward branch target because
duke@435	2696	// then phi functions may be necessary in the header block. It's
duke@435	2697	// also necessary when profiling so that there's a single block that
duke@435	2698	// can increment the interpreter_invocation_count.
duke@435	2699	BlockBegin* new_header_block;
duke@435	2700	if (std_entry->number_of_preds() == 0 && !profile_branches()) {
duke@435	2701	new_header_block = std_entry;
duke@435	2702	} else {
duke@435	2703	new_header_block = header_block(std_entry, BlockBegin::std_entry_flag, state);
duke@435	2704	}
duke@435	2705
duke@435	2706	// setup start block (root for the IR graph)
duke@435	2707	Base* base =
duke@435	2708	new Base(
duke@435	2709	new_header_block,
duke@435	2710	osr_entry
duke@435	2711	);
duke@435	2712	start->set_next(base, 0);
duke@435	2713	start->set_end(base);
duke@435	2714	// create & setup state for start block
duke@435	2715	start->set_state(state->copy());
duke@435	2716	base->set_state(state->copy());
duke@435	2717
duke@435	2718	if (base->std_entry()->state() == NULL) {
duke@435	2719	// setup states for header blocks
duke@435	2720	base->std_entry()->merge(state);
duke@435	2721	}
duke@435	2722
duke@435	2723	assert(base->std_entry()->state() != NULL, "");
duke@435	2724	return start;
duke@435	2725	}
duke@435	2726
duke@435	2727
duke@435	2728	void GraphBuilder::setup_osr_entry_block() {
duke@435	2729	assert(compilation()->is_osr_compile(), "only for osrs");
duke@435	2730
duke@435	2731	int osr_bci = compilation()->osr_bci();
duke@435	2732	ciBytecodeStream s(method());
duke@435	2733	s.reset_to_bci(osr_bci);
duke@435	2734	s.next();
duke@435	2735	scope_data()->set_stream(&s);
duke@435	2736
duke@435	2737	// create a new block to be the osr setup code
duke@435	2738	_osr_entry = new BlockBegin(osr_bci);
duke@435	2739	_osr_entry->set(BlockBegin::osr_entry_flag);
duke@435	2740	_osr_entry->set_depth_first_number(0);
duke@435	2741	BlockBegin* target = bci2block()->at(osr_bci);
duke@435	2742	assert(target != NULL && target->is_set(BlockBegin::osr_entry_flag), "must be there");
duke@435	2743	// the osr entry has no values for locals
duke@435	2744	ValueStack* state = target->state()->copy();
duke@435	2745	_osr_entry->set_state(state);
duke@435	2746
duke@435	2747	kill_all();
duke@435	2748	_block = _osr_entry;
duke@435	2749	_state = _osr_entry->state()->copy();
duke@435	2750	_last = _osr_entry;
duke@435	2751	Value e = append(new OsrEntry());
duke@435	2752	e->set_needs_null_check(false);
duke@435	2753
duke@435	2754	// OSR buffer is
duke@435	2755	//
duke@435	2756	// locals[nlocals-1..0]
duke@435	2757	// monitors[number_of_locks-1..0]
duke@435	2758	//
duke@435	2759	// locals is a direct copy of the interpreter frame so in the osr buffer
duke@435	2760	// so first slot in the local array is the last local from the interpreter
duke@435	2761	// and last slot is local[0] (receiver) from the interpreter
duke@435	2762	//
duke@435	2763	// Similarly with locks. The first lock slot in the osr buffer is the nth lock
duke@435	2764	// from the interpreter frame, the nth lock slot in the osr buffer is 0th lock
duke@435	2765	// in the interpreter frame (the method lock if a sync method)
duke@435	2766
duke@435	2767	// Initialize monitors in the compiled activation.
duke@435	2768
duke@435	2769	int index;
duke@435	2770	Value local;
duke@435	2771
duke@435	2772	// find all the locals that the interpreter thinks contain live oops
duke@435	2773	const BitMap live_oops = method()->live_local_oops_at_bci(osr_bci);
duke@435	2774
duke@435	2775	// compute the offset into the locals so that we can treat the buffer
duke@435	2776	// as if the locals were still in the interpreter frame
duke@435	2777	int locals_offset = BytesPerWord * (method()->max_locals() - 1);
duke@435	2778	for_each_local_value(state, index, local) {
duke@435	2779	int offset = locals_offset - (index + local->type()->size() - 1) * BytesPerWord;
duke@435	2780	Value get;
duke@435	2781	if (local->type()->is_object_kind() && !live_oops.at(index)) {
duke@435	2782	// The interpreter thinks this local is dead but the compiler
duke@435	2783	// doesn't so pretend that the interpreter passed in null.
duke@435	2784	get = append(new Constant(objectNull));
duke@435	2785	} else {
duke@435	2786	get = append(new UnsafeGetRaw(as_BasicType(local->type()), e,
duke@435	2787	append(new Constant(new IntConstant(offset))),
duke@435	2788	0,
duke@435	2789	true));
duke@435	2790	}
duke@435	2791	_state->store_local(index, get);
duke@435	2792	}
duke@435	2793
duke@435	2794	// the storage for the OSR buffer is freed manually in the LIRGenerator.
duke@435	2795
duke@435	2796	assert(state->caller_state() == NULL, "should be top scope");
duke@435	2797	state->clear_locals();
duke@435	2798	Goto* g = new Goto(target, false);
duke@435	2799	g->set_state(_state->copy());
duke@435	2800	append(g);
duke@435	2801	_osr_entry->set_end(g);
duke@435	2802	target->merge(_osr_entry->end()->state());
duke@435	2803
duke@435	2804	scope_data()->set_stream(NULL);
duke@435	2805	}
duke@435	2806
duke@435	2807
duke@435	2808	ValueStack* GraphBuilder::state_at_entry() {
duke@435	2809	ValueStack* state = new ValueStack(scope(), method()->max_locals(), method()->max_stack());
duke@435	2810
duke@435	2811	// Set up locals for receiver
duke@435	2812	int idx = 0;
duke@435	2813	if (!method()->is_static()) {
duke@435	2814	// we should always see the receiver
duke@435	2815	state->store_local(idx, new Local(objectType, idx));
duke@435	2816	idx = 1;
duke@435	2817	}
duke@435	2818
duke@435	2819	// Set up locals for incoming arguments
duke@435	2820	ciSignature* sig = method()->signature();
duke@435	2821	for (int i = 0; i < sig->count(); i++) {
duke@435	2822	ciType* type = sig->type_at(i);
duke@435	2823	BasicType basic_type = type->basic_type();
duke@435	2824	// don't allow T_ARRAY to propagate into locals types
duke@435	2825	if (basic_type == T_ARRAY) basic_type = T_OBJECT;
duke@435	2826	ValueType* vt = as_ValueType(basic_type);
duke@435	2827	state->store_local(idx, new Local(vt, idx));
duke@435	2828	idx += type->size();
duke@435	2829	}
duke@435	2830
duke@435	2831	// lock synchronized method
duke@435	2832	if (method()->is_synchronized()) {
duke@435	2833	state->lock(scope(), NULL);
duke@435	2834	}
duke@435	2835
duke@435	2836	return state;
duke@435	2837	}
duke@435	2838
duke@435	2839
duke@435	2840	GraphBuilder::GraphBuilder(Compilation* compilation, IRScope* scope)
duke@435	2841	: _scope_data(NULL)
duke@435	2842	, _exception_state(NULL)
duke@435	2843	, _instruction_count(0)
duke@435	2844	, _osr_entry(NULL)
duke@435	2845	, _memory(new MemoryBuffer())
duke@435	2846	, _compilation(compilation)
duke@435	2847	, _inline_bailout_msg(NULL)
duke@435	2848	{
duke@435	2849	int osr_bci = compilation->osr_bci();
duke@435	2850
duke@435	2851	// determine entry points and bci2block mapping
duke@435	2852	BlockListBuilder blm(compilation, scope, osr_bci);
duke@435	2853	CHECK_BAILOUT();
duke@435	2854
duke@435	2855	BlockList* bci2block = blm.bci2block();
duke@435	2856	BlockBegin* start_block = bci2block->at(0);
duke@435	2857
duke@435	2858	assert(is_initialized(), "GraphBuilder must have been initialized");
duke@435	2859	push_root_scope(scope, bci2block, start_block);
duke@435	2860
duke@435	2861	// setup state for std entry
duke@435	2862	_initial_state = state_at_entry();
duke@435	2863	start_block->merge(_initial_state);
duke@435	2864
duke@435	2865	// complete graph
duke@435	2866	_vmap = new ValueMap();
duke@435	2867	scope->compute_lock_stack_size();
duke@435	2868	switch (scope->method()->intrinsic_id()) {
duke@435	2869	case vmIntrinsics::_dabs : // fall through
duke@435	2870	case vmIntrinsics::_dsqrt : // fall through
duke@435	2871	case vmIntrinsics::_dsin : // fall through
duke@435	2872	case vmIntrinsics::_dcos : // fall through
duke@435	2873	case vmIntrinsics::_dtan : // fall through
duke@435	2874	case vmIntrinsics::_dlog : // fall through
duke@435	2875	case vmIntrinsics::_dlog10 : // fall through
duke@435	2876	{
duke@435	2877	// Compiles where the root method is an intrinsic need a special
duke@435	2878	// compilation environment because the bytecodes for the method
duke@435	2879	// shouldn't be parsed during the compilation, only the special
duke@435	2880	// Intrinsic node should be emitted. If this isn't done the the
duke@435	2881	// code for the inlined version will be different than the root
duke@435	2882	// compiled version which could lead to monotonicity problems on
duke@435	2883	// intel.
duke@435	2884
duke@435	2885	// Set up a stream so that appending instructions works properly.
duke@435	2886	ciBytecodeStream s(scope->method());
duke@435	2887	s.reset_to_bci(0);
duke@435	2888	scope_data()->set_stream(&s);
duke@435	2889	s.next();
duke@435	2890
duke@435	2891	// setup the initial block state
duke@435	2892	_block = start_block;
duke@435	2893	_state = start_block->state()->copy();
duke@435	2894	_last = start_block;
duke@435	2895	load_local(doubleType, 0);
duke@435	2896
duke@435	2897	// Emit the intrinsic node.
duke@435	2898	bool result = try_inline_intrinsics(scope->method());
duke@435	2899	if (!result) BAILOUT("failed to inline intrinsic");
duke@435	2900	method_return(dpop());
duke@435	2901
duke@435	2902	// connect the begin and end blocks and we're all done.
duke@435	2903	BlockEnd* end = last()->as_BlockEnd();
duke@435	2904	block()->set_end(end);
duke@435	2905	end->set_state(state());
duke@435	2906	break;
duke@435	2907	}
duke@435	2908	default:
duke@435	2909	scope_data()->add_to_work_list(start_block);
duke@435	2910	iterate_all_blocks();
duke@435	2911	break;
duke@435	2912	}
duke@435	2913	CHECK_BAILOUT();
duke@435	2914
duke@435	2915	_start = setup_start_block(osr_bci, start_block, _osr_entry, _initial_state);
duke@435	2916
duke@435	2917	eliminate_redundant_phis(_start);
duke@435	2918
duke@435	2919	NOT_PRODUCT(if (PrintValueNumbering && Verbose) print_stats());
duke@435	2920	// for osr compile, bailout if some requirements are not fulfilled
duke@435	2921	if (osr_bci != -1) {
duke@435	2922	BlockBegin* osr_block = blm.bci2block()->at(osr_bci);
duke@435	2923	assert(osr_block->is_set(BlockBegin::was_visited_flag),"osr entry must have been visited for osr compile");
duke@435	2924
duke@435	2925	// check if osr entry point has empty stack - we cannot handle non-empty stacks at osr entry points
duke@435	2926	if (!osr_block->state()->stack_is_empty()) {
duke@435	2927	BAILOUT("stack not empty at OSR entry point");
duke@435	2928	}
duke@435	2929	}
duke@435	2930	#ifndef PRODUCT
duke@435	2931	if (PrintCompilation && Verbose) tty->print_cr("Created %d Instructions", _instruction_count);
duke@435	2932	#endif
duke@435	2933	}
duke@435	2934
duke@435	2935
duke@435	2936	ValueStack* GraphBuilder::lock_stack() {
duke@435	2937	// return a new ValueStack representing just the current lock stack
duke@435	2938	// (for debug info at safepoints in exception throwing or handling)
duke@435	2939	ValueStack* new_stack = state()->copy_locks();
duke@435	2940	return new_stack;
duke@435	2941	}
duke@435	2942
duke@435	2943
duke@435	2944	int GraphBuilder::recursive_inline_level(ciMethod* cur_callee) const {
duke@435	2945	int recur_level = 0;
duke@435	2946	for (IRScope* s = scope(); s != NULL; s = s->caller()) {
duke@435	2947	if (s->method() == cur_callee) {
duke@435	2948	++recur_level;
duke@435	2949	}
duke@435	2950	}
duke@435	2951	return recur_level;
duke@435	2952	}
duke@435	2953
duke@435	2954
duke@435	2955	bool GraphBuilder::try_inline(ciMethod* callee, bool holder_known) {
duke@435	2956	// Clear out any existing inline bailout condition
duke@435	2957	clear_inline_bailout();
duke@435	2958
duke@435	2959	if (callee->should_exclude()) {
duke@435	2960	// callee is excluded
duke@435	2961	INLINE_BAILOUT("excluded by CompilerOracle")
duke@435	2962	} else if (!callee->can_be_compiled()) {
duke@435	2963	// callee is not compilable (prob. has breakpoints)
duke@435	2964	INLINE_BAILOUT("not compilable")
duke@435	2965	} else if (callee->intrinsic_id() != vmIntrinsics::_none && try_inline_intrinsics(callee)) {
duke@435	2966	// intrinsics can be native or not
duke@435	2967	return true;
duke@435	2968	} else if (callee->is_native()) {
duke@435	2969	// non-intrinsic natives cannot be inlined
duke@435	2970	INLINE_BAILOUT("non-intrinsic native")
duke@435	2971	} else if (callee->is_abstract()) {
duke@435	2972	INLINE_BAILOUT("abstract")
duke@435	2973	} else {
duke@435	2974	return try_inline_full(callee, holder_known);
duke@435	2975	}
duke@435	2976	}
duke@435	2977
duke@435	2978
duke@435	2979	bool GraphBuilder::try_inline_intrinsics(ciMethod* callee) {
duke@435	2980	if (!InlineNatives ) INLINE_BAILOUT("intrinsic method inlining disabled");
never@1895	2981	if (callee->is_synchronized()) {
never@1895	2982	// We don't currently support any synchronized intrinsics
never@1895	2983	return false;
never@1895	2984	}
never@1895	2985
duke@435	2986	// callee seems like a good candidate
duke@435	2987	// determine id
duke@435	2988	bool preserves_state = false;
duke@435	2989	bool cantrap = true;
duke@435	2990	vmIntrinsics::ID id = callee->intrinsic_id();
duke@435	2991	switch (id) {
duke@435	2992	case vmIntrinsics::_arraycopy :
duke@435	2993	if (!InlineArrayCopy) return false;
duke@435	2994	break;
duke@435	2995
duke@435	2996	case vmIntrinsics::_currentTimeMillis:
duke@435	2997	case vmIntrinsics::_nanoTime:
duke@435	2998	preserves_state = true;
duke@435	2999	cantrap = false;
duke@435	3000	break;
duke@435	3001
duke@435	3002	case vmIntrinsics::_floatToRawIntBits :
duke@435	3003	case vmIntrinsics::_intBitsToFloat :
duke@435	3004	case vmIntrinsics::_doubleToRawLongBits :
duke@435	3005	case vmIntrinsics::_longBitsToDouble :
duke@435	3006	if (!InlineMathNatives) return false;
duke@435	3007	preserves_state = true;
duke@435	3008	cantrap = false;
duke@435	3009	break;
duke@435	3010
duke@435	3011	case vmIntrinsics::_getClass :
duke@435	3012	if (!InlineClassNatives) return false;
duke@435	3013	preserves_state = true;
duke@435	3014	break;
duke@435	3015
duke@435	3016	case vmIntrinsics::_currentThread :
duke@435	3017	if (!InlineThreadNatives) return false;
duke@435	3018	preserves_state = true;
duke@435	3019	cantrap = false;
duke@435	3020	break;
duke@435	3021
duke@435	3022	case vmIntrinsics::_dabs : // fall through
duke@435	3023	case vmIntrinsics::_dsqrt : // fall through
duke@435	3024	case vmIntrinsics::_dsin : // fall through
duke@435	3025	case vmIntrinsics::_dcos : // fall through
duke@435	3026	case vmIntrinsics::_dtan : // fall through
duke@435	3027	case vmIntrinsics::_dlog : // fall through
duke@435	3028	case vmIntrinsics::_dlog10 : // fall through
duke@435	3029	if (!InlineMathNatives) return false;
duke@435	3030	cantrap = false;
duke@435	3031	preserves_state = true;
duke@435	3032	break;
duke@435	3033
duke@435	3034	// sun/misc/AtomicLong.attemptUpdate
duke@435	3035	case vmIntrinsics::_attemptUpdate :
duke@435	3036	if (!VM_Version::supports_cx8()) return false;
duke@435	3037	if (!InlineAtomicLong) return false;
duke@435	3038	preserves_state = true;
duke@435	3039	break;
duke@435	3040
duke@435	3041	// Use special nodes for Unsafe instructions so we can more easily
duke@435	3042	// perform an address-mode optimization on the raw variants
duke@435	3043	case vmIntrinsics::_getObject : return append_unsafe_get_obj(callee, T_OBJECT, false);
duke@435	3044	case vmIntrinsics::_getBoolean: return append_unsafe_get_obj(callee, T_BOOLEAN, false);
duke@435	3045	case vmIntrinsics::_getByte : return append_unsafe_get_obj(callee, T_BYTE, false);
duke@435	3046	case vmIntrinsics::_getShort : return append_unsafe_get_obj(callee, T_SHORT, false);
duke@435	3047	case vmIntrinsics::_getChar : return append_unsafe_get_obj(callee, T_CHAR, false);
duke@435	3048	case vmIntrinsics::_getInt : return append_unsafe_get_obj(callee, T_INT, false);
duke@435	3049	case vmIntrinsics::_getLong : return append_unsafe_get_obj(callee, T_LONG, false);
duke@435	3050	case vmIntrinsics::_getFloat : return append_unsafe_get_obj(callee, T_FLOAT, false);
duke@435	3051	case vmIntrinsics::_getDouble : return append_unsafe_get_obj(callee, T_DOUBLE, false);
duke@435	3052
duke@435	3053	case vmIntrinsics::_putObject : return append_unsafe_put_obj(callee, T_OBJECT, false);
duke@435	3054	case vmIntrinsics::_putBoolean: return append_unsafe_put_obj(callee, T_BOOLEAN, false);
duke@435	3055	case vmIntrinsics::_putByte : return append_unsafe_put_obj(callee, T_BYTE, false);
duke@435	3056	case vmIntrinsics::_putShort : return append_unsafe_put_obj(callee, T_SHORT, false);
duke@435	3057	case vmIntrinsics::_putChar : return append_unsafe_put_obj(callee, T_CHAR, false);
duke@435	3058	case vmIntrinsics::_putInt : return append_unsafe_put_obj(callee, T_INT, false);
duke@435	3059	case vmIntrinsics::_putLong : return append_unsafe_put_obj(callee, T_LONG, false);
duke@435	3060	case vmIntrinsics::_putFloat : return append_unsafe_put_obj(callee, T_FLOAT, false);
duke@435	3061	case vmIntrinsics::_putDouble : return append_unsafe_put_obj(callee, T_DOUBLE, false);
duke@435	3062
duke@435	3063	case vmIntrinsics::_getObjectVolatile : return append_unsafe_get_obj(callee, T_OBJECT, true);
duke@435	3064	case vmIntrinsics::_getBooleanVolatile: return append_unsafe_get_obj(callee, T_BOOLEAN, true);
duke@435	3065	case vmIntrinsics::_getByteVolatile : return append_unsafe_get_obj(callee, T_BYTE, true);
duke@435	3066	case vmIntrinsics::_getShortVolatile : return append_unsafe_get_obj(callee, T_SHORT, true);
duke@435	3067	case vmIntrinsics::_getCharVolatile : return append_unsafe_get_obj(callee, T_CHAR, true);
duke@435	3068	case vmIntrinsics::_getIntVolatile : return append_unsafe_get_obj(callee, T_INT, true);
duke@435	3069	case vmIntrinsics::_getLongVolatile : return append_unsafe_get_obj(callee, T_LONG, true);
duke@435	3070	case vmIntrinsics::_getFloatVolatile : return append_unsafe_get_obj(callee, T_FLOAT, true);
duke@435	3071	case vmIntrinsics::_getDoubleVolatile : return append_unsafe_get_obj(callee, T_DOUBLE, true);
duke@435	3072
duke@435	3073	case vmIntrinsics::_putObjectVolatile : return append_unsafe_put_obj(callee, T_OBJECT, true);
duke@435	3074	case vmIntrinsics::_putBooleanVolatile: return append_unsafe_put_obj(callee, T_BOOLEAN, true);
duke@435	3075	case vmIntrinsics::_putByteVolatile : return append_unsafe_put_obj(callee, T_BYTE, true);
duke@435	3076	case vmIntrinsics::_putShortVolatile : return append_unsafe_put_obj(callee, T_SHORT, true);
duke@435	3077	case vmIntrinsics::_putCharVolatile : return append_unsafe_put_obj(callee, T_CHAR, true);
duke@435	3078	case vmIntrinsics::_putIntVolatile : return append_unsafe_put_obj(callee, T_INT, true);
duke@435	3079	case vmIntrinsics::_putLongVolatile : return append_unsafe_put_obj(callee, T_LONG, true);
duke@435	3080	case vmIntrinsics::_putFloatVolatile : return append_unsafe_put_obj(callee, T_FLOAT, true);
duke@435	3081	case vmIntrinsics::_putDoubleVolatile : return append_unsafe_put_obj(callee, T_DOUBLE, true);
duke@435	3082
duke@435	3083	case vmIntrinsics::_getByte_raw : return append_unsafe_get_raw(callee, T_BYTE);
duke@435	3084	case vmIntrinsics::_getShort_raw : return append_unsafe_get_raw(callee, T_SHORT);
duke@435	3085	case vmIntrinsics::_getChar_raw : return append_unsafe_get_raw(callee, T_CHAR);
duke@435	3086	case vmIntrinsics::_getInt_raw : return append_unsafe_get_raw(callee, T_INT);
duke@435	3087	case vmIntrinsics::_getLong_raw : return append_unsafe_get_raw(callee, T_LONG);
duke@435	3088	case vmIntrinsics::_getFloat_raw : return append_unsafe_get_raw(callee, T_FLOAT);
duke@435	3089	case vmIntrinsics::_getDouble_raw : return append_unsafe_get_raw(callee, T_DOUBLE);
duke@435	3090
duke@435	3091	case vmIntrinsics::_putByte_raw : return append_unsafe_put_raw(callee, T_BYTE);
duke@435	3092	case vmIntrinsics::_putShort_raw : return append_unsafe_put_raw(callee, T_SHORT);
duke@435	3093	case vmIntrinsics::_putChar_raw : return append_unsafe_put_raw(callee, T_CHAR);
duke@435	3094	case vmIntrinsics::_putInt_raw : return append_unsafe_put_raw(callee, T_INT);
duke@435	3095	case vmIntrinsics::_putLong_raw : return append_unsafe_put_raw(callee, T_LONG);
duke@435	3096	case vmIntrinsics::_putFloat_raw : return append_unsafe_put_raw(callee, T_FLOAT);
duke@435	3097	case vmIntrinsics::_putDouble_raw : return append_unsafe_put_raw(callee, T_DOUBLE);
duke@435	3098
duke@435	3099	case vmIntrinsics::_prefetchRead : return append_unsafe_prefetch(callee, false, false);
duke@435	3100	case vmIntrinsics::_prefetchWrite : return append_unsafe_prefetch(callee, false, true);
duke@435	3101	case vmIntrinsics::_prefetchReadStatic : return append_unsafe_prefetch(callee, true, false);
duke@435	3102	case vmIntrinsics::_prefetchWriteStatic : return append_unsafe_prefetch(callee, true, true);
duke@435	3103
duke@435	3104	case vmIntrinsics::_checkIndex :
duke@435	3105	if (!InlineNIOCheckIndex) return false;
duke@435	3106	preserves_state = true;
duke@435	3107	break;
duke@435	3108	case vmIntrinsics::_putOrderedObject : return append_unsafe_put_obj(callee, T_OBJECT, true);
duke@435	3109	case vmIntrinsics::_putOrderedInt : return append_unsafe_put_obj(callee, T_INT, true);
duke@435	3110	case vmIntrinsics::_putOrderedLong : return append_unsafe_put_obj(callee, T_LONG, true);
duke@435	3111
duke@435	3112	case vmIntrinsics::_compareAndSwapLong:
duke@435	3113	if (!VM_Version::supports_cx8()) return false;
duke@435	3114	// fall through
duke@435	3115	case vmIntrinsics::_compareAndSwapInt:
duke@435	3116	case vmIntrinsics::_compareAndSwapObject:
duke@435	3117	append_unsafe_CAS(callee);
duke@435	3118	return true;
duke@435	3119
duke@435	3120	default : return false; // do not inline
duke@435	3121	}
duke@435	3122	// create intrinsic node
duke@435	3123	const bool has_receiver = !callee->is_static();
duke@435	3124	ValueType* result_type = as_ValueType(callee->return_type());
duke@435	3125
duke@435	3126	Values* args = state()->pop_arguments(callee->arg_size());
duke@435	3127	ValueStack* locks = lock_stack();
duke@435	3128	if (profile_calls()) {
duke@435	3129	// Don't profile in the special case where the root method
duke@435	3130	// is the intrinsic
duke@435	3131	if (callee != method()) {
duke@435	3132	Value recv = NULL;
duke@435	3133	if (has_receiver) {
duke@435	3134	recv = args->at(0);
duke@435	3135	null_check(recv);
duke@435	3136	}
duke@435	3137	profile_call(recv, NULL);
duke@435	3138	}
duke@435	3139	}
duke@435	3140
duke@435	3141	Intrinsic* result = new Intrinsic(result_type, id, args, has_receiver, lock_stack(),
duke@435	3142	preserves_state, cantrap);
duke@435	3143	// append instruction & push result
duke@435	3144	Value value = append_split(result);
duke@435	3145	if (result_type != voidType) push(result_type, value);
duke@435	3146
duke@435	3147	#ifndef PRODUCT
duke@435	3148	// printing
duke@435	3149	if (PrintInlining) {
duke@435	3150	print_inline_result(callee, true);
duke@435	3151	}
duke@435	3152	#endif
duke@435	3153
duke@435	3154	// done
duke@435	3155	return true;
duke@435	3156	}
duke@435	3157
duke@435	3158
duke@435	3159	bool GraphBuilder::try_inline_jsr(int jsr_dest_bci) {
duke@435	3160	// Introduce a new callee continuation point - all Ret instructions
duke@435	3161	// will be replaced with Gotos to this point.
duke@435	3162	BlockBegin* cont = block_at(next_bci());
duke@435	3163	assert(cont != NULL, "continuation must exist (BlockListBuilder starts a new block after a jsr");
duke@435	3164
duke@435	3165	// Note: can not assign state to continuation yet, as we have to
duke@435	3166	// pick up the state from the Ret instructions.
duke@435	3167
duke@435	3168	// Push callee scope
duke@435	3169	push_scope_for_jsr(cont, jsr_dest_bci);
duke@435	3170
duke@435	3171	// Temporarily set up bytecode stream so we can append instructions
duke@435	3172	// (only using the bci of this stream)
duke@435	3173	scope_data()->set_stream(scope_data()->parent()->stream());
duke@435	3174
duke@435	3175	BlockBegin* jsr_start_block = block_at(jsr_dest_bci);
duke@435	3176	assert(jsr_start_block != NULL, "jsr start block must exist");
duke@435	3177	assert(!jsr_start_block->is_set(BlockBegin::was_visited_flag), "should not have visited jsr yet");
duke@435	3178	Goto* goto_sub = new Goto(jsr_start_block, false);
duke@435	3179	goto_sub->set_state(state());
duke@435	3180	// Must copy state to avoid wrong sharing when parsing bytecodes
duke@435	3181	assert(jsr_start_block->state() == NULL, "should have fresh jsr starting block");
duke@435	3182	jsr_start_block->set_state(state()->copy());
duke@435	3183	append(goto_sub);
duke@435	3184	_block->set_end(goto_sub);
duke@435	3185	_last = _block = jsr_start_block;
duke@435	3186
duke@435	3187	// Clear out bytecode stream
duke@435	3188	scope_data()->set_stream(NULL);
duke@435	3189
duke@435	3190	scope_data()->add_to_work_list(jsr_start_block);
duke@435	3191
duke@435	3192	// Ready to resume parsing in subroutine
duke@435	3193	iterate_all_blocks();
duke@435	3194
duke@435	3195	// If we bailed out during parsing, return immediately (this is bad news)
duke@435	3196	CHECK_BAILOUT_(false);
duke@435	3197
duke@435	3198	// Detect whether the continuation can actually be reached. If not,
duke@435	3199	// it has not had state set by the join() operations in
duke@435	3200	// iterate_bytecodes_for_block()/ret() and we should not touch the
duke@435	3201	// iteration state. The calling activation of
duke@435	3202	// iterate_bytecodes_for_block will then complete normally.
duke@435	3203	if (cont->state() != NULL) {
duke@435	3204	if (!cont->is_set(BlockBegin::was_visited_flag)) {
duke@435	3205	// add continuation to work list instead of parsing it immediately
duke@435	3206	scope_data()->parent()->add_to_work_list(cont);
duke@435	3207	}
duke@435	3208	}
duke@435	3209
duke@435	3210	assert(jsr_continuation() == cont, "continuation must not have changed");
duke@435	3211	assert(!jsr_continuation()->is_set(BlockBegin::was_visited_flag) ||
duke@435	3212	jsr_continuation()->is_set(BlockBegin::parser_loop_header_flag),
duke@435	3213	"continuation can only be visited in case of backward branches");
duke@435	3214	assert(_last && _last->as_BlockEnd(), "block must have end");
duke@435	3215
duke@435	3216	// continuation is in work list, so end iteration of current block
duke@435	3217	_skip_block = true;
duke@435	3218	pop_scope_for_jsr();
duke@435	3219
duke@435	3220	return true;
duke@435	3221	}
duke@435	3222
duke@435	3223
duke@435	3224	// Inline the entry of a synchronized method as a monitor enter and
duke@435	3225	// register the exception handler which releases the monitor if an
duke@435	3226	// exception is thrown within the callee. Note that the monitor enter
duke@435	3227	// cannot throw an exception itself, because the receiver is
duke@435	3228	// guaranteed to be non-null by the explicit null check at the
duke@435	3229	// beginning of inlining.
duke@435	3230	void GraphBuilder::inline_sync_entry(Value lock, BlockBegin* sync_handler) {
duke@435	3231	assert(lock != NULL && sync_handler != NULL, "lock or handler missing");
duke@435	3232
duke@435	3233	set_exception_state(state()->copy());
duke@435	3234	monitorenter(lock, SynchronizationEntryBCI);
duke@435	3235	assert(_last->as_MonitorEnter() != NULL, "monitor enter expected");
duke@435	3236	_last->set_needs_null_check(false);
duke@435	3237
duke@435	3238	sync_handler->set(BlockBegin::exception_entry_flag);
duke@435	3239	sync_handler->set(BlockBegin::is_on_work_list_flag);
duke@435	3240
duke@435	3241	ciExceptionHandler* desc = new ciExceptionHandler(method()->holder(), 0, method()->code_size(), -1, 0);
duke@435	3242	XHandler* h = new XHandler(desc);
duke@435	3243	h->set_entry_block(sync_handler);
duke@435	3244	scope_data()->xhandlers()->append(h);
duke@435	3245	scope_data()->set_has_handler();
duke@435	3246	}
duke@435	3247
duke@435	3248
duke@435	3249	// If an exception is thrown and not handled within an inlined
duke@435	3250	// synchronized method, the monitor must be released before the
duke@435	3251	// exception is rethrown in the outer scope. Generate the appropriate
duke@435	3252	// instructions here.
duke@435	3253	void GraphBuilder::fill_sync_handler(Value lock, BlockBegin* sync_handler, bool default_handler) {
duke@435	3254	BlockBegin* orig_block = _block;
duke@435	3255	ValueStack* orig_state = _state;
duke@435	3256	Instruction* orig_last = _last;
duke@435	3257	_last = _block = sync_handler;
duke@435	3258	_state = sync_handler->state()->copy();
duke@435	3259
duke@435	3260	assert(sync_handler != NULL, "handler missing");
duke@435	3261	assert(!sync_handler->is_set(BlockBegin::was_visited_flag), "is visited here");
duke@435	3262
duke@435	3263	assert(lock != NULL || default_handler, "lock or handler missing");
duke@435	3264
duke@435	3265	XHandler* h = scope_data()->xhandlers()->remove_last();
duke@435	3266	assert(h->entry_block() == sync_handler, "corrupt list of handlers");
duke@435	3267
duke@435	3268	block()->set(BlockBegin::was_visited_flag);
duke@435	3269	Value exception = append_with_bci(new ExceptionObject(), SynchronizationEntryBCI);
duke@435	3270	assert(exception->is_pinned(), "must be");
duke@435	3271
duke@435	3272	int bci = SynchronizationEntryBCI;
duke@435	3273	if (lock) {
duke@435	3274	assert(state()->locks_size() > 0 && state()->lock_at(state()->locks_size() - 1) == lock, "lock is missing");
duke@435	3275	if (lock->bci() == -99) {
duke@435	3276	lock = append_with_bci(lock, -1);
duke@435	3277	}
duke@435	3278
duke@435	3279	// exit the monitor in the context of the synchronized method
duke@435	3280	monitorexit(lock, SynchronizationEntryBCI);
duke@435	3281
duke@435	3282	// exit the context of the synchronized method
duke@435	3283	if (!default_handler) {
duke@435	3284	pop_scope();
duke@435	3285	_state = _state->copy();
duke@435	3286	bci = _state->scope()->caller_bci();
duke@435	3287	_state = _state->pop_scope()->copy();
duke@435	3288	}
duke@435	3289	}
duke@435	3290
duke@435	3291	// perform the throw as if at the the call site
duke@435	3292	apush(exception);
duke@435	3293
duke@435	3294	set_exception_state(state()->copy());
duke@435	3295	throw_op(bci);
duke@435	3296
duke@435	3297	BlockEnd* end = last()->as_BlockEnd();
duke@435	3298	block()->set_end(end);
duke@435	3299	end->set_state(state());
duke@435	3300
duke@435	3301	_block = orig_block;
duke@435	3302	_state = orig_state;
duke@435	3303	_last = orig_last;
duke@435	3304	}
duke@435	3305
duke@435	3306
duke@435	3307	bool GraphBuilder::try_inline_full(ciMethod* callee, bool holder_known) {
duke@435	3308	assert(!callee->is_native(), "callee must not be native");
duke@435	3309
duke@435	3310	// first perform tests of things it's not possible to inline
duke@435	3311	if (callee->has_exception_handlers() &&
duke@435	3312	!InlineMethodsWithExceptionHandlers) INLINE_BAILOUT("callee has exception handlers");
duke@435	3313	if (callee->is_synchronized() &&
duke@435	3314	!InlineSynchronizedMethods ) INLINE_BAILOUT("callee is synchronized");
duke@435	3315	if (!callee->holder()->is_initialized()) INLINE_BAILOUT("callee's klass not initialized yet");
duke@435	3316	if (!callee->has_balanced_monitors()) INLINE_BAILOUT("callee's monitors do not match");
duke@435	3317
duke@435	3318	// Proper inlining of methods with jsrs requires a little more work.
duke@435	3319	if (callee->has_jsrs() ) INLINE_BAILOUT("jsrs not handled properly by inliner yet");
duke@435	3320
duke@435	3321	// now perform tests that are based on flag settings
duke@435	3322	if (inline_level() > MaxInlineLevel ) INLINE_BAILOUT("too-deep inlining");
duke@435	3323	if (recursive_inline_level(callee) > MaxRecursiveInlineLevel) INLINE_BAILOUT("too-deep recursive inlining");
duke@435	3324	if (callee->code_size() > max_inline_size() ) INLINE_BAILOUT("callee is too large");
duke@435	3325
duke@435	3326	// don't inline throwable methods unless the inlining tree is rooted in a throwable class
duke@435	3327	if (callee->name() == ciSymbol::object_initializer_name() &&
duke@435	3328	callee->holder()->is_subclass_of(ciEnv::current()->Throwable_klass())) {
duke@435	3329	// Throwable constructor call
duke@435	3330	IRScope* top = scope();
duke@435	3331	while (top->caller() != NULL) {
duke@435	3332	top = top->caller();
duke@435	3333	}
duke@435	3334	if (!top->method()->holder()->is_subclass_of(ciEnv::current()->Throwable_klass())) {
duke@435	3335	INLINE_BAILOUT("don't inline Throwable constructors");
duke@435	3336	}
duke@435	3337	}
duke@435	3338
duke@435	3339	// When SSE2 is used on intel, then no special handling is needed
duke@435	3340	// for strictfp because the enum-constant is fixed at compile time,
duke@435	3341	// the check for UseSSE2 is needed here
duke@435	3342	if (strict_fp_requires_explicit_rounding && UseSSE < 2 && method()->is_strict() != callee->is_strict()) {
duke@435	3343	INLINE_BAILOUT("caller and callee have different strict fp requirements");
duke@435	3344	}
duke@435	3345
duke@435	3346	if (compilation()->env()->num_inlined_bytecodes() > DesiredMethodLimit) {
duke@435	3347	INLINE_BAILOUT("total inlining greater than DesiredMethodLimit");
duke@435	3348	}
duke@435	3349
duke@435	3350	#ifndef PRODUCT
duke@435	3351	// printing
duke@435	3352	if (PrintInlining) {
duke@435	3353	print_inline_result(callee, true);
duke@435	3354	}
duke@435	3355	#endif
duke@435	3356
duke@435	3357	// NOTE: Bailouts from this point on, which occur at the
duke@435	3358	// GraphBuilder level, do not cause bailout just of the inlining but
duke@435	3359	// in fact of the entire compilation.
duke@435	3360
duke@435	3361	BlockBegin* orig_block = block();
duke@435	3362
duke@435	3363	const int args_base = state()->stack_size() - callee->arg_size();
duke@435	3364	assert(args_base >= 0, "stack underflow during inlining");
duke@435	3365
duke@435	3366	// Insert null check if necessary
duke@435	3367	Value recv = NULL;
duke@435	3368	if (code() != Bytecodes::_invokestatic) {
duke@435	3369	// note: null check must happen even if first instruction of callee does
duke@435	3370	// an implicit null check since the callee is in a different scope
duke@435	3371	// and we must make sure exception handling does the right thing
duke@435	3372	assert(!callee->is_static(), "callee must not be static");
duke@435	3373	assert(callee->arg_size() > 0, "must have at least a receiver");
duke@435	3374	recv = state()->stack_at(args_base);
duke@435	3375	null_check(recv);
duke@435	3376	}
duke@435	3377
duke@435	3378	if (profile_inlined_calls()) {
duke@435	3379	profile_call(recv, holder_known ? callee->holder() : NULL);
duke@435	3380	}
duke@435	3381
duke@435	3382	profile_invocation(callee);
duke@435	3383
duke@435	3384	// Introduce a new callee continuation point - if the callee has
duke@435	3385	// more than one return instruction or the return does not allow
duke@435	3386	// fall-through of control flow, all return instructions of the
duke@435	3387	// callee will need to be replaced by Goto's pointing to this
duke@435	3388	// continuation point.
duke@435	3389	BlockBegin* cont = block_at(next_bci());
duke@435	3390	bool continuation_existed = true;
duke@435	3391	if (cont == NULL) {
duke@435	3392	cont = new BlockBegin(next_bci());
duke@435	3393	// low number so that continuation gets parsed as early as possible
duke@435	3394	cont->set_depth_first_number(0);
duke@435	3395	#ifndef PRODUCT
duke@435	3396	if (PrintInitialBlockList) {
duke@435	3397	tty->print_cr("CFG: created block %d (bci %d) as continuation for inline at bci %d",
duke@435	3398	cont->block_id(), cont->bci(), bci());
duke@435	3399	}
duke@435	3400	#endif
duke@435	3401	continuation_existed = false;
duke@435	3402	}
duke@435	3403	// Record number of predecessors of continuation block before
duke@435	3404	// inlining, to detect if inlined method has edges to its
duke@435	3405	// continuation after inlining.
duke@435	3406	int continuation_preds = cont->number_of_preds();
duke@435	3407
duke@435	3408	// Push callee scope
duke@435	3409	push_scope(callee, cont);
duke@435	3410
duke@435	3411	// the BlockListBuilder for the callee could have bailed out
duke@435	3412	CHECK_BAILOUT_(false);
duke@435	3413
duke@435	3414	// Temporarily set up bytecode stream so we can append instructions
duke@435	3415	// (only using the bci of this stream)
duke@435	3416	scope_data()->set_stream(scope_data()->parent()->stream());
duke@435	3417
duke@435	3418	// Pass parameters into callee state: add assignments
duke@435	3419	// note: this will also ensure that all arguments are computed before being passed
duke@435	3420	ValueStack* callee_state = state();
duke@435	3421	ValueStack* caller_state = scope()->caller_state();
duke@435	3422	{ int i = args_base;
duke@435	3423	while (i < caller_state->stack_size()) {
duke@435	3424	const int par_no = i - args_base;
duke@435	3425	Value arg = caller_state->stack_at_inc(i);
duke@435	3426	// NOTE: take base() of arg->type() to avoid problems storing
duke@435	3427	// constants
duke@435	3428	store_local(callee_state, arg, arg->type()->base(), par_no);
duke@435	3429	}
duke@435	3430	}
duke@435	3431
duke@435	3432	// Remove args from stack.
duke@435	3433	// Note that we preserve locals state in case we can use it later
duke@435	3434	// (see use of pop_scope() below)
duke@435	3435	caller_state->truncate_stack(args_base);
duke@435	3436	callee_state->truncate_stack(args_base);
duke@435	3437
duke@435	3438	// Setup state that is used at returns form the inlined method.
duke@435	3439	// This is essentially the state of the continuation block,
duke@435	3440	// but without the return value on stack, if any, this will
duke@435	3441	// be pushed at the return instruction (see method_return).
duke@435	3442	scope_data()->set_continuation_state(caller_state->copy());
duke@435	3443
duke@435	3444	// Compute lock stack size for callee scope now that args have been passed
duke@435	3445	scope()->compute_lock_stack_size();
duke@435	3446
duke@435	3447	Value lock;
duke@435	3448	BlockBegin* sync_handler;
duke@435	3449
duke@435	3450	// Inline the locking of the receiver if the callee is synchronized
duke@435	3451	if (callee->is_synchronized()) {
duke@435	3452	lock = callee->is_static() ? append(new Constant(new InstanceConstant(callee->holder()->java_mirror())))
duke@435	3453	: state()->local_at(0);
duke@435	3454	sync_handler = new BlockBegin(-1);
duke@435	3455	inline_sync_entry(lock, sync_handler);
duke@435	3456
duke@435	3457	// recompute the lock stack size
duke@435	3458	scope()->compute_lock_stack_size();
duke@435	3459	}
duke@435	3460
duke@435	3461
duke@435	3462	BlockBegin* callee_start_block = block_at(0);
duke@435	3463	if (callee_start_block != NULL) {
duke@435	3464	assert(callee_start_block->is_set(BlockBegin::parser_loop_header_flag), "must be loop header");
duke@435	3465	Goto* goto_callee = new Goto(callee_start_block, false);
duke@435	3466	goto_callee->set_state(state());
duke@435	3467	// The state for this goto is in the scope of the callee, so use
duke@435	3468	// the entry bci for the callee instead of the call site bci.
duke@435	3469	append_with_bci(goto_callee, 0);
duke@435	3470	_block->set_end(goto_callee);
duke@435	3471	callee_start_block->merge(callee_state);
duke@435	3472
duke@435	3473	_last = _block = callee_start_block;
duke@435	3474
duke@435	3475	scope_data()->add_to_work_list(callee_start_block);
duke@435	3476	}
duke@435	3477
duke@435	3478	// Clear out bytecode stream
duke@435	3479	scope_data()->set_stream(NULL);
duke@435	3480
duke@435	3481	// Ready to resume parsing in callee (either in the same block we
duke@435	3482	// were in before or in the callee's start block)
duke@435	3483	iterate_all_blocks(callee_start_block == NULL);
duke@435	3484
duke@435	3485	// If we bailed out during parsing, return immediately (this is bad news)
duke@435	3486	if (bailed_out()) return false;
duke@435	3487
duke@435	3488	// iterate_all_blocks theoretically traverses in random order; in
duke@435	3489	// practice, we have only traversed the continuation if we are
duke@435	3490	// inlining into a subroutine
duke@435	3491	assert(continuation_existed ||
duke@435	3492	!continuation()->is_set(BlockBegin::was_visited_flag),
duke@435	3493	"continuation should not have been parsed yet if we created it");
duke@435	3494
duke@435	3495	// If we bailed out during parsing, return immediately (this is bad news)
duke@435	3496	CHECK_BAILOUT_(false);
duke@435	3497
duke@435	3498	// At this point we are almost ready to return and resume parsing of
duke@435	3499	// the caller back in the GraphBuilder. The only thing we want to do
duke@435	3500	// first is an optimization: during parsing of the callee we
duke@435	3501	// generated at least one Goto to the continuation block. If we
duke@435	3502	// generated exactly one, and if the inlined method spanned exactly
duke@435	3503	// one block (and we didn't have to Goto its entry), then we snip
duke@435	3504	// off the Goto to the continuation, allowing control to fall
duke@435	3505	// through back into the caller block and effectively performing
duke@435	3506	// block merging. This allows load elimination and CSE to take place
duke@435	3507	// across multiple callee scopes if they are relatively simple, and
duke@435	3508	// is currently essential to making inlining profitable.
duke@435	3509	if ( num_returns() == 1
duke@435	3510	&& block() == orig_block
duke@435	3511	&& block() == inline_cleanup_block()) {
duke@435	3512	_last = inline_cleanup_return_prev();
duke@435	3513	_state = inline_cleanup_state()->pop_scope();
duke@435	3514	} else if (continuation_preds == cont->number_of_preds()) {
duke@435	3515	// Inlining caused that the instructions after the invoke in the
duke@435	3516	// caller are not reachable any more. So skip filling this block
duke@435	3517	// with instructions!
duke@435	3518	assert (cont == continuation(), "");
duke@435	3519	assert(_last && _last->as_BlockEnd(), "");
duke@435	3520	_skip_block = true;
duke@435	3521	} else {
duke@435	3522	// Resume parsing in continuation block unless it was already parsed.
duke@435	3523	// Note that if we don't change _last here, iteration in
duke@435	3524	// iterate_bytecodes_for_block will stop when we return.
duke@435	3525	if (!continuation()->is_set(BlockBegin::was_visited_flag)) {
duke@435	3526	// add continuation to work list instead of parsing it immediately
duke@435	3527	assert(_last && _last->as_BlockEnd(), "");
duke@435	3528	scope_data()->parent()->add_to_work_list(continuation());
duke@435	3529	_skip_block = true;
duke@435	3530	}
duke@435	3531	}
duke@435	3532
duke@435	3533	// Fill the exception handler for synchronized methods with instructions
duke@435	3534	if (callee->is_synchronized() && sync_handler->state() != NULL) {
duke@435	3535	fill_sync_handler(lock, sync_handler);
duke@435	3536	} else {
duke@435	3537	pop_scope();
duke@435	3538	}
duke@435	3539
duke@435	3540	compilation()->notice_inlined_method(callee);
duke@435	3541
duke@435	3542	return true;
duke@435	3543	}
duke@435	3544
duke@435	3545
duke@435	3546	void GraphBuilder::inline_bailout(const char* msg) {
duke@435	3547	assert(msg != NULL, "inline bailout msg must exist");
duke@435	3548	_inline_bailout_msg = msg;
duke@435	3549	}
duke@435	3550
duke@435	3551
duke@435	3552	void GraphBuilder::clear_inline_bailout() {
duke@435	3553	_inline_bailout_msg = NULL;
duke@435	3554	}
duke@435	3555
duke@435	3556
duke@435	3557	void GraphBuilder::push_root_scope(IRScope* scope, BlockList* bci2block, BlockBegin* start) {
duke@435	3558	ScopeData* data = new ScopeData(NULL);
duke@435	3559	data->set_scope(scope);
duke@435	3560	data->set_bci2block(bci2block);
duke@435	3561	_scope_data = data;
duke@435	3562	_block = start;
duke@435	3563	}
duke@435	3564
duke@435	3565
duke@435	3566	void GraphBuilder::push_scope(ciMethod* callee, BlockBegin* continuation) {
duke@435	3567	IRScope* callee_scope = new IRScope(compilation(), scope(), bci(), callee, -1, false);
duke@435	3568	scope()->add_callee(callee_scope);
duke@435	3569
duke@435	3570	BlockListBuilder blb(compilation(), callee_scope, -1);
duke@435	3571	CHECK_BAILOUT();
duke@435	3572
duke@435	3573	if (!blb.bci2block()->at(0)->is_set(BlockBegin::parser_loop_header_flag)) {
duke@435	3574	// this scope can be inlined directly into the caller so remove
duke@435	3575	// the block at bci 0.
duke@435	3576	blb.bci2block()->at_put(0, NULL);
duke@435	3577	}
duke@435	3578
duke@435	3579	callee_scope->set_caller_state(state());
duke@435	3580	set_state(state()->push_scope(callee_scope));
duke@435	3581
duke@435	3582	ScopeData* data = new ScopeData(scope_data());
duke@435	3583	data->set_scope(callee_scope);
duke@435	3584	data->set_bci2block(blb.bci2block());
duke@435	3585	data->set_continuation(continuation);
duke@435	3586	_scope_data = data;
duke@435	3587	}
duke@435	3588
duke@435	3589
duke@435	3590	void GraphBuilder::push_scope_for_jsr(BlockBegin* jsr_continuation, int jsr_dest_bci) {
duke@435	3591	ScopeData* data = new ScopeData(scope_data());
duke@435	3592	data->set_parsing_jsr();
duke@435	3593	data->set_jsr_entry_bci(jsr_dest_bci);
duke@435	3594	data->set_jsr_return_address_local(-1);
duke@435	3595	// Must clone bci2block list as we will be mutating it in order to
duke@435	3596	// properly clone all blocks in jsr region as well as exception
duke@435	3597	// handlers containing rets
duke@435	3598	BlockList* new_bci2block = new BlockList(bci2block()->length());
duke@435	3599	new_bci2block->push_all(bci2block());
duke@435	3600	data->set_bci2block(new_bci2block);
duke@435	3601	data->set_scope(scope());
duke@435	3602	data->setup_jsr_xhandlers();
duke@435	3603	data->set_continuation(continuation());
duke@435	3604	if (continuation() != NULL) {
duke@435	3605	assert(continuation_state() != NULL, "");
duke@435	3606	data->set_continuation_state(continuation_state()->copy());
duke@435	3607	}
duke@435	3608	data->set_jsr_continuation(jsr_continuation);
duke@435	3609	_scope_data = data;
duke@435	3610	}
duke@435	3611
duke@435	3612
duke@435	3613	void GraphBuilder::pop_scope() {
duke@435	3614	int number_of_locks = scope()->number_of_locks();
duke@435	3615	_scope_data = scope_data()->parent();
duke@435	3616	// accumulate minimum number of monitor slots to be reserved
duke@435	3617	scope()->set_min_number_of_locks(number_of_locks);
duke@435	3618	}
duke@435	3619
duke@435	3620
duke@435	3621	void GraphBuilder::pop_scope_for_jsr() {
duke@435	3622	_scope_data = scope_data()->parent();
duke@435	3623	}
duke@435	3624
duke@435	3625	bool GraphBuilder::append_unsafe_get_obj(ciMethod* callee, BasicType t, bool is_volatile) {
duke@435	3626	if (InlineUnsafeOps) {
duke@435	3627	Values* args = state()->pop_arguments(callee->arg_size());
duke@435	3628	null_check(args->at(0));
duke@435	3629	Instruction* offset = args->at(2);
duke@435	3630	#ifndef _LP64
duke@435	3631	offset = append(new Convert(Bytecodes::_l2i, offset, as_ValueType(T_INT)));
duke@435	3632	#endif
duke@435	3633	Instruction* op = append(new UnsafeGetObject(t, args->at(1), offset, is_volatile));
duke@435	3634	push(op->type(), op);
duke@435	3635	compilation()->set_has_unsafe_access(true);
duke@435	3636	}
duke@435	3637	return InlineUnsafeOps;
duke@435	3638	}
duke@435	3639
duke@435	3640
duke@435	3641	bool GraphBuilder::append_unsafe_put_obj(ciMethod* callee, BasicType t, bool is_volatile) {
duke@435	3642	if (InlineUnsafeOps) {
duke@435	3643	Values* args = state()->pop_arguments(callee->arg_size());
duke@435	3644	null_check(args->at(0));
duke@435	3645	Instruction* offset = args->at(2);
duke@435	3646	#ifndef _LP64
duke@435	3647	offset = append(new Convert(Bytecodes::_l2i, offset, as_ValueType(T_INT)));
duke@435	3648	#endif
duke@435	3649	Instruction* op = append(new UnsafePutObject(t, args->at(1), offset, args->at(3), is_volatile));
duke@435	3650	compilation()->set_has_unsafe_access(true);
duke@435	3651	kill_all();
duke@435	3652	}
duke@435	3653	return InlineUnsafeOps;
duke@435	3654	}
duke@435	3655
duke@435	3656
duke@435	3657	bool GraphBuilder::append_unsafe_get_raw(ciMethod* callee, BasicType t) {
duke@435	3658	if (InlineUnsafeOps) {
duke@435	3659	Values* args = state()->pop_arguments(callee->arg_size());
duke@435	3660	null_check(args->at(0));
duke@435	3661	Instruction* op = append(new UnsafeGetRaw(t, args->at(1), false));
duke@435	3662	push(op->type(), op);
duke@435	3663	compilation()->set_has_unsafe_access(true);
duke@435	3664	}
duke@435	3665	return InlineUnsafeOps;
duke@435	3666	}
duke@435	3667
duke@435	3668
duke@435	3669	bool GraphBuilder::append_unsafe_put_raw(ciMethod* callee, BasicType t) {
duke@435	3670	if (InlineUnsafeOps) {
duke@435	3671	Values* args = state()->pop_arguments(callee->arg_size());
duke@435	3672	null_check(args->at(0));
duke@435	3673	Instruction* op = append(new UnsafePutRaw(t, args->at(1), args->at(2)));
duke@435	3674	compilation()->set_has_unsafe_access(true);
duke@435	3675	}
duke@435	3676	return InlineUnsafeOps;
duke@435	3677	}
duke@435	3678
duke@435	3679
duke@435	3680	bool GraphBuilder::append_unsafe_prefetch(ciMethod* callee, bool is_static, bool is_store) {
duke@435	3681	if (InlineUnsafeOps) {
duke@435	3682	Values* args = state()->pop_arguments(callee->arg_size());
duke@435	3683	int obj_arg_index = 1; // Assume non-static case
duke@435	3684	if (is_static) {
duke@435	3685	obj_arg_index = 0;
duke@435	3686	} else {
duke@435	3687	null_check(args->at(0));
duke@435	3688	}
duke@435	3689	Instruction* offset = args->at(obj_arg_index + 1);
duke@435	3690	#ifndef _LP64
duke@435	3691	offset = append(new Convert(Bytecodes::_l2i, offset, as_ValueType(T_INT)));
duke@435	3692	#endif
duke@435	3693	Instruction* op = is_store ? append(new UnsafePrefetchWrite(args->at(obj_arg_index), offset))
duke@435	3694	: append(new UnsafePrefetchRead (args->at(obj_arg_index), offset));
duke@435	3695	compilation()->set_has_unsafe_access(true);
duke@435	3696	}
duke@435	3697	return InlineUnsafeOps;
duke@435	3698	}
duke@435	3699
duke@435	3700
duke@435	3701	void GraphBuilder::append_unsafe_CAS(ciMethod* callee) {
duke@435	3702	ValueType* result_type = as_ValueType(callee->return_type());
duke@435	3703	assert(result_type->is_int(), "int result");
duke@435	3704	Values* args = state()->pop_arguments(callee->arg_size());
duke@435	3705
duke@435	3706	// Pop off some args to speically handle, then push back
duke@435	3707	Value newval = args->pop();
duke@435	3708	Value cmpval = args->pop();
duke@435	3709	Value offset = args->pop();
duke@435	3710	Value src = args->pop();
duke@435	3711	Value unsafe_obj = args->pop();
duke@435	3712
duke@435	3713	// Separately handle the unsafe arg. It is not needed for code
duke@435	3714	// generation, but must be null checked
duke@435	3715	null_check(unsafe_obj);
duke@435	3716
duke@435	3717	#ifndef _LP64
duke@435	3718	offset = append(new Convert(Bytecodes::_l2i, offset, as_ValueType(T_INT)));
duke@435	3719	#endif
duke@435	3720
duke@435	3721	args->push(src);
duke@435	3722	args->push(offset);
duke@435	3723	args->push(cmpval);
duke@435	3724	args->push(newval);
duke@435	3725
duke@435	3726	// An unsafe CAS can alias with other field accesses, but we don't
duke@435	3727	// know which ones so mark the state as no preserved. This will
duke@435	3728	// cause CSE to invalidate memory across it.
duke@435	3729	bool preserves_state = false;
duke@435	3730	Intrinsic* result = new Intrinsic(result_type, callee->intrinsic_id(), args, false, lock_stack(), preserves_state);
duke@435	3731	append_split(result);
duke@435	3732	push(result_type, result);
duke@435	3733	compilation()->set_has_unsafe_access(true);
duke@435	3734	}
duke@435	3735
duke@435	3736
duke@435	3737	#ifndef PRODUCT
duke@435	3738	void GraphBuilder::print_inline_result(ciMethod* callee, bool res) {
duke@435	3739	const char sync_char = callee->is_synchronized() ? 's' : ' ';
duke@435	3740	const char exception_char = callee->has_exception_handlers() ? '!' : ' ';
duke@435	3741	const char monitors_char = callee->has_monitor_bytecodes() ? 'm' : ' ';
duke@435	3742	tty->print(" %c%c%c ", sync_char, exception_char, monitors_char);
duke@435	3743	for (int i = 0; i < scope()->level(); i++) tty->print(" ");
duke@435	3744	if (res) {
duke@435	3745	tty->print(" ");
duke@435	3746	} else {
duke@435	3747	tty->print("- ");
duke@435	3748	}
duke@435	3749	tty->print("@ %d ", bci());
duke@435	3750	callee->print_short_name();
duke@435	3751	tty->print(" (%d bytes)", callee->code_size());
duke@435	3752	if (_inline_bailout_msg) {
duke@435	3753	tty->print(" %s", _inline_bailout_msg);
duke@435	3754	}
duke@435	3755	tty->cr();
duke@435	3756
duke@435	3757	if (res && CIPrintMethodCodes) {
duke@435	3758	callee->print_codes();
duke@435	3759	}
duke@435	3760	}
duke@435	3761
duke@435	3762
duke@435	3763	void GraphBuilder::print_stats() {
duke@435	3764	vmap()->print();
duke@435	3765	}
duke@435	3766	#endif // PRODUCT
duke@435	3767
duke@435	3768
duke@435	3769	void GraphBuilder::profile_call(Value recv, ciKlass* known_holder) {
duke@435	3770	append(new ProfileCall(method(), bci(), recv, known_holder));
duke@435	3771	}
duke@435	3772
duke@435	3773
duke@435	3774	void GraphBuilder::profile_invocation(ciMethod* callee) {
duke@435	3775	if (profile_calls()) {
duke@435	3776	// increment the interpreter_invocation_count for the inlinee
duke@435	3777	Value m = append(new Constant(new ObjectConstant(callee)));
duke@435	3778	append(new ProfileCounter(m, methodOopDesc::interpreter_invocation_counter_offset_in_bytes(), 1));
duke@435	3779	}
duke@435	3780	}
duke@435	3781
duke@435	3782
duke@435	3783	void GraphBuilder::profile_bci(int bci) {
duke@435	3784	if (profile_branches()) {
duke@435	3785	ciMethodData* md = method()->method_data();
duke@435	3786	if (md == NULL) {
duke@435	3787	BAILOUT("out of memory building methodDataOop");
duke@435	3788	}
duke@435	3789	ciProfileData* data = md->bci_to_data(bci);
duke@435	3790	assert(data != NULL && data->is_JumpData(), "need JumpData for goto");
duke@435	3791	Value mdo = append(new Constant(new ObjectConstant(md)));
duke@435	3792	append(new ProfileCounter(mdo, md->byte_offset_of_slot(data, JumpData::taken_offset()), 1));
duke@435	3793	}
duke@435	3794	}