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

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

src/cpu/x86/vm/templateTable_x86_64.cpp

Fri, 27 Feb 2009 13:27:09 -0800

author

twisti

date

Fri, 27 Feb 2009 13:27:09 -0800

changeset 1040

98cb887364d3

parent 797

f8199438385b

child 1057

56aae7be60d4

permissions

-rw-r--r--

6810672: Comment typos
Summary: I have collected some typos I have found while looking at the code.
Reviewed-by: kvn, never

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