Thu, 14 Apr 2011 13:45:41 -0700
Merge
duke@435 | 1 | /* |
iveresov@2138 | 2 | * Copyright (c) 2003, 2010, Oracle and/or its affiliates. All rights reserved. |
duke@435 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
duke@435 | 4 | * |
duke@435 | 5 | * This code is free software; you can redistribute it and/or modify it |
duke@435 | 6 | * under the terms of the GNU General Public License version 2 only, as |
duke@435 | 7 | * published by the Free Software Foundation. |
duke@435 | 8 | * |
duke@435 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
duke@435 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
duke@435 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
duke@435 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
duke@435 | 13 | * accompanied this code). |
duke@435 | 14 | * |
duke@435 | 15 | * You should have received a copy of the GNU General Public License version |
duke@435 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
duke@435 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
duke@435 | 18 | * |
trims@1907 | 19 | * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
trims@1907 | 20 | * or visit www.oracle.com if you need additional information or have any |
trims@1907 | 21 | * questions. |
duke@435 | 22 | * |
duke@435 | 23 | */ |
duke@435 | 24 | |
stefank@2314 | 25 | #include "precompiled.hpp" |
stefank@2314 | 26 | #include "asm/assembler.hpp" |
stefank@2314 | 27 | #include "assembler_x86.inline.hpp" |
stefank@2314 | 28 | #include "code/vtableStubs.hpp" |
stefank@2314 | 29 | #include "interp_masm_x86_64.hpp" |
stefank@2314 | 30 | #include "memory/resourceArea.hpp" |
stefank@2314 | 31 | #include "oops/instanceKlass.hpp" |
stefank@2314 | 32 | #include "oops/klassVtable.hpp" |
stefank@2314 | 33 | #include "runtime/sharedRuntime.hpp" |
stefank@2314 | 34 | #include "vmreg_x86.inline.hpp" |
stefank@2314 | 35 | #ifdef COMPILER2 |
stefank@2314 | 36 | #include "opto/runtime.hpp" |
stefank@2314 | 37 | #endif |
duke@435 | 38 | |
duke@435 | 39 | // machine-dependent part of VtableStubs: create VtableStub of correct size and |
duke@435 | 40 | // initialize its code |
duke@435 | 41 | |
duke@435 | 42 | #define __ masm-> |
duke@435 | 43 | |
duke@435 | 44 | #ifndef PRODUCT |
duke@435 | 45 | extern "C" void bad_compiled_vtable_index(JavaThread* thread, |
duke@435 | 46 | oop receiver, |
duke@435 | 47 | int index); |
duke@435 | 48 | #endif |
duke@435 | 49 | |
duke@435 | 50 | VtableStub* VtableStubs::create_vtable_stub(int vtable_index) { |
duke@435 | 51 | const int amd64_code_length = VtableStub::pd_code_size_limit(true); |
duke@435 | 52 | VtableStub* s = new(amd64_code_length) VtableStub(true, vtable_index); |
duke@435 | 53 | ResourceMark rm; |
duke@435 | 54 | CodeBuffer cb(s->entry_point(), amd64_code_length); |
duke@435 | 55 | MacroAssembler* masm = new MacroAssembler(&cb); |
duke@435 | 56 | |
duke@435 | 57 | #ifndef PRODUCT |
duke@435 | 58 | if (CountCompiledCalls) { |
duke@435 | 59 | __ incrementl(ExternalAddress((address) SharedRuntime::nof_megamorphic_calls_addr())); |
duke@435 | 60 | } |
duke@435 | 61 | #endif |
duke@435 | 62 | |
duke@435 | 63 | // get receiver (need to skip return address on top of stack) |
duke@435 | 64 | assert(VtableStub::receiver_location() == j_rarg0->as_VMReg(), "receiver expected in j_rarg0"); |
duke@435 | 65 | |
duke@435 | 66 | // Free registers (non-args) are rax, rbx |
duke@435 | 67 | |
duke@435 | 68 | // get receiver klass |
duke@435 | 69 | address npe_addr = __ pc(); |
coleenp@548 | 70 | __ load_klass(rax, j_rarg0); |
duke@435 | 71 | |
duke@435 | 72 | // compute entry offset (in words) |
duke@435 | 73 | int entry_offset = |
duke@435 | 74 | instanceKlass::vtable_start_offset() + vtable_index * vtableEntry::size(); |
duke@435 | 75 | |
duke@435 | 76 | #ifndef PRODUCT |
duke@435 | 77 | if (DebugVtables) { |
duke@435 | 78 | Label L; |
duke@435 | 79 | // check offset vs vtable length |
duke@435 | 80 | __ cmpl(Address(rax, instanceKlass::vtable_length_offset() * wordSize), |
duke@435 | 81 | vtable_index * vtableEntry::size()); |
duke@435 | 82 | __ jcc(Assembler::greater, L); |
duke@435 | 83 | __ movl(rbx, vtable_index); |
duke@435 | 84 | __ call_VM(noreg, |
duke@435 | 85 | CAST_FROM_FN_PTR(address, bad_compiled_vtable_index), j_rarg0, rbx); |
duke@435 | 86 | __ bind(L); |
duke@435 | 87 | } |
duke@435 | 88 | #endif // PRODUCT |
duke@435 | 89 | |
duke@435 | 90 | // load methodOop and target address |
duke@435 | 91 | const Register method = rbx; |
duke@435 | 92 | |
never@739 | 93 | __ movptr(method, Address(rax, |
never@739 | 94 | entry_offset * wordSize + |
never@739 | 95 | vtableEntry::method_offset_in_bytes())); |
duke@435 | 96 | if (DebugVtables) { |
duke@435 | 97 | Label L; |
never@739 | 98 | __ cmpptr(method, (int32_t)NULL_WORD); |
duke@435 | 99 | __ jcc(Assembler::equal, L); |
never@739 | 100 | __ cmpptr(Address(method, methodOopDesc::from_compiled_offset()), (int32_t)NULL_WORD); |
duke@435 | 101 | __ jcc(Assembler::notZero, L); |
duke@435 | 102 | __ stop("Vtable entry is NULL"); |
duke@435 | 103 | __ bind(L); |
duke@435 | 104 | } |
duke@435 | 105 | // rax: receiver klass |
duke@435 | 106 | // rbx: methodOop |
duke@435 | 107 | // rcx: receiver |
duke@435 | 108 | address ame_addr = __ pc(); |
duke@435 | 109 | __ jmp( Address(rbx, methodOopDesc::from_compiled_offset())); |
duke@435 | 110 | |
duke@435 | 111 | __ flush(); |
jrose@1058 | 112 | |
jrose@1058 | 113 | if (PrintMiscellaneous && (WizardMode || Verbose)) { |
jrose@1058 | 114 | tty->print_cr("vtable #%d at "PTR_FORMAT"[%d] left over: %d", |
jrose@1058 | 115 | vtable_index, s->entry_point(), |
jrose@1058 | 116 | (int)(s->code_end() - s->entry_point()), |
jrose@1058 | 117 | (int)(s->code_end() - __ pc())); |
jrose@1058 | 118 | } |
jrose@1058 | 119 | guarantee(__ pc() <= s->code_end(), "overflowed buffer"); |
jrose@1144 | 120 | // shut the door on sizing bugs |
jrose@1144 | 121 | int slop = 3; // 32-bit offset is this much larger than an 8-bit one |
jrose@1144 | 122 | assert(vtable_index > 10 || __ pc() + slop <= s->code_end(), "room for 32-bit offset"); |
jrose@1058 | 123 | |
duke@435 | 124 | s->set_exception_points(npe_addr, ame_addr); |
duke@435 | 125 | return s; |
duke@435 | 126 | } |
duke@435 | 127 | |
duke@435 | 128 | |
jrose@1058 | 129 | VtableStub* VtableStubs::create_itable_stub(int itable_index) { |
duke@435 | 130 | // Note well: pd_code_size_limit is the absolute minimum we can get |
duke@435 | 131 | // away with. If you add code here, bump the code stub size |
duke@435 | 132 | // returned by pd_code_size_limit! |
duke@435 | 133 | const int amd64_code_length = VtableStub::pd_code_size_limit(false); |
jrose@1058 | 134 | VtableStub* s = new(amd64_code_length) VtableStub(false, itable_index); |
duke@435 | 135 | ResourceMark rm; |
duke@435 | 136 | CodeBuffer cb(s->entry_point(), amd64_code_length); |
duke@435 | 137 | MacroAssembler* masm = new MacroAssembler(&cb); |
duke@435 | 138 | |
duke@435 | 139 | #ifndef PRODUCT |
duke@435 | 140 | if (CountCompiledCalls) { |
duke@435 | 141 | __ incrementl(ExternalAddress((address) SharedRuntime::nof_megamorphic_calls_addr())); |
duke@435 | 142 | } |
duke@435 | 143 | #endif |
duke@435 | 144 | |
duke@435 | 145 | // Entry arguments: |
duke@435 | 146 | // rax: Interface |
duke@435 | 147 | // j_rarg0: Receiver |
duke@435 | 148 | |
duke@435 | 149 | // Free registers (non-args) are rax (interface), rbx |
duke@435 | 150 | |
duke@435 | 151 | // get receiver (need to skip return address on top of stack) |
duke@435 | 152 | |
duke@435 | 153 | assert(VtableStub::receiver_location() == j_rarg0->as_VMReg(), "receiver expected in j_rarg0"); |
duke@435 | 154 | // get receiver klass (also an implicit null-check) |
duke@435 | 155 | address npe_addr = __ pc(); |
duke@435 | 156 | |
jrose@1058 | 157 | // Most registers are in use; we'll use rax, rbx, r10, r11 |
jrose@1058 | 158 | // (various calling sequences use r[cd]x, r[sd]i, r[89]; stay away from them) |
jrose@1058 | 159 | __ load_klass(r10, j_rarg0); |
duke@435 | 160 | |
duke@435 | 161 | // If we take a trap while this arg is on the stack we will not |
duke@435 | 162 | // be able to walk the stack properly. This is not an issue except |
duke@435 | 163 | // when there are mistakes in this assembly code that could generate |
duke@435 | 164 | // a spurious fault. Ask me how I know... |
duke@435 | 165 | |
jrose@1058 | 166 | const Register method = rbx; |
jrose@1058 | 167 | Label throw_icce; |
duke@435 | 168 | |
duke@435 | 169 | // Get methodOop and entrypoint for compiler |
jrose@1058 | 170 | __ lookup_interface_method(// inputs: rec. class, interface, itable index |
jrose@1058 | 171 | r10, rax, itable_index, |
jrose@1058 | 172 | // outputs: method, scan temp. reg |
jrose@1058 | 173 | method, r11, |
jrose@1058 | 174 | throw_icce); |
duke@435 | 175 | |
duke@435 | 176 | // method (rbx): methodOop |
duke@435 | 177 | // j_rarg0: receiver |
duke@435 | 178 | |
duke@435 | 179 | #ifdef ASSERT |
dcubed@451 | 180 | if (DebugVtables) { |
dcubed@451 | 181 | Label L2; |
never@739 | 182 | __ cmpptr(method, (int32_t)NULL_WORD); |
dcubed@451 | 183 | __ jcc(Assembler::equal, L2); |
never@739 | 184 | __ cmpptr(Address(method, methodOopDesc::from_compiled_offset()), (int32_t)NULL_WORD); |
dcubed@451 | 185 | __ jcc(Assembler::notZero, L2); |
dcubed@451 | 186 | __ stop("compiler entrypoint is null"); |
dcubed@451 | 187 | __ bind(L2); |
dcubed@451 | 188 | } |
duke@435 | 189 | #endif // ASSERT |
duke@435 | 190 | |
dcubed@451 | 191 | // rbx: methodOop |
dcubed@451 | 192 | // j_rarg0: receiver |
dcubed@451 | 193 | address ame_addr = __ pc(); |
dcubed@451 | 194 | __ jmp(Address(method, methodOopDesc::from_compiled_offset())); |
dcubed@451 | 195 | |
dcubed@451 | 196 | __ bind(throw_icce); |
dcubed@451 | 197 | __ jump(RuntimeAddress(StubRoutines::throw_IncompatibleClassChangeError_entry())); |
duke@435 | 198 | |
duke@435 | 199 | __ flush(); |
dcubed@451 | 200 | |
jrose@1058 | 201 | if (PrintMiscellaneous && (WizardMode || Verbose)) { |
jrose@1058 | 202 | tty->print_cr("itable #%d at "PTR_FORMAT"[%d] left over: %d", |
jrose@1058 | 203 | itable_index, s->entry_point(), |
jrose@1058 | 204 | (int)(s->code_end() - s->entry_point()), |
jrose@1058 | 205 | (int)(s->code_end() - __ pc())); |
jrose@1058 | 206 | } |
dcubed@451 | 207 | guarantee(__ pc() <= s->code_end(), "overflowed buffer"); |
jrose@1144 | 208 | // shut the door on sizing bugs |
jrose@1144 | 209 | int slop = 3; // 32-bit offset is this much larger than an 8-bit one |
jrose@1144 | 210 | assert(itable_index > 10 || __ pc() + slop <= s->code_end(), "room for 32-bit offset"); |
dcubed@451 | 211 | |
duke@435 | 212 | s->set_exception_points(npe_addr, ame_addr); |
duke@435 | 213 | return s; |
duke@435 | 214 | } |
duke@435 | 215 | |
duke@435 | 216 | int VtableStub::pd_code_size_limit(bool is_vtable_stub) { |
duke@435 | 217 | if (is_vtable_stub) { |
duke@435 | 218 | // Vtable stub size |
coleenp@548 | 219 | return (DebugVtables ? 512 : 24) + (CountCompiledCalls ? 13 : 0) + |
coleenp@548 | 220 | (UseCompressedOops ? 16 : 0); // 1 leaq can be 3 bytes + 1 long |
duke@435 | 221 | } else { |
duke@435 | 222 | // Itable stub size |
iveresov@2138 | 223 | return (DebugVtables ? 512 : 74) + (CountCompiledCalls ? 13 : 0) + |
coleenp@548 | 224 | (UseCompressedOops ? 32 : 0); // 2 leaqs |
duke@435 | 225 | } |
jrose@1144 | 226 | // In order to tune these parameters, run the JVM with VM options |
jrose@1144 | 227 | // +PrintMiscellaneous and +WizardMode to see information about |
jrose@1144 | 228 | // actual itable stubs. Look for lines like this: |
jrose@1144 | 229 | // itable #1 at 0x5551212[71] left over: 3 |
jrose@1144 | 230 | // Reduce the constants so that the "left over" number is >=3 |
jrose@1144 | 231 | // for the common cases. |
jrose@1144 | 232 | // Do not aim at a left-over number of zero, because a |
jrose@1144 | 233 | // large vtable or itable index (>= 32) will require a 32-bit |
jrose@1144 | 234 | // immediate displacement instead of an 8-bit one. |
jrose@1144 | 235 | // |
jrose@1144 | 236 | // The JVM98 app. _202_jess has a megamorphic interface call. |
jrose@1144 | 237 | // The itable code looks like this: |
jrose@1144 | 238 | // Decoding VtableStub itbl[1]@12 |
jrose@1144 | 239 | // mov 0x8(%rsi),%r10 |
jrose@1144 | 240 | // mov 0x198(%r10),%r11d |
jrose@1144 | 241 | // lea 0x218(%r10,%r11,8),%r11 |
jrose@1144 | 242 | // lea 0x8(%r10),%r10 |
jrose@1144 | 243 | // mov (%r11),%rbx |
jrose@1144 | 244 | // cmp %rbx,%rax |
jrose@1144 | 245 | // je success |
jrose@1144 | 246 | // loop: |
jrose@1144 | 247 | // test %rbx,%rbx |
jrose@1144 | 248 | // je throw_icce |
jrose@1144 | 249 | // add $0x10,%r11 |
jrose@1144 | 250 | // mov (%r11),%rbx |
jrose@1144 | 251 | // cmp %rbx,%rax |
jrose@1144 | 252 | // jne loop |
jrose@1144 | 253 | // success: |
jrose@1144 | 254 | // mov 0x8(%r11),%r11d |
jrose@1144 | 255 | // mov (%r10,%r11,1),%rbx |
jrose@1144 | 256 | // jmpq *0x60(%rbx) |
jrose@1144 | 257 | // throw_icce: |
jrose@1144 | 258 | // jmpq throw_ICCE_entry |
duke@435 | 259 | } |
duke@435 | 260 | |
duke@435 | 261 | int VtableStub::pd_code_alignment() { |
duke@435 | 262 | return wordSize; |
duke@435 | 263 | } |