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