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

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

src/share/vm/c1/c1_LIR.cpp

Fri, 05 Mar 2010 13:58:34 +0100

author

roland

date

Fri, 05 Mar 2010 13:58:34 +0100

changeset 1732

c466efa608d5

parent 1730

3cf667df43ef

child 1736

fc2c71045ada

permissions

-rw-r--r--

6932496: c1: deoptimization of jsr subroutine fails on sparcv9
Summary: store jsr ret bci as intptr constant in c1 debug info
Reviewed-by: never

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