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