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

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

src/cpu/x86/vm/templateTable_x86_64.cpp

Thu, 21 Aug 2008 23:36:31 -0400

author

tonyp

date

Thu, 21 Aug 2008 23:36:31 -0400

changeset 791

1ee8caae33af

parent 779

6aae2f9d0294

parent 631

d1605aabd0a1

child 797

f8199438385b

permissions

-rw-r--r--

Merge

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