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

src/share/vm/c1/c1_LIR.cpp@f95d63e2154a (annotated)

src/share/vm/c1/c1_LIR.cpp

Tue, 23 Nov 2010 13:22:55 -0800

author

stefank

date

Tue, 23 Nov 2010 13:22:55 -0800

changeset 2314

f95d63e2154a

parent 2174

f02a8bbe6ed4

child 2344

ac637b7220d1

permissions

-rw-r--r--

6989984: Use standard include model for Hospot
Summary: Replaced MakeDeps and the includeDB files with more standardized solutions.
Reviewed-by: coleenp, kvn, kamg

duke@435	1	/*
trims@1907	2	* Copyright (c) 2000, 2010, Oracle and/or its affiliates. All rights reserved.
duke@435	3	* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
duke@435	4	*
duke@435	5	* This code is free software; you can redistribute it and/or modify it
duke@435	6	* under the terms of the GNU General Public License version 2 only, as
duke@435	7	* published by the Free Software Foundation.
duke@435	8	*
duke@435	9	* This code is distributed in the hope that it will be useful, but WITHOUT
duke@435	10	* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
duke@435	11	* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
duke@435	12	* version 2 for more details (a copy is included in the LICENSE file that
duke@435	13	* accompanied this code).
duke@435	14	*
duke@435	15	* You should have received a copy of the GNU General Public License version
duke@435	16	* 2 along with this work; if not, write to the Free Software Foundation,
duke@435	17	* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
duke@435	18	*
trims@1907	19	* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
trims@1907	20	* or visit www.oracle.com if you need additional information or have any
trims@1907	21	* questions.
duke@435	22	*
duke@435	23	*/
duke@435	24
stefank@2314	25	#include "precompiled.hpp"
stefank@2314	26	#include "c1/c1_InstructionPrinter.hpp"
stefank@2314	27	#include "c1/c1_LIR.hpp"
stefank@2314	28	#include "c1/c1_LIRAssembler.hpp"
stefank@2314	29	#include "c1/c1_ValueStack.hpp"
stefank@2314	30	#include "ci/ciInstance.hpp"
stefank@2314	31	#include "runtime/sharedRuntime.hpp"
duke@435	32
duke@435	33	Register LIR_OprDesc::as_register() const {
duke@435	34	return FrameMap::cpu_rnr2reg(cpu_regnr());
duke@435	35	}
duke@435	36
duke@435	37	Register LIR_OprDesc::as_register_lo() const {
duke@435	38	return FrameMap::cpu_rnr2reg(cpu_regnrLo());
duke@435	39	}
duke@435	40
duke@435	41	Register LIR_OprDesc::as_register_hi() const {
duke@435	42	return FrameMap::cpu_rnr2reg(cpu_regnrHi());
duke@435	43	}
duke@435	44
never@739	45	#if defined(X86)
duke@435	46
duke@435	47	XMMRegister LIR_OprDesc::as_xmm_float_reg() const {
duke@435	48	return FrameMap::nr2xmmreg(xmm_regnr());
duke@435	49	}
duke@435	50
duke@435	51	XMMRegister LIR_OprDesc::as_xmm_double_reg() const {
duke@435	52	assert(xmm_regnrLo() == xmm_regnrHi(), "assumed in calculation");
duke@435	53	return FrameMap::nr2xmmreg(xmm_regnrLo());
duke@435	54	}
duke@435	55
never@739	56	#endif // X86
duke@435	57
bobv@2036	58	#if defined(SPARC) || defined(PPC)
duke@435	59
duke@435	60	FloatRegister LIR_OprDesc::as_float_reg() const {
duke@435	61	return FrameMap::nr2floatreg(fpu_regnr());
duke@435	62	}
duke@435	63
duke@435	64	FloatRegister LIR_OprDesc::as_double_reg() const {
duke@435	65	return FrameMap::nr2floatreg(fpu_regnrHi());
duke@435	66	}
duke@435	67
duke@435	68	#endif
duke@435	69
bobv@2036	70	#ifdef ARM
bobv@2036	71
bobv@2036	72	FloatRegister LIR_OprDesc::as_float_reg() const {
bobv@2036	73	return as_FloatRegister(fpu_regnr());
bobv@2036	74	}
bobv@2036	75
bobv@2036	76	FloatRegister LIR_OprDesc::as_double_reg() const {
bobv@2036	77	return as_FloatRegister(fpu_regnrLo());
bobv@2036	78	}
bobv@2036	79
bobv@2036	80	#endif
bobv@2036	81
bobv@2036	82
duke@435	83	LIR_Opr LIR_OprFact::illegalOpr = LIR_OprFact::illegal();
duke@435	84
duke@435	85	LIR_Opr LIR_OprFact::value_type(ValueType* type) {
duke@435	86	ValueTag tag = type->tag();
duke@435	87	switch (tag) {
duke@435	88	case objectTag : {
duke@435	89	ClassConstant* c = type->as_ClassConstant();
duke@435	90	if (c != NULL && !c->value()->is_loaded()) {
duke@435	91	return LIR_OprFact::oopConst(NULL);
duke@435	92	} else {
duke@435	93	return LIR_OprFact::oopConst(type->as_ObjectType()->encoding());
duke@435	94	}
duke@435	95	}
roland@1732	96	case addressTag: return LIR_OprFact::addressConst(type->as_AddressConstant()->value());
duke@435	97	case intTag : return LIR_OprFact::intConst(type->as_IntConstant()->value());
duke@435	98	case floatTag : return LIR_OprFact::floatConst(type->as_FloatConstant()->value());
duke@435	99	case longTag : return LIR_OprFact::longConst(type->as_LongConstant()->value());
duke@435	100	case doubleTag : return LIR_OprFact::doubleConst(type->as_DoubleConstant()->value());
never@739	101	default: ShouldNotReachHere(); return LIR_OprFact::intConst(-1);
duke@435	102	}
duke@435	103	}
duke@435	104
duke@435	105
duke@435	106	LIR_Opr LIR_OprFact::dummy_value_type(ValueType* type) {
duke@435	107	switch (type->tag()) {
duke@435	108	case objectTag: return LIR_OprFact::oopConst(NULL);
roland@1732	109	case addressTag:return LIR_OprFact::addressConst(0);
duke@435	110	case intTag: return LIR_OprFact::intConst(0);
duke@435	111	case floatTag: return LIR_OprFact::floatConst(0.0);
duke@435	112	case longTag: return LIR_OprFact::longConst(0);
duke@435	113	case doubleTag: return LIR_OprFact::doubleConst(0.0);
never@739	114	default: ShouldNotReachHere(); return LIR_OprFact::intConst(-1);
duke@435	115	}
duke@435	116	return illegalOpr;
duke@435	117	}
duke@435	118
duke@435	119
duke@435	120
duke@435	121	//---------------------------------------------------
duke@435	122
duke@435	123
duke@435	124	LIR_Address::Scale LIR_Address::scale(BasicType type) {
kvn@464	125	int elem_size = type2aelembytes(type);
duke@435	126	switch (elem_size) {
duke@435	127	case 1: return LIR_Address::times_1;
duke@435	128	case 2: return LIR_Address::times_2;
duke@435	129	case 4: return LIR_Address::times_4;
duke@435	130	case 8: return LIR_Address::times_8;
duke@435	131	}
duke@435	132	ShouldNotReachHere();
duke@435	133	return LIR_Address::times_1;
duke@435	134	}
duke@435	135
duke@435	136
duke@435	137	#ifndef PRODUCT
duke@435	138	void LIR_Address::verify() const {
bobv@2036	139	#if defined(SPARC) || defined(PPC)
bobv@2036	140	assert(scale() == times_1, "Scaled addressing mode not available on SPARC/PPC and should not be used");
duke@435	141	assert(disp() == 0 || index()->is_illegal(), "can't have both");
duke@435	142	#endif
bobv@2036	143	#ifdef ARM
bobv@2036	144	assert(disp() == 0 || index()->is_illegal(), "can't have both");
bobv@2036	145	assert(-4096 < disp() && disp() < 4096, "architecture constraint");
bobv@2036	146	#endif
duke@435	147	#ifdef _LP64
duke@435	148	assert(base()->is_cpu_register(), "wrong base operand");
duke@435	149	assert(index()->is_illegal() || index()->is_double_cpu(), "wrong index operand");
duke@435	150	assert(base()->type() == T_OBJECT || base()->type() == T_LONG,
duke@435	151	"wrong type for addresses");
duke@435	152	#else
duke@435	153	assert(base()->is_single_cpu(), "wrong base operand");
duke@435	154	assert(index()->is_illegal() || index()->is_single_cpu(), "wrong index operand");
duke@435	155	assert(base()->type() == T_OBJECT || base()->type() == T_INT,
duke@435	156	"wrong type for addresses");
duke@435	157	#endif
duke@435	158	}
duke@435	159	#endif
duke@435	160
duke@435	161
duke@435	162	//---------------------------------------------------
duke@435	163
duke@435	164	char LIR_OprDesc::type_char(BasicType t) {
duke@435	165	switch (t) {
duke@435	166	case T_ARRAY:
duke@435	167	t = T_OBJECT;
duke@435	168	case T_BOOLEAN:
duke@435	169	case T_CHAR:
duke@435	170	case T_FLOAT:
duke@435	171	case T_DOUBLE:
duke@435	172	case T_BYTE:
duke@435	173	case T_SHORT:
duke@435	174	case T_INT:
duke@435	175	case T_LONG:
duke@435	176	case T_OBJECT:
duke@435	177	case T_ADDRESS:
duke@435	178	case T_VOID:
duke@435	179	return ::type2char(t);
duke@435	180
duke@435	181	case T_ILLEGAL:
duke@435	182	return '?';
duke@435	183
duke@435	184	default:
duke@435	185	ShouldNotReachHere();
never@739	186	return '?';
duke@435	187	}
duke@435	188	}
duke@435	189
duke@435	190	#ifndef PRODUCT
duke@435	191	void LIR_OprDesc::validate_type() const {
duke@435	192
duke@435	193	#ifdef ASSERT
duke@435	194	if (!is_pointer() && !is_illegal()) {
duke@435	195	switch (as_BasicType(type_field())) {
duke@435	196	case T_LONG:
bobv@2036	197	assert((kind_field() == cpu_register || kind_field() == stack_value) &&
bobv@2036	198	size_field() == double_size, "must match");
duke@435	199	break;
duke@435	200	case T_FLOAT:
bobv@2036	201	// FP return values can be also in CPU registers on ARM and PPC (softfp ABI)
bobv@2036	202	assert((kind_field() == fpu_register || kind_field() == stack_value
bobv@2036	203	ARM_ONLY(|| kind_field() == cpu_register)
bobv@2036	204	PPC_ONLY(|| kind_field() == cpu_register) ) &&
bobv@2036	205	size_field() == single_size, "must match");
duke@435	206	break;
duke@435	207	case T_DOUBLE:
bobv@2036	208	// FP return values can be also in CPU registers on ARM and PPC (softfp ABI)
bobv@2036	209	assert((kind_field() == fpu_register || kind_field() == stack_value
bobv@2036	210	ARM_ONLY(|| kind_field() == cpu_register)
bobv@2036	211	PPC_ONLY(|| kind_field() == cpu_register) ) &&
bobv@2036	212	size_field() == double_size, "must match");
duke@435	213	break;
duke@435	214	case T_BOOLEAN:
duke@435	215	case T_CHAR:
duke@435	216	case T_BYTE:
duke@435	217	case T_SHORT:
duke@435	218	case T_INT:
never@2171	219	case T_ADDRESS:
duke@435	220	case T_OBJECT:
duke@435	221	case T_ARRAY:
bobv@2036	222	assert((kind_field() == cpu_register || kind_field() == stack_value) &&
bobv@2036	223	size_field() == single_size, "must match");
duke@435	224	break;
duke@435	225
duke@435	226	case T_ILLEGAL:
duke@435	227	// XXX TKR also means unknown right now
duke@435	228	// assert(is_illegal(), "must match");
duke@435	229	break;
duke@435	230
duke@435	231	default:
duke@435	232	ShouldNotReachHere();
duke@435	233	}
duke@435	234	}
duke@435	235	#endif
duke@435	236
duke@435	237	}
duke@435	238	#endif // PRODUCT
duke@435	239
duke@435	240
duke@435	241	bool LIR_OprDesc::is_oop() const {
duke@435	242	if (is_pointer()) {
duke@435	243	return pointer()->is_oop_pointer();
duke@435	244	} else {
duke@435	245	OprType t= type_field();
duke@435	246	assert(t != unknown_type, "not set");
duke@435	247	return t == object_type;
duke@435	248	}
duke@435	249	}
duke@435	250
duke@435	251
duke@435	252
duke@435	253	void LIR_Op2::verify() const {
duke@435	254	#ifdef ASSERT
duke@435	255	switch (code()) {
duke@435	256	case lir_cmove:
duke@435	257	break;
duke@435	258
duke@435	259	default:
duke@435	260	assert(!result_opr()->is_register() || !result_opr()->is_oop_register(),
duke@435	261	"can't produce oops from arith");
duke@435	262	}
duke@435	263
duke@435	264	if (TwoOperandLIRForm) {
duke@435	265	switch (code()) {
duke@435	266	case lir_add:
duke@435	267	case lir_sub:
duke@435	268	case lir_mul:
duke@435	269	case lir_mul_strictfp:
duke@435	270	case lir_div:
duke@435	271	case lir_div_strictfp:
duke@435	272	case lir_rem:
duke@435	273	case lir_logic_and:
duke@435	274	case lir_logic_or:
duke@435	275	case lir_logic_xor:
duke@435	276	case lir_shl:
duke@435	277	case lir_shr:
duke@435	278	assert(in_opr1() == result_opr(), "opr1 and result must match");
duke@435	279	assert(in_opr1()->is_valid() && in_opr2()->is_valid(), "must be valid");
duke@435	280	break;
duke@435	281
duke@435	282	// special handling for lir_ushr because of write barriers
duke@435	283	case lir_ushr:
duke@435	284	assert(in_opr1() == result_opr() || in_opr2()->is_constant(), "opr1 and result must match or shift count is constant");
duke@435	285	assert(in_opr1()->is_valid() && in_opr2()->is_valid(), "must be valid");
duke@435	286	break;
duke@435	287
duke@435	288	}
duke@435	289	}
duke@435	290	#endif
duke@435	291	}
duke@435	292
duke@435	293
duke@435	294	LIR_OpBranch::LIR_OpBranch(LIR_Condition cond, BasicType type, BlockBegin* block)
duke@435	295	: LIR_Op(lir_branch, LIR_OprFact::illegalOpr, (CodeEmitInfo*)NULL)
duke@435	296	, _cond(cond)
duke@435	297	, _type(type)
duke@435	298	, _label(block->label())
duke@435	299	, _block(block)
duke@435	300	, _ublock(NULL)
duke@435	301	, _stub(NULL) {
duke@435	302	}
duke@435	303
duke@435	304	LIR_OpBranch::LIR_OpBranch(LIR_Condition cond, BasicType type, CodeStub* stub) :
duke@435	305	LIR_Op(lir_branch, LIR_OprFact::illegalOpr, (CodeEmitInfo*)NULL)
duke@435	306	, _cond(cond)
duke@435	307	, _type(type)
duke@435	308	, _label(stub->entry())
duke@435	309	, _block(NULL)
duke@435	310	, _ublock(NULL)
duke@435	311	, _stub(stub) {
duke@435	312	}
duke@435	313
duke@435	314	LIR_OpBranch::LIR_OpBranch(LIR_Condition cond, BasicType type, BlockBegin* block, BlockBegin* ublock)
duke@435	315	: LIR_Op(lir_cond_float_branch, LIR_OprFact::illegalOpr, (CodeEmitInfo*)NULL)
duke@435	316	, _cond(cond)
duke@435	317	, _type(type)
duke@435	318	, _label(block->label())
duke@435	319	, _block(block)
duke@435	320	, _ublock(ublock)
duke@435	321	, _stub(NULL)
duke@435	322	{
duke@435	323	}
duke@435	324
duke@435	325	void LIR_OpBranch::change_block(BlockBegin* b) {
duke@435	326	assert(_block != NULL, "must have old block");
duke@435	327	assert(_block->label() == label(), "must be equal");
duke@435	328
duke@435	329	_block = b;
duke@435	330	_label = b->label();
duke@435	331	}
duke@435	332
duke@435	333	void LIR_OpBranch::change_ublock(BlockBegin* b) {
duke@435	334	assert(_ublock != NULL, "must have old block");
duke@435	335	_ublock = b;
duke@435	336	}
duke@435	337
duke@435	338	void LIR_OpBranch::negate_cond() {
duke@435	339	switch (_cond) {
duke@435	340	case lir_cond_equal: _cond = lir_cond_notEqual; break;
duke@435	341	case lir_cond_notEqual: _cond = lir_cond_equal; break;
duke@435	342	case lir_cond_less: _cond = lir_cond_greaterEqual; break;
duke@435	343	case lir_cond_lessEqual: _cond = lir_cond_greater; break;
duke@435	344	case lir_cond_greaterEqual: _cond = lir_cond_less; break;
duke@435	345	case lir_cond_greater: _cond = lir_cond_lessEqual; break;
duke@435	346	default: ShouldNotReachHere();
duke@435	347	}
duke@435	348	}
duke@435	349
duke@435	350
duke@435	351	LIR_OpTypeCheck::LIR_OpTypeCheck(LIR_Code code, LIR_Opr result, LIR_Opr object, ciKlass* klass,
duke@435	352	LIR_Opr tmp1, LIR_Opr tmp2, LIR_Opr tmp3,
duke@435	353	bool fast_check, CodeEmitInfo* info_for_exception, CodeEmitInfo* info_for_patch,
iveresov@2138	354	CodeStub* stub)
iveresov@2138	355
duke@435	356	: LIR_Op(code, result, NULL)
duke@435	357	, _object(object)
duke@435	358	, _array(LIR_OprFact::illegalOpr)
duke@435	359	, _klass(klass)
duke@435	360	, _tmp1(tmp1)
duke@435	361	, _tmp2(tmp2)
duke@435	362	, _tmp3(tmp3)
duke@435	363	, _fast_check(fast_check)
duke@435	364	, _stub(stub)
duke@435	365	, _info_for_patch(info_for_patch)
duke@435	366	, _info_for_exception(info_for_exception)
iveresov@2138	367	, _profiled_method(NULL)
iveresov@2138	368	, _profiled_bci(-1)
iveresov@2138	369	, _should_profile(false)
iveresov@2138	370	{
duke@435	371	if (code == lir_checkcast) {
duke@435	372	assert(info_for_exception != NULL, "checkcast throws exceptions");
duke@435	373	} else if (code == lir_instanceof) {
duke@435	374	assert(info_for_exception == NULL, "instanceof throws no exceptions");
duke@435	375	} else {
duke@435	376	ShouldNotReachHere();
duke@435	377	}
duke@435	378	}
duke@435	379
duke@435	380
duke@435	381
iveresov@2138	382	LIR_OpTypeCheck::LIR_OpTypeCheck(LIR_Code code, LIR_Opr object, LIR_Opr array, LIR_Opr tmp1, LIR_Opr tmp2, LIR_Opr tmp3, CodeEmitInfo* info_for_exception)
duke@435	383	: LIR_Op(code, LIR_OprFact::illegalOpr, NULL)
duke@435	384	, _object(object)
duke@435	385	, _array(array)
duke@435	386	, _klass(NULL)
duke@435	387	, _tmp1(tmp1)
duke@435	388	, _tmp2(tmp2)
duke@435	389	, _tmp3(tmp3)
duke@435	390	, _fast_check(false)
duke@435	391	, _stub(NULL)
duke@435	392	, _info_for_patch(NULL)
duke@435	393	, _info_for_exception(info_for_exception)
iveresov@2138	394	, _profiled_method(NULL)
iveresov@2138	395	, _profiled_bci(-1)
iveresov@2138	396	, _should_profile(false)
iveresov@2138	397	{
duke@435	398	if (code == lir_store_check) {
duke@435	399	_stub = new ArrayStoreExceptionStub(info_for_exception);
duke@435	400	assert(info_for_exception != NULL, "store_check throws exceptions");
duke@435	401	} else {
duke@435	402	ShouldNotReachHere();
duke@435	403	}
duke@435	404	}
duke@435	405
duke@435	406
duke@435	407	LIR_OpArrayCopy::LIR_OpArrayCopy(LIR_Opr src, LIR_Opr src_pos, LIR_Opr dst, LIR_Opr dst_pos, LIR_Opr length,
duke@435	408	LIR_Opr tmp, ciArrayKlass* expected_type, int flags, CodeEmitInfo* info)
duke@435	409	: LIR_Op(lir_arraycopy, LIR_OprFact::illegalOpr, info)
duke@435	410	, _tmp(tmp)
duke@435	411	, _src(src)
duke@435	412	, _src_pos(src_pos)
duke@435	413	, _dst(dst)
duke@435	414	, _dst_pos(dst_pos)
duke@435	415	, _flags(flags)
duke@435	416	, _expected_type(expected_type)
duke@435	417	, _length(length) {
duke@435	418	_stub = new ArrayCopyStub(this);
duke@435	419	}
duke@435	420
duke@435	421
duke@435	422	//-------------------verify--------------------------
duke@435	423
duke@435	424	void LIR_Op1::verify() const {
duke@435	425	switch(code()) {
duke@435	426	case lir_move:
duke@435	427	assert(in_opr()->is_valid() && result_opr()->is_valid(), "must be");
duke@435	428	break;
duke@435	429	case lir_null_check:
duke@435	430	assert(in_opr()->is_register(), "must be");
duke@435	431	break;
duke@435	432	case lir_return:
duke@435	433	assert(in_opr()->is_register() || in_opr()->is_illegal(), "must be");
duke@435	434	break;
duke@435	435	}
duke@435	436	}
duke@435	437
duke@435	438	void LIR_OpRTCall::verify() const {
duke@435	439	assert(strcmp(Runtime1::name_for_address(addr()), "<unknown function>") != 0, "unknown function");
duke@435	440	}
duke@435	441
duke@435	442	//-------------------visits--------------------------
duke@435	443
duke@435	444	// complete rework of LIR instruction visitor.
duke@435	445	// The virtual calls for each instruction type is replaced by a big
duke@435	446	// switch that adds the operands for each instruction
duke@435	447
duke@435	448	void LIR_OpVisitState::visit(LIR_Op* op) {
duke@435	449	// copy information from the LIR_Op
duke@435	450	reset();
duke@435	451	set_op(op);
duke@435	452
duke@435	453	switch (op->code()) {
duke@435	454
duke@435	455	// LIR_Op0
duke@435	456	case lir_word_align: // result and info always invalid
duke@435	457	case lir_backwardbranch_target: // result and info always invalid
duke@435	458	case lir_build_frame: // result and info always invalid
duke@435	459	case lir_fpop_raw: // result and info always invalid
duke@435	460	case lir_24bit_FPU: // result and info always invalid
duke@435	461	case lir_reset_FPU: // result and info always invalid
duke@435	462	case lir_breakpoint: // result and info always invalid
duke@435	463	case lir_membar: // result and info always invalid
duke@435	464	case lir_membar_acquire: // result and info always invalid
duke@435	465	case lir_membar_release: // result and info always invalid
duke@435	466	{
duke@435	467	assert(op->as_Op0() != NULL, "must be");
duke@435	468	assert(op->_info == NULL, "info not used by this instruction");
duke@435	469	assert(op->_result->is_illegal(), "not used");
duke@435	470	break;
duke@435	471	}
duke@435	472
duke@435	473	case lir_nop: // may have info, result always invalid
duke@435	474	case lir_std_entry: // may have result, info always invalid
duke@435	475	case lir_osr_entry: // may have result, info always invalid
duke@435	476	case lir_get_thread: // may have result, info always invalid
duke@435	477	{
duke@435	478	assert(op->as_Op0() != NULL, "must be");
duke@435	479	if (op->_info != NULL) do_info(op->_info);
duke@435	480	if (op->_result->is_valid()) do_output(op->_result);
duke@435	481	break;
duke@435	482	}
duke@435	483
duke@435	484
duke@435	485	// LIR_OpLabel
duke@435	486	case lir_label: // result and info always invalid
duke@435	487	{
duke@435	488	assert(op->as_OpLabel() != NULL, "must be");
duke@435	489	assert(op->_info == NULL, "info not used by this instruction");
duke@435	490	assert(op->_result->is_illegal(), "not used");
duke@435	491	break;
duke@435	492	}
duke@435	493
duke@435	494
duke@435	495	// LIR_Op1
duke@435	496	case lir_fxch: // input always valid, result and info always invalid
duke@435	497	case lir_fld: // input always valid, result and info always invalid
duke@435	498	case lir_ffree: // input always valid, result and info always invalid
duke@435	499	case lir_push: // input always valid, result and info always invalid
duke@435	500	case lir_pop: // input always valid, result and info always invalid
duke@435	501	case lir_return: // input always valid, result and info always invalid
duke@435	502	case lir_leal: // input and result always valid, info always invalid
duke@435	503	case lir_neg: // input and result always valid, info always invalid
duke@435	504	case lir_monaddr: // input and result always valid, info always invalid
duke@435	505	case lir_null_check: // input and info always valid, result always invalid
duke@435	506	case lir_move: // input and result always valid, may have info
iveresov@2138	507	case lir_pack64: // input and result always valid
iveresov@2138	508	case lir_unpack64: // input and result always valid
duke@435	509	case lir_prefetchr: // input always valid, result and info always invalid
duke@435	510	case lir_prefetchw: // input always valid, result and info always invalid
duke@435	511	{
duke@435	512	assert(op->as_Op1() != NULL, "must be");
duke@435	513	LIR_Op1* op1 = (LIR_Op1*)op;
duke@435	514
duke@435	515	if (op1->_info) do_info(op1->_info);
duke@435	516	if (op1->_opr->is_valid()) do_input(op1->_opr);
duke@435	517	if (op1->_result->is_valid()) do_output(op1->_result);
duke@435	518
duke@435	519	break;
duke@435	520	}
duke@435	521
duke@435	522	case lir_safepoint:
duke@435	523	{
duke@435	524	assert(op->as_Op1() != NULL, "must be");
duke@435	525	LIR_Op1* op1 = (LIR_Op1*)op;
duke@435	526
duke@435	527	assert(op1->_info != NULL, ""); do_info(op1->_info);
duke@435	528	if (op1->_opr->is_valid()) do_temp(op1->_opr); // safepoints on SPARC need temporary register
duke@435	529	assert(op1->_result->is_illegal(), "safepoint does not produce value");
duke@435	530
duke@435	531	break;
duke@435	532	}
duke@435	533
duke@435	534	// LIR_OpConvert;
duke@435	535	case lir_convert: // input and result always valid, info always invalid
duke@435	536	{
duke@435	537	assert(op->as_OpConvert() != NULL, "must be");
duke@435	538	LIR_OpConvert* opConvert = (LIR_OpConvert*)op;
duke@435	539
duke@435	540	assert(opConvert->_info == NULL, "must be");
duke@435	541	if (opConvert->_opr->is_valid()) do_input(opConvert->_opr);
duke@435	542	if (opConvert->_result->is_valid()) do_output(opConvert->_result);
bobv@2036	543	#ifdef PPC
bobv@2036	544	if (opConvert->_tmp1->is_valid()) do_temp(opConvert->_tmp1);
bobv@2036	545	if (opConvert->_tmp2->is_valid()) do_temp(opConvert->_tmp2);
bobv@2036	546	#endif
duke@435	547	do_stub(opConvert->_stub);
duke@435	548
duke@435	549	break;
duke@435	550	}
duke@435	551
duke@435	552	// LIR_OpBranch;
duke@435	553	case lir_branch: // may have info, input and result register always invalid
duke@435	554	case lir_cond_float_branch: // may have info, input and result register always invalid
duke@435	555	{
duke@435	556	assert(op->as_OpBranch() != NULL, "must be");
duke@435	557	LIR_OpBranch* opBranch = (LIR_OpBranch*)op;
duke@435	558
duke@435	559	if (opBranch->_info != NULL) do_info(opBranch->_info);
duke@435	560	assert(opBranch->_result->is_illegal(), "not used");
duke@435	561	if (opBranch->_stub != NULL) opBranch->stub()->visit(this);
duke@435	562
duke@435	563	break;
duke@435	564	}
duke@435	565
duke@435	566
duke@435	567	// LIR_OpAllocObj
duke@435	568	case lir_alloc_object:
duke@435	569	{
duke@435	570	assert(op->as_OpAllocObj() != NULL, "must be");
duke@435	571	LIR_OpAllocObj* opAllocObj = (LIR_OpAllocObj*)op;
duke@435	572
duke@435	573	if (opAllocObj->_info) do_info(opAllocObj->_info);
bobv@2036	574	if (opAllocObj->_opr->is_valid()) { do_input(opAllocObj->_opr);
bobv@2036	575	do_temp(opAllocObj->_opr);
bobv@2036	576	}
duke@435	577	if (opAllocObj->_tmp1->is_valid()) do_temp(opAllocObj->_tmp1);
duke@435	578	if (opAllocObj->_tmp2->is_valid()) do_temp(opAllocObj->_tmp2);
duke@435	579	if (opAllocObj->_tmp3->is_valid()) do_temp(opAllocObj->_tmp3);
duke@435	580	if (opAllocObj->_tmp4->is_valid()) do_temp(opAllocObj->_tmp4);
duke@435	581	if (opAllocObj->_result->is_valid()) do_output(opAllocObj->_result);
duke@435	582	do_stub(opAllocObj->_stub);
duke@435	583	break;
duke@435	584	}
duke@435	585
duke@435	586
duke@435	587	// LIR_OpRoundFP;
duke@435	588	case lir_roundfp: {
duke@435	589	assert(op->as_OpRoundFP() != NULL, "must be");
duke@435	590	LIR_OpRoundFP* opRoundFP = (LIR_OpRoundFP*)op;
duke@435	591
duke@435	592	assert(op->_info == NULL, "info not used by this instruction");
duke@435	593	assert(opRoundFP->_tmp->is_illegal(), "not used");
duke@435	594	do_input(opRoundFP->_opr);
duke@435	595	do_output(opRoundFP->_result);
duke@435	596
duke@435	597	break;
duke@435	598	}
duke@435	599
duke@435	600
duke@435	601	// LIR_Op2
duke@435	602	case lir_cmp:
duke@435	603	case lir_cmp_l2i:
duke@435	604	case lir_ucmp_fd2i:
duke@435	605	case lir_cmp_fd2i:
duke@435	606	case lir_add:
duke@435	607	case lir_sub:
duke@435	608	case lir_mul:
duke@435	609	case lir_div:
duke@435	610	case lir_rem:
duke@435	611	case lir_sqrt:
duke@435	612	case lir_abs:
duke@435	613	case lir_logic_and:
duke@435	614	case lir_logic_or:
duke@435	615	case lir_logic_xor:
duke@435	616	case lir_shl:
duke@435	617	case lir_shr:
duke@435	618	case lir_ushr:
duke@435	619	{
duke@435	620	assert(op->as_Op2() != NULL, "must be");
duke@435	621	LIR_Op2* op2 = (LIR_Op2*)op;
duke@435	622
duke@435	623	if (op2->_info) do_info(op2->_info);
duke@435	624	if (op2->_opr1->is_valid()) do_input(op2->_opr1);
duke@435	625	if (op2->_opr2->is_valid()) do_input(op2->_opr2);
duke@435	626	if (op2->_tmp->is_valid()) do_temp(op2->_tmp);
duke@435	627	if (op2->_result->is_valid()) do_output(op2->_result);
duke@435	628
duke@435	629	break;
duke@435	630	}
duke@435	631
duke@435	632	// special handling for cmove: right input operand must not be equal
duke@435	633	// to the result operand, otherwise the backend fails
duke@435	634	case lir_cmove:
duke@435	635	{
duke@435	636	assert(op->as_Op2() != NULL, "must be");
duke@435	637	LIR_Op2* op2 = (LIR_Op2*)op;
duke@435	638
duke@435	639	assert(op2->_info == NULL && op2->_tmp->is_illegal(), "not used");
duke@435	640	assert(op2->_opr1->is_valid() && op2->_opr2->is_valid() && op2->_result->is_valid(), "used");
duke@435	641
duke@435	642	do_input(op2->_opr1);
duke@435	643	do_input(op2->_opr2);
duke@435	644	do_temp(op2->_opr2);
duke@435	645	do_output(op2->_result);
duke@435	646
duke@435	647	break;
duke@435	648	}
duke@435	649
duke@435	650	// vspecial handling for strict operations: register input operands
duke@435	651	// as temp to guarantee that they do not overlap with other
duke@435	652	// registers
duke@435	653	case lir_mul_strictfp:
duke@435	654	case lir_div_strictfp:
duke@435	655	{
duke@435	656	assert(op->as_Op2() != NULL, "must be");
duke@435	657	LIR_Op2* op2 = (LIR_Op2*)op;
duke@435	658
duke@435	659	assert(op2->_info == NULL, "not used");
duke@435	660	assert(op2->_opr1->is_valid(), "used");
duke@435	661	assert(op2->_opr2->is_valid(), "used");
duke@435	662	assert(op2->_result->is_valid(), "used");
duke@435	663
duke@435	664	do_input(op2->_opr1); do_temp(op2->_opr1);
duke@435	665	do_input(op2->_opr2); do_temp(op2->_opr2);
duke@435	666	if (op2->_tmp->is_valid()) do_temp(op2->_tmp);
duke@435	667	do_output(op2->_result);
duke@435	668
duke@435	669	break;
duke@435	670	}
duke@435	671
never@1813	672	case lir_throw: {
duke@435	673	assert(op->as_Op2() != NULL, "must be");
duke@435	674	LIR_Op2* op2 = (LIR_Op2*)op;
duke@435	675
duke@435	676	if (op2->_info) do_info(op2->_info);
duke@435	677	if (op2->_opr1->is_valid()) do_temp(op2->_opr1);
duke@435	678	if (op2->_opr2->is_valid()) do_input(op2->_opr2); // exception object is input parameter
duke@435	679	assert(op2->_result->is_illegal(), "no result");
duke@435	680
duke@435	681	break;
duke@435	682	}
duke@435	683
never@1813	684	case lir_unwind: {
never@1813	685	assert(op->as_Op1() != NULL, "must be");
never@1813	686	LIR_Op1* op1 = (LIR_Op1*)op;
never@1813	687
never@1813	688	assert(op1->_info == NULL, "no info");
never@1813	689	assert(op1->_opr->is_valid(), "exception oop"); do_input(op1->_opr);
never@1813	690	assert(op1->_result->is_illegal(), "no result");
never@1813	691
never@1813	692	break;
never@1813	693	}
never@1813	694
duke@435	695
duke@435	696	case lir_tan:
duke@435	697	case lir_sin:
never@1388	698	case lir_cos:
never@1388	699	case lir_log:
never@1388	700	case lir_log10: {
duke@435	701	assert(op->as_Op2() != NULL, "must be");
duke@435	702	LIR_Op2* op2 = (LIR_Op2*)op;
duke@435	703
never@1388	704	// On x86 tan/sin/cos need two temporary fpu stack slots and
never@1388	705	// log/log10 need one so handle opr2 and tmp as temp inputs.
never@1388	706	// Register input operand as temp to guarantee that it doesn't
never@1388	707	// overlap with the input.
duke@435	708	assert(op2->_info == NULL, "not used");
duke@435	709	assert(op2->_opr1->is_valid(), "used");
duke@435	710	do_input(op2->_opr1); do_temp(op2->_opr1);
duke@435	711
duke@435	712	if (op2->_opr2->is_valid()) do_temp(op2->_opr2);
duke@435	713	if (op2->_tmp->is_valid()) do_temp(op2->_tmp);
duke@435	714	if (op2->_result->is_valid()) do_output(op2->_result);
duke@435	715
duke@435	716	break;
duke@435	717	}
duke@435	718
duke@435	719
duke@435	720	// LIR_Op3
duke@435	721	case lir_idiv:
duke@435	722	case lir_irem: {
duke@435	723	assert(op->as_Op3() != NULL, "must be");
duke@435	724	LIR_Op3* op3= (LIR_Op3*)op;
duke@435	725
duke@435	726	if (op3->_info) do_info(op3->_info);
duke@435	727	if (op3->_opr1->is_valid()) do_input(op3->_opr1);
duke@435	728
duke@435	729	// second operand is input and temp, so ensure that second operand
duke@435	730	// and third operand get not the same register
duke@435	731	if (op3->_opr2->is_valid()) do_input(op3->_opr2);
duke@435	732	if (op3->_opr2->is_valid()) do_temp(op3->_opr2);
duke@435	733	if (op3->_opr3->is_valid()) do_temp(op3->_opr3);
duke@435	734
duke@435	735	if (op3->_result->is_valid()) do_output(op3->_result);
duke@435	736
duke@435	737	break;
duke@435	738	}
duke@435	739
duke@435	740
duke@435	741	// LIR_OpJavaCall
duke@435	742	case lir_static_call:
duke@435	743	case lir_optvirtual_call:
duke@435	744	case lir_icvirtual_call:
twisti@1730	745	case lir_virtual_call:
twisti@1730	746	case lir_dynamic_call: {
twisti@1730	747	LIR_OpJavaCall* opJavaCall = op->as_OpJavaCall();
twisti@1730	748	assert(opJavaCall != NULL, "must be");
duke@435	749
duke@435	750	if (opJavaCall->_receiver->is_valid()) do_input(opJavaCall->_receiver);
duke@435	751
duke@435	752	// only visit register parameters
duke@435	753	int n = opJavaCall->_arguments->length();
duke@435	754	for (int i = 0; i < n; i++) {
duke@435	755	if (!opJavaCall->_arguments->at(i)->is_pointer()) {
duke@435	756	do_input(*opJavaCall->_arguments->adr_at(i));
duke@435	757	}
duke@435	758	}
duke@435	759
duke@435	760	if (opJavaCall->_info) do_info(opJavaCall->_info);
twisti@1919	761	if (opJavaCall->is_method_handle_invoke()) {
twisti@1919	762	opJavaCall->_method_handle_invoke_SP_save_opr = FrameMap::method_handle_invoke_SP_save_opr();
twisti@1919	763	do_temp(opJavaCall->_method_handle_invoke_SP_save_opr);
twisti@1919	764	}
duke@435	765	do_call();
duke@435	766	if (opJavaCall->_result->is_valid()) do_output(opJavaCall->_result);
duke@435	767
duke@435	768	break;
duke@435	769	}
duke@435	770
duke@435	771
duke@435	772	// LIR_OpRTCall
duke@435	773	case lir_rtcall: {
duke@435	774	assert(op->as_OpRTCall() != NULL, "must be");
duke@435	775	LIR_OpRTCall* opRTCall = (LIR_OpRTCall*)op;
duke@435	776
duke@435	777	// only visit register parameters
duke@435	778	int n = opRTCall->_arguments->length();
duke@435	779	for (int i = 0; i < n; i++) {
duke@435	780	if (!opRTCall->_arguments->at(i)->is_pointer()) {
duke@435	781	do_input(*opRTCall->_arguments->adr_at(i));
duke@435	782	}
duke@435	783	}
duke@435	784	if (opRTCall->_info) do_info(opRTCall->_info);
duke@435	785	if (opRTCall->_tmp->is_valid()) do_temp(opRTCall->_tmp);
duke@435	786	do_call();
duke@435	787	if (opRTCall->_result->is_valid()) do_output(opRTCall->_result);
duke@435	788
duke@435	789	break;
duke@435	790	}
duke@435	791
duke@435	792
duke@435	793	// LIR_OpArrayCopy
duke@435	794	case lir_arraycopy: {
duke@435	795	assert(op->as_OpArrayCopy() != NULL, "must be");
duke@435	796	LIR_OpArrayCopy* opArrayCopy = (LIR_OpArrayCopy*)op;
duke@435	797
duke@435	798	assert(opArrayCopy->_result->is_illegal(), "unused");
duke@435	799	assert(opArrayCopy->_src->is_valid(), "used"); do_input(opArrayCopy->_src); do_temp(opArrayCopy->_src);
duke@435	800	assert(opArrayCopy->_src_pos->is_valid(), "used"); do_input(opArrayCopy->_src_pos); do_temp(opArrayCopy->_src_pos);
duke@435	801	assert(opArrayCopy->_dst->is_valid(), "used"); do_input(opArrayCopy->_dst); do_temp(opArrayCopy->_dst);
duke@435	802	assert(opArrayCopy->_dst_pos->is_valid(), "used"); do_input(opArrayCopy->_dst_pos); do_temp(opArrayCopy->_dst_pos);
duke@435	803	assert(opArrayCopy->_length->is_valid(), "used"); do_input(opArrayCopy->_length); do_temp(opArrayCopy->_length);
duke@435	804	assert(opArrayCopy->_tmp->is_valid(), "used"); do_temp(opArrayCopy->_tmp);
duke@435	805	if (opArrayCopy->_info) do_info(opArrayCopy->_info);
duke@435	806
duke@435	807	// the implementation of arraycopy always has a call into the runtime
duke@435	808	do_call();
duke@435	809
duke@435	810	break;
duke@435	811	}
duke@435	812
duke@435	813
duke@435	814	// LIR_OpLock
duke@435	815	case lir_lock:
duke@435	816	case lir_unlock: {
duke@435	817	assert(op->as_OpLock() != NULL, "must be");
duke@435	818	LIR_OpLock* opLock = (LIR_OpLock*)op;
duke@435	819
duke@435	820	if (opLock->_info) do_info(opLock->_info);
duke@435	821
duke@435	822	// TODO: check if these operands really have to be temp
duke@435	823	// (or if input is sufficient). This may have influence on the oop map!
duke@435	824	assert(opLock->_lock->is_valid(), "used"); do_temp(opLock->_lock);
duke@435	825	assert(opLock->_hdr->is_valid(), "used"); do_temp(opLock->_hdr);
duke@435	826	assert(opLock->_obj->is_valid(), "used"); do_temp(opLock->_obj);
duke@435	827
duke@435	828	if (opLock->_scratch->is_valid()) do_temp(opLock->_scratch);
duke@435	829	assert(opLock->_result->is_illegal(), "unused");
duke@435	830
duke@435	831	do_stub(opLock->_stub);
duke@435	832
duke@435	833	break;
duke@435	834	}
duke@435	835
duke@435	836
duke@435	837	// LIR_OpDelay
duke@435	838	case lir_delay_slot: {
duke@435	839	assert(op->as_OpDelay() != NULL, "must be");
duke@435	840	LIR_OpDelay* opDelay = (LIR_OpDelay*)op;
duke@435	841
duke@435	842	visit(opDelay->delay_op());
duke@435	843	break;
duke@435	844	}
duke@435	845
duke@435	846	// LIR_OpTypeCheck
duke@435	847	case lir_instanceof:
duke@435	848	case lir_checkcast:
duke@435	849	case lir_store_check: {
duke@435	850	assert(op->as_OpTypeCheck() != NULL, "must be");
duke@435	851	LIR_OpTypeCheck* opTypeCheck = (LIR_OpTypeCheck*)op;
duke@435	852
duke@435	853	if (opTypeCheck->_info_for_exception) do_info(opTypeCheck->_info_for_exception);
duke@435	854	if (opTypeCheck->_info_for_patch) do_info(opTypeCheck->_info_for_patch);
duke@435	855	if (opTypeCheck->_object->is_valid()) do_input(opTypeCheck->_object);
duke@435	856	if (opTypeCheck->_array->is_valid()) do_input(opTypeCheck->_array);
duke@435	857	if (opTypeCheck->_tmp1->is_valid()) do_temp(opTypeCheck->_tmp1);
duke@435	858	if (opTypeCheck->_tmp2->is_valid()) do_temp(opTypeCheck->_tmp2);
duke@435	859	if (opTypeCheck->_tmp3->is_valid()) do_temp(opTypeCheck->_tmp3);
duke@435	860	if (opTypeCheck->_result->is_valid()) do_output(opTypeCheck->_result);
duke@435	861	do_stub(opTypeCheck->_stub);
duke@435	862	break;
duke@435	863	}
duke@435	864
duke@435	865	// LIR_OpCompareAndSwap
duke@435	866	case lir_cas_long:
duke@435	867	case lir_cas_obj:
duke@435	868	case lir_cas_int: {
duke@435	869	assert(op->as_OpCompareAndSwap() != NULL, "must be");
duke@435	870	LIR_OpCompareAndSwap* opCompareAndSwap = (LIR_OpCompareAndSwap*)op;
duke@435	871
bobv@2036	872	assert(opCompareAndSwap->_addr->is_valid(), "used");
bobv@2036	873	assert(opCompareAndSwap->_cmp_value->is_valid(), "used");
bobv@2036	874	assert(opCompareAndSwap->_new_value->is_valid(), "used");
duke@435	875	if (opCompareAndSwap->_info) do_info(opCompareAndSwap->_info);
bobv@2036	876	do_input(opCompareAndSwap->_addr);
bobv@2036	877	do_temp(opCompareAndSwap->_addr);
bobv@2036	878	do_input(opCompareAndSwap->_cmp_value);
bobv@2036	879	do_temp(opCompareAndSwap->_cmp_value);
bobv@2036	880	do_input(opCompareAndSwap->_new_value);
bobv@2036	881	do_temp(opCompareAndSwap->_new_value);
duke@435	882	if (opCompareAndSwap->_tmp1->is_valid()) do_temp(opCompareAndSwap->_tmp1);
duke@435	883	if (opCompareAndSwap->_tmp2->is_valid()) do_temp(opCompareAndSwap->_tmp2);
duke@435	884	if (opCompareAndSwap->_result->is_valid()) do_output(opCompareAndSwap->_result);
duke@435	885
duke@435	886	break;
duke@435	887	}
duke@435	888
duke@435	889
duke@435	890	// LIR_OpAllocArray;
duke@435	891	case lir_alloc_array: {
duke@435	892	assert(op->as_OpAllocArray() != NULL, "must be");
duke@435	893	LIR_OpAllocArray* opAllocArray = (LIR_OpAllocArray*)op;
duke@435	894
duke@435	895	if (opAllocArray->_info) do_info(opAllocArray->_info);
duke@435	896	if (opAllocArray->_klass->is_valid()) do_input(opAllocArray->_klass); do_temp(opAllocArray->_klass);
duke@435	897	if (opAllocArray->_len->is_valid()) do_input(opAllocArray->_len); do_temp(opAllocArray->_len);
duke@435	898	if (opAllocArray->_tmp1->is_valid()) do_temp(opAllocArray->_tmp1);
duke@435	899	if (opAllocArray->_tmp2->is_valid()) do_temp(opAllocArray->_tmp2);
duke@435	900	if (opAllocArray->_tmp3->is_valid()) do_temp(opAllocArray->_tmp3);
duke@435	901	if (opAllocArray->_tmp4->is_valid()) do_temp(opAllocArray->_tmp4);
duke@435	902	if (opAllocArray->_result->is_valid()) do_output(opAllocArray->_result);
duke@435	903	do_stub(opAllocArray->_stub);
duke@435	904	break;
duke@435	905	}
duke@435	906
duke@435	907	// LIR_OpProfileCall:
duke@435	908	case lir_profile_call: {
duke@435	909	assert(op->as_OpProfileCall() != NULL, "must be");
duke@435	910	LIR_OpProfileCall* opProfileCall = (LIR_OpProfileCall*)op;
duke@435	911
duke@435	912	if (opProfileCall->_recv->is_valid()) do_temp(opProfileCall->_recv);
duke@435	913	assert(opProfileCall->_mdo->is_valid(), "used"); do_temp(opProfileCall->_mdo);
duke@435	914	assert(opProfileCall->_tmp1->is_valid(), "used"); do_temp(opProfileCall->_tmp1);
duke@435	915	break;
duke@435	916	}
duke@435	917	default:
duke@435	918	ShouldNotReachHere();
duke@435	919	}
duke@435	920	}
duke@435	921
duke@435	922
duke@435	923	void LIR_OpVisitState::do_stub(CodeStub* stub) {
duke@435	924	if (stub != NULL) {
duke@435	925	stub->visit(this);
duke@435	926	}
duke@435	927	}
duke@435	928
duke@435	929	XHandlers* LIR_OpVisitState::all_xhandler() {
duke@435	930	XHandlers* result = NULL;
duke@435	931
duke@435	932	int i;
duke@435	933	for (i = 0; i < info_count(); i++) {
duke@435	934	if (info_at(i)->exception_handlers() != NULL) {
duke@435	935	result = info_at(i)->exception_handlers();
duke@435	936	break;
duke@435	937	}
duke@435	938	}
duke@435	939
duke@435	940	#ifdef ASSERT
duke@435	941	for (i = 0; i < info_count(); i++) {
duke@435	942	assert(info_at(i)->exception_handlers() == NULL ||
duke@435	943	info_at(i)->exception_handlers() == result,
duke@435	944	"only one xhandler list allowed per LIR-operation");
duke@435	945	}
duke@435	946	#endif
duke@435	947
duke@435	948	if (result != NULL) {
duke@435	949	return result;
duke@435	950	} else {
duke@435	951	return new XHandlers();
duke@435	952	}
duke@435	953
duke@435	954	return result;
duke@435	955	}
duke@435	956
duke@435	957
duke@435	958	#ifdef ASSERT
duke@435	959	bool LIR_OpVisitState::no_operands(LIR_Op* op) {
duke@435	960	visit(op);
duke@435	961
duke@435	962	return opr_count(inputMode) == 0 &&
duke@435	963	opr_count(outputMode) == 0 &&
duke@435	964	opr_count(tempMode) == 0 &&
duke@435	965	info_count() == 0 &&
duke@435	966	!has_call() &&
duke@435	967	!has_slow_case();
duke@435	968	}
duke@435	969	#endif
duke@435	970
duke@435	971	//---------------------------------------------------
duke@435	972
duke@435	973
duke@435	974	void LIR_OpJavaCall::emit_code(LIR_Assembler* masm) {
duke@435	975	masm->emit_call(this);
duke@435	976	}
duke@435	977
duke@435	978	void LIR_OpRTCall::emit_code(LIR_Assembler* masm) {
duke@435	979	masm->emit_rtcall(this);
duke@435	980	}
duke@435	981
duke@435	982	void LIR_OpLabel::emit_code(LIR_Assembler* masm) {
duke@435	983	masm->emit_opLabel(this);
duke@435	984	}
duke@435	985
duke@435	986	void LIR_OpArrayCopy::emit_code(LIR_Assembler* masm) {
duke@435	987	masm->emit_arraycopy(this);
duke@435	988	masm->emit_code_stub(stub());
duke@435	989	}
duke@435	990
duke@435	991	void LIR_Op0::emit_code(LIR_Assembler* masm) {
duke@435	992	masm->emit_op0(this);
duke@435	993	}
duke@435	994
duke@435	995	void LIR_Op1::emit_code(LIR_Assembler* masm) {
duke@435	996	masm->emit_op1(this);
duke@435	997	}
duke@435	998
duke@435	999	void LIR_OpAllocObj::emit_code(LIR_Assembler* masm) {
duke@435	1000	masm->emit_alloc_obj(this);
duke@435	1001	masm->emit_code_stub(stub());
duke@435	1002	}
duke@435	1003
duke@435	1004	void LIR_OpBranch::emit_code(LIR_Assembler* masm) {
duke@435	1005	masm->emit_opBranch(this);
duke@435	1006	if (stub()) {
duke@435	1007	masm->emit_code_stub(stub());
duke@435	1008	}
duke@435	1009	}
duke@435	1010
duke@435	1011	void LIR_OpConvert::emit_code(LIR_Assembler* masm) {
duke@435	1012	masm->emit_opConvert(this);
duke@435	1013	if (stub() != NULL) {
duke@435	1014	masm->emit_code_stub(stub());
duke@435	1015	}
duke@435	1016	}
duke@435	1017
duke@435	1018	void LIR_Op2::emit_code(LIR_Assembler* masm) {
duke@435	1019	masm->emit_op2(this);
duke@435	1020	}
duke@435	1021
duke@435	1022	void LIR_OpAllocArray::emit_code(LIR_Assembler* masm) {
duke@435	1023	masm->emit_alloc_array(this);
duke@435	1024	masm->emit_code_stub(stub());
duke@435	1025	}
duke@435	1026
duke@435	1027	void LIR_OpTypeCheck::emit_code(LIR_Assembler* masm) {
iveresov@2146	1028	masm->emit_opTypeCheck(this);
duke@435	1029	if (stub()) {
duke@435	1030	masm->emit_code_stub(stub());
duke@435	1031	}
duke@435	1032	}
duke@435	1033
duke@435	1034	void LIR_OpCompareAndSwap::emit_code(LIR_Assembler* masm) {
duke@435	1035	masm->emit_compare_and_swap(this);
duke@435	1036	}
duke@435	1037
duke@435	1038	void LIR_Op3::emit_code(LIR_Assembler* masm) {
duke@435	1039	masm->emit_op3(this);
duke@435	1040	}
duke@435	1041
duke@435	1042	void LIR_OpLock::emit_code(LIR_Assembler* masm) {
duke@435	1043	masm->emit_lock(this);
duke@435	1044	if (stub()) {
duke@435	1045	masm->emit_code_stub(stub());
duke@435	1046	}
duke@435	1047	}
duke@435	1048
duke@435	1049
duke@435	1050	void LIR_OpDelay::emit_code(LIR_Assembler* masm) {
duke@435	1051	masm->emit_delay(this);
duke@435	1052	}
duke@435	1053
duke@435	1054	void LIR_OpProfileCall::emit_code(LIR_Assembler* masm) {
duke@435	1055	masm->emit_profile_call(this);
duke@435	1056	}
duke@435	1057
duke@435	1058	// LIR_List
duke@435	1059	LIR_List::LIR_List(Compilation* compilation, BlockBegin* block)
duke@435	1060	: _operations(8)
duke@435	1061	, _compilation(compilation)
duke@435	1062	#ifndef PRODUCT
duke@435	1063	, _block(block)
duke@435	1064	#endif
duke@435	1065	#ifdef ASSERT
duke@435	1066	, _file(NULL)
duke@435	1067	, _line(0)
duke@435	1068	#endif
duke@435	1069	{ }
duke@435	1070
duke@435	1071
duke@435	1072	#ifdef ASSERT
duke@435	1073	void LIR_List::set_file_and_line(const char * file, int line) {
duke@435	1074	const char * f = strrchr(file, '/');
duke@435	1075	if (f == NULL) f = strrchr(file, '\\');
duke@435	1076	if (f == NULL) {
duke@435	1077	f = file;
duke@435	1078	} else {
duke@435	1079	f++;
duke@435	1080	}
duke@435	1081	_file = f;
duke@435	1082	_line = line;
duke@435	1083	}
duke@435	1084	#endif
duke@435	1085
duke@435	1086
duke@435	1087	void LIR_List::append(LIR_InsertionBuffer* buffer) {
duke@435	1088	assert(this == buffer->lir_list(), "wrong lir list");
duke@435	1089	const int n = _operations.length();
duke@435	1090
duke@435	1091	if (buffer->number_of_ops() > 0) {
duke@435	1092	// increase size of instructions list
duke@435	1093	_operations.at_grow(n + buffer->number_of_ops() - 1, NULL);
duke@435	1094	// insert ops from buffer into instructions list
duke@435	1095	int op_index = buffer->number_of_ops() - 1;
duke@435	1096	int ip_index = buffer->number_of_insertion_points() - 1;
duke@435	1097	int from_index = n - 1;
duke@435	1098	int to_index = _operations.length() - 1;
duke@435	1099	for (; ip_index >= 0; ip_index --) {
duke@435	1100	int index = buffer->index_at(ip_index);
duke@435	1101	// make room after insertion point
duke@435	1102	while (index < from_index) {
duke@435	1103	_operations.at_put(to_index --, _operations.at(from_index --));
duke@435	1104	}
duke@435	1105	// insert ops from buffer
duke@435	1106	for (int i = buffer->count_at(ip_index); i > 0; i --) {
duke@435	1107	_operations.at_put(to_index --, buffer->op_at(op_index --));
duke@435	1108	}
duke@435	1109	}
duke@435	1110	}
duke@435	1111
duke@435	1112	buffer->finish();
duke@435	1113	}
duke@435	1114
duke@435	1115
duke@435	1116	void LIR_List::oop2reg_patch(jobject o, LIR_Opr reg, CodeEmitInfo* info) {
duke@435	1117	append(new LIR_Op1(lir_move, LIR_OprFact::oopConst(o), reg, T_OBJECT, lir_patch_normal, info));
duke@435	1118	}
duke@435	1119
duke@435	1120
duke@435	1121	void LIR_List::load(LIR_Address* addr, LIR_Opr src, CodeEmitInfo* info, LIR_PatchCode patch_code) {
duke@435	1122	append(new LIR_Op1(
duke@435	1123	lir_move,
duke@435	1124	LIR_OprFact::address(addr),
duke@435	1125	src,
duke@435	1126	addr->type(),
duke@435	1127	patch_code,
duke@435	1128	info));
duke@435	1129	}
duke@435	1130
duke@435	1131
duke@435	1132	void LIR_List::volatile_load_mem_reg(LIR_Address* address, LIR_Opr dst, CodeEmitInfo* info, LIR_PatchCode patch_code) {
duke@435	1133	append(new LIR_Op1(
duke@435	1134	lir_move,
duke@435	1135	LIR_OprFact::address(address),
duke@435	1136	dst,
duke@435	1137	address->type(),
duke@435	1138	patch_code,
duke@435	1139	info, lir_move_volatile));
duke@435	1140	}
duke@435	1141
duke@435	1142	void LIR_List::volatile_load_unsafe_reg(LIR_Opr base, LIR_Opr offset, LIR_Opr dst, BasicType type, CodeEmitInfo* info, LIR_PatchCode patch_code) {
duke@435	1143	append(new LIR_Op1(
duke@435	1144	lir_move,
duke@435	1145	LIR_OprFact::address(new LIR_Address(base, offset, type)),
duke@435	1146	dst,
duke@435	1147	type,
duke@435	1148	patch_code,
duke@435	1149	info, lir_move_volatile));
duke@435	1150	}
duke@435	1151
duke@435	1152
duke@435	1153	void LIR_List::prefetch(LIR_Address* addr, bool is_store) {
duke@435	1154	append(new LIR_Op1(
duke@435	1155	is_store ? lir_prefetchw : lir_prefetchr,
duke@435	1156	LIR_OprFact::address(addr)));
duke@435	1157	}
duke@435	1158
duke@435	1159
duke@435	1160	void LIR_List::store_mem_int(jint v, LIR_Opr base, int offset_in_bytes, BasicType type, CodeEmitInfo* info, LIR_PatchCode patch_code) {
duke@435	1161	append(new LIR_Op1(
duke@435	1162	lir_move,
duke@435	1163	LIR_OprFact::intConst(v),
duke@435	1164	LIR_OprFact::address(new LIR_Address(base, offset_in_bytes, type)),
duke@435	1165	type,
duke@435	1166	patch_code,
duke@435	1167	info));
duke@435	1168	}
duke@435	1169
duke@435	1170
duke@435	1171	void LIR_List::store_mem_oop(jobject o, LIR_Opr base, int offset_in_bytes, BasicType type, CodeEmitInfo* info, LIR_PatchCode patch_code) {
duke@435	1172	append(new LIR_Op1(
duke@435	1173	lir_move,
duke@435	1174	LIR_OprFact::oopConst(o),
duke@435	1175	LIR_OprFact::address(new LIR_Address(base, offset_in_bytes, type)),
duke@435	1176	type,
duke@435	1177	patch_code,
duke@435	1178	info));
duke@435	1179	}
duke@435	1180
duke@435	1181
duke@435	1182	void LIR_List::store(LIR_Opr src, LIR_Address* addr, CodeEmitInfo* info, LIR_PatchCode patch_code) {
duke@435	1183	append(new LIR_Op1(
duke@435	1184	lir_move,
duke@435	1185	src,
duke@435	1186	LIR_OprFact::address(addr),
duke@435	1187	addr->type(),
duke@435	1188	patch_code,
duke@435	1189	info));
duke@435	1190	}
duke@435	1191
duke@435	1192
duke@435	1193	void LIR_List::volatile_store_mem_reg(LIR_Opr src, LIR_Address* addr, CodeEmitInfo* info, LIR_PatchCode patch_code) {
duke@435	1194	append(new LIR_Op1(
duke@435	1195	lir_move,
duke@435	1196	src,
duke@435	1197	LIR_OprFact::address(addr),
duke@435	1198	addr->type(),
duke@435	1199	patch_code,
duke@435	1200	info,
duke@435	1201	lir_move_volatile));
duke@435	1202	}
duke@435	1203
duke@435	1204	void LIR_List::volatile_store_unsafe_reg(LIR_Opr src, LIR_Opr base, LIR_Opr offset, BasicType type, CodeEmitInfo* info, LIR_PatchCode patch_code) {
duke@435	1205	append(new LIR_Op1(
duke@435	1206	lir_move,
duke@435	1207	src,
duke@435	1208	LIR_OprFact::address(new LIR_Address(base, offset, type)),
duke@435	1209	type,
duke@435	1210	patch_code,
duke@435	1211	info, lir_move_volatile));
duke@435	1212	}
duke@435	1213
duke@435	1214
duke@435	1215	void LIR_List::idiv(LIR_Opr left, LIR_Opr right, LIR_Opr res, LIR_Opr tmp, CodeEmitInfo* info) {
duke@435	1216	append(new LIR_Op3(
duke@435	1217	lir_idiv,
duke@435	1218	left,
duke@435	1219	right,
duke@435	1220	tmp,
duke@435	1221	res,
duke@435	1222	info));
duke@435	1223	}
duke@435	1224
duke@435	1225
duke@435	1226	void LIR_List::idiv(LIR_Opr left, int right, LIR_Opr res, LIR_Opr tmp, CodeEmitInfo* info) {
duke@435	1227	append(new LIR_Op3(
duke@435	1228	lir_idiv,
duke@435	1229	left,
duke@435	1230	LIR_OprFact::intConst(right),
duke@435	1231	tmp,
duke@435	1232	res,
duke@435	1233	info));
duke@435	1234	}
duke@435	1235
duke@435	1236
duke@435	1237	void LIR_List::irem(LIR_Opr left, LIR_Opr right, LIR_Opr res, LIR_Opr tmp, CodeEmitInfo* info) {
duke@435	1238	append(new LIR_Op3(
duke@435	1239	lir_irem,
duke@435	1240	left,
duke@435	1241	right,
duke@435	1242	tmp,
duke@435	1243	res,
duke@435	1244	info));
duke@435	1245	}
duke@435	1246
duke@435	1247
duke@435	1248	void LIR_List::irem(LIR_Opr left, int right, LIR_Opr res, LIR_Opr tmp, CodeEmitInfo* info) {
duke@435	1249	append(new LIR_Op3(
duke@435	1250	lir_irem,
duke@435	1251	left,
duke@435	1252	LIR_OprFact::intConst(right),
duke@435	1253	tmp,
duke@435	1254	res,
duke@435	1255	info));
duke@435	1256	}
duke@435	1257
duke@435	1258
duke@435	1259	void LIR_List::cmp_mem_int(LIR_Condition condition, LIR_Opr base, int disp, int c, CodeEmitInfo* info) {
duke@435	1260	append(new LIR_Op2(
duke@435	1261	lir_cmp,
duke@435	1262	condition,
duke@435	1263	LIR_OprFact::address(new LIR_Address(base, disp, T_INT)),
duke@435	1264	LIR_OprFact::intConst(c),
duke@435	1265	info));
duke@435	1266	}
duke@435	1267
duke@435	1268
duke@435	1269	void LIR_List::cmp_reg_mem(LIR_Condition condition, LIR_Opr reg, LIR_Address* addr, CodeEmitInfo* info) {
duke@435	1270	append(new LIR_Op2(
duke@435	1271	lir_cmp,
duke@435	1272	condition,
duke@435	1273	reg,
duke@435	1274	LIR_OprFact::address(addr),
duke@435	1275	info));
duke@435	1276	}
duke@435	1277
duke@435	1278	void LIR_List::allocate_object(LIR_Opr dst, LIR_Opr t1, LIR_Opr t2, LIR_Opr t3, LIR_Opr t4,
duke@435	1279	int header_size, int object_size, LIR_Opr klass, bool init_check, CodeStub* stub) {
duke@435	1280	append(new LIR_OpAllocObj(
duke@435	1281	klass,
duke@435	1282	dst,
duke@435	1283	t1,
duke@435	1284	t2,
duke@435	1285	t3,
duke@435	1286	t4,
duke@435	1287	header_size,
duke@435	1288	object_size,
duke@435	1289	init_check,
duke@435	1290	stub));
duke@435	1291	}
duke@435	1292
duke@435	1293	void LIR_List::allocate_array(LIR_Opr dst, LIR_Opr len, LIR_Opr t1,LIR_Opr t2, LIR_Opr t3,LIR_Opr t4, BasicType type, LIR_Opr klass, CodeStub* stub) {
duke@435	1294	append(new LIR_OpAllocArray(
duke@435	1295	klass,
duke@435	1296	len,
duke@435	1297	dst,
duke@435	1298	t1,
duke@435	1299	t2,
duke@435	1300	t3,
duke@435	1301	t4,
duke@435	1302	type,
duke@435	1303	stub));
duke@435	1304	}
duke@435	1305
duke@435	1306	void LIR_List::shift_left(LIR_Opr value, LIR_Opr count, LIR_Opr dst, LIR_Opr tmp) {
duke@435	1307	append(new LIR_Op2(
duke@435	1308	lir_shl,
duke@435	1309	value,
duke@435	1310	count,
duke@435	1311	dst,
duke@435	1312	tmp));
duke@435	1313	}
duke@435	1314
duke@435	1315	void LIR_List::shift_right(LIR_Opr value, LIR_Opr count, LIR_Opr dst, LIR_Opr tmp) {
duke@435	1316	append(new LIR_Op2(
duke@435	1317	lir_shr,
duke@435	1318	value,
duke@435	1319	count,
duke@435	1320	dst,
duke@435	1321	tmp));
duke@435	1322	}
duke@435	1323
duke@435	1324
duke@435	1325	void LIR_List::unsigned_shift_right(LIR_Opr value, LIR_Opr count, LIR_Opr dst, LIR_Opr tmp) {
duke@435	1326	append(new LIR_Op2(
duke@435	1327	lir_ushr,
duke@435	1328	value,
duke@435	1329	count,
duke@435	1330	dst,
duke@435	1331	tmp));
duke@435	1332	}
duke@435	1333
duke@435	1334	void LIR_List::fcmp2int(LIR_Opr left, LIR_Opr right, LIR_Opr dst, bool is_unordered_less) {
duke@435	1335	append(new LIR_Op2(is_unordered_less ? lir_ucmp_fd2i : lir_cmp_fd2i,
duke@435	1336	left,
duke@435	1337	right,
duke@435	1338	dst));
duke@435	1339	}
duke@435	1340
duke@435	1341	void LIR_List::lock_object(LIR_Opr hdr, LIR_Opr obj, LIR_Opr lock, LIR_Opr scratch, CodeStub* stub, CodeEmitInfo* info) {
duke@435	1342	append(new LIR_OpLock(
duke@435	1343	lir_lock,
duke@435	1344	hdr,
duke@435	1345	obj,
duke@435	1346	lock,
duke@435	1347	scratch,
duke@435	1348	stub,
duke@435	1349	info));
duke@435	1350	}
duke@435	1351
bobv@2036	1352	void LIR_List::unlock_object(LIR_Opr hdr, LIR_Opr obj, LIR_Opr lock, LIR_Opr scratch, CodeStub* stub) {
duke@435	1353	append(new LIR_OpLock(
duke@435	1354	lir_unlock,
duke@435	1355	hdr,
duke@435	1356	obj,
duke@435	1357	lock,
bobv@2036	1358	scratch,
duke@435	1359	stub,
duke@435	1360	NULL));
duke@435	1361	}
duke@435	1362
duke@435	1363
duke@435	1364	void check_LIR() {
duke@435	1365	// cannot do the proper checking as PRODUCT and other modes return different results
duke@435	1366	// guarantee(sizeof(LIR_OprDesc) == wordSize, "may not have a v-table");
duke@435	1367	}
duke@435	1368
duke@435	1369
duke@435	1370
duke@435	1371	void LIR_List::checkcast (LIR_Opr result, LIR_Opr object, ciKlass* klass,
duke@435	1372	LIR_Opr tmp1, LIR_Opr tmp2, LIR_Opr tmp3, bool fast_check,
duke@435	1373	CodeEmitInfo* info_for_exception, CodeEmitInfo* info_for_patch, CodeStub* stub,
duke@435	1374	ciMethod* profiled_method, int profiled_bci) {
iveresov@2138	1375	LIR_OpTypeCheck* c = new LIR_OpTypeCheck(lir_checkcast, result, object, klass,
iveresov@2138	1376	tmp1, tmp2, tmp3, fast_check, info_for_exception, info_for_patch, stub);
iveresov@2138	1377	if (profiled_method != NULL) {
iveresov@2138	1378	c->set_profiled_method(profiled_method);
iveresov@2138	1379	c->set_profiled_bci(profiled_bci);
iveresov@2138	1380	c->set_should_profile(true);
iveresov@2138	1381	}
iveresov@2138	1382	append(c);
duke@435	1383	}
duke@435	1384
iveresov@2146	1385	void LIR_List::instanceof(LIR_Opr result, LIR_Opr object, ciKlass* klass, LIR_Opr tmp1, LIR_Opr tmp2, LIR_Opr tmp3, bool fast_check, CodeEmitInfo* info_for_patch, ciMethod* profiled_method, int profiled_bci) {
iveresov@2146	1386	LIR_OpTypeCheck* c = new LIR_OpTypeCheck(lir_instanceof, result, object, klass, tmp1, tmp2, tmp3, fast_check, NULL, info_for_patch, NULL);
iveresov@2146	1387	if (profiled_method != NULL) {
iveresov@2146	1388	c->set_profiled_method(profiled_method);
iveresov@2146	1389	c->set_profiled_bci(profiled_bci);
iveresov@2146	1390	c->set_should_profile(true);
iveresov@2146	1391	}
iveresov@2146	1392	append(c);
duke@435	1393	}
duke@435	1394
duke@435	1395
duke@435	1396	void LIR_List::store_check(LIR_Opr object, LIR_Opr array, LIR_Opr tmp1, LIR_Opr tmp2, LIR_Opr tmp3, CodeEmitInfo* info_for_exception) {
iveresov@2138	1397	append(new LIR_OpTypeCheck(lir_store_check, object, array, tmp1, tmp2, tmp3, info_for_exception));
duke@435	1398	}
duke@435	1399
duke@435	1400
bobv@2036	1401	void LIR_List::cas_long(LIR_Opr addr, LIR_Opr cmp_value, LIR_Opr new_value,
bobv@2036	1402	LIR_Opr t1, LIR_Opr t2, LIR_Opr result) {
bobv@2036	1403	append(new LIR_OpCompareAndSwap(lir_cas_long, addr, cmp_value, new_value, t1, t2, result));
duke@435	1404	}
duke@435	1405
bobv@2036	1406	void LIR_List::cas_obj(LIR_Opr addr, LIR_Opr cmp_value, LIR_Opr new_value,
bobv@2036	1407	LIR_Opr t1, LIR_Opr t2, LIR_Opr result) {
bobv@2036	1408	append(new LIR_OpCompareAndSwap(lir_cas_obj, addr, cmp_value, new_value, t1, t2, result));
duke@435	1409	}
duke@435	1410
bobv@2036	1411	void LIR_List::cas_int(LIR_Opr addr, LIR_Opr cmp_value, LIR_Opr new_value,
bobv@2036	1412	LIR_Opr t1, LIR_Opr t2, LIR_Opr result) {
bobv@2036	1413	append(new LIR_OpCompareAndSwap(lir_cas_int, addr, cmp_value, new_value, t1, t2, result));
duke@435	1414	}
duke@435	1415
duke@435	1416
duke@435	1417	#ifdef PRODUCT
duke@435	1418
duke@435	1419	void print_LIR(BlockList* blocks) {
duke@435	1420	}
duke@435	1421
duke@435	1422	#else
duke@435	1423	// LIR_OprDesc
duke@435	1424	void LIR_OprDesc::print() const {
duke@435	1425	print(tty);
duke@435	1426	}
duke@435	1427
duke@435	1428	void LIR_OprDesc::print(outputStream* out) const {
duke@435	1429	if (is_illegal()) {
duke@435	1430	return;
duke@435	1431	}
duke@435	1432
duke@435	1433	out->print("[");
duke@435	1434	if (is_pointer()) {
duke@435	1435	pointer()->print_value_on(out);
duke@435	1436	} else if (is_single_stack()) {
duke@435	1437	out->print("stack:%d", single_stack_ix());
duke@435	1438	} else if (is_double_stack()) {
duke@435	1439	out->print("dbl_stack:%d",double_stack_ix());
duke@435	1440	} else if (is_virtual()) {
duke@435	1441	out->print("R%d", vreg_number());
duke@435	1442	} else if (is_single_cpu()) {
duke@435	1443	out->print(as_register()->name());
duke@435	1444	} else if (is_double_cpu()) {
duke@435	1445	out->print(as_register_hi()->name());
duke@435	1446	out->print(as_register_lo()->name());
never@739	1447	#if defined(X86)
duke@435	1448	} else if (is_single_xmm()) {
duke@435	1449	out->print(as_xmm_float_reg()->name());
duke@435	1450	} else if (is_double_xmm()) {
duke@435	1451	out->print(as_xmm_double_reg()->name());
duke@435	1452	} else if (is_single_fpu()) {
duke@435	1453	out->print("fpu%d", fpu_regnr());
duke@435	1454	} else if (is_double_fpu()) {
duke@435	1455	out->print("fpu%d", fpu_regnrLo());
bobv@2036	1456	#elif defined(ARM)
bobv@2036	1457	} else if (is_single_fpu()) {
bobv@2036	1458	out->print("s%d", fpu_regnr());
bobv@2036	1459	} else if (is_double_fpu()) {
bobv@2036	1460	out->print("d%d", fpu_regnrLo() >> 1);
duke@435	1461	#else
duke@435	1462	} else if (is_single_fpu()) {
duke@435	1463	out->print(as_float_reg()->name());
duke@435	1464	} else if (is_double_fpu()) {
duke@435	1465	out->print(as_double_reg()->name());
duke@435	1466	#endif
duke@435	1467
duke@435	1468	} else if (is_illegal()) {
duke@435	1469	out->print("-");
duke@435	1470	} else {
duke@435	1471	out->print("Unknown Operand");
duke@435	1472	}
duke@435	1473	if (!is_illegal()) {
duke@435	1474	out->print("|%c", type_char());
duke@435	1475	}
duke@435	1476	if (is_register() && is_last_use()) {
duke@435	1477	out->print("(last_use)");
duke@435	1478	}
duke@435	1479	out->print("]");
duke@435	1480	}
duke@435	1481
duke@435	1482
duke@435	1483	// LIR_Address
duke@435	1484	void LIR_Const::print_value_on(outputStream* out) const {
duke@435	1485	switch (type()) {
roland@1732	1486	case T_ADDRESS:out->print("address:%d",as_jint()); break;
duke@435	1487	case T_INT: out->print("int:%d", as_jint()); break;
duke@435	1488	case T_LONG: out->print("lng:%lld", as_jlong()); break;
duke@435	1489	case T_FLOAT: out->print("flt:%f", as_jfloat()); break;
duke@435	1490	case T_DOUBLE: out->print("dbl:%f", as_jdouble()); break;
duke@435	1491	case T_OBJECT: out->print("obj:0x%x", as_jobject()); break;
duke@435	1492	default: out->print("%3d:0x%x",type(), as_jdouble()); break;
duke@435	1493	}
duke@435	1494	}
duke@435	1495
duke@435	1496	// LIR_Address
duke@435	1497	void LIR_Address::print_value_on(outputStream* out) const {
duke@435	1498	out->print("Base:"); _base->print(out);
duke@435	1499	if (!_index->is_illegal()) {
duke@435	1500	out->print(" Index:"); _index->print(out);
duke@435	1501	switch (scale()) {
duke@435	1502	case times_1: break;
duke@435	1503	case times_2: out->print(" * 2"); break;
duke@435	1504	case times_4: out->print(" * 4"); break;
duke@435	1505	case times_8: out->print(" * 8"); break;
duke@435	1506	}
duke@435	1507	}
duke@435	1508	out->print(" Disp: %d", _disp);
duke@435	1509	}
duke@435	1510
duke@435	1511	// debug output of block header without InstructionPrinter
duke@435	1512	// (because phi functions are not necessary for LIR)
duke@435	1513	static void print_block(BlockBegin* x) {
duke@435	1514	// print block id
duke@435	1515	BlockEnd* end = x->end();
duke@435	1516	tty->print("B%d ", x->block_id());
duke@435	1517
duke@435	1518	// print flags
duke@435	1519	if (x->is_set(BlockBegin::std_entry_flag)) tty->print("std ");
duke@435	1520	if (x->is_set(BlockBegin::osr_entry_flag)) tty->print("osr ");
duke@435	1521	if (x->is_set(BlockBegin::exception_entry_flag)) tty->print("ex ");
duke@435	1522	if (x->is_set(BlockBegin::subroutine_entry_flag)) tty->print("jsr ");
duke@435	1523	if (x->is_set(BlockBegin::backward_branch_target_flag)) tty->print("bb ");
duke@435	1524	if (x->is_set(BlockBegin::linear_scan_loop_header_flag)) tty->print("lh ");
duke@435	1525	if (x->is_set(BlockBegin::linear_scan_loop_end_flag)) tty->print("le ");
duke@435	1526
duke@435	1527	// print block bci range
roland@2174	1528	tty->print("[%d, %d] ", x->bci(), (end == NULL ? -1 : end->printable_bci()));
duke@435	1529
duke@435	1530	// print predecessors and successors
duke@435	1531	if (x->number_of_preds() > 0) {
duke@435	1532	tty->print("preds: ");
duke@435	1533	for (int i = 0; i < x->number_of_preds(); i ++) {
duke@435	1534	tty->print("B%d ", x->pred_at(i)->block_id());
duke@435	1535	}
duke@435	1536	}
duke@435	1537
duke@435	1538	if (x->number_of_sux() > 0) {
duke@435	1539	tty->print("sux: ");
duke@435	1540	for (int i = 0; i < x->number_of_sux(); i ++) {
duke@435	1541	tty->print("B%d ", x->sux_at(i)->block_id());
duke@435	1542	}
duke@435	1543	}
duke@435	1544
duke@435	1545	// print exception handlers
duke@435	1546	if (x->number_of_exception_handlers() > 0) {
duke@435	1547	tty->print("xhandler: ");
duke@435	1548	for (int i = 0; i < x->number_of_exception_handlers(); i++) {
duke@435	1549	tty->print("B%d ", x->exception_handler_at(i)->block_id());
duke@435	1550	}
duke@435	1551	}
duke@435	1552
duke@435	1553	tty->cr();
duke@435	1554	}
duke@435	1555
duke@435	1556	void print_LIR(BlockList* blocks) {
duke@435	1557	tty->print_cr("LIR:");
duke@435	1558	int i;
duke@435	1559	for (i = 0; i < blocks->length(); i++) {
duke@435	1560	BlockBegin* bb = blocks->at(i);
duke@435	1561	print_block(bb);
duke@435	1562	tty->print("__id_Instruction___________________________________________"); tty->cr();
duke@435	1563	bb->lir()->print_instructions();
duke@435	1564	}
duke@435	1565	}
duke@435	1566
duke@435	1567	void LIR_List::print_instructions() {
duke@435	1568	for (int i = 0; i < _operations.length(); i++) {
duke@435	1569	_operations.at(i)->print(); tty->cr();
duke@435	1570	}
duke@435	1571	tty->cr();
duke@435	1572	}
duke@435	1573
duke@435	1574	// LIR_Ops printing routines
duke@435	1575	// LIR_Op
duke@435	1576	void LIR_Op::print_on(outputStream* out) const {
duke@435	1577	if (id() != -1 || PrintCFGToFile) {
duke@435	1578	out->print("%4d ", id());
duke@435	1579	} else {
duke@435	1580	out->print(" ");
duke@435	1581	}
duke@435	1582	out->print(name()); out->print(" ");
duke@435	1583	print_instr(out);
roland@2174	1584	if (info() != NULL) out->print(" [bci:%d]", info()->stack()->bci());
duke@435	1585	#ifdef ASSERT
duke@435	1586	if (Verbose && _file != NULL) {
duke@435	1587	out->print(" (%s:%d)", _file, _line);
duke@435	1588	}
duke@435	1589	#endif
duke@435	1590	}
duke@435	1591
duke@435	1592	const char * LIR_Op::name() const {
duke@435	1593	const char* s = NULL;
duke@435	1594	switch(code()) {
duke@435	1595	// LIR_Op0
duke@435	1596	case lir_membar: s = "membar"; break;
duke@435	1597	case lir_membar_acquire: s = "membar_acquire"; break;
duke@435	1598	case lir_membar_release: s = "membar_release"; break;
duke@435	1599	case lir_word_align: s = "word_align"; break;
duke@435	1600	case lir_label: s = "label"; break;
duke@435	1601	case lir_nop: s = "nop"; break;
duke@435	1602	case lir_backwardbranch_target: s = "backbranch"; break;
duke@435	1603	case lir_std_entry: s = "std_entry"; break;
duke@435	1604	case lir_osr_entry: s = "osr_entry"; break;
duke@435	1605	case lir_build_frame: s = "build_frm"; break;
duke@435	1606	case lir_fpop_raw: s = "fpop_raw"; break;
duke@435	1607	case lir_24bit_FPU: s = "24bit_FPU"; break;
duke@435	1608	case lir_reset_FPU: s = "reset_FPU"; break;
duke@435	1609	case lir_breakpoint: s = "breakpoint"; break;
duke@435	1610	case lir_get_thread: s = "get_thread"; break;
duke@435	1611	// LIR_Op1
duke@435	1612	case lir_fxch: s = "fxch"; break;
duke@435	1613	case lir_fld: s = "fld"; break;
duke@435	1614	case lir_ffree: s = "ffree"; break;
duke@435	1615	case lir_push: s = "push"; break;
duke@435	1616	case lir_pop: s = "pop"; break;
duke@435	1617	case lir_null_check: s = "null_check"; break;
duke@435	1618	case lir_return: s = "return"; break;
duke@435	1619	case lir_safepoint: s = "safepoint"; break;
duke@435	1620	case lir_neg: s = "neg"; break;
duke@435	1621	case lir_leal: s = "leal"; break;
duke@435	1622	case lir_branch: s = "branch"; break;
duke@435	1623	case lir_cond_float_branch: s = "flt_cond_br"; break;
duke@435	1624	case lir_move: s = "move"; break;
duke@435	1625	case lir_roundfp: s = "roundfp"; break;
duke@435	1626	case lir_rtcall: s = "rtcall"; break;
duke@435	1627	case lir_throw: s = "throw"; break;
duke@435	1628	case lir_unwind: s = "unwind"; break;
duke@435	1629	case lir_convert: s = "convert"; break;
duke@435	1630	case lir_alloc_object: s = "alloc_obj"; break;
duke@435	1631	case lir_monaddr: s = "mon_addr"; break;
iveresov@2138	1632	case lir_pack64: s = "pack64"; break;
iveresov@2138	1633	case lir_unpack64: s = "unpack64"; break;
duke@435	1634	// LIR_Op2
duke@435	1635	case lir_cmp: s = "cmp"; break;
duke@435	1636	case lir_cmp_l2i: s = "cmp_l2i"; break;
duke@435	1637	case lir_ucmp_fd2i: s = "ucomp_fd2i"; break;
duke@435	1638	case lir_cmp_fd2i: s = "comp_fd2i"; break;
duke@435	1639	case lir_cmove: s = "cmove"; break;
duke@435	1640	case lir_add: s = "add"; break;
duke@435	1641	case lir_sub: s = "sub"; break;
duke@435	1642	case lir_mul: s = "mul"; break;
duke@435	1643	case lir_mul_strictfp: s = "mul_strictfp"; break;
duke@435	1644	case lir_div: s = "div"; break;
duke@435	1645	case lir_div_strictfp: s = "div_strictfp"; break;
duke@435	1646	case lir_rem: s = "rem"; break;
duke@435	1647	case lir_abs: s = "abs"; break;
duke@435	1648	case lir_sqrt: s = "sqrt"; break;
duke@435	1649	case lir_sin: s = "sin"; break;
duke@435	1650	case lir_cos: s = "cos"; break;
duke@435	1651	case lir_tan: s = "tan"; break;
duke@435	1652	case lir_log: s = "log"; break;
duke@435	1653	case lir_log10: s = "log10"; break;
duke@435	1654	case lir_logic_and: s = "logic_and"; break;
duke@435	1655	case lir_logic_or: s = "logic_or"; break;
duke@435	1656	case lir_logic_xor: s = "logic_xor"; break;
duke@435	1657	case lir_shl: s = "shift_left"; break;
duke@435	1658	case lir_shr: s = "shift_right"; break;
duke@435	1659	case lir_ushr: s = "ushift_right"; break;
duke@435	1660	case lir_alloc_array: s = "alloc_array"; break;
duke@435	1661	// LIR_Op3
duke@435	1662	case lir_idiv: s = "idiv"; break;
duke@435	1663	case lir_irem: s = "irem"; break;
duke@435	1664	// LIR_OpJavaCall
duke@435	1665	case lir_static_call: s = "static"; break;
duke@435	1666	case lir_optvirtual_call: s = "optvirtual"; break;
duke@435	1667	case lir_icvirtual_call: s = "icvirtual"; break;
duke@435	1668	case lir_virtual_call: s = "virtual"; break;
twisti@1730	1669	case lir_dynamic_call: s = "dynamic"; break;
duke@435	1670	// LIR_OpArrayCopy
duke@435	1671	case lir_arraycopy: s = "arraycopy"; break;
duke@435	1672	// LIR_OpLock
duke@435	1673	case lir_lock: s = "lock"; break;
duke@435	1674	case lir_unlock: s = "unlock"; break;
duke@435	1675	// LIR_OpDelay
duke@435	1676	case lir_delay_slot: s = "delay"; break;
duke@435	1677	// LIR_OpTypeCheck
duke@435	1678	case lir_instanceof: s = "instanceof"; break;
duke@435	1679	case lir_checkcast: s = "checkcast"; break;
duke@435	1680	case lir_store_check: s = "store_check"; break;
duke@435	1681	// LIR_OpCompareAndSwap
duke@435	1682	case lir_cas_long: s = "cas_long"; break;
duke@435	1683	case lir_cas_obj: s = "cas_obj"; break;
duke@435	1684	case lir_cas_int: s = "cas_int"; break;
duke@435	1685	// LIR_OpProfileCall
duke@435	1686	case lir_profile_call: s = "profile_call"; break;
duke@435	1687	case lir_none: ShouldNotReachHere();break;
duke@435	1688	default: s = "illegal_op"; break;
duke@435	1689	}
duke@435	1690	return s;
duke@435	1691	}
duke@435	1692
duke@435	1693	// LIR_OpJavaCall
duke@435	1694	void LIR_OpJavaCall::print_instr(outputStream* out) const {
duke@435	1695	out->print("call: ");
duke@435	1696	out->print("[addr: 0x%x]", address());
duke@435	1697	if (receiver()->is_valid()) {
duke@435	1698	out->print(" [recv: "); receiver()->print(out); out->print("]");
duke@435	1699	}
duke@435	1700	if (result_opr()->is_valid()) {
duke@435	1701	out->print(" [result: "); result_opr()->print(out); out->print("]");
duke@435	1702	}
duke@435	1703	}
duke@435	1704
duke@435	1705	// LIR_OpLabel
duke@435	1706	void LIR_OpLabel::print_instr(outputStream* out) const {
duke@435	1707	out->print("[label:0x%x]", _label);
duke@435	1708	}
duke@435	1709
duke@435	1710	// LIR_OpArrayCopy
duke@435	1711	void LIR_OpArrayCopy::print_instr(outputStream* out) const {
duke@435	1712	src()->print(out); out->print(" ");
duke@435	1713	src_pos()->print(out); out->print(" ");
duke@435	1714	dst()->print(out); out->print(" ");
duke@435	1715	dst_pos()->print(out); out->print(" ");
duke@435	1716	length()->print(out); out->print(" ");
duke@435	1717	tmp()->print(out); out->print(" ");
duke@435	1718	}
duke@435	1719
duke@435	1720	// LIR_OpCompareAndSwap
duke@435	1721	void LIR_OpCompareAndSwap::print_instr(outputStream* out) const {
duke@435	1722	addr()->print(out); out->print(" ");
duke@435	1723	cmp_value()->print(out); out->print(" ");
duke@435	1724	new_value()->print(out); out->print(" ");
duke@435	1725	tmp1()->print(out); out->print(" ");
duke@435	1726	tmp2()->print(out); out->print(" ");
duke@435	1727
duke@435	1728	}
duke@435	1729
duke@435	1730	// LIR_Op0
duke@435	1731	void LIR_Op0::print_instr(outputStream* out) const {
duke@435	1732	result_opr()->print(out);
duke@435	1733	}
duke@435	1734
duke@435	1735	// LIR_Op1
duke@435	1736	const char * LIR_Op1::name() const {
duke@435	1737	if (code() == lir_move) {
duke@435	1738	switch (move_kind()) {
duke@435	1739	case lir_move_normal:
duke@435	1740	return "move";
duke@435	1741	case lir_move_unaligned:
duke@435	1742	return "unaligned move";
duke@435	1743	case lir_move_volatile:
duke@435	1744	return "volatile_move";
duke@435	1745	default:
duke@435	1746	ShouldNotReachHere();
duke@435	1747	return "illegal_op";
duke@435	1748	}
duke@435	1749	} else {
duke@435	1750	return LIR_Op::name();
duke@435	1751	}
duke@435	1752	}
duke@435	1753
duke@435	1754
duke@435	1755	void LIR_Op1::print_instr(outputStream* out) const {
duke@435	1756	_opr->print(out); out->print(" ");
duke@435	1757	result_opr()->print(out); out->print(" ");
duke@435	1758	print_patch_code(out, patch_code());
duke@435	1759	}
duke@435	1760
duke@435	1761
duke@435	1762	// LIR_Op1
duke@435	1763	void LIR_OpRTCall::print_instr(outputStream* out) const {
duke@435	1764	intx a = (intx)addr();
duke@435	1765	out->print(Runtime1::name_for_address(addr()));
duke@435	1766	out->print(" ");
duke@435	1767	tmp()->print(out);
duke@435	1768	}
duke@435	1769
duke@435	1770	void LIR_Op1::print_patch_code(outputStream* out, LIR_PatchCode code) {
duke@435	1771	switch(code) {
duke@435	1772	case lir_patch_none: break;
duke@435	1773	case lir_patch_low: out->print("[patch_low]"); break;
duke@435	1774	case lir_patch_high: out->print("[patch_high]"); break;
duke@435	1775	case lir_patch_normal: out->print("[patch_normal]"); break;
duke@435	1776	default: ShouldNotReachHere();
duke@435	1777	}
duke@435	1778	}
duke@435	1779
duke@435	1780	// LIR_OpBranch
duke@435	1781	void LIR_OpBranch::print_instr(outputStream* out) const {
duke@435	1782	print_condition(out, cond()); out->print(" ");
duke@435	1783	if (block() != NULL) {
duke@435	1784	out->print("[B%d] ", block()->block_id());
duke@435	1785	} else if (stub() != NULL) {
duke@435	1786	out->print("[");
duke@435	1787	stub()->print_name(out);
duke@435	1788	out->print(": 0x%x]", stub());
roland@2174	1789	if (stub()->info() != NULL) out->print(" [bci:%d]", stub()->info()->stack()->bci());
duke@435	1790	} else {
duke@435	1791	out->print("[label:0x%x] ", label());
duke@435	1792	}
duke@435	1793	if (ublock() != NULL) {
duke@435	1794	out->print("unordered: [B%d] ", ublock()->block_id());
duke@435	1795	}
duke@435	1796	}
duke@435	1797
duke@435	1798	void LIR_Op::print_condition(outputStream* out, LIR_Condition cond) {
duke@435	1799	switch(cond) {
duke@435	1800	case lir_cond_equal: out->print("[EQ]"); break;
duke@435	1801	case lir_cond_notEqual: out->print("[NE]"); break;
duke@435	1802	case lir_cond_less: out->print("[LT]"); break;
duke@435	1803	case lir_cond_lessEqual: out->print("[LE]"); break;
duke@435	1804	case lir_cond_greaterEqual: out->print("[GE]"); break;
duke@435	1805	case lir_cond_greater: out->print("[GT]"); break;
duke@435	1806	case lir_cond_belowEqual: out->print("[BE]"); break;
duke@435	1807	case lir_cond_aboveEqual: out->print("[AE]"); break;
duke@435	1808	case lir_cond_always: out->print("[AL]"); break;
duke@435	1809	default: out->print("[%d]",cond); break;
duke@435	1810	}
duke@435	1811	}
duke@435	1812
duke@435	1813	// LIR_OpConvert
duke@435	1814	void LIR_OpConvert::print_instr(outputStream* out) const {
duke@435	1815	print_bytecode(out, bytecode());
duke@435	1816	in_opr()->print(out); out->print(" ");
duke@435	1817	result_opr()->print(out); out->print(" ");
bobv@2036	1818	#ifdef PPC
bobv@2036	1819	if(tmp1()->is_valid()) {
bobv@2036	1820	tmp1()->print(out); out->print(" ");
bobv@2036	1821	tmp2()->print(out); out->print(" ");
bobv@2036	1822	}
bobv@2036	1823	#endif
duke@435	1824	}
duke@435	1825
duke@435	1826	void LIR_OpConvert::print_bytecode(outputStream* out, Bytecodes::Code code) {
duke@435	1827	switch(code) {
duke@435	1828	case Bytecodes::_d2f: out->print("[d2f] "); break;
duke@435	1829	case Bytecodes::_d2i: out->print("[d2i] "); break;
duke@435	1830	case Bytecodes::_d2l: out->print("[d2l] "); break;
duke@435	1831	case Bytecodes::_f2d: out->print("[f2d] "); break;
duke@435	1832	case Bytecodes::_f2i: out->print("[f2i] "); break;
duke@435	1833	case Bytecodes::_f2l: out->print("[f2l] "); break;
duke@435	1834	case Bytecodes::_i2b: out->print("[i2b] "); break;
duke@435	1835	case Bytecodes::_i2c: out->print("[i2c] "); break;
duke@435	1836	case Bytecodes::_i2d: out->print("[i2d] "); break;
duke@435	1837	case Bytecodes::_i2f: out->print("[i2f] "); break;
duke@435	1838	case Bytecodes::_i2l: out->print("[i2l] "); break;
duke@435	1839	case Bytecodes::_i2s: out->print("[i2s] "); break;
duke@435	1840	case Bytecodes::_l2i: out->print("[l2i] "); break;
duke@435	1841	case Bytecodes::_l2f: out->print("[l2f] "); break;
duke@435	1842	case Bytecodes::_l2d: out->print("[l2d] "); break;
duke@435	1843	default:
duke@435	1844	out->print("[?%d]",code);
duke@435	1845	break;
duke@435	1846	}
duke@435	1847	}
duke@435	1848
duke@435	1849	void LIR_OpAllocObj::print_instr(outputStream* out) const {
duke@435	1850	klass()->print(out); out->print(" ");
duke@435	1851	obj()->print(out); out->print(" ");
duke@435	1852	tmp1()->print(out); out->print(" ");
duke@435	1853	tmp2()->print(out); out->print(" ");
duke@435	1854	tmp3()->print(out); out->print(" ");
duke@435	1855	tmp4()->print(out); out->print(" ");
duke@435	1856	out->print("[hdr:%d]", header_size()); out->print(" ");
duke@435	1857	out->print("[obj:%d]", object_size()); out->print(" ");
duke@435	1858	out->print("[lbl:0x%x]", stub()->entry());
duke@435	1859	}
duke@435	1860
duke@435	1861	void LIR_OpRoundFP::print_instr(outputStream* out) const {
duke@435	1862	_opr->print(out); out->print(" ");
duke@435	1863	tmp()->print(out); out->print(" ");
duke@435	1864	result_opr()->print(out); out->print(" ");
duke@435	1865	}
duke@435	1866
duke@435	1867	// LIR_Op2
duke@435	1868	void LIR_Op2::print_instr(outputStream* out) const {
duke@435	1869	if (code() == lir_cmove) {
duke@435	1870	print_condition(out, condition()); out->print(" ");
duke@435	1871	}
duke@435	1872	in_opr1()->print(out); out->print(" ");
duke@435	1873	in_opr2()->print(out); out->print(" ");
duke@435	1874	if (tmp_opr()->is_valid()) { tmp_opr()->print(out); out->print(" "); }
duke@435	1875	result_opr()->print(out);
duke@435	1876	}
duke@435	1877
duke@435	1878	void LIR_OpAllocArray::print_instr(outputStream* out) const {
duke@435	1879	klass()->print(out); out->print(" ");
duke@435	1880	len()->print(out); out->print(" ");
duke@435	1881	obj()->print(out); out->print(" ");
duke@435	1882	tmp1()->print(out); out->print(" ");
duke@435	1883	tmp2()->print(out); out->print(" ");
duke@435	1884	tmp3()->print(out); out->print(" ");
duke@435	1885	tmp4()->print(out); out->print(" ");
duke@435	1886	out->print("[type:0x%x]", type()); out->print(" ");
duke@435	1887	out->print("[label:0x%x]", stub()->entry());
duke@435	1888	}
duke@435	1889
duke@435	1890
duke@435	1891	void LIR_OpTypeCheck::print_instr(outputStream* out) const {
duke@435	1892	object()->print(out); out->print(" ");
duke@435	1893	if (code() == lir_store_check) {
duke@435	1894	array()->print(out); out->print(" ");
duke@435	1895	}
duke@435	1896	if (code() != lir_store_check) {
duke@435	1897	klass()->print_name_on(out); out->print(" ");
duke@435	1898	if (fast_check()) out->print("fast_check ");
duke@435	1899	}
duke@435	1900	tmp1()->print(out); out->print(" ");
duke@435	1901	tmp2()->print(out); out->print(" ");
duke@435	1902	tmp3()->print(out); out->print(" ");
duke@435	1903	result_opr()->print(out); out->print(" ");
roland@2174	1904	if (info_for_exception() != NULL) out->print(" [bci:%d]", info_for_exception()->stack()->bci());
duke@435	1905	}
duke@435	1906
duke@435	1907
duke@435	1908	// LIR_Op3
duke@435	1909	void LIR_Op3::print_instr(outputStream* out) const {
duke@435	1910	in_opr1()->print(out); out->print(" ");
duke@435	1911	in_opr2()->print(out); out->print(" ");
duke@435	1912	in_opr3()->print(out); out->print(" ");
duke@435	1913	result_opr()->print(out);
duke@435	1914	}
duke@435	1915
duke@435	1916
duke@435	1917	void LIR_OpLock::print_instr(outputStream* out) const {
duke@435	1918	hdr_opr()->print(out); out->print(" ");
duke@435	1919	obj_opr()->print(out); out->print(" ");
duke@435	1920	lock_opr()->print(out); out->print(" ");
duke@435	1921	if (_scratch->is_valid()) {
duke@435	1922	_scratch->print(out); out->print(" ");
duke@435	1923	}
duke@435	1924	out->print("[lbl:0x%x]", stub()->entry());
duke@435	1925	}
duke@435	1926
duke@435	1927
duke@435	1928	void LIR_OpDelay::print_instr(outputStream* out) const {
duke@435	1929	_op->print_on(out);
duke@435	1930	}
duke@435	1931
duke@435	1932
duke@435	1933	// LIR_OpProfileCall
duke@435	1934	void LIR_OpProfileCall::print_instr(outputStream* out) const {
duke@435	1935	profiled_method()->name()->print_symbol_on(out);
duke@435	1936	out->print(".");
duke@435	1937	profiled_method()->holder()->name()->print_symbol_on(out);
duke@435	1938	out->print(" @ %d ", profiled_bci());
duke@435	1939	mdo()->print(out); out->print(" ");
duke@435	1940	recv()->print(out); out->print(" ");
duke@435	1941	tmp1()->print(out); out->print(" ");
duke@435	1942	}
duke@435	1943
duke@435	1944	#endif // PRODUCT
duke@435	1945
duke@435	1946	// Implementation of LIR_InsertionBuffer
duke@435	1947
duke@435	1948	void LIR_InsertionBuffer::append(int index, LIR_Op* op) {
duke@435	1949	assert(_index_and_count.length() % 2 == 0, "must have a count for each index");
duke@435	1950
duke@435	1951	int i = number_of_insertion_points() - 1;
duke@435	1952	if (i < 0 || index_at(i) < index) {
duke@435	1953	append_new(index, 1);
duke@435	1954	} else {
duke@435	1955	assert(index_at(i) == index, "can append LIR_Ops in ascending order only");
duke@435	1956	assert(count_at(i) > 0, "check");
duke@435	1957	set_count_at(i, count_at(i) + 1);
duke@435	1958	}
duke@435	1959	_ops.push(op);
duke@435	1960
duke@435	1961	DEBUG_ONLY(verify());
duke@435	1962	}
duke@435	1963
duke@435	1964	#ifdef ASSERT
duke@435	1965	void LIR_InsertionBuffer::verify() {
duke@435	1966	int sum = 0;
duke@435	1967	int prev_idx = -1;
duke@435	1968
duke@435	1969	for (int i = 0; i < number_of_insertion_points(); i++) {
duke@435	1970	assert(prev_idx < index_at(i), "index must be ordered ascending");
duke@435	1971	sum += count_at(i);
duke@435	1972	}
duke@435	1973	assert(sum == number_of_ops(), "wrong total sum");
duke@435	1974	}
duke@435	1975	#endif