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

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

src/share/vm/c1/c1_GraphBuilder.cpp

Wed, 15 Feb 2012 09:43:16 +0100

author

roland

date

Wed, 15 Feb 2012 09:43:16 +0100

changeset 3570

80107dc493db

parent 3498

f067b4e0e04b

child 3592

701a83c86f28

child 3629

4fabc16dc5bf

permissions

-rw-r--r--

7126041: jdk7u4 b05 and b06 crash with RubyMine 3.2.4, works well with b04
Summary: Goto that replaces a If mistaken to be a back branch and triggers erroneous OSR compilation.
Reviewed-by: never, iveresov

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