1 /* 2 * Copyright (c) 2014, 2026, Oracle and/or its affiliates. All rights reserved. 3 * Copyright (c) 2015, 2026 SAP SE. All rights reserved. 4 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 5 * 6 * This code is free software; you can redistribute it and/or modify it 7 * under the terms of the GNU General Public License version 2 only, as 8 * published by the Free Software Foundation. 9 * 10 * This code is distributed in the hope that it will be useful, but WITHOUT 11 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 12 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 13 * version 2 for more details (a copy is included in the LICENSE file that 14 * accompanied this code). 15 * 16 * You should have received a copy of the GNU General Public License version 17 * 2 along with this work; if not, write to the Free Software Foundation, 18 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 19 * 20 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 21 * or visit www.oracle.com if you need additional information or have any 22 * questions. 23 * 24 */ 25 26 #include "asm/macroAssembler.inline.hpp" 27 #include "classfile/javaClasses.hpp" 28 #include "compiler/disassembler.hpp" 29 #include "gc/shared/barrierSetAssembler.hpp" 30 #include "interpreter/bytecodeHistogram.hpp" 31 #include "interpreter/interpreter.hpp" 32 #include "interpreter/interpreterRuntime.hpp" 33 #include "interpreter/interp_masm.hpp" 34 #include "interpreter/templateInterpreterGenerator.hpp" 35 #include "interpreter/templateTable.hpp" 36 #include "oops/arrayOop.hpp" 37 #include "oops/method.hpp" 38 #include "oops/methodCounters.hpp" 39 #include "oops/methodData.hpp" 40 #include "oops/oop.inline.hpp" 41 #include "oops/resolvedIndyEntry.hpp" 42 #include "oops/resolvedMethodEntry.hpp" 43 #include "prims/jvmtiExport.hpp" 44 #include "prims/jvmtiThreadState.hpp" 45 #include "runtime/arguments.hpp" 46 #include "runtime/deoptimization.hpp" 47 #include "runtime/frame.inline.hpp" 48 #include "runtime/jniHandles.hpp" 49 #include "runtime/sharedRuntime.hpp" 50 #include "runtime/stubRoutines.hpp" 51 #include "runtime/synchronizer.hpp" 52 #include "runtime/timer.hpp" 53 #include "runtime/vframeArray.hpp" 54 #include "runtime/vm_version.hpp" 55 #include "utilities/debug.hpp" 56 #include "utilities/macros.hpp" 57 58 #undef __ 59 #define __ Disassembler::hook<InterpreterMacroAssembler>(__FILE__, __LINE__, _masm)-> 60 61 // Size of interpreter code. Increase if too small. Interpreter will 62 // fail with a guarantee ("not enough space for interpreter generation"); 63 // if too small. 64 // Run with +PrintInterpreter to get the VM to print out the size. 65 // Max size with JVMTI 66 int TemplateInterpreter::InterpreterCodeSize = 256*K; 67 68 #ifdef PRODUCT 69 #define BLOCK_COMMENT(str) /* nothing */ 70 #else 71 #define BLOCK_COMMENT(str) __ block_comment(str) 72 #endif 73 74 #define BIND(label) __ bind(label); BLOCK_COMMENT(#label ":") 75 76 //----------------------------------------------------------------------------- 77 78 address TemplateInterpreterGenerator::generate_slow_signature_handler() { 79 // Slow_signature handler that respects the PPC C calling conventions. 80 // 81 // We get called by the native entry code with our output register 82 // area == 8. First we call InterpreterRuntime::get_result_handler 83 // to copy the pointer to the signature string temporarily to the 84 // first C-argument and to return the result_handler in 85 // R3_RET. Since native_entry will copy the jni-pointer to the 86 // first C-argument slot later on, it is OK to occupy this slot 87 // temporarily. Then we copy the argument list on the java 88 // expression stack into native varargs format on the native stack 89 // and load arguments into argument registers. Integer arguments in 90 // the varargs vector will be sign-extended to 8 bytes. 91 // 92 // On entry: 93 // R3_ARG1 - intptr_t* Address of java argument list in memory. 94 // R15_prev_state - BytecodeInterpreter* Address of interpreter state for 95 // this method 96 // R19_method 97 // 98 // On exit (just before return instruction): 99 // R3_RET - contains the address of the result_handler. 100 // R4_ARG2 - is not updated for static methods and contains "this" otherwise. 101 // R5_ARG3-R10_ARG8: - When the (i-2)th Java argument is not of type float or double, 102 // ARGi contains this argument. Otherwise, ARGi is not updated. 103 // F1_ARG1-F13_ARG13 - contain the first 13 arguments of type float or double. 104 105 const int LogSizeOfTwoInstructions = 3; 106 107 // FIXME: use Argument:: GL: Argument names different numbers! 108 const int max_fp_register_arguments = 13; 109 const int max_int_register_arguments = 6; // first 2 are reserved 110 111 const Register arg_java = R21_tmp1; 112 const Register arg_c = R22_tmp2; 113 const Register signature = R23_tmp3; // is string 114 const Register sig_byte = R24_tmp4; 115 const Register fpcnt = R25_tmp5; 116 const Register argcnt = R26_tmp6; 117 const Register intSlot = R27_tmp7; 118 const Register target_sp = R28_tmp8; 119 const FloatRegister floatSlot = F0; 120 121 address entry = __ function_entry(); 122 int save_nonvolatile_registers_size = __ save_nonvolatile_registers_size(false, false); 123 124 __ save_LR(R0); 125 __ save_nonvolatile_registers(R1_SP, -save_nonvolatile_registers_size, false, false); 126 // We use target_sp for storing arguments in the C frame. 127 __ mr(target_sp, R1_SP); 128 __ push_frame(frame::native_abi_reg_args_size + save_nonvolatile_registers_size, R11_scratch1); 129 130 __ mr(arg_java, R3_ARG1); 131 132 __ call_VM_leaf(CAST_FROM_FN_PTR(address, InterpreterRuntime::get_signature), R16_thread, R19_method); 133 134 // Signature is in R3_RET. Signature is callee saved. 135 __ mr(signature, R3_RET); 136 137 // Get the result handler. 138 __ call_VM_leaf(CAST_FROM_FN_PTR(address, InterpreterRuntime::get_result_handler), R16_thread, R19_method); 139 140 { 141 Label L; 142 // test if static 143 // _access_flags._flags must be at offset 0. 144 // TODO PPC port: requires change in shared code. 145 //assert(in_bytes(AccessFlags::flags_offset()) == 0, 146 // "MethodDesc._access_flags == MethodDesc._access_flags._flags"); 147 // _access_flags must be a 16 bit value. 148 assert(sizeof(AccessFlags) == 2, "wrong size"); 149 __ lhz(R11_scratch1/*access_flags*/, method_(access_flags)); 150 // testbit with condition register. 151 __ testbitdi(CR0, R0, R11_scratch1/*access_flags*/, JVM_ACC_STATIC_BIT); 152 __ btrue(CR0, L); 153 // For non-static functions, pass "this" in R4_ARG2 and copy it 154 // to 2nd C-arg slot. 155 // We need to box the Java object here, so we use arg_java 156 // (address of current Java stack slot) as argument and don't 157 // dereference it as in case of ints, floats, etc. 158 __ mr(R4_ARG2, arg_java); 159 __ addi(arg_java, arg_java, -BytesPerWord); 160 __ std(R4_ARG2, _abi0(carg_2), target_sp); 161 __ bind(L); 162 } 163 164 // Will be incremented directly after loop_start. argcnt=0 165 // corresponds to 3rd C argument. 166 __ li(argcnt, -1); 167 // arg_c points to 3rd C argument 168 __ addi(arg_c, target_sp, _abi0(carg_3)); 169 // no floating-point args parsed so far 170 __ li(fpcnt, 0); 171 172 Label move_intSlot_to_ARG, move_floatSlot_to_FARG; 173 Label loop_start, loop_end; 174 Label do_int, do_long, do_float, do_double, do_dontreachhere, do_object, do_array, do_boxed; 175 176 // signature points to '(' at entry 177 #ifdef ASSERT 178 __ lbz(sig_byte, 0, signature); 179 __ cmplwi(CR0, sig_byte, '('); 180 __ bne(CR0, do_dontreachhere); 181 #endif 182 183 __ bind(loop_start); 184 185 __ addi(argcnt, argcnt, 1); 186 __ lbzu(sig_byte, 1, signature); 187 188 __ cmplwi(CR0, sig_byte, ')'); // end of signature 189 __ beq(CR0, loop_end); 190 191 __ cmplwi(CR0, sig_byte, 'B'); // byte 192 __ beq(CR0, do_int); 193 194 __ cmplwi(CR0, sig_byte, 'C'); // char 195 __ beq(CR0, do_int); 196 197 __ cmplwi(CR0, sig_byte, 'D'); // double 198 __ beq(CR0, do_double); 199 200 __ cmplwi(CR0, sig_byte, 'F'); // float 201 __ beq(CR0, do_float); 202 203 __ cmplwi(CR0, sig_byte, 'I'); // int 204 __ beq(CR0, do_int); 205 206 __ cmplwi(CR0, sig_byte, 'J'); // long 207 __ beq(CR0, do_long); 208 209 __ cmplwi(CR0, sig_byte, 'S'); // short 210 __ beq(CR0, do_int); 211 212 __ cmplwi(CR0, sig_byte, 'Z'); // boolean 213 __ beq(CR0, do_int); 214 215 __ cmplwi(CR0, sig_byte, 'L'); // object 216 __ beq(CR0, do_object); 217 218 __ cmplwi(CR0, sig_byte, '['); // array 219 __ beq(CR0, do_array); 220 221 // __ cmplwi(CR0, sig_byte, 'V'); // void cannot appear since we do not parse the return type 222 // __ beq(CR0, do_void); 223 224 __ bind(do_dontreachhere); 225 226 __ unimplemented("ShouldNotReachHere in slow_signature_handler"); 227 228 __ bind(do_array); 229 230 { 231 Label start_skip, end_skip; 232 233 __ bind(start_skip); 234 __ lbzu(sig_byte, 1, signature); 235 __ cmplwi(CR0, sig_byte, '['); 236 __ beq(CR0, start_skip); // skip further brackets 237 __ cmplwi(CR0, sig_byte, '9'); 238 __ bgt(CR0, end_skip); // no optional size 239 __ cmplwi(CR0, sig_byte, '0'); 240 __ bge(CR0, start_skip); // skip optional size 241 __ bind(end_skip); 242 243 __ cmplwi(CR0, sig_byte, 'L'); 244 __ beq(CR0, do_object); // for arrays of objects, the name of the object must be skipped 245 __ b(do_boxed); // otherwise, go directly to do_boxed 246 } 247 248 __ bind(do_object); 249 { 250 Label L; 251 __ bind(L); 252 __ lbzu(sig_byte, 1, signature); 253 __ cmplwi(CR0, sig_byte, ';'); 254 __ bne(CR0, L); 255 } 256 // Need to box the Java object here, so we use arg_java (address of 257 // current Java stack slot) as argument and don't dereference it as 258 // in case of ints, floats, etc. 259 Label do_null; 260 __ bind(do_boxed); 261 __ ld(R0,0, arg_java); 262 __ cmpdi(CR0, R0, 0); 263 __ li(intSlot,0); 264 __ beq(CR0, do_null); 265 __ mr(intSlot, arg_java); 266 __ bind(do_null); 267 __ std(intSlot, 0, arg_c); 268 __ addi(arg_java, arg_java, -BytesPerWord); 269 __ addi(arg_c, arg_c, BytesPerWord); 270 __ cmplwi(CR0, argcnt, max_int_register_arguments); 271 __ blt(CR0, move_intSlot_to_ARG); 272 __ b(loop_start); 273 274 __ bind(do_int); 275 __ lwa(intSlot, 0, arg_java); 276 __ std(intSlot, 0, arg_c); 277 __ addi(arg_java, arg_java, -BytesPerWord); 278 __ addi(arg_c, arg_c, BytesPerWord); 279 __ cmplwi(CR0, argcnt, max_int_register_arguments); 280 __ blt(CR0, move_intSlot_to_ARG); 281 __ b(loop_start); 282 283 __ bind(do_long); 284 __ ld(intSlot, -BytesPerWord, arg_java); 285 __ std(intSlot, 0, arg_c); 286 __ addi(arg_java, arg_java, - 2 * BytesPerWord); 287 __ addi(arg_c, arg_c, BytesPerWord); 288 __ cmplwi(CR0, argcnt, max_int_register_arguments); 289 __ blt(CR0, move_intSlot_to_ARG); 290 __ b(loop_start); 291 292 __ bind(do_float); 293 __ lfs(floatSlot, 0, arg_java); 294 __ stfs(floatSlot, Argument::float_on_stack_offset_in_bytes_c, arg_c); 295 __ addi(arg_java, arg_java, -BytesPerWord); 296 __ addi(arg_c, arg_c, BytesPerWord); 297 __ cmplwi(CR0, fpcnt, max_fp_register_arguments); 298 __ blt(CR0, move_floatSlot_to_FARG); 299 __ b(loop_start); 300 301 __ bind(do_double); 302 __ lfd(floatSlot, - BytesPerWord, arg_java); 303 __ stfd(floatSlot, 0, arg_c); 304 __ addi(arg_java, arg_java, - 2 * BytesPerWord); 305 __ addi(arg_c, arg_c, BytesPerWord); 306 __ cmplwi(CR0, fpcnt, max_fp_register_arguments); 307 __ blt(CR0, move_floatSlot_to_FARG); 308 __ b(loop_start); 309 310 __ bind(loop_end); 311 312 __ pop_frame(); 313 __ restore_nonvolatile_registers(R1_SP, -save_nonvolatile_registers_size, false, false); 314 __ restore_LR(R0); 315 316 __ blr(); 317 318 Label move_int_arg, move_float_arg; 319 __ bind(move_int_arg); // each case must consist of 2 instructions (otherwise adapt LogSizeOfTwoInstructions) 320 __ mr(R5_ARG3, intSlot); __ b(loop_start); 321 __ mr(R6_ARG4, intSlot); __ b(loop_start); 322 __ mr(R7_ARG5, intSlot); __ b(loop_start); 323 __ mr(R8_ARG6, intSlot); __ b(loop_start); 324 __ mr(R9_ARG7, intSlot); __ b(loop_start); 325 __ mr(R10_ARG8, intSlot); __ b(loop_start); 326 327 __ bind(move_float_arg); // each case must consist of 2 instructions (otherwise adapt LogSizeOfTwoInstructions) 328 __ fmr(F1_ARG1, floatSlot); __ b(loop_start); 329 __ fmr(F2_ARG2, floatSlot); __ b(loop_start); 330 __ fmr(F3_ARG3, floatSlot); __ b(loop_start); 331 __ fmr(F4_ARG4, floatSlot); __ b(loop_start); 332 __ fmr(F5_ARG5, floatSlot); __ b(loop_start); 333 __ fmr(F6_ARG6, floatSlot); __ b(loop_start); 334 __ fmr(F7_ARG7, floatSlot); __ b(loop_start); 335 __ fmr(F8_ARG8, floatSlot); __ b(loop_start); 336 __ fmr(F9_ARG9, floatSlot); __ b(loop_start); 337 __ fmr(F10_ARG10, floatSlot); __ b(loop_start); 338 __ fmr(F11_ARG11, floatSlot); __ b(loop_start); 339 __ fmr(F12_ARG12, floatSlot); __ b(loop_start); 340 __ fmr(F13_ARG13, floatSlot); __ b(loop_start); 341 342 __ bind(move_intSlot_to_ARG); 343 __ sldi(R0, argcnt, LogSizeOfTwoInstructions); 344 __ load_const(R11_scratch1, move_int_arg); // Label must be bound here. 345 __ add(R11_scratch1, R0, R11_scratch1); 346 __ mtctr(R11_scratch1/*branch_target*/); 347 __ bctr(); 348 __ bind(move_floatSlot_to_FARG); 349 __ sldi(R0, fpcnt, LogSizeOfTwoInstructions); 350 __ addi(fpcnt, fpcnt, 1); 351 __ load_const(R11_scratch1, move_float_arg); // Label must be bound here. 352 __ add(R11_scratch1, R0, R11_scratch1); 353 __ mtctr(R11_scratch1/*branch_target*/); 354 __ bctr(); 355 356 return entry; 357 } 358 359 address TemplateInterpreterGenerator::generate_result_handler_for(BasicType type) { 360 // 361 // Registers alive 362 // R3_RET 363 // LR 364 // 365 // Registers updated 366 // R3_RET 367 // 368 369 Label done; 370 address entry = __ pc(); 371 372 switch (type) { 373 case T_BOOLEAN: 374 // convert !=0 to 1 375 __ normalize_bool(R3_RET); 376 break; 377 case T_BYTE: 378 // sign extend 8 bits 379 __ extsb(R3_RET, R3_RET); 380 break; 381 case T_CHAR: 382 // zero extend 16 bits 383 __ clrldi(R3_RET, R3_RET, 48); 384 break; 385 case T_SHORT: 386 // sign extend 16 bits 387 __ extsh(R3_RET, R3_RET); 388 break; 389 case T_INT: 390 // sign extend 32 bits 391 __ extsw(R3_RET, R3_RET); 392 break; 393 case T_LONG: 394 break; 395 case T_OBJECT: 396 // JNIHandles::resolve result. 397 __ resolve_jobject(R3_RET, R11_scratch1, R31, MacroAssembler::PRESERVATION_FRAME_LR); // kills R31 398 break; 399 case T_FLOAT: 400 break; 401 case T_DOUBLE: 402 break; 403 case T_VOID: 404 break; 405 default: ShouldNotReachHere(); 406 } 407 408 BIND(done); 409 __ blr(); 410 411 return entry; 412 } 413 414 // Abstract method entry. 415 // 416 address TemplateInterpreterGenerator::generate_abstract_entry(void) { 417 address entry = __ pc(); 418 419 // 420 // Registers alive 421 // R16_thread - JavaThread* 422 // R19_method - callee's method (method to be invoked) 423 // R1_SP - SP prepared such that caller's outgoing args are near top 424 // LR - return address to caller 425 // 426 // Stack layout at this point: 427 // 428 // 0 [TOP_IJAVA_FRAME_ABI] <-- R1_SP 429 // alignment (optional) 430 // [outgoing Java arguments] 431 // ... 432 // PARENT [PARENT_IJAVA_FRAME_ABI] 433 // ... 434 // 435 436 // Can't use call_VM here because we have not set up a new 437 // interpreter state. Make the call to the vm and make it look like 438 // our caller set up the JavaFrameAnchor. 439 __ set_top_ijava_frame_at_SP_as_last_Java_frame(R1_SP, R12_scratch2/*tmp*/); 440 441 // Push a new C frame and save LR. 442 __ save_LR(R0); 443 __ push_frame_reg_args(0, R11_scratch1); 444 445 // This is not a leaf but we have a JavaFrameAnchor now and we will 446 // check (create) exceptions afterward so this is ok. 447 __ call_VM_leaf(CAST_FROM_FN_PTR(address, InterpreterRuntime::throw_AbstractMethodErrorWithMethod), 448 R16_thread, R19_method); 449 450 // Pop the C frame and restore LR. 451 __ pop_frame(); 452 __ restore_LR(R0); 453 454 // Reset JavaFrameAnchor from call_VM_leaf above. 455 __ reset_last_Java_frame(); 456 457 // We don't know our caller, so jump to the general forward exception stub, 458 // which will also pop our full frame off. Satisfy the interface of 459 // SharedRuntime::generate_forward_exception() 460 __ load_const_optimized(R11_scratch1, StubRoutines::forward_exception_entry(), R0); 461 __ mtctr(R11_scratch1); 462 __ bctr(); 463 464 return entry; 465 } 466 467 // Interpreter intrinsic for WeakReference.get(). 468 // 1. Don't push a full blown frame and go on dispatching, but fetch the value 469 // into R8 and return quickly 470 // 2. If G1 is active we *must* execute this intrinsic for corrrectness: 471 // It contains a GC barrier which puts the reference into the satb buffer 472 // to indicate that someone holds a strong reference to the object the 473 // weak ref points to! 474 address TemplateInterpreterGenerator::generate_Reference_get_entry(void) { 475 // Code: _aload_0, _getfield, _areturn 476 // parameter size = 1 477 // 478 // The code that gets generated by this routine is split into 2 parts: 479 // 1. the "intrinsified" code for G1 (or any SATB based GC), 480 // 2. the slow path - which is an expansion of the regular method entry. 481 // 482 // Notes: 483 // * In the G1 code we do not check whether we need to block for 484 // a safepoint. If G1 is enabled then we must execute the specialized 485 // code for Reference.get (except when the Reference object is null) 486 // so that we can log the value in the referent field with an SATB 487 // update buffer. 488 // If the code for the getfield template is modified so that the 489 // G1 pre-barrier code is executed when the current method is 490 // Reference.get() then going through the normal method entry 491 // will be fine. 492 // * The G1 code can, however, check the receiver object (the instance 493 // of java.lang.Reference) and jump to the slow path if null. If the 494 // Reference object is null then we obviously cannot fetch the referent 495 // and so we don't need to call the G1 pre-barrier. Thus we can use the 496 // regular method entry code to generate the NPE. 497 // 498 499 address entry = __ pc(); 500 501 const int referent_offset = java_lang_ref_Reference::referent_offset(); 502 503 Label slow_path; 504 505 // Debugging not possible, so can't use __ skip_if_jvmti_mode(slow_path, GR31_SCRATCH); 506 507 // In the G1 code we don't check if we need to reach a safepoint. We 508 // continue and the thread will safepoint at the next bytecode dispatch. 509 510 // If the receiver is null then it is OK to jump to the slow path. 511 __ ld(R3_RET, Interpreter::stackElementSize, R15_esp); // get receiver 512 513 // Check if receiver == nullptr and go the slow path. 514 __ cmpdi(CR0, R3_RET, 0); 515 __ beq(CR0, slow_path); 516 517 __ load_heap_oop(R3_RET, referent_offset, R3_RET, 518 /* non-volatile temp */ R31, R11_scratch1, 519 MacroAssembler::PRESERVATION_FRAME_LR, 520 ON_WEAK_OOP_REF); 521 522 // Generate the G1 pre-barrier code to log the value of 523 // the referent field in an SATB buffer. Note with 524 // these parameters the pre-barrier does not generate 525 // the load of the previous value. 526 527 // Restore caller sp for c2i case (from compiled) and for resized sender frame (from interpreted). 528 __ resize_frame_absolute(R21_sender_SP, R11_scratch1, R0); 529 530 __ blr(); 531 532 __ bind(slow_path); 533 __ jump_to_entry(Interpreter::entry_for_kind(Interpreter::zerolocals), R11_scratch1); 534 return entry; 535 } 536 537 address TemplateInterpreterGenerator::generate_StackOverflowError_handler() { 538 address entry = __ pc(); 539 540 // Expression stack must be empty before entering the VM if an 541 // exception happened. 542 __ empty_expression_stack(); 543 // Throw exception. 544 __ call_VM(noreg, 545 CAST_FROM_FN_PTR(address, 546 InterpreterRuntime::throw_StackOverflowError)); 547 return entry; 548 } 549 550 address TemplateInterpreterGenerator::generate_ArrayIndexOutOfBounds_handler() { 551 address entry = __ pc(); 552 __ empty_expression_stack(); 553 // R4_ARG2 already contains the array. 554 // Index is in R17_tos. 555 __ mr(R5_ARG3, R17_tos); 556 __ call_VM(noreg, CAST_FROM_FN_PTR(address, InterpreterRuntime::throw_ArrayIndexOutOfBoundsException), R4_ARG2, R5_ARG3); 557 return entry; 558 } 559 560 address TemplateInterpreterGenerator::generate_ClassCastException_handler() { 561 address entry = __ pc(); 562 // Expression stack must be empty before entering the VM if an 563 // exception happened. 564 __ empty_expression_stack(); 565 566 // Load exception object. 567 // Thread will be loaded to R3_ARG1. 568 __ call_VM(noreg, CAST_FROM_FN_PTR(address, InterpreterRuntime::throw_ClassCastException), R17_tos); 569 #ifdef ASSERT 570 // Above call must not return here since exception pending. 571 __ should_not_reach_here(); 572 #endif 573 return entry; 574 } 575 576 address TemplateInterpreterGenerator::generate_exception_handler_common(const char* name, const char* message, bool pass_oop) { 577 address entry = __ pc(); 578 //__ untested("generate_exception_handler_common"); 579 Register Rexception = R17_tos; 580 581 // Expression stack must be empty before entering the VM if an exception happened. 582 __ empty_expression_stack(); 583 584 __ load_const_optimized(R4_ARG2, (address) name, R11_scratch1); 585 if (pass_oop) { 586 __ mr(R5_ARG3, Rexception); 587 __ call_VM(Rexception, CAST_FROM_FN_PTR(address, InterpreterRuntime::create_klass_exception)); 588 } else { 589 __ load_const_optimized(R5_ARG3, (address) message, R11_scratch1); 590 __ call_VM(Rexception, CAST_FROM_FN_PTR(address, InterpreterRuntime::create_exception)); 591 } 592 593 // Throw exception. 594 __ mr(R3_ARG1, Rexception); 595 __ load_const_optimized(R11_scratch1, Interpreter::throw_exception_entry(), R12_scratch2); 596 __ mtctr(R11_scratch1); 597 __ bctr(); 598 599 return entry; 600 } 601 602 // This entry is returned to when a call returns to the interpreter. 603 // When we arrive here, we expect that the callee stack frame is already popped. 604 address TemplateInterpreterGenerator::generate_return_entry_for(TosState state, int step, size_t index_size) { 605 address entry = __ pc(); 606 607 // Move the value out of the return register back to the TOS cache of current frame. 608 switch (state) { 609 case ltos: 610 case btos: 611 case ztos: 612 case ctos: 613 case stos: 614 case atos: 615 case itos: __ mr(R17_tos, R3_RET); break; // RET -> TOS cache 616 case ftos: 617 case dtos: __ fmr(F15_ftos, F1_RET); break; // TOS cache -> GR_FRET 618 case vtos: break; // Nothing to do, this was a void return. 619 default : ShouldNotReachHere(); 620 } 621 622 if (state == atos && InlineTypeReturnedAsFields) { 623 __ unimplemented("return entry InlineTypeReturnedAsFields"); 624 //__ store_inline_type_fields_to_buf(nullptr, true); 625 } 626 627 __ restore_interpreter_state(R11_scratch1, false /*bcp_and_mdx_only*/, true /*restore_top_frame_sp*/); 628 629 // Compiled code destroys templateTableBase, reload. 630 __ load_const_optimized(R25_templateTableBase, (address)Interpreter::dispatch_table((TosState)0), R12_scratch2); 631 632 if (state == atos) { 633 __ profile_return_type(R3_RET, R11_scratch1, R12_scratch2); 634 } 635 636 const Register cache = R11_scratch1; 637 const Register size = R12_scratch2; 638 if (index_size == sizeof(u4)) { 639 __ load_resolved_indy_entry(cache, size /* tmp */); 640 __ lhz(size, in_bytes(ResolvedIndyEntry::num_parameters_offset()), cache); 641 } else { 642 assert(index_size == sizeof(u2), "Can only be u2"); 643 __ load_method_entry(cache, size /* tmp */); 644 __ lhz(size, in_bytes(ResolvedMethodEntry::num_parameters_offset()), cache); 645 } 646 __ sldi(size, size, Interpreter::logStackElementSize); 647 __ add(R15_esp, R15_esp, size); 648 649 __ check_and_handle_popframe(R11_scratch1); 650 __ check_and_handle_earlyret(R11_scratch1); 651 652 __ dispatch_next(state, step); 653 return entry; 654 } 655 656 address TemplateInterpreterGenerator::generate_deopt_entry_for(TosState state, int step, address continuation) { 657 address entry = __ pc(); 658 // If state != vtos, we're returning from a native method, which put it's result 659 // into the result register. So move the value out of the return register back 660 // to the TOS cache of current frame. 661 662 switch (state) { 663 case ltos: 664 case btos: 665 case ztos: 666 case ctos: 667 case stos: 668 case atos: 669 case itos: __ mr(R17_tos, R3_RET); break; // GR_RET -> TOS cache 670 case ftos: 671 case dtos: __ fmr(F15_ftos, F1_RET); break; // TOS cache -> GR_FRET 672 case vtos: break; // Nothing to do, this was a void return. 673 default : ShouldNotReachHere(); 674 } 675 676 // Load LcpoolCache @@@ should be already set! 677 __ get_constant_pool_cache(R27_constPoolCache); 678 679 // Handle a pending exception, fall through if none. 680 __ check_and_forward_exception(R11_scratch1, R12_scratch2); 681 682 // Start executing bytecodes. 683 if (continuation == nullptr) { 684 __ dispatch_next(state, step); 685 } else { 686 __ jump_to_entry(continuation, R11_scratch1); 687 } 688 689 return entry; 690 } 691 692 address TemplateInterpreterGenerator::generate_safept_entry_for(TosState state, address runtime_entry) { 693 address entry = __ pc(); 694 695 __ push(state); 696 __ push_cont_fastpath(); 697 __ call_VM(noreg, runtime_entry); 698 __ pop_cont_fastpath(); 699 __ dispatch_via(vtos, Interpreter::_normal_table.table_for(vtos)); 700 701 return entry; 702 } 703 704 address TemplateInterpreterGenerator::generate_cont_resume_interpreter_adapter() { 705 if (!Continuations::enabled()) return nullptr; 706 address start = __ pc(); 707 708 __ load_const_optimized(R25_templateTableBase, (address)Interpreter::dispatch_table((TosState)0), R12_scratch2); 709 __ restore_interpreter_state(R11_scratch1, false, true /*restore_top_frame_sp*/); 710 // Restore registers that are preserved across vthread preemption 711 assert(__ nonvolatile_accross_vthread_preemtion(R31) && __ nonvolatile_accross_vthread_preemtion(R24), ""); 712 __ ld(R3_ARG1, _abi0(callers_sp), R1_SP); // load FP 713 __ ld(R31, _ijava_state_neg(lresult), R3_ARG1); 714 __ ld(R24, _ijava_state_neg(fresult), R3_ARG1); 715 __ blr(); 716 717 return start; 718 } 719 720 // Helpers for commoning out cases in the various type of method entries. 721 722 // Increment invocation count & check for overflow. 723 // 724 // Note: checking for negative value instead of overflow 725 // so we have a 'sticky' overflow test. 726 // 727 void TemplateInterpreterGenerator::generate_counter_incr(Label* overflow) { 728 // Note: In tiered we increment either counters in method or in MDO depending if we're profiling or not. 729 Register Rscratch1 = R11_scratch1; 730 Register Rscratch2 = R12_scratch2; 731 Register R3_counters = R3_ARG1; 732 Label done; 733 734 const int increment = InvocationCounter::count_increment; 735 Label no_mdo; 736 if (ProfileInterpreter) { 737 const Register Rmdo = R3_counters; 738 __ ld(Rmdo, in_bytes(Method::method_data_offset()), R19_method); 739 __ cmpdi(CR0, Rmdo, 0); 740 __ beq(CR0, no_mdo); 741 742 // Increment invocation counter in the MDO. 743 const int mdo_ic_offs = in_bytes(MethodData::invocation_counter_offset()) + in_bytes(InvocationCounter::counter_offset()); 744 __ lwz(Rscratch2, mdo_ic_offs, Rmdo); 745 __ lwz(Rscratch1, in_bytes(MethodData::invoke_mask_offset()), Rmdo); 746 __ addi(Rscratch2, Rscratch2, increment); 747 __ stw(Rscratch2, mdo_ic_offs, Rmdo); 748 __ and_(Rscratch1, Rscratch2, Rscratch1); 749 __ bne(CR0, done); 750 __ b(*overflow); 751 } 752 753 // Increment counter in MethodCounters*. 754 const int mo_ic_offs = in_bytes(MethodCounters::invocation_counter_offset()) + in_bytes(InvocationCounter::counter_offset()); 755 __ bind(no_mdo); 756 __ get_method_counters(R19_method, R3_counters, done); 757 __ lwz(Rscratch2, mo_ic_offs, R3_counters); 758 __ lwz(Rscratch1, in_bytes(MethodCounters::invoke_mask_offset()), R3_counters); 759 __ addi(Rscratch2, Rscratch2, increment); 760 __ stw(Rscratch2, mo_ic_offs, R3_counters); 761 __ and_(Rscratch1, Rscratch2, Rscratch1); 762 __ beq(CR0, *overflow); 763 764 __ bind(done); 765 } 766 767 // Generate code to initiate compilation on invocation counter overflow. 768 void TemplateInterpreterGenerator::generate_counter_overflow(Label& continue_entry) { 769 // Generate code to initiate compilation on the counter overflow. 770 771 // InterpreterRuntime::frequency_counter_overflow takes one arguments, 772 // which indicates if the counter overflow occurs at a backwards branch (null bcp) 773 // We pass zero in. 774 // The call returns the address of the verified entry point for the method or null 775 // if the compilation did not complete (either went background or bailed out). 776 // 777 // Unlike the C++ interpreter above: Check exceptions! 778 // Assumption: Caller must set the flag "do_not_unlock_if_sychronized" if the monitor of a sync'ed 779 // method has not yet been created. Thus, no unlocking of a non-existing monitor can occur. 780 781 __ li(R4_ARG2, 0); 782 __ call_VM(noreg, CAST_FROM_FN_PTR(address, InterpreterRuntime::frequency_counter_overflow), R4_ARG2, true); 783 784 // Returns verified_entry_point or null. 785 // We ignore it in any case. 786 __ b(continue_entry); 787 } 788 789 // See if we've got enough room on the stack for locals plus overhead below 790 // JavaThread::stack_overflow_limit(). If not, throw a StackOverflowError 791 // without going through the signal handler, i.e., reserved and yellow zones 792 // will not be made usable. The shadow zone must suffice to handle the 793 // overflow. 794 // 795 // Kills Rmem_frame_size, Rscratch1. 796 void TemplateInterpreterGenerator::generate_stack_overflow_check(Register Rmem_frame_size, Register Rscratch1) { 797 Label done; 798 assert_different_registers(Rmem_frame_size, Rscratch1); 799 800 BLOCK_COMMENT("stack_overflow_check_with_compare {"); 801 __ sub(Rmem_frame_size, R1_SP, Rmem_frame_size); 802 __ ld(Rscratch1, thread_(stack_overflow_limit)); 803 __ cmpld(CR0/*is_stack_overflow*/, Rmem_frame_size, Rscratch1); 804 __ bgt(CR0/*is_stack_overflow*/, done); 805 806 // The stack overflows. Load target address of the runtime stub and call it. 807 assert(SharedRuntime::throw_StackOverflowError_entry() != nullptr, "generated in wrong order"); 808 __ load_const_optimized(Rscratch1, (SharedRuntime::throw_StackOverflowError_entry()), R0); 809 __ mtctr(Rscratch1); 810 // Restore caller_sp (c2i adapter may exist, but no shrinking of interpreted caller frame). 811 #ifdef ASSERT 812 Label frame_not_shrunk; 813 __ cmpld(CR0, R1_SP, R21_sender_SP); 814 __ ble(CR0, frame_not_shrunk); 815 __ stop("frame shrunk"); 816 __ bind(frame_not_shrunk); 817 __ ld(Rscratch1, 0, R1_SP); 818 __ ld(R0, 0, R21_sender_SP); 819 __ cmpd(CR0, R0, Rscratch1); 820 __ asm_assert_eq("backlink"); 821 #endif // ASSERT 822 __ mr(R1_SP, R21_sender_SP); 823 __ bctr(); 824 825 __ align(32, 12); 826 __ bind(done); 827 BLOCK_COMMENT("} stack_overflow_check_with_compare"); 828 } 829 830 // Lock the current method, interpreter register window must be set up! 831 void TemplateInterpreterGenerator::lock_method(Register Rflags, Register Rscratch1, Register Rscratch2, bool flags_preloaded) { 832 const Register Robj_to_lock = Rscratch2; 833 834 { 835 if (!flags_preloaded) { 836 __ lhz(Rflags, method_(access_flags)); 837 } 838 839 #ifdef ASSERT 840 // Check if methods needs synchronization. 841 { 842 Label Lok; 843 __ testbitdi(CR0, R0, Rflags, JVM_ACC_SYNCHRONIZED_BIT); 844 __ btrue(CR0,Lok); 845 __ stop("method doesn't need synchronization"); 846 __ bind(Lok); 847 } 848 #endif // ASSERT 849 } 850 851 // Get synchronization object to Rscratch2. 852 { 853 Label Lstatic; 854 Label Ldone; 855 856 __ testbitdi(CR0, R0, Rflags, JVM_ACC_STATIC_BIT); 857 __ btrue(CR0, Lstatic); 858 859 // Non-static case: load receiver obj from stack and we're done. 860 __ ld(Robj_to_lock, R18_locals); 861 __ b(Ldone); 862 863 __ bind(Lstatic); // Static case: Lock the java mirror 864 // Load mirror from interpreter frame. 865 __ ld(Robj_to_lock, _abi0(callers_sp), R1_SP); 866 __ ld(Robj_to_lock, _ijava_state_neg(mirror), Robj_to_lock); 867 868 __ bind(Ldone); 869 __ verify_oop(Robj_to_lock); 870 } 871 872 // Got the oop to lock => execute! 873 __ add_monitor_to_stack(true, Rscratch1, R0); 874 875 __ std(Robj_to_lock, in_bytes(BasicObjectLock::obj_offset()), R26_monitor); 876 __ lock_object(R26_monitor, Robj_to_lock); 877 } 878 879 // Generate a fixed interpreter frame for pure interpreter 880 // and I2N native transition frames. 881 // 882 // Before (stack grows downwards): 883 // 884 // | ... | 885 // |------------- | 886 // | java arg0 | 887 // | ... | 888 // | java argn | 889 // | | <- R15_esp 890 // | | 891 // |--------------| 892 // | abi_112 | 893 // | | <- R1_SP 894 // |==============| 895 // 896 // 897 // After: 898 // 899 // | ... | 900 // | java arg0 |<- R18_locals 901 // | ... | 902 // | java argn | 903 // |--------------| 904 // | | 905 // | java locals | 906 // | | 907 // |--------------| 908 // | abi_48 | 909 // |==============| 910 // | | 911 // | istate | 912 // | | 913 // |--------------| 914 // | monitor |<- R26_monitor 915 // |--------------| 916 // | |<- R15_esp 917 // | expression | 918 // | stack | 919 // | | 920 // |--------------| 921 // | | 922 // | abi_112 |<- R1_SP 923 // |==============| 924 // 925 // The top most frame needs an abi space of 112 bytes. This space is needed, 926 // since we call to c. The c function may spill their arguments to the caller 927 // frame. When we call to java, we don't need these spill slots. In order to save 928 // space on the stack, we resize the caller. However, java locals reside in 929 // the caller frame and the frame has to be increased. The frame_size for the 930 // current frame was calculated based on max_stack as size for the expression 931 // stack. At the call, just a part of the expression stack might be used. 932 // We don't want to waste this space and cut the frame back accordingly. 933 // The resulting amount for resizing is calculated as follows: 934 // resize = (number_of_locals - number_of_arguments) * slot_size 935 // + (R1_SP - R15_esp) + 48 936 // 937 // The size for the callee frame is calculated: 938 // framesize = 112 + max_stack + monitor + state_size 939 // 940 // maxstack: Max number of slots on the expression stack, loaded from the method. 941 // monitor: We statically reserve room for one monitor object. 942 // state_size: We save the current state of the interpreter to this area. 943 // 944 void TemplateInterpreterGenerator::generate_fixed_frame(bool native_call, Register Rsize_of_parameters, Register Rsize_of_locals) { 945 Register Rparent_frame_resize = R6_ARG4, // Frame will grow by this number of bytes. 946 Rtop_frame_size = R7_ARG5, 947 Rconst_method = R8_ARG6, 948 Rconst_pool = R9_ARG7, 949 Rmirror = R10_ARG8; 950 951 assert_different_registers(Rsize_of_parameters, Rsize_of_locals, Rparent_frame_resize, Rtop_frame_size, 952 Rconst_method, Rconst_pool); 953 954 __ ld(Rconst_method, method_(const)); 955 __ lhz(Rsize_of_parameters /* number of params */, 956 in_bytes(ConstMethod::size_of_parameters_offset()), Rconst_method); 957 if (native_call) { 958 // If we're calling a native method, we reserve space for the worst-case signature 959 // handler varargs vector, which is max(Argument::n_int_register_parameters_c, parameter_count+2). 960 // We add two slots to the parameter_count, one for the jni 961 // environment and one for a possible native mirror. 962 Label skip_native_calculate_max_stack; 963 __ addi(Rtop_frame_size, Rsize_of_parameters, 2); 964 __ cmpwi(CR0, Rtop_frame_size, Argument::n_int_register_parameters_c); 965 __ bge(CR0, skip_native_calculate_max_stack); 966 __ li(Rtop_frame_size, Argument::n_int_register_parameters_c); 967 __ bind(skip_native_calculate_max_stack); 968 __ sldi(Rsize_of_parameters, Rsize_of_parameters, Interpreter::logStackElementSize); 969 __ sldi(Rtop_frame_size, Rtop_frame_size, Interpreter::logStackElementSize); 970 __ sub(Rparent_frame_resize, R1_SP, R15_esp); // <0, off by Interpreter::stackElementSize! 971 assert(Rsize_of_locals == noreg, "Rsize_of_locals not initialized"); // Only relevant value is Rsize_of_parameters. 972 } else { 973 __ lhz(Rsize_of_locals /* number of params */, in_bytes(ConstMethod::size_of_locals_offset()), Rconst_method); 974 __ sldi(Rsize_of_parameters, Rsize_of_parameters, Interpreter::logStackElementSize); 975 __ sldi(Rsize_of_locals, Rsize_of_locals, Interpreter::logStackElementSize); 976 __ lhz(Rtop_frame_size, in_bytes(ConstMethod::max_stack_offset()), Rconst_method); 977 __ sub(R11_scratch1, Rsize_of_locals, Rsize_of_parameters); // >=0 978 __ sub(Rparent_frame_resize, R1_SP, R15_esp); // <0, off by Interpreter::stackElementSize! 979 __ sldi(Rtop_frame_size, Rtop_frame_size, Interpreter::logStackElementSize); 980 __ add(Rparent_frame_resize, Rparent_frame_resize, R11_scratch1); 981 } 982 983 // Compute top frame size. 984 __ addi(Rtop_frame_size, Rtop_frame_size, frame::top_ijava_frame_abi_size + frame::ijava_state_size); 985 986 // Cut back area between esp and max_stack. 987 __ addi(Rparent_frame_resize, Rparent_frame_resize, frame::parent_ijava_frame_abi_size - Interpreter::stackElementSize); 988 989 __ round_to(Rtop_frame_size, frame::alignment_in_bytes); 990 __ round_to(Rparent_frame_resize, frame::alignment_in_bytes); 991 // Rparent_frame_resize = (locals-parameters) - (ESP-SP-ABI48) Rounded to frame alignment size. 992 // Enlarge by locals-parameters (not in case of native_call), shrink by ESP-SP-ABI48. 993 994 if (!native_call) { 995 // Stack overflow check. 996 // Native calls don't need the stack size check since they have no 997 // expression stack and the arguments are already on the stack and 998 // we only add a handful of words to the stack. 999 __ add(R11_scratch1, Rparent_frame_resize, Rtop_frame_size); 1000 generate_stack_overflow_check(R11_scratch1, R12_scratch2); 1001 } 1002 1003 // Set up interpreter state registers. 1004 1005 __ add(R18_locals, R15_esp, Rsize_of_parameters); 1006 __ ld(Rconst_pool, in_bytes(ConstMethod::constants_offset()), Rconst_method); 1007 __ ld(R27_constPoolCache, ConstantPool::cache_offset(), Rconst_pool); 1008 1009 // Set method data pointer. 1010 if (ProfileInterpreter) { 1011 Label zero_continue; 1012 __ ld(R28_mdx, method_(method_data)); 1013 __ cmpdi(CR0, R28_mdx, 0); 1014 __ beq(CR0, zero_continue); 1015 __ addi(R28_mdx, R28_mdx, in_bytes(MethodData::data_offset())); 1016 __ bind(zero_continue); 1017 } 1018 1019 if (native_call) { 1020 __ li(R14_bcp, 0); // Must initialize. 1021 } else { 1022 __ addi(R14_bcp, Rconst_method, in_bytes(ConstMethod::codes_offset())); 1023 } 1024 1025 // Resize parent frame. 1026 __ mflr(R12_scratch2); 1027 __ neg(Rparent_frame_resize, Rparent_frame_resize); 1028 __ resize_frame(Rparent_frame_resize, R11_scratch1); 1029 __ std(R12_scratch2, _abi0(lr), R1_SP); 1030 1031 // Get mirror and store it in the frame as GC root for this Method*. 1032 __ ld(Rmirror, ConstantPool::pool_holder_offset(), Rconst_pool); 1033 __ ld(Rmirror, in_bytes(Klass::java_mirror_offset()), Rmirror); 1034 __ resolve_oop_handle(Rmirror, R11_scratch1, R12_scratch2, MacroAssembler::PRESERVATION_FRAME_LR_GP_REGS); 1035 1036 __ addi(R26_monitor, R1_SP, -frame::ijava_state_size); 1037 __ addi(R15_esp, R26_monitor, -Interpreter::stackElementSize); 1038 1039 // Store values. 1040 __ std(R19_method, _ijava_state_neg(method), R1_SP); 1041 __ std(Rmirror, _ijava_state_neg(mirror), R1_SP); 1042 __ sub(R12_scratch2, R18_locals, R1_SP); 1043 __ srdi(R12_scratch2, R12_scratch2, Interpreter::logStackElementSize); 1044 // Store relativized R18_locals, see frame::interpreter_frame_locals(). 1045 __ std(R12_scratch2, _ijava_state_neg(locals), R1_SP); 1046 __ std(R27_constPoolCache, _ijava_state_neg(cpoolCache), R1_SP); 1047 1048 // Note: esp, bcp, monitor, mdx live in registers. Hence, the correct version can only 1049 // be found in the frame after save_interpreter_state is done. This is always true 1050 // for non-top frames. But when a signal occurs, dumping the top frame can go wrong, 1051 // because e.g. frame::interpreter_frame_bcp() will not access the correct value 1052 // (Enhanced Stack Trace). 1053 // The signal handler does not save the interpreter state into the frame. 1054 1055 // We have to initialize some of these frame slots for native calls (accessed by GC). 1056 // Also initialize them for non-native calls for better tool support (even though 1057 // you may not get the most recent version as described above). 1058 __ li(R0, 0); 1059 __ li(R12_scratch2, -(frame::ijava_state_size / wordSize)); 1060 __ std(R12_scratch2, _ijava_state_neg(monitors), R1_SP); 1061 __ std(R14_bcp, _ijava_state_neg(bcp), R1_SP); 1062 if (ProfileInterpreter) { __ std(R28_mdx, _ijava_state_neg(mdx), R1_SP); } 1063 __ sub(R12_scratch2, R15_esp, R1_SP); 1064 __ sradi(R12_scratch2, R12_scratch2, Interpreter::logStackElementSize); 1065 __ std(R12_scratch2, _ijava_state_neg(esp), R1_SP); 1066 __ std(R0, _ijava_state_neg(oop_tmp), R1_SP); // only used for native_call 1067 1068 // Store sender's SP and this frame's top SP. 1069 __ std(R21_sender_SP, _ijava_state_neg(sender_sp), R1_SP); 1070 __ neg(R12_scratch2, Rtop_frame_size); 1071 __ sradi(R12_scratch2, R12_scratch2, Interpreter::logStackElementSize); 1072 // Store relativized top_frame_sp 1073 __ std(R12_scratch2, _ijava_state_neg(top_frame_sp), R1_SP); 1074 1075 // Push top frame. 1076 __ push_frame(Rtop_frame_size, R11_scratch1); 1077 } 1078 1079 // End of helpers 1080 1081 address TemplateInterpreterGenerator::generate_math_entry(AbstractInterpreter::MethodKind kind) { 1082 1083 // Decide what to do: Use same platform specific instructions and runtime calls as compilers. 1084 bool use_instruction = false; 1085 address runtime_entry = nullptr; 1086 int num_args = 1; 1087 bool double_precision = true; 1088 1089 // PPC64 specific: 1090 switch (kind) { 1091 case Interpreter::java_lang_math_sqrt: use_instruction = true; break; 1092 case Interpreter::java_lang_math_abs: use_instruction = true; break; 1093 case Interpreter::java_lang_math_fmaF: 1094 case Interpreter::java_lang_math_fmaD: use_instruction = UseFMA; break; 1095 default: break; // Fall back to runtime call. 1096 } 1097 1098 switch (kind) { 1099 case Interpreter::java_lang_math_sin : runtime_entry = CAST_FROM_FN_PTR(address, SharedRuntime::dsin); break; 1100 case Interpreter::java_lang_math_cos : runtime_entry = CAST_FROM_FN_PTR(address, SharedRuntime::dcos); break; 1101 case Interpreter::java_lang_math_tan : runtime_entry = CAST_FROM_FN_PTR(address, SharedRuntime::dtan); break; 1102 case Interpreter::java_lang_math_sinh : /* run interpreted */ break; 1103 case Interpreter::java_lang_math_tanh : /* run interpreted */ break; 1104 case Interpreter::java_lang_math_cbrt : /* run interpreted */ break; 1105 case Interpreter::java_lang_math_abs : /* run interpreted */ break; 1106 case Interpreter::java_lang_math_sqrt : /* run interpreted */ break; 1107 case Interpreter::java_lang_math_log : runtime_entry = CAST_FROM_FN_PTR(address, SharedRuntime::dlog); break; 1108 case Interpreter::java_lang_math_log10: runtime_entry = CAST_FROM_FN_PTR(address, SharedRuntime::dlog10); break; 1109 case Interpreter::java_lang_math_pow : runtime_entry = CAST_FROM_FN_PTR(address, SharedRuntime::dpow); num_args = 2; break; 1110 case Interpreter::java_lang_math_exp : runtime_entry = CAST_FROM_FN_PTR(address, SharedRuntime::dexp); break; 1111 case Interpreter::java_lang_math_fmaF : /* run interpreted */ num_args = 3; double_precision = false; break; 1112 case Interpreter::java_lang_math_fmaD : /* run interpreted */ num_args = 3; break; 1113 default: ShouldNotReachHere(); 1114 } 1115 1116 // Use normal entry if neither instruction nor runtime call is used. 1117 if (!use_instruction && runtime_entry == nullptr) return nullptr; 1118 1119 address entry = __ pc(); 1120 1121 // Load arguments 1122 assert(num_args <= 13, "passed in registers"); 1123 if (double_precision) { 1124 int offset = (2 * num_args - 1) * Interpreter::stackElementSize; 1125 for (int i = 0; i < num_args; ++i) { 1126 __ lfd(as_FloatRegister(F1_ARG1->encoding() + i), offset, R15_esp); 1127 offset -= 2 * Interpreter::stackElementSize; 1128 } 1129 } else { 1130 int offset = num_args * Interpreter::stackElementSize; 1131 for (int i = 0; i < num_args; ++i) { 1132 __ lfs(as_FloatRegister(F1_ARG1->encoding() + i), offset, R15_esp); 1133 offset -= Interpreter::stackElementSize; 1134 } 1135 } 1136 1137 if (use_instruction) { 1138 switch (kind) { 1139 case Interpreter::java_lang_math_sqrt: __ fsqrt(F1_RET, F1); break; 1140 case Interpreter::java_lang_math_abs: __ fabs(F1_RET, F1); break; 1141 case Interpreter::java_lang_math_fmaF: __ fmadds(F1_RET, F1, F2, F3); break; 1142 case Interpreter::java_lang_math_fmaD: __ fmadd(F1_RET, F1, F2, F3); break; 1143 default: ShouldNotReachHere(); 1144 } 1145 } else { 1146 // Comment: Can use tail call if the unextended frame is always C ABI compliant: 1147 //__ load_const_optimized(R12_scratch2, runtime_entry, R0); 1148 //__ call_c_and_return_to_caller(R12_scratch2); 1149 1150 // Push a new C frame and save LR. 1151 __ save_LR(R0); 1152 __ push_frame_reg_args(0, R11_scratch1); 1153 1154 __ call_VM_leaf(runtime_entry); 1155 1156 // Pop the C frame and restore LR. 1157 __ pop_frame(); 1158 __ restore_LR(R0); 1159 } 1160 1161 // Restore caller sp for c2i case (from compiled) and for resized sender frame (from interpreted). 1162 __ resize_frame_absolute(R21_sender_SP, R11_scratch1, R0); 1163 __ blr(); 1164 1165 __ flush(); 1166 1167 return entry; 1168 } 1169 1170 address TemplateInterpreterGenerator::generate_Float_floatToFloat16_entry() { 1171 if (!VM_Version::supports_float16()) return nullptr; 1172 1173 address entry = __ pc(); 1174 1175 __ lfs(F1, Interpreter::stackElementSize, R15_esp); 1176 __ f2hf(R3_RET, F1, F0); 1177 1178 // Restore caller sp for c2i case (from compiled) and for resized sender frame (from interpreted). 1179 __ resize_frame_absolute(R21_sender_SP, R11_scratch1, R0); 1180 __ blr(); 1181 1182 __ flush(); 1183 1184 return entry; 1185 } 1186 1187 address TemplateInterpreterGenerator::generate_Float_float16ToFloat_entry() { 1188 if (!VM_Version::supports_float16()) return nullptr; 1189 1190 address entry = __ pc(); 1191 1192 // Note: Could also use: 1193 //__ li(R3, Interpreter::stackElementSize); 1194 //__ lfiwax(F1_RET, R15_esp, R3); // short stored as 32 bit integer 1195 //__ xscvhpdp(F1_RET->to_vsr(), F1_RET->to_vsr()); 1196 __ lwa(R3, Interpreter::stackElementSize, R15_esp); 1197 __ hf2f(F1_RET, R3); 1198 1199 // Restore caller sp for c2i case (from compiled) and for resized sender frame (from interpreted). 1200 __ resize_frame_absolute(R21_sender_SP, R11_scratch1, R0); 1201 __ blr(); 1202 1203 __ flush(); 1204 1205 return entry; 1206 } 1207 1208 void TemplateInterpreterGenerator::bang_stack_shadow_pages(bool native_call) { 1209 // Quick & dirty stack overflow checking: bang the stack & handle trap. 1210 // Note that we do the banging after the frame is setup, since the exception 1211 // handling code expects to find a valid interpreter frame on the stack. 1212 // Doing the banging earlier fails if the caller frame is not an interpreter 1213 // frame. 1214 // (Also, the exception throwing code expects to unlock any synchronized 1215 // method receiever, so do the banging after locking the receiver.) 1216 1217 // Bang each page in the shadow zone. We can't assume it's been done for 1218 // an interpreter frame with greater than a page of locals, so each page 1219 // needs to be checked. Only true for non-native. 1220 const size_t page_size = os::vm_page_size(); 1221 const int n_shadow_pages = StackOverflow::stack_shadow_zone_size() / page_size; 1222 const int start_page = native_call ? n_shadow_pages : 1; 1223 BLOCK_COMMENT("bang_stack_shadow_pages:"); 1224 for (int pages = start_page; pages <= n_shadow_pages; pages++) { 1225 __ bang_stack_with_offset(pages*page_size); 1226 } 1227 } 1228 1229 // Interpreter stub for calling a native method. (asm interpreter) 1230 // This sets up a somewhat different looking stack for calling the 1231 // native method than the typical interpreter frame setup. 1232 // 1233 // On entry: 1234 // R19_method - method 1235 // R16_thread - JavaThread* 1236 // R15_esp - intptr_t* sender tos 1237 // 1238 // abstract stack (grows up) 1239 // [ IJava (caller of JNI callee) ] <-- ASP 1240 // ... 1241 address TemplateInterpreterGenerator::generate_native_entry(bool synchronized) { 1242 1243 address entry = __ pc(); 1244 1245 const bool inc_counter = UseCompiler || CountCompiledCalls; 1246 1247 // ----------------------------------------------------------------------------- 1248 // Allocate a new frame that represents the native callee (i2n frame). 1249 // This is not a full-blown interpreter frame, but in particular, the 1250 // following registers are valid after this: 1251 // - R19_method 1252 // - R18_local (points to start of arguments to native function) 1253 // 1254 // abstract stack (grows up) 1255 // [ IJava (caller of JNI callee) ] <-- ASP 1256 // ... 1257 1258 const Register signature_handler_fd = R11_scratch1; 1259 const Register pending_exception = R0; 1260 const Register result_handler_addr = R31; 1261 const Register native_method_fd = R12_scratch2; // preferred in MacroAssembler::branch_to 1262 const Register access_flags = R24_tmp4; 1263 const Register active_handles = R11_scratch1; // R26_monitor saved to state. 1264 const Register sync_state = R12_scratch2; 1265 const Register sync_state_addr = sync_state; // Address is dead after use. 1266 const Register suspend_flags = R11_scratch1; 1267 1268 //============================================================================= 1269 // Allocate new frame and initialize interpreter state. 1270 1271 Label exception_return; 1272 Label exception_return_sync_check; 1273 Label stack_overflow_return; 1274 1275 Register size_of_parameters = R22_tmp2; 1276 1277 generate_fixed_frame(true, size_of_parameters, noreg /* unused */); 1278 1279 //============================================================================= 1280 // Increment invocation counter. On overflow, entry to JNI method 1281 // will be compiled. 1282 Label invocation_counter_overflow, continue_after_compile; 1283 if (inc_counter) { 1284 if (synchronized) { 1285 // Since at this point in the method invocation the exception handler 1286 // would try to exit the monitor of synchronized methods which hasn't 1287 // been entered yet, we set the thread local variable 1288 // _do_not_unlock_if_synchronized to true. If any exception was thrown by 1289 // runtime, exception handling i.e. unlock_if_synchronized_method will 1290 // check this thread local flag. 1291 // This flag has two effects, one is to force an unwind in the topmost 1292 // interpreter frame and not perform an unlock while doing so. 1293 __ li(R0, 1); 1294 __ stb(R0, in_bytes(JavaThread::do_not_unlock_if_synchronized_offset()), R16_thread); 1295 } 1296 generate_counter_incr(&invocation_counter_overflow); 1297 1298 BIND(continue_after_compile); 1299 } 1300 1301 bang_stack_shadow_pages(true); 1302 1303 if (inc_counter) { 1304 // Reset the _do_not_unlock_if_synchronized flag. 1305 if (synchronized) { 1306 __ li(R0, 0); 1307 __ stb(R0, in_bytes(JavaThread::do_not_unlock_if_synchronized_offset()), R16_thread); 1308 } 1309 } 1310 1311 // access_flags = method->access_flags(); 1312 // Load access flags. 1313 assert(__ nonvolatile_accross_vthread_preemtion(access_flags), 1314 "access_flags not preserved"); 1315 // Type check. 1316 assert(2 == sizeof(AccessFlags), "unexpected field size"); 1317 __ lhz(access_flags, method_(access_flags)); 1318 1319 // We don't want to reload R19_method and access_flags after calls 1320 // to some helper functions. 1321 assert(R19_method->is_nonvolatile(), 1322 "R19_method must be a non-volatile register"); 1323 1324 // Check for synchronized methods. Must happen AFTER invocation counter 1325 // check, so method is not locked if counter overflows. 1326 1327 if (synchronized) { 1328 lock_method(access_flags, R11_scratch1, R12_scratch2, true); 1329 1330 // Update monitor in state. 1331 __ ld(R11_scratch1, 0, R1_SP); 1332 __ sub(R12_scratch2, R26_monitor, R11_scratch1); 1333 __ sradi(R12_scratch2, R12_scratch2, Interpreter::logStackElementSize); 1334 __ std(R12_scratch2, _ijava_state_neg(monitors), R11_scratch1); 1335 } 1336 1337 // jvmti/jvmpi support 1338 __ notify_method_entry(); 1339 1340 //============================================================================= 1341 // Get and call the signature handler. 1342 1343 __ ld(signature_handler_fd, method_(signature_handler)); 1344 Label call_signature_handler; 1345 1346 __ cmpdi(CR0, signature_handler_fd, 0); 1347 __ bne(CR0, call_signature_handler); 1348 1349 // Method has never been called. Either generate a specialized 1350 // handler or point to the slow one. 1351 // 1352 // Pass parameter 'false' to avoid exception check in call_VM. 1353 __ call_VM(noreg, CAST_FROM_FN_PTR(address, InterpreterRuntime::prepare_native_call), R19_method, false); 1354 1355 // Check for an exception while looking up the target method. If we 1356 // incurred one, bail. 1357 __ ld(pending_exception, thread_(pending_exception)); 1358 __ cmpdi(CR0, pending_exception, 0); 1359 __ bne(CR0, exception_return_sync_check); // Has pending exception. 1360 1361 // Reload signature handler, it may have been created/assigned in the meanwhile. 1362 __ ld(signature_handler_fd, method_(signature_handler)); 1363 __ twi_0(signature_handler_fd); // Order wrt. load of klass mirror and entry point (isync is below). 1364 1365 BIND(call_signature_handler); 1366 1367 // Before we call the signature handler we push a new frame to 1368 // protect the interpreter frame volatile registers when we return 1369 // from jni but before we can get back to Java. 1370 1371 // First set the frame anchor while the SP/FP registers are 1372 // convenient and the slow signature handler can use this same frame 1373 // anchor. 1374 1375 bool support_vthread_preemption = Continuations::enabled(); 1376 1377 // We have a TOP_IJAVA_FRAME here, which belongs to us. 1378 Label last_java_pc; 1379 Label *resume_pc = support_vthread_preemption ? &last_java_pc : nullptr; 1380 __ set_top_ijava_frame_at_SP_as_last_Java_frame(R1_SP, R3_ARG1/*tmp*/, resume_pc); 1381 1382 // Now the interpreter frame (and its call chain) have been 1383 // invalidated and flushed. We are now protected against eager 1384 // being enabled in native code. Even if it goes eager the 1385 // registers will be reloaded as clean and we will invalidate after 1386 // the call so no spurious flush should be possible. 1387 1388 // Call signature handler and pass locals address. 1389 // 1390 // Our signature handlers copy required arguments to the C stack 1391 // (outgoing C args), R3_ARG1 to R10_ARG8, and FARG1 to FARG13. 1392 __ mr(R3_ARG1, R18_locals); 1393 #if !defined(ABI_ELFv2) 1394 __ ld(signature_handler_fd, 0, signature_handler_fd); 1395 #endif 1396 1397 __ call_stub(signature_handler_fd); 1398 1399 assert(__ nonvolatile_accross_vthread_preemtion(result_handler_addr), 1400 "result_handler_addr not preserved"); 1401 // Save across call to native method. 1402 __ mr(result_handler_addr, R3_RET); 1403 __ ld(R11_scratch1, _abi0(callers_sp), R1_SP); // load FP 1404 1405 __ isync(); // Acquire signature handler before trying to fetch the native entry point and klass mirror. 1406 1407 // Set up fixed parameters and call the native method. 1408 // If the method is static, get mirror into R4_ARG2. 1409 { 1410 Label method_is_not_static; 1411 // Access_flags is non-volatile and still, no need to restore it. 1412 1413 // Restore access flags. 1414 __ testbitdi(CR0, R0, access_flags, JVM_ACC_STATIC_BIT); 1415 __ bfalse(CR0, method_is_not_static); 1416 1417 // Load mirror from interpreter frame (FP in R11_scratch1) 1418 __ ld(R21_tmp1, _ijava_state_neg(mirror), R11_scratch1); 1419 // R4_ARG2 = &state->_oop_temp; 1420 __ addi(R4_ARG2, R11_scratch1, _ijava_state_neg(oop_tmp)); 1421 __ std(R21_tmp1/*mirror*/, _ijava_state_neg(oop_tmp), R11_scratch1); 1422 BIND(method_is_not_static); 1423 } 1424 1425 // At this point, arguments have been copied off the stack into 1426 // their JNI positions. Oops are boxed in-place on the stack, with 1427 // handles copied to arguments. The result handler address is in a 1428 // register. 1429 1430 // Pass JNIEnv address as first parameter. 1431 __ addir(R3_ARG1, thread_(jni_environment)); 1432 1433 // Load the native_method entry before we change the thread state. 1434 __ ld(native_method_fd, method_(native_function)); 1435 1436 //============================================================================= 1437 // Transition from _thread_in_Java to _thread_in_native. As soon as 1438 // we make this change the safepoint code needs to be certain that 1439 // the last Java frame we established is good. The pc in that frame 1440 // just needs to be near here not an actual return address. 1441 1442 // We use release_store_fence to update values like the thread state, where 1443 // we don't want the current thread to continue until all our prior memory 1444 // accesses (including the new thread state) are visible to other threads. 1445 __ li(R0, _thread_in_native); 1446 __ release(); 1447 1448 // TODO PPC port assert(4 == JavaThread::sz_thread_state(), "unexpected field size"); 1449 __ stw(R0, thread_(thread_state)); 1450 1451 //============================================================================= 1452 // Call the native method. Argument registers must not have been 1453 // overwritten since "__ call_stub(signature_handler);" (except for 1454 // ARG1 and ARG2 for static methods). 1455 1456 if (support_vthread_preemption) { 1457 // result_handler_addr is a nonvolatile register. Its value will be preserved across 1458 // the native call but only if the call isn't preempted. To preserve its value even 1459 // in the case of preemption we save it in the lresult slot. It is restored at 1460 // resume_pc if, and only if the call was preempted. This works because only 1461 // j.l.Object::wait calls are preempted which don't return a result. 1462 __ std(result_handler_addr, _ijava_state_neg(lresult), R11_scratch1); 1463 } 1464 __ push_cont_fastpath(); 1465 __ call_c(native_method_fd); 1466 __ pop_cont_fastpath(); 1467 1468 __ li(R0, 0); 1469 __ ld(R11_scratch1, 0, R1_SP); 1470 __ std(R3_RET, _ijava_state_neg(lresult), R11_scratch1); 1471 __ stfd(F1_RET, _ijava_state_neg(fresult), R11_scratch1); 1472 __ std(R0/*mirror*/, _ijava_state_neg(oop_tmp), R11_scratch1); // reset 1473 1474 // Note: C++ interpreter needs the following here: 1475 // The frame_manager_lr field, which we use for setting the last 1476 // java frame, gets overwritten by the signature handler. Restore 1477 // it now. 1478 //__ get_PC_trash_LR(R11_scratch1); 1479 //__ std(R11_scratch1, _top_ijava_frame_abi(frame_manager_lr), R1_SP); 1480 1481 // Because of GC R19_method may no longer be valid. 1482 1483 // Block, if necessary, before resuming in _thread_in_Java state. 1484 // In order for GC to work, don't clear the last_Java_sp until after 1485 // blocking. 1486 1487 //============================================================================= 1488 // Switch thread to "native transition" state before reading the 1489 // synchronization state. This additional state is necessary 1490 // because reading and testing the synchronization state is not 1491 // atomic w.r.t. GC, as this scenario demonstrates: Java thread A, 1492 // in _thread_in_native state, loads _not_synchronized and is 1493 // preempted. VM thread changes sync state to synchronizing and 1494 // suspends threads for GC. Thread A is resumed to finish this 1495 // native method, but doesn't block here since it didn't see any 1496 // synchronization in progress, and escapes. 1497 1498 // We use release_store_fence to update values like the thread state, where 1499 // we don't want the current thread to continue until all our prior memory 1500 // accesses (including the new thread state) are visible to other threads. 1501 __ li(R0/*thread_state*/, _thread_in_native_trans); 1502 __ release(); 1503 __ stw(R0/*thread_state*/, thread_(thread_state)); 1504 if (!UseSystemMemoryBarrier) { 1505 __ fence(); 1506 } 1507 1508 // Now before we return to java we must look for a current safepoint 1509 // (a new safepoint can not start since we entered native_trans). 1510 // We must check here because a current safepoint could be modifying 1511 // the callers registers right this moment. 1512 1513 // Acquire isn't strictly necessary here because of the fence, but 1514 // sync_state is declared to be volatile, so we do it anyway 1515 // (cmp-br-isync on one path, release (same as acquire on PPC64) on the other path). 1516 1517 Label do_safepoint, sync_check_done; 1518 // No synchronization in progress nor yet synchronized. 1519 __ safepoint_poll(do_safepoint, sync_state, true /* at_return */, false /* in_nmethod */); 1520 1521 // Not suspended. 1522 // TODO PPC port assert(4 == Thread::sz_suspend_flags(), "unexpected field size"); 1523 __ lwz(suspend_flags, thread_(suspend_flags)); 1524 __ cmpwi(CR1, suspend_flags, 0); 1525 __ beq(CR1, sync_check_done); 1526 1527 __ bind(do_safepoint); 1528 __ isync(); 1529 // Block. We do the call directly and leave the current 1530 // last_Java_frame setup undisturbed. We must save any possible 1531 // native result across the call. No oop is present. 1532 1533 __ mr(R3_ARG1, R16_thread); 1534 __ call_c(CAST_FROM_FN_PTR(address, JavaThread::check_special_condition_for_native_trans)); 1535 1536 __ bind(sync_check_done); 1537 1538 //============================================================================= 1539 // <<<<<< Back in Interpreter Frame >>>>> 1540 1541 // We are in thread_in_native_trans here and back in the normal 1542 // interpreter frame. We don't have to do anything special about 1543 // safepoints and we can switch to Java mode anytime we are ready. 1544 1545 // Note: frame::interpreter_frame_result has a dependency on how the 1546 // method result is saved across the call to post_method_exit. For 1547 // native methods it assumes that the non-FPU/non-void result is 1548 // saved in _native_lresult and a FPU result in _native_fresult. If 1549 // this changes then the interpreter_frame_result implementation 1550 // will need to be updated too. 1551 1552 // On PPC64, we have stored the result directly after the native call. 1553 1554 //============================================================================= 1555 // Back in Java 1556 1557 // We use release_store_fence to update values like the thread state, where 1558 // we don't want the current thread to continue until all our prior memory 1559 // accesses (including the new thread state) are visible to other threads. 1560 __ li(R0/*thread_state*/, _thread_in_Java); 1561 __ lwsync(); // Acquire safepoint and suspend state, release thread state. 1562 __ stw(R0/*thread_state*/, thread_(thread_state)); 1563 1564 if (support_vthread_preemption) { 1565 // Check preemption for Object.wait() 1566 Label not_preempted; 1567 __ ld(R0, in_bytes(JavaThread::preempt_alternate_return_offset()), R16_thread); 1568 __ cmpdi(CR0, R0, 0); 1569 __ beq(CR0, not_preempted); 1570 __ mtlr(R0); 1571 __ li(R0, 0); 1572 __ std(R0, in_bytes(JavaThread::preempt_alternate_return_offset()), R16_thread); 1573 __ blr(); 1574 1575 // Execution will be resumed here when the vthread becomes runnable again. 1576 __ bind(*resume_pc); 1577 __ restore_after_resume(R11_scratch1 /* fp */); 1578 // We saved the result handler before the call 1579 __ ld(result_handler_addr, _ijava_state_neg(lresult), R11_scratch1); 1580 #ifdef ASSERT 1581 // Clobber result slots. Only native methods returning void can be preemted currently. 1582 __ load_const(R3_RET, UCONST64(0xbad01001)); 1583 __ std(R3_RET, _ijava_state_neg(lresult), R11_scratch1); 1584 __ std(R3_RET, _ijava_state_neg(fresult), R11_scratch1); 1585 // reset_last_Java_frame() below asserts that a last java sp is set 1586 __ asm_assert_mem8_is_zero(in_bytes(JavaThread::last_Java_sp_offset()), 1587 R16_thread, FILE_AND_LINE ": Last java sp should not be set when resuming"); 1588 __ std(R3_RET, in_bytes(JavaThread::last_Java_sp_offset()), R16_thread); 1589 #endif 1590 __ bind(not_preempted); 1591 } 1592 1593 if (CheckJNICalls) { 1594 // clear_pending_jni_exception_check 1595 __ load_const_optimized(R0, 0L); 1596 __ st_ptr(R0, JavaThread::pending_jni_exception_check_fn_offset(), R16_thread); 1597 } 1598 1599 #if INCLUDE_JFR 1600 __ enter_jfr_critical_section(); 1601 1602 // This poll test is to uphold the invariant that a JFR sampled frame 1603 // must not return to its caller without a prior safepoint poll check. 1604 // The earlier poll check in this routine is insufficient for this purpose 1605 // because the thread has transitioned back to Java. 1606 1607 Label slow_path, fast_path; 1608 __ safepoint_poll(slow_path, R11_scratch1, true /* at_return */, false /* in_nmethod */); 1609 __ b(fast_path); 1610 __ bind(slow_path); 1611 __ call_VM_leaf(CAST_FROM_FN_PTR(address, InterpreterRuntime::at_unwind), R16_thread); 1612 __ align(32); 1613 __ bind(fast_path); 1614 1615 #endif // INCLUDE_JFR 1616 1617 __ reset_last_Java_frame(); 1618 1619 // Jvmdi/jvmpi support. Whether we've got an exception pending or 1620 // not, and whether unlocking throws an exception or not, we notify 1621 // on native method exit. If we do have an exception, we'll end up 1622 // in the caller's context to handle it, so if we don't do the 1623 // notify here, we'll drop it on the floor. 1624 __ notify_method_exit(true/*native method*/, 1625 ilgl /*illegal state (not used for native methods)*/, 1626 InterpreterMacroAssembler::NotifyJVMTI, 1627 false /*check_exceptions*/); 1628 1629 //============================================================================= 1630 // Handle exceptions 1631 1632 if (synchronized) { 1633 __ unlock_object(R26_monitor); // Can also unlock methods. 1634 } 1635 1636 // Reset active handles after returning from native. 1637 // thread->active_handles()->clear(); 1638 __ ld(active_handles, thread_(active_handles)); 1639 // TODO PPC port assert(4 == JNIHandleBlock::top_size_in_bytes(), "unexpected field size"); 1640 __ li(R0, 0); 1641 __ stw(R0, in_bytes(JNIHandleBlock::top_offset()), active_handles); 1642 1643 Label exception_return_sync_check_already_unlocked; 1644 __ ld(R0/*pending_exception*/, thread_(pending_exception)); 1645 __ cmpdi(CR0, R0/*pending_exception*/, 0); 1646 __ bne(CR0, exception_return_sync_check_already_unlocked); 1647 1648 //----------------------------------------------------------------------------- 1649 // No exception pending. 1650 1651 // Move native method result back into proper registers and return. 1652 // Invoke result handler (may unbox/promote). 1653 __ ld(R11_scratch1, 0, R1_SP); 1654 __ ld(R3_RET, _ijava_state_neg(lresult), R11_scratch1); 1655 __ lfd(F1_RET, _ijava_state_neg(fresult), R11_scratch1); 1656 __ call_stub(result_handler_addr); 1657 1658 __ merge_frames(/*top_frame_sp*/ R21_sender_SP, /*return_pc*/ R12_scratch2, R11_scratch1, R0); 1659 JFR_ONLY(__ leave_jfr_critical_section();) 1660 1661 // Must use the return pc which was loaded from the caller's frame 1662 // as the VM uses return-pc-patching for deoptimization. 1663 __ mtlr(R12_scratch2); 1664 __ blr(); 1665 1666 //----------------------------------------------------------------------------- 1667 // An exception is pending. We call into the runtime only if the 1668 // caller was not interpreted. If it was interpreted the 1669 // interpreter will do the correct thing. If it isn't interpreted 1670 // (call stub/compiled code) we will change our return and continue. 1671 1672 BIND(exception_return_sync_check); 1673 1674 if (synchronized) { 1675 __ unlock_object(R26_monitor); // Can also unlock methods. 1676 } 1677 BIND(exception_return_sync_check_already_unlocked); 1678 1679 const Register return_pc = R31; 1680 1681 __ ld(return_pc, 0, R1_SP); 1682 __ ld(return_pc, _abi0(lr), return_pc); 1683 1684 // Get the address of the exception handler. 1685 __ call_VM_leaf(CAST_FROM_FN_PTR(address, SharedRuntime::exception_handler_for_return_address), 1686 R16_thread, 1687 return_pc /* return pc */); 1688 __ merge_frames(/*top_frame_sp*/ R21_sender_SP, noreg, R11_scratch1, R12_scratch2); 1689 1690 // Load the PC of the exception handler into LR. 1691 __ mtlr(R3_RET); 1692 1693 // Load exception into R3_ARG1 and clear pending exception in thread. 1694 __ ld(R3_ARG1/*exception*/, thread_(pending_exception)); 1695 __ li(R4_ARG2, 0); 1696 __ std(R4_ARG2, thread_(pending_exception)); 1697 1698 // Load the original return pc into R4_ARG2. 1699 __ mr(R4_ARG2/*issuing_pc*/, return_pc); 1700 1701 // Return to exception handler. 1702 __ blr(); 1703 1704 //============================================================================= 1705 // Counter overflow. 1706 1707 if (inc_counter) { 1708 // Handle invocation counter overflow. 1709 __ bind(invocation_counter_overflow); 1710 1711 generate_counter_overflow(continue_after_compile); 1712 } 1713 1714 return entry; 1715 } 1716 1717 // Generic interpreted method entry to (asm) interpreter. 1718 // 1719 address TemplateInterpreterGenerator::generate_normal_entry(bool synchronized, bool object_init) { 1720 bool inc_counter = UseCompiler || CountCompiledCalls; 1721 address entry = __ pc(); 1722 // Generate the code to allocate the interpreter stack frame. 1723 Register Rsize_of_parameters = R4_ARG2, // Written by generate_fixed_frame. 1724 Rsize_of_locals = R5_ARG3; // Written by generate_fixed_frame. 1725 1726 // Does also a stack check to assure this frame fits on the stack. 1727 generate_fixed_frame(false, Rsize_of_parameters, Rsize_of_locals); 1728 1729 // -------------------------------------------------------------------------- 1730 // Zero out non-parameter locals. 1731 // Note: *Always* zero out non-parameter locals as Sparc does. It's not 1732 // worth to ask the flag, just do it. 1733 Register Rslot_addr = R6_ARG4, 1734 Rnum = R7_ARG5; 1735 Label Lno_locals, Lzero_loop; 1736 1737 // Set up the zeroing loop. 1738 __ subf(Rnum, Rsize_of_parameters, Rsize_of_locals); 1739 __ subf(Rslot_addr, Rsize_of_parameters, R18_locals); 1740 __ srdi_(Rnum, Rnum, Interpreter::logStackElementSize); 1741 __ beq(CR0, Lno_locals); 1742 __ li(R0, 0); 1743 __ mtctr(Rnum); 1744 1745 // The zero locals loop. 1746 __ bind(Lzero_loop); 1747 __ std(R0, 0, Rslot_addr); 1748 __ addi(Rslot_addr, Rslot_addr, -Interpreter::stackElementSize); 1749 __ bdnz(Lzero_loop); 1750 1751 __ bind(Lno_locals); 1752 1753 // -------------------------------------------------------------------------- 1754 // Counter increment and overflow check. 1755 Label invocation_counter_overflow; 1756 Label continue_after_compile; 1757 if (inc_counter || ProfileInterpreter) { 1758 1759 Register Rdo_not_unlock_if_synchronized_addr = R11_scratch1; 1760 if (synchronized) { 1761 // Since at this point in the method invocation the exception handler 1762 // would try to exit the monitor of synchronized methods which hasn't 1763 // been entered yet, we set the thread local variable 1764 // _do_not_unlock_if_synchronized to true. If any exception was thrown by 1765 // runtime, exception handling i.e. unlock_if_synchronized_method will 1766 // check this thread local flag. 1767 // This flag has two effects, one is to force an unwind in the topmost 1768 // interpreter frame and not perform an unlock while doing so. 1769 __ li(R0, 1); 1770 __ stb(R0, in_bytes(JavaThread::do_not_unlock_if_synchronized_offset()), R16_thread); 1771 } 1772 1773 // Argument and return type profiling. 1774 __ profile_parameters_type(R3_ARG1, R4_ARG2, R5_ARG3, R6_ARG4); 1775 1776 // Increment invocation counter and check for overflow. 1777 if (inc_counter) { 1778 generate_counter_incr(&invocation_counter_overflow); 1779 } 1780 1781 __ bind(continue_after_compile); 1782 } 1783 1784 bang_stack_shadow_pages(false); 1785 1786 if (inc_counter || ProfileInterpreter) { 1787 // Reset the _do_not_unlock_if_synchronized flag. 1788 if (synchronized) { 1789 __ li(R0, 0); 1790 __ stb(R0, in_bytes(JavaThread::do_not_unlock_if_synchronized_offset()), R16_thread); 1791 } 1792 } 1793 1794 // -------------------------------------------------------------------------- 1795 // Locking of synchronized methods. Must happen AFTER invocation_counter 1796 // check and stack overflow check, so method is not locked if overflows. 1797 if (synchronized) { 1798 lock_method(R3_ARG1, R4_ARG2, R5_ARG3); 1799 } 1800 1801 #ifdef ASSERT 1802 else { 1803 Label Lok; 1804 __ lhz(R0, in_bytes(Method::access_flags_offset()), R19_method); 1805 __ andi_(R0, R0, JVM_ACC_SYNCHRONIZED); 1806 __ asm_assert_eq("method needs synchronization"); 1807 __ bind(Lok); 1808 } 1809 #endif // ASSERT 1810 1811 // Issue a StoreStore barrier on entry to Object_init if the 1812 // class has strict field fields. Be lazy, always do it. 1813 if (object_init) { 1814 __ membar(MacroAssembler::StoreStore); 1815 } 1816 1817 // -------------------------------------------------------------------------- 1818 // JVMTI support 1819 __ notify_method_entry(); 1820 1821 // -------------------------------------------------------------------------- 1822 // Start executing instructions. 1823 __ dispatch_next(vtos); 1824 1825 // -------------------------------------------------------------------------- 1826 if (inc_counter) { 1827 // Handle invocation counter overflow. 1828 __ bind(invocation_counter_overflow); 1829 generate_counter_overflow(continue_after_compile); 1830 } 1831 return entry; 1832 } 1833 1834 // CRC32 Intrinsics. 1835 // 1836 // Contract on scratch and work registers. 1837 // ======================================= 1838 // 1839 // On ppc, the register set {R2..R12} is available in the interpreter as scratch/work registers. 1840 // You should, however, keep in mind that {R3_ARG1..R10_ARG8} is the C-ABI argument register set. 1841 // You can't rely on these registers across calls. 1842 // 1843 // The generators for CRC32_update and for CRC32_updateBytes use the 1844 // scratch/work register set internally, passing the work registers 1845 // as arguments to the MacroAssembler emitters as required. 1846 // 1847 // R3_ARG1..R6_ARG4 are preset to hold the incoming java arguments. 1848 // Their contents is not constant but may change according to the requirements 1849 // of the emitted code. 1850 // 1851 // All other registers from the scratch/work register set are used "internally" 1852 // and contain garbage (i.e. unpredictable values) once blr() is reached. 1853 // Basically, only R3_RET contains a defined value which is the function result. 1854 // 1855 /** 1856 * Method entry for static native methods: 1857 * int java.util.zip.CRC32.update(int crc, int b) 1858 */ 1859 address TemplateInterpreterGenerator::generate_CRC32_update_entry() { 1860 assert(UseCRC32Intrinsics, "this intrinsic is not supported"); 1861 address start = __ pc(); // Remember stub start address (is rtn value). 1862 Label slow_path; 1863 1864 // Safepoint check 1865 const Register sync_state = R11_scratch1; 1866 __ safepoint_poll(slow_path, sync_state, false /* at_return */, false /* in_nmethod */); 1867 1868 // We don't generate local frame and don't align stack because 1869 // we not even call stub code (we generate the code inline) 1870 // and there is no safepoint on this path. 1871 1872 // Load java parameters. 1873 // R15_esp is callers operand stack pointer, i.e. it points to the parameters. 1874 const Register argP = R15_esp; 1875 const Register crc = R3_ARG1; // crc value 1876 const Register data = R4_ARG2; 1877 const Register table = R5_ARG3; // address of crc32 table 1878 1879 BLOCK_COMMENT("CRC32_update {"); 1880 1881 // Arguments are reversed on java expression stack 1882 #ifdef VM_LITTLE_ENDIAN 1883 int data_offs = 0+1*wordSize; // (stack) address of byte value. Emitter expects address, not value. 1884 // Being passed as an int, the single byte is at offset +0. 1885 #else 1886 int data_offs = 3+1*wordSize; // (stack) address of byte value. Emitter expects address, not value. 1887 // Being passed from java as an int, the single byte is at offset +3. 1888 #endif 1889 __ lwz(crc, 2*wordSize, argP); // Current crc state, zero extend to 64 bit to have a clean register. 1890 __ lbz(data, data_offs, argP); // Byte from buffer, zero-extended. 1891 __ load_const_optimized(table, StubRoutines::crc_table_addr(), R0); 1892 __ kernel_crc32_singleByteReg(crc, data, table, true); 1893 1894 // Restore caller sp for c2i case (from compiled) and for resized sender frame (from interpreted). 1895 __ resize_frame_absolute(R21_sender_SP, R11_scratch1, R0); 1896 __ blr(); 1897 1898 // Generate a vanilla native entry as the slow path. 1899 BLOCK_COMMENT("} CRC32_update"); 1900 BIND(slow_path); 1901 __ jump_to_entry(Interpreter::entry_for_kind(Interpreter::native), R11_scratch1); 1902 return start; 1903 } 1904 1905 /** 1906 * Method entry for static native methods: 1907 * int java.util.zip.CRC32.updateBytes( int crc, byte[] b, int off, int len) 1908 * int java.util.zip.CRC32.updateByteBuffer(int crc, long* buf, int off, int len) 1909 */ 1910 address TemplateInterpreterGenerator::generate_CRC32_updateBytes_entry(AbstractInterpreter::MethodKind kind) { 1911 assert(UseCRC32Intrinsics, "this intrinsic is not supported"); 1912 address start = __ pc(); // Remember stub start address (is rtn value). 1913 Label slow_path; 1914 1915 // Safepoint check 1916 const Register sync_state = R11_scratch1; 1917 __ safepoint_poll(slow_path, sync_state, false /* at_return */, false /* in_nmethod */); 1918 1919 // We don't generate local frame and don't align stack because 1920 // we not even call stub code (we generate the code inline) 1921 // and there is no safepoint on this path. 1922 1923 // Load parameters. 1924 // Z_esp is callers operand stack pointer, i.e. it points to the parameters. 1925 const Register argP = R15_esp; 1926 const Register crc = R3_ARG1; // crc value 1927 const Register data = R4_ARG2; // address of java byte array 1928 const Register dataLen = R5_ARG3; // source data len 1929 const Register tmp = R11_scratch1; 1930 1931 // Arguments are reversed on java expression stack. 1932 // Calculate address of start element. 1933 if (kind == Interpreter::java_util_zip_CRC32_updateByteBuffer) { // Used for "updateByteBuffer direct". 1934 BLOCK_COMMENT("CRC32_updateByteBuffer {"); 1935 // crc @ (SP + 5W) (32bit) 1936 // buf @ (SP + 3W) (64bit ptr to long array) 1937 // off @ (SP + 2W) (32bit) 1938 // dataLen @ (SP + 1W) (32bit) 1939 // data = buf + off 1940 __ ld( data, 3*wordSize, argP); // start of byte buffer 1941 __ lwa( tmp, 2*wordSize, argP); // byte buffer offset 1942 __ lwa( dataLen, 1*wordSize, argP); // #bytes to process 1943 __ lwz( crc, 5*wordSize, argP); // current crc state 1944 __ add( data, data, tmp); // Add byte buffer offset. 1945 } else { // Used for "updateBytes update". 1946 BLOCK_COMMENT("CRC32_updateBytes {"); 1947 // crc @ (SP + 4W) (32bit) 1948 // buf @ (SP + 3W) (64bit ptr to byte array) 1949 // off @ (SP + 2W) (32bit) 1950 // dataLen @ (SP + 1W) (32bit) 1951 // data = buf + off + base_offset 1952 __ ld( data, 3*wordSize, argP); // start of byte buffer 1953 __ lwa( tmp, 2*wordSize, argP); // byte buffer offset 1954 __ lwa( dataLen, 1*wordSize, argP); // #bytes to process 1955 __ add( data, data, tmp); // add byte buffer offset 1956 __ lwz( crc, 4*wordSize, argP); // current crc state 1957 __ addi(data, data, arrayOopDesc::base_offset_in_bytes(T_BYTE)); 1958 } 1959 1960 __ crc32(crc, data, dataLen, R2, R6, R7, R8, R9, R10, R11, R12, false); 1961 1962 // Restore caller sp for c2i case (from compiled) and for resized sender frame (from interpreted). 1963 __ resize_frame_absolute(R21_sender_SP, R11_scratch1, R0); 1964 __ blr(); 1965 1966 // Generate a vanilla native entry as the slow path. 1967 BLOCK_COMMENT("} CRC32_updateBytes(Buffer)"); 1968 BIND(slow_path); 1969 __ jump_to_entry(Interpreter::entry_for_kind(Interpreter::native), R11_scratch1); 1970 return start; 1971 } 1972 1973 1974 /** 1975 * Method entry for intrinsic-candidate (non-native) methods: 1976 * int java.util.zip.CRC32C.updateBytes( int crc, byte[] b, int off, int end) 1977 * int java.util.zip.CRC32C.updateDirectByteBuffer(int crc, long* buf, int off, int end) 1978 * Unlike CRC32, CRC32C does not have any methods marked as native 1979 * CRC32C also uses an "end" variable instead of the length variable CRC32 uses 1980 **/ 1981 address TemplateInterpreterGenerator::generate_CRC32C_updateBytes_entry(AbstractInterpreter::MethodKind kind) { 1982 assert(UseCRC32CIntrinsics, "this intrinsic is not supported"); 1983 address start = __ pc(); // Remember stub start address (is rtn value). 1984 1985 // We don't generate local frame and don't align stack because 1986 // we not even call stub code (we generate the code inline) 1987 // and there is no safepoint on this path. 1988 1989 // Load parameters. 1990 // Z_esp is callers operand stack pointer, i.e. it points to the parameters. 1991 const Register argP = R15_esp; 1992 const Register crc = R3_ARG1; // crc value 1993 const Register data = R4_ARG2; // address of java byte array 1994 const Register dataLen = R5_ARG3; // source data len 1995 const Register tmp = R11_scratch1; 1996 1997 // Arguments are reversed on java expression stack. 1998 // Calculate address of start element. 1999 if (kind == Interpreter::java_util_zip_CRC32C_updateDirectByteBuffer) { // Used for "updateDirectByteBuffer". 2000 BLOCK_COMMENT("CRC32C_updateDirectByteBuffer {"); 2001 // crc @ (SP + 5W) (32bit) 2002 // buf @ (SP + 3W) (64bit ptr to long array) 2003 // off @ (SP + 2W) (32bit) 2004 // dataLen @ (SP + 1W) (32bit) 2005 // data = buf + off 2006 __ ld( data, 3*wordSize, argP); // start of byte buffer 2007 __ lwa( tmp, 2*wordSize, argP); // byte buffer offset 2008 __ lwa( dataLen, 1*wordSize, argP); // #bytes to process 2009 __ lwz( crc, 5*wordSize, argP); // current crc state 2010 __ add( data, data, tmp); // Add byte buffer offset. 2011 __ sub( dataLen, dataLen, tmp); // (end_index - offset) 2012 } else { // Used for "updateBytes update". 2013 BLOCK_COMMENT("CRC32C_updateBytes {"); 2014 // crc @ (SP + 4W) (32bit) 2015 // buf @ (SP + 3W) (64bit ptr to byte array) 2016 // off @ (SP + 2W) (32bit) 2017 // dataLen @ (SP + 1W) (32bit) 2018 // data = buf + off + base_offset 2019 __ ld( data, 3*wordSize, argP); // start of byte buffer 2020 __ lwa( tmp, 2*wordSize, argP); // byte buffer offset 2021 __ lwa( dataLen, 1*wordSize, argP); // #bytes to process 2022 __ add( data, data, tmp); // add byte buffer offset 2023 __ sub( dataLen, dataLen, tmp); // (end_index - offset) 2024 __ lwz( crc, 4*wordSize, argP); // current crc state 2025 __ addi(data, data, arrayOopDesc::base_offset_in_bytes(T_BYTE)); 2026 } 2027 2028 __ crc32(crc, data, dataLen, R2, R6, R7, R8, R9, R10, R11, R12, true); 2029 2030 // Restore caller sp for c2i case (from compiled) and for resized sender frame (from interpreted). 2031 __ resize_frame_absolute(R21_sender_SP, R11_scratch1, R0); 2032 __ blr(); 2033 2034 BLOCK_COMMENT("} CRC32C_update{Bytes|DirectByteBuffer}"); 2035 return start; 2036 } 2037 2038 address TemplateInterpreterGenerator::generate_currentThread() { 2039 address entry_point = __ pc(); 2040 2041 __ ld(R3_RET, JavaThread::vthread_offset(), R16_thread); 2042 __ resolve_oop_handle(R3_RET, R11_scratch1, R12_scratch2, MacroAssembler::PRESERVATION_FRAME_LR); 2043 2044 // restore caller sp for c2i case (from compiled) and for resized sender frame (from interpreted). 2045 __ resize_frame_absolute(R21_sender_SP, R11_scratch1, R0); 2046 __ blr(); 2047 2048 return entry_point; 2049 } 2050 2051 // ============================================================================= 2052 // Exceptions 2053 2054 void TemplateInterpreterGenerator::generate_throw_exception() { 2055 Register Rexception = R17_tos, 2056 Rcontinuation = R3_RET; 2057 2058 // -------------------------------------------------------------------------- 2059 // Entry point if an method returns with a pending exception (rethrow). 2060 Interpreter::_rethrow_exception_entry = __ pc(); 2061 { 2062 __ restore_interpreter_state(R11_scratch1, false /*bcp_and_mdx_only*/, true /*restore_top_frame_sp*/); 2063 2064 // Compiled code destroys templateTableBase, reload. 2065 __ load_const_optimized(R25_templateTableBase, (address)Interpreter::dispatch_table((TosState)0), R11_scratch1); 2066 } 2067 2068 // Entry point if a interpreted method throws an exception (throw). 2069 Interpreter::_throw_exception_entry = __ pc(); 2070 { 2071 __ mr(Rexception, R3_RET); 2072 2073 __ verify_oop(Rexception); 2074 2075 // Expression stack must be empty before entering the VM in case of an exception. 2076 __ empty_expression_stack(); 2077 // Find exception handler address and preserve exception oop. 2078 // Call C routine to find handler and jump to it. 2079 __ call_VM(Rexception, CAST_FROM_FN_PTR(address, InterpreterRuntime::exception_handler_for_exception), Rexception); 2080 __ mtctr(Rcontinuation); 2081 // Push exception for exception handler bytecodes. 2082 __ push_ptr(Rexception); 2083 2084 // Jump to exception handler (may be remove activation entry!). 2085 __ bctr(); 2086 } 2087 2088 // If the exception is not handled in the current frame the frame is 2089 // removed and the exception is rethrown (i.e. exception 2090 // continuation is _rethrow_exception). 2091 // 2092 // Note: At this point the bci is still the bxi for the instruction 2093 // which caused the exception and the expression stack is 2094 // empty. Thus, for any VM calls at this point, GC will find a legal 2095 // oop map (with empty expression stack). 2096 2097 // In current activation 2098 // tos: exception 2099 // bcp: exception bcp 2100 2101 // -------------------------------------------------------------------------- 2102 // JVMTI PopFrame support 2103 2104 Interpreter::_remove_activation_preserving_args_entry = __ pc(); 2105 { 2106 // Set the popframe_processing bit in popframe_condition indicating that we are 2107 // currently handling popframe, so that call_VMs that may happen later do not 2108 // trigger new popframe handling cycles. 2109 __ lwz(R11_scratch1, in_bytes(JavaThread::popframe_condition_offset()), R16_thread); 2110 __ ori(R11_scratch1, R11_scratch1, JavaThread::popframe_processing_bit); 2111 __ stw(R11_scratch1, in_bytes(JavaThread::popframe_condition_offset()), R16_thread); 2112 2113 // Empty the expression stack, as in normal exception handling. 2114 __ empty_expression_stack(); 2115 __ unlock_if_synchronized_method(vtos, /* throw_monitor_exception */ false, /* install_monitor_exception */ false); 2116 2117 // Check to see whether we are returning to a deoptimized frame. 2118 // (The PopFrame call ensures that the caller of the popped frame is 2119 // either interpreted or compiled and deoptimizes it if compiled.) 2120 // Note that we don't compare the return PC against the 2121 // deoptimization blob's unpack entry because of the presence of 2122 // adapter frames in C2. 2123 Label Lcaller_not_deoptimized; 2124 Register return_pc = R3_ARG1; 2125 __ ld(return_pc, 0, R1_SP); 2126 __ ld(return_pc, _abi0(lr), return_pc); 2127 __ call_VM_leaf(CAST_FROM_FN_PTR(address, InterpreterRuntime::interpreter_contains), return_pc); 2128 __ cmpdi(CR0, R3_RET, 0); 2129 __ bne(CR0, Lcaller_not_deoptimized); 2130 2131 // The deoptimized case. 2132 // In this case, we can't call dispatch_next() after the frame is 2133 // popped, but instead must save the incoming arguments and restore 2134 // them after deoptimization has occurred. 2135 __ ld(R4_ARG2, in_bytes(Method::const_offset()), R19_method); 2136 __ lhz(R4_ARG2 /* number of params */, in_bytes(ConstMethod::size_of_parameters_offset()), R4_ARG2); 2137 __ slwi(R4_ARG2, R4_ARG2, Interpreter::logStackElementSize); 2138 __ addi(R5_ARG3, R18_locals, Interpreter::stackElementSize); 2139 __ subf(R5_ARG3, R4_ARG2, R5_ARG3); 2140 // Save these arguments. 2141 __ call_VM_leaf(CAST_FROM_FN_PTR(address, Deoptimization::popframe_preserve_args), R16_thread, R4_ARG2, R5_ARG3); 2142 2143 // Inform deoptimization that it is responsible for restoring these arguments. 2144 __ load_const_optimized(R11_scratch1, JavaThread::popframe_force_deopt_reexecution_bit); 2145 __ stw(R11_scratch1, in_bytes(JavaThread::popframe_condition_offset()), R16_thread); 2146 2147 // Return from the current method into the deoptimization blob. Will eventually 2148 // end up in the deopt interpreter entry, deoptimization prepared everything that 2149 // we will reexecute the call that called us. 2150 __ merge_frames(/*top_frame_sp*/ R21_sender_SP, /*reload return_pc*/ return_pc, R11_scratch1, R12_scratch2); 2151 __ mtlr(return_pc); 2152 __ pop_cont_fastpath(); 2153 __ blr(); 2154 2155 // The non-deoptimized case. 2156 __ bind(Lcaller_not_deoptimized); 2157 2158 // Clear the popframe condition flag. 2159 __ li(R0, 0); 2160 __ stw(R0, in_bytes(JavaThread::popframe_condition_offset()), R16_thread); 2161 2162 // Get out of the current method and re-execute the call that called us. 2163 __ merge_frames(/*top_frame_sp*/ R21_sender_SP, /*return_pc*/ noreg, R11_scratch1, R12_scratch2); 2164 __ pop_cont_fastpath(); 2165 __ restore_interpreter_state(R11_scratch1, false /*bcp_and_mdx_only*/, true /*restore_top_frame_sp*/); 2166 if (ProfileInterpreter) { 2167 __ set_method_data_pointer_for_bcp(); 2168 __ ld(R11_scratch1, 0, R1_SP); 2169 __ std(R28_mdx, _ijava_state_neg(mdx), R11_scratch1); 2170 } 2171 #if INCLUDE_JVMTI 2172 Label L_done; 2173 2174 __ lbz(R11_scratch1, 0, R14_bcp); 2175 __ cmpwi(CR0, R11_scratch1, Bytecodes::_invokestatic); 2176 __ bne(CR0, L_done); 2177 2178 // The member name argument must be restored if _invokestatic is re-executed after a PopFrame call. 2179 // Detect such a case in the InterpreterRuntime function and return the member name argument, or null. 2180 __ ld(R4_ARG2, 0, R18_locals); 2181 __ call_VM(R4_ARG2, CAST_FROM_FN_PTR(address, InterpreterRuntime::member_name_arg_or_null), R4_ARG2, R19_method, R14_bcp); 2182 2183 __ cmpdi(CR0, R4_ARG2, 0); 2184 __ beq(CR0, L_done); 2185 __ std(R4_ARG2, wordSize, R15_esp); 2186 __ bind(L_done); 2187 #endif // INCLUDE_JVMTI 2188 __ dispatch_next(vtos); 2189 } 2190 // end of JVMTI PopFrame support 2191 2192 // -------------------------------------------------------------------------- 2193 // Remove activation exception entry. 2194 // This is jumped to if an interpreted method can't handle an exception itself 2195 // (we come from the throw/rethrow exception entry above). We're going to call 2196 // into the VM to find the exception handler in the caller, pop the current 2197 // frame and return the handler we calculated. 2198 Interpreter::_remove_activation_entry = __ pc(); 2199 { 2200 __ pop_ptr(Rexception); 2201 __ verify_oop(Rexception); 2202 __ std(Rexception, in_bytes(JavaThread::vm_result_oop_offset()), R16_thread); 2203 2204 __ unlock_if_synchronized_method(vtos, /* throw_monitor_exception */ false, true); 2205 __ notify_method_exit(false, vtos, InterpreterMacroAssembler::SkipNotifyJVMTI, false); 2206 2207 __ get_vm_result_oop(Rexception); 2208 2209 // We are done with this activation frame; find out where to go next. 2210 // The continuation point will be an exception handler, which expects 2211 // the following registers set up: 2212 // 2213 // RET: exception oop 2214 // ARG2: Issuing PC (see generate_exception_blob()), only used if the caller is compiled. 2215 2216 Register return_pc = R31; // Needs to survive the runtime call. 2217 __ ld(return_pc, 0, R1_SP); 2218 __ ld(return_pc, _abi0(lr), return_pc); 2219 __ call_VM_leaf(CAST_FROM_FN_PTR(address, SharedRuntime::exception_handler_for_return_address), R16_thread, return_pc); 2220 2221 // Remove the current activation. 2222 __ merge_frames(/*top_frame_sp*/ R21_sender_SP, /*return_pc*/ noreg, R11_scratch1, R12_scratch2); 2223 __ pop_cont_fastpath(); 2224 2225 __ mr(R4_ARG2, return_pc); 2226 __ mtlr(R3_RET); 2227 __ mr(R3_RET, Rexception); 2228 __ blr(); 2229 } 2230 } 2231 2232 // JVMTI ForceEarlyReturn support. 2233 // Returns "in the middle" of a method with a "fake" return value. 2234 address TemplateInterpreterGenerator::generate_earlyret_entry_for(TosState state) { 2235 2236 Register Rscratch1 = R11_scratch1, 2237 Rscratch2 = R12_scratch2; 2238 2239 address entry = __ pc(); 2240 __ empty_expression_stack(); 2241 2242 __ load_earlyret_value(state, Rscratch1); 2243 2244 __ ld(Rscratch1, in_bytes(JavaThread::jvmti_thread_state_offset()), R16_thread); 2245 // Clear the earlyret state. 2246 __ li(R0, 0); 2247 __ stw(R0, in_bytes(JvmtiThreadState::earlyret_state_offset()), Rscratch1); 2248 2249 __ remove_activation(state, false, false); 2250 // Copied from TemplateTable::_return. 2251 // Restoration of lr done by remove_activation. 2252 switch (state) { 2253 // Narrow result if state is itos but result type is smaller. 2254 case btos: 2255 case ztos: 2256 case ctos: 2257 case stos: 2258 case itos: __ narrow(R17_tos); /* fall through */ 2259 case ltos: 2260 case atos: __ mr(R3_RET, R17_tos); break; 2261 case ftos: 2262 case dtos: __ fmr(F1_RET, F15_ftos); break; 2263 case vtos: // This might be a constructor. Final fields (and volatile fields on PPC64) need 2264 // to get visible before the reference to the object gets stored anywhere. 2265 __ membar(Assembler::StoreStore); break; 2266 default : ShouldNotReachHere(); 2267 } 2268 __ blr(); 2269 2270 return entry; 2271 } // end of ForceEarlyReturn support 2272 2273 //----------------------------------------------------------------------------- 2274 // Helper for vtos entry point generation 2275 2276 void TemplateInterpreterGenerator::set_vtos_entry_points(Template* t, 2277 address& bep, 2278 address& cep, 2279 address& sep, 2280 address& aep, 2281 address& iep, 2282 address& lep, 2283 address& fep, 2284 address& dep, 2285 address& vep) { 2286 assert(t->is_valid() && t->tos_in() == vtos, "illegal template"); 2287 Label L; 2288 2289 aep = __ pc(); __ push_ptr(); __ b(L); 2290 fep = __ pc(); __ push_f(); __ b(L); 2291 dep = __ pc(); __ push_d(); __ b(L); 2292 lep = __ pc(); __ push_l(); __ b(L); 2293 __ align(32, 12, 24); // align L 2294 bep = cep = sep = 2295 iep = __ pc(); __ push_i(); 2296 vep = __ pc(); 2297 __ bind(L); 2298 generate_and_dispatch(t); 2299 } 2300 2301 //----------------------------------------------------------------------------- 2302 2303 // Non-product code 2304 #ifndef PRODUCT 2305 address TemplateInterpreterGenerator::generate_trace_code(TosState state) { 2306 //__ flush_bundle(); 2307 address entry = __ pc(); 2308 2309 const char *bname = nullptr; 2310 uint tsize = 0; 2311 switch(state) { 2312 case ftos: 2313 bname = "trace_code_ftos {"; 2314 tsize = 2; 2315 break; 2316 case btos: 2317 bname = "trace_code_btos {"; 2318 tsize = 2; 2319 break; 2320 case ztos: 2321 bname = "trace_code_ztos {"; 2322 tsize = 2; 2323 break; 2324 case ctos: 2325 bname = "trace_code_ctos {"; 2326 tsize = 2; 2327 break; 2328 case stos: 2329 bname = "trace_code_stos {"; 2330 tsize = 2; 2331 break; 2332 case itos: 2333 bname = "trace_code_itos {"; 2334 tsize = 2; 2335 break; 2336 case ltos: 2337 bname = "trace_code_ltos {"; 2338 tsize = 3; 2339 break; 2340 case atos: 2341 bname = "trace_code_atos {"; 2342 tsize = 2; 2343 break; 2344 case vtos: 2345 // Note: In case of vtos, the topmost of stack value could be a int or doubl 2346 // In case of a double (2 slots) we won't see the 2nd stack value. 2347 // Maybe we simply should print the topmost 3 stack slots to cope with the problem. 2348 bname = "trace_code_vtos {"; 2349 tsize = 2; 2350 2351 break; 2352 case dtos: 2353 bname = "trace_code_dtos {"; 2354 tsize = 3; 2355 break; 2356 default: 2357 ShouldNotReachHere(); 2358 } 2359 BLOCK_COMMENT(bname); 2360 2361 // Support short-cut for TraceBytecodesAt. 2362 // Don't call into the VM if we don't want to trace to speed up things. 2363 Label Lskip_vm_call; 2364 if (TraceBytecodesAt > 0) { 2365 int offs1 = __ load_const_optimized(R11_scratch1, (address) &TraceBytecodesAt, R0, true); 2366 int offs2 = __ load_const_optimized(R12_scratch2, (address) &BytecodeCounter::_counter_value, R0, true); 2367 __ ld(R11_scratch1, offs1, R11_scratch1); 2368 __ ld(R12_scratch2, offs2, R12_scratch2); 2369 __ cmpd(CR0, R12_scratch2, R11_scratch1); 2370 __ blt(CR0, Lskip_vm_call); 2371 } 2372 2373 __ push(state); 2374 // Load 2 topmost expression stack values. 2375 __ ld(R6_ARG4, tsize*Interpreter::stackElementSize, R15_esp); 2376 __ ld(R5_ARG3, Interpreter::stackElementSize, R15_esp); 2377 __ mflr(R31); 2378 __ call_VM(noreg, CAST_FROM_FN_PTR(address, InterpreterRuntime::trace_bytecode), /* unused */ R4_ARG2, R5_ARG3, R6_ARG4, false); 2379 __ mtlr(R31); 2380 __ pop(state); 2381 2382 if (TraceBytecodesAt > 0) { 2383 __ bind(Lskip_vm_call); 2384 } 2385 __ blr(); 2386 BLOCK_COMMENT("} trace_code"); 2387 return entry; 2388 } 2389 2390 void TemplateInterpreterGenerator::count_bytecode() { 2391 int offs = __ load_const_optimized(R11_scratch1, (address) &BytecodeCounter::_counter_value, R12_scratch2, true); 2392 __ ld(R12_scratch2, offs, R11_scratch1); 2393 __ addi(R12_scratch2, R12_scratch2, 1); 2394 __ std(R12_scratch2, offs, R11_scratch1); 2395 } 2396 2397 void TemplateInterpreterGenerator::histogram_bytecode(Template* t) { 2398 int offs = __ load_const_optimized(R11_scratch1, (address) &BytecodeHistogram::_counters[t->bytecode()], R12_scratch2, true); 2399 __ lwz(R12_scratch2, offs, R11_scratch1); 2400 __ addi(R12_scratch2, R12_scratch2, 1); 2401 __ stw(R12_scratch2, offs, R11_scratch1); 2402 } 2403 2404 void TemplateInterpreterGenerator::histogram_bytecode_pair(Template* t) { 2405 const Register addr = R11_scratch1, 2406 tmp = R12_scratch2; 2407 // Get index, shift out old bytecode, bring in new bytecode, and store it. 2408 // _index = (_index >> log2_number_of_codes) | 2409 // (bytecode << log2_number_of_codes); 2410 int offs1 = __ load_const_optimized(addr, (address)&BytecodePairHistogram::_index, tmp, true); 2411 __ lwz(tmp, offs1, addr); 2412 __ srwi(tmp, tmp, BytecodePairHistogram::log2_number_of_codes); 2413 __ ori(tmp, tmp, ((int) t->bytecode()) << BytecodePairHistogram::log2_number_of_codes); 2414 __ stw(tmp, offs1, addr); 2415 2416 // Bump bucket contents. 2417 // _counters[_index] ++; 2418 int offs2 = __ load_const_optimized(addr, (address)&BytecodePairHistogram::_counters, R0, true); 2419 __ sldi(tmp, tmp, LogBytesPerInt); 2420 __ add(addr, tmp, addr); 2421 __ lwz(tmp, offs2, addr); 2422 __ addi(tmp, tmp, 1); 2423 __ stw(tmp, offs2, addr); 2424 } 2425 2426 void TemplateInterpreterGenerator::trace_bytecode(Template* t) { 2427 // Call a little run-time stub to avoid blow-up for each bytecode. 2428 // The run-time runtime saves the right registers, depending on 2429 // the tosca in-state for the given template. 2430 2431 assert(Interpreter::trace_code(t->tos_in()) != nullptr, 2432 "entry must have been generated"); 2433 2434 // Note: we destroy LR here. 2435 __ bl(Interpreter::trace_code(t->tos_in())); 2436 } 2437 2438 void TemplateInterpreterGenerator::stop_interpreter_at() { 2439 Label L; 2440 int offs1 = __ load_const_optimized(R11_scratch1, (address) &StopInterpreterAt, R0, true); 2441 int offs2 = __ load_const_optimized(R12_scratch2, (address) &BytecodeCounter::_counter_value, R0, true); 2442 __ ld(R11_scratch1, offs1, R11_scratch1); 2443 __ ld(R12_scratch2, offs2, R12_scratch2); 2444 __ cmpd(CR0, R12_scratch2, R11_scratch1); 2445 __ bne(CR0, L); 2446 __ illtrap(); 2447 __ bind(L); 2448 } 2449 2450 #endif // !PRODUCT --- EOF ---