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