Tue, 10 Mar 2009 08:52:16 -0700
Merge
duke@435 | 1 | /* |
xdono@631 | 2 | * Copyright 1997-2008 Sun Microsystems, Inc. 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 | * |
duke@435 | 19 | * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, |
duke@435 | 20 | * CA 95054 USA or visit www.sun.com if you need additional information or |
duke@435 | 21 | * have any questions. |
duke@435 | 22 | * |
duke@435 | 23 | */ |
duke@435 | 24 | |
duke@435 | 25 | #include "incls/_precompiled.incl" |
duke@435 | 26 | #include "incls/_templateTable_x86_32.cpp.incl" |
duke@435 | 27 | |
duke@435 | 28 | #ifndef CC_INTERP |
duke@435 | 29 | #define __ _masm-> |
duke@435 | 30 | |
duke@435 | 31 | //---------------------------------------------------------------------------------------------------- |
duke@435 | 32 | // Platform-dependent initialization |
duke@435 | 33 | |
duke@435 | 34 | void TemplateTable::pd_initialize() { |
duke@435 | 35 | // No i486 specific initialization |
duke@435 | 36 | } |
duke@435 | 37 | |
duke@435 | 38 | //---------------------------------------------------------------------------------------------------- |
duke@435 | 39 | // Address computation |
duke@435 | 40 | |
duke@435 | 41 | // local variables |
duke@435 | 42 | static inline Address iaddress(int n) { |
duke@435 | 43 | return Address(rdi, Interpreter::local_offset_in_bytes(n)); |
duke@435 | 44 | } |
duke@435 | 45 | |
duke@435 | 46 | static inline Address laddress(int n) { return iaddress(n + 1); } |
duke@435 | 47 | static inline Address haddress(int n) { return iaddress(n + 0); } |
duke@435 | 48 | static inline Address faddress(int n) { return iaddress(n); } |
duke@435 | 49 | static inline Address daddress(int n) { return laddress(n); } |
duke@435 | 50 | static inline Address aaddress(int n) { return iaddress(n); } |
duke@435 | 51 | |
duke@435 | 52 | static inline Address iaddress(Register r) { |
duke@435 | 53 | return Address(rdi, r, Interpreter::stackElementScale(), Interpreter::value_offset_in_bytes()); |
duke@435 | 54 | } |
duke@435 | 55 | static inline Address laddress(Register r) { |
duke@435 | 56 | return Address(rdi, r, Interpreter::stackElementScale(), Interpreter::local_offset_in_bytes(1)); |
duke@435 | 57 | } |
duke@435 | 58 | static inline Address haddress(Register r) { |
duke@435 | 59 | return Address(rdi, r, Interpreter::stackElementScale(), Interpreter::local_offset_in_bytes(0)); |
duke@435 | 60 | } |
duke@435 | 61 | |
duke@435 | 62 | static inline Address faddress(Register r) { return iaddress(r); }; |
duke@435 | 63 | static inline Address daddress(Register r) { |
duke@435 | 64 | assert(!TaggedStackInterpreter, "This doesn't work"); |
duke@435 | 65 | return laddress(r); |
duke@435 | 66 | }; |
duke@435 | 67 | static inline Address aaddress(Register r) { return iaddress(r); }; |
duke@435 | 68 | |
duke@435 | 69 | // expression stack |
duke@435 | 70 | // (Note: Must not use symmetric equivalents at_rsp_m1/2 since they store |
duke@435 | 71 | // data beyond the rsp which is potentially unsafe in an MT environment; |
duke@435 | 72 | // an interrupt may overwrite that data.) |
duke@435 | 73 | static inline Address at_rsp () { |
duke@435 | 74 | return Address(rsp, 0); |
duke@435 | 75 | } |
duke@435 | 76 | |
duke@435 | 77 | // At top of Java expression stack which may be different than rsp(). It |
duke@435 | 78 | // isn't for category 1 objects. |
duke@435 | 79 | static inline Address at_tos () { |
duke@435 | 80 | Address tos = Address(rsp, Interpreter::expr_offset_in_bytes(0)); |
duke@435 | 81 | return tos; |
duke@435 | 82 | } |
duke@435 | 83 | |
duke@435 | 84 | static inline Address at_tos_p1() { |
duke@435 | 85 | return Address(rsp, Interpreter::expr_offset_in_bytes(1)); |
duke@435 | 86 | } |
duke@435 | 87 | |
duke@435 | 88 | static inline Address at_tos_p2() { |
duke@435 | 89 | return Address(rsp, Interpreter::expr_offset_in_bytes(2)); |
duke@435 | 90 | } |
duke@435 | 91 | |
duke@435 | 92 | // Condition conversion |
duke@435 | 93 | static Assembler::Condition j_not(TemplateTable::Condition cc) { |
duke@435 | 94 | switch (cc) { |
duke@435 | 95 | case TemplateTable::equal : return Assembler::notEqual; |
duke@435 | 96 | case TemplateTable::not_equal : return Assembler::equal; |
duke@435 | 97 | case TemplateTable::less : return Assembler::greaterEqual; |
duke@435 | 98 | case TemplateTable::less_equal : return Assembler::greater; |
duke@435 | 99 | case TemplateTable::greater : return Assembler::lessEqual; |
duke@435 | 100 | case TemplateTable::greater_equal: return Assembler::less; |
duke@435 | 101 | } |
duke@435 | 102 | ShouldNotReachHere(); |
duke@435 | 103 | return Assembler::zero; |
duke@435 | 104 | } |
duke@435 | 105 | |
duke@435 | 106 | |
duke@435 | 107 | //---------------------------------------------------------------------------------------------------- |
duke@435 | 108 | // Miscelaneous helper routines |
duke@435 | 109 | |
ysr@777 | 110 | // Store an oop (or NULL) at the address described by obj. |
ysr@777 | 111 | // If val == noreg this means store a NULL |
ysr@777 | 112 | |
ysr@777 | 113 | static void do_oop_store(InterpreterMacroAssembler* _masm, |
ysr@777 | 114 | Address obj, |
ysr@777 | 115 | Register val, |
ysr@777 | 116 | BarrierSet::Name barrier, |
ysr@777 | 117 | bool precise) { |
ysr@777 | 118 | assert(val == noreg || val == rax, "parameter is just for looks"); |
ysr@777 | 119 | switch (barrier) { |
ysr@777 | 120 | #ifndef SERIALGC |
ysr@777 | 121 | case BarrierSet::G1SATBCT: |
ysr@777 | 122 | case BarrierSet::G1SATBCTLogging: |
ysr@777 | 123 | { |
ysr@777 | 124 | // flatten object address if needed |
ysr@777 | 125 | // We do it regardless of precise because we need the registers |
ysr@777 | 126 | if (obj.index() == noreg && obj.disp() == 0) { |
ysr@777 | 127 | if (obj.base() != rdx) { |
ysr@777 | 128 | __ movl(rdx, obj.base()); |
ysr@777 | 129 | } |
ysr@777 | 130 | } else { |
ysr@777 | 131 | __ leal(rdx, obj); |
ysr@777 | 132 | } |
ysr@777 | 133 | __ get_thread(rcx); |
ysr@777 | 134 | __ save_bcp(); |
ysr@777 | 135 | __ g1_write_barrier_pre(rdx, rcx, rsi, rbx, val != noreg); |
ysr@777 | 136 | |
ysr@777 | 137 | // Do the actual store |
ysr@777 | 138 | // noreg means NULL |
ysr@777 | 139 | if (val == noreg) { |
xlu@968 | 140 | __ movptr(Address(rdx, 0), NULL_WORD); |
ysr@777 | 141 | // No post barrier for NULL |
ysr@777 | 142 | } else { |
ysr@777 | 143 | __ movl(Address(rdx, 0), val); |
ysr@777 | 144 | __ g1_write_barrier_post(rdx, rax, rcx, rbx, rsi); |
ysr@777 | 145 | } |
ysr@777 | 146 | __ restore_bcp(); |
ysr@777 | 147 | |
ysr@777 | 148 | } |
ysr@777 | 149 | break; |
ysr@777 | 150 | #endif // SERIALGC |
ysr@777 | 151 | case BarrierSet::CardTableModRef: |
ysr@777 | 152 | case BarrierSet::CardTableExtension: |
ysr@777 | 153 | { |
ysr@777 | 154 | if (val == noreg) { |
xlu@968 | 155 | __ movptr(obj, NULL_WORD); |
ysr@777 | 156 | } else { |
ysr@777 | 157 | __ movl(obj, val); |
ysr@777 | 158 | // flatten object address if needed |
ysr@777 | 159 | if (!precise || (obj.index() == noreg && obj.disp() == 0)) { |
ysr@777 | 160 | __ store_check(obj.base()); |
ysr@777 | 161 | } else { |
ysr@777 | 162 | __ leal(rdx, obj); |
ysr@777 | 163 | __ store_check(rdx); |
ysr@777 | 164 | } |
ysr@777 | 165 | } |
ysr@777 | 166 | } |
ysr@777 | 167 | break; |
ysr@777 | 168 | case BarrierSet::ModRef: |
ysr@777 | 169 | case BarrierSet::Other: |
ysr@777 | 170 | if (val == noreg) { |
xlu@968 | 171 | __ movptr(obj, NULL_WORD); |
ysr@777 | 172 | } else { |
ysr@777 | 173 | __ movl(obj, val); |
ysr@777 | 174 | } |
ysr@777 | 175 | break; |
ysr@777 | 176 | default : |
ysr@777 | 177 | ShouldNotReachHere(); |
ysr@777 | 178 | |
ysr@777 | 179 | } |
ysr@777 | 180 | } |
ysr@777 | 181 | |
duke@435 | 182 | Address TemplateTable::at_bcp(int offset) { |
duke@435 | 183 | assert(_desc->uses_bcp(), "inconsistent uses_bcp information"); |
duke@435 | 184 | return Address(rsi, offset); |
duke@435 | 185 | } |
duke@435 | 186 | |
duke@435 | 187 | |
duke@435 | 188 | void TemplateTable::patch_bytecode(Bytecodes::Code bytecode, Register bc, |
duke@435 | 189 | Register scratch, |
duke@435 | 190 | bool load_bc_into_scratch/*=true*/) { |
duke@435 | 191 | |
duke@435 | 192 | if (!RewriteBytecodes) return; |
duke@435 | 193 | // the pair bytecodes have already done the load. |
never@739 | 194 | if (load_bc_into_scratch) { |
never@739 | 195 | __ movl(bc, bytecode); |
never@739 | 196 | } |
duke@435 | 197 | Label patch_done; |
duke@435 | 198 | if (JvmtiExport::can_post_breakpoint()) { |
duke@435 | 199 | Label fast_patch; |
duke@435 | 200 | // if a breakpoint is present we can't rewrite the stream directly |
never@739 | 201 | __ movzbl(scratch, at_bcp(0)); |
duke@435 | 202 | __ cmpl(scratch, Bytecodes::_breakpoint); |
duke@435 | 203 | __ jcc(Assembler::notEqual, fast_patch); |
duke@435 | 204 | __ get_method(scratch); |
duke@435 | 205 | // Let breakpoint table handling rewrite to quicker bytecode |
duke@435 | 206 | __ call_VM(noreg, CAST_FROM_FN_PTR(address, InterpreterRuntime::set_original_bytecode_at), scratch, rsi, bc); |
duke@435 | 207 | #ifndef ASSERT |
duke@435 | 208 | __ jmpb(patch_done); |
duke@435 | 209 | __ bind(fast_patch); |
duke@435 | 210 | } |
duke@435 | 211 | #else |
duke@435 | 212 | __ jmp(patch_done); |
duke@435 | 213 | __ bind(fast_patch); |
duke@435 | 214 | } |
duke@435 | 215 | Label okay; |
duke@435 | 216 | __ load_unsigned_byte(scratch, at_bcp(0)); |
duke@435 | 217 | __ cmpl(scratch, (int)Bytecodes::java_code(bytecode)); |
duke@435 | 218 | __ jccb(Assembler::equal, okay); |
duke@435 | 219 | __ cmpl(scratch, bc); |
duke@435 | 220 | __ jcc(Assembler::equal, okay); |
duke@435 | 221 | __ stop("patching the wrong bytecode"); |
duke@435 | 222 | __ bind(okay); |
duke@435 | 223 | #endif |
duke@435 | 224 | // patch bytecode |
duke@435 | 225 | __ movb(at_bcp(0), bc); |
duke@435 | 226 | __ bind(patch_done); |
duke@435 | 227 | } |
duke@435 | 228 | |
duke@435 | 229 | //---------------------------------------------------------------------------------------------------- |
duke@435 | 230 | // Individual instructions |
duke@435 | 231 | |
duke@435 | 232 | void TemplateTable::nop() { |
duke@435 | 233 | transition(vtos, vtos); |
duke@435 | 234 | // nothing to do |
duke@435 | 235 | } |
duke@435 | 236 | |
duke@435 | 237 | void TemplateTable::shouldnotreachhere() { |
duke@435 | 238 | transition(vtos, vtos); |
duke@435 | 239 | __ stop("shouldnotreachhere bytecode"); |
duke@435 | 240 | } |
duke@435 | 241 | |
duke@435 | 242 | |
duke@435 | 243 | |
duke@435 | 244 | void TemplateTable::aconst_null() { |
duke@435 | 245 | transition(vtos, atos); |
never@739 | 246 | __ xorptr(rax, rax); |
duke@435 | 247 | } |
duke@435 | 248 | |
duke@435 | 249 | |
duke@435 | 250 | void TemplateTable::iconst(int value) { |
duke@435 | 251 | transition(vtos, itos); |
duke@435 | 252 | if (value == 0) { |
never@739 | 253 | __ xorptr(rax, rax); |
duke@435 | 254 | } else { |
never@739 | 255 | __ movptr(rax, value); |
duke@435 | 256 | } |
duke@435 | 257 | } |
duke@435 | 258 | |
duke@435 | 259 | |
duke@435 | 260 | void TemplateTable::lconst(int value) { |
duke@435 | 261 | transition(vtos, ltos); |
duke@435 | 262 | if (value == 0) { |
never@739 | 263 | __ xorptr(rax, rax); |
duke@435 | 264 | } else { |
never@739 | 265 | __ movptr(rax, value); |
duke@435 | 266 | } |
duke@435 | 267 | assert(value >= 0, "check this code"); |
never@739 | 268 | __ xorptr(rdx, rdx); |
duke@435 | 269 | } |
duke@435 | 270 | |
duke@435 | 271 | |
duke@435 | 272 | void TemplateTable::fconst(int value) { |
duke@435 | 273 | transition(vtos, ftos); |
duke@435 | 274 | if (value == 0) { __ fldz(); |
duke@435 | 275 | } else if (value == 1) { __ fld1(); |
duke@435 | 276 | } else if (value == 2) { __ fld1(); __ fld1(); __ faddp(); // should do a better solution here |
duke@435 | 277 | } else { ShouldNotReachHere(); |
duke@435 | 278 | } |
duke@435 | 279 | } |
duke@435 | 280 | |
duke@435 | 281 | |
duke@435 | 282 | void TemplateTable::dconst(int value) { |
duke@435 | 283 | transition(vtos, dtos); |
duke@435 | 284 | if (value == 0) { __ fldz(); |
duke@435 | 285 | } else if (value == 1) { __ fld1(); |
duke@435 | 286 | } else { ShouldNotReachHere(); |
duke@435 | 287 | } |
duke@435 | 288 | } |
duke@435 | 289 | |
duke@435 | 290 | |
duke@435 | 291 | void TemplateTable::bipush() { |
duke@435 | 292 | transition(vtos, itos); |
duke@435 | 293 | __ load_signed_byte(rax, at_bcp(1)); |
duke@435 | 294 | } |
duke@435 | 295 | |
duke@435 | 296 | |
duke@435 | 297 | void TemplateTable::sipush() { |
duke@435 | 298 | transition(vtos, itos); |
jrose@1057 | 299 | __ load_unsigned_short(rax, at_bcp(1)); |
never@739 | 300 | __ bswapl(rax); |
duke@435 | 301 | __ sarl(rax, 16); |
duke@435 | 302 | } |
duke@435 | 303 | |
duke@435 | 304 | void TemplateTable::ldc(bool wide) { |
duke@435 | 305 | transition(vtos, vtos); |
duke@435 | 306 | Label call_ldc, notFloat, notClass, Done; |
duke@435 | 307 | |
duke@435 | 308 | if (wide) { |
duke@435 | 309 | __ get_unsigned_2_byte_index_at_bcp(rbx, 1); |
duke@435 | 310 | } else { |
duke@435 | 311 | __ load_unsigned_byte(rbx, at_bcp(1)); |
duke@435 | 312 | } |
duke@435 | 313 | __ get_cpool_and_tags(rcx, rax); |
duke@435 | 314 | const int base_offset = constantPoolOopDesc::header_size() * wordSize; |
duke@435 | 315 | const int tags_offset = typeArrayOopDesc::header_size(T_BYTE) * wordSize; |
duke@435 | 316 | |
duke@435 | 317 | // get type |
never@739 | 318 | __ xorptr(rdx, rdx); |
duke@435 | 319 | __ movb(rdx, Address(rax, rbx, Address::times_1, tags_offset)); |
duke@435 | 320 | |
duke@435 | 321 | // unresolved string - get the resolved string |
duke@435 | 322 | __ cmpl(rdx, JVM_CONSTANT_UnresolvedString); |
duke@435 | 323 | __ jccb(Assembler::equal, call_ldc); |
duke@435 | 324 | |
duke@435 | 325 | // unresolved class - get the resolved class |
duke@435 | 326 | __ cmpl(rdx, JVM_CONSTANT_UnresolvedClass); |
duke@435 | 327 | __ jccb(Assembler::equal, call_ldc); |
duke@435 | 328 | |
duke@435 | 329 | // unresolved class in error (resolution failed) - call into runtime |
duke@435 | 330 | // so that the same error from first resolution attempt is thrown. |
duke@435 | 331 | __ cmpl(rdx, JVM_CONSTANT_UnresolvedClassInError); |
duke@435 | 332 | __ jccb(Assembler::equal, call_ldc); |
duke@435 | 333 | |
duke@435 | 334 | // resolved class - need to call vm to get java mirror of the class |
duke@435 | 335 | __ cmpl(rdx, JVM_CONSTANT_Class); |
duke@435 | 336 | __ jcc(Assembler::notEqual, notClass); |
duke@435 | 337 | |
duke@435 | 338 | __ bind(call_ldc); |
duke@435 | 339 | __ movl(rcx, wide); |
duke@435 | 340 | call_VM(rax, CAST_FROM_FN_PTR(address, InterpreterRuntime::ldc), rcx); |
duke@435 | 341 | __ push(atos); |
duke@435 | 342 | __ jmp(Done); |
duke@435 | 343 | |
duke@435 | 344 | __ bind(notClass); |
duke@435 | 345 | __ cmpl(rdx, JVM_CONSTANT_Float); |
duke@435 | 346 | __ jccb(Assembler::notEqual, notFloat); |
duke@435 | 347 | // ftos |
never@739 | 348 | __ fld_s( Address(rcx, rbx, Address::times_ptr, base_offset)); |
duke@435 | 349 | __ push(ftos); |
duke@435 | 350 | __ jmp(Done); |
duke@435 | 351 | |
duke@435 | 352 | __ bind(notFloat); |
duke@435 | 353 | #ifdef ASSERT |
duke@435 | 354 | { Label L; |
duke@435 | 355 | __ cmpl(rdx, JVM_CONSTANT_Integer); |
duke@435 | 356 | __ jcc(Assembler::equal, L); |
duke@435 | 357 | __ cmpl(rdx, JVM_CONSTANT_String); |
duke@435 | 358 | __ jcc(Assembler::equal, L); |
duke@435 | 359 | __ stop("unexpected tag type in ldc"); |
duke@435 | 360 | __ bind(L); |
duke@435 | 361 | } |
duke@435 | 362 | #endif |
duke@435 | 363 | Label isOop; |
duke@435 | 364 | // atos and itos |
duke@435 | 365 | // String is only oop type we will see here |
duke@435 | 366 | __ cmpl(rdx, JVM_CONSTANT_String); |
duke@435 | 367 | __ jccb(Assembler::equal, isOop); |
never@739 | 368 | __ movl(rax, Address(rcx, rbx, Address::times_ptr, base_offset)); |
duke@435 | 369 | __ push(itos); |
duke@435 | 370 | __ jmp(Done); |
duke@435 | 371 | __ bind(isOop); |
never@739 | 372 | __ movptr(rax, Address(rcx, rbx, Address::times_ptr, base_offset)); |
duke@435 | 373 | __ push(atos); |
duke@435 | 374 | |
duke@435 | 375 | if (VerifyOops) { |
duke@435 | 376 | __ verify_oop(rax); |
duke@435 | 377 | } |
duke@435 | 378 | __ bind(Done); |
duke@435 | 379 | } |
duke@435 | 380 | |
duke@435 | 381 | void TemplateTable::ldc2_w() { |
duke@435 | 382 | transition(vtos, vtos); |
duke@435 | 383 | Label Long, Done; |
duke@435 | 384 | __ get_unsigned_2_byte_index_at_bcp(rbx, 1); |
duke@435 | 385 | |
duke@435 | 386 | __ get_cpool_and_tags(rcx, rax); |
duke@435 | 387 | const int base_offset = constantPoolOopDesc::header_size() * wordSize; |
duke@435 | 388 | const int tags_offset = typeArrayOopDesc::header_size(T_BYTE) * wordSize; |
duke@435 | 389 | |
duke@435 | 390 | // get type |
duke@435 | 391 | __ cmpb(Address(rax, rbx, Address::times_1, tags_offset), JVM_CONSTANT_Double); |
duke@435 | 392 | __ jccb(Assembler::notEqual, Long); |
duke@435 | 393 | // dtos |
never@739 | 394 | __ fld_d( Address(rcx, rbx, Address::times_ptr, base_offset)); |
duke@435 | 395 | __ push(dtos); |
duke@435 | 396 | __ jmpb(Done); |
duke@435 | 397 | |
duke@435 | 398 | __ bind(Long); |
duke@435 | 399 | // ltos |
never@739 | 400 | __ movptr(rax, Address(rcx, rbx, Address::times_ptr, base_offset + 0 * wordSize)); |
never@739 | 401 | NOT_LP64(__ movptr(rdx, Address(rcx, rbx, Address::times_ptr, base_offset + 1 * wordSize))); |
duke@435 | 402 | |
duke@435 | 403 | __ push(ltos); |
duke@435 | 404 | |
duke@435 | 405 | __ bind(Done); |
duke@435 | 406 | } |
duke@435 | 407 | |
duke@435 | 408 | |
duke@435 | 409 | void TemplateTable::locals_index(Register reg, int offset) { |
duke@435 | 410 | __ load_unsigned_byte(reg, at_bcp(offset)); |
never@739 | 411 | __ negptr(reg); |
duke@435 | 412 | } |
duke@435 | 413 | |
duke@435 | 414 | |
duke@435 | 415 | void TemplateTable::iload() { |
duke@435 | 416 | transition(vtos, itos); |
duke@435 | 417 | if (RewriteFrequentPairs) { |
duke@435 | 418 | Label rewrite, done; |
duke@435 | 419 | |
duke@435 | 420 | // get next byte |
duke@435 | 421 | __ load_unsigned_byte(rbx, at_bcp(Bytecodes::length_for(Bytecodes::_iload))); |
duke@435 | 422 | // if _iload, wait to rewrite to iload2. We only want to rewrite the |
duke@435 | 423 | // last two iloads in a pair. Comparing against fast_iload means that |
duke@435 | 424 | // the next bytecode is neither an iload or a caload, and therefore |
duke@435 | 425 | // an iload pair. |
duke@435 | 426 | __ cmpl(rbx, Bytecodes::_iload); |
duke@435 | 427 | __ jcc(Assembler::equal, done); |
duke@435 | 428 | |
duke@435 | 429 | __ cmpl(rbx, Bytecodes::_fast_iload); |
duke@435 | 430 | __ movl(rcx, Bytecodes::_fast_iload2); |
duke@435 | 431 | __ jccb(Assembler::equal, rewrite); |
duke@435 | 432 | |
duke@435 | 433 | // if _caload, rewrite to fast_icaload |
duke@435 | 434 | __ cmpl(rbx, Bytecodes::_caload); |
duke@435 | 435 | __ movl(rcx, Bytecodes::_fast_icaload); |
duke@435 | 436 | __ jccb(Assembler::equal, rewrite); |
duke@435 | 437 | |
duke@435 | 438 | // rewrite so iload doesn't check again. |
duke@435 | 439 | __ movl(rcx, Bytecodes::_fast_iload); |
duke@435 | 440 | |
duke@435 | 441 | // rewrite |
duke@435 | 442 | // rcx: fast bytecode |
duke@435 | 443 | __ bind(rewrite); |
duke@435 | 444 | patch_bytecode(Bytecodes::_iload, rcx, rbx, false); |
duke@435 | 445 | __ bind(done); |
duke@435 | 446 | } |
duke@435 | 447 | |
duke@435 | 448 | // Get the local value into tos |
duke@435 | 449 | locals_index(rbx); |
duke@435 | 450 | __ movl(rax, iaddress(rbx)); |
duke@435 | 451 | debug_only(__ verify_local_tag(frame::TagValue, rbx)); |
duke@435 | 452 | } |
duke@435 | 453 | |
duke@435 | 454 | |
duke@435 | 455 | void TemplateTable::fast_iload2() { |
duke@435 | 456 | transition(vtos, itos); |
duke@435 | 457 | locals_index(rbx); |
duke@435 | 458 | __ movl(rax, iaddress(rbx)); |
duke@435 | 459 | debug_only(__ verify_local_tag(frame::TagValue, rbx)); |
duke@435 | 460 | __ push(itos); |
duke@435 | 461 | locals_index(rbx, 3); |
duke@435 | 462 | __ movl(rax, iaddress(rbx)); |
duke@435 | 463 | debug_only(__ verify_local_tag(frame::TagValue, rbx)); |
duke@435 | 464 | } |
duke@435 | 465 | |
duke@435 | 466 | void TemplateTable::fast_iload() { |
duke@435 | 467 | transition(vtos, itos); |
duke@435 | 468 | locals_index(rbx); |
duke@435 | 469 | __ movl(rax, iaddress(rbx)); |
duke@435 | 470 | debug_only(__ verify_local_tag(frame::TagValue, rbx)); |
duke@435 | 471 | } |
duke@435 | 472 | |
duke@435 | 473 | |
duke@435 | 474 | void TemplateTable::lload() { |
duke@435 | 475 | transition(vtos, ltos); |
duke@435 | 476 | locals_index(rbx); |
never@739 | 477 | __ movptr(rax, laddress(rbx)); |
never@739 | 478 | NOT_LP64(__ movl(rdx, haddress(rbx))); |
duke@435 | 479 | debug_only(__ verify_local_tag(frame::TagCategory2, rbx)); |
duke@435 | 480 | } |
duke@435 | 481 | |
duke@435 | 482 | |
duke@435 | 483 | void TemplateTable::fload() { |
duke@435 | 484 | transition(vtos, ftos); |
duke@435 | 485 | locals_index(rbx); |
duke@435 | 486 | __ fld_s(faddress(rbx)); |
duke@435 | 487 | debug_only(__ verify_local_tag(frame::TagValue, rbx)); |
duke@435 | 488 | } |
duke@435 | 489 | |
duke@435 | 490 | |
duke@435 | 491 | void TemplateTable::dload() { |
duke@435 | 492 | transition(vtos, dtos); |
duke@435 | 493 | locals_index(rbx); |
duke@435 | 494 | if (TaggedStackInterpreter) { |
duke@435 | 495 | // Get double out of locals array, onto temp stack and load with |
duke@435 | 496 | // float instruction into ST0 |
duke@435 | 497 | __ movl(rax, laddress(rbx)); |
duke@435 | 498 | __ movl(rdx, haddress(rbx)); |
never@739 | 499 | __ push(rdx); // push hi first |
never@739 | 500 | __ push(rax); |
duke@435 | 501 | __ fld_d(Address(rsp, 0)); |
never@739 | 502 | __ addptr(rsp, 2*wordSize); |
duke@435 | 503 | debug_only(__ verify_local_tag(frame::TagCategory2, rbx)); |
duke@435 | 504 | } else { |
duke@435 | 505 | __ fld_d(daddress(rbx)); |
duke@435 | 506 | } |
duke@435 | 507 | } |
duke@435 | 508 | |
duke@435 | 509 | |
duke@435 | 510 | void TemplateTable::aload() { |
duke@435 | 511 | transition(vtos, atos); |
duke@435 | 512 | locals_index(rbx); |
never@739 | 513 | __ movptr(rax, aaddress(rbx)); |
duke@435 | 514 | debug_only(__ verify_local_tag(frame::TagReference, rbx)); |
duke@435 | 515 | } |
duke@435 | 516 | |
duke@435 | 517 | |
duke@435 | 518 | void TemplateTable::locals_index_wide(Register reg) { |
duke@435 | 519 | __ movl(reg, at_bcp(2)); |
never@739 | 520 | __ bswapl(reg); |
duke@435 | 521 | __ shrl(reg, 16); |
never@739 | 522 | __ negptr(reg); |
duke@435 | 523 | } |
duke@435 | 524 | |
duke@435 | 525 | |
duke@435 | 526 | void TemplateTable::wide_iload() { |
duke@435 | 527 | transition(vtos, itos); |
duke@435 | 528 | locals_index_wide(rbx); |
duke@435 | 529 | __ movl(rax, iaddress(rbx)); |
duke@435 | 530 | debug_only(__ verify_local_tag(frame::TagValue, rbx)); |
duke@435 | 531 | } |
duke@435 | 532 | |
duke@435 | 533 | |
duke@435 | 534 | void TemplateTable::wide_lload() { |
duke@435 | 535 | transition(vtos, ltos); |
duke@435 | 536 | locals_index_wide(rbx); |
never@739 | 537 | __ movptr(rax, laddress(rbx)); |
never@739 | 538 | NOT_LP64(__ movl(rdx, haddress(rbx))); |
duke@435 | 539 | debug_only(__ verify_local_tag(frame::TagCategory2, rbx)); |
duke@435 | 540 | } |
duke@435 | 541 | |
duke@435 | 542 | |
duke@435 | 543 | void TemplateTable::wide_fload() { |
duke@435 | 544 | transition(vtos, ftos); |
duke@435 | 545 | locals_index_wide(rbx); |
duke@435 | 546 | __ fld_s(faddress(rbx)); |
duke@435 | 547 | debug_only(__ verify_local_tag(frame::TagValue, rbx)); |
duke@435 | 548 | } |
duke@435 | 549 | |
duke@435 | 550 | |
duke@435 | 551 | void TemplateTable::wide_dload() { |
duke@435 | 552 | transition(vtos, dtos); |
duke@435 | 553 | locals_index_wide(rbx); |
duke@435 | 554 | if (TaggedStackInterpreter) { |
duke@435 | 555 | // Get double out of locals array, onto temp stack and load with |
duke@435 | 556 | // float instruction into ST0 |
duke@435 | 557 | __ movl(rax, laddress(rbx)); |
duke@435 | 558 | __ movl(rdx, haddress(rbx)); |
never@739 | 559 | __ push(rdx); // push hi first |
never@739 | 560 | __ push(rax); |
duke@435 | 561 | __ fld_d(Address(rsp, 0)); |
duke@435 | 562 | __ addl(rsp, 2*wordSize); |
duke@435 | 563 | debug_only(__ verify_local_tag(frame::TagCategory2, rbx)); |
duke@435 | 564 | } else { |
duke@435 | 565 | __ fld_d(daddress(rbx)); |
duke@435 | 566 | } |
duke@435 | 567 | } |
duke@435 | 568 | |
duke@435 | 569 | |
duke@435 | 570 | void TemplateTable::wide_aload() { |
duke@435 | 571 | transition(vtos, atos); |
duke@435 | 572 | locals_index_wide(rbx); |
never@739 | 573 | __ movptr(rax, aaddress(rbx)); |
duke@435 | 574 | debug_only(__ verify_local_tag(frame::TagReference, rbx)); |
duke@435 | 575 | } |
duke@435 | 576 | |
duke@435 | 577 | void TemplateTable::index_check(Register array, Register index) { |
duke@435 | 578 | // Pop ptr into array |
duke@435 | 579 | __ pop_ptr(array); |
duke@435 | 580 | index_check_without_pop(array, index); |
duke@435 | 581 | } |
duke@435 | 582 | |
duke@435 | 583 | void TemplateTable::index_check_without_pop(Register array, Register index) { |
duke@435 | 584 | // destroys rbx, |
duke@435 | 585 | // check array |
duke@435 | 586 | __ null_check(array, arrayOopDesc::length_offset_in_bytes()); |
never@739 | 587 | LP64_ONLY(__ movslq(index, index)); |
duke@435 | 588 | // check index |
duke@435 | 589 | __ cmpl(index, Address(array, arrayOopDesc::length_offset_in_bytes())); |
duke@435 | 590 | if (index != rbx) { |
duke@435 | 591 | // ??? convention: move aberrant index into rbx, for exception message |
duke@435 | 592 | assert(rbx != array, "different registers"); |
never@739 | 593 | __ mov(rbx, index); |
duke@435 | 594 | } |
duke@435 | 595 | __ jump_cc(Assembler::aboveEqual, |
duke@435 | 596 | ExternalAddress(Interpreter::_throw_ArrayIndexOutOfBoundsException_entry)); |
duke@435 | 597 | } |
duke@435 | 598 | |
duke@435 | 599 | |
duke@435 | 600 | void TemplateTable::iaload() { |
duke@435 | 601 | transition(itos, itos); |
duke@435 | 602 | // rdx: array |
duke@435 | 603 | index_check(rdx, rax); // kills rbx, |
duke@435 | 604 | // rax,: index |
duke@435 | 605 | __ movl(rax, Address(rdx, rax, Address::times_4, arrayOopDesc::base_offset_in_bytes(T_INT))); |
duke@435 | 606 | } |
duke@435 | 607 | |
duke@435 | 608 | |
duke@435 | 609 | void TemplateTable::laload() { |
duke@435 | 610 | transition(itos, ltos); |
duke@435 | 611 | // rax,: index |
duke@435 | 612 | // rdx: array |
duke@435 | 613 | index_check(rdx, rax); |
never@739 | 614 | __ mov(rbx, rax); |
duke@435 | 615 | // rbx,: index |
never@739 | 616 | __ movptr(rax, Address(rdx, rbx, Address::times_8, arrayOopDesc::base_offset_in_bytes(T_LONG) + 0 * wordSize)); |
never@739 | 617 | NOT_LP64(__ movl(rdx, Address(rdx, rbx, Address::times_8, arrayOopDesc::base_offset_in_bytes(T_LONG) + 1 * wordSize))); |
duke@435 | 618 | } |
duke@435 | 619 | |
duke@435 | 620 | |
duke@435 | 621 | void TemplateTable::faload() { |
duke@435 | 622 | transition(itos, ftos); |
duke@435 | 623 | // rdx: array |
duke@435 | 624 | index_check(rdx, rax); // kills rbx, |
duke@435 | 625 | // rax,: index |
duke@435 | 626 | __ fld_s(Address(rdx, rax, Address::times_4, arrayOopDesc::base_offset_in_bytes(T_FLOAT))); |
duke@435 | 627 | } |
duke@435 | 628 | |
duke@435 | 629 | |
duke@435 | 630 | void TemplateTable::daload() { |
duke@435 | 631 | transition(itos, dtos); |
duke@435 | 632 | // rdx: array |
duke@435 | 633 | index_check(rdx, rax); // kills rbx, |
duke@435 | 634 | // rax,: index |
duke@435 | 635 | __ fld_d(Address(rdx, rax, Address::times_8, arrayOopDesc::base_offset_in_bytes(T_DOUBLE))); |
duke@435 | 636 | } |
duke@435 | 637 | |
duke@435 | 638 | |
duke@435 | 639 | void TemplateTable::aaload() { |
duke@435 | 640 | transition(itos, atos); |
duke@435 | 641 | // rdx: array |
duke@435 | 642 | index_check(rdx, rax); // kills rbx, |
duke@435 | 643 | // rax,: index |
never@739 | 644 | __ movptr(rax, Address(rdx, rax, Address::times_ptr, arrayOopDesc::base_offset_in_bytes(T_OBJECT))); |
duke@435 | 645 | } |
duke@435 | 646 | |
duke@435 | 647 | |
duke@435 | 648 | void TemplateTable::baload() { |
duke@435 | 649 | transition(itos, itos); |
duke@435 | 650 | // rdx: array |
duke@435 | 651 | index_check(rdx, rax); // kills rbx, |
duke@435 | 652 | // rax,: index |
duke@435 | 653 | // can do better code for P5 - fix this at some point |
duke@435 | 654 | __ load_signed_byte(rbx, Address(rdx, rax, Address::times_1, arrayOopDesc::base_offset_in_bytes(T_BYTE))); |
never@739 | 655 | __ mov(rax, rbx); |
duke@435 | 656 | } |
duke@435 | 657 | |
duke@435 | 658 | |
duke@435 | 659 | void TemplateTable::caload() { |
duke@435 | 660 | transition(itos, itos); |
duke@435 | 661 | // rdx: array |
duke@435 | 662 | index_check(rdx, rax); // kills rbx, |
duke@435 | 663 | // rax,: index |
duke@435 | 664 | // can do better code for P5 - may want to improve this at some point |
jrose@1057 | 665 | __ load_unsigned_short(rbx, Address(rdx, rax, Address::times_2, arrayOopDesc::base_offset_in_bytes(T_CHAR))); |
never@739 | 666 | __ mov(rax, rbx); |
duke@435 | 667 | } |
duke@435 | 668 | |
duke@435 | 669 | // iload followed by caload frequent pair |
duke@435 | 670 | void TemplateTable::fast_icaload() { |
duke@435 | 671 | transition(vtos, itos); |
duke@435 | 672 | // load index out of locals |
duke@435 | 673 | locals_index(rbx); |
duke@435 | 674 | __ movl(rax, iaddress(rbx)); |
duke@435 | 675 | debug_only(__ verify_local_tag(frame::TagValue, rbx)); |
duke@435 | 676 | |
duke@435 | 677 | // rdx: array |
duke@435 | 678 | index_check(rdx, rax); |
duke@435 | 679 | // rax,: index |
jrose@1057 | 680 | __ load_unsigned_short(rbx, Address(rdx, rax, Address::times_2, arrayOopDesc::base_offset_in_bytes(T_CHAR))); |
never@739 | 681 | __ mov(rax, rbx); |
duke@435 | 682 | } |
duke@435 | 683 | |
duke@435 | 684 | void TemplateTable::saload() { |
duke@435 | 685 | transition(itos, itos); |
duke@435 | 686 | // rdx: array |
duke@435 | 687 | index_check(rdx, rax); // kills rbx, |
duke@435 | 688 | // rax,: index |
duke@435 | 689 | // can do better code for P5 - may want to improve this at some point |
jrose@1057 | 690 | __ load_signed_short(rbx, Address(rdx, rax, Address::times_2, arrayOopDesc::base_offset_in_bytes(T_SHORT))); |
never@739 | 691 | __ mov(rax, rbx); |
duke@435 | 692 | } |
duke@435 | 693 | |
duke@435 | 694 | |
duke@435 | 695 | void TemplateTable::iload(int n) { |
duke@435 | 696 | transition(vtos, itos); |
duke@435 | 697 | __ movl(rax, iaddress(n)); |
duke@435 | 698 | debug_only(__ verify_local_tag(frame::TagValue, n)); |
duke@435 | 699 | } |
duke@435 | 700 | |
duke@435 | 701 | |
duke@435 | 702 | void TemplateTable::lload(int n) { |
duke@435 | 703 | transition(vtos, ltos); |
never@739 | 704 | __ movptr(rax, laddress(n)); |
never@739 | 705 | NOT_LP64(__ movptr(rdx, haddress(n))); |
duke@435 | 706 | debug_only(__ verify_local_tag(frame::TagCategory2, n)); |
duke@435 | 707 | } |
duke@435 | 708 | |
duke@435 | 709 | |
duke@435 | 710 | void TemplateTable::fload(int n) { |
duke@435 | 711 | transition(vtos, ftos); |
duke@435 | 712 | __ fld_s(faddress(n)); |
duke@435 | 713 | debug_only(__ verify_local_tag(frame::TagValue, n)); |
duke@435 | 714 | } |
duke@435 | 715 | |
duke@435 | 716 | |
duke@435 | 717 | void TemplateTable::dload(int n) { |
duke@435 | 718 | transition(vtos, dtos); |
duke@435 | 719 | if (TaggedStackInterpreter) { |
duke@435 | 720 | // Get double out of locals array, onto temp stack and load with |
duke@435 | 721 | // float instruction into ST0 |
duke@435 | 722 | __ movl(rax, laddress(n)); |
duke@435 | 723 | __ movl(rdx, haddress(n)); |
never@739 | 724 | __ push(rdx); // push hi first |
never@739 | 725 | __ push(rax); |
duke@435 | 726 | __ fld_d(Address(rsp, 0)); |
never@739 | 727 | __ addptr(rsp, 2*wordSize); // reset rsp |
duke@435 | 728 | debug_only(__ verify_local_tag(frame::TagCategory2, n)); |
duke@435 | 729 | } else { |
duke@435 | 730 | __ fld_d(daddress(n)); |
duke@435 | 731 | } |
duke@435 | 732 | } |
duke@435 | 733 | |
duke@435 | 734 | |
duke@435 | 735 | void TemplateTable::aload(int n) { |
duke@435 | 736 | transition(vtos, atos); |
never@739 | 737 | __ movptr(rax, aaddress(n)); |
duke@435 | 738 | debug_only(__ verify_local_tag(frame::TagReference, n)); |
duke@435 | 739 | } |
duke@435 | 740 | |
duke@435 | 741 | |
duke@435 | 742 | void TemplateTable::aload_0() { |
duke@435 | 743 | transition(vtos, atos); |
duke@435 | 744 | // According to bytecode histograms, the pairs: |
duke@435 | 745 | // |
duke@435 | 746 | // _aload_0, _fast_igetfield |
duke@435 | 747 | // _aload_0, _fast_agetfield |
duke@435 | 748 | // _aload_0, _fast_fgetfield |
duke@435 | 749 | // |
duke@435 | 750 | // occur frequently. If RewriteFrequentPairs is set, the (slow) _aload_0 |
duke@435 | 751 | // bytecode checks if the next bytecode is either _fast_igetfield, |
duke@435 | 752 | // _fast_agetfield or _fast_fgetfield and then rewrites the |
duke@435 | 753 | // current bytecode into a pair bytecode; otherwise it rewrites the current |
duke@435 | 754 | // bytecode into _fast_aload_0 that doesn't do the pair check anymore. |
duke@435 | 755 | // |
duke@435 | 756 | // Note: If the next bytecode is _getfield, the rewrite must be delayed, |
duke@435 | 757 | // otherwise we may miss an opportunity for a pair. |
duke@435 | 758 | // |
duke@435 | 759 | // Also rewrite frequent pairs |
duke@435 | 760 | // aload_0, aload_1 |
duke@435 | 761 | // aload_0, iload_1 |
duke@435 | 762 | // These bytecodes with a small amount of code are most profitable to rewrite |
duke@435 | 763 | if (RewriteFrequentPairs) { |
duke@435 | 764 | Label rewrite, done; |
duke@435 | 765 | // get next byte |
duke@435 | 766 | __ load_unsigned_byte(rbx, at_bcp(Bytecodes::length_for(Bytecodes::_aload_0))); |
duke@435 | 767 | |
duke@435 | 768 | // do actual aload_0 |
duke@435 | 769 | aload(0); |
duke@435 | 770 | |
duke@435 | 771 | // if _getfield then wait with rewrite |
duke@435 | 772 | __ cmpl(rbx, Bytecodes::_getfield); |
duke@435 | 773 | __ jcc(Assembler::equal, done); |
duke@435 | 774 | |
duke@435 | 775 | // if _igetfield then reqrite to _fast_iaccess_0 |
duke@435 | 776 | assert(Bytecodes::java_code(Bytecodes::_fast_iaccess_0) == Bytecodes::_aload_0, "fix bytecode definition"); |
duke@435 | 777 | __ cmpl(rbx, Bytecodes::_fast_igetfield); |
duke@435 | 778 | __ movl(rcx, Bytecodes::_fast_iaccess_0); |
duke@435 | 779 | __ jccb(Assembler::equal, rewrite); |
duke@435 | 780 | |
duke@435 | 781 | // if _agetfield then reqrite to _fast_aaccess_0 |
duke@435 | 782 | assert(Bytecodes::java_code(Bytecodes::_fast_aaccess_0) == Bytecodes::_aload_0, "fix bytecode definition"); |
duke@435 | 783 | __ cmpl(rbx, Bytecodes::_fast_agetfield); |
duke@435 | 784 | __ movl(rcx, Bytecodes::_fast_aaccess_0); |
duke@435 | 785 | __ jccb(Assembler::equal, rewrite); |
duke@435 | 786 | |
duke@435 | 787 | // if _fgetfield then reqrite to _fast_faccess_0 |
duke@435 | 788 | assert(Bytecodes::java_code(Bytecodes::_fast_faccess_0) == Bytecodes::_aload_0, "fix bytecode definition"); |
duke@435 | 789 | __ cmpl(rbx, Bytecodes::_fast_fgetfield); |
duke@435 | 790 | __ movl(rcx, Bytecodes::_fast_faccess_0); |
duke@435 | 791 | __ jccb(Assembler::equal, rewrite); |
duke@435 | 792 | |
duke@435 | 793 | // else rewrite to _fast_aload0 |
duke@435 | 794 | assert(Bytecodes::java_code(Bytecodes::_fast_aload_0) == Bytecodes::_aload_0, "fix bytecode definition"); |
duke@435 | 795 | __ movl(rcx, Bytecodes::_fast_aload_0); |
duke@435 | 796 | |
duke@435 | 797 | // rewrite |
duke@435 | 798 | // rcx: fast bytecode |
duke@435 | 799 | __ bind(rewrite); |
duke@435 | 800 | patch_bytecode(Bytecodes::_aload_0, rcx, rbx, false); |
duke@435 | 801 | |
duke@435 | 802 | __ bind(done); |
duke@435 | 803 | } else { |
duke@435 | 804 | aload(0); |
duke@435 | 805 | } |
duke@435 | 806 | } |
duke@435 | 807 | |
duke@435 | 808 | void TemplateTable::istore() { |
duke@435 | 809 | transition(itos, vtos); |
duke@435 | 810 | locals_index(rbx); |
duke@435 | 811 | __ movl(iaddress(rbx), rax); |
duke@435 | 812 | __ tag_local(frame::TagValue, rbx); |
duke@435 | 813 | } |
duke@435 | 814 | |
duke@435 | 815 | |
duke@435 | 816 | void TemplateTable::lstore() { |
duke@435 | 817 | transition(ltos, vtos); |
duke@435 | 818 | locals_index(rbx); |
never@739 | 819 | __ movptr(laddress(rbx), rax); |
never@739 | 820 | NOT_LP64(__ movptr(haddress(rbx), rdx)); |
duke@435 | 821 | __ tag_local(frame::TagCategory2, rbx); |
duke@435 | 822 | } |
duke@435 | 823 | |
duke@435 | 824 | |
duke@435 | 825 | void TemplateTable::fstore() { |
duke@435 | 826 | transition(ftos, vtos); |
duke@435 | 827 | locals_index(rbx); |
duke@435 | 828 | __ fstp_s(faddress(rbx)); |
duke@435 | 829 | __ tag_local(frame::TagValue, rbx); |
duke@435 | 830 | } |
duke@435 | 831 | |
duke@435 | 832 | |
duke@435 | 833 | void TemplateTable::dstore() { |
duke@435 | 834 | transition(dtos, vtos); |
duke@435 | 835 | locals_index(rbx); |
duke@435 | 836 | if (TaggedStackInterpreter) { |
duke@435 | 837 | // Store double on stack and reload into locals nonadjacently |
never@739 | 838 | __ subptr(rsp, 2 * wordSize); |
duke@435 | 839 | __ fstp_d(Address(rsp, 0)); |
never@739 | 840 | __ pop(rax); |
never@739 | 841 | __ pop(rdx); |
never@739 | 842 | __ movptr(laddress(rbx), rax); |
never@739 | 843 | __ movptr(haddress(rbx), rdx); |
duke@435 | 844 | __ tag_local(frame::TagCategory2, rbx); |
duke@435 | 845 | } else { |
duke@435 | 846 | __ fstp_d(daddress(rbx)); |
duke@435 | 847 | } |
duke@435 | 848 | } |
duke@435 | 849 | |
duke@435 | 850 | |
duke@435 | 851 | void TemplateTable::astore() { |
duke@435 | 852 | transition(vtos, vtos); |
duke@435 | 853 | __ pop_ptr(rax, rdx); // will need to pop tag too |
duke@435 | 854 | locals_index(rbx); |
never@739 | 855 | __ movptr(aaddress(rbx), rax); |
duke@435 | 856 | __ tag_local(rdx, rbx); // need to store same tag in local may be returnAddr |
duke@435 | 857 | } |
duke@435 | 858 | |
duke@435 | 859 | |
duke@435 | 860 | void TemplateTable::wide_istore() { |
duke@435 | 861 | transition(vtos, vtos); |
duke@435 | 862 | __ pop_i(rax); |
duke@435 | 863 | locals_index_wide(rbx); |
duke@435 | 864 | __ movl(iaddress(rbx), rax); |
duke@435 | 865 | __ tag_local(frame::TagValue, rbx); |
duke@435 | 866 | } |
duke@435 | 867 | |
duke@435 | 868 | |
duke@435 | 869 | void TemplateTable::wide_lstore() { |
duke@435 | 870 | transition(vtos, vtos); |
duke@435 | 871 | __ pop_l(rax, rdx); |
duke@435 | 872 | locals_index_wide(rbx); |
never@739 | 873 | __ movptr(laddress(rbx), rax); |
never@739 | 874 | NOT_LP64(__ movl(haddress(rbx), rdx)); |
duke@435 | 875 | __ tag_local(frame::TagCategory2, rbx); |
duke@435 | 876 | } |
duke@435 | 877 | |
duke@435 | 878 | |
duke@435 | 879 | void TemplateTable::wide_fstore() { |
duke@435 | 880 | wide_istore(); |
duke@435 | 881 | } |
duke@435 | 882 | |
duke@435 | 883 | |
duke@435 | 884 | void TemplateTable::wide_dstore() { |
duke@435 | 885 | wide_lstore(); |
duke@435 | 886 | } |
duke@435 | 887 | |
duke@435 | 888 | |
duke@435 | 889 | void TemplateTable::wide_astore() { |
duke@435 | 890 | transition(vtos, vtos); |
duke@435 | 891 | __ pop_ptr(rax, rdx); |
duke@435 | 892 | locals_index_wide(rbx); |
never@739 | 893 | __ movptr(aaddress(rbx), rax); |
duke@435 | 894 | __ tag_local(rdx, rbx); |
duke@435 | 895 | } |
duke@435 | 896 | |
duke@435 | 897 | |
duke@435 | 898 | void TemplateTable::iastore() { |
duke@435 | 899 | transition(itos, vtos); |
duke@435 | 900 | __ pop_i(rbx); |
duke@435 | 901 | // rax,: value |
duke@435 | 902 | // rdx: array |
duke@435 | 903 | index_check(rdx, rbx); // prefer index in rbx, |
duke@435 | 904 | // rbx,: index |
duke@435 | 905 | __ movl(Address(rdx, rbx, Address::times_4, arrayOopDesc::base_offset_in_bytes(T_INT)), rax); |
duke@435 | 906 | } |
duke@435 | 907 | |
duke@435 | 908 | |
duke@435 | 909 | void TemplateTable::lastore() { |
duke@435 | 910 | transition(ltos, vtos); |
duke@435 | 911 | __ pop_i(rbx); |
duke@435 | 912 | // rax,: low(value) |
duke@435 | 913 | // rcx: array |
duke@435 | 914 | // rdx: high(value) |
duke@435 | 915 | index_check(rcx, rbx); // prefer index in rbx, |
duke@435 | 916 | // rbx,: index |
never@739 | 917 | __ movptr(Address(rcx, rbx, Address::times_8, arrayOopDesc::base_offset_in_bytes(T_LONG) + 0 * wordSize), rax); |
never@739 | 918 | NOT_LP64(__ movl(Address(rcx, rbx, Address::times_8, arrayOopDesc::base_offset_in_bytes(T_LONG) + 1 * wordSize), rdx)); |
duke@435 | 919 | } |
duke@435 | 920 | |
duke@435 | 921 | |
duke@435 | 922 | void TemplateTable::fastore() { |
duke@435 | 923 | transition(ftos, vtos); |
duke@435 | 924 | __ pop_i(rbx); |
duke@435 | 925 | // rdx: array |
duke@435 | 926 | // st0: value |
duke@435 | 927 | index_check(rdx, rbx); // prefer index in rbx, |
duke@435 | 928 | // rbx,: index |
duke@435 | 929 | __ fstp_s(Address(rdx, rbx, Address::times_4, arrayOopDesc::base_offset_in_bytes(T_FLOAT))); |
duke@435 | 930 | } |
duke@435 | 931 | |
duke@435 | 932 | |
duke@435 | 933 | void TemplateTable::dastore() { |
duke@435 | 934 | transition(dtos, vtos); |
duke@435 | 935 | __ pop_i(rbx); |
duke@435 | 936 | // rdx: array |
duke@435 | 937 | // st0: value |
duke@435 | 938 | index_check(rdx, rbx); // prefer index in rbx, |
duke@435 | 939 | // rbx,: index |
duke@435 | 940 | __ fstp_d(Address(rdx, rbx, Address::times_8, arrayOopDesc::base_offset_in_bytes(T_DOUBLE))); |
duke@435 | 941 | } |
duke@435 | 942 | |
duke@435 | 943 | |
duke@435 | 944 | void TemplateTable::aastore() { |
duke@435 | 945 | Label is_null, ok_is_subtype, done; |
duke@435 | 946 | transition(vtos, vtos); |
duke@435 | 947 | // stack: ..., array, index, value |
never@739 | 948 | __ movptr(rax, at_tos()); // Value |
duke@435 | 949 | __ movl(rcx, at_tos_p1()); // Index |
never@739 | 950 | __ movptr(rdx, at_tos_p2()); // Array |
ysr@777 | 951 | |
ysr@777 | 952 | Address element_address(rdx, rcx, Address::times_4, arrayOopDesc::base_offset_in_bytes(T_OBJECT)); |
duke@435 | 953 | index_check_without_pop(rdx, rcx); // kills rbx, |
duke@435 | 954 | // do array store check - check for NULL value first |
never@739 | 955 | __ testptr(rax, rax); |
duke@435 | 956 | __ jcc(Assembler::zero, is_null); |
duke@435 | 957 | |
duke@435 | 958 | // Move subklass into EBX |
never@739 | 959 | __ movptr(rbx, Address(rax, oopDesc::klass_offset_in_bytes())); |
duke@435 | 960 | // Move superklass into EAX |
never@739 | 961 | __ movptr(rax, Address(rdx, oopDesc::klass_offset_in_bytes())); |
never@739 | 962 | __ movptr(rax, Address(rax, sizeof(oopDesc) + objArrayKlass::element_klass_offset_in_bytes())); |
never@739 | 963 | // Compress array+index*wordSize+12 into a single register. Frees ECX. |
apetrusenko@797 | 964 | __ lea(rdx, element_address); |
duke@435 | 965 | |
duke@435 | 966 | // Generate subtype check. Blows ECX. Resets EDI to locals. |
duke@435 | 967 | // Superklass in EAX. Subklass in EBX. |
duke@435 | 968 | __ gen_subtype_check( rbx, ok_is_subtype ); |
duke@435 | 969 | |
duke@435 | 970 | // Come here on failure |
duke@435 | 971 | // object is at TOS |
duke@435 | 972 | __ jump(ExternalAddress(Interpreter::_throw_ArrayStoreException_entry)); |
duke@435 | 973 | |
duke@435 | 974 | // Come here on success |
duke@435 | 975 | __ bind(ok_is_subtype); |
ysr@777 | 976 | |
ysr@777 | 977 | // Get the value to store |
apetrusenko@797 | 978 | __ movptr(rax, at_rsp()); |
ysr@777 | 979 | // and store it with appropriate barrier |
ysr@777 | 980 | do_oop_store(_masm, Address(rdx, 0), rax, _bs->kind(), true); |
ysr@777 | 981 | |
ysr@777 | 982 | __ jmp(done); |
duke@435 | 983 | |
duke@435 | 984 | // Have a NULL in EAX, EDX=array, ECX=index. Store NULL at ary[idx] |
duke@435 | 985 | __ bind(is_null); |
duke@435 | 986 | __ profile_null_seen(rbx); |
ysr@777 | 987 | |
ysr@777 | 988 | // Store NULL, (noreg means NULL to do_oop_store) |
ysr@777 | 989 | do_oop_store(_masm, element_address, noreg, _bs->kind(), true); |
duke@435 | 990 | |
duke@435 | 991 | // Pop stack arguments |
duke@435 | 992 | __ bind(done); |
never@739 | 993 | __ addptr(rsp, 3 * Interpreter::stackElementSize()); |
duke@435 | 994 | } |
duke@435 | 995 | |
duke@435 | 996 | |
duke@435 | 997 | void TemplateTable::bastore() { |
duke@435 | 998 | transition(itos, vtos); |
duke@435 | 999 | __ pop_i(rbx); |
duke@435 | 1000 | // rax,: value |
duke@435 | 1001 | // rdx: array |
duke@435 | 1002 | index_check(rdx, rbx); // prefer index in rbx, |
duke@435 | 1003 | // rbx,: index |
duke@435 | 1004 | __ movb(Address(rdx, rbx, Address::times_1, arrayOopDesc::base_offset_in_bytes(T_BYTE)), rax); |
duke@435 | 1005 | } |
duke@435 | 1006 | |
duke@435 | 1007 | |
duke@435 | 1008 | void TemplateTable::castore() { |
duke@435 | 1009 | transition(itos, vtos); |
duke@435 | 1010 | __ pop_i(rbx); |
duke@435 | 1011 | // rax,: value |
duke@435 | 1012 | // rdx: array |
duke@435 | 1013 | index_check(rdx, rbx); // prefer index in rbx, |
duke@435 | 1014 | // rbx,: index |
duke@435 | 1015 | __ movw(Address(rdx, rbx, Address::times_2, arrayOopDesc::base_offset_in_bytes(T_CHAR)), rax); |
duke@435 | 1016 | } |
duke@435 | 1017 | |
duke@435 | 1018 | |
duke@435 | 1019 | void TemplateTable::sastore() { |
duke@435 | 1020 | castore(); |
duke@435 | 1021 | } |
duke@435 | 1022 | |
duke@435 | 1023 | |
duke@435 | 1024 | void TemplateTable::istore(int n) { |
duke@435 | 1025 | transition(itos, vtos); |
duke@435 | 1026 | __ movl(iaddress(n), rax); |
duke@435 | 1027 | __ tag_local(frame::TagValue, n); |
duke@435 | 1028 | } |
duke@435 | 1029 | |
duke@435 | 1030 | |
duke@435 | 1031 | void TemplateTable::lstore(int n) { |
duke@435 | 1032 | transition(ltos, vtos); |
never@739 | 1033 | __ movptr(laddress(n), rax); |
never@739 | 1034 | NOT_LP64(__ movptr(haddress(n), rdx)); |
duke@435 | 1035 | __ tag_local(frame::TagCategory2, n); |
duke@435 | 1036 | } |
duke@435 | 1037 | |
duke@435 | 1038 | |
duke@435 | 1039 | void TemplateTable::fstore(int n) { |
duke@435 | 1040 | transition(ftos, vtos); |
duke@435 | 1041 | __ fstp_s(faddress(n)); |
duke@435 | 1042 | __ tag_local(frame::TagValue, n); |
duke@435 | 1043 | } |
duke@435 | 1044 | |
duke@435 | 1045 | |
duke@435 | 1046 | void TemplateTable::dstore(int n) { |
duke@435 | 1047 | transition(dtos, vtos); |
duke@435 | 1048 | if (TaggedStackInterpreter) { |
never@739 | 1049 | __ subptr(rsp, 2 * wordSize); |
duke@435 | 1050 | __ fstp_d(Address(rsp, 0)); |
never@739 | 1051 | __ pop(rax); |
never@739 | 1052 | __ pop(rdx); |
duke@435 | 1053 | __ movl(laddress(n), rax); |
duke@435 | 1054 | __ movl(haddress(n), rdx); |
duke@435 | 1055 | __ tag_local(frame::TagCategory2, n); |
duke@435 | 1056 | } else { |
duke@435 | 1057 | __ fstp_d(daddress(n)); |
duke@435 | 1058 | } |
duke@435 | 1059 | } |
duke@435 | 1060 | |
duke@435 | 1061 | |
duke@435 | 1062 | void TemplateTable::astore(int n) { |
duke@435 | 1063 | transition(vtos, vtos); |
duke@435 | 1064 | __ pop_ptr(rax, rdx); |
never@739 | 1065 | __ movptr(aaddress(n), rax); |
duke@435 | 1066 | __ tag_local(rdx, n); |
duke@435 | 1067 | } |
duke@435 | 1068 | |
duke@435 | 1069 | |
duke@435 | 1070 | void TemplateTable::pop() { |
duke@435 | 1071 | transition(vtos, vtos); |
never@739 | 1072 | __ addptr(rsp, Interpreter::stackElementSize()); |
duke@435 | 1073 | } |
duke@435 | 1074 | |
duke@435 | 1075 | |
duke@435 | 1076 | void TemplateTable::pop2() { |
duke@435 | 1077 | transition(vtos, vtos); |
never@739 | 1078 | __ addptr(rsp, 2*Interpreter::stackElementSize()); |
duke@435 | 1079 | } |
duke@435 | 1080 | |
duke@435 | 1081 | |
duke@435 | 1082 | void TemplateTable::dup() { |
duke@435 | 1083 | transition(vtos, vtos); |
duke@435 | 1084 | // stack: ..., a |
duke@435 | 1085 | __ load_ptr_and_tag(0, rax, rdx); |
duke@435 | 1086 | __ push_ptr(rax, rdx); |
duke@435 | 1087 | // stack: ..., a, a |
duke@435 | 1088 | } |
duke@435 | 1089 | |
duke@435 | 1090 | |
duke@435 | 1091 | void TemplateTable::dup_x1() { |
duke@435 | 1092 | transition(vtos, vtos); |
duke@435 | 1093 | // stack: ..., a, b |
duke@435 | 1094 | __ load_ptr_and_tag(0, rax, rdx); // load b |
duke@435 | 1095 | __ load_ptr_and_tag(1, rcx, rbx); // load a |
duke@435 | 1096 | __ store_ptr_and_tag(1, rax, rdx); // store b |
duke@435 | 1097 | __ store_ptr_and_tag(0, rcx, rbx); // store a |
duke@435 | 1098 | __ push_ptr(rax, rdx); // push b |
duke@435 | 1099 | // stack: ..., b, a, b |
duke@435 | 1100 | } |
duke@435 | 1101 | |
duke@435 | 1102 | |
duke@435 | 1103 | void TemplateTable::dup_x2() { |
duke@435 | 1104 | transition(vtos, vtos); |
duke@435 | 1105 | // stack: ..., a, b, c |
duke@435 | 1106 | __ load_ptr_and_tag(0, rax, rdx); // load c |
duke@435 | 1107 | __ load_ptr_and_tag(2, rcx, rbx); // load a |
duke@435 | 1108 | __ store_ptr_and_tag(2, rax, rdx); // store c in a |
duke@435 | 1109 | __ push_ptr(rax, rdx); // push c |
duke@435 | 1110 | // stack: ..., c, b, c, c |
duke@435 | 1111 | __ load_ptr_and_tag(2, rax, rdx); // load b |
duke@435 | 1112 | __ store_ptr_and_tag(2, rcx, rbx); // store a in b |
duke@435 | 1113 | // stack: ..., c, a, c, c |
duke@435 | 1114 | __ store_ptr_and_tag(1, rax, rdx); // store b in c |
duke@435 | 1115 | // stack: ..., c, a, b, c |
duke@435 | 1116 | } |
duke@435 | 1117 | |
duke@435 | 1118 | |
duke@435 | 1119 | void TemplateTable::dup2() { |
duke@435 | 1120 | transition(vtos, vtos); |
duke@435 | 1121 | // stack: ..., a, b |
duke@435 | 1122 | __ load_ptr_and_tag(1, rax, rdx); // load a |
duke@435 | 1123 | __ push_ptr(rax, rdx); // push a |
duke@435 | 1124 | __ load_ptr_and_tag(1, rax, rdx); // load b |
duke@435 | 1125 | __ push_ptr(rax, rdx); // push b |
duke@435 | 1126 | // stack: ..., a, b, a, b |
duke@435 | 1127 | } |
duke@435 | 1128 | |
duke@435 | 1129 | |
duke@435 | 1130 | void TemplateTable::dup2_x1() { |
duke@435 | 1131 | transition(vtos, vtos); |
duke@435 | 1132 | // stack: ..., a, b, c |
duke@435 | 1133 | __ load_ptr_and_tag(0, rcx, rbx); // load c |
duke@435 | 1134 | __ load_ptr_and_tag(1, rax, rdx); // load b |
duke@435 | 1135 | __ push_ptr(rax, rdx); // push b |
duke@435 | 1136 | __ push_ptr(rcx, rbx); // push c |
duke@435 | 1137 | // stack: ..., a, b, c, b, c |
duke@435 | 1138 | __ store_ptr_and_tag(3, rcx, rbx); // store c in b |
duke@435 | 1139 | // stack: ..., a, c, c, b, c |
duke@435 | 1140 | __ load_ptr_and_tag(4, rcx, rbx); // load a |
duke@435 | 1141 | __ store_ptr_and_tag(2, rcx, rbx); // store a in 2nd c |
duke@435 | 1142 | // stack: ..., a, c, a, b, c |
duke@435 | 1143 | __ store_ptr_and_tag(4, rax, rdx); // store b in a |
duke@435 | 1144 | // stack: ..., b, c, a, b, c |
duke@435 | 1145 | // stack: ..., b, c, a, b, c |
duke@435 | 1146 | } |
duke@435 | 1147 | |
duke@435 | 1148 | |
duke@435 | 1149 | void TemplateTable::dup2_x2() { |
duke@435 | 1150 | transition(vtos, vtos); |
duke@435 | 1151 | // stack: ..., a, b, c, d |
duke@435 | 1152 | __ load_ptr_and_tag(0, rcx, rbx); // load d |
duke@435 | 1153 | __ load_ptr_and_tag(1, rax, rdx); // load c |
duke@435 | 1154 | __ push_ptr(rax, rdx); // push c |
duke@435 | 1155 | __ push_ptr(rcx, rbx); // push d |
duke@435 | 1156 | // stack: ..., a, b, c, d, c, d |
duke@435 | 1157 | __ load_ptr_and_tag(4, rax, rdx); // load b |
duke@435 | 1158 | __ store_ptr_and_tag(2, rax, rdx); // store b in d |
duke@435 | 1159 | __ store_ptr_and_tag(4, rcx, rbx); // store d in b |
duke@435 | 1160 | // stack: ..., a, d, c, b, c, d |
duke@435 | 1161 | __ load_ptr_and_tag(5, rcx, rbx); // load a |
duke@435 | 1162 | __ load_ptr_and_tag(3, rax, rdx); // load c |
duke@435 | 1163 | __ store_ptr_and_tag(3, rcx, rbx); // store a in c |
duke@435 | 1164 | __ store_ptr_and_tag(5, rax, rdx); // store c in a |
duke@435 | 1165 | // stack: ..., c, d, a, b, c, d |
duke@435 | 1166 | // stack: ..., c, d, a, b, c, d |
duke@435 | 1167 | } |
duke@435 | 1168 | |
duke@435 | 1169 | |
duke@435 | 1170 | void TemplateTable::swap() { |
duke@435 | 1171 | transition(vtos, vtos); |
duke@435 | 1172 | // stack: ..., a, b |
duke@435 | 1173 | __ load_ptr_and_tag(1, rcx, rbx); // load a |
duke@435 | 1174 | __ load_ptr_and_tag(0, rax, rdx); // load b |
duke@435 | 1175 | __ store_ptr_and_tag(0, rcx, rbx); // store a in b |
duke@435 | 1176 | __ store_ptr_and_tag(1, rax, rdx); // store b in a |
duke@435 | 1177 | // stack: ..., b, a |
duke@435 | 1178 | } |
duke@435 | 1179 | |
duke@435 | 1180 | |
duke@435 | 1181 | void TemplateTable::iop2(Operation op) { |
duke@435 | 1182 | transition(itos, itos); |
duke@435 | 1183 | switch (op) { |
duke@435 | 1184 | case add : __ pop_i(rdx); __ addl (rax, rdx); break; |
never@739 | 1185 | case sub : __ mov(rdx, rax); __ pop_i(rax); __ subl (rax, rdx); break; |
duke@435 | 1186 | case mul : __ pop_i(rdx); __ imull(rax, rdx); break; |
duke@435 | 1187 | case _and : __ pop_i(rdx); __ andl (rax, rdx); break; |
duke@435 | 1188 | case _or : __ pop_i(rdx); __ orl (rax, rdx); break; |
duke@435 | 1189 | case _xor : __ pop_i(rdx); __ xorl (rax, rdx); break; |
never@739 | 1190 | case shl : __ mov(rcx, rax); __ pop_i(rax); __ shll (rax); break; // implicit masking of lower 5 bits by Intel shift instr. |
never@739 | 1191 | case shr : __ mov(rcx, rax); __ pop_i(rax); __ sarl (rax); break; // implicit masking of lower 5 bits by Intel shift instr. |
never@739 | 1192 | case ushr : __ mov(rcx, rax); __ pop_i(rax); __ shrl (rax); break; // implicit masking of lower 5 bits by Intel shift instr. |
duke@435 | 1193 | default : ShouldNotReachHere(); |
duke@435 | 1194 | } |
duke@435 | 1195 | } |
duke@435 | 1196 | |
duke@435 | 1197 | |
duke@435 | 1198 | void TemplateTable::lop2(Operation op) { |
duke@435 | 1199 | transition(ltos, ltos); |
duke@435 | 1200 | __ pop_l(rbx, rcx); |
duke@435 | 1201 | switch (op) { |
duke@435 | 1202 | case add : __ addl(rax, rbx); __ adcl(rdx, rcx); break; |
duke@435 | 1203 | case sub : __ subl(rbx, rax); __ sbbl(rcx, rdx); |
never@739 | 1204 | __ mov(rax, rbx); __ mov(rdx, rcx); break; |
duke@435 | 1205 | case _and: __ andl(rax, rbx); __ andl(rdx, rcx); break; |
duke@435 | 1206 | case _or : __ orl (rax, rbx); __ orl (rdx, rcx); break; |
duke@435 | 1207 | case _xor: __ xorl(rax, rbx); __ xorl(rdx, rcx); break; |
duke@435 | 1208 | default : ShouldNotReachHere(); |
duke@435 | 1209 | } |
duke@435 | 1210 | } |
duke@435 | 1211 | |
duke@435 | 1212 | |
duke@435 | 1213 | void TemplateTable::idiv() { |
duke@435 | 1214 | transition(itos, itos); |
never@739 | 1215 | __ mov(rcx, rax); |
duke@435 | 1216 | __ pop_i(rax); |
duke@435 | 1217 | // Note: could xor rax, and rcx and compare with (-1 ^ min_int). If |
duke@435 | 1218 | // they are not equal, one could do a normal division (no correction |
duke@435 | 1219 | // needed), which may speed up this implementation for the common case. |
duke@435 | 1220 | // (see also JVM spec., p.243 & p.271) |
duke@435 | 1221 | __ corrected_idivl(rcx); |
duke@435 | 1222 | } |
duke@435 | 1223 | |
duke@435 | 1224 | |
duke@435 | 1225 | void TemplateTable::irem() { |
duke@435 | 1226 | transition(itos, itos); |
never@739 | 1227 | __ mov(rcx, rax); |
duke@435 | 1228 | __ pop_i(rax); |
duke@435 | 1229 | // Note: could xor rax, and rcx and compare with (-1 ^ min_int). If |
duke@435 | 1230 | // they are not equal, one could do a normal division (no correction |
duke@435 | 1231 | // needed), which may speed up this implementation for the common case. |
duke@435 | 1232 | // (see also JVM spec., p.243 & p.271) |
duke@435 | 1233 | __ corrected_idivl(rcx); |
never@739 | 1234 | __ mov(rax, rdx); |
duke@435 | 1235 | } |
duke@435 | 1236 | |
duke@435 | 1237 | |
duke@435 | 1238 | void TemplateTable::lmul() { |
duke@435 | 1239 | transition(ltos, ltos); |
duke@435 | 1240 | __ pop_l(rbx, rcx); |
never@739 | 1241 | __ push(rcx); __ push(rbx); |
never@739 | 1242 | __ push(rdx); __ push(rax); |
duke@435 | 1243 | __ lmul(2 * wordSize, 0); |
never@739 | 1244 | __ addptr(rsp, 4 * wordSize); // take off temporaries |
duke@435 | 1245 | } |
duke@435 | 1246 | |
duke@435 | 1247 | |
duke@435 | 1248 | void TemplateTable::ldiv() { |
duke@435 | 1249 | transition(ltos, ltos); |
duke@435 | 1250 | __ pop_l(rbx, rcx); |
never@739 | 1251 | __ push(rcx); __ push(rbx); |
never@739 | 1252 | __ push(rdx); __ push(rax); |
duke@435 | 1253 | // check if y = 0 |
duke@435 | 1254 | __ orl(rax, rdx); |
duke@435 | 1255 | __ jump_cc(Assembler::zero, |
duke@435 | 1256 | ExternalAddress(Interpreter::_throw_ArithmeticException_entry)); |
duke@435 | 1257 | __ call_VM_leaf(CAST_FROM_FN_PTR(address, SharedRuntime::ldiv)); |
never@739 | 1258 | __ addptr(rsp, 4 * wordSize); // take off temporaries |
duke@435 | 1259 | } |
duke@435 | 1260 | |
duke@435 | 1261 | |
duke@435 | 1262 | void TemplateTable::lrem() { |
duke@435 | 1263 | transition(ltos, ltos); |
duke@435 | 1264 | __ pop_l(rbx, rcx); |
never@739 | 1265 | __ push(rcx); __ push(rbx); |
never@739 | 1266 | __ push(rdx); __ push(rax); |
duke@435 | 1267 | // check if y = 0 |
duke@435 | 1268 | __ orl(rax, rdx); |
duke@435 | 1269 | __ jump_cc(Assembler::zero, |
duke@435 | 1270 | ExternalAddress(Interpreter::_throw_ArithmeticException_entry)); |
duke@435 | 1271 | __ call_VM_leaf(CAST_FROM_FN_PTR(address, SharedRuntime::lrem)); |
never@739 | 1272 | __ addptr(rsp, 4 * wordSize); |
duke@435 | 1273 | } |
duke@435 | 1274 | |
duke@435 | 1275 | |
duke@435 | 1276 | void TemplateTable::lshl() { |
duke@435 | 1277 | transition(itos, ltos); |
duke@435 | 1278 | __ movl(rcx, rax); // get shift count |
duke@435 | 1279 | __ pop_l(rax, rdx); // get shift value |
duke@435 | 1280 | __ lshl(rdx, rax); |
duke@435 | 1281 | } |
duke@435 | 1282 | |
duke@435 | 1283 | |
duke@435 | 1284 | void TemplateTable::lshr() { |
duke@435 | 1285 | transition(itos, ltos); |
never@739 | 1286 | __ mov(rcx, rax); // get shift count |
duke@435 | 1287 | __ pop_l(rax, rdx); // get shift value |
duke@435 | 1288 | __ lshr(rdx, rax, true); |
duke@435 | 1289 | } |
duke@435 | 1290 | |
duke@435 | 1291 | |
duke@435 | 1292 | void TemplateTable::lushr() { |
duke@435 | 1293 | transition(itos, ltos); |
never@739 | 1294 | __ mov(rcx, rax); // get shift count |
duke@435 | 1295 | __ pop_l(rax, rdx); // get shift value |
duke@435 | 1296 | __ lshr(rdx, rax); |
duke@435 | 1297 | } |
duke@435 | 1298 | |
duke@435 | 1299 | |
duke@435 | 1300 | void TemplateTable::fop2(Operation op) { |
duke@435 | 1301 | transition(ftos, ftos); |
duke@435 | 1302 | __ pop_ftos_to_rsp(); // pop ftos into rsp |
duke@435 | 1303 | switch (op) { |
duke@435 | 1304 | case add: __ fadd_s (at_rsp()); break; |
duke@435 | 1305 | case sub: __ fsubr_s(at_rsp()); break; |
duke@435 | 1306 | case mul: __ fmul_s (at_rsp()); break; |
duke@435 | 1307 | case div: __ fdivr_s(at_rsp()); break; |
duke@435 | 1308 | case rem: __ fld_s (at_rsp()); __ fremr(rax); break; |
duke@435 | 1309 | default : ShouldNotReachHere(); |
duke@435 | 1310 | } |
duke@435 | 1311 | __ f2ieee(); |
never@739 | 1312 | __ pop(rax); // pop float thing off |
duke@435 | 1313 | } |
duke@435 | 1314 | |
duke@435 | 1315 | |
duke@435 | 1316 | void TemplateTable::dop2(Operation op) { |
duke@435 | 1317 | transition(dtos, dtos); |
duke@435 | 1318 | __ pop_dtos_to_rsp(); // pop dtos into rsp |
duke@435 | 1319 | |
duke@435 | 1320 | switch (op) { |
duke@435 | 1321 | case add: __ fadd_d (at_rsp()); break; |
duke@435 | 1322 | case sub: __ fsubr_d(at_rsp()); break; |
duke@435 | 1323 | case mul: { |
duke@435 | 1324 | Label L_strict; |
duke@435 | 1325 | Label L_join; |
duke@435 | 1326 | const Address access_flags (rcx, methodOopDesc::access_flags_offset()); |
duke@435 | 1327 | __ get_method(rcx); |
duke@435 | 1328 | __ movl(rcx, access_flags); |
duke@435 | 1329 | __ testl(rcx, JVM_ACC_STRICT); |
duke@435 | 1330 | __ jccb(Assembler::notZero, L_strict); |
duke@435 | 1331 | __ fmul_d (at_rsp()); |
duke@435 | 1332 | __ jmpb(L_join); |
duke@435 | 1333 | __ bind(L_strict); |
duke@435 | 1334 | __ fld_x(ExternalAddress(StubRoutines::addr_fpu_subnormal_bias1())); |
duke@435 | 1335 | __ fmulp(); |
duke@435 | 1336 | __ fmul_d (at_rsp()); |
duke@435 | 1337 | __ fld_x(ExternalAddress(StubRoutines::addr_fpu_subnormal_bias2())); |
duke@435 | 1338 | __ fmulp(); |
duke@435 | 1339 | __ bind(L_join); |
duke@435 | 1340 | break; |
duke@435 | 1341 | } |
duke@435 | 1342 | case div: { |
duke@435 | 1343 | Label L_strict; |
duke@435 | 1344 | Label L_join; |
duke@435 | 1345 | const Address access_flags (rcx, methodOopDesc::access_flags_offset()); |
duke@435 | 1346 | __ get_method(rcx); |
duke@435 | 1347 | __ movl(rcx, access_flags); |
duke@435 | 1348 | __ testl(rcx, JVM_ACC_STRICT); |
duke@435 | 1349 | __ jccb(Assembler::notZero, L_strict); |
duke@435 | 1350 | __ fdivr_d(at_rsp()); |
duke@435 | 1351 | __ jmp(L_join); |
duke@435 | 1352 | __ bind(L_strict); |
duke@435 | 1353 | __ fld_x(ExternalAddress(StubRoutines::addr_fpu_subnormal_bias1())); |
duke@435 | 1354 | __ fmul_d (at_rsp()); |
duke@435 | 1355 | __ fdivrp(); |
duke@435 | 1356 | __ fld_x(ExternalAddress(StubRoutines::addr_fpu_subnormal_bias2())); |
duke@435 | 1357 | __ fmulp(); |
duke@435 | 1358 | __ bind(L_join); |
duke@435 | 1359 | break; |
duke@435 | 1360 | } |
duke@435 | 1361 | case rem: __ fld_d (at_rsp()); __ fremr(rax); break; |
duke@435 | 1362 | default : ShouldNotReachHere(); |
duke@435 | 1363 | } |
duke@435 | 1364 | __ d2ieee(); |
duke@435 | 1365 | // Pop double precision number from rsp. |
never@739 | 1366 | __ pop(rax); |
never@739 | 1367 | __ pop(rdx); |
duke@435 | 1368 | } |
duke@435 | 1369 | |
duke@435 | 1370 | |
duke@435 | 1371 | void TemplateTable::ineg() { |
duke@435 | 1372 | transition(itos, itos); |
duke@435 | 1373 | __ negl(rax); |
duke@435 | 1374 | } |
duke@435 | 1375 | |
duke@435 | 1376 | |
duke@435 | 1377 | void TemplateTable::lneg() { |
duke@435 | 1378 | transition(ltos, ltos); |
duke@435 | 1379 | __ lneg(rdx, rax); |
duke@435 | 1380 | } |
duke@435 | 1381 | |
duke@435 | 1382 | |
duke@435 | 1383 | void TemplateTable::fneg() { |
duke@435 | 1384 | transition(ftos, ftos); |
duke@435 | 1385 | __ fchs(); |
duke@435 | 1386 | } |
duke@435 | 1387 | |
duke@435 | 1388 | |
duke@435 | 1389 | void TemplateTable::dneg() { |
duke@435 | 1390 | transition(dtos, dtos); |
duke@435 | 1391 | __ fchs(); |
duke@435 | 1392 | } |
duke@435 | 1393 | |
duke@435 | 1394 | |
duke@435 | 1395 | void TemplateTable::iinc() { |
duke@435 | 1396 | transition(vtos, vtos); |
duke@435 | 1397 | __ load_signed_byte(rdx, at_bcp(2)); // get constant |
duke@435 | 1398 | locals_index(rbx); |
duke@435 | 1399 | __ addl(iaddress(rbx), rdx); |
duke@435 | 1400 | } |
duke@435 | 1401 | |
duke@435 | 1402 | |
duke@435 | 1403 | void TemplateTable::wide_iinc() { |
duke@435 | 1404 | transition(vtos, vtos); |
duke@435 | 1405 | __ movl(rdx, at_bcp(4)); // get constant |
duke@435 | 1406 | locals_index_wide(rbx); |
never@739 | 1407 | __ bswapl(rdx); // swap bytes & sign-extend constant |
duke@435 | 1408 | __ sarl(rdx, 16); |
duke@435 | 1409 | __ addl(iaddress(rbx), rdx); |
duke@435 | 1410 | // Note: should probably use only one movl to get both |
duke@435 | 1411 | // the index and the constant -> fix this |
duke@435 | 1412 | } |
duke@435 | 1413 | |
duke@435 | 1414 | |
duke@435 | 1415 | void TemplateTable::convert() { |
duke@435 | 1416 | // Checking |
duke@435 | 1417 | #ifdef ASSERT |
duke@435 | 1418 | { TosState tos_in = ilgl; |
duke@435 | 1419 | TosState tos_out = ilgl; |
duke@435 | 1420 | switch (bytecode()) { |
duke@435 | 1421 | case Bytecodes::_i2l: // fall through |
duke@435 | 1422 | case Bytecodes::_i2f: // fall through |
duke@435 | 1423 | case Bytecodes::_i2d: // fall through |
duke@435 | 1424 | case Bytecodes::_i2b: // fall through |
duke@435 | 1425 | case Bytecodes::_i2c: // fall through |
duke@435 | 1426 | case Bytecodes::_i2s: tos_in = itos; break; |
duke@435 | 1427 | case Bytecodes::_l2i: // fall through |
duke@435 | 1428 | case Bytecodes::_l2f: // fall through |
duke@435 | 1429 | case Bytecodes::_l2d: tos_in = ltos; break; |
duke@435 | 1430 | case Bytecodes::_f2i: // fall through |
duke@435 | 1431 | case Bytecodes::_f2l: // fall through |
duke@435 | 1432 | case Bytecodes::_f2d: tos_in = ftos; break; |
duke@435 | 1433 | case Bytecodes::_d2i: // fall through |
duke@435 | 1434 | case Bytecodes::_d2l: // fall through |
duke@435 | 1435 | case Bytecodes::_d2f: tos_in = dtos; break; |
duke@435 | 1436 | default : ShouldNotReachHere(); |
duke@435 | 1437 | } |
duke@435 | 1438 | switch (bytecode()) { |
duke@435 | 1439 | case Bytecodes::_l2i: // fall through |
duke@435 | 1440 | case Bytecodes::_f2i: // fall through |
duke@435 | 1441 | case Bytecodes::_d2i: // fall through |
duke@435 | 1442 | case Bytecodes::_i2b: // fall through |
duke@435 | 1443 | case Bytecodes::_i2c: // fall through |
duke@435 | 1444 | case Bytecodes::_i2s: tos_out = itos; break; |
duke@435 | 1445 | case Bytecodes::_i2l: // fall through |
duke@435 | 1446 | case Bytecodes::_f2l: // fall through |
duke@435 | 1447 | case Bytecodes::_d2l: tos_out = ltos; break; |
duke@435 | 1448 | case Bytecodes::_i2f: // fall through |
duke@435 | 1449 | case Bytecodes::_l2f: // fall through |
duke@435 | 1450 | case Bytecodes::_d2f: tos_out = ftos; break; |
duke@435 | 1451 | case Bytecodes::_i2d: // fall through |
duke@435 | 1452 | case Bytecodes::_l2d: // fall through |
duke@435 | 1453 | case Bytecodes::_f2d: tos_out = dtos; break; |
duke@435 | 1454 | default : ShouldNotReachHere(); |
duke@435 | 1455 | } |
duke@435 | 1456 | transition(tos_in, tos_out); |
duke@435 | 1457 | } |
duke@435 | 1458 | #endif // ASSERT |
duke@435 | 1459 | |
duke@435 | 1460 | // Conversion |
never@739 | 1461 | // (Note: use push(rcx)/pop(rcx) for 1/2-word stack-ptr manipulation) |
duke@435 | 1462 | switch (bytecode()) { |
duke@435 | 1463 | case Bytecodes::_i2l: |
duke@435 | 1464 | __ extend_sign(rdx, rax); |
duke@435 | 1465 | break; |
duke@435 | 1466 | case Bytecodes::_i2f: |
never@739 | 1467 | __ push(rax); // store int on tos |
duke@435 | 1468 | __ fild_s(at_rsp()); // load int to ST0 |
duke@435 | 1469 | __ f2ieee(); // truncate to float size |
never@739 | 1470 | __ pop(rcx); // adjust rsp |
duke@435 | 1471 | break; |
duke@435 | 1472 | case Bytecodes::_i2d: |
never@739 | 1473 | __ push(rax); // add one slot for d2ieee() |
never@739 | 1474 | __ push(rax); // store int on tos |
duke@435 | 1475 | __ fild_s(at_rsp()); // load int to ST0 |
duke@435 | 1476 | __ d2ieee(); // truncate to double size |
never@739 | 1477 | __ pop(rcx); // adjust rsp |
never@739 | 1478 | __ pop(rcx); |
duke@435 | 1479 | break; |
duke@435 | 1480 | case Bytecodes::_i2b: |
duke@435 | 1481 | __ shll(rax, 24); // truncate upper 24 bits |
duke@435 | 1482 | __ sarl(rax, 24); // and sign-extend byte |
never@739 | 1483 | LP64_ONLY(__ movsbl(rax, rax)); |
duke@435 | 1484 | break; |
duke@435 | 1485 | case Bytecodes::_i2c: |
duke@435 | 1486 | __ andl(rax, 0xFFFF); // truncate upper 16 bits |
never@739 | 1487 | LP64_ONLY(__ movzwl(rax, rax)); |
duke@435 | 1488 | break; |
duke@435 | 1489 | case Bytecodes::_i2s: |
duke@435 | 1490 | __ shll(rax, 16); // truncate upper 16 bits |
duke@435 | 1491 | __ sarl(rax, 16); // and sign-extend short |
never@739 | 1492 | LP64_ONLY(__ movswl(rax, rax)); |
duke@435 | 1493 | break; |
duke@435 | 1494 | case Bytecodes::_l2i: |
duke@435 | 1495 | /* nothing to do */ |
duke@435 | 1496 | break; |
duke@435 | 1497 | case Bytecodes::_l2f: |
never@739 | 1498 | __ push(rdx); // store long on tos |
never@739 | 1499 | __ push(rax); |
duke@435 | 1500 | __ fild_d(at_rsp()); // load long to ST0 |
duke@435 | 1501 | __ f2ieee(); // truncate to float size |
never@739 | 1502 | __ pop(rcx); // adjust rsp |
never@739 | 1503 | __ pop(rcx); |
duke@435 | 1504 | break; |
duke@435 | 1505 | case Bytecodes::_l2d: |
never@739 | 1506 | __ push(rdx); // store long on tos |
never@739 | 1507 | __ push(rax); |
duke@435 | 1508 | __ fild_d(at_rsp()); // load long to ST0 |
duke@435 | 1509 | __ d2ieee(); // truncate to double size |
never@739 | 1510 | __ pop(rcx); // adjust rsp |
never@739 | 1511 | __ pop(rcx); |
duke@435 | 1512 | break; |
duke@435 | 1513 | case Bytecodes::_f2i: |
never@739 | 1514 | __ push(rcx); // reserve space for argument |
duke@435 | 1515 | __ fstp_s(at_rsp()); // pass float argument on stack |
duke@435 | 1516 | __ call_VM_leaf(CAST_FROM_FN_PTR(address, SharedRuntime::f2i), 1); |
duke@435 | 1517 | break; |
duke@435 | 1518 | case Bytecodes::_f2l: |
never@739 | 1519 | __ push(rcx); // reserve space for argument |
duke@435 | 1520 | __ fstp_s(at_rsp()); // pass float argument on stack |
duke@435 | 1521 | __ call_VM_leaf(CAST_FROM_FN_PTR(address, SharedRuntime::f2l), 1); |
duke@435 | 1522 | break; |
duke@435 | 1523 | case Bytecodes::_f2d: |
duke@435 | 1524 | /* nothing to do */ |
duke@435 | 1525 | break; |
duke@435 | 1526 | case Bytecodes::_d2i: |
never@739 | 1527 | __ push(rcx); // reserve space for argument |
never@739 | 1528 | __ push(rcx); |
duke@435 | 1529 | __ fstp_d(at_rsp()); // pass double argument on stack |
duke@435 | 1530 | __ call_VM_leaf(CAST_FROM_FN_PTR(address, SharedRuntime::d2i), 2); |
duke@435 | 1531 | break; |
duke@435 | 1532 | case Bytecodes::_d2l: |
never@739 | 1533 | __ push(rcx); // reserve space for argument |
never@739 | 1534 | __ push(rcx); |
duke@435 | 1535 | __ fstp_d(at_rsp()); // pass double argument on stack |
duke@435 | 1536 | __ call_VM_leaf(CAST_FROM_FN_PTR(address, SharedRuntime::d2l), 2); |
duke@435 | 1537 | break; |
duke@435 | 1538 | case Bytecodes::_d2f: |
never@739 | 1539 | __ push(rcx); // reserve space for f2ieee() |
duke@435 | 1540 | __ f2ieee(); // truncate to float size |
never@739 | 1541 | __ pop(rcx); // adjust rsp |
duke@435 | 1542 | break; |
duke@435 | 1543 | default : |
duke@435 | 1544 | ShouldNotReachHere(); |
duke@435 | 1545 | } |
duke@435 | 1546 | } |
duke@435 | 1547 | |
duke@435 | 1548 | |
duke@435 | 1549 | void TemplateTable::lcmp() { |
duke@435 | 1550 | transition(ltos, itos); |
duke@435 | 1551 | // y = rdx:rax |
duke@435 | 1552 | __ pop_l(rbx, rcx); // get x = rcx:rbx |
duke@435 | 1553 | __ lcmp2int(rcx, rbx, rdx, rax);// rcx := cmp(x, y) |
never@739 | 1554 | __ mov(rax, rcx); |
duke@435 | 1555 | } |
duke@435 | 1556 | |
duke@435 | 1557 | |
duke@435 | 1558 | void TemplateTable::float_cmp(bool is_float, int unordered_result) { |
duke@435 | 1559 | if (is_float) { |
duke@435 | 1560 | __ pop_ftos_to_rsp(); |
duke@435 | 1561 | __ fld_s(at_rsp()); |
duke@435 | 1562 | } else { |
duke@435 | 1563 | __ pop_dtos_to_rsp(); |
duke@435 | 1564 | __ fld_d(at_rsp()); |
never@739 | 1565 | __ pop(rdx); |
duke@435 | 1566 | } |
never@739 | 1567 | __ pop(rcx); |
duke@435 | 1568 | __ fcmp2int(rax, unordered_result < 0); |
duke@435 | 1569 | } |
duke@435 | 1570 | |
duke@435 | 1571 | |
duke@435 | 1572 | void TemplateTable::branch(bool is_jsr, bool is_wide) { |
duke@435 | 1573 | __ get_method(rcx); // ECX holds method |
duke@435 | 1574 | __ profile_taken_branch(rax,rbx); // EAX holds updated MDP, EBX holds bumped taken count |
duke@435 | 1575 | |
duke@435 | 1576 | const ByteSize be_offset = methodOopDesc::backedge_counter_offset() + InvocationCounter::counter_offset(); |
duke@435 | 1577 | const ByteSize inv_offset = methodOopDesc::invocation_counter_offset() + InvocationCounter::counter_offset(); |
duke@435 | 1578 | const int method_offset = frame::interpreter_frame_method_offset * wordSize; |
duke@435 | 1579 | |
duke@435 | 1580 | // Load up EDX with the branch displacement |
duke@435 | 1581 | __ movl(rdx, at_bcp(1)); |
never@739 | 1582 | __ bswapl(rdx); |
duke@435 | 1583 | if (!is_wide) __ sarl(rdx, 16); |
never@739 | 1584 | LP64_ONLY(__ movslq(rdx, rdx)); |
never@739 | 1585 | |
duke@435 | 1586 | |
duke@435 | 1587 | // Handle all the JSR stuff here, then exit. |
duke@435 | 1588 | // It's much shorter and cleaner than intermingling with the |
twisti@1040 | 1589 | // non-JSR normal-branch stuff occurring below. |
duke@435 | 1590 | if (is_jsr) { |
duke@435 | 1591 | // Pre-load the next target bytecode into EBX |
duke@435 | 1592 | __ load_unsigned_byte(rbx, Address(rsi, rdx, Address::times_1, 0)); |
duke@435 | 1593 | |
duke@435 | 1594 | // compute return address as bci in rax, |
never@739 | 1595 | __ lea(rax, at_bcp((is_wide ? 5 : 3) - in_bytes(constMethodOopDesc::codes_offset()))); |
never@739 | 1596 | __ subptr(rax, Address(rcx, methodOopDesc::const_offset())); |
apetrusenko@797 | 1597 | // Adjust the bcp in RSI by the displacement in EDX |
never@739 | 1598 | __ addptr(rsi, rdx); |
duke@435 | 1599 | // Push return address |
duke@435 | 1600 | __ push_i(rax); |
duke@435 | 1601 | // jsr returns vtos |
duke@435 | 1602 | __ dispatch_only_noverify(vtos); |
duke@435 | 1603 | return; |
duke@435 | 1604 | } |
duke@435 | 1605 | |
duke@435 | 1606 | // Normal (non-jsr) branch handling |
duke@435 | 1607 | |
apetrusenko@797 | 1608 | // Adjust the bcp in RSI by the displacement in EDX |
never@739 | 1609 | __ addptr(rsi, rdx); |
duke@435 | 1610 | |
duke@435 | 1611 | assert(UseLoopCounter || !UseOnStackReplacement, "on-stack-replacement requires loop counters"); |
duke@435 | 1612 | Label backedge_counter_overflow; |
duke@435 | 1613 | Label profile_method; |
duke@435 | 1614 | Label dispatch; |
duke@435 | 1615 | if (UseLoopCounter) { |
duke@435 | 1616 | // increment backedge counter for backward branches |
duke@435 | 1617 | // rax,: MDO |
duke@435 | 1618 | // rbx,: MDO bumped taken-count |
duke@435 | 1619 | // rcx: method |
duke@435 | 1620 | // rdx: target offset |
duke@435 | 1621 | // rsi: target bcp |
duke@435 | 1622 | // rdi: locals pointer |
duke@435 | 1623 | __ testl(rdx, rdx); // check if forward or backward branch |
duke@435 | 1624 | __ jcc(Assembler::positive, dispatch); // count only if backward branch |
duke@435 | 1625 | |
duke@435 | 1626 | // increment counter |
duke@435 | 1627 | __ movl(rax, Address(rcx, be_offset)); // load backedge counter |
never@739 | 1628 | __ incrementl(rax, InvocationCounter::count_increment); // increment counter |
duke@435 | 1629 | __ movl(Address(rcx, be_offset), rax); // store counter |
duke@435 | 1630 | |
duke@435 | 1631 | __ movl(rax, Address(rcx, inv_offset)); // load invocation counter |
duke@435 | 1632 | __ andl(rax, InvocationCounter::count_mask_value); // and the status bits |
duke@435 | 1633 | __ addl(rax, Address(rcx, be_offset)); // add both counters |
duke@435 | 1634 | |
duke@435 | 1635 | if (ProfileInterpreter) { |
duke@435 | 1636 | // Test to see if we should create a method data oop |
duke@435 | 1637 | __ cmp32(rax, |
duke@435 | 1638 | ExternalAddress((address) &InvocationCounter::InterpreterProfileLimit)); |
duke@435 | 1639 | __ jcc(Assembler::less, dispatch); |
duke@435 | 1640 | |
duke@435 | 1641 | // if no method data exists, go to profile method |
duke@435 | 1642 | __ test_method_data_pointer(rax, profile_method); |
duke@435 | 1643 | |
duke@435 | 1644 | if (UseOnStackReplacement) { |
duke@435 | 1645 | // check for overflow against rbx, which is the MDO taken count |
duke@435 | 1646 | __ cmp32(rbx, |
duke@435 | 1647 | ExternalAddress((address) &InvocationCounter::InterpreterBackwardBranchLimit)); |
duke@435 | 1648 | __ jcc(Assembler::below, dispatch); |
duke@435 | 1649 | |
duke@435 | 1650 | // When ProfileInterpreter is on, the backedge_count comes from the |
duke@435 | 1651 | // methodDataOop, which value does not get reset on the call to |
duke@435 | 1652 | // frequency_counter_overflow(). To avoid excessive calls to the overflow |
duke@435 | 1653 | // routine while the method is being compiled, add a second test to make |
duke@435 | 1654 | // sure the overflow function is called only once every overflow_frequency. |
duke@435 | 1655 | const int overflow_frequency = 1024; |
never@739 | 1656 | __ andptr(rbx, overflow_frequency-1); |
duke@435 | 1657 | __ jcc(Assembler::zero, backedge_counter_overflow); |
duke@435 | 1658 | |
duke@435 | 1659 | } |
duke@435 | 1660 | } else { |
duke@435 | 1661 | if (UseOnStackReplacement) { |
duke@435 | 1662 | // check for overflow against rax, which is the sum of the counters |
duke@435 | 1663 | __ cmp32(rax, |
duke@435 | 1664 | ExternalAddress((address) &InvocationCounter::InterpreterBackwardBranchLimit)); |
duke@435 | 1665 | __ jcc(Assembler::aboveEqual, backedge_counter_overflow); |
duke@435 | 1666 | |
duke@435 | 1667 | } |
duke@435 | 1668 | } |
duke@435 | 1669 | __ bind(dispatch); |
duke@435 | 1670 | } |
duke@435 | 1671 | |
duke@435 | 1672 | // Pre-load the next target bytecode into EBX |
duke@435 | 1673 | __ load_unsigned_byte(rbx, Address(rsi, 0)); |
duke@435 | 1674 | |
duke@435 | 1675 | // continue with the bytecode @ target |
duke@435 | 1676 | // rax,: return bci for jsr's, unused otherwise |
duke@435 | 1677 | // rbx,: target bytecode |
duke@435 | 1678 | // rsi: target bcp |
duke@435 | 1679 | __ dispatch_only(vtos); |
duke@435 | 1680 | |
duke@435 | 1681 | if (UseLoopCounter) { |
duke@435 | 1682 | if (ProfileInterpreter) { |
duke@435 | 1683 | // Out-of-line code to allocate method data oop. |
duke@435 | 1684 | __ bind(profile_method); |
duke@435 | 1685 | __ call_VM(noreg, CAST_FROM_FN_PTR(address, InterpreterRuntime::profile_method), rsi); |
duke@435 | 1686 | __ load_unsigned_byte(rbx, Address(rsi, 0)); // restore target bytecode |
never@739 | 1687 | __ movptr(rcx, Address(rbp, method_offset)); |
never@739 | 1688 | __ movptr(rcx, Address(rcx, in_bytes(methodOopDesc::method_data_offset()))); |
never@739 | 1689 | __ movptr(Address(rbp, frame::interpreter_frame_mdx_offset * wordSize), rcx); |
duke@435 | 1690 | __ test_method_data_pointer(rcx, dispatch); |
duke@435 | 1691 | // offset non-null mdp by MDO::data_offset() + IR::profile_method() |
never@739 | 1692 | __ addptr(rcx, in_bytes(methodDataOopDesc::data_offset())); |
never@739 | 1693 | __ addptr(rcx, rax); |
never@739 | 1694 | __ movptr(Address(rbp, frame::interpreter_frame_mdx_offset * wordSize), rcx); |
duke@435 | 1695 | __ jmp(dispatch); |
duke@435 | 1696 | } |
duke@435 | 1697 | |
duke@435 | 1698 | if (UseOnStackReplacement) { |
duke@435 | 1699 | |
duke@435 | 1700 | // invocation counter overflow |
duke@435 | 1701 | __ bind(backedge_counter_overflow); |
never@739 | 1702 | __ negptr(rdx); |
never@739 | 1703 | __ addptr(rdx, rsi); // branch bcp |
duke@435 | 1704 | call_VM(noreg, CAST_FROM_FN_PTR(address, InterpreterRuntime::frequency_counter_overflow), rdx); |
duke@435 | 1705 | __ load_unsigned_byte(rbx, Address(rsi, 0)); // restore target bytecode |
duke@435 | 1706 | |
duke@435 | 1707 | // rax,: osr nmethod (osr ok) or NULL (osr not possible) |
duke@435 | 1708 | // rbx,: target bytecode |
duke@435 | 1709 | // rdx: scratch |
duke@435 | 1710 | // rdi: locals pointer |
duke@435 | 1711 | // rsi: bcp |
never@739 | 1712 | __ testptr(rax, rax); // test result |
duke@435 | 1713 | __ jcc(Assembler::zero, dispatch); // no osr if null |
duke@435 | 1714 | // nmethod may have been invalidated (VM may block upon call_VM return) |
duke@435 | 1715 | __ movl(rcx, Address(rax, nmethod::entry_bci_offset())); |
duke@435 | 1716 | __ cmpl(rcx, InvalidOSREntryBci); |
duke@435 | 1717 | __ jcc(Assembler::equal, dispatch); |
duke@435 | 1718 | |
duke@435 | 1719 | // We have the address of an on stack replacement routine in rax, |
duke@435 | 1720 | // We need to prepare to execute the OSR method. First we must |
duke@435 | 1721 | // migrate the locals and monitors off of the stack. |
duke@435 | 1722 | |
never@739 | 1723 | __ mov(rbx, rax); // save the nmethod |
duke@435 | 1724 | |
duke@435 | 1725 | const Register thread = rcx; |
duke@435 | 1726 | __ get_thread(thread); |
duke@435 | 1727 | call_VM(noreg, CAST_FROM_FN_PTR(address, SharedRuntime::OSR_migration_begin)); |
duke@435 | 1728 | // rax, is OSR buffer, move it to expected parameter location |
never@739 | 1729 | __ mov(rcx, rax); |
duke@435 | 1730 | |
duke@435 | 1731 | // pop the interpreter frame |
never@739 | 1732 | __ movptr(rdx, Address(rbp, frame::interpreter_frame_sender_sp_offset * wordSize)); // get sender sp |
duke@435 | 1733 | __ leave(); // remove frame anchor |
never@739 | 1734 | __ pop(rdi); // get return address |
never@739 | 1735 | __ mov(rsp, rdx); // set sp to sender sp |
duke@435 | 1736 | |
duke@435 | 1737 | |
duke@435 | 1738 | Label skip; |
duke@435 | 1739 | Label chkint; |
duke@435 | 1740 | |
duke@435 | 1741 | // The interpreter frame we have removed may be returning to |
duke@435 | 1742 | // either the callstub or the interpreter. Since we will |
duke@435 | 1743 | // now be returning from a compiled (OSR) nmethod we must |
duke@435 | 1744 | // adjust the return to the return were it can handler compiled |
duke@435 | 1745 | // results and clean the fpu stack. This is very similar to |
duke@435 | 1746 | // what a i2c adapter must do. |
duke@435 | 1747 | |
duke@435 | 1748 | // Are we returning to the call stub? |
duke@435 | 1749 | |
duke@435 | 1750 | __ cmp32(rdi, ExternalAddress(StubRoutines::_call_stub_return_address)); |
duke@435 | 1751 | __ jcc(Assembler::notEqual, chkint); |
duke@435 | 1752 | |
duke@435 | 1753 | // yes adjust to the specialized call stub return. |
never@739 | 1754 | assert(StubRoutines::x86::get_call_stub_compiled_return() != NULL, "must be set"); |
never@739 | 1755 | __ lea(rdi, ExternalAddress(StubRoutines::x86::get_call_stub_compiled_return())); |
duke@435 | 1756 | __ jmp(skip); |
duke@435 | 1757 | |
duke@435 | 1758 | __ bind(chkint); |
duke@435 | 1759 | |
duke@435 | 1760 | // Are we returning to the interpreter? Look for sentinel |
duke@435 | 1761 | |
never@739 | 1762 | __ cmpl(Address(rdi, -2*wordSize), Interpreter::return_sentinel); |
duke@435 | 1763 | __ jcc(Assembler::notEqual, skip); |
duke@435 | 1764 | |
duke@435 | 1765 | // Adjust to compiled return back to interpreter |
duke@435 | 1766 | |
never@739 | 1767 | __ movptr(rdi, Address(rdi, -wordSize)); |
duke@435 | 1768 | __ bind(skip); |
duke@435 | 1769 | |
duke@435 | 1770 | // Align stack pointer for compiled code (note that caller is |
duke@435 | 1771 | // responsible for undoing this fixup by remembering the old SP |
duke@435 | 1772 | // in an rbp,-relative location) |
never@739 | 1773 | __ andptr(rsp, -(StackAlignmentInBytes)); |
duke@435 | 1774 | |
duke@435 | 1775 | // push the (possibly adjusted) return address |
never@739 | 1776 | __ push(rdi); |
duke@435 | 1777 | |
duke@435 | 1778 | // and begin the OSR nmethod |
sgoldman@542 | 1779 | __ jmp(Address(rbx, nmethod::osr_entry_point_offset())); |
duke@435 | 1780 | } |
duke@435 | 1781 | } |
duke@435 | 1782 | } |
duke@435 | 1783 | |
duke@435 | 1784 | |
duke@435 | 1785 | void TemplateTable::if_0cmp(Condition cc) { |
duke@435 | 1786 | transition(itos, vtos); |
duke@435 | 1787 | // assume branch is more often taken than not (loops use backward branches) |
duke@435 | 1788 | Label not_taken; |
duke@435 | 1789 | __ testl(rax, rax); |
duke@435 | 1790 | __ jcc(j_not(cc), not_taken); |
duke@435 | 1791 | branch(false, false); |
duke@435 | 1792 | __ bind(not_taken); |
duke@435 | 1793 | __ profile_not_taken_branch(rax); |
duke@435 | 1794 | } |
duke@435 | 1795 | |
duke@435 | 1796 | |
duke@435 | 1797 | void TemplateTable::if_icmp(Condition cc) { |
duke@435 | 1798 | transition(itos, vtos); |
duke@435 | 1799 | // assume branch is more often taken than not (loops use backward branches) |
duke@435 | 1800 | Label not_taken; |
duke@435 | 1801 | __ pop_i(rdx); |
duke@435 | 1802 | __ cmpl(rdx, rax); |
duke@435 | 1803 | __ jcc(j_not(cc), not_taken); |
duke@435 | 1804 | branch(false, false); |
duke@435 | 1805 | __ bind(not_taken); |
duke@435 | 1806 | __ profile_not_taken_branch(rax); |
duke@435 | 1807 | } |
duke@435 | 1808 | |
duke@435 | 1809 | |
duke@435 | 1810 | void TemplateTable::if_nullcmp(Condition cc) { |
duke@435 | 1811 | transition(atos, vtos); |
duke@435 | 1812 | // assume branch is more often taken than not (loops use backward branches) |
duke@435 | 1813 | Label not_taken; |
never@739 | 1814 | __ testptr(rax, rax); |
duke@435 | 1815 | __ jcc(j_not(cc), not_taken); |
duke@435 | 1816 | branch(false, false); |
duke@435 | 1817 | __ bind(not_taken); |
duke@435 | 1818 | __ profile_not_taken_branch(rax); |
duke@435 | 1819 | } |
duke@435 | 1820 | |
duke@435 | 1821 | |
duke@435 | 1822 | void TemplateTable::if_acmp(Condition cc) { |
duke@435 | 1823 | transition(atos, vtos); |
duke@435 | 1824 | // assume branch is more often taken than not (loops use backward branches) |
duke@435 | 1825 | Label not_taken; |
duke@435 | 1826 | __ pop_ptr(rdx); |
never@739 | 1827 | __ cmpptr(rdx, rax); |
duke@435 | 1828 | __ jcc(j_not(cc), not_taken); |
duke@435 | 1829 | branch(false, false); |
duke@435 | 1830 | __ bind(not_taken); |
duke@435 | 1831 | __ profile_not_taken_branch(rax); |
duke@435 | 1832 | } |
duke@435 | 1833 | |
duke@435 | 1834 | |
duke@435 | 1835 | void TemplateTable::ret() { |
duke@435 | 1836 | transition(vtos, vtos); |
duke@435 | 1837 | locals_index(rbx); |
never@739 | 1838 | __ movptr(rbx, iaddress(rbx)); // get return bci, compute return bcp |
duke@435 | 1839 | __ profile_ret(rbx, rcx); |
duke@435 | 1840 | __ get_method(rax); |
never@739 | 1841 | __ movptr(rsi, Address(rax, methodOopDesc::const_offset())); |
never@739 | 1842 | __ lea(rsi, Address(rsi, rbx, Address::times_1, |
never@739 | 1843 | constMethodOopDesc::codes_offset())); |
duke@435 | 1844 | __ dispatch_next(vtos); |
duke@435 | 1845 | } |
duke@435 | 1846 | |
duke@435 | 1847 | |
duke@435 | 1848 | void TemplateTable::wide_ret() { |
duke@435 | 1849 | transition(vtos, vtos); |
duke@435 | 1850 | locals_index_wide(rbx); |
never@739 | 1851 | __ movptr(rbx, iaddress(rbx)); // get return bci, compute return bcp |
duke@435 | 1852 | __ profile_ret(rbx, rcx); |
duke@435 | 1853 | __ get_method(rax); |
never@739 | 1854 | __ movptr(rsi, Address(rax, methodOopDesc::const_offset())); |
never@739 | 1855 | __ lea(rsi, Address(rsi, rbx, Address::times_1, constMethodOopDesc::codes_offset())); |
duke@435 | 1856 | __ dispatch_next(vtos); |
duke@435 | 1857 | } |
duke@435 | 1858 | |
duke@435 | 1859 | |
duke@435 | 1860 | void TemplateTable::tableswitch() { |
duke@435 | 1861 | Label default_case, continue_execution; |
duke@435 | 1862 | transition(itos, vtos); |
duke@435 | 1863 | // align rsi |
never@739 | 1864 | __ lea(rbx, at_bcp(wordSize)); |
never@739 | 1865 | __ andptr(rbx, -wordSize); |
duke@435 | 1866 | // load lo & hi |
duke@435 | 1867 | __ movl(rcx, Address(rbx, 1 * wordSize)); |
duke@435 | 1868 | __ movl(rdx, Address(rbx, 2 * wordSize)); |
never@739 | 1869 | __ bswapl(rcx); |
never@739 | 1870 | __ bswapl(rdx); |
duke@435 | 1871 | // check against lo & hi |
duke@435 | 1872 | __ cmpl(rax, rcx); |
duke@435 | 1873 | __ jccb(Assembler::less, default_case); |
duke@435 | 1874 | __ cmpl(rax, rdx); |
duke@435 | 1875 | __ jccb(Assembler::greater, default_case); |
duke@435 | 1876 | // lookup dispatch offset |
duke@435 | 1877 | __ subl(rax, rcx); |
never@739 | 1878 | __ movl(rdx, Address(rbx, rax, Address::times_4, 3 * BytesPerInt)); |
duke@435 | 1879 | __ profile_switch_case(rax, rbx, rcx); |
duke@435 | 1880 | // continue execution |
duke@435 | 1881 | __ bind(continue_execution); |
never@739 | 1882 | __ bswapl(rdx); |
duke@435 | 1883 | __ load_unsigned_byte(rbx, Address(rsi, rdx, Address::times_1)); |
never@739 | 1884 | __ addptr(rsi, rdx); |
duke@435 | 1885 | __ dispatch_only(vtos); |
duke@435 | 1886 | // handle default |
duke@435 | 1887 | __ bind(default_case); |
duke@435 | 1888 | __ profile_switch_default(rax); |
duke@435 | 1889 | __ movl(rdx, Address(rbx, 0)); |
duke@435 | 1890 | __ jmp(continue_execution); |
duke@435 | 1891 | } |
duke@435 | 1892 | |
duke@435 | 1893 | |
duke@435 | 1894 | void TemplateTable::lookupswitch() { |
duke@435 | 1895 | transition(itos, itos); |
duke@435 | 1896 | __ stop("lookupswitch bytecode should have been rewritten"); |
duke@435 | 1897 | } |
duke@435 | 1898 | |
duke@435 | 1899 | |
duke@435 | 1900 | void TemplateTable::fast_linearswitch() { |
duke@435 | 1901 | transition(itos, vtos); |
duke@435 | 1902 | Label loop_entry, loop, found, continue_execution; |
never@739 | 1903 | // bswapl rax, so we can avoid bswapping the table entries |
never@739 | 1904 | __ bswapl(rax); |
duke@435 | 1905 | // align rsi |
never@739 | 1906 | __ lea(rbx, at_bcp(wordSize)); // btw: should be able to get rid of this instruction (change offsets below) |
never@739 | 1907 | __ andptr(rbx, -wordSize); |
duke@435 | 1908 | // set counter |
duke@435 | 1909 | __ movl(rcx, Address(rbx, wordSize)); |
never@739 | 1910 | __ bswapl(rcx); |
duke@435 | 1911 | __ jmpb(loop_entry); |
duke@435 | 1912 | // table search |
duke@435 | 1913 | __ bind(loop); |
duke@435 | 1914 | __ cmpl(rax, Address(rbx, rcx, Address::times_8, 2 * wordSize)); |
duke@435 | 1915 | __ jccb(Assembler::equal, found); |
duke@435 | 1916 | __ bind(loop_entry); |
never@739 | 1917 | __ decrementl(rcx); |
duke@435 | 1918 | __ jcc(Assembler::greaterEqual, loop); |
duke@435 | 1919 | // default case |
duke@435 | 1920 | __ profile_switch_default(rax); |
duke@435 | 1921 | __ movl(rdx, Address(rbx, 0)); |
duke@435 | 1922 | __ jmpb(continue_execution); |
duke@435 | 1923 | // entry found -> get offset |
duke@435 | 1924 | __ bind(found); |
duke@435 | 1925 | __ movl(rdx, Address(rbx, rcx, Address::times_8, 3 * wordSize)); |
duke@435 | 1926 | __ profile_switch_case(rcx, rax, rbx); |
duke@435 | 1927 | // continue execution |
duke@435 | 1928 | __ bind(continue_execution); |
never@739 | 1929 | __ bswapl(rdx); |
duke@435 | 1930 | __ load_unsigned_byte(rbx, Address(rsi, rdx, Address::times_1)); |
never@739 | 1931 | __ addptr(rsi, rdx); |
duke@435 | 1932 | __ dispatch_only(vtos); |
duke@435 | 1933 | } |
duke@435 | 1934 | |
duke@435 | 1935 | |
duke@435 | 1936 | void TemplateTable::fast_binaryswitch() { |
duke@435 | 1937 | transition(itos, vtos); |
duke@435 | 1938 | // Implementation using the following core algorithm: |
duke@435 | 1939 | // |
duke@435 | 1940 | // int binary_search(int key, LookupswitchPair* array, int n) { |
duke@435 | 1941 | // // Binary search according to "Methodik des Programmierens" by |
duke@435 | 1942 | // // Edsger W. Dijkstra and W.H.J. Feijen, Addison Wesley Germany 1985. |
duke@435 | 1943 | // int i = 0; |
duke@435 | 1944 | // int j = n; |
duke@435 | 1945 | // while (i+1 < j) { |
duke@435 | 1946 | // // invariant P: 0 <= i < j <= n and (a[i] <= key < a[j] or Q) |
duke@435 | 1947 | // // with Q: for all i: 0 <= i < n: key < a[i] |
duke@435 | 1948 | // // where a stands for the array and assuming that the (inexisting) |
duke@435 | 1949 | // // element a[n] is infinitely big. |
duke@435 | 1950 | // int h = (i + j) >> 1; |
duke@435 | 1951 | // // i < h < j |
duke@435 | 1952 | // if (key < array[h].fast_match()) { |
duke@435 | 1953 | // j = h; |
duke@435 | 1954 | // } else { |
duke@435 | 1955 | // i = h; |
duke@435 | 1956 | // } |
duke@435 | 1957 | // } |
duke@435 | 1958 | // // R: a[i] <= key < a[i+1] or Q |
duke@435 | 1959 | // // (i.e., if key is within array, i is the correct index) |
duke@435 | 1960 | // return i; |
duke@435 | 1961 | // } |
duke@435 | 1962 | |
duke@435 | 1963 | // register allocation |
duke@435 | 1964 | const Register key = rax; // already set (tosca) |
duke@435 | 1965 | const Register array = rbx; |
duke@435 | 1966 | const Register i = rcx; |
duke@435 | 1967 | const Register j = rdx; |
duke@435 | 1968 | const Register h = rdi; // needs to be restored |
duke@435 | 1969 | const Register temp = rsi; |
duke@435 | 1970 | // setup array |
duke@435 | 1971 | __ save_bcp(); |
duke@435 | 1972 | |
never@739 | 1973 | __ lea(array, at_bcp(3*wordSize)); // btw: should be able to get rid of this instruction (change offsets below) |
never@739 | 1974 | __ andptr(array, -wordSize); |
duke@435 | 1975 | // initialize i & j |
duke@435 | 1976 | __ xorl(i, i); // i = 0; |
duke@435 | 1977 | __ movl(j, Address(array, -wordSize)); // j = length(array); |
duke@435 | 1978 | // Convert j into native byteordering |
never@739 | 1979 | __ bswapl(j); |
duke@435 | 1980 | // and start |
duke@435 | 1981 | Label entry; |
duke@435 | 1982 | __ jmp(entry); |
duke@435 | 1983 | |
duke@435 | 1984 | // binary search loop |
duke@435 | 1985 | { Label loop; |
duke@435 | 1986 | __ bind(loop); |
duke@435 | 1987 | // int h = (i + j) >> 1; |
duke@435 | 1988 | __ leal(h, Address(i, j, Address::times_1)); // h = i + j; |
duke@435 | 1989 | __ sarl(h, 1); // h = (i + j) >> 1; |
duke@435 | 1990 | // if (key < array[h].fast_match()) { |
duke@435 | 1991 | // j = h; |
duke@435 | 1992 | // } else { |
duke@435 | 1993 | // i = h; |
duke@435 | 1994 | // } |
duke@435 | 1995 | // Convert array[h].match to native byte-ordering before compare |
duke@435 | 1996 | __ movl(temp, Address(array, h, Address::times_8, 0*wordSize)); |
never@739 | 1997 | __ bswapl(temp); |
duke@435 | 1998 | __ cmpl(key, temp); |
duke@435 | 1999 | if (VM_Version::supports_cmov()) { |
duke@435 | 2000 | __ cmovl(Assembler::less , j, h); // j = h if (key < array[h].fast_match()) |
duke@435 | 2001 | __ cmovl(Assembler::greaterEqual, i, h); // i = h if (key >= array[h].fast_match()) |
duke@435 | 2002 | } else { |
duke@435 | 2003 | Label set_i, end_of_if; |
never@739 | 2004 | __ jccb(Assembler::greaterEqual, set_i); // { |
never@739 | 2005 | __ mov(j, h); // j = h; |
never@739 | 2006 | __ jmp(end_of_if); // } |
never@739 | 2007 | __ bind(set_i); // else { |
never@739 | 2008 | __ mov(i, h); // i = h; |
never@739 | 2009 | __ bind(end_of_if); // } |
duke@435 | 2010 | } |
duke@435 | 2011 | // while (i+1 < j) |
duke@435 | 2012 | __ bind(entry); |
duke@435 | 2013 | __ leal(h, Address(i, 1)); // i+1 |
duke@435 | 2014 | __ cmpl(h, j); // i+1 < j |
duke@435 | 2015 | __ jcc(Assembler::less, loop); |
duke@435 | 2016 | } |
duke@435 | 2017 | |
duke@435 | 2018 | // end of binary search, result index is i (must check again!) |
duke@435 | 2019 | Label default_case; |
duke@435 | 2020 | // Convert array[i].match to native byte-ordering before compare |
duke@435 | 2021 | __ movl(temp, Address(array, i, Address::times_8, 0*wordSize)); |
never@739 | 2022 | __ bswapl(temp); |
duke@435 | 2023 | __ cmpl(key, temp); |
duke@435 | 2024 | __ jcc(Assembler::notEqual, default_case); |
duke@435 | 2025 | |
duke@435 | 2026 | // entry found -> j = offset |
duke@435 | 2027 | __ movl(j , Address(array, i, Address::times_8, 1*wordSize)); |
duke@435 | 2028 | __ profile_switch_case(i, key, array); |
never@739 | 2029 | __ bswapl(j); |
never@739 | 2030 | LP64_ONLY(__ movslq(j, j)); |
duke@435 | 2031 | __ restore_bcp(); |
duke@435 | 2032 | __ restore_locals(); // restore rdi |
duke@435 | 2033 | __ load_unsigned_byte(rbx, Address(rsi, j, Address::times_1)); |
duke@435 | 2034 | |
never@739 | 2035 | __ addptr(rsi, j); |
duke@435 | 2036 | __ dispatch_only(vtos); |
duke@435 | 2037 | |
duke@435 | 2038 | // default case -> j = default offset |
duke@435 | 2039 | __ bind(default_case); |
duke@435 | 2040 | __ profile_switch_default(i); |
duke@435 | 2041 | __ movl(j, Address(array, -2*wordSize)); |
never@739 | 2042 | __ bswapl(j); |
never@739 | 2043 | LP64_ONLY(__ movslq(j, j)); |
duke@435 | 2044 | __ restore_bcp(); |
duke@435 | 2045 | __ restore_locals(); // restore rdi |
duke@435 | 2046 | __ load_unsigned_byte(rbx, Address(rsi, j, Address::times_1)); |
never@739 | 2047 | __ addptr(rsi, j); |
duke@435 | 2048 | __ dispatch_only(vtos); |
duke@435 | 2049 | } |
duke@435 | 2050 | |
duke@435 | 2051 | |
duke@435 | 2052 | void TemplateTable::_return(TosState state) { |
duke@435 | 2053 | transition(state, state); |
duke@435 | 2054 | assert(_desc->calls_vm(), "inconsistent calls_vm information"); // call in remove_activation |
duke@435 | 2055 | |
duke@435 | 2056 | if (_desc->bytecode() == Bytecodes::_return_register_finalizer) { |
duke@435 | 2057 | assert(state == vtos, "only valid state"); |
never@739 | 2058 | __ movptr(rax, aaddress(0)); |
never@739 | 2059 | __ movptr(rdi, Address(rax, oopDesc::klass_offset_in_bytes())); |
duke@435 | 2060 | __ movl(rdi, Address(rdi, Klass::access_flags_offset_in_bytes() + sizeof(oopDesc))); |
duke@435 | 2061 | __ testl(rdi, JVM_ACC_HAS_FINALIZER); |
duke@435 | 2062 | Label skip_register_finalizer; |
duke@435 | 2063 | __ jcc(Assembler::zero, skip_register_finalizer); |
duke@435 | 2064 | |
duke@435 | 2065 | __ call_VM(noreg, CAST_FROM_FN_PTR(address, InterpreterRuntime::register_finalizer), rax); |
duke@435 | 2066 | |
duke@435 | 2067 | __ bind(skip_register_finalizer); |
duke@435 | 2068 | } |
duke@435 | 2069 | |
duke@435 | 2070 | __ remove_activation(state, rsi); |
duke@435 | 2071 | __ jmp(rsi); |
duke@435 | 2072 | } |
duke@435 | 2073 | |
duke@435 | 2074 | |
duke@435 | 2075 | // ---------------------------------------------------------------------------- |
duke@435 | 2076 | // Volatile variables demand their effects be made known to all CPU's in |
duke@435 | 2077 | // order. Store buffers on most chips allow reads & writes to reorder; the |
duke@435 | 2078 | // JMM's ReadAfterWrite.java test fails in -Xint mode without some kind of |
duke@435 | 2079 | // memory barrier (i.e., it's not sufficient that the interpreter does not |
duke@435 | 2080 | // reorder volatile references, the hardware also must not reorder them). |
duke@435 | 2081 | // |
duke@435 | 2082 | // According to the new Java Memory Model (JMM): |
duke@435 | 2083 | // (1) All volatiles are serialized wrt to each other. |
duke@435 | 2084 | // ALSO reads & writes act as aquire & release, so: |
duke@435 | 2085 | // (2) A read cannot let unrelated NON-volatile memory refs that happen after |
duke@435 | 2086 | // the read float up to before the read. It's OK for non-volatile memory refs |
duke@435 | 2087 | // that happen before the volatile read to float down below it. |
duke@435 | 2088 | // (3) Similar a volatile write cannot let unrelated NON-volatile memory refs |
duke@435 | 2089 | // that happen BEFORE the write float down to after the write. It's OK for |
duke@435 | 2090 | // non-volatile memory refs that happen after the volatile write to float up |
duke@435 | 2091 | // before it. |
duke@435 | 2092 | // |
duke@435 | 2093 | // We only put in barriers around volatile refs (they are expensive), not |
duke@435 | 2094 | // _between_ memory refs (that would require us to track the flavor of the |
duke@435 | 2095 | // previous memory refs). Requirements (2) and (3) require some barriers |
duke@435 | 2096 | // before volatile stores and after volatile loads. These nearly cover |
duke@435 | 2097 | // requirement (1) but miss the volatile-store-volatile-load case. This final |
duke@435 | 2098 | // case is placed after volatile-stores although it could just as well go |
duke@435 | 2099 | // before volatile-loads. |
never@739 | 2100 | void TemplateTable::volatile_barrier(Assembler::Membar_mask_bits order_constraint ) { |
duke@435 | 2101 | // Helper function to insert a is-volatile test and memory barrier |
duke@435 | 2102 | if( !os::is_MP() ) return; // Not needed on single CPU |
never@739 | 2103 | __ membar(order_constraint); |
duke@435 | 2104 | } |
duke@435 | 2105 | |
duke@435 | 2106 | void TemplateTable::resolve_cache_and_index(int byte_no, Register Rcache, Register index) { |
duke@435 | 2107 | assert(byte_no == 1 || byte_no == 2, "byte_no out of range"); |
duke@435 | 2108 | |
duke@435 | 2109 | Register temp = rbx; |
duke@435 | 2110 | |
duke@435 | 2111 | assert_different_registers(Rcache, index, temp); |
duke@435 | 2112 | |
duke@435 | 2113 | const int shift_count = (1 + byte_no)*BitsPerByte; |
duke@435 | 2114 | Label resolved; |
duke@435 | 2115 | __ get_cache_and_index_at_bcp(Rcache, index, 1); |
never@739 | 2116 | __ movl(temp, Address(Rcache, |
never@739 | 2117 | index, |
never@739 | 2118 | Address::times_ptr, |
never@739 | 2119 | constantPoolCacheOopDesc::base_offset() + ConstantPoolCacheEntry::indices_offset())); |
duke@435 | 2120 | __ shrl(temp, shift_count); |
duke@435 | 2121 | // have we resolved this bytecode? |
never@739 | 2122 | __ andptr(temp, 0xFF); |
duke@435 | 2123 | __ cmpl(temp, (int)bytecode()); |
duke@435 | 2124 | __ jcc(Assembler::equal, resolved); |
duke@435 | 2125 | |
duke@435 | 2126 | // resolve first time through |
duke@435 | 2127 | address entry; |
duke@435 | 2128 | switch (bytecode()) { |
duke@435 | 2129 | case Bytecodes::_getstatic : // fall through |
duke@435 | 2130 | case Bytecodes::_putstatic : // fall through |
duke@435 | 2131 | case Bytecodes::_getfield : // fall through |
duke@435 | 2132 | case Bytecodes::_putfield : entry = CAST_FROM_FN_PTR(address, InterpreterRuntime::resolve_get_put); break; |
duke@435 | 2133 | case Bytecodes::_invokevirtual : // fall through |
duke@435 | 2134 | case Bytecodes::_invokespecial : // fall through |
duke@435 | 2135 | case Bytecodes::_invokestatic : // fall through |
duke@435 | 2136 | case Bytecodes::_invokeinterface: entry = CAST_FROM_FN_PTR(address, InterpreterRuntime::resolve_invoke); break; |
duke@435 | 2137 | default : ShouldNotReachHere(); break; |
duke@435 | 2138 | } |
duke@435 | 2139 | __ movl(temp, (int)bytecode()); |
duke@435 | 2140 | __ call_VM(noreg, entry, temp); |
duke@435 | 2141 | // Update registers with resolved info |
duke@435 | 2142 | __ get_cache_and_index_at_bcp(Rcache, index, 1); |
duke@435 | 2143 | __ bind(resolved); |
duke@435 | 2144 | } |
duke@435 | 2145 | |
duke@435 | 2146 | |
duke@435 | 2147 | // The cache and index registers must be set before call |
duke@435 | 2148 | void TemplateTable::load_field_cp_cache_entry(Register obj, |
duke@435 | 2149 | Register cache, |
duke@435 | 2150 | Register index, |
duke@435 | 2151 | Register off, |
duke@435 | 2152 | Register flags, |
duke@435 | 2153 | bool is_static = false) { |
duke@435 | 2154 | assert_different_registers(cache, index, flags, off); |
duke@435 | 2155 | |
duke@435 | 2156 | ByteSize cp_base_offset = constantPoolCacheOopDesc::base_offset(); |
duke@435 | 2157 | // Field offset |
never@739 | 2158 | __ movptr(off, Address(cache, index, Address::times_ptr, |
never@739 | 2159 | in_bytes(cp_base_offset + ConstantPoolCacheEntry::f2_offset()))); |
duke@435 | 2160 | // Flags |
never@739 | 2161 | __ movl(flags, Address(cache, index, Address::times_ptr, |
duke@435 | 2162 | in_bytes(cp_base_offset + ConstantPoolCacheEntry::flags_offset()))); |
duke@435 | 2163 | |
duke@435 | 2164 | // klass overwrite register |
duke@435 | 2165 | if (is_static) { |
never@739 | 2166 | __ movptr(obj, Address(cache, index, Address::times_ptr, |
never@739 | 2167 | in_bytes(cp_base_offset + ConstantPoolCacheEntry::f1_offset()))); |
duke@435 | 2168 | } |
duke@435 | 2169 | } |
duke@435 | 2170 | |
duke@435 | 2171 | void TemplateTable::load_invoke_cp_cache_entry(int byte_no, |
duke@435 | 2172 | Register method, |
duke@435 | 2173 | Register itable_index, |
duke@435 | 2174 | Register flags, |
duke@435 | 2175 | bool is_invokevirtual, |
duke@435 | 2176 | bool is_invokevfinal /*unused*/) { |
duke@435 | 2177 | // setup registers |
duke@435 | 2178 | const Register cache = rcx; |
duke@435 | 2179 | const Register index = rdx; |
duke@435 | 2180 | assert_different_registers(method, flags); |
duke@435 | 2181 | assert_different_registers(method, cache, index); |
duke@435 | 2182 | assert_different_registers(itable_index, flags); |
duke@435 | 2183 | assert_different_registers(itable_index, cache, index); |
duke@435 | 2184 | // determine constant pool cache field offsets |
duke@435 | 2185 | const int method_offset = in_bytes( |
duke@435 | 2186 | constantPoolCacheOopDesc::base_offset() + |
duke@435 | 2187 | (is_invokevirtual |
duke@435 | 2188 | ? ConstantPoolCacheEntry::f2_offset() |
duke@435 | 2189 | : ConstantPoolCacheEntry::f1_offset() |
duke@435 | 2190 | ) |
duke@435 | 2191 | ); |
duke@435 | 2192 | const int flags_offset = in_bytes(constantPoolCacheOopDesc::base_offset() + |
duke@435 | 2193 | ConstantPoolCacheEntry::flags_offset()); |
duke@435 | 2194 | // access constant pool cache fields |
duke@435 | 2195 | const int index_offset = in_bytes(constantPoolCacheOopDesc::base_offset() + |
duke@435 | 2196 | ConstantPoolCacheEntry::f2_offset()); |
duke@435 | 2197 | |
duke@435 | 2198 | resolve_cache_and_index(byte_no, cache, index); |
duke@435 | 2199 | |
never@739 | 2200 | __ movptr(method, Address(cache, index, Address::times_ptr, method_offset)); |
duke@435 | 2201 | if (itable_index != noreg) { |
never@739 | 2202 | __ movptr(itable_index, Address(cache, index, Address::times_ptr, index_offset)); |
duke@435 | 2203 | } |
never@739 | 2204 | __ movl(flags , Address(cache, index, Address::times_ptr, flags_offset )); |
duke@435 | 2205 | } |
duke@435 | 2206 | |
duke@435 | 2207 | |
duke@435 | 2208 | // The registers cache and index expected to be set before call. |
duke@435 | 2209 | // Correct values of the cache and index registers are preserved. |
duke@435 | 2210 | void TemplateTable::jvmti_post_field_access(Register cache, |
duke@435 | 2211 | Register index, |
duke@435 | 2212 | bool is_static, |
duke@435 | 2213 | bool has_tos) { |
duke@435 | 2214 | if (JvmtiExport::can_post_field_access()) { |
duke@435 | 2215 | // Check to see if a field access watch has been set before we take |
duke@435 | 2216 | // the time to call into the VM. |
duke@435 | 2217 | Label L1; |
duke@435 | 2218 | assert_different_registers(cache, index, rax); |
duke@435 | 2219 | __ mov32(rax, ExternalAddress((address) JvmtiExport::get_field_access_count_addr())); |
duke@435 | 2220 | __ testl(rax,rax); |
duke@435 | 2221 | __ jcc(Assembler::zero, L1); |
duke@435 | 2222 | |
duke@435 | 2223 | // cache entry pointer |
never@739 | 2224 | __ addptr(cache, in_bytes(constantPoolCacheOopDesc::base_offset())); |
duke@435 | 2225 | __ shll(index, LogBytesPerWord); |
never@739 | 2226 | __ addptr(cache, index); |
duke@435 | 2227 | if (is_static) { |
never@739 | 2228 | __ xorptr(rax, rax); // NULL object reference |
duke@435 | 2229 | } else { |
duke@435 | 2230 | __ pop(atos); // Get the object |
duke@435 | 2231 | __ verify_oop(rax); |
duke@435 | 2232 | __ push(atos); // Restore stack state |
duke@435 | 2233 | } |
duke@435 | 2234 | // rax,: object pointer or NULL |
duke@435 | 2235 | // cache: cache entry pointer |
duke@435 | 2236 | __ call_VM(noreg, CAST_FROM_FN_PTR(address, InterpreterRuntime::post_field_access), |
duke@435 | 2237 | rax, cache); |
duke@435 | 2238 | __ get_cache_and_index_at_bcp(cache, index, 1); |
duke@435 | 2239 | __ bind(L1); |
duke@435 | 2240 | } |
duke@435 | 2241 | } |
duke@435 | 2242 | |
duke@435 | 2243 | void TemplateTable::pop_and_check_object(Register r) { |
duke@435 | 2244 | __ pop_ptr(r); |
duke@435 | 2245 | __ null_check(r); // for field access must check obj. |
duke@435 | 2246 | __ verify_oop(r); |
duke@435 | 2247 | } |
duke@435 | 2248 | |
duke@435 | 2249 | void TemplateTable::getfield_or_static(int byte_no, bool is_static) { |
duke@435 | 2250 | transition(vtos, vtos); |
duke@435 | 2251 | |
duke@435 | 2252 | const Register cache = rcx; |
duke@435 | 2253 | const Register index = rdx; |
duke@435 | 2254 | const Register obj = rcx; |
duke@435 | 2255 | const Register off = rbx; |
duke@435 | 2256 | const Register flags = rax; |
duke@435 | 2257 | |
duke@435 | 2258 | resolve_cache_and_index(byte_no, cache, index); |
duke@435 | 2259 | jvmti_post_field_access(cache, index, is_static, false); |
duke@435 | 2260 | load_field_cp_cache_entry(obj, cache, index, off, flags, is_static); |
duke@435 | 2261 | |
duke@435 | 2262 | if (!is_static) pop_and_check_object(obj); |
duke@435 | 2263 | |
duke@435 | 2264 | const Address lo(obj, off, Address::times_1, 0*wordSize); |
duke@435 | 2265 | const Address hi(obj, off, Address::times_1, 1*wordSize); |
duke@435 | 2266 | |
duke@435 | 2267 | Label Done, notByte, notInt, notShort, notChar, notLong, notFloat, notObj, notDouble; |
duke@435 | 2268 | |
duke@435 | 2269 | __ shrl(flags, ConstantPoolCacheEntry::tosBits); |
duke@435 | 2270 | assert(btos == 0, "change code, btos != 0"); |
duke@435 | 2271 | // btos |
never@739 | 2272 | __ andptr(flags, 0x0f); |
duke@435 | 2273 | __ jcc(Assembler::notZero, notByte); |
duke@435 | 2274 | |
duke@435 | 2275 | __ load_signed_byte(rax, lo ); |
duke@435 | 2276 | __ push(btos); |
duke@435 | 2277 | // Rewrite bytecode to be faster |
duke@435 | 2278 | if (!is_static) { |
duke@435 | 2279 | patch_bytecode(Bytecodes::_fast_bgetfield, rcx, rbx); |
duke@435 | 2280 | } |
duke@435 | 2281 | __ jmp(Done); |
duke@435 | 2282 | |
duke@435 | 2283 | __ bind(notByte); |
duke@435 | 2284 | // itos |
duke@435 | 2285 | __ cmpl(flags, itos ); |
duke@435 | 2286 | __ jcc(Assembler::notEqual, notInt); |
duke@435 | 2287 | |
duke@435 | 2288 | __ movl(rax, lo ); |
duke@435 | 2289 | __ push(itos); |
duke@435 | 2290 | // Rewrite bytecode to be faster |
duke@435 | 2291 | if (!is_static) { |
duke@435 | 2292 | patch_bytecode(Bytecodes::_fast_igetfield, rcx, rbx); |
duke@435 | 2293 | } |
duke@435 | 2294 | __ jmp(Done); |
duke@435 | 2295 | |
duke@435 | 2296 | __ bind(notInt); |
duke@435 | 2297 | // atos |
duke@435 | 2298 | __ cmpl(flags, atos ); |
duke@435 | 2299 | __ jcc(Assembler::notEqual, notObj); |
duke@435 | 2300 | |
duke@435 | 2301 | __ movl(rax, lo ); |
duke@435 | 2302 | __ push(atos); |
duke@435 | 2303 | if (!is_static) { |
duke@435 | 2304 | patch_bytecode(Bytecodes::_fast_agetfield, rcx, rbx); |
duke@435 | 2305 | } |
duke@435 | 2306 | __ jmp(Done); |
duke@435 | 2307 | |
duke@435 | 2308 | __ bind(notObj); |
duke@435 | 2309 | // ctos |
duke@435 | 2310 | __ cmpl(flags, ctos ); |
duke@435 | 2311 | __ jcc(Assembler::notEqual, notChar); |
duke@435 | 2312 | |
jrose@1057 | 2313 | __ load_unsigned_short(rax, lo ); |
duke@435 | 2314 | __ push(ctos); |
duke@435 | 2315 | if (!is_static) { |
duke@435 | 2316 | patch_bytecode(Bytecodes::_fast_cgetfield, rcx, rbx); |
duke@435 | 2317 | } |
duke@435 | 2318 | __ jmp(Done); |
duke@435 | 2319 | |
duke@435 | 2320 | __ bind(notChar); |
duke@435 | 2321 | // stos |
duke@435 | 2322 | __ cmpl(flags, stos ); |
duke@435 | 2323 | __ jcc(Assembler::notEqual, notShort); |
duke@435 | 2324 | |
jrose@1057 | 2325 | __ load_signed_short(rax, lo ); |
duke@435 | 2326 | __ push(stos); |
duke@435 | 2327 | if (!is_static) { |
duke@435 | 2328 | patch_bytecode(Bytecodes::_fast_sgetfield, rcx, rbx); |
duke@435 | 2329 | } |
duke@435 | 2330 | __ jmp(Done); |
duke@435 | 2331 | |
duke@435 | 2332 | __ bind(notShort); |
duke@435 | 2333 | // ltos |
duke@435 | 2334 | __ cmpl(flags, ltos ); |
duke@435 | 2335 | __ jcc(Assembler::notEqual, notLong); |
duke@435 | 2336 | |
duke@435 | 2337 | // Generate code as if volatile. There just aren't enough registers to |
duke@435 | 2338 | // save that information and this code is faster than the test. |
duke@435 | 2339 | __ fild_d(lo); // Must load atomically |
never@739 | 2340 | __ subptr(rsp,2*wordSize); // Make space for store |
duke@435 | 2341 | __ fistp_d(Address(rsp,0)); |
never@739 | 2342 | __ pop(rax); |
never@739 | 2343 | __ pop(rdx); |
duke@435 | 2344 | |
duke@435 | 2345 | __ push(ltos); |
duke@435 | 2346 | // Don't rewrite to _fast_lgetfield for potential volatile case. |
duke@435 | 2347 | __ jmp(Done); |
duke@435 | 2348 | |
duke@435 | 2349 | __ bind(notLong); |
duke@435 | 2350 | // ftos |
duke@435 | 2351 | __ cmpl(flags, ftos ); |
duke@435 | 2352 | __ jcc(Assembler::notEqual, notFloat); |
duke@435 | 2353 | |
duke@435 | 2354 | __ fld_s(lo); |
duke@435 | 2355 | __ push(ftos); |
duke@435 | 2356 | if (!is_static) { |
duke@435 | 2357 | patch_bytecode(Bytecodes::_fast_fgetfield, rcx, rbx); |
duke@435 | 2358 | } |
duke@435 | 2359 | __ jmp(Done); |
duke@435 | 2360 | |
duke@435 | 2361 | __ bind(notFloat); |
duke@435 | 2362 | // dtos |
duke@435 | 2363 | __ cmpl(flags, dtos ); |
duke@435 | 2364 | __ jcc(Assembler::notEqual, notDouble); |
duke@435 | 2365 | |
duke@435 | 2366 | __ fld_d(lo); |
duke@435 | 2367 | __ push(dtos); |
duke@435 | 2368 | if (!is_static) { |
duke@435 | 2369 | patch_bytecode(Bytecodes::_fast_dgetfield, rcx, rbx); |
duke@435 | 2370 | } |
duke@435 | 2371 | __ jmpb(Done); |
duke@435 | 2372 | |
duke@435 | 2373 | __ bind(notDouble); |
duke@435 | 2374 | |
duke@435 | 2375 | __ stop("Bad state"); |
duke@435 | 2376 | |
duke@435 | 2377 | __ bind(Done); |
duke@435 | 2378 | // Doug Lea believes this is not needed with current Sparcs (TSO) and Intel (PSO). |
duke@435 | 2379 | // volatile_barrier( ); |
duke@435 | 2380 | } |
duke@435 | 2381 | |
duke@435 | 2382 | |
duke@435 | 2383 | void TemplateTable::getfield(int byte_no) { |
duke@435 | 2384 | getfield_or_static(byte_no, false); |
duke@435 | 2385 | } |
duke@435 | 2386 | |
duke@435 | 2387 | |
duke@435 | 2388 | void TemplateTable::getstatic(int byte_no) { |
duke@435 | 2389 | getfield_or_static(byte_no, true); |
duke@435 | 2390 | } |
duke@435 | 2391 | |
duke@435 | 2392 | // The registers cache and index expected to be set before call. |
duke@435 | 2393 | // The function may destroy various registers, just not the cache and index registers. |
duke@435 | 2394 | void TemplateTable::jvmti_post_field_mod(Register cache, Register index, bool is_static) { |
duke@435 | 2395 | |
duke@435 | 2396 | ByteSize cp_base_offset = constantPoolCacheOopDesc::base_offset(); |
duke@435 | 2397 | |
duke@435 | 2398 | if (JvmtiExport::can_post_field_modification()) { |
duke@435 | 2399 | // Check to see if a field modification watch has been set before we take |
duke@435 | 2400 | // the time to call into the VM. |
duke@435 | 2401 | Label L1; |
duke@435 | 2402 | assert_different_registers(cache, index, rax); |
duke@435 | 2403 | __ mov32(rax, ExternalAddress((address)JvmtiExport::get_field_modification_count_addr())); |
duke@435 | 2404 | __ testl(rax, rax); |
duke@435 | 2405 | __ jcc(Assembler::zero, L1); |
duke@435 | 2406 | |
duke@435 | 2407 | // The cache and index registers have been already set. |
duke@435 | 2408 | // This allows to eliminate this call but the cache and index |
duke@435 | 2409 | // registers have to be correspondingly used after this line. |
duke@435 | 2410 | __ get_cache_and_index_at_bcp(rax, rdx, 1); |
duke@435 | 2411 | |
duke@435 | 2412 | if (is_static) { |
duke@435 | 2413 | // Life is simple. Null out the object pointer. |
never@739 | 2414 | __ xorptr(rbx, rbx); |
duke@435 | 2415 | } else { |
duke@435 | 2416 | // Life is harder. The stack holds the value on top, followed by the object. |
duke@435 | 2417 | // We don't know the size of the value, though; it could be one or two words |
duke@435 | 2418 | // depending on its type. As a result, we must find the type to determine where |
duke@435 | 2419 | // the object is. |
duke@435 | 2420 | Label two_word, valsize_known; |
never@739 | 2421 | __ movl(rcx, Address(rax, rdx, Address::times_ptr, in_bytes(cp_base_offset + |
duke@435 | 2422 | ConstantPoolCacheEntry::flags_offset()))); |
never@739 | 2423 | __ mov(rbx, rsp); |
duke@435 | 2424 | __ shrl(rcx, ConstantPoolCacheEntry::tosBits); |
duke@435 | 2425 | // Make sure we don't need to mask rcx for tosBits after the above shift |
duke@435 | 2426 | ConstantPoolCacheEntry::verify_tosBits(); |
duke@435 | 2427 | __ cmpl(rcx, ltos); |
duke@435 | 2428 | __ jccb(Assembler::equal, two_word); |
duke@435 | 2429 | __ cmpl(rcx, dtos); |
duke@435 | 2430 | __ jccb(Assembler::equal, two_word); |
never@739 | 2431 | __ addptr(rbx, Interpreter::expr_offset_in_bytes(1)); // one word jvalue (not ltos, dtos) |
duke@435 | 2432 | __ jmpb(valsize_known); |
duke@435 | 2433 | |
duke@435 | 2434 | __ bind(two_word); |
never@739 | 2435 | __ addptr(rbx, Interpreter::expr_offset_in_bytes(2)); // two words jvalue |
duke@435 | 2436 | |
duke@435 | 2437 | __ bind(valsize_known); |
duke@435 | 2438 | // setup object pointer |
never@739 | 2439 | __ movptr(rbx, Address(rbx, 0)); |
duke@435 | 2440 | } |
duke@435 | 2441 | // cache entry pointer |
never@739 | 2442 | __ addptr(rax, in_bytes(cp_base_offset)); |
duke@435 | 2443 | __ shll(rdx, LogBytesPerWord); |
never@739 | 2444 | __ addptr(rax, rdx); |
duke@435 | 2445 | // object (tos) |
never@739 | 2446 | __ mov(rcx, rsp); |
duke@435 | 2447 | // rbx,: object pointer set up above (NULL if static) |
duke@435 | 2448 | // rax,: cache entry pointer |
duke@435 | 2449 | // rcx: jvalue object on the stack |
duke@435 | 2450 | __ call_VM(noreg, CAST_FROM_FN_PTR(address, InterpreterRuntime::post_field_modification), |
duke@435 | 2451 | rbx, rax, rcx); |
duke@435 | 2452 | __ get_cache_and_index_at_bcp(cache, index, 1); |
duke@435 | 2453 | __ bind(L1); |
duke@435 | 2454 | } |
duke@435 | 2455 | } |
duke@435 | 2456 | |
duke@435 | 2457 | |
duke@435 | 2458 | void TemplateTable::putfield_or_static(int byte_no, bool is_static) { |
duke@435 | 2459 | transition(vtos, vtos); |
duke@435 | 2460 | |
duke@435 | 2461 | const Register cache = rcx; |
duke@435 | 2462 | const Register index = rdx; |
duke@435 | 2463 | const Register obj = rcx; |
duke@435 | 2464 | const Register off = rbx; |
duke@435 | 2465 | const Register flags = rax; |
duke@435 | 2466 | |
duke@435 | 2467 | resolve_cache_and_index(byte_no, cache, index); |
duke@435 | 2468 | jvmti_post_field_mod(cache, index, is_static); |
duke@435 | 2469 | load_field_cp_cache_entry(obj, cache, index, off, flags, is_static); |
duke@435 | 2470 | |
duke@435 | 2471 | // Doug Lea believes this is not needed with current Sparcs (TSO) and Intel (PSO). |
duke@435 | 2472 | // volatile_barrier( ); |
duke@435 | 2473 | |
duke@435 | 2474 | Label notVolatile, Done; |
duke@435 | 2475 | __ movl(rdx, flags); |
duke@435 | 2476 | __ shrl(rdx, ConstantPoolCacheEntry::volatileField); |
duke@435 | 2477 | __ andl(rdx, 0x1); |
duke@435 | 2478 | |
duke@435 | 2479 | // field addresses |
duke@435 | 2480 | const Address lo(obj, off, Address::times_1, 0*wordSize); |
duke@435 | 2481 | const Address hi(obj, off, Address::times_1, 1*wordSize); |
duke@435 | 2482 | |
duke@435 | 2483 | Label notByte, notInt, notShort, notChar, notLong, notFloat, notObj, notDouble; |
duke@435 | 2484 | |
duke@435 | 2485 | __ shrl(flags, ConstantPoolCacheEntry::tosBits); |
duke@435 | 2486 | assert(btos == 0, "change code, btos != 0"); |
duke@435 | 2487 | // btos |
duke@435 | 2488 | __ andl(flags, 0x0f); |
duke@435 | 2489 | __ jcc(Assembler::notZero, notByte); |
duke@435 | 2490 | |
duke@435 | 2491 | __ pop(btos); |
duke@435 | 2492 | if (!is_static) pop_and_check_object(obj); |
duke@435 | 2493 | __ movb(lo, rax ); |
duke@435 | 2494 | if (!is_static) { |
duke@435 | 2495 | patch_bytecode(Bytecodes::_fast_bputfield, rcx, rbx); |
duke@435 | 2496 | } |
duke@435 | 2497 | __ jmp(Done); |
duke@435 | 2498 | |
duke@435 | 2499 | __ bind(notByte); |
duke@435 | 2500 | // itos |
duke@435 | 2501 | __ cmpl(flags, itos ); |
duke@435 | 2502 | __ jcc(Assembler::notEqual, notInt); |
duke@435 | 2503 | |
duke@435 | 2504 | __ pop(itos); |
duke@435 | 2505 | if (!is_static) pop_and_check_object(obj); |
duke@435 | 2506 | |
duke@435 | 2507 | __ movl(lo, rax ); |
duke@435 | 2508 | if (!is_static) { |
duke@435 | 2509 | patch_bytecode(Bytecodes::_fast_iputfield, rcx, rbx); |
duke@435 | 2510 | } |
duke@435 | 2511 | __ jmp(Done); |
duke@435 | 2512 | |
duke@435 | 2513 | __ bind(notInt); |
duke@435 | 2514 | // atos |
duke@435 | 2515 | __ cmpl(flags, atos ); |
duke@435 | 2516 | __ jcc(Assembler::notEqual, notObj); |
duke@435 | 2517 | |
duke@435 | 2518 | __ pop(atos); |
duke@435 | 2519 | if (!is_static) pop_and_check_object(obj); |
duke@435 | 2520 | |
ysr@777 | 2521 | do_oop_store(_masm, lo, rax, _bs->kind(), false); |
ysr@777 | 2522 | |
duke@435 | 2523 | if (!is_static) { |
duke@435 | 2524 | patch_bytecode(Bytecodes::_fast_aputfield, rcx, rbx); |
duke@435 | 2525 | } |
ysr@777 | 2526 | |
duke@435 | 2527 | __ jmp(Done); |
duke@435 | 2528 | |
duke@435 | 2529 | __ bind(notObj); |
duke@435 | 2530 | // ctos |
duke@435 | 2531 | __ cmpl(flags, ctos ); |
duke@435 | 2532 | __ jcc(Assembler::notEqual, notChar); |
duke@435 | 2533 | |
duke@435 | 2534 | __ pop(ctos); |
duke@435 | 2535 | if (!is_static) pop_and_check_object(obj); |
duke@435 | 2536 | __ movw(lo, rax ); |
duke@435 | 2537 | if (!is_static) { |
duke@435 | 2538 | patch_bytecode(Bytecodes::_fast_cputfield, rcx, rbx); |
duke@435 | 2539 | } |
duke@435 | 2540 | __ jmp(Done); |
duke@435 | 2541 | |
duke@435 | 2542 | __ bind(notChar); |
duke@435 | 2543 | // stos |
duke@435 | 2544 | __ cmpl(flags, stos ); |
duke@435 | 2545 | __ jcc(Assembler::notEqual, notShort); |
duke@435 | 2546 | |
duke@435 | 2547 | __ pop(stos); |
duke@435 | 2548 | if (!is_static) pop_and_check_object(obj); |
duke@435 | 2549 | __ movw(lo, rax ); |
duke@435 | 2550 | if (!is_static) { |
duke@435 | 2551 | patch_bytecode(Bytecodes::_fast_sputfield, rcx, rbx); |
duke@435 | 2552 | } |
duke@435 | 2553 | __ jmp(Done); |
duke@435 | 2554 | |
duke@435 | 2555 | __ bind(notShort); |
duke@435 | 2556 | // ltos |
duke@435 | 2557 | __ cmpl(flags, ltos ); |
duke@435 | 2558 | __ jcc(Assembler::notEqual, notLong); |
duke@435 | 2559 | |
duke@435 | 2560 | Label notVolatileLong; |
duke@435 | 2561 | __ testl(rdx, rdx); |
duke@435 | 2562 | __ jcc(Assembler::zero, notVolatileLong); |
duke@435 | 2563 | |
duke@435 | 2564 | __ pop(ltos); // overwrites rdx, do this after testing volatile. |
duke@435 | 2565 | if (!is_static) pop_and_check_object(obj); |
duke@435 | 2566 | |
duke@435 | 2567 | // Replace with real volatile test |
never@739 | 2568 | __ push(rdx); |
never@739 | 2569 | __ push(rax); // Must update atomically with FIST |
duke@435 | 2570 | __ fild_d(Address(rsp,0)); // So load into FPU register |
duke@435 | 2571 | __ fistp_d(lo); // and put into memory atomically |
never@739 | 2572 | __ addptr(rsp, 2*wordSize); |
never@739 | 2573 | // volatile_barrier(); |
never@739 | 2574 | volatile_barrier(Assembler::Membar_mask_bits(Assembler::StoreLoad | |
never@739 | 2575 | Assembler::StoreStore)); |
duke@435 | 2576 | // Don't rewrite volatile version |
duke@435 | 2577 | __ jmp(notVolatile); |
duke@435 | 2578 | |
duke@435 | 2579 | __ bind(notVolatileLong); |
duke@435 | 2580 | |
duke@435 | 2581 | __ pop(ltos); // overwrites rdx |
duke@435 | 2582 | if (!is_static) pop_and_check_object(obj); |
never@739 | 2583 | NOT_LP64(__ movptr(hi, rdx)); |
never@739 | 2584 | __ movptr(lo, rax); |
duke@435 | 2585 | if (!is_static) { |
duke@435 | 2586 | patch_bytecode(Bytecodes::_fast_lputfield, rcx, rbx); |
duke@435 | 2587 | } |
duke@435 | 2588 | __ jmp(notVolatile); |
duke@435 | 2589 | |
duke@435 | 2590 | __ bind(notLong); |
duke@435 | 2591 | // ftos |
duke@435 | 2592 | __ cmpl(flags, ftos ); |
duke@435 | 2593 | __ jcc(Assembler::notEqual, notFloat); |
duke@435 | 2594 | |
duke@435 | 2595 | __ pop(ftos); |
duke@435 | 2596 | if (!is_static) pop_and_check_object(obj); |
duke@435 | 2597 | __ fstp_s(lo); |
duke@435 | 2598 | if (!is_static) { |
duke@435 | 2599 | patch_bytecode(Bytecodes::_fast_fputfield, rcx, rbx); |
duke@435 | 2600 | } |
duke@435 | 2601 | __ jmp(Done); |
duke@435 | 2602 | |
duke@435 | 2603 | __ bind(notFloat); |
duke@435 | 2604 | // dtos |
duke@435 | 2605 | __ cmpl(flags, dtos ); |
duke@435 | 2606 | __ jcc(Assembler::notEqual, notDouble); |
duke@435 | 2607 | |
duke@435 | 2608 | __ pop(dtos); |
duke@435 | 2609 | if (!is_static) pop_and_check_object(obj); |
duke@435 | 2610 | __ fstp_d(lo); |
duke@435 | 2611 | if (!is_static) { |
duke@435 | 2612 | patch_bytecode(Bytecodes::_fast_dputfield, rcx, rbx); |
duke@435 | 2613 | } |
duke@435 | 2614 | __ jmp(Done); |
duke@435 | 2615 | |
duke@435 | 2616 | __ bind(notDouble); |
duke@435 | 2617 | |
duke@435 | 2618 | __ stop("Bad state"); |
duke@435 | 2619 | |
duke@435 | 2620 | __ bind(Done); |
duke@435 | 2621 | |
duke@435 | 2622 | // Check for volatile store |
duke@435 | 2623 | __ testl(rdx, rdx); |
duke@435 | 2624 | __ jcc(Assembler::zero, notVolatile); |
never@739 | 2625 | volatile_barrier(Assembler::Membar_mask_bits(Assembler::StoreLoad | |
never@739 | 2626 | Assembler::StoreStore)); |
duke@435 | 2627 | __ bind(notVolatile); |
duke@435 | 2628 | } |
duke@435 | 2629 | |
duke@435 | 2630 | |
duke@435 | 2631 | void TemplateTable::putfield(int byte_no) { |
duke@435 | 2632 | putfield_or_static(byte_no, false); |
duke@435 | 2633 | } |
duke@435 | 2634 | |
duke@435 | 2635 | |
duke@435 | 2636 | void TemplateTable::putstatic(int byte_no) { |
duke@435 | 2637 | putfield_or_static(byte_no, true); |
duke@435 | 2638 | } |
duke@435 | 2639 | |
duke@435 | 2640 | void TemplateTable::jvmti_post_fast_field_mod() { |
duke@435 | 2641 | if (JvmtiExport::can_post_field_modification()) { |
duke@435 | 2642 | // Check to see if a field modification watch has been set before we take |
duke@435 | 2643 | // the time to call into the VM. |
duke@435 | 2644 | Label L2; |
duke@435 | 2645 | __ mov32(rcx, ExternalAddress((address)JvmtiExport::get_field_modification_count_addr())); |
duke@435 | 2646 | __ testl(rcx,rcx); |
duke@435 | 2647 | __ jcc(Assembler::zero, L2); |
duke@435 | 2648 | __ pop_ptr(rbx); // copy the object pointer from tos |
duke@435 | 2649 | __ verify_oop(rbx); |
duke@435 | 2650 | __ push_ptr(rbx); // put the object pointer back on tos |
never@739 | 2651 | __ subptr(rsp, sizeof(jvalue)); // add space for a jvalue object |
never@739 | 2652 | __ mov(rcx, rsp); |
duke@435 | 2653 | __ push_ptr(rbx); // save object pointer so we can steal rbx, |
never@739 | 2654 | __ xorptr(rbx, rbx); |
duke@435 | 2655 | const Address lo_value(rcx, rbx, Address::times_1, 0*wordSize); |
duke@435 | 2656 | const Address hi_value(rcx, rbx, Address::times_1, 1*wordSize); |
duke@435 | 2657 | switch (bytecode()) { // load values into the jvalue object |
duke@435 | 2658 | case Bytecodes::_fast_bputfield: __ movb(lo_value, rax); break; |
duke@435 | 2659 | case Bytecodes::_fast_sputfield: __ movw(lo_value, rax); break; |
duke@435 | 2660 | case Bytecodes::_fast_cputfield: __ movw(lo_value, rax); break; |
duke@435 | 2661 | case Bytecodes::_fast_iputfield: __ movl(lo_value, rax); break; |
never@739 | 2662 | case Bytecodes::_fast_lputfield: |
never@739 | 2663 | NOT_LP64(__ movptr(hi_value, rdx)); |
never@739 | 2664 | __ movptr(lo_value, rax); |
never@739 | 2665 | break; |
never@739 | 2666 | |
duke@435 | 2667 | // need to call fld_s() after fstp_s() to restore the value for below |
duke@435 | 2668 | case Bytecodes::_fast_fputfield: __ fstp_s(lo_value); __ fld_s(lo_value); break; |
never@739 | 2669 | |
duke@435 | 2670 | // need to call fld_d() after fstp_d() to restore the value for below |
duke@435 | 2671 | case Bytecodes::_fast_dputfield: __ fstp_d(lo_value); __ fld_d(lo_value); break; |
never@739 | 2672 | |
duke@435 | 2673 | // since rcx is not an object we don't call store_check() here |
never@739 | 2674 | case Bytecodes::_fast_aputfield: __ movptr(lo_value, rax); break; |
never@739 | 2675 | |
duke@435 | 2676 | default: ShouldNotReachHere(); |
duke@435 | 2677 | } |
duke@435 | 2678 | __ pop_ptr(rbx); // restore copy of object pointer |
duke@435 | 2679 | |
duke@435 | 2680 | // Save rax, and sometimes rdx because call_VM() will clobber them, |
duke@435 | 2681 | // then use them for JVM/DI purposes |
never@739 | 2682 | __ push(rax); |
never@739 | 2683 | if (bytecode() == Bytecodes::_fast_lputfield) __ push(rdx); |
duke@435 | 2684 | // access constant pool cache entry |
duke@435 | 2685 | __ get_cache_entry_pointer_at_bcp(rax, rdx, 1); |
duke@435 | 2686 | __ verify_oop(rbx); |
duke@435 | 2687 | // rbx,: object pointer copied above |
duke@435 | 2688 | // rax,: cache entry pointer |
duke@435 | 2689 | // rcx: jvalue object on the stack |
duke@435 | 2690 | __ call_VM(noreg, CAST_FROM_FN_PTR(address, InterpreterRuntime::post_field_modification), rbx, rax, rcx); |
never@739 | 2691 | if (bytecode() == Bytecodes::_fast_lputfield) __ pop(rdx); // restore high value |
never@739 | 2692 | __ pop(rax); // restore lower value |
never@739 | 2693 | __ addptr(rsp, sizeof(jvalue)); // release jvalue object space |
duke@435 | 2694 | __ bind(L2); |
duke@435 | 2695 | } |
duke@435 | 2696 | } |
duke@435 | 2697 | |
duke@435 | 2698 | void TemplateTable::fast_storefield(TosState state) { |
duke@435 | 2699 | transition(state, vtos); |
duke@435 | 2700 | |
duke@435 | 2701 | ByteSize base = constantPoolCacheOopDesc::base_offset(); |
duke@435 | 2702 | |
duke@435 | 2703 | jvmti_post_fast_field_mod(); |
duke@435 | 2704 | |
duke@435 | 2705 | // access constant pool cache |
duke@435 | 2706 | __ get_cache_and_index_at_bcp(rcx, rbx, 1); |
duke@435 | 2707 | |
duke@435 | 2708 | // test for volatile with rdx but rdx is tos register for lputfield. |
never@739 | 2709 | if (bytecode() == Bytecodes::_fast_lputfield) __ push(rdx); |
never@739 | 2710 | __ movl(rdx, Address(rcx, rbx, Address::times_ptr, in_bytes(base + |
duke@435 | 2711 | ConstantPoolCacheEntry::flags_offset()))); |
duke@435 | 2712 | |
duke@435 | 2713 | // replace index with field offset from cache entry |
never@739 | 2714 | __ movptr(rbx, Address(rcx, rbx, Address::times_ptr, in_bytes(base + ConstantPoolCacheEntry::f2_offset()))); |
duke@435 | 2715 | |
duke@435 | 2716 | // Doug Lea believes this is not needed with current Sparcs (TSO) and Intel (PSO). |
duke@435 | 2717 | // volatile_barrier( ); |
duke@435 | 2718 | |
duke@435 | 2719 | Label notVolatile, Done; |
duke@435 | 2720 | __ shrl(rdx, ConstantPoolCacheEntry::volatileField); |
duke@435 | 2721 | __ andl(rdx, 0x1); |
duke@435 | 2722 | // Check for volatile store |
duke@435 | 2723 | __ testl(rdx, rdx); |
duke@435 | 2724 | __ jcc(Assembler::zero, notVolatile); |
duke@435 | 2725 | |
never@739 | 2726 | if (bytecode() == Bytecodes::_fast_lputfield) __ pop(rdx); |
duke@435 | 2727 | |
duke@435 | 2728 | // Get object from stack |
duke@435 | 2729 | pop_and_check_object(rcx); |
duke@435 | 2730 | |
duke@435 | 2731 | // field addresses |
duke@435 | 2732 | const Address lo(rcx, rbx, Address::times_1, 0*wordSize); |
duke@435 | 2733 | const Address hi(rcx, rbx, Address::times_1, 1*wordSize); |
duke@435 | 2734 | |
duke@435 | 2735 | // access field |
duke@435 | 2736 | switch (bytecode()) { |
duke@435 | 2737 | case Bytecodes::_fast_bputfield: __ movb(lo, rax); break; |
duke@435 | 2738 | case Bytecodes::_fast_sputfield: // fall through |
duke@435 | 2739 | case Bytecodes::_fast_cputfield: __ movw(lo, rax); break; |
duke@435 | 2740 | case Bytecodes::_fast_iputfield: __ movl(lo, rax); break; |
never@739 | 2741 | case Bytecodes::_fast_lputfield: |
never@739 | 2742 | NOT_LP64(__ movptr(hi, rdx)); |
never@739 | 2743 | __ movptr(lo, rax); |
never@739 | 2744 | break; |
duke@435 | 2745 | case Bytecodes::_fast_fputfield: __ fstp_s(lo); break; |
duke@435 | 2746 | case Bytecodes::_fast_dputfield: __ fstp_d(lo); break; |
ysr@777 | 2747 | case Bytecodes::_fast_aputfield: { |
ysr@777 | 2748 | do_oop_store(_masm, lo, rax, _bs->kind(), false); |
ysr@777 | 2749 | break; |
ysr@777 | 2750 | } |
duke@435 | 2751 | default: |
duke@435 | 2752 | ShouldNotReachHere(); |
duke@435 | 2753 | } |
duke@435 | 2754 | |
duke@435 | 2755 | Label done; |
never@739 | 2756 | volatile_barrier(Assembler::Membar_mask_bits(Assembler::StoreLoad | |
never@739 | 2757 | Assembler::StoreStore)); |
ysr@777 | 2758 | // Barriers are so large that short branch doesn't reach! |
ysr@777 | 2759 | __ jmp(done); |
duke@435 | 2760 | |
duke@435 | 2761 | // Same code as above, but don't need rdx to test for volatile. |
duke@435 | 2762 | __ bind(notVolatile); |
duke@435 | 2763 | |
never@739 | 2764 | if (bytecode() == Bytecodes::_fast_lputfield) __ pop(rdx); |
duke@435 | 2765 | |
duke@435 | 2766 | // Get object from stack |
duke@435 | 2767 | pop_and_check_object(rcx); |
duke@435 | 2768 | |
duke@435 | 2769 | // access field |
duke@435 | 2770 | switch (bytecode()) { |
duke@435 | 2771 | case Bytecodes::_fast_bputfield: __ movb(lo, rax); break; |
duke@435 | 2772 | case Bytecodes::_fast_sputfield: // fall through |
duke@435 | 2773 | case Bytecodes::_fast_cputfield: __ movw(lo, rax); break; |
duke@435 | 2774 | case Bytecodes::_fast_iputfield: __ movl(lo, rax); break; |
never@739 | 2775 | case Bytecodes::_fast_lputfield: |
never@739 | 2776 | NOT_LP64(__ movptr(hi, rdx)); |
never@739 | 2777 | __ movptr(lo, rax); |
never@739 | 2778 | break; |
duke@435 | 2779 | case Bytecodes::_fast_fputfield: __ fstp_s(lo); break; |
duke@435 | 2780 | case Bytecodes::_fast_dputfield: __ fstp_d(lo); break; |
ysr@777 | 2781 | case Bytecodes::_fast_aputfield: { |
ysr@777 | 2782 | do_oop_store(_masm, lo, rax, _bs->kind(), false); |
ysr@777 | 2783 | break; |
ysr@777 | 2784 | } |
duke@435 | 2785 | default: |
duke@435 | 2786 | ShouldNotReachHere(); |
duke@435 | 2787 | } |
duke@435 | 2788 | __ bind(done); |
duke@435 | 2789 | } |
duke@435 | 2790 | |
duke@435 | 2791 | |
duke@435 | 2792 | void TemplateTable::fast_accessfield(TosState state) { |
duke@435 | 2793 | transition(atos, state); |
duke@435 | 2794 | |
duke@435 | 2795 | // do the JVMTI work here to avoid disturbing the register state below |
duke@435 | 2796 | if (JvmtiExport::can_post_field_access()) { |
duke@435 | 2797 | // Check to see if a field access watch has been set before we take |
duke@435 | 2798 | // the time to call into the VM. |
duke@435 | 2799 | Label L1; |
duke@435 | 2800 | __ mov32(rcx, ExternalAddress((address) JvmtiExport::get_field_access_count_addr())); |
duke@435 | 2801 | __ testl(rcx,rcx); |
duke@435 | 2802 | __ jcc(Assembler::zero, L1); |
duke@435 | 2803 | // access constant pool cache entry |
duke@435 | 2804 | __ get_cache_entry_pointer_at_bcp(rcx, rdx, 1); |
duke@435 | 2805 | __ push_ptr(rax); // save object pointer before call_VM() clobbers it |
duke@435 | 2806 | __ verify_oop(rax); |
duke@435 | 2807 | // rax,: object pointer copied above |
duke@435 | 2808 | // rcx: cache entry pointer |
duke@435 | 2809 | __ call_VM(noreg, CAST_FROM_FN_PTR(address, InterpreterRuntime::post_field_access), rax, rcx); |
duke@435 | 2810 | __ pop_ptr(rax); // restore object pointer |
duke@435 | 2811 | __ bind(L1); |
duke@435 | 2812 | } |
duke@435 | 2813 | |
duke@435 | 2814 | // access constant pool cache |
duke@435 | 2815 | __ get_cache_and_index_at_bcp(rcx, rbx, 1); |
duke@435 | 2816 | // replace index with field offset from cache entry |
never@739 | 2817 | __ movptr(rbx, Address(rcx, |
never@739 | 2818 | rbx, |
never@739 | 2819 | Address::times_ptr, |
never@739 | 2820 | in_bytes(constantPoolCacheOopDesc::base_offset() + ConstantPoolCacheEntry::f2_offset()))); |
duke@435 | 2821 | |
duke@435 | 2822 | |
duke@435 | 2823 | // rax,: object |
duke@435 | 2824 | __ verify_oop(rax); |
duke@435 | 2825 | __ null_check(rax); |
duke@435 | 2826 | // field addresses |
duke@435 | 2827 | const Address lo = Address(rax, rbx, Address::times_1, 0*wordSize); |
duke@435 | 2828 | const Address hi = Address(rax, rbx, Address::times_1, 1*wordSize); |
duke@435 | 2829 | |
duke@435 | 2830 | // access field |
duke@435 | 2831 | switch (bytecode()) { |
never@739 | 2832 | case Bytecodes::_fast_bgetfield: __ movsbl(rax, lo ); break; |
jrose@1057 | 2833 | case Bytecodes::_fast_sgetfield: __ load_signed_short(rax, lo ); break; |
jrose@1057 | 2834 | case Bytecodes::_fast_cgetfield: __ load_unsigned_short(rax, lo ); break; |
duke@435 | 2835 | case Bytecodes::_fast_igetfield: __ movl(rax, lo); break; |
duke@435 | 2836 | case Bytecodes::_fast_lgetfield: __ stop("should not be rewritten"); break; |
duke@435 | 2837 | case Bytecodes::_fast_fgetfield: __ fld_s(lo); break; |
duke@435 | 2838 | case Bytecodes::_fast_dgetfield: __ fld_d(lo); break; |
never@739 | 2839 | case Bytecodes::_fast_agetfield: __ movptr(rax, lo); __ verify_oop(rax); break; |
duke@435 | 2840 | default: |
duke@435 | 2841 | ShouldNotReachHere(); |
duke@435 | 2842 | } |
duke@435 | 2843 | |
duke@435 | 2844 | // Doug Lea believes this is not needed with current Sparcs(TSO) and Intel(PSO) |
duke@435 | 2845 | // volatile_barrier( ); |
duke@435 | 2846 | } |
duke@435 | 2847 | |
duke@435 | 2848 | void TemplateTable::fast_xaccess(TosState state) { |
duke@435 | 2849 | transition(vtos, state); |
duke@435 | 2850 | // get receiver |
never@739 | 2851 | __ movptr(rax, aaddress(0)); |
duke@435 | 2852 | debug_only(__ verify_local_tag(frame::TagReference, 0)); |
duke@435 | 2853 | // access constant pool cache |
duke@435 | 2854 | __ get_cache_and_index_at_bcp(rcx, rdx, 2); |
never@739 | 2855 | __ movptr(rbx, Address(rcx, |
never@739 | 2856 | rdx, |
never@739 | 2857 | Address::times_ptr, |
never@739 | 2858 | in_bytes(constantPoolCacheOopDesc::base_offset() + ConstantPoolCacheEntry::f2_offset()))); |
duke@435 | 2859 | // make sure exception is reported in correct bcp range (getfield is next instruction) |
duke@435 | 2860 | __ increment(rsi); |
duke@435 | 2861 | __ null_check(rax); |
duke@435 | 2862 | const Address lo = Address(rax, rbx, Address::times_1, 0*wordSize); |
duke@435 | 2863 | if (state == itos) { |
duke@435 | 2864 | __ movl(rax, lo); |
duke@435 | 2865 | } else if (state == atos) { |
never@739 | 2866 | __ movptr(rax, lo); |
duke@435 | 2867 | __ verify_oop(rax); |
duke@435 | 2868 | } else if (state == ftos) { |
duke@435 | 2869 | __ fld_s(lo); |
duke@435 | 2870 | } else { |
duke@435 | 2871 | ShouldNotReachHere(); |
duke@435 | 2872 | } |
duke@435 | 2873 | __ decrement(rsi); |
duke@435 | 2874 | } |
duke@435 | 2875 | |
duke@435 | 2876 | |
duke@435 | 2877 | |
duke@435 | 2878 | //---------------------------------------------------------------------------------------------------- |
duke@435 | 2879 | // Calls |
duke@435 | 2880 | |
duke@435 | 2881 | void TemplateTable::count_calls(Register method, Register temp) { |
duke@435 | 2882 | // implemented elsewhere |
duke@435 | 2883 | ShouldNotReachHere(); |
duke@435 | 2884 | } |
duke@435 | 2885 | |
duke@435 | 2886 | |
duke@435 | 2887 | void TemplateTable::prepare_invoke(Register method, Register index, int byte_no, Bytecodes::Code code) { |
duke@435 | 2888 | // determine flags |
duke@435 | 2889 | const bool is_invokeinterface = code == Bytecodes::_invokeinterface; |
duke@435 | 2890 | const bool is_invokevirtual = code == Bytecodes::_invokevirtual; |
duke@435 | 2891 | const bool is_invokespecial = code == Bytecodes::_invokespecial; |
duke@435 | 2892 | const bool load_receiver = code != Bytecodes::_invokestatic; |
duke@435 | 2893 | const bool receiver_null_check = is_invokespecial; |
duke@435 | 2894 | const bool save_flags = is_invokeinterface || is_invokevirtual; |
duke@435 | 2895 | // setup registers & access constant pool cache |
duke@435 | 2896 | const Register recv = rcx; |
duke@435 | 2897 | const Register flags = rdx; |
duke@435 | 2898 | assert_different_registers(method, index, recv, flags); |
duke@435 | 2899 | |
duke@435 | 2900 | // save 'interpreter return address' |
duke@435 | 2901 | __ save_bcp(); |
duke@435 | 2902 | |
duke@435 | 2903 | load_invoke_cp_cache_entry(byte_no, method, index, flags, is_invokevirtual); |
duke@435 | 2904 | |
duke@435 | 2905 | // load receiver if needed (note: no return address pushed yet) |
duke@435 | 2906 | if (load_receiver) { |
duke@435 | 2907 | __ movl(recv, flags); |
duke@435 | 2908 | __ andl(recv, 0xFF); |
duke@435 | 2909 | // recv count is 0 based? |
never@739 | 2910 | __ movptr(recv, Address(rsp, recv, Interpreter::stackElementScale(), -Interpreter::expr_offset_in_bytes(1))); |
duke@435 | 2911 | __ verify_oop(recv); |
duke@435 | 2912 | } |
duke@435 | 2913 | |
duke@435 | 2914 | // do null check if needed |
duke@435 | 2915 | if (receiver_null_check) { |
duke@435 | 2916 | __ null_check(recv); |
duke@435 | 2917 | } |
duke@435 | 2918 | |
duke@435 | 2919 | if (save_flags) { |
never@739 | 2920 | __ mov(rsi, flags); |
duke@435 | 2921 | } |
duke@435 | 2922 | |
duke@435 | 2923 | // compute return type |
duke@435 | 2924 | __ shrl(flags, ConstantPoolCacheEntry::tosBits); |
duke@435 | 2925 | // Make sure we don't need to mask flags for tosBits after the above shift |
duke@435 | 2926 | ConstantPoolCacheEntry::verify_tosBits(); |
duke@435 | 2927 | // load return address |
never@739 | 2928 | { |
never@739 | 2929 | ExternalAddress table(is_invokeinterface ? (address)Interpreter::return_5_addrs_by_index_table() : |
never@739 | 2930 | (address)Interpreter::return_3_addrs_by_index_table()); |
never@739 | 2931 | __ movptr(flags, ArrayAddress(table, Address(noreg, flags, Address::times_ptr))); |
duke@435 | 2932 | } |
duke@435 | 2933 | |
duke@435 | 2934 | // push return address |
never@739 | 2935 | __ push(flags); |
duke@435 | 2936 | |
duke@435 | 2937 | // Restore flag value from the constant pool cache, and restore rsi |
duke@435 | 2938 | // for later null checks. rsi is the bytecode pointer |
duke@435 | 2939 | if (save_flags) { |
never@739 | 2940 | __ mov(flags, rsi); |
duke@435 | 2941 | __ restore_bcp(); |
duke@435 | 2942 | } |
duke@435 | 2943 | } |
duke@435 | 2944 | |
duke@435 | 2945 | |
duke@435 | 2946 | void TemplateTable::invokevirtual_helper(Register index, Register recv, |
duke@435 | 2947 | Register flags) { |
duke@435 | 2948 | |
duke@435 | 2949 | // Uses temporary registers rax, rdx |
duke@435 | 2950 | assert_different_registers(index, recv, rax, rdx); |
duke@435 | 2951 | |
duke@435 | 2952 | // Test for an invoke of a final method |
duke@435 | 2953 | Label notFinal; |
duke@435 | 2954 | __ movl(rax, flags); |
duke@435 | 2955 | __ andl(rax, (1 << ConstantPoolCacheEntry::vfinalMethod)); |
duke@435 | 2956 | __ jcc(Assembler::zero, notFinal); |
duke@435 | 2957 | |
duke@435 | 2958 | Register method = index; // method must be rbx, |
duke@435 | 2959 | assert(method == rbx, "methodOop must be rbx, for interpreter calling convention"); |
duke@435 | 2960 | |
duke@435 | 2961 | // do the call - the index is actually the method to call |
duke@435 | 2962 | __ verify_oop(method); |
duke@435 | 2963 | |
duke@435 | 2964 | // It's final, need a null check here! |
duke@435 | 2965 | __ null_check(recv); |
duke@435 | 2966 | |
duke@435 | 2967 | // profile this call |
duke@435 | 2968 | __ profile_final_call(rax); |
duke@435 | 2969 | |
duke@435 | 2970 | __ jump_from_interpreted(method, rax); |
duke@435 | 2971 | |
duke@435 | 2972 | __ bind(notFinal); |
duke@435 | 2973 | |
duke@435 | 2974 | // get receiver klass |
duke@435 | 2975 | __ null_check(recv, oopDesc::klass_offset_in_bytes()); |
duke@435 | 2976 | // Keep recv in rcx for callee expects it there |
never@739 | 2977 | __ movptr(rax, Address(recv, oopDesc::klass_offset_in_bytes())); |
duke@435 | 2978 | __ verify_oop(rax); |
duke@435 | 2979 | |
duke@435 | 2980 | // profile this call |
duke@435 | 2981 | __ profile_virtual_call(rax, rdi, rdx); |
duke@435 | 2982 | |
duke@435 | 2983 | // get target methodOop & entry point |
duke@435 | 2984 | const int base = instanceKlass::vtable_start_offset() * wordSize; |
duke@435 | 2985 | assert(vtableEntry::size() * wordSize == 4, "adjust the scaling in the code below"); |
never@739 | 2986 | __ movptr(method, Address(rax, index, Address::times_ptr, base + vtableEntry::method_offset_in_bytes())); |
duke@435 | 2987 | __ jump_from_interpreted(method, rdx); |
duke@435 | 2988 | } |
duke@435 | 2989 | |
duke@435 | 2990 | |
duke@435 | 2991 | void TemplateTable::invokevirtual(int byte_no) { |
duke@435 | 2992 | transition(vtos, vtos); |
duke@435 | 2993 | prepare_invoke(rbx, noreg, byte_no, bytecode()); |
duke@435 | 2994 | |
duke@435 | 2995 | // rbx,: index |
duke@435 | 2996 | // rcx: receiver |
duke@435 | 2997 | // rdx: flags |
duke@435 | 2998 | |
duke@435 | 2999 | invokevirtual_helper(rbx, rcx, rdx); |
duke@435 | 3000 | } |
duke@435 | 3001 | |
duke@435 | 3002 | |
duke@435 | 3003 | void TemplateTable::invokespecial(int byte_no) { |
duke@435 | 3004 | transition(vtos, vtos); |
duke@435 | 3005 | prepare_invoke(rbx, noreg, byte_no, bytecode()); |
duke@435 | 3006 | // do the call |
duke@435 | 3007 | __ verify_oop(rbx); |
duke@435 | 3008 | __ profile_call(rax); |
duke@435 | 3009 | __ jump_from_interpreted(rbx, rax); |
duke@435 | 3010 | } |
duke@435 | 3011 | |
duke@435 | 3012 | |
duke@435 | 3013 | void TemplateTable::invokestatic(int byte_no) { |
duke@435 | 3014 | transition(vtos, vtos); |
duke@435 | 3015 | prepare_invoke(rbx, noreg, byte_no, bytecode()); |
duke@435 | 3016 | // do the call |
duke@435 | 3017 | __ verify_oop(rbx); |
duke@435 | 3018 | __ profile_call(rax); |
duke@435 | 3019 | __ jump_from_interpreted(rbx, rax); |
duke@435 | 3020 | } |
duke@435 | 3021 | |
duke@435 | 3022 | |
duke@435 | 3023 | void TemplateTable::fast_invokevfinal(int byte_no) { |
duke@435 | 3024 | transition(vtos, vtos); |
duke@435 | 3025 | __ stop("fast_invokevfinal not used on x86"); |
duke@435 | 3026 | } |
duke@435 | 3027 | |
duke@435 | 3028 | |
duke@435 | 3029 | void TemplateTable::invokeinterface(int byte_no) { |
duke@435 | 3030 | transition(vtos, vtos); |
duke@435 | 3031 | prepare_invoke(rax, rbx, byte_no, bytecode()); |
duke@435 | 3032 | |
duke@435 | 3033 | // rax,: Interface |
duke@435 | 3034 | // rbx,: index |
duke@435 | 3035 | // rcx: receiver |
duke@435 | 3036 | // rdx: flags |
duke@435 | 3037 | |
duke@435 | 3038 | // Special case of invokeinterface called for virtual method of |
duke@435 | 3039 | // java.lang.Object. See cpCacheOop.cpp for details. |
duke@435 | 3040 | // This code isn't produced by javac, but could be produced by |
duke@435 | 3041 | // another compliant java compiler. |
duke@435 | 3042 | Label notMethod; |
duke@435 | 3043 | __ movl(rdi, rdx); |
duke@435 | 3044 | __ andl(rdi, (1 << ConstantPoolCacheEntry::methodInterface)); |
duke@435 | 3045 | __ jcc(Assembler::zero, notMethod); |
duke@435 | 3046 | |
duke@435 | 3047 | invokevirtual_helper(rbx, rcx, rdx); |
duke@435 | 3048 | __ bind(notMethod); |
duke@435 | 3049 | |
duke@435 | 3050 | // Get receiver klass into rdx - also a null check |
duke@435 | 3051 | __ restore_locals(); // restore rdi |
never@739 | 3052 | __ movptr(rdx, Address(rcx, oopDesc::klass_offset_in_bytes())); |
duke@435 | 3053 | __ verify_oop(rdx); |
duke@435 | 3054 | |
duke@435 | 3055 | // profile this call |
duke@435 | 3056 | __ profile_virtual_call(rdx, rsi, rdi); |
duke@435 | 3057 | |
jrose@1058 | 3058 | Label no_such_interface, no_such_method; |
jrose@1058 | 3059 | |
jrose@1058 | 3060 | __ lookup_interface_method(// inputs: rec. class, interface, itable index |
jrose@1058 | 3061 | rdx, rax, rbx, |
jrose@1058 | 3062 | // outputs: method, scan temp. reg |
jrose@1058 | 3063 | rbx, rsi, |
jrose@1058 | 3064 | no_such_interface); |
jrose@1058 | 3065 | |
jrose@1058 | 3066 | // rbx,: methodOop to call |
jrose@1058 | 3067 | // rcx: receiver |
jrose@1058 | 3068 | // Check for abstract method error |
jrose@1058 | 3069 | // Note: This should be done more efficiently via a throw_abstract_method_error |
jrose@1058 | 3070 | // interpreter entry point and a conditional jump to it in case of a null |
jrose@1058 | 3071 | // method. |
jrose@1058 | 3072 | __ testptr(rbx, rbx); |
jrose@1058 | 3073 | __ jcc(Assembler::zero, no_such_method); |
jrose@1058 | 3074 | |
jrose@1058 | 3075 | // do the call |
jrose@1058 | 3076 | // rcx: receiver |
jrose@1058 | 3077 | // rbx,: methodOop |
jrose@1058 | 3078 | __ jump_from_interpreted(rbx, rdx); |
jrose@1058 | 3079 | __ should_not_reach_here(); |
jrose@1058 | 3080 | |
jrose@1058 | 3081 | // exception handling code follows... |
jrose@1058 | 3082 | // note: must restore interpreter registers to canonical |
jrose@1058 | 3083 | // state for exception handling to work correctly! |
jrose@1058 | 3084 | |
jrose@1058 | 3085 | __ bind(no_such_method); |
duke@435 | 3086 | // throw exception |
jrose@1058 | 3087 | __ pop(rbx); // pop return address (pushed by prepare_invoke) |
jrose@1058 | 3088 | __ restore_bcp(); // rsi must be correct for exception handler (was destroyed) |
jrose@1058 | 3089 | __ restore_locals(); // make sure locals pointer is correct as well (was destroyed) |
jrose@1058 | 3090 | __ call_VM(noreg, CAST_FROM_FN_PTR(address, InterpreterRuntime::throw_AbstractMethodError)); |
jrose@1058 | 3091 | // the call_VM checks for exception, so we should never return here. |
jrose@1058 | 3092 | __ should_not_reach_here(); |
jrose@1058 | 3093 | |
jrose@1058 | 3094 | __ bind(no_such_interface); |
jrose@1058 | 3095 | // throw exception |
never@739 | 3096 | __ pop(rbx); // pop return address (pushed by prepare_invoke) |
duke@435 | 3097 | __ restore_bcp(); // rsi must be correct for exception handler (was destroyed) |
duke@435 | 3098 | __ restore_locals(); // make sure locals pointer is correct as well (was destroyed) |
duke@435 | 3099 | __ call_VM(noreg, CAST_FROM_FN_PTR(address, |
duke@435 | 3100 | InterpreterRuntime::throw_IncompatibleClassChangeError)); |
duke@435 | 3101 | // the call_VM checks for exception, so we should never return here. |
duke@435 | 3102 | __ should_not_reach_here(); |
duke@435 | 3103 | } |
duke@435 | 3104 | |
duke@435 | 3105 | //---------------------------------------------------------------------------------------------------- |
duke@435 | 3106 | // Allocation |
duke@435 | 3107 | |
duke@435 | 3108 | void TemplateTable::_new() { |
duke@435 | 3109 | transition(vtos, atos); |
duke@435 | 3110 | __ get_unsigned_2_byte_index_at_bcp(rdx, 1); |
duke@435 | 3111 | Label slow_case; |
duke@435 | 3112 | Label done; |
duke@435 | 3113 | Label initialize_header; |
duke@435 | 3114 | Label initialize_object; // including clearing the fields |
duke@435 | 3115 | Label allocate_shared; |
duke@435 | 3116 | |
duke@435 | 3117 | __ get_cpool_and_tags(rcx, rax); |
duke@435 | 3118 | // get instanceKlass |
never@739 | 3119 | __ movptr(rcx, Address(rcx, rdx, Address::times_ptr, sizeof(constantPoolOopDesc))); |
never@739 | 3120 | __ push(rcx); // save the contexts of klass for initializing the header |
duke@435 | 3121 | |
duke@435 | 3122 | // make sure the class we're about to instantiate has been resolved. |
duke@435 | 3123 | // Note: slow_case does a pop of stack, which is why we loaded class/pushed above |
duke@435 | 3124 | const int tags_offset = typeArrayOopDesc::header_size(T_BYTE) * wordSize; |
duke@435 | 3125 | __ cmpb(Address(rax, rdx, Address::times_1, tags_offset), JVM_CONSTANT_Class); |
duke@435 | 3126 | __ jcc(Assembler::notEqual, slow_case); |
duke@435 | 3127 | |
duke@435 | 3128 | // make sure klass is initialized & doesn't have finalizer |
duke@435 | 3129 | // make sure klass is fully initialized |
duke@435 | 3130 | __ cmpl(Address(rcx, instanceKlass::init_state_offset_in_bytes() + sizeof(oopDesc)), instanceKlass::fully_initialized); |
duke@435 | 3131 | __ jcc(Assembler::notEqual, slow_case); |
duke@435 | 3132 | |
duke@435 | 3133 | // get instance_size in instanceKlass (scaled to a count of bytes) |
duke@435 | 3134 | __ movl(rdx, Address(rcx, Klass::layout_helper_offset_in_bytes() + sizeof(oopDesc))); |
duke@435 | 3135 | // test to see if it has a finalizer or is malformed in some way |
duke@435 | 3136 | __ testl(rdx, Klass::_lh_instance_slow_path_bit); |
duke@435 | 3137 | __ jcc(Assembler::notZero, slow_case); |
duke@435 | 3138 | |
duke@435 | 3139 | // |
duke@435 | 3140 | // Allocate the instance |
duke@435 | 3141 | // 1) Try to allocate in the TLAB |
duke@435 | 3142 | // 2) if fail and the object is large allocate in the shared Eden |
duke@435 | 3143 | // 3) if the above fails (or is not applicable), go to a slow case |
duke@435 | 3144 | // (creates a new TLAB, etc.) |
duke@435 | 3145 | |
duke@435 | 3146 | const bool allow_shared_alloc = |
duke@435 | 3147 | Universe::heap()->supports_inline_contig_alloc() && !CMSIncrementalMode; |
duke@435 | 3148 | |
duke@435 | 3149 | if (UseTLAB) { |
duke@435 | 3150 | const Register thread = rcx; |
duke@435 | 3151 | |
duke@435 | 3152 | __ get_thread(thread); |
never@739 | 3153 | __ movptr(rax, Address(thread, in_bytes(JavaThread::tlab_top_offset()))); |
never@739 | 3154 | __ lea(rbx, Address(rax, rdx, Address::times_1)); |
never@739 | 3155 | __ cmpptr(rbx, Address(thread, in_bytes(JavaThread::tlab_end_offset()))); |
duke@435 | 3156 | __ jcc(Assembler::above, allow_shared_alloc ? allocate_shared : slow_case); |
never@739 | 3157 | __ movptr(Address(thread, in_bytes(JavaThread::tlab_top_offset())), rbx); |
duke@435 | 3158 | if (ZeroTLAB) { |
duke@435 | 3159 | // the fields have been already cleared |
duke@435 | 3160 | __ jmp(initialize_header); |
duke@435 | 3161 | } else { |
duke@435 | 3162 | // initialize both the header and fields |
duke@435 | 3163 | __ jmp(initialize_object); |
duke@435 | 3164 | } |
duke@435 | 3165 | } |
duke@435 | 3166 | |
duke@435 | 3167 | // Allocation in the shared Eden, if allowed. |
duke@435 | 3168 | // |
duke@435 | 3169 | // rdx: instance size in bytes |
duke@435 | 3170 | if (allow_shared_alloc) { |
duke@435 | 3171 | __ bind(allocate_shared); |
duke@435 | 3172 | |
ysr@777 | 3173 | ExternalAddress heap_top((address)Universe::heap()->top_addr()); |
ysr@777 | 3174 | |
duke@435 | 3175 | Label retry; |
duke@435 | 3176 | __ bind(retry); |
never@739 | 3177 | __ movptr(rax, heap_top); |
never@739 | 3178 | __ lea(rbx, Address(rax, rdx, Address::times_1)); |
never@739 | 3179 | __ cmpptr(rbx, ExternalAddress((address)Universe::heap()->end_addr())); |
duke@435 | 3180 | __ jcc(Assembler::above, slow_case); |
duke@435 | 3181 | |
duke@435 | 3182 | // Compare rax, with the top addr, and if still equal, store the new |
duke@435 | 3183 | // top addr in rbx, at the address of the top addr pointer. Sets ZF if was |
duke@435 | 3184 | // equal, and clears it otherwise. Use lock prefix for atomicity on MPs. |
duke@435 | 3185 | // |
duke@435 | 3186 | // rax,: object begin |
duke@435 | 3187 | // rbx,: object end |
duke@435 | 3188 | // rdx: instance size in bytes |
never@739 | 3189 | __ locked_cmpxchgptr(rbx, heap_top); |
duke@435 | 3190 | |
duke@435 | 3191 | // if someone beat us on the allocation, try again, otherwise continue |
duke@435 | 3192 | __ jcc(Assembler::notEqual, retry); |
duke@435 | 3193 | } |
duke@435 | 3194 | |
duke@435 | 3195 | if (UseTLAB || Universe::heap()->supports_inline_contig_alloc()) { |
duke@435 | 3196 | // The object is initialized before the header. If the object size is |
duke@435 | 3197 | // zero, go directly to the header initialization. |
duke@435 | 3198 | __ bind(initialize_object); |
duke@435 | 3199 | __ decrement(rdx, sizeof(oopDesc)); |
duke@435 | 3200 | __ jcc(Assembler::zero, initialize_header); |
duke@435 | 3201 | |
duke@435 | 3202 | // Initialize topmost object field, divide rdx by 8, check if odd and |
duke@435 | 3203 | // test if zero. |
duke@435 | 3204 | __ xorl(rcx, rcx); // use zero reg to clear memory (shorter code) |
duke@435 | 3205 | __ shrl(rdx, LogBytesPerLong); // divide by 2*oopSize and set carry flag if odd |
duke@435 | 3206 | |
duke@435 | 3207 | // rdx must have been multiple of 8 |
duke@435 | 3208 | #ifdef ASSERT |
duke@435 | 3209 | // make sure rdx was multiple of 8 |
duke@435 | 3210 | Label L; |
duke@435 | 3211 | // Ignore partial flag stall after shrl() since it is debug VM |
duke@435 | 3212 | __ jccb(Assembler::carryClear, L); |
duke@435 | 3213 | __ stop("object size is not multiple of 2 - adjust this code"); |
duke@435 | 3214 | __ bind(L); |
duke@435 | 3215 | // rdx must be > 0, no extra check needed here |
duke@435 | 3216 | #endif |
duke@435 | 3217 | |
duke@435 | 3218 | // initialize remaining object fields: rdx was a multiple of 8 |
duke@435 | 3219 | { Label loop; |
duke@435 | 3220 | __ bind(loop); |
never@739 | 3221 | __ movptr(Address(rax, rdx, Address::times_8, sizeof(oopDesc) - 1*oopSize), rcx); |
never@739 | 3222 | NOT_LP64(__ movptr(Address(rax, rdx, Address::times_8, sizeof(oopDesc) - 2*oopSize), rcx)); |
duke@435 | 3223 | __ decrement(rdx); |
duke@435 | 3224 | __ jcc(Assembler::notZero, loop); |
duke@435 | 3225 | } |
duke@435 | 3226 | |
duke@435 | 3227 | // initialize object header only. |
duke@435 | 3228 | __ bind(initialize_header); |
duke@435 | 3229 | if (UseBiasedLocking) { |
never@739 | 3230 | __ pop(rcx); // get saved klass back in the register. |
never@739 | 3231 | __ movptr(rbx, Address(rcx, Klass::prototype_header_offset_in_bytes() + klassOopDesc::klass_part_offset_in_bytes())); |
never@739 | 3232 | __ movptr(Address(rax, oopDesc::mark_offset_in_bytes ()), rbx); |
duke@435 | 3233 | } else { |
never@739 | 3234 | __ movptr(Address(rax, oopDesc::mark_offset_in_bytes ()), |
never@739 | 3235 | (int32_t)markOopDesc::prototype()); // header |
never@739 | 3236 | __ pop(rcx); // get saved klass back in the register. |
duke@435 | 3237 | } |
never@739 | 3238 | __ movptr(Address(rax, oopDesc::klass_offset_in_bytes()), rcx); // klass |
duke@435 | 3239 | |
duke@435 | 3240 | { |
duke@435 | 3241 | SkipIfEqual skip_if(_masm, &DTraceAllocProbes, 0); |
duke@435 | 3242 | // Trigger dtrace event for fastpath |
duke@435 | 3243 | __ push(atos); |
duke@435 | 3244 | __ call_VM_leaf( |
duke@435 | 3245 | CAST_FROM_FN_PTR(address, SharedRuntime::dtrace_object_alloc), rax); |
duke@435 | 3246 | __ pop(atos); |
duke@435 | 3247 | } |
duke@435 | 3248 | |
duke@435 | 3249 | __ jmp(done); |
duke@435 | 3250 | } |
duke@435 | 3251 | |
duke@435 | 3252 | // slow case |
duke@435 | 3253 | __ bind(slow_case); |
never@739 | 3254 | __ pop(rcx); // restore stack pointer to what it was when we came in. |
duke@435 | 3255 | __ get_constant_pool(rax); |
duke@435 | 3256 | __ get_unsigned_2_byte_index_at_bcp(rdx, 1); |
duke@435 | 3257 | call_VM(rax, CAST_FROM_FN_PTR(address, InterpreterRuntime::_new), rax, rdx); |
duke@435 | 3258 | |
duke@435 | 3259 | // continue |
duke@435 | 3260 | __ bind(done); |
duke@435 | 3261 | } |
duke@435 | 3262 | |
duke@435 | 3263 | |
duke@435 | 3264 | void TemplateTable::newarray() { |
duke@435 | 3265 | transition(itos, atos); |
duke@435 | 3266 | __ push_i(rax); // make sure everything is on the stack |
duke@435 | 3267 | __ load_unsigned_byte(rdx, at_bcp(1)); |
duke@435 | 3268 | call_VM(rax, CAST_FROM_FN_PTR(address, InterpreterRuntime::newarray), rdx, rax); |
duke@435 | 3269 | __ pop_i(rdx); // discard size |
duke@435 | 3270 | } |
duke@435 | 3271 | |
duke@435 | 3272 | |
duke@435 | 3273 | void TemplateTable::anewarray() { |
duke@435 | 3274 | transition(itos, atos); |
duke@435 | 3275 | __ get_unsigned_2_byte_index_at_bcp(rdx, 1); |
duke@435 | 3276 | __ get_constant_pool(rcx); |
duke@435 | 3277 | call_VM(rax, CAST_FROM_FN_PTR(address, InterpreterRuntime::anewarray), rcx, rdx, rax); |
duke@435 | 3278 | } |
duke@435 | 3279 | |
duke@435 | 3280 | |
duke@435 | 3281 | void TemplateTable::arraylength() { |
duke@435 | 3282 | transition(atos, itos); |
duke@435 | 3283 | __ null_check(rax, arrayOopDesc::length_offset_in_bytes()); |
duke@435 | 3284 | __ movl(rax, Address(rax, arrayOopDesc::length_offset_in_bytes())); |
duke@435 | 3285 | } |
duke@435 | 3286 | |
duke@435 | 3287 | |
duke@435 | 3288 | void TemplateTable::checkcast() { |
duke@435 | 3289 | transition(atos, atos); |
duke@435 | 3290 | Label done, is_null, ok_is_subtype, quicked, resolved; |
never@739 | 3291 | __ testptr(rax, rax); // Object is in EAX |
duke@435 | 3292 | __ jcc(Assembler::zero, is_null); |
duke@435 | 3293 | |
duke@435 | 3294 | // Get cpool & tags index |
duke@435 | 3295 | __ get_cpool_and_tags(rcx, rdx); // ECX=cpool, EDX=tags array |
duke@435 | 3296 | __ get_unsigned_2_byte_index_at_bcp(rbx, 1); // EBX=index |
duke@435 | 3297 | // See if bytecode has already been quicked |
duke@435 | 3298 | __ cmpb(Address(rdx, rbx, Address::times_1, typeArrayOopDesc::header_size(T_BYTE) * wordSize), JVM_CONSTANT_Class); |
duke@435 | 3299 | __ jcc(Assembler::equal, quicked); |
duke@435 | 3300 | |
duke@435 | 3301 | __ push(atos); |
duke@435 | 3302 | call_VM(rax, CAST_FROM_FN_PTR(address, InterpreterRuntime::quicken_io_cc) ); |
duke@435 | 3303 | __ pop_ptr(rdx); |
duke@435 | 3304 | __ jmpb(resolved); |
duke@435 | 3305 | |
duke@435 | 3306 | // Get superklass in EAX and subklass in EBX |
duke@435 | 3307 | __ bind(quicked); |
never@739 | 3308 | __ mov(rdx, rax); // Save object in EDX; EAX needed for subtype check |
never@739 | 3309 | __ movptr(rax, Address(rcx, rbx, Address::times_ptr, sizeof(constantPoolOopDesc))); |
duke@435 | 3310 | |
duke@435 | 3311 | __ bind(resolved); |
never@739 | 3312 | __ movptr(rbx, Address(rdx, oopDesc::klass_offset_in_bytes())); |
duke@435 | 3313 | |
duke@435 | 3314 | // Generate subtype check. Blows ECX. Resets EDI. Object in EDX. |
duke@435 | 3315 | // Superklass in EAX. Subklass in EBX. |
duke@435 | 3316 | __ gen_subtype_check( rbx, ok_is_subtype ); |
duke@435 | 3317 | |
duke@435 | 3318 | // Come here on failure |
never@739 | 3319 | __ push(rdx); |
duke@435 | 3320 | // object is at TOS |
duke@435 | 3321 | __ jump(ExternalAddress(Interpreter::_throw_ClassCastException_entry)); |
duke@435 | 3322 | |
duke@435 | 3323 | // Come here on success |
duke@435 | 3324 | __ bind(ok_is_subtype); |
never@739 | 3325 | __ mov(rax,rdx); // Restore object in EDX |
duke@435 | 3326 | |
duke@435 | 3327 | // Collect counts on whether this check-cast sees NULLs a lot or not. |
duke@435 | 3328 | if (ProfileInterpreter) { |
duke@435 | 3329 | __ jmp(done); |
duke@435 | 3330 | __ bind(is_null); |
duke@435 | 3331 | __ profile_null_seen(rcx); |
duke@435 | 3332 | } else { |
duke@435 | 3333 | __ bind(is_null); // same as 'done' |
duke@435 | 3334 | } |
duke@435 | 3335 | __ bind(done); |
duke@435 | 3336 | } |
duke@435 | 3337 | |
duke@435 | 3338 | |
duke@435 | 3339 | void TemplateTable::instanceof() { |
duke@435 | 3340 | transition(atos, itos); |
duke@435 | 3341 | Label done, is_null, ok_is_subtype, quicked, resolved; |
never@739 | 3342 | __ testptr(rax, rax); |
duke@435 | 3343 | __ jcc(Assembler::zero, is_null); |
duke@435 | 3344 | |
duke@435 | 3345 | // Get cpool & tags index |
duke@435 | 3346 | __ get_cpool_and_tags(rcx, rdx); // ECX=cpool, EDX=tags array |
duke@435 | 3347 | __ get_unsigned_2_byte_index_at_bcp(rbx, 1); // EBX=index |
duke@435 | 3348 | // See if bytecode has already been quicked |
duke@435 | 3349 | __ cmpb(Address(rdx, rbx, Address::times_1, typeArrayOopDesc::header_size(T_BYTE) * wordSize), JVM_CONSTANT_Class); |
duke@435 | 3350 | __ jcc(Assembler::equal, quicked); |
duke@435 | 3351 | |
duke@435 | 3352 | __ push(atos); |
duke@435 | 3353 | call_VM(rax, CAST_FROM_FN_PTR(address, InterpreterRuntime::quicken_io_cc) ); |
duke@435 | 3354 | __ pop_ptr(rdx); |
never@739 | 3355 | __ movptr(rdx, Address(rdx, oopDesc::klass_offset_in_bytes())); |
duke@435 | 3356 | __ jmp(resolved); |
duke@435 | 3357 | |
duke@435 | 3358 | // Get superklass in EAX and subklass in EDX |
duke@435 | 3359 | __ bind(quicked); |
never@739 | 3360 | __ movptr(rdx, Address(rax, oopDesc::klass_offset_in_bytes())); |
never@739 | 3361 | __ movptr(rax, Address(rcx, rbx, Address::times_ptr, sizeof(constantPoolOopDesc))); |
duke@435 | 3362 | |
duke@435 | 3363 | __ bind(resolved); |
duke@435 | 3364 | |
duke@435 | 3365 | // Generate subtype check. Blows ECX. Resets EDI. |
duke@435 | 3366 | // Superklass in EAX. Subklass in EDX. |
duke@435 | 3367 | __ gen_subtype_check( rdx, ok_is_subtype ); |
duke@435 | 3368 | |
duke@435 | 3369 | // Come here on failure |
duke@435 | 3370 | __ xorl(rax,rax); |
duke@435 | 3371 | __ jmpb(done); |
duke@435 | 3372 | // Come here on success |
duke@435 | 3373 | __ bind(ok_is_subtype); |
duke@435 | 3374 | __ movl(rax, 1); |
duke@435 | 3375 | |
duke@435 | 3376 | // Collect counts on whether this test sees NULLs a lot or not. |
duke@435 | 3377 | if (ProfileInterpreter) { |
duke@435 | 3378 | __ jmp(done); |
duke@435 | 3379 | __ bind(is_null); |
duke@435 | 3380 | __ profile_null_seen(rcx); |
duke@435 | 3381 | } else { |
duke@435 | 3382 | __ bind(is_null); // same as 'done' |
duke@435 | 3383 | } |
duke@435 | 3384 | __ bind(done); |
duke@435 | 3385 | // rax, = 0: obj == NULL or obj is not an instanceof the specified klass |
duke@435 | 3386 | // rax, = 1: obj != NULL and obj is an instanceof the specified klass |
duke@435 | 3387 | } |
duke@435 | 3388 | |
duke@435 | 3389 | |
duke@435 | 3390 | //---------------------------------------------------------------------------------------------------- |
duke@435 | 3391 | // Breakpoints |
duke@435 | 3392 | void TemplateTable::_breakpoint() { |
duke@435 | 3393 | |
duke@435 | 3394 | // Note: We get here even if we are single stepping.. |
duke@435 | 3395 | // jbug inists on setting breakpoints at every bytecode |
duke@435 | 3396 | // even if we are in single step mode. |
duke@435 | 3397 | |
duke@435 | 3398 | transition(vtos, vtos); |
duke@435 | 3399 | |
duke@435 | 3400 | // get the unpatched byte code |
duke@435 | 3401 | __ get_method(rcx); |
duke@435 | 3402 | __ call_VM(noreg, CAST_FROM_FN_PTR(address, InterpreterRuntime::get_original_bytecode_at), rcx, rsi); |
never@739 | 3403 | __ mov(rbx, rax); |
duke@435 | 3404 | |
duke@435 | 3405 | // post the breakpoint event |
duke@435 | 3406 | __ get_method(rcx); |
duke@435 | 3407 | __ call_VM(noreg, CAST_FROM_FN_PTR(address, InterpreterRuntime::_breakpoint), rcx, rsi); |
duke@435 | 3408 | |
duke@435 | 3409 | // complete the execution of original bytecode |
duke@435 | 3410 | __ dispatch_only_normal(vtos); |
duke@435 | 3411 | } |
duke@435 | 3412 | |
duke@435 | 3413 | |
duke@435 | 3414 | //---------------------------------------------------------------------------------------------------- |
duke@435 | 3415 | // Exceptions |
duke@435 | 3416 | |
duke@435 | 3417 | void TemplateTable::athrow() { |
duke@435 | 3418 | transition(atos, vtos); |
duke@435 | 3419 | __ null_check(rax); |
duke@435 | 3420 | __ jump(ExternalAddress(Interpreter::throw_exception_entry())); |
duke@435 | 3421 | } |
duke@435 | 3422 | |
duke@435 | 3423 | |
duke@435 | 3424 | //---------------------------------------------------------------------------------------------------- |
duke@435 | 3425 | // Synchronization |
duke@435 | 3426 | // |
duke@435 | 3427 | // Note: monitorenter & exit are symmetric routines; which is reflected |
duke@435 | 3428 | // in the assembly code structure as well |
duke@435 | 3429 | // |
duke@435 | 3430 | // Stack layout: |
duke@435 | 3431 | // |
duke@435 | 3432 | // [expressions ] <--- rsp = expression stack top |
duke@435 | 3433 | // .. |
duke@435 | 3434 | // [expressions ] |
duke@435 | 3435 | // [monitor entry] <--- monitor block top = expression stack bot |
duke@435 | 3436 | // .. |
duke@435 | 3437 | // [monitor entry] |
duke@435 | 3438 | // [frame data ] <--- monitor block bot |
duke@435 | 3439 | // ... |
duke@435 | 3440 | // [saved rbp, ] <--- rbp, |
duke@435 | 3441 | |
duke@435 | 3442 | |
duke@435 | 3443 | void TemplateTable::monitorenter() { |
duke@435 | 3444 | transition(atos, vtos); |
duke@435 | 3445 | |
duke@435 | 3446 | // check for NULL object |
duke@435 | 3447 | __ null_check(rax); |
duke@435 | 3448 | |
duke@435 | 3449 | const Address monitor_block_top(rbp, frame::interpreter_frame_monitor_block_top_offset * wordSize); |
duke@435 | 3450 | const Address monitor_block_bot(rbp, frame::interpreter_frame_initial_sp_offset * wordSize); |
duke@435 | 3451 | const int entry_size = ( frame::interpreter_frame_monitor_size() * wordSize); |
duke@435 | 3452 | Label allocated; |
duke@435 | 3453 | |
duke@435 | 3454 | // initialize entry pointer |
duke@435 | 3455 | __ xorl(rdx, rdx); // points to free slot or NULL |
duke@435 | 3456 | |
duke@435 | 3457 | // find a free slot in the monitor block (result in rdx) |
duke@435 | 3458 | { Label entry, loop, exit; |
never@739 | 3459 | __ movptr(rcx, monitor_block_top); // points to current entry, starting with top-most entry |
never@739 | 3460 | __ lea(rbx, monitor_block_bot); // points to word before bottom of monitor block |
duke@435 | 3461 | __ jmpb(entry); |
duke@435 | 3462 | |
duke@435 | 3463 | __ bind(loop); |
never@739 | 3464 | __ cmpptr(Address(rcx, BasicObjectLock::obj_offset_in_bytes()), (int32_t)NULL_WORD); // check if current entry is used |
duke@435 | 3465 | |
duke@435 | 3466 | // TODO - need new func here - kbt |
duke@435 | 3467 | if (VM_Version::supports_cmov()) { |
never@739 | 3468 | __ cmov(Assembler::equal, rdx, rcx); // if not used then remember entry in rdx |
duke@435 | 3469 | } else { |
duke@435 | 3470 | Label L; |
duke@435 | 3471 | __ jccb(Assembler::notEqual, L); |
never@739 | 3472 | __ mov(rdx, rcx); // if not used then remember entry in rdx |
duke@435 | 3473 | __ bind(L); |
duke@435 | 3474 | } |
never@739 | 3475 | __ cmpptr(rax, Address(rcx, BasicObjectLock::obj_offset_in_bytes())); // check if current entry is for same object |
never@739 | 3476 | __ jccb(Assembler::equal, exit); // if same object then stop searching |
never@739 | 3477 | __ addptr(rcx, entry_size); // otherwise advance to next entry |
duke@435 | 3478 | __ bind(entry); |
never@739 | 3479 | __ cmpptr(rcx, rbx); // check if bottom reached |
duke@435 | 3480 | __ jcc(Assembler::notEqual, loop); // if not at bottom then check this entry |
duke@435 | 3481 | __ bind(exit); |
duke@435 | 3482 | } |
duke@435 | 3483 | |
never@739 | 3484 | __ testptr(rdx, rdx); // check if a slot has been found |
never@739 | 3485 | __ jccb(Assembler::notZero, allocated); // if found, continue with that one |
duke@435 | 3486 | |
duke@435 | 3487 | // allocate one if there's no free slot |
duke@435 | 3488 | { Label entry, loop; |
duke@435 | 3489 | // 1. compute new pointers // rsp: old expression stack top |
never@739 | 3490 | __ movptr(rdx, monitor_block_bot); // rdx: old expression stack bottom |
never@739 | 3491 | __ subptr(rsp, entry_size); // move expression stack top |
never@739 | 3492 | __ subptr(rdx, entry_size); // move expression stack bottom |
never@739 | 3493 | __ mov(rcx, rsp); // set start value for copy loop |
never@739 | 3494 | __ movptr(monitor_block_bot, rdx); // set new monitor block top |
duke@435 | 3495 | __ jmp(entry); |
duke@435 | 3496 | // 2. move expression stack contents |
duke@435 | 3497 | __ bind(loop); |
never@739 | 3498 | __ movptr(rbx, Address(rcx, entry_size)); // load expression stack word from old location |
never@739 | 3499 | __ movptr(Address(rcx, 0), rbx); // and store it at new location |
never@739 | 3500 | __ addptr(rcx, wordSize); // advance to next word |
duke@435 | 3501 | __ bind(entry); |
never@739 | 3502 | __ cmpptr(rcx, rdx); // check if bottom reached |
duke@435 | 3503 | __ jcc(Assembler::notEqual, loop); // if not at bottom then copy next word |
duke@435 | 3504 | } |
duke@435 | 3505 | |
duke@435 | 3506 | // call run-time routine |
duke@435 | 3507 | // rdx: points to monitor entry |
duke@435 | 3508 | __ bind(allocated); |
duke@435 | 3509 | |
duke@435 | 3510 | // Increment bcp to point to the next bytecode, so exception handling for async. exceptions work correctly. |
duke@435 | 3511 | // The object has already been poped from the stack, so the expression stack looks correct. |
duke@435 | 3512 | __ increment(rsi); |
duke@435 | 3513 | |
never@739 | 3514 | __ movptr(Address(rdx, BasicObjectLock::obj_offset_in_bytes()), rax); // store object |
duke@435 | 3515 | __ lock_object(rdx); |
duke@435 | 3516 | |
duke@435 | 3517 | // check to make sure this monitor doesn't cause stack overflow after locking |
duke@435 | 3518 | __ save_bcp(); // in case of exception |
duke@435 | 3519 | __ generate_stack_overflow_check(0); |
duke@435 | 3520 | |
duke@435 | 3521 | // The bcp has already been incremented. Just need to dispatch to next instruction. |
duke@435 | 3522 | __ dispatch_next(vtos); |
duke@435 | 3523 | } |
duke@435 | 3524 | |
duke@435 | 3525 | |
duke@435 | 3526 | void TemplateTable::monitorexit() { |
duke@435 | 3527 | transition(atos, vtos); |
duke@435 | 3528 | |
duke@435 | 3529 | // check for NULL object |
duke@435 | 3530 | __ null_check(rax); |
duke@435 | 3531 | |
duke@435 | 3532 | const Address monitor_block_top(rbp, frame::interpreter_frame_monitor_block_top_offset * wordSize); |
duke@435 | 3533 | const Address monitor_block_bot(rbp, frame::interpreter_frame_initial_sp_offset * wordSize); |
duke@435 | 3534 | const int entry_size = ( frame::interpreter_frame_monitor_size() * wordSize); |
duke@435 | 3535 | Label found; |
duke@435 | 3536 | |
duke@435 | 3537 | // find matching slot |
duke@435 | 3538 | { Label entry, loop; |
never@739 | 3539 | __ movptr(rdx, monitor_block_top); // points to current entry, starting with top-most entry |
never@739 | 3540 | __ lea(rbx, monitor_block_bot); // points to word before bottom of monitor block |
duke@435 | 3541 | __ jmpb(entry); |
duke@435 | 3542 | |
duke@435 | 3543 | __ bind(loop); |
never@739 | 3544 | __ cmpptr(rax, Address(rdx, BasicObjectLock::obj_offset_in_bytes())); // check if current entry is for same object |
duke@435 | 3545 | __ jcc(Assembler::equal, found); // if same object then stop searching |
never@739 | 3546 | __ addptr(rdx, entry_size); // otherwise advance to next entry |
duke@435 | 3547 | __ bind(entry); |
never@739 | 3548 | __ cmpptr(rdx, rbx); // check if bottom reached |
duke@435 | 3549 | __ jcc(Assembler::notEqual, loop); // if not at bottom then check this entry |
duke@435 | 3550 | } |
duke@435 | 3551 | |
duke@435 | 3552 | // error handling. Unlocking was not block-structured |
duke@435 | 3553 | Label end; |
duke@435 | 3554 | __ call_VM(noreg, CAST_FROM_FN_PTR(address, InterpreterRuntime::throw_illegal_monitor_state_exception)); |
duke@435 | 3555 | __ should_not_reach_here(); |
duke@435 | 3556 | |
duke@435 | 3557 | // call run-time routine |
duke@435 | 3558 | // rcx: points to monitor entry |
duke@435 | 3559 | __ bind(found); |
duke@435 | 3560 | __ push_ptr(rax); // make sure object is on stack (contract with oopMaps) |
duke@435 | 3561 | __ unlock_object(rdx); |
duke@435 | 3562 | __ pop_ptr(rax); // discard object |
duke@435 | 3563 | __ bind(end); |
duke@435 | 3564 | } |
duke@435 | 3565 | |
duke@435 | 3566 | |
duke@435 | 3567 | //---------------------------------------------------------------------------------------------------- |
duke@435 | 3568 | // Wide instructions |
duke@435 | 3569 | |
duke@435 | 3570 | void TemplateTable::wide() { |
duke@435 | 3571 | transition(vtos, vtos); |
duke@435 | 3572 | __ load_unsigned_byte(rbx, at_bcp(1)); |
never@739 | 3573 | ExternalAddress wtable((address)Interpreter::_wentry_point); |
never@739 | 3574 | __ jump(ArrayAddress(wtable, Address(noreg, rbx, Address::times_ptr))); |
duke@435 | 3575 | // Note: the rsi increment step is part of the individual wide bytecode implementations |
duke@435 | 3576 | } |
duke@435 | 3577 | |
duke@435 | 3578 | |
duke@435 | 3579 | //---------------------------------------------------------------------------------------------------- |
duke@435 | 3580 | // Multi arrays |
duke@435 | 3581 | |
duke@435 | 3582 | void TemplateTable::multianewarray() { |
duke@435 | 3583 | transition(vtos, atos); |
duke@435 | 3584 | __ load_unsigned_byte(rax, at_bcp(3)); // get number of dimensions |
duke@435 | 3585 | // last dim is on top of stack; we want address of first one: |
duke@435 | 3586 | // first_addr = last_addr + (ndims - 1) * stackElementSize - 1*wordsize |
duke@435 | 3587 | // the latter wordSize to point to the beginning of the array. |
never@739 | 3588 | __ lea( rax, Address(rsp, rax, Interpreter::stackElementScale(), -wordSize)); |
duke@435 | 3589 | call_VM(rax, CAST_FROM_FN_PTR(address, InterpreterRuntime::multianewarray), rax); // pass in rax, |
duke@435 | 3590 | __ load_unsigned_byte(rbx, at_bcp(3)); |
never@739 | 3591 | __ lea(rsp, Address(rsp, rbx, Interpreter::stackElementScale())); // get rid of counts |
duke@435 | 3592 | } |
duke@435 | 3593 | |
duke@435 | 3594 | #endif /* !CC_INTERP */ |