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

src/cpu/x86/vm/templateTable_x86_32.cpp@dc7f315e41f7 (annotated)

src/cpu/x86/vm/templateTable_x86_32.cpp

Wed, 27 Aug 2008 00:21:55 -0700

author

never

date

Wed, 27 Aug 2008 00:21:55 -0700

changeset 739

dc7f315e41f7

parent 631

d1605aabd0a1

child 797

f8199438385b

permissions

-rw-r--r--

5108146: Merge i486 and amd64 cpu directories
6459804: Want client (c1) compiler for x86_64 (amd64) for faster start-up
Reviewed-by: kvn

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