src/cpu/sparc/vm/methodHandles_sparc.cpp

Thu, 21 Jul 2011 11:25:07 -0700

author
kvn
date
Thu, 21 Jul 2011 11:25:07 -0700
changeset 3037
3d42f82cd811
parent 3005
341a57af9b0a
child 3046
a19c671188cb
permissions
-rw-r--r--

7063628: Use cbcond on T4
Summary: Add new short branch instruction to Hotspot sparc assembler.
Reviewed-by: never, twisti, jrose

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

mercurial