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

src/cpu/sparc/vm/methodHandles_sparc.cpp@5dbed2f542ff (annotated)

src/cpu/sparc/vm/methodHandles_sparc.cpp

Thu, 26 Jan 2012 16:49:22 +0100

author

bdelsart

date

Thu, 26 Jan 2012 16:49:22 +0100

changeset 3451

5dbed2f542ff

parent 3445

82e5a84b7436

child 3969

1d7922586cf6

permissions

-rw-r--r--

7120468: SPARC/x86: use frame::describe to enhance trace_method_handle
Summary: improvements of TraceMethodHandles for JSR292
Reviewed-by: never, twisti

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