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

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

src/share/vm/c1/c1_GraphBuilder.cpp

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

author

roland

date

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

changeset 2174

f02a8bbe6ed4

parent 2146

3a294e483abc

child 2180

80c9354976b0

permissions

-rw-r--r--

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

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