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