1 /* 2 * Copyright (c) 2003, 2015, Oracle and/or its affiliates. All rights reserved. 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 4 * 5 * This code is free software; you can redistribute it and/or modify it 6 * under the terms of the GNU General Public License version 2 only, as 7 * published by the Free Software Foundation. 8 * 9 * This code is distributed in the hope that it will be useful, but WITHOUT 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 12 * version 2 for more details (a copy is included in the LICENSE file that 13 * accompanied this code). 14 * 15 * You should have received a copy of the GNU General Public License version 16 * 2 along with this work; if not, write to the Free Software Foundation, 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 18 * 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 20 * or visit www.oracle.com if you need additional information or have any 21 * questions. 22 * 23 */ 24 25 #include "precompiled.hpp" 26 #include "asm/macroAssembler.hpp" 27 #include "asm/macroAssembler.inline.hpp" 28 #include "interpreter/interpreter.hpp" 29 #include "nativeInst_x86.hpp" 30 #include "oops/instanceOop.hpp" 31 #include "oops/method.hpp" 32 #include "oops/objArrayKlass.hpp" 33 #include "oops/oop.inline.hpp" 34 #include "prims/methodHandles.hpp" 35 #include "runtime/frame.inline.hpp" 36 #include "runtime/handles.inline.hpp" 37 #include "runtime/sharedRuntime.hpp" 38 #include "runtime/stubCodeGenerator.hpp" 39 #include "runtime/stubRoutines.hpp" 40 #include "runtime/thread.inline.hpp" 41 #include "utilities/top.hpp" 42 #ifdef COMPILER2 43 #include "opto/runtime.hpp" 44 #endif 45 46 // Declaration and definition of StubGenerator (no .hpp file). 47 // For a more detailed description of the stub routine structure 48 // see the comment in stubRoutines.hpp 49 50 #define __ _masm-> 51 #define TIMES_OOP (UseCompressedOops ? Address::times_4 : Address::times_8) 52 #define a__ ((Assembler*)_masm)-> 53 54 #ifdef PRODUCT 55 #define BLOCK_COMMENT(str) /* nothing */ 56 #else 57 #define BLOCK_COMMENT(str) __ block_comment(str) 58 #endif 59 60 #define BIND(label) bind(label); BLOCK_COMMENT(#label ":") 61 const int MXCSR_MASK = 0xFFC0; // Mask out any pending exceptions 62 63 // Stub Code definitions 64 65 static address handle_unsafe_access() { 66 JavaThread* thread = JavaThread::current(); 67 address pc = thread->saved_exception_pc(); 68 // pc is the instruction which we must emulate 69 // doing a no-op is fine: return garbage from the load 70 // therefore, compute npc 71 address npc = Assembler::locate_next_instruction(pc); 72 73 // request an async exception 74 thread->set_pending_unsafe_access_error(); 75 76 // return address of next instruction to execute 77 return npc; 78 } 79 80 class StubGenerator: public StubCodeGenerator { 81 private: 82 83 #ifdef PRODUCT 84 #define inc_counter_np(counter) ((void)0) 85 #else 86 void inc_counter_np_(int& counter) { 87 // This can destroy rscratch1 if counter is far from the code cache 88 __ incrementl(ExternalAddress((address)&counter)); 89 } 90 #define inc_counter_np(counter) \ 91 BLOCK_COMMENT("inc_counter " #counter); \ 92 inc_counter_np_(counter); 93 #endif 94 95 // Call stubs are used to call Java from C 96 // 97 // Linux Arguments: 98 // c_rarg0: call wrapper address address 99 // c_rarg1: result address 100 // c_rarg2: result type BasicType 101 // c_rarg3: method Method* 102 // c_rarg4: (interpreter) entry point address 103 // c_rarg5: parameters intptr_t* 104 // 16(rbp): parameter size (in words) int 105 // 24(rbp): thread Thread* 106 // 107 // [ return_from_Java ] <--- rsp 108 // [ argument word n ] 109 // ... 110 // -12 [ argument word 1 ] 111 // -11 [ saved r15 ] <--- rsp_after_call 112 // -10 [ saved r14 ] 113 // -9 [ saved r13 ] 114 // -8 [ saved r12 ] 115 // -7 [ saved rbx ] 116 // -6 [ call wrapper ] 117 // -5 [ result ] 118 // -4 [ result type ] 119 // -3 [ method ] 120 // -2 [ entry point ] 121 // -1 [ parameters ] 122 // 0 [ saved rbp ] <--- rbp 123 // 1 [ return address ] 124 // 2 [ parameter size ] 125 // 3 [ thread ] 126 // 127 // Windows Arguments: 128 // c_rarg0: call wrapper address address 129 // c_rarg1: result address 130 // c_rarg2: result type BasicType 131 // c_rarg3: method Method* 132 // 48(rbp): (interpreter) entry point address 133 // 56(rbp): parameters intptr_t* 134 // 64(rbp): parameter size (in words) int 135 // 72(rbp): thread Thread* 136 // 137 // [ return_from_Java ] <--- rsp 138 // [ argument word n ] 139 // ... 140 // -60 [ argument word 1 ] 141 // -59 [ saved xmm31 ] <--- rsp after_call 142 // [ saved xmm16-xmm30 ] (EVEX enabled, else the space is blank) 143 // -27 [ saved xmm15 ] 144 // [ saved xmm7-xmm14 ] 145 // -9 [ saved xmm6 ] (each xmm register takes 2 slots) 146 // -7 [ saved r15 ] 147 // -6 [ saved r14 ] 148 // -5 [ saved r13 ] 149 // -4 [ saved r12 ] 150 // -3 [ saved rdi ] 151 // -2 [ saved rsi ] 152 // -1 [ saved rbx ] 153 // 0 [ saved rbp ] <--- rbp 154 // 1 [ return address ] 155 // 2 [ call wrapper ] 156 // 3 [ result ] 157 // 4 [ result type ] 158 // 5 [ method ] 159 // 6 [ entry point ] 160 // 7 [ parameters ] 161 // 8 [ parameter size ] 162 // 9 [ thread ] 163 // 164 // Windows reserves the callers stack space for arguments 1-4. 165 // We spill c_rarg0-c_rarg3 to this space. 166 167 // Call stub stack layout word offsets from rbp 168 enum call_stub_layout { 169 #ifdef _WIN64 170 xmm_save_first = 6, // save from xmm6 171 xmm_save_last = 31, // to xmm31 172 xmm_save_base = -9, 173 rsp_after_call_off = xmm_save_base - 2 * (xmm_save_last - xmm_save_first), // -27 174 r15_off = -7, 175 r14_off = -6, 176 r13_off = -5, 177 r12_off = -4, 178 rdi_off = -3, 179 rsi_off = -2, 180 rbx_off = -1, 181 rbp_off = 0, 182 retaddr_off = 1, 183 call_wrapper_off = 2, 184 result_off = 3, 185 result_type_off = 4, 186 method_off = 5, 187 entry_point_off = 6, 188 parameters_off = 7, 189 parameter_size_off = 8, 190 thread_off = 9 191 #else 192 rsp_after_call_off = -12, 193 mxcsr_off = rsp_after_call_off, 194 r15_off = -11, 195 r14_off = -10, 196 r13_off = -9, 197 r12_off = -8, 198 rbx_off = -7, 199 call_wrapper_off = -6, 200 result_off = -5, 201 result_type_off = -4, 202 method_off = -3, 203 entry_point_off = -2, 204 parameters_off = -1, 205 rbp_off = 0, 206 retaddr_off = 1, 207 parameter_size_off = 2, 208 thread_off = 3 209 #endif 210 }; 211 212 #ifdef _WIN64 213 Address xmm_save(int reg) { 214 assert(reg >= xmm_save_first && reg <= xmm_save_last, "XMM register number out of range"); 215 return Address(rbp, (xmm_save_base - (reg - xmm_save_first) * 2) * wordSize); 216 } 217 #endif 218 219 address generate_call_stub(address& return_address) { 220 assert((int)frame::entry_frame_after_call_words == -(int)rsp_after_call_off + 1 && 221 (int)frame::entry_frame_call_wrapper_offset == (int)call_wrapper_off, 222 "adjust this code"); 223 StubCodeMark mark(this, "StubRoutines", "call_stub"); 224 address start = __ pc(); 225 226 // same as in generate_catch_exception()! 227 const Address rsp_after_call(rbp, rsp_after_call_off * wordSize); 228 229 const Address call_wrapper (rbp, call_wrapper_off * wordSize); 230 const Address result (rbp, result_off * wordSize); 231 const Address result_type (rbp, result_type_off * wordSize); 232 const Address method (rbp, method_off * wordSize); 233 const Address entry_point (rbp, entry_point_off * wordSize); 234 const Address parameters (rbp, parameters_off * wordSize); 235 const Address parameter_size(rbp, parameter_size_off * wordSize); 236 237 // same as in generate_catch_exception()! 238 const Address thread (rbp, thread_off * wordSize); 239 240 const Address r15_save(rbp, r15_off * wordSize); 241 const Address r14_save(rbp, r14_off * wordSize); 242 const Address r13_save(rbp, r13_off * wordSize); 243 const Address r12_save(rbp, r12_off * wordSize); 244 const Address rbx_save(rbp, rbx_off * wordSize); 245 246 // stub code 247 __ enter(); 248 __ subptr(rsp, -rsp_after_call_off * wordSize); 249 250 // save register parameters 251 #ifndef _WIN64 252 __ movptr(parameters, c_rarg5); // parameters 253 __ movptr(entry_point, c_rarg4); // entry_point 254 #endif 255 256 __ movptr(method, c_rarg3); // method 257 __ movl(result_type, c_rarg2); // result type 258 __ movptr(result, c_rarg1); // result 259 __ movptr(call_wrapper, c_rarg0); // call wrapper 260 261 // save regs belonging to calling function 262 __ movptr(rbx_save, rbx); 263 __ movptr(r12_save, r12); 264 __ movptr(r13_save, r13); 265 __ movptr(r14_save, r14); 266 __ movptr(r15_save, r15); 267 if (UseAVX > 2) { 268 __ movl(rbx, 0xffff); 269 __ kmovql(k1, rbx); 270 } 271 #ifdef _WIN64 272 int last_reg = 15; 273 if (UseAVX > 2) { 274 last_reg = 31; 275 } 276 if (VM_Version::supports_evex()) { 277 for (int i = xmm_save_first; i <= last_reg; i++) { 278 __ vextractf32x4h(xmm_save(i), as_XMMRegister(i), 0); 279 } 280 } else { 281 for (int i = xmm_save_first; i <= last_reg; i++) { 282 __ movdqu(xmm_save(i), as_XMMRegister(i)); 283 } 284 } 285 286 const Address rdi_save(rbp, rdi_off * wordSize); 287 const Address rsi_save(rbp, rsi_off * wordSize); 288 289 __ movptr(rsi_save, rsi); 290 __ movptr(rdi_save, rdi); 291 #else 292 const Address mxcsr_save(rbp, mxcsr_off * wordSize); 293 { 294 Label skip_ldmx; 295 __ stmxcsr(mxcsr_save); 296 __ movl(rax, mxcsr_save); 297 __ andl(rax, MXCSR_MASK); // Only check control and mask bits 298 ExternalAddress mxcsr_std(StubRoutines::addr_mxcsr_std()); 299 __ cmp32(rax, mxcsr_std); 300 __ jcc(Assembler::equal, skip_ldmx); 301 __ ldmxcsr(mxcsr_std); 302 __ bind(skip_ldmx); 303 } 304 #endif 305 306 // Load up thread register 307 __ movptr(r15_thread, thread); 308 __ reinit_heapbase(); 309 310 #ifdef ASSERT 311 // make sure we have no pending exceptions 312 { 313 Label L; 314 __ cmpptr(Address(r15_thread, Thread::pending_exception_offset()), (int32_t)NULL_WORD); 315 __ jcc(Assembler::equal, L); 316 __ stop("StubRoutines::call_stub: entered with pending exception"); 317 __ bind(L); 318 } 319 #endif 320 321 // pass parameters if any 322 BLOCK_COMMENT("pass parameters if any"); 323 Label parameters_done; 324 __ movl(c_rarg3, parameter_size); 325 __ testl(c_rarg3, c_rarg3); 326 __ jcc(Assembler::zero, parameters_done); 327 328 Label loop; 329 __ movptr(c_rarg2, parameters); // parameter pointer 330 __ movl(c_rarg1, c_rarg3); // parameter counter is in c_rarg1 331 __ BIND(loop); 332 __ movptr(rax, Address(c_rarg2, 0));// get parameter 333 __ addptr(c_rarg2, wordSize); // advance to next parameter 334 __ decrementl(c_rarg1); // decrement counter 335 __ push(rax); // pass parameter 336 __ jcc(Assembler::notZero, loop); 337 338 // call Java function 339 __ BIND(parameters_done); 340 __ movptr(rbx, method); // get Method* 341 __ movptr(c_rarg1, entry_point); // get entry_point 342 __ mov(r13, rsp); // set sender sp 343 BLOCK_COMMENT("call Java function"); 344 __ call(c_rarg1); 345 346 BLOCK_COMMENT("call_stub_return_address:"); 347 return_address = __ pc(); 348 349 // store result depending on type (everything that is not 350 // T_OBJECT, T_LONG, T_FLOAT or T_DOUBLE is treated as T_INT) 351 __ movptr(c_rarg0, result); 352 Label is_long, is_float, is_double, exit; 353 __ movl(c_rarg1, result_type); 354 __ cmpl(c_rarg1, T_OBJECT); 355 __ jcc(Assembler::equal, is_long); 356 __ cmpl(c_rarg1, T_LONG); 357 __ jcc(Assembler::equal, is_long); 358 __ cmpl(c_rarg1, T_FLOAT); 359 __ jcc(Assembler::equal, is_float); 360 __ cmpl(c_rarg1, T_DOUBLE); 361 __ jcc(Assembler::equal, is_double); 362 363 // handle T_INT case 364 __ movl(Address(c_rarg0, 0), rax); 365 366 __ BIND(exit); 367 368 // pop parameters 369 __ lea(rsp, rsp_after_call); 370 371 #ifdef ASSERT 372 // verify that threads correspond 373 { 374 Label L1, L2, L3; 375 __ cmpptr(r15_thread, thread); 376 __ jcc(Assembler::equal, L1); 377 __ stop("StubRoutines::call_stub: r15_thread is corrupted"); 378 __ bind(L1); 379 __ get_thread(rbx); 380 __ cmpptr(r15_thread, thread); 381 __ jcc(Assembler::equal, L2); 382 __ stop("StubRoutines::call_stub: r15_thread is modified by call"); 383 __ bind(L2); 384 __ cmpptr(r15_thread, rbx); 385 __ jcc(Assembler::equal, L3); 386 __ stop("StubRoutines::call_stub: threads must correspond"); 387 __ bind(L3); 388 } 389 #endif 390 391 // restore regs belonging to calling function 392 #ifdef _WIN64 393 // emit the restores for xmm regs 394 if (VM_Version::supports_evex()) { 395 for (int i = xmm_save_first; i <= last_reg; i++) { 396 __ vinsertf32x4h(as_XMMRegister(i), xmm_save(i), 0); 397 } 398 } else { 399 for (int i = xmm_save_first; i <= last_reg; i++) { 400 __ movdqu(as_XMMRegister(i), xmm_save(i)); 401 } 402 } 403 #endif 404 __ movptr(r15, r15_save); 405 __ movptr(r14, r14_save); 406 __ movptr(r13, r13_save); 407 __ movptr(r12, r12_save); 408 __ movptr(rbx, rbx_save); 409 410 #ifdef _WIN64 411 __ movptr(rdi, rdi_save); 412 __ movptr(rsi, rsi_save); 413 #else 414 __ ldmxcsr(mxcsr_save); 415 #endif 416 417 // restore rsp 418 __ addptr(rsp, -rsp_after_call_off * wordSize); 419 420 // return 421 __ pop(rbp); 422 __ ret(0); 423 424 // handle return types different from T_INT 425 __ BIND(is_long); 426 __ movq(Address(c_rarg0, 0), rax); 427 __ jmp(exit); 428 429 __ BIND(is_float); 430 __ movflt(Address(c_rarg0, 0), xmm0); 431 __ jmp(exit); 432 433 __ BIND(is_double); 434 __ movdbl(Address(c_rarg0, 0), xmm0); 435 __ jmp(exit); 436 437 return start; 438 } 439 440 // Return point for a Java call if there's an exception thrown in 441 // Java code. The exception is caught and transformed into a 442 // pending exception stored in JavaThread that can be tested from 443 // within the VM. 444 // 445 // Note: Usually the parameters are removed by the callee. In case 446 // of an exception crossing an activation frame boundary, that is 447 // not the case if the callee is compiled code => need to setup the 448 // rsp. 449 // 450 // rax: exception oop 451 452 address generate_catch_exception() { 453 StubCodeMark mark(this, "StubRoutines", "catch_exception"); 454 address start = __ pc(); 455 456 // same as in generate_call_stub(): 457 const Address rsp_after_call(rbp, rsp_after_call_off * wordSize); 458 const Address thread (rbp, thread_off * wordSize); 459 460 #ifdef ASSERT 461 // verify that threads correspond 462 { 463 Label L1, L2, L3; 464 __ cmpptr(r15_thread, thread); 465 __ jcc(Assembler::equal, L1); 466 __ stop("StubRoutines::catch_exception: r15_thread is corrupted"); 467 __ bind(L1); 468 __ get_thread(rbx); 469 __ cmpptr(r15_thread, thread); 470 __ jcc(Assembler::equal, L2); 471 __ stop("StubRoutines::catch_exception: r15_thread is modified by call"); 472 __ bind(L2); 473 __ cmpptr(r15_thread, rbx); 474 __ jcc(Assembler::equal, L3); 475 __ stop("StubRoutines::catch_exception: threads must correspond"); 476 __ bind(L3); 477 } 478 #endif 479 480 // set pending exception 481 __ verify_oop(rax); 482 483 __ movptr(Address(r15_thread, Thread::pending_exception_offset()), rax); 484 __ lea(rscratch1, ExternalAddress((address)__FILE__)); 485 __ movptr(Address(r15_thread, Thread::exception_file_offset()), rscratch1); 486 __ movl(Address(r15_thread, Thread::exception_line_offset()), (int) __LINE__); 487 488 // complete return to VM 489 assert(StubRoutines::_call_stub_return_address != NULL, 490 "_call_stub_return_address must have been generated before"); 491 __ jump(RuntimeAddress(StubRoutines::_call_stub_return_address)); 492 493 return start; 494 } 495 496 // Continuation point for runtime calls returning with a pending 497 // exception. The pending exception check happened in the runtime 498 // or native call stub. The pending exception in Thread is 499 // converted into a Java-level exception. 500 // 501 // Contract with Java-level exception handlers: 502 // rax: exception 503 // rdx: throwing pc 504 // 505 // NOTE: At entry of this stub, exception-pc must be on stack !! 506 507 address generate_forward_exception() { 508 StubCodeMark mark(this, "StubRoutines", "forward exception"); 509 address start = __ pc(); 510 511 // Upon entry, the sp points to the return address returning into 512 // Java (interpreted or compiled) code; i.e., the return address 513 // becomes the throwing pc. 514 // 515 // Arguments pushed before the runtime call are still on the stack 516 // but the exception handler will reset the stack pointer -> 517 // ignore them. A potential result in registers can be ignored as 518 // well. 519 520 #ifdef ASSERT 521 // make sure this code is only executed if there is a pending exception 522 { 523 Label L; 524 __ cmpptr(Address(r15_thread, Thread::pending_exception_offset()), (int32_t) NULL); 525 __ jcc(Assembler::notEqual, L); 526 __ stop("StubRoutines::forward exception: no pending exception (1)"); 527 __ bind(L); 528 } 529 #endif 530 531 // compute exception handler into rbx 532 __ movptr(c_rarg0, Address(rsp, 0)); 533 BLOCK_COMMENT("call exception_handler_for_return_address"); 534 __ call_VM_leaf(CAST_FROM_FN_PTR(address, 535 SharedRuntime::exception_handler_for_return_address), 536 r15_thread, c_rarg0); 537 __ mov(rbx, rax); 538 539 // setup rax & rdx, remove return address & clear pending exception 540 __ pop(rdx); 541 __ movptr(rax, Address(r15_thread, Thread::pending_exception_offset())); 542 __ movptr(Address(r15_thread, Thread::pending_exception_offset()), (int32_t)NULL_WORD); 543 544 #ifdef ASSERT 545 // make sure exception is set 546 { 547 Label L; 548 __ testptr(rax, rax); 549 __ jcc(Assembler::notEqual, L); 550 __ stop("StubRoutines::forward exception: no pending exception (2)"); 551 __ bind(L); 552 } 553 #endif 554 555 // continue at exception handler (return address removed) 556 // rax: exception 557 // rbx: exception handler 558 // rdx: throwing pc 559 __ verify_oop(rax); 560 __ jmp(rbx); 561 562 return start; 563 } 564 565 // Support for jint atomic::xchg(jint exchange_value, volatile jint* dest) 566 // 567 // Arguments : 568 // c_rarg0: exchange_value 569 // c_rarg0: dest 570 // 571 // Result: 572 // *dest <- ex, return (orig *dest) 573 address generate_atomic_xchg() { 574 StubCodeMark mark(this, "StubRoutines", "atomic_xchg"); 575 address start = __ pc(); 576 577 __ movl(rax, c_rarg0); // Copy to eax we need a return value anyhow 578 __ xchgl(rax, Address(c_rarg1, 0)); // automatic LOCK 579 __ ret(0); 580 581 return start; 582 } 583 584 // Support for intptr_t atomic::xchg_ptr(intptr_t exchange_value, volatile intptr_t* dest) 585 // 586 // Arguments : 587 // c_rarg0: exchange_value 588 // c_rarg1: dest 589 // 590 // Result: 591 // *dest <- ex, return (orig *dest) 592 address generate_atomic_xchg_ptr() { 593 StubCodeMark mark(this, "StubRoutines", "atomic_xchg_ptr"); 594 address start = __ pc(); 595 596 __ movptr(rax, c_rarg0); // Copy to eax we need a return value anyhow 597 __ xchgptr(rax, Address(c_rarg1, 0)); // automatic LOCK 598 __ ret(0); 599 600 return start; 601 } 602 603 // Support for jint atomic::atomic_cmpxchg(jint exchange_value, volatile jint* dest, 604 // jint compare_value) 605 // 606 // Arguments : 607 // c_rarg0: exchange_value 608 // c_rarg1: dest 609 // c_rarg2: compare_value 610 // 611 // Result: 612 // if ( compare_value == *dest ) { 613 // *dest = exchange_value 614 // return compare_value; 615 // else 616 // return *dest; 617 address generate_atomic_cmpxchg() { 618 StubCodeMark mark(this, "StubRoutines", "atomic_cmpxchg"); 619 address start = __ pc(); 620 621 __ movl(rax, c_rarg2); 622 if ( os::is_MP() ) __ lock(); 623 __ cmpxchgl(c_rarg0, Address(c_rarg1, 0)); 624 __ ret(0); 625 626 return start; 627 } 628 629 // Support for jbyte atomic::atomic_cmpxchg(jbyte exchange_value, volatile jbyte* dest, 630 // jbyte compare_value) 631 // 632 // Arguments : 633 // c_rarg0: exchange_value 634 // c_rarg1: dest 635 // c_rarg2: compare_value 636 // 637 // Result: 638 // if ( compare_value == *dest ) { 639 // *dest = exchange_value 640 // return compare_value; 641 // else 642 // return *dest; 643 address generate_atomic_cmpxchg_byte() { 644 StubCodeMark mark(this, "StubRoutines", "atomic_cmpxchg_byte"); 645 address start = __ pc(); 646 647 __ movsbq(rax, c_rarg2); 648 if ( os::is_MP() ) __ lock(); 649 __ cmpxchgb(c_rarg0, Address(c_rarg1, 0)); 650 __ ret(0); 651 652 return start; 653 } 654 655 // Support for jlong atomic::atomic_cmpxchg(jlong exchange_value, 656 // volatile jlong* dest, 657 // jlong compare_value) 658 // Arguments : 659 // c_rarg0: exchange_value 660 // c_rarg1: dest 661 // c_rarg2: compare_value 662 // 663 // Result: 664 // if ( compare_value == *dest ) { 665 // *dest = exchange_value 666 // return compare_value; 667 // else 668 // return *dest; 669 address generate_atomic_cmpxchg_long() { 670 StubCodeMark mark(this, "StubRoutines", "atomic_cmpxchg_long"); 671 address start = __ pc(); 672 673 __ movq(rax, c_rarg2); 674 if ( os::is_MP() ) __ lock(); 675 __ cmpxchgq(c_rarg0, Address(c_rarg1, 0)); 676 __ ret(0); 677 678 return start; 679 } 680 681 // Support for jint atomic::add(jint add_value, volatile jint* dest) 682 // 683 // Arguments : 684 // c_rarg0: add_value 685 // c_rarg1: dest 686 // 687 // Result: 688 // *dest += add_value 689 // return *dest; 690 address generate_atomic_add() { 691 StubCodeMark mark(this, "StubRoutines", "atomic_add"); 692 address start = __ pc(); 693 694 __ movl(rax, c_rarg0); 695 if ( os::is_MP() ) __ lock(); 696 __ xaddl(Address(c_rarg1, 0), c_rarg0); 697 __ addl(rax, c_rarg0); 698 __ ret(0); 699 700 return start; 701 } 702 703 // Support for intptr_t atomic::add_ptr(intptr_t add_value, volatile intptr_t* dest) 704 // 705 // Arguments : 706 // c_rarg0: add_value 707 // c_rarg1: dest 708 // 709 // Result: 710 // *dest += add_value 711 // return *dest; 712 address generate_atomic_add_ptr() { 713 StubCodeMark mark(this, "StubRoutines", "atomic_add_ptr"); 714 address start = __ pc(); 715 716 __ movptr(rax, c_rarg0); // Copy to eax we need a return value anyhow 717 if ( os::is_MP() ) __ lock(); 718 __ xaddptr(Address(c_rarg1, 0), c_rarg0); 719 __ addptr(rax, c_rarg0); 720 __ ret(0); 721 722 return start; 723 } 724 725 // Support for intptr_t OrderAccess::fence() 726 // 727 // Arguments : 728 // 729 // Result: 730 address generate_orderaccess_fence() { 731 StubCodeMark mark(this, "StubRoutines", "orderaccess_fence"); 732 address start = __ pc(); 733 __ membar(Assembler::StoreLoad); 734 __ ret(0); 735 736 return start; 737 } 738 739 // Support for intptr_t get_previous_fp() 740 // 741 // This routine is used to find the previous frame pointer for the 742 // caller (current_frame_guess). This is used as part of debugging 743 // ps() is seemingly lost trying to find frames. 744 // This code assumes that caller current_frame_guess) has a frame. 745 address generate_get_previous_fp() { 746 StubCodeMark mark(this, "StubRoutines", "get_previous_fp"); 747 const Address old_fp(rbp, 0); 748 const Address older_fp(rax, 0); 749 address start = __ pc(); 750 751 __ enter(); 752 __ movptr(rax, old_fp); // callers fp 753 __ movptr(rax, older_fp); // the frame for ps() 754 __ pop(rbp); 755 __ ret(0); 756 757 return start; 758 } 759 760 // Support for intptr_t get_previous_sp() 761 // 762 // This routine is used to find the previous stack pointer for the 763 // caller. 764 address generate_get_previous_sp() { 765 StubCodeMark mark(this, "StubRoutines", "get_previous_sp"); 766 address start = __ pc(); 767 768 __ movptr(rax, rsp); 769 __ addptr(rax, 8); // return address is at the top of the stack. 770 __ ret(0); 771 772 return start; 773 } 774 775 //---------------------------------------------------------------------------------------------------- 776 // Support for void verify_mxcsr() 777 // 778 // This routine is used with -Xcheck:jni to verify that native 779 // JNI code does not return to Java code without restoring the 780 // MXCSR register to our expected state. 781 782 address generate_verify_mxcsr() { 783 StubCodeMark mark(this, "StubRoutines", "verify_mxcsr"); 784 address start = __ pc(); 785 786 const Address mxcsr_save(rsp, 0); 787 788 if (CheckJNICalls) { 789 Label ok_ret; 790 ExternalAddress mxcsr_std(StubRoutines::addr_mxcsr_std()); 791 __ push(rax); 792 __ subptr(rsp, wordSize); // allocate a temp location 793 __ stmxcsr(mxcsr_save); 794 __ movl(rax, mxcsr_save); 795 __ andl(rax, MXCSR_MASK); // Only check control and mask bits 796 __ cmp32(rax, mxcsr_std); 797 __ jcc(Assembler::equal, ok_ret); 798 799 __ warn("MXCSR changed by native JNI code, use -XX:+RestoreMXCSROnJNICall"); 800 801 __ ldmxcsr(mxcsr_std); 802 803 __ bind(ok_ret); 804 __ addptr(rsp, wordSize); 805 __ pop(rax); 806 } 807 808 __ ret(0); 809 810 return start; 811 } 812 813 address generate_f2i_fixup() { 814 StubCodeMark mark(this, "StubRoutines", "f2i_fixup"); 815 Address inout(rsp, 5 * wordSize); // return address + 4 saves 816 817 address start = __ pc(); 818 819 Label L; 820 821 __ push(rax); 822 __ push(c_rarg3); 823 __ push(c_rarg2); 824 __ push(c_rarg1); 825 826 __ movl(rax, 0x7f800000); 827 __ xorl(c_rarg3, c_rarg3); 828 __ movl(c_rarg2, inout); 829 __ movl(c_rarg1, c_rarg2); 830 __ andl(c_rarg1, 0x7fffffff); 831 __ cmpl(rax, c_rarg1); // NaN? -> 0 832 __ jcc(Assembler::negative, L); 833 __ testl(c_rarg2, c_rarg2); // signed ? min_jint : max_jint 834 __ movl(c_rarg3, 0x80000000); 835 __ movl(rax, 0x7fffffff); 836 __ cmovl(Assembler::positive, c_rarg3, rax); 837 838 __ bind(L); 839 __ movptr(inout, c_rarg3); 840 841 __ pop(c_rarg1); 842 __ pop(c_rarg2); 843 __ pop(c_rarg3); 844 __ pop(rax); 845 846 __ ret(0); 847 848 return start; 849 } 850 851 address generate_f2l_fixup() { 852 StubCodeMark mark(this, "StubRoutines", "f2l_fixup"); 853 Address inout(rsp, 5 * wordSize); // return address + 4 saves 854 address start = __ pc(); 855 856 Label L; 857 858 __ push(rax); 859 __ push(c_rarg3); 860 __ push(c_rarg2); 861 __ push(c_rarg1); 862 863 __ movl(rax, 0x7f800000); 864 __ xorl(c_rarg3, c_rarg3); 865 __ movl(c_rarg2, inout); 866 __ movl(c_rarg1, c_rarg2); 867 __ andl(c_rarg1, 0x7fffffff); 868 __ cmpl(rax, c_rarg1); // NaN? -> 0 869 __ jcc(Assembler::negative, L); 870 __ testl(c_rarg2, c_rarg2); // signed ? min_jlong : max_jlong 871 __ mov64(c_rarg3, 0x8000000000000000); 872 __ mov64(rax, 0x7fffffffffffffff); 873 __ cmov(Assembler::positive, c_rarg3, rax); 874 875 __ bind(L); 876 __ movptr(inout, c_rarg3); 877 878 __ pop(c_rarg1); 879 __ pop(c_rarg2); 880 __ pop(c_rarg3); 881 __ pop(rax); 882 883 __ ret(0); 884 885 return start; 886 } 887 888 address generate_d2i_fixup() { 889 StubCodeMark mark(this, "StubRoutines", "d2i_fixup"); 890 Address inout(rsp, 6 * wordSize); // return address + 5 saves 891 892 address start = __ pc(); 893 894 Label L; 895 896 __ push(rax); 897 __ push(c_rarg3); 898 __ push(c_rarg2); 899 __ push(c_rarg1); 900 __ push(c_rarg0); 901 902 __ movl(rax, 0x7ff00000); 903 __ movq(c_rarg2, inout); 904 __ movl(c_rarg3, c_rarg2); 905 __ mov(c_rarg1, c_rarg2); 906 __ mov(c_rarg0, c_rarg2); 907 __ negl(c_rarg3); 908 __ shrptr(c_rarg1, 0x20); 909 __ orl(c_rarg3, c_rarg2); 910 __ andl(c_rarg1, 0x7fffffff); 911 __ xorl(c_rarg2, c_rarg2); 912 __ shrl(c_rarg3, 0x1f); 913 __ orl(c_rarg1, c_rarg3); 914 __ cmpl(rax, c_rarg1); 915 __ jcc(Assembler::negative, L); // NaN -> 0 916 __ testptr(c_rarg0, c_rarg0); // signed ? min_jint : max_jint 917 __ movl(c_rarg2, 0x80000000); 918 __ movl(rax, 0x7fffffff); 919 __ cmov(Assembler::positive, c_rarg2, rax); 920 921 __ bind(L); 922 __ movptr(inout, c_rarg2); 923 924 __ pop(c_rarg0); 925 __ pop(c_rarg1); 926 __ pop(c_rarg2); 927 __ pop(c_rarg3); 928 __ pop(rax); 929 930 __ ret(0); 931 932 return start; 933 } 934 935 address generate_d2l_fixup() { 936 StubCodeMark mark(this, "StubRoutines", "d2l_fixup"); 937 Address inout(rsp, 6 * wordSize); // return address + 5 saves 938 939 address start = __ pc(); 940 941 Label L; 942 943 __ push(rax); 944 __ push(c_rarg3); 945 __ push(c_rarg2); 946 __ push(c_rarg1); 947 __ push(c_rarg0); 948 949 __ movl(rax, 0x7ff00000); 950 __ movq(c_rarg2, inout); 951 __ movl(c_rarg3, c_rarg2); 952 __ mov(c_rarg1, c_rarg2); 953 __ mov(c_rarg0, c_rarg2); 954 __ negl(c_rarg3); 955 __ shrptr(c_rarg1, 0x20); 956 __ orl(c_rarg3, c_rarg2); 957 __ andl(c_rarg1, 0x7fffffff); 958 __ xorl(c_rarg2, c_rarg2); 959 __ shrl(c_rarg3, 0x1f); 960 __ orl(c_rarg1, c_rarg3); 961 __ cmpl(rax, c_rarg1); 962 __ jcc(Assembler::negative, L); // NaN -> 0 963 __ testq(c_rarg0, c_rarg0); // signed ? min_jlong : max_jlong 964 __ mov64(c_rarg2, 0x8000000000000000); 965 __ mov64(rax, 0x7fffffffffffffff); 966 __ cmovq(Assembler::positive, c_rarg2, rax); 967 968 __ bind(L); 969 __ movq(inout, c_rarg2); 970 971 __ pop(c_rarg0); 972 __ pop(c_rarg1); 973 __ pop(c_rarg2); 974 __ pop(c_rarg3); 975 __ pop(rax); 976 977 __ ret(0); 978 979 return start; 980 } 981 982 address generate_fp_mask(const char *stub_name, int64_t mask) { 983 __ align(CodeEntryAlignment); 984 StubCodeMark mark(this, "StubRoutines", stub_name); 985 address start = __ pc(); 986 987 __ emit_data64( mask, relocInfo::none ); 988 __ emit_data64( mask, relocInfo::none ); 989 990 return start; 991 } 992 993 // The following routine generates a subroutine to throw an 994 // asynchronous UnknownError when an unsafe access gets a fault that 995 // could not be reasonably prevented by the programmer. (Example: 996 // SIGBUS/OBJERR.) 997 address generate_handler_for_unsafe_access() { 998 StubCodeMark mark(this, "StubRoutines", "handler_for_unsafe_access"); 999 address start = __ pc(); 1000 1001 __ push(0); // hole for return address-to-be 1002 __ pusha(); // push registers 1003 Address next_pc(rsp, RegisterImpl::number_of_registers * BytesPerWord); 1004 1005 // FIXME: this probably needs alignment logic 1006 1007 __ subptr(rsp, frame::arg_reg_save_area_bytes); 1008 BLOCK_COMMENT("call handle_unsafe_access"); 1009 __ call(RuntimeAddress(CAST_FROM_FN_PTR(address, handle_unsafe_access))); 1010 __ addptr(rsp, frame::arg_reg_save_area_bytes); 1011 1012 __ movptr(next_pc, rax); // stuff next address 1013 __ popa(); 1014 __ ret(0); // jump to next address 1015 1016 return start; 1017 } 1018 1019 // Non-destructive plausibility checks for oops 1020 // 1021 // Arguments: 1022 // all args on stack! 1023 // 1024 // Stack after saving c_rarg3: 1025 // [tos + 0]: saved c_rarg3 1026 // [tos + 1]: saved c_rarg2 1027 // [tos + 2]: saved r12 (several TemplateTable methods use it) 1028 // [tos + 3]: saved flags 1029 // [tos + 4]: return address 1030 // * [tos + 5]: error message (char*) 1031 // * [tos + 6]: object to verify (oop) 1032 // * [tos + 7]: saved rax - saved by caller and bashed 1033 // * [tos + 8]: saved r10 (rscratch1) - saved by caller 1034 // * = popped on exit 1035 address generate_verify_oop() { 1036 StubCodeMark mark(this, "StubRoutines", "verify_oop"); 1037 address start = __ pc(); 1038 1039 Label exit, error; 1040 1041 __ pushf(); 1042 __ incrementl(ExternalAddress((address) StubRoutines::verify_oop_count_addr())); 1043 1044 __ push(r12); 1045 1046 // save c_rarg2 and c_rarg3 1047 __ push(c_rarg2); 1048 __ push(c_rarg3); 1049 1050 enum { 1051 // After previous pushes. 1052 oop_to_verify = 6 * wordSize, 1053 saved_rax = 7 * wordSize, 1054 saved_r10 = 8 * wordSize, 1055 1056 // Before the call to MacroAssembler::debug(), see below. 1057 return_addr = 16 * wordSize, 1058 error_msg = 17 * wordSize 1059 }; 1060 1061 // get object 1062 __ movptr(rax, Address(rsp, oop_to_verify)); 1063 1064 // make sure object is 'reasonable' 1065 __ testptr(rax, rax); 1066 __ jcc(Assembler::zero, exit); // if obj is NULL it is OK 1067 // Check if the oop is in the right area of memory 1068 __ movptr(c_rarg2, rax); 1069 __ movptr(c_rarg3, (intptr_t) Universe::verify_oop_mask()); 1070 __ andptr(c_rarg2, c_rarg3); 1071 __ movptr(c_rarg3, (intptr_t) Universe::verify_oop_bits()); 1072 __ cmpptr(c_rarg2, c_rarg3); 1073 __ jcc(Assembler::notZero, error); 1074 1075 // set r12 to heapbase for load_klass() 1076 __ reinit_heapbase(); 1077 1078 // make sure klass is 'reasonable', which is not zero. 1079 __ load_klass(rax, rax); // get klass 1080 __ testptr(rax, rax); 1081 __ jcc(Assembler::zero, error); // if klass is NULL it is broken 1082 1083 // return if everything seems ok 1084 __ bind(exit); 1085 __ movptr(rax, Address(rsp, saved_rax)); // get saved rax back 1086 __ movptr(rscratch1, Address(rsp, saved_r10)); // get saved r10 back 1087 __ pop(c_rarg3); // restore c_rarg3 1088 __ pop(c_rarg2); // restore c_rarg2 1089 __ pop(r12); // restore r12 1090 __ popf(); // restore flags 1091 __ ret(4 * wordSize); // pop caller saved stuff 1092 1093 // handle errors 1094 __ bind(error); 1095 __ movptr(rax, Address(rsp, saved_rax)); // get saved rax back 1096 __ movptr(rscratch1, Address(rsp, saved_r10)); // get saved r10 back 1097 __ pop(c_rarg3); // get saved c_rarg3 back 1098 __ pop(c_rarg2); // get saved c_rarg2 back 1099 __ pop(r12); // get saved r12 back 1100 __ popf(); // get saved flags off stack -- 1101 // will be ignored 1102 1103 __ pusha(); // push registers 1104 // (rip is already 1105 // already pushed) 1106 // debug(char* msg, int64_t pc, int64_t regs[]) 1107 // We've popped the registers we'd saved (c_rarg3, c_rarg2 and flags), and 1108 // pushed all the registers, so now the stack looks like: 1109 // [tos + 0] 16 saved registers 1110 // [tos + 16] return address 1111 // * [tos + 17] error message (char*) 1112 // * [tos + 18] object to verify (oop) 1113 // * [tos + 19] saved rax - saved by caller and bashed 1114 // * [tos + 20] saved r10 (rscratch1) - saved by caller 1115 // * = popped on exit 1116 1117 __ movptr(c_rarg0, Address(rsp, error_msg)); // pass address of error message 1118 __ movptr(c_rarg1, Address(rsp, return_addr)); // pass return address 1119 __ movq(c_rarg2, rsp); // pass address of regs on stack 1120 __ mov(r12, rsp); // remember rsp 1121 __ subptr(rsp, frame::arg_reg_save_area_bytes); // windows 1122 __ andptr(rsp, -16); // align stack as required by ABI 1123 BLOCK_COMMENT("call MacroAssembler::debug"); 1124 __ call(RuntimeAddress(CAST_FROM_FN_PTR(address, MacroAssembler::debug64))); 1125 __ mov(rsp, r12); // restore rsp 1126 __ popa(); // pop registers (includes r12) 1127 __ ret(4 * wordSize); // pop caller saved stuff 1128 1129 return start; 1130 } 1131 1132 // 1133 // Verify that a register contains clean 32-bits positive value 1134 // (high 32-bits are 0) so it could be used in 64-bits shifts. 1135 // 1136 // Input: 1137 // Rint - 32-bits value 1138 // Rtmp - scratch 1139 // 1140 void assert_clean_int(Register Rint, Register Rtmp) { 1141 #ifdef ASSERT 1142 Label L; 1143 assert_different_registers(Rtmp, Rint); 1144 __ movslq(Rtmp, Rint); 1145 __ cmpq(Rtmp, Rint); 1146 __ jcc(Assembler::equal, L); 1147 __ stop("high 32-bits of int value are not 0"); 1148 __ bind(L); 1149 #endif 1150 } 1151 1152 // Generate overlap test for array copy stubs 1153 // 1154 // Input: 1155 // c_rarg0 - from 1156 // c_rarg1 - to 1157 // c_rarg2 - element count 1158 // 1159 // Output: 1160 // rax - &from[element count - 1] 1161 // 1162 void array_overlap_test(address no_overlap_target, Address::ScaleFactor sf) { 1163 assert(no_overlap_target != NULL, "must be generated"); 1164 array_overlap_test(no_overlap_target, NULL, sf); 1165 } 1166 void array_overlap_test(Label& L_no_overlap, Address::ScaleFactor sf) { 1167 array_overlap_test(NULL, &L_no_overlap, sf); 1168 } 1169 void array_overlap_test(address no_overlap_target, Label* NOLp, Address::ScaleFactor sf) { 1170 const Register from = c_rarg0; 1171 const Register to = c_rarg1; 1172 const Register count = c_rarg2; 1173 const Register end_from = rax; 1174 1175 __ cmpptr(to, from); 1176 __ lea(end_from, Address(from, count, sf, 0)); 1177 if (NOLp == NULL) { 1178 ExternalAddress no_overlap(no_overlap_target); 1179 __ jump_cc(Assembler::belowEqual, no_overlap); 1180 __ cmpptr(to, end_from); 1181 __ jump_cc(Assembler::aboveEqual, no_overlap); 1182 } else { 1183 __ jcc(Assembler::belowEqual, (*NOLp)); 1184 __ cmpptr(to, end_from); 1185 __ jcc(Assembler::aboveEqual, (*NOLp)); 1186 } 1187 } 1188 1189 // Shuffle first three arg regs on Windows into Linux/Solaris locations. 1190 // 1191 // Outputs: 1192 // rdi - rcx 1193 // rsi - rdx 1194 // rdx - r8 1195 // rcx - r9 1196 // 1197 // Registers r9 and r10 are used to save rdi and rsi on Windows, which latter 1198 // are non-volatile. r9 and r10 should not be used by the caller. 1199 // 1200 void setup_arg_regs(int nargs = 3) { 1201 const Register saved_rdi = r9; 1202 const Register saved_rsi = r10; 1203 assert(nargs == 3 || nargs == 4, "else fix"); 1204 #ifdef _WIN64 1205 assert(c_rarg0 == rcx && c_rarg1 == rdx && c_rarg2 == r8 && c_rarg3 == r9, 1206 "unexpected argument registers"); 1207 if (nargs >= 4) 1208 __ mov(rax, r9); // r9 is also saved_rdi 1209 __ movptr(saved_rdi, rdi); 1210 __ movptr(saved_rsi, rsi); 1211 __ mov(rdi, rcx); // c_rarg0 1212 __ mov(rsi, rdx); // c_rarg1 1213 __ mov(rdx, r8); // c_rarg2 1214 if (nargs >= 4) 1215 __ mov(rcx, rax); // c_rarg3 (via rax) 1216 #else 1217 assert(c_rarg0 == rdi && c_rarg1 == rsi && c_rarg2 == rdx && c_rarg3 == rcx, 1218 "unexpected argument registers"); 1219 #endif 1220 } 1221 1222 void restore_arg_regs() { 1223 const Register saved_rdi = r9; 1224 const Register saved_rsi = r10; 1225 #ifdef _WIN64 1226 __ movptr(rdi, saved_rdi); 1227 __ movptr(rsi, saved_rsi); 1228 #endif 1229 } 1230 1231 // Generate code for an array write pre barrier 1232 // 1233 // addr - starting address 1234 // count - element count 1235 // tmp - scratch register 1236 // 1237 // Destroy no registers! 1238 // 1239 void gen_write_ref_array_pre_barrier(Register addr, Register count, bool dest_uninitialized) { 1240 BarrierSet* bs = Universe::heap()->barrier_set(); 1241 switch (bs->kind()) { 1242 case BarrierSet::G1SATBCTLogging: 1243 // With G1, don't generate the call if we statically know that the target in uninitialized 1244 if (!dest_uninitialized) { 1245 __ pusha(); // push registers 1246 if (count == c_rarg0) { 1247 if (addr == c_rarg1) { 1248 // exactly backwards!! 1249 __ xchgptr(c_rarg1, c_rarg0); 1250 } else { 1251 __ movptr(c_rarg1, count); 1252 __ movptr(c_rarg0, addr); 1253 } 1254 } else { 1255 __ movptr(c_rarg0, addr); 1256 __ movptr(c_rarg1, count); 1257 } 1258 __ call_VM_leaf(CAST_FROM_FN_PTR(address, BarrierSet::static_write_ref_array_pre), 2); 1259 __ popa(); 1260 } 1261 break; 1262 case BarrierSet::CardTableForRS: 1263 case BarrierSet::CardTableExtension: 1264 case BarrierSet::ModRef: 1265 break; 1266 default: 1267 ShouldNotReachHere(); 1268 1269 } 1270 } 1271 1272 // 1273 // Generate code for an array write post barrier 1274 // 1275 // Input: 1276 // start - register containing starting address of destination array 1277 // count - elements count 1278 // scratch - scratch register 1279 // 1280 // The input registers are overwritten. 1281 // 1282 void gen_write_ref_array_post_barrier(Register start, Register count, Register scratch) { 1283 assert_different_registers(start, count, scratch); 1284 BarrierSet* bs = Universe::heap()->barrier_set(); 1285 switch (bs->kind()) { 1286 case BarrierSet::G1SATBCTLogging: 1287 { 1288 __ pusha(); // push registers (overkill) 1289 if (c_rarg0 == count) { // On win64 c_rarg0 == rcx 1290 assert_different_registers(c_rarg1, start); 1291 __ mov(c_rarg1, count); 1292 __ mov(c_rarg0, start); 1293 } else { 1294 assert_different_registers(c_rarg0, count); 1295 __ mov(c_rarg0, start); 1296 __ mov(c_rarg1, count); 1297 } 1298 __ call_VM_leaf(CAST_FROM_FN_PTR(address, BarrierSet::static_write_ref_array_post), 2); 1299 __ popa(); 1300 } 1301 break; 1302 case BarrierSet::CardTableForRS: 1303 case BarrierSet::CardTableExtension: 1304 { 1305 CardTableModRefBS* ct = barrier_set_cast<CardTableModRefBS>(bs); 1306 assert(sizeof(*ct->byte_map_base) == sizeof(jbyte), "adjust this code"); 1307 1308 Label L_loop; 1309 const Register end = count; 1310 1311 __ leaq(end, Address(start, count, TIMES_OOP, 0)); // end == start+count*oop_size 1312 __ subptr(end, BytesPerHeapOop); // end - 1 to make inclusive 1313 __ shrptr(start, CardTableModRefBS::card_shift); 1314 __ shrptr(end, CardTableModRefBS::card_shift); 1315 __ subptr(end, start); // end --> cards count 1316 1317 int64_t disp = (int64_t) ct->byte_map_base; 1318 __ mov64(scratch, disp); 1319 __ addptr(start, scratch); 1320 __ BIND(L_loop); 1321 __ movb(Address(start, count, Address::times_1), 0); 1322 __ decrement(count); 1323 __ jcc(Assembler::greaterEqual, L_loop); 1324 } 1325 break; 1326 default: 1327 ShouldNotReachHere(); 1328 1329 } 1330 } 1331 1332 1333 // Copy big chunks forward 1334 // 1335 // Inputs: 1336 // end_from - source arrays end address 1337 // end_to - destination array end address 1338 // qword_count - 64-bits element count, negative 1339 // to - scratch 1340 // L_copy_bytes - entry label 1341 // L_copy_8_bytes - exit label 1342 // 1343 void copy_bytes_forward(Register end_from, Register end_to, 1344 Register qword_count, Register to, 1345 Label& L_copy_bytes, Label& L_copy_8_bytes) { 1346 DEBUG_ONLY(__ stop("enter at entry label, not here")); 1347 Label L_loop; 1348 __ align(OptoLoopAlignment); 1349 if (UseUnalignedLoadStores) { 1350 Label L_end; 1351 if (UseAVX > 2) { 1352 __ movl(to, 0xffff); 1353 __ kmovql(k1, to); 1354 } 1355 // Copy 64-bytes per iteration 1356 __ BIND(L_loop); 1357 if (UseAVX > 2) { 1358 __ evmovdqul(xmm0, Address(end_from, qword_count, Address::times_8, -56), Assembler::AVX_512bit); 1359 __ evmovdqul(Address(end_to, qword_count, Address::times_8, -56), xmm0, Assembler::AVX_512bit); 1360 } else if (UseAVX == 2) { 1361 __ vmovdqu(xmm0, Address(end_from, qword_count, Address::times_8, -56)); 1362 __ vmovdqu(Address(end_to, qword_count, Address::times_8, -56), xmm0); 1363 __ vmovdqu(xmm1, Address(end_from, qword_count, Address::times_8, -24)); 1364 __ vmovdqu(Address(end_to, qword_count, Address::times_8, -24), xmm1); 1365 } else { 1366 __ movdqu(xmm0, Address(end_from, qword_count, Address::times_8, -56)); 1367 __ movdqu(Address(end_to, qword_count, Address::times_8, -56), xmm0); 1368 __ movdqu(xmm1, Address(end_from, qword_count, Address::times_8, -40)); 1369 __ movdqu(Address(end_to, qword_count, Address::times_8, -40), xmm1); 1370 __ movdqu(xmm2, Address(end_from, qword_count, Address::times_8, -24)); 1371 __ movdqu(Address(end_to, qword_count, Address::times_8, -24), xmm2); 1372 __ movdqu(xmm3, Address(end_from, qword_count, Address::times_8, - 8)); 1373 __ movdqu(Address(end_to, qword_count, Address::times_8, - 8), xmm3); 1374 } 1375 __ BIND(L_copy_bytes); 1376 __ addptr(qword_count, 8); 1377 __ jcc(Assembler::lessEqual, L_loop); 1378 __ subptr(qword_count, 4); // sub(8) and add(4) 1379 __ jccb(Assembler::greater, L_end); 1380 // Copy trailing 32 bytes 1381 if (UseAVX >= 2) { 1382 __ vmovdqu(xmm0, Address(end_from, qword_count, Address::times_8, -24)); 1383 __ vmovdqu(Address(end_to, qword_count, Address::times_8, -24), xmm0); 1384 } else { 1385 __ movdqu(xmm0, Address(end_from, qword_count, Address::times_8, -24)); 1386 __ movdqu(Address(end_to, qword_count, Address::times_8, -24), xmm0); 1387 __ movdqu(xmm1, Address(end_from, qword_count, Address::times_8, - 8)); 1388 __ movdqu(Address(end_to, qword_count, Address::times_8, - 8), xmm1); 1389 } 1390 __ addptr(qword_count, 4); 1391 __ BIND(L_end); 1392 if (UseAVX >= 2) { 1393 // clean upper bits of YMM registers 1394 __ vpxor(xmm0, xmm0); 1395 __ vpxor(xmm1, xmm1); 1396 } 1397 } else { 1398 // Copy 32-bytes per iteration 1399 __ BIND(L_loop); 1400 __ movq(to, Address(end_from, qword_count, Address::times_8, -24)); 1401 __ movq(Address(end_to, qword_count, Address::times_8, -24), to); 1402 __ movq(to, Address(end_from, qword_count, Address::times_8, -16)); 1403 __ movq(Address(end_to, qword_count, Address::times_8, -16), to); 1404 __ movq(to, Address(end_from, qword_count, Address::times_8, - 8)); 1405 __ movq(Address(end_to, qword_count, Address::times_8, - 8), to); 1406 __ movq(to, Address(end_from, qword_count, Address::times_8, - 0)); 1407 __ movq(Address(end_to, qword_count, Address::times_8, - 0), to); 1408 1409 __ BIND(L_copy_bytes); 1410 __ addptr(qword_count, 4); 1411 __ jcc(Assembler::lessEqual, L_loop); 1412 } 1413 __ subptr(qword_count, 4); 1414 __ jcc(Assembler::less, L_copy_8_bytes); // Copy trailing qwords 1415 } 1416 1417 // Copy big chunks backward 1418 // 1419 // Inputs: 1420 // from - source arrays address 1421 // dest - destination array address 1422 // qword_count - 64-bits element count 1423 // to - scratch 1424 // L_copy_bytes - entry label 1425 // L_copy_8_bytes - exit label 1426 // 1427 void copy_bytes_backward(Register from, Register dest, 1428 Register qword_count, Register to, 1429 Label& L_copy_bytes, Label& L_copy_8_bytes) { 1430 DEBUG_ONLY(__ stop("enter at entry label, not here")); 1431 Label L_loop; 1432 __ align(OptoLoopAlignment); 1433 if (UseUnalignedLoadStores) { 1434 Label L_end; 1435 if (UseAVX > 2) { 1436 __ movl(to, 0xffff); 1437 __ kmovql(k1, to); 1438 } 1439 // Copy 64-bytes per iteration 1440 __ BIND(L_loop); 1441 if (UseAVX > 2) { 1442 __ evmovdqul(xmm0, Address(from, qword_count, Address::times_8, 32), Assembler::AVX_512bit); 1443 __ evmovdqul(Address(dest, qword_count, Address::times_8, 32), xmm0, Assembler::AVX_512bit); 1444 } else if (UseAVX == 2) { 1445 __ vmovdqu(xmm0, Address(from, qword_count, Address::times_8, 32)); 1446 __ vmovdqu(Address(dest, qword_count, Address::times_8, 32), xmm0); 1447 __ vmovdqu(xmm1, Address(from, qword_count, Address::times_8, 0)); 1448 __ vmovdqu(Address(dest, qword_count, Address::times_8, 0), xmm1); 1449 } else { 1450 __ movdqu(xmm0, Address(from, qword_count, Address::times_8, 48)); 1451 __ movdqu(Address(dest, qword_count, Address::times_8, 48), xmm0); 1452 __ movdqu(xmm1, Address(from, qword_count, Address::times_8, 32)); 1453 __ movdqu(Address(dest, qword_count, Address::times_8, 32), xmm1); 1454 __ movdqu(xmm2, Address(from, qword_count, Address::times_8, 16)); 1455 __ movdqu(Address(dest, qword_count, Address::times_8, 16), xmm2); 1456 __ movdqu(xmm3, Address(from, qword_count, Address::times_8, 0)); 1457 __ movdqu(Address(dest, qword_count, Address::times_8, 0), xmm3); 1458 } 1459 __ BIND(L_copy_bytes); 1460 __ subptr(qword_count, 8); 1461 __ jcc(Assembler::greaterEqual, L_loop); 1462 1463 __ addptr(qword_count, 4); // add(8) and sub(4) 1464 __ jccb(Assembler::less, L_end); 1465 // Copy trailing 32 bytes 1466 if (UseAVX >= 2) { 1467 __ vmovdqu(xmm0, Address(from, qword_count, Address::times_8, 0)); 1468 __ vmovdqu(Address(dest, qword_count, Address::times_8, 0), xmm0); 1469 } else { 1470 __ movdqu(xmm0, Address(from, qword_count, Address::times_8, 16)); 1471 __ movdqu(Address(dest, qword_count, Address::times_8, 16), xmm0); 1472 __ movdqu(xmm1, Address(from, qword_count, Address::times_8, 0)); 1473 __ movdqu(Address(dest, qword_count, Address::times_8, 0), xmm1); 1474 } 1475 __ subptr(qword_count, 4); 1476 __ BIND(L_end); 1477 if (UseAVX >= 2) { 1478 // clean upper bits of YMM registers 1479 __ vpxor(xmm0, xmm0); 1480 __ vpxor(xmm1, xmm1); 1481 } 1482 } else { 1483 // Copy 32-bytes per iteration 1484 __ BIND(L_loop); 1485 __ movq(to, Address(from, qword_count, Address::times_8, 24)); 1486 __ movq(Address(dest, qword_count, Address::times_8, 24), to); 1487 __ movq(to, Address(from, qword_count, Address::times_8, 16)); 1488 __ movq(Address(dest, qword_count, Address::times_8, 16), to); 1489 __ movq(to, Address(from, qword_count, Address::times_8, 8)); 1490 __ movq(Address(dest, qword_count, Address::times_8, 8), to); 1491 __ movq(to, Address(from, qword_count, Address::times_8, 0)); 1492 __ movq(Address(dest, qword_count, Address::times_8, 0), to); 1493 1494 __ BIND(L_copy_bytes); 1495 __ subptr(qword_count, 4); 1496 __ jcc(Assembler::greaterEqual, L_loop); 1497 } 1498 __ addptr(qword_count, 4); 1499 __ jcc(Assembler::greater, L_copy_8_bytes); // Copy trailing qwords 1500 } 1501 1502 1503 // Arguments: 1504 // aligned - true => Input and output aligned on a HeapWord == 8-byte boundary 1505 // ignored 1506 // name - stub name string 1507 // 1508 // Inputs: 1509 // c_rarg0 - source array address 1510 // c_rarg1 - destination array address 1511 // c_rarg2 - element count, treated as ssize_t, can be zero 1512 // 1513 // If 'from' and/or 'to' are aligned on 4-, 2-, or 1-byte boundaries, 1514 // we let the hardware handle it. The one to eight bytes within words, 1515 // dwords or qwords that span cache line boundaries will still be loaded 1516 // and stored atomically. 1517 // 1518 // Side Effects: 1519 // disjoint_byte_copy_entry is set to the no-overlap entry point 1520 // used by generate_conjoint_byte_copy(). 1521 // 1522 address generate_disjoint_byte_copy(bool aligned, address* entry, const char *name) { 1523 __ align(CodeEntryAlignment); 1524 StubCodeMark mark(this, "StubRoutines", name); 1525 address start = __ pc(); 1526 1527 Label L_copy_bytes, L_copy_8_bytes, L_copy_4_bytes, L_copy_2_bytes; 1528 Label L_copy_byte, L_exit; 1529 const Register from = rdi; // source array address 1530 const Register to = rsi; // destination array address 1531 const Register count = rdx; // elements count 1532 const Register byte_count = rcx; 1533 const Register qword_count = count; 1534 const Register end_from = from; // source array end address 1535 const Register end_to = to; // destination array end address 1536 // End pointers are inclusive, and if count is not zero they point 1537 // to the last unit copied: end_to[0] := end_from[0] 1538 1539 __ enter(); // required for proper stackwalking of RuntimeStub frame 1540 assert_clean_int(c_rarg2, rax); // Make sure 'count' is clean int. 1541 1542 if (entry != NULL) { 1543 *entry = __ pc(); 1544 // caller can pass a 64-bit byte count here (from Unsafe.copyMemory) 1545 BLOCK_COMMENT("Entry:"); 1546 } 1547 1548 setup_arg_regs(); // from => rdi, to => rsi, count => rdx 1549 // r9 and r10 may be used to save non-volatile registers 1550 1551 // 'from', 'to' and 'count' are now valid 1552 __ movptr(byte_count, count); 1553 __ shrptr(count, 3); // count => qword_count 1554 1555 // Copy from low to high addresses. Use 'to' as scratch. 1556 __ lea(end_from, Address(from, qword_count, Address::times_8, -8)); 1557 __ lea(end_to, Address(to, qword_count, Address::times_8, -8)); 1558 __ negptr(qword_count); // make the count negative 1559 __ jmp(L_copy_bytes); 1560 1561 // Copy trailing qwords 1562 __ BIND(L_copy_8_bytes); 1563 __ movq(rax, Address(end_from, qword_count, Address::times_8, 8)); 1564 __ movq(Address(end_to, qword_count, Address::times_8, 8), rax); 1565 __ increment(qword_count); 1566 __ jcc(Assembler::notZero, L_copy_8_bytes); 1567 1568 // Check for and copy trailing dword 1569 __ BIND(L_copy_4_bytes); 1570 __ testl(byte_count, 4); 1571 __ jccb(Assembler::zero, L_copy_2_bytes); 1572 __ movl(rax, Address(end_from, 8)); 1573 __ movl(Address(end_to, 8), rax); 1574 1575 __ addptr(end_from, 4); 1576 __ addptr(end_to, 4); 1577 1578 // Check for and copy trailing word 1579 __ BIND(L_copy_2_bytes); 1580 __ testl(byte_count, 2); 1581 __ jccb(Assembler::zero, L_copy_byte); 1582 __ movw(rax, Address(end_from, 8)); 1583 __ movw(Address(end_to, 8), rax); 1584 1585 __ addptr(end_from, 2); 1586 __ addptr(end_to, 2); 1587 1588 // Check for and copy trailing byte 1589 __ BIND(L_copy_byte); 1590 __ testl(byte_count, 1); 1591 __ jccb(Assembler::zero, L_exit); 1592 __ movb(rax, Address(end_from, 8)); 1593 __ movb(Address(end_to, 8), rax); 1594 1595 __ BIND(L_exit); 1596 restore_arg_regs(); 1597 inc_counter_np(SharedRuntime::_jbyte_array_copy_ctr); // Update counter after rscratch1 is free 1598 __ xorptr(rax, rax); // return 0 1599 __ leave(); // required for proper stackwalking of RuntimeStub frame 1600 __ ret(0); 1601 1602 // Copy in multi-bytes chunks 1603 copy_bytes_forward(end_from, end_to, qword_count, rax, L_copy_bytes, L_copy_8_bytes); 1604 __ jmp(L_copy_4_bytes); 1605 1606 return start; 1607 } 1608 1609 // Arguments: 1610 // aligned - true => Input and output aligned on a HeapWord == 8-byte boundary 1611 // ignored 1612 // name - stub name string 1613 // 1614 // Inputs: 1615 // c_rarg0 - source array address 1616 // c_rarg1 - destination array address 1617 // c_rarg2 - element count, treated as ssize_t, can be zero 1618 // 1619 // If 'from' and/or 'to' are aligned on 4-, 2-, or 1-byte boundaries, 1620 // we let the hardware handle it. The one to eight bytes within words, 1621 // dwords or qwords that span cache line boundaries will still be loaded 1622 // and stored atomically. 1623 // 1624 address generate_conjoint_byte_copy(bool aligned, address nooverlap_target, 1625 address* entry, const char *name) { 1626 __ align(CodeEntryAlignment); 1627 StubCodeMark mark(this, "StubRoutines", name); 1628 address start = __ pc(); 1629 1630 Label L_copy_bytes, L_copy_8_bytes, L_copy_4_bytes, L_copy_2_bytes; 1631 const Register from = rdi; // source array address 1632 const Register to = rsi; // destination array address 1633 const Register count = rdx; // elements count 1634 const Register byte_count = rcx; 1635 const Register qword_count = count; 1636 1637 __ enter(); // required for proper stackwalking of RuntimeStub frame 1638 assert_clean_int(c_rarg2, rax); // Make sure 'count' is clean int. 1639 1640 if (entry != NULL) { 1641 *entry = __ pc(); 1642 // caller can pass a 64-bit byte count here (from Unsafe.copyMemory) 1643 BLOCK_COMMENT("Entry:"); 1644 } 1645 1646 array_overlap_test(nooverlap_target, Address::times_1); 1647 setup_arg_regs(); // from => rdi, to => rsi, count => rdx 1648 // r9 and r10 may be used to save non-volatile registers 1649 1650 // 'from', 'to' and 'count' are now valid 1651 __ movptr(byte_count, count); 1652 __ shrptr(count, 3); // count => qword_count 1653 1654 // Copy from high to low addresses. 1655 1656 // Check for and copy trailing byte 1657 __ testl(byte_count, 1); 1658 __ jcc(Assembler::zero, L_copy_2_bytes); 1659 __ movb(rax, Address(from, byte_count, Address::times_1, -1)); 1660 __ movb(Address(to, byte_count, Address::times_1, -1), rax); 1661 __ decrement(byte_count); // Adjust for possible trailing word 1662 1663 // Check for and copy trailing word 1664 __ BIND(L_copy_2_bytes); 1665 __ testl(byte_count, 2); 1666 __ jcc(Assembler::zero, L_copy_4_bytes); 1667 __ movw(rax, Address(from, byte_count, Address::times_1, -2)); 1668 __ movw(Address(to, byte_count, Address::times_1, -2), rax); 1669 1670 // Check for and copy trailing dword 1671 __ BIND(L_copy_4_bytes); 1672 __ testl(byte_count, 4); 1673 __ jcc(Assembler::zero, L_copy_bytes); 1674 __ movl(rax, Address(from, qword_count, Address::times_8)); 1675 __ movl(Address(to, qword_count, Address::times_8), rax); 1676 __ jmp(L_copy_bytes); 1677 1678 // Copy trailing qwords 1679 __ BIND(L_copy_8_bytes); 1680 __ movq(rax, Address(from, qword_count, Address::times_8, -8)); 1681 __ movq(Address(to, qword_count, Address::times_8, -8), rax); 1682 __ decrement(qword_count); 1683 __ jcc(Assembler::notZero, L_copy_8_bytes); 1684 1685 restore_arg_regs(); 1686 inc_counter_np(SharedRuntime::_jbyte_array_copy_ctr); // Update counter after rscratch1 is free 1687 __ xorptr(rax, rax); // return 0 1688 __ leave(); // required for proper stackwalking of RuntimeStub frame 1689 __ ret(0); 1690 1691 // Copy in multi-bytes chunks 1692 copy_bytes_backward(from, to, qword_count, rax, L_copy_bytes, L_copy_8_bytes); 1693 1694 restore_arg_regs(); 1695 inc_counter_np(SharedRuntime::_jbyte_array_copy_ctr); // Update counter after rscratch1 is free 1696 __ xorptr(rax, rax); // return 0 1697 __ leave(); // required for proper stackwalking of RuntimeStub frame 1698 __ ret(0); 1699 1700 return start; 1701 } 1702 1703 // Arguments: 1704 // aligned - true => Input and output aligned on a HeapWord == 8-byte boundary 1705 // ignored 1706 // name - stub name string 1707 // 1708 // Inputs: 1709 // c_rarg0 - source array address 1710 // c_rarg1 - destination array address 1711 // c_rarg2 - element count, treated as ssize_t, can be zero 1712 // 1713 // If 'from' and/or 'to' are aligned on 4- or 2-byte boundaries, we 1714 // let the hardware handle it. The two or four words within dwords 1715 // or qwords that span cache line boundaries will still be loaded 1716 // and stored atomically. 1717 // 1718 // Side Effects: 1719 // disjoint_short_copy_entry is set to the no-overlap entry point 1720 // used by generate_conjoint_short_copy(). 1721 // 1722 address generate_disjoint_short_copy(bool aligned, address *entry, const char *name) { 1723 __ align(CodeEntryAlignment); 1724 StubCodeMark mark(this, "StubRoutines", name); 1725 address start = __ pc(); 1726 1727 Label L_copy_bytes, L_copy_8_bytes, L_copy_4_bytes,L_copy_2_bytes,L_exit; 1728 const Register from = rdi; // source array address 1729 const Register to = rsi; // destination array address 1730 const Register count = rdx; // elements count 1731 const Register word_count = rcx; 1732 const Register qword_count = count; 1733 const Register end_from = from; // source array end address 1734 const Register end_to = to; // destination array end address 1735 // End pointers are inclusive, and if count is not zero they point 1736 // to the last unit copied: end_to[0] := end_from[0] 1737 1738 __ enter(); // required for proper stackwalking of RuntimeStub frame 1739 assert_clean_int(c_rarg2, rax); // Make sure 'count' is clean int. 1740 1741 if (entry != NULL) { 1742 *entry = __ pc(); 1743 // caller can pass a 64-bit byte count here (from Unsafe.copyMemory) 1744 BLOCK_COMMENT("Entry:"); 1745 } 1746 1747 setup_arg_regs(); // from => rdi, to => rsi, count => rdx 1748 // r9 and r10 may be used to save non-volatile registers 1749 1750 // 'from', 'to' and 'count' are now valid 1751 __ movptr(word_count, count); 1752 __ shrptr(count, 2); // count => qword_count 1753 1754 // Copy from low to high addresses. Use 'to' as scratch. 1755 __ lea(end_from, Address(from, qword_count, Address::times_8, -8)); 1756 __ lea(end_to, Address(to, qword_count, Address::times_8, -8)); 1757 __ negptr(qword_count); 1758 __ jmp(L_copy_bytes); 1759 1760 // Copy trailing qwords 1761 __ BIND(L_copy_8_bytes); 1762 __ movq(rax, Address(end_from, qword_count, Address::times_8, 8)); 1763 __ movq(Address(end_to, qword_count, Address::times_8, 8), rax); 1764 __ increment(qword_count); 1765 __ jcc(Assembler::notZero, L_copy_8_bytes); 1766 1767 // Original 'dest' is trashed, so we can't use it as a 1768 // base register for a possible trailing word copy 1769 1770 // Check for and copy trailing dword 1771 __ BIND(L_copy_4_bytes); 1772 __ testl(word_count, 2); 1773 __ jccb(Assembler::zero, L_copy_2_bytes); 1774 __ movl(rax, Address(end_from, 8)); 1775 __ movl(Address(end_to, 8), rax); 1776 1777 __ addptr(end_from, 4); 1778 __ addptr(end_to, 4); 1779 1780 // Check for and copy trailing word 1781 __ BIND(L_copy_2_bytes); 1782 __ testl(word_count, 1); 1783 __ jccb(Assembler::zero, L_exit); 1784 __ movw(rax, Address(end_from, 8)); 1785 __ movw(Address(end_to, 8), rax); 1786 1787 __ BIND(L_exit); 1788 restore_arg_regs(); 1789 inc_counter_np(SharedRuntime::_jshort_array_copy_ctr); // Update counter after rscratch1 is free 1790 __ xorptr(rax, rax); // return 0 1791 __ leave(); // required for proper stackwalking of RuntimeStub frame 1792 __ ret(0); 1793 1794 // Copy in multi-bytes chunks 1795 copy_bytes_forward(end_from, end_to, qword_count, rax, L_copy_bytes, L_copy_8_bytes); 1796 __ jmp(L_copy_4_bytes); 1797 1798 return start; 1799 } 1800 1801 address generate_fill(BasicType t, bool aligned, const char *name) { 1802 __ align(CodeEntryAlignment); 1803 StubCodeMark mark(this, "StubRoutines", name); 1804 address start = __ pc(); 1805 1806 BLOCK_COMMENT("Entry:"); 1807 1808 const Register to = c_rarg0; // source array address 1809 const Register value = c_rarg1; // value 1810 const Register count = c_rarg2; // elements count 1811 1812 __ enter(); // required for proper stackwalking of RuntimeStub frame 1813 1814 __ generate_fill(t, aligned, to, value, count, rax, xmm0); 1815 1816 __ leave(); // required for proper stackwalking of RuntimeStub frame 1817 __ ret(0); 1818 return start; 1819 } 1820 1821 // Arguments: 1822 // aligned - true => Input and output aligned on a HeapWord == 8-byte boundary 1823 // ignored 1824 // name - stub name string 1825 // 1826 // Inputs: 1827 // c_rarg0 - source array address 1828 // c_rarg1 - destination array address 1829 // c_rarg2 - element count, treated as ssize_t, can be zero 1830 // 1831 // If 'from' and/or 'to' are aligned on 4- or 2-byte boundaries, we 1832 // let the hardware handle it. The two or four words within dwords 1833 // or qwords that span cache line boundaries will still be loaded 1834 // and stored atomically. 1835 // 1836 address generate_conjoint_short_copy(bool aligned, address nooverlap_target, 1837 address *entry, const char *name) { 1838 __ align(CodeEntryAlignment); 1839 StubCodeMark mark(this, "StubRoutines", name); 1840 address start = __ pc(); 1841 1842 Label L_copy_bytes, L_copy_8_bytes, L_copy_4_bytes; 1843 const Register from = rdi; // source array address 1844 const Register to = rsi; // destination array address 1845 const Register count = rdx; // elements count 1846 const Register word_count = rcx; 1847 const Register qword_count = count; 1848 1849 __ enter(); // required for proper stackwalking of RuntimeStub frame 1850 assert_clean_int(c_rarg2, rax); // Make sure 'count' is clean int. 1851 1852 if (entry != NULL) { 1853 *entry = __ pc(); 1854 // caller can pass a 64-bit byte count here (from Unsafe.copyMemory) 1855 BLOCK_COMMENT("Entry:"); 1856 } 1857 1858 array_overlap_test(nooverlap_target, Address::times_2); 1859 setup_arg_regs(); // from => rdi, to => rsi, count => rdx 1860 // r9 and r10 may be used to save non-volatile registers 1861 1862 // 'from', 'to' and 'count' are now valid 1863 __ movptr(word_count, count); 1864 __ shrptr(count, 2); // count => qword_count 1865 1866 // Copy from high to low addresses. Use 'to' as scratch. 1867 1868 // Check for and copy trailing word 1869 __ testl(word_count, 1); 1870 __ jccb(Assembler::zero, L_copy_4_bytes); 1871 __ movw(rax, Address(from, word_count, Address::times_2, -2)); 1872 __ movw(Address(to, word_count, Address::times_2, -2), rax); 1873 1874 // Check for and copy trailing dword 1875 __ BIND(L_copy_4_bytes); 1876 __ testl(word_count, 2); 1877 __ jcc(Assembler::zero, L_copy_bytes); 1878 __ movl(rax, Address(from, qword_count, Address::times_8)); 1879 __ movl(Address(to, qword_count, Address::times_8), rax); 1880 __ jmp(L_copy_bytes); 1881 1882 // Copy trailing qwords 1883 __ BIND(L_copy_8_bytes); 1884 __ movq(rax, Address(from, qword_count, Address::times_8, -8)); 1885 __ movq(Address(to, qword_count, Address::times_8, -8), rax); 1886 __ decrement(qword_count); 1887 __ jcc(Assembler::notZero, L_copy_8_bytes); 1888 1889 restore_arg_regs(); 1890 inc_counter_np(SharedRuntime::_jshort_array_copy_ctr); // Update counter after rscratch1 is free 1891 __ xorptr(rax, rax); // return 0 1892 __ leave(); // required for proper stackwalking of RuntimeStub frame 1893 __ ret(0); 1894 1895 // Copy in multi-bytes chunks 1896 copy_bytes_backward(from, to, qword_count, rax, L_copy_bytes, L_copy_8_bytes); 1897 1898 restore_arg_regs(); 1899 inc_counter_np(SharedRuntime::_jshort_array_copy_ctr); // Update counter after rscratch1 is free 1900 __ xorptr(rax, rax); // return 0 1901 __ leave(); // required for proper stackwalking of RuntimeStub frame 1902 __ ret(0); 1903 1904 return start; 1905 } 1906 1907 // Arguments: 1908 // aligned - true => Input and output aligned on a HeapWord == 8-byte boundary 1909 // ignored 1910 // is_oop - true => oop array, so generate store check code 1911 // name - stub name string 1912 // 1913 // Inputs: 1914 // c_rarg0 - source array address 1915 // c_rarg1 - destination array address 1916 // c_rarg2 - element count, treated as ssize_t, can be zero 1917 // 1918 // If 'from' and/or 'to' are aligned on 4-byte boundaries, we let 1919 // the hardware handle it. The two dwords within qwords that span 1920 // cache line boundaries will still be loaded and stored atomicly. 1921 // 1922 // Side Effects: 1923 // disjoint_int_copy_entry is set to the no-overlap entry point 1924 // used by generate_conjoint_int_oop_copy(). 1925 // 1926 address generate_disjoint_int_oop_copy(bool aligned, bool is_oop, address* entry, 1927 const char *name, bool dest_uninitialized = false) { 1928 __ align(CodeEntryAlignment); 1929 StubCodeMark mark(this, "StubRoutines", name); 1930 address start = __ pc(); 1931 1932 Label L_copy_bytes, L_copy_8_bytes, L_copy_4_bytes, L_exit; 1933 const Register from = rdi; // source array address 1934 const Register to = rsi; // destination array address 1935 const Register count = rdx; // elements count 1936 const Register dword_count = rcx; 1937 const Register qword_count = count; 1938 const Register end_from = from; // source array end address 1939 const Register end_to = to; // destination array end address 1940 const Register saved_to = r11; // saved destination array address 1941 // End pointers are inclusive, and if count is not zero they point 1942 // to the last unit copied: end_to[0] := end_from[0] 1943 1944 __ enter(); // required for proper stackwalking of RuntimeStub frame 1945 assert_clean_int(c_rarg2, rax); // Make sure 'count' is clean int. 1946 1947 if (entry != NULL) { 1948 *entry = __ pc(); 1949 // caller can pass a 64-bit byte count here (from Unsafe.copyMemory) 1950 BLOCK_COMMENT("Entry:"); 1951 } 1952 1953 setup_arg_regs(); // from => rdi, to => rsi, count => rdx 1954 // r9 and r10 may be used to save non-volatile registers 1955 if (is_oop) { 1956 __ movq(saved_to, to); 1957 gen_write_ref_array_pre_barrier(to, count, dest_uninitialized); 1958 } 1959 1960 // 'from', 'to' and 'count' are now valid 1961 __ movptr(dword_count, count); 1962 __ shrptr(count, 1); // count => qword_count 1963 1964 // Copy from low to high addresses. Use 'to' as scratch. 1965 __ lea(end_from, Address(from, qword_count, Address::times_8, -8)); 1966 __ lea(end_to, Address(to, qword_count, Address::times_8, -8)); 1967 __ negptr(qword_count); 1968 __ jmp(L_copy_bytes); 1969 1970 // Copy trailing qwords 1971 __ BIND(L_copy_8_bytes); 1972 __ movq(rax, Address(end_from, qword_count, Address::times_8, 8)); 1973 __ movq(Address(end_to, qword_count, Address::times_8, 8), rax); 1974 __ increment(qword_count); 1975 __ jcc(Assembler::notZero, L_copy_8_bytes); 1976 1977 // Check for and copy trailing dword 1978 __ BIND(L_copy_4_bytes); 1979 __ testl(dword_count, 1); // Only byte test since the value is 0 or 1 1980 __ jccb(Assembler::zero, L_exit); 1981 __ movl(rax, Address(end_from, 8)); 1982 __ movl(Address(end_to, 8), rax); 1983 1984 __ BIND(L_exit); 1985 if (is_oop) { 1986 gen_write_ref_array_post_barrier(saved_to, dword_count, rax); 1987 } 1988 restore_arg_regs(); 1989 inc_counter_np(SharedRuntime::_jint_array_copy_ctr); // Update counter after rscratch1 is free 1990 __ xorptr(rax, rax); // return 0 1991 __ leave(); // required for proper stackwalking of RuntimeStub frame 1992 __ ret(0); 1993 1994 // Copy in multi-bytes chunks 1995 copy_bytes_forward(end_from, end_to, qword_count, rax, L_copy_bytes, L_copy_8_bytes); 1996 __ jmp(L_copy_4_bytes); 1997 1998 return start; 1999 } 2000 2001 // Arguments: 2002 // aligned - true => Input and output aligned on a HeapWord == 8-byte boundary 2003 // ignored 2004 // is_oop - true => oop array, so generate store check code 2005 // name - stub name string 2006 // 2007 // Inputs: 2008 // c_rarg0 - source array address 2009 // c_rarg1 - destination array address 2010 // c_rarg2 - element count, treated as ssize_t, can be zero 2011 // 2012 // If 'from' and/or 'to' are aligned on 4-byte boundaries, we let 2013 // the hardware handle it. The two dwords within qwords that span 2014 // cache line boundaries will still be loaded and stored atomicly. 2015 // 2016 address generate_conjoint_int_oop_copy(bool aligned, bool is_oop, address nooverlap_target, 2017 address *entry, const char *name, 2018 bool dest_uninitialized = false) { 2019 __ align(CodeEntryAlignment); 2020 StubCodeMark mark(this, "StubRoutines", name); 2021 address start = __ pc(); 2022 2023 Label L_copy_bytes, L_copy_8_bytes, L_copy_2_bytes, L_exit; 2024 const Register from = rdi; // source array address 2025 const Register to = rsi; // destination array address 2026 const Register count = rdx; // elements count 2027 const Register dword_count = rcx; 2028 const Register qword_count = count; 2029 2030 __ enter(); // required for proper stackwalking of RuntimeStub frame 2031 assert_clean_int(c_rarg2, rax); // Make sure 'count' is clean int. 2032 2033 if (entry != NULL) { 2034 *entry = __ pc(); 2035 // caller can pass a 64-bit byte count here (from Unsafe.copyMemory) 2036 BLOCK_COMMENT("Entry:"); 2037 } 2038 2039 array_overlap_test(nooverlap_target, Address::times_4); 2040 setup_arg_regs(); // from => rdi, to => rsi, count => rdx 2041 // r9 and r10 may be used to save non-volatile registers 2042 2043 if (is_oop) { 2044 // no registers are destroyed by this call 2045 gen_write_ref_array_pre_barrier(to, count, dest_uninitialized); 2046 } 2047 2048 assert_clean_int(count, rax); // Make sure 'count' is clean int. 2049 // 'from', 'to' and 'count' are now valid 2050 __ movptr(dword_count, count); 2051 __ shrptr(count, 1); // count => qword_count 2052 2053 // Copy from high to low addresses. Use 'to' as scratch. 2054 2055 // Check for and copy trailing dword 2056 __ testl(dword_count, 1); 2057 __ jcc(Assembler::zero, L_copy_bytes); 2058 __ movl(rax, Address(from, dword_count, Address::times_4, -4)); 2059 __ movl(Address(to, dword_count, Address::times_4, -4), rax); 2060 __ jmp(L_copy_bytes); 2061 2062 // Copy trailing qwords 2063 __ BIND(L_copy_8_bytes); 2064 __ movq(rax, Address(from, qword_count, Address::times_8, -8)); 2065 __ movq(Address(to, qword_count, Address::times_8, -8), rax); 2066 __ decrement(qword_count); 2067 __ jcc(Assembler::notZero, L_copy_8_bytes); 2068 2069 if (is_oop) { 2070 __ jmp(L_exit); 2071 } 2072 restore_arg_regs(); 2073 inc_counter_np(SharedRuntime::_jint_array_copy_ctr); // Update counter after rscratch1 is free 2074 __ xorptr(rax, rax); // return 0 2075 __ leave(); // required for proper stackwalking of RuntimeStub frame 2076 __ ret(0); 2077 2078 // Copy in multi-bytes chunks 2079 copy_bytes_backward(from, to, qword_count, rax, L_copy_bytes, L_copy_8_bytes); 2080 2081 __ BIND(L_exit); 2082 if (is_oop) { 2083 gen_write_ref_array_post_barrier(to, dword_count, rax); 2084 } 2085 restore_arg_regs(); 2086 inc_counter_np(SharedRuntime::_jint_array_copy_ctr); // Update counter after rscratch1 is free 2087 __ xorptr(rax, rax); // return 0 2088 __ leave(); // required for proper stackwalking of RuntimeStub frame 2089 __ ret(0); 2090 2091 return start; 2092 } 2093 2094 // Arguments: 2095 // aligned - true => Input and output aligned on a HeapWord boundary == 8 bytes 2096 // ignored 2097 // is_oop - true => oop array, so generate store check code 2098 // name - stub name string 2099 // 2100 // Inputs: 2101 // c_rarg0 - source array address 2102 // c_rarg1 - destination array address 2103 // c_rarg2 - element count, treated as ssize_t, can be zero 2104 // 2105 // Side Effects: 2106 // disjoint_oop_copy_entry or disjoint_long_copy_entry is set to the 2107 // no-overlap entry point used by generate_conjoint_long_oop_copy(). 2108 // 2109 address generate_disjoint_long_oop_copy(bool aligned, bool is_oop, address *entry, 2110 const char *name, bool dest_uninitialized = false) { 2111 __ align(CodeEntryAlignment); 2112 StubCodeMark mark(this, "StubRoutines", name); 2113 address start = __ pc(); 2114 2115 Label L_copy_bytes, L_copy_8_bytes, L_exit; 2116 const Register from = rdi; // source array address 2117 const Register to = rsi; // destination array address 2118 const Register qword_count = rdx; // elements count 2119 const Register end_from = from; // source array end address 2120 const Register end_to = rcx; // destination array end address 2121 const Register saved_to = to; 2122 const Register saved_count = r11; 2123 // End pointers are inclusive, and if count is not zero they point 2124 // to the last unit copied: end_to[0] := end_from[0] 2125 2126 __ enter(); // required for proper stackwalking of RuntimeStub frame 2127 // Save no-overlap entry point for generate_conjoint_long_oop_copy() 2128 assert_clean_int(c_rarg2, rax); // Make sure 'count' is clean int. 2129 2130 if (entry != NULL) { 2131 *entry = __ pc(); 2132 // caller can pass a 64-bit byte count here (from Unsafe.copyMemory) 2133 BLOCK_COMMENT("Entry:"); 2134 } 2135 2136 setup_arg_regs(); // from => rdi, to => rsi, count => rdx 2137 // r9 and r10 may be used to save non-volatile registers 2138 // 'from', 'to' and 'qword_count' are now valid 2139 if (is_oop) { 2140 // Save to and count for store barrier 2141 __ movptr(saved_count, qword_count); 2142 // no registers are destroyed by this call 2143 gen_write_ref_array_pre_barrier(to, qword_count, dest_uninitialized); 2144 } 2145 2146 // Copy from low to high addresses. Use 'to' as scratch. 2147 __ lea(end_from, Address(from, qword_count, Address::times_8, -8)); 2148 __ lea(end_to, Address(to, qword_count, Address::times_8, -8)); 2149 __ negptr(qword_count); 2150 __ jmp(L_copy_bytes); 2151 2152 // Copy trailing qwords 2153 __ BIND(L_copy_8_bytes); 2154 __ movq(rax, Address(end_from, qword_count, Address::times_8, 8)); 2155 __ movq(Address(end_to, qword_count, Address::times_8, 8), rax); 2156 __ increment(qword_count); 2157 __ jcc(Assembler::notZero, L_copy_8_bytes); 2158 2159 if (is_oop) { 2160 __ jmp(L_exit); 2161 } else { 2162 restore_arg_regs(); 2163 inc_counter_np(SharedRuntime::_jlong_array_copy_ctr); // Update counter after rscratch1 is free 2164 __ xorptr(rax, rax); // return 0 2165 __ leave(); // required for proper stackwalking of RuntimeStub frame 2166 __ ret(0); 2167 } 2168 2169 // Copy in multi-bytes chunks 2170 copy_bytes_forward(end_from, end_to, qword_count, rax, L_copy_bytes, L_copy_8_bytes); 2171 2172 if (is_oop) { 2173 __ BIND(L_exit); 2174 gen_write_ref_array_post_barrier(saved_to, saved_count, rax); 2175 } 2176 restore_arg_regs(); 2177 if (is_oop) { 2178 inc_counter_np(SharedRuntime::_oop_array_copy_ctr); // Update counter after rscratch1 is free 2179 } else { 2180 inc_counter_np(SharedRuntime::_jlong_array_copy_ctr); // Update counter after rscratch1 is free 2181 } 2182 __ xorptr(rax, rax); // return 0 2183 __ leave(); // required for proper stackwalking of RuntimeStub frame 2184 __ ret(0); 2185 2186 return start; 2187 } 2188 2189 // Arguments: 2190 // aligned - true => Input and output aligned on a HeapWord boundary == 8 bytes 2191 // ignored 2192 // is_oop - true => oop array, so generate store check code 2193 // name - stub name string 2194 // 2195 // Inputs: 2196 // c_rarg0 - source array address 2197 // c_rarg1 - destination array address 2198 // c_rarg2 - element count, treated as ssize_t, can be zero 2199 // 2200 address generate_conjoint_long_oop_copy(bool aligned, bool is_oop, 2201 address nooverlap_target, address *entry, 2202 const char *name, bool dest_uninitialized = false) { 2203 __ align(CodeEntryAlignment); 2204 StubCodeMark mark(this, "StubRoutines", name); 2205 address start = __ pc(); 2206 2207 Label L_copy_bytes, L_copy_8_bytes, L_exit; 2208 const Register from = rdi; // source array address 2209 const Register to = rsi; // destination array address 2210 const Register qword_count = rdx; // elements count 2211 const Register saved_count = rcx; 2212 2213 __ enter(); // required for proper stackwalking of RuntimeStub frame 2214 assert_clean_int(c_rarg2, rax); // Make sure 'count' is clean int. 2215 2216 if (entry != NULL) { 2217 *entry = __ pc(); 2218 // caller can pass a 64-bit byte count here (from Unsafe.copyMemory) 2219 BLOCK_COMMENT("Entry:"); 2220 } 2221 2222 array_overlap_test(nooverlap_target, Address::times_8); 2223 setup_arg_regs(); // from => rdi, to => rsi, count => rdx 2224 // r9 and r10 may be used to save non-volatile registers 2225 // 'from', 'to' and 'qword_count' are now valid 2226 if (is_oop) { 2227 // Save to and count for store barrier 2228 __ movptr(saved_count, qword_count); 2229 // No registers are destroyed by this call 2230 gen_write_ref_array_pre_barrier(to, saved_count, dest_uninitialized); 2231 } 2232 2233 __ jmp(L_copy_bytes); 2234 2235 // Copy trailing qwords 2236 __ BIND(L_copy_8_bytes); 2237 __ movq(rax, Address(from, qword_count, Address::times_8, -8)); 2238 __ movq(Address(to, qword_count, Address::times_8, -8), rax); 2239 __ decrement(qword_count); 2240 __ jcc(Assembler::notZero, L_copy_8_bytes); 2241 2242 if (is_oop) { 2243 __ jmp(L_exit); 2244 } else { 2245 restore_arg_regs(); 2246 inc_counter_np(SharedRuntime::_jlong_array_copy_ctr); // Update counter after rscratch1 is free 2247 __ xorptr(rax, rax); // return 0 2248 __ leave(); // required for proper stackwalking of RuntimeStub frame 2249 __ ret(0); 2250 } 2251 2252 // Copy in multi-bytes chunks 2253 copy_bytes_backward(from, to, qword_count, rax, L_copy_bytes, L_copy_8_bytes); 2254 2255 if (is_oop) { 2256 __ BIND(L_exit); 2257 gen_write_ref_array_post_barrier(to, saved_count, rax); 2258 } 2259 restore_arg_regs(); 2260 if (is_oop) { 2261 inc_counter_np(SharedRuntime::_oop_array_copy_ctr); // Update counter after rscratch1 is free 2262 } else { 2263 inc_counter_np(SharedRuntime::_jlong_array_copy_ctr); // Update counter after rscratch1 is free 2264 } 2265 __ xorptr(rax, rax); // return 0 2266 __ leave(); // required for proper stackwalking of RuntimeStub frame 2267 __ ret(0); 2268 2269 return start; 2270 } 2271 2272 2273 // Helper for generating a dynamic type check. 2274 // Smashes no registers. 2275 void generate_type_check(Register sub_klass, 2276 Register super_check_offset, 2277 Register super_klass, 2278 Label& L_success) { 2279 assert_different_registers(sub_klass, super_check_offset, super_klass); 2280 2281 BLOCK_COMMENT("type_check:"); 2282 2283 Label L_miss; 2284 2285 __ check_klass_subtype_fast_path(sub_klass, super_klass, noreg, &L_success, &L_miss, NULL, 2286 super_check_offset); 2287 __ check_klass_subtype_slow_path(sub_klass, super_klass, noreg, noreg, &L_success, NULL); 2288 2289 // Fall through on failure! 2290 __ BIND(L_miss); 2291 } 2292 2293 // 2294 // Generate checkcasting array copy stub 2295 // 2296 // Input: 2297 // c_rarg0 - source array address 2298 // c_rarg1 - destination array address 2299 // c_rarg2 - element count, treated as ssize_t, can be zero 2300 // c_rarg3 - size_t ckoff (super_check_offset) 2301 // not Win64 2302 // c_rarg4 - oop ckval (super_klass) 2303 // Win64 2304 // rsp+40 - oop ckval (super_klass) 2305 // 2306 // Output: 2307 // rax == 0 - success 2308 // rax == -1^K - failure, where K is partial transfer count 2309 // 2310 address generate_checkcast_copy(const char *name, address *entry, 2311 bool dest_uninitialized = false) { 2312 2313 Label L_load_element, L_store_element, L_do_card_marks, L_done; 2314 2315 // Input registers (after setup_arg_regs) 2316 const Register from = rdi; // source array address 2317 const Register to = rsi; // destination array address 2318 const Register length = rdx; // elements count 2319 const Register ckoff = rcx; // super_check_offset 2320 const Register ckval = r8; // super_klass 2321 2322 // Registers used as temps (r13, r14 are save-on-entry) 2323 const Register end_from = from; // source array end address 2324 const Register end_to = r13; // destination array end address 2325 const Register count = rdx; // -(count_remaining) 2326 const Register r14_length = r14; // saved copy of length 2327 // End pointers are inclusive, and if length is not zero they point 2328 // to the last unit copied: end_to[0] := end_from[0] 2329 2330 const Register rax_oop = rax; // actual oop copied 2331 const Register r11_klass = r11; // oop._klass 2332 2333 //--------------------------------------------------------------- 2334 // Assembler stub will be used for this call to arraycopy 2335 // if the two arrays are subtypes of Object[] but the 2336 // destination array type is not equal to or a supertype 2337 // of the source type. Each element must be separately 2338 // checked. 2339 2340 __ align(CodeEntryAlignment); 2341 StubCodeMark mark(this, "StubRoutines", name); 2342 address start = __ pc(); 2343 2344 __ enter(); // required for proper stackwalking of RuntimeStub frame 2345 2346 #ifdef ASSERT 2347 // caller guarantees that the arrays really are different 2348 // otherwise, we would have to make conjoint checks 2349 { Label L; 2350 array_overlap_test(L, TIMES_OOP); 2351 __ stop("checkcast_copy within a single array"); 2352 __ bind(L); 2353 } 2354 #endif //ASSERT 2355 2356 setup_arg_regs(4); // from => rdi, to => rsi, length => rdx 2357 // ckoff => rcx, ckval => r8 2358 // r9 and r10 may be used to save non-volatile registers 2359 #ifdef _WIN64 2360 // last argument (#4) is on stack on Win64 2361 __ movptr(ckval, Address(rsp, 6 * wordSize)); 2362 #endif 2363 2364 // Caller of this entry point must set up the argument registers. 2365 if (entry != NULL) { 2366 *entry = __ pc(); 2367 BLOCK_COMMENT("Entry:"); 2368 } 2369 2370 // allocate spill slots for r13, r14 2371 enum { 2372 saved_r13_offset, 2373 saved_r14_offset, 2374 saved_rbp_offset 2375 }; 2376 __ subptr(rsp, saved_rbp_offset * wordSize); 2377 __ movptr(Address(rsp, saved_r13_offset * wordSize), r13); 2378 __ movptr(Address(rsp, saved_r14_offset * wordSize), r14); 2379 2380 // check that int operands are properly extended to size_t 2381 assert_clean_int(length, rax); 2382 assert_clean_int(ckoff, rax); 2383 2384 #ifdef ASSERT 2385 BLOCK_COMMENT("assert consistent ckoff/ckval"); 2386 // The ckoff and ckval must be mutually consistent, 2387 // even though caller generates both. 2388 { Label L; 2389 int sco_offset = in_bytes(Klass::super_check_offset_offset()); 2390 __ cmpl(ckoff, Address(ckval, sco_offset)); 2391 __ jcc(Assembler::equal, L); 2392 __ stop("super_check_offset inconsistent"); 2393 __ bind(L); 2394 } 2395 #endif //ASSERT 2396 2397 // Loop-invariant addresses. They are exclusive end pointers. 2398 Address end_from_addr(from, length, TIMES_OOP, 0); 2399 Address end_to_addr(to, length, TIMES_OOP, 0); 2400 // Loop-variant addresses. They assume post-incremented count < 0. 2401 Address from_element_addr(end_from, count, TIMES_OOP, 0); 2402 Address to_element_addr(end_to, count, TIMES_OOP, 0); 2403 2404 gen_write_ref_array_pre_barrier(to, count, dest_uninitialized); 2405 2406 // Copy from low to high addresses, indexed from the end of each array. 2407 __ lea(end_from, end_from_addr); 2408 __ lea(end_to, end_to_addr); 2409 __ movptr(r14_length, length); // save a copy of the length 2410 assert(length == count, ""); // else fix next line: 2411 __ negptr(count); // negate and test the length 2412 __ jcc(Assembler::notZero, L_load_element); 2413 2414 // Empty array: Nothing to do. 2415 __ xorptr(rax, rax); // return 0 on (trivial) success 2416 __ jmp(L_done); 2417 2418 // ======== begin loop ======== 2419 // (Loop is rotated; its entry is L_load_element.) 2420 // Loop control: 2421 // for (count = -count; count != 0; count++) 2422 // Base pointers src, dst are biased by 8*(count-1),to last element. 2423 __ align(OptoLoopAlignment); 2424 2425 __ BIND(L_store_element); 2426 __ store_heap_oop(to_element_addr, rax_oop); // store the oop 2427 __ increment(count); // increment the count toward zero 2428 __ jcc(Assembler::zero, L_do_card_marks); 2429 2430 // ======== loop entry is here ======== 2431 __ BIND(L_load_element); 2432 __ load_heap_oop(rax_oop, from_element_addr); // load the oop 2433 __ testptr(rax_oop, rax_oop); 2434 __ jcc(Assembler::zero, L_store_element); 2435 2436 __ load_klass(r11_klass, rax_oop);// query the object klass 2437 generate_type_check(r11_klass, ckoff, ckval, L_store_element); 2438 // ======== end loop ======== 2439 2440 // It was a real error; we must depend on the caller to finish the job. 2441 // Register rdx = -1 * number of *remaining* oops, r14 = *total* oops. 2442 // Emit GC store barriers for the oops we have copied (r14 + rdx), 2443 // and report their number to the caller. 2444 assert_different_registers(rax, r14_length, count, to, end_to, rcx, rscratch1); 2445 Label L_post_barrier; 2446 __ addptr(r14_length, count); // K = (original - remaining) oops 2447 __ movptr(rax, r14_length); // save the value 2448 __ notptr(rax); // report (-1^K) to caller (does not affect flags) 2449 __ jccb(Assembler::notZero, L_post_barrier); 2450 __ jmp(L_done); // K == 0, nothing was copied, skip post barrier 2451 2452 // Come here on success only. 2453 __ BIND(L_do_card_marks); 2454 __ xorptr(rax, rax); // return 0 on success 2455 2456 __ BIND(L_post_barrier); 2457 gen_write_ref_array_post_barrier(to, r14_length, rscratch1); 2458 2459 // Common exit point (success or failure). 2460 __ BIND(L_done); 2461 __ movptr(r13, Address(rsp, saved_r13_offset * wordSize)); 2462 __ movptr(r14, Address(rsp, saved_r14_offset * wordSize)); 2463 restore_arg_regs(); 2464 inc_counter_np(SharedRuntime::_checkcast_array_copy_ctr); // Update counter after rscratch1 is free 2465 __ leave(); // required for proper stackwalking of RuntimeStub frame 2466 __ ret(0); 2467 2468 return start; 2469 } 2470 2471 // 2472 // Generate 'unsafe' array copy stub 2473 // Though just as safe as the other stubs, it takes an unscaled 2474 // size_t argument instead of an element count. 2475 // 2476 // Input: 2477 // c_rarg0 - source array address 2478 // c_rarg1 - destination array address 2479 // c_rarg2 - byte count, treated as ssize_t, can be zero 2480 // 2481 // Examines the alignment of the operands and dispatches 2482 // to a long, int, short, or byte copy loop. 2483 // 2484 address generate_unsafe_copy(const char *name, 2485 address byte_copy_entry, address short_copy_entry, 2486 address int_copy_entry, address long_copy_entry) { 2487 2488 Label L_long_aligned, L_int_aligned, L_short_aligned; 2489 2490 // Input registers (before setup_arg_regs) 2491 const Register from = c_rarg0; // source array address 2492 const Register to = c_rarg1; // destination array address 2493 const Register size = c_rarg2; // byte count (size_t) 2494 2495 // Register used as a temp 2496 const Register bits = rax; // test copy of low bits 2497 2498 __ align(CodeEntryAlignment); 2499 StubCodeMark mark(this, "StubRoutines", name); 2500 address start = __ pc(); 2501 2502 __ enter(); // required for proper stackwalking of RuntimeStub frame 2503 2504 // bump this on entry, not on exit: 2505 inc_counter_np(SharedRuntime::_unsafe_array_copy_ctr); 2506 2507 __ mov(bits, from); 2508 __ orptr(bits, to); 2509 __ orptr(bits, size); 2510 2511 __ testb(bits, BytesPerLong-1); 2512 __ jccb(Assembler::zero, L_long_aligned); 2513 2514 __ testb(bits, BytesPerInt-1); 2515 __ jccb(Assembler::zero, L_int_aligned); 2516 2517 __ testb(bits, BytesPerShort-1); 2518 __ jump_cc(Assembler::notZero, RuntimeAddress(byte_copy_entry)); 2519 2520 __ BIND(L_short_aligned); 2521 __ shrptr(size, LogBytesPerShort); // size => short_count 2522 __ jump(RuntimeAddress(short_copy_entry)); 2523 2524 __ BIND(L_int_aligned); 2525 __ shrptr(size, LogBytesPerInt); // size => int_count 2526 __ jump(RuntimeAddress(int_copy_entry)); 2527 2528 __ BIND(L_long_aligned); 2529 __ shrptr(size, LogBytesPerLong); // size => qword_count 2530 __ jump(RuntimeAddress(long_copy_entry)); 2531 2532 return start; 2533 } 2534 2535 // Perform range checks on the proposed arraycopy. 2536 // Kills temp, but nothing else. 2537 // Also, clean the sign bits of src_pos and dst_pos. 2538 void arraycopy_range_checks(Register src, // source array oop (c_rarg0) 2539 Register src_pos, // source position (c_rarg1) 2540 Register dst, // destination array oo (c_rarg2) 2541 Register dst_pos, // destination position (c_rarg3) 2542 Register length, 2543 Register temp, 2544 Label& L_failed) { 2545 BLOCK_COMMENT("arraycopy_range_checks:"); 2546 2547 // if (src_pos + length > arrayOop(src)->length()) FAIL; 2548 __ movl(temp, length); 2549 __ addl(temp, src_pos); // src_pos + length 2550 __ cmpl(temp, Address(src, arrayOopDesc::length_offset_in_bytes())); 2551 __ jcc(Assembler::above, L_failed); 2552 2553 // if (dst_pos + length > arrayOop(dst)->length()) FAIL; 2554 __ movl(temp, length); 2555 __ addl(temp, dst_pos); // dst_pos + length 2556 __ cmpl(temp, Address(dst, arrayOopDesc::length_offset_in_bytes())); 2557 __ jcc(Assembler::above, L_failed); 2558 2559 // Have to clean up high 32-bits of 'src_pos' and 'dst_pos'. 2560 // Move with sign extension can be used since they are positive. 2561 __ movslq(src_pos, src_pos); 2562 __ movslq(dst_pos, dst_pos); 2563 2564 BLOCK_COMMENT("arraycopy_range_checks done"); 2565 } 2566 2567 // 2568 // Generate generic array copy stubs 2569 // 2570 // Input: 2571 // c_rarg0 - src oop 2572 // c_rarg1 - src_pos (32-bits) 2573 // c_rarg2 - dst oop 2574 // c_rarg3 - dst_pos (32-bits) 2575 // not Win64 2576 // c_rarg4 - element count (32-bits) 2577 // Win64 2578 // rsp+40 - element count (32-bits) 2579 // 2580 // Output: 2581 // rax == 0 - success 2582 // rax == -1^K - failure, where K is partial transfer count 2583 // 2584 address generate_generic_copy(const char *name, 2585 address byte_copy_entry, address short_copy_entry, 2586 address int_copy_entry, address oop_copy_entry, 2587 address long_copy_entry, address checkcast_copy_entry) { 2588 2589 Label L_failed, L_failed_0, L_objArray; 2590 Label L_copy_bytes, L_copy_shorts, L_copy_ints, L_copy_longs; 2591 2592 // Input registers 2593 const Register src = c_rarg0; // source array oop 2594 const Register src_pos = c_rarg1; // source position 2595 const Register dst = c_rarg2; // destination array oop 2596 const Register dst_pos = c_rarg3; // destination position 2597 #ifndef _WIN64 2598 const Register length = c_rarg4; 2599 #else 2600 const Address length(rsp, 6 * wordSize); // elements count is on stack on Win64 2601 #endif 2602 2603 { int modulus = CodeEntryAlignment; 2604 int target = modulus - 5; // 5 = sizeof jmp(L_failed) 2605 int advance = target - (__ offset() % modulus); 2606 if (advance < 0) advance += modulus; 2607 if (advance > 0) __ nop(advance); 2608 } 2609 StubCodeMark mark(this, "StubRoutines", name); 2610 2611 // Short-hop target to L_failed. Makes for denser prologue code. 2612 __ BIND(L_failed_0); 2613 __ jmp(L_failed); 2614 assert(__ offset() % CodeEntryAlignment == 0, "no further alignment needed"); 2615 2616 __ align(CodeEntryAlignment); 2617 address start = __ pc(); 2618 2619 __ enter(); // required for proper stackwalking of RuntimeStub frame 2620 2621 // bump this on entry, not on exit: 2622 inc_counter_np(SharedRuntime::_generic_array_copy_ctr); 2623 2624 //----------------------------------------------------------------------- 2625 // Assembler stub will be used for this call to arraycopy 2626 // if the following conditions are met: 2627 // 2628 // (1) src and dst must not be null. 2629 // (2) src_pos must not be negative. 2630 // (3) dst_pos must not be negative. 2631 // (4) length must not be negative. 2632 // (5) src klass and dst klass should be the same and not NULL. 2633 // (6) src and dst should be arrays. 2634 // (7) src_pos + length must not exceed length of src. 2635 // (8) dst_pos + length must not exceed length of dst. 2636 // 2637 2638 // if (src == NULL) return -1; 2639 __ testptr(src, src); // src oop 2640 size_t j1off = __ offset(); 2641 __ jccb(Assembler::zero, L_failed_0); 2642 2643 // if (src_pos < 0) return -1; 2644 __ testl(src_pos, src_pos); // src_pos (32-bits) 2645 __ jccb(Assembler::negative, L_failed_0); 2646 2647 // if (dst == NULL) return -1; 2648 __ testptr(dst, dst); // dst oop 2649 __ jccb(Assembler::zero, L_failed_0); 2650 2651 // if (dst_pos < 0) return -1; 2652 __ testl(dst_pos, dst_pos); // dst_pos (32-bits) 2653 size_t j4off = __ offset(); 2654 __ jccb(Assembler::negative, L_failed_0); 2655 2656 // The first four tests are very dense code, 2657 // but not quite dense enough to put four 2658 // jumps in a 16-byte instruction fetch buffer. 2659 // That's good, because some branch predicters 2660 // do not like jumps so close together. 2661 // Make sure of this. 2662 guarantee(((j1off ^ j4off) & ~15) != 0, "I$ line of 1st & 4th jumps"); 2663 2664 // registers used as temp 2665 const Register r11_length = r11; // elements count to copy 2666 const Register r10_src_klass = r10; // array klass 2667 2668 // if (length < 0) return -1; 2669 __ movl(r11_length, length); // length (elements count, 32-bits value) 2670 __ testl(r11_length, r11_length); 2671 __ jccb(Assembler::negative, L_failed_0); 2672 2673 __ load_klass(r10_src_klass, src); 2674 #ifdef ASSERT 2675 // assert(src->klass() != NULL); 2676 { 2677 BLOCK_COMMENT("assert klasses not null {"); 2678 Label L1, L2; 2679 __ testptr(r10_src_klass, r10_src_klass); 2680 __ jcc(Assembler::notZero, L2); // it is broken if klass is NULL 2681 __ bind(L1); 2682 __ stop("broken null klass"); 2683 __ bind(L2); 2684 __ load_klass(rax, dst); 2685 __ cmpq(rax, 0); 2686 __ jcc(Assembler::equal, L1); // this would be broken also 2687 BLOCK_COMMENT("} assert klasses not null done"); 2688 } 2689 #endif 2690 2691 // Load layout helper (32-bits) 2692 // 2693 // |array_tag| | header_size | element_type | |log2_element_size| 2694 // 32 30 24 16 8 2 0 2695 // 2696 // array_tag: typeArray = 0x3, objArray = 0x2, non-array = 0x0 2697 // 2698 2699 const int lh_offset = in_bytes(Klass::layout_helper_offset()); 2700 2701 // Handle objArrays completely differently... 2702 const jint objArray_lh = Klass::array_layout_helper(T_OBJECT); 2703 __ cmpl(Address(r10_src_klass, lh_offset), objArray_lh); 2704 __ jcc(Assembler::equal, L_objArray); 2705 2706 // if (src->klass() != dst->klass()) return -1; 2707 __ load_klass(rax, dst); 2708 __ cmpq(r10_src_klass, rax); 2709 __ jcc(Assembler::notEqual, L_failed); 2710 2711 const Register rax_lh = rax; // layout helper 2712 __ movl(rax_lh, Address(r10_src_klass, lh_offset)); 2713 2714 // if (!src->is_Array()) return -1; 2715 __ cmpl(rax_lh, Klass::_lh_neutral_value); 2716 __ jcc(Assembler::greaterEqual, L_failed); 2717 2718 // At this point, it is known to be a typeArray (array_tag 0x3). 2719 #ifdef ASSERT 2720 { 2721 BLOCK_COMMENT("assert primitive array {"); 2722 Label L; 2723 __ cmpl(rax_lh, (Klass::_lh_array_tag_type_value << Klass::_lh_array_tag_shift)); 2724 __ jcc(Assembler::greaterEqual, L); 2725 __ stop("must be a primitive array"); 2726 __ bind(L); 2727 BLOCK_COMMENT("} assert primitive array done"); 2728 } 2729 #endif 2730 2731 arraycopy_range_checks(src, src_pos, dst, dst_pos, r11_length, 2732 r10, L_failed); 2733 2734 // TypeArrayKlass 2735 // 2736 // src_addr = (src + array_header_in_bytes()) + (src_pos << log2elemsize); 2737 // dst_addr = (dst + array_header_in_bytes()) + (dst_pos << log2elemsize); 2738 // 2739 2740 const Register r10_offset = r10; // array offset 2741 const Register rax_elsize = rax_lh; // element size 2742 2743 __ movl(r10_offset, rax_lh); 2744 __ shrl(r10_offset, Klass::_lh_header_size_shift); 2745 __ andptr(r10_offset, Klass::_lh_header_size_mask); // array_offset 2746 __ addptr(src, r10_offset); // src array offset 2747 __ addptr(dst, r10_offset); // dst array offset 2748 BLOCK_COMMENT("choose copy loop based on element size"); 2749 __ andl(rax_lh, Klass::_lh_log2_element_size_mask); // rax_lh -> rax_elsize 2750 2751 // next registers should be set before the jump to corresponding stub 2752 const Register from = c_rarg0; // source array address 2753 const Register to = c_rarg1; // destination array address 2754 const Register count = c_rarg2; // elements count 2755 2756 // 'from', 'to', 'count' registers should be set in such order 2757 // since they are the same as 'src', 'src_pos', 'dst'. 2758 2759 __ BIND(L_copy_bytes); 2760 __ cmpl(rax_elsize, 0); 2761 __ jccb(Assembler::notEqual, L_copy_shorts); 2762 __ lea(from, Address(src, src_pos, Address::times_1, 0));// src_addr 2763 __ lea(to, Address(dst, dst_pos, Address::times_1, 0));// dst_addr 2764 __ movl2ptr(count, r11_length); // length 2765 __ jump(RuntimeAddress(byte_copy_entry)); 2766 2767 __ BIND(L_copy_shorts); 2768 __ cmpl(rax_elsize, LogBytesPerShort); 2769 __ jccb(Assembler::notEqual, L_copy_ints); 2770 __ lea(from, Address(src, src_pos, Address::times_2, 0));// src_addr 2771 __ lea(to, Address(dst, dst_pos, Address::times_2, 0));// dst_addr 2772 __ movl2ptr(count, r11_length); // length 2773 __ jump(RuntimeAddress(short_copy_entry)); 2774 2775 __ BIND(L_copy_ints); 2776 __ cmpl(rax_elsize, LogBytesPerInt); 2777 __ jccb(Assembler::notEqual, L_copy_longs); 2778 __ lea(from, Address(src, src_pos, Address::times_4, 0));// src_addr 2779 __ lea(to, Address(dst, dst_pos, Address::times_4, 0));// dst_addr 2780 __ movl2ptr(count, r11_length); // length 2781 __ jump(RuntimeAddress(int_copy_entry)); 2782 2783 __ BIND(L_copy_longs); 2784 #ifdef ASSERT 2785 { 2786 BLOCK_COMMENT("assert long copy {"); 2787 Label L; 2788 __ cmpl(rax_elsize, LogBytesPerLong); 2789 __ jcc(Assembler::equal, L); 2790 __ stop("must be long copy, but elsize is wrong"); 2791 __ bind(L); 2792 BLOCK_COMMENT("} assert long copy done"); 2793 } 2794 #endif 2795 __ lea(from, Address(src, src_pos, Address::times_8, 0));// src_addr 2796 __ lea(to, Address(dst, dst_pos, Address::times_8, 0));// dst_addr 2797 __ movl2ptr(count, r11_length); // length 2798 __ jump(RuntimeAddress(long_copy_entry)); 2799 2800 // ObjArrayKlass 2801 __ BIND(L_objArray); 2802 // live at this point: r10_src_klass, r11_length, src[_pos], dst[_pos] 2803 2804 Label L_plain_copy, L_checkcast_copy; 2805 // test array classes for subtyping 2806 __ load_klass(rax, dst); 2807 __ cmpq(r10_src_klass, rax); // usual case is exact equality 2808 __ jcc(Assembler::notEqual, L_checkcast_copy); 2809 2810 // Identically typed arrays can be copied without element-wise checks. 2811 arraycopy_range_checks(src, src_pos, dst, dst_pos, r11_length, 2812 r10, L_failed); 2813 2814 __ lea(from, Address(src, src_pos, TIMES_OOP, 2815 arrayOopDesc::base_offset_in_bytes(T_OBJECT))); // src_addr 2816 __ lea(to, Address(dst, dst_pos, TIMES_OOP, 2817 arrayOopDesc::base_offset_in_bytes(T_OBJECT))); // dst_addr 2818 __ movl2ptr(count, r11_length); // length 2819 __ BIND(L_plain_copy); 2820 __ jump(RuntimeAddress(oop_copy_entry)); 2821 2822 __ BIND(L_checkcast_copy); 2823 // live at this point: r10_src_klass, r11_length, rax (dst_klass) 2824 { 2825 // Before looking at dst.length, make sure dst is also an objArray. 2826 __ cmpl(Address(rax, lh_offset), objArray_lh); 2827 __ jcc(Assembler::notEqual, L_failed); 2828 2829 // It is safe to examine both src.length and dst.length. 2830 arraycopy_range_checks(src, src_pos, dst, dst_pos, r11_length, 2831 rax, L_failed); 2832 2833 const Register r11_dst_klass = r11; 2834 __ load_klass(r11_dst_klass, dst); // reload 2835 2836 // Marshal the base address arguments now, freeing registers. 2837 __ lea(from, Address(src, src_pos, TIMES_OOP, 2838 arrayOopDesc::base_offset_in_bytes(T_OBJECT))); 2839 __ lea(to, Address(dst, dst_pos, TIMES_OOP, 2840 arrayOopDesc::base_offset_in_bytes(T_OBJECT))); 2841 __ movl(count, length); // length (reloaded) 2842 Register sco_temp = c_rarg3; // this register is free now 2843 assert_different_registers(from, to, count, sco_temp, 2844 r11_dst_klass, r10_src_klass); 2845 assert_clean_int(count, sco_temp); 2846 2847 // Generate the type check. 2848 const int sco_offset = in_bytes(Klass::super_check_offset_offset()); 2849 __ movl(sco_temp, Address(r11_dst_klass, sco_offset)); 2850 assert_clean_int(sco_temp, rax); 2851 generate_type_check(r10_src_klass, sco_temp, r11_dst_klass, L_plain_copy); 2852 2853 // Fetch destination element klass from the ObjArrayKlass header. 2854 int ek_offset = in_bytes(ObjArrayKlass::element_klass_offset()); 2855 __ movptr(r11_dst_klass, Address(r11_dst_klass, ek_offset)); 2856 __ movl( sco_temp, Address(r11_dst_klass, sco_offset)); 2857 assert_clean_int(sco_temp, rax); 2858 2859 // the checkcast_copy loop needs two extra arguments: 2860 assert(c_rarg3 == sco_temp, "#3 already in place"); 2861 // Set up arguments for checkcast_copy_entry. 2862 setup_arg_regs(4); 2863 __ movptr(r8, r11_dst_klass); // dst.klass.element_klass, r8 is c_rarg4 on Linux/Solaris 2864 __ jump(RuntimeAddress(checkcast_copy_entry)); 2865 } 2866 2867 __ BIND(L_failed); 2868 __ xorptr(rax, rax); 2869 __ notptr(rax); // return -1 2870 __ leave(); // required for proper stackwalking of RuntimeStub frame 2871 __ ret(0); 2872 2873 return start; 2874 } 2875 2876 void generate_arraycopy_stubs() { 2877 address entry; 2878 address entry_jbyte_arraycopy; 2879 address entry_jshort_arraycopy; 2880 address entry_jint_arraycopy; 2881 address entry_oop_arraycopy; 2882 address entry_jlong_arraycopy; 2883 address entry_checkcast_arraycopy; 2884 2885 StubRoutines::_jbyte_disjoint_arraycopy = generate_disjoint_byte_copy(false, &entry, 2886 "jbyte_disjoint_arraycopy"); 2887 StubRoutines::_jbyte_arraycopy = generate_conjoint_byte_copy(false, entry, &entry_jbyte_arraycopy, 2888 "jbyte_arraycopy"); 2889 2890 StubRoutines::_jshort_disjoint_arraycopy = generate_disjoint_short_copy(false, &entry, 2891 "jshort_disjoint_arraycopy"); 2892 StubRoutines::_jshort_arraycopy = generate_conjoint_short_copy(false, entry, &entry_jshort_arraycopy, 2893 "jshort_arraycopy"); 2894 2895 StubRoutines::_jint_disjoint_arraycopy = generate_disjoint_int_oop_copy(false, false, &entry, 2896 "jint_disjoint_arraycopy"); 2897 StubRoutines::_jint_arraycopy = generate_conjoint_int_oop_copy(false, false, entry, 2898 &entry_jint_arraycopy, "jint_arraycopy"); 2899 2900 StubRoutines::_jlong_disjoint_arraycopy = generate_disjoint_long_oop_copy(false, false, &entry, 2901 "jlong_disjoint_arraycopy"); 2902 StubRoutines::_jlong_arraycopy = generate_conjoint_long_oop_copy(false, false, entry, 2903 &entry_jlong_arraycopy, "jlong_arraycopy"); 2904 2905 2906 if (UseCompressedOops) { 2907 StubRoutines::_oop_disjoint_arraycopy = generate_disjoint_int_oop_copy(false, true, &entry, 2908 "oop_disjoint_arraycopy"); 2909 StubRoutines::_oop_arraycopy = generate_conjoint_int_oop_copy(false, true, entry, 2910 &entry_oop_arraycopy, "oop_arraycopy"); 2911 StubRoutines::_oop_disjoint_arraycopy_uninit = generate_disjoint_int_oop_copy(false, true, &entry, 2912 "oop_disjoint_arraycopy_uninit", 2913 /*dest_uninitialized*/true); 2914 StubRoutines::_oop_arraycopy_uninit = generate_conjoint_int_oop_copy(false, true, entry, 2915 NULL, "oop_arraycopy_uninit", 2916 /*dest_uninitialized*/true); 2917 } else { 2918 StubRoutines::_oop_disjoint_arraycopy = generate_disjoint_long_oop_copy(false, true, &entry, 2919 "oop_disjoint_arraycopy"); 2920 StubRoutines::_oop_arraycopy = generate_conjoint_long_oop_copy(false, true, entry, 2921 &entry_oop_arraycopy, "oop_arraycopy"); 2922 StubRoutines::_oop_disjoint_arraycopy_uninit = generate_disjoint_long_oop_copy(false, true, &entry, 2923 "oop_disjoint_arraycopy_uninit", 2924 /*dest_uninitialized*/true); 2925 StubRoutines::_oop_arraycopy_uninit = generate_conjoint_long_oop_copy(false, true, entry, 2926 NULL, "oop_arraycopy_uninit", 2927 /*dest_uninitialized*/true); 2928 } 2929 2930 StubRoutines::_checkcast_arraycopy = generate_checkcast_copy("checkcast_arraycopy", &entry_checkcast_arraycopy); 2931 StubRoutines::_checkcast_arraycopy_uninit = generate_checkcast_copy("checkcast_arraycopy_uninit", NULL, 2932 /*dest_uninitialized*/true); 2933 2934 StubRoutines::_unsafe_arraycopy = generate_unsafe_copy("unsafe_arraycopy", 2935 entry_jbyte_arraycopy, 2936 entry_jshort_arraycopy, 2937 entry_jint_arraycopy, 2938 entry_jlong_arraycopy); 2939 StubRoutines::_generic_arraycopy = generate_generic_copy("generic_arraycopy", 2940 entry_jbyte_arraycopy, 2941 entry_jshort_arraycopy, 2942 entry_jint_arraycopy, 2943 entry_oop_arraycopy, 2944 entry_jlong_arraycopy, 2945 entry_checkcast_arraycopy); 2946 2947 StubRoutines::_jbyte_fill = generate_fill(T_BYTE, false, "jbyte_fill"); 2948 StubRoutines::_jshort_fill = generate_fill(T_SHORT, false, "jshort_fill"); 2949 StubRoutines::_jint_fill = generate_fill(T_INT, false, "jint_fill"); 2950 StubRoutines::_arrayof_jbyte_fill = generate_fill(T_BYTE, true, "arrayof_jbyte_fill"); 2951 StubRoutines::_arrayof_jshort_fill = generate_fill(T_SHORT, true, "arrayof_jshort_fill"); 2952 StubRoutines::_arrayof_jint_fill = generate_fill(T_INT, true, "arrayof_jint_fill"); 2953 2954 // We don't generate specialized code for HeapWord-aligned source 2955 // arrays, so just use the code we've already generated 2956 StubRoutines::_arrayof_jbyte_disjoint_arraycopy = StubRoutines::_jbyte_disjoint_arraycopy; 2957 StubRoutines::_arrayof_jbyte_arraycopy = StubRoutines::_jbyte_arraycopy; 2958 2959 StubRoutines::_arrayof_jshort_disjoint_arraycopy = StubRoutines::_jshort_disjoint_arraycopy; 2960 StubRoutines::_arrayof_jshort_arraycopy = StubRoutines::_jshort_arraycopy; 2961 2962 StubRoutines::_arrayof_jint_disjoint_arraycopy = StubRoutines::_jint_disjoint_arraycopy; 2963 StubRoutines::_arrayof_jint_arraycopy = StubRoutines::_jint_arraycopy; 2964 2965 StubRoutines::_arrayof_jlong_disjoint_arraycopy = StubRoutines::_jlong_disjoint_arraycopy; 2966 StubRoutines::_arrayof_jlong_arraycopy = StubRoutines::_jlong_arraycopy; 2967 2968 StubRoutines::_arrayof_oop_disjoint_arraycopy = StubRoutines::_oop_disjoint_arraycopy; 2969 StubRoutines::_arrayof_oop_arraycopy = StubRoutines::_oop_arraycopy; 2970 2971 StubRoutines::_arrayof_oop_disjoint_arraycopy_uninit = StubRoutines::_oop_disjoint_arraycopy_uninit; 2972 StubRoutines::_arrayof_oop_arraycopy_uninit = StubRoutines::_oop_arraycopy_uninit; 2973 } 2974 2975 void generate_math_stubs() { 2976 { 2977 StubCodeMark mark(this, "StubRoutines", "log10"); 2978 StubRoutines::_intrinsic_log10 = (double (*)(double)) __ pc(); 2979 2980 __ subq(rsp, 8); 2981 __ movdbl(Address(rsp, 0), xmm0); 2982 __ fld_d(Address(rsp, 0)); 2983 __ flog10(); 2984 __ fstp_d(Address(rsp, 0)); 2985 __ movdbl(xmm0, Address(rsp, 0)); 2986 __ addq(rsp, 8); 2987 __ ret(0); 2988 } 2989 { 2990 StubCodeMark mark(this, "StubRoutines", "sin"); 2991 StubRoutines::_intrinsic_sin = (double (*)(double)) __ pc(); 2992 2993 __ subq(rsp, 8); 2994 __ movdbl(Address(rsp, 0), xmm0); 2995 __ fld_d(Address(rsp, 0)); 2996 __ trigfunc('s'); 2997 __ fstp_d(Address(rsp, 0)); 2998 __ movdbl(xmm0, Address(rsp, 0)); 2999 __ addq(rsp, 8); 3000 __ ret(0); 3001 } 3002 { 3003 StubCodeMark mark(this, "StubRoutines", "cos"); 3004 StubRoutines::_intrinsic_cos = (double (*)(double)) __ pc(); 3005 3006 __ subq(rsp, 8); 3007 __ movdbl(Address(rsp, 0), xmm0); 3008 __ fld_d(Address(rsp, 0)); 3009 __ trigfunc('c'); 3010 __ fstp_d(Address(rsp, 0)); 3011 __ movdbl(xmm0, Address(rsp, 0)); 3012 __ addq(rsp, 8); 3013 __ ret(0); 3014 } 3015 { 3016 StubCodeMark mark(this, "StubRoutines", "tan"); 3017 StubRoutines::_intrinsic_tan = (double (*)(double)) __ pc(); 3018 3019 __ subq(rsp, 8); 3020 __ movdbl(Address(rsp, 0), xmm0); 3021 __ fld_d(Address(rsp, 0)); 3022 __ trigfunc('t'); 3023 __ fstp_d(Address(rsp, 0)); 3024 __ movdbl(xmm0, Address(rsp, 0)); 3025 __ addq(rsp, 8); 3026 __ ret(0); 3027 } 3028 { 3029 StubCodeMark mark(this, "StubRoutines", "pow"); 3030 StubRoutines::_intrinsic_pow = (double (*)(double,double)) __ pc(); 3031 3032 __ subq(rsp, 8); 3033 __ movdbl(Address(rsp, 0), xmm1); 3034 __ fld_d(Address(rsp, 0)); 3035 __ movdbl(Address(rsp, 0), xmm0); 3036 __ fld_d(Address(rsp, 0)); 3037 __ pow_with_fallback(0); 3038 __ fstp_d(Address(rsp, 0)); 3039 __ movdbl(xmm0, Address(rsp, 0)); 3040 __ addq(rsp, 8); 3041 __ ret(0); 3042 } 3043 } 3044 3045 // AES intrinsic stubs 3046 enum {AESBlockSize = 16}; 3047 3048 address generate_key_shuffle_mask() { 3049 __ align(16); 3050 StubCodeMark mark(this, "StubRoutines", "key_shuffle_mask"); 3051 address start = __ pc(); 3052 __ emit_data64( 0x0405060700010203, relocInfo::none ); 3053 __ emit_data64( 0x0c0d0e0f08090a0b, relocInfo::none ); 3054 return start; 3055 } 3056 3057 // Utility routine for loading a 128-bit key word in little endian format 3058 // can optionally specify that the shuffle mask is already in an xmmregister 3059 void load_key(XMMRegister xmmdst, Register key, int offset, XMMRegister xmm_shuf_mask=NULL) { 3060 __ movdqu(xmmdst, Address(key, offset)); 3061 if (xmm_shuf_mask != NULL) { 3062 __ pshufb(xmmdst, xmm_shuf_mask); 3063 } else { 3064 __ pshufb(xmmdst, ExternalAddress(StubRoutines::x86::key_shuffle_mask_addr())); 3065 } 3066 } 3067 3068 // Arguments: 3069 // 3070 // Inputs: 3071 // c_rarg0 - source byte array address 3072 // c_rarg1 - destination byte array address 3073 // c_rarg2 - K (key) in little endian int array 3074 // 3075 address generate_aescrypt_encryptBlock() { 3076 assert(UseAES, "need AES instructions and misaligned SSE support"); 3077 __ align(CodeEntryAlignment); 3078 StubCodeMark mark(this, "StubRoutines", "aescrypt_encryptBlock"); 3079 Label L_doLast; 3080 address start = __ pc(); 3081 3082 const Register from = c_rarg0; // source array address 3083 const Register to = c_rarg1; // destination array address 3084 const Register key = c_rarg2; // key array address 3085 const Register keylen = rax; 3086 3087 const XMMRegister xmm_result = xmm0; 3088 const XMMRegister xmm_key_shuf_mask = xmm1; 3089 // On win64 xmm6-xmm15 must be preserved so don't use them. 3090 const XMMRegister xmm_temp1 = xmm2; 3091 const XMMRegister xmm_temp2 = xmm3; 3092 const XMMRegister xmm_temp3 = xmm4; 3093 const XMMRegister xmm_temp4 = xmm5; 3094 3095 __ enter(); // required for proper stackwalking of RuntimeStub frame 3096 3097 // For EVEX with VL and BW, provide a standard mask, VL = 128 will guide the merge 3098 // context for the registers used, where all instructions below are using 128-bit mode 3099 // On EVEX without VL and BW, these instructions will all be AVX. 3100 if (VM_Version::supports_avx512vlbw()) { 3101 __ movl(rax, 0xffff); 3102 __ kmovql(k1, rax); 3103 } 3104 3105 // keylen could be only {11, 13, 15} * 4 = {44, 52, 60} 3106 __ movl(keylen, Address(key, arrayOopDesc::length_offset_in_bytes() - arrayOopDesc::base_offset_in_bytes(T_INT))); 3107 3108 __ movdqu(xmm_key_shuf_mask, ExternalAddress(StubRoutines::x86::key_shuffle_mask_addr())); 3109 __ movdqu(xmm_result, Address(from, 0)); // get 16 bytes of input 3110 3111 // For encryption, the java expanded key ordering is just what we need 3112 // we don't know if the key is aligned, hence not using load-execute form 3113 3114 load_key(xmm_temp1, key, 0x00, xmm_key_shuf_mask); 3115 __ pxor(xmm_result, xmm_temp1); 3116 3117 load_key(xmm_temp1, key, 0x10, xmm_key_shuf_mask); 3118 load_key(xmm_temp2, key, 0x20, xmm_key_shuf_mask); 3119 load_key(xmm_temp3, key, 0x30, xmm_key_shuf_mask); 3120 load_key(xmm_temp4, key, 0x40, xmm_key_shuf_mask); 3121 3122 __ aesenc(xmm_result, xmm_temp1); 3123 __ aesenc(xmm_result, xmm_temp2); 3124 __ aesenc(xmm_result, xmm_temp3); 3125 __ aesenc(xmm_result, xmm_temp4); 3126 3127 load_key(xmm_temp1, key, 0x50, xmm_key_shuf_mask); 3128 load_key(xmm_temp2, key, 0x60, xmm_key_shuf_mask); 3129 load_key(xmm_temp3, key, 0x70, xmm_key_shuf_mask); 3130 load_key(xmm_temp4, key, 0x80, xmm_key_shuf_mask); 3131 3132 __ aesenc(xmm_result, xmm_temp1); 3133 __ aesenc(xmm_result, xmm_temp2); 3134 __ aesenc(xmm_result, xmm_temp3); 3135 __ aesenc(xmm_result, xmm_temp4); 3136 3137 load_key(xmm_temp1, key, 0x90, xmm_key_shuf_mask); 3138 load_key(xmm_temp2, key, 0xa0, xmm_key_shuf_mask); 3139 3140 __ cmpl(keylen, 44); 3141 __ jccb(Assembler::equal, L_doLast); 3142 3143 __ aesenc(xmm_result, xmm_temp1); 3144 __ aesenc(xmm_result, xmm_temp2); 3145 3146 load_key(xmm_temp1, key, 0xb0, xmm_key_shuf_mask); 3147 load_key(xmm_temp2, key, 0xc0, xmm_key_shuf_mask); 3148 3149 __ cmpl(keylen, 52); 3150 __ jccb(Assembler::equal, L_doLast); 3151 3152 __ aesenc(xmm_result, xmm_temp1); 3153 __ aesenc(xmm_result, xmm_temp2); 3154 3155 load_key(xmm_temp1, key, 0xd0, xmm_key_shuf_mask); 3156 load_key(xmm_temp2, key, 0xe0, xmm_key_shuf_mask); 3157 3158 __ BIND(L_doLast); 3159 __ aesenc(xmm_result, xmm_temp1); 3160 __ aesenclast(xmm_result, xmm_temp2); 3161 __ movdqu(Address(to, 0), xmm_result); // store the result 3162 __ xorptr(rax, rax); // return 0 3163 __ leave(); // required for proper stackwalking of RuntimeStub frame 3164 __ ret(0); 3165 3166 return start; 3167 } 3168 3169 3170 // Arguments: 3171 // 3172 // Inputs: 3173 // c_rarg0 - source byte array address 3174 // c_rarg1 - destination byte array address 3175 // c_rarg2 - K (key) in little endian int array 3176 // 3177 address generate_aescrypt_decryptBlock() { 3178 assert(UseAES, "need AES instructions and misaligned SSE support"); 3179 __ align(CodeEntryAlignment); 3180 StubCodeMark mark(this, "StubRoutines", "aescrypt_decryptBlock"); 3181 Label L_doLast; 3182 address start = __ pc(); 3183 3184 const Register from = c_rarg0; // source array address 3185 const Register to = c_rarg1; // destination array address 3186 const Register key = c_rarg2; // key array address 3187 const Register keylen = rax; 3188 3189 const XMMRegister xmm_result = xmm0; 3190 const XMMRegister xmm_key_shuf_mask = xmm1; 3191 // On win64 xmm6-xmm15 must be preserved so don't use them. 3192 const XMMRegister xmm_temp1 = xmm2; 3193 const XMMRegister xmm_temp2 = xmm3; 3194 const XMMRegister xmm_temp3 = xmm4; 3195 const XMMRegister xmm_temp4 = xmm5; 3196 3197 __ enter(); // required for proper stackwalking of RuntimeStub frame 3198 3199 // For EVEX with VL and BW, provide a standard mask, VL = 128 will guide the merge 3200 // context for the registers used, where all instructions below are using 128-bit mode 3201 // On EVEX without VL and BW, these instructions will all be AVX. 3202 if (VM_Version::supports_avx512vlbw()) { 3203 __ movl(rax, 0xffff); 3204 __ kmovql(k1, rax); 3205 } 3206 3207 // keylen could be only {11, 13, 15} * 4 = {44, 52, 60} 3208 __ movl(keylen, Address(key, arrayOopDesc::length_offset_in_bytes() - arrayOopDesc::base_offset_in_bytes(T_INT))); 3209 3210 __ movdqu(xmm_key_shuf_mask, ExternalAddress(StubRoutines::x86::key_shuffle_mask_addr())); 3211 __ movdqu(xmm_result, Address(from, 0)); 3212 3213 // for decryption java expanded key ordering is rotated one position from what we want 3214 // so we start from 0x10 here and hit 0x00 last 3215 // we don't know if the key is aligned, hence not using load-execute form 3216 load_key(xmm_temp1, key, 0x10, xmm_key_shuf_mask); 3217 load_key(xmm_temp2, key, 0x20, xmm_key_shuf_mask); 3218 load_key(xmm_temp3, key, 0x30, xmm_key_shuf_mask); 3219 load_key(xmm_temp4, key, 0x40, xmm_key_shuf_mask); 3220 3221 __ pxor (xmm_result, xmm_temp1); 3222 __ aesdec(xmm_result, xmm_temp2); 3223 __ aesdec(xmm_result, xmm_temp3); 3224 __ aesdec(xmm_result, xmm_temp4); 3225 3226 load_key(xmm_temp1, key, 0x50, xmm_key_shuf_mask); 3227 load_key(xmm_temp2, key, 0x60, xmm_key_shuf_mask); 3228 load_key(xmm_temp3, key, 0x70, xmm_key_shuf_mask); 3229 load_key(xmm_temp4, key, 0x80, xmm_key_shuf_mask); 3230 3231 __ aesdec(xmm_result, xmm_temp1); 3232 __ aesdec(xmm_result, xmm_temp2); 3233 __ aesdec(xmm_result, xmm_temp3); 3234 __ aesdec(xmm_result, xmm_temp4); 3235 3236 load_key(xmm_temp1, key, 0x90, xmm_key_shuf_mask); 3237 load_key(xmm_temp2, key, 0xa0, xmm_key_shuf_mask); 3238 load_key(xmm_temp3, key, 0x00, xmm_key_shuf_mask); 3239 3240 __ cmpl(keylen, 44); 3241 __ jccb(Assembler::equal, L_doLast); 3242 3243 __ aesdec(xmm_result, xmm_temp1); 3244 __ aesdec(xmm_result, xmm_temp2); 3245 3246 load_key(xmm_temp1, key, 0xb0, xmm_key_shuf_mask); 3247 load_key(xmm_temp2, key, 0xc0, xmm_key_shuf_mask); 3248 3249 __ cmpl(keylen, 52); 3250 __ jccb(Assembler::equal, L_doLast); 3251 3252 __ aesdec(xmm_result, xmm_temp1); 3253 __ aesdec(xmm_result, xmm_temp2); 3254 3255 load_key(xmm_temp1, key, 0xd0, xmm_key_shuf_mask); 3256 load_key(xmm_temp2, key, 0xe0, xmm_key_shuf_mask); 3257 3258 __ BIND(L_doLast); 3259 __ aesdec(xmm_result, xmm_temp1); 3260 __ aesdec(xmm_result, xmm_temp2); 3261 3262 // for decryption the aesdeclast operation is always on key+0x00 3263 __ aesdeclast(xmm_result, xmm_temp3); 3264 __ movdqu(Address(to, 0), xmm_result); // store the result 3265 __ xorptr(rax, rax); // return 0 3266 __ leave(); // required for proper stackwalking of RuntimeStub frame 3267 __ ret(0); 3268 3269 return start; 3270 } 3271 3272 3273 // Arguments: 3274 // 3275 // Inputs: 3276 // c_rarg0 - source byte array address 3277 // c_rarg1 - destination byte array address 3278 // c_rarg2 - K (key) in little endian int array 3279 // c_rarg3 - r vector byte array address 3280 // c_rarg4 - input length 3281 // 3282 // Output: 3283 // rax - input length 3284 // 3285 address generate_cipherBlockChaining_encryptAESCrypt() { 3286 assert(UseAES, "need AES instructions and misaligned SSE support"); 3287 __ align(CodeEntryAlignment); 3288 StubCodeMark mark(this, "StubRoutines", "cipherBlockChaining_encryptAESCrypt"); 3289 address start = __ pc(); 3290 3291 Label L_exit, L_key_192_256, L_key_256, L_loopTop_128, L_loopTop_192, L_loopTop_256; 3292 const Register from = c_rarg0; // source array address 3293 const Register to = c_rarg1; // destination array address 3294 const Register key = c_rarg2; // key array address 3295 const Register rvec = c_rarg3; // r byte array initialized from initvector array address 3296 // and left with the results of the last encryption block 3297 #ifndef _WIN64 3298 const Register len_reg = c_rarg4; // src len (must be multiple of blocksize 16) 3299 #else 3300 const Address len_mem(rbp, 6 * wordSize); // length is on stack on Win64 3301 const Register len_reg = r10; // pick the first volatile windows register 3302 #endif 3303 const Register pos = rax; 3304 3305 // xmm register assignments for the loops below 3306 const XMMRegister xmm_result = xmm0; 3307 const XMMRegister xmm_temp = xmm1; 3308 // keys 0-10 preloaded into xmm2-xmm12 3309 const int XMM_REG_NUM_KEY_FIRST = 2; 3310 const int XMM_REG_NUM_KEY_LAST = 15; 3311 const XMMRegister xmm_key0 = as_XMMRegister(XMM_REG_NUM_KEY_FIRST); 3312 const XMMRegister xmm_key10 = as_XMMRegister(XMM_REG_NUM_KEY_FIRST+10); 3313 const XMMRegister xmm_key11 = as_XMMRegister(XMM_REG_NUM_KEY_FIRST+11); 3314 const XMMRegister xmm_key12 = as_XMMRegister(XMM_REG_NUM_KEY_FIRST+12); 3315 const XMMRegister xmm_key13 = as_XMMRegister(XMM_REG_NUM_KEY_FIRST+13); 3316 3317 __ enter(); // required for proper stackwalking of RuntimeStub frame 3318 3319 // For EVEX with VL and BW, provide a standard mask, VL = 128 will guide the merge 3320 // context for the registers used, where all instructions below are using 128-bit mode 3321 // On EVEX without VL and BW, these instructions will all be AVX. 3322 if (VM_Version::supports_avx512vlbw()) { 3323 __ movl(rax, 0xffff); 3324 __ kmovql(k1, rax); 3325 } 3326 3327 #ifdef _WIN64 3328 // on win64, fill len_reg from stack position 3329 __ movl(len_reg, len_mem); 3330 // save the xmm registers which must be preserved 6-15 3331 __ subptr(rsp, -rsp_after_call_off * wordSize); 3332 for (int i = 6; i <= XMM_REG_NUM_KEY_LAST; i++) { 3333 __ movdqu(xmm_save(i), as_XMMRegister(i)); 3334 } 3335 #else 3336 __ push(len_reg); // Save 3337 #endif 3338 3339 const XMMRegister xmm_key_shuf_mask = xmm_temp; // used temporarily to swap key bytes up front 3340 __ movdqu(xmm_key_shuf_mask, ExternalAddress(StubRoutines::x86::key_shuffle_mask_addr())); 3341 // load up xmm regs xmm2 thru xmm12 with key 0x00 - 0xa0 3342 for (int rnum = XMM_REG_NUM_KEY_FIRST, offset = 0x00; rnum <= XMM_REG_NUM_KEY_FIRST+10; rnum++) { 3343 load_key(as_XMMRegister(rnum), key, offset, xmm_key_shuf_mask); 3344 offset += 0x10; 3345 } 3346 __ movdqu(xmm_result, Address(rvec, 0x00)); // initialize xmm_result with r vec 3347 3348 // now split to different paths depending on the keylen (len in ints of AESCrypt.KLE array (52=192, or 60=256)) 3349 __ movl(rax, Address(key, arrayOopDesc::length_offset_in_bytes() - arrayOopDesc::base_offset_in_bytes(T_INT))); 3350 __ cmpl(rax, 44); 3351 __ jcc(Assembler::notEqual, L_key_192_256); 3352 3353 // 128 bit code follows here 3354 __ movptr(pos, 0); 3355 __ align(OptoLoopAlignment); 3356 3357 __ BIND(L_loopTop_128); 3358 __ movdqu(xmm_temp, Address(from, pos, Address::times_1, 0)); // get next 16 bytes of input 3359 __ pxor (xmm_result, xmm_temp); // xor with the current r vector 3360 __ pxor (xmm_result, xmm_key0); // do the aes rounds 3361 for (int rnum = XMM_REG_NUM_KEY_FIRST + 1; rnum <= XMM_REG_NUM_KEY_FIRST + 9; rnum++) { 3362 __ aesenc(xmm_result, as_XMMRegister(rnum)); 3363 } 3364 __ aesenclast(xmm_result, xmm_key10); 3365 __ movdqu(Address(to, pos, Address::times_1, 0), xmm_result); // store into the next 16 bytes of output 3366 // no need to store r to memory until we exit 3367 __ addptr(pos, AESBlockSize); 3368 __ subptr(len_reg, AESBlockSize); 3369 __ jcc(Assembler::notEqual, L_loopTop_128); 3370 3371 __ BIND(L_exit); 3372 __ movdqu(Address(rvec, 0), xmm_result); // final value of r stored in rvec of CipherBlockChaining object 3373 3374 #ifdef _WIN64 3375 // restore xmm regs belonging to calling function 3376 for (int i = 6; i <= XMM_REG_NUM_KEY_LAST; i++) { 3377 __ movdqu(as_XMMRegister(i), xmm_save(i)); 3378 } 3379 __ movl(rax, len_mem); 3380 #else 3381 __ pop(rax); // return length 3382 #endif 3383 __ leave(); // required for proper stackwalking of RuntimeStub frame 3384 __ ret(0); 3385 3386 __ BIND(L_key_192_256); 3387 // here rax = len in ints of AESCrypt.KLE array (52=192, or 60=256) 3388 load_key(xmm_key11, key, 0xb0, xmm_key_shuf_mask); 3389 load_key(xmm_key12, key, 0xc0, xmm_key_shuf_mask); 3390 __ cmpl(rax, 52); 3391 __ jcc(Assembler::notEqual, L_key_256); 3392 3393 // 192-bit code follows here (could be changed to use more xmm registers) 3394 __ movptr(pos, 0); 3395 __ align(OptoLoopAlignment); 3396 3397 __ BIND(L_loopTop_192); 3398 __ movdqu(xmm_temp, Address(from, pos, Address::times_1, 0)); // get next 16 bytes of input 3399 __ pxor (xmm_result, xmm_temp); // xor with the current r vector 3400 __ pxor (xmm_result, xmm_key0); // do the aes rounds 3401 for (int rnum = XMM_REG_NUM_KEY_FIRST + 1; rnum <= XMM_REG_NUM_KEY_FIRST + 11; rnum++) { 3402 __ aesenc(xmm_result, as_XMMRegister(rnum)); 3403 } 3404 __ aesenclast(xmm_result, xmm_key12); 3405 __ movdqu(Address(to, pos, Address::times_1, 0), xmm_result); // store into the next 16 bytes of output 3406 // no need to store r to memory until we exit 3407 __ addptr(pos, AESBlockSize); 3408 __ subptr(len_reg, AESBlockSize); 3409 __ jcc(Assembler::notEqual, L_loopTop_192); 3410 __ jmp(L_exit); 3411 3412 __ BIND(L_key_256); 3413 // 256-bit code follows here (could be changed to use more xmm registers) 3414 load_key(xmm_key13, key, 0xd0, xmm_key_shuf_mask); 3415 __ movptr(pos, 0); 3416 __ align(OptoLoopAlignment); 3417 3418 __ BIND(L_loopTop_256); 3419 __ movdqu(xmm_temp, Address(from, pos, Address::times_1, 0)); // get next 16 bytes of input 3420 __ pxor (xmm_result, xmm_temp); // xor with the current r vector 3421 __ pxor (xmm_result, xmm_key0); // do the aes rounds 3422 for (int rnum = XMM_REG_NUM_KEY_FIRST + 1; rnum <= XMM_REG_NUM_KEY_FIRST + 13; rnum++) { 3423 __ aesenc(xmm_result, as_XMMRegister(rnum)); 3424 } 3425 load_key(xmm_temp, key, 0xe0); 3426 __ aesenclast(xmm_result, xmm_temp); 3427 __ movdqu(Address(to, pos, Address::times_1, 0), xmm_result); // store into the next 16 bytes of output 3428 // no need to store r to memory until we exit 3429 __ addptr(pos, AESBlockSize); 3430 __ subptr(len_reg, AESBlockSize); 3431 __ jcc(Assembler::notEqual, L_loopTop_256); 3432 __ jmp(L_exit); 3433 3434 return start; 3435 } 3436 3437 // Safefetch stubs. 3438 void generate_safefetch(const char* name, int size, address* entry, 3439 address* fault_pc, address* continuation_pc) { 3440 // safefetch signatures: 3441 // int SafeFetch32(int* adr, int errValue); 3442 // intptr_t SafeFetchN (intptr_t* adr, intptr_t errValue); 3443 // 3444 // arguments: 3445 // c_rarg0 = adr 3446 // c_rarg1 = errValue 3447 // 3448 // result: 3449 // PPC_RET = *adr or errValue 3450 3451 StubCodeMark mark(this, "StubRoutines", name); 3452 3453 // Entry point, pc or function descriptor. 3454 *entry = __ pc(); 3455 3456 // Load *adr into c_rarg1, may fault. 3457 *fault_pc = __ pc(); 3458 switch (size) { 3459 case 4: 3460 // int32_t 3461 __ movl(c_rarg1, Address(c_rarg0, 0)); 3462 break; 3463 case 8: 3464 // int64_t 3465 __ movq(c_rarg1, Address(c_rarg0, 0)); 3466 break; 3467 default: 3468 ShouldNotReachHere(); 3469 } 3470 3471 // return errValue or *adr 3472 *continuation_pc = __ pc(); 3473 __ movq(rax, c_rarg1); 3474 __ ret(0); 3475 } 3476 3477 // This is a version of CBC/AES Decrypt which does 4 blocks in a loop at a time 3478 // to hide instruction latency 3479 // 3480 // Arguments: 3481 // 3482 // Inputs: 3483 // c_rarg0 - source byte array address 3484 // c_rarg1 - destination byte array address 3485 // c_rarg2 - K (key) in little endian int array 3486 // c_rarg3 - r vector byte array address 3487 // c_rarg4 - input length 3488 // 3489 // Output: 3490 // rax - input length 3491 // 3492 3493 address generate_cipherBlockChaining_decryptAESCrypt_Parallel() { 3494 assert(UseAES, "need AES instructions and misaligned SSE support"); 3495 __ align(CodeEntryAlignment); 3496 StubCodeMark mark(this, "StubRoutines", "cipherBlockChaining_decryptAESCrypt"); 3497 address start = __ pc(); 3498 3499 Label L_exit, L_key_192_256, L_key_256; 3500 Label L_singleBlock_loopTop_128, L_multiBlock_loopTop_128; 3501 Label L_singleBlock_loopTop_192, L_singleBlock_loopTop_256; 3502 const Register from = c_rarg0; // source array address 3503 const Register to = c_rarg1; // destination array address 3504 const Register key = c_rarg2; // key array address 3505 const Register rvec = c_rarg3; // r byte array initialized from initvector array address 3506 // and left with the results of the last encryption block 3507 #ifndef _WIN64 3508 const Register len_reg = c_rarg4; // src len (must be multiple of blocksize 16) 3509 #else 3510 const Address len_mem(rbp, 6 * wordSize); // length is on stack on Win64 3511 const Register len_reg = r10; // pick the first volatile windows register 3512 #endif 3513 const Register pos = rax; 3514 3515 // keys 0-10 preloaded into xmm2-xmm12 3516 const int XMM_REG_NUM_KEY_FIRST = 5; 3517 const int XMM_REG_NUM_KEY_LAST = 15; 3518 const XMMRegister xmm_key_first = as_XMMRegister(XMM_REG_NUM_KEY_FIRST); 3519 const XMMRegister xmm_key_last = as_XMMRegister(XMM_REG_NUM_KEY_LAST); 3520 3521 __ enter(); // required for proper stackwalking of RuntimeStub frame 3522 3523 // For EVEX with VL and BW, provide a standard mask, VL = 128 will guide the merge 3524 // context for the registers used, where all instructions below are using 128-bit mode 3525 // On EVEX without VL and BW, these instructions will all be AVX. 3526 if (VM_Version::supports_avx512vlbw()) { 3527 __ movl(rax, 0xffff); 3528 __ kmovql(k1, rax); 3529 } 3530 3531 #ifdef _WIN64 3532 // on win64, fill len_reg from stack position 3533 __ movl(len_reg, len_mem); 3534 // save the xmm registers which must be preserved 6-15 3535 __ subptr(rsp, -rsp_after_call_off * wordSize); 3536 for (int i = 6; i <= XMM_REG_NUM_KEY_LAST; i++) { 3537 __ movdqu(xmm_save(i), as_XMMRegister(i)); 3538 } 3539 #else 3540 __ push(len_reg); // Save 3541 #endif 3542 3543 // the java expanded key ordering is rotated one position from what we want 3544 // so we start from 0x10 here and hit 0x00 last 3545 const XMMRegister xmm_key_shuf_mask = xmm1; // used temporarily to swap key bytes up front 3546 __ movdqu(xmm_key_shuf_mask, ExternalAddress(StubRoutines::x86::key_shuffle_mask_addr())); 3547 // load up xmm regs 5 thru 15 with key 0x10 - 0xa0 - 0x00 3548 for (int rnum = XMM_REG_NUM_KEY_FIRST, offset = 0x10; rnum < XMM_REG_NUM_KEY_LAST; rnum++) { 3549 load_key(as_XMMRegister(rnum), key, offset, xmm_key_shuf_mask); 3550 offset += 0x10; 3551 } 3552 load_key(xmm_key_last, key, 0x00, xmm_key_shuf_mask); 3553 3554 const XMMRegister xmm_prev_block_cipher = xmm1; // holds cipher of previous block 3555 3556 // registers holding the four results in the parallelized loop 3557 const XMMRegister xmm_result0 = xmm0; 3558 const XMMRegister xmm_result1 = xmm2; 3559 const XMMRegister xmm_result2 = xmm3; 3560 const XMMRegister xmm_result3 = xmm4; 3561 3562 __ movdqu(xmm_prev_block_cipher, Address(rvec, 0x00)); // initialize with initial rvec 3563 3564 // now split to different paths depending on the keylen (len in ints of AESCrypt.KLE array (52=192, or 60=256)) 3565 __ movl(rax, Address(key, arrayOopDesc::length_offset_in_bytes() - arrayOopDesc::base_offset_in_bytes(T_INT))); 3566 __ cmpl(rax, 44); 3567 __ jcc(Assembler::notEqual, L_key_192_256); 3568 3569 3570 // 128-bit code follows here, parallelized 3571 __ movptr(pos, 0); 3572 __ align(OptoLoopAlignment); 3573 __ BIND(L_multiBlock_loopTop_128); 3574 __ cmpptr(len_reg, 4*AESBlockSize); // see if at least 4 blocks left 3575 __ jcc(Assembler::less, L_singleBlock_loopTop_128); 3576 3577 __ movdqu(xmm_result0, Address(from, pos, Address::times_1, 0*AESBlockSize)); // get next 4 blocks into xmmresult registers 3578 __ movdqu(xmm_result1, Address(from, pos, Address::times_1, 1*AESBlockSize)); 3579 __ movdqu(xmm_result2, Address(from, pos, Address::times_1, 2*AESBlockSize)); 3580 __ movdqu(xmm_result3, Address(from, pos, Address::times_1, 3*AESBlockSize)); 3581 3582 #define DoFour(opc, src_reg) \ 3583 __ opc(xmm_result0, src_reg); \ 3584 __ opc(xmm_result1, src_reg); \ 3585 __ opc(xmm_result2, src_reg); \ 3586 __ opc(xmm_result3, src_reg); 3587 3588 DoFour(pxor, xmm_key_first); 3589 for (int rnum = XMM_REG_NUM_KEY_FIRST + 1; rnum <= XMM_REG_NUM_KEY_LAST - 1; rnum++) { 3590 DoFour(aesdec, as_XMMRegister(rnum)); 3591 } 3592 DoFour(aesdeclast, xmm_key_last); 3593 // for each result, xor with the r vector of previous cipher block 3594 __ pxor(xmm_result0, xmm_prev_block_cipher); 3595 __ movdqu(xmm_prev_block_cipher, Address(from, pos, Address::times_1, 0*AESBlockSize)); 3596 __ pxor(xmm_result1, xmm_prev_block_cipher); 3597 __ movdqu(xmm_prev_block_cipher, Address(from, pos, Address::times_1, 1*AESBlockSize)); 3598 __ pxor(xmm_result2, xmm_prev_block_cipher); 3599 __ movdqu(xmm_prev_block_cipher, Address(from, pos, Address::times_1, 2*AESBlockSize)); 3600 __ pxor(xmm_result3, xmm_prev_block_cipher); 3601 __ movdqu(xmm_prev_block_cipher, Address(from, pos, Address::times_1, 3*AESBlockSize)); // this will carry over to next set of blocks 3602 3603 __ movdqu(Address(to, pos, Address::times_1, 0*AESBlockSize), xmm_result0); // store 4 results into the next 64 bytes of output 3604 __ movdqu(Address(to, pos, Address::times_1, 1*AESBlockSize), xmm_result1); 3605 __ movdqu(Address(to, pos, Address::times_1, 2*AESBlockSize), xmm_result2); 3606 __ movdqu(Address(to, pos, Address::times_1, 3*AESBlockSize), xmm_result3); 3607 3608 __ addptr(pos, 4*AESBlockSize); 3609 __ subptr(len_reg, 4*AESBlockSize); 3610 __ jmp(L_multiBlock_loopTop_128); 3611 3612 // registers used in the non-parallelized loops 3613 // xmm register assignments for the loops below 3614 const XMMRegister xmm_result = xmm0; 3615 const XMMRegister xmm_prev_block_cipher_save = xmm2; 3616 const XMMRegister xmm_key11 = xmm3; 3617 const XMMRegister xmm_key12 = xmm4; 3618 const XMMRegister xmm_temp = xmm4; 3619 3620 __ align(OptoLoopAlignment); 3621 __ BIND(L_singleBlock_loopTop_128); 3622 __ cmpptr(len_reg, 0); // any blocks left?? 3623 __ jcc(Assembler::equal, L_exit); 3624 __ movdqu(xmm_result, Address(from, pos, Address::times_1, 0)); // get next 16 bytes of cipher input 3625 __ movdqa(xmm_prev_block_cipher_save, xmm_result); // save for next r vector 3626 __ pxor (xmm_result, xmm_key_first); // do the aes dec rounds 3627 for (int rnum = XMM_REG_NUM_KEY_FIRST + 1; rnum <= XMM_REG_NUM_KEY_LAST - 1; rnum++) { 3628 __ aesdec(xmm_result, as_XMMRegister(rnum)); 3629 } 3630 __ aesdeclast(xmm_result, xmm_key_last); 3631 __ pxor (xmm_result, xmm_prev_block_cipher); // xor with the current r vector 3632 __ movdqu(Address(to, pos, Address::times_1, 0), xmm_result); // store into the next 16 bytes of output 3633 // no need to store r to memory until we exit 3634 __ movdqa(xmm_prev_block_cipher, xmm_prev_block_cipher_save); // set up next r vector with cipher input from this block 3635 3636 __ addptr(pos, AESBlockSize); 3637 __ subptr(len_reg, AESBlockSize); 3638 __ jmp(L_singleBlock_loopTop_128); 3639 3640 3641 __ BIND(L_exit); 3642 __ movdqu(Address(rvec, 0), xmm_prev_block_cipher); // final value of r stored in rvec of CipherBlockChaining object 3643 #ifdef _WIN64 3644 // restore regs belonging to calling function 3645 for (int i = 6; i <= XMM_REG_NUM_KEY_LAST; i++) { 3646 __ movdqu(as_XMMRegister(i), xmm_save(i)); 3647 } 3648 __ movl(rax, len_mem); 3649 #else 3650 __ pop(rax); // return length 3651 #endif 3652 __ leave(); // required for proper stackwalking of RuntimeStub frame 3653 __ ret(0); 3654 3655 3656 __ BIND(L_key_192_256); 3657 // here rax = len in ints of AESCrypt.KLE array (52=192, or 60=256) 3658 load_key(xmm_key11, key, 0xb0); 3659 __ cmpl(rax, 52); 3660 __ jcc(Assembler::notEqual, L_key_256); 3661 3662 // 192-bit code follows here (could be optimized to use parallelism) 3663 load_key(xmm_key12, key, 0xc0); // 192-bit key goes up to c0 3664 __ movptr(pos, 0); 3665 __ align(OptoLoopAlignment); 3666 3667 __ BIND(L_singleBlock_loopTop_192); 3668 __ movdqu(xmm_result, Address(from, pos, Address::times_1, 0)); // get next 16 bytes of cipher input 3669 __ movdqa(xmm_prev_block_cipher_save, xmm_result); // save for next r vector 3670 __ pxor (xmm_result, xmm_key_first); // do the aes dec rounds 3671 for (int rnum = XMM_REG_NUM_KEY_FIRST + 1; rnum <= XMM_REG_NUM_KEY_LAST - 1; rnum++) { 3672 __ aesdec(xmm_result, as_XMMRegister(rnum)); 3673 } 3674 __ aesdec(xmm_result, xmm_key11); 3675 __ aesdec(xmm_result, xmm_key12); 3676 __ aesdeclast(xmm_result, xmm_key_last); // xmm15 always came from key+0 3677 __ pxor (xmm_result, xmm_prev_block_cipher); // xor with the current r vector 3678 __ movdqu(Address(to, pos, Address::times_1, 0), xmm_result); // store into the next 16 bytes of output 3679 // no need to store r to memory until we exit 3680 __ movdqa(xmm_prev_block_cipher, xmm_prev_block_cipher_save); // set up next r vector with cipher input from this block 3681 __ addptr(pos, AESBlockSize); 3682 __ subptr(len_reg, AESBlockSize); 3683 __ jcc(Assembler::notEqual,L_singleBlock_loopTop_192); 3684 __ jmp(L_exit); 3685 3686 __ BIND(L_key_256); 3687 // 256-bit code follows here (could be optimized to use parallelism) 3688 __ movptr(pos, 0); 3689 __ align(OptoLoopAlignment); 3690 3691 __ BIND(L_singleBlock_loopTop_256); 3692 __ movdqu(xmm_result, Address(from, pos, Address::times_1, 0)); // get next 16 bytes of cipher input 3693 __ movdqa(xmm_prev_block_cipher_save, xmm_result); // save for next r vector 3694 __ pxor (xmm_result, xmm_key_first); // do the aes dec rounds 3695 for (int rnum = XMM_REG_NUM_KEY_FIRST + 1; rnum <= XMM_REG_NUM_KEY_LAST - 1; rnum++) { 3696 __ aesdec(xmm_result, as_XMMRegister(rnum)); 3697 } 3698 __ aesdec(xmm_result, xmm_key11); 3699 load_key(xmm_temp, key, 0xc0); 3700 __ aesdec(xmm_result, xmm_temp); 3701 load_key(xmm_temp, key, 0xd0); 3702 __ aesdec(xmm_result, xmm_temp); 3703 load_key(xmm_temp, key, 0xe0); // 256-bit key goes up to e0 3704 __ aesdec(xmm_result, xmm_temp); 3705 __ aesdeclast(xmm_result, xmm_key_last); // xmm15 came from key+0 3706 __ pxor (xmm_result, xmm_prev_block_cipher); // xor with the current r vector 3707 __ movdqu(Address(to, pos, Address::times_1, 0), xmm_result); // store into the next 16 bytes of output 3708 // no need to store r to memory until we exit 3709 __ movdqa(xmm_prev_block_cipher, xmm_prev_block_cipher_save); // set up next r vector with cipher input from this block 3710 __ addptr(pos, AESBlockSize); 3711 __ subptr(len_reg, AESBlockSize); 3712 __ jcc(Assembler::notEqual,L_singleBlock_loopTop_256); 3713 __ jmp(L_exit); 3714 3715 return start; 3716 } 3717 3718 3719 // byte swap x86 long 3720 address generate_ghash_long_swap_mask() { 3721 __ align(CodeEntryAlignment); 3722 StubCodeMark mark(this, "StubRoutines", "ghash_long_swap_mask"); 3723 address start = __ pc(); 3724 __ emit_data64(0x0f0e0d0c0b0a0908, relocInfo::none ); 3725 __ emit_data64(0x0706050403020100, relocInfo::none ); 3726 return start; 3727 } 3728 3729 // byte swap x86 byte array 3730 address generate_ghash_byte_swap_mask() { 3731 __ align(CodeEntryAlignment); 3732 StubCodeMark mark(this, "StubRoutines", "ghash_byte_swap_mask"); 3733 address start = __ pc(); 3734 __ emit_data64(0x08090a0b0c0d0e0f, relocInfo::none ); 3735 __ emit_data64(0x0001020304050607, relocInfo::none ); 3736 return start; 3737 } 3738 3739 /* Single and multi-block ghash operations */ 3740 address generate_ghash_processBlocks() { 3741 __ align(CodeEntryAlignment); 3742 Label L_ghash_loop, L_exit; 3743 StubCodeMark mark(this, "StubRoutines", "ghash_processBlocks"); 3744 address start = __ pc(); 3745 3746 const Register state = c_rarg0; 3747 const Register subkeyH = c_rarg1; 3748 const Register data = c_rarg2; 3749 const Register blocks = c_rarg3; 3750 3751 #ifdef _WIN64 3752 const int XMM_REG_LAST = 10; 3753 #endif 3754 3755 const XMMRegister xmm_temp0 = xmm0; 3756 const XMMRegister xmm_temp1 = xmm1; 3757 const XMMRegister xmm_temp2 = xmm2; 3758 const XMMRegister xmm_temp3 = xmm3; 3759 const XMMRegister xmm_temp4 = xmm4; 3760 const XMMRegister xmm_temp5 = xmm5; 3761 const XMMRegister xmm_temp6 = xmm6; 3762 const XMMRegister xmm_temp7 = xmm7; 3763 const XMMRegister xmm_temp8 = xmm8; 3764 const XMMRegister xmm_temp9 = xmm9; 3765 const XMMRegister xmm_temp10 = xmm10; 3766 3767 __ enter(); 3768 3769 // For EVEX with VL and BW, provide a standard mask, VL = 128 will guide the merge 3770 // context for the registers used, where all instructions below are using 128-bit mode 3771 // On EVEX without VL and BW, these instructions will all be AVX. 3772 if (VM_Version::supports_avx512vlbw()) { 3773 __ movl(rax, 0xffff); 3774 __ kmovql(k1, rax); 3775 } 3776 3777 #ifdef _WIN64 3778 // save the xmm registers which must be preserved 6-10 3779 __ subptr(rsp, -rsp_after_call_off * wordSize); 3780 for (int i = 6; i <= XMM_REG_LAST; i++) { 3781 __ movdqu(xmm_save(i), as_XMMRegister(i)); 3782 } 3783 #endif 3784 3785 __ movdqu(xmm_temp10, ExternalAddress(StubRoutines::x86::ghash_long_swap_mask_addr())); 3786 3787 __ movdqu(xmm_temp0, Address(state, 0)); 3788 __ pshufb(xmm_temp0, xmm_temp10); 3789 3790 3791 __ BIND(L_ghash_loop); 3792 __ movdqu(xmm_temp2, Address(data, 0)); 3793 __ pshufb(xmm_temp2, ExternalAddress(StubRoutines::x86::ghash_byte_swap_mask_addr())); 3794 3795 __ movdqu(xmm_temp1, Address(subkeyH, 0)); 3796 __ pshufb(xmm_temp1, xmm_temp10); 3797 3798 __ pxor(xmm_temp0, xmm_temp2); 3799 3800 // 3801 // Multiply with the hash key 3802 // 3803 __ movdqu(xmm_temp3, xmm_temp0); 3804 __ pclmulqdq(xmm_temp3, xmm_temp1, 0); // xmm3 holds a0*b0 3805 __ movdqu(xmm_temp4, xmm_temp0); 3806 __ pclmulqdq(xmm_temp4, xmm_temp1, 16); // xmm4 holds a0*b1 3807 3808 __ movdqu(xmm_temp5, xmm_temp0); 3809 __ pclmulqdq(xmm_temp5, xmm_temp1, 1); // xmm5 holds a1*b0 3810 __ movdqu(xmm_temp6, xmm_temp0); 3811 __ pclmulqdq(xmm_temp6, xmm_temp1, 17); // xmm6 holds a1*b1 3812 3813 __ pxor(xmm_temp4, xmm_temp5); // xmm4 holds a0*b1 + a1*b0 3814 3815 __ movdqu(xmm_temp5, xmm_temp4); // move the contents of xmm4 to xmm5 3816 __ psrldq(xmm_temp4, 8); // shift by xmm4 64 bits to the right 3817 __ pslldq(xmm_temp5, 8); // shift by xmm5 64 bits to the left 3818 __ pxor(xmm_temp3, xmm_temp5); 3819 __ pxor(xmm_temp6, xmm_temp4); // Register pair <xmm6:xmm3> holds the result 3820 // of the carry-less multiplication of 3821 // xmm0 by xmm1. 3822 3823 // We shift the result of the multiplication by one bit position 3824 // to the left to cope for the fact that the bits are reversed. 3825 __ movdqu(xmm_temp7, xmm_temp3); 3826 __ movdqu(xmm_temp8, xmm_temp6); 3827 __ pslld(xmm_temp3, 1); 3828 __ pslld(xmm_temp6, 1); 3829 __ psrld(xmm_temp7, 31); 3830 __ psrld(xmm_temp8, 31); 3831 __ movdqu(xmm_temp9, xmm_temp7); 3832 __ pslldq(xmm_temp8, 4); 3833 __ pslldq(xmm_temp7, 4); 3834 __ psrldq(xmm_temp9, 12); 3835 __ por(xmm_temp3, xmm_temp7); 3836 __ por(xmm_temp6, xmm_temp8); 3837 __ por(xmm_temp6, xmm_temp9); 3838 3839 // 3840 // First phase of the reduction 3841 // 3842 // Move xmm3 into xmm7, xmm8, xmm9 in order to perform the shifts 3843 // independently. 3844 __ movdqu(xmm_temp7, xmm_temp3); 3845 __ movdqu(xmm_temp8, xmm_temp3); 3846 __ movdqu(xmm_temp9, xmm_temp3); 3847 __ pslld(xmm_temp7, 31); // packed right shift shifting << 31 3848 __ pslld(xmm_temp8, 30); // packed right shift shifting << 30 3849 __ pslld(xmm_temp9, 25); // packed right shift shifting << 25 3850 __ pxor(xmm_temp7, xmm_temp8); // xor the shifted versions 3851 __ pxor(xmm_temp7, xmm_temp9); 3852 __ movdqu(xmm_temp8, xmm_temp7); 3853 __ pslldq(xmm_temp7, 12); 3854 __ psrldq(xmm_temp8, 4); 3855 __ pxor(xmm_temp3, xmm_temp7); // first phase of the reduction complete 3856 3857 // 3858 // Second phase of the reduction 3859 // 3860 // Make 3 copies of xmm3 in xmm2, xmm4, xmm5 for doing these 3861 // shift operations. 3862 __ movdqu(xmm_temp2, xmm_temp3); 3863 __ movdqu(xmm_temp4, xmm_temp3); 3864 __ movdqu(xmm_temp5, xmm_temp3); 3865 __ psrld(xmm_temp2, 1); // packed left shifting >> 1 3866 __ psrld(xmm_temp4, 2); // packed left shifting >> 2 3867 __ psrld(xmm_temp5, 7); // packed left shifting >> 7 3868 __ pxor(xmm_temp2, xmm_temp4); // xor the shifted versions 3869 __ pxor(xmm_temp2, xmm_temp5); 3870 __ pxor(xmm_temp2, xmm_temp8); 3871 __ pxor(xmm_temp3, xmm_temp2); 3872 __ pxor(xmm_temp6, xmm_temp3); // the result is in xmm6 3873 3874 __ decrement(blocks); 3875 __ jcc(Assembler::zero, L_exit); 3876 __ movdqu(xmm_temp0, xmm_temp6); 3877 __ addptr(data, 16); 3878 __ jmp(L_ghash_loop); 3879 3880 __ BIND(L_exit); 3881 __ pshufb(xmm_temp6, xmm_temp10); // Byte swap 16-byte result 3882 __ movdqu(Address(state, 0), xmm_temp6); // store the result 3883 3884 #ifdef _WIN64 3885 // restore xmm regs belonging to calling function 3886 for (int i = 6; i <= XMM_REG_LAST; i++) { 3887 __ movdqu(as_XMMRegister(i), xmm_save(i)); 3888 } 3889 #endif 3890 __ leave(); 3891 __ ret(0); 3892 return start; 3893 } 3894 3895 /** 3896 * Arguments: 3897 * 3898 * Inputs: 3899 * c_rarg0 - int crc 3900 * c_rarg1 - byte* buf 3901 * c_rarg2 - int length 3902 * 3903 * Ouput: 3904 * rax - int crc result 3905 */ 3906 address generate_updateBytesCRC32() { 3907 assert(UseCRC32Intrinsics, "need AVX and CLMUL instructions"); 3908 3909 __ align(CodeEntryAlignment); 3910 StubCodeMark mark(this, "StubRoutines", "updateBytesCRC32"); 3911 3912 address start = __ pc(); 3913 // Win64: rcx, rdx, r8, r9 (c_rarg0, c_rarg1, ...) 3914 // Unix: rdi, rsi, rdx, rcx, r8, r9 (c_rarg0, c_rarg1, ...) 3915 // rscratch1: r10 3916 const Register crc = c_rarg0; // crc 3917 const Register buf = c_rarg1; // source java byte array address 3918 const Register len = c_rarg2; // length 3919 const Register table = c_rarg3; // crc_table address (reuse register) 3920 const Register tmp = r11; 3921 assert_different_registers(crc, buf, len, table, tmp, rax); 3922 3923 BLOCK_COMMENT("Entry:"); 3924 __ enter(); // required for proper stackwalking of RuntimeStub frame 3925 3926 __ kernel_crc32(crc, buf, len, table, tmp); 3927 3928 __ movl(rax, crc); 3929 __ leave(); // required for proper stackwalking of RuntimeStub frame 3930 __ ret(0); 3931 3932 return start; 3933 } 3934 3935 /** 3936 * Arguments: 3937 * 3938 * Inputs: 3939 * c_rarg0 - int crc 3940 * c_rarg1 - byte* buf 3941 * c_rarg2 - long length 3942 * c_rarg3 - table_start - optional (present only when doing a library_calll, 3943 * not used by x86 algorithm) 3944 * 3945 * Ouput: 3946 * rax - int crc result 3947 */ 3948 address generate_updateBytesCRC32C(bool is_pclmulqdq_supported) { 3949 assert(UseCRC32CIntrinsics, "need SSE4_2"); 3950 __ align(CodeEntryAlignment); 3951 StubCodeMark mark(this, "StubRoutines", "updateBytesCRC32C"); 3952 address start = __ pc(); 3953 //reg.arg int#0 int#1 int#2 int#3 int#4 int#5 float regs 3954 //Windows RCX RDX R8 R9 none none XMM0..XMM3 3955 //Lin / Sol RDI RSI RDX RCX R8 R9 XMM0..XMM7 3956 const Register crc = c_rarg0; // crc 3957 const Register buf = c_rarg1; // source java byte array address 3958 const Register len = c_rarg2; // length 3959 const Register a = rax; 3960 const Register j = r9; 3961 const Register k = r10; 3962 const Register l = r11; 3963 #ifdef _WIN64 3964 const Register y = rdi; 3965 const Register z = rsi; 3966 #else 3967 const Register y = rcx; 3968 const Register z = r8; 3969 #endif 3970 assert_different_registers(crc, buf, len, a, j, k, l, y, z); 3971 3972 BLOCK_COMMENT("Entry:"); 3973 __ enter(); // required for proper stackwalking of RuntimeStub frame 3974 #ifdef _WIN64 3975 __ push(y); 3976 __ push(z); 3977 #endif 3978 __ crc32c_ipl_alg2_alt2(crc, buf, len, 3979 a, j, k, 3980 l, y, z, 3981 c_farg0, c_farg1, c_farg2, 3982 is_pclmulqdq_supported); 3983 __ movl(rax, crc); 3984 #ifdef _WIN64 3985 __ pop(z); 3986 __ pop(y); 3987 #endif 3988 __ leave(); // required for proper stackwalking of RuntimeStub frame 3989 __ ret(0); 3990 3991 return start; 3992 } 3993 3994 /** 3995 * Arguments: 3996 * 3997 * Input: 3998 * c_rarg0 - x address 3999 * c_rarg1 - x length 4000 * c_rarg2 - y address 4001 * c_rarg3 - y lenth 4002 * not Win64 4003 * c_rarg4 - z address 4004 * c_rarg5 - z length 4005 * Win64 4006 * rsp+40 - z address 4007 * rsp+48 - z length 4008 */ 4009 address generate_multiplyToLen() { 4010 __ align(CodeEntryAlignment); 4011 StubCodeMark mark(this, "StubRoutines", "multiplyToLen"); 4012 4013 address start = __ pc(); 4014 // Win64: rcx, rdx, r8, r9 (c_rarg0, c_rarg1, ...) 4015 // Unix: rdi, rsi, rdx, rcx, r8, r9 (c_rarg0, c_rarg1, ...) 4016 const Register x = rdi; 4017 const Register xlen = rax; 4018 const Register y = rsi; 4019 const Register ylen = rcx; 4020 const Register z = r8; 4021 const Register zlen = r11; 4022 4023 // Next registers will be saved on stack in multiply_to_len(). 4024 const Register tmp1 = r12; 4025 const Register tmp2 = r13; 4026 const Register tmp3 = r14; 4027 const Register tmp4 = r15; 4028 const Register tmp5 = rbx; 4029 4030 BLOCK_COMMENT("Entry:"); 4031 __ enter(); // required for proper stackwalking of RuntimeStub frame 4032 4033 #ifndef _WIN64 4034 __ movptr(zlen, r9); // Save r9 in r11 - zlen 4035 #endif 4036 setup_arg_regs(4); // x => rdi, xlen => rsi, y => rdx 4037 // ylen => rcx, z => r8, zlen => r11 4038 // r9 and r10 may be used to save non-volatile registers 4039 #ifdef _WIN64 4040 // last 2 arguments (#4, #5) are on stack on Win64 4041 __ movptr(z, Address(rsp, 6 * wordSize)); 4042 __ movptr(zlen, Address(rsp, 7 * wordSize)); 4043 #endif 4044 4045 __ movptr(xlen, rsi); 4046 __ movptr(y, rdx); 4047 __ multiply_to_len(x, xlen, y, ylen, z, zlen, tmp1, tmp2, tmp3, tmp4, tmp5); 4048 4049 restore_arg_regs(); 4050 4051 __ leave(); // required for proper stackwalking of RuntimeStub frame 4052 __ ret(0); 4053 4054 return start; 4055 } 4056 4057 /** 4058 * Arguments: 4059 * 4060 // Input: 4061 // c_rarg0 - x address 4062 // c_rarg1 - x length 4063 // c_rarg2 - z address 4064 // c_rarg3 - z lenth 4065 * 4066 */ 4067 address generate_squareToLen() { 4068 4069 __ align(CodeEntryAlignment); 4070 StubCodeMark mark(this, "StubRoutines", "squareToLen"); 4071 4072 address start = __ pc(); 4073 // Win64: rcx, rdx, r8, r9 (c_rarg0, c_rarg1, ...) 4074 // Unix: rdi, rsi, rdx, rcx (c_rarg0, c_rarg1, ...) 4075 const Register x = rdi; 4076 const Register len = rsi; 4077 const Register z = r8; 4078 const Register zlen = rcx; 4079 4080 const Register tmp1 = r12; 4081 const Register tmp2 = r13; 4082 const Register tmp3 = r14; 4083 const Register tmp4 = r15; 4084 const Register tmp5 = rbx; 4085 4086 BLOCK_COMMENT("Entry:"); 4087 __ enter(); // required for proper stackwalking of RuntimeStub frame 4088 4089 setup_arg_regs(4); // x => rdi, len => rsi, z => rdx 4090 // zlen => rcx 4091 // r9 and r10 may be used to save non-volatile registers 4092 __ movptr(r8, rdx); 4093 __ square_to_len(x, len, z, zlen, tmp1, tmp2, tmp3, tmp4, tmp5, rdx, rax); 4094 4095 restore_arg_regs(); 4096 4097 __ leave(); // required for proper stackwalking of RuntimeStub frame 4098 __ ret(0); 4099 4100 return start; 4101 } 4102 4103 /** 4104 * Arguments: 4105 * 4106 * Input: 4107 * c_rarg0 - out address 4108 * c_rarg1 - in address 4109 * c_rarg2 - offset 4110 * c_rarg3 - len 4111 * not Win64 4112 * c_rarg4 - k 4113 * Win64 4114 * rsp+40 - k 4115 */ 4116 address generate_mulAdd() { 4117 __ align(CodeEntryAlignment); 4118 StubCodeMark mark(this, "StubRoutines", "mulAdd"); 4119 4120 address start = __ pc(); 4121 // Win64: rcx, rdx, r8, r9 (c_rarg0, c_rarg1, ...) 4122 // Unix: rdi, rsi, rdx, rcx, r8, r9 (c_rarg0, c_rarg1, ...) 4123 const Register out = rdi; 4124 const Register in = rsi; 4125 const Register offset = r11; 4126 const Register len = rcx; 4127 const Register k = r8; 4128 4129 // Next registers will be saved on stack in mul_add(). 4130 const Register tmp1 = r12; 4131 const Register tmp2 = r13; 4132 const Register tmp3 = r14; 4133 const Register tmp4 = r15; 4134 const Register tmp5 = rbx; 4135 4136 BLOCK_COMMENT("Entry:"); 4137 __ enter(); // required for proper stackwalking of RuntimeStub frame 4138 4139 setup_arg_regs(4); // out => rdi, in => rsi, offset => rdx 4140 // len => rcx, k => r8 4141 // r9 and r10 may be used to save non-volatile registers 4142 #ifdef _WIN64 4143 // last argument is on stack on Win64 4144 __ movl(k, Address(rsp, 6 * wordSize)); 4145 #endif 4146 __ movptr(r11, rdx); // move offset in rdx to offset(r11) 4147 __ mul_add(out, in, offset, len, k, tmp1, tmp2, tmp3, tmp4, tmp5, rdx, rax); 4148 4149 restore_arg_regs(); 4150 4151 __ leave(); // required for proper stackwalking of RuntimeStub frame 4152 __ ret(0); 4153 4154 return start; 4155 } 4156 4157 address generate_libmExp() { 4158 address start = __ pc(); 4159 4160 const XMMRegister x0 = xmm0; 4161 const XMMRegister x1 = xmm1; 4162 const XMMRegister x2 = xmm2; 4163 const XMMRegister x3 = xmm3; 4164 4165 const XMMRegister x4 = xmm4; 4166 const XMMRegister x5 = xmm5; 4167 const XMMRegister x6 = xmm6; 4168 const XMMRegister x7 = xmm7; 4169 4170 const Register tmp = r11; 4171 4172 BLOCK_COMMENT("Entry:"); 4173 __ enter(); // required for proper stackwalking of RuntimeStub frame 4174 4175 #ifdef _WIN64 4176 // save the xmm registers which must be preserved 6-7 4177 __ subptr(rsp, 4 * wordSize); 4178 __ movdqu(Address(rsp, 0), xmm6); 4179 __ movdqu(Address(rsp, 2 * wordSize), xmm7); 4180 #endif 4181 __ fast_exp(x0, x1, x2, x3, x4, x5, x6, x7, rax, rcx, rdx, tmp); 4182 4183 #ifdef _WIN64 4184 // restore xmm regs belonging to calling function 4185 __ movdqu(xmm6, Address(rsp, 0)); 4186 __ movdqu(xmm7, Address(rsp, 2 * wordSize)); 4187 __ addptr(rsp, 4 * wordSize); 4188 #endif 4189 4190 __ leave(); // required for proper stackwalking of RuntimeStub frame 4191 __ ret(0); 4192 4193 return start; 4194 4195 } 4196 4197 address generate_libmLog() { 4198 address start = __ pc(); 4199 4200 const XMMRegister x0 = xmm0; 4201 const XMMRegister x1 = xmm1; 4202 const XMMRegister x2 = xmm2; 4203 const XMMRegister x3 = xmm3; 4204 4205 const XMMRegister x4 = xmm4; 4206 const XMMRegister x5 = xmm5; 4207 const XMMRegister x6 = xmm6; 4208 const XMMRegister x7 = xmm7; 4209 4210 const Register tmp1 = r11; 4211 const Register tmp2 = r8; 4212 4213 BLOCK_COMMENT("Entry:"); 4214 __ enter(); // required for proper stackwalking of RuntimeStub frame 4215 4216 #ifdef _WIN64 4217 // save the xmm registers which must be preserved 6-7 4218 __ subptr(rsp, 4 * wordSize); 4219 __ movdqu(Address(rsp, 0), xmm6); 4220 __ movdqu(Address(rsp, 2 * wordSize), xmm7); 4221 #endif 4222 __ fast_log(x0, x1, x2, x3, x4, x5, x6, x7, rax, rcx, rdx, tmp1, tmp2); 4223 4224 #ifdef _WIN64 4225 // restore xmm regs belonging to calling function 4226 __ movdqu(xmm6, Address(rsp, 0)); 4227 __ movdqu(xmm7, Address(rsp, 2 * wordSize)); 4228 __ addptr(rsp, 4 * wordSize); 4229 #endif 4230 4231 __ leave(); // required for proper stackwalking of RuntimeStub frame 4232 __ ret(0); 4233 4234 return start; 4235 4236 } 4237 4238 4239 #undef __ 4240 #define __ masm-> 4241 4242 // Continuation point for throwing of implicit exceptions that are 4243 // not handled in the current activation. Fabricates an exception 4244 // oop and initiates normal exception dispatching in this 4245 // frame. Since we need to preserve callee-saved values (currently 4246 // only for C2, but done for C1 as well) we need a callee-saved oop 4247 // map and therefore have to make these stubs into RuntimeStubs 4248 // rather than BufferBlobs. If the compiler needs all registers to 4249 // be preserved between the fault point and the exception handler 4250 // then it must assume responsibility for that in 4251 // AbstractCompiler::continuation_for_implicit_null_exception or 4252 // continuation_for_implicit_division_by_zero_exception. All other 4253 // implicit exceptions (e.g., NullPointerException or 4254 // AbstractMethodError on entry) are either at call sites or 4255 // otherwise assume that stack unwinding will be initiated, so 4256 // caller saved registers were assumed volatile in the compiler. 4257 address generate_throw_exception(const char* name, 4258 address runtime_entry, 4259 Register arg1 = noreg, 4260 Register arg2 = noreg) { 4261 // Information about frame layout at time of blocking runtime call. 4262 // Note that we only have to preserve callee-saved registers since 4263 // the compilers are responsible for supplying a continuation point 4264 // if they expect all registers to be preserved. 4265 enum layout { 4266 rbp_off = frame::arg_reg_save_area_bytes/BytesPerInt, 4267 rbp_off2, 4268 return_off, 4269 return_off2, 4270 framesize // inclusive of return address 4271 }; 4272 4273 int insts_size = 512; 4274 int locs_size = 64; 4275 4276 CodeBuffer code(name, insts_size, locs_size); 4277 OopMapSet* oop_maps = new OopMapSet(); 4278 MacroAssembler* masm = new MacroAssembler(&code); 4279 4280 address start = __ pc(); 4281 4282 // This is an inlined and slightly modified version of call_VM 4283 // which has the ability to fetch the return PC out of 4284 // thread-local storage and also sets up last_Java_sp slightly 4285 // differently than the real call_VM 4286 4287 __ enter(); // required for proper stackwalking of RuntimeStub frame 4288 4289 assert(is_even(framesize/2), "sp not 16-byte aligned"); 4290 4291 // return address and rbp are already in place 4292 __ subptr(rsp, (framesize-4) << LogBytesPerInt); // prolog 4293 4294 int frame_complete = __ pc() - start; 4295 4296 // Set up last_Java_sp and last_Java_fp 4297 address the_pc = __ pc(); 4298 __ set_last_Java_frame(rsp, rbp, the_pc); 4299 __ andptr(rsp, -(StackAlignmentInBytes)); // Align stack 4300 4301 // Call runtime 4302 if (arg1 != noreg) { 4303 assert(arg2 != c_rarg1, "clobbered"); 4304 __ movptr(c_rarg1, arg1); 4305 } 4306 if (arg2 != noreg) { 4307 __ movptr(c_rarg2, arg2); 4308 } 4309 __ movptr(c_rarg0, r15_thread); 4310 BLOCK_COMMENT("call runtime_entry"); 4311 __ call(RuntimeAddress(runtime_entry)); 4312 4313 // Generate oop map 4314 OopMap* map = new OopMap(framesize, 0); 4315 4316 oop_maps->add_gc_map(the_pc - start, map); 4317 4318 __ reset_last_Java_frame(true, true); 4319 4320 __ leave(); // required for proper stackwalking of RuntimeStub frame 4321 4322 // check for pending exceptions 4323 #ifdef ASSERT 4324 Label L; 4325 __ cmpptr(Address(r15_thread, Thread::pending_exception_offset()), 4326 (int32_t) NULL_WORD); 4327 __ jcc(Assembler::notEqual, L); 4328 __ should_not_reach_here(); 4329 __ bind(L); 4330 #endif // ASSERT 4331 __ jump(RuntimeAddress(StubRoutines::forward_exception_entry())); 4332 4333 4334 // codeBlob framesize is in words (not VMRegImpl::slot_size) 4335 RuntimeStub* stub = 4336 RuntimeStub::new_runtime_stub(name, 4337 &code, 4338 frame_complete, 4339 (framesize >> (LogBytesPerWord - LogBytesPerInt)), 4340 oop_maps, false); 4341 return stub->entry_point(); 4342 } 4343 4344 void create_control_words() { 4345 // Round to nearest, 53-bit mode, exceptions masked 4346 StubRoutines::_fpu_cntrl_wrd_std = 0x027F; 4347 // Round to zero, 53-bit mode, exception mased 4348 StubRoutines::_fpu_cntrl_wrd_trunc = 0x0D7F; 4349 // Round to nearest, 24-bit mode, exceptions masked 4350 StubRoutines::_fpu_cntrl_wrd_24 = 0x007F; 4351 // Round to nearest, 64-bit mode, exceptions masked 4352 StubRoutines::_fpu_cntrl_wrd_64 = 0x037F; 4353 // Round to nearest, 64-bit mode, exceptions masked 4354 StubRoutines::_mxcsr_std = 0x1F80; 4355 // Note: the following two constants are 80-bit values 4356 // layout is critical for correct loading by FPU. 4357 // Bias for strict fp multiply/divide 4358 StubRoutines::_fpu_subnormal_bias1[0]= 0x00000000; // 2^(-15360) == 0x03ff 8000 0000 0000 0000 4359 StubRoutines::_fpu_subnormal_bias1[1]= 0x80000000; 4360 StubRoutines::_fpu_subnormal_bias1[2]= 0x03ff; 4361 // Un-Bias for strict fp multiply/divide 4362 StubRoutines::_fpu_subnormal_bias2[0]= 0x00000000; // 2^(+15360) == 0x7bff 8000 0000 0000 0000 4363 StubRoutines::_fpu_subnormal_bias2[1]= 0x80000000; 4364 StubRoutines::_fpu_subnormal_bias2[2]= 0x7bff; 4365 } 4366 4367 // Initialization 4368 void generate_initial() { 4369 // Generates all stubs and initializes the entry points 4370 4371 // This platform-specific settings are needed by generate_call_stub() 4372 create_control_words(); 4373 4374 // entry points that exist in all platforms Note: This is code 4375 // that could be shared among different platforms - however the 4376 // benefit seems to be smaller than the disadvantage of having a 4377 // much more complicated generator structure. See also comment in 4378 // stubRoutines.hpp. 4379 4380 StubRoutines::_forward_exception_entry = generate_forward_exception(); 4381 4382 StubRoutines::_call_stub_entry = 4383 generate_call_stub(StubRoutines::_call_stub_return_address); 4384 4385 // is referenced by megamorphic call 4386 StubRoutines::_catch_exception_entry = generate_catch_exception(); 4387 4388 // atomic calls 4389 StubRoutines::_atomic_xchg_entry = generate_atomic_xchg(); 4390 StubRoutines::_atomic_xchg_ptr_entry = generate_atomic_xchg_ptr(); 4391 StubRoutines::_atomic_cmpxchg_entry = generate_atomic_cmpxchg(); 4392 StubRoutines::_atomic_cmpxchg_byte_entry = generate_atomic_cmpxchg_byte(); 4393 StubRoutines::_atomic_cmpxchg_long_entry = generate_atomic_cmpxchg_long(); 4394 StubRoutines::_atomic_add_entry = generate_atomic_add(); 4395 StubRoutines::_atomic_add_ptr_entry = generate_atomic_add_ptr(); 4396 StubRoutines::_fence_entry = generate_orderaccess_fence(); 4397 4398 StubRoutines::_handler_for_unsafe_access_entry = 4399 generate_handler_for_unsafe_access(); 4400 4401 // platform dependent 4402 StubRoutines::x86::_get_previous_fp_entry = generate_get_previous_fp(); 4403 StubRoutines::x86::_get_previous_sp_entry = generate_get_previous_sp(); 4404 4405 StubRoutines::x86::_verify_mxcsr_entry = generate_verify_mxcsr(); 4406 4407 // Build this early so it's available for the interpreter. 4408 StubRoutines::_throw_StackOverflowError_entry = 4409 generate_throw_exception("StackOverflowError throw_exception", 4410 CAST_FROM_FN_PTR(address, 4411 SharedRuntime:: 4412 throw_StackOverflowError)); 4413 if (UseCRC32Intrinsics) { 4414 // set table address before stub generation which use it 4415 StubRoutines::_crc_table_adr = (address)StubRoutines::x86::_crc_table; 4416 StubRoutines::_updateBytesCRC32 = generate_updateBytesCRC32(); 4417 } 4418 4419 if (UseCRC32CIntrinsics) { 4420 bool supports_clmul = VM_Version::supports_clmul(); 4421 StubRoutines::x86::generate_CRC32C_table(supports_clmul); 4422 StubRoutines::_crc32c_table_addr = (address)StubRoutines::x86::_crc32c_table; 4423 StubRoutines::_updateBytesCRC32C = generate_updateBytesCRC32C(supports_clmul); 4424 } 4425 if (VM_Version::supports_sse2()) { 4426 StubRoutines::_dexp = generate_libmExp(); 4427 StubRoutines::_dlog = generate_libmLog(); 4428 } 4429 } 4430 4431 void generate_all() { 4432 // Generates all stubs and initializes the entry points 4433 4434 // These entry points require SharedInfo::stack0 to be set up in 4435 // non-core builds and need to be relocatable, so they each 4436 // fabricate a RuntimeStub internally. 4437 StubRoutines::_throw_AbstractMethodError_entry = 4438 generate_throw_exception("AbstractMethodError throw_exception", 4439 CAST_FROM_FN_PTR(address, 4440 SharedRuntime:: 4441 throw_AbstractMethodError)); 4442 4443 StubRoutines::_throw_IncompatibleClassChangeError_entry = 4444 generate_throw_exception("IncompatibleClassChangeError throw_exception", 4445 CAST_FROM_FN_PTR(address, 4446 SharedRuntime:: 4447 throw_IncompatibleClassChangeError)); 4448 4449 StubRoutines::_throw_NullPointerException_at_call_entry = 4450 generate_throw_exception("NullPointerException at call throw_exception", 4451 CAST_FROM_FN_PTR(address, 4452 SharedRuntime:: 4453 throw_NullPointerException_at_call)); 4454 4455 // entry points that are platform specific 4456 StubRoutines::x86::_f2i_fixup = generate_f2i_fixup(); 4457 StubRoutines::x86::_f2l_fixup = generate_f2l_fixup(); 4458 StubRoutines::x86::_d2i_fixup = generate_d2i_fixup(); 4459 StubRoutines::x86::_d2l_fixup = generate_d2l_fixup(); 4460 4461 StubRoutines::x86::_float_sign_mask = generate_fp_mask("float_sign_mask", 0x7FFFFFFF7FFFFFFF); 4462 StubRoutines::x86::_float_sign_flip = generate_fp_mask("float_sign_flip", 0x8000000080000000); 4463 StubRoutines::x86::_double_sign_mask = generate_fp_mask("double_sign_mask", 0x7FFFFFFFFFFFFFFF); 4464 StubRoutines::x86::_double_sign_flip = generate_fp_mask("double_sign_flip", 0x8000000000000000); 4465 4466 // support for verify_oop (must happen after universe_init) 4467 StubRoutines::_verify_oop_subroutine_entry = generate_verify_oop(); 4468 4469 // arraycopy stubs used by compilers 4470 generate_arraycopy_stubs(); 4471 4472 generate_math_stubs(); 4473 4474 // don't bother generating these AES intrinsic stubs unless global flag is set 4475 if (UseAESIntrinsics) { 4476 StubRoutines::x86::_key_shuffle_mask_addr = generate_key_shuffle_mask(); // needed by the others 4477 4478 StubRoutines::_aescrypt_encryptBlock = generate_aescrypt_encryptBlock(); 4479 StubRoutines::_aescrypt_decryptBlock = generate_aescrypt_decryptBlock(); 4480 StubRoutines::_cipherBlockChaining_encryptAESCrypt = generate_cipherBlockChaining_encryptAESCrypt(); 4481 StubRoutines::_cipherBlockChaining_decryptAESCrypt = generate_cipherBlockChaining_decryptAESCrypt_Parallel(); 4482 } 4483 4484 // Generate GHASH intrinsics code 4485 if (UseGHASHIntrinsics) { 4486 StubRoutines::x86::_ghash_long_swap_mask_addr = generate_ghash_long_swap_mask(); 4487 StubRoutines::x86::_ghash_byte_swap_mask_addr = generate_ghash_byte_swap_mask(); 4488 StubRoutines::_ghash_processBlocks = generate_ghash_processBlocks(); 4489 } 4490 4491 // Safefetch stubs. 4492 generate_safefetch("SafeFetch32", sizeof(int), &StubRoutines::_safefetch32_entry, 4493 &StubRoutines::_safefetch32_fault_pc, 4494 &StubRoutines::_safefetch32_continuation_pc); 4495 generate_safefetch("SafeFetchN", sizeof(intptr_t), &StubRoutines::_safefetchN_entry, 4496 &StubRoutines::_safefetchN_fault_pc, 4497 &StubRoutines::_safefetchN_continuation_pc); 4498 #ifdef COMPILER2 4499 if (UseMultiplyToLenIntrinsic) { 4500 StubRoutines::_multiplyToLen = generate_multiplyToLen(); 4501 } 4502 if (UseSquareToLenIntrinsic) { 4503 StubRoutines::_squareToLen = generate_squareToLen(); 4504 } 4505 if (UseMulAddIntrinsic) { 4506 StubRoutines::_mulAdd = generate_mulAdd(); 4507 } 4508 4509 #ifndef _WINDOWS 4510 if (UseMontgomeryMultiplyIntrinsic) { 4511 StubRoutines::_montgomeryMultiply 4512 = CAST_FROM_FN_PTR(address, SharedRuntime::montgomery_multiply); 4513 } 4514 if (UseMontgomerySquareIntrinsic) { 4515 StubRoutines::_montgomerySquare 4516 = CAST_FROM_FN_PTR(address, SharedRuntime::montgomery_square); 4517 } 4518 #endif // WINDOWS 4519 #endif // COMPILER2 4520 } 4521 4522 public: 4523 StubGenerator(CodeBuffer* code, bool all) : StubCodeGenerator(code) { 4524 if (all) { 4525 generate_all(); 4526 } else { 4527 generate_initial(); 4528 } 4529 } 4530 }; // end class declaration 4531 4532 void StubGenerator_generate(CodeBuffer* code, bool all) { 4533 StubGenerator g(code, all); 4534 }