duke@435: /* trims@1907: * Copyright (c) 2003, 2010, Oracle and/or its affiliates. All rights reserved. duke@435: * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. duke@435: * duke@435: * This code is free software; you can redistribute it and/or modify it duke@435: * under the terms of the GNU General Public License version 2 only, as duke@435: * published by the Free Software Foundation. duke@435: * duke@435: * This code is distributed in the hope that it will be useful, but WITHOUT duke@435: * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or duke@435: * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License duke@435: * version 2 for more details (a copy is included in the LICENSE file that duke@435: * accompanied this code). duke@435: * duke@435: * You should have received a copy of the GNU General Public License version duke@435: * 2 along with this work; if not, write to the Free Software Foundation, duke@435: * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. duke@435: * trims@1907: * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA trims@1907: * or visit www.oracle.com if you need additional information or have any trims@1907: * questions. duke@435: * duke@435: */ duke@435: duke@435: #include "incls/_precompiled.incl" duke@435: #include "incls/_templateTable_x86_64.cpp.incl" duke@435: never@739: #ifndef CC_INTERP never@739: duke@435: #define __ _masm-> duke@435: duke@435: // Platform-dependent initialization duke@435: duke@435: void TemplateTable::pd_initialize() { duke@435: // No amd64 specific initialization duke@435: } duke@435: duke@435: // Address computation: local variables duke@435: duke@435: static inline Address iaddress(int n) { duke@435: return Address(r14, Interpreter::local_offset_in_bytes(n)); duke@435: } duke@435: duke@435: static inline Address laddress(int n) { duke@435: return iaddress(n + 1); duke@435: } duke@435: duke@435: static inline Address faddress(int n) { duke@435: return iaddress(n); duke@435: } duke@435: duke@435: static inline Address daddress(int n) { duke@435: return laddress(n); duke@435: } duke@435: duke@435: static inline Address aaddress(int n) { duke@435: return iaddress(n); duke@435: } duke@435: duke@435: static inline Address iaddress(Register r) { twisti@1861: return Address(r14, r, Address::times_8); duke@435: } duke@435: duke@435: static inline Address laddress(Register r) { duke@435: return Address(r14, r, Address::times_8, Interpreter::local_offset_in_bytes(1)); duke@435: } duke@435: duke@435: static inline Address faddress(Register r) { duke@435: return iaddress(r); duke@435: } duke@435: duke@435: static inline Address daddress(Register r) { duke@435: return laddress(r); duke@435: } duke@435: duke@435: static inline Address aaddress(Register r) { duke@435: return iaddress(r); duke@435: } duke@435: duke@435: static inline Address at_rsp() { duke@435: return Address(rsp, 0); duke@435: } duke@435: duke@435: // At top of Java expression stack which may be different than esp(). It duke@435: // isn't for category 1 objects. duke@435: static inline Address at_tos () { duke@435: return Address(rsp, Interpreter::expr_offset_in_bytes(0)); duke@435: } duke@435: duke@435: static inline Address at_tos_p1() { duke@435: return Address(rsp, Interpreter::expr_offset_in_bytes(1)); duke@435: } duke@435: duke@435: static inline Address at_tos_p2() { duke@435: return Address(rsp, Interpreter::expr_offset_in_bytes(2)); duke@435: } duke@435: duke@435: static inline Address at_tos_p3() { duke@435: return Address(rsp, Interpreter::expr_offset_in_bytes(3)); duke@435: } duke@435: duke@435: // Condition conversion duke@435: static Assembler::Condition j_not(TemplateTable::Condition cc) { duke@435: switch (cc) { duke@435: case TemplateTable::equal : return Assembler::notEqual; duke@435: case TemplateTable::not_equal : return Assembler::equal; duke@435: case TemplateTable::less : return Assembler::greaterEqual; duke@435: case TemplateTable::less_equal : return Assembler::greater; duke@435: case TemplateTable::greater : return Assembler::lessEqual; duke@435: case TemplateTable::greater_equal: return Assembler::less; duke@435: } duke@435: ShouldNotReachHere(); duke@435: return Assembler::zero; duke@435: } duke@435: duke@435: duke@435: // Miscelaneous helper routines ysr@777: // Store an oop (or NULL) at the address described by obj. ysr@777: // If val == noreg this means store a NULL ysr@777: ysr@777: static void do_oop_store(InterpreterMacroAssembler* _masm, ysr@777: Address obj, ysr@777: Register val, ysr@777: BarrierSet::Name barrier, ysr@777: bool precise) { ysr@777: assert(val == noreg || val == rax, "parameter is just for looks"); ysr@777: switch (barrier) { ysr@777: #ifndef SERIALGC ysr@777: case BarrierSet::G1SATBCT: ysr@777: case BarrierSet::G1SATBCTLogging: ysr@777: { ysr@777: // flatten object address if needed ysr@777: if (obj.index() == noreg && obj.disp() == 0) { ysr@777: if (obj.base() != rdx) { ysr@777: __ movq(rdx, obj.base()); ysr@777: } ysr@777: } else { ysr@777: __ leaq(rdx, obj); ysr@777: } ysr@777: __ g1_write_barrier_pre(rdx, r8, rbx, val != noreg); ysr@777: if (val == noreg) { johnc@1482: __ store_heap_oop_null(Address(rdx, 0)); ysr@777: } else { ysr@777: __ store_heap_oop(Address(rdx, 0), val); ysr@777: __ g1_write_barrier_post(rdx, val, r8, rbx); ysr@777: } ysr@777: ysr@777: } ysr@777: break; ysr@777: #endif // SERIALGC ysr@777: case BarrierSet::CardTableModRef: ysr@777: case BarrierSet::CardTableExtension: ysr@777: { ysr@777: if (val == noreg) { johnc@1482: __ store_heap_oop_null(obj); ysr@777: } else { ysr@777: __ store_heap_oop(obj, val); ysr@777: // flatten object address if needed ysr@777: if (!precise || (obj.index() == noreg && obj.disp() == 0)) { ysr@777: __ store_check(obj.base()); ysr@777: } else { ysr@777: __ leaq(rdx, obj); ysr@777: __ store_check(rdx); ysr@777: } ysr@777: } ysr@777: } ysr@777: break; ysr@777: case BarrierSet::ModRef: ysr@777: case BarrierSet::Other: ysr@777: if (val == noreg) { johnc@1482: __ store_heap_oop_null(obj); ysr@777: } else { ysr@777: __ store_heap_oop(obj, val); ysr@777: } ysr@777: break; ysr@777: default : ysr@777: ShouldNotReachHere(); ysr@777: ysr@777: } ysr@777: } duke@435: duke@435: Address TemplateTable::at_bcp(int offset) { duke@435: assert(_desc->uses_bcp(), "inconsistent uses_bcp information"); duke@435: return Address(r13, offset); duke@435: } duke@435: duke@435: void TemplateTable::patch_bytecode(Bytecodes::Code bytecode, Register bc, duke@435: Register scratch, duke@435: bool load_bc_into_scratch/*=true*/) { duke@435: if (!RewriteBytecodes) { duke@435: return; duke@435: } duke@435: // the pair bytecodes have already done the load. duke@435: if (load_bc_into_scratch) { duke@435: __ movl(bc, bytecode); duke@435: } duke@435: Label patch_done; duke@435: if (JvmtiExport::can_post_breakpoint()) { duke@435: Label fast_patch; duke@435: // if a breakpoint is present we can't rewrite the stream directly duke@435: __ movzbl(scratch, at_bcp(0)); duke@435: __ cmpl(scratch, Bytecodes::_breakpoint); duke@435: __ jcc(Assembler::notEqual, fast_patch); duke@435: __ get_method(scratch); duke@435: // Let breakpoint table handling rewrite to quicker bytecode twisti@1543: __ call_VM(noreg, CAST_FROM_FN_PTR(address, InterpreterRuntime::set_original_bytecode_at), scratch, r13, bc); duke@435: #ifndef ASSERT duke@435: __ jmpb(patch_done); twisti@1543: #else twisti@1543: __ jmp(patch_done); twisti@1543: #endif duke@435: __ bind(fast_patch); duke@435: } twisti@1543: #ifdef ASSERT duke@435: Label okay; duke@435: __ load_unsigned_byte(scratch, at_bcp(0)); duke@435: __ cmpl(scratch, (int) Bytecodes::java_code(bytecode)); duke@435: __ jcc(Assembler::equal, okay); duke@435: __ cmpl(scratch, bc); duke@435: __ jcc(Assembler::equal, okay); duke@435: __ stop("patching the wrong bytecode"); duke@435: __ bind(okay); duke@435: #endif duke@435: // patch bytecode duke@435: __ movb(at_bcp(0), bc); duke@435: __ bind(patch_done); duke@435: } duke@435: duke@435: duke@435: // Individual instructions duke@435: duke@435: void TemplateTable::nop() { duke@435: transition(vtos, vtos); duke@435: // nothing to do duke@435: } duke@435: duke@435: void TemplateTable::shouldnotreachhere() { duke@435: transition(vtos, vtos); duke@435: __ stop("shouldnotreachhere bytecode"); duke@435: } duke@435: duke@435: void TemplateTable::aconst_null() { duke@435: transition(vtos, atos); duke@435: __ xorl(rax, rax); duke@435: } duke@435: duke@435: void TemplateTable::iconst(int value) { duke@435: transition(vtos, itos); duke@435: if (value == 0) { duke@435: __ xorl(rax, rax); duke@435: } else { duke@435: __ movl(rax, value); duke@435: } duke@435: } duke@435: duke@435: void TemplateTable::lconst(int value) { duke@435: transition(vtos, ltos); duke@435: if (value == 0) { duke@435: __ xorl(rax, rax); duke@435: } else { duke@435: __ movl(rax, value); duke@435: } duke@435: } duke@435: duke@435: void TemplateTable::fconst(int value) { duke@435: transition(vtos, ftos); duke@435: static float one = 1.0f, two = 2.0f; duke@435: switch (value) { duke@435: case 0: duke@435: __ xorps(xmm0, xmm0); duke@435: break; duke@435: case 1: duke@435: __ movflt(xmm0, ExternalAddress((address) &one)); duke@435: break; duke@435: case 2: duke@435: __ movflt(xmm0, ExternalAddress((address) &two)); duke@435: break; duke@435: default: duke@435: ShouldNotReachHere(); duke@435: break; duke@435: } duke@435: } duke@435: duke@435: void TemplateTable::dconst(int value) { duke@435: transition(vtos, dtos); duke@435: static double one = 1.0; duke@435: switch (value) { duke@435: case 0: duke@435: __ xorpd(xmm0, xmm0); duke@435: break; duke@435: case 1: duke@435: __ movdbl(xmm0, ExternalAddress((address) &one)); duke@435: break; duke@435: default: duke@435: ShouldNotReachHere(); duke@435: break; duke@435: } duke@435: } duke@435: duke@435: void TemplateTable::bipush() { duke@435: transition(vtos, itos); duke@435: __ load_signed_byte(rax, at_bcp(1)); duke@435: } duke@435: duke@435: void TemplateTable::sipush() { duke@435: transition(vtos, itos); jrose@1057: __ load_unsigned_short(rax, at_bcp(1)); duke@435: __ bswapl(rax); duke@435: __ sarl(rax, 16); duke@435: } duke@435: duke@435: void TemplateTable::ldc(bool wide) { duke@435: transition(vtos, vtos); duke@435: Label call_ldc, notFloat, notClass, Done; duke@435: duke@435: if (wide) { duke@435: __ get_unsigned_2_byte_index_at_bcp(rbx, 1); duke@435: } else { duke@435: __ load_unsigned_byte(rbx, at_bcp(1)); duke@435: } duke@435: duke@435: __ get_cpool_and_tags(rcx, rax); duke@435: const int base_offset = constantPoolOopDesc::header_size() * wordSize; duke@435: const int tags_offset = typeArrayOopDesc::header_size(T_BYTE) * wordSize; duke@435: duke@435: // get type duke@435: __ movzbl(rdx, Address(rax, rbx, Address::times_1, tags_offset)); duke@435: duke@435: // unresolved string - get the resolved string duke@435: __ cmpl(rdx, JVM_CONSTANT_UnresolvedString); duke@435: __ jccb(Assembler::equal, call_ldc); duke@435: duke@435: // unresolved class - get the resolved class duke@435: __ cmpl(rdx, JVM_CONSTANT_UnresolvedClass); duke@435: __ jccb(Assembler::equal, call_ldc); duke@435: duke@435: // unresolved class in error state - call into runtime to throw the error duke@435: // from the first resolution attempt duke@435: __ cmpl(rdx, JVM_CONSTANT_UnresolvedClassInError); duke@435: __ jccb(Assembler::equal, call_ldc); duke@435: duke@435: // resolved class - need to call vm to get java mirror of the class duke@435: __ cmpl(rdx, JVM_CONSTANT_Class); duke@435: __ jcc(Assembler::notEqual, notClass); duke@435: duke@435: __ bind(call_ldc); duke@435: __ movl(c_rarg1, wide); duke@435: call_VM(rax, CAST_FROM_FN_PTR(address, InterpreterRuntime::ldc), c_rarg1); duke@435: __ push_ptr(rax); duke@435: __ verify_oop(rax); duke@435: __ jmp(Done); duke@435: duke@435: __ bind(notClass); duke@435: __ cmpl(rdx, JVM_CONSTANT_Float); duke@435: __ jccb(Assembler::notEqual, notFloat); duke@435: // ftos duke@435: __ movflt(xmm0, Address(rcx, rbx, Address::times_8, base_offset)); duke@435: __ push_f(); duke@435: __ jmp(Done); duke@435: duke@435: __ bind(notFloat); duke@435: #ifdef ASSERT duke@435: { duke@435: Label L; duke@435: __ cmpl(rdx, JVM_CONSTANT_Integer); duke@435: __ jcc(Assembler::equal, L); duke@435: __ cmpl(rdx, JVM_CONSTANT_String); duke@435: __ jcc(Assembler::equal, L); duke@435: __ stop("unexpected tag type in ldc"); duke@435: __ bind(L); duke@435: } duke@435: #endif duke@435: // atos and itos duke@435: Label isOop; duke@435: __ cmpl(rdx, JVM_CONSTANT_Integer); duke@435: __ jcc(Assembler::notEqual, isOop); duke@435: __ movl(rax, Address(rcx, rbx, Address::times_8, base_offset)); duke@435: __ push_i(rax); duke@435: __ jmp(Done); duke@435: duke@435: __ bind(isOop); never@739: __ movptr(rax, Address(rcx, rbx, Address::times_8, base_offset)); duke@435: __ push_ptr(rax); duke@435: duke@435: if (VerifyOops) { duke@435: __ verify_oop(rax); duke@435: } duke@435: duke@435: __ bind(Done); duke@435: } duke@435: jrose@1957: // Fast path for caching oop constants. jrose@1957: // %%% We should use this to handle Class and String constants also. jrose@1957: // %%% It will simplify the ldc/primitive path considerably. jrose@1957: void TemplateTable::fast_aldc(bool wide) { jrose@1957: transition(vtos, atos); jrose@1957: jrose@1957: if (!EnableMethodHandles) { jrose@1957: // We should not encounter this bytecode if !EnableMethodHandles. jrose@1957: // The verifier will stop it. However, if we get past the verifier, jrose@1957: // this will stop the thread in a reasonable way, without crashing the JVM. jrose@1957: __ call_VM(noreg, CAST_FROM_FN_PTR(address, jrose@1957: InterpreterRuntime::throw_IncompatibleClassChangeError)); jrose@1957: // the call_VM checks for exception, so we should never return here. jrose@1957: __ should_not_reach_here(); jrose@1957: return; jrose@1957: } jrose@1957: jrose@1957: const Register cache = rcx; jrose@1957: const Register index = rdx; jrose@1957: jrose@1957: resolve_cache_and_index(f1_oop, rax, cache, index, wide ? sizeof(u2) : sizeof(u1)); jrose@1957: if (VerifyOops) { jrose@1957: __ verify_oop(rax); jrose@1957: } jrose@1957: } jrose@1957: duke@435: void TemplateTable::ldc2_w() { duke@435: transition(vtos, vtos); duke@435: Label Long, Done; duke@435: __ get_unsigned_2_byte_index_at_bcp(rbx, 1); duke@435: duke@435: __ get_cpool_and_tags(rcx, rax); duke@435: const int base_offset = constantPoolOopDesc::header_size() * wordSize; duke@435: const int tags_offset = typeArrayOopDesc::header_size(T_BYTE) * wordSize; duke@435: duke@435: // get type duke@435: __ cmpb(Address(rax, rbx, Address::times_1, tags_offset), duke@435: JVM_CONSTANT_Double); duke@435: __ jccb(Assembler::notEqual, Long); duke@435: // dtos duke@435: __ movdbl(xmm0, Address(rcx, rbx, Address::times_8, base_offset)); duke@435: __ push_d(); duke@435: __ jmpb(Done); duke@435: duke@435: __ bind(Long); duke@435: // ltos duke@435: __ movq(rax, Address(rcx, rbx, Address::times_8, base_offset)); duke@435: __ push_l(); duke@435: duke@435: __ bind(Done); duke@435: } duke@435: duke@435: void TemplateTable::locals_index(Register reg, int offset) { duke@435: __ load_unsigned_byte(reg, at_bcp(offset)); never@739: __ negptr(reg); duke@435: } duke@435: duke@435: void TemplateTable::iload() { duke@435: transition(vtos, itos); duke@435: if (RewriteFrequentPairs) { duke@435: Label rewrite, done; duke@435: const Register bc = c_rarg3; duke@435: assert(rbx != bc, "register damaged"); duke@435: duke@435: // get next byte duke@435: __ load_unsigned_byte(rbx, duke@435: at_bcp(Bytecodes::length_for(Bytecodes::_iload))); duke@435: // if _iload, wait to rewrite to iload2. We only want to rewrite the duke@435: // last two iloads in a pair. Comparing against fast_iload means that duke@435: // the next bytecode is neither an iload or a caload, and therefore duke@435: // an iload pair. duke@435: __ cmpl(rbx, Bytecodes::_iload); duke@435: __ jcc(Assembler::equal, done); duke@435: duke@435: __ cmpl(rbx, Bytecodes::_fast_iload); duke@435: __ movl(bc, Bytecodes::_fast_iload2); duke@435: __ jccb(Assembler::equal, rewrite); duke@435: duke@435: // if _caload, rewrite to fast_icaload duke@435: __ cmpl(rbx, Bytecodes::_caload); duke@435: __ movl(bc, Bytecodes::_fast_icaload); duke@435: __ jccb(Assembler::equal, rewrite); duke@435: duke@435: // rewrite so iload doesn't check again. duke@435: __ movl(bc, Bytecodes::_fast_iload); duke@435: duke@435: // rewrite duke@435: // bc: fast bytecode duke@435: __ bind(rewrite); duke@435: patch_bytecode(Bytecodes::_iload, bc, rbx, false); duke@435: __ bind(done); duke@435: } duke@435: duke@435: // Get the local value into tos duke@435: locals_index(rbx); duke@435: __ movl(rax, iaddress(rbx)); duke@435: } duke@435: duke@435: void TemplateTable::fast_iload2() { duke@435: transition(vtos, itos); duke@435: locals_index(rbx); duke@435: __ movl(rax, iaddress(rbx)); duke@435: __ push(itos); duke@435: locals_index(rbx, 3); duke@435: __ movl(rax, iaddress(rbx)); duke@435: } duke@435: duke@435: void TemplateTable::fast_iload() { duke@435: transition(vtos, itos); duke@435: locals_index(rbx); duke@435: __ movl(rax, iaddress(rbx)); duke@435: } duke@435: duke@435: void TemplateTable::lload() { duke@435: transition(vtos, ltos); duke@435: locals_index(rbx); duke@435: __ movq(rax, laddress(rbx)); duke@435: } duke@435: duke@435: void TemplateTable::fload() { duke@435: transition(vtos, ftos); duke@435: locals_index(rbx); duke@435: __ movflt(xmm0, faddress(rbx)); duke@435: } duke@435: duke@435: void TemplateTable::dload() { duke@435: transition(vtos, dtos); duke@435: locals_index(rbx); duke@435: __ movdbl(xmm0, daddress(rbx)); duke@435: } duke@435: duke@435: void TemplateTable::aload() { duke@435: transition(vtos, atos); duke@435: locals_index(rbx); never@739: __ movptr(rax, aaddress(rbx)); duke@435: } duke@435: duke@435: void TemplateTable::locals_index_wide(Register reg) { duke@435: __ movl(reg, at_bcp(2)); duke@435: __ bswapl(reg); duke@435: __ shrl(reg, 16); never@739: __ negptr(reg); duke@435: } duke@435: duke@435: void TemplateTable::wide_iload() { duke@435: transition(vtos, itos); duke@435: locals_index_wide(rbx); duke@435: __ movl(rax, iaddress(rbx)); duke@435: } duke@435: duke@435: void TemplateTable::wide_lload() { duke@435: transition(vtos, ltos); duke@435: locals_index_wide(rbx); duke@435: __ movq(rax, laddress(rbx)); duke@435: } duke@435: duke@435: void TemplateTable::wide_fload() { duke@435: transition(vtos, ftos); duke@435: locals_index_wide(rbx); duke@435: __ movflt(xmm0, faddress(rbx)); duke@435: } duke@435: duke@435: void TemplateTable::wide_dload() { duke@435: transition(vtos, dtos); duke@435: locals_index_wide(rbx); duke@435: __ movdbl(xmm0, daddress(rbx)); duke@435: } duke@435: duke@435: void TemplateTable::wide_aload() { duke@435: transition(vtos, atos); duke@435: locals_index_wide(rbx); never@739: __ movptr(rax, aaddress(rbx)); duke@435: } duke@435: duke@435: void TemplateTable::index_check(Register array, Register index) { duke@435: // destroys rbx duke@435: // check array duke@435: __ null_check(array, arrayOopDesc::length_offset_in_bytes()); duke@435: // sign extend index for use by indexed load never@739: __ movl2ptr(index, index); duke@435: // check index duke@435: __ cmpl(index, Address(array, arrayOopDesc::length_offset_in_bytes())); duke@435: if (index != rbx) { duke@435: // ??? convention: move aberrant index into ebx for exception message duke@435: assert(rbx != array, "different registers"); duke@435: __ movl(rbx, index); duke@435: } duke@435: __ jump_cc(Assembler::aboveEqual, duke@435: ExternalAddress(Interpreter::_throw_ArrayIndexOutOfBoundsException_entry)); duke@435: } duke@435: duke@435: void TemplateTable::iaload() { duke@435: transition(itos, itos); duke@435: __ pop_ptr(rdx); duke@435: // eax: index duke@435: // rdx: array duke@435: index_check(rdx, rax); // kills rbx duke@435: __ movl(rax, Address(rdx, rax, duke@435: Address::times_4, duke@435: arrayOopDesc::base_offset_in_bytes(T_INT))); duke@435: } duke@435: duke@435: void TemplateTable::laload() { duke@435: transition(itos, ltos); duke@435: __ pop_ptr(rdx); duke@435: // eax: index duke@435: // rdx: array duke@435: index_check(rdx, rax); // kills rbx duke@435: __ movq(rax, Address(rdx, rbx, duke@435: Address::times_8, duke@435: arrayOopDesc::base_offset_in_bytes(T_LONG))); duke@435: } duke@435: duke@435: void TemplateTable::faload() { duke@435: transition(itos, ftos); duke@435: __ pop_ptr(rdx); duke@435: // eax: index duke@435: // rdx: array duke@435: index_check(rdx, rax); // kills rbx duke@435: __ movflt(xmm0, Address(rdx, rax, duke@435: Address::times_4, duke@435: arrayOopDesc::base_offset_in_bytes(T_FLOAT))); duke@435: } duke@435: duke@435: void TemplateTable::daload() { duke@435: transition(itos, dtos); duke@435: __ pop_ptr(rdx); duke@435: // eax: index duke@435: // rdx: array duke@435: index_check(rdx, rax); // kills rbx duke@435: __ movdbl(xmm0, Address(rdx, rax, duke@435: Address::times_8, duke@435: arrayOopDesc::base_offset_in_bytes(T_DOUBLE))); duke@435: } duke@435: duke@435: void TemplateTable::aaload() { duke@435: transition(itos, atos); duke@435: __ pop_ptr(rdx); duke@435: // eax: index duke@435: // rdx: array duke@435: index_check(rdx, rax); // kills rbx coleenp@548: __ load_heap_oop(rax, Address(rdx, rax, ysr@777: UseCompressedOops ? Address::times_4 : Address::times_8, ysr@777: arrayOopDesc::base_offset_in_bytes(T_OBJECT))); duke@435: } duke@435: duke@435: void TemplateTable::baload() { duke@435: transition(itos, itos); duke@435: __ pop_ptr(rdx); duke@435: // eax: index duke@435: // rdx: array duke@435: index_check(rdx, rax); // kills rbx duke@435: __ load_signed_byte(rax, duke@435: Address(rdx, rax, duke@435: Address::times_1, duke@435: arrayOopDesc::base_offset_in_bytes(T_BYTE))); duke@435: } duke@435: duke@435: void TemplateTable::caload() { duke@435: transition(itos, itos); duke@435: __ pop_ptr(rdx); duke@435: // eax: index duke@435: // rdx: array duke@435: index_check(rdx, rax); // kills rbx jrose@1057: __ load_unsigned_short(rax, jrose@1057: Address(rdx, rax, jrose@1057: Address::times_2, jrose@1057: arrayOopDesc::base_offset_in_bytes(T_CHAR))); duke@435: } duke@435: duke@435: // iload followed by caload frequent pair duke@435: void TemplateTable::fast_icaload() { duke@435: transition(vtos, itos); duke@435: // load index out of locals duke@435: locals_index(rbx); duke@435: __ movl(rax, iaddress(rbx)); duke@435: duke@435: // eax: index duke@435: // rdx: array duke@435: __ pop_ptr(rdx); duke@435: index_check(rdx, rax); // kills rbx jrose@1057: __ load_unsigned_short(rax, jrose@1057: Address(rdx, rax, jrose@1057: Address::times_2, jrose@1057: arrayOopDesc::base_offset_in_bytes(T_CHAR))); duke@435: } duke@435: duke@435: void TemplateTable::saload() { duke@435: transition(itos, itos); duke@435: __ pop_ptr(rdx); duke@435: // eax: index duke@435: // rdx: array duke@435: index_check(rdx, rax); // kills rbx jrose@1057: __ load_signed_short(rax, jrose@1057: Address(rdx, rax, jrose@1057: Address::times_2, jrose@1057: arrayOopDesc::base_offset_in_bytes(T_SHORT))); duke@435: } duke@435: duke@435: void TemplateTable::iload(int n) { duke@435: transition(vtos, itos); duke@435: __ movl(rax, iaddress(n)); duke@435: } duke@435: duke@435: void TemplateTable::lload(int n) { duke@435: transition(vtos, ltos); duke@435: __ movq(rax, laddress(n)); duke@435: } duke@435: duke@435: void TemplateTable::fload(int n) { duke@435: transition(vtos, ftos); duke@435: __ movflt(xmm0, faddress(n)); duke@435: } duke@435: duke@435: void TemplateTable::dload(int n) { duke@435: transition(vtos, dtos); duke@435: __ movdbl(xmm0, daddress(n)); duke@435: } duke@435: duke@435: void TemplateTable::aload(int n) { duke@435: transition(vtos, atos); never@739: __ movptr(rax, aaddress(n)); duke@435: } duke@435: duke@435: void TemplateTable::aload_0() { duke@435: transition(vtos, atos); duke@435: // According to bytecode histograms, the pairs: duke@435: // duke@435: // _aload_0, _fast_igetfield duke@435: // _aload_0, _fast_agetfield duke@435: // _aload_0, _fast_fgetfield duke@435: // duke@435: // occur frequently. If RewriteFrequentPairs is set, the (slow) duke@435: // _aload_0 bytecode checks if the next bytecode is either duke@435: // _fast_igetfield, _fast_agetfield or _fast_fgetfield and then duke@435: // rewrites the current bytecode into a pair bytecode; otherwise it duke@435: // rewrites the current bytecode into _fast_aload_0 that doesn't do duke@435: // the pair check anymore. duke@435: // duke@435: // Note: If the next bytecode is _getfield, the rewrite must be duke@435: // delayed, otherwise we may miss an opportunity for a pair. duke@435: // duke@435: // Also rewrite frequent pairs duke@435: // aload_0, aload_1 duke@435: // aload_0, iload_1 duke@435: // These bytecodes with a small amount of code are most profitable duke@435: // to rewrite duke@435: if (RewriteFrequentPairs) { duke@435: Label rewrite, done; duke@435: const Register bc = c_rarg3; duke@435: assert(rbx != bc, "register damaged"); duke@435: // get next byte duke@435: __ load_unsigned_byte(rbx, duke@435: at_bcp(Bytecodes::length_for(Bytecodes::_aload_0))); duke@435: duke@435: // do actual aload_0 duke@435: aload(0); duke@435: duke@435: // if _getfield then wait with rewrite duke@435: __ cmpl(rbx, Bytecodes::_getfield); duke@435: __ jcc(Assembler::equal, done); duke@435: duke@435: // if _igetfield then reqrite to _fast_iaccess_0 duke@435: assert(Bytecodes::java_code(Bytecodes::_fast_iaccess_0) == duke@435: Bytecodes::_aload_0, duke@435: "fix bytecode definition"); duke@435: __ cmpl(rbx, Bytecodes::_fast_igetfield); duke@435: __ movl(bc, Bytecodes::_fast_iaccess_0); duke@435: __ jccb(Assembler::equal, rewrite); duke@435: duke@435: // if _agetfield then reqrite to _fast_aaccess_0 duke@435: assert(Bytecodes::java_code(Bytecodes::_fast_aaccess_0) == duke@435: Bytecodes::_aload_0, duke@435: "fix bytecode definition"); duke@435: __ cmpl(rbx, Bytecodes::_fast_agetfield); duke@435: __ movl(bc, Bytecodes::_fast_aaccess_0); duke@435: __ jccb(Assembler::equal, rewrite); duke@435: duke@435: // if _fgetfield then reqrite to _fast_faccess_0 duke@435: assert(Bytecodes::java_code(Bytecodes::_fast_faccess_0) == duke@435: Bytecodes::_aload_0, duke@435: "fix bytecode definition"); duke@435: __ cmpl(rbx, Bytecodes::_fast_fgetfield); duke@435: __ movl(bc, Bytecodes::_fast_faccess_0); duke@435: __ jccb(Assembler::equal, rewrite); duke@435: duke@435: // else rewrite to _fast_aload0 duke@435: assert(Bytecodes::java_code(Bytecodes::_fast_aload_0) == duke@435: Bytecodes::_aload_0, duke@435: "fix bytecode definition"); duke@435: __ movl(bc, Bytecodes::_fast_aload_0); duke@435: duke@435: // rewrite duke@435: // bc: fast bytecode duke@435: __ bind(rewrite); duke@435: patch_bytecode(Bytecodes::_aload_0, bc, rbx, false); duke@435: duke@435: __ bind(done); duke@435: } else { duke@435: aload(0); duke@435: } duke@435: } duke@435: duke@435: void TemplateTable::istore() { duke@435: transition(itos, vtos); duke@435: locals_index(rbx); duke@435: __ movl(iaddress(rbx), rax); duke@435: } duke@435: duke@435: void TemplateTable::lstore() { duke@435: transition(ltos, vtos); duke@435: locals_index(rbx); duke@435: __ movq(laddress(rbx), rax); duke@435: } duke@435: duke@435: void TemplateTable::fstore() { duke@435: transition(ftos, vtos); duke@435: locals_index(rbx); duke@435: __ movflt(faddress(rbx), xmm0); duke@435: } duke@435: duke@435: void TemplateTable::dstore() { duke@435: transition(dtos, vtos); duke@435: locals_index(rbx); duke@435: __ movdbl(daddress(rbx), xmm0); duke@435: } duke@435: duke@435: void TemplateTable::astore() { duke@435: transition(vtos, vtos); twisti@1861: __ pop_ptr(rax); duke@435: locals_index(rbx); never@739: __ movptr(aaddress(rbx), rax); duke@435: } duke@435: duke@435: void TemplateTable::wide_istore() { duke@435: transition(vtos, vtos); duke@435: __ pop_i(); duke@435: locals_index_wide(rbx); duke@435: __ movl(iaddress(rbx), rax); duke@435: } duke@435: duke@435: void TemplateTable::wide_lstore() { duke@435: transition(vtos, vtos); duke@435: __ pop_l(); duke@435: locals_index_wide(rbx); duke@435: __ movq(laddress(rbx), rax); duke@435: } duke@435: duke@435: void TemplateTable::wide_fstore() { duke@435: transition(vtos, vtos); duke@435: __ pop_f(); duke@435: locals_index_wide(rbx); duke@435: __ movflt(faddress(rbx), xmm0); duke@435: } duke@435: duke@435: void TemplateTable::wide_dstore() { duke@435: transition(vtos, vtos); duke@435: __ pop_d(); duke@435: locals_index_wide(rbx); duke@435: __ movdbl(daddress(rbx), xmm0); duke@435: } duke@435: duke@435: void TemplateTable::wide_astore() { duke@435: transition(vtos, vtos); twisti@1861: __ pop_ptr(rax); duke@435: locals_index_wide(rbx); never@739: __ movptr(aaddress(rbx), rax); duke@435: } duke@435: duke@435: void TemplateTable::iastore() { duke@435: transition(itos, vtos); duke@435: __ pop_i(rbx); duke@435: __ pop_ptr(rdx); duke@435: // eax: value duke@435: // ebx: index duke@435: // rdx: array duke@435: index_check(rdx, rbx); // prefer index in ebx duke@435: __ movl(Address(rdx, rbx, duke@435: Address::times_4, duke@435: arrayOopDesc::base_offset_in_bytes(T_INT)), duke@435: rax); duke@435: } duke@435: duke@435: void TemplateTable::lastore() { duke@435: transition(ltos, vtos); duke@435: __ pop_i(rbx); duke@435: __ pop_ptr(rdx); duke@435: // rax: value duke@435: // ebx: index duke@435: // rdx: array duke@435: index_check(rdx, rbx); // prefer index in ebx duke@435: __ movq(Address(rdx, rbx, duke@435: Address::times_8, duke@435: arrayOopDesc::base_offset_in_bytes(T_LONG)), duke@435: rax); duke@435: } duke@435: duke@435: void TemplateTable::fastore() { duke@435: transition(ftos, vtos); duke@435: __ pop_i(rbx); duke@435: __ pop_ptr(rdx); duke@435: // xmm0: value duke@435: // ebx: index duke@435: // rdx: array duke@435: index_check(rdx, rbx); // prefer index in ebx duke@435: __ movflt(Address(rdx, rbx, duke@435: Address::times_4, duke@435: arrayOopDesc::base_offset_in_bytes(T_FLOAT)), duke@435: xmm0); duke@435: } duke@435: duke@435: void TemplateTable::dastore() { duke@435: transition(dtos, vtos); duke@435: __ pop_i(rbx); duke@435: __ pop_ptr(rdx); duke@435: // xmm0: value duke@435: // ebx: index duke@435: // rdx: array duke@435: index_check(rdx, rbx); // prefer index in ebx duke@435: __ movdbl(Address(rdx, rbx, duke@435: Address::times_8, duke@435: arrayOopDesc::base_offset_in_bytes(T_DOUBLE)), duke@435: xmm0); duke@435: } duke@435: duke@435: void TemplateTable::aastore() { duke@435: Label is_null, ok_is_subtype, done; duke@435: transition(vtos, vtos); duke@435: // stack: ..., array, index, value never@739: __ movptr(rax, at_tos()); // value duke@435: __ movl(rcx, at_tos_p1()); // index never@739: __ movptr(rdx, at_tos_p2()); // array ysr@777: ysr@777: Address element_address(rdx, rcx, ysr@777: UseCompressedOops? Address::times_4 : Address::times_8, ysr@777: arrayOopDesc::base_offset_in_bytes(T_OBJECT)); ysr@777: duke@435: index_check(rdx, rcx); // kills rbx duke@435: // do array store check - check for NULL value first never@739: __ testptr(rax, rax); duke@435: __ jcc(Assembler::zero, is_null); duke@435: duke@435: // Move subklass into rbx coleenp@548: __ load_klass(rbx, rax); duke@435: // Move superklass into rax coleenp@548: __ load_klass(rax, rdx); never@739: __ movptr(rax, Address(rax, never@739: sizeof(oopDesc) + never@739: objArrayKlass::element_klass_offset_in_bytes())); coleenp@548: // Compress array + index*oopSize + 12 into a single register. Frees rcx. apetrusenko@797: __ lea(rdx, element_address); duke@435: duke@435: // Generate subtype check. Blows rcx, rdi duke@435: // Superklass in rax. Subklass in rbx. duke@435: __ gen_subtype_check(rbx, ok_is_subtype); duke@435: duke@435: // Come here on failure duke@435: // object is at TOS duke@435: __ jump(ExternalAddress(Interpreter::_throw_ArrayStoreException_entry)); duke@435: duke@435: // Come here on success duke@435: __ bind(ok_is_subtype); ysr@777: ysr@777: // Get the value we will store apetrusenko@797: __ movptr(rax, at_tos()); ysr@777: // Now store using the appropriate barrier ysr@777: do_oop_store(_masm, Address(rdx, 0), rax, _bs->kind(), true); duke@435: __ jmp(done); duke@435: duke@435: // Have a NULL in rax, rdx=array, ecx=index. Store NULL at ary[idx] duke@435: __ bind(is_null); duke@435: __ profile_null_seen(rbx); ysr@777: ysr@777: // Store a NULL ysr@777: do_oop_store(_masm, element_address, noreg, _bs->kind(), true); duke@435: duke@435: // Pop stack arguments duke@435: __ bind(done); twisti@1861: __ addptr(rsp, 3 * Interpreter::stackElementSize); duke@435: } duke@435: duke@435: void TemplateTable::bastore() { duke@435: transition(itos, vtos); duke@435: __ pop_i(rbx); duke@435: __ pop_ptr(rdx); duke@435: // eax: value duke@435: // ebx: index duke@435: // rdx: array duke@435: index_check(rdx, rbx); // prefer index in ebx duke@435: __ movb(Address(rdx, rbx, duke@435: Address::times_1, duke@435: arrayOopDesc::base_offset_in_bytes(T_BYTE)), duke@435: rax); duke@435: } duke@435: duke@435: void TemplateTable::castore() { duke@435: transition(itos, vtos); duke@435: __ pop_i(rbx); duke@435: __ pop_ptr(rdx); duke@435: // eax: value duke@435: // ebx: index duke@435: // rdx: array duke@435: index_check(rdx, rbx); // prefer index in ebx duke@435: __ movw(Address(rdx, rbx, duke@435: Address::times_2, duke@435: arrayOopDesc::base_offset_in_bytes(T_CHAR)), duke@435: rax); duke@435: } duke@435: duke@435: void TemplateTable::sastore() { duke@435: castore(); duke@435: } duke@435: duke@435: void TemplateTable::istore(int n) { duke@435: transition(itos, vtos); duke@435: __ movl(iaddress(n), rax); duke@435: } duke@435: duke@435: void TemplateTable::lstore(int n) { duke@435: transition(ltos, vtos); duke@435: __ movq(laddress(n), rax); duke@435: } duke@435: duke@435: void TemplateTable::fstore(int n) { duke@435: transition(ftos, vtos); duke@435: __ movflt(faddress(n), xmm0); duke@435: } duke@435: duke@435: void TemplateTable::dstore(int n) { duke@435: transition(dtos, vtos); duke@435: __ movdbl(daddress(n), xmm0); duke@435: } duke@435: duke@435: void TemplateTable::astore(int n) { duke@435: transition(vtos, vtos); twisti@1861: __ pop_ptr(rax); never@739: __ movptr(aaddress(n), rax); duke@435: } duke@435: duke@435: void TemplateTable::pop() { duke@435: transition(vtos, vtos); twisti@1861: __ addptr(rsp, Interpreter::stackElementSize); duke@435: } duke@435: duke@435: void TemplateTable::pop2() { duke@435: transition(vtos, vtos); twisti@1861: __ addptr(rsp, 2 * Interpreter::stackElementSize); duke@435: } duke@435: duke@435: void TemplateTable::dup() { duke@435: transition(vtos, vtos); twisti@1861: __ load_ptr(0, rax); twisti@1861: __ push_ptr(rax); duke@435: // stack: ..., a, a duke@435: } duke@435: duke@435: void TemplateTable::dup_x1() { duke@435: transition(vtos, vtos); duke@435: // stack: ..., a, b twisti@1861: __ load_ptr( 0, rax); // load b twisti@1861: __ load_ptr( 1, rcx); // load a twisti@1861: __ store_ptr(1, rax); // store b twisti@1861: __ store_ptr(0, rcx); // store a twisti@1861: __ push_ptr(rax); // push b duke@435: // stack: ..., b, a, b duke@435: } duke@435: duke@435: void TemplateTable::dup_x2() { duke@435: transition(vtos, vtos); duke@435: // stack: ..., a, b, c twisti@1861: __ load_ptr( 0, rax); // load c twisti@1861: __ load_ptr( 2, rcx); // load a twisti@1861: __ store_ptr(2, rax); // store c in a twisti@1861: __ push_ptr(rax); // push c duke@435: // stack: ..., c, b, c, c twisti@1861: __ load_ptr( 2, rax); // load b twisti@1861: __ store_ptr(2, rcx); // store a in b duke@435: // stack: ..., c, a, c, c twisti@1861: __ store_ptr(1, rax); // store b in c duke@435: // stack: ..., c, a, b, c duke@435: } duke@435: duke@435: void TemplateTable::dup2() { duke@435: transition(vtos, vtos); duke@435: // stack: ..., a, b twisti@1861: __ load_ptr(1, rax); // load a twisti@1861: __ push_ptr(rax); // push a twisti@1861: __ load_ptr(1, rax); // load b twisti@1861: __ push_ptr(rax); // push b duke@435: // stack: ..., a, b, a, b duke@435: } duke@435: duke@435: void TemplateTable::dup2_x1() { duke@435: transition(vtos, vtos); duke@435: // stack: ..., a, b, c twisti@1861: __ load_ptr( 0, rcx); // load c twisti@1861: __ load_ptr( 1, rax); // load b twisti@1861: __ push_ptr(rax); // push b twisti@1861: __ push_ptr(rcx); // push c duke@435: // stack: ..., a, b, c, b, c twisti@1861: __ store_ptr(3, rcx); // store c in b duke@435: // stack: ..., a, c, c, b, c twisti@1861: __ load_ptr( 4, rcx); // load a twisti@1861: __ store_ptr(2, rcx); // store a in 2nd c duke@435: // stack: ..., a, c, a, b, c twisti@1861: __ store_ptr(4, rax); // store b in a duke@435: // stack: ..., b, c, a, b, c duke@435: } duke@435: duke@435: void TemplateTable::dup2_x2() { duke@435: transition(vtos, vtos); duke@435: // stack: ..., a, b, c, d twisti@1861: __ load_ptr( 0, rcx); // load d twisti@1861: __ load_ptr( 1, rax); // load c twisti@1861: __ push_ptr(rax); // push c twisti@1861: __ push_ptr(rcx); // push d duke@435: // stack: ..., a, b, c, d, c, d twisti@1861: __ load_ptr( 4, rax); // load b twisti@1861: __ store_ptr(2, rax); // store b in d twisti@1861: __ store_ptr(4, rcx); // store d in b duke@435: // stack: ..., a, d, c, b, c, d twisti@1861: __ load_ptr( 5, rcx); // load a twisti@1861: __ load_ptr( 3, rax); // load c twisti@1861: __ store_ptr(3, rcx); // store a in c twisti@1861: __ store_ptr(5, rax); // store c in a duke@435: // stack: ..., c, d, a, b, c, d duke@435: } duke@435: duke@435: void TemplateTable::swap() { duke@435: transition(vtos, vtos); duke@435: // stack: ..., a, b twisti@1861: __ load_ptr( 1, rcx); // load a twisti@1861: __ load_ptr( 0, rax); // load b twisti@1861: __ store_ptr(0, rcx); // store a in b twisti@1861: __ store_ptr(1, rax); // store b in a duke@435: // stack: ..., b, a duke@435: } duke@435: duke@435: void TemplateTable::iop2(Operation op) { duke@435: transition(itos, itos); duke@435: switch (op) { duke@435: case add : __ pop_i(rdx); __ addl (rax, rdx); break; duke@435: case sub : __ movl(rdx, rax); __ pop_i(rax); __ subl (rax, rdx); break; duke@435: case mul : __ pop_i(rdx); __ imull(rax, rdx); break; duke@435: case _and : __ pop_i(rdx); __ andl (rax, rdx); break; duke@435: case _or : __ pop_i(rdx); __ orl (rax, rdx); break; duke@435: case _xor : __ pop_i(rdx); __ xorl (rax, rdx); break; duke@435: case shl : __ movl(rcx, rax); __ pop_i(rax); __ shll (rax); break; duke@435: case shr : __ movl(rcx, rax); __ pop_i(rax); __ sarl (rax); break; duke@435: case ushr : __ movl(rcx, rax); __ pop_i(rax); __ shrl (rax); break; duke@435: default : ShouldNotReachHere(); duke@435: } duke@435: } duke@435: duke@435: void TemplateTable::lop2(Operation op) { duke@435: transition(ltos, ltos); duke@435: switch (op) { twisti@1861: case add : __ pop_l(rdx); __ addptr(rax, rdx); break; twisti@1861: case sub : __ mov(rdx, rax); __ pop_l(rax); __ subptr(rax, rdx); break; twisti@1861: case _and : __ pop_l(rdx); __ andptr(rax, rdx); break; twisti@1861: case _or : __ pop_l(rdx); __ orptr (rax, rdx); break; twisti@1861: case _xor : __ pop_l(rdx); __ xorptr(rax, rdx); break; twisti@1861: default : ShouldNotReachHere(); duke@435: } duke@435: } duke@435: duke@435: void TemplateTable::idiv() { duke@435: transition(itos, itos); duke@435: __ movl(rcx, rax); duke@435: __ pop_i(rax); duke@435: // Note: could xor eax and ecx and compare with (-1 ^ min_int). If duke@435: // they are not equal, one could do a normal division (no correction duke@435: // needed), which may speed up this implementation for the common case. duke@435: // (see also JVM spec., p.243 & p.271) duke@435: __ corrected_idivl(rcx); duke@435: } duke@435: duke@435: void TemplateTable::irem() { duke@435: transition(itos, itos); duke@435: __ movl(rcx, rax); duke@435: __ pop_i(rax); duke@435: // Note: could xor eax and ecx and compare with (-1 ^ min_int). If duke@435: // they are not equal, one could do a normal division (no correction duke@435: // needed), which may speed up this implementation for the common case. duke@435: // (see also JVM spec., p.243 & p.271) duke@435: __ corrected_idivl(rcx); duke@435: __ movl(rax, rdx); duke@435: } duke@435: duke@435: void TemplateTable::lmul() { duke@435: transition(ltos, ltos); duke@435: __ pop_l(rdx); duke@435: __ imulq(rax, rdx); duke@435: } duke@435: duke@435: void TemplateTable::ldiv() { duke@435: transition(ltos, ltos); never@739: __ mov(rcx, rax); duke@435: __ pop_l(rax); duke@435: // generate explicit div0 check duke@435: __ testq(rcx, rcx); duke@435: __ jump_cc(Assembler::zero, duke@435: ExternalAddress(Interpreter::_throw_ArithmeticException_entry)); duke@435: // Note: could xor rax and rcx and compare with (-1 ^ min_int). If duke@435: // they are not equal, one could do a normal division (no correction duke@435: // needed), which may speed up this implementation for the common case. duke@435: // (see also JVM spec., p.243 & p.271) duke@435: __ corrected_idivq(rcx); // kills rbx duke@435: } duke@435: duke@435: void TemplateTable::lrem() { duke@435: transition(ltos, ltos); never@739: __ mov(rcx, rax); duke@435: __ pop_l(rax); duke@435: __ testq(rcx, rcx); duke@435: __ jump_cc(Assembler::zero, duke@435: ExternalAddress(Interpreter::_throw_ArithmeticException_entry)); duke@435: // Note: could xor rax and rcx and compare with (-1 ^ min_int). If duke@435: // they are not equal, one could do a normal division (no correction duke@435: // needed), which may speed up this implementation for the common case. duke@435: // (see also JVM spec., p.243 & p.271) duke@435: __ corrected_idivq(rcx); // kills rbx never@739: __ mov(rax, rdx); duke@435: } duke@435: duke@435: void TemplateTable::lshl() { duke@435: transition(itos, ltos); duke@435: __ movl(rcx, rax); // get shift count duke@435: __ pop_l(rax); // get shift value duke@435: __ shlq(rax); duke@435: } duke@435: duke@435: void TemplateTable::lshr() { duke@435: transition(itos, ltos); duke@435: __ movl(rcx, rax); // get shift count duke@435: __ pop_l(rax); // get shift value duke@435: __ sarq(rax); duke@435: } duke@435: duke@435: void TemplateTable::lushr() { duke@435: transition(itos, ltos); duke@435: __ movl(rcx, rax); // get shift count duke@435: __ pop_l(rax); // get shift value duke@435: __ shrq(rax); duke@435: } duke@435: duke@435: void TemplateTable::fop2(Operation op) { duke@435: transition(ftos, ftos); duke@435: switch (op) { duke@435: case add: duke@435: __ addss(xmm0, at_rsp()); twisti@1861: __ addptr(rsp, Interpreter::stackElementSize); duke@435: break; duke@435: case sub: duke@435: __ movflt(xmm1, xmm0); duke@435: __ pop_f(xmm0); duke@435: __ subss(xmm0, xmm1); duke@435: break; duke@435: case mul: duke@435: __ mulss(xmm0, at_rsp()); twisti@1861: __ addptr(rsp, Interpreter::stackElementSize); duke@435: break; duke@435: case div: duke@435: __ movflt(xmm1, xmm0); duke@435: __ pop_f(xmm0); duke@435: __ divss(xmm0, xmm1); duke@435: break; duke@435: case rem: duke@435: __ movflt(xmm1, xmm0); duke@435: __ pop_f(xmm0); duke@435: __ call_VM_leaf(CAST_FROM_FN_PTR(address, SharedRuntime::frem), 2); duke@435: break; duke@435: default: duke@435: ShouldNotReachHere(); duke@435: break; duke@435: } duke@435: } duke@435: duke@435: void TemplateTable::dop2(Operation op) { duke@435: transition(dtos, dtos); duke@435: switch (op) { duke@435: case add: duke@435: __ addsd(xmm0, at_rsp()); twisti@1861: __ addptr(rsp, 2 * Interpreter::stackElementSize); duke@435: break; duke@435: case sub: duke@435: __ movdbl(xmm1, xmm0); duke@435: __ pop_d(xmm0); duke@435: __ subsd(xmm0, xmm1); duke@435: break; duke@435: case mul: duke@435: __ mulsd(xmm0, at_rsp()); twisti@1861: __ addptr(rsp, 2 * Interpreter::stackElementSize); duke@435: break; duke@435: case div: duke@435: __ movdbl(xmm1, xmm0); duke@435: __ pop_d(xmm0); duke@435: __ divsd(xmm0, xmm1); duke@435: break; duke@435: case rem: duke@435: __ movdbl(xmm1, xmm0); duke@435: __ pop_d(xmm0); duke@435: __ call_VM_leaf(CAST_FROM_FN_PTR(address, SharedRuntime::drem), 2); duke@435: break; duke@435: default: duke@435: ShouldNotReachHere(); duke@435: break; duke@435: } duke@435: } duke@435: duke@435: void TemplateTable::ineg() { duke@435: transition(itos, itos); duke@435: __ negl(rax); duke@435: } duke@435: duke@435: void TemplateTable::lneg() { duke@435: transition(ltos, ltos); duke@435: __ negq(rax); duke@435: } duke@435: duke@435: // Note: 'double' and 'long long' have 32-bits alignment on x86. duke@435: static jlong* double_quadword(jlong *adr, jlong lo, jlong hi) { duke@435: // Use the expression (adr)&(~0xF) to provide 128-bits aligned address duke@435: // of 128-bits operands for SSE instructions. duke@435: jlong *operand = (jlong*)(((intptr_t)adr)&((intptr_t)(~0xF))); duke@435: // Store the value to a 128-bits operand. duke@435: operand[0] = lo; duke@435: operand[1] = hi; duke@435: return operand; duke@435: } duke@435: duke@435: // Buffer for 128-bits masks used by SSE instructions. duke@435: static jlong float_signflip_pool[2*2]; duke@435: static jlong double_signflip_pool[2*2]; duke@435: duke@435: void TemplateTable::fneg() { duke@435: transition(ftos, ftos); duke@435: static jlong *float_signflip = double_quadword(&float_signflip_pool[1], 0x8000000080000000, 0x8000000080000000); duke@435: __ xorps(xmm0, ExternalAddress((address) float_signflip)); duke@435: } duke@435: duke@435: void TemplateTable::dneg() { duke@435: transition(dtos, dtos); duke@435: static jlong *double_signflip = double_quadword(&double_signflip_pool[1], 0x8000000000000000, 0x8000000000000000); duke@435: __ xorpd(xmm0, ExternalAddress((address) double_signflip)); duke@435: } duke@435: duke@435: void TemplateTable::iinc() { duke@435: transition(vtos, vtos); duke@435: __ load_signed_byte(rdx, at_bcp(2)); // get constant duke@435: locals_index(rbx); duke@435: __ addl(iaddress(rbx), rdx); duke@435: } duke@435: duke@435: void TemplateTable::wide_iinc() { duke@435: transition(vtos, vtos); duke@435: __ movl(rdx, at_bcp(4)); // get constant duke@435: locals_index_wide(rbx); duke@435: __ bswapl(rdx); // swap bytes & sign-extend constant duke@435: __ sarl(rdx, 16); duke@435: __ addl(iaddress(rbx), rdx); duke@435: // Note: should probably use only one movl to get both duke@435: // the index and the constant -> fix this duke@435: } duke@435: duke@435: void TemplateTable::convert() { duke@435: // Checking duke@435: #ifdef ASSERT duke@435: { duke@435: TosState tos_in = ilgl; duke@435: TosState tos_out = ilgl; duke@435: switch (bytecode()) { duke@435: case Bytecodes::_i2l: // fall through duke@435: case Bytecodes::_i2f: // fall through duke@435: case Bytecodes::_i2d: // fall through duke@435: case Bytecodes::_i2b: // fall through duke@435: case Bytecodes::_i2c: // fall through duke@435: case Bytecodes::_i2s: tos_in = itos; break; duke@435: case Bytecodes::_l2i: // fall through duke@435: case Bytecodes::_l2f: // fall through duke@435: case Bytecodes::_l2d: tos_in = ltos; break; duke@435: case Bytecodes::_f2i: // fall through duke@435: case Bytecodes::_f2l: // fall through duke@435: case Bytecodes::_f2d: tos_in = ftos; break; duke@435: case Bytecodes::_d2i: // fall through duke@435: case Bytecodes::_d2l: // fall through duke@435: case Bytecodes::_d2f: tos_in = dtos; break; duke@435: default : ShouldNotReachHere(); duke@435: } duke@435: switch (bytecode()) { duke@435: case Bytecodes::_l2i: // fall through duke@435: case Bytecodes::_f2i: // fall through duke@435: case Bytecodes::_d2i: // fall through duke@435: case Bytecodes::_i2b: // fall through duke@435: case Bytecodes::_i2c: // fall through duke@435: case Bytecodes::_i2s: tos_out = itos; break; duke@435: case Bytecodes::_i2l: // fall through duke@435: case Bytecodes::_f2l: // fall through duke@435: case Bytecodes::_d2l: tos_out = ltos; break; duke@435: case Bytecodes::_i2f: // fall through duke@435: case Bytecodes::_l2f: // fall through duke@435: case Bytecodes::_d2f: tos_out = ftos; break; duke@435: case Bytecodes::_i2d: // fall through duke@435: case Bytecodes::_l2d: // fall through duke@435: case Bytecodes::_f2d: tos_out = dtos; break; duke@435: default : ShouldNotReachHere(); duke@435: } duke@435: transition(tos_in, tos_out); duke@435: } duke@435: #endif // ASSERT duke@435: duke@435: static const int64_t is_nan = 0x8000000000000000L; duke@435: duke@435: // Conversion duke@435: switch (bytecode()) { duke@435: case Bytecodes::_i2l: duke@435: __ movslq(rax, rax); duke@435: break; duke@435: case Bytecodes::_i2f: duke@435: __ cvtsi2ssl(xmm0, rax); duke@435: break; duke@435: case Bytecodes::_i2d: duke@435: __ cvtsi2sdl(xmm0, rax); duke@435: break; duke@435: case Bytecodes::_i2b: duke@435: __ movsbl(rax, rax); duke@435: break; duke@435: case Bytecodes::_i2c: duke@435: __ movzwl(rax, rax); duke@435: break; duke@435: case Bytecodes::_i2s: duke@435: __ movswl(rax, rax); duke@435: break; duke@435: case Bytecodes::_l2i: duke@435: __ movl(rax, rax); duke@435: break; duke@435: case Bytecodes::_l2f: duke@435: __ cvtsi2ssq(xmm0, rax); duke@435: break; duke@435: case Bytecodes::_l2d: duke@435: __ cvtsi2sdq(xmm0, rax); duke@435: break; duke@435: case Bytecodes::_f2i: duke@435: { duke@435: Label L; duke@435: __ cvttss2sil(rax, xmm0); duke@435: __ cmpl(rax, 0x80000000); // NaN or overflow/underflow? duke@435: __ jcc(Assembler::notEqual, L); duke@435: __ call_VM_leaf(CAST_FROM_FN_PTR(address, SharedRuntime::f2i), 1); duke@435: __ bind(L); duke@435: } duke@435: break; duke@435: case Bytecodes::_f2l: duke@435: { duke@435: Label L; duke@435: __ cvttss2siq(rax, xmm0); duke@435: // NaN or overflow/underflow? duke@435: __ cmp64(rax, ExternalAddress((address) &is_nan)); duke@435: __ jcc(Assembler::notEqual, L); duke@435: __ call_VM_leaf(CAST_FROM_FN_PTR(address, SharedRuntime::f2l), 1); duke@435: __ bind(L); duke@435: } duke@435: break; duke@435: case Bytecodes::_f2d: duke@435: __ cvtss2sd(xmm0, xmm0); duke@435: break; duke@435: case Bytecodes::_d2i: duke@435: { duke@435: Label L; duke@435: __ cvttsd2sil(rax, xmm0); duke@435: __ cmpl(rax, 0x80000000); // NaN or overflow/underflow? duke@435: __ jcc(Assembler::notEqual, L); duke@435: __ call_VM_leaf(CAST_FROM_FN_PTR(address, SharedRuntime::d2i), 1); duke@435: __ bind(L); duke@435: } duke@435: break; duke@435: case Bytecodes::_d2l: duke@435: { duke@435: Label L; duke@435: __ cvttsd2siq(rax, xmm0); duke@435: // NaN or overflow/underflow? duke@435: __ cmp64(rax, ExternalAddress((address) &is_nan)); duke@435: __ jcc(Assembler::notEqual, L); duke@435: __ call_VM_leaf(CAST_FROM_FN_PTR(address, SharedRuntime::d2l), 1); duke@435: __ bind(L); duke@435: } duke@435: break; duke@435: case Bytecodes::_d2f: duke@435: __ cvtsd2ss(xmm0, xmm0); duke@435: break; duke@435: default: duke@435: ShouldNotReachHere(); duke@435: } duke@435: } duke@435: duke@435: void TemplateTable::lcmp() { duke@435: transition(ltos, itos); duke@435: Label done; duke@435: __ pop_l(rdx); duke@435: __ cmpq(rdx, rax); duke@435: __ movl(rax, -1); duke@435: __ jccb(Assembler::less, done); duke@435: __ setb(Assembler::notEqual, rax); duke@435: __ movzbl(rax, rax); duke@435: __ bind(done); duke@435: } duke@435: duke@435: void TemplateTable::float_cmp(bool is_float, int unordered_result) { duke@435: Label done; duke@435: if (is_float) { duke@435: // XXX get rid of pop here, use ... reg, mem32 duke@435: __ pop_f(xmm1); duke@435: __ ucomiss(xmm1, xmm0); duke@435: } else { duke@435: // XXX get rid of pop here, use ... reg, mem64 duke@435: __ pop_d(xmm1); duke@435: __ ucomisd(xmm1, xmm0); duke@435: } duke@435: if (unordered_result < 0) { duke@435: __ movl(rax, -1); duke@435: __ jccb(Assembler::parity, done); duke@435: __ jccb(Assembler::below, done); duke@435: __ setb(Assembler::notEqual, rdx); duke@435: __ movzbl(rax, rdx); duke@435: } else { duke@435: __ movl(rax, 1); duke@435: __ jccb(Assembler::parity, done); duke@435: __ jccb(Assembler::above, done); duke@435: __ movl(rax, 0); duke@435: __ jccb(Assembler::equal, done); duke@435: __ decrementl(rax); duke@435: } duke@435: __ bind(done); duke@435: } duke@435: duke@435: void TemplateTable::branch(bool is_jsr, bool is_wide) { duke@435: __ get_method(rcx); // rcx holds method duke@435: __ profile_taken_branch(rax, rbx); // rax holds updated MDP, rbx duke@435: // holds bumped taken count duke@435: duke@435: const ByteSize be_offset = methodOopDesc::backedge_counter_offset() + duke@435: InvocationCounter::counter_offset(); duke@435: const ByteSize inv_offset = methodOopDesc::invocation_counter_offset() + duke@435: InvocationCounter::counter_offset(); duke@435: const int method_offset = frame::interpreter_frame_method_offset * wordSize; duke@435: duke@435: // Load up edx with the branch displacement duke@435: __ movl(rdx, at_bcp(1)); duke@435: __ bswapl(rdx); duke@435: duke@435: if (!is_wide) { duke@435: __ sarl(rdx, 16); duke@435: } never@739: __ movl2ptr(rdx, rdx); duke@435: duke@435: // Handle all the JSR stuff here, then exit. duke@435: // It's much shorter and cleaner than intermingling with the non-JSR twisti@1040: // normal-branch stuff occurring below. duke@435: if (is_jsr) { duke@435: // Pre-load the next target bytecode into rbx duke@435: __ load_unsigned_byte(rbx, Address(r13, rdx, Address::times_1, 0)); duke@435: duke@435: // compute return address as bci in rax never@739: __ lea(rax, at_bcp((is_wide ? 5 : 3) - duke@435: in_bytes(constMethodOopDesc::codes_offset()))); never@739: __ subptr(rax, Address(rcx, methodOopDesc::const_offset())); duke@435: // Adjust the bcp in r13 by the displacement in rdx never@739: __ addptr(r13, rdx); duke@435: // jsr returns atos that is not an oop duke@435: __ push_i(rax); duke@435: __ dispatch_only(vtos); duke@435: return; duke@435: } duke@435: duke@435: // Normal (non-jsr) branch handling duke@435: duke@435: // Adjust the bcp in r13 by the displacement in rdx never@739: __ addptr(r13, rdx); duke@435: duke@435: assert(UseLoopCounter || !UseOnStackReplacement, duke@435: "on-stack-replacement requires loop counters"); duke@435: Label backedge_counter_overflow; duke@435: Label profile_method; duke@435: Label dispatch; duke@435: if (UseLoopCounter) { duke@435: // increment backedge counter for backward branches duke@435: // rax: MDO duke@435: // ebx: MDO bumped taken-count duke@435: // rcx: method duke@435: // rdx: target offset duke@435: // r13: target bcp duke@435: // r14: locals pointer duke@435: __ testl(rdx, rdx); // check if forward or backward branch duke@435: __ jcc(Assembler::positive, dispatch); // count only if backward branch duke@435: duke@435: // increment counter duke@435: __ movl(rax, Address(rcx, be_offset)); // load backedge counter duke@435: __ incrementl(rax, InvocationCounter::count_increment); // increment duke@435: // counter duke@435: __ movl(Address(rcx, be_offset), rax); // store counter duke@435: duke@435: __ movl(rax, Address(rcx, inv_offset)); // load invocation counter duke@435: __ andl(rax, InvocationCounter::count_mask_value); // and the status bits duke@435: __ addl(rax, Address(rcx, be_offset)); // add both counters duke@435: duke@435: if (ProfileInterpreter) { duke@435: // Test to see if we should create a method data oop duke@435: __ cmp32(rax, duke@435: ExternalAddress((address) &InvocationCounter::InterpreterProfileLimit)); duke@435: __ jcc(Assembler::less, dispatch); duke@435: duke@435: // if no method data exists, go to profile method duke@435: __ test_method_data_pointer(rax, profile_method); duke@435: duke@435: if (UseOnStackReplacement) { duke@435: // check for overflow against ebx which is the MDO taken count duke@435: __ cmp32(rbx, duke@435: ExternalAddress((address) &InvocationCounter::InterpreterBackwardBranchLimit)); duke@435: __ jcc(Assembler::below, dispatch); duke@435: duke@435: // When ProfileInterpreter is on, the backedge_count comes duke@435: // from the methodDataOop, which value does not get reset on duke@435: // the call to frequency_counter_overflow(). To avoid duke@435: // excessive calls to the overflow routine while the method is duke@435: // being compiled, add a second test to make sure the overflow duke@435: // function is called only once every overflow_frequency. duke@435: const int overflow_frequency = 1024; duke@435: __ andl(rbx, overflow_frequency - 1); duke@435: __ jcc(Assembler::zero, backedge_counter_overflow); duke@435: duke@435: } duke@435: } else { duke@435: if (UseOnStackReplacement) { duke@435: // check for overflow against eax, which is the sum of the duke@435: // counters duke@435: __ cmp32(rax, duke@435: ExternalAddress((address) &InvocationCounter::InterpreterBackwardBranchLimit)); duke@435: __ jcc(Assembler::aboveEqual, backedge_counter_overflow); duke@435: duke@435: } duke@435: } duke@435: __ bind(dispatch); duke@435: } duke@435: duke@435: // Pre-load the next target bytecode into rbx duke@435: __ load_unsigned_byte(rbx, Address(r13, 0)); duke@435: duke@435: // continue with the bytecode @ target duke@435: // eax: return bci for jsr's, unused otherwise duke@435: // ebx: target bytecode duke@435: // r13: target bcp duke@435: __ dispatch_only(vtos); duke@435: duke@435: if (UseLoopCounter) { duke@435: if (ProfileInterpreter) { duke@435: // Out-of-line code to allocate method data oop. duke@435: __ bind(profile_method); duke@435: __ call_VM(noreg, duke@435: CAST_FROM_FN_PTR(address, duke@435: InterpreterRuntime::profile_method), r13); duke@435: __ load_unsigned_byte(rbx, Address(r13, 0)); // restore target bytecode never@739: __ movptr(rcx, Address(rbp, method_offset)); never@739: __ movptr(rcx, Address(rcx, never@739: in_bytes(methodOopDesc::method_data_offset()))); never@739: __ movptr(Address(rbp, frame::interpreter_frame_mdx_offset * wordSize), never@739: rcx); duke@435: __ test_method_data_pointer(rcx, dispatch); duke@435: // offset non-null mdp by MDO::data_offset() + IR::profile_method() never@739: __ addptr(rcx, in_bytes(methodDataOopDesc::data_offset())); never@739: __ addptr(rcx, rax); never@739: __ movptr(Address(rbp, frame::interpreter_frame_mdx_offset * wordSize), never@739: rcx); duke@435: __ jmp(dispatch); duke@435: } duke@435: duke@435: if (UseOnStackReplacement) { duke@435: // invocation counter overflow duke@435: __ bind(backedge_counter_overflow); never@739: __ negptr(rdx); never@739: __ addptr(rdx, r13); // branch bcp duke@435: // IcoResult frequency_counter_overflow([JavaThread*], address branch_bcp) duke@435: __ call_VM(noreg, duke@435: CAST_FROM_FN_PTR(address, duke@435: InterpreterRuntime::frequency_counter_overflow), duke@435: rdx); duke@435: __ load_unsigned_byte(rbx, Address(r13, 0)); // restore target bytecode duke@435: duke@435: // rax: osr nmethod (osr ok) or NULL (osr not possible) duke@435: // ebx: target bytecode duke@435: // rdx: scratch duke@435: // r14: locals pointer duke@435: // r13: bcp never@739: __ testptr(rax, rax); // test result duke@435: __ jcc(Assembler::zero, dispatch); // no osr if null duke@435: // nmethod may have been invalidated (VM may block upon call_VM return) duke@435: __ movl(rcx, Address(rax, nmethod::entry_bci_offset())); duke@435: __ cmpl(rcx, InvalidOSREntryBci); duke@435: __ jcc(Assembler::equal, dispatch); duke@435: duke@435: // We have the address of an on stack replacement routine in eax duke@435: // We need to prepare to execute the OSR method. First we must duke@435: // migrate the locals and monitors off of the stack. duke@435: never@739: __ mov(r13, rax); // save the nmethod duke@435: duke@435: call_VM(noreg, CAST_FROM_FN_PTR(address, SharedRuntime::OSR_migration_begin)); duke@435: duke@435: // eax is OSR buffer, move it to expected parameter location never@739: __ mov(j_rarg0, rax); duke@435: duke@435: // We use j_rarg definitions here so that registers don't conflict as parameter duke@435: // registers change across platforms as we are in the midst of a calling duke@435: // sequence to the OSR nmethod and we don't want collision. These are NOT parameters. duke@435: duke@435: const Register retaddr = j_rarg2; duke@435: const Register sender_sp = j_rarg1; duke@435: duke@435: // pop the interpreter frame never@739: __ movptr(sender_sp, Address(rbp, frame::interpreter_frame_sender_sp_offset * wordSize)); // get sender sp duke@435: __ leave(); // remove frame anchor never@739: __ pop(retaddr); // get return address never@739: __ mov(rsp, sender_sp); // set sp to sender sp duke@435: // Ensure compiled code always sees stack at proper alignment never@739: __ andptr(rsp, -(StackAlignmentInBytes)); duke@435: duke@435: // unlike x86 we need no specialized return from compiled code duke@435: // to the interpreter or the call stub. duke@435: duke@435: // push the return address never@739: __ push(retaddr); duke@435: duke@435: // and begin the OSR nmethod duke@435: __ jmp(Address(r13, nmethod::osr_entry_point_offset())); duke@435: } duke@435: } duke@435: } duke@435: duke@435: duke@435: void TemplateTable::if_0cmp(Condition cc) { duke@435: transition(itos, vtos); duke@435: // assume branch is more often taken than not (loops use backward branches) duke@435: Label not_taken; duke@435: __ testl(rax, rax); duke@435: __ jcc(j_not(cc), not_taken); duke@435: branch(false, false); duke@435: __ bind(not_taken); duke@435: __ profile_not_taken_branch(rax); duke@435: } duke@435: duke@435: void TemplateTable::if_icmp(Condition cc) { duke@435: transition(itos, vtos); duke@435: // assume branch is more often taken than not (loops use backward branches) duke@435: Label not_taken; duke@435: __ pop_i(rdx); duke@435: __ cmpl(rdx, rax); duke@435: __ jcc(j_not(cc), not_taken); duke@435: branch(false, false); duke@435: __ bind(not_taken); duke@435: __ profile_not_taken_branch(rax); duke@435: } duke@435: duke@435: void TemplateTable::if_nullcmp(Condition cc) { duke@435: transition(atos, vtos); duke@435: // assume branch is more often taken than not (loops use backward branches) duke@435: Label not_taken; never@739: __ testptr(rax, rax); duke@435: __ jcc(j_not(cc), not_taken); duke@435: branch(false, false); duke@435: __ bind(not_taken); duke@435: __ profile_not_taken_branch(rax); duke@435: } duke@435: duke@435: void TemplateTable::if_acmp(Condition cc) { duke@435: transition(atos, vtos); duke@435: // assume branch is more often taken than not (loops use backward branches) duke@435: Label not_taken; duke@435: __ pop_ptr(rdx); never@739: __ cmpptr(rdx, rax); duke@435: __ jcc(j_not(cc), not_taken); duke@435: branch(false, false); duke@435: __ bind(not_taken); duke@435: __ profile_not_taken_branch(rax); duke@435: } duke@435: duke@435: void TemplateTable::ret() { duke@435: transition(vtos, vtos); duke@435: locals_index(rbx); never@739: __ movslq(rbx, iaddress(rbx)); // get return bci, compute return bcp duke@435: __ profile_ret(rbx, rcx); duke@435: __ get_method(rax); never@739: __ movptr(r13, Address(rax, methodOopDesc::const_offset())); never@739: __ lea(r13, Address(r13, rbx, Address::times_1, never@739: constMethodOopDesc::codes_offset())); duke@435: __ dispatch_next(vtos); duke@435: } duke@435: duke@435: void TemplateTable::wide_ret() { duke@435: transition(vtos, vtos); duke@435: locals_index_wide(rbx); never@739: __ movptr(rbx, aaddress(rbx)); // get return bci, compute return bcp duke@435: __ profile_ret(rbx, rcx); duke@435: __ get_method(rax); never@739: __ movptr(r13, Address(rax, methodOopDesc::const_offset())); never@739: __ lea(r13, Address(r13, rbx, Address::times_1, constMethodOopDesc::codes_offset())); duke@435: __ dispatch_next(vtos); duke@435: } duke@435: duke@435: void TemplateTable::tableswitch() { duke@435: Label default_case, continue_execution; duke@435: transition(itos, vtos); duke@435: // align r13 never@739: __ lea(rbx, at_bcp(BytesPerInt)); never@739: __ andptr(rbx, -BytesPerInt); duke@435: // load lo & hi duke@435: __ movl(rcx, Address(rbx, BytesPerInt)); duke@435: __ movl(rdx, Address(rbx, 2 * BytesPerInt)); duke@435: __ bswapl(rcx); duke@435: __ bswapl(rdx); duke@435: // check against lo & hi duke@435: __ cmpl(rax, rcx); duke@435: __ jcc(Assembler::less, default_case); duke@435: __ cmpl(rax, rdx); duke@435: __ jcc(Assembler::greater, default_case); duke@435: // lookup dispatch offset duke@435: __ subl(rax, rcx); duke@435: __ movl(rdx, Address(rbx, rax, Address::times_4, 3 * BytesPerInt)); duke@435: __ profile_switch_case(rax, rbx, rcx); duke@435: // continue execution duke@435: __ bind(continue_execution); duke@435: __ bswapl(rdx); never@739: __ movl2ptr(rdx, rdx); duke@435: __ load_unsigned_byte(rbx, Address(r13, rdx, Address::times_1)); never@739: __ addptr(r13, rdx); duke@435: __ dispatch_only(vtos); duke@435: // handle default duke@435: __ bind(default_case); duke@435: __ profile_switch_default(rax); duke@435: __ movl(rdx, Address(rbx, 0)); duke@435: __ jmp(continue_execution); duke@435: } duke@435: duke@435: void TemplateTable::lookupswitch() { duke@435: transition(itos, itos); duke@435: __ stop("lookupswitch bytecode should have been rewritten"); duke@435: } duke@435: duke@435: void TemplateTable::fast_linearswitch() { duke@435: transition(itos, vtos); duke@435: Label loop_entry, loop, found, continue_execution; duke@435: // bswap rax so we can avoid bswapping the table entries duke@435: __ bswapl(rax); duke@435: // align r13 never@739: __ lea(rbx, at_bcp(BytesPerInt)); // btw: should be able to get rid of never@739: // this instruction (change offsets never@739: // below) never@739: __ andptr(rbx, -BytesPerInt); duke@435: // set counter duke@435: __ movl(rcx, Address(rbx, BytesPerInt)); duke@435: __ bswapl(rcx); duke@435: __ jmpb(loop_entry); duke@435: // table search duke@435: __ bind(loop); duke@435: __ cmpl(rax, Address(rbx, rcx, Address::times_8, 2 * BytesPerInt)); duke@435: __ jcc(Assembler::equal, found); duke@435: __ bind(loop_entry); duke@435: __ decrementl(rcx); duke@435: __ jcc(Assembler::greaterEqual, loop); duke@435: // default case duke@435: __ profile_switch_default(rax); duke@435: __ movl(rdx, Address(rbx, 0)); duke@435: __ jmp(continue_execution); duke@435: // entry found -> get offset duke@435: __ bind(found); duke@435: __ movl(rdx, Address(rbx, rcx, Address::times_8, 3 * BytesPerInt)); duke@435: __ profile_switch_case(rcx, rax, rbx); duke@435: // continue execution duke@435: __ bind(continue_execution); duke@435: __ bswapl(rdx); never@739: __ movl2ptr(rdx, rdx); duke@435: __ load_unsigned_byte(rbx, Address(r13, rdx, Address::times_1)); never@739: __ addptr(r13, rdx); duke@435: __ dispatch_only(vtos); duke@435: } duke@435: duke@435: void TemplateTable::fast_binaryswitch() { duke@435: transition(itos, vtos); duke@435: // Implementation using the following core algorithm: duke@435: // duke@435: // int binary_search(int key, LookupswitchPair* array, int n) { duke@435: // // Binary search according to "Methodik des Programmierens" by duke@435: // // Edsger W. Dijkstra and W.H.J. Feijen, Addison Wesley Germany 1985. duke@435: // int i = 0; duke@435: // int j = n; duke@435: // while (i+1 < j) { duke@435: // // invariant P: 0 <= i < j <= n and (a[i] <= key < a[j] or Q) duke@435: // // with Q: for all i: 0 <= i < n: key < a[i] duke@435: // // where a stands for the array and assuming that the (inexisting) duke@435: // // element a[n] is infinitely big. duke@435: // int h = (i + j) >> 1; duke@435: // // i < h < j duke@435: // if (key < array[h].fast_match()) { duke@435: // j = h; duke@435: // } else { duke@435: // i = h; duke@435: // } duke@435: // } duke@435: // // R: a[i] <= key < a[i+1] or Q duke@435: // // (i.e., if key is within array, i is the correct index) duke@435: // return i; duke@435: // } duke@435: duke@435: // Register allocation duke@435: const Register key = rax; // already set (tosca) duke@435: const Register array = rbx; duke@435: const Register i = rcx; duke@435: const Register j = rdx; duke@435: const Register h = rdi; duke@435: const Register temp = rsi; duke@435: duke@435: // Find array start never@739: __ lea(array, at_bcp(3 * BytesPerInt)); // btw: should be able to never@739: // get rid of this never@739: // instruction (change never@739: // offsets below) never@739: __ andptr(array, -BytesPerInt); duke@435: duke@435: // Initialize i & j duke@435: __ xorl(i, i); // i = 0; duke@435: __ movl(j, Address(array, -BytesPerInt)); // j = length(array); duke@435: duke@435: // Convert j into native byteordering duke@435: __ bswapl(j); duke@435: duke@435: // And start duke@435: Label entry; duke@435: __ jmp(entry); duke@435: duke@435: // binary search loop duke@435: { duke@435: Label loop; duke@435: __ bind(loop); duke@435: // int h = (i + j) >> 1; duke@435: __ leal(h, Address(i, j, Address::times_1)); // h = i + j; duke@435: __ sarl(h, 1); // h = (i + j) >> 1; duke@435: // if (key < array[h].fast_match()) { duke@435: // j = h; duke@435: // } else { duke@435: // i = h; duke@435: // } duke@435: // Convert array[h].match to native byte-ordering before compare duke@435: __ movl(temp, Address(array, h, Address::times_8)); duke@435: __ bswapl(temp); duke@435: __ cmpl(key, temp); duke@435: // j = h if (key < array[h].fast_match()) duke@435: __ cmovl(Assembler::less, j, h); duke@435: // i = h if (key >= array[h].fast_match()) duke@435: __ cmovl(Assembler::greaterEqual, i, h); duke@435: // while (i+1 < j) duke@435: __ bind(entry); duke@435: __ leal(h, Address(i, 1)); // i+1 duke@435: __ cmpl(h, j); // i+1 < j duke@435: __ jcc(Assembler::less, loop); duke@435: } duke@435: duke@435: // end of binary search, result index is i (must check again!) duke@435: Label default_case; duke@435: // Convert array[i].match to native byte-ordering before compare duke@435: __ movl(temp, Address(array, i, Address::times_8)); duke@435: __ bswapl(temp); duke@435: __ cmpl(key, temp); duke@435: __ jcc(Assembler::notEqual, default_case); duke@435: duke@435: // entry found -> j = offset duke@435: __ movl(j , Address(array, i, Address::times_8, BytesPerInt)); duke@435: __ profile_switch_case(i, key, array); duke@435: __ bswapl(j); never@739: __ movl2ptr(j, j); duke@435: __ load_unsigned_byte(rbx, Address(r13, j, Address::times_1)); never@739: __ addptr(r13, j); duke@435: __ dispatch_only(vtos); duke@435: duke@435: // default case -> j = default offset duke@435: __ bind(default_case); duke@435: __ profile_switch_default(i); duke@435: __ movl(j, Address(array, -2 * BytesPerInt)); duke@435: __ bswapl(j); never@739: __ movl2ptr(j, j); duke@435: __ load_unsigned_byte(rbx, Address(r13, j, Address::times_1)); never@739: __ addptr(r13, j); duke@435: __ dispatch_only(vtos); duke@435: } duke@435: duke@435: duke@435: void TemplateTable::_return(TosState state) { duke@435: transition(state, state); duke@435: assert(_desc->calls_vm(), duke@435: "inconsistent calls_vm information"); // call in remove_activation duke@435: duke@435: if (_desc->bytecode() == Bytecodes::_return_register_finalizer) { duke@435: assert(state == vtos, "only valid state"); never@739: __ movptr(c_rarg1, aaddress(0)); coleenp@548: __ load_klass(rdi, c_rarg1); duke@435: __ movl(rdi, Address(rdi, Klass::access_flags_offset_in_bytes() + sizeof(oopDesc))); duke@435: __ testl(rdi, JVM_ACC_HAS_FINALIZER); duke@435: Label skip_register_finalizer; duke@435: __ jcc(Assembler::zero, skip_register_finalizer); duke@435: duke@435: __ call_VM(noreg, CAST_FROM_FN_PTR(address, InterpreterRuntime::register_finalizer), c_rarg1); duke@435: duke@435: __ bind(skip_register_finalizer); duke@435: } duke@435: duke@435: __ remove_activation(state, r13); duke@435: __ jmp(r13); duke@435: } duke@435: duke@435: // ---------------------------------------------------------------------------- duke@435: // Volatile variables demand their effects be made known to all CPU's duke@435: // in order. Store buffers on most chips allow reads & writes to duke@435: // reorder; the JMM's ReadAfterWrite.java test fails in -Xint mode duke@435: // without some kind of memory barrier (i.e., it's not sufficient that duke@435: // the interpreter does not reorder volatile references, the hardware duke@435: // also must not reorder them). duke@435: // duke@435: // According to the new Java Memory Model (JMM): duke@435: // (1) All volatiles are serialized wrt to each other. ALSO reads & duke@435: // writes act as aquire & release, so: duke@435: // (2) A read cannot let unrelated NON-volatile memory refs that duke@435: // happen after the read float up to before the read. It's OK for duke@435: // non-volatile memory refs that happen before the volatile read to duke@435: // float down below it. duke@435: // (3) Similar a volatile write cannot let unrelated NON-volatile duke@435: // memory refs that happen BEFORE the write float down to after the duke@435: // write. It's OK for non-volatile memory refs that happen after the duke@435: // volatile write to float up before it. duke@435: // duke@435: // We only put in barriers around volatile refs (they are expensive), duke@435: // not _between_ memory refs (that would require us to track the duke@435: // flavor of the previous memory refs). Requirements (2) and (3) duke@435: // require some barriers before volatile stores and after volatile duke@435: // loads. These nearly cover requirement (1) but miss the duke@435: // volatile-store-volatile-load case. This final case is placed after duke@435: // volatile-stores although it could just as well go before duke@435: // volatile-loads. duke@435: void TemplateTable::volatile_barrier(Assembler::Membar_mask_bits duke@435: order_constraint) { duke@435: // Helper function to insert a is-volatile test and memory barrier duke@435: if (os::is_MP()) { // Not needed on single CPU duke@435: __ membar(order_constraint); duke@435: } duke@435: } duke@435: jrose@1920: void TemplateTable::resolve_cache_and_index(int byte_no, jrose@1920: Register result, jrose@1920: Register Rcache, jrose@1920: Register index, jrose@1920: size_t index_size) { duke@435: const Register temp = rbx; jrose@1920: assert_different_registers(result, Rcache, index, temp); jrose@1920: duke@435: Label resolved; jrose@1920: __ get_cache_and_index_at_bcp(Rcache, index, 1, index_size); jrose@1920: if (byte_no == f1_oop) { jrose@1920: // We are resolved if the f1 field contains a non-null object (CallSite, etc.) jrose@1920: // This kind of CP cache entry does not need to match the flags byte, because jrose@1920: // there is a 1-1 relation between bytecode type and CP entry type. jrose@1920: assert(result != noreg, ""); //else do cmpptr(Address(...), (int32_t) NULL_WORD) jrose@1920: __ movptr(result, Address(Rcache, index, Address::times_ptr, constantPoolCacheOopDesc::base_offset() + ConstantPoolCacheEntry::f1_offset())); jrose@1920: __ testptr(result, result); twisti@1543: __ jcc(Assembler::notEqual, resolved); twisti@1543: } else { jrose@1920: assert(byte_no == f1_byte || byte_no == f2_byte, "byte_no out of range"); jrose@1920: assert(result == noreg, ""); //else change code for setting result jrose@1920: const int shift_count = (1 + byte_no) * BitsPerByte; twisti@1543: __ movl(temp, Address(Rcache, index, Address::times_ptr, constantPoolCacheOopDesc::base_offset() + ConstantPoolCacheEntry::indices_offset())); twisti@1543: __ shrl(temp, shift_count); twisti@1543: // have we resolved this bytecode? twisti@1543: __ andl(temp, 0xFF); twisti@1543: __ cmpl(temp, (int) bytecode()); twisti@1543: __ jcc(Assembler::equal, resolved); twisti@1543: } duke@435: duke@435: // resolve first time through duke@435: address entry; duke@435: switch (bytecode()) { duke@435: case Bytecodes::_getstatic: duke@435: case Bytecodes::_putstatic: duke@435: case Bytecodes::_getfield: duke@435: case Bytecodes::_putfield: duke@435: entry = CAST_FROM_FN_PTR(address, InterpreterRuntime::resolve_get_put); duke@435: break; duke@435: case Bytecodes::_invokevirtual: duke@435: case Bytecodes::_invokespecial: duke@435: case Bytecodes::_invokestatic: duke@435: case Bytecodes::_invokeinterface: duke@435: entry = CAST_FROM_FN_PTR(address, InterpreterRuntime::resolve_invoke); duke@435: break; twisti@1543: case Bytecodes::_invokedynamic: twisti@1543: entry = CAST_FROM_FN_PTR(address, InterpreterRuntime::resolve_invokedynamic); twisti@1543: break; jrose@1957: case Bytecodes::_fast_aldc: jrose@1957: entry = CAST_FROM_FN_PTR(address, InterpreterRuntime::resolve_ldc); jrose@1957: break; jrose@1957: case Bytecodes::_fast_aldc_w: jrose@1957: entry = CAST_FROM_FN_PTR(address, InterpreterRuntime::resolve_ldc); jrose@1957: break; duke@435: default: duke@435: ShouldNotReachHere(); duke@435: break; duke@435: } duke@435: __ movl(temp, (int) bytecode()); duke@435: __ call_VM(noreg, entry, temp); duke@435: duke@435: // Update registers with resolved info jrose@1920: __ get_cache_and_index_at_bcp(Rcache, index, 1, index_size); jrose@1920: if (result != noreg) jrose@1920: __ movptr(result, Address(Rcache, index, Address::times_ptr, constantPoolCacheOopDesc::base_offset() + ConstantPoolCacheEntry::f1_offset())); duke@435: __ bind(resolved); duke@435: } duke@435: duke@435: // The Rcache and index registers must be set before call duke@435: void TemplateTable::load_field_cp_cache_entry(Register obj, duke@435: Register cache, duke@435: Register index, duke@435: Register off, duke@435: Register flags, duke@435: bool is_static = false) { duke@435: assert_different_registers(cache, index, flags, off); duke@435: duke@435: ByteSize cp_base_offset = constantPoolCacheOopDesc::base_offset(); duke@435: // Field offset never@739: __ movptr(off, Address(cache, index, Address::times_8, never@739: in_bytes(cp_base_offset + never@739: ConstantPoolCacheEntry::f2_offset()))); duke@435: // Flags duke@435: __ movl(flags, Address(cache, index, Address::times_8, duke@435: in_bytes(cp_base_offset + duke@435: ConstantPoolCacheEntry::flags_offset()))); duke@435: duke@435: // klass overwrite register duke@435: if (is_static) { never@739: __ movptr(obj, Address(cache, index, Address::times_8, never@739: in_bytes(cp_base_offset + never@739: ConstantPoolCacheEntry::f1_offset()))); duke@435: } duke@435: } duke@435: duke@435: void TemplateTable::load_invoke_cp_cache_entry(int byte_no, duke@435: Register method, duke@435: Register itable_index, duke@435: Register flags, duke@435: bool is_invokevirtual, jrose@1920: bool is_invokevfinal, /*unused*/ jrose@1920: bool is_invokedynamic) { duke@435: // setup registers duke@435: const Register cache = rcx; duke@435: const Register index = rdx; duke@435: assert_different_registers(method, flags); duke@435: assert_different_registers(method, cache, index); duke@435: assert_different_registers(itable_index, flags); duke@435: assert_different_registers(itable_index, cache, index); duke@435: // determine constant pool cache field offsets duke@435: const int method_offset = in_bytes( duke@435: constantPoolCacheOopDesc::base_offset() + duke@435: (is_invokevirtual duke@435: ? ConstantPoolCacheEntry::f2_offset() duke@435: : ConstantPoolCacheEntry::f1_offset())); duke@435: const int flags_offset = in_bytes(constantPoolCacheOopDesc::base_offset() + duke@435: ConstantPoolCacheEntry::flags_offset()); duke@435: // access constant pool cache fields duke@435: const int index_offset = in_bytes(constantPoolCacheOopDesc::base_offset() + duke@435: ConstantPoolCacheEntry::f2_offset()); duke@435: jrose@1920: if (byte_no == f1_oop) { jrose@1920: // Resolved f1_oop goes directly into 'method' register. jrose@1920: assert(is_invokedynamic, ""); jrose@1920: resolve_cache_and_index(byte_no, method, cache, index, sizeof(u4)); jrose@1920: } else { jrose@1920: resolve_cache_and_index(byte_no, noreg, cache, index, sizeof(u2)); jrose@1920: __ movptr(method, Address(cache, index, Address::times_ptr, method_offset)); jrose@1920: } duke@435: if (itable_index != noreg) { jrose@1920: __ movptr(itable_index, Address(cache, index, Address::times_ptr, index_offset)); duke@435: } jrose@1920: __ movl(flags, Address(cache, index, Address::times_ptr, flags_offset)); duke@435: } duke@435: duke@435: duke@435: // The registers cache and index expected to be set before call. duke@435: // Correct values of the cache and index registers are preserved. duke@435: void TemplateTable::jvmti_post_field_access(Register cache, Register index, duke@435: bool is_static, bool has_tos) { duke@435: // do the JVMTI work here to avoid disturbing the register state below duke@435: // We use c_rarg registers here because we want to use the register used in duke@435: // the call to the VM duke@435: if (JvmtiExport::can_post_field_access()) { duke@435: // Check to see if a field access watch has been set before we duke@435: // take the time to call into the VM. duke@435: Label L1; duke@435: assert_different_registers(cache, index, rax); duke@435: __ mov32(rax, ExternalAddress((address) JvmtiExport::get_field_access_count_addr())); duke@435: __ testl(rax, rax); duke@435: __ jcc(Assembler::zero, L1); duke@435: duke@435: __ get_cache_and_index_at_bcp(c_rarg2, c_rarg3, 1); duke@435: duke@435: // cache entry pointer never@739: __ addptr(c_rarg2, in_bytes(constantPoolCacheOopDesc::base_offset())); duke@435: __ shll(c_rarg3, LogBytesPerWord); never@739: __ addptr(c_rarg2, c_rarg3); duke@435: if (is_static) { duke@435: __ xorl(c_rarg1, c_rarg1); // NULL object reference duke@435: } else { never@739: __ movptr(c_rarg1, at_tos()); // get object pointer without popping it duke@435: __ verify_oop(c_rarg1); duke@435: } duke@435: // c_rarg1: object pointer or NULL duke@435: // c_rarg2: cache entry pointer duke@435: // c_rarg3: jvalue object on the stack duke@435: __ call_VM(noreg, CAST_FROM_FN_PTR(address, duke@435: InterpreterRuntime::post_field_access), duke@435: c_rarg1, c_rarg2, c_rarg3); duke@435: __ get_cache_and_index_at_bcp(cache, index, 1); duke@435: __ bind(L1); duke@435: } duke@435: } duke@435: duke@435: void TemplateTable::pop_and_check_object(Register r) { duke@435: __ pop_ptr(r); duke@435: __ null_check(r); // for field access must check obj. duke@435: __ verify_oop(r); duke@435: } duke@435: duke@435: void TemplateTable::getfield_or_static(int byte_no, bool is_static) { duke@435: transition(vtos, vtos); duke@435: duke@435: const Register cache = rcx; duke@435: const Register index = rdx; duke@435: const Register obj = c_rarg3; duke@435: const Register off = rbx; duke@435: const Register flags = rax; duke@435: const Register bc = c_rarg3; // uses same reg as obj, so don't mix them duke@435: jrose@1920: resolve_cache_and_index(byte_no, noreg, cache, index, sizeof(u2)); duke@435: jvmti_post_field_access(cache, index, is_static, false); duke@435: load_field_cp_cache_entry(obj, cache, index, off, flags, is_static); duke@435: duke@435: if (!is_static) { duke@435: // obj is on the stack duke@435: pop_and_check_object(obj); duke@435: } duke@435: duke@435: const Address field(obj, off, Address::times_1); duke@435: duke@435: Label Done, notByte, notInt, notShort, notChar, duke@435: notLong, notFloat, notObj, notDouble; duke@435: duke@435: __ shrl(flags, ConstantPoolCacheEntry::tosBits); duke@435: assert(btos == 0, "change code, btos != 0"); duke@435: duke@435: __ andl(flags, 0x0F); duke@435: __ jcc(Assembler::notZero, notByte); duke@435: // btos duke@435: __ load_signed_byte(rax, field); duke@435: __ push(btos); duke@435: // Rewrite bytecode to be faster duke@435: if (!is_static) { duke@435: patch_bytecode(Bytecodes::_fast_bgetfield, bc, rbx); duke@435: } duke@435: __ jmp(Done); duke@435: duke@435: __ bind(notByte); duke@435: __ cmpl(flags, atos); duke@435: __ jcc(Assembler::notEqual, notObj); duke@435: // atos coleenp@548: __ load_heap_oop(rax, field); duke@435: __ push(atos); duke@435: if (!is_static) { duke@435: patch_bytecode(Bytecodes::_fast_agetfield, bc, rbx); duke@435: } duke@435: __ jmp(Done); duke@435: duke@435: __ bind(notObj); duke@435: __ cmpl(flags, itos); duke@435: __ jcc(Assembler::notEqual, notInt); duke@435: // itos duke@435: __ movl(rax, field); duke@435: __ push(itos); duke@435: // Rewrite bytecode to be faster duke@435: if (!is_static) { duke@435: patch_bytecode(Bytecodes::_fast_igetfield, bc, rbx); duke@435: } duke@435: __ jmp(Done); duke@435: duke@435: __ bind(notInt); duke@435: __ cmpl(flags, ctos); duke@435: __ jcc(Assembler::notEqual, notChar); duke@435: // ctos jrose@1057: __ load_unsigned_short(rax, field); duke@435: __ push(ctos); duke@435: // Rewrite bytecode to be faster duke@435: if (!is_static) { duke@435: patch_bytecode(Bytecodes::_fast_cgetfield, bc, rbx); duke@435: } duke@435: __ jmp(Done); duke@435: duke@435: __ bind(notChar); duke@435: __ cmpl(flags, stos); duke@435: __ jcc(Assembler::notEqual, notShort); duke@435: // stos jrose@1057: __ load_signed_short(rax, field); duke@435: __ push(stos); duke@435: // Rewrite bytecode to be faster duke@435: if (!is_static) { duke@435: patch_bytecode(Bytecodes::_fast_sgetfield, bc, rbx); duke@435: } duke@435: __ jmp(Done); duke@435: duke@435: __ bind(notShort); duke@435: __ cmpl(flags, ltos); duke@435: __ jcc(Assembler::notEqual, notLong); duke@435: // ltos duke@435: __ movq(rax, field); duke@435: __ push(ltos); duke@435: // Rewrite bytecode to be faster duke@435: if (!is_static) { duke@435: patch_bytecode(Bytecodes::_fast_lgetfield, bc, rbx); duke@435: } duke@435: __ jmp(Done); duke@435: duke@435: __ bind(notLong); duke@435: __ cmpl(flags, ftos); duke@435: __ jcc(Assembler::notEqual, notFloat); duke@435: // ftos duke@435: __ movflt(xmm0, field); duke@435: __ push(ftos); duke@435: // Rewrite bytecode to be faster duke@435: if (!is_static) { duke@435: patch_bytecode(Bytecodes::_fast_fgetfield, bc, rbx); duke@435: } duke@435: __ jmp(Done); duke@435: duke@435: __ bind(notFloat); duke@435: #ifdef ASSERT duke@435: __ cmpl(flags, dtos); duke@435: __ jcc(Assembler::notEqual, notDouble); duke@435: #endif duke@435: // dtos duke@435: __ movdbl(xmm0, field); duke@435: __ push(dtos); duke@435: // Rewrite bytecode to be faster duke@435: if (!is_static) { duke@435: patch_bytecode(Bytecodes::_fast_dgetfield, bc, rbx); duke@435: } duke@435: #ifdef ASSERT duke@435: __ jmp(Done); duke@435: duke@435: __ bind(notDouble); duke@435: __ stop("Bad state"); duke@435: #endif duke@435: duke@435: __ bind(Done); duke@435: // [jk] not needed currently duke@435: // volatile_barrier(Assembler::Membar_mask_bits(Assembler::LoadLoad | duke@435: // Assembler::LoadStore)); duke@435: } duke@435: duke@435: duke@435: void TemplateTable::getfield(int byte_no) { duke@435: getfield_or_static(byte_no, false); duke@435: } duke@435: duke@435: void TemplateTable::getstatic(int byte_no) { duke@435: getfield_or_static(byte_no, true); duke@435: } duke@435: duke@435: // The registers cache and index expected to be set before call. duke@435: // The function may destroy various registers, just not the cache and index registers. duke@435: void TemplateTable::jvmti_post_field_mod(Register cache, Register index, bool is_static) { duke@435: transition(vtos, vtos); duke@435: duke@435: ByteSize cp_base_offset = constantPoolCacheOopDesc::base_offset(); duke@435: duke@435: if (JvmtiExport::can_post_field_modification()) { duke@435: // Check to see if a field modification watch has been set before duke@435: // we take the time to call into the VM. duke@435: Label L1; duke@435: assert_different_registers(cache, index, rax); duke@435: __ mov32(rax, ExternalAddress((address)JvmtiExport::get_field_modification_count_addr())); duke@435: __ testl(rax, rax); duke@435: __ jcc(Assembler::zero, L1); duke@435: duke@435: __ get_cache_and_index_at_bcp(c_rarg2, rscratch1, 1); duke@435: duke@435: if (is_static) { duke@435: // Life is simple. Null out the object pointer. duke@435: __ xorl(c_rarg1, c_rarg1); duke@435: } else { duke@435: // Life is harder. The stack holds the value on top, followed by duke@435: // the object. We don't know the size of the value, though; it duke@435: // could be one or two words depending on its type. As a result, duke@435: // we must find the type to determine where the object is. duke@435: __ movl(c_rarg3, Address(c_rarg2, rscratch1, duke@435: Address::times_8, duke@435: in_bytes(cp_base_offset + duke@435: ConstantPoolCacheEntry::flags_offset()))); duke@435: __ shrl(c_rarg3, ConstantPoolCacheEntry::tosBits); duke@435: // Make sure we don't need to mask rcx for tosBits after the duke@435: // above shift duke@435: ConstantPoolCacheEntry::verify_tosBits(); never@739: __ movptr(c_rarg1, at_tos_p1()); // initially assume a one word jvalue duke@435: __ cmpl(c_rarg3, ltos); never@739: __ cmovptr(Assembler::equal, never@739: c_rarg1, at_tos_p2()); // ltos (two word jvalue) duke@435: __ cmpl(c_rarg3, dtos); never@739: __ cmovptr(Assembler::equal, never@739: c_rarg1, at_tos_p2()); // dtos (two word jvalue) duke@435: } duke@435: // cache entry pointer never@739: __ addptr(c_rarg2, in_bytes(cp_base_offset)); duke@435: __ shll(rscratch1, LogBytesPerWord); never@739: __ addptr(c_rarg2, rscratch1); duke@435: // object (tos) never@739: __ mov(c_rarg3, rsp); duke@435: // c_rarg1: object pointer set up above (NULL if static) duke@435: // c_rarg2: cache entry pointer duke@435: // c_rarg3: jvalue object on the stack duke@435: __ call_VM(noreg, duke@435: CAST_FROM_FN_PTR(address, duke@435: InterpreterRuntime::post_field_modification), duke@435: c_rarg1, c_rarg2, c_rarg3); duke@435: __ get_cache_and_index_at_bcp(cache, index, 1); duke@435: __ bind(L1); duke@435: } duke@435: } duke@435: duke@435: void TemplateTable::putfield_or_static(int byte_no, bool is_static) { duke@435: transition(vtos, vtos); duke@435: duke@435: const Register cache = rcx; duke@435: const Register index = rdx; duke@435: const Register obj = rcx; duke@435: const Register off = rbx; duke@435: const Register flags = rax; duke@435: const Register bc = c_rarg3; duke@435: jrose@1920: resolve_cache_and_index(byte_no, noreg, cache, index, sizeof(u2)); duke@435: jvmti_post_field_mod(cache, index, is_static); duke@435: load_field_cp_cache_entry(obj, cache, index, off, flags, is_static); duke@435: duke@435: // [jk] not needed currently duke@435: // volatile_barrier(Assembler::Membar_mask_bits(Assembler::LoadStore | duke@435: // Assembler::StoreStore)); duke@435: duke@435: Label notVolatile, Done; duke@435: __ movl(rdx, flags); duke@435: __ shrl(rdx, ConstantPoolCacheEntry::volatileField); duke@435: __ andl(rdx, 0x1); duke@435: duke@435: // field address duke@435: const Address field(obj, off, Address::times_1); duke@435: duke@435: Label notByte, notInt, notShort, notChar, duke@435: notLong, notFloat, notObj, notDouble; duke@435: duke@435: __ shrl(flags, ConstantPoolCacheEntry::tosBits); duke@435: duke@435: assert(btos == 0, "change code, btos != 0"); duke@435: __ andl(flags, 0x0f); duke@435: __ jcc(Assembler::notZero, notByte); duke@435: // btos duke@435: __ pop(btos); duke@435: if (!is_static) pop_and_check_object(obj); duke@435: __ movb(field, rax); duke@435: if (!is_static) { duke@435: patch_bytecode(Bytecodes::_fast_bputfield, bc, rbx); duke@435: } duke@435: __ jmp(Done); duke@435: duke@435: __ bind(notByte); duke@435: __ cmpl(flags, atos); duke@435: __ jcc(Assembler::notEqual, notObj); duke@435: // atos duke@435: __ pop(atos); duke@435: if (!is_static) pop_and_check_object(obj); ysr@777: ysr@777: // Store into the field ysr@777: do_oop_store(_masm, field, rax, _bs->kind(), false); ysr@777: duke@435: if (!is_static) { duke@435: patch_bytecode(Bytecodes::_fast_aputfield, bc, rbx); duke@435: } duke@435: __ jmp(Done); duke@435: duke@435: __ bind(notObj); duke@435: __ cmpl(flags, itos); duke@435: __ jcc(Assembler::notEqual, notInt); duke@435: // itos duke@435: __ pop(itos); duke@435: if (!is_static) pop_and_check_object(obj); duke@435: __ movl(field, rax); duke@435: if (!is_static) { duke@435: patch_bytecode(Bytecodes::_fast_iputfield, bc, rbx); duke@435: } duke@435: __ jmp(Done); duke@435: duke@435: __ bind(notInt); duke@435: __ cmpl(flags, ctos); duke@435: __ jcc(Assembler::notEqual, notChar); duke@435: // ctos duke@435: __ pop(ctos); duke@435: if (!is_static) pop_and_check_object(obj); duke@435: __ movw(field, rax); duke@435: if (!is_static) { duke@435: patch_bytecode(Bytecodes::_fast_cputfield, bc, rbx); duke@435: } duke@435: __ jmp(Done); duke@435: duke@435: __ bind(notChar); duke@435: __ cmpl(flags, stos); duke@435: __ jcc(Assembler::notEqual, notShort); duke@435: // stos duke@435: __ pop(stos); duke@435: if (!is_static) pop_and_check_object(obj); duke@435: __ movw(field, rax); duke@435: if (!is_static) { duke@435: patch_bytecode(Bytecodes::_fast_sputfield, bc, rbx); duke@435: } duke@435: __ jmp(Done); duke@435: duke@435: __ bind(notShort); duke@435: __ cmpl(flags, ltos); duke@435: __ jcc(Assembler::notEqual, notLong); duke@435: // ltos duke@435: __ pop(ltos); duke@435: if (!is_static) pop_and_check_object(obj); duke@435: __ movq(field, rax); duke@435: if (!is_static) { duke@435: patch_bytecode(Bytecodes::_fast_lputfield, bc, rbx); duke@435: } duke@435: __ jmp(Done); duke@435: duke@435: __ bind(notLong); duke@435: __ cmpl(flags, ftos); duke@435: __ jcc(Assembler::notEqual, notFloat); duke@435: // ftos duke@435: __ pop(ftos); duke@435: if (!is_static) pop_and_check_object(obj); duke@435: __ movflt(field, xmm0); duke@435: if (!is_static) { duke@435: patch_bytecode(Bytecodes::_fast_fputfield, bc, rbx); duke@435: } duke@435: __ jmp(Done); duke@435: duke@435: __ bind(notFloat); duke@435: #ifdef ASSERT duke@435: __ cmpl(flags, dtos); duke@435: __ jcc(Assembler::notEqual, notDouble); duke@435: #endif duke@435: // dtos duke@435: __ pop(dtos); duke@435: if (!is_static) pop_and_check_object(obj); duke@435: __ movdbl(field, xmm0); duke@435: if (!is_static) { duke@435: patch_bytecode(Bytecodes::_fast_dputfield, bc, rbx); duke@435: } duke@435: duke@435: #ifdef ASSERT duke@435: __ jmp(Done); duke@435: duke@435: __ bind(notDouble); duke@435: __ stop("Bad state"); duke@435: #endif duke@435: duke@435: __ bind(Done); duke@435: // Check for volatile store duke@435: __ testl(rdx, rdx); duke@435: __ jcc(Assembler::zero, notVolatile); duke@435: volatile_barrier(Assembler::Membar_mask_bits(Assembler::StoreLoad | duke@435: Assembler::StoreStore)); duke@435: duke@435: __ bind(notVolatile); duke@435: } duke@435: duke@435: void TemplateTable::putfield(int byte_no) { duke@435: putfield_or_static(byte_no, false); duke@435: } duke@435: duke@435: void TemplateTable::putstatic(int byte_no) { duke@435: putfield_or_static(byte_no, true); duke@435: } duke@435: duke@435: void TemplateTable::jvmti_post_fast_field_mod() { duke@435: if (JvmtiExport::can_post_field_modification()) { duke@435: // Check to see if a field modification watch has been set before duke@435: // we take the time to call into the VM. duke@435: Label L2; duke@435: __ mov32(c_rarg3, ExternalAddress((address)JvmtiExport::get_field_modification_count_addr())); duke@435: __ testl(c_rarg3, c_rarg3); duke@435: __ jcc(Assembler::zero, L2); duke@435: __ pop_ptr(rbx); // copy the object pointer from tos duke@435: __ verify_oop(rbx); duke@435: __ push_ptr(rbx); // put the object pointer back on tos never@739: __ subptr(rsp, sizeof(jvalue)); // add space for a jvalue object never@739: __ mov(c_rarg3, rsp); duke@435: const Address field(c_rarg3, 0); duke@435: duke@435: switch (bytecode()) { // load values into the jvalue object coleenp@548: case Bytecodes::_fast_aputfield: __ movq(field, rax); break; duke@435: case Bytecodes::_fast_lputfield: __ movq(field, rax); break; duke@435: case Bytecodes::_fast_iputfield: __ movl(field, rax); break; duke@435: case Bytecodes::_fast_bputfield: __ movb(field, rax); break; duke@435: case Bytecodes::_fast_sputfield: // fall through duke@435: case Bytecodes::_fast_cputfield: __ movw(field, rax); break; duke@435: case Bytecodes::_fast_fputfield: __ movflt(field, xmm0); break; duke@435: case Bytecodes::_fast_dputfield: __ movdbl(field, xmm0); break; duke@435: default: duke@435: ShouldNotReachHere(); duke@435: } duke@435: duke@435: // Save rax because call_VM() will clobber it, then use it for duke@435: // JVMTI purposes never@739: __ push(rax); duke@435: // access constant pool cache entry duke@435: __ get_cache_entry_pointer_at_bcp(c_rarg2, rax, 1); duke@435: __ verify_oop(rbx); duke@435: // rbx: object pointer copied above duke@435: // c_rarg2: cache entry pointer duke@435: // c_rarg3: jvalue object on the stack duke@435: __ call_VM(noreg, duke@435: CAST_FROM_FN_PTR(address, duke@435: InterpreterRuntime::post_field_modification), duke@435: rbx, c_rarg2, c_rarg3); never@739: __ pop(rax); // restore lower value never@739: __ addptr(rsp, sizeof(jvalue)); // release jvalue object space duke@435: __ bind(L2); duke@435: } duke@435: } duke@435: duke@435: void TemplateTable::fast_storefield(TosState state) { duke@435: transition(state, vtos); duke@435: duke@435: ByteSize base = constantPoolCacheOopDesc::base_offset(); duke@435: duke@435: jvmti_post_fast_field_mod(); duke@435: duke@435: // access constant pool cache duke@435: __ get_cache_and_index_at_bcp(rcx, rbx, 1); duke@435: duke@435: // test for volatile with rdx duke@435: __ movl(rdx, Address(rcx, rbx, Address::times_8, duke@435: in_bytes(base + duke@435: ConstantPoolCacheEntry::flags_offset()))); duke@435: duke@435: // replace index with field offset from cache entry never@739: __ movptr(rbx, Address(rcx, rbx, Address::times_8, never@739: in_bytes(base + ConstantPoolCacheEntry::f2_offset()))); duke@435: duke@435: // [jk] not needed currently duke@435: // volatile_barrier(Assembler::Membar_mask_bits(Assembler::LoadStore | duke@435: // Assembler::StoreStore)); duke@435: duke@435: Label notVolatile; duke@435: __ shrl(rdx, ConstantPoolCacheEntry::volatileField); duke@435: __ andl(rdx, 0x1); duke@435: duke@435: // Get object from stack duke@435: pop_and_check_object(rcx); duke@435: duke@435: // field address duke@435: const Address field(rcx, rbx, Address::times_1); duke@435: duke@435: // access field duke@435: switch (bytecode()) { duke@435: case Bytecodes::_fast_aputfield: ysr@777: do_oop_store(_masm, field, rax, _bs->kind(), false); duke@435: break; duke@435: case Bytecodes::_fast_lputfield: duke@435: __ movq(field, rax); duke@435: break; duke@435: case Bytecodes::_fast_iputfield: duke@435: __ movl(field, rax); duke@435: break; duke@435: case Bytecodes::_fast_bputfield: duke@435: __ movb(field, rax); duke@435: break; duke@435: case Bytecodes::_fast_sputfield: duke@435: // fall through duke@435: case Bytecodes::_fast_cputfield: duke@435: __ movw(field, rax); duke@435: break; duke@435: case Bytecodes::_fast_fputfield: duke@435: __ movflt(field, xmm0); duke@435: break; duke@435: case Bytecodes::_fast_dputfield: duke@435: __ movdbl(field, xmm0); duke@435: break; duke@435: default: duke@435: ShouldNotReachHere(); duke@435: } duke@435: duke@435: // Check for volatile store duke@435: __ testl(rdx, rdx); duke@435: __ jcc(Assembler::zero, notVolatile); duke@435: volatile_barrier(Assembler::Membar_mask_bits(Assembler::StoreLoad | duke@435: Assembler::StoreStore)); duke@435: __ bind(notVolatile); duke@435: } duke@435: duke@435: duke@435: void TemplateTable::fast_accessfield(TosState state) { duke@435: transition(atos, state); duke@435: duke@435: // Do the JVMTI work here to avoid disturbing the register state below duke@435: if (JvmtiExport::can_post_field_access()) { duke@435: // Check to see if a field access watch has been set before we duke@435: // take the time to call into the VM. duke@435: Label L1; duke@435: __ mov32(rcx, ExternalAddress((address) JvmtiExport::get_field_access_count_addr())); duke@435: __ testl(rcx, rcx); duke@435: __ jcc(Assembler::zero, L1); duke@435: // access constant pool cache entry duke@435: __ get_cache_entry_pointer_at_bcp(c_rarg2, rcx, 1); coleenp@548: __ verify_oop(rax); never@739: __ mov(r12, rax); // save object pointer before call_VM() clobbers it never@739: __ mov(c_rarg1, rax); duke@435: // c_rarg1: object pointer copied above duke@435: // c_rarg2: cache entry pointer duke@435: __ call_VM(noreg, duke@435: CAST_FROM_FN_PTR(address, duke@435: InterpreterRuntime::post_field_access), duke@435: c_rarg1, c_rarg2); never@739: __ mov(rax, r12); // restore object pointer coleenp@548: __ reinit_heapbase(); duke@435: __ bind(L1); duke@435: } duke@435: duke@435: // access constant pool cache duke@435: __ get_cache_and_index_at_bcp(rcx, rbx, 1); duke@435: // replace index with field offset from cache entry duke@435: // [jk] not needed currently duke@435: // if (os::is_MP()) { duke@435: // __ movl(rdx, Address(rcx, rbx, Address::times_8, duke@435: // in_bytes(constantPoolCacheOopDesc::base_offset() + duke@435: // ConstantPoolCacheEntry::flags_offset()))); duke@435: // __ shrl(rdx, ConstantPoolCacheEntry::volatileField); duke@435: // __ andl(rdx, 0x1); duke@435: // } never@739: __ movptr(rbx, Address(rcx, rbx, Address::times_8, never@739: in_bytes(constantPoolCacheOopDesc::base_offset() + never@739: ConstantPoolCacheEntry::f2_offset()))); duke@435: duke@435: // rax: object duke@435: __ verify_oop(rax); duke@435: __ null_check(rax); duke@435: Address field(rax, rbx, Address::times_1); duke@435: duke@435: // access field duke@435: switch (bytecode()) { duke@435: case Bytecodes::_fast_agetfield: coleenp@548: __ load_heap_oop(rax, field); duke@435: __ verify_oop(rax); duke@435: break; duke@435: case Bytecodes::_fast_lgetfield: duke@435: __ movq(rax, field); duke@435: break; duke@435: case Bytecodes::_fast_igetfield: duke@435: __ movl(rax, field); duke@435: break; duke@435: case Bytecodes::_fast_bgetfield: duke@435: __ movsbl(rax, field); duke@435: break; duke@435: case Bytecodes::_fast_sgetfield: jrose@1057: __ load_signed_short(rax, field); duke@435: break; duke@435: case Bytecodes::_fast_cgetfield: jrose@1057: __ load_unsigned_short(rax, field); duke@435: break; duke@435: case Bytecodes::_fast_fgetfield: duke@435: __ movflt(xmm0, field); duke@435: break; duke@435: case Bytecodes::_fast_dgetfield: duke@435: __ movdbl(xmm0, field); duke@435: break; duke@435: default: duke@435: ShouldNotReachHere(); duke@435: } duke@435: // [jk] not needed currently duke@435: // if (os::is_MP()) { duke@435: // Label notVolatile; duke@435: // __ testl(rdx, rdx); duke@435: // __ jcc(Assembler::zero, notVolatile); duke@435: // __ membar(Assembler::LoadLoad); duke@435: // __ bind(notVolatile); duke@435: //}; duke@435: } duke@435: duke@435: void TemplateTable::fast_xaccess(TosState state) { duke@435: transition(vtos, state); duke@435: duke@435: // get receiver never@739: __ movptr(rax, aaddress(0)); duke@435: // access constant pool cache duke@435: __ get_cache_and_index_at_bcp(rcx, rdx, 2); never@739: __ movptr(rbx, never@739: Address(rcx, rdx, Address::times_8, never@739: in_bytes(constantPoolCacheOopDesc::base_offset() + never@739: ConstantPoolCacheEntry::f2_offset()))); duke@435: // make sure exception is reported in correct bcp range (getfield is duke@435: // next instruction) never@739: __ increment(r13); duke@435: __ null_check(rax); duke@435: switch (state) { duke@435: case itos: duke@435: __ movl(rax, Address(rax, rbx, Address::times_1)); duke@435: break; duke@435: case atos: coleenp@548: __ load_heap_oop(rax, Address(rax, rbx, Address::times_1)); duke@435: __ verify_oop(rax); duke@435: break; duke@435: case ftos: duke@435: __ movflt(xmm0, Address(rax, rbx, Address::times_1)); duke@435: break; duke@435: default: duke@435: ShouldNotReachHere(); duke@435: } duke@435: duke@435: // [jk] not needed currently duke@435: // if (os::is_MP()) { duke@435: // Label notVolatile; duke@435: // __ movl(rdx, Address(rcx, rdx, Address::times_8, duke@435: // in_bytes(constantPoolCacheOopDesc::base_offset() + duke@435: // ConstantPoolCacheEntry::flags_offset()))); duke@435: // __ shrl(rdx, ConstantPoolCacheEntry::volatileField); duke@435: // __ testl(rdx, 0x1); duke@435: // __ jcc(Assembler::zero, notVolatile); duke@435: // __ membar(Assembler::LoadLoad); duke@435: // __ bind(notVolatile); duke@435: // } duke@435: never@739: __ decrement(r13); duke@435: } duke@435: duke@435: duke@435: duke@435: //----------------------------------------------------------------------------- duke@435: // Calls duke@435: duke@435: void TemplateTable::count_calls(Register method, Register temp) { duke@435: // implemented elsewhere duke@435: ShouldNotReachHere(); duke@435: } duke@435: twisti@1543: void TemplateTable::prepare_invoke(Register method, Register index, int byte_no) { duke@435: // determine flags twisti@1543: Bytecodes::Code code = bytecode(); duke@435: const bool is_invokeinterface = code == Bytecodes::_invokeinterface; twisti@1543: const bool is_invokedynamic = code == Bytecodes::_invokedynamic; duke@435: const bool is_invokevirtual = code == Bytecodes::_invokevirtual; duke@435: const bool is_invokespecial = code == Bytecodes::_invokespecial; twisti@1543: const bool load_receiver = (code != Bytecodes::_invokestatic && code != Bytecodes::_invokedynamic); duke@435: const bool receiver_null_check = is_invokespecial; duke@435: const bool save_flags = is_invokeinterface || is_invokevirtual; duke@435: // setup registers & access constant pool cache duke@435: const Register recv = rcx; duke@435: const Register flags = rdx; duke@435: assert_different_registers(method, index, recv, flags); duke@435: duke@435: // save 'interpreter return address' duke@435: __ save_bcp(); duke@435: jrose@1920: load_invoke_cp_cache_entry(byte_no, method, index, flags, is_invokevirtual, false, is_invokedynamic); duke@435: duke@435: // load receiver if needed (note: no return address pushed yet) duke@435: if (load_receiver) { jrose@1920: assert(!is_invokedynamic, ""); duke@435: __ movl(recv, flags); duke@435: __ andl(recv, 0xFF); twisti@1543: Address recv_addr(rsp, recv, Address::times_8, -Interpreter::expr_offset_in_bytes(1)); twisti@1739: __ movptr(recv, recv_addr); twisti@1739: __ verify_oop(recv); duke@435: } duke@435: duke@435: // do null check if needed duke@435: if (receiver_null_check) { duke@435: __ null_check(recv); duke@435: } duke@435: duke@435: if (save_flags) { duke@435: __ movl(r13, flags); duke@435: } duke@435: duke@435: // compute return type duke@435: __ shrl(flags, ConstantPoolCacheEntry::tosBits); duke@435: // Make sure we don't need to mask flags for tosBits after the above shift duke@435: ConstantPoolCacheEntry::verify_tosBits(); duke@435: // load return address duke@435: { twisti@1543: address table_addr; twisti@1543: if (is_invokeinterface || is_invokedynamic) twisti@1543: table_addr = (address)Interpreter::return_5_addrs_by_index_table(); twisti@1543: else twisti@1543: table_addr = (address)Interpreter::return_3_addrs_by_index_table(); twisti@1543: ExternalAddress table(table_addr); twisti@1543: __ lea(rscratch1, table); twisti@1543: __ movptr(flags, Address(rscratch1, flags, Address::times_ptr)); duke@435: } duke@435: duke@435: // push return address never@739: __ push(flags); duke@435: duke@435: // Restore flag field from the constant pool cache, and restore esi duke@435: // for later null checks. r13 is the bytecode pointer duke@435: if (save_flags) { duke@435: __ movl(flags, r13); duke@435: __ restore_bcp(); duke@435: } duke@435: } duke@435: duke@435: duke@435: void TemplateTable::invokevirtual_helper(Register index, duke@435: Register recv, duke@435: Register flags) { duke@435: // Uses temporary registers rax, rdx assert_different_registers(index, recv, rax, rdx); duke@435: duke@435: // Test for an invoke of a final method duke@435: Label notFinal; duke@435: __ movl(rax, flags); duke@435: __ andl(rax, (1 << ConstantPoolCacheEntry::vfinalMethod)); duke@435: __ jcc(Assembler::zero, notFinal); duke@435: duke@435: const Register method = index; // method must be rbx duke@435: assert(method == rbx, duke@435: "methodOop must be rbx for interpreter calling convention"); duke@435: duke@435: // do the call - the index is actually the method to call duke@435: __ verify_oop(method); duke@435: duke@435: // It's final, need a null check here! duke@435: __ null_check(recv); duke@435: duke@435: // profile this call duke@435: __ profile_final_call(rax); duke@435: duke@435: __ jump_from_interpreted(method, rax); duke@435: duke@435: __ bind(notFinal); duke@435: duke@435: // get receiver klass duke@435: __ null_check(recv, oopDesc::klass_offset_in_bytes()); coleenp@548: __ load_klass(rax, recv); duke@435: duke@435: __ verify_oop(rax); duke@435: duke@435: // profile this call duke@435: __ profile_virtual_call(rax, r14, rdx); duke@435: duke@435: // get target methodOop & entry point duke@435: const int base = instanceKlass::vtable_start_offset() * wordSize; duke@435: assert(vtableEntry::size() * wordSize == 8, duke@435: "adjust the scaling in the code below"); never@739: __ movptr(method, Address(rax, index, coleenp@548: Address::times_8, coleenp@548: base + vtableEntry::method_offset_in_bytes())); never@739: __ movptr(rdx, Address(method, methodOopDesc::interpreter_entry_offset())); duke@435: __ jump_from_interpreted(method, rdx); duke@435: } duke@435: duke@435: duke@435: void TemplateTable::invokevirtual(int byte_no) { duke@435: transition(vtos, vtos); jrose@1920: assert(byte_no == f2_byte, "use this argument"); twisti@1543: prepare_invoke(rbx, noreg, byte_no); duke@435: duke@435: // rbx: index duke@435: // rcx: receiver duke@435: // rdx: flags duke@435: duke@435: invokevirtual_helper(rbx, rcx, rdx); duke@435: } duke@435: duke@435: duke@435: void TemplateTable::invokespecial(int byte_no) { duke@435: transition(vtos, vtos); jrose@1920: assert(byte_no == f1_byte, "use this argument"); twisti@1543: prepare_invoke(rbx, noreg, byte_no); duke@435: // do the call duke@435: __ verify_oop(rbx); duke@435: __ profile_call(rax); duke@435: __ jump_from_interpreted(rbx, rax); duke@435: } duke@435: duke@435: duke@435: void TemplateTable::invokestatic(int byte_no) { duke@435: transition(vtos, vtos); jrose@1920: assert(byte_no == f1_byte, "use this argument"); twisti@1543: prepare_invoke(rbx, noreg, byte_no); duke@435: // do the call duke@435: __ verify_oop(rbx); duke@435: __ profile_call(rax); duke@435: __ jump_from_interpreted(rbx, rax); duke@435: } duke@435: duke@435: void TemplateTable::fast_invokevfinal(int byte_no) { duke@435: transition(vtos, vtos); jrose@1920: assert(byte_no == f2_byte, "use this argument"); duke@435: __ stop("fast_invokevfinal not used on amd64"); duke@435: } duke@435: duke@435: void TemplateTable::invokeinterface(int byte_no) { duke@435: transition(vtos, vtos); jrose@1920: assert(byte_no == f1_byte, "use this argument"); twisti@1543: prepare_invoke(rax, rbx, byte_no); duke@435: duke@435: // rax: Interface duke@435: // rbx: index duke@435: // rcx: receiver duke@435: // rdx: flags duke@435: duke@435: // Special case of invokeinterface called for virtual method of duke@435: // java.lang.Object. See cpCacheOop.cpp for details. duke@435: // This code isn't produced by javac, but could be produced by duke@435: // another compliant java compiler. duke@435: Label notMethod; duke@435: __ movl(r14, rdx); duke@435: __ andl(r14, (1 << ConstantPoolCacheEntry::methodInterface)); duke@435: __ jcc(Assembler::zero, notMethod); duke@435: duke@435: invokevirtual_helper(rbx, rcx, rdx); duke@435: __ bind(notMethod); duke@435: duke@435: // Get receiver klass into rdx - also a null check duke@435: __ restore_locals(); // restore r14 coleenp@548: __ load_klass(rdx, rcx); duke@435: __ verify_oop(rdx); duke@435: duke@435: // profile this call duke@435: __ profile_virtual_call(rdx, r13, r14); duke@435: jrose@1058: Label no_such_interface, no_such_method; jrose@1058: jrose@1058: __ lookup_interface_method(// inputs: rec. class, interface, itable index jrose@1058: rdx, rax, rbx, jrose@1058: // outputs: method, scan temp. reg jrose@1058: rbx, r13, jrose@1058: no_such_interface); jrose@1058: jrose@1058: // rbx,: methodOop to call jrose@1058: // rcx: receiver jrose@1058: // Check for abstract method error jrose@1058: // Note: This should be done more efficiently via a throw_abstract_method_error jrose@1058: // interpreter entry point and a conditional jump to it in case of a null jrose@1058: // method. jrose@1058: __ testptr(rbx, rbx); jrose@1058: __ jcc(Assembler::zero, no_such_method); jrose@1058: jrose@1058: // do the call jrose@1058: // rcx: receiver jrose@1058: // rbx,: methodOop jrose@1058: __ jump_from_interpreted(rbx, rdx); jrose@1058: __ should_not_reach_here(); jrose@1058: jrose@1058: // exception handling code follows... jrose@1058: // note: must restore interpreter registers to canonical jrose@1058: // state for exception handling to work correctly! jrose@1058: jrose@1058: __ bind(no_such_method); duke@435: // throw exception jrose@1058: __ pop(rbx); // pop return address (pushed by prepare_invoke) jrose@1058: __ restore_bcp(); // r13 must be correct for exception handler (was destroyed) jrose@1058: __ restore_locals(); // make sure locals pointer is correct as well (was destroyed) jrose@1058: __ call_VM(noreg, CAST_FROM_FN_PTR(address, InterpreterRuntime::throw_AbstractMethodError)); jrose@1058: // the call_VM checks for exception, so we should never return here. jrose@1058: __ should_not_reach_here(); jrose@1058: jrose@1058: __ bind(no_such_interface); jrose@1058: // throw exception jrose@1058: __ pop(rbx); // pop return address (pushed by prepare_invoke) jrose@1058: __ restore_bcp(); // r13 must be correct for exception handler (was destroyed) jrose@1058: __ restore_locals(); // make sure locals pointer is correct as well (was destroyed) duke@435: __ call_VM(noreg, CAST_FROM_FN_PTR(address, duke@435: InterpreterRuntime::throw_IncompatibleClassChangeError)); duke@435: // the call_VM checks for exception, so we should never return here. duke@435: __ should_not_reach_here(); jrose@1058: return; duke@435: } duke@435: jrose@1161: void TemplateTable::invokedynamic(int byte_no) { jrose@1161: transition(vtos, vtos); jrose@1920: assert(byte_no == f1_oop, "use this argument"); jrose@1161: jrose@1161: if (!EnableInvokeDynamic) { jrose@1161: // We should not encounter this bytecode if !EnableInvokeDynamic. jrose@1161: // The verifier will stop it. However, if we get past the verifier, jrose@1161: // this will stop the thread in a reasonable way, without crashing the JVM. jrose@1161: __ call_VM(noreg, CAST_FROM_FN_PTR(address, jrose@1161: InterpreterRuntime::throw_IncompatibleClassChangeError)); jrose@1161: // the call_VM checks for exception, so we should never return here. jrose@1161: __ should_not_reach_here(); jrose@1161: return; jrose@1161: } jrose@1161: jrose@1920: assert(byte_no == f1_oop, "use this argument"); twisti@1543: prepare_invoke(rax, rbx, byte_no); twisti@1543: twisti@1543: // rax: CallSite object (f1) twisti@1543: // rbx: unused (f2) twisti@1543: // rcx: receiver address twisti@1543: // rdx: flags (unused) twisti@1543: twisti@1543: if (ProfileInterpreter) { twisti@1543: Label L; twisti@1543: // %%% should make a type profile for any invokedynamic that takes a ref argument twisti@1543: // profile this call twisti@1543: __ profile_call(r13); twisti@1543: } twisti@1543: twisti@1543: __ movptr(rcx, Address(rax, __ delayed_value(java_dyn_CallSite::target_offset_in_bytes, rcx))); twisti@1543: __ null_check(rcx); twisti@1543: __ prepare_to_jump_from_interpreted(); twisti@1543: __ jump_to_method_handle_entry(rcx, rdx); jrose@1161: } jrose@1161: jrose@1058: duke@435: //----------------------------------------------------------------------------- duke@435: // Allocation duke@435: duke@435: void TemplateTable::_new() { duke@435: transition(vtos, atos); duke@435: __ get_unsigned_2_byte_index_at_bcp(rdx, 1); duke@435: Label slow_case; duke@435: Label done; duke@435: Label initialize_header; duke@435: Label initialize_object; // including clearing the fields duke@435: Label allocate_shared; duke@435: duke@435: __ get_cpool_and_tags(rsi, rax); bobv@2036: // Make sure the class we're about to instantiate has been resolved. bobv@2036: // This is done before loading instanceKlass to be consistent with the order bobv@2036: // how Constant Pool is updated (see constantPoolOopDesc::klass_at_put) duke@435: const int tags_offset = typeArrayOopDesc::header_size(T_BYTE) * wordSize; duke@435: __ cmpb(Address(rax, rdx, Address::times_1, tags_offset), duke@435: JVM_CONSTANT_Class); duke@435: __ jcc(Assembler::notEqual, slow_case); duke@435: bobv@2036: // get instanceKlass bobv@2036: __ movptr(rsi, Address(rsi, rdx, bobv@2036: Address::times_8, sizeof(constantPoolOopDesc))); bobv@2036: duke@435: // make sure klass is initialized & doesn't have finalizer duke@435: // make sure klass is fully initialized duke@435: __ cmpl(Address(rsi, duke@435: instanceKlass::init_state_offset_in_bytes() + duke@435: sizeof(oopDesc)), duke@435: instanceKlass::fully_initialized); duke@435: __ jcc(Assembler::notEqual, slow_case); duke@435: duke@435: // get instance_size in instanceKlass (scaled to a count of bytes) duke@435: __ movl(rdx, duke@435: Address(rsi, duke@435: Klass::layout_helper_offset_in_bytes() + sizeof(oopDesc))); duke@435: // test to see if it has a finalizer or is malformed in some way duke@435: __ testl(rdx, Klass::_lh_instance_slow_path_bit); duke@435: __ jcc(Assembler::notZero, slow_case); duke@435: duke@435: // Allocate the instance duke@435: // 1) Try to allocate in the TLAB duke@435: // 2) if fail and the object is large allocate in the shared Eden duke@435: // 3) if the above fails (or is not applicable), go to a slow case duke@435: // (creates a new TLAB, etc.) duke@435: duke@435: const bool allow_shared_alloc = duke@435: Universe::heap()->supports_inline_contig_alloc() && !CMSIncrementalMode; duke@435: duke@435: if (UseTLAB) { never@739: __ movptr(rax, Address(r15_thread, in_bytes(JavaThread::tlab_top_offset()))); never@739: __ lea(rbx, Address(rax, rdx, Address::times_1)); never@739: __ cmpptr(rbx, Address(r15_thread, in_bytes(JavaThread::tlab_end_offset()))); duke@435: __ jcc(Assembler::above, allow_shared_alloc ? allocate_shared : slow_case); never@739: __ movptr(Address(r15_thread, in_bytes(JavaThread::tlab_top_offset())), rbx); duke@435: if (ZeroTLAB) { duke@435: // the fields have been already cleared duke@435: __ jmp(initialize_header); duke@435: } else { duke@435: // initialize both the header and fields duke@435: __ jmp(initialize_object); duke@435: } duke@435: } duke@435: duke@435: // Allocation in the shared Eden, if allowed. duke@435: // duke@435: // rdx: instance size in bytes duke@435: if (allow_shared_alloc) { duke@435: __ bind(allocate_shared); duke@435: ysr@777: ExternalAddress top((address)Universe::heap()->top_addr()); ysr@777: ExternalAddress end((address)Universe::heap()->end_addr()); ysr@777: duke@435: const Register RtopAddr = rscratch1; duke@435: const Register RendAddr = rscratch2; duke@435: duke@435: __ lea(RtopAddr, top); duke@435: __ lea(RendAddr, end); never@739: __ movptr(rax, Address(RtopAddr, 0)); duke@435: duke@435: // For retries rax gets set by cmpxchgq duke@435: Label retry; duke@435: __ bind(retry); never@739: __ lea(rbx, Address(rax, rdx, Address::times_1)); never@739: __ cmpptr(rbx, Address(RendAddr, 0)); duke@435: __ jcc(Assembler::above, slow_case); duke@435: duke@435: // Compare rax with the top addr, and if still equal, store the new duke@435: // top addr in rbx at the address of the top addr pointer. Sets ZF if was duke@435: // equal, and clears it otherwise. Use lock prefix for atomicity on MPs. duke@435: // duke@435: // rax: object begin duke@435: // rbx: object end duke@435: // rdx: instance size in bytes duke@435: if (os::is_MP()) { duke@435: __ lock(); duke@435: } never@739: __ cmpxchgptr(rbx, Address(RtopAddr, 0)); duke@435: duke@435: // if someone beat us on the allocation, try again, otherwise continue duke@435: __ jcc(Assembler::notEqual, retry); duke@435: } duke@435: duke@435: if (UseTLAB || Universe::heap()->supports_inline_contig_alloc()) { duke@435: // The object is initialized before the header. If the object size is duke@435: // zero, go directly to the header initialization. duke@435: __ bind(initialize_object); duke@435: __ decrementl(rdx, sizeof(oopDesc)); duke@435: __ jcc(Assembler::zero, initialize_header); duke@435: duke@435: // Initialize object fields duke@435: __ xorl(rcx, rcx); // use zero reg to clear memory (shorter code) duke@435: __ shrl(rdx, LogBytesPerLong); // divide by oopSize to simplify the loop duke@435: { duke@435: Label loop; duke@435: __ bind(loop); duke@435: __ movq(Address(rax, rdx, Address::times_8, duke@435: sizeof(oopDesc) - oopSize), duke@435: rcx); duke@435: __ decrementl(rdx); duke@435: __ jcc(Assembler::notZero, loop); duke@435: } duke@435: duke@435: // initialize object header only. duke@435: __ bind(initialize_header); duke@435: if (UseBiasedLocking) { never@739: __ movptr(rscratch1, Address(rsi, Klass::prototype_header_offset_in_bytes() + klassOopDesc::klass_part_offset_in_bytes())); never@739: __ movptr(Address(rax, oopDesc::mark_offset_in_bytes()), rscratch1); duke@435: } else { duke@435: __ movptr(Address(rax, oopDesc::mark_offset_in_bytes()), duke@435: (intptr_t) markOopDesc::prototype()); // header (address 0x1) duke@435: } coleenp@602: __ xorl(rcx, rcx); // use zero reg to clear memory (shorter code) coleenp@602: __ store_klass_gap(rax, rcx); // zero klass gap for compressed oops coleenp@602: __ store_klass(rax, rsi); // store klass last kamg@1683: kamg@1683: { kamg@1683: SkipIfEqual skip(_masm, &DTraceAllocProbes, false); kamg@1683: // Trigger dtrace event for fastpath kamg@1683: __ push(atos); // save the return value kamg@1683: __ call_VM_leaf( kamg@1683: CAST_FROM_FN_PTR(address, SharedRuntime::dtrace_object_alloc), rax); kamg@1683: __ pop(atos); // restore the return value kamg@1683: kamg@1683: } duke@435: __ jmp(done); duke@435: } duke@435: duke@435: duke@435: // slow case duke@435: __ bind(slow_case); duke@435: __ get_constant_pool(c_rarg1); duke@435: __ get_unsigned_2_byte_index_at_bcp(c_rarg2, 1); duke@435: call_VM(rax, CAST_FROM_FN_PTR(address, InterpreterRuntime::_new), c_rarg1, c_rarg2); duke@435: __ verify_oop(rax); duke@435: duke@435: // continue duke@435: __ bind(done); duke@435: } duke@435: duke@435: void TemplateTable::newarray() { duke@435: transition(itos, atos); duke@435: __ load_unsigned_byte(c_rarg1, at_bcp(1)); duke@435: __ movl(c_rarg2, rax); duke@435: call_VM(rax, CAST_FROM_FN_PTR(address, InterpreterRuntime::newarray), duke@435: c_rarg1, c_rarg2); duke@435: } duke@435: duke@435: void TemplateTable::anewarray() { duke@435: transition(itos, atos); duke@435: __ get_unsigned_2_byte_index_at_bcp(c_rarg2, 1); duke@435: __ get_constant_pool(c_rarg1); duke@435: __ movl(c_rarg3, rax); duke@435: call_VM(rax, CAST_FROM_FN_PTR(address, InterpreterRuntime::anewarray), duke@435: c_rarg1, c_rarg2, c_rarg3); duke@435: } duke@435: duke@435: void TemplateTable::arraylength() { duke@435: transition(atos, itos); duke@435: __ null_check(rax, arrayOopDesc::length_offset_in_bytes()); duke@435: __ movl(rax, Address(rax, arrayOopDesc::length_offset_in_bytes())); duke@435: } duke@435: duke@435: void TemplateTable::checkcast() { duke@435: transition(atos, atos); duke@435: Label done, is_null, ok_is_subtype, quicked, resolved; never@739: __ testptr(rax, rax); // object is in rax duke@435: __ jcc(Assembler::zero, is_null); duke@435: duke@435: // Get cpool & tags index duke@435: __ get_cpool_and_tags(rcx, rdx); // rcx=cpool, rdx=tags array duke@435: __ get_unsigned_2_byte_index_at_bcp(rbx, 1); // rbx=index duke@435: // See if bytecode has already been quicked duke@435: __ cmpb(Address(rdx, rbx, duke@435: Address::times_1, duke@435: typeArrayOopDesc::header_size(T_BYTE) * wordSize), duke@435: JVM_CONSTANT_Class); duke@435: __ jcc(Assembler::equal, quicked); coleenp@548: __ push(atos); // save receiver for result, and for GC never@739: __ mov(r12, rcx); // save rcx XXX duke@435: call_VM(rax, CAST_FROM_FN_PTR(address, InterpreterRuntime::quicken_io_cc)); coleenp@548: __ movq(rcx, r12); // restore rcx XXX coleenp@548: __ reinit_heapbase(); duke@435: __ pop_ptr(rdx); // restore receiver duke@435: __ jmpb(resolved); duke@435: duke@435: // Get superklass in rax and subklass in rbx duke@435: __ bind(quicked); never@739: __ mov(rdx, rax); // Save object in rdx; rax needed for subtype check never@739: __ movptr(rax, Address(rcx, rbx, duke@435: Address::times_8, sizeof(constantPoolOopDesc))); duke@435: duke@435: __ bind(resolved); coleenp@548: __ load_klass(rbx, rdx); duke@435: duke@435: // Generate subtype check. Blows rcx, rdi. Object in rdx. duke@435: // Superklass in rax. Subklass in rbx. duke@435: __ gen_subtype_check(rbx, ok_is_subtype); duke@435: duke@435: // Come here on failure duke@435: __ push_ptr(rdx); duke@435: // object is at TOS duke@435: __ jump(ExternalAddress(Interpreter::_throw_ClassCastException_entry)); duke@435: duke@435: // Come here on success duke@435: __ bind(ok_is_subtype); never@739: __ mov(rax, rdx); // Restore object in rdx duke@435: duke@435: // Collect counts on whether this check-cast sees NULLs a lot or not. duke@435: if (ProfileInterpreter) { duke@435: __ jmp(done); duke@435: __ bind(is_null); duke@435: __ profile_null_seen(rcx); duke@435: } else { duke@435: __ bind(is_null); // same as 'done' duke@435: } duke@435: __ bind(done); duke@435: } duke@435: duke@435: void TemplateTable::instanceof() { duke@435: transition(atos, itos); duke@435: Label done, is_null, ok_is_subtype, quicked, resolved; never@739: __ testptr(rax, rax); duke@435: __ jcc(Assembler::zero, is_null); duke@435: duke@435: // Get cpool & tags index duke@435: __ get_cpool_and_tags(rcx, rdx); // rcx=cpool, rdx=tags array duke@435: __ get_unsigned_2_byte_index_at_bcp(rbx, 1); // rbx=index duke@435: // See if bytecode has already been quicked duke@435: __ cmpb(Address(rdx, rbx, duke@435: Address::times_1, duke@435: typeArrayOopDesc::header_size(T_BYTE) * wordSize), duke@435: JVM_CONSTANT_Class); duke@435: __ jcc(Assembler::equal, quicked); duke@435: coleenp@548: __ push(atos); // save receiver for result, and for GC never@739: __ mov(r12, rcx); // save rcx duke@435: call_VM(rax, CAST_FROM_FN_PTR(address, InterpreterRuntime::quicken_io_cc)); coleenp@548: __ movq(rcx, r12); // restore rcx coleenp@548: __ reinit_heapbase(); duke@435: __ pop_ptr(rdx); // restore receiver coleenp@548: __ load_klass(rdx, rdx); duke@435: __ jmpb(resolved); duke@435: duke@435: // Get superklass in rax and subklass in rdx duke@435: __ bind(quicked); coleenp@548: __ load_klass(rdx, rax); never@739: __ movptr(rax, Address(rcx, rbx, never@739: Address::times_8, sizeof(constantPoolOopDesc))); duke@435: duke@435: __ bind(resolved); duke@435: duke@435: // Generate subtype check. Blows rcx, rdi duke@435: // Superklass in rax. Subklass in rdx. duke@435: __ gen_subtype_check(rdx, ok_is_subtype); duke@435: duke@435: // Come here on failure duke@435: __ xorl(rax, rax); duke@435: __ jmpb(done); duke@435: // Come here on success duke@435: __ bind(ok_is_subtype); duke@435: __ movl(rax, 1); duke@435: duke@435: // Collect counts on whether this test sees NULLs a lot or not. duke@435: if (ProfileInterpreter) { duke@435: __ jmp(done); duke@435: __ bind(is_null); duke@435: __ profile_null_seen(rcx); duke@435: } else { duke@435: __ bind(is_null); // same as 'done' duke@435: } duke@435: __ bind(done); duke@435: // rax = 0: obj == NULL or obj is not an instanceof the specified klass duke@435: // rax = 1: obj != NULL and obj is an instanceof the specified klass duke@435: } duke@435: duke@435: //----------------------------------------------------------------------------- duke@435: // Breakpoints duke@435: void TemplateTable::_breakpoint() { duke@435: // Note: We get here even if we are single stepping.. duke@435: // jbug inists on setting breakpoints at every bytecode duke@435: // even if we are in single step mode. duke@435: duke@435: transition(vtos, vtos); duke@435: duke@435: // get the unpatched byte code duke@435: __ get_method(c_rarg1); duke@435: __ call_VM(noreg, duke@435: CAST_FROM_FN_PTR(address, duke@435: InterpreterRuntime::get_original_bytecode_at), duke@435: c_rarg1, r13); never@739: __ mov(rbx, rax); duke@435: duke@435: // post the breakpoint event duke@435: __ get_method(c_rarg1); duke@435: __ call_VM(noreg, duke@435: CAST_FROM_FN_PTR(address, InterpreterRuntime::_breakpoint), duke@435: c_rarg1, r13); duke@435: duke@435: // complete the execution of original bytecode duke@435: __ dispatch_only_normal(vtos); duke@435: } duke@435: duke@435: //----------------------------------------------------------------------------- duke@435: // Exceptions duke@435: duke@435: void TemplateTable::athrow() { duke@435: transition(atos, vtos); duke@435: __ null_check(rax); duke@435: __ jump(ExternalAddress(Interpreter::throw_exception_entry())); duke@435: } duke@435: duke@435: //----------------------------------------------------------------------------- duke@435: // Synchronization duke@435: // duke@435: // Note: monitorenter & exit are symmetric routines; which is reflected duke@435: // in the assembly code structure as well duke@435: // duke@435: // Stack layout: duke@435: // duke@435: // [expressions ] <--- rsp = expression stack top duke@435: // .. duke@435: // [expressions ] duke@435: // [monitor entry] <--- monitor block top = expression stack bot duke@435: // .. duke@435: // [monitor entry] duke@435: // [frame data ] <--- monitor block bot duke@435: // ... duke@435: // [saved rbp ] <--- rbp duke@435: void TemplateTable::monitorenter() { duke@435: transition(atos, vtos); duke@435: duke@435: // check for NULL object duke@435: __ null_check(rax); duke@435: duke@435: const Address monitor_block_top( duke@435: rbp, frame::interpreter_frame_monitor_block_top_offset * wordSize); duke@435: const Address monitor_block_bot( duke@435: rbp, frame::interpreter_frame_initial_sp_offset * wordSize); duke@435: const int entry_size = frame::interpreter_frame_monitor_size() * wordSize; duke@435: duke@435: Label allocated; duke@435: duke@435: // initialize entry pointer duke@435: __ xorl(c_rarg1, c_rarg1); // points to free slot or NULL duke@435: duke@435: // find a free slot in the monitor block (result in c_rarg1) duke@435: { duke@435: Label entry, loop, exit; never@739: __ movptr(c_rarg3, monitor_block_top); // points to current entry, duke@435: // starting with top-most entry never@739: __ lea(c_rarg2, monitor_block_bot); // points to word before bottom duke@435: // of monitor block duke@435: __ jmpb(entry); duke@435: duke@435: __ bind(loop); duke@435: // check if current entry is used never@739: __ cmpptr(Address(c_rarg3, BasicObjectLock::obj_offset_in_bytes()), (int32_t) NULL_WORD); duke@435: // if not used then remember entry in c_rarg1 never@739: __ cmov(Assembler::equal, c_rarg1, c_rarg3); duke@435: // check if current entry is for same object never@739: __ cmpptr(rax, Address(c_rarg3, BasicObjectLock::obj_offset_in_bytes())); duke@435: // if same object then stop searching duke@435: __ jccb(Assembler::equal, exit); duke@435: // otherwise advance to next entry never@739: __ addptr(c_rarg3, entry_size); duke@435: __ bind(entry); duke@435: // check if bottom reached never@739: __ cmpptr(c_rarg3, c_rarg2); duke@435: // if not at bottom then check this entry duke@435: __ jcc(Assembler::notEqual, loop); duke@435: __ bind(exit); duke@435: } duke@435: never@739: __ testptr(c_rarg1, c_rarg1); // check if a slot has been found duke@435: __ jcc(Assembler::notZero, allocated); // if found, continue with that one duke@435: duke@435: // allocate one if there's no free slot duke@435: { duke@435: Label entry, loop; never@739: // 1. compute new pointers // rsp: old expression stack top never@739: __ movptr(c_rarg1, monitor_block_bot); // c_rarg1: old expression stack bottom never@739: __ subptr(rsp, entry_size); // move expression stack top never@739: __ subptr(c_rarg1, entry_size); // move expression stack bottom never@739: __ mov(c_rarg3, rsp); // set start value for copy loop never@739: __ movptr(monitor_block_bot, c_rarg1); // set new monitor block bottom duke@435: __ jmp(entry); duke@435: // 2. move expression stack contents duke@435: __ bind(loop); never@739: __ movptr(c_rarg2, Address(c_rarg3, entry_size)); // load expression stack never@739: // word from old location never@739: __ movptr(Address(c_rarg3, 0), c_rarg2); // and store it at new location never@739: __ addptr(c_rarg3, wordSize); // advance to next word duke@435: __ bind(entry); never@739: __ cmpptr(c_rarg3, c_rarg1); // check if bottom reached duke@435: __ jcc(Assembler::notEqual, loop); // if not at bottom then duke@435: // copy next word duke@435: } duke@435: duke@435: // call run-time routine duke@435: // c_rarg1: points to monitor entry duke@435: __ bind(allocated); duke@435: duke@435: // Increment bcp to point to the next bytecode, so exception duke@435: // handling for async. exceptions work correctly. duke@435: // The object has already been poped from the stack, so the duke@435: // expression stack looks correct. never@739: __ increment(r13); duke@435: duke@435: // store object never@739: __ movptr(Address(c_rarg1, BasicObjectLock::obj_offset_in_bytes()), rax); duke@435: __ lock_object(c_rarg1); duke@435: duke@435: // check to make sure this monitor doesn't cause stack overflow after locking duke@435: __ save_bcp(); // in case of exception duke@435: __ generate_stack_overflow_check(0); duke@435: duke@435: // The bcp has already been incremented. Just need to dispatch to duke@435: // next instruction. duke@435: __ dispatch_next(vtos); duke@435: } duke@435: duke@435: duke@435: void TemplateTable::monitorexit() { duke@435: transition(atos, vtos); duke@435: duke@435: // check for NULL object duke@435: __ null_check(rax); duke@435: duke@435: const Address monitor_block_top( duke@435: rbp, frame::interpreter_frame_monitor_block_top_offset * wordSize); duke@435: const Address monitor_block_bot( duke@435: rbp, frame::interpreter_frame_initial_sp_offset * wordSize); duke@435: const int entry_size = frame::interpreter_frame_monitor_size() * wordSize; duke@435: duke@435: Label found; duke@435: duke@435: // find matching slot duke@435: { duke@435: Label entry, loop; never@739: __ movptr(c_rarg1, monitor_block_top); // points to current entry, duke@435: // starting with top-most entry never@739: __ lea(c_rarg2, monitor_block_bot); // points to word before bottom duke@435: // of monitor block duke@435: __ jmpb(entry); duke@435: duke@435: __ bind(loop); duke@435: // check if current entry is for same object never@739: __ cmpptr(rax, Address(c_rarg1, BasicObjectLock::obj_offset_in_bytes())); duke@435: // if same object then stop searching duke@435: __ jcc(Assembler::equal, found); duke@435: // otherwise advance to next entry never@739: __ addptr(c_rarg1, entry_size); duke@435: __ bind(entry); duke@435: // check if bottom reached never@739: __ cmpptr(c_rarg1, c_rarg2); duke@435: // if not at bottom then check this entry duke@435: __ jcc(Assembler::notEqual, loop); duke@435: } duke@435: duke@435: // error handling. Unlocking was not block-structured duke@435: __ call_VM(noreg, CAST_FROM_FN_PTR(address, duke@435: InterpreterRuntime::throw_illegal_monitor_state_exception)); duke@435: __ should_not_reach_here(); duke@435: duke@435: // call run-time routine duke@435: // rsi: points to monitor entry duke@435: __ bind(found); duke@435: __ push_ptr(rax); // make sure object is on stack (contract with oopMaps) duke@435: __ unlock_object(c_rarg1); duke@435: __ pop_ptr(rax); // discard object duke@435: } duke@435: duke@435: duke@435: // Wide instructions duke@435: void TemplateTable::wide() { duke@435: transition(vtos, vtos); duke@435: __ load_unsigned_byte(rbx, at_bcp(1)); duke@435: __ lea(rscratch1, ExternalAddress((address)Interpreter::_wentry_point)); duke@435: __ jmp(Address(rscratch1, rbx, Address::times_8)); duke@435: // Note: the r13 increment step is part of the individual wide duke@435: // bytecode implementations duke@435: } duke@435: duke@435: duke@435: // Multi arrays duke@435: void TemplateTable::multianewarray() { duke@435: transition(vtos, atos); duke@435: __ load_unsigned_byte(rax, at_bcp(3)); // get number of dimensions duke@435: // last dim is on top of stack; we want address of first one: duke@435: // first_addr = last_addr + (ndims - 1) * wordSize never@739: __ lea(c_rarg1, Address(rsp, rax, Address::times_8, -wordSize)); duke@435: call_VM(rax, duke@435: CAST_FROM_FN_PTR(address, InterpreterRuntime::multianewarray), duke@435: c_rarg1); duke@435: __ load_unsigned_byte(rbx, at_bcp(3)); never@739: __ lea(rsp, Address(rsp, rbx, Address::times_8)); duke@435: } never@739: #endif // !CC_INTERP