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

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

src/cpu/x86/vm/templateTable_x86_64.cpp

Sun, 13 Apr 2008 17:43:42 -0400

author

coleenp

date

Sun, 13 Apr 2008 17:43:42 -0400

changeset 548

ba764ed4b6f2

parent 435

a61af66fc99e

child 602

feeb96a45707

child 777

37f87013dfd8

permissions

-rw-r--r--

6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
Summary: Compressed oops in instances, arrays, and headers. Code contributors are coleenp, phh, never, swamyv
Reviewed-by: jmasa, kamg, acorn, tbell, kvn, rasbold

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