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

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

src/cpu/x86/vm/templateTable_x86_32.cpp

Tue, 08 Apr 2008 12:23:15 -0400

author

sgoldman

date

Tue, 08 Apr 2008 12:23:15 -0400

changeset 542

93b6525e3b82

parent 435

a61af66fc99e

child 631

d1605aabd0a1

child 777

37f87013dfd8

permissions

-rw-r--r--

6603919: Stackwalking crash on x86 -server with Sun Studio's collect -j on
Summary: Rewrite frame::safe_for_sender and friends to be safe for collector/analyzer
Reviewed-by: dcubed, kvn

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