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