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

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

src/share/vm/c1/c1_LIR.cpp

Fri, 27 Feb 2015 11:41:42 +0300

author

fzhinkin

date

Fri, 27 Feb 2015 11:41:42 +0300

changeset 9775

9b865b281711

parent 8735

dcaab7b518c4

child 9806

758c07667682

permissions

-rw-r--r--

8073154: NULL-pointer dereferencing in LIR_OpProfileType::print_instr
Reviewed-by: iveresov

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