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

src/cpu/x86/vm/templateTable_x86_64.cpp@76c1d7d13ec5 (annotated)

src/cpu/x86/vm/templateTable_x86_64.cpp

Thu, 18 Mar 2010 09:56:51 +0100

author

twisti

date

Thu, 18 Mar 2010 09:56:51 +0100

changeset 1739

76c1d7d13ec5

parent 1683

455df1b81409

child 1861

2338d41fbd81

permissions

-rw-r--r--

6932091: JSR 292 x86 code cleanup
Summary: Some code cleanups found during the JSR 292 SPARC port.
Reviewed-by: kvn, never

duke@435	1	/*
twisti@1739	2	* Copyright 2003-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/_templateTable_x86_64.cpp.incl"
duke@435	27
never@739	28	#ifndef CC_INTERP
never@739	29
duke@435	30	#define __ _masm->
duke@435	31
duke@435	32	// Platform-dependent initialization
duke@435	33
duke@435	34	void TemplateTable::pd_initialize() {
duke@435	35	// No amd64 specific initialization
duke@435	36	}
duke@435	37
duke@435	38	// Address computation: local variables
duke@435	39
duke@435	40	static inline Address iaddress(int n) {
duke@435	41	return Address(r14, Interpreter::local_offset_in_bytes(n));
duke@435	42	}
duke@435	43
duke@435	44	static inline Address laddress(int n) {
duke@435	45	return iaddress(n + 1);
duke@435	46	}
duke@435	47
duke@435	48	static inline Address faddress(int n) {
duke@435	49	return iaddress(n);
duke@435	50	}
duke@435	51
duke@435	52	static inline Address daddress(int n) {
duke@435	53	return laddress(n);
duke@435	54	}
duke@435	55
duke@435	56	static inline Address aaddress(int n) {
duke@435	57	return iaddress(n);
duke@435	58	}
duke@435	59
duke@435	60	static inline Address iaddress(Register r) {
duke@435	61	return Address(r14, r, Address::times_8, Interpreter::value_offset_in_bytes());
duke@435	62	}
duke@435	63
duke@435	64	static inline Address laddress(Register r) {
duke@435	65	return Address(r14, r, Address::times_8, Interpreter::local_offset_in_bytes(1));
duke@435	66	}
duke@435	67
duke@435	68	static inline Address faddress(Register r) {
duke@435	69	return iaddress(r);
duke@435	70	}
duke@435	71
duke@435	72	static inline Address daddress(Register r) {
duke@435	73	return laddress(r);
duke@435	74	}
duke@435	75
duke@435	76	static inline Address aaddress(Register r) {
duke@435	77	return iaddress(r);
duke@435	78	}
duke@435	79
duke@435	80	static inline Address at_rsp() {
duke@435	81	return Address(rsp, 0);
duke@435	82	}
duke@435	83
duke@435	84	// At top of Java expression stack which may be different than esp(). It
duke@435	85	// isn't for category 1 objects.
duke@435	86	static inline Address at_tos () {
duke@435	87	return Address(rsp, Interpreter::expr_offset_in_bytes(0));
duke@435	88	}
duke@435	89
duke@435	90	static inline Address at_tos_p1() {
duke@435	91	return Address(rsp, Interpreter::expr_offset_in_bytes(1));
duke@435	92	}
duke@435	93
duke@435	94	static inline Address at_tos_p2() {
duke@435	95	return Address(rsp, Interpreter::expr_offset_in_bytes(2));
duke@435	96	}
duke@435	97
duke@435	98	static inline Address at_tos_p3() {
duke@435	99	return Address(rsp, Interpreter::expr_offset_in_bytes(3));
duke@435	100	}
duke@435	101
duke@435	102	// Condition conversion
duke@435	103	static Assembler::Condition j_not(TemplateTable::Condition cc) {
duke@435	104	switch (cc) {
duke@435	105	case TemplateTable::equal : return Assembler::notEqual;
duke@435	106	case TemplateTable::not_equal : return Assembler::equal;
duke@435	107	case TemplateTable::less : return Assembler::greaterEqual;
duke@435	108	case TemplateTable::less_equal : return Assembler::greater;
duke@435	109	case TemplateTable::greater : return Assembler::lessEqual;
duke@435	110	case TemplateTable::greater_equal: return Assembler::less;
duke@435	111	}
duke@435	112	ShouldNotReachHere();
duke@435	113	return Assembler::zero;
duke@435	114	}
duke@435	115
duke@435	116
duke@435	117	// Miscelaneous helper routines
ysr@777	118	// Store an oop (or NULL) at the address described by obj.
ysr@777	119	// If val == noreg this means store a NULL
ysr@777	120
ysr@777	121	static void do_oop_store(InterpreterMacroAssembler* _masm,
ysr@777	122	Address obj,
ysr@777	123	Register val,
ysr@777	124	BarrierSet::Name barrier,
ysr@777	125	bool precise) {
ysr@777	126	assert(val == noreg || val == rax, "parameter is just for looks");
ysr@777	127	switch (barrier) {
ysr@777	128	#ifndef SERIALGC
ysr@777	129	case BarrierSet::G1SATBCT:
ysr@777	130	case BarrierSet::G1SATBCTLogging:
ysr@777	131	{
ysr@777	132	// flatten object address if needed
ysr@777	133	if (obj.index() == noreg && obj.disp() == 0) {
ysr@777	134	if (obj.base() != rdx) {
ysr@777	135	__ movq(rdx, obj.base());
ysr@777	136	}
ysr@777	137	} else {
ysr@777	138	__ leaq(rdx, obj);
ysr@777	139	}
ysr@777	140	__ g1_write_barrier_pre(rdx, r8, rbx, val != noreg);
ysr@777	141	if (val == noreg) {
johnc@1482	142	__ store_heap_oop_null(Address(rdx, 0));
ysr@777	143	} else {
ysr@777	144	__ store_heap_oop(Address(rdx, 0), val);
ysr@777	145	__ g1_write_barrier_post(rdx, val, r8, rbx);
ysr@777	146	}
ysr@777	147
ysr@777	148	}
ysr@777	149	break;
ysr@777	150	#endif // SERIALGC
ysr@777	151	case BarrierSet::CardTableModRef:
ysr@777	152	case BarrierSet::CardTableExtension:
ysr@777	153	{
ysr@777	154	if (val == noreg) {
johnc@1482	155	__ store_heap_oop_null(obj);
ysr@777	156	} else {
ysr@777	157	__ store_heap_oop(obj, val);
ysr@777	158	// flatten object address if needed
ysr@777	159	if (!precise || (obj.index() == noreg && obj.disp() == 0)) {
ysr@777	160	__ store_check(obj.base());
ysr@777	161	} else {
ysr@777	162	__ leaq(rdx, obj);
ysr@777	163	__ store_check(rdx);
ysr@777	164	}
ysr@777	165	}
ysr@777	166	}
ysr@777	167	break;
ysr@777	168	case BarrierSet::ModRef:
ysr@777	169	case BarrierSet::Other:
ysr@777	170	if (val == noreg) {
johnc@1482	171	__ store_heap_oop_null(obj);
ysr@777	172	} else {
ysr@777	173	__ store_heap_oop(obj, val);
ysr@777	174	}
ysr@777	175	break;
ysr@777	176	default :
ysr@777	177	ShouldNotReachHere();
ysr@777	178
ysr@777	179	}
ysr@777	180	}
duke@435	181
duke@435	182	Address TemplateTable::at_bcp(int offset) {
duke@435	183	assert(_desc->uses_bcp(), "inconsistent uses_bcp information");
duke@435	184	return Address(r13, offset);
duke@435	185	}
duke@435	186
duke@435	187	void TemplateTable::patch_bytecode(Bytecodes::Code bytecode, Register bc,
duke@435	188	Register scratch,
duke@435	189	bool load_bc_into_scratch/*=true*/) {
duke@435	190	if (!RewriteBytecodes) {
duke@435	191	return;
duke@435	192	}
duke@435	193	// the pair bytecodes have already done the load.
duke@435	194	if (load_bc_into_scratch) {
duke@435	195	__ movl(bc, bytecode);
duke@435	196	}
duke@435	197	Label patch_done;
duke@435	198	if (JvmtiExport::can_post_breakpoint()) {
duke@435	199	Label fast_patch;
duke@435	200	// if a breakpoint is present we can't rewrite the stream directly
duke@435	201	__ movzbl(scratch, at_bcp(0));
duke@435	202	__ cmpl(scratch, Bytecodes::_breakpoint);
duke@435	203	__ jcc(Assembler::notEqual, fast_patch);
duke@435	204	__ get_method(scratch);
duke@435	205	// Let breakpoint table handling rewrite to quicker bytecode
twisti@1543	206	__ call_VM(noreg, CAST_FROM_FN_PTR(address, InterpreterRuntime::set_original_bytecode_at), scratch, r13, bc);
duke@435	207	#ifndef ASSERT
duke@435	208	__ jmpb(patch_done);
twisti@1543	209	#else
twisti@1543	210	__ jmp(patch_done);
twisti@1543	211	#endif
duke@435	212	__ bind(fast_patch);
duke@435	213	}
twisti@1543	214	#ifdef ASSERT
duke@435	215	Label okay;
duke@435	216	__ load_unsigned_byte(scratch, at_bcp(0));
duke@435	217	__ cmpl(scratch, (int) Bytecodes::java_code(bytecode));
duke@435	218	__ jcc(Assembler::equal, okay);
duke@435	219	__ cmpl(scratch, bc);
duke@435	220	__ jcc(Assembler::equal, okay);
duke@435	221	__ stop("patching the wrong bytecode");
duke@435	222	__ bind(okay);
duke@435	223	#endif
duke@435	224	// patch bytecode
duke@435	225	__ movb(at_bcp(0), bc);
duke@435	226	__ bind(patch_done);
duke@435	227	}
duke@435	228
duke@435	229
duke@435	230	// Individual instructions
duke@435	231
duke@435	232	void TemplateTable::nop() {
duke@435	233	transition(vtos, vtos);
duke@435	234	// nothing to do
duke@435	235	}
duke@435	236
duke@435	237	void TemplateTable::shouldnotreachhere() {
duke@435	238	transition(vtos, vtos);
duke@435	239	__ stop("shouldnotreachhere bytecode");
duke@435	240	}
duke@435	241
duke@435	242	void TemplateTable::aconst_null() {
duke@435	243	transition(vtos, atos);
duke@435	244	__ xorl(rax, rax);
duke@435	245	}
duke@435	246
duke@435	247	void TemplateTable::iconst(int value) {
duke@435	248	transition(vtos, itos);
duke@435	249	if (value == 0) {
duke@435	250	__ xorl(rax, rax);
duke@435	251	} else {
duke@435	252	__ movl(rax, value);
duke@435	253	}
duke@435	254	}
duke@435	255
duke@435	256	void TemplateTable::lconst(int value) {
duke@435	257	transition(vtos, ltos);
duke@435	258	if (value == 0) {
duke@435	259	__ xorl(rax, rax);
duke@435	260	} else {
duke@435	261	__ movl(rax, value);
duke@435	262	}
duke@435	263	}
duke@435	264
duke@435	265	void TemplateTable::fconst(int value) {
duke@435	266	transition(vtos, ftos);
duke@435	267	static float one = 1.0f, two = 2.0f;
duke@435	268	switch (value) {
duke@435	269	case 0:
duke@435	270	__ xorps(xmm0, xmm0);
duke@435	271	break;
duke@435	272	case 1:
duke@435	273	__ movflt(xmm0, ExternalAddress((address) &one));
duke@435	274	break;
duke@435	275	case 2:
duke@435	276	__ movflt(xmm0, ExternalAddress((address) &two));
duke@435	277	break;
duke@435	278	default:
duke@435	279	ShouldNotReachHere();
duke@435	280	break;
duke@435	281	}
duke@435	282	}
duke@435	283
duke@435	284	void TemplateTable::dconst(int value) {
duke@435	285	transition(vtos, dtos);
duke@435	286	static double one = 1.0;
duke@435	287	switch (value) {
duke@435	288	case 0:
duke@435	289	__ xorpd(xmm0, xmm0);
duke@435	290	break;
duke@435	291	case 1:
duke@435	292	__ movdbl(xmm0, ExternalAddress((address) &one));
duke@435	293	break;
duke@435	294	default:
duke@435	295	ShouldNotReachHere();
duke@435	296	break;
duke@435	297	}
duke@435	298	}
duke@435	299
duke@435	300	void TemplateTable::bipush() {
duke@435	301	transition(vtos, itos);
duke@435	302	__ load_signed_byte(rax, at_bcp(1));
duke@435	303	}
duke@435	304
duke@435	305	void TemplateTable::sipush() {
duke@435	306	transition(vtos, itos);
jrose@1057	307	__ load_unsigned_short(rax, at_bcp(1));
duke@435	308	__ bswapl(rax);
duke@435	309	__ sarl(rax, 16);
duke@435	310	}
duke@435	311
duke@435	312	void TemplateTable::ldc(bool wide) {
duke@435	313	transition(vtos, vtos);
duke@435	314	Label call_ldc, notFloat, notClass, Done;
duke@435	315
duke@435	316	if (wide) {
duke@435	317	__ get_unsigned_2_byte_index_at_bcp(rbx, 1);
duke@435	318	} else {
duke@435	319	__ load_unsigned_byte(rbx, at_bcp(1));
duke@435	320	}
duke@435	321
duke@435	322	__ get_cpool_and_tags(rcx, rax);
duke@435	323	const int base_offset = constantPoolOopDesc::header_size() * wordSize;
duke@435	324	const int tags_offset = typeArrayOopDesc::header_size(T_BYTE) * wordSize;
duke@435	325
duke@435	326	// get type
duke@435	327	__ movzbl(rdx, Address(rax, rbx, Address::times_1, tags_offset));
duke@435	328
duke@435	329	// unresolved string - get the resolved string
duke@435	330	__ cmpl(rdx, JVM_CONSTANT_UnresolvedString);
duke@435	331	__ jccb(Assembler::equal, call_ldc);
duke@435	332
duke@435	333	// unresolved class - get the resolved class
duke@435	334	__ cmpl(rdx, JVM_CONSTANT_UnresolvedClass);
duke@435	335	__ jccb(Assembler::equal, call_ldc);
duke@435	336
duke@435	337	// unresolved class in error state - call into runtime to throw the error
duke@435	338	// from the first resolution attempt
duke@435	339	__ cmpl(rdx, JVM_CONSTANT_UnresolvedClassInError);
duke@435	340	__ jccb(Assembler::equal, call_ldc);
duke@435	341
duke@435	342	// resolved class - need to call vm to get java mirror of the class
duke@435	343	__ cmpl(rdx, JVM_CONSTANT_Class);
duke@435	344	__ jcc(Assembler::notEqual, notClass);
duke@435	345
duke@435	346	__ bind(call_ldc);
duke@435	347	__ movl(c_rarg1, wide);
duke@435	348	call_VM(rax, CAST_FROM_FN_PTR(address, InterpreterRuntime::ldc), c_rarg1);
duke@435	349	__ push_ptr(rax);
duke@435	350	__ verify_oop(rax);
duke@435	351	__ jmp(Done);
duke@435	352
duke@435	353	__ bind(notClass);
duke@435	354	__ cmpl(rdx, JVM_CONSTANT_Float);
duke@435	355	__ jccb(Assembler::notEqual, notFloat);
duke@435	356	// ftos
duke@435	357	__ movflt(xmm0, Address(rcx, rbx, Address::times_8, base_offset));
duke@435	358	__ push_f();
duke@435	359	__ jmp(Done);
duke@435	360
duke@435	361	__ bind(notFloat);
duke@435	362	#ifdef ASSERT
duke@435	363	{
duke@435	364	Label L;
duke@435	365	__ cmpl(rdx, JVM_CONSTANT_Integer);
duke@435	366	__ jcc(Assembler::equal, L);
duke@435	367	__ cmpl(rdx, JVM_CONSTANT_String);
duke@435	368	__ jcc(Assembler::equal, L);
duke@435	369	__ stop("unexpected tag type in ldc");
duke@435	370	__ bind(L);
duke@435	371	}
duke@435	372	#endif
duke@435	373	// atos and itos
duke@435	374	Label isOop;
duke@435	375	__ cmpl(rdx, JVM_CONSTANT_Integer);
duke@435	376	__ jcc(Assembler::notEqual, isOop);
duke@435	377	__ movl(rax, Address(rcx, rbx, Address::times_8, base_offset));
duke@435	378	__ push_i(rax);
duke@435	379	__ jmp(Done);
duke@435	380
duke@435	381	__ bind(isOop);
never@739	382	__ movptr(rax, Address(rcx, rbx, Address::times_8, base_offset));
duke@435	383	__ push_ptr(rax);
duke@435	384
duke@435	385	if (VerifyOops) {
duke@435	386	__ verify_oop(rax);
duke@435	387	}
duke@435	388
duke@435	389	__ bind(Done);
duke@435	390	}
duke@435	391
duke@435	392	void TemplateTable::ldc2_w() {
duke@435	393	transition(vtos, vtos);
duke@435	394	Label Long, Done;
duke@435	395	__ get_unsigned_2_byte_index_at_bcp(rbx, 1);
duke@435	396
duke@435	397	__ get_cpool_and_tags(rcx, rax);
duke@435	398	const int base_offset = constantPoolOopDesc::header_size() * wordSize;
duke@435	399	const int tags_offset = typeArrayOopDesc::header_size(T_BYTE) * wordSize;
duke@435	400
duke@435	401	// get type
duke@435	402	__ cmpb(Address(rax, rbx, Address::times_1, tags_offset),
duke@435	403	JVM_CONSTANT_Double);
duke@435	404	__ jccb(Assembler::notEqual, Long);
duke@435	405	// dtos
duke@435	406	__ movdbl(xmm0, Address(rcx, rbx, Address::times_8, base_offset));
duke@435	407	__ push_d();
duke@435	408	__ jmpb(Done);
duke@435	409
duke@435	410	__ bind(Long);
duke@435	411	// ltos
duke@435	412	__ movq(rax, Address(rcx, rbx, Address::times_8, base_offset));
duke@435	413	__ push_l();
duke@435	414
duke@435	415	__ bind(Done);
duke@435	416	}
duke@435	417
duke@435	418	void TemplateTable::locals_index(Register reg, int offset) {
duke@435	419	__ load_unsigned_byte(reg, at_bcp(offset));
never@739	420	__ negptr(reg);
never@739	421	if (TaggedStackInterpreter) __ shlptr(reg, 1); // index = index*2
duke@435	422	}
duke@435	423
duke@435	424	void TemplateTable::iload() {
duke@435	425	transition(vtos, itos);
duke@435	426	if (RewriteFrequentPairs) {
duke@435	427	Label rewrite, done;
duke@435	428	const Register bc = c_rarg3;
duke@435	429	assert(rbx != bc, "register damaged");
duke@435	430
duke@435	431	// get next byte
duke@435	432	__ load_unsigned_byte(rbx,
duke@435	433	at_bcp(Bytecodes::length_for(Bytecodes::_iload)));
duke@435	434	// if _iload, wait to rewrite to iload2. We only want to rewrite the
duke@435	435	// last two iloads in a pair. Comparing against fast_iload means that
duke@435	436	// the next bytecode is neither an iload or a caload, and therefore
duke@435	437	// an iload pair.
duke@435	438	__ cmpl(rbx, Bytecodes::_iload);
duke@435	439	__ jcc(Assembler::equal, done);
duke@435	440
duke@435	441	__ cmpl(rbx, Bytecodes::_fast_iload);
duke@435	442	__ movl(bc, Bytecodes::_fast_iload2);
duke@435	443	__ jccb(Assembler::equal, rewrite);
duke@435	444
duke@435	445	// if _caload, rewrite to fast_icaload
duke@435	446	__ cmpl(rbx, Bytecodes::_caload);
duke@435	447	__ movl(bc, Bytecodes::_fast_icaload);
duke@435	448	__ jccb(Assembler::equal, rewrite);
duke@435	449
duke@435	450	// rewrite so iload doesn't check again.
duke@435	451	__ movl(bc, Bytecodes::_fast_iload);
duke@435	452
duke@435	453	// rewrite
duke@435	454	// bc: fast bytecode
duke@435	455	__ bind(rewrite);
duke@435	456	patch_bytecode(Bytecodes::_iload, bc, rbx, false);
duke@435	457	__ bind(done);
duke@435	458	}
duke@435	459
duke@435	460	// Get the local value into tos
duke@435	461	locals_index(rbx);
duke@435	462	__ movl(rax, iaddress(rbx));
duke@435	463	debug_only(__ verify_local_tag(frame::TagValue, rbx));
duke@435	464	}
duke@435	465
duke@435	466	void TemplateTable::fast_iload2() {
duke@435	467	transition(vtos, itos);
duke@435	468	locals_index(rbx);
duke@435	469	__ movl(rax, iaddress(rbx));
duke@435	470	debug_only(__ verify_local_tag(frame::TagValue, rbx));
duke@435	471	__ push(itos);
duke@435	472	locals_index(rbx, 3);
duke@435	473	__ movl(rax, iaddress(rbx));
duke@435	474	debug_only(__ verify_local_tag(frame::TagValue, rbx));
duke@435	475	}
duke@435	476
duke@435	477	void TemplateTable::fast_iload() {
duke@435	478	transition(vtos, itos);
duke@435	479	locals_index(rbx);
duke@435	480	__ movl(rax, iaddress(rbx));
duke@435	481	debug_only(__ verify_local_tag(frame::TagValue, rbx));
duke@435	482	}
duke@435	483
duke@435	484	void TemplateTable::lload() {
duke@435	485	transition(vtos, ltos);
duke@435	486	locals_index(rbx);
duke@435	487	__ movq(rax, laddress(rbx));
duke@435	488	debug_only(__ verify_local_tag(frame::TagCategory2, rbx));
duke@435	489	}
duke@435	490
duke@435	491	void TemplateTable::fload() {
duke@435	492	transition(vtos, ftos);
duke@435	493	locals_index(rbx);
duke@435	494	__ movflt(xmm0, faddress(rbx));
duke@435	495	debug_only(__ verify_local_tag(frame::TagValue, rbx));
duke@435	496	}
duke@435	497
duke@435	498	void TemplateTable::dload() {
duke@435	499	transition(vtos, dtos);
duke@435	500	locals_index(rbx);
duke@435	501	__ movdbl(xmm0, daddress(rbx));
duke@435	502	debug_only(__ verify_local_tag(frame::TagCategory2, rbx));
duke@435	503	}
duke@435	504
duke@435	505	void TemplateTable::aload() {
duke@435	506	transition(vtos, atos);
duke@435	507	locals_index(rbx);
never@739	508	__ movptr(rax, aaddress(rbx));
duke@435	509	debug_only(__ verify_local_tag(frame::TagReference, rbx));
duke@435	510	}
duke@435	511
duke@435	512	void TemplateTable::locals_index_wide(Register reg) {
duke@435	513	__ movl(reg, at_bcp(2));
duke@435	514	__ bswapl(reg);
duke@435	515	__ shrl(reg, 16);
never@739	516	__ negptr(reg);
never@739	517	if (TaggedStackInterpreter) __ shlptr(reg, 1); // index = index*2
duke@435	518	}
duke@435	519
duke@435	520	void TemplateTable::wide_iload() {
duke@435	521	transition(vtos, itos);
duke@435	522	locals_index_wide(rbx);
duke@435	523	__ movl(rax, iaddress(rbx));
duke@435	524	debug_only(__ verify_local_tag(frame::TagValue, rbx));
duke@435	525	}
duke@435	526
duke@435	527	void TemplateTable::wide_lload() {
duke@435	528	transition(vtos, ltos);
duke@435	529	locals_index_wide(rbx);
duke@435	530	__ movq(rax, laddress(rbx));
duke@435	531	debug_only(__ verify_local_tag(frame::TagCategory2, rbx));
duke@435	532	}
duke@435	533
duke@435	534	void TemplateTable::wide_fload() {
duke@435	535	transition(vtos, ftos);
duke@435	536	locals_index_wide(rbx);
duke@435	537	__ movflt(xmm0, faddress(rbx));
duke@435	538	debug_only(__ verify_local_tag(frame::TagValue, rbx));
duke@435	539	}
duke@435	540
duke@435	541	void TemplateTable::wide_dload() {
duke@435	542	transition(vtos, dtos);
duke@435	543	locals_index_wide(rbx);
duke@435	544	__ movdbl(xmm0, daddress(rbx));
duke@435	545	debug_only(__ verify_local_tag(frame::TagCategory2, rbx));
duke@435	546	}
duke@435	547
duke@435	548	void TemplateTable::wide_aload() {
duke@435	549	transition(vtos, atos);
duke@435	550	locals_index_wide(rbx);
never@739	551	__ movptr(rax, aaddress(rbx));
duke@435	552	debug_only(__ verify_local_tag(frame::TagReference, rbx));
duke@435	553	}
duke@435	554
duke@435	555	void TemplateTable::index_check(Register array, Register index) {
duke@435	556	// destroys rbx
duke@435	557	// check array
duke@435	558	__ null_check(array, arrayOopDesc::length_offset_in_bytes());
duke@435	559	// sign extend index for use by indexed load
never@739	560	__ movl2ptr(index, index);
duke@435	561	// check index
duke@435	562	__ cmpl(index, Address(array, arrayOopDesc::length_offset_in_bytes()));
duke@435	563	if (index != rbx) {
duke@435	564	// ??? convention: move aberrant index into ebx for exception message
duke@435	565	assert(rbx != array, "different registers");
duke@435	566	__ movl(rbx, index);
duke@435	567	}
duke@435	568	__ jump_cc(Assembler::aboveEqual,
duke@435	569	ExternalAddress(Interpreter::_throw_ArrayIndexOutOfBoundsException_entry));
duke@435	570	}
duke@435	571
duke@435	572	void TemplateTable::iaload() {
duke@435	573	transition(itos, itos);
duke@435	574	__ pop_ptr(rdx);
duke@435	575	// eax: index
duke@435	576	// rdx: array
duke@435	577	index_check(rdx, rax); // kills rbx
duke@435	578	__ movl(rax, Address(rdx, rax,
duke@435	579	Address::times_4,
duke@435	580	arrayOopDesc::base_offset_in_bytes(T_INT)));
duke@435	581	}
duke@435	582
duke@435	583	void TemplateTable::laload() {
duke@435	584	transition(itos, ltos);
duke@435	585	__ pop_ptr(rdx);
duke@435	586	// eax: index
duke@435	587	// rdx: array
duke@435	588	index_check(rdx, rax); // kills rbx
duke@435	589	__ movq(rax, Address(rdx, rbx,
duke@435	590	Address::times_8,
duke@435	591	arrayOopDesc::base_offset_in_bytes(T_LONG)));
duke@435	592	}
duke@435	593
duke@435	594	void TemplateTable::faload() {
duke@435	595	transition(itos, ftos);
duke@435	596	__ pop_ptr(rdx);
duke@435	597	// eax: index
duke@435	598	// rdx: array
duke@435	599	index_check(rdx, rax); // kills rbx
duke@435	600	__ movflt(xmm0, Address(rdx, rax,
duke@435	601	Address::times_4,
duke@435	602	arrayOopDesc::base_offset_in_bytes(T_FLOAT)));
duke@435	603	}
duke@435	604
duke@435	605	void TemplateTable::daload() {
duke@435	606	transition(itos, dtos);
duke@435	607	__ pop_ptr(rdx);
duke@435	608	// eax: index
duke@435	609	// rdx: array
duke@435	610	index_check(rdx, rax); // kills rbx
duke@435	611	__ movdbl(xmm0, Address(rdx, rax,
duke@435	612	Address::times_8,
duke@435	613	arrayOopDesc::base_offset_in_bytes(T_DOUBLE)));
duke@435	614	}
duke@435	615
duke@435	616	void TemplateTable::aaload() {
duke@435	617	transition(itos, atos);
duke@435	618	__ pop_ptr(rdx);
duke@435	619	// eax: index
duke@435	620	// rdx: array
duke@435	621	index_check(rdx, rax); // kills rbx
coleenp@548	622	__ load_heap_oop(rax, Address(rdx, rax,
ysr@777	623	UseCompressedOops ? Address::times_4 : Address::times_8,
ysr@777	624	arrayOopDesc::base_offset_in_bytes(T_OBJECT)));
duke@435	625	}
duke@435	626
duke@435	627	void TemplateTable::baload() {
duke@435	628	transition(itos, itos);
duke@435	629	__ pop_ptr(rdx);
duke@435	630	// eax: index
duke@435	631	// rdx: array
duke@435	632	index_check(rdx, rax); // kills rbx
duke@435	633	__ load_signed_byte(rax,
duke@435	634	Address(rdx, rax,
duke@435	635	Address::times_1,
duke@435	636	arrayOopDesc::base_offset_in_bytes(T_BYTE)));
duke@435	637	}
duke@435	638
duke@435	639	void TemplateTable::caload() {
duke@435	640	transition(itos, itos);
duke@435	641	__ pop_ptr(rdx);
duke@435	642	// eax: index
duke@435	643	// rdx: array
duke@435	644	index_check(rdx, rax); // kills rbx
jrose@1057	645	__ load_unsigned_short(rax,
jrose@1057	646	Address(rdx, rax,
jrose@1057	647	Address::times_2,
jrose@1057	648	arrayOopDesc::base_offset_in_bytes(T_CHAR)));
duke@435	649	}
duke@435	650
duke@435	651	// iload followed by caload frequent pair
duke@435	652	void TemplateTable::fast_icaload() {
duke@435	653	transition(vtos, itos);
duke@435	654	// load index out of locals
duke@435	655	locals_index(rbx);
duke@435	656	__ movl(rax, iaddress(rbx));
duke@435	657	debug_only(__ verify_local_tag(frame::TagValue, rbx));
duke@435	658
duke@435	659	// eax: index
duke@435	660	// rdx: array
duke@435	661	__ pop_ptr(rdx);
duke@435	662	index_check(rdx, rax); // kills rbx
jrose@1057	663	__ load_unsigned_short(rax,
jrose@1057	664	Address(rdx, rax,
jrose@1057	665	Address::times_2,
jrose@1057	666	arrayOopDesc::base_offset_in_bytes(T_CHAR)));
duke@435	667	}
duke@435	668
duke@435	669	void TemplateTable::saload() {
duke@435	670	transition(itos, itos);
duke@435	671	__ pop_ptr(rdx);
duke@435	672	// eax: index
duke@435	673	// rdx: array
duke@435	674	index_check(rdx, rax); // kills rbx
jrose@1057	675	__ load_signed_short(rax,
jrose@1057	676	Address(rdx, rax,
jrose@1057	677	Address::times_2,
jrose@1057	678	arrayOopDesc::base_offset_in_bytes(T_SHORT)));
duke@435	679	}
duke@435	680
duke@435	681	void TemplateTable::iload(int n) {
duke@435	682	transition(vtos, itos);
duke@435	683	__ movl(rax, iaddress(n));
duke@435	684	debug_only(__ verify_local_tag(frame::TagValue, n));
duke@435	685	}
duke@435	686
duke@435	687	void TemplateTable::lload(int n) {
duke@435	688	transition(vtos, ltos);
duke@435	689	__ movq(rax, laddress(n));
duke@435	690	debug_only(__ verify_local_tag(frame::TagCategory2, n));
duke@435	691	}
duke@435	692
duke@435	693	void TemplateTable::fload(int n) {
duke@435	694	transition(vtos, ftos);
duke@435	695	__ movflt(xmm0, faddress(n));
duke@435	696	debug_only(__ verify_local_tag(frame::TagValue, n));
duke@435	697	}
duke@435	698
duke@435	699	void TemplateTable::dload(int n) {
duke@435	700	transition(vtos, dtos);
duke@435	701	__ movdbl(xmm0, daddress(n));
duke@435	702	debug_only(__ verify_local_tag(frame::TagCategory2, n));
duke@435	703	}
duke@435	704
duke@435	705	void TemplateTable::aload(int n) {
duke@435	706	transition(vtos, atos);
never@739	707	__ movptr(rax, aaddress(n));
duke@435	708	debug_only(__ verify_local_tag(frame::TagReference, n));
duke@435	709	}
duke@435	710
duke@435	711	void TemplateTable::aload_0() {
duke@435	712	transition(vtos, atos);
duke@435	713	// According to bytecode histograms, the pairs:
duke@435	714	//
duke@435	715	// _aload_0, _fast_igetfield
duke@435	716	// _aload_0, _fast_agetfield
duke@435	717	// _aload_0, _fast_fgetfield
duke@435	718	//
duke@435	719	// occur frequently. If RewriteFrequentPairs is set, the (slow)
duke@435	720	// _aload_0 bytecode checks if the next bytecode is either
duke@435	721	// _fast_igetfield, _fast_agetfield or _fast_fgetfield and then
duke@435	722	// rewrites the current bytecode into a pair bytecode; otherwise it
duke@435	723	// rewrites the current bytecode into _fast_aload_0 that doesn't do
duke@435	724	// the pair check anymore.
duke@435	725	//
duke@435	726	// Note: If the next bytecode is _getfield, the rewrite must be
duke@435	727	// delayed, otherwise we may miss an opportunity for a pair.
duke@435	728	//
duke@435	729	// Also rewrite frequent pairs
duke@435	730	// aload_0, aload_1
duke@435	731	// aload_0, iload_1
duke@435	732	// These bytecodes with a small amount of code are most profitable
duke@435	733	// to rewrite
duke@435	734	if (RewriteFrequentPairs) {
duke@435	735	Label rewrite, done;
duke@435	736	const Register bc = c_rarg3;
duke@435	737	assert(rbx != bc, "register damaged");
duke@435	738	// get next byte
duke@435	739	__ load_unsigned_byte(rbx,
duke@435	740	at_bcp(Bytecodes::length_for(Bytecodes::_aload_0)));
duke@435	741
duke@435	742	// do actual aload_0
duke@435	743	aload(0);
duke@435	744
duke@435	745	// if _getfield then wait with rewrite
duke@435	746	__ cmpl(rbx, Bytecodes::_getfield);
duke@435	747	__ jcc(Assembler::equal, done);
duke@435	748
duke@435	749	// if _igetfield then reqrite to _fast_iaccess_0
duke@435	750	assert(Bytecodes::java_code(Bytecodes::_fast_iaccess_0) ==
duke@435	751	Bytecodes::_aload_0,
duke@435	752	"fix bytecode definition");
duke@435	753	__ cmpl(rbx, Bytecodes::_fast_igetfield);
duke@435	754	__ movl(bc, Bytecodes::_fast_iaccess_0);
duke@435	755	__ jccb(Assembler::equal, rewrite);
duke@435	756
duke@435	757	// if _agetfield then reqrite to _fast_aaccess_0
duke@435	758	assert(Bytecodes::java_code(Bytecodes::_fast_aaccess_0) ==
duke@435	759	Bytecodes::_aload_0,
duke@435	760	"fix bytecode definition");
duke@435	761	__ cmpl(rbx, Bytecodes::_fast_agetfield);
duke@435	762	__ movl(bc, Bytecodes::_fast_aaccess_0);
duke@435	763	__ jccb(Assembler::equal, rewrite);
duke@435	764
duke@435	765	// if _fgetfield then reqrite to _fast_faccess_0
duke@435	766	assert(Bytecodes::java_code(Bytecodes::_fast_faccess_0) ==
duke@435	767	Bytecodes::_aload_0,
duke@435	768	"fix bytecode definition");
duke@435	769	__ cmpl(rbx, Bytecodes::_fast_fgetfield);
duke@435	770	__ movl(bc, Bytecodes::_fast_faccess_0);
duke@435	771	__ jccb(Assembler::equal, rewrite);
duke@435	772
duke@435	773	// else rewrite to _fast_aload0
duke@435	774	assert(Bytecodes::java_code(Bytecodes::_fast_aload_0) ==
duke@435	775	Bytecodes::_aload_0,
duke@435	776	"fix bytecode definition");
duke@435	777	__ movl(bc, Bytecodes::_fast_aload_0);
duke@435	778
duke@435	779	// rewrite
duke@435	780	// bc: fast bytecode
duke@435	781	__ bind(rewrite);
duke@435	782	patch_bytecode(Bytecodes::_aload_0, bc, rbx, false);
duke@435	783
duke@435	784	__ bind(done);
duke@435	785	} else {
duke@435	786	aload(0);
duke@435	787	}
duke@435	788	}
duke@435	789
duke@435	790	void TemplateTable::istore() {
duke@435	791	transition(itos, vtos);
duke@435	792	locals_index(rbx);
duke@435	793	__ movl(iaddress(rbx), rax);
duke@435	794	__ tag_local(frame::TagValue, rbx);
duke@435	795	}
duke@435	796
duke@435	797	void TemplateTable::lstore() {
duke@435	798	transition(ltos, vtos);
duke@435	799	locals_index(rbx);
duke@435	800	__ movq(laddress(rbx), rax);
duke@435	801	__ tag_local(frame::TagCategory2, rbx);
duke@435	802	}
duke@435	803
duke@435	804	void TemplateTable::fstore() {
duke@435	805	transition(ftos, vtos);
duke@435	806	locals_index(rbx);
duke@435	807	__ movflt(faddress(rbx), xmm0);
duke@435	808	__ tag_local(frame::TagValue, rbx);
duke@435	809	}
duke@435	810
duke@435	811	void TemplateTable::dstore() {
duke@435	812	transition(dtos, vtos);
duke@435	813	locals_index(rbx);
duke@435	814	__ movdbl(daddress(rbx), xmm0);
duke@435	815	__ tag_local(frame::TagCategory2, rbx);
duke@435	816	}
duke@435	817
duke@435	818	void TemplateTable::astore() {
duke@435	819	transition(vtos, vtos);
duke@435	820	__ pop_ptr(rax, rdx); // will need to pop tag too
duke@435	821	locals_index(rbx);
never@739	822	__ movptr(aaddress(rbx), rax);
duke@435	823	__ tag_local(rdx, rbx); // store tag from stack, might be returnAddr
duke@435	824	}
duke@435	825
duke@435	826	void TemplateTable::wide_istore() {
duke@435	827	transition(vtos, vtos);
duke@435	828	__ pop_i();
duke@435	829	locals_index_wide(rbx);
duke@435	830	__ movl(iaddress(rbx), rax);
duke@435	831	__ tag_local(frame::TagValue, rbx);
duke@435	832	}
duke@435	833
duke@435	834	void TemplateTable::wide_lstore() {
duke@435	835	transition(vtos, vtos);
duke@435	836	__ pop_l();
duke@435	837	locals_index_wide(rbx);
duke@435	838	__ movq(laddress(rbx), rax);
duke@435	839	__ tag_local(frame::TagCategory2, rbx);
duke@435	840	}
duke@435	841
duke@435	842	void TemplateTable::wide_fstore() {
duke@435	843	transition(vtos, vtos);
duke@435	844	__ pop_f();
duke@435	845	locals_index_wide(rbx);
duke@435	846	__ movflt(faddress(rbx), xmm0);
duke@435	847	__ tag_local(frame::TagValue, rbx);
duke@435	848	}
duke@435	849
duke@435	850	void TemplateTable::wide_dstore() {
duke@435	851	transition(vtos, vtos);
duke@435	852	__ pop_d();
duke@435	853	locals_index_wide(rbx);
duke@435	854	__ movdbl(daddress(rbx), xmm0);
duke@435	855	__ tag_local(frame::TagCategory2, rbx);
duke@435	856	}
duke@435	857
duke@435	858	void TemplateTable::wide_astore() {
duke@435	859	transition(vtos, vtos);
duke@435	860	__ pop_ptr(rax, rdx); // will need to pop tag too
duke@435	861	locals_index_wide(rbx);
never@739	862	__ movptr(aaddress(rbx), rax);
duke@435	863	__ tag_local(rdx, rbx); // store tag from stack, might be returnAddr
duke@435	864	}
duke@435	865
duke@435	866	void TemplateTable::iastore() {
duke@435	867	transition(itos, vtos);
duke@435	868	__ pop_i(rbx);
duke@435	869	__ pop_ptr(rdx);
duke@435	870	// eax: value
duke@435	871	// ebx: index
duke@435	872	// rdx: array
duke@435	873	index_check(rdx, rbx); // prefer index in ebx
duke@435	874	__ movl(Address(rdx, rbx,
duke@435	875	Address::times_4,
duke@435	876	arrayOopDesc::base_offset_in_bytes(T_INT)),
duke@435	877	rax);
duke@435	878	}
duke@435	879
duke@435	880	void TemplateTable::lastore() {
duke@435	881	transition(ltos, vtos);
duke@435	882	__ pop_i(rbx);
duke@435	883	__ pop_ptr(rdx);
duke@435	884	// rax: value
duke@435	885	// ebx: index
duke@435	886	// rdx: array
duke@435	887	index_check(rdx, rbx); // prefer index in ebx
duke@435	888	__ movq(Address(rdx, rbx,
duke@435	889	Address::times_8,
duke@435	890	arrayOopDesc::base_offset_in_bytes(T_LONG)),
duke@435	891	rax);
duke@435	892	}
duke@435	893
duke@435	894	void TemplateTable::fastore() {
duke@435	895	transition(ftos, vtos);
duke@435	896	__ pop_i(rbx);
duke@435	897	__ pop_ptr(rdx);
duke@435	898	// xmm0: value
duke@435	899	// ebx: index
duke@435	900	// rdx: array
duke@435	901	index_check(rdx, rbx); // prefer index in ebx
duke@435	902	__ movflt(Address(rdx, rbx,
duke@435	903	Address::times_4,
duke@435	904	arrayOopDesc::base_offset_in_bytes(T_FLOAT)),
duke@435	905	xmm0);
duke@435	906	}
duke@435	907
duke@435	908	void TemplateTable::dastore() {
duke@435	909	transition(dtos, vtos);
duke@435	910	__ pop_i(rbx);
duke@435	911	__ pop_ptr(rdx);
duke@435	912	// xmm0: value
duke@435	913	// ebx: index
duke@435	914	// rdx: array
duke@435	915	index_check(rdx, rbx); // prefer index in ebx
duke@435	916	__ movdbl(Address(rdx, rbx,
duke@435	917	Address::times_8,
duke@435	918	arrayOopDesc::base_offset_in_bytes(T_DOUBLE)),
duke@435	919	xmm0);
duke@435	920	}
duke@435	921
duke@435	922	void TemplateTable::aastore() {
duke@435	923	Label is_null, ok_is_subtype, done;
duke@435	924	transition(vtos, vtos);
duke@435	925	// stack: ..., array, index, value
never@739	926	__ movptr(rax, at_tos()); // value
duke@435	927	__ movl(rcx, at_tos_p1()); // index
never@739	928	__ movptr(rdx, at_tos_p2()); // array
ysr@777	929
ysr@777	930	Address element_address(rdx, rcx,
ysr@777	931	UseCompressedOops? Address::times_4 : Address::times_8,
ysr@777	932	arrayOopDesc::base_offset_in_bytes(T_OBJECT));
ysr@777	933
duke@435	934	index_check(rdx, rcx); // kills rbx
duke@435	935	// do array store check - check for NULL value first
never@739	936	__ testptr(rax, rax);
duke@435	937	__ jcc(Assembler::zero, is_null);
duke@435	938
duke@435	939	// Move subklass into rbx
coleenp@548	940	__ load_klass(rbx, rax);
duke@435	941	// Move superklass into rax
coleenp@548	942	__ load_klass(rax, rdx);
never@739	943	__ movptr(rax, Address(rax,
never@739	944	sizeof(oopDesc) +
never@739	945	objArrayKlass::element_klass_offset_in_bytes()));
coleenp@548	946	// Compress array + index*oopSize + 12 into a single register. Frees rcx.
apetrusenko@797	947	__ lea(rdx, element_address);
duke@435	948
duke@435	949	// Generate subtype check. Blows rcx, rdi
duke@435	950	// Superklass in rax. Subklass in rbx.
duke@435	951	__ gen_subtype_check(rbx, ok_is_subtype);
duke@435	952
duke@435	953	// Come here on failure
duke@435	954	// object is at TOS
duke@435	955	__ jump(ExternalAddress(Interpreter::_throw_ArrayStoreException_entry));
duke@435	956
duke@435	957	// Come here on success
duke@435	958	__ bind(ok_is_subtype);
ysr@777	959
ysr@777	960	// Get the value we will store
apetrusenko@797	961	__ movptr(rax, at_tos());
ysr@777	962	// Now store using the appropriate barrier
ysr@777	963	do_oop_store(_masm, Address(rdx, 0), rax, _bs->kind(), true);
duke@435	964	__ jmp(done);
duke@435	965
duke@435	966	// Have a NULL in rax, rdx=array, ecx=index. Store NULL at ary[idx]
duke@435	967	__ bind(is_null);
duke@435	968	__ profile_null_seen(rbx);
ysr@777	969
ysr@777	970	// Store a NULL
ysr@777	971	do_oop_store(_masm, element_address, noreg, _bs->kind(), true);
duke@435	972
duke@435	973	// Pop stack arguments
duke@435	974	__ bind(done);
never@739	975	__ addptr(rsp, 3 * Interpreter::stackElementSize());
duke@435	976	}
duke@435	977
duke@435	978	void TemplateTable::bastore() {
duke@435	979	transition(itos, vtos);
duke@435	980	__ pop_i(rbx);
duke@435	981	__ pop_ptr(rdx);
duke@435	982	// eax: value
duke@435	983	// ebx: index
duke@435	984	// rdx: array
duke@435	985	index_check(rdx, rbx); // prefer index in ebx
duke@435	986	__ movb(Address(rdx, rbx,
duke@435	987	Address::times_1,
duke@435	988	arrayOopDesc::base_offset_in_bytes(T_BYTE)),
duke@435	989	rax);
duke@435	990	}
duke@435	991
duke@435	992	void TemplateTable::castore() {
duke@435	993	transition(itos, vtos);
duke@435	994	__ pop_i(rbx);
duke@435	995	__ pop_ptr(rdx);
duke@435	996	// eax: value
duke@435	997	// ebx: index
duke@435	998	// rdx: array
duke@435	999	index_check(rdx, rbx); // prefer index in ebx
duke@435	1000	__ movw(Address(rdx, rbx,
duke@435	1001	Address::times_2,
duke@435	1002	arrayOopDesc::base_offset_in_bytes(T_CHAR)),
duke@435	1003	rax);
duke@435	1004	}
duke@435	1005
duke@435	1006	void TemplateTable::sastore() {
duke@435	1007	castore();
duke@435	1008	}
duke@435	1009
duke@435	1010	void TemplateTable::istore(int n) {
duke@435	1011	transition(itos, vtos);
duke@435	1012	__ movl(iaddress(n), rax);
duke@435	1013	__ tag_local(frame::TagValue, n);
duke@435	1014	}
duke@435	1015
duke@435	1016	void TemplateTable::lstore(int n) {
duke@435	1017	transition(ltos, vtos);
duke@435	1018	__ movq(laddress(n), rax);
duke@435	1019	__ tag_local(frame::TagCategory2, n);
duke@435	1020	}
duke@435	1021
duke@435	1022	void TemplateTable::fstore(int n) {
duke@435	1023	transition(ftos, vtos);
duke@435	1024	__ movflt(faddress(n), xmm0);
duke@435	1025	__ tag_local(frame::TagValue, n);
duke@435	1026	}
duke@435	1027
duke@435	1028	void TemplateTable::dstore(int n) {
duke@435	1029	transition(dtos, vtos);
duke@435	1030	__ movdbl(daddress(n), xmm0);
duke@435	1031	__ tag_local(frame::TagCategory2, n);
duke@435	1032	}
duke@435	1033
duke@435	1034	void TemplateTable::astore(int n) {
duke@435	1035	transition(vtos, vtos);
duke@435	1036	__ pop_ptr(rax, rdx);
never@739	1037	__ movptr(aaddress(n), rax);
duke@435	1038	__ tag_local(rdx, n);
duke@435	1039	}
duke@435	1040
duke@435	1041	void TemplateTable::pop() {
duke@435	1042	transition(vtos, vtos);
never@739	1043	__ addptr(rsp, Interpreter::stackElementSize());
duke@435	1044	}
duke@435	1045
duke@435	1046	void TemplateTable::pop2() {
duke@435	1047	transition(vtos, vtos);
never@739	1048	__ addptr(rsp, 2 * Interpreter::stackElementSize());
duke@435	1049	}
duke@435	1050
duke@435	1051	void TemplateTable::dup() {
duke@435	1052	transition(vtos, vtos);
duke@435	1053	__ load_ptr_and_tag(0, rax, rdx);
duke@435	1054	__ push_ptr(rax, rdx);
duke@435	1055	// stack: ..., a, a
duke@435	1056	}
duke@435	1057
duke@435	1058	void TemplateTable::dup_x1() {
duke@435	1059	transition(vtos, vtos);
duke@435	1060	// stack: ..., a, b
duke@435	1061	__ load_ptr_and_tag(0, rax, rdx); // load b
duke@435	1062	__ load_ptr_and_tag(1, rcx, rbx); // load a
duke@435	1063	__ store_ptr_and_tag(1, rax, rdx); // store b
duke@435	1064	__ store_ptr_and_tag(0, rcx, rbx); // store a
duke@435	1065	__ push_ptr(rax, rdx); // push b
duke@435	1066	// stack: ..., b, a, b
duke@435	1067	}
duke@435	1068
duke@435	1069	void TemplateTable::dup_x2() {
duke@435	1070	transition(vtos, vtos);
duke@435	1071	// stack: ..., a, b, c
duke@435	1072	__ load_ptr_and_tag(0, rax, rdx); // load c
duke@435	1073	__ load_ptr_and_tag(2, rcx, rbx); // load a
duke@435	1074	__ store_ptr_and_tag(2, rax, rdx); // store c in a
duke@435	1075	__ push_ptr(rax, rdx); // push c
duke@435	1076	// stack: ..., c, b, c, c
duke@435	1077	__ load_ptr_and_tag(2, rax, rdx); // load b
duke@435	1078	__ store_ptr_and_tag(2, rcx, rbx); // store a in b
duke@435	1079	// stack: ..., c, a, c, c
duke@435	1080	__ store_ptr_and_tag(1, rax, rdx); // store b in c
duke@435	1081	// stack: ..., c, a, b, c
duke@435	1082	}
duke@435	1083
duke@435	1084	void TemplateTable::dup2() {
duke@435	1085	transition(vtos, vtos);
duke@435	1086	// stack: ..., a, b
duke@435	1087	__ load_ptr_and_tag(1, rax, rdx); // load a
duke@435	1088	__ push_ptr(rax, rdx); // push a
duke@435	1089	__ load_ptr_and_tag(1, rax, rdx); // load b
duke@435	1090	__ push_ptr(rax, rdx); // push b
duke@435	1091	// stack: ..., a, b, a, b
duke@435	1092	}
duke@435	1093
duke@435	1094	void TemplateTable::dup2_x1() {
duke@435	1095	transition(vtos, vtos);
duke@435	1096	// stack: ..., a, b, c
duke@435	1097	__ load_ptr_and_tag(0, rcx, rbx); // load c
duke@435	1098	__ load_ptr_and_tag(1, rax, rdx); // load b
duke@435	1099	__ push_ptr(rax, rdx); // push b
duke@435	1100	__ push_ptr(rcx, rbx); // push c
duke@435	1101	// stack: ..., a, b, c, b, c
duke@435	1102	__ store_ptr_and_tag(3, rcx, rbx); // store c in b
duke@435	1103	// stack: ..., a, c, c, b, c
duke@435	1104	__ load_ptr_and_tag(4, rcx, rbx); // load a
duke@435	1105	__ store_ptr_and_tag(2, rcx, rbx); // store a in 2nd c
duke@435	1106	// stack: ..., a, c, a, b, c
duke@435	1107	__ store_ptr_and_tag(4, rax, rdx); // store b in a
duke@435	1108	// stack: ..., b, c, a, b, c
duke@435	1109	}
duke@435	1110
duke@435	1111	void TemplateTable::dup2_x2() {
duke@435	1112	transition(vtos, vtos);
duke@435	1113	// stack: ..., a, b, c, d
duke@435	1114	__ load_ptr_and_tag(0, rcx, rbx); // load d
duke@435	1115	__ load_ptr_and_tag(1, rax, rdx); // load c
duke@435	1116	__ push_ptr(rax, rdx); // push c
duke@435	1117	__ push_ptr(rcx, rbx); // push d
duke@435	1118	// stack: ..., a, b, c, d, c, d
duke@435	1119	__ load_ptr_and_tag(4, rax, rdx); // load b
duke@435	1120	__ store_ptr_and_tag(2, rax, rdx); // store b in d
duke@435	1121	__ store_ptr_and_tag(4, rcx, rbx); // store d in b
duke@435	1122	// stack: ..., a, d, c, b, c, d
duke@435	1123	__ load_ptr_and_tag(5, rcx, rbx); // load a
duke@435	1124	__ load_ptr_and_tag(3, rax, rdx); // load c
duke@435	1125	__ store_ptr_and_tag(3, rcx, rbx); // store a in c
duke@435	1126	__ store_ptr_and_tag(5, rax, rdx); // store c in a
duke@435	1127	// stack: ..., c, d, a, b, c, d
duke@435	1128	}
duke@435	1129
duke@435	1130	void TemplateTable::swap() {
duke@435	1131	transition(vtos, vtos);
duke@435	1132	// stack: ..., a, b
duke@435	1133	__ load_ptr_and_tag(1, rcx, rbx); // load a
duke@435	1134	__ load_ptr_and_tag(0, rax, rdx); // load b
duke@435	1135	__ store_ptr_and_tag(0, rcx, rbx); // store a in b
duke@435	1136	__ store_ptr_and_tag(1, rax, rdx); // store b in a
duke@435	1137	// stack: ..., b, a
duke@435	1138	}
duke@435	1139
duke@435	1140	void TemplateTable::iop2(Operation op) {
duke@435	1141	transition(itos, itos);
duke@435	1142	switch (op) {
duke@435	1143	case add : __ pop_i(rdx); __ addl (rax, rdx); break;
duke@435	1144	case sub : __ movl(rdx, rax); __ pop_i(rax); __ subl (rax, rdx); break;
duke@435	1145	case mul : __ pop_i(rdx); __ imull(rax, rdx); break;
duke@435	1146	case _and : __ pop_i(rdx); __ andl (rax, rdx); break;
duke@435	1147	case _or : __ pop_i(rdx); __ orl (rax, rdx); break;
duke@435	1148	case _xor : __ pop_i(rdx); __ xorl (rax, rdx); break;
duke@435	1149	case shl : __ movl(rcx, rax); __ pop_i(rax); __ shll (rax); break;
duke@435	1150	case shr : __ movl(rcx, rax); __ pop_i(rax); __ sarl (rax); break;
duke@435	1151	case ushr : __ movl(rcx, rax); __ pop_i(rax); __ shrl (rax); break;
duke@435	1152	default : ShouldNotReachHere();
duke@435	1153	}
duke@435	1154	}
duke@435	1155
duke@435	1156	void TemplateTable::lop2(Operation op) {
duke@435	1157	transition(ltos, ltos);
duke@435	1158	switch (op) {
never@739	1159	case add : __ pop_l(rdx); __ addptr (rax, rdx); break;
never@739	1160	case sub : __ mov(rdx, rax); __ pop_l(rax); __ subptr (rax, rdx); break;
never@739	1161	case _and : __ pop_l(rdx); __ andptr (rax, rdx); break;
never@739	1162	case _or : __ pop_l(rdx); __ orptr (rax, rdx); break;
never@739	1163	case _xor : __ pop_l(rdx); __ xorptr (rax, rdx); break;
duke@435	1164	default : ShouldNotReachHere();
duke@435	1165	}
duke@435	1166	}
duke@435	1167
duke@435	1168	void TemplateTable::idiv() {
duke@435	1169	transition(itos, itos);
duke@435	1170	__ movl(rcx, rax);
duke@435	1171	__ pop_i(rax);
duke@435	1172	// Note: could xor eax and ecx and compare with (-1 ^ min_int). If
duke@435	1173	// they are not equal, one could do a normal division (no correction
duke@435	1174	// needed), which may speed up this implementation for the common case.
duke@435	1175	// (see also JVM spec., p.243 & p.271)
duke@435	1176	__ corrected_idivl(rcx);
duke@435	1177	}
duke@435	1178
duke@435	1179	void TemplateTable::irem() {
duke@435	1180	transition(itos, itos);
duke@435	1181	__ movl(rcx, rax);
duke@435	1182	__ pop_i(rax);
duke@435	1183	// Note: could xor eax and ecx and compare with (-1 ^ min_int). If
duke@435	1184	// they are not equal, one could do a normal division (no correction
duke@435	1185	// needed), which may speed up this implementation for the common case.
duke@435	1186	// (see also JVM spec., p.243 & p.271)
duke@435	1187	__ corrected_idivl(rcx);
duke@435	1188	__ movl(rax, rdx);
duke@435	1189	}
duke@435	1190
duke@435	1191	void TemplateTable::lmul() {
duke@435	1192	transition(ltos, ltos);
duke@435	1193	__ pop_l(rdx);
duke@435	1194	__ imulq(rax, rdx);
duke@435	1195	}
duke@435	1196
duke@435	1197	void TemplateTable::ldiv() {
duke@435	1198	transition(ltos, ltos);
never@739	1199	__ mov(rcx, rax);
duke@435	1200	__ pop_l(rax);
duke@435	1201	// generate explicit div0 check
duke@435	1202	__ testq(rcx, rcx);
duke@435	1203	__ jump_cc(Assembler::zero,
duke@435	1204	ExternalAddress(Interpreter::_throw_ArithmeticException_entry));
duke@435	1205	// Note: could xor rax and rcx and compare with (-1 ^ min_int). If
duke@435	1206	// they are not equal, one could do a normal division (no correction
duke@435	1207	// needed), which may speed up this implementation for the common case.
duke@435	1208	// (see also JVM spec., p.243 & p.271)
duke@435	1209	__ corrected_idivq(rcx); // kills rbx
duke@435	1210	}
duke@435	1211
duke@435	1212	void TemplateTable::lrem() {
duke@435	1213	transition(ltos, ltos);
never@739	1214	__ mov(rcx, rax);
duke@435	1215	__ pop_l(rax);
duke@435	1216	__ testq(rcx, rcx);
duke@435	1217	__ jump_cc(Assembler::zero,
duke@435	1218	ExternalAddress(Interpreter::_throw_ArithmeticException_entry));
duke@435	1219	// Note: could xor rax and rcx and compare with (-1 ^ min_int). If
duke@435	1220	// they are not equal, one could do a normal division (no correction
duke@435	1221	// needed), which may speed up this implementation for the common case.
duke@435	1222	// (see also JVM spec., p.243 & p.271)
duke@435	1223	__ corrected_idivq(rcx); // kills rbx
never@739	1224	__ mov(rax, rdx);
duke@435	1225	}
duke@435	1226
duke@435	1227	void TemplateTable::lshl() {
duke@435	1228	transition(itos, ltos);
duke@435	1229	__ movl(rcx, rax); // get shift count
duke@435	1230	__ pop_l(rax); // get shift value
duke@435	1231	__ shlq(rax);
duke@435	1232	}
duke@435	1233
duke@435	1234	void TemplateTable::lshr() {
duke@435	1235	transition(itos, ltos);
duke@435	1236	__ movl(rcx, rax); // get shift count
duke@435	1237	__ pop_l(rax); // get shift value
duke@435	1238	__ sarq(rax);
duke@435	1239	}
duke@435	1240
duke@435	1241	void TemplateTable::lushr() {
duke@435	1242	transition(itos, ltos);
duke@435	1243	__ movl(rcx, rax); // get shift count
duke@435	1244	__ pop_l(rax); // get shift value
duke@435	1245	__ shrq(rax);
duke@435	1246	}
duke@435	1247
duke@435	1248	void TemplateTable::fop2(Operation op) {
duke@435	1249	transition(ftos, ftos);
duke@435	1250	switch (op) {
duke@435	1251	case add:
duke@435	1252	__ addss(xmm0, at_rsp());
never@739	1253	__ addptr(rsp, Interpreter::stackElementSize());
duke@435	1254	break;
duke@435	1255	case sub:
duke@435	1256	__ movflt(xmm1, xmm0);
duke@435	1257	__ pop_f(xmm0);
duke@435	1258	__ subss(xmm0, xmm1);
duke@435	1259	break;
duke@435	1260	case mul:
duke@435	1261	__ mulss(xmm0, at_rsp());
never@739	1262	__ addptr(rsp, Interpreter::stackElementSize());
duke@435	1263	break;
duke@435	1264	case div:
duke@435	1265	__ movflt(xmm1, xmm0);
duke@435	1266	__ pop_f(xmm0);
duke@435	1267	__ divss(xmm0, xmm1);
duke@435	1268	break;
duke@435	1269	case rem:
duke@435	1270	__ movflt(xmm1, xmm0);
duke@435	1271	__ pop_f(xmm0);
duke@435	1272	__ call_VM_leaf(CAST_FROM_FN_PTR(address, SharedRuntime::frem), 2);
duke@435	1273	break;
duke@435	1274	default:
duke@435	1275	ShouldNotReachHere();
duke@435	1276	break;
duke@435	1277	}
duke@435	1278	}
duke@435	1279
duke@435	1280	void TemplateTable::dop2(Operation op) {
duke@435	1281	transition(dtos, dtos);
duke@435	1282	switch (op) {
duke@435	1283	case add:
duke@435	1284	__ addsd(xmm0, at_rsp());
never@739	1285	__ addptr(rsp, 2 * Interpreter::stackElementSize());
duke@435	1286	break;
duke@435	1287	case sub:
duke@435	1288	__ movdbl(xmm1, xmm0);
duke@435	1289	__ pop_d(xmm0);
duke@435	1290	__ subsd(xmm0, xmm1);
duke@435	1291	break;
duke@435	1292	case mul:
duke@435	1293	__ mulsd(xmm0, at_rsp());
never@739	1294	__ addptr(rsp, 2 * Interpreter::stackElementSize());
duke@435	1295	break;
duke@435	1296	case div:
duke@435	1297	__ movdbl(xmm1, xmm0);
duke@435	1298	__ pop_d(xmm0);
duke@435	1299	__ divsd(xmm0, xmm1);
duke@435	1300	break;
duke@435	1301	case rem:
duke@435	1302	__ movdbl(xmm1, xmm0);
duke@435	1303	__ pop_d(xmm0);
duke@435	1304	__ call_VM_leaf(CAST_FROM_FN_PTR(address, SharedRuntime::drem), 2);
duke@435	1305	break;
duke@435	1306	default:
duke@435	1307	ShouldNotReachHere();
duke@435	1308	break;
duke@435	1309	}
duke@435	1310	}
duke@435	1311
duke@435	1312	void TemplateTable::ineg() {
duke@435	1313	transition(itos, itos);
duke@435	1314	__ negl(rax);
duke@435	1315	}
duke@435	1316
duke@435	1317	void TemplateTable::lneg() {
duke@435	1318	transition(ltos, ltos);
duke@435	1319	__ negq(rax);
duke@435	1320	}
duke@435	1321
duke@435	1322	// Note: 'double' and 'long long' have 32-bits alignment on x86.
duke@435	1323	static jlong* double_quadword(jlong *adr, jlong lo, jlong hi) {
duke@435	1324	// Use the expression (adr)&(~0xF) to provide 128-bits aligned address
duke@435	1325	// of 128-bits operands for SSE instructions.
duke@435	1326	jlong *operand = (jlong*)(((intptr_t)adr)&((intptr_t)(~0xF)));
duke@435	1327	// Store the value to a 128-bits operand.
duke@435	1328	operand[0] = lo;
duke@435	1329	operand[1] = hi;
duke@435	1330	return operand;
duke@435	1331	}
duke@435	1332
duke@435	1333	// Buffer for 128-bits masks used by SSE instructions.
duke@435	1334	static jlong float_signflip_pool[2*2];
duke@435	1335	static jlong double_signflip_pool[2*2];
duke@435	1336
duke@435	1337	void TemplateTable::fneg() {
duke@435	1338	transition(ftos, ftos);
duke@435	1339	static jlong *float_signflip = double_quadword(&float_signflip_pool[1], 0x8000000080000000, 0x8000000080000000);
duke@435	1340	__ xorps(xmm0, ExternalAddress((address) float_signflip));
duke@435	1341	}
duke@435	1342
duke@435	1343	void TemplateTable::dneg() {
duke@435	1344	transition(dtos, dtos);
duke@435	1345	static jlong *double_signflip = double_quadword(&double_signflip_pool[1], 0x8000000000000000, 0x8000000000000000);
duke@435	1346	__ xorpd(xmm0, ExternalAddress((address) double_signflip));
duke@435	1347	}
duke@435	1348
duke@435	1349	void TemplateTable::iinc() {
duke@435	1350	transition(vtos, vtos);
duke@435	1351	__ load_signed_byte(rdx, at_bcp(2)); // get constant
duke@435	1352	locals_index(rbx);
duke@435	1353	__ addl(iaddress(rbx), rdx);
duke@435	1354	}
duke@435	1355
duke@435	1356	void TemplateTable::wide_iinc() {
duke@435	1357	transition(vtos, vtos);
duke@435	1358	__ movl(rdx, at_bcp(4)); // get constant
duke@435	1359	locals_index_wide(rbx);
duke@435	1360	__ bswapl(rdx); // swap bytes & sign-extend constant
duke@435	1361	__ sarl(rdx, 16);
duke@435	1362	__ addl(iaddress(rbx), rdx);
duke@435	1363	// Note: should probably use only one movl to get both
duke@435	1364	// the index and the constant -> fix this
duke@435	1365	}
duke@435	1366
duke@435	1367	void TemplateTable::convert() {
duke@435	1368	// Checking
duke@435	1369	#ifdef ASSERT
duke@435	1370	{
duke@435	1371	TosState tos_in = ilgl;
duke@435	1372	TosState tos_out = ilgl;
duke@435	1373	switch (bytecode()) {
duke@435	1374	case Bytecodes::_i2l: // fall through
duke@435	1375	case Bytecodes::_i2f: // fall through
duke@435	1376	case Bytecodes::_i2d: // fall through
duke@435	1377	case Bytecodes::_i2b: // fall through
duke@435	1378	case Bytecodes::_i2c: // fall through
duke@435	1379	case Bytecodes::_i2s: tos_in = itos; break;
duke@435	1380	case Bytecodes::_l2i: // fall through
duke@435	1381	case Bytecodes::_l2f: // fall through
duke@435	1382	case Bytecodes::_l2d: tos_in = ltos; break;
duke@435	1383	case Bytecodes::_f2i: // fall through
duke@435	1384	case Bytecodes::_f2l: // fall through
duke@435	1385	case Bytecodes::_f2d: tos_in = ftos; break;
duke@435	1386	case Bytecodes::_d2i: // fall through
duke@435	1387	case Bytecodes::_d2l: // fall through
duke@435	1388	case Bytecodes::_d2f: tos_in = dtos; break;
duke@435	1389	default : ShouldNotReachHere();
duke@435	1390	}
duke@435	1391	switch (bytecode()) {
duke@435	1392	case Bytecodes::_l2i: // fall through
duke@435	1393	case Bytecodes::_f2i: // fall through
duke@435	1394	case Bytecodes::_d2i: // fall through
duke@435	1395	case Bytecodes::_i2b: // fall through
duke@435	1396	case Bytecodes::_i2c: // fall through
duke@435	1397	case Bytecodes::_i2s: tos_out = itos; break;
duke@435	1398	case Bytecodes::_i2l: // fall through
duke@435	1399	case Bytecodes::_f2l: // fall through
duke@435	1400	case Bytecodes::_d2l: tos_out = ltos; break;
duke@435	1401	case Bytecodes::_i2f: // fall through
duke@435	1402	case Bytecodes::_l2f: // fall through
duke@435	1403	case Bytecodes::_d2f: tos_out = ftos; break;
duke@435	1404	case Bytecodes::_i2d: // fall through
duke@435	1405	case Bytecodes::_l2d: // fall through
duke@435	1406	case Bytecodes::_f2d: tos_out = dtos; break;
duke@435	1407	default : ShouldNotReachHere();
duke@435	1408	}
duke@435	1409	transition(tos_in, tos_out);
duke@435	1410	}
duke@435	1411	#endif // ASSERT
duke@435	1412
duke@435	1413	static const int64_t is_nan = 0x8000000000000000L;
duke@435	1414
duke@435	1415	// Conversion
duke@435	1416	switch (bytecode()) {
duke@435	1417	case Bytecodes::_i2l:
duke@435	1418	__ movslq(rax, rax);
duke@435	1419	break;
duke@435	1420	case Bytecodes::_i2f:
duke@435	1421	__ cvtsi2ssl(xmm0, rax);
duke@435	1422	break;
duke@435	1423	case Bytecodes::_i2d:
duke@435	1424	__ cvtsi2sdl(xmm0, rax);
duke@435	1425	break;
duke@435	1426	case Bytecodes::_i2b:
duke@435	1427	__ movsbl(rax, rax);
duke@435	1428	break;
duke@435	1429	case Bytecodes::_i2c:
duke@435	1430	__ movzwl(rax, rax);
duke@435	1431	break;
duke@435	1432	case Bytecodes::_i2s:
duke@435	1433	__ movswl(rax, rax);
duke@435	1434	break;
duke@435	1435	case Bytecodes::_l2i:
duke@435	1436	__ movl(rax, rax);
duke@435	1437	break;
duke@435	1438	case Bytecodes::_l2f:
duke@435	1439	__ cvtsi2ssq(xmm0, rax);
duke@435	1440	break;
duke@435	1441	case Bytecodes::_l2d:
duke@435	1442	__ cvtsi2sdq(xmm0, rax);
duke@435	1443	break;
duke@435	1444	case Bytecodes::_f2i:
duke@435	1445	{
duke@435	1446	Label L;
duke@435	1447	__ cvttss2sil(rax, xmm0);
duke@435	1448	__ cmpl(rax, 0x80000000); // NaN or overflow/underflow?
duke@435	1449	__ jcc(Assembler::notEqual, L);
duke@435	1450	__ call_VM_leaf(CAST_FROM_FN_PTR(address, SharedRuntime::f2i), 1);
duke@435	1451	__ bind(L);
duke@435	1452	}
duke@435	1453	break;
duke@435	1454	case Bytecodes::_f2l:
duke@435	1455	{
duke@435	1456	Label L;
duke@435	1457	__ cvttss2siq(rax, xmm0);
duke@435	1458	// NaN or overflow/underflow?
duke@435	1459	__ cmp64(rax, ExternalAddress((address) &is_nan));
duke@435	1460	__ jcc(Assembler::notEqual, L);
duke@435	1461	__ call_VM_leaf(CAST_FROM_FN_PTR(address, SharedRuntime::f2l), 1);
duke@435	1462	__ bind(L);
duke@435	1463	}
duke@435	1464	break;
duke@435	1465	case Bytecodes::_f2d:
duke@435	1466	__ cvtss2sd(xmm0, xmm0);
duke@435	1467	break;
duke@435	1468	case Bytecodes::_d2i:
duke@435	1469	{
duke@435	1470	Label L;
duke@435	1471	__ cvttsd2sil(rax, xmm0);
duke@435	1472	__ cmpl(rax, 0x80000000); // NaN or overflow/underflow?
duke@435	1473	__ jcc(Assembler::notEqual, L);
duke@435	1474	__ call_VM_leaf(CAST_FROM_FN_PTR(address, SharedRuntime::d2i), 1);
duke@435	1475	__ bind(L);
duke@435	1476	}
duke@435	1477	break;
duke@435	1478	case Bytecodes::_d2l:
duke@435	1479	{
duke@435	1480	Label L;
duke@435	1481	__ cvttsd2siq(rax, xmm0);
duke@435	1482	// NaN or overflow/underflow?
duke@435	1483	__ cmp64(rax, ExternalAddress((address) &is_nan));
duke@435	1484	__ jcc(Assembler::notEqual, L);
duke@435	1485	__ call_VM_leaf(CAST_FROM_FN_PTR(address, SharedRuntime::d2l), 1);
duke@435	1486	__ bind(L);
duke@435	1487	}
duke@435	1488	break;
duke@435	1489	case Bytecodes::_d2f:
duke@435	1490	__ cvtsd2ss(xmm0, xmm0);
duke@435	1491	break;
duke@435	1492	default:
duke@435	1493	ShouldNotReachHere();
duke@435	1494	}
duke@435	1495	}
duke@435	1496
duke@435	1497	void TemplateTable::lcmp() {
duke@435	1498	transition(ltos, itos);
duke@435	1499	Label done;
duke@435	1500	__ pop_l(rdx);
duke@435	1501	__ cmpq(rdx, rax);
duke@435	1502	__ movl(rax, -1);
duke@435	1503	__ jccb(Assembler::less, done);
duke@435	1504	__ setb(Assembler::notEqual, rax);
duke@435	1505	__ movzbl(rax, rax);
duke@435	1506	__ bind(done);
duke@435	1507	}
duke@435	1508
duke@435	1509	void TemplateTable::float_cmp(bool is_float, int unordered_result) {
duke@435	1510	Label done;
duke@435	1511	if (is_float) {
duke@435	1512	// XXX get rid of pop here, use ... reg, mem32
duke@435	1513	__ pop_f(xmm1);
duke@435	1514	__ ucomiss(xmm1, xmm0);
duke@435	1515	} else {
duke@435	1516	// XXX get rid of pop here, use ... reg, mem64
duke@435	1517	__ pop_d(xmm1);
duke@435	1518	__ ucomisd(xmm1, xmm0);
duke@435	1519	}
duke@435	1520	if (unordered_result < 0) {
duke@435	1521	__ movl(rax, -1);
duke@435	1522	__ jccb(Assembler::parity, done);
duke@435	1523	__ jccb(Assembler::below, done);
duke@435	1524	__ setb(Assembler::notEqual, rdx);
duke@435	1525	__ movzbl(rax, rdx);
duke@435	1526	} else {
duke@435	1527	__ movl(rax, 1);
duke@435	1528	__ jccb(Assembler::parity, done);
duke@435	1529	__ jccb(Assembler::above, done);
duke@435	1530	__ movl(rax, 0);
duke@435	1531	__ jccb(Assembler::equal, done);
duke@435	1532	__ decrementl(rax);
duke@435	1533	}
duke@435	1534	__ bind(done);
duke@435	1535	}
duke@435	1536
duke@435	1537	void TemplateTable::branch(bool is_jsr, bool is_wide) {
duke@435	1538	__ get_method(rcx); // rcx holds method
duke@435	1539	__ profile_taken_branch(rax, rbx); // rax holds updated MDP, rbx
duke@435	1540	// holds bumped taken count
duke@435	1541
duke@435	1542	const ByteSize be_offset = methodOopDesc::backedge_counter_offset() +
duke@435	1543	InvocationCounter::counter_offset();
duke@435	1544	const ByteSize inv_offset = methodOopDesc::invocation_counter_offset() +
duke@435	1545	InvocationCounter::counter_offset();
duke@435	1546	const int method_offset = frame::interpreter_frame_method_offset * wordSize;
duke@435	1547
duke@435	1548	// Load up edx with the branch displacement
duke@435	1549	__ movl(rdx, at_bcp(1));
duke@435	1550	__ bswapl(rdx);
duke@435	1551
duke@435	1552	if (!is_wide) {
duke@435	1553	__ sarl(rdx, 16);
duke@435	1554	}
never@739	1555	__ movl2ptr(rdx, rdx);
duke@435	1556
duke@435	1557	// Handle all the JSR stuff here, then exit.
duke@435	1558	// It's much shorter and cleaner than intermingling with the non-JSR
twisti@1040	1559	// normal-branch stuff occurring below.
duke@435	1560	if (is_jsr) {
duke@435	1561	// Pre-load the next target bytecode into rbx
duke@435	1562	__ load_unsigned_byte(rbx, Address(r13, rdx, Address::times_1, 0));
duke@435	1563
duke@435	1564	// compute return address as bci in rax
never@739	1565	__ lea(rax, at_bcp((is_wide ? 5 : 3) -
duke@435	1566	in_bytes(constMethodOopDesc::codes_offset())));
never@739	1567	__ subptr(rax, Address(rcx, methodOopDesc::const_offset()));
duke@435	1568	// Adjust the bcp in r13 by the displacement in rdx
never@739	1569	__ addptr(r13, rdx);
duke@435	1570	// jsr returns atos that is not an oop
duke@435	1571	__ push_i(rax);
duke@435	1572	__ dispatch_only(vtos);
duke@435	1573	return;
duke@435	1574	}
duke@435	1575
duke@435	1576	// Normal (non-jsr) branch handling
duke@435	1577
duke@435	1578	// Adjust the bcp in r13 by the displacement in rdx
never@739	1579	__ addptr(r13, rdx);
duke@435	1580
duke@435	1581	assert(UseLoopCounter || !UseOnStackReplacement,
duke@435	1582	"on-stack-replacement requires loop counters");
duke@435	1583	Label backedge_counter_overflow;
duke@435	1584	Label profile_method;
duke@435	1585	Label dispatch;
duke@435	1586	if (UseLoopCounter) {
duke@435	1587	// increment backedge counter for backward branches
duke@435	1588	// rax: MDO
duke@435	1589	// ebx: MDO bumped taken-count
duke@435	1590	// rcx: method
duke@435	1591	// rdx: target offset
duke@435	1592	// r13: target bcp
duke@435	1593	// r14: locals pointer
duke@435	1594	__ testl(rdx, rdx); // check if forward or backward branch
duke@435	1595	__ jcc(Assembler::positive, dispatch); // count only if backward branch
duke@435	1596
duke@435	1597	// increment counter
duke@435	1598	__ movl(rax, Address(rcx, be_offset)); // load backedge counter
duke@435	1599	__ incrementl(rax, InvocationCounter::count_increment); // increment
duke@435	1600	// counter
duke@435	1601	__ movl(Address(rcx, be_offset), rax); // store counter
duke@435	1602
duke@435	1603	__ movl(rax, Address(rcx, inv_offset)); // load invocation counter
duke@435	1604	__ andl(rax, InvocationCounter::count_mask_value); // and the status bits
duke@435	1605	__ addl(rax, Address(rcx, be_offset)); // add both counters
duke@435	1606
duke@435	1607	if (ProfileInterpreter) {
duke@435	1608	// Test to see if we should create a method data oop
duke@435	1609	__ cmp32(rax,
duke@435	1610	ExternalAddress((address) &InvocationCounter::InterpreterProfileLimit));
duke@435	1611	__ jcc(Assembler::less, dispatch);
duke@435	1612
duke@435	1613	// if no method data exists, go to profile method
duke@435	1614	__ test_method_data_pointer(rax, profile_method);
duke@435	1615
duke@435	1616	if (UseOnStackReplacement) {
duke@435	1617	// check for overflow against ebx which is the MDO taken count
duke@435	1618	__ cmp32(rbx,
duke@435	1619	ExternalAddress((address) &InvocationCounter::InterpreterBackwardBranchLimit));
duke@435	1620	__ jcc(Assembler::below, dispatch);
duke@435	1621
duke@435	1622	// When ProfileInterpreter is on, the backedge_count comes
duke@435	1623	// from the methodDataOop, which value does not get reset on
duke@435	1624	// the call to frequency_counter_overflow(). To avoid
duke@435	1625	// excessive calls to the overflow routine while the method is
duke@435	1626	// being compiled, add a second test to make sure the overflow
duke@435	1627	// function is called only once every overflow_frequency.
duke@435	1628	const int overflow_frequency = 1024;
duke@435	1629	__ andl(rbx, overflow_frequency - 1);
duke@435	1630	__ jcc(Assembler::zero, backedge_counter_overflow);
duke@435	1631
duke@435	1632	}
duke@435	1633	} else {
duke@435	1634	if (UseOnStackReplacement) {
duke@435	1635	// check for overflow against eax, which is the sum of the
duke@435	1636	// counters
duke@435	1637	__ cmp32(rax,
duke@435	1638	ExternalAddress((address) &InvocationCounter::InterpreterBackwardBranchLimit));
duke@435	1639	__ jcc(Assembler::aboveEqual, backedge_counter_overflow);
duke@435	1640
duke@435	1641	}
duke@435	1642	}
duke@435	1643	__ bind(dispatch);
duke@435	1644	}
duke@435	1645
duke@435	1646	// Pre-load the next target bytecode into rbx
duke@435	1647	__ load_unsigned_byte(rbx, Address(r13, 0));
duke@435	1648
duke@435	1649	// continue with the bytecode @ target
duke@435	1650	// eax: return bci for jsr's, unused otherwise
duke@435	1651	// ebx: target bytecode
duke@435	1652	// r13: target bcp
duke@435	1653	__ dispatch_only(vtos);
duke@435	1654
duke@435	1655	if (UseLoopCounter) {
duke@435	1656	if (ProfileInterpreter) {
duke@435	1657	// Out-of-line code to allocate method data oop.
duke@435	1658	__ bind(profile_method);
duke@435	1659	__ call_VM(noreg,
duke@435	1660	CAST_FROM_FN_PTR(address,
duke@435	1661	InterpreterRuntime::profile_method), r13);
duke@435	1662	__ load_unsigned_byte(rbx, Address(r13, 0)); // restore target bytecode
never@739	1663	__ movptr(rcx, Address(rbp, method_offset));
never@739	1664	__ movptr(rcx, Address(rcx,
never@739	1665	in_bytes(methodOopDesc::method_data_offset())));
never@739	1666	__ movptr(Address(rbp, frame::interpreter_frame_mdx_offset * wordSize),
never@739	1667	rcx);
duke@435	1668	__ test_method_data_pointer(rcx, dispatch);
duke@435	1669	// offset non-null mdp by MDO::data_offset() + IR::profile_method()
never@739	1670	__ addptr(rcx, in_bytes(methodDataOopDesc::data_offset()));
never@739	1671	__ addptr(rcx, rax);
never@739	1672	__ movptr(Address(rbp, frame::interpreter_frame_mdx_offset * wordSize),
never@739	1673	rcx);
duke@435	1674	__ jmp(dispatch);
duke@435	1675	}
duke@435	1676
duke@435	1677	if (UseOnStackReplacement) {
duke@435	1678	// invocation counter overflow
duke@435	1679	__ bind(backedge_counter_overflow);
never@739	1680	__ negptr(rdx);
never@739	1681	__ addptr(rdx, r13); // branch bcp
duke@435	1682	// IcoResult frequency_counter_overflow([JavaThread*], address branch_bcp)
duke@435	1683	__ call_VM(noreg,
duke@435	1684	CAST_FROM_FN_PTR(address,
duke@435	1685	InterpreterRuntime::frequency_counter_overflow),
duke@435	1686	rdx);
duke@435	1687	__ load_unsigned_byte(rbx, Address(r13, 0)); // restore target bytecode
duke@435	1688
duke@435	1689	// rax: osr nmethod (osr ok) or NULL (osr not possible)
duke@435	1690	// ebx: target bytecode
duke@435	1691	// rdx: scratch
duke@435	1692	// r14: locals pointer
duke@435	1693	// r13: bcp
never@739	1694	__ testptr(rax, rax); // test result
duke@435	1695	__ jcc(Assembler::zero, dispatch); // no osr if null
duke@435	1696	// nmethod may have been invalidated (VM may block upon call_VM return)
duke@435	1697	__ movl(rcx, Address(rax, nmethod::entry_bci_offset()));
duke@435	1698	__ cmpl(rcx, InvalidOSREntryBci);
duke@435	1699	__ jcc(Assembler::equal, dispatch);
duke@435	1700
duke@435	1701	// We have the address of an on stack replacement routine in eax
duke@435	1702	// We need to prepare to execute the OSR method. First we must
duke@435	1703	// migrate the locals and monitors off of the stack.
duke@435	1704
never@739	1705	__ mov(r13, rax); // save the nmethod
duke@435	1706
duke@435	1707	call_VM(noreg, CAST_FROM_FN_PTR(address, SharedRuntime::OSR_migration_begin));
duke@435	1708
duke@435	1709	// eax is OSR buffer, move it to expected parameter location
never@739	1710	__ mov(j_rarg0, rax);
duke@435	1711
duke@435	1712	// We use j_rarg definitions here so that registers don't conflict as parameter
duke@435	1713	// registers change across platforms as we are in the midst of a calling
duke@435	1714	// sequence to the OSR nmethod and we don't want collision. These are NOT parameters.
duke@435	1715
duke@435	1716	const Register retaddr = j_rarg2;
duke@435	1717	const Register sender_sp = j_rarg1;
duke@435	1718
duke@435	1719	// pop the interpreter frame
never@739	1720	__ movptr(sender_sp, Address(rbp, frame::interpreter_frame_sender_sp_offset * wordSize)); // get sender sp
duke@435	1721	__ leave(); // remove frame anchor
never@739	1722	__ pop(retaddr); // get return address
never@739	1723	__ mov(rsp, sender_sp); // set sp to sender sp
duke@435	1724	// Ensure compiled code always sees stack at proper alignment
never@739	1725	__ andptr(rsp, -(StackAlignmentInBytes));
duke@435	1726
duke@435	1727	// unlike x86 we need no specialized return from compiled code
duke@435	1728	// to the interpreter or the call stub.
duke@435	1729
duke@435	1730	// push the return address
never@739	1731	__ push(retaddr);
duke@435	1732
duke@435	1733	// and begin the OSR nmethod
duke@435	1734	__ jmp(Address(r13, nmethod::osr_entry_point_offset()));
duke@435	1735	}
duke@435	1736	}
duke@435	1737	}
duke@435	1738
duke@435	1739
duke@435	1740	void TemplateTable::if_0cmp(Condition cc) {
duke@435	1741	transition(itos, vtos);
duke@435	1742	// assume branch is more often taken than not (loops use backward branches)
duke@435	1743	Label not_taken;
duke@435	1744	__ testl(rax, rax);
duke@435	1745	__ jcc(j_not(cc), not_taken);
duke@435	1746	branch(false, false);
duke@435	1747	__ bind(not_taken);
duke@435	1748	__ profile_not_taken_branch(rax);
duke@435	1749	}
duke@435	1750
duke@435	1751	void TemplateTable::if_icmp(Condition cc) {
duke@435	1752	transition(itos, vtos);
duke@435	1753	// assume branch is more often taken than not (loops use backward branches)
duke@435	1754	Label not_taken;
duke@435	1755	__ pop_i(rdx);
duke@435	1756	__ cmpl(rdx, rax);
duke@435	1757	__ jcc(j_not(cc), not_taken);
duke@435	1758	branch(false, false);
duke@435	1759	__ bind(not_taken);
duke@435	1760	__ profile_not_taken_branch(rax);
duke@435	1761	}
duke@435	1762
duke@435	1763	void TemplateTable::if_nullcmp(Condition cc) {
duke@435	1764	transition(atos, vtos);
duke@435	1765	// assume branch is more often taken than not (loops use backward branches)
duke@435	1766	Label not_taken;
never@739	1767	__ testptr(rax, rax);
duke@435	1768	__ jcc(j_not(cc), not_taken);
duke@435	1769	branch(false, false);
duke@435	1770	__ bind(not_taken);
duke@435	1771	__ profile_not_taken_branch(rax);
duke@435	1772	}
duke@435	1773
duke@435	1774	void TemplateTable::if_acmp(Condition cc) {
duke@435	1775	transition(atos, vtos);
duke@435	1776	// assume branch is more often taken than not (loops use backward branches)
duke@435	1777	Label not_taken;
duke@435	1778	__ pop_ptr(rdx);
never@739	1779	__ cmpptr(rdx, rax);
duke@435	1780	__ jcc(j_not(cc), not_taken);
duke@435	1781	branch(false, false);
duke@435	1782	__ bind(not_taken);
duke@435	1783	__ profile_not_taken_branch(rax);
duke@435	1784	}
duke@435	1785
duke@435	1786	void TemplateTable::ret() {
duke@435	1787	transition(vtos, vtos);
duke@435	1788	locals_index(rbx);
never@739	1789	__ movslq(rbx, iaddress(rbx)); // get return bci, compute return bcp
duke@435	1790	__ profile_ret(rbx, rcx);
duke@435	1791	__ get_method(rax);
never@739	1792	__ movptr(r13, Address(rax, methodOopDesc::const_offset()));
never@739	1793	__ lea(r13, Address(r13, rbx, Address::times_1,
never@739	1794	constMethodOopDesc::codes_offset()));
duke@435	1795	__ dispatch_next(vtos);
duke@435	1796	}
duke@435	1797
duke@435	1798	void TemplateTable::wide_ret() {
duke@435	1799	transition(vtos, vtos);
duke@435	1800	locals_index_wide(rbx);
never@739	1801	__ movptr(rbx, aaddress(rbx)); // get return bci, compute return bcp
duke@435	1802	__ profile_ret(rbx, rcx);
duke@435	1803	__ get_method(rax);
never@739	1804	__ movptr(r13, Address(rax, methodOopDesc::const_offset()));
never@739	1805	__ lea(r13, Address(r13, rbx, Address::times_1, constMethodOopDesc::codes_offset()));
duke@435	1806	__ dispatch_next(vtos);
duke@435	1807	}
duke@435	1808
duke@435	1809	void TemplateTable::tableswitch() {
duke@435	1810	Label default_case, continue_execution;
duke@435	1811	transition(itos, vtos);
duke@435	1812	// align r13
never@739	1813	__ lea(rbx, at_bcp(BytesPerInt));
never@739	1814	__ andptr(rbx, -BytesPerInt);
duke@435	1815	// load lo & hi
duke@435	1816	__ movl(rcx, Address(rbx, BytesPerInt));
duke@435	1817	__ movl(rdx, Address(rbx, 2 * BytesPerInt));
duke@435	1818	__ bswapl(rcx);
duke@435	1819	__ bswapl(rdx);
duke@435	1820	// check against lo & hi
duke@435	1821	__ cmpl(rax, rcx);
duke@435	1822	__ jcc(Assembler::less, default_case);
duke@435	1823	__ cmpl(rax, rdx);
duke@435	1824	__ jcc(Assembler::greater, default_case);
duke@435	1825	// lookup dispatch offset
duke@435	1826	__ subl(rax, rcx);
duke@435	1827	__ movl(rdx, Address(rbx, rax, Address::times_4, 3 * BytesPerInt));
duke@435	1828	__ profile_switch_case(rax, rbx, rcx);
duke@435	1829	// continue execution
duke@435	1830	__ bind(continue_execution);
duke@435	1831	__ bswapl(rdx);
never@739	1832	__ movl2ptr(rdx, rdx);
duke@435	1833	__ load_unsigned_byte(rbx, Address(r13, rdx, Address::times_1));
never@739	1834	__ addptr(r13, rdx);
duke@435	1835	__ dispatch_only(vtos);
duke@435	1836	// handle default
duke@435	1837	__ bind(default_case);
duke@435	1838	__ profile_switch_default(rax);
duke@435	1839	__ movl(rdx, Address(rbx, 0));
duke@435	1840	__ jmp(continue_execution);
duke@435	1841	}
duke@435	1842
duke@435	1843	void TemplateTable::lookupswitch() {
duke@435	1844	transition(itos, itos);
duke@435	1845	__ stop("lookupswitch bytecode should have been rewritten");
duke@435	1846	}
duke@435	1847
duke@435	1848	void TemplateTable::fast_linearswitch() {
duke@435	1849	transition(itos, vtos);
duke@435	1850	Label loop_entry, loop, found, continue_execution;
duke@435	1851	// bswap rax so we can avoid bswapping the table entries
duke@435	1852	__ bswapl(rax);
duke@435	1853	// align r13
never@739	1854	__ lea(rbx, at_bcp(BytesPerInt)); // btw: should be able to get rid of
never@739	1855	// this instruction (change offsets
never@739	1856	// below)
never@739	1857	__ andptr(rbx, -BytesPerInt);
duke@435	1858	// set counter
duke@435	1859	__ movl(rcx, Address(rbx, BytesPerInt));
duke@435	1860	__ bswapl(rcx);
duke@435	1861	__ jmpb(loop_entry);
duke@435	1862	// table search
duke@435	1863	__ bind(loop);
duke@435	1864	__ cmpl(rax, Address(rbx, rcx, Address::times_8, 2 * BytesPerInt));
duke@435	1865	__ jcc(Assembler::equal, found);
duke@435	1866	__ bind(loop_entry);
duke@435	1867	__ decrementl(rcx);
duke@435	1868	__ jcc(Assembler::greaterEqual, loop);
duke@435	1869	// default case
duke@435	1870	__ profile_switch_default(rax);
duke@435	1871	__ movl(rdx, Address(rbx, 0));
duke@435	1872	__ jmp(continue_execution);
duke@435	1873	// entry found -> get offset
duke@435	1874	__ bind(found);
duke@435	1875	__ movl(rdx, Address(rbx, rcx, Address::times_8, 3 * BytesPerInt));
duke@435	1876	__ profile_switch_case(rcx, rax, rbx);
duke@435	1877	// continue execution
duke@435	1878	__ bind(continue_execution);
duke@435	1879	__ bswapl(rdx);
never@739	1880	__ movl2ptr(rdx, rdx);
duke@435	1881	__ load_unsigned_byte(rbx, Address(r13, rdx, Address::times_1));
never@739	1882	__ addptr(r13, rdx);
duke@435	1883	__ dispatch_only(vtos);
duke@435	1884	}
duke@435	1885
duke@435	1886	void TemplateTable::fast_binaryswitch() {
duke@435	1887	transition(itos, vtos);
duke@435	1888	// Implementation using the following core algorithm:
duke@435	1889	//
duke@435	1890	// int binary_search(int key, LookupswitchPair* array, int n) {
duke@435	1891	// // Binary search according to "Methodik des Programmierens" by
duke@435	1892	// // Edsger W. Dijkstra and W.H.J. Feijen, Addison Wesley Germany 1985.
duke@435	1893	// int i = 0;
duke@435	1894	// int j = n;
duke@435	1895	// while (i+1 < j) {
duke@435	1896	// // invariant P: 0 <= i < j <= n and (a[i] <= key < a[j] or Q)
duke@435	1897	// // with Q: for all i: 0 <= i < n: key < a[i]
duke@435	1898	// // where a stands for the array and assuming that the (inexisting)
duke@435	1899	// // element a[n] is infinitely big.
duke@435	1900	// int h = (i + j) >> 1;
duke@435	1901	// // i < h < j
duke@435	1902	// if (key < array[h].fast_match()) {
duke@435	1903	// j = h;
duke@435	1904	// } else {
duke@435	1905	// i = h;
duke@435	1906	// }
duke@435	1907	// }
duke@435	1908	// // R: a[i] <= key < a[i+1] or Q
duke@435	1909	// // (i.e., if key is within array, i is the correct index)
duke@435	1910	// return i;
duke@435	1911	// }
duke@435	1912
duke@435	1913	// Register allocation
duke@435	1914	const Register key = rax; // already set (tosca)
duke@435	1915	const Register array = rbx;
duke@435	1916	const Register i = rcx;
duke@435	1917	const Register j = rdx;
duke@435	1918	const Register h = rdi;
duke@435	1919	const Register temp = rsi;
duke@435	1920
duke@435	1921	// Find array start
never@739	1922	__ lea(array, at_bcp(3 * BytesPerInt)); // btw: should be able to
never@739	1923	// get rid of this
never@739	1924	// instruction (change
never@739	1925	// offsets below)
never@739	1926	__ andptr(array, -BytesPerInt);
duke@435	1927
duke@435	1928	// Initialize i & j
duke@435	1929	__ xorl(i, i); // i = 0;
duke@435	1930	__ movl(j, Address(array, -BytesPerInt)); // j = length(array);
duke@435	1931
duke@435	1932	// Convert j into native byteordering
duke@435	1933	__ bswapl(j);
duke@435	1934
duke@435	1935	// And start
duke@435	1936	Label entry;
duke@435	1937	__ jmp(entry);
duke@435	1938
duke@435	1939	// binary search loop
duke@435	1940	{
duke@435	1941	Label loop;
duke@435	1942	__ bind(loop);
duke@435	1943	// int h = (i + j) >> 1;
duke@435	1944	__ leal(h, Address(i, j, Address::times_1)); // h = i + j;
duke@435	1945	__ sarl(h, 1); // h = (i + j) >> 1;
duke@435	1946	// if (key < array[h].fast_match()) {
duke@435	1947	// j = h;
duke@435	1948	// } else {
duke@435	1949	// i = h;
duke@435	1950	// }
duke@435	1951	// Convert array[h].match to native byte-ordering before compare
duke@435	1952	__ movl(temp, Address(array, h, Address::times_8));
duke@435	1953	__ bswapl(temp);
duke@435	1954	__ cmpl(key, temp);
duke@435	1955	// j = h if (key < array[h].fast_match())
duke@435	1956	__ cmovl(Assembler::less, j, h);
duke@435	1957	// i = h if (key >= array[h].fast_match())
duke@435	1958	__ cmovl(Assembler::greaterEqual, i, h);
duke@435	1959	// while (i+1 < j)
duke@435	1960	__ bind(entry);
duke@435	1961	__ leal(h, Address(i, 1)); // i+1
duke@435	1962	__ cmpl(h, j); // i+1 < j
duke@435	1963	__ jcc(Assembler::less, loop);
duke@435	1964	}
duke@435	1965
duke@435	1966	// end of binary search, result index is i (must check again!)
duke@435	1967	Label default_case;
duke@435	1968	// Convert array[i].match to native byte-ordering before compare
duke@435	1969	__ movl(temp, Address(array, i, Address::times_8));
duke@435	1970	__ bswapl(temp);
duke@435	1971	__ cmpl(key, temp);
duke@435	1972	__ jcc(Assembler::notEqual, default_case);
duke@435	1973
duke@435	1974	// entry found -> j = offset
duke@435	1975	__ movl(j , Address(array, i, Address::times_8, BytesPerInt));
duke@435	1976	__ profile_switch_case(i, key, array);
duke@435	1977	__ bswapl(j);
never@739	1978	__ movl2ptr(j, j);
duke@435	1979	__ load_unsigned_byte(rbx, Address(r13, j, Address::times_1));
never@739	1980	__ addptr(r13, j);
duke@435	1981	__ dispatch_only(vtos);
duke@435	1982
duke@435	1983	// default case -> j = default offset
duke@435	1984	__ bind(default_case);
duke@435	1985	__ profile_switch_default(i);
duke@435	1986	__ movl(j, Address(array, -2 * BytesPerInt));
duke@435	1987	__ bswapl(j);
never@739	1988	__ movl2ptr(j, j);
duke@435	1989	__ load_unsigned_byte(rbx, Address(r13, j, Address::times_1));
never@739	1990	__ addptr(r13, j);
duke@435	1991	__ dispatch_only(vtos);
duke@435	1992	}
duke@435	1993
duke@435	1994
duke@435	1995	void TemplateTable::_return(TosState state) {
duke@435	1996	transition(state, state);
duke@435	1997	assert(_desc->calls_vm(),
duke@435	1998	"inconsistent calls_vm information"); // call in remove_activation
duke@435	1999
duke@435	2000	if (_desc->bytecode() == Bytecodes::_return_register_finalizer) {
duke@435	2001	assert(state == vtos, "only valid state");
never@739	2002	__ movptr(c_rarg1, aaddress(0));
coleenp@548	2003	__ load_klass(rdi, c_rarg1);
duke@435	2004	__ movl(rdi, Address(rdi, Klass::access_flags_offset_in_bytes() + sizeof(oopDesc)));
duke@435	2005	__ testl(rdi, JVM_ACC_HAS_FINALIZER);
duke@435	2006	Label skip_register_finalizer;
duke@435	2007	__ jcc(Assembler::zero, skip_register_finalizer);
duke@435	2008
duke@435	2009	__ call_VM(noreg, CAST_FROM_FN_PTR(address, InterpreterRuntime::register_finalizer), c_rarg1);
duke@435	2010
duke@435	2011	__ bind(skip_register_finalizer);
duke@435	2012	}
duke@435	2013
duke@435	2014	__ remove_activation(state, r13);
duke@435	2015	__ jmp(r13);
duke@435	2016	}
duke@435	2017
duke@435	2018	// ----------------------------------------------------------------------------
duke@435	2019	// Volatile variables demand their effects be made known to all CPU's
duke@435	2020	// in order. Store buffers on most chips allow reads & writes to
duke@435	2021	// reorder; the JMM's ReadAfterWrite.java test fails in -Xint mode
duke@435	2022	// without some kind of memory barrier (i.e., it's not sufficient that
duke@435	2023	// the interpreter does not reorder volatile references, the hardware
duke@435	2024	// also must not reorder them).
duke@435	2025	//
duke@435	2026	// According to the new Java Memory Model (JMM):
duke@435	2027	// (1) All volatiles are serialized wrt to each other. ALSO reads &
duke@435	2028	// writes act as aquire & release, so:
duke@435	2029	// (2) A read cannot let unrelated NON-volatile memory refs that
duke@435	2030	// happen after the read float up to before the read. It's OK for
duke@435	2031	// non-volatile memory refs that happen before the volatile read to
duke@435	2032	// float down below it.
duke@435	2033	// (3) Similar a volatile write cannot let unrelated NON-volatile
duke@435	2034	// memory refs that happen BEFORE the write float down to after the
duke@435	2035	// write. It's OK for non-volatile memory refs that happen after the
duke@435	2036	// volatile write to float up before it.
duke@435	2037	//
duke@435	2038	// We only put in barriers around volatile refs (they are expensive),
duke@435	2039	// not _between_ memory refs (that would require us to track the
duke@435	2040	// flavor of the previous memory refs). Requirements (2) and (3)
duke@435	2041	// require some barriers before volatile stores and after volatile
duke@435	2042	// loads. These nearly cover requirement (1) but miss the
duke@435	2043	// volatile-store-volatile-load case. This final case is placed after
duke@435	2044	// volatile-stores although it could just as well go before
duke@435	2045	// volatile-loads.
duke@435	2046	void TemplateTable::volatile_barrier(Assembler::Membar_mask_bits
duke@435	2047	order_constraint) {
duke@435	2048	// Helper function to insert a is-volatile test and memory barrier
duke@435	2049	if (os::is_MP()) { // Not needed on single CPU
duke@435	2050	__ membar(order_constraint);
duke@435	2051	}
duke@435	2052	}
duke@435	2053
twisti@1543	2054	void TemplateTable::resolve_cache_and_index(int byte_no, Register Rcache, Register index) {
duke@435	2055	assert(byte_no == 1 || byte_no == 2, "byte_no out of range");
twisti@1543	2056	bool is_invokedynamic = (bytecode() == Bytecodes::_invokedynamic);
duke@435	2057
duke@435	2058	const Register temp = rbx;
duke@435	2059	assert_different_registers(Rcache, index, temp);
duke@435	2060
duke@435	2061	const int shift_count = (1 + byte_no) * BitsPerByte;
duke@435	2062	Label resolved;
twisti@1543	2063	__ get_cache_and_index_at_bcp(Rcache, index, 1, is_invokedynamic);
twisti@1543	2064	if (is_invokedynamic) {
twisti@1543	2065	// we are resolved if the f1 field contains a non-null CallSite object
twisti@1543	2066	__ cmpptr(Address(Rcache, index, Address::times_ptr, constantPoolCacheOopDesc::base_offset() + ConstantPoolCacheEntry::f1_offset()), (int32_t) NULL_WORD);
twisti@1543	2067	__ jcc(Assembler::notEqual, resolved);
twisti@1543	2068	} else {
twisti@1543	2069	__ movl(temp, Address(Rcache, index, Address::times_ptr, constantPoolCacheOopDesc::base_offset() + ConstantPoolCacheEntry::indices_offset()));
twisti@1543	2070	__ shrl(temp, shift_count);
twisti@1543	2071	// have we resolved this bytecode?
twisti@1543	2072	__ andl(temp, 0xFF);
twisti@1543	2073	__ cmpl(temp, (int) bytecode());
twisti@1543	2074	__ jcc(Assembler::equal, resolved);
twisti@1543	2075	}
duke@435	2076
duke@435	2077	// resolve first time through
duke@435	2078	address entry;
duke@435	2079	switch (bytecode()) {
duke@435	2080	case Bytecodes::_getstatic:
duke@435	2081	case Bytecodes::_putstatic:
duke@435	2082	case Bytecodes::_getfield:
duke@435	2083	case Bytecodes::_putfield:
duke@435	2084	entry = CAST_FROM_FN_PTR(address, InterpreterRuntime::resolve_get_put);
duke@435	2085	break;
duke@435	2086	case Bytecodes::_invokevirtual:
duke@435	2087	case Bytecodes::_invokespecial:
duke@435	2088	case Bytecodes::_invokestatic:
duke@435	2089	case Bytecodes::_invokeinterface:
duke@435	2090	entry = CAST_FROM_FN_PTR(address, InterpreterRuntime::resolve_invoke);
duke@435	2091	break;
twisti@1543	2092	case Bytecodes::_invokedynamic:
twisti@1543	2093	entry = CAST_FROM_FN_PTR(address, InterpreterRuntime::resolve_invokedynamic);
twisti@1543	2094	break;
duke@435	2095	default:
duke@435	2096	ShouldNotReachHere();
duke@435	2097	break;
duke@435	2098	}
duke@435	2099	__ movl(temp, (int) bytecode());
duke@435	2100	__ call_VM(noreg, entry, temp);
duke@435	2101
duke@435	2102	// Update registers with resolved info
twisti@1543	2103	__ get_cache_and_index_at_bcp(Rcache, index, 1, is_invokedynamic);
duke@435	2104	__ bind(resolved);
duke@435	2105	}
duke@435	2106
duke@435	2107	// The Rcache and index registers must be set before call
duke@435	2108	void TemplateTable::load_field_cp_cache_entry(Register obj,
duke@435	2109	Register cache,
duke@435	2110	Register index,
duke@435	2111	Register off,
duke@435	2112	Register flags,
duke@435	2113	bool is_static = false) {
duke@435	2114	assert_different_registers(cache, index, flags, off);
duke@435	2115
duke@435	2116	ByteSize cp_base_offset = constantPoolCacheOopDesc::base_offset();
duke@435	2117	// Field offset
never@739	2118	__ movptr(off, Address(cache, index, Address::times_8,
never@739	2119	in_bytes(cp_base_offset +
never@739	2120	ConstantPoolCacheEntry::f2_offset())));
duke@435	2121	// Flags
duke@435	2122	__ movl(flags, Address(cache, index, Address::times_8,
duke@435	2123	in_bytes(cp_base_offset +
duke@435	2124	ConstantPoolCacheEntry::flags_offset())));
duke@435	2125
duke@435	2126	// klass overwrite register
duke@435	2127	if (is_static) {
never@739	2128	__ movptr(obj, Address(cache, index, Address::times_8,
never@739	2129	in_bytes(cp_base_offset +
never@739	2130	ConstantPoolCacheEntry::f1_offset())));
duke@435	2131	}
duke@435	2132	}
duke@435	2133
duke@435	2134	void TemplateTable::load_invoke_cp_cache_entry(int byte_no,
duke@435	2135	Register method,
duke@435	2136	Register itable_index,
duke@435	2137	Register flags,
duke@435	2138	bool is_invokevirtual,
duke@435	2139	bool is_invokevfinal /*unused*/) {
duke@435	2140	// setup registers
duke@435	2141	const Register cache = rcx;
duke@435	2142	const Register index = rdx;
duke@435	2143	assert_different_registers(method, flags);
duke@435	2144	assert_different_registers(method, cache, index);
duke@435	2145	assert_different_registers(itable_index, flags);
duke@435	2146	assert_different_registers(itable_index, cache, index);
duke@435	2147	// determine constant pool cache field offsets
duke@435	2148	const int method_offset = in_bytes(
duke@435	2149	constantPoolCacheOopDesc::base_offset() +
duke@435	2150	(is_invokevirtual
duke@435	2151	? ConstantPoolCacheEntry::f2_offset()
duke@435	2152	: ConstantPoolCacheEntry::f1_offset()));
duke@435	2153	const int flags_offset = in_bytes(constantPoolCacheOopDesc::base_offset() +
duke@435	2154	ConstantPoolCacheEntry::flags_offset());
duke@435	2155	// access constant pool cache fields
duke@435	2156	const int index_offset = in_bytes(constantPoolCacheOopDesc::base_offset() +
duke@435	2157	ConstantPoolCacheEntry::f2_offset());
duke@435	2158
duke@435	2159	resolve_cache_and_index(byte_no, cache, index);
duke@435	2160
duke@435	2161	assert(wordSize == 8, "adjust code below");
never@739	2162	__ movptr(method, Address(cache, index, Address::times_8, method_offset));
duke@435	2163	if (itable_index != noreg) {
never@739	2164	__ movptr(itable_index,
duke@435	2165	Address(cache, index, Address::times_8, index_offset));
duke@435	2166	}
duke@435	2167	__ movl(flags , Address(cache, index, Address::times_8, flags_offset));
duke@435	2168	}
duke@435	2169
duke@435	2170
duke@435	2171	// The registers cache and index expected to be set before call.
duke@435	2172	// Correct values of the cache and index registers are preserved.
duke@435	2173	void TemplateTable::jvmti_post_field_access(Register cache, Register index,
duke@435	2174	bool is_static, bool has_tos) {
duke@435	2175	// do the JVMTI work here to avoid disturbing the register state below
duke@435	2176	// We use c_rarg registers here because we want to use the register used in
duke@435	2177	// the call to the VM
duke@435	2178	if (JvmtiExport::can_post_field_access()) {
duke@435	2179	// Check to see if a field access watch has been set before we
duke@435	2180	// take the time to call into the VM.
duke@435	2181	Label L1;
duke@435	2182	assert_different_registers(cache, index, rax);
duke@435	2183	__ mov32(rax, ExternalAddress((address) JvmtiExport::get_field_access_count_addr()));
duke@435	2184	__ testl(rax, rax);
duke@435	2185	__ jcc(Assembler::zero, L1);
duke@435	2186
duke@435	2187	__ get_cache_and_index_at_bcp(c_rarg2, c_rarg3, 1);
duke@435	2188
duke@435	2189	// cache entry pointer
never@739	2190	__ addptr(c_rarg2, in_bytes(constantPoolCacheOopDesc::base_offset()));
duke@435	2191	__ shll(c_rarg3, LogBytesPerWord);
never@739	2192	__ addptr(c_rarg2, c_rarg3);
duke@435	2193	if (is_static) {
duke@435	2194	__ xorl(c_rarg1, c_rarg1); // NULL object reference
duke@435	2195	} else {
never@739	2196	__ movptr(c_rarg1, at_tos()); // get object pointer without popping it
duke@435	2197	__ verify_oop(c_rarg1);
duke@435	2198	}
duke@435	2199	// c_rarg1: object pointer or NULL
duke@435	2200	// c_rarg2: cache entry pointer
duke@435	2201	// c_rarg3: jvalue object on the stack
duke@435	2202	__ call_VM(noreg, CAST_FROM_FN_PTR(address,
duke@435	2203	InterpreterRuntime::post_field_access),
duke@435	2204	c_rarg1, c_rarg2, c_rarg3);
duke@435	2205	__ get_cache_and_index_at_bcp(cache, index, 1);
duke@435	2206	__ bind(L1);
duke@435	2207	}
duke@435	2208	}
duke@435	2209
duke@435	2210	void TemplateTable::pop_and_check_object(Register r) {
duke@435	2211	__ pop_ptr(r);
duke@435	2212	__ null_check(r); // for field access must check obj.
duke@435	2213	__ verify_oop(r);
duke@435	2214	}
duke@435	2215
duke@435	2216	void TemplateTable::getfield_or_static(int byte_no, bool is_static) {
duke@435	2217	transition(vtos, vtos);
duke@435	2218
duke@435	2219	const Register cache = rcx;
duke@435	2220	const Register index = rdx;
duke@435	2221	const Register obj = c_rarg3;
duke@435	2222	const Register off = rbx;
duke@435	2223	const Register flags = rax;
duke@435	2224	const Register bc = c_rarg3; // uses same reg as obj, so don't mix them
duke@435	2225
duke@435	2226	resolve_cache_and_index(byte_no, cache, index);
duke@435	2227	jvmti_post_field_access(cache, index, is_static, false);
duke@435	2228	load_field_cp_cache_entry(obj, cache, index, off, flags, is_static);
duke@435	2229
duke@435	2230	if (!is_static) {
duke@435	2231	// obj is on the stack
duke@435	2232	pop_and_check_object(obj);
duke@435	2233	}
duke@435	2234
duke@435	2235	const Address field(obj, off, Address::times_1);
duke@435	2236
duke@435	2237	Label Done, notByte, notInt, notShort, notChar,
duke@435	2238	notLong, notFloat, notObj, notDouble;
duke@435	2239
duke@435	2240	__ shrl(flags, ConstantPoolCacheEntry::tosBits);
duke@435	2241	assert(btos == 0, "change code, btos != 0");
duke@435	2242
duke@435	2243	__ andl(flags, 0x0F);
duke@435	2244	__ jcc(Assembler::notZero, notByte);
duke@435	2245	// btos
duke@435	2246	__ load_signed_byte(rax, field);
duke@435	2247	__ push(btos);
duke@435	2248	// Rewrite bytecode to be faster
duke@435	2249	if (!is_static) {
duke@435	2250	patch_bytecode(Bytecodes::_fast_bgetfield, bc, rbx);
duke@435	2251	}
duke@435	2252	__ jmp(Done);
duke@435	2253
duke@435	2254	__ bind(notByte);
duke@435	2255	__ cmpl(flags, atos);
duke@435	2256	__ jcc(Assembler::notEqual, notObj);
duke@435	2257	// atos
coleenp@548	2258	__ load_heap_oop(rax, field);
duke@435	2259	__ push(atos);
duke@435	2260	if (!is_static) {
duke@435	2261	patch_bytecode(Bytecodes::_fast_agetfield, bc, rbx);
duke@435	2262	}
duke@435	2263	__ jmp(Done);
duke@435	2264
duke@435	2265	__ bind(notObj);
duke@435	2266	__ cmpl(flags, itos);
duke@435	2267	__ jcc(Assembler::notEqual, notInt);
duke@435	2268	// itos
duke@435	2269	__ movl(rax, field);
duke@435	2270	__ push(itos);
duke@435	2271	// Rewrite bytecode to be faster
duke@435	2272	if (!is_static) {
duke@435	2273	patch_bytecode(Bytecodes::_fast_igetfield, bc, rbx);
duke@435	2274	}
duke@435	2275	__ jmp(Done);
duke@435	2276
duke@435	2277	__ bind(notInt);
duke@435	2278	__ cmpl(flags, ctos);
duke@435	2279	__ jcc(Assembler::notEqual, notChar);
duke@435	2280	// ctos
jrose@1057	2281	__ load_unsigned_short(rax, field);
duke@435	2282	__ push(ctos);
duke@435	2283	// Rewrite bytecode to be faster
duke@435	2284	if (!is_static) {
duke@435	2285	patch_bytecode(Bytecodes::_fast_cgetfield, bc, rbx);
duke@435	2286	}
duke@435	2287	__ jmp(Done);
duke@435	2288
duke@435	2289	__ bind(notChar);
duke@435	2290	__ cmpl(flags, stos);
duke@435	2291	__ jcc(Assembler::notEqual, notShort);
duke@435	2292	// stos
jrose@1057	2293	__ load_signed_short(rax, field);
duke@435	2294	__ push(stos);
duke@435	2295	// Rewrite bytecode to be faster
duke@435	2296	if (!is_static) {
duke@435	2297	patch_bytecode(Bytecodes::_fast_sgetfield, bc, rbx);
duke@435	2298	}
duke@435	2299	__ jmp(Done);
duke@435	2300
duke@435	2301	__ bind(notShort);
duke@435	2302	__ cmpl(flags, ltos);
duke@435	2303	__ jcc(Assembler::notEqual, notLong);
duke@435	2304	// ltos
duke@435	2305	__ movq(rax, field);
duke@435	2306	__ push(ltos);
duke@435	2307	// Rewrite bytecode to be faster
duke@435	2308	if (!is_static) {
duke@435	2309	patch_bytecode(Bytecodes::_fast_lgetfield, bc, rbx);
duke@435	2310	}
duke@435	2311	__ jmp(Done);
duke@435	2312
duke@435	2313	__ bind(notLong);
duke@435	2314	__ cmpl(flags, ftos);
duke@435	2315	__ jcc(Assembler::notEqual, notFloat);
duke@435	2316	// ftos
duke@435	2317	__ movflt(xmm0, field);
duke@435	2318	__ push(ftos);
duke@435	2319	// Rewrite bytecode to be faster
duke@435	2320	if (!is_static) {
duke@435	2321	patch_bytecode(Bytecodes::_fast_fgetfield, bc, rbx);
duke@435	2322	}
duke@435	2323	__ jmp(Done);
duke@435	2324
duke@435	2325	__ bind(notFloat);
duke@435	2326	#ifdef ASSERT
duke@435	2327	__ cmpl(flags, dtos);
duke@435	2328	__ jcc(Assembler::notEqual, notDouble);
duke@435	2329	#endif
duke@435	2330	// dtos
duke@435	2331	__ movdbl(xmm0, field);
duke@435	2332	__ push(dtos);
duke@435	2333	// Rewrite bytecode to be faster
duke@435	2334	if (!is_static) {
duke@435	2335	patch_bytecode(Bytecodes::_fast_dgetfield, bc, rbx);
duke@435	2336	}
duke@435	2337	#ifdef ASSERT
duke@435	2338	__ jmp(Done);
duke@435	2339
duke@435	2340	__ bind(notDouble);
duke@435	2341	__ stop("Bad state");
duke@435	2342	#endif
duke@435	2343
duke@435	2344	__ bind(Done);
duke@435	2345	// [jk] not needed currently
duke@435	2346	// volatile_barrier(Assembler::Membar_mask_bits(Assembler::LoadLoad |
duke@435	2347	// Assembler::LoadStore));
duke@435	2348	}
duke@435	2349
duke@435	2350
duke@435	2351	void TemplateTable::getfield(int byte_no) {
duke@435	2352	getfield_or_static(byte_no, false);
duke@435	2353	}
duke@435	2354
duke@435	2355	void TemplateTable::getstatic(int byte_no) {
duke@435	2356	getfield_or_static(byte_no, true);
duke@435	2357	}
duke@435	2358
duke@435	2359	// The registers cache and index expected to be set before call.
duke@435	2360	// The function may destroy various registers, just not the cache and index registers.
duke@435	2361	void TemplateTable::jvmti_post_field_mod(Register cache, Register index, bool is_static) {
duke@435	2362	transition(vtos, vtos);
duke@435	2363
duke@435	2364	ByteSize cp_base_offset = constantPoolCacheOopDesc::base_offset();
duke@435	2365
duke@435	2366	if (JvmtiExport::can_post_field_modification()) {
duke@435	2367	// Check to see if a field modification watch has been set before
duke@435	2368	// we take the time to call into the VM.
duke@435	2369	Label L1;
duke@435	2370	assert_different_registers(cache, index, rax);
duke@435	2371	__ mov32(rax, ExternalAddress((address)JvmtiExport::get_field_modification_count_addr()));
duke@435	2372	__ testl(rax, rax);
duke@435	2373	__ jcc(Assembler::zero, L1);
duke@435	2374
duke@435	2375	__ get_cache_and_index_at_bcp(c_rarg2, rscratch1, 1);
duke@435	2376
duke@435	2377	if (is_static) {
duke@435	2378	// Life is simple. Null out the object pointer.
duke@435	2379	__ xorl(c_rarg1, c_rarg1);
duke@435	2380	} else {
duke@435	2381	// Life is harder. The stack holds the value on top, followed by
duke@435	2382	// the object. We don't know the size of the value, though; it
duke@435	2383	// could be one or two words depending on its type. As a result,
duke@435	2384	// we must find the type to determine where the object is.
duke@435	2385	__ movl(c_rarg3, Address(c_rarg2, rscratch1,
duke@435	2386	Address::times_8,
duke@435	2387	in_bytes(cp_base_offset +
duke@435	2388	ConstantPoolCacheEntry::flags_offset())));
duke@435	2389	__ shrl(c_rarg3, ConstantPoolCacheEntry::tosBits);
duke@435	2390	// Make sure we don't need to mask rcx for tosBits after the
duke@435	2391	// above shift
duke@435	2392	ConstantPoolCacheEntry::verify_tosBits();
never@739	2393	__ movptr(c_rarg1, at_tos_p1()); // initially assume a one word jvalue
duke@435	2394	__ cmpl(c_rarg3, ltos);
never@739	2395	__ cmovptr(Assembler::equal,
never@739	2396	c_rarg1, at_tos_p2()); // ltos (two word jvalue)
duke@435	2397	__ cmpl(c_rarg3, dtos);
never@739	2398	__ cmovptr(Assembler::equal,
never@739	2399	c_rarg1, at_tos_p2()); // dtos (two word jvalue)
duke@435	2400	}
duke@435	2401	// cache entry pointer
never@739	2402	__ addptr(c_rarg2, in_bytes(cp_base_offset));
duke@435	2403	__ shll(rscratch1, LogBytesPerWord);
never@739	2404	__ addptr(c_rarg2, rscratch1);
duke@435	2405	// object (tos)
never@739	2406	__ mov(c_rarg3, rsp);
duke@435	2407	// c_rarg1: object pointer set up above (NULL if static)
duke@435	2408	// c_rarg2: cache entry pointer
duke@435	2409	// c_rarg3: jvalue object on the stack
duke@435	2410	__ call_VM(noreg,
duke@435	2411	CAST_FROM_FN_PTR(address,
duke@435	2412	InterpreterRuntime::post_field_modification),
duke@435	2413	c_rarg1, c_rarg2, c_rarg3);
duke@435	2414	__ get_cache_and_index_at_bcp(cache, index, 1);
duke@435	2415	__ bind(L1);
duke@435	2416	}
duke@435	2417	}
duke@435	2418
duke@435	2419	void TemplateTable::putfield_or_static(int byte_no, bool is_static) {
duke@435	2420	transition(vtos, vtos);
duke@435	2421
duke@435	2422	const Register cache = rcx;
duke@435	2423	const Register index = rdx;
duke@435	2424	const Register obj = rcx;
duke@435	2425	const Register off = rbx;
duke@435	2426	const Register flags = rax;
duke@435	2427	const Register bc = c_rarg3;
duke@435	2428
duke@435	2429	resolve_cache_and_index(byte_no, cache, index);
duke@435	2430	jvmti_post_field_mod(cache, index, is_static);
duke@435	2431	load_field_cp_cache_entry(obj, cache, index, off, flags, is_static);
duke@435	2432
duke@435	2433	// [jk] not needed currently
duke@435	2434	// volatile_barrier(Assembler::Membar_mask_bits(Assembler::LoadStore |
duke@435	2435	// Assembler::StoreStore));
duke@435	2436
duke@435	2437	Label notVolatile, Done;
duke@435	2438	__ movl(rdx, flags);
duke@435	2439	__ shrl(rdx, ConstantPoolCacheEntry::volatileField);
duke@435	2440	__ andl(rdx, 0x1);
duke@435	2441
duke@435	2442	// field address
duke@435	2443	const Address field(obj, off, Address::times_1);
duke@435	2444
duke@435	2445	Label notByte, notInt, notShort, notChar,
duke@435	2446	notLong, notFloat, notObj, notDouble;
duke@435	2447
duke@435	2448	__ shrl(flags, ConstantPoolCacheEntry::tosBits);
duke@435	2449
duke@435	2450	assert(btos == 0, "change code, btos != 0");
duke@435	2451	__ andl(flags, 0x0f);
duke@435	2452	__ jcc(Assembler::notZero, notByte);
duke@435	2453	// btos
duke@435	2454	__ pop(btos);
duke@435	2455	if (!is_static) pop_and_check_object(obj);
duke@435	2456	__ movb(field, rax);
duke@435	2457	if (!is_static) {
duke@435	2458	patch_bytecode(Bytecodes::_fast_bputfield, bc, rbx);
duke@435	2459	}
duke@435	2460	__ jmp(Done);
duke@435	2461
duke@435	2462	__ bind(notByte);
duke@435	2463	__ cmpl(flags, atos);
duke@435	2464	__ jcc(Assembler::notEqual, notObj);
duke@435	2465	// atos
duke@435	2466	__ pop(atos);
duke@435	2467	if (!is_static) pop_and_check_object(obj);
ysr@777	2468
ysr@777	2469	// Store into the field
ysr@777	2470	do_oop_store(_masm, field, rax, _bs->kind(), false);
ysr@777	2471
duke@435	2472	if (!is_static) {
duke@435	2473	patch_bytecode(Bytecodes::_fast_aputfield, bc, rbx);
duke@435	2474	}
duke@435	2475	__ jmp(Done);
duke@435	2476
duke@435	2477	__ bind(notObj);
duke@435	2478	__ cmpl(flags, itos);
duke@435	2479	__ jcc(Assembler::notEqual, notInt);
duke@435	2480	// itos
duke@435	2481	__ pop(itos);
duke@435	2482	if (!is_static) pop_and_check_object(obj);
duke@435	2483	__ movl(field, rax);
duke@435	2484	if (!is_static) {
duke@435	2485	patch_bytecode(Bytecodes::_fast_iputfield, bc, rbx);
duke@435	2486	}
duke@435	2487	__ jmp(Done);
duke@435	2488
duke@435	2489	__ bind(notInt);
duke@435	2490	__ cmpl(flags, ctos);
duke@435	2491	__ jcc(Assembler::notEqual, notChar);
duke@435	2492	// ctos
duke@435	2493	__ pop(ctos);
duke@435	2494	if (!is_static) pop_and_check_object(obj);
duke@435	2495	__ movw(field, rax);
duke@435	2496	if (!is_static) {
duke@435	2497	patch_bytecode(Bytecodes::_fast_cputfield, bc, rbx);
duke@435	2498	}
duke@435	2499	__ jmp(Done);
duke@435	2500
duke@435	2501	__ bind(notChar);
duke@435	2502	__ cmpl(flags, stos);
duke@435	2503	__ jcc(Assembler::notEqual, notShort);
duke@435	2504	// stos
duke@435	2505	__ pop(stos);
duke@435	2506	if (!is_static) pop_and_check_object(obj);
duke@435	2507	__ movw(field, rax);
duke@435	2508	if (!is_static) {
duke@435	2509	patch_bytecode(Bytecodes::_fast_sputfield, bc, rbx);
duke@435	2510	}
duke@435	2511	__ jmp(Done);
duke@435	2512
duke@435	2513	__ bind(notShort);
duke@435	2514	__ cmpl(flags, ltos);
duke@435	2515	__ jcc(Assembler::notEqual, notLong);
duke@435	2516	// ltos
duke@435	2517	__ pop(ltos);
duke@435	2518	if (!is_static) pop_and_check_object(obj);
duke@435	2519	__ movq(field, rax);
duke@435	2520	if (!is_static) {
duke@435	2521	patch_bytecode(Bytecodes::_fast_lputfield, bc, rbx);
duke@435	2522	}
duke@435	2523	__ jmp(Done);
duke@435	2524
duke@435	2525	__ bind(notLong);
duke@435	2526	__ cmpl(flags, ftos);
duke@435	2527	__ jcc(Assembler::notEqual, notFloat);
duke@435	2528	// ftos
duke@435	2529	__ pop(ftos);
duke@435	2530	if (!is_static) pop_and_check_object(obj);
duke@435	2531	__ movflt(field, xmm0);
duke@435	2532	if (!is_static) {
duke@435	2533	patch_bytecode(Bytecodes::_fast_fputfield, bc, rbx);
duke@435	2534	}
duke@435	2535	__ jmp(Done);
duke@435	2536
duke@435	2537	__ bind(notFloat);
duke@435	2538	#ifdef ASSERT
duke@435	2539	__ cmpl(flags, dtos);
duke@435	2540	__ jcc(Assembler::notEqual, notDouble);
duke@435	2541	#endif
duke@435	2542	// dtos
duke@435	2543	__ pop(dtos);
duke@435	2544	if (!is_static) pop_and_check_object(obj);
duke@435	2545	__ movdbl(field, xmm0);
duke@435	2546	if (!is_static) {
duke@435	2547	patch_bytecode(Bytecodes::_fast_dputfield, bc, rbx);
duke@435	2548	}
duke@435	2549
duke@435	2550	#ifdef ASSERT
duke@435	2551	__ jmp(Done);
duke@435	2552
duke@435	2553	__ bind(notDouble);
duke@435	2554	__ stop("Bad state");
duke@435	2555	#endif
duke@435	2556
duke@435	2557	__ bind(Done);
duke@435	2558	// Check for volatile store
duke@435	2559	__ testl(rdx, rdx);
duke@435	2560	__ jcc(Assembler::zero, notVolatile);
duke@435	2561	volatile_barrier(Assembler::Membar_mask_bits(Assembler::StoreLoad |
duke@435	2562	Assembler::StoreStore));
duke@435	2563
duke@435	2564	__ bind(notVolatile);
duke@435	2565	}
duke@435	2566
duke@435	2567	void TemplateTable::putfield(int byte_no) {
duke@435	2568	putfield_or_static(byte_no, false);
duke@435	2569	}
duke@435	2570
duke@435	2571	void TemplateTable::putstatic(int byte_no) {
duke@435	2572	putfield_or_static(byte_no, true);
duke@435	2573	}
duke@435	2574
duke@435	2575	void TemplateTable::jvmti_post_fast_field_mod() {
duke@435	2576	if (JvmtiExport::can_post_field_modification()) {
duke@435	2577	// Check to see if a field modification watch has been set before
duke@435	2578	// we take the time to call into the VM.
duke@435	2579	Label L2;
duke@435	2580	__ mov32(c_rarg3, ExternalAddress((address)JvmtiExport::get_field_modification_count_addr()));
duke@435	2581	__ testl(c_rarg3, c_rarg3);
duke@435	2582	__ jcc(Assembler::zero, L2);
duke@435	2583	__ pop_ptr(rbx); // copy the object pointer from tos
duke@435	2584	__ verify_oop(rbx);
duke@435	2585	__ push_ptr(rbx); // put the object pointer back on tos
never@739	2586	__ subptr(rsp, sizeof(jvalue)); // add space for a jvalue object
never@739	2587	__ mov(c_rarg3, rsp);
duke@435	2588	const Address field(c_rarg3, 0);
duke@435	2589
duke@435	2590	switch (bytecode()) { // load values into the jvalue object
coleenp@548	2591	case Bytecodes::_fast_aputfield: __ movq(field, rax); break;
duke@435	2592	case Bytecodes::_fast_lputfield: __ movq(field, rax); break;
duke@435	2593	case Bytecodes::_fast_iputfield: __ movl(field, rax); break;
duke@435	2594	case Bytecodes::_fast_bputfield: __ movb(field, rax); break;
duke@435	2595	case Bytecodes::_fast_sputfield: // fall through
duke@435	2596	case Bytecodes::_fast_cputfield: __ movw(field, rax); break;
duke@435	2597	case Bytecodes::_fast_fputfield: __ movflt(field, xmm0); break;
duke@435	2598	case Bytecodes::_fast_dputfield: __ movdbl(field, xmm0); break;
duke@435	2599	default:
duke@435	2600	ShouldNotReachHere();
duke@435	2601	}
duke@435	2602
duke@435	2603	// Save rax because call_VM() will clobber it, then use it for
duke@435	2604	// JVMTI purposes
never@739	2605	__ push(rax);
duke@435	2606	// access constant pool cache entry
duke@435	2607	__ get_cache_entry_pointer_at_bcp(c_rarg2, rax, 1);
duke@435	2608	__ verify_oop(rbx);
duke@435	2609	// rbx: object pointer copied above
duke@435	2610	// c_rarg2: cache entry pointer
duke@435	2611	// c_rarg3: jvalue object on the stack
duke@435	2612	__ call_VM(noreg,
duke@435	2613	CAST_FROM_FN_PTR(address,
duke@435	2614	InterpreterRuntime::post_field_modification),
duke@435	2615	rbx, c_rarg2, c_rarg3);
never@739	2616	__ pop(rax); // restore lower value
never@739	2617	__ addptr(rsp, sizeof(jvalue)); // release jvalue object space
duke@435	2618	__ bind(L2);
duke@435	2619	}
duke@435	2620	}
duke@435	2621
duke@435	2622	void TemplateTable::fast_storefield(TosState state) {
duke@435	2623	transition(state, vtos);
duke@435	2624
duke@435	2625	ByteSize base = constantPoolCacheOopDesc::base_offset();
duke@435	2626
duke@435	2627	jvmti_post_fast_field_mod();
duke@435	2628
duke@435	2629	// access constant pool cache
duke@435	2630	__ get_cache_and_index_at_bcp(rcx, rbx, 1);
duke@435	2631
duke@435	2632	// test for volatile with rdx
duke@435	2633	__ movl(rdx, Address(rcx, rbx, Address::times_8,
duke@435	2634	in_bytes(base +
duke@435	2635	ConstantPoolCacheEntry::flags_offset())));
duke@435	2636
duke@435	2637	// replace index with field offset from cache entry
never@739	2638	__ movptr(rbx, Address(rcx, rbx, Address::times_8,
never@739	2639	in_bytes(base + ConstantPoolCacheEntry::f2_offset())));
duke@435	2640
duke@435	2641	// [jk] not needed currently
duke@435	2642	// volatile_barrier(Assembler::Membar_mask_bits(Assembler::LoadStore |
duke@435	2643	// Assembler::StoreStore));
duke@435	2644
duke@435	2645	Label notVolatile;
duke@435	2646	__ shrl(rdx, ConstantPoolCacheEntry::volatileField);
duke@435	2647	__ andl(rdx, 0x1);
duke@435	2648
duke@435	2649	// Get object from stack
duke@435	2650	pop_and_check_object(rcx);
duke@435	2651
duke@435	2652	// field address
duke@435	2653	const Address field(rcx, rbx, Address::times_1);
duke@435	2654
duke@435	2655	// access field
duke@435	2656	switch (bytecode()) {
duke@435	2657	case Bytecodes::_fast_aputfield:
ysr@777	2658	do_oop_store(_masm, field, rax, _bs->kind(), false);
duke@435	2659	break;
duke@435	2660	case Bytecodes::_fast_lputfield:
duke@435	2661	__ movq(field, rax);
duke@435	2662	break;
duke@435	2663	case Bytecodes::_fast_iputfield:
duke@435	2664	__ movl(field, rax);
duke@435	2665	break;
duke@435	2666	case Bytecodes::_fast_bputfield:
duke@435	2667	__ movb(field, rax);
duke@435	2668	break;
duke@435	2669	case Bytecodes::_fast_sputfield:
duke@435	2670	// fall through
duke@435	2671	case Bytecodes::_fast_cputfield:
duke@435	2672	__ movw(field, rax);
duke@435	2673	break;
duke@435	2674	case Bytecodes::_fast_fputfield:
duke@435	2675	__ movflt(field, xmm0);
duke@435	2676	break;
duke@435	2677	case Bytecodes::_fast_dputfield:
duke@435	2678	__ movdbl(field, xmm0);
duke@435	2679	break;
duke@435	2680	default:
duke@435	2681	ShouldNotReachHere();
duke@435	2682	}
duke@435	2683
duke@435	2684	// Check for volatile store
duke@435	2685	__ testl(rdx, rdx);
duke@435	2686	__ jcc(Assembler::zero, notVolatile);
duke@435	2687	volatile_barrier(Assembler::Membar_mask_bits(Assembler::StoreLoad |
duke@435	2688	Assembler::StoreStore));
duke@435	2689	__ bind(notVolatile);
duke@435	2690	}
duke@435	2691
duke@435	2692
duke@435	2693	void TemplateTable::fast_accessfield(TosState state) {
duke@435	2694	transition(atos, state);
duke@435	2695
duke@435	2696	// Do the JVMTI work here to avoid disturbing the register state below
duke@435	2697	if (JvmtiExport::can_post_field_access()) {
duke@435	2698	// Check to see if a field access watch has been set before we
duke@435	2699	// take the time to call into the VM.
duke@435	2700	Label L1;
duke@435	2701	__ mov32(rcx, ExternalAddress((address) JvmtiExport::get_field_access_count_addr()));
duke@435	2702	__ testl(rcx, rcx);
duke@435	2703	__ jcc(Assembler::zero, L1);
duke@435	2704	// access constant pool cache entry
duke@435	2705	__ get_cache_entry_pointer_at_bcp(c_rarg2, rcx, 1);
coleenp@548	2706	__ verify_oop(rax);
never@739	2707	__ mov(r12, rax); // save object pointer before call_VM() clobbers it
never@739	2708	__ mov(c_rarg1, rax);
duke@435	2709	// c_rarg1: object pointer copied above
duke@435	2710	// c_rarg2: cache entry pointer
duke@435	2711	__ call_VM(noreg,
duke@435	2712	CAST_FROM_FN_PTR(address,
duke@435	2713	InterpreterRuntime::post_field_access),
duke@435	2714	c_rarg1, c_rarg2);
never@739	2715	__ mov(rax, r12); // restore object pointer
coleenp@548	2716	__ reinit_heapbase();
duke@435	2717	__ bind(L1);
duke@435	2718	}
duke@435	2719
duke@435	2720	// access constant pool cache
duke@435	2721	__ get_cache_and_index_at_bcp(rcx, rbx, 1);
duke@435	2722	// replace index with field offset from cache entry
duke@435	2723	// [jk] not needed currently
duke@435	2724	// if (os::is_MP()) {
duke@435	2725	// __ movl(rdx, Address(rcx, rbx, Address::times_8,
duke@435	2726	// in_bytes(constantPoolCacheOopDesc::base_offset() +
duke@435	2727	// ConstantPoolCacheEntry::flags_offset())));
duke@435	2728	// __ shrl(rdx, ConstantPoolCacheEntry::volatileField);
duke@435	2729	// __ andl(rdx, 0x1);
duke@435	2730	// }
never@739	2731	__ movptr(rbx, Address(rcx, rbx, Address::times_8,
never@739	2732	in_bytes(constantPoolCacheOopDesc::base_offset() +
never@739	2733	ConstantPoolCacheEntry::f2_offset())));
duke@435	2734
duke@435	2735	// rax: object
duke@435	2736	__ verify_oop(rax);
duke@435	2737	__ null_check(rax);
duke@435	2738	Address field(rax, rbx, Address::times_1);
duke@435	2739
duke@435	2740	// access field
duke@435	2741	switch (bytecode()) {
duke@435	2742	case Bytecodes::_fast_agetfield:
coleenp@548	2743	__ load_heap_oop(rax, field);
duke@435	2744	__ verify_oop(rax);
duke@435	2745	break;
duke@435	2746	case Bytecodes::_fast_lgetfield:
duke@435	2747	__ movq(rax, field);
duke@435	2748	break;
duke@435	2749	case Bytecodes::_fast_igetfield:
duke@435	2750	__ movl(rax, field);
duke@435	2751	break;
duke@435	2752	case Bytecodes::_fast_bgetfield:
duke@435	2753	__ movsbl(rax, field);
duke@435	2754	break;
duke@435	2755	case Bytecodes::_fast_sgetfield:
jrose@1057	2756	__ load_signed_short(rax, field);
duke@435	2757	break;
duke@435	2758	case Bytecodes::_fast_cgetfield:
jrose@1057	2759	__ load_unsigned_short(rax, field);
duke@435	2760	break;
duke@435	2761	case Bytecodes::_fast_fgetfield:
duke@435	2762	__ movflt(xmm0, field);
duke@435	2763	break;
duke@435	2764	case Bytecodes::_fast_dgetfield:
duke@435	2765	__ movdbl(xmm0, field);
duke@435	2766	break;
duke@435	2767	default:
duke@435	2768	ShouldNotReachHere();
duke@435	2769	}
duke@435	2770	// [jk] not needed currently
duke@435	2771	// if (os::is_MP()) {
duke@435	2772	// Label notVolatile;
duke@435	2773	// __ testl(rdx, rdx);
duke@435	2774	// __ jcc(Assembler::zero, notVolatile);
duke@435	2775	// __ membar(Assembler::LoadLoad);
duke@435	2776	// __ bind(notVolatile);
duke@435	2777	//};
duke@435	2778	}
duke@435	2779
duke@435	2780	void TemplateTable::fast_xaccess(TosState state) {
duke@435	2781	transition(vtos, state);
duke@435	2782
duke@435	2783	// get receiver
never@739	2784	__ movptr(rax, aaddress(0));
duke@435	2785	debug_only(__ verify_local_tag(frame::TagReference, 0));
duke@435	2786	// access constant pool cache
duke@435	2787	__ get_cache_and_index_at_bcp(rcx, rdx, 2);
never@739	2788	__ movptr(rbx,
never@739	2789	Address(rcx, rdx, Address::times_8,
never@739	2790	in_bytes(constantPoolCacheOopDesc::base_offset() +
never@739	2791	ConstantPoolCacheEntry::f2_offset())));
duke@435	2792	// make sure exception is reported in correct bcp range (getfield is
duke@435	2793	// next instruction)
never@739	2794	__ increment(r13);
duke@435	2795	__ null_check(rax);
duke@435	2796	switch (state) {
duke@435	2797	case itos:
duke@435	2798	__ movl(rax, Address(rax, rbx, Address::times_1));
duke@435	2799	break;
duke@435	2800	case atos:
coleenp@548	2801	__ load_heap_oop(rax, Address(rax, rbx, Address::times_1));
duke@435	2802	__ verify_oop(rax);
duke@435	2803	break;
duke@435	2804	case ftos:
duke@435	2805	__ movflt(xmm0, Address(rax, rbx, Address::times_1));
duke@435	2806	break;
duke@435	2807	default:
duke@435	2808	ShouldNotReachHere();
duke@435	2809	}
duke@435	2810
duke@435	2811	// [jk] not needed currently
duke@435	2812	// if (os::is_MP()) {
duke@435	2813	// Label notVolatile;
duke@435	2814	// __ movl(rdx, Address(rcx, rdx, Address::times_8,
duke@435	2815	// in_bytes(constantPoolCacheOopDesc::base_offset() +
duke@435	2816	// ConstantPoolCacheEntry::flags_offset())));
duke@435	2817	// __ shrl(rdx, ConstantPoolCacheEntry::volatileField);
duke@435	2818	// __ testl(rdx, 0x1);
duke@435	2819	// __ jcc(Assembler::zero, notVolatile);
duke@435	2820	// __ membar(Assembler::LoadLoad);
duke@435	2821	// __ bind(notVolatile);
duke@435	2822	// }
duke@435	2823
never@739	2824	__ decrement(r13);
duke@435	2825	}
duke@435	2826
duke@435	2827
duke@435	2828
duke@435	2829	//-----------------------------------------------------------------------------
duke@435	2830	// Calls
duke@435	2831
duke@435	2832	void TemplateTable::count_calls(Register method, Register temp) {
duke@435	2833	// implemented elsewhere
duke@435	2834	ShouldNotReachHere();
duke@435	2835	}
duke@435	2836
twisti@1543	2837	void TemplateTable::prepare_invoke(Register method, Register index, int byte_no) {
duke@435	2838	// determine flags
twisti@1543	2839	Bytecodes::Code code = bytecode();
duke@435	2840	const bool is_invokeinterface = code == Bytecodes::_invokeinterface;
twisti@1543	2841	const bool is_invokedynamic = code == Bytecodes::_invokedynamic;
duke@435	2842	const bool is_invokevirtual = code == Bytecodes::_invokevirtual;
duke@435	2843	const bool is_invokespecial = code == Bytecodes::_invokespecial;
twisti@1543	2844	const bool load_receiver = (code != Bytecodes::_invokestatic && code != Bytecodes::_invokedynamic);
duke@435	2845	const bool receiver_null_check = is_invokespecial;
duke@435	2846	const bool save_flags = is_invokeinterface || is_invokevirtual;
duke@435	2847	// setup registers & access constant pool cache
duke@435	2848	const Register recv = rcx;
duke@435	2849	const Register flags = rdx;
duke@435	2850	assert_different_registers(method, index, recv, flags);
duke@435	2851
duke@435	2852	// save 'interpreter return address'
duke@435	2853	__ save_bcp();
duke@435	2854
duke@435	2855	load_invoke_cp_cache_entry(byte_no, method, index, flags, is_invokevirtual);
duke@435	2856
duke@435	2857	// load receiver if needed (note: no return address pushed yet)
duke@435	2858	if (load_receiver) {
duke@435	2859	__ movl(recv, flags);
duke@435	2860	__ andl(recv, 0xFF);
duke@435	2861	if (TaggedStackInterpreter) __ shll(recv, 1); // index*2
twisti@1543	2862	Address recv_addr(rsp, recv, Address::times_8, -Interpreter::expr_offset_in_bytes(1));
twisti@1739	2863	__ movptr(recv, recv_addr);
twisti@1739	2864	__ verify_oop(recv);
duke@435	2865	}
duke@435	2866
duke@435	2867	// do null check if needed
duke@435	2868	if (receiver_null_check) {
duke@435	2869	__ null_check(recv);
duke@435	2870	}
duke@435	2871
duke@435	2872	if (save_flags) {
duke@435	2873	__ movl(r13, flags);
duke@435	2874	}
duke@435	2875
duke@435	2876	// compute return type
duke@435	2877	__ shrl(flags, ConstantPoolCacheEntry::tosBits);
duke@435	2878	// Make sure we don't need to mask flags for tosBits after the above shift
duke@435	2879	ConstantPoolCacheEntry::verify_tosBits();
duke@435	2880	// load return address
duke@435	2881	{
twisti@1543	2882	address table_addr;
twisti@1543	2883	if (is_invokeinterface || is_invokedynamic)
twisti@1543	2884	table_addr = (address)Interpreter::return_5_addrs_by_index_table();
twisti@1543	2885	else
twisti@1543	2886	table_addr = (address)Interpreter::return_3_addrs_by_index_table();
twisti@1543	2887	ExternalAddress table(table_addr);
twisti@1543	2888	__ lea(rscratch1, table);
twisti@1543	2889	__ movptr(flags, Address(rscratch1, flags, Address::times_ptr));
duke@435	2890	}
duke@435	2891
duke@435	2892	// push return address
never@739	2893	__ push(flags);
duke@435	2894
duke@435	2895	// Restore flag field from the constant pool cache, and restore esi
duke@435	2896	// for later null checks. r13 is the bytecode pointer
duke@435	2897	if (save_flags) {
duke@435	2898	__ movl(flags, r13);
duke@435	2899	__ restore_bcp();
duke@435	2900	}
duke@435	2901	}
duke@435	2902
duke@435	2903
duke@435	2904	void TemplateTable::invokevirtual_helper(Register index,
duke@435	2905	Register recv,
duke@435	2906	Register flags) {
duke@435	2907	// Uses temporary registers rax, rdx assert_different_registers(index, recv, rax, rdx);
duke@435	2908
duke@435	2909	// Test for an invoke of a final method
duke@435	2910	Label notFinal;
duke@435	2911	__ movl(rax, flags);
duke@435	2912	__ andl(rax, (1 << ConstantPoolCacheEntry::vfinalMethod));
duke@435	2913	__ jcc(Assembler::zero, notFinal);
duke@435	2914
duke@435	2915	const Register method = index; // method must be rbx
duke@435	2916	assert(method == rbx,
duke@435	2917	"methodOop must be rbx for interpreter calling convention");
duke@435	2918
duke@435	2919	// do the call - the index is actually the method to call
duke@435	2920	__ verify_oop(method);
duke@435	2921
duke@435	2922	// It's final, need a null check here!
duke@435	2923	__ null_check(recv);
duke@435	2924
duke@435	2925	// profile this call
duke@435	2926	__ profile_final_call(rax);
duke@435	2927
duke@435	2928	__ jump_from_interpreted(method, rax);
duke@435	2929
duke@435	2930	__ bind(notFinal);
duke@435	2931
duke@435	2932	// get receiver klass
duke@435	2933	__ null_check(recv, oopDesc::klass_offset_in_bytes());
coleenp@548	2934	__ load_klass(rax, recv);
duke@435	2935
duke@435	2936	__ verify_oop(rax);
duke@435	2937
duke@435	2938	// profile this call
duke@435	2939	__ profile_virtual_call(rax, r14, rdx);
duke@435	2940
duke@435	2941	// get target methodOop & entry point
duke@435	2942	const int base = instanceKlass::vtable_start_offset() * wordSize;
duke@435	2943	assert(vtableEntry::size() * wordSize == 8,
duke@435	2944	"adjust the scaling in the code below");
never@739	2945	__ movptr(method, Address(rax, index,
coleenp@548	2946	Address::times_8,
coleenp@548	2947	base + vtableEntry::method_offset_in_bytes()));
never@739	2948	__ movptr(rdx, Address(method, methodOopDesc::interpreter_entry_offset()));
duke@435	2949	__ jump_from_interpreted(method, rdx);
duke@435	2950	}
duke@435	2951
duke@435	2952
duke@435	2953	void TemplateTable::invokevirtual(int byte_no) {
duke@435	2954	transition(vtos, vtos);
twisti@1543	2955	prepare_invoke(rbx, noreg, byte_no);
duke@435	2956
duke@435	2957	// rbx: index
duke@435	2958	// rcx: receiver
duke@435	2959	// rdx: flags
duke@435	2960
duke@435	2961	invokevirtual_helper(rbx, rcx, rdx);
duke@435	2962	}
duke@435	2963
duke@435	2964
duke@435	2965	void TemplateTable::invokespecial(int byte_no) {
duke@435	2966	transition(vtos, vtos);
twisti@1543	2967	prepare_invoke(rbx, noreg, byte_no);
duke@435	2968	// do the call
duke@435	2969	__ verify_oop(rbx);
duke@435	2970	__ profile_call(rax);
duke@435	2971	__ jump_from_interpreted(rbx, rax);
duke@435	2972	}
duke@435	2973
duke@435	2974
duke@435	2975	void TemplateTable::invokestatic(int byte_no) {
duke@435	2976	transition(vtos, vtos);
twisti@1543	2977	prepare_invoke(rbx, noreg, byte_no);
duke@435	2978	// do the call
duke@435	2979	__ verify_oop(rbx);
duke@435	2980	__ profile_call(rax);
duke@435	2981	__ jump_from_interpreted(rbx, rax);
duke@435	2982	}
duke@435	2983
duke@435	2984	void TemplateTable::fast_invokevfinal(int byte_no) {
duke@435	2985	transition(vtos, vtos);
duke@435	2986	__ stop("fast_invokevfinal not used on amd64");
duke@435	2987	}
duke@435	2988
duke@435	2989	void TemplateTable::invokeinterface(int byte_no) {
duke@435	2990	transition(vtos, vtos);
twisti@1543	2991	prepare_invoke(rax, rbx, byte_no);
duke@435	2992
duke@435	2993	// rax: Interface
duke@435	2994	// rbx: index
duke@435	2995	// rcx: receiver
duke@435	2996	// rdx: flags
duke@435	2997
duke@435	2998	// Special case of invokeinterface called for virtual method of
duke@435	2999	// java.lang.Object. See cpCacheOop.cpp for details.
duke@435	3000	// This code isn't produced by javac, but could be produced by
duke@435	3001	// another compliant java compiler.
duke@435	3002	Label notMethod;
duke@435	3003	__ movl(r14, rdx);
duke@435	3004	__ andl(r14, (1 << ConstantPoolCacheEntry::methodInterface));
duke@435	3005	__ jcc(Assembler::zero, notMethod);
duke@435	3006
duke@435	3007	invokevirtual_helper(rbx, rcx, rdx);
duke@435	3008	__ bind(notMethod);
duke@435	3009
duke@435	3010	// Get receiver klass into rdx - also a null check
duke@435	3011	__ restore_locals(); // restore r14
coleenp@548	3012	__ load_klass(rdx, rcx);
duke@435	3013	__ verify_oop(rdx);
duke@435	3014
duke@435	3015	// profile this call
duke@435	3016	__ profile_virtual_call(rdx, r13, r14);
duke@435	3017
jrose@1058	3018	Label no_such_interface, no_such_method;
jrose@1058	3019
jrose@1058	3020	__ lookup_interface_method(// inputs: rec. class, interface, itable index
jrose@1058	3021	rdx, rax, rbx,
jrose@1058	3022	// outputs: method, scan temp. reg
jrose@1058	3023	rbx, r13,
jrose@1058	3024	no_such_interface);
jrose@1058	3025
jrose@1058	3026	// rbx,: methodOop to call
jrose@1058	3027	// rcx: receiver
jrose@1058	3028	// Check for abstract method error
jrose@1058	3029	// Note: This should be done more efficiently via a throw_abstract_method_error
jrose@1058	3030	// interpreter entry point and a conditional jump to it in case of a null
jrose@1058	3031	// method.
jrose@1058	3032	__ testptr(rbx, rbx);
jrose@1058	3033	__ jcc(Assembler::zero, no_such_method);
jrose@1058	3034
jrose@1058	3035	// do the call
jrose@1058	3036	// rcx: receiver
jrose@1058	3037	// rbx,: methodOop
jrose@1058	3038	__ jump_from_interpreted(rbx, rdx);
jrose@1058	3039	__ should_not_reach_here();
jrose@1058	3040
jrose@1058	3041	// exception handling code follows...
jrose@1058	3042	// note: must restore interpreter registers to canonical
jrose@1058	3043	// state for exception handling to work correctly!
jrose@1058	3044
jrose@1058	3045	__ bind(no_such_method);
duke@435	3046	// throw exception
jrose@1058	3047	__ pop(rbx); // pop return address (pushed by prepare_invoke)
jrose@1058	3048	__ restore_bcp(); // r13 must be correct for exception handler (was destroyed)
jrose@1058	3049	__ restore_locals(); // make sure locals pointer is correct as well (was destroyed)
jrose@1058	3050	__ call_VM(noreg, CAST_FROM_FN_PTR(address, InterpreterRuntime::throw_AbstractMethodError));
jrose@1058	3051	// the call_VM checks for exception, so we should never return here.
jrose@1058	3052	__ should_not_reach_here();
jrose@1058	3053
jrose@1058	3054	__ bind(no_such_interface);
jrose@1058	3055	// throw exception
jrose@1058	3056	__ pop(rbx); // pop return address (pushed by prepare_invoke)
jrose@1058	3057	__ restore_bcp(); // r13 must be correct for exception handler (was destroyed)
jrose@1058	3058	__ restore_locals(); // make sure locals pointer is correct as well (was destroyed)
duke@435	3059	__ call_VM(noreg, CAST_FROM_FN_PTR(address,
duke@435	3060	InterpreterRuntime::throw_IncompatibleClassChangeError));
duke@435	3061	// the call_VM checks for exception, so we should never return here.
duke@435	3062	__ should_not_reach_here();
jrose@1058	3063	return;
duke@435	3064	}
duke@435	3065
jrose@1161	3066	void TemplateTable::invokedynamic(int byte_no) {
jrose@1161	3067	transition(vtos, vtos);
jrose@1161	3068
jrose@1161	3069	if (!EnableInvokeDynamic) {
jrose@1161	3070	// We should not encounter this bytecode if !EnableInvokeDynamic.
jrose@1161	3071	// The verifier will stop it. However, if we get past the verifier,
jrose@1161	3072	// this will stop the thread in a reasonable way, without crashing the JVM.
jrose@1161	3073	__ call_VM(noreg, CAST_FROM_FN_PTR(address,
jrose@1161	3074	InterpreterRuntime::throw_IncompatibleClassChangeError));
jrose@1161	3075	// the call_VM checks for exception, so we should never return here.
jrose@1161	3076	__ should_not_reach_here();
jrose@1161	3077	return;
jrose@1161	3078	}
jrose@1161	3079
twisti@1543	3080	prepare_invoke(rax, rbx, byte_no);
twisti@1543	3081
twisti@1543	3082	// rax: CallSite object (f1)
twisti@1543	3083	// rbx: unused (f2)
twisti@1543	3084	// rcx: receiver address
twisti@1543	3085	// rdx: flags (unused)
twisti@1543	3086
twisti@1543	3087	if (ProfileInterpreter) {
twisti@1543	3088	Label L;
twisti@1543	3089	// %%% should make a type profile for any invokedynamic that takes a ref argument
twisti@1543	3090	// profile this call
twisti@1543	3091	__ profile_call(r13);
twisti@1543	3092	}
twisti@1543	3093
twisti@1543	3094	__ movptr(rcx, Address(rax, __ delayed_value(java_dyn_CallSite::target_offset_in_bytes, rcx)));
twisti@1543	3095	__ null_check(rcx);
twisti@1543	3096	__ prepare_to_jump_from_interpreted();
twisti@1543	3097	__ jump_to_method_handle_entry(rcx, rdx);
jrose@1161	3098	}
jrose@1161	3099
jrose@1058	3100
duke@435	3101	//-----------------------------------------------------------------------------
duke@435	3102	// Allocation
duke@435	3103
duke@435	3104	void TemplateTable::_new() {
duke@435	3105	transition(vtos, atos);
duke@435	3106	__ get_unsigned_2_byte_index_at_bcp(rdx, 1);
duke@435	3107	Label slow_case;
duke@435	3108	Label done;
duke@435	3109	Label initialize_header;
duke@435	3110	Label initialize_object; // including clearing the fields
duke@435	3111	Label allocate_shared;
duke@435	3112
duke@435	3113	__ get_cpool_and_tags(rsi, rax);
duke@435	3114	// get instanceKlass
never@739	3115	__ movptr(rsi, Address(rsi, rdx,
never@739	3116	Address::times_8, sizeof(constantPoolOopDesc)));
duke@435	3117
duke@435	3118	// make sure the class we're about to instantiate has been
duke@435	3119	// resolved. Note: slow_case does a pop of stack, which is why we
duke@435	3120	// loaded class/pushed above
duke@435	3121	const int tags_offset = typeArrayOopDesc::header_size(T_BYTE) * wordSize;
duke@435	3122	__ cmpb(Address(rax, rdx, Address::times_1, tags_offset),
duke@435	3123	JVM_CONSTANT_Class);
duke@435	3124	__ jcc(Assembler::notEqual, slow_case);
duke@435	3125
duke@435	3126	// make sure klass is initialized & doesn't have finalizer
duke@435	3127	// make sure klass is fully initialized
duke@435	3128	__ cmpl(Address(rsi,
duke@435	3129	instanceKlass::init_state_offset_in_bytes() +
duke@435	3130	sizeof(oopDesc)),
duke@435	3131	instanceKlass::fully_initialized);
duke@435	3132	__ jcc(Assembler::notEqual, slow_case);
duke@435	3133
duke@435	3134	// get instance_size in instanceKlass (scaled to a count of bytes)
duke@435	3135	__ movl(rdx,
duke@435	3136	Address(rsi,
duke@435	3137	Klass::layout_helper_offset_in_bytes() + sizeof(oopDesc)));
duke@435	3138	// test to see if it has a finalizer or is malformed in some way
duke@435	3139	__ testl(rdx, Klass::_lh_instance_slow_path_bit);
duke@435	3140	__ jcc(Assembler::notZero, slow_case);
duke@435	3141
duke@435	3142	// Allocate the instance
duke@435	3143	// 1) Try to allocate in the TLAB
duke@435	3144	// 2) if fail and the object is large allocate in the shared Eden
duke@435	3145	// 3) if the above fails (or is not applicable), go to a slow case
duke@435	3146	// (creates a new TLAB, etc.)
duke@435	3147
duke@435	3148	const bool allow_shared_alloc =
duke@435	3149	Universe::heap()->supports_inline_contig_alloc() && !CMSIncrementalMode;
duke@435	3150
duke@435	3151	if (UseTLAB) {
never@739	3152	__ movptr(rax, Address(r15_thread, in_bytes(JavaThread::tlab_top_offset())));
never@739	3153	__ lea(rbx, Address(rax, rdx, Address::times_1));
never@739	3154	__ cmpptr(rbx, Address(r15_thread, in_bytes(JavaThread::tlab_end_offset())));
duke@435	3155	__ jcc(Assembler::above, allow_shared_alloc ? allocate_shared : slow_case);
never@739	3156	__ movptr(Address(r15_thread, in_bytes(JavaThread::tlab_top_offset())), rbx);
duke@435	3157	if (ZeroTLAB) {
duke@435	3158	// the fields have been already cleared
duke@435	3159	__ jmp(initialize_header);
duke@435	3160	} else {
duke@435	3161	// initialize both the header and fields
duke@435	3162	__ jmp(initialize_object);
duke@435	3163	}
duke@435	3164	}
duke@435	3165
duke@435	3166	// Allocation in the shared Eden, if allowed.
duke@435	3167	//
duke@435	3168	// rdx: instance size in bytes
duke@435	3169	if (allow_shared_alloc) {
duke@435	3170	__ bind(allocate_shared);
duke@435	3171
ysr@777	3172	ExternalAddress top((address)Universe::heap()->top_addr());
ysr@777	3173	ExternalAddress end((address)Universe::heap()->end_addr());
ysr@777	3174
duke@435	3175	const Register RtopAddr = rscratch1;
duke@435	3176	const Register RendAddr = rscratch2;
duke@435	3177
duke@435	3178	__ lea(RtopAddr, top);
duke@435	3179	__ lea(RendAddr, end);
never@739	3180	__ movptr(rax, Address(RtopAddr, 0));
duke@435	3181
duke@435	3182	// For retries rax gets set by cmpxchgq
duke@435	3183	Label retry;
duke@435	3184	__ bind(retry);
never@739	3185	__ lea(rbx, Address(rax, rdx, Address::times_1));
never@739	3186	__ cmpptr(rbx, Address(RendAddr, 0));
duke@435	3187	__ jcc(Assembler::above, slow_case);
duke@435	3188
duke@435	3189	// Compare rax with the top addr, and if still equal, store the new
duke@435	3190	// top addr in rbx at the address of the top addr pointer. Sets ZF if was
duke@435	3191	// equal, and clears it otherwise. Use lock prefix for atomicity on MPs.
duke@435	3192	//
duke@435	3193	// rax: object begin
duke@435	3194	// rbx: object end
duke@435	3195	// rdx: instance size in bytes
duke@435	3196	if (os::is_MP()) {
duke@435	3197	__ lock();
duke@435	3198	}
never@739	3199	__ cmpxchgptr(rbx, Address(RtopAddr, 0));
duke@435	3200
duke@435	3201	// if someone beat us on the allocation, try again, otherwise continue
duke@435	3202	__ jcc(Assembler::notEqual, retry);
duke@435	3203	}
duke@435	3204
duke@435	3205	if (UseTLAB || Universe::heap()->supports_inline_contig_alloc()) {
duke@435	3206	// The object is initialized before the header. If the object size is
duke@435	3207	// zero, go directly to the header initialization.
duke@435	3208	__ bind(initialize_object);
duke@435	3209	__ decrementl(rdx, sizeof(oopDesc));
duke@435	3210	__ jcc(Assembler::zero, initialize_header);
duke@435	3211
duke@435	3212	// Initialize object fields
duke@435	3213	__ xorl(rcx, rcx); // use zero reg to clear memory (shorter code)
duke@435	3214	__ shrl(rdx, LogBytesPerLong); // divide by oopSize to simplify the loop
duke@435	3215	{
duke@435	3216	Label loop;
duke@435	3217	__ bind(loop);
duke@435	3218	__ movq(Address(rax, rdx, Address::times_8,
duke@435	3219	sizeof(oopDesc) - oopSize),
duke@435	3220	rcx);
duke@435	3221	__ decrementl(rdx);
duke@435	3222	__ jcc(Assembler::notZero, loop);
duke@435	3223	}
duke@435	3224
duke@435	3225	// initialize object header only.
duke@435	3226	__ bind(initialize_header);
duke@435	3227	if (UseBiasedLocking) {
never@739	3228	__ movptr(rscratch1, Address(rsi, Klass::prototype_header_offset_in_bytes() + klassOopDesc::klass_part_offset_in_bytes()));
never@739	3229	__ movptr(Address(rax, oopDesc::mark_offset_in_bytes()), rscratch1);
duke@435	3230	} else {
duke@435	3231	__ movptr(Address(rax, oopDesc::mark_offset_in_bytes()),
duke@435	3232	(intptr_t) markOopDesc::prototype()); // header (address 0x1)
duke@435	3233	}
coleenp@602	3234	__ xorl(rcx, rcx); // use zero reg to clear memory (shorter code)
coleenp@602	3235	__ store_klass_gap(rax, rcx); // zero klass gap for compressed oops
coleenp@602	3236	__ store_klass(rax, rsi); // store klass last
kamg@1683	3237
kamg@1683	3238	{
kamg@1683	3239	SkipIfEqual skip(_masm, &DTraceAllocProbes, false);
kamg@1683	3240	// Trigger dtrace event for fastpath
kamg@1683	3241	__ push(atos); // save the return value
kamg@1683	3242	__ call_VM_leaf(
kamg@1683	3243	CAST_FROM_FN_PTR(address, SharedRuntime::dtrace_object_alloc), rax);
kamg@1683	3244	__ pop(atos); // restore the return value
kamg@1683	3245
kamg@1683	3246	}
duke@435	3247	__ jmp(done);
duke@435	3248	}
duke@435	3249
duke@435	3250
duke@435	3251	// slow case
duke@435	3252	__ bind(slow_case);
duke@435	3253	__ get_constant_pool(c_rarg1);
duke@435	3254	__ get_unsigned_2_byte_index_at_bcp(c_rarg2, 1);
duke@435	3255	call_VM(rax, CAST_FROM_FN_PTR(address, InterpreterRuntime::_new), c_rarg1, c_rarg2);
duke@435	3256	__ verify_oop(rax);
duke@435	3257
duke@435	3258	// continue
duke@435	3259	__ bind(done);
duke@435	3260	}
duke@435	3261
duke@435	3262	void TemplateTable::newarray() {
duke@435	3263	transition(itos, atos);
duke@435	3264	__ load_unsigned_byte(c_rarg1, at_bcp(1));
duke@435	3265	__ movl(c_rarg2, rax);
duke@435	3266	call_VM(rax, CAST_FROM_FN_PTR(address, InterpreterRuntime::newarray),
duke@435	3267	c_rarg1, c_rarg2);
duke@435	3268	}
duke@435	3269
duke@435	3270	void TemplateTable::anewarray() {
duke@435	3271	transition(itos, atos);
duke@435	3272	__ get_unsigned_2_byte_index_at_bcp(c_rarg2, 1);
duke@435	3273	__ get_constant_pool(c_rarg1);
duke@435	3274	__ movl(c_rarg3, rax);
duke@435	3275	call_VM(rax, CAST_FROM_FN_PTR(address, InterpreterRuntime::anewarray),
duke@435	3276	c_rarg1, c_rarg2, c_rarg3);
duke@435	3277	}
duke@435	3278
duke@435	3279	void TemplateTable::arraylength() {
duke@435	3280	transition(atos, itos);
duke@435	3281	__ null_check(rax, arrayOopDesc::length_offset_in_bytes());
duke@435	3282	__ movl(rax, Address(rax, arrayOopDesc::length_offset_in_bytes()));
duke@435	3283	}
duke@435	3284
duke@435	3285	void TemplateTable::checkcast() {
duke@435	3286	transition(atos, atos);
duke@435	3287	Label done, is_null, ok_is_subtype, quicked, resolved;
never@739	3288	__ testptr(rax, rax); // object is in rax
duke@435	3289	__ jcc(Assembler::zero, is_null);
duke@435	3290
duke@435	3291	// Get cpool & tags index
duke@435	3292	__ get_cpool_and_tags(rcx, rdx); // rcx=cpool, rdx=tags array
duke@435	3293	__ get_unsigned_2_byte_index_at_bcp(rbx, 1); // rbx=index
duke@435	3294	// See if bytecode has already been quicked
duke@435	3295	__ cmpb(Address(rdx, rbx,
duke@435	3296	Address::times_1,
duke@435	3297	typeArrayOopDesc::header_size(T_BYTE) * wordSize),
duke@435	3298	JVM_CONSTANT_Class);
duke@435	3299	__ jcc(Assembler::equal, quicked);
coleenp@548	3300	__ push(atos); // save receiver for result, and for GC
never@739	3301	__ mov(r12, rcx); // save rcx XXX
duke@435	3302	call_VM(rax, CAST_FROM_FN_PTR(address, InterpreterRuntime::quicken_io_cc));
coleenp@548	3303	__ movq(rcx, r12); // restore rcx XXX
coleenp@548	3304	__ reinit_heapbase();
duke@435	3305	__ pop_ptr(rdx); // restore receiver
duke@435	3306	__ jmpb(resolved);
duke@435	3307
duke@435	3308	// Get superklass in rax and subklass in rbx
duke@435	3309	__ bind(quicked);
never@739	3310	__ mov(rdx, rax); // Save object in rdx; rax needed for subtype check
never@739	3311	__ movptr(rax, Address(rcx, rbx,
duke@435	3312	Address::times_8, sizeof(constantPoolOopDesc)));
duke@435	3313
duke@435	3314	__ bind(resolved);
coleenp@548	3315	__ load_klass(rbx, rdx);
duke@435	3316
duke@435	3317	// Generate subtype check. Blows rcx, rdi. Object in rdx.
duke@435	3318	// Superklass in rax. Subklass in rbx.
duke@435	3319	__ gen_subtype_check(rbx, ok_is_subtype);
duke@435	3320
duke@435	3321	// Come here on failure
duke@435	3322	__ push_ptr(rdx);
duke@435	3323	// object is at TOS
duke@435	3324	__ jump(ExternalAddress(Interpreter::_throw_ClassCastException_entry));
duke@435	3325
duke@435	3326	// Come here on success
duke@435	3327	__ bind(ok_is_subtype);
never@739	3328	__ mov(rax, rdx); // Restore object in rdx
duke@435	3329
duke@435	3330	// Collect counts on whether this check-cast sees NULLs a lot or not.
duke@435	3331	if (ProfileInterpreter) {
duke@435	3332	__ jmp(done);
duke@435	3333	__ bind(is_null);
duke@435	3334	__ profile_null_seen(rcx);
duke@435	3335	} else {
duke@435	3336	__ bind(is_null); // same as 'done'
duke@435	3337	}
duke@435	3338	__ bind(done);
duke@435	3339	}
duke@435	3340
duke@435	3341	void TemplateTable::instanceof() {
duke@435	3342	transition(atos, itos);
duke@435	3343	Label done, is_null, ok_is_subtype, quicked, resolved;
never@739	3344	__ testptr(rax, rax);
duke@435	3345	__ jcc(Assembler::zero, is_null);
duke@435	3346
duke@435	3347	// Get cpool & tags index
duke@435	3348	__ get_cpool_and_tags(rcx, rdx); // rcx=cpool, rdx=tags array
duke@435	3349	__ get_unsigned_2_byte_index_at_bcp(rbx, 1); // rbx=index
duke@435	3350	// See if bytecode has already been quicked
duke@435	3351	__ cmpb(Address(rdx, rbx,
duke@435	3352	Address::times_1,
duke@435	3353	typeArrayOopDesc::header_size(T_BYTE) * wordSize),
duke@435	3354	JVM_CONSTANT_Class);
duke@435	3355	__ jcc(Assembler::equal, quicked);
duke@435	3356
coleenp@548	3357	__ push(atos); // save receiver for result, and for GC
never@739	3358	__ mov(r12, rcx); // save rcx
duke@435	3359	call_VM(rax, CAST_FROM_FN_PTR(address, InterpreterRuntime::quicken_io_cc));
coleenp@548	3360	__ movq(rcx, r12); // restore rcx
coleenp@548	3361	__ reinit_heapbase();
duke@435	3362	__ pop_ptr(rdx); // restore receiver
coleenp@548	3363	__ load_klass(rdx, rdx);
duke@435	3364	__ jmpb(resolved);
duke@435	3365
duke@435	3366	// Get superklass in rax and subklass in rdx
duke@435	3367	__ bind(quicked);
coleenp@548	3368	__ load_klass(rdx, rax);
never@739	3369	__ movptr(rax, Address(rcx, rbx,
never@739	3370	Address::times_8, sizeof(constantPoolOopDesc)));
duke@435	3371
duke@435	3372	__ bind(resolved);
duke@435	3373
duke@435	3374	// Generate subtype check. Blows rcx, rdi
duke@435	3375	// Superklass in rax. Subklass in rdx.
duke@435	3376	__ gen_subtype_check(rdx, ok_is_subtype);
duke@435	3377
duke@435	3378	// Come here on failure
duke@435	3379	__ xorl(rax, rax);
duke@435	3380	__ jmpb(done);
duke@435	3381	// Come here on success
duke@435	3382	__ bind(ok_is_subtype);
duke@435	3383	__ movl(rax, 1);
duke@435	3384
duke@435	3385	// Collect counts on whether this test sees NULLs a lot or not.
duke@435	3386	if (ProfileInterpreter) {
duke@435	3387	__ jmp(done);
duke@435	3388	__ bind(is_null);
duke@435	3389	__ profile_null_seen(rcx);
duke@435	3390	} else {
duke@435	3391	__ bind(is_null); // same as 'done'
duke@435	3392	}
duke@435	3393	__ bind(done);
duke@435	3394	// rax = 0: obj == NULL or obj is not an instanceof the specified klass
duke@435	3395	// rax = 1: obj != NULL and obj is an instanceof the specified klass
duke@435	3396	}
duke@435	3397
duke@435	3398	//-----------------------------------------------------------------------------
duke@435	3399	// Breakpoints
duke@435	3400	void TemplateTable::_breakpoint() {
duke@435	3401	// Note: We get here even if we are single stepping..
duke@435	3402	// jbug inists on setting breakpoints at every bytecode
duke@435	3403	// even if we are in single step mode.
duke@435	3404
duke@435	3405	transition(vtos, vtos);
duke@435	3406
duke@435	3407	// get the unpatched byte code
duke@435	3408	__ get_method(c_rarg1);
duke@435	3409	__ call_VM(noreg,
duke@435	3410	CAST_FROM_FN_PTR(address,
duke@435	3411	InterpreterRuntime::get_original_bytecode_at),
duke@435	3412	c_rarg1, r13);
never@739	3413	__ mov(rbx, rax);
duke@435	3414
duke@435	3415	// post the breakpoint event
duke@435	3416	__ get_method(c_rarg1);
duke@435	3417	__ call_VM(noreg,
duke@435	3418	CAST_FROM_FN_PTR(address, InterpreterRuntime::_breakpoint),
duke@435	3419	c_rarg1, r13);
duke@435	3420
duke@435	3421	// complete the execution of original bytecode
duke@435	3422	__ dispatch_only_normal(vtos);
duke@435	3423	}
duke@435	3424
duke@435	3425	//-----------------------------------------------------------------------------
duke@435	3426	// Exceptions
duke@435	3427
duke@435	3428	void TemplateTable::athrow() {
duke@435	3429	transition(atos, vtos);
duke@435	3430	__ null_check(rax);
duke@435	3431	__ jump(ExternalAddress(Interpreter::throw_exception_entry()));
duke@435	3432	}
duke@435	3433
duke@435	3434	//-----------------------------------------------------------------------------
duke@435	3435	// Synchronization
duke@435	3436	//
duke@435	3437	// Note: monitorenter & exit are symmetric routines; which is reflected
duke@435	3438	// in the assembly code structure as well
duke@435	3439	//
duke@435	3440	// Stack layout:
duke@435	3441	//
duke@435	3442	// [expressions ] <--- rsp = expression stack top
duke@435	3443	// ..
duke@435	3444	// [expressions ]
duke@435	3445	// [monitor entry] <--- monitor block top = expression stack bot
duke@435	3446	// ..
duke@435	3447	// [monitor entry]
duke@435	3448	// [frame data ] <--- monitor block bot
duke@435	3449	// ...
duke@435	3450	// [saved rbp ] <--- rbp
duke@435	3451	void TemplateTable::monitorenter() {
duke@435	3452	transition(atos, vtos);
duke@435	3453
duke@435	3454	// check for NULL object
duke@435	3455	__ null_check(rax);
duke@435	3456
duke@435	3457	const Address monitor_block_top(
duke@435	3458	rbp, frame::interpreter_frame_monitor_block_top_offset * wordSize);
duke@435	3459	const Address monitor_block_bot(
duke@435	3460	rbp, frame::interpreter_frame_initial_sp_offset * wordSize);
duke@435	3461	const int entry_size = frame::interpreter_frame_monitor_size() * wordSize;
duke@435	3462
duke@435	3463	Label allocated;
duke@435	3464
duke@435	3465	// initialize entry pointer
duke@435	3466	__ xorl(c_rarg1, c_rarg1); // points to free slot or NULL
duke@435	3467
duke@435	3468	// find a free slot in the monitor block (result in c_rarg1)
duke@435	3469	{
duke@435	3470	Label entry, loop, exit;
never@739	3471	__ movptr(c_rarg3, monitor_block_top); // points to current entry,
duke@435	3472	// starting with top-most entry
never@739	3473	__ lea(c_rarg2, monitor_block_bot); // points to word before bottom
duke@435	3474	// of monitor block
duke@435	3475	__ jmpb(entry);
duke@435	3476
duke@435	3477	__ bind(loop);
duke@435	3478	// check if current entry is used
never@739	3479	__ cmpptr(Address(c_rarg3, BasicObjectLock::obj_offset_in_bytes()), (int32_t) NULL_WORD);
duke@435	3480	// if not used then remember entry in c_rarg1
never@739	3481	__ cmov(Assembler::equal, c_rarg1, c_rarg3);
duke@435	3482	// check if current entry is for same object
never@739	3483	__ cmpptr(rax, Address(c_rarg3, BasicObjectLock::obj_offset_in_bytes()));
duke@435	3484	// if same object then stop searching
duke@435	3485	__ jccb(Assembler::equal, exit);
duke@435	3486	// otherwise advance to next entry
never@739	3487	__ addptr(c_rarg3, entry_size);
duke@435	3488	__ bind(entry);
duke@435	3489	// check if bottom reached
never@739	3490	__ cmpptr(c_rarg3, c_rarg2);
duke@435	3491	// if not at bottom then check this entry
duke@435	3492	__ jcc(Assembler::notEqual, loop);
duke@435	3493	__ bind(exit);
duke@435	3494	}
duke@435	3495
never@739	3496	__ testptr(c_rarg1, c_rarg1); // check if a slot has been found
duke@435	3497	__ jcc(Assembler::notZero, allocated); // if found, continue with that one
duke@435	3498
duke@435	3499	// allocate one if there's no free slot
duke@435	3500	{
duke@435	3501	Label entry, loop;
never@739	3502	// 1. compute new pointers // rsp: old expression stack top
never@739	3503	__ movptr(c_rarg1, monitor_block_bot); // c_rarg1: old expression stack bottom
never@739	3504	__ subptr(rsp, entry_size); // move expression stack top
never@739	3505	__ subptr(c_rarg1, entry_size); // move expression stack bottom
never@739	3506	__ mov(c_rarg3, rsp); // set start value for copy loop
never@739	3507	__ movptr(monitor_block_bot, c_rarg1); // set new monitor block bottom
duke@435	3508	__ jmp(entry);
duke@435	3509	// 2. move expression stack contents
duke@435	3510	__ bind(loop);
never@739	3511	__ movptr(c_rarg2, Address(c_rarg3, entry_size)); // load expression stack
never@739	3512	// word from old location
never@739	3513	__ movptr(Address(c_rarg3, 0), c_rarg2); // and store it at new location
never@739	3514	__ addptr(c_rarg3, wordSize); // advance to next word
duke@435	3515	__ bind(entry);
never@739	3516	__ cmpptr(c_rarg3, c_rarg1); // check if bottom reached
duke@435	3517	__ jcc(Assembler::notEqual, loop); // if not at bottom then
duke@435	3518	// copy next word
duke@435	3519	}
duke@435	3520
duke@435	3521	// call run-time routine
duke@435	3522	// c_rarg1: points to monitor entry
duke@435	3523	__ bind(allocated);
duke@435	3524
duke@435	3525	// Increment bcp to point to the next bytecode, so exception
duke@435	3526	// handling for async. exceptions work correctly.
duke@435	3527	// The object has already been poped from the stack, so the
duke@435	3528	// expression stack looks correct.
never@739	3529	__ increment(r13);
duke@435	3530
duke@435	3531	// store object
never@739	3532	__ movptr(Address(c_rarg1, BasicObjectLock::obj_offset_in_bytes()), rax);
duke@435	3533	__ lock_object(c_rarg1);
duke@435	3534
duke@435	3535	// check to make sure this monitor doesn't cause stack overflow after locking
duke@435	3536	__ save_bcp(); // in case of exception
duke@435	3537	__ generate_stack_overflow_check(0);
duke@435	3538
duke@435	3539	// The bcp has already been incremented. Just need to dispatch to
duke@435	3540	// next instruction.
duke@435	3541	__ dispatch_next(vtos);
duke@435	3542	}
duke@435	3543
duke@435	3544
duke@435	3545	void TemplateTable::monitorexit() {
duke@435	3546	transition(atos, vtos);
duke@435	3547
duke@435	3548	// check for NULL object
duke@435	3549	__ null_check(rax);
duke@435	3550
duke@435	3551	const Address monitor_block_top(
duke@435	3552	rbp, frame::interpreter_frame_monitor_block_top_offset * wordSize);
duke@435	3553	const Address monitor_block_bot(
duke@435	3554	rbp, frame::interpreter_frame_initial_sp_offset * wordSize);
duke@435	3555	const int entry_size = frame::interpreter_frame_monitor_size() * wordSize;
duke@435	3556
duke@435	3557	Label found;
duke@435	3558
duke@435	3559	// find matching slot
duke@435	3560	{
duke@435	3561	Label entry, loop;
never@739	3562	__ movptr(c_rarg1, monitor_block_top); // points to current entry,
duke@435	3563	// starting with top-most entry
never@739	3564	__ lea(c_rarg2, monitor_block_bot); // points to word before bottom
duke@435	3565	// of monitor block
duke@435	3566	__ jmpb(entry);
duke@435	3567
duke@435	3568	__ bind(loop);
duke@435	3569	// check if current entry is for same object
never@739	3570	__ cmpptr(rax, Address(c_rarg1, BasicObjectLock::obj_offset_in_bytes()));
duke@435	3571	// if same object then stop searching
duke@435	3572	__ jcc(Assembler::equal, found);
duke@435	3573	// otherwise advance to next entry
never@739	3574	__ addptr(c_rarg1, entry_size);
duke@435	3575	__ bind(entry);
duke@435	3576	// check if bottom reached
never@739	3577	__ cmpptr(c_rarg1, c_rarg2);
duke@435	3578	// if not at bottom then check this entry
duke@435	3579	__ jcc(Assembler::notEqual, loop);
duke@435	3580	}
duke@435	3581
duke@435	3582	// error handling. Unlocking was not block-structured
duke@435	3583	__ call_VM(noreg, CAST_FROM_FN_PTR(address,
duke@435	3584	InterpreterRuntime::throw_illegal_monitor_state_exception));
duke@435	3585	__ should_not_reach_here();
duke@435	3586
duke@435	3587	// call run-time routine
duke@435	3588	// rsi: points to monitor entry
duke@435	3589	__ bind(found);
duke@435	3590	__ push_ptr(rax); // make sure object is on stack (contract with oopMaps)
duke@435	3591	__ unlock_object(c_rarg1);
duke@435	3592	__ pop_ptr(rax); // discard object
duke@435	3593	}
duke@435	3594
duke@435	3595
duke@435	3596	// Wide instructions
duke@435	3597	void TemplateTable::wide() {
duke@435	3598	transition(vtos, vtos);
duke@435	3599	__ load_unsigned_byte(rbx, at_bcp(1));
duke@435	3600	__ lea(rscratch1, ExternalAddress((address)Interpreter::_wentry_point));
duke@435	3601	__ jmp(Address(rscratch1, rbx, Address::times_8));
duke@435	3602	// Note: the r13 increment step is part of the individual wide
duke@435	3603	// bytecode implementations
duke@435	3604	}
duke@435	3605
duke@435	3606
duke@435	3607	// Multi arrays
duke@435	3608	void TemplateTable::multianewarray() {
duke@435	3609	transition(vtos, atos);
duke@435	3610	__ load_unsigned_byte(rax, at_bcp(3)); // get number of dimensions
duke@435	3611	// last dim is on top of stack; we want address of first one:
duke@435	3612	// first_addr = last_addr + (ndims - 1) * wordSize
duke@435	3613	if (TaggedStackInterpreter) __ shll(rax, 1); // index*2
never@739	3614	__ lea(c_rarg1, Address(rsp, rax, Address::times_8, -wordSize));
duke@435	3615	call_VM(rax,
duke@435	3616	CAST_FROM_FN_PTR(address, InterpreterRuntime::multianewarray),
duke@435	3617	c_rarg1);
duke@435	3618	__ load_unsigned_byte(rbx, at_bcp(3));
duke@435	3619	if (TaggedStackInterpreter) __ shll(rbx, 1); // index*2
never@739	3620	__ lea(rsp, Address(rsp, rbx, Address::times_8));
duke@435	3621	}
never@739	3622	#endif // !CC_INTERP