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

src/cpu/x86/vm/methodHandles_x86.cpp@6ae7a1561b53 (annotated)

src/cpu/x86/vm/methodHandles_x86.cpp

Tue, 28 Jun 2011 15:04:39 -0700

author

kvn

date

Tue, 28 Jun 2011 15:04:39 -0700

changeset 2984

6ae7a1561b53

parent 2978

d83ac25d0304

child 3005

341a57af9b0a

permissions

-rw-r--r--

6990015: Incorrect Icache line size is used for 64 bit x86
Summary: correct Icache::line_size for x64 and add verification code into vm_version_x86.
Reviewed-by: never, phh

jrose@1145	1	/*
twisti@2436	2	* Copyright (c) 1997, 2011, Oracle and/or its affiliates. All rights reserved.
jrose@1145	3	* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
jrose@1145	4	*
jrose@1145	5	* This code is free software; you can redistribute it and/or modify it
jrose@1145	6	* under the terms of the GNU General Public License version 2 only, as
jrose@1145	7	* published by the Free Software Foundation.
jrose@1145	8	*
jrose@1145	9	* This code is distributed in the hope that it will be useful, but WITHOUT
jrose@1145	10	* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
jrose@1145	11	* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
jrose@1145	12	* version 2 for more details (a copy is included in the LICENSE file that
jrose@1145	13	* accompanied this code).
jrose@1145	14	*
jrose@1145	15	* You should have received a copy of the GNU General Public License version
jrose@1145	16	* 2 along with this work; if not, write to the Free Software Foundation,
jrose@1145	17	* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
jrose@1145	18	*
trims@1907	19	* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
trims@1907	20	* or visit www.oracle.com if you need additional information or have any
trims@1907	21	* questions.
jrose@1145	22	*
jrose@1145	23	*/
jrose@1145	24
stefank@2314	25	#include "precompiled.hpp"
stefank@2314	26	#include "interpreter/interpreter.hpp"
jrose@2952	27	#include "interpreter/interpreterRuntime.hpp"
stefank@2314	28	#include "memory/allocation.inline.hpp"
stefank@2314	29	#include "prims/methodHandles.hpp"
jrose@1145	30
jrose@1145	31	#define __ _masm->
jrose@1145	32
jrose@2148	33	#ifdef PRODUCT
jrose@2148	34	#define BLOCK_COMMENT(str) /* nothing */
jrose@2148	35	#else
jrose@2148	36	#define BLOCK_COMMENT(str) __ block_comment(str)
jrose@2148	37	#endif
jrose@2148	38
jrose@2148	39	#define BIND(label) bind(label); BLOCK_COMMENT(#label ":")
jrose@2148	40
jrose@2952	41	// Workaround for C++ overloading nastiness on '0' for RegisterOrConstant.
jrose@2952	42	static RegisterOrConstant constant(int value) {
jrose@2952	43	return RegisterOrConstant(value);
jrose@2952	44	}
jrose@2952	45
jrose@1145	46	address MethodHandleEntry::start_compiled_entry(MacroAssembler* _masm,
jrose@1145	47	address interpreted_entry) {
jrose@1145	48	// Just before the actual machine code entry point, allocate space
jrose@1145	49	// for a MethodHandleEntry::Data record, so that we can manage everything
jrose@1145	50	// from one base pointer.
jrose@1145	51	__ align(wordSize);
jrose@1145	52	address target = __ pc() + sizeof(Data);
jrose@1145	53	while (__ pc() < target) {
jrose@1145	54	__ nop();
jrose@1145	55	__ align(wordSize);
jrose@1145	56	}
jrose@1145	57
jrose@1145	58	MethodHandleEntry* me = (MethodHandleEntry*) __ pc();
jrose@1145	59	me->set_end_address(__ pc()); // set a temporary end_address
jrose@1145	60	me->set_from_interpreted_entry(interpreted_entry);
jrose@1145	61	me->set_type_checking_entry(NULL);
jrose@1145	62
jrose@1145	63	return (address) me;
jrose@1145	64	}
jrose@1145	65
jrose@1145	66	MethodHandleEntry* MethodHandleEntry::finish_compiled_entry(MacroAssembler* _masm,
jrose@1145	67	address start_addr) {
jrose@1145	68	MethodHandleEntry* me = (MethodHandleEntry*) start_addr;
jrose@1145	69	assert(me->end_address() == start_addr, "valid ME");
jrose@1145	70
jrose@1145	71	// Fill in the real end_address:
jrose@1145	72	__ align(wordSize);
jrose@1145	73	me->set_end_address(__ pc());
jrose@1145	74
jrose@1145	75	return me;
jrose@1145	76	}
jrose@1145	77
never@2895	78	// stack walking support
never@2895	79
never@2895	80	frame MethodHandles::ricochet_frame_sender(const frame& fr, RegisterMap *map) {
never@2895	81	RicochetFrame* f = RicochetFrame::from_frame(fr);
never@2895	82	if (map->update_map())
never@2895	83	frame::update_map_with_saved_link(map, &f->_sender_link);
never@2895	84	return frame(f->extended_sender_sp(), f->exact_sender_sp(), f->sender_link(), f->sender_pc());
never@2895	85	}
never@2895	86
never@2895	87	void MethodHandles::ricochet_frame_oops_do(const frame& fr, OopClosure* blk, const RegisterMap* reg_map) {
never@2895	88	RicochetFrame* f = RicochetFrame::from_frame(fr);
never@2895	89
never@2895	90	// pick up the argument type descriptor:
never@2895	91	Thread* thread = Thread::current();
never@2895	92	Handle cookie(thread, f->compute_saved_args_layout(true, true));
never@2895	93
never@2895	94	// process fixed part
never@2895	95	blk->do_oop((oop*)f->saved_target_addr());
never@2895	96	blk->do_oop((oop*)f->saved_args_layout_addr());
never@2895	97
never@2895	98	// process variable arguments:
never@2895	99	if (cookie.is_null()) return; // no arguments to describe
never@2895	100
never@2895	101	// the cookie is actually the invokeExact method for my target
never@2895	102	// his argument signature is what I'm interested in
never@2895	103	assert(cookie->is_method(), "");
never@2895	104	methodHandle invoker(thread, methodOop(cookie()));
never@2895	105	assert(invoker->name() == vmSymbols::invokeExact_name(), "must be this kind of method");
never@2895	106	assert(!invoker->is_static(), "must have MH argument");
never@2895	107	int slot_count = invoker->size_of_parameters();
never@2895	108	assert(slot_count >= 1, "must include 'this'");
never@2895	109	intptr_t* base = f->saved_args_base();
never@2895	110	intptr_t* retval = NULL;
never@2895	111	if (f->has_return_value_slot())
never@2895	112	retval = f->return_value_slot_addr();
never@2895	113	int slot_num = slot_count;
never@2895	114	intptr_t* loc = &base[slot_num -= 1];
never@2895	115	//blk->do_oop((oop*) loc); // original target, which is irrelevant
never@2895	116	int arg_num = 0;
never@2895	117	for (SignatureStream ss(invoker->signature()); !ss.is_done(); ss.next()) {
never@2895	118	if (ss.at_return_type()) continue;
never@2895	119	BasicType ptype = ss.type();
never@2895	120	if (ptype == T_ARRAY) ptype = T_OBJECT; // fold all refs to T_OBJECT
never@2895	121	assert(ptype >= T_BOOLEAN && ptype <= T_OBJECT, "not array or void");
never@2895	122	loc = &base[slot_num -= type2size[ptype]];
never@2895	123	bool is_oop = (ptype == T_OBJECT && loc != retval);
never@2895	124	if (is_oop) blk->do_oop((oop*)loc);
never@2895	125	arg_num += 1;
never@2895	126	}
never@2895	127	assert(slot_num == 0, "must have processed all the arguments");
never@2895	128	}
never@2895	129
never@2895	130	oop MethodHandles::RicochetFrame::compute_saved_args_layout(bool read_cache, bool write_cache) {
never@2895	131	oop cookie = NULL;
never@2895	132	if (read_cache) {
never@2895	133	cookie = saved_args_layout();
never@2895	134	if (cookie != NULL) return cookie;
never@2895	135	}
never@2895	136	oop target = saved_target();
never@2895	137	oop mtype = java_lang_invoke_MethodHandle::type(target);
never@2895	138	oop mtform = java_lang_invoke_MethodType::form(mtype);
never@2895	139	cookie = java_lang_invoke_MethodTypeForm::vmlayout(mtform);
never@2895	140	if (write_cache) {
never@2895	141	(*saved_args_layout_addr()) = cookie;
never@2895	142	}
never@2895	143	return cookie;
never@2895	144	}
never@2895	145
never@2895	146	void MethodHandles::RicochetFrame::generate_ricochet_blob(MacroAssembler* _masm,
never@2895	147	// output params:
never@2895	148	int* bounce_offset,
never@2950	149	int* exception_offset,
never@2950	150	int* frame_size_in_words) {
never@2895	151	(*frame_size_in_words) = RicochetFrame::frame_size_in_bytes() / wordSize;
never@2895	152
never@2895	153	address start = __ pc();
never@2895	154
jrose@1145	155	#ifdef ASSERT
never@2895	156	__ hlt(); __ hlt(); __ hlt();
never@2895	157	// here's a hint of something special:
never@2895	158	__ push(MAGIC_NUMBER_1);
never@2895	159	__ push(MAGIC_NUMBER_2);
never@2895	160	#endif //ASSERT
never@2895	161	__ hlt(); // not reached
never@2895	162
never@2895	163	// A return PC has just been popped from the stack.
never@2895	164	// Return values are in registers.
never@2895	165	// The ebp points into the RicochetFrame, which contains
never@2895	166	// a cleanup continuation we must return to.
never@2895	167
never@2895	168	(*bounce_offset) = __ pc() - start;
never@2895	169	BLOCK_COMMENT("ricochet_blob.bounce");
never@2895	170
never@2895	171	if (VerifyMethodHandles) RicochetFrame::verify_clean(_masm);
twisti@2903	172	trace_method_handle(_masm, "return/ricochet_blob.bounce");
never@2895	173
never@2895	174	__ jmp(frame_address(continuation_offset_in_bytes()));
never@2895	175	__ hlt();
never@2895	176	DEBUG_ONLY(__ push(MAGIC_NUMBER_2));
never@2895	177
never@2895	178	(*exception_offset) = __ pc() - start;
never@2895	179	BLOCK_COMMENT("ricochet_blob.exception");
never@2895	180
never@2895	181	// compare this to Interpreter::rethrow_exception_entry, which is parallel code
never@2895	182	// for example, see TemplateInterpreterGenerator::generate_throw_exception
never@2895	183	// Live registers in:
never@2895	184	// rax: exception
never@2895	185	// rdx: return address/pc that threw exception (ignored, always equal to bounce addr)
never@2895	186	__ verify_oop(rax);
never@2895	187
never@2895	188	// no need to empty_FPU_stack or reinit_heapbase, since caller frame will do the same if needed
never@2895	189
never@2895	190	// Take down the frame.
never@2895	191
never@2895	192	// Cf. InterpreterMacroAssembler::remove_activation.
never@2895	193	leave_ricochet_frame(_masm, /*rcx_recv=*/ noreg,
never@2895	194	saved_last_sp_register(),
never@2895	195	/*sender_pc_reg=*/ rdx);
never@2895	196
never@2895	197	// In between activations - previous activation type unknown yet
never@2895	198	// compute continuation point - the continuation point expects the
never@2895	199	// following registers set up:
never@2895	200	//
never@2895	201	// rax: exception
never@2895	202	// rdx: return address/pc that threw exception
never@2895	203	// rsp: expression stack of caller
never@2895	204	// rbp: ebp of caller
never@2895	205	__ push(rax); // save exception
never@2895	206	__ push(rdx); // save return address
never@2895	207	Register thread_reg = LP64_ONLY(r15_thread) NOT_LP64(rdi);
never@2895	208	NOT_LP64(__ get_thread(thread_reg));
never@2895	209	__ call_VM_leaf(CAST_FROM_FN_PTR(address,
never@2895	210	SharedRuntime::exception_handler_for_return_address),
never@2895	211	thread_reg, rdx);
never@2895	212	__ mov(rbx, rax); // save exception handler
never@2895	213	__ pop(rdx); // restore return address
never@2895	214	__ pop(rax); // restore exception
never@2895	215	__ jmp(rbx); // jump to exception
never@2895	216	// handler of caller
never@2895	217	}
never@2895	218
never@2895	219	void MethodHandles::RicochetFrame::enter_ricochet_frame(MacroAssembler* _masm,
never@2895	220	Register rcx_recv,
never@2895	221	Register rax_argv,
never@2895	222	address return_handler,
never@2895	223	Register rbx_temp) {
never@2895	224	const Register saved_last_sp = saved_last_sp_register();
never@2895	225	Address rcx_mh_vmtarget( rcx_recv, java_lang_invoke_MethodHandle::vmtarget_offset_in_bytes() );
never@2895	226	Address rcx_amh_conversion( rcx_recv, java_lang_invoke_AdapterMethodHandle::conversion_offset_in_bytes() );
never@2895	227
never@2895	228	// Push the RicochetFrame a word at a time.
never@2895	229	// This creates something similar to an interpreter frame.
never@2895	230	// Cf. TemplateInterpreterGenerator::generate_fixed_frame.
never@2895	231	BLOCK_COMMENT("push RicochetFrame {");
never@2895	232	DEBUG_ONLY(int rfo = (int) sizeof(RicochetFrame));
never@2895	233	assert((rfo -= wordSize) == RicochetFrame::sender_pc_offset_in_bytes(), "");
never@2895	234	#define RF_FIELD(push_value, name) \
never@2895	235	{ push_value; \
never@2895	236	assert((rfo -= wordSize) == RicochetFrame::name##_offset_in_bytes(), ""); }
never@2895	237	RF_FIELD(__ push(rbp), sender_link);
never@2895	238	RF_FIELD(__ push(saved_last_sp), exact_sender_sp); // rsi/r13
never@2895	239	RF_FIELD(__ pushptr(rcx_amh_conversion), conversion);
never@2895	240	RF_FIELD(__ push(rax_argv), saved_args_base); // can be updated if args are shifted
never@2895	241	RF_FIELD(__ push((int32_t) NULL_WORD), saved_args_layout); // cache for GC layout cookie
never@2895	242	if (UseCompressedOops) {
never@2895	243	__ load_heap_oop(rbx_temp, rcx_mh_vmtarget);
never@2895	244	RF_FIELD(__ push(rbx_temp), saved_target);
never@2895	245	} else {
never@2895	246	RF_FIELD(__ pushptr(rcx_mh_vmtarget), saved_target);
never@2895	247	}
never@2895	248	__ lea(rbx_temp, ExternalAddress(return_handler));
never@2895	249	RF_FIELD(__ push(rbx_temp), continuation);
never@2895	250	#undef RF_FIELD
never@2895	251	assert(rfo == 0, "fully initialized the RicochetFrame");
never@2895	252	// compute new frame pointer:
never@2895	253	__ lea(rbp, Address(rsp, RicochetFrame::sender_link_offset_in_bytes()));
never@2895	254	// Push guard word #1 in debug mode.
never@2895	255	DEBUG_ONLY(__ push((int32_t) RicochetFrame::MAGIC_NUMBER_1));
never@2895	256	// For debugging, leave behind an indication of which stub built this frame.
never@2895	257	DEBUG_ONLY({ Label L; __ call(L, relocInfo::none); __ bind(L); });
never@2895	258	BLOCK_COMMENT("} RicochetFrame");
never@2895	259	}
never@2895	260
never@2895	261	void MethodHandles::RicochetFrame::leave_ricochet_frame(MacroAssembler* _masm,
never@2895	262	Register rcx_recv,
never@2895	263	Register new_sp_reg,
never@2895	264	Register sender_pc_reg) {
never@2895	265	assert_different_registers(rcx_recv, new_sp_reg, sender_pc_reg);
never@2895	266	const Register saved_last_sp = saved_last_sp_register();
never@2895	267	// Take down the frame.
never@2895	268	// Cf. InterpreterMacroAssembler::remove_activation.
never@2895	269	BLOCK_COMMENT("end_ricochet_frame {");
never@2895	270	// TO DO: If (exact_sender_sp - extended_sender_sp) > THRESH, compact the frame down.
never@2895	271	// This will keep stack in bounds even with unlimited tailcalls, each with an adapter.
never@2895	272	if (rcx_recv->is_valid())
never@2895	273	__ movptr(rcx_recv, RicochetFrame::frame_address(RicochetFrame::saved_target_offset_in_bytes()));
never@2895	274	__ movptr(sender_pc_reg, RicochetFrame::frame_address(RicochetFrame::sender_pc_offset_in_bytes()));
never@2895	275	__ movptr(saved_last_sp, RicochetFrame::frame_address(RicochetFrame::exact_sender_sp_offset_in_bytes()));
never@2895	276	__ movptr(rbp, RicochetFrame::frame_address(RicochetFrame::sender_link_offset_in_bytes()));
never@2895	277	__ mov(rsp, new_sp_reg);
never@2895	278	BLOCK_COMMENT("} end_ricochet_frame");
never@2895	279	}
never@2895	280
never@2895	281	// Emit code to verify that RBP is pointing at a valid ricochet frame.
never@2895	282	#ifdef ASSERT
never@2895	283	enum {
never@2895	284	ARG_LIMIT = 255, SLOP = 4,
never@2895	285	// use this parameter for checking for garbage stack movements:
never@2895	286	UNREASONABLE_STACK_MOVE = (ARG_LIMIT + SLOP)
never@2895	287	// the slop defends against false alarms due to fencepost errors
never@2895	288	};
never@2895	289
never@2895	290	void MethodHandles::RicochetFrame::verify_clean(MacroAssembler* _masm) {
never@2895	291	// The stack should look like this:
never@2895	292	// ... keep1 | dest=42 | keep2 | RF | magic | handler | magic | recursive args |
never@2895	293	// Check various invariants.
never@2895	294	verify_offsets();
never@2895	295
never@2895	296	Register rdi_temp = rdi;
never@2895	297	Register rcx_temp = rcx;
never@2895	298	{ __ push(rdi_temp); __ push(rcx_temp); }
never@2895	299	#define UNPUSH_TEMPS \
never@2895	300	{ __ pop(rcx_temp); __ pop(rdi_temp); }
never@2895	301
never@2895	302	Address magic_number_1_addr = RicochetFrame::frame_address(RicochetFrame::magic_number_1_offset_in_bytes());
never@2895	303	Address magic_number_2_addr = RicochetFrame::frame_address(RicochetFrame::magic_number_2_offset_in_bytes());
never@2895	304	Address continuation_addr = RicochetFrame::frame_address(RicochetFrame::continuation_offset_in_bytes());
never@2895	305	Address conversion_addr = RicochetFrame::frame_address(RicochetFrame::conversion_offset_in_bytes());
never@2895	306	Address saved_args_base_addr = RicochetFrame::frame_address(RicochetFrame::saved_args_base_offset_in_bytes());
never@2895	307
never@2895	308	Label L_bad, L_ok;
never@2895	309	BLOCK_COMMENT("verify_clean {");
never@2895	310	// Magic numbers must check out:
never@2895	311	__ cmpptr(magic_number_1_addr, (int32_t) MAGIC_NUMBER_1);
never@2895	312	__ jcc(Assembler::notEqual, L_bad);
never@2895	313	__ cmpptr(magic_number_2_addr, (int32_t) MAGIC_NUMBER_2);
never@2895	314	__ jcc(Assembler::notEqual, L_bad);
never@2895	315
never@2895	316	// Arguments pointer must look reasonable:
never@2895	317	__ movptr(rcx_temp, saved_args_base_addr);
never@2895	318	__ cmpptr(rcx_temp, rbp);
never@2895	319	__ jcc(Assembler::below, L_bad);
never@2895	320	__ subptr(rcx_temp, UNREASONABLE_STACK_MOVE * Interpreter::stackElementSize);
never@2895	321	__ cmpptr(rcx_temp, rbp);
never@2895	322	__ jcc(Assembler::above, L_bad);
never@2895	323
never@2895	324	load_conversion_dest_type(_masm, rdi_temp, conversion_addr);
never@2895	325	__ cmpl(rdi_temp, T_VOID);
never@2895	326	__ jcc(Assembler::equal, L_ok);
never@2895	327	__ movptr(rcx_temp, saved_args_base_addr);
never@2895	328	load_conversion_vminfo(_masm, rdi_temp, conversion_addr);
never@2895	329	__ cmpptr(Address(rcx_temp, rdi_temp, Interpreter::stackElementScale()),
never@2895	330	(int32_t) RETURN_VALUE_PLACEHOLDER);
never@2895	331	__ jcc(Assembler::equal, L_ok);
never@2895	332	__ BIND(L_bad);
never@2895	333	UNPUSH_TEMPS;
never@2895	334	__ stop("damaged ricochet frame");
never@2895	335	__ BIND(L_ok);
never@2895	336	UNPUSH_TEMPS;
never@2895	337	BLOCK_COMMENT("} verify_clean");
never@2895	338
never@2895	339	#undef UNPUSH_TEMPS
never@2895	340
never@2895	341	}
never@2895	342	#endif //ASSERT
never@2895	343
never@2895	344	void MethodHandles::load_klass_from_Class(MacroAssembler* _masm, Register klass_reg) {
never@2895	345	if (VerifyMethodHandles)
never@2895	346	verify_klass(_masm, klass_reg, SystemDictionaryHandles::Class_klass(),
never@2895	347	"AMH argument is a Class");
never@2895	348	__ load_heap_oop(klass_reg, Address(klass_reg, java_lang_Class::klass_offset_in_bytes()));
never@2895	349	}
never@2895	350
never@2895	351	void MethodHandles::load_conversion_vminfo(MacroAssembler* _masm, Register reg, Address conversion_field_addr) {
never@2895	352	int bits = BitsPerByte;
never@2895	353	int offset = (CONV_VMINFO_SHIFT / bits);
never@2895	354	int shift = (CONV_VMINFO_SHIFT % bits);
never@2895	355	__ load_unsigned_byte(reg, conversion_field_addr.plus_disp(offset));
never@2895	356	assert(CONV_VMINFO_MASK == right_n_bits(bits - shift), "else change type of previous load");
never@2895	357	assert(shift == 0, "no shift needed");
never@2895	358	}
never@2895	359
never@2895	360	void MethodHandles::load_conversion_dest_type(MacroAssembler* _masm, Register reg, Address conversion_field_addr) {
never@2895	361	int bits = BitsPerByte;
never@2895	362	int offset = (CONV_DEST_TYPE_SHIFT / bits);
never@2895	363	int shift = (CONV_DEST_TYPE_SHIFT % bits);
never@2895	364	__ load_unsigned_byte(reg, conversion_field_addr.plus_disp(offset));
never@2895	365	assert(CONV_TYPE_MASK == right_n_bits(bits - shift), "else change type of previous load");
never@2895	366	__ shrl(reg, shift);
never@2895	367	DEBUG_ONLY(int conv_type_bits = (int) exact_log2(CONV_TYPE_MASK+1));
never@2895	368	assert((shift + conv_type_bits) == bits, "left justified in byte");
never@2895	369	}
never@2895	370
never@2895	371	void MethodHandles::load_stack_move(MacroAssembler* _masm,
never@2895	372	Register rdi_stack_move,
never@2895	373	Register rcx_amh,
never@2895	374	bool might_be_negative) {
never@2950	375	BLOCK_COMMENT("load_stack_move {");
never@2895	376	Address rcx_amh_conversion(rcx_amh, java_lang_invoke_AdapterMethodHandle::conversion_offset_in_bytes());
never@2895	377	__ movl(rdi_stack_move, rcx_amh_conversion);
never@2895	378	__ sarl(rdi_stack_move, CONV_STACK_MOVE_SHIFT);
never@2895	379	#ifdef _LP64
never@2895	380	if (might_be_negative) {
never@2895	381	// clean high bits of stack motion register (was loaded as an int)
never@2895	382	__ movslq(rdi_stack_move, rdi_stack_move);
never@2895	383	}
never@2895	384	#endif //_LP64
never@2895	385	if (VerifyMethodHandles) {
never@2895	386	Label L_ok, L_bad;
never@2895	387	int32_t stack_move_limit = 0x4000; // extra-large
never@2895	388	__ cmpptr(rdi_stack_move, stack_move_limit);
never@2895	389	__ jcc(Assembler::greaterEqual, L_bad);
never@2895	390	__ cmpptr(rdi_stack_move, -stack_move_limit);
never@2895	391	__ jcc(Assembler::greater, L_ok);
never@2895	392	__ bind(L_bad);
never@2895	393	__ stop("load_stack_move of garbage value");
never@2895	394	__ BIND(L_ok);
never@2895	395	}
never@2950	396	BLOCK_COMMENT("} load_stack_move");
never@2895	397	}
never@2895	398
never@2920	399	#ifdef ASSERT
never@2895	400	void MethodHandles::RicochetFrame::verify_offsets() {
never@2895	401	// Check compatibility of this struct with the more generally used offsets of class frame:
never@2895	402	int ebp_off = sender_link_offset_in_bytes(); // offset from struct base to local rbp value
never@2895	403	assert(ebp_off + wordSize*frame::interpreter_frame_method_offset == saved_args_base_offset_in_bytes(), "");
never@2895	404	assert(ebp_off + wordSize*frame::interpreter_frame_last_sp_offset == conversion_offset_in_bytes(), "");
never@2895	405	assert(ebp_off + wordSize*frame::interpreter_frame_sender_sp_offset == exact_sender_sp_offset_in_bytes(), "");
never@2895	406	// These last two have to be exact:
never@2895	407	assert(ebp_off + wordSize*frame::link_offset == sender_link_offset_in_bytes(), "");
never@2895	408	assert(ebp_off + wordSize*frame::return_addr_offset == sender_pc_offset_in_bytes(), "");
never@2895	409	}
never@2895	410
never@2895	411	void MethodHandles::RicochetFrame::verify() const {
never@2895	412	verify_offsets();
never@2895	413	assert(magic_number_1() == MAGIC_NUMBER_1, "");
never@2895	414	assert(magic_number_2() == MAGIC_NUMBER_2, "");
never@2895	415	if (!Universe::heap()->is_gc_active()) {
never@2895	416	if (saved_args_layout() != NULL) {
never@2895	417	assert(saved_args_layout()->is_method(), "must be valid oop");
never@2895	418	}
never@2895	419	if (saved_target() != NULL) {
never@2895	420	assert(java_lang_invoke_MethodHandle::is_instance(saved_target()), "checking frame value");
never@2895	421	}
never@2895	422	}
never@2895	423	int conv_op = adapter_conversion_op(conversion());
never@2895	424	assert(conv_op == java_lang_invoke_AdapterMethodHandle::OP_COLLECT_ARGS ||
never@2895	425	conv_op == java_lang_invoke_AdapterMethodHandle::OP_FOLD_ARGS ||
never@2895	426	conv_op == java_lang_invoke_AdapterMethodHandle::OP_PRIM_TO_REF,
never@2895	427	"must be a sane conversion");
never@2895	428	if (has_return_value_slot()) {
never@2895	429	assert(*return_value_slot_addr() == RETURN_VALUE_PLACEHOLDER, "");
never@2895	430	}
never@2895	431	}
never@2895	432	#endif //PRODUCT
never@2895	433
never@2895	434	#ifdef ASSERT
never@2895	435	void MethodHandles::verify_argslot(MacroAssembler* _masm,
never@2895	436	Register argslot_reg,
never@2895	437	const char* error_message) {
jrose@1145	438	// Verify that argslot lies within (rsp, rbp].
jrose@1145	439	Label L_ok, L_bad;
never@2895	440	BLOCK_COMMENT("verify_argslot {");
twisti@1739	441	__ cmpptr(argslot_reg, rbp);
twisti@1570	442	__ jccb(Assembler::above, L_bad);
twisti@1739	443	__ cmpptr(rsp, argslot_reg);
twisti@1570	444	__ jccb(Assembler::below, L_ok);
jrose@1145	445	__ bind(L_bad);
jrose@1145	446	__ stop(error_message);
never@2895	447	__ BIND(L_ok);
jrose@2148	448	BLOCK_COMMENT("} verify_argslot");
jrose@1145	449	}
jrose@1145	450
never@2895	451	void MethodHandles::verify_argslots(MacroAssembler* _masm,
never@2895	452	RegisterOrConstant arg_slots,
never@2895	453	Register arg_slot_base_reg,
never@2895	454	bool negate_argslots,
never@2895	455	const char* error_message) {
never@2895	456	// Verify that [argslot..argslot+size) lies within (rsp, rbp).
never@2895	457	Label L_ok, L_bad;
never@2895	458	Register rdi_temp = rdi;
never@2895	459	BLOCK_COMMENT("verify_argslots {");
never@2895	460	__ push(rdi_temp);
never@2895	461	if (negate_argslots) {
never@2895	462	if (arg_slots.is_constant()) {
never@2895	463	arg_slots = -1 * arg_slots.as_constant();
never@2895	464	} else {
never@2895	465	__ movptr(rdi_temp, arg_slots);
never@2895	466	__ negptr(rdi_temp);
never@2895	467	arg_slots = rdi_temp;
never@2895	468	}
never@2895	469	}
never@2895	470	__ lea(rdi_temp, Address(arg_slot_base_reg, arg_slots, Interpreter::stackElementScale()));
never@2895	471	__ cmpptr(rdi_temp, rbp);
never@2895	472	__ pop(rdi_temp);
never@2895	473	__ jcc(Assembler::above, L_bad);
never@2895	474	__ cmpptr(rsp, arg_slot_base_reg);
never@2895	475	__ jcc(Assembler::below, L_ok);
never@2895	476	__ bind(L_bad);
never@2895	477	__ stop(error_message);
never@2895	478	__ BIND(L_ok);
never@2895	479	BLOCK_COMMENT("} verify_argslots");
never@2895	480	}
never@2895	481
never@2895	482	// Make sure that arg_slots has the same sign as the given direction.
never@2895	483	// If (and only if) arg_slots is a assembly-time constant, also allow it to be zero.
never@2895	484	void MethodHandles::verify_stack_move(MacroAssembler* _masm,
never@2895	485	RegisterOrConstant arg_slots, int direction) {
never@2895	486	bool allow_zero = arg_slots.is_constant();
never@2895	487	if (direction == 0) { direction = +1; allow_zero = true; }
never@2895	488	assert(stack_move_unit() == -1, "else add extra checks here");
never@2895	489	if (arg_slots.is_register()) {
never@2895	490	Label L_ok, L_bad;
never@2895	491	BLOCK_COMMENT("verify_stack_move {");
never@2895	492	// testl(arg_slots.as_register(), -stack_move_unit() - 1); // no need
never@2895	493	// jcc(Assembler::notZero, L_bad);
never@2895	494	__ cmpptr(arg_slots.as_register(), (int32_t) NULL_WORD);
never@2895	495	if (direction > 0) {
never@2895	496	__ jcc(allow_zero ? Assembler::less : Assembler::lessEqual, L_bad);
never@2895	497	__ cmpptr(arg_slots.as_register(), (int32_t) UNREASONABLE_STACK_MOVE);
never@2895	498	__ jcc(Assembler::less, L_ok);
never@2895	499	} else {
never@2895	500	__ jcc(allow_zero ? Assembler::greater : Assembler::greaterEqual, L_bad);
never@2895	501	__ cmpptr(arg_slots.as_register(), (int32_t) -UNREASONABLE_STACK_MOVE);
never@2895	502	__ jcc(Assembler::greater, L_ok);
never@2895	503	}
never@2895	504	__ bind(L_bad);
never@2895	505	if (direction > 0)
never@2895	506	__ stop("assert arg_slots > 0");
never@2895	507	else
never@2895	508	__ stop("assert arg_slots < 0");
never@2895	509	__ BIND(L_ok);
never@2895	510	BLOCK_COMMENT("} verify_stack_move");
never@2895	511	} else {
never@2895	512	intptr_t size = arg_slots.as_constant();
never@2895	513	if (direction < 0) size = -size;
never@2895	514	assert(size >= 0, "correct direction of constant move");
never@2895	515	assert(size < UNREASONABLE_STACK_MOVE, "reasonable size of constant move");
never@2895	516	}
never@2895	517	}
never@2895	518
never@2895	519	void MethodHandles::verify_klass(MacroAssembler* _masm,
never@2895	520	Register obj, KlassHandle klass,
never@2895	521	const char* error_message) {
never@2895	522	oop* klass_addr = klass.raw_value();
never@2895	523	assert(klass_addr >= SystemDictionaryHandles::Object_klass().raw_value() &&
never@2895	524	klass_addr <= SystemDictionaryHandles::Long_klass().raw_value(),
never@2895	525	"must be one of the SystemDictionaryHandles");
never@2895	526	Register temp = rdi;
never@2895	527	Label L_ok, L_bad;
never@2895	528	BLOCK_COMMENT("verify_klass {");
never@2895	529	__ verify_oop(obj);
never@2895	530	__ testptr(obj, obj);
never@2895	531	__ jcc(Assembler::zero, L_bad);
never@2895	532	__ push(temp);
never@2895	533	__ load_klass(temp, obj);
never@2895	534	__ cmpptr(temp, ExternalAddress((address) klass_addr));
never@2895	535	__ jcc(Assembler::equal, L_ok);
never@2895	536	intptr_t super_check_offset = klass->super_check_offset();
never@2895	537	__ movptr(temp, Address(temp, super_check_offset));
never@2895	538	__ cmpptr(temp, ExternalAddress((address) klass_addr));
never@2895	539	__ jcc(Assembler::equal, L_ok);
never@2895	540	__ pop(temp);
never@2895	541	__ bind(L_bad);
never@2895	542	__ stop(error_message);
never@2895	543	__ BIND(L_ok);
never@2895	544	__ pop(temp);
never@2895	545	BLOCK_COMMENT("} verify_klass");
never@2895	546	}
never@2895	547	#endif //ASSERT
jrose@1145	548
jrose@1145	549	// Code generation
jrose@1145	550	address MethodHandles::generate_method_handle_interpreter_entry(MacroAssembler* _masm) {
jrose@1145	551	// rbx: methodOop
jrose@1145	552	// rcx: receiver method handle (must load from sp[MethodTypeForm.vmslots])
jrose@1145	553	// rsi/r13: sender SP (must preserve; see prepare_to_jump_from_interpreted)
jrose@2148	554	// rdx, rdi: garbage temp, blown away
jrose@1145	555
jrose@1145	556	Register rbx_method = rbx;
jrose@1145	557	Register rcx_recv = rcx;
jrose@1145	558	Register rax_mtype = rax;
jrose@1145	559	Register rdx_temp = rdx;
jrose@2148	560	Register rdi_temp = rdi;
jrose@1145	561
jrose@1145	562	// emit WrongMethodType path first, to enable jccb back-branch from main path
jrose@1145	563	Label wrong_method_type;
jrose@1145	564	__ bind(wrong_method_type);
jrose@2952	565	Label invoke_generic_slow_path, invoke_exact_error_path;
jrose@2148	566	assert(methodOopDesc::intrinsic_id_size_in_bytes() == sizeof(u1), "");;
jrose@2148	567	__ cmpb(Address(rbx_method, methodOopDesc::intrinsic_id_offset_in_bytes()), (int) vmIntrinsics::_invokeExact);
jrose@2148	568	__ jcc(Assembler::notEqual, invoke_generic_slow_path);
jrose@2952	569	__ jmp(invoke_exact_error_path);
jrose@1145	570
jrose@1145	571	// here's where control starts out:
jrose@1145	572	__ align(CodeEntryAlignment);
jrose@1145	573	address entry_point = __ pc();
jrose@1145	574
jrose@1145	575	// fetch the MethodType from the method handle into rax (the 'check' register)
never@2895	576	// FIXME: Interpreter should transmit pre-popped stack pointer, to locate base of arg list.
never@2895	577	// This would simplify several touchy bits of code.
never@2895	578	// See 6984712: JSR 292 method handle calls need a clean argument base pointer
jrose@1145	579	{
jrose@1145	580	Register tem = rbx_method;
jrose@1145	581	for (jint* pchase = methodOopDesc::method_type_offsets_chain(); (*pchase) != -1; pchase++) {
jrose@1145	582	__ movptr(rax_mtype, Address(tem, *pchase));
jrose@1145	583	tem = rax_mtype; // in case there is another indirection
jrose@1145	584	}
jrose@1145	585	}
jrose@1145	586
jrose@1145	587	// given the MethodType, find out where the MH argument is buried
jrose@2639	588	__ load_heap_oop(rdx_temp, Address(rax_mtype, __ delayed_value(java_lang_invoke_MethodType::form_offset_in_bytes, rdi_temp)));
jrose@2148	589	Register rdx_vmslots = rdx_temp;
jrose@2639	590	__ movl(rdx_vmslots, Address(rdx_temp, __ delayed_value(java_lang_invoke_MethodTypeForm::vmslots_offset_in_bytes, rdi_temp)));
never@2895	591	Address mh_receiver_slot_addr = __ argument_address(rdx_vmslots);
never@2895	592	__ movptr(rcx_recv, mh_receiver_slot_addr);
jrose@1145	593
jrose@2148	594	trace_method_handle(_masm, "invokeExact");
jrose@2148	595
jrose@2148	596	__ check_method_handle_type(rax_mtype, rcx_recv, rdi_temp, wrong_method_type);
never@2895	597
never@2895	598	// Nobody uses the MH receiver slot after this. Make sure.
never@2895	599	DEBUG_ONLY(__ movptr(mh_receiver_slot_addr, (int32_t)0x999999));
never@2895	600
jrose@2148	601	__ jump_to_method_handle_entry(rcx_recv, rdi_temp);
jrose@2148	602
jrose@2952	603	// error path for invokeExact (only)
jrose@2952	604	__ bind(invoke_exact_error_path);
never@2978	605	// Stub wants expected type in rax and the actual type in rcx
never@2978	606	__ jump(ExternalAddress(StubRoutines::throw_WrongMethodTypeException_entry()));
jrose@2952	607
jrose@2148	608	// for invokeGeneric (only), apply argument and result conversions on the fly
jrose@2148	609	__ bind(invoke_generic_slow_path);
jrose@2148	610	#ifdef ASSERT
never@2895	611	if (VerifyMethodHandles) {
never@2895	612	Label L;
jrose@2148	613	__ cmpb(Address(rbx_method, methodOopDesc::intrinsic_id_offset_in_bytes()), (int) vmIntrinsics::_invokeGeneric);
jrose@2148	614	__ jcc(Assembler::equal, L);
jrose@2148	615	__ stop("bad methodOop::intrinsic_id");
jrose@2148	616	__ bind(L);
jrose@2148	617	}
jrose@2148	618	#endif //ASSERT
jrose@2148	619	Register rbx_temp = rbx_method; // don't need it now
jrose@2148	620
jrose@2148	621	// make room on the stack for another pointer:
jrose@2148	622	Register rcx_argslot = rcx_recv;
jrose@2148	623	__ lea(rcx_argslot, __ argument_address(rdx_vmslots, 1));
never@2895	624	insert_arg_slots(_masm, 2 * stack_move_unit(),
jrose@2148	625	rcx_argslot, rbx_temp, rdx_temp);
jrose@2148	626
jrose@2148	627	// load up an adapter from the calling type (Java weaves this)
jrose@2148	628	Register rdx_adapter = rdx_temp;
twisti@2903	629	__ load_heap_oop(rdx_temp, Address(rax_mtype, __ delayed_value(java_lang_invoke_MethodType::form_offset_in_bytes, rdi_temp)));
twisti@2903	630	__ load_heap_oop(rdx_adapter, Address(rdx_temp, __ delayed_value(java_lang_invoke_MethodTypeForm::genericInvoker_offset_in_bytes, rdi_temp)));
twisti@2903	631	__ verify_oop(rdx_adapter);
jrose@2148	632	__ movptr(Address(rcx_argslot, 1 * Interpreter::stackElementSize), rdx_adapter);
jrose@2148	633	// As a trusted first argument, pass the type being called, so the adapter knows
jrose@2148	634	// the actual types of the arguments and return values.
jrose@2148	635	// (Generic invokers are shared among form-families of method-type.)
jrose@2148	636	__ movptr(Address(rcx_argslot, 0 * Interpreter::stackElementSize), rax_mtype);
jrose@2148	637	// FIXME: assert that rdx_adapter is of the right method-type.
jrose@2148	638	__ mov(rcx, rdx_adapter);
jrose@2148	639	trace_method_handle(_masm, "invokeGeneric");
jrose@2148	640	__ jump_to_method_handle_entry(rcx, rdi_temp);
jrose@2148	641
jrose@1145	642	return entry_point;
jrose@1145	643	}
jrose@1145	644
jrose@1145	645	// Helper to insert argument slots into the stack.
never@2895	646	// arg_slots must be a multiple of stack_move_unit() and < 0
never@2895	647	// rax_argslot is decremented to point to the new (shifted) location of the argslot
never@2895	648	// But, rdx_temp ends up holding the original value of rax_argslot.
jrose@1145	649	void MethodHandles::insert_arg_slots(MacroAssembler* _masm,
jrose@1145	650	RegisterOrConstant arg_slots,
jrose@1145	651	Register rax_argslot,
never@2895	652	Register rbx_temp, Register rdx_temp) {
never@2895	653	// allow constant zero
never@2895	654	if (arg_slots.is_constant() && arg_slots.as_constant() == 0)
never@2895	655	return;
jrose@1145	656	assert_different_registers(rax_argslot, rbx_temp, rdx_temp,
jrose@1145	657	(!arg_slots.is_register() ? rsp : arg_slots.as_register()));
never@2895	658	if (VerifyMethodHandles)
never@2895	659	verify_argslot(_masm, rax_argslot, "insertion point must fall within current frame");
never@2895	660	if (VerifyMethodHandles)
never@2895	661	verify_stack_move(_masm, arg_slots, -1);
jrose@1145	662
jrose@1145	663	// Make space on the stack for the inserted argument(s).
jrose@1145	664	// Then pull down everything shallower than rax_argslot.
jrose@1145	665	// The stacked return address gets pulled down with everything else.
jrose@1145	666	// That is, copy [rsp, argslot) downward by -size words. In pseudo-code:
jrose@1145	667	// rsp -= size;
jrose@1145	668	// for (rdx = rsp + size; rdx < argslot; rdx++)
jrose@1145	669	// rdx[-size] = rdx[0]
jrose@1145	670	// argslot -= size;
jrose@2148	671	BLOCK_COMMENT("insert_arg_slots {");
jrose@1145	672	__ mov(rdx_temp, rsp); // source pointer for copy
never@2895	673	__ lea(rsp, Address(rsp, arg_slots, Interpreter::stackElementScale()));
jrose@1145	674	{
jrose@1145	675	Label loop;
jrose@2148	676	__ BIND(loop);
jrose@1145	677	// pull one word down each time through the loop
jrose@1145	678	__ movptr(rbx_temp, Address(rdx_temp, 0));
never@2895	679	__ movptr(Address(rdx_temp, arg_slots, Interpreter::stackElementScale()), rbx_temp);
jrose@1145	680	__ addptr(rdx_temp, wordSize);
jrose@1145	681	__ cmpptr(rdx_temp, rax_argslot);
twisti@2903	682	__ jcc(Assembler::below, loop);
jrose@1145	683	}
jrose@1145	684
jrose@1145	685	// Now move the argslot down, to point to the opened-up space.
never@2895	686	__ lea(rax_argslot, Address(rax_argslot, arg_slots, Interpreter::stackElementScale()));
jrose@2148	687	BLOCK_COMMENT("} insert_arg_slots");
jrose@1145	688	}
jrose@1145	689
jrose@1145	690	// Helper to remove argument slots from the stack.
never@2895	691	// arg_slots must be a multiple of stack_move_unit() and > 0
jrose@1145	692	void MethodHandles::remove_arg_slots(MacroAssembler* _masm,
never@2895	693	RegisterOrConstant arg_slots,
never@2895	694	Register rax_argslot,
never@2895	695	Register rbx_temp, Register rdx_temp) {
never@2895	696	// allow constant zero
never@2895	697	if (arg_slots.is_constant() && arg_slots.as_constant() == 0)
never@2895	698	return;
jrose@1145	699	assert_different_registers(rax_argslot, rbx_temp, rdx_temp,
jrose@1145	700	(!arg_slots.is_register() ? rsp : arg_slots.as_register()));
never@2895	701	if (VerifyMethodHandles)
never@2895	702	verify_argslots(_masm, arg_slots, rax_argslot, false,
never@2895	703	"deleted argument(s) must fall within current frame");
never@2895	704	if (VerifyMethodHandles)
never@2895	705	verify_stack_move(_masm, arg_slots, +1);
jrose@1145	706
jrose@2148	707	BLOCK_COMMENT("remove_arg_slots {");
jrose@1145	708	// Pull up everything shallower than rax_argslot.
jrose@1145	709	// Then remove the excess space on the stack.
jrose@1145	710	// The stacked return address gets pulled up with everything else.
jrose@1145	711	// That is, copy [rsp, argslot) upward by size words. In pseudo-code:
jrose@1145	712	// for (rdx = argslot-1; rdx >= rsp; --rdx)
jrose@1145	713	// rdx[size] = rdx[0]
jrose@1145	714	// argslot += size;
jrose@1145	715	// rsp += size;
jrose@1145	716	__ lea(rdx_temp, Address(rax_argslot, -wordSize)); // source pointer for copy
jrose@1145	717	{
jrose@1145	718	Label loop;
jrose@2148	719	__ BIND(loop);
jrose@1145	720	// pull one word up each time through the loop
jrose@1145	721	__ movptr(rbx_temp, Address(rdx_temp, 0));
never@2895	722	__ movptr(Address(rdx_temp, arg_slots, Interpreter::stackElementScale()), rbx_temp);
jrose@1145	723	__ addptr(rdx_temp, -wordSize);
jrose@1145	724	__ cmpptr(rdx_temp, rsp);
twisti@2903	725	__ jcc(Assembler::aboveEqual, loop);
jrose@1145	726	}
jrose@1145	727
jrose@1145	728	// Now move the argslot up, to point to the just-copied block.
never@2895	729	__ lea(rsp, Address(rsp, arg_slots, Interpreter::stackElementScale()));
jrose@1145	730	// And adjust the argslot address to point at the deletion point.
never@2895	731	__ lea(rax_argslot, Address(rax_argslot, arg_slots, Interpreter::stackElementScale()));
jrose@2148	732	BLOCK_COMMENT("} remove_arg_slots");
jrose@1145	733	}
jrose@1145	734
never@2895	735	// Helper to copy argument slots to the top of the stack.
never@2895	736	// The sequence starts with rax_argslot and is counted by slot_count
never@2895	737	// slot_count must be a multiple of stack_move_unit() and >= 0
never@2895	738	// This function blows the temps but does not change rax_argslot.
never@2895	739	void MethodHandles::push_arg_slots(MacroAssembler* _masm,
never@2895	740	Register rax_argslot,
never@2895	741	RegisterOrConstant slot_count,
never@2895	742	int skip_words_count,
never@2895	743	Register rbx_temp, Register rdx_temp) {
never@2895	744	assert_different_registers(rax_argslot, rbx_temp, rdx_temp,
never@2895	745	(!slot_count.is_register() ? rbp : slot_count.as_register()),
never@2895	746	rsp);
never@2895	747	assert(Interpreter::stackElementSize == wordSize, "else change this code");
never@2895	748
never@2895	749	if (VerifyMethodHandles)
never@2895	750	verify_stack_move(_masm, slot_count, 0);
never@2895	751
never@2895	752	// allow constant zero
never@2895	753	if (slot_count.is_constant() && slot_count.as_constant() == 0)
never@2895	754	return;
never@2895	755
never@2895	756	BLOCK_COMMENT("push_arg_slots {");
never@2895	757
never@2895	758	Register rbx_top = rbx_temp;
never@2895	759
never@2895	760	// There is at most 1 word to carry down with the TOS.
never@2895	761	switch (skip_words_count) {
never@2895	762	case 1: __ pop(rdx_temp); break;
never@2895	763	case 0: break;
never@2895	764	default: ShouldNotReachHere();
never@2895	765	}
never@2895	766
never@2895	767	if (slot_count.is_constant()) {
never@2895	768	for (int i = slot_count.as_constant() - 1; i >= 0; i--) {
never@2895	769	__ pushptr(Address(rax_argslot, i * wordSize));
never@2895	770	}
never@2895	771	} else {
never@2895	772	Label L_plural, L_loop, L_break;
never@2895	773	// Emit code to dynamically check for the common cases, zero and one slot.
never@2895	774	__ cmpl(slot_count.as_register(), (int32_t) 1);
never@2895	775	__ jccb(Assembler::greater, L_plural);
never@2895	776	__ jccb(Assembler::less, L_break);
never@2895	777	__ pushptr(Address(rax_argslot, 0));
never@2895	778	__ jmpb(L_break);
never@2895	779	__ BIND(L_plural);
never@2895	780
never@2895	781	// Loop for 2 or more:
never@2895	782	// rbx = &rax[slot_count]
never@2895	783	// while (rbx > rax) *(--rsp) = *(--rbx)
never@2895	784	__ lea(rbx_top, Address(rax_argslot, slot_count, Address::times_ptr));
never@2895	785	__ BIND(L_loop);
never@2895	786	__ subptr(rbx_top, wordSize);
never@2895	787	__ pushptr(Address(rbx_top, 0));
never@2895	788	__ cmpptr(rbx_top, rax_argslot);
never@2895	789	__ jcc(Assembler::above, L_loop);
never@2895	790	__ bind(L_break);
never@2895	791	}
never@2895	792	switch (skip_words_count) {
never@2895	793	case 1: __ push(rdx_temp); break;
never@2895	794	case 0: break;
never@2895	795	default: ShouldNotReachHere();
never@2895	796	}
never@2895	797	BLOCK_COMMENT("} push_arg_slots");
never@2895	798	}
never@2895	799
never@2895	800	// in-place movement; no change to rsp
never@2895	801	// blows rax_temp, rdx_temp
never@2895	802	void MethodHandles::move_arg_slots_up(MacroAssembler* _masm,
never@2895	803	Register rbx_bottom, // invariant
never@2895	804	Address top_addr, // can use rax_temp
never@2895	805	RegisterOrConstant positive_distance_in_slots,
never@2895	806	Register rax_temp, Register rdx_temp) {
never@2895	807	BLOCK_COMMENT("move_arg_slots_up {");
never@2895	808	assert_different_registers(rbx_bottom,
never@2895	809	rax_temp, rdx_temp,
never@2895	810	positive_distance_in_slots.register_or_noreg());
never@2895	811	Label L_loop, L_break;
never@2895	812	Register rax_top = rax_temp;
never@2895	813	if (!top_addr.is_same_address(Address(rax_top, 0)))
never@2895	814	__ lea(rax_top, top_addr);
never@2895	815	// Detect empty (or broken) loop:
never@2895	816	#ifdef ASSERT
never@2895	817	if (VerifyMethodHandles) {
never@2895	818	// Verify that &bottom < &top (non-empty interval)
never@2895	819	Label L_ok, L_bad;
never@2895	820	if (positive_distance_in_slots.is_register()) {
never@2895	821	__ cmpptr(positive_distance_in_slots.as_register(), (int32_t) 0);
never@2895	822	__ jcc(Assembler::lessEqual, L_bad);
never@2895	823	}
never@2895	824	__ cmpptr(rbx_bottom, rax_top);
never@2895	825	__ jcc(Assembler::below, L_ok);
never@2895	826	__ bind(L_bad);
never@2895	827	__ stop("valid bounds (copy up)");
never@2895	828	__ BIND(L_ok);
never@2895	829	}
never@2895	830	#endif
never@2895	831	__ cmpptr(rbx_bottom, rax_top);
never@2895	832	__ jccb(Assembler::aboveEqual, L_break);
never@2895	833	// work rax down to rbx, copying contiguous data upwards
never@2895	834	// In pseudo-code:
never@2895	835	// [rbx, rax) = &[bottom, top)
never@2895	836	// while (--rax >= rbx) *(rax + distance) = *(rax + 0), rax--;
never@2895	837	__ BIND(L_loop);
never@2895	838	__ subptr(rax_top, wordSize);
never@2895	839	__ movptr(rdx_temp, Address(rax_top, 0));
never@2895	840	__ movptr( Address(rax_top, positive_distance_in_slots, Address::times_ptr), rdx_temp);
never@2895	841	__ cmpptr(rax_top, rbx_bottom);
never@2895	842	__ jcc(Assembler::above, L_loop);
never@2895	843	assert(Interpreter::stackElementSize == wordSize, "else change loop");
never@2895	844	__ bind(L_break);
never@2895	845	BLOCK_COMMENT("} move_arg_slots_up");
never@2895	846	}
never@2895	847
never@2895	848	// in-place movement; no change to rsp
never@2895	849	// blows rax_temp, rdx_temp
never@2895	850	void MethodHandles::move_arg_slots_down(MacroAssembler* _masm,
never@2895	851	Address bottom_addr, // can use rax_temp
never@2895	852	Register rbx_top, // invariant
never@2895	853	RegisterOrConstant negative_distance_in_slots,
never@2895	854	Register rax_temp, Register rdx_temp) {
never@2895	855	BLOCK_COMMENT("move_arg_slots_down {");
never@2895	856	assert_different_registers(rbx_top,
never@2895	857	negative_distance_in_slots.register_or_noreg(),
never@2895	858	rax_temp, rdx_temp);
never@2895	859	Label L_loop, L_break;
never@2895	860	Register rax_bottom = rax_temp;
never@2895	861	if (!bottom_addr.is_same_address(Address(rax_bottom, 0)))
never@2895	862	__ lea(rax_bottom, bottom_addr);
never@2895	863	// Detect empty (or broken) loop:
never@2895	864	#ifdef ASSERT
never@2895	865	assert(!negative_distance_in_slots.is_constant() || negative_distance_in_slots.as_constant() < 0, "");
never@2895	866	if (VerifyMethodHandles) {
never@2895	867	// Verify that &bottom < &top (non-empty interval)
never@2895	868	Label L_ok, L_bad;
never@2895	869	if (negative_distance_in_slots.is_register()) {
never@2895	870	__ cmpptr(negative_distance_in_slots.as_register(), (int32_t) 0);
never@2895	871	__ jcc(Assembler::greaterEqual, L_bad);
never@2895	872	}
never@2895	873	__ cmpptr(rax_bottom, rbx_top);
never@2895	874	__ jcc(Assembler::below, L_ok);
never@2895	875	__ bind(L_bad);
never@2895	876	__ stop("valid bounds (copy down)");
never@2895	877	__ BIND(L_ok);
never@2895	878	}
never@2895	879	#endif
never@2895	880	__ cmpptr(rax_bottom, rbx_top);
never@2895	881	__ jccb(Assembler::aboveEqual, L_break);
never@2895	882	// work rax up to rbx, copying contiguous data downwards
never@2895	883	// In pseudo-code:
never@2895	884	// [rax, rbx) = &[bottom, top)
never@2895	885	// while (rax < rbx) *(rax - distance) = *(rax + 0), rax++;
never@2895	886	__ BIND(L_loop);
never@2895	887	__ movptr(rdx_temp, Address(rax_bottom, 0));
never@2895	888	__ movptr( Address(rax_bottom, negative_distance_in_slots, Address::times_ptr), rdx_temp);
never@2895	889	__ addptr(rax_bottom, wordSize);
never@2895	890	__ cmpptr(rax_bottom, rbx_top);
never@2895	891	__ jcc(Assembler::below, L_loop);
never@2895	892	assert(Interpreter::stackElementSize == wordSize, "else change loop");
never@2895	893	__ bind(L_break);
never@2895	894	BLOCK_COMMENT("} move_arg_slots_down");
never@2895	895	}
never@2895	896
never@2895	897	// Copy from a field or array element to a stacked argument slot.
never@2895	898	// is_element (ignored) says whether caller is loading an array element instead of an instance field.
never@2895	899	void MethodHandles::move_typed_arg(MacroAssembler* _masm,
never@2895	900	BasicType type, bool is_element,
never@2895	901	Address slot_dest, Address value_src,
never@2895	902	Register rbx_temp, Register rdx_temp) {
never@2895	903	BLOCK_COMMENT(!is_element ? "move_typed_arg {" : "move_typed_arg { (array element)");
never@2895	904	if (type == T_OBJECT || type == T_ARRAY) {
never@2895	905	__ load_heap_oop(rbx_temp, value_src);
never@2895	906	__ movptr(slot_dest, rbx_temp);
never@2895	907	} else if (type != T_VOID) {
never@2895	908	int arg_size = type2aelembytes(type);
never@2895	909	bool arg_is_signed = is_signed_subword_type(type);
never@2895	910	int slot_size = (arg_size > wordSize) ? arg_size : wordSize;
never@2895	911	__ load_sized_value( rdx_temp, value_src, arg_size, arg_is_signed, rbx_temp);
never@2895	912	__ store_sized_value( slot_dest, rdx_temp, slot_size, rbx_temp);
never@2895	913	}
never@2895	914	BLOCK_COMMENT("} move_typed_arg");
never@2895	915	}
never@2895	916
never@2895	917	void MethodHandles::move_return_value(MacroAssembler* _masm, BasicType type,
never@2895	918	Address return_slot) {
never@2895	919	BLOCK_COMMENT("move_return_value {");
never@2895	920	// Old versions of the JVM must clean the FPU stack after every return.
never@2895	921	#ifndef _LP64
never@2895	922	#ifdef COMPILER2
never@2895	923	// The FPU stack is clean if UseSSE >= 2 but must be cleaned in other cases
never@2895	924	if ((type == T_FLOAT && UseSSE < 1) || (type == T_DOUBLE && UseSSE < 2)) {
never@2895	925	for (int i = 1; i < 8; i++) {
never@2895	926	__ ffree(i);
never@2895	927	}
never@2895	928	} else if (UseSSE < 2) {
never@2895	929	__ empty_FPU_stack();
never@2895	930	}
never@2895	931	#endif //COMPILER2
never@2895	932	#endif //!_LP64
never@2895	933
never@2895	934	// Look at the type and pull the value out of the corresponding register.
never@2895	935	if (type == T_VOID) {
never@2895	936	// nothing to do
never@2895	937	} else if (type == T_OBJECT) {
never@2895	938	__ movptr(return_slot, rax);
never@2895	939	} else if (type == T_INT || is_subword_type(type)) {
never@2895	940	// write the whole word, even if only 32 bits is significant
never@2895	941	__ movptr(return_slot, rax);
never@2895	942	} else if (type == T_LONG) {
never@2895	943	// store the value by parts
never@2895	944	// Note: We assume longs are continguous (if misaligned) on the interpreter stack.
never@2895	945	__ store_sized_value(return_slot, rax, BytesPerLong, rdx);
never@2895	946	} else if (NOT_LP64((type == T_FLOAT && UseSSE < 1) ||
never@2895	947	(type == T_DOUBLE && UseSSE < 2) ||)
never@2895	948	false) {
never@2895	949	// Use old x86 FPU registers:
never@2895	950	if (type == T_FLOAT)
never@2895	951	__ fstp_s(return_slot);
never@2895	952	else
never@2895	953	__ fstp_d(return_slot);
never@2895	954	} else if (type == T_FLOAT) {
never@2895	955	__ movflt(return_slot, xmm0);
never@2895	956	} else if (type == T_DOUBLE) {
never@2895	957	__ movdbl(return_slot, xmm0);
never@2895	958	} else {
never@2895	959	ShouldNotReachHere();
never@2895	960	}
never@2895	961	BLOCK_COMMENT("} move_return_value");
never@2895	962	}
never@2895	963
never@2895	964
jrose@1145	965	#ifndef PRODUCT
twisti@1568	966	extern "C" void print_method_handle(oop mh);
jrose@1145	967	void trace_method_handle_stub(const char* adaptername,
never@2895	968	oop mh,
never@2895	969	intptr_t* saved_regs,
never@2895	970	intptr_t* entry_sp,
never@2868	971	intptr_t* saved_sp,
never@2895	972	intptr_t* saved_bp) {
jrose@1145	973	// called as a leaf from native code: do not block the JVM!
twisti@2903	974	bool has_mh = (strstr(adaptername, "return/") == NULL); // return adapters don't have rcx_mh
never@2895	975	intptr_t* last_sp = (intptr_t*) saved_bp[frame::interpreter_frame_last_sp_offset];
twisti@2903	976	intptr_t* base_sp = last_sp;
twisti@2903	977	typedef MethodHandles::RicochetFrame RicochetFrame;
twisti@2903	978	RicochetFrame* rfp = (RicochetFrame*)((address)saved_bp - RicochetFrame::sender_link_offset_in_bytes());
twisti@2903	979	if (!UseRicochetFrames || Universe::heap()->is_in((address) rfp->saved_args_base())) {
twisti@2903	980	// Probably an interpreter frame.
twisti@2903	981	base_sp = (intptr_t*) saved_bp[frame::interpreter_frame_monitor_block_top_offset];
twisti@2903	982	}
twisti@2903	983	intptr_t mh_reg = (intptr_t)mh;
twisti@2903	984	const char* mh_reg_name = "rcx_mh";
twisti@2903	985	if (!has_mh) mh_reg_name = "rcx";
twisti@2903	986	tty->print_cr("MH %s %s="PTR_FORMAT" sp=("PTR_FORMAT"+"INTX_FORMAT") stack_size="INTX_FORMAT" bp="PTR_FORMAT,
twisti@2903	987	adaptername, mh_reg_name, mh_reg,
twisti@2903	988	(intptr_t)entry_sp, (intptr_t)(saved_sp - entry_sp), (intptr_t)(base_sp - last_sp), (intptr_t)saved_bp);
jrose@2148	989	if (Verbose) {
never@2895	990	tty->print(" reg dump: ");
never@2895	991	int saved_regs_count = (entry_sp-1) - saved_regs;
never@2895	992	// 32 bit: rdi rsi rbp rsp; rbx rdx rcx (*) rax
never@2895	993	int i;
never@2895	994	for (i = 0; i <= saved_regs_count; i++) {
never@2895	995	if (i > 0 && i % 4 == 0 && i != saved_regs_count) {
never@2895	996	tty->cr();
never@2895	997	tty->print(" + dump: ");
never@2895	998	}
twisti@2903	999	tty->print(" %d: "PTR_FORMAT, i, saved_regs[i]);
never@2895	1000	}
never@2895	1001	tty->cr();
twisti@2903	1002	if (last_sp != saved_sp && last_sp != NULL)
twisti@2903	1003	tty->print_cr("*** last_sp="PTR_FORMAT, (intptr_t)last_sp);
never@2895	1004	int stack_dump_count = 16;
never@2895	1005	if (stack_dump_count < (int)(saved_bp + 2 - saved_sp))
never@2895	1006	stack_dump_count = (int)(saved_bp + 2 - saved_sp);
never@2895	1007	if (stack_dump_count > 64) stack_dump_count = 48;
never@2895	1008	for (i = 0; i < stack_dump_count; i += 4) {
twisti@2903	1009	tty->print_cr(" dump at SP[%d] "PTR_FORMAT": "PTR_FORMAT" "PTR_FORMAT" "PTR_FORMAT" "PTR_FORMAT,
never@2895	1010	i, (intptr_t) &entry_sp[i+0], entry_sp[i+0], entry_sp[i+1], entry_sp[i+2], entry_sp[i+3]);
never@2895	1011	}
twisti@2903	1012	if (has_mh)
twisti@2903	1013	print_method_handle(mh);
jrose@2148	1014	}
jrose@2148	1015	}
never@2895	1016
never@2895	1017	// The stub wraps the arguments in a struct on the stack to avoid
never@2895	1018	// dealing with the different calling conventions for passing 6
never@2895	1019	// arguments.
never@2895	1020	struct MethodHandleStubArguments {
never@2895	1021	const char* adaptername;
never@2895	1022	oopDesc* mh;
never@2895	1023	intptr_t* saved_regs;
never@2895	1024	intptr_t* entry_sp;
never@2895	1025	intptr_t* saved_sp;
never@2895	1026	intptr_t* saved_bp;
never@2895	1027	};
never@2895	1028	void trace_method_handle_stub_wrapper(MethodHandleStubArguments* args) {
never@2895	1029	trace_method_handle_stub(args->adaptername,
never@2895	1030	args->mh,
never@2895	1031	args->saved_regs,
never@2895	1032	args->entry_sp,
never@2895	1033	args->saved_sp,
never@2895	1034	args->saved_bp);
never@2895	1035	}
never@2895	1036
jrose@2148	1037	void MethodHandles::trace_method_handle(MacroAssembler* _masm, const char* adaptername) {
jrose@2148	1038	if (!TraceMethodHandles) return;
jrose@2148	1039	BLOCK_COMMENT("trace_method_handle {");
never@2895	1040	__ push(rax);
never@2895	1041	__ lea(rax, Address(rsp, wordSize * NOT_LP64(6) LP64_ONLY(14))); // entry_sp __ pusha();
jrose@2148	1042	__ pusha();
never@2895	1043	__ mov(rbx, rsp);
never@2895	1044	__ enter();
never@2895	1045	// incoming state:
never@2868	1046	// rcx: method handle
never@2895	1047	// r13 or rsi: saved sp
never@2895	1048	// To avoid calling convention issues, build a record on the stack and pass the pointer to that instead.
never@2895	1049	__ push(rbp); // saved_bp
never@2895	1050	__ push(rsi); // saved_sp
never@2895	1051	__ push(rax); // entry_sp
never@2895	1052	__ push(rbx); // pusha saved_regs
never@2895	1053	__ push(rcx); // mh
never@2895	1054	__ push(rcx); // adaptername
never@2895	1055	__ movptr(Address(rsp, 0), (intptr_t) adaptername);
never@2895	1056	__ super_call_VM_leaf(CAST_FROM_FN_PTR(address, trace_method_handle_stub_wrapper), rsp);
never@2895	1057	__ leave();
jrose@2148	1058	__ popa();
never@2895	1059	__ pop(rax);
jrose@2148	1060	BLOCK_COMMENT("} trace_method_handle");
jrose@1145	1061	}
jrose@1145	1062	#endif //PRODUCT
jrose@1145	1063
jrose@1862	1064	// which conversion op types are implemented here?
jrose@1862	1065	int MethodHandles::adapter_conversion_ops_supported_mask() {
jrose@2639	1066	return ((1<<java_lang_invoke_AdapterMethodHandle::OP_RETYPE_ONLY)
jrose@2639	1067	|(1<<java_lang_invoke_AdapterMethodHandle::OP_RETYPE_RAW)
jrose@2639	1068	|(1<<java_lang_invoke_AdapterMethodHandle::OP_CHECK_CAST)
jrose@2639	1069	|(1<<java_lang_invoke_AdapterMethodHandle::OP_PRIM_TO_PRIM)
jrose@2639	1070	|(1<<java_lang_invoke_AdapterMethodHandle::OP_REF_TO_PRIM)
never@2895	1071	//OP_PRIM_TO_REF is below...
jrose@2639	1072	|(1<<java_lang_invoke_AdapterMethodHandle::OP_SWAP_ARGS)
jrose@2639	1073	|(1<<java_lang_invoke_AdapterMethodHandle::OP_ROT_ARGS)
jrose@2639	1074	|(1<<java_lang_invoke_AdapterMethodHandle::OP_DUP_ARGS)
jrose@2639	1075	|(1<<java_lang_invoke_AdapterMethodHandle::OP_DROP_ARGS)
never@2895	1076	//OP_COLLECT_ARGS is below...
never@2895	1077	|(1<<java_lang_invoke_AdapterMethodHandle::OP_SPREAD_ARGS)
never@2895	1078	|(!UseRicochetFrames ? 0 :
never@2895	1079	java_lang_invoke_MethodTypeForm::vmlayout_offset_in_bytes() <= 0 ? 0 :
never@2895	1080	((1<<java_lang_invoke_AdapterMethodHandle::OP_PRIM_TO_REF)
never@2895	1081	|(1<<java_lang_invoke_AdapterMethodHandle::OP_COLLECT_ARGS)
never@2895	1082	|(1<<java_lang_invoke_AdapterMethodHandle::OP_FOLD_ARGS)
never@2895	1083	))
jrose@1862	1084	);
jrose@1862	1085	}
jrose@1862	1086
twisti@2411	1087	//------------------------------------------------------------------------------
twisti@2411	1088	// MethodHandles::generate_method_handle_stub
twisti@2411	1089	//
jrose@1145	1090	// Generate an "entry" field for a method handle.
jrose@1145	1091	// This determines how the method handle will respond to calls.
twisti@2436	1092	void MethodHandles::generate_method_handle_stub(MacroAssembler* _masm, MethodHandles::EntryKind ek) {
never@2895	1093	MethodHandles::EntryKind ek_orig = ek_original_kind(ek);
never@2895	1094
jrose@1145	1095	// Here is the register state during an interpreted call,
jrose@1145	1096	// as set up by generate_method_handle_interpreter_entry():
jrose@1145	1097	// - rbx: garbage temp (was MethodHandle.invoke methodOop, unused)
jrose@1145	1098	// - rcx: receiver method handle
jrose@1145	1099	// - rax: method handle type (only used by the check_mtype entry point)
jrose@1145	1100	// - rsi/r13: sender SP (must preserve; see prepare_to_jump_from_interpreted)
jrose@1145	1101	// - rdx: garbage temp, can blow away
jrose@1145	1102
twisti@2411	1103	const Register rcx_recv = rcx;
twisti@2411	1104	const Register rax_argslot = rax;
twisti@2411	1105	const Register rbx_temp = rbx;
twisti@2411	1106	const Register rdx_temp = rdx;
never@2895	1107	const Register rdi_temp = rdi;
jrose@1145	1108
jrose@1474	1109	// This guy is set up by prepare_to_jump_from_interpreted (from interpreted calls)
jrose@1474	1110	// and gen_c2i_adapter (from compiled calls):
never@2895	1111	const Register saved_last_sp = saved_last_sp_register();
twisti@2411	1112
twisti@2411	1113	// Argument registers for _raise_exception.
twisti@2411	1114	// 32-bit: Pass first two oop/int args in registers ECX and EDX.
twisti@2411	1115	const Register rarg0_code = LP64_ONLY(j_rarg0) NOT_LP64(rcx);
twisti@2411	1116	const Register rarg1_actual = LP64_ONLY(j_rarg1) NOT_LP64(rdx);
twisti@2411	1117	const Register rarg2_required = LP64_ONLY(j_rarg2) NOT_LP64(rdi);
twisti@2411	1118	assert_different_registers(rarg0_code, rarg1_actual, rarg2_required, saved_last_sp);
jrose@1474	1119
jrose@2639	1120	guarantee(java_lang_invoke_MethodHandle::vmentry_offset_in_bytes() != 0, "must have offsets");
jrose@1145	1121
jrose@1145	1122	// some handy addresses
jrose@1145	1123	Address rbx_method_fie( rbx, methodOopDesc::from_interpreted_offset() );
twisti@2603	1124	Address rbx_method_fce( rbx, methodOopDesc::from_compiled_offset() );
jrose@1145	1125
jrose@2639	1126	Address rcx_mh_vmtarget( rcx_recv, java_lang_invoke_MethodHandle::vmtarget_offset_in_bytes() );
jrose@2639	1127	Address rcx_dmh_vmindex( rcx_recv, java_lang_invoke_DirectMethodHandle::vmindex_offset_in_bytes() );
jrose@1145	1128
jrose@2639	1129	Address rcx_bmh_vmargslot( rcx_recv, java_lang_invoke_BoundMethodHandle::vmargslot_offset_in_bytes() );
jrose@2639	1130	Address rcx_bmh_argument( rcx_recv, java_lang_invoke_BoundMethodHandle::argument_offset_in_bytes() );
jrose@1145	1131
jrose@2639	1132	Address rcx_amh_vmargslot( rcx_recv, java_lang_invoke_AdapterMethodHandle::vmargslot_offset_in_bytes() );
jrose@2639	1133	Address rcx_amh_argument( rcx_recv, java_lang_invoke_AdapterMethodHandle::argument_offset_in_bytes() );
jrose@2639	1134	Address rcx_amh_conversion( rcx_recv, java_lang_invoke_AdapterMethodHandle::conversion_offset_in_bytes() );
jrose@1145	1135	Address vmarg; // __ argument_address(vmargslot)
jrose@1145	1136
jrose@1474	1137	const int java_mirror_offset = klassOopDesc::klass_part_offset_in_bytes() + Klass::java_mirror_offset_in_bytes();
jrose@1474	1138
jrose@1145	1139	if (have_entry(ek)) {
jrose@1145	1140	__ nop(); // empty stubs make SG sick
jrose@1145	1141	return;
jrose@1145	1142	}
jrose@1145	1143
never@2895	1144	#ifdef ASSERT
never@2895	1145	__ push((int32_t) 0xEEEEEEEE);
never@2895	1146	__ push((int32_t) (intptr_t) entry_name(ek));
never@2895	1147	LP64_ONLY(__ push((int32_t) high((intptr_t) entry_name(ek))));
never@2895	1148	__ push((int32_t) 0x33333333);
never@2895	1149	#endif //ASSERT
never@2895	1150
jrose@1145	1151	address interp_entry = __ pc();
jrose@1145	1152
jrose@2148	1153	trace_method_handle(_masm, entry_name(ek));
jrose@2148	1154
never@2950	1155	BLOCK_COMMENT(err_msg("Entry %s {", entry_name(ek)));
jrose@1145	1156
jrose@1145	1157	switch ((int) ek) {
jrose@1474	1158	case _raise_exception:
jrose@1145	1159	{
twisti@2411	1160	// Not a real MH entry, but rather shared code for raising an
twisti@2603	1161	// exception. Since we use the compiled entry, arguments are
twisti@2603	1162	// expected in compiler argument registers.
twisti@2436	1163	assert(raise_exception_method(), "must be set");
twisti@2603	1164	assert(raise_exception_method()->from_compiled_entry(), "method must be linked");
jrose@1145	1165
twisti@2411	1166	const Register rdi_pc = rax;
twisti@2411	1167	__ pop(rdi_pc); // caller PC
twisti@2411	1168	__ mov(rsp, saved_last_sp); // cut the stack back to where the caller started
jrose@1145	1169
jrose@1474	1170	Register rbx_method = rbx_temp;
jrose@1474	1171	__ movptr(rbx_method, ExternalAddress((address) &_raise_exception_method));
twisti@2411	1172
twisti@2411	1173	const int jobject_oop_offset = 0;
jrose@1474	1174	__ movptr(rbx_method, Address(rbx_method, jobject_oop_offset)); // dereference the jobject
jrose@1474	1175	__ verify_oop(rbx_method);
twisti@2411	1176
twisti@2411	1177	NOT_LP64(__ push(rarg2_required));
twisti@2603	1178	__ push(rdi_pc); // restore caller PC
twisti@2603	1179	__ jmp(rbx_method_fce); // jump to compiled entry
jrose@1145	1180	}
jrose@1145	1181	break;
jrose@1145	1182
jrose@1145	1183	case _invokestatic_mh:
jrose@1145	1184	case _invokespecial_mh:
jrose@1145	1185	{
jrose@1145	1186	Register rbx_method = rbx_temp;
twisti@2201	1187	__ load_heap_oop(rbx_method, rcx_mh_vmtarget); // target is a methodOop
jrose@1145	1188	__ verify_oop(rbx_method);
jrose@1145	1189	// same as TemplateTable::invokestatic or invokespecial,
jrose@1145	1190	// minus the CP setup and profiling:
jrose@1145	1191	if (ek == _invokespecial_mh) {
jrose@1145	1192	// Must load & check the first argument before entering the target method.
jrose@1145	1193	__ load_method_handle_vmslots(rax_argslot, rcx_recv, rdx_temp);
jrose@1145	1194	__ movptr(rcx_recv, __ argument_address(rax_argslot, -1));
jrose@1145	1195	__ null_check(rcx_recv);
jrose@1145	1196	__ verify_oop(rcx_recv);
jrose@1145	1197	}
jrose@1145	1198	__ jmp(rbx_method_fie);
jrose@1145	1199	}
jrose@1145	1200	break;
jrose@1145	1201
jrose@1145	1202	case _invokevirtual_mh:
jrose@1145	1203	{
jrose@1145	1204	// same as TemplateTable::invokevirtual,
jrose@1145	1205	// minus the CP setup and profiling:
jrose@1145	1206
jrose@1145	1207	// pick out the vtable index and receiver offset from the MH,
jrose@1145	1208	// and then we can discard it:
jrose@1145	1209	__ load_method_handle_vmslots(rax_argslot, rcx_recv, rdx_temp);
jrose@1145	1210	Register rbx_index = rbx_temp;
jrose@1145	1211	__ movl(rbx_index, rcx_dmh_vmindex);
jrose@1145	1212	// Note: The verifier allows us to ignore rcx_mh_vmtarget.
jrose@1145	1213	__ movptr(rcx_recv, __ argument_address(rax_argslot, -1));
jrose@1145	1214	__ null_check(rcx_recv, oopDesc::klass_offset_in_bytes());
jrose@1145	1215
jrose@1145	1216	// get receiver klass
jrose@1145	1217	Register rax_klass = rax_argslot;
jrose@1145	1218	__ load_klass(rax_klass, rcx_recv);
jrose@1145	1219	__ verify_oop(rax_klass);
jrose@1145	1220
jrose@1145	1221	// get target methodOop & entry point
jrose@1145	1222	const int base = instanceKlass::vtable_start_offset() * wordSize;
jrose@1145	1223	assert(vtableEntry::size() * wordSize == wordSize, "adjust the scaling in the code below");
jrose@1145	1224	Address vtable_entry_addr(rax_klass,
jrose@1145	1225	rbx_index, Address::times_ptr,
jrose@1145	1226	base + vtableEntry::method_offset_in_bytes());
jrose@1145	1227	Register rbx_method = rbx_temp;
twisti@1543	1228	__ movptr(rbx_method, vtable_entry_addr);
jrose@1145	1229
jrose@1145	1230	__ verify_oop(rbx_method);
jrose@1145	1231	__ jmp(rbx_method_fie);
jrose@1145	1232	}
jrose@1145	1233	break;
jrose@1145	1234
jrose@1145	1235	case _invokeinterface_mh:
jrose@1145	1236	{
jrose@1145	1237	// same as TemplateTable::invokeinterface,
jrose@1145	1238	// minus the CP setup and profiling:
jrose@1145	1239
jrose@1145	1240	// pick out the interface and itable index from the MH.
jrose@1145	1241	__ load_method_handle_vmslots(rax_argslot, rcx_recv, rdx_temp);
jrose@1145	1242	Register rdx_intf = rdx_temp;
jrose@1145	1243	Register rbx_index = rbx_temp;
twisti@2201	1244	__ load_heap_oop(rdx_intf, rcx_mh_vmtarget);
twisti@2201	1245	__ movl(rbx_index, rcx_dmh_vmindex);
jrose@1145	1246	__ movptr(rcx_recv, __ argument_address(rax_argslot, -1));
jrose@1145	1247	__ null_check(rcx_recv, oopDesc::klass_offset_in_bytes());
jrose@1145	1248
jrose@1145	1249	// get receiver klass
jrose@1145	1250	Register rax_klass = rax_argslot;
jrose@1145	1251	__ load_klass(rax_klass, rcx_recv);
jrose@1145	1252	__ verify_oop(rax_klass);
jrose@1145	1253
jrose@1145	1254	Register rbx_method = rbx_index;
jrose@1145	1255
jrose@1145	1256	// get interface klass
jrose@1145	1257	Label no_such_interface;
jrose@1145	1258	__ verify_oop(rdx_intf);
jrose@1145	1259	__ lookup_interface_method(rax_klass, rdx_intf,
jrose@1145	1260	// note: next two args must be the same:
jrose@1145	1261	rbx_index, rbx_method,
jrose@1474	1262	rdi_temp,
jrose@1145	1263	no_such_interface);
jrose@1145	1264
jrose@1145	1265	__ verify_oop(rbx_method);
jrose@1145	1266	__ jmp(rbx_method_fie);
jrose@1145	1267	__ hlt();
jrose@1145	1268
jrose@1145	1269	__ bind(no_such_interface);
jrose@1145	1270	// Throw an exception.
jrose@1145	1271	// For historical reasons, it will be IncompatibleClassChangeError.
twisti@2411	1272	__ mov(rbx_temp, rcx_recv); // rarg2_required might be RCX
twisti@2411	1273	assert_different_registers(rarg2_required, rbx_temp);
twisti@2411	1274	__ movptr(rarg2_required, Address(rdx_intf, java_mirror_offset)); // required interface
twisti@2411	1275	__ mov( rarg1_actual, rbx_temp); // bad receiver
twisti@2411	1276	__ movl( rarg0_code, (int) Bytecodes::_invokeinterface); // who is complaining?
jrose@1474	1277	__ jump(ExternalAddress(from_interpreted_entry(_raise_exception)));
jrose@1145	1278	}
jrose@1145	1279	break;
jrose@1145	1280
jrose@1145	1281	case _bound_ref_mh:
jrose@1145	1282	case _bound_int_mh:
jrose@1145	1283	case _bound_long_mh:
jrose@1145	1284	case _bound_ref_direct_mh:
jrose@1145	1285	case _bound_int_direct_mh:
jrose@1145	1286	case _bound_long_direct_mh:
jrose@1145	1287	{
never@2950	1288	const bool direct_to_method = (ek >= _bound_ref_direct_mh);
never@2895	1289	BasicType arg_type = ek_bound_mh_arg_type(ek);
never@2895	1290	int arg_slots = type2size[arg_type];
jrose@1145	1291
jrose@1145	1292	// make room for the new argument:
jrose@1145	1293	__ movl(rax_argslot, rcx_bmh_vmargslot);
jrose@1145	1294	__ lea(rax_argslot, __ argument_address(rax_argslot));
twisti@2565	1295
never@2895	1296	insert_arg_slots(_masm, arg_slots * stack_move_unit(), rax_argslot, rbx_temp, rdx_temp);
jrose@1145	1297
jrose@1145	1298	// store bound argument into the new stack slot:
twisti@2201	1299	__ load_heap_oop(rbx_temp, rcx_bmh_argument);
jrose@1145	1300	if (arg_type == T_OBJECT) {
jrose@1145	1301	__ movptr(Address(rax_argslot, 0), rbx_temp);
jrose@1145	1302	} else {
twisti@2565	1303	Address prim_value_addr(rbx_temp, java_lang_boxing_object::value_offset_in_bytes(arg_type));
never@2895	1304	move_typed_arg(_masm, arg_type, false,
never@2895	1305	Address(rax_argslot, 0),
never@2895	1306	prim_value_addr,
never@2895	1307	rbx_temp, rdx_temp);
jrose@1145	1308	}
jrose@1145	1309
jrose@1145	1310	if (direct_to_method) {
jrose@1145	1311	Register rbx_method = rbx_temp;
twisti@2201	1312	__ load_heap_oop(rbx_method, rcx_mh_vmtarget);
jrose@1145	1313	__ verify_oop(rbx_method);
jrose@1145	1314	__ jmp(rbx_method_fie);
jrose@1145	1315	} else {
twisti@2201	1316	__ load_heap_oop(rcx_recv, rcx_mh_vmtarget);
jrose@1145	1317	__ verify_oop(rcx_recv);
jrose@1145	1318	__ jump_to_method_handle_entry(rcx_recv, rdx_temp);
jrose@1145	1319	}
jrose@1145	1320	}
jrose@1145	1321	break;
jrose@1145	1322
jrose@1145	1323	case _adapter_retype_only:
jrose@1474	1324	case _adapter_retype_raw:
jrose@1145	1325	// immediately jump to the next MH layer:
twisti@2201	1326	__ load_heap_oop(rcx_recv, rcx_mh_vmtarget);
jrose@1145	1327	__ verify_oop(rcx_recv);
jrose@1145	1328	__ jump_to_method_handle_entry(rcx_recv, rdx_temp);
jrose@1145	1329	// This is OK when all parameter types widen.
jrose@1145	1330	// It is also OK when a return type narrows.
jrose@1145	1331	break;
jrose@1145	1332
jrose@1145	1333	case _adapter_check_cast:
jrose@1145	1334	{
jrose@1145	1335	// temps:
jrose@1145	1336	Register rbx_klass = rbx_temp; // interesting AMH data
jrose@1145	1337
jrose@1145	1338	// check a reference argument before jumping to the next layer of MH:
jrose@1145	1339	__ movl(rax_argslot, rcx_amh_vmargslot);
jrose@1145	1340	vmarg = __ argument_address(rax_argslot);
jrose@1145	1341
jrose@1145	1342	// What class are we casting to?
twisti@2201	1343	__ load_heap_oop(rbx_klass, rcx_amh_argument); // this is a Class object!
never@2895	1344	load_klass_from_Class(_masm, rbx_klass);
jrose@1145	1345
jrose@1145	1346	Label done;
jrose@1145	1347	__ movptr(rdx_temp, vmarg);
twisti@1712	1348	__ testptr(rdx_temp, rdx_temp);
twisti@2201	1349	__ jcc(Assembler::zero, done); // no cast if null
jrose@1145	1350	__ load_klass(rdx_temp, rdx_temp);
jrose@1145	1351
jrose@1145	1352	// live at this point:
jrose@1145	1353	// - rbx_klass: klass required by the target method
jrose@1145	1354	// - rdx_temp: argument klass to test
jrose@1474	1355	// - rcx_recv: adapter method handle
jrose@1145	1356	__ check_klass_subtype(rdx_temp, rbx_klass, rax_argslot, done);
jrose@1145	1357
jrose@1145	1358	// If we get here, the type check failed!
jrose@1145	1359	// Call the wrong_method_type stub, passing the failing argument type in rax.
jrose@1145	1360	Register rax_mtype = rax_argslot;
jrose@1474	1361	__ movl(rax_argslot, rcx_amh_vmargslot); // reload argslot field
jrose@1474	1362	__ movptr(rdx_temp, vmarg);
jrose@1474	1363
twisti@2411	1364	assert_different_registers(rarg2_required, rdx_temp);
twisti@2411	1365	__ load_heap_oop(rarg2_required, rcx_amh_argument); // required class
twisti@2411	1366	__ mov( rarg1_actual, rdx_temp); // bad object
twisti@2411	1367	__ movl( rarg0_code, (int) Bytecodes::_checkcast); // who is complaining?
jrose@1474	1368	__ jump(ExternalAddress(from_interpreted_entry(_raise_exception)));
jrose@1145	1369
jrose@1145	1370	__ bind(done);
jrose@1474	1371	// get the new MH:
twisti@2201	1372	__ load_heap_oop(rcx_recv, rcx_mh_vmtarget);
jrose@1145	1373	__ jump_to_method_handle_entry(rcx_recv, rdx_temp);
jrose@1145	1374	}
jrose@1145	1375	break;
jrose@1145	1376
jrose@1145	1377	case _adapter_prim_to_prim:
jrose@1145	1378	case _adapter_ref_to_prim:
never@2895	1379	case _adapter_prim_to_ref:
jrose@1145	1380	// handled completely by optimized cases
jrose@1145	1381	__ stop("init_AdapterMethodHandle should not issue this");
jrose@1145	1382	break;
jrose@1145	1383
jrose@1145	1384	case _adapter_opt_i2i: // optimized subcase of adapt_prim_to_prim
jrose@1145	1385	//case _adapter_opt_f2i: // optimized subcase of adapt_prim_to_prim
jrose@1145	1386	case _adapter_opt_l2i: // optimized subcase of adapt_prim_to_prim
jrose@1145	1387	case _adapter_opt_unboxi: // optimized subcase of adapt_ref_to_prim
jrose@1145	1388	{
jrose@1145	1389	// perform an in-place conversion to int or an int subword
jrose@1145	1390	__ movl(rax_argslot, rcx_amh_vmargslot);
jrose@1145	1391	vmarg = __ argument_address(rax_argslot);
jrose@1145	1392
jrose@1145	1393	switch (ek) {
jrose@1145	1394	case _adapter_opt_i2i:
jrose@1145	1395	__ movl(rdx_temp, vmarg);
jrose@1145	1396	break;
jrose@1145	1397	case _adapter_opt_l2i:
jrose@1145	1398	{
jrose@1145	1399	// just delete the extra slot; on a little-endian machine we keep the first
jrose@1145	1400	__ lea(rax_argslot, __ argument_address(rax_argslot, 1));
jrose@1145	1401	remove_arg_slots(_masm, -stack_move_unit(),
jrose@1145	1402	rax_argslot, rbx_temp, rdx_temp);
twisti@1861	1403	vmarg = Address(rax_argslot, -Interpreter::stackElementSize);
jrose@1145	1404	__ movl(rdx_temp, vmarg);
jrose@1145	1405	}
jrose@1145	1406	break;
jrose@1145	1407	case _adapter_opt_unboxi:
jrose@1145	1408	{
jrose@1145	1409	// Load the value up from the heap.
jrose@1145	1410	__ movptr(rdx_temp, vmarg);
jrose@1145	1411	int value_offset = java_lang_boxing_object::value_offset_in_bytes(T_INT);
jrose@1145	1412	#ifdef ASSERT
jrose@1145	1413	for (int bt = T_BOOLEAN; bt < T_INT; bt++) {
jrose@1145	1414	if (is_subword_type(BasicType(bt)))
jrose@1145	1415	assert(value_offset == java_lang_boxing_object::value_offset_in_bytes(BasicType(bt)), "");
jrose@1145	1416	}
jrose@1145	1417	#endif
jrose@1145	1418	__ null_check(rdx_temp, value_offset);
jrose@1145	1419	__ movl(rdx_temp, Address(rdx_temp, value_offset));
jrose@1145	1420	// We load this as a word. Because we are little-endian,
jrose@1145	1421	// the low bits will be correct, but the high bits may need cleaning.
jrose@1145	1422	// The vminfo will guide us to clean those bits.
jrose@1145	1423	}
jrose@1145	1424	break;
jrose@1145	1425	default:
twisti@1739	1426	ShouldNotReachHere();
jrose@1145	1427	}
jrose@1145	1428
twisti@1739	1429	// Do the requested conversion and store the value.
jrose@1145	1430	Register rbx_vminfo = rbx_temp;
never@2895	1431	load_conversion_vminfo(_masm, rbx_vminfo, rcx_amh_conversion);
jrose@1145	1432
jrose@1145	1433	// get the new MH:
twisti@2201	1434	__ load_heap_oop(rcx_recv, rcx_mh_vmtarget);
jrose@1145	1435	// (now we are done with the old MH)
jrose@1145	1436
jrose@1145	1437	// original 32-bit vmdata word must be of this form:
twisti@1570	1438	// | MBZ:6 | signBitCount:8 | srcDstTypes:8 | conversionOp:8 |
twisti@1570	1439	__ xchgptr(rcx, rbx_vminfo); // free rcx for shifts
jrose@1145	1440	__ shll(rdx_temp /*, rcx*/);
jrose@1145	1441	Label zero_extend, done;
jrose@1145	1442	__ testl(rcx, CONV_VMINFO_SIGN_FLAG);
twisti@1570	1443	__ jccb(Assembler::zero, zero_extend);
jrose@1145	1444
jrose@1145	1445	// this path is taken for int->byte, int->short
jrose@1145	1446	__ sarl(rdx_temp /*, rcx*/);
twisti@1570	1447	__ jmpb(done);
jrose@1145	1448
jrose@1145	1449	__ bind(zero_extend);
jrose@1145	1450	// this is taken for int->char
jrose@1145	1451	__ shrl(rdx_temp /*, rcx*/);
jrose@1145	1452
jrose@1145	1453	__ bind(done);
twisti@1739	1454	__ movl(vmarg, rdx_temp); // Store the value.
twisti@1570	1455	__ xchgptr(rcx, rbx_vminfo); // restore rcx_recv
jrose@1145	1456
jrose@1145	1457	__ jump_to_method_handle_entry(rcx_recv, rdx_temp);
jrose@1145	1458	}
jrose@1145	1459	break;
jrose@1145	1460
jrose@1145	1461	case _adapter_opt_i2l: // optimized subcase of adapt_prim_to_prim
jrose@1145	1462	case _adapter_opt_unboxl: // optimized subcase of adapt_ref_to_prim
jrose@1145	1463	{
jrose@1145	1464	// perform an in-place int-to-long or ref-to-long conversion
jrose@1145	1465	__ movl(rax_argslot, rcx_amh_vmargslot);
jrose@1145	1466
jrose@1145	1467	// on a little-endian machine we keep the first slot and add another after
jrose@1145	1468	__ lea(rax_argslot, __ argument_address(rax_argslot, 1));
never@2895	1469	insert_arg_slots(_masm, stack_move_unit(),
jrose@1145	1470	rax_argslot, rbx_temp, rdx_temp);
twisti@1861	1471	Address vmarg1(rax_argslot, -Interpreter::stackElementSize);
twisti@1861	1472	Address vmarg2 = vmarg1.plus_disp(Interpreter::stackElementSize);
jrose@1145	1473
jrose@1145	1474	switch (ek) {
jrose@1145	1475	case _adapter_opt_i2l:
jrose@1145	1476	{
twisti@1728	1477	#ifdef _LP64
twisti@1728	1478	__ movslq(rdx_temp, vmarg1); // Load sign-extended
twisti@1728	1479	__ movq(vmarg1, rdx_temp); // Store into first slot
twisti@1728	1480	#else
jrose@1145	1481	__ movl(rdx_temp, vmarg1);
twisti@1728	1482	__ sarl(rdx_temp, BitsPerInt - 1); // __ extend_sign()
jrose@1145	1483	__ movl(vmarg2, rdx_temp); // store second word
twisti@1728	1484	#endif
jrose@1145	1485	}
jrose@1145	1486	break;
jrose@1145	1487	case _adapter_opt_unboxl:
jrose@1145	1488	{
jrose@1145	1489	// Load the value up from the heap.
jrose@1145	1490	__ movptr(rdx_temp, vmarg1);
jrose@1145	1491	int value_offset = java_lang_boxing_object::value_offset_in_bytes(T_LONG);
jrose@1145	1492	assert(value_offset == java_lang_boxing_object::value_offset_in_bytes(T_DOUBLE), "");
jrose@1145	1493	__ null_check(rdx_temp, value_offset);
twisti@1728	1494	#ifdef _LP64
twisti@1728	1495	__ movq(rbx_temp, Address(rdx_temp, value_offset));
twisti@1728	1496	__ movq(vmarg1, rbx_temp);
twisti@1728	1497	#else
jrose@1145	1498	__ movl(rbx_temp, Address(rdx_temp, value_offset + 0*BytesPerInt));
jrose@1145	1499	__ movl(rdx_temp, Address(rdx_temp, value_offset + 1*BytesPerInt));
jrose@1145	1500	__ movl(vmarg1, rbx_temp);
jrose@1145	1501	__ movl(vmarg2, rdx_temp);
twisti@1728	1502	#endif
jrose@1145	1503	}
jrose@1145	1504	break;
jrose@1145	1505	default:
twisti@1739	1506	ShouldNotReachHere();
jrose@1145	1507	}
jrose@1145	1508
twisti@2201	1509	__ load_heap_oop(rcx_recv, rcx_mh_vmtarget);
jrose@1145	1510	__ jump_to_method_handle_entry(rcx_recv, rdx_temp);
jrose@1145	1511	}
jrose@1145	1512	break;
jrose@1145	1513
jrose@1145	1514	case _adapter_opt_f2d: // optimized subcase of adapt_prim_to_prim
jrose@1145	1515	case _adapter_opt_d2f: // optimized subcase of adapt_prim_to_prim
jrose@1145	1516	{
jrose@1145	1517	// perform an in-place floating primitive conversion
jrose@1145	1518	__ movl(rax_argslot, rcx_amh_vmargslot);
jrose@1145	1519	__ lea(rax_argslot, __ argument_address(rax_argslot, 1));
jrose@1145	1520	if (ek == _adapter_opt_f2d) {
never@2895	1521	insert_arg_slots(_masm, stack_move_unit(),
jrose@1145	1522	rax_argslot, rbx_temp, rdx_temp);
jrose@1145	1523	}
twisti@1861	1524	Address vmarg(rax_argslot, -Interpreter::stackElementSize);
jrose@1145	1525
jrose@1145	1526	#ifdef _LP64
jrose@1145	1527	if (ek == _adapter_opt_f2d) {
jrose@1145	1528	__ movflt(xmm0, vmarg);
jrose@1145	1529	__ cvtss2sd(xmm0, xmm0);
jrose@1145	1530	__ movdbl(vmarg, xmm0);
jrose@1145	1531	} else {
jrose@1145	1532	__ movdbl(xmm0, vmarg);
jrose@1145	1533	__ cvtsd2ss(xmm0, xmm0);
jrose@1145	1534	__ movflt(vmarg, xmm0);
jrose@1145	1535	}
jrose@1145	1536	#else //_LP64
jrose@1145	1537	if (ek == _adapter_opt_f2d) {
jrose@1145	1538	__ fld_s(vmarg); // load float to ST0
twisti@2903	1539	__ fstp_d(vmarg); // store double
twisti@1739	1540	} else {
jrose@1145	1541	__ fld_d(vmarg); // load double to ST0
jrose@1145	1542	__ fstp_s(vmarg); // store single
jrose@1145	1543	}
jrose@1145	1544	#endif //_LP64
jrose@1145	1545
jrose@1145	1546	if (ek == _adapter_opt_d2f) {
jrose@1145	1547	remove_arg_slots(_masm, -stack_move_unit(),
jrose@1145	1548	rax_argslot, rbx_temp, rdx_temp);
jrose@1145	1549	}
jrose@1145	1550
twisti@2201	1551	__ load_heap_oop(rcx_recv, rcx_mh_vmtarget);
jrose@1145	1552	__ jump_to_method_handle_entry(rcx_recv, rdx_temp);
jrose@1145	1553	}
jrose@1145	1554	break;
jrose@1145	1555
jrose@1145	1556	case _adapter_swap_args:
jrose@1145	1557	case _adapter_rot_args:
jrose@1145	1558	// handled completely by optimized cases
jrose@1145	1559	__ stop("init_AdapterMethodHandle should not issue this");
jrose@1145	1560	break;
jrose@1145	1561
jrose@1145	1562	case _adapter_opt_swap_1:
jrose@1145	1563	case _adapter_opt_swap_2:
jrose@1145	1564	case _adapter_opt_rot_1_up:
jrose@1145	1565	case _adapter_opt_rot_1_down:
jrose@1145	1566	case _adapter_opt_rot_2_up:
jrose@1145	1567	case _adapter_opt_rot_2_down:
jrose@1145	1568	{
never@2895	1569	int swap_slots = ek_adapter_opt_swap_slots(ek);
never@2895	1570	int rotate = ek_adapter_opt_swap_mode(ek);
jrose@1145	1571
jrose@1145	1572	// 'argslot' is the position of the first argument to swap
jrose@1145	1573	__ movl(rax_argslot, rcx_amh_vmargslot);
jrose@1145	1574	__ lea(rax_argslot, __ argument_address(rax_argslot));
jrose@1145	1575
jrose@1145	1576	// 'vminfo' is the second
jrose@1145	1577	Register rbx_destslot = rbx_temp;
never@2895	1578	load_conversion_vminfo(_masm, rbx_destslot, rcx_amh_conversion);
jrose@1145	1579	__ lea(rbx_destslot, __ argument_address(rbx_destslot));
never@2895	1580	if (VerifyMethodHandles)
never@2895	1581	verify_argslot(_masm, rbx_destslot, "swap point must fall within current frame");
jrose@1145	1582
never@2895	1583	assert(Interpreter::stackElementSize == wordSize, "else rethink use of wordSize here");
jrose@1145	1584	if (!rotate) {
never@2895	1585	// simple swap
never@2895	1586	for (int i = 0; i < swap_slots; i++) {
never@2895	1587	__ movptr(rdi_temp, Address(rax_argslot, i * wordSize));
never@2895	1588	__ movptr(rdx_temp, Address(rbx_destslot, i * wordSize));
never@2895	1589	__ movptr(Address(rax_argslot, i * wordSize), rdx_temp);
never@2895	1590	__ movptr(Address(rbx_destslot, i * wordSize), rdi_temp);
jrose@1145	1591	}
jrose@1145	1592	} else {
never@2895	1593	// A rotate is actually pair of moves, with an "odd slot" (or pair)
never@2895	1594	// changing place with a series of other slots.
never@2895	1595	// First, push the "odd slot", which is going to get overwritten
never@2895	1596	for (int i = swap_slots - 1; i >= 0; i--) {
never@2895	1597	// handle one with rdi_temp instead of a push:
never@2895	1598	if (i == 0) __ movptr(rdi_temp, Address(rax_argslot, i * wordSize));
never@2895	1599	else __ pushptr( Address(rax_argslot, i * wordSize));
jrose@1145	1600	}
jrose@1145	1601	if (rotate > 0) {
never@2895	1602	// Here is rotate > 0:
never@2895	1603	// (low mem) (high mem)
never@2895	1604	// | dest: more_slots... | arg: odd_slot :arg+1 |
never@2895	1605	// =>
never@2895	1606	// | dest: odd_slot | dest+1: more_slots... :arg+1 |
jrose@1145	1607	// work argslot down to destslot, copying contiguous data upwards
jrose@1145	1608	// pseudo-code:
jrose@1145	1609	// rax = src_addr - swap_bytes
jrose@1145	1610	// rbx = dest_addr
jrose@1145	1611	// while (rax >= rbx) *(rax + swap_bytes) = *(rax + 0), rax--;
never@2895	1612	move_arg_slots_up(_masm,
never@2895	1613	rbx_destslot,
never@2895	1614	Address(rax_argslot, 0),
never@2895	1615	swap_slots,
never@2895	1616	rax_argslot, rdx_temp);
jrose@1145	1617	} else {
never@2895	1618	// Here is the other direction, rotate < 0:
never@2895	1619	// (low mem) (high mem)
never@2895	1620	// | arg: odd_slot | arg+1: more_slots... :dest+1 |
never@2895	1621	// =>
never@2895	1622	// | arg: more_slots... | dest: odd_slot :dest+1 |
jrose@1145	1623	// work argslot up to destslot, copying contiguous data downwards
jrose@1145	1624	// pseudo-code:
jrose@1145	1625	// rax = src_addr + swap_bytes
jrose@1145	1626	// rbx = dest_addr
jrose@1145	1627	// while (rax <= rbx) *(rax - swap_bytes) = *(rax + 0), rax++;
never@2954	1628	// dest_slot denotes an exclusive upper limit
never@2954	1629	int limit_bias = OP_ROT_ARGS_DOWN_LIMIT_BIAS;
never@2954	1630	if (limit_bias != 0)
never@2954	1631	__ addptr(rbx_destslot, - limit_bias * wordSize);
never@2895	1632	move_arg_slots_down(_masm,
never@2895	1633	Address(rax_argslot, swap_slots * wordSize),
never@2895	1634	rbx_destslot,
never@2895	1635	-swap_slots,
never@2895	1636	rax_argslot, rdx_temp);
never@2954	1637	__ subptr(rbx_destslot, swap_slots * wordSize);
jrose@1145	1638	}
jrose@1145	1639	// pop the original first chunk into the destination slot, now free
never@2895	1640	for (int i = 0; i < swap_slots; i++) {
never@2895	1641	if (i == 0) __ movptr(Address(rbx_destslot, i * wordSize), rdi_temp);
never@2895	1642	else __ popptr(Address(rbx_destslot, i * wordSize));
jrose@1145	1643	}
jrose@1145	1644	}
jrose@1145	1645
twisti@2201	1646	__ load_heap_oop(rcx_recv, rcx_mh_vmtarget);
jrose@1145	1647	__ jump_to_method_handle_entry(rcx_recv, rdx_temp);
jrose@1145	1648	}
jrose@1145	1649	break;
jrose@1145	1650
jrose@1145	1651	case _adapter_dup_args:
jrose@1145	1652	{
jrose@1145	1653	// 'argslot' is the position of the first argument to duplicate
jrose@1145	1654	__ movl(rax_argslot, rcx_amh_vmargslot);
jrose@1145	1655	__ lea(rax_argslot, __ argument_address(rax_argslot));
jrose@1145	1656
jrose@1145	1657	// 'stack_move' is negative number of words to duplicate
never@2895	1658	Register rdi_stack_move = rdi_temp;
never@2895	1659	load_stack_move(_masm, rdi_stack_move, rcx_recv, true);
jrose@1145	1660
never@2895	1661	if (VerifyMethodHandles) {
never@2895	1662	verify_argslots(_masm, rdi_stack_move, rax_argslot, true,
never@2895	1663	"copied argument(s) must fall within current frame");
jrose@1145	1664	}
jrose@1145	1665
never@2895	1666	// insert location is always the bottom of the argument list:
never@2895	1667	Address insert_location = __ argument_address(constant(0));
never@2895	1668	int pre_arg_words = insert_location.disp() / wordSize; // return PC is pushed
never@2895	1669	assert(insert_location.base() == rsp, "");
jrose@1145	1670
never@2895	1671	__ negl(rdi_stack_move);
never@2895	1672	push_arg_slots(_masm, rax_argslot, rdi_stack_move,
never@2895	1673	pre_arg_words, rbx_temp, rdx_temp);
jrose@1145	1674
twisti@2201	1675	__ load_heap_oop(rcx_recv, rcx_mh_vmtarget);
jrose@1145	1676	__ jump_to_method_handle_entry(rcx_recv, rdx_temp);
jrose@1145	1677	}
jrose@1145	1678	break;
jrose@1145	1679
jrose@1145	1680	case _adapter_drop_args:
jrose@1145	1681	{
jrose@1145	1682	// 'argslot' is the position of the first argument to nuke
jrose@1145	1683	__ movl(rax_argslot, rcx_amh_vmargslot);
jrose@1145	1684	__ lea(rax_argslot, __ argument_address(rax_argslot));
jrose@1145	1685
jrose@1145	1686	// (must do previous push after argslot address is taken)
jrose@1145	1687
jrose@1145	1688	// 'stack_move' is number of words to drop
never@2895	1689	Register rdi_stack_move = rdi_temp;
never@2895	1690	load_stack_move(_masm, rdi_stack_move, rcx_recv, false);
jrose@1145	1691	remove_arg_slots(_masm, rdi_stack_move,
jrose@1145	1692	rax_argslot, rbx_temp, rdx_temp);
jrose@1145	1693
twisti@2201	1694	__ load_heap_oop(rcx_recv, rcx_mh_vmtarget);
jrose@1145	1695	__ jump_to_method_handle_entry(rcx_recv, rdx_temp);
jrose@1145	1696	}
jrose@1145	1697	break;
jrose@1145	1698
jrose@1145	1699	case _adapter_collect_args:
never@2895	1700	case _adapter_fold_args:
jrose@1145	1701	case _adapter_spread_args:
jrose@1145	1702	// handled completely by optimized cases
jrose@1145	1703	__ stop("init_AdapterMethodHandle should not issue this");
jrose@1145	1704	break;
jrose@1145	1705
never@2895	1706	case _adapter_opt_collect_ref:
never@2895	1707	case _adapter_opt_collect_int:
never@2895	1708	case _adapter_opt_collect_long:
never@2895	1709	case _adapter_opt_collect_float:
never@2895	1710	case _adapter_opt_collect_double:
never@2895	1711	case _adapter_opt_collect_void:
never@2895	1712	case _adapter_opt_collect_0_ref:
never@2895	1713	case _adapter_opt_collect_1_ref:
never@2895	1714	case _adapter_opt_collect_2_ref:
never@2895	1715	case _adapter_opt_collect_3_ref:
never@2895	1716	case _adapter_opt_collect_4_ref:
never@2895	1717	case _adapter_opt_collect_5_ref:
never@2895	1718	case _adapter_opt_filter_S0_ref:
never@2895	1719	case _adapter_opt_filter_S1_ref:
never@2895	1720	case _adapter_opt_filter_S2_ref:
never@2895	1721	case _adapter_opt_filter_S3_ref:
never@2895	1722	case _adapter_opt_filter_S4_ref:
never@2895	1723	case _adapter_opt_filter_S5_ref:
never@2895	1724	case _adapter_opt_collect_2_S0_ref:
never@2895	1725	case _adapter_opt_collect_2_S1_ref:
never@2895	1726	case _adapter_opt_collect_2_S2_ref:
never@2895	1727	case _adapter_opt_collect_2_S3_ref:
never@2895	1728	case _adapter_opt_collect_2_S4_ref:
never@2895	1729	case _adapter_opt_collect_2_S5_ref:
never@2895	1730	case _adapter_opt_fold_ref:
never@2895	1731	case _adapter_opt_fold_int:
never@2895	1732	case _adapter_opt_fold_long:
never@2895	1733	case _adapter_opt_fold_float:
never@2895	1734	case _adapter_opt_fold_double:
never@2895	1735	case _adapter_opt_fold_void:
never@2895	1736	case _adapter_opt_fold_1_ref:
never@2895	1737	case _adapter_opt_fold_2_ref:
never@2895	1738	case _adapter_opt_fold_3_ref:
never@2895	1739	case _adapter_opt_fold_4_ref:
never@2895	1740	case _adapter_opt_fold_5_ref:
never@2895	1741	{
never@2895	1742	// Given a fresh incoming stack frame, build a new ricochet frame.
never@2895	1743	// On entry, TOS points at a return PC, and RBP is the callers frame ptr.
never@2895	1744	// RSI/R13 has the caller's exact stack pointer, which we must also preserve.
never@2895	1745	// RCX contains an AdapterMethodHandle of the indicated kind.
never@2895	1746
never@2895	1747	// Relevant AMH fields:
never@2895	1748	// amh.vmargslot:
never@2895	1749	// points to the trailing edge of the arguments
never@2895	1750	// to filter, collect, or fold. For a boxing operation,
never@2895	1751	// it points just after the single primitive value.
never@2895	1752	// amh.argument:
never@2895	1753	// recursively called MH, on |collect| arguments
never@2895	1754	// amh.vmtarget:
never@2895	1755	// final destination MH, on return value, etc.
never@2895	1756	// amh.conversion.dest:
never@2895	1757	// tells what is the type of the return value
never@2895	1758	// (not needed here, since dest is also derived from ek)
never@2895	1759	// amh.conversion.vminfo:
never@2895	1760	// points to the trailing edge of the return value
never@2895	1761	// when the vmtarget is to be called; this is
never@2895	1762	// equal to vmargslot + (retained ? |collect| : 0)
never@2895	1763
never@2895	1764	// Pass 0 or more argument slots to the recursive target.
never@2895	1765	int collect_count_constant = ek_adapter_opt_collect_count(ek);
never@2895	1766
never@2895	1767	// The collected arguments are copied from the saved argument list:
never@2895	1768	int collect_slot_constant = ek_adapter_opt_collect_slot(ek);
never@2895	1769
never@2895	1770	assert(ek_orig == _adapter_collect_args ||
never@2895	1771	ek_orig == _adapter_fold_args, "");
never@2895	1772	bool retain_original_args = (ek_orig == _adapter_fold_args);
never@2895	1773
never@2895	1774	// The return value is replaced (or inserted) at the 'vminfo' argslot.
never@2895	1775	// Sometimes we can compute this statically.
never@2895	1776	int dest_slot_constant = -1;
never@2895	1777	if (!retain_original_args)
never@2895	1778	dest_slot_constant = collect_slot_constant;
never@2895	1779	else if (collect_slot_constant >= 0 && collect_count_constant >= 0)
never@2895	1780	// We are preserving all the arguments, and the return value is prepended,
never@2895	1781	// so the return slot is to the left (above) the |collect| sequence.
never@2895	1782	dest_slot_constant = collect_slot_constant + collect_count_constant;
never@2895	1783
never@2895	1784	// Replace all those slots by the result of the recursive call.
never@2895	1785	// The result type can be one of ref, int, long, float, double, void.
never@2895	1786	// In the case of void, nothing is pushed on the stack after return.
never@2895	1787	BasicType dest = ek_adapter_opt_collect_type(ek);
never@2895	1788	assert(dest == type2wfield[dest], "dest is a stack slot type");
never@2895	1789	int dest_count = type2size[dest];
never@2895	1790	assert(dest_count == 1 || dest_count == 2 || (dest_count == 0 && dest == T_VOID), "dest has a size");
never@2895	1791
never@2895	1792	// Choose a return continuation.
never@2895	1793	EntryKind ek_ret = _adapter_opt_return_any;
never@2895	1794	if (dest != T_CONFLICT && OptimizeMethodHandles) {
never@2895	1795	switch (dest) {
never@2895	1796	case T_INT : ek_ret = _adapter_opt_return_int; break;
never@2895	1797	case T_LONG : ek_ret = _adapter_opt_return_long; break;
never@2895	1798	case T_FLOAT : ek_ret = _adapter_opt_return_float; break;
never@2895	1799	case T_DOUBLE : ek_ret = _adapter_opt_return_double; break;
never@2895	1800	case T_OBJECT : ek_ret = _adapter_opt_return_ref; break;
never@2895	1801	case T_VOID : ek_ret = _adapter_opt_return_void; break;
never@2895	1802	default : ShouldNotReachHere();
never@2895	1803	}
never@2895	1804	if (dest == T_OBJECT && dest_slot_constant >= 0) {
never@2895	1805	EntryKind ek_try = EntryKind(_adapter_opt_return_S0_ref + dest_slot_constant);
never@2895	1806	if (ek_try <= _adapter_opt_return_LAST &&
never@2895	1807	ek_adapter_opt_return_slot(ek_try) == dest_slot_constant) {
never@2895	1808	ek_ret = ek_try;
never@2895	1809	}
never@2895	1810	}
never@2895	1811	assert(ek_adapter_opt_return_type(ek_ret) == dest, "");
never@2895	1812	}
never@2895	1813
never@2895	1814	// Already pushed: ... keep1 | collect | keep2 | sender_pc |
never@2895	1815	// push(sender_pc);
never@2895	1816
never@2895	1817	// Compute argument base:
never@2895	1818	Register rax_argv = rax_argslot;
never@2895	1819	__ lea(rax_argv, __ argument_address(constant(0)));
never@2895	1820
never@2895	1821	// Push a few extra argument words, if we need them to store the return value.
never@2895	1822	{
never@2895	1823	int extra_slots = 0;
never@2895	1824	if (retain_original_args) {
never@2895	1825	extra_slots = dest_count;
never@2895	1826	} else if (collect_count_constant == -1) {
never@2895	1827	extra_slots = dest_count; // collect_count might be zero; be generous
never@2895	1828	} else if (dest_count > collect_count_constant) {
never@2895	1829	extra_slots = (dest_count - collect_count_constant);
never@2895	1830	} else {
never@2895	1831	// else we know we have enough dead space in |collect| to repurpose for return values
never@2895	1832	}
never@2895	1833	DEBUG_ONLY(extra_slots += 1);
never@2895	1834	if (extra_slots > 0) {
never@2895	1835	__ pop(rbx_temp); // return value
never@2895	1836	__ subptr(rsp, (extra_slots * Interpreter::stackElementSize));
never@2895	1837	// Push guard word #2 in debug mode.
never@2895	1838	DEBUG_ONLY(__ movptr(Address(rsp, 0), (int32_t) RicochetFrame::MAGIC_NUMBER_2));
never@2895	1839	__ push(rbx_temp);
never@2895	1840	}
never@2895	1841	}
never@2895	1842
never@2895	1843	RicochetFrame::enter_ricochet_frame(_masm, rcx_recv, rax_argv,
never@2895	1844	entry(ek_ret)->from_interpreted_entry(), rbx_temp);
never@2895	1845
never@2895	1846	// Now pushed: ... keep1 | collect | keep2 | RF |
never@2895	1847	// some handy frame slots:
never@2895	1848	Address exact_sender_sp_addr = RicochetFrame::frame_address(RicochetFrame::exact_sender_sp_offset_in_bytes());
never@2895	1849	Address conversion_addr = RicochetFrame::frame_address(RicochetFrame::conversion_offset_in_bytes());
never@2895	1850	Address saved_args_base_addr = RicochetFrame::frame_address(RicochetFrame::saved_args_base_offset_in_bytes());
never@2895	1851
never@2895	1852	#ifdef ASSERT
never@2895	1853	if (VerifyMethodHandles && dest != T_CONFLICT) {
never@2895	1854	BLOCK_COMMENT("verify AMH.conv.dest");
never@2895	1855	load_conversion_dest_type(_masm, rbx_temp, conversion_addr);
never@2895	1856	Label L_dest_ok;
never@2895	1857	__ cmpl(rbx_temp, (int) dest);
never@2895	1858	__ jcc(Assembler::equal, L_dest_ok);
never@2895	1859	if (dest == T_INT) {
never@2895	1860	for (int bt = T_BOOLEAN; bt < T_INT; bt++) {
never@2895	1861	if (is_subword_type(BasicType(bt))) {
never@2895	1862	__ cmpl(rbx_temp, (int) bt);
never@2895	1863	__ jcc(Assembler::equal, L_dest_ok);
never@2895	1864	}
never@2895	1865	}
never@2895	1866	}
never@2895	1867	__ stop("bad dest in AMH.conv");
never@2895	1868	__ BIND(L_dest_ok);
never@2895	1869	}
never@2895	1870	#endif //ASSERT
never@2895	1871
never@2895	1872	// Find out where the original copy of the recursive argument sequence begins.
never@2895	1873	Register rax_coll = rax_argv;
never@2895	1874	{
never@2895	1875	RegisterOrConstant collect_slot = collect_slot_constant;
never@2895	1876	if (collect_slot_constant == -1) {
never@2895	1877	__ movl(rdi_temp, rcx_amh_vmargslot);
never@2895	1878	collect_slot = rdi_temp;
never@2895	1879	}
never@2895	1880	if (collect_slot_constant != 0)
never@2895	1881	__ lea(rax_coll, Address(rax_argv, collect_slot, Interpreter::stackElementScale()));
never@2895	1882	// rax_coll now points at the trailing edge of |collect| and leading edge of |keep2|
never@2895	1883	}
never@2895	1884
never@2895	1885	// Replace the old AMH with the recursive MH. (No going back now.)
never@2895	1886	// In the case of a boxing call, the recursive call is to a 'boxer' method,
never@2895	1887	// such as Integer.valueOf or Long.valueOf. In the case of a filter
never@2895	1888	// or collect call, it will take one or more arguments, transform them,
never@2895	1889	// and return some result, to store back into argument_base[vminfo].
never@2895	1890	__ load_heap_oop(rcx_recv, rcx_amh_argument);
never@2895	1891	if (VerifyMethodHandles) verify_method_handle(_masm, rcx_recv);
never@2895	1892
never@2895	1893	// Push a space for the recursively called MH first:
never@2895	1894	__ push((int32_t)NULL_WORD);
never@2895	1895
never@2895	1896	// Calculate |collect|, the number of arguments we are collecting.
never@2895	1897	Register rdi_collect_count = rdi_temp;
never@2895	1898	RegisterOrConstant collect_count;
never@2895	1899	if (collect_count_constant >= 0) {
never@2895	1900	collect_count = collect_count_constant;
never@2895	1901	} else {
never@2895	1902	__ load_method_handle_vmslots(rdi_collect_count, rcx_recv, rdx_temp);
never@2895	1903	collect_count = rdi_collect_count;
never@2895	1904	}
never@2895	1905	#ifdef ASSERT
never@2895	1906	if (VerifyMethodHandles && collect_count_constant >= 0) {
never@2895	1907	__ load_method_handle_vmslots(rbx_temp, rcx_recv, rdx_temp);
never@2895	1908	Label L_count_ok;
never@2895	1909	__ cmpl(rbx_temp, collect_count_constant);
never@2895	1910	__ jcc(Assembler::equal, L_count_ok);
never@2895	1911	__ stop("bad vminfo in AMH.conv");
never@2895	1912	__ BIND(L_count_ok);
never@2895	1913	}
never@2895	1914	#endif //ASSERT
never@2895	1915
never@2895	1916	// copy |collect| slots directly to TOS:
never@2895	1917	push_arg_slots(_masm, rax_coll, collect_count, 0, rbx_temp, rdx_temp);
never@2895	1918	// Now pushed: ... keep1 | collect | keep2 | RF... | collect |
never@2895	1919	// rax_coll still points at the trailing edge of |collect| and leading edge of |keep2|
never@2895	1920
never@2895	1921	// If necessary, adjust the saved arguments to make room for the eventual return value.
never@2895	1922	// Normal adjustment: ... keep1 | +dest+ | -collect- | keep2 | RF... | collect |
never@2895	1923	// If retaining args: ... keep1 | +dest+ | collect | keep2 | RF... | collect |
never@2895	1924	// In the non-retaining case, this might move keep2 either up or down.
never@2895	1925	// We don't have to copy the whole | RF... collect | complex,
never@2895	1926	// but we must adjust RF.saved_args_base.
never@2950	1927	// Also, from now on, we will forget about the original copy of |collect|.
never@2895	1928	// If we are retaining it, we will treat it as part of |keep2|.
never@2895	1929	// For clarity we will define |keep3| = |collect|keep2| or |keep2|.
never@2895	1930
never@2895	1931	BLOCK_COMMENT("adjust trailing arguments {");
never@2895	1932	// Compare the sizes of |+dest+| and |-collect-|, which are opposed opening and closing movements.
never@2895	1933	int open_count = dest_count;
never@2895	1934	RegisterOrConstant close_count = collect_count_constant;
never@2895	1935	Register rdi_close_count = rdi_collect_count;
never@2895	1936	if (retain_original_args) {
never@2895	1937	close_count = constant(0);
never@2895	1938	} else if (collect_count_constant == -1) {
never@2895	1939	close_count = rdi_collect_count;
never@2895	1940	}
never@2895	1941
never@2895	1942	// How many slots need moving? This is simply dest_slot (0 => no |keep3|).
never@2895	1943	RegisterOrConstant keep3_count;
never@2895	1944	Register rsi_keep3_count = rsi; // can repair from RF.exact_sender_sp
never@2895	1945	if (dest_slot_constant >= 0) {
never@2895	1946	keep3_count = dest_slot_constant;
never@2895	1947	} else {
never@2895	1948	load_conversion_vminfo(_masm, rsi_keep3_count, conversion_addr);
never@2895	1949	keep3_count = rsi_keep3_count;
never@2895	1950	}
never@2895	1951	#ifdef ASSERT
never@2895	1952	if (VerifyMethodHandles && dest_slot_constant >= 0) {
never@2895	1953	load_conversion_vminfo(_masm, rbx_temp, conversion_addr);
never@2895	1954	Label L_vminfo_ok;
never@2895	1955	__ cmpl(rbx_temp, dest_slot_constant);
never@2895	1956	__ jcc(Assembler::equal, L_vminfo_ok);
never@2895	1957	__ stop("bad vminfo in AMH.conv");
never@2895	1958	__ BIND(L_vminfo_ok);
never@2895	1959	}
never@2895	1960	#endif //ASSERT
never@2895	1961
never@2895	1962	// tasks remaining:
never@2895	1963	bool move_keep3 = (!keep3_count.is_constant() || keep3_count.as_constant() != 0);
never@2895	1964	bool stomp_dest = (NOT_DEBUG(dest == T_OBJECT) DEBUG_ONLY(dest_count != 0));
never@2895	1965	bool fix_arg_base = (!close_count.is_constant() || open_count != close_count.as_constant());
never@2895	1966
never@2895	1967	if (stomp_dest | fix_arg_base) {
never@2895	1968	// we will probably need an updated rax_argv value
never@2895	1969	if (collect_slot_constant >= 0) {
never@2895	1970	// rax_coll already holds the leading edge of |keep2|, so tweak it
never@2895	1971	assert(rax_coll == rax_argv, "elided a move");
never@2895	1972	if (collect_slot_constant != 0)
never@2895	1973	__ subptr(rax_argv, collect_slot_constant * Interpreter::stackElementSize);
never@2895	1974	} else {
never@2895	1975	// Just reload from RF.saved_args_base.
never@2895	1976	__ movptr(rax_argv, saved_args_base_addr);
never@2895	1977	}
never@2895	1978	}
never@2895	1979
never@2895	1980	// Old and new argument locations (based at slot 0).
never@2895	1981	// Net shift (&new_argv - &old_argv) is (close_count - open_count).
never@2895	1982	bool zero_open_count = (open_count == 0); // remember this bit of info
never@2895	1983	if (move_keep3 && fix_arg_base) {
never@2950	1984	// It will be easier to have everything in one register:
never@2895	1985	if (close_count.is_register()) {
never@2895	1986	// Deduct open_count from close_count register to get a clean +/- value.
never@2895	1987	__ subptr(close_count.as_register(), open_count);
never@2895	1988	} else {
never@2895	1989	close_count = close_count.as_constant() - open_count;
never@2895	1990	}
never@2895	1991	open_count = 0;
never@2895	1992	}
never@2895	1993	Address old_argv(rax_argv, 0);
never@2895	1994	Address new_argv(rax_argv, close_count, Interpreter::stackElementScale(),
never@2895	1995	- open_count * Interpreter::stackElementSize);
never@2895	1996
never@2895	1997	// First decide if any actual data are to be moved.
never@2895	1998	// We can skip if (a) |keep3| is empty, or (b) the argument list size didn't change.
never@2895	1999	// (As it happens, all movements involve an argument list size change.)
never@2895	2000
never@2895	2001	// If there are variable parameters, use dynamic checks to skip around the whole mess.
never@2895	2002	Label L_done;
never@2895	2003	if (!keep3_count.is_constant()) {
never@2895	2004	__ testl(keep3_count.as_register(), keep3_count.as_register());
never@2895	2005	__ jcc(Assembler::zero, L_done);
never@2895	2006	}
never@2895	2007	if (!close_count.is_constant()) {
never@2895	2008	__ cmpl(close_count.as_register(), open_count);
never@2895	2009	__ jcc(Assembler::equal, L_done);
never@2895	2010	}
never@2895	2011
never@2895	2012	if (move_keep3 && fix_arg_base) {
never@2895	2013	bool emit_move_down = false, emit_move_up = false, emit_guard = false;
never@2895	2014	if (!close_count.is_constant()) {
never@2895	2015	emit_move_down = emit_guard = !zero_open_count;
never@2895	2016	emit_move_up = true;
never@2895	2017	} else if (open_count != close_count.as_constant()) {
never@2895	2018	emit_move_down = (open_count > close_count.as_constant());
never@2895	2019	emit_move_up = !emit_move_down;
never@2895	2020	}
never@2895	2021	Label L_move_up;
never@2895	2022	if (emit_guard) {
never@2895	2023	__ cmpl(close_count.as_register(), open_count);
never@2895	2024	__ jcc(Assembler::greater, L_move_up);
never@2895	2025	}
never@2895	2026
never@2895	2027	if (emit_move_down) {
never@2895	2028	// Move arguments down if |+dest+| > |-collect-|
never@2895	2029	// (This is rare, except when arguments are retained.)
never@2895	2030	// This opens space for the return value.
never@2895	2031	if (keep3_count.is_constant()) {
never@2895	2032	for (int i = 0; i < keep3_count.as_constant(); i++) {
never@2895	2033	__ movptr(rdx_temp, old_argv.plus_disp(i * Interpreter::stackElementSize));
never@2895	2034	__ movptr( new_argv.plus_disp(i * Interpreter::stackElementSize), rdx_temp);
never@2895	2035	}
never@2895	2036	} else {
never@2895	2037	Register rbx_argv_top = rbx_temp;
never@2895	2038	__ lea(rbx_argv_top, old_argv.plus_disp(keep3_count, Interpreter::stackElementScale()));
never@2895	2039	move_arg_slots_down(_masm,
never@2895	2040	old_argv, // beginning of old argv
never@2895	2041	rbx_argv_top, // end of old argv
never@2895	2042	close_count, // distance to move down (must be negative)
never@2895	2043	rax_argv, rdx_temp);
never@2895	2044	// Used argv as an iteration variable; reload from RF.saved_args_base.
never@2895	2045	__ movptr(rax_argv, saved_args_base_addr);
never@2895	2046	}
never@2895	2047	}
never@2895	2048
never@2895	2049	if (emit_guard) {
never@2895	2050	__ jmp(L_done); // assumes emit_move_up is true also
never@2895	2051	__ BIND(L_move_up);
never@2895	2052	}
never@2895	2053
never@2895	2054	if (emit_move_up) {
never@2895	2055
never@2895	2056	// Move arguments up if |+dest+| < |-collect-|
never@2895	2057	// (This is usual, except when |keep3| is empty.)
never@2895	2058	// This closes up the space occupied by the now-deleted collect values.
never@2895	2059	if (keep3_count.is_constant()) {
never@2895	2060	for (int i = keep3_count.as_constant() - 1; i >= 0; i--) {
never@2895	2061	__ movptr(rdx_temp, old_argv.plus_disp(i * Interpreter::stackElementSize));
never@2895	2062	__ movptr( new_argv.plus_disp(i * Interpreter::stackElementSize), rdx_temp);
never@2895	2063	}
never@2895	2064	} else {
never@2895	2065	Address argv_top = old_argv.plus_disp(keep3_count, Interpreter::stackElementScale());
never@2895	2066	move_arg_slots_up(_masm,
never@2895	2067	rax_argv, // beginning of old argv
never@2895	2068	argv_top, // end of old argv
never@2895	2069	close_count, // distance to move up (must be positive)
never@2895	2070	rbx_temp, rdx_temp);
never@2895	2071	}
never@2895	2072	}
never@2895	2073	}
never@2895	2074	__ BIND(L_done);
never@2895	2075
never@2895	2076	if (fix_arg_base) {
never@2895	2077	// adjust RF.saved_args_base by adding (close_count - open_count)
never@2895	2078	if (!new_argv.is_same_address(Address(rax_argv, 0)))
never@2895	2079	__ lea(rax_argv, new_argv);
never@2895	2080	__ movptr(saved_args_base_addr, rax_argv);
never@2895	2081	}
never@2895	2082
never@2895	2083	if (stomp_dest) {
never@2895	2084	// Stomp the return slot, so it doesn't hold garbage.
never@2895	2085	// This isn't strictly necessary, but it may help detect bugs.
never@2895	2086	int forty_two = RicochetFrame::RETURN_VALUE_PLACEHOLDER;
never@2895	2087	__ movptr(Address(rax_argv, keep3_count, Address::times_ptr),
never@2895	2088	(int32_t) forty_two);
never@2895	2089	// uses rsi_keep3_count
never@2895	2090	}
never@2895	2091	BLOCK_COMMENT("} adjust trailing arguments");
never@2895	2092
never@2895	2093	BLOCK_COMMENT("do_recursive_call");
never@2895	2094	__ mov(saved_last_sp, rsp); // set rsi/r13 for callee
never@2895	2095	__ pushptr(ExternalAddress(SharedRuntime::ricochet_blob()->bounce_addr()).addr());
never@2895	2096	// The globally unique bounce address has two purposes:
never@2895	2097	// 1. It helps the JVM recognize this frame (frame::is_ricochet_frame).
never@2895	2098	// 2. When returned to, it cuts back the stack and redirects control flow
never@2895	2099	// to the return handler.
never@2895	2100	// The return handler will further cut back the stack when it takes
never@2895	2101	// down the RF. Perhaps there is a way to streamline this further.
never@2895	2102
never@2895	2103	// State during recursive call:
never@2895	2104	// ... keep1 | dest | dest=42 | keep3 | RF... | collect | bounce_pc |
never@2895	2105	__ jump_to_method_handle_entry(rcx_recv, rdx_temp);
never@2895	2106
never@2895	2107	break;
never@2895	2108	}
never@2895	2109
never@2895	2110	case _adapter_opt_return_ref:
never@2895	2111	case _adapter_opt_return_int:
never@2895	2112	case _adapter_opt_return_long:
never@2895	2113	case _adapter_opt_return_float:
never@2895	2114	case _adapter_opt_return_double:
never@2895	2115	case _adapter_opt_return_void:
never@2895	2116	case _adapter_opt_return_S0_ref:
never@2895	2117	case _adapter_opt_return_S1_ref:
never@2895	2118	case _adapter_opt_return_S2_ref:
never@2895	2119	case _adapter_opt_return_S3_ref:
never@2895	2120	case _adapter_opt_return_S4_ref:
never@2895	2121	case _adapter_opt_return_S5_ref:
never@2895	2122	{
never@2895	2123	BasicType dest_type_constant = ek_adapter_opt_return_type(ek);
never@2895	2124	int dest_slot_constant = ek_adapter_opt_return_slot(ek);
never@2895	2125
never@2895	2126	if (VerifyMethodHandles) RicochetFrame::verify_clean(_masm);
never@2895	2127
never@2895	2128	if (dest_slot_constant == -1) {
never@2895	2129	// The current stub is a general handler for this dest_type.
never@2895	2130	// It can be called from _adapter_opt_return_any below.
never@2895	2131	// Stash the address in a little table.
never@2895	2132	assert((dest_type_constant & CONV_TYPE_MASK) == dest_type_constant, "oob");
never@2895	2133	address return_handler = __ pc();
never@2895	2134	_adapter_return_handlers[dest_type_constant] = return_handler;
never@2895	2135	if (dest_type_constant == T_INT) {
never@2895	2136	// do the subword types too
never@2895	2137	for (int bt = T_BOOLEAN; bt < T_INT; bt++) {
never@2895	2138	if (is_subword_type(BasicType(bt)) &&
never@2895	2139	_adapter_return_handlers[bt] == NULL) {
never@2895	2140	_adapter_return_handlers[bt] = return_handler;
never@2895	2141	}
never@2895	2142	}
never@2895	2143	}
never@2895	2144	}
never@2895	2145
never@2895	2146	Register rbx_arg_base = rbx_temp;
never@2895	2147	assert_different_registers(rax, rdx, // possibly live return value registers
never@2895	2148	rdi_temp, rbx_arg_base);
never@2895	2149
never@2895	2150	Address conversion_addr = RicochetFrame::frame_address(RicochetFrame::conversion_offset_in_bytes());
never@2895	2151	Address saved_args_base_addr = RicochetFrame::frame_address(RicochetFrame::saved_args_base_offset_in_bytes());
never@2895	2152
never@2895	2153	__ movptr(rbx_arg_base, saved_args_base_addr);
never@2895	2154	RegisterOrConstant dest_slot = dest_slot_constant;
never@2895	2155	if (dest_slot_constant == -1) {
never@2895	2156	load_conversion_vminfo(_masm, rdi_temp, conversion_addr);
never@2895	2157	dest_slot = rdi_temp;
never@2895	2158	}
never@2895	2159	// Store the result back into the argslot.
never@2895	2160	// This code uses the interpreter calling sequence, in which the return value
never@2895	2161	// is usually left in the TOS register, as defined by InterpreterMacroAssembler::pop.
never@2895	2162	// There are certain irregularities with floating point values, which can be seen
never@2895	2163	// in TemplateInterpreterGenerator::generate_return_entry_for.
never@2895	2164	move_return_value(_masm, dest_type_constant, Address(rbx_arg_base, dest_slot, Interpreter::stackElementScale()));
never@2895	2165
never@2895	2166	RicochetFrame::leave_ricochet_frame(_masm, rcx_recv, rbx_arg_base, rdx_temp);
never@2895	2167	__ push(rdx_temp); // repush the return PC
never@2895	2168
never@2895	2169	// Load the final target and go.
never@2895	2170	if (VerifyMethodHandles) verify_method_handle(_masm, rcx_recv);
never@2895	2171	__ jump_to_method_handle_entry(rcx_recv, rdx_temp);
never@2895	2172	__ hlt(); // --------------------
never@2895	2173	break;
never@2895	2174	}
never@2895	2175
never@2895	2176	case _adapter_opt_return_any:
never@2895	2177	{
never@2895	2178	if (VerifyMethodHandles) RicochetFrame::verify_clean(_masm);
never@2895	2179	Register rdi_conv = rdi_temp;
never@2895	2180	assert_different_registers(rax, rdx, // possibly live return value registers
never@2895	2181	rdi_conv, rbx_temp);
never@2895	2182
never@2895	2183	Address conversion_addr = RicochetFrame::frame_address(RicochetFrame::conversion_offset_in_bytes());
never@2895	2184	load_conversion_dest_type(_masm, rdi_conv, conversion_addr);
never@2895	2185	__ lea(rbx_temp, ExternalAddress((address) &_adapter_return_handlers[0]));
never@2895	2186	__ movptr(rbx_temp, Address(rbx_temp, rdi_conv, Address::times_ptr));
never@2895	2187
never@2895	2188	#ifdef ASSERT
never@2895	2189	{ Label L_badconv;
never@2895	2190	__ testptr(rbx_temp, rbx_temp);
never@2895	2191	__ jccb(Assembler::zero, L_badconv);
never@2895	2192	__ jmp(rbx_temp);
never@2895	2193	__ bind(L_badconv);
never@2895	2194	__ stop("bad method handle return");
never@2895	2195	}
never@2895	2196	#else //ASSERT
never@2895	2197	__ jmp(rbx_temp);
never@2895	2198	#endif //ASSERT
never@2895	2199	break;
never@2895	2200	}
never@2895	2201
jrose@1145	2202	case _adapter_opt_spread_0:
never@2895	2203	case _adapter_opt_spread_1_ref:
never@2895	2204	case _adapter_opt_spread_2_ref:
never@2895	2205	case _adapter_opt_spread_3_ref:
never@2895	2206	case _adapter_opt_spread_4_ref:
never@2895	2207	case _adapter_opt_spread_5_ref:
never@2895	2208	case _adapter_opt_spread_ref:
never@2895	2209	case _adapter_opt_spread_byte:
never@2895	2210	case _adapter_opt_spread_char:
never@2895	2211	case _adapter_opt_spread_short:
never@2895	2212	case _adapter_opt_spread_int:
never@2895	2213	case _adapter_opt_spread_long:
never@2895	2214	case _adapter_opt_spread_float:
never@2895	2215	case _adapter_opt_spread_double:
jrose@1145	2216	{
jrose@1145	2217	// spread an array out into a group of arguments
never@2895	2218	int length_constant = ek_adapter_opt_spread_count(ek);
never@2895	2219	bool length_can_be_zero = (length_constant == 0);
never@2895	2220	if (length_constant < 0) {
never@2895	2221	// some adapters with variable length must handle the zero case
never@2895	2222	if (!OptimizeMethodHandles ||
never@2895	2223	ek_adapter_opt_spread_type(ek) != T_OBJECT)
never@2895	2224	length_can_be_zero = true;
never@2895	2225	}
jrose@1145	2226
jrose@1145	2227	// find the address of the array argument
jrose@1145	2228	__ movl(rax_argslot, rcx_amh_vmargslot);
jrose@1145	2229	__ lea(rax_argslot, __ argument_address(rax_argslot));
jrose@1145	2230
never@2895	2231	// grab another temp
never@2895	2232	Register rsi_temp = rsi;
never@2895	2233	{ if (rsi_temp == saved_last_sp) __ push(saved_last_sp); }
never@2895	2234	// (preceding push must be done after argslot address is taken!)
never@2895	2235	#define UNPUSH_RSI \
never@2895	2236	{ if (rsi_temp == saved_last_sp) __ pop(saved_last_sp); }
jrose@1145	2237
jrose@1145	2238	// arx_argslot points both to the array and to the first output arg
jrose@1145	2239	vmarg = Address(rax_argslot, 0);
jrose@1145	2240
jrose@1145	2241	// Get the array value.
never@2895	2242	Register rsi_array = rsi_temp;
jrose@1145	2243	Register rdx_array_klass = rdx_temp;
never@2895	2244	BasicType elem_type = ek_adapter_opt_spread_type(ek);
never@2895	2245	int elem_slots = type2size[elem_type]; // 1 or 2
never@2895	2246	int array_slots = 1; // array is always a T_OBJECT
jrose@1145	2247	int length_offset = arrayOopDesc::length_offset_in_bytes();
jrose@1145	2248	int elem0_offset = arrayOopDesc::base_offset_in_bytes(elem_type);
jrose@1145	2249	__ movptr(rsi_array, vmarg);
never@2895	2250
never@2895	2251	Label L_array_is_empty, L_insert_arg_space, L_copy_args, L_args_done;
never@2895	2252	if (length_can_be_zero) {
never@2895	2253	// handle the null pointer case, if zero is allowed
never@2895	2254	Label L_skip;
never@2895	2255	if (length_constant < 0) {
never@2895	2256	load_conversion_vminfo(_masm, rbx_temp, rcx_amh_conversion);
never@2895	2257	__ testl(rbx_temp, rbx_temp);
never@2895	2258	__ jcc(Assembler::notZero, L_skip);
never@2895	2259	}
jrose@1145	2260	__ testptr(rsi_array, rsi_array);
never@2895	2261	__ jcc(Assembler::zero, L_array_is_empty);
never@2895	2262	__ bind(L_skip);
jrose@1145	2263	}
jrose@1145	2264	__ null_check(rsi_array, oopDesc::klass_offset_in_bytes());
jrose@1145	2265	__ load_klass(rdx_array_klass, rsi_array);
jrose@1145	2266
jrose@1145	2267	// Check the array type.
jrose@1145	2268	Register rbx_klass = rbx_temp;
twisti@2201	2269	__ load_heap_oop(rbx_klass, rcx_amh_argument); // this is a Class object!
never@2895	2270	load_klass_from_Class(_masm, rbx_klass);
jrose@1145	2271
jrose@1145	2272	Label ok_array_klass, bad_array_klass, bad_array_length;
never@2895	2273	__ check_klass_subtype(rdx_array_klass, rbx_klass, rdi_temp, ok_array_klass);
jrose@1145	2274	// If we get here, the type check failed!
jrose@1145	2275	__ jmp(bad_array_klass);
never@2895	2276	__ BIND(ok_array_klass);
jrose@1145	2277
jrose@1145	2278	// Check length.
jrose@1145	2279	if (length_constant >= 0) {
jrose@1145	2280	__ cmpl(Address(rsi_array, length_offset), length_constant);
jrose@1145	2281	} else {
jrose@1145	2282	Register rbx_vminfo = rbx_temp;
never@2895	2283	load_conversion_vminfo(_masm, rbx_vminfo, rcx_amh_conversion);
jrose@1145	2284	__ cmpl(rbx_vminfo, Address(rsi_array, length_offset));
jrose@1145	2285	}
jrose@1145	2286	__ jcc(Assembler::notEqual, bad_array_length);
jrose@1145	2287
jrose@1145	2288	Register rdx_argslot_limit = rdx_temp;
jrose@1145	2289
jrose@1145	2290	// Array length checks out. Now insert any required stack slots.
jrose@1145	2291	if (length_constant == -1) {
jrose@1145	2292	// Form a pointer to the end of the affected region.
twisti@1861	2293	__ lea(rdx_argslot_limit, Address(rax_argslot, Interpreter::stackElementSize));
jrose@1145	2294	// 'stack_move' is negative number of words to insert
never@2895	2295	// This number already accounts for elem_slots.
never@2895	2296	Register rdi_stack_move = rdi_temp;
never@2895	2297	load_stack_move(_masm, rdi_stack_move, rcx_recv, true);
never@2895	2298	__ cmpptr(rdi_stack_move, 0);
never@2895	2299	assert(stack_move_unit() < 0, "else change this comparison");
never@2895	2300	__ jcc(Assembler::less, L_insert_arg_space);
never@2895	2301	__ jcc(Assembler::equal, L_copy_args);
never@2895	2302	// single argument case, with no array movement
never@2895	2303	__ BIND(L_array_is_empty);
never@2895	2304	remove_arg_slots(_masm, -stack_move_unit() * array_slots,
never@2895	2305	rax_argslot, rbx_temp, rdx_temp);
never@2895	2306	__ jmp(L_args_done); // no spreading to do
never@2895	2307	__ BIND(L_insert_arg_space);
never@2895	2308	// come here in the usual case, stack_move < 0 (2 or more spread arguments)
jrose@1145	2309	Register rsi_temp = rsi_array; // spill this
never@2895	2310	insert_arg_slots(_masm, rdi_stack_move,
jrose@1145	2311	rax_argslot, rbx_temp, rsi_temp);
never@2895	2312	// reload the array since rsi was killed
never@2895	2313	// reload from rdx_argslot_limit since rax_argslot is now decremented
never@2895	2314	__ movptr(rsi_array, Address(rdx_argslot_limit, -Interpreter::stackElementSize));
never@2895	2315	} else if (length_constant >= 1) {
never@2895	2316	int new_slots = (length_constant * elem_slots) - array_slots;
never@2895	2317	insert_arg_slots(_masm, new_slots * stack_move_unit(),
jrose@1145	2318	rax_argslot, rbx_temp, rdx_temp);
jrose@1145	2319	} else if (length_constant == 0) {
never@2895	2320	__ BIND(L_array_is_empty);
never@2895	2321	remove_arg_slots(_masm, -stack_move_unit() * array_slots,
jrose@1145	2322	rax_argslot, rbx_temp, rdx_temp);
never@2895	2323	} else {
never@2895	2324	ShouldNotReachHere();
jrose@1145	2325	}
jrose@1145	2326
jrose@1145	2327	// Copy from the array to the new slots.
jrose@1145	2328	// Note: Stack change code preserves integrity of rax_argslot pointer.
jrose@1145	2329	// So even after slot insertions, rax_argslot still points to first argument.
never@2895	2330	// Beware: Arguments that are shallow on the stack are deep in the array,
never@2895	2331	// and vice versa. So a downward-growing stack (the usual) has to be copied
never@2895	2332	// elementwise in reverse order from the source array.
never@2895	2333	__ BIND(L_copy_args);
jrose@1145	2334	if (length_constant == -1) {
jrose@1145	2335	// [rax_argslot, rdx_argslot_limit) is the area we are inserting into.
never@2895	2336	// Array element [0] goes at rdx_argslot_limit[-wordSize].
jrose@1145	2337	Register rsi_source = rsi_array;
jrose@1145	2338	__ lea(rsi_source, Address(rsi_array, elem0_offset));
never@2895	2339	Register rdx_fill_ptr = rdx_argslot_limit;
jrose@1145	2340	Label loop;
never@2895	2341	__ BIND(loop);
never@2895	2342	__ addptr(rdx_fill_ptr, -Interpreter::stackElementSize * elem_slots);
never@2895	2343	move_typed_arg(_masm, elem_type, true,
never@2895	2344	Address(rdx_fill_ptr, 0), Address(rsi_source, 0),
never@2895	2345	rbx_temp, rdi_temp);
jrose@1145	2346	__ addptr(rsi_source, type2aelembytes(elem_type));
never@2895	2347	__ cmpptr(rdx_fill_ptr, rax_argslot);
twisti@2903	2348	__ jcc(Assembler::above, loop);
jrose@1145	2349	} else if (length_constant == 0) {
jrose@1145	2350	// nothing to copy
jrose@1145	2351	} else {
jrose@1145	2352	int elem_offset = elem0_offset;
never@2895	2353	int slot_offset = length_constant * Interpreter::stackElementSize;
jrose@1145	2354	for (int index = 0; index < length_constant; index++) {
never@2895	2355	slot_offset -= Interpreter::stackElementSize * elem_slots; // fill backward
never@2895	2356	move_typed_arg(_masm, elem_type, true,
never@2895	2357	Address(rax_argslot, slot_offset), Address(rsi_array, elem_offset),
never@2895	2358	rbx_temp, rdi_temp);
jrose@1145	2359	elem_offset += type2aelembytes(elem_type);
jrose@1145	2360	}
jrose@1145	2361	}
never@2895	2362	__ BIND(L_args_done);
jrose@1145	2363
jrose@1145	2364	// Arguments are spread. Move to next method handle.
never@2895	2365	UNPUSH_RSI;
twisti@2201	2366	__ load_heap_oop(rcx_recv, rcx_mh_vmtarget);
jrose@1145	2367	__ jump_to_method_handle_entry(rcx_recv, rdx_temp);
jrose@1145	2368
jrose@1145	2369	__ bind(bad_array_klass);
never@2895	2370	UNPUSH_RSI;
twisti@2411	2371	assert(!vmarg.uses(rarg2_required), "must be different registers");
never@2895	2372	__ load_heap_oop( rarg2_required, Address(rdx_array_klass, java_mirror_offset)); // required type
never@2895	2373	__ movptr( rarg1_actual, vmarg); // bad array
never@2895	2374	__ movl( rarg0_code, (int) Bytecodes::_aaload); // who is complaining?
jrose@1474	2375	__ jump(ExternalAddress(from_interpreted_entry(_raise_exception)));
jrose@1145	2376
jrose@1145	2377	__ bind(bad_array_length);
never@2895	2378	UNPUSH_RSI;
twisti@2411	2379	assert(!vmarg.uses(rarg2_required), "must be different registers");
never@2895	2380	__ mov( rarg2_required, rcx_recv); // AMH requiring a certain length
never@2895	2381	__ movptr( rarg1_actual, vmarg); // bad array
never@2895	2382	__ movl( rarg0_code, (int) Bytecodes::_arraylength); // who is complaining?
jrose@1474	2383	__ jump(ExternalAddress(from_interpreted_entry(_raise_exception)));
never@2895	2384	#undef UNPUSH_RSI
jrose@1145	2385
never@2895	2386	break;
jrose@1145	2387	}
jrose@1145	2388
never@2895	2389	default:
never@2895	2390	// do not require all platforms to recognize all adapter types
never@2895	2391	__ nop();
never@2895	2392	return;
jrose@1145	2393	}
never@2950	2394	BLOCK_COMMENT(err_msg("} Entry %s", entry_name(ek)));
jrose@1145	2395	__ hlt();
jrose@1145	2396
jrose@1145	2397	address me_cookie = MethodHandleEntry::start_compiled_entry(_masm, interp_entry);
jrose@1145	2398	__ unimplemented(entry_name(ek)); // %%% FIXME: NYI
jrose@1145	2399
jrose@1145	2400	init_entry(ek, MethodHandleEntry::finish_compiled_entry(_masm, me_cookie));
jrose@1145	2401	}