author | shade |
Mon, 06 Nov 2017 18:53:38 +0100 | |
branch | epsilon-gc-branch |
changeset 55767 | 8e22715afabc |
parent 47580 | 96392e113a0a |
child 55934 | 912c55e702d6 |
permissions | -rw-r--r-- |
42065 | 1 |
/* |
46427
54713555867e
8171392: Move Klass pointers outside of ConstantPool entries so ConstantPool can be read-only
iklam
parents:
46280
diff
changeset
|
2 |
* Copyright (c) 2016, 2017, Oracle and/or its affiliates. All rights reserved. |
54713555867e
8171392: Move Klass pointers outside of ConstantPool entries so ConstantPool can be read-only
iklam
parents:
46280
diff
changeset
|
3 |
* Copyright (c) 2016, 2017 SAP SE. All rights reserved. |
42065 | 4 |
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
5 |
* |
|
6 |
* This code is free software; you can redistribute it and/or modify it |
|
7 |
* under the terms of the GNU General Public License version 2 only, as |
|
8 |
* published by the Free Software Foundation. |
|
9 |
* |
|
10 |
* This code is distributed in the hope that it will be useful, but WITHOUT |
|
11 |
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
|
12 |
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
|
13 |
* version 2 for more details (a copy is included in the LICENSE file that |
|
14 |
* accompanied this code). |
|
15 |
* |
|
16 |
* You should have received a copy of the GNU General Public License version |
|
17 |
* 2 along with this work; if not, write to the Free Software Foundation, |
|
18 |
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
|
19 |
* |
|
20 |
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
|
21 |
* or visit www.oracle.com if you need additional information or have any |
|
22 |
* questions. |
|
23 |
* |
|
24 |
*/ |
|
25 |
||
26 |
#include "precompiled.hpp" |
|
27 |
#include "asm/macroAssembler.inline.hpp" |
|
28 |
#include "interpreter/interpreter.hpp" |
|
29 |
#include "interpreter/interpreterRuntime.hpp" |
|
30 |
#include "interpreter/interp_masm.hpp" |
|
31 |
#include "interpreter/templateTable.hpp" |
|
32 |
#include "memory/universe.inline.hpp" |
|
33 |
#include "oops/objArrayKlass.hpp" |
|
34 |
#include "oops/oop.inline.hpp" |
|
35 |
#include "prims/methodHandles.hpp" |
|
36 |
#include "runtime/sharedRuntime.hpp" |
|
37 |
#include "runtime/stubRoutines.hpp" |
|
38 |
#include "runtime/synchronizer.hpp" |
|
39 |
||
40 |
#ifdef PRODUCT |
|
41 |
#define __ _masm-> |
|
42 |
#define BLOCK_COMMENT(str) |
|
43 |
#define BIND(label) __ bind(label); |
|
44 |
#else |
|
45 |
#define __ (PRODUCT_ONLY(false&&)Verbose ? (_masm->block_comment(FILE_AND_LINE),_masm):_masm)-> |
|
46 |
#define BLOCK_COMMENT(str) __ block_comment(str) |
|
47 |
#define BIND(label) __ bind(label); BLOCK_COMMENT(#label ":") |
|
48 |
#endif |
|
49 |
||
50 |
// The assumed minimum size of a BranchTableBlock. |
|
51 |
// The actual size of each block heavily depends on the CPU capabilities and, |
|
52 |
// of course, on the logic implemented in each block. |
|
53 |
#ifdef ASSERT |
|
54 |
#define BTB_MINSIZE 256 |
|
55 |
#else |
|
56 |
#define BTB_MINSIZE 64 |
|
57 |
#endif |
|
58 |
||
59 |
#ifdef ASSERT |
|
60 |
// Macro to open a BranchTableBlock (a piece of code that is branched to by a calculated branch). |
|
61 |
#define BTB_BEGIN(lbl, alignment, name) \ |
|
62 |
__ align_address(alignment); \ |
|
63 |
__ bind(lbl); \ |
|
64 |
{ unsigned int b_off = __ offset(); \ |
|
65 |
uintptr_t b_addr = (uintptr_t)__ pc(); \ |
|
66 |
__ z_larl(Z_R0, (int64_t)0); /* Check current address alignment. */ \ |
|
67 |
__ z_slgr(Z_R0, br_tab); /* Current Address must be equal */ \ |
|
68 |
__ z_slgr(Z_R0, flags); /* to calculated branch target. */ \ |
|
69 |
__ z_brc(Assembler::bcondLogZero, 3); /* skip trap if ok. */ \ |
|
70 |
__ z_illtrap(0x55); \ |
|
71 |
guarantee(b_addr%alignment == 0, "bad alignment at begin of block" name); |
|
72 |
||
73 |
// Macro to close a BranchTableBlock (a piece of code that is branched to by a calculated branch). |
|
74 |
#define BTB_END(lbl, alignment, name) \ |
|
75 |
uintptr_t e_addr = (uintptr_t)__ pc(); \ |
|
76 |
unsigned int e_off = __ offset(); \ |
|
77 |
unsigned int len = e_off-b_off; \ |
|
78 |
if (len > alignment) { \ |
|
79 |
tty->print_cr("%4d of %4d @ " INTPTR_FORMAT ": Block len for %s", \ |
|
80 |
len, alignment, e_addr-len, name); \ |
|
81 |
guarantee(len <= alignment, "block too large"); \ |
|
82 |
} \ |
|
83 |
guarantee(len == e_addr-b_addr, "block len mismatch"); \ |
|
84 |
} |
|
85 |
#else |
|
86 |
// Macro to open a BranchTableBlock (a piece of code that is branched to by a calculated branch). |
|
87 |
#define BTB_BEGIN(lbl, alignment, name) \ |
|
88 |
__ align_address(alignment); \ |
|
89 |
__ bind(lbl); \ |
|
90 |
{ unsigned int b_off = __ offset(); \ |
|
91 |
uintptr_t b_addr = (uintptr_t)__ pc(); \ |
|
92 |
guarantee(b_addr%alignment == 0, "bad alignment at begin of block" name); |
|
93 |
||
94 |
// Macro to close a BranchTableBlock (a piece of code that is branched to by a calculated branch). |
|
95 |
#define BTB_END(lbl, alignment, name) \ |
|
96 |
uintptr_t e_addr = (uintptr_t)__ pc(); \ |
|
97 |
unsigned int e_off = __ offset(); \ |
|
98 |
unsigned int len = e_off-b_off; \ |
|
99 |
if (len > alignment) { \ |
|
100 |
tty->print_cr("%4d of %4d @ " INTPTR_FORMAT ": Block len for %s", \ |
|
101 |
len, alignment, e_addr-len, name); \ |
|
102 |
guarantee(len <= alignment, "block too large"); \ |
|
103 |
} \ |
|
104 |
guarantee(len == e_addr-b_addr, "block len mismatch"); \ |
|
105 |
} |
|
106 |
#endif // ASSERT |
|
107 |
||
108 |
// Platform-dependent initialization. |
|
109 |
||
110 |
void TemplateTable::pd_initialize() { |
|
111 |
// No specific initialization. |
|
112 |
} |
|
113 |
||
114 |
// Address computation: local variables |
|
115 |
||
116 |
static inline Address iaddress(int n) { |
|
117 |
return Address(Z_locals, Interpreter::local_offset_in_bytes(n)); |
|
118 |
} |
|
119 |
||
120 |
static inline Address laddress(int n) { |
|
121 |
return iaddress(n + 1); |
|
122 |
} |
|
123 |
||
124 |
static inline Address faddress(int n) { |
|
125 |
return iaddress(n); |
|
126 |
} |
|
127 |
||
128 |
static inline Address daddress(int n) { |
|
129 |
return laddress(n); |
|
130 |
} |
|
131 |
||
132 |
static inline Address aaddress(int n) { |
|
133 |
return iaddress(n); |
|
134 |
} |
|
135 |
||
136 |
// Pass NULL, if no shift instruction should be emitted. |
|
137 |
static inline Address iaddress(InterpreterMacroAssembler *masm, Register r) { |
|
138 |
if (masm) { |
|
139 |
masm->z_sllg(r, r, LogBytesPerWord); // index2bytes |
|
140 |
} |
|
141 |
return Address(Z_locals, r, Interpreter::local_offset_in_bytes(0)); |
|
142 |
} |
|
143 |
||
144 |
// Pass NULL, if no shift instruction should be emitted. |
|
145 |
static inline Address laddress(InterpreterMacroAssembler *masm, Register r) { |
|
146 |
if (masm) { |
|
147 |
masm->z_sllg(r, r, LogBytesPerWord); // index2bytes |
|
148 |
} |
|
149 |
return Address(Z_locals, r, Interpreter::local_offset_in_bytes(1) ); |
|
150 |
} |
|
151 |
||
152 |
static inline Address faddress(InterpreterMacroAssembler *masm, Register r) { |
|
153 |
return iaddress(masm, r); |
|
154 |
} |
|
155 |
||
156 |
static inline Address daddress(InterpreterMacroAssembler *masm, Register r) { |
|
157 |
return laddress(masm, r); |
|
158 |
} |
|
159 |
||
160 |
static inline Address aaddress(InterpreterMacroAssembler *masm, Register r) { |
|
161 |
return iaddress(masm, r); |
|
162 |
} |
|
163 |
||
164 |
// At top of Java expression stack which may be different than esp(). It |
|
165 |
// isn't for category 1 objects. |
|
166 |
static inline Address at_tos(int slot = 0) { |
|
167 |
return Address(Z_esp, Interpreter::expr_offset_in_bytes(slot)); |
|
168 |
} |
|
169 |
||
170 |
// Condition conversion |
|
171 |
static Assembler::branch_condition j_not(TemplateTable::Condition cc) { |
|
172 |
switch (cc) { |
|
173 |
case TemplateTable::equal : |
|
174 |
return Assembler::bcondNotEqual; |
|
175 |
case TemplateTable::not_equal : |
|
176 |
return Assembler::bcondEqual; |
|
177 |
case TemplateTable::less : |
|
178 |
return Assembler::bcondNotLow; |
|
179 |
case TemplateTable::less_equal : |
|
180 |
return Assembler::bcondHigh; |
|
181 |
case TemplateTable::greater : |
|
182 |
return Assembler::bcondNotHigh; |
|
183 |
case TemplateTable::greater_equal: |
|
184 |
return Assembler::bcondLow; |
|
185 |
} |
|
186 |
ShouldNotReachHere(); |
|
187 |
return Assembler::bcondZero; |
|
188 |
} |
|
189 |
||
190 |
// Do an oop store like *(base + offset) = val |
|
191 |
// offset can be a register or a constant. |
|
192 |
static void do_oop_store(InterpreterMacroAssembler* _masm, |
|
193 |
Register base, |
|
194 |
RegisterOrConstant offset, |
|
195 |
Register val, |
|
196 |
bool val_is_null, // == false does not guarantee that val really is not equal NULL. |
|
197 |
Register tmp1, // If tmp3 is volatile, either tmp1 or tmp2 must be |
|
198 |
Register tmp2, // non-volatile to hold a copy of pre_val across runtime calls. |
|
199 |
Register tmp3, // Ideally, this tmp register is non-volatile, as it is used to |
|
200 |
// hold pre_val (must survive runtime calls). |
|
201 |
BarrierSet::Name barrier, |
|
202 |
bool precise) { |
|
203 |
BLOCK_COMMENT("do_oop_store {"); |
|
204 |
assert(val != noreg, "val must always be valid, even if it is zero"); |
|
205 |
assert_different_registers(tmp1, tmp2, tmp3, val, base, offset.register_or_noreg()); |
|
206 |
__ verify_oop(val); |
|
207 |
switch (barrier) { |
|
208 |
#if INCLUDE_ALL_GCS |
|
209 |
case BarrierSet::G1SATBCTLogging: |
|
210 |
{ |
|
211 |
#ifdef ASSERT |
|
212 |
if (val_is_null) { // Check if the flag setting reflects reality. |
|
213 |
Label OK; |
|
214 |
__ z_ltgr(val, val); |
|
215 |
__ z_bre(OK); |
|
216 |
__ z_illtrap(0x11); |
|
217 |
__ bind(OK); |
|
218 |
} |
|
219 |
#endif |
|
220 |
Register pre_val = tmp3; |
|
221 |
// Load and record the previous value. |
|
222 |
__ g1_write_barrier_pre(base, offset, pre_val, val, |
|
223 |
tmp1, tmp2, |
|
224 |
false); // Needs to hold pre_val in non_volatile register? |
|
225 |
||
226 |
if (val_is_null) { |
|
227 |
__ store_heap_oop_null(val, offset, base); |
|
228 |
} else { |
|
229 |
Label Done; |
|
230 |
// val_is_null == false does not guarantee that val really is not equal NULL. |
|
231 |
// Checking for this case dynamically has some cost, but also some benefit (in GC). |
|
232 |
// It's hard to say if cost or benefit is greater. |
|
233 |
{ Label OK; |
|
234 |
__ z_ltgr(val, val); |
|
235 |
__ z_brne(OK); |
|
236 |
__ store_heap_oop_null(val, offset, base); |
|
237 |
__ z_bru(Done); |
|
238 |
__ bind(OK); |
|
239 |
} |
|
240 |
// G1 barrier needs uncompressed oop for region cross check. |
|
241 |
// Store_heap_oop compresses the oop in the argument register. |
|
242 |
Register val_work = val; |
|
243 |
if (UseCompressedOops) { |
|
244 |
val_work = tmp3; |
|
245 |
__ z_lgr(val_work, val); |
|
246 |
} |
|
247 |
__ store_heap_oop_not_null(val_work, offset, base); |
|
248 |
||
249 |
// We need precise card marks for oop array stores. |
|
250 |
// Otherwise, cardmarking the object which contains the oop is sufficient. |
|
251 |
if (precise && !(offset.is_constant() && offset.as_constant() == 0)) { |
|
252 |
__ add2reg_with_index(base, |
|
253 |
offset.constant_or_zero(), |
|
254 |
offset.register_or_noreg(), |
|
255 |
base); |
|
256 |
} |
|
257 |
__ g1_write_barrier_post(base /* store_adr */, val, tmp1, tmp2, tmp3); |
|
258 |
__ bind(Done); |
|
259 |
} |
|
260 |
} |
|
261 |
break; |
|
262 |
#endif // INCLUDE_ALL_GCS |
|
263 |
case BarrierSet::CardTableForRS: |
|
264 |
case BarrierSet::CardTableExtension: |
|
265 |
{ |
|
266 |
if (val_is_null) { |
|
267 |
__ store_heap_oop_null(val, offset, base); |
|
268 |
} else { |
|
269 |
__ store_heap_oop(val, offset, base); |
|
270 |
// Flatten object address if needed. |
|
271 |
if (precise && ((offset.register_or_noreg() != noreg) || (offset.constant_or_zero() != 0))) { |
|
272 |
__ load_address(base, Address(base, offset.register_or_noreg(), offset.constant_or_zero())); |
|
273 |
} |
|
274 |
__ card_write_barrier_post(base, tmp1); |
|
275 |
} |
|
276 |
} |
|
277 |
break; |
|
55767
8e22715afabc
Initial import of Epsilon sources from jdk10/sandbox
shade
parents:
47580
diff
changeset
|
278 |
case BarrierSet::Epsilon: |
8e22715afabc
Initial import of Epsilon sources from jdk10/sandbox
shade
parents:
47580
diff
changeset
|
279 |
if (val_is_null) { |
8e22715afabc
Initial import of Epsilon sources from jdk10/sandbox
shade
parents:
47580
diff
changeset
|
280 |
__ store_heap_oop_null(val, offset, base); |
8e22715afabc
Initial import of Epsilon sources from jdk10/sandbox
shade
parents:
47580
diff
changeset
|
281 |
} else { |
8e22715afabc
Initial import of Epsilon sources from jdk10/sandbox
shade
parents:
47580
diff
changeset
|
282 |
__ store_heap_oop(val, offset, base); |
8e22715afabc
Initial import of Epsilon sources from jdk10/sandbox
shade
parents:
47580
diff
changeset
|
283 |
} |
8e22715afabc
Initial import of Epsilon sources from jdk10/sandbox
shade
parents:
47580
diff
changeset
|
284 |
break; |
42065 | 285 |
case BarrierSet::ModRef: |
286 |
// fall through |
|
287 |
default: |
|
288 |
ShouldNotReachHere(); |
|
289 |
||
290 |
} |
|
291 |
BLOCK_COMMENT("} do_oop_store"); |
|
292 |
} |
|
293 |
||
294 |
Address TemplateTable::at_bcp(int offset) { |
|
295 |
assert(_desc->uses_bcp(), "inconsistent uses_bcp information"); |
|
296 |
return Address(Z_bcp, offset); |
|
297 |
} |
|
298 |
||
299 |
void TemplateTable::patch_bytecode(Bytecodes::Code bc, |
|
300 |
Register bc_reg, |
|
301 |
Register temp_reg, |
|
302 |
bool load_bc_into_bc_reg, // = true |
|
303 |
int byte_no) { |
|
304 |
if (!RewriteBytecodes) { return; } |
|
305 |
||
306 |
NearLabel L_patch_done; |
|
307 |
BLOCK_COMMENT("patch_bytecode {"); |
|
308 |
||
309 |
switch (bc) { |
|
310 |
case Bytecodes::_fast_aputfield: |
|
311 |
case Bytecodes::_fast_bputfield: |
|
312 |
case Bytecodes::_fast_zputfield: |
|
313 |
case Bytecodes::_fast_cputfield: |
|
314 |
case Bytecodes::_fast_dputfield: |
|
315 |
case Bytecodes::_fast_fputfield: |
|
316 |
case Bytecodes::_fast_iputfield: |
|
317 |
case Bytecodes::_fast_lputfield: |
|
318 |
case Bytecodes::_fast_sputfield: |
|
319 |
{ |
|
320 |
// We skip bytecode quickening for putfield instructions when |
|
321 |
// the put_code written to the constant pool cache is zero. |
|
322 |
// This is required so that every execution of this instruction |
|
323 |
// calls out to InterpreterRuntime::resolve_get_put to do |
|
324 |
// additional, required work. |
|
325 |
assert(byte_no == f1_byte || byte_no == f2_byte, "byte_no out of range"); |
|
326 |
assert(load_bc_into_bc_reg, "we use bc_reg as temp"); |
|
327 |
__ get_cache_and_index_and_bytecode_at_bcp(Z_R1_scratch, bc_reg, |
|
328 |
temp_reg, byte_no, 1); |
|
329 |
__ load_const_optimized(bc_reg, bc); |
|
330 |
__ compareU32_and_branch(temp_reg, (intptr_t)0, |
|
331 |
Assembler::bcondZero, L_patch_done); |
|
332 |
} |
|
333 |
break; |
|
334 |
default: |
|
335 |
assert(byte_no == -1, "sanity"); |
|
336 |
// The pair bytecodes have already done the load. |
|
337 |
if (load_bc_into_bc_reg) { |
|
338 |
__ load_const_optimized(bc_reg, bc); |
|
339 |
} |
|
340 |
break; |
|
341 |
} |
|
342 |
||
343 |
if (JvmtiExport::can_post_breakpoint()) { |
|
344 |
||
345 |
Label L_fast_patch; |
|
346 |
||
347 |
// If a breakpoint is present we can't rewrite the stream directly. |
|
348 |
__ z_cli(at_bcp(0), Bytecodes::_breakpoint); |
|
349 |
__ z_brne(L_fast_patch); |
|
350 |
__ get_method(temp_reg); |
|
351 |
// Let breakpoint table handling rewrite to quicker bytecode. |
|
352 |
__ call_VM_static(noreg, |
|
353 |
CAST_FROM_FN_PTR(address, InterpreterRuntime::set_original_bytecode_at), |
|
354 |
temp_reg, Z_R13, bc_reg); |
|
355 |
__ z_bru(L_patch_done); |
|
356 |
||
357 |
__ bind(L_fast_patch); |
|
358 |
} |
|
359 |
||
360 |
#ifdef ASSERT |
|
361 |
NearLabel L_okay; |
|
362 |
||
363 |
// We load into 64 bits, since this works on any CPU. |
|
364 |
__ z_llgc(temp_reg, at_bcp(0)); |
|
365 |
__ compareU32_and_branch(temp_reg, Bytecodes::java_code(bc), |
|
366 |
Assembler::bcondEqual, L_okay ); |
|
367 |
__ compareU32_and_branch(temp_reg, bc_reg, Assembler::bcondEqual, L_okay); |
|
368 |
__ stop_static("patching the wrong bytecode"); |
|
369 |
__ bind(L_okay); |
|
370 |
#endif |
|
371 |
||
372 |
// Patch bytecode. |
|
373 |
__ z_stc(bc_reg, at_bcp(0)); |
|
374 |
||
375 |
__ bind(L_patch_done); |
|
376 |
BLOCK_COMMENT("} patch_bytecode"); |
|
377 |
} |
|
378 |
||
379 |
// Individual instructions |
|
380 |
||
381 |
void TemplateTable::nop() { |
|
382 |
transition(vtos, vtos); |
|
383 |
} |
|
384 |
||
385 |
void TemplateTable::shouldnotreachhere() { |
|
386 |
transition(vtos, vtos); |
|
387 |
__ stop("shouldnotreachhere bytecode"); |
|
388 |
} |
|
389 |
||
390 |
void TemplateTable::aconst_null() { |
|
391 |
transition(vtos, atos); |
|
392 |
__ clear_reg(Z_tos, true, false); |
|
393 |
} |
|
394 |
||
395 |
void TemplateTable::iconst(int value) { |
|
396 |
transition(vtos, itos); |
|
397 |
// Zero extension of the iconst makes zero extension at runtime obsolete. |
|
398 |
__ load_const_optimized(Z_tos, ((unsigned long)(unsigned int)value)); |
|
399 |
} |
|
400 |
||
401 |
void TemplateTable::lconst(int value) { |
|
402 |
transition(vtos, ltos); |
|
403 |
__ load_const_optimized(Z_tos, value); |
|
404 |
} |
|
405 |
||
406 |
// No pc-relative load/store for floats. |
|
407 |
void TemplateTable::fconst(int value) { |
|
408 |
transition(vtos, ftos); |
|
409 |
static float one = 1.0f, two = 2.0f; |
|
410 |
||
411 |
switch (value) { |
|
412 |
case 0: |
|
413 |
__ z_lzer(Z_ftos); |
|
414 |
return; |
|
415 |
case 1: |
|
416 |
__ load_absolute_address(Z_R1_scratch, (address) &one); |
|
417 |
__ mem2freg_opt(Z_ftos, Address(Z_R1_scratch), false); |
|
418 |
return; |
|
419 |
case 2: |
|
420 |
__ load_absolute_address(Z_R1_scratch, (address) &two); |
|
421 |
__ mem2freg_opt(Z_ftos, Address(Z_R1_scratch), false); |
|
422 |
return; |
|
423 |
default: |
|
424 |
ShouldNotReachHere(); |
|
425 |
return; |
|
426 |
} |
|
427 |
} |
|
428 |
||
429 |
void TemplateTable::dconst(int value) { |
|
430 |
transition(vtos, dtos); |
|
431 |
static double one = 1.0; |
|
432 |
||
433 |
switch (value) { |
|
434 |
case 0: |
|
435 |
__ z_lzdr(Z_ftos); |
|
436 |
return; |
|
437 |
case 1: |
|
438 |
__ load_absolute_address(Z_R1_scratch, (address) &one); |
|
439 |
__ mem2freg_opt(Z_ftos, Address(Z_R1_scratch)); |
|
440 |
return; |
|
441 |
default: |
|
442 |
ShouldNotReachHere(); |
|
443 |
return; |
|
444 |
} |
|
445 |
} |
|
446 |
||
447 |
void TemplateTable::bipush() { |
|
448 |
transition(vtos, itos); |
|
449 |
__ z_lb(Z_tos, at_bcp(1)); |
|
450 |
} |
|
451 |
||
452 |
void TemplateTable::sipush() { |
|
453 |
transition(vtos, itos); |
|
454 |
__ get_2_byte_integer_at_bcp(Z_tos, 1, InterpreterMacroAssembler::Signed); |
|
455 |
} |
|
456 |
||
457 |
||
458 |
void TemplateTable::ldc(bool wide) { |
|
459 |
transition(vtos, vtos); |
|
460 |
Label call_ldc, notFloat, notClass, Done; |
|
461 |
const Register RcpIndex = Z_tmp_1; |
|
462 |
const Register Rtags = Z_ARG2; |
|
463 |
||
464 |
if (wide) { |
|
465 |
__ get_2_byte_integer_at_bcp(RcpIndex, 1, InterpreterMacroAssembler::Unsigned); |
|
466 |
} else { |
|
467 |
__ z_llgc(RcpIndex, at_bcp(1)); |
|
468 |
} |
|
469 |
||
470 |
__ get_cpool_and_tags(Z_tmp_2, Rtags); |
|
471 |
||
472 |
const int base_offset = ConstantPool::header_size() * wordSize; |
|
473 |
const int tags_offset = Array<u1>::base_offset_in_bytes(); |
|
474 |
const Register Raddr_type = Rtags; |
|
475 |
||
476 |
// Get address of type. |
|
477 |
__ add2reg_with_index(Raddr_type, tags_offset, RcpIndex, Rtags); |
|
478 |
||
479 |
__ z_cli(0, Raddr_type, JVM_CONSTANT_UnresolvedClass); |
|
480 |
__ z_bre(call_ldc); // Unresolved class - get the resolved class. |
|
481 |
||
482 |
__ z_cli(0, Raddr_type, JVM_CONSTANT_UnresolvedClassInError); |
|
483 |
__ z_bre(call_ldc); // Unresolved class in error state - call into runtime |
|
484 |
// to throw the error from the first resolution attempt. |
|
485 |
||
486 |
__ z_cli(0, Raddr_type, JVM_CONSTANT_Class); |
|
487 |
__ z_brne(notClass); // Resolved class - need to call vm to get java |
|
488 |
// mirror of the class. |
|
489 |
||
490 |
// We deal with a class. Call vm to do the appropriate. |
|
491 |
__ bind(call_ldc); |
|
492 |
__ load_const_optimized(Z_ARG2, wide); |
|
493 |
call_VM(Z_RET, CAST_FROM_FN_PTR(address, InterpreterRuntime::ldc), Z_ARG2); |
|
494 |
__ push_ptr(Z_RET); |
|
495 |
__ z_bru(Done); |
|
496 |
||
497 |
// Not a class. |
|
498 |
__ bind(notClass); |
|
499 |
Register RcpOffset = RcpIndex; |
|
500 |
__ z_sllg(RcpOffset, RcpIndex, LogBytesPerWord); // Convert index to offset. |
|
501 |
__ z_cli(0, Raddr_type, JVM_CONSTANT_Float); |
|
502 |
__ z_brne(notFloat); |
|
503 |
||
504 |
// ftos |
|
505 |
__ mem2freg_opt(Z_ftos, Address(Z_tmp_2, RcpOffset, base_offset), false); |
|
506 |
__ push_f(); |
|
507 |
__ z_bru(Done); |
|
508 |
||
509 |
__ bind(notFloat); |
|
510 |
#ifdef ASSERT |
|
511 |
{ |
|
512 |
Label L; |
|
513 |
||
514 |
__ z_cli(0, Raddr_type, JVM_CONSTANT_Integer); |
|
515 |
__ z_bre(L); |
|
516 |
// String and Object are rewritten to fast_aldc. |
|
517 |
__ stop("unexpected tag type in ldc"); |
|
518 |
||
519 |
__ bind(L); |
|
520 |
} |
|
521 |
#endif |
|
522 |
||
523 |
// itos |
|
524 |
__ mem2reg_opt(Z_tos, Address(Z_tmp_2, RcpOffset, base_offset), false); |
|
525 |
__ push_i(Z_tos); |
|
526 |
||
527 |
__ bind(Done); |
|
528 |
} |
|
529 |
||
530 |
// Fast path for caching oop constants. |
|
531 |
// %%% We should use this to handle Class and String constants also. |
|
532 |
// %%% It will simplify the ldc/primitive path considerably. |
|
533 |
void TemplateTable::fast_aldc(bool wide) { |
|
534 |
transition(vtos, atos); |
|
535 |
||
536 |
const Register index = Z_tmp_2; |
|
537 |
int index_size = wide ? sizeof(u2) : sizeof(u1); |
|
538 |
Label L_resolved; |
|
539 |
||
540 |
// We are resolved if the resolved reference cache entry contains a |
|
541 |
// non-null object (CallSite, etc.). |
|
542 |
__ get_cache_index_at_bcp(index, 1, index_size); // Load index. |
|
543 |
__ load_resolved_reference_at_index(Z_tos, index); |
|
544 |
__ z_ltgr(Z_tos, Z_tos); |
|
545 |
__ z_brne(L_resolved); |
|
546 |
||
547 |
// First time invocation - must resolve first. |
|
548 |
address entry = CAST_FROM_FN_PTR(address, InterpreterRuntime::resolve_ldc); |
|
549 |
__ load_const_optimized(Z_ARG1, (int)bytecode()); |
|
550 |
__ call_VM(Z_tos, entry, Z_ARG1); |
|
551 |
||
552 |
__ bind(L_resolved); |
|
553 |
__ verify_oop(Z_tos); |
|
554 |
} |
|
555 |
||
556 |
void TemplateTable::ldc2_w() { |
|
557 |
transition(vtos, vtos); |
|
558 |
Label Long, Done; |
|
559 |
||
560 |
// Z_tmp_1 = index of cp entry |
|
561 |
__ get_2_byte_integer_at_bcp(Z_tmp_1, 1, InterpreterMacroAssembler::Unsigned); |
|
562 |
||
563 |
__ get_cpool_and_tags(Z_tmp_2, Z_tos); |
|
564 |
||
565 |
const int base_offset = ConstantPool::header_size() * wordSize; |
|
566 |
const int tags_offset = Array<u1>::base_offset_in_bytes(); |
|
567 |
||
568 |
// Get address of type. |
|
569 |
__ add2reg_with_index(Z_tos, tags_offset, Z_tos, Z_tmp_1); |
|
570 |
||
571 |
// Index needed in both branches, so calculate here. |
|
572 |
__ z_sllg(Z_tmp_1, Z_tmp_1, LogBytesPerWord); // index2bytes |
|
573 |
||
574 |
// Check type. |
|
575 |
__ z_cli(0, Z_tos, JVM_CONSTANT_Double); |
|
576 |
__ z_brne(Long); |
|
577 |
||
578 |
// dtos |
|
579 |
__ mem2freg_opt(Z_ftos, Address(Z_tmp_2, Z_tmp_1, base_offset)); |
|
580 |
__ push_d(); |
|
581 |
__ z_bru(Done); |
|
582 |
||
583 |
__ bind(Long); |
|
584 |
// ltos |
|
585 |
__ mem2reg_opt(Z_tos, Address(Z_tmp_2, Z_tmp_1, base_offset)); |
|
586 |
__ push_l(); |
|
587 |
||
588 |
__ bind(Done); |
|
589 |
} |
|
590 |
||
591 |
void TemplateTable::locals_index(Register reg, int offset) { |
|
592 |
__ z_llgc(reg, at_bcp(offset)); |
|
593 |
__ z_lcgr(reg); |
|
594 |
} |
|
595 |
||
596 |
void TemplateTable::iload() { |
|
597 |
iload_internal(); |
|
598 |
} |
|
599 |
||
600 |
void TemplateTable::nofast_iload() { |
|
601 |
iload_internal(may_not_rewrite); |
|
602 |
} |
|
603 |
||
604 |
void TemplateTable::iload_internal(RewriteControl rc) { |
|
605 |
transition(vtos, itos); |
|
606 |
||
607 |
if (RewriteFrequentPairs && rc == may_rewrite) { |
|
608 |
NearLabel rewrite, done; |
|
609 |
const Register bc = Z_ARG4; |
|
610 |
||
611 |
assert(Z_R1_scratch != bc, "register damaged"); |
|
612 |
||
613 |
// Get next byte. |
|
614 |
__ z_llgc(Z_R1_scratch, at_bcp(Bytecodes::length_for (Bytecodes::_iload))); |
|
615 |
||
616 |
// If _iload, wait to rewrite to iload2. We only want to rewrite the |
|
617 |
// last two iloads in a pair. Comparing against fast_iload means that |
|
618 |
// the next bytecode is neither an iload or a caload, and therefore |
|
619 |
// an iload pair. |
|
620 |
__ compareU32_and_branch(Z_R1_scratch, Bytecodes::_iload, |
|
621 |
Assembler::bcondEqual, done); |
|
622 |
||
623 |
__ load_const_optimized(bc, Bytecodes::_fast_iload2); |
|
624 |
__ compareU32_and_branch(Z_R1_scratch, Bytecodes::_fast_iload, |
|
625 |
Assembler::bcondEqual, rewrite); |
|
626 |
||
627 |
// If _caload, rewrite to fast_icaload. |
|
628 |
__ load_const_optimized(bc, Bytecodes::_fast_icaload); |
|
629 |
__ compareU32_and_branch(Z_R1_scratch, Bytecodes::_caload, |
|
630 |
Assembler::bcondEqual, rewrite); |
|
631 |
||
632 |
// Rewrite so iload doesn't check again. |
|
633 |
__ load_const_optimized(bc, Bytecodes::_fast_iload); |
|
634 |
||
635 |
// rewrite |
|
636 |
// bc: fast bytecode |
|
637 |
__ bind(rewrite); |
|
638 |
patch_bytecode(Bytecodes::_iload, bc, Z_R1_scratch, false); |
|
639 |
||
640 |
__ bind(done); |
|
641 |
||
642 |
} |
|
643 |
||
644 |
// Get the local value into tos. |
|
645 |
locals_index(Z_R1_scratch); |
|
646 |
__ mem2reg_opt(Z_tos, iaddress(_masm, Z_R1_scratch), false); |
|
647 |
} |
|
648 |
||
649 |
void TemplateTable::fast_iload2() { |
|
650 |
transition(vtos, itos); |
|
651 |
||
652 |
locals_index(Z_R1_scratch); |
|
653 |
__ mem2reg_opt(Z_tos, iaddress(_masm, Z_R1_scratch), false); |
|
654 |
__ push_i(Z_tos); |
|
655 |
locals_index(Z_R1_scratch, 3); |
|
656 |
__ mem2reg_opt(Z_tos, iaddress(_masm, Z_R1_scratch), false); |
|
657 |
} |
|
658 |
||
659 |
void TemplateTable::fast_iload() { |
|
660 |
transition(vtos, itos); |
|
661 |
||
662 |
locals_index(Z_R1_scratch); |
|
663 |
__ mem2reg_opt(Z_tos, iaddress(_masm, Z_R1_scratch), false); |
|
664 |
} |
|
665 |
||
666 |
void TemplateTable::lload() { |
|
667 |
transition(vtos, ltos); |
|
668 |
||
669 |
locals_index(Z_R1_scratch); |
|
670 |
__ mem2reg_opt(Z_tos, laddress(_masm, Z_R1_scratch)); |
|
671 |
} |
|
672 |
||
673 |
void TemplateTable::fload() { |
|
674 |
transition(vtos, ftos); |
|
675 |
||
676 |
locals_index(Z_R1_scratch); |
|
677 |
__ mem2freg_opt(Z_ftos, faddress(_masm, Z_R1_scratch), false); |
|
678 |
} |
|
679 |
||
680 |
void TemplateTable::dload() { |
|
681 |
transition(vtos, dtos); |
|
682 |
||
683 |
locals_index(Z_R1_scratch); |
|
684 |
__ mem2freg_opt(Z_ftos, daddress(_masm, Z_R1_scratch)); |
|
685 |
} |
|
686 |
||
687 |
void TemplateTable::aload() { |
|
688 |
transition(vtos, atos); |
|
689 |
||
690 |
locals_index(Z_R1_scratch); |
|
691 |
__ mem2reg_opt(Z_tos, aaddress(_masm, Z_R1_scratch)); |
|
692 |
} |
|
693 |
||
694 |
void TemplateTable::locals_index_wide(Register reg) { |
|
695 |
__ get_2_byte_integer_at_bcp(reg, 2, InterpreterMacroAssembler::Unsigned); |
|
696 |
__ z_lcgr(reg); |
|
697 |
} |
|
698 |
||
699 |
void TemplateTable::wide_iload() { |
|
700 |
transition(vtos, itos); |
|
701 |
||
702 |
locals_index_wide(Z_tmp_1); |
|
703 |
__ mem2reg_opt(Z_tos, iaddress(_masm, Z_tmp_1), false); |
|
704 |
} |
|
705 |
||
706 |
void TemplateTable::wide_lload() { |
|
707 |
transition(vtos, ltos); |
|
708 |
||
709 |
locals_index_wide(Z_tmp_1); |
|
710 |
__ mem2reg_opt(Z_tos, laddress(_masm, Z_tmp_1)); |
|
711 |
} |
|
712 |
||
713 |
void TemplateTable::wide_fload() { |
|
714 |
transition(vtos, ftos); |
|
715 |
||
716 |
locals_index_wide(Z_tmp_1); |
|
717 |
__ mem2freg_opt(Z_ftos, faddress(_masm, Z_tmp_1), false); |
|
718 |
} |
|
719 |
||
720 |
void TemplateTable::wide_dload() { |
|
721 |
transition(vtos, dtos); |
|
722 |
||
723 |
locals_index_wide(Z_tmp_1); |
|
724 |
__ mem2freg_opt(Z_ftos, daddress(_masm, Z_tmp_1)); |
|
725 |
} |
|
726 |
||
727 |
void TemplateTable::wide_aload() { |
|
728 |
transition(vtos, atos); |
|
729 |
||
730 |
locals_index_wide(Z_tmp_1); |
|
731 |
__ mem2reg_opt(Z_tos, aaddress(_masm, Z_tmp_1)); |
|
732 |
} |
|
733 |
||
734 |
void TemplateTable::index_check(Register array, Register index, unsigned int shift) { |
|
735 |
assert_different_registers(Z_R1_scratch, array, index); |
|
736 |
||
737 |
// Check array. |
|
738 |
__ null_check(array, Z_R0_scratch, arrayOopDesc::length_offset_in_bytes()); |
|
739 |
||
740 |
// Sign extend index for use by indexed load. |
|
741 |
__ z_lgfr(index, index); |
|
742 |
||
743 |
// Check index. |
|
744 |
Label index_ok; |
|
745 |
__ z_cl(index, Address(array, arrayOopDesc::length_offset_in_bytes())); |
|
746 |
__ z_brl(index_ok); |
|
747 |
__ lgr_if_needed(Z_ARG3, index); // See generate_ArrayIndexOutOfBounds_handler(). |
|
748 |
// Give back the array to create more detailed exceptions. |
|
749 |
__ lgr_if_needed(Z_ARG2, array); // See generate_ArrayIndexOutOfBounds_handler(). |
|
750 |
__ load_absolute_address(Z_R1_scratch, |
|
751 |
Interpreter::_throw_ArrayIndexOutOfBoundsException_entry); |
|
752 |
__ z_bcr(Assembler::bcondAlways, Z_R1_scratch); |
|
753 |
__ bind(index_ok); |
|
754 |
||
755 |
if (shift > 0) |
|
756 |
__ z_sllg(index, index, shift); |
|
757 |
} |
|
758 |
||
759 |
void TemplateTable::iaload() { |
|
760 |
transition(itos, itos); |
|
761 |
||
762 |
__ pop_ptr(Z_tmp_1); // array |
|
763 |
// Index is in Z_tos. |
|
764 |
Register index = Z_tos; |
|
765 |
index_check(Z_tmp_1, index, LogBytesPerInt); // Kills Z_ARG3. |
|
766 |
// Load the value. |
|
767 |
__ mem2reg_opt(Z_tos, |
|
768 |
Address(Z_tmp_1, index, arrayOopDesc::base_offset_in_bytes(T_INT)), |
|
769 |
false); |
|
770 |
} |
|
771 |
||
772 |
void TemplateTable::laload() { |
|
773 |
transition(itos, ltos); |
|
774 |
||
775 |
__ pop_ptr(Z_tmp_2); |
|
776 |
// Z_tos : index |
|
777 |
// Z_tmp_2 : array |
|
778 |
Register index = Z_tos; |
|
779 |
index_check(Z_tmp_2, index, LogBytesPerLong); |
|
780 |
__ mem2reg_opt(Z_tos, |
|
781 |
Address(Z_tmp_2, index, arrayOopDesc::base_offset_in_bytes(T_LONG))); |
|
782 |
} |
|
783 |
||
784 |
void TemplateTable::faload() { |
|
785 |
transition(itos, ftos); |
|
786 |
||
787 |
__ pop_ptr(Z_tmp_2); |
|
788 |
// Z_tos : index |
|
789 |
// Z_tmp_2 : array |
|
790 |
Register index = Z_tos; |
|
791 |
index_check(Z_tmp_2, index, LogBytesPerInt); |
|
792 |
__ mem2freg_opt(Z_ftos, |
|
793 |
Address(Z_tmp_2, index, arrayOopDesc::base_offset_in_bytes(T_FLOAT)), |
|
794 |
false); |
|
795 |
} |
|
796 |
||
797 |
void TemplateTable::daload() { |
|
798 |
transition(itos, dtos); |
|
799 |
||
800 |
__ pop_ptr(Z_tmp_2); |
|
801 |
// Z_tos : index |
|
802 |
// Z_tmp_2 : array |
|
803 |
Register index = Z_tos; |
|
804 |
index_check(Z_tmp_2, index, LogBytesPerLong); |
|
805 |
__ mem2freg_opt(Z_ftos, |
|
806 |
Address(Z_tmp_2, index, arrayOopDesc::base_offset_in_bytes(T_DOUBLE))); |
|
807 |
} |
|
808 |
||
809 |
void TemplateTable::aaload() { |
|
810 |
transition(itos, atos); |
|
811 |
||
812 |
unsigned const int shift = LogBytesPerHeapOop; |
|
813 |
__ pop_ptr(Z_tmp_1); // array |
|
814 |
// Index is in Z_tos. |
|
815 |
Register index = Z_tos; |
|
816 |
index_check(Z_tmp_1, index, shift); |
|
817 |
// Now load array element. |
|
818 |
__ load_heap_oop(Z_tos, |
|
819 |
Address(Z_tmp_1, index, arrayOopDesc::base_offset_in_bytes(T_OBJECT))); |
|
820 |
__ verify_oop(Z_tos); |
|
821 |
} |
|
822 |
||
823 |
void TemplateTable::baload() { |
|
824 |
transition(itos, itos); |
|
825 |
||
826 |
__ pop_ptr(Z_tmp_1); |
|
827 |
// Z_tos : index |
|
828 |
// Z_tmp_1 : array |
|
829 |
Register index = Z_tos; |
|
830 |
index_check(Z_tmp_1, index, 0); |
|
831 |
__ z_lb(Z_tos, |
|
832 |
Address(Z_tmp_1, index, arrayOopDesc::base_offset_in_bytes(T_BYTE))); |
|
833 |
} |
|
834 |
||
835 |
void TemplateTable::caload() { |
|
836 |
transition(itos, itos); |
|
837 |
||
838 |
__ pop_ptr(Z_tmp_2); |
|
839 |
// Z_tos : index |
|
840 |
// Z_tmp_2 : array |
|
841 |
Register index = Z_tos; |
|
842 |
index_check(Z_tmp_2, index, LogBytesPerShort); |
|
843 |
// Load into 64 bits, works on all CPUs. |
|
844 |
__ z_llgh(Z_tos, |
|
845 |
Address(Z_tmp_2, index, arrayOopDesc::base_offset_in_bytes(T_CHAR))); |
|
846 |
} |
|
847 |
||
848 |
// Iload followed by caload frequent pair. |
|
849 |
void TemplateTable::fast_icaload() { |
|
850 |
transition(vtos, itos); |
|
851 |
||
852 |
// Load index out of locals. |
|
853 |
locals_index(Z_R1_scratch); |
|
854 |
__ mem2reg_opt(Z_ARG3, iaddress(_masm, Z_R1_scratch), false); |
|
855 |
// Z_ARG3 : index |
|
856 |
// Z_tmp_2 : array |
|
857 |
__ pop_ptr(Z_tmp_2); |
|
858 |
index_check(Z_tmp_2, Z_ARG3, LogBytesPerShort); |
|
859 |
// Load into 64 bits, works on all CPUs. |
|
860 |
__ z_llgh(Z_tos, |
|
861 |
Address(Z_tmp_2, Z_ARG3, arrayOopDesc::base_offset_in_bytes(T_CHAR))); |
|
862 |
} |
|
863 |
||
864 |
void TemplateTable::saload() { |
|
865 |
transition(itos, itos); |
|
866 |
||
867 |
__ pop_ptr(Z_tmp_2); |
|
868 |
// Z_tos : index |
|
869 |
// Z_tmp_2 : array |
|
870 |
Register index = Z_tos; |
|
871 |
index_check(Z_tmp_2, index, LogBytesPerShort); |
|
872 |
__ z_lh(Z_tos, |
|
873 |
Address(Z_tmp_2, index, arrayOopDesc::base_offset_in_bytes(T_SHORT))); |
|
874 |
} |
|
875 |
||
876 |
void TemplateTable::iload(int n) { |
|
877 |
transition(vtos, itos); |
|
878 |
__ z_ly(Z_tos, iaddress(n)); |
|
879 |
} |
|
880 |
||
881 |
void TemplateTable::lload(int n) { |
|
882 |
transition(vtos, ltos); |
|
883 |
__ z_lg(Z_tos, laddress(n)); |
|
884 |
} |
|
885 |
||
886 |
void TemplateTable::fload(int n) { |
|
887 |
transition(vtos, ftos); |
|
888 |
__ mem2freg_opt(Z_ftos, faddress(n), false); |
|
889 |
} |
|
890 |
||
891 |
void TemplateTable::dload(int n) { |
|
892 |
transition(vtos, dtos); |
|
893 |
__ mem2freg_opt(Z_ftos, daddress(n)); |
|
894 |
} |
|
895 |
||
896 |
void TemplateTable::aload(int n) { |
|
897 |
transition(vtos, atos); |
|
898 |
__ mem2reg_opt(Z_tos, aaddress(n)); |
|
899 |
} |
|
900 |
||
901 |
void TemplateTable::aload_0() { |
|
902 |
aload_0_internal(); |
|
903 |
} |
|
904 |
||
905 |
void TemplateTable::nofast_aload_0() { |
|
906 |
aload_0_internal(may_not_rewrite); |
|
907 |
} |
|
908 |
||
909 |
void TemplateTable::aload_0_internal(RewriteControl rc) { |
|
910 |
transition(vtos, atos); |
|
911 |
||
912 |
// According to bytecode histograms, the pairs: |
|
913 |
// |
|
914 |
// _aload_0, _fast_igetfield |
|
915 |
// _aload_0, _fast_agetfield |
|
916 |
// _aload_0, _fast_fgetfield |
|
917 |
// |
|
918 |
// occur frequently. If RewriteFrequentPairs is set, the (slow) |
|
919 |
// _aload_0 bytecode checks if the next bytecode is either |
|
920 |
// _fast_igetfield, _fast_agetfield or _fast_fgetfield and then |
|
921 |
// rewrites the current bytecode into a pair bytecode; otherwise it |
|
922 |
// rewrites the current bytecode into _fast_aload_0 that doesn't do |
|
923 |
// the pair check anymore. |
|
924 |
// |
|
925 |
// Note: If the next bytecode is _getfield, the rewrite must be |
|
926 |
// delayed, otherwise we may miss an opportunity for a pair. |
|
927 |
// |
|
928 |
// Also rewrite frequent pairs |
|
929 |
// aload_0, aload_1 |
|
930 |
// aload_0, iload_1 |
|
931 |
// These bytecodes with a small amount of code are most profitable |
|
932 |
// to rewrite. |
|
933 |
if (!(RewriteFrequentPairs && (rc == may_rewrite))) { |
|
934 |
aload(0); |
|
935 |
return; |
|
936 |
} |
|
937 |
||
938 |
NearLabel rewrite, done; |
|
939 |
const Register bc = Z_ARG4; |
|
940 |
||
941 |
assert(Z_R1_scratch != bc, "register damaged"); |
|
942 |
// Get next byte. |
|
943 |
__ z_llgc(Z_R1_scratch, at_bcp(Bytecodes::length_for (Bytecodes::_aload_0))); |
|
944 |
||
945 |
// Do actual aload_0. |
|
946 |
aload(0); |
|
947 |
||
948 |
// If _getfield then wait with rewrite. |
|
949 |
__ compareU32_and_branch(Z_R1_scratch, Bytecodes::_getfield, |
|
950 |
Assembler::bcondEqual, done); |
|
951 |
||
952 |
// If _igetfield then rewrite to _fast_iaccess_0. |
|
953 |
assert(Bytecodes::java_code(Bytecodes::_fast_iaccess_0) |
|
954 |
== Bytecodes::_aload_0, "fix bytecode definition"); |
|
955 |
||
956 |
__ load_const_optimized(bc, Bytecodes::_fast_iaccess_0); |
|
957 |
__ compareU32_and_branch(Z_R1_scratch, Bytecodes::_fast_igetfield, |
|
958 |
Assembler::bcondEqual, rewrite); |
|
959 |
||
960 |
// If _agetfield then rewrite to _fast_aaccess_0. |
|
961 |
assert(Bytecodes::java_code(Bytecodes::_fast_aaccess_0) |
|
962 |
== Bytecodes::_aload_0, "fix bytecode definition"); |
|
963 |
||
964 |
__ load_const_optimized(bc, Bytecodes::_fast_aaccess_0); |
|
965 |
__ compareU32_and_branch(Z_R1_scratch, Bytecodes::_fast_agetfield, |
|
966 |
Assembler::bcondEqual, rewrite); |
|
967 |
||
968 |
// If _fgetfield then rewrite to _fast_faccess_0. |
|
969 |
assert(Bytecodes::java_code(Bytecodes::_fast_faccess_0) |
|
970 |
== Bytecodes::_aload_0, "fix bytecode definition"); |
|
971 |
||
972 |
__ load_const_optimized(bc, Bytecodes::_fast_faccess_0); |
|
973 |
__ compareU32_and_branch(Z_R1_scratch, Bytecodes::_fast_fgetfield, |
|
974 |
Assembler::bcondEqual, rewrite); |
|
975 |
||
976 |
// Else rewrite to _fast_aload0. |
|
977 |
assert(Bytecodes::java_code(Bytecodes::_fast_aload_0) |
|
978 |
== Bytecodes::_aload_0, "fix bytecode definition"); |
|
979 |
__ load_const_optimized(bc, Bytecodes::_fast_aload_0); |
|
980 |
||
981 |
// rewrite |
|
982 |
// bc: fast bytecode |
|
983 |
__ bind(rewrite); |
|
984 |
||
985 |
patch_bytecode(Bytecodes::_aload_0, bc, Z_R1_scratch, false); |
|
986 |
// Reload local 0 because of VM call inside patch_bytecode(). |
|
987 |
// this may trigger GC and thus change the oop. |
|
988 |
aload(0); |
|
989 |
||
990 |
__ bind(done); |
|
991 |
} |
|
992 |
||
993 |
void TemplateTable::istore() { |
|
994 |
transition(itos, vtos); |
|
995 |
locals_index(Z_R1_scratch); |
|
996 |
__ reg2mem_opt(Z_tos, iaddress(_masm, Z_R1_scratch), false); |
|
997 |
} |
|
998 |
||
999 |
void TemplateTable::lstore() { |
|
1000 |
transition(ltos, vtos); |
|
1001 |
locals_index(Z_R1_scratch); |
|
1002 |
__ reg2mem_opt(Z_tos, laddress(_masm, Z_R1_scratch)); |
|
1003 |
} |
|
1004 |
||
1005 |
void TemplateTable::fstore() { |
|
1006 |
transition(ftos, vtos); |
|
1007 |
locals_index(Z_R1_scratch); |
|
1008 |
__ freg2mem_opt(Z_ftos, faddress(_masm, Z_R1_scratch)); |
|
1009 |
} |
|
1010 |
||
1011 |
void TemplateTable::dstore() { |
|
1012 |
transition(dtos, vtos); |
|
1013 |
locals_index(Z_R1_scratch); |
|
1014 |
__ freg2mem_opt(Z_ftos, daddress(_masm, Z_R1_scratch)); |
|
1015 |
} |
|
1016 |
||
1017 |
void TemplateTable::astore() { |
|
1018 |
transition(vtos, vtos); |
|
1019 |
__ pop_ptr(Z_tos); |
|
1020 |
locals_index(Z_R1_scratch); |
|
1021 |
__ reg2mem_opt(Z_tos, aaddress(_masm, Z_R1_scratch)); |
|
1022 |
} |
|
1023 |
||
1024 |
void TemplateTable::wide_istore() { |
|
1025 |
transition(vtos, vtos); |
|
1026 |
__ pop_i(Z_tos); |
|
1027 |
locals_index_wide(Z_tmp_1); |
|
1028 |
__ reg2mem_opt(Z_tos, iaddress(_masm, Z_tmp_1), false); |
|
1029 |
} |
|
1030 |
||
1031 |
void TemplateTable::wide_lstore() { |
|
1032 |
transition(vtos, vtos); |
|
1033 |
__ pop_l(Z_tos); |
|
1034 |
locals_index_wide(Z_tmp_1); |
|
1035 |
__ reg2mem_opt(Z_tos, laddress(_masm, Z_tmp_1)); |
|
1036 |
} |
|
1037 |
||
1038 |
void TemplateTable::wide_fstore() { |
|
1039 |
transition(vtos, vtos); |
|
1040 |
__ pop_f(Z_ftos); |
|
1041 |
locals_index_wide(Z_tmp_1); |
|
1042 |
__ freg2mem_opt(Z_ftos, faddress(_masm, Z_tmp_1), false); |
|
1043 |
} |
|
1044 |
||
1045 |
void TemplateTable::wide_dstore() { |
|
1046 |
transition(vtos, vtos); |
|
1047 |
__ pop_d(Z_ftos); |
|
1048 |
locals_index_wide(Z_tmp_1); |
|
1049 |
__ freg2mem_opt(Z_ftos, daddress(_masm, Z_tmp_1)); |
|
1050 |
} |
|
1051 |
||
1052 |
void TemplateTable::wide_astore() { |
|
1053 |
transition(vtos, vtos); |
|
1054 |
__ pop_ptr(Z_tos); |
|
1055 |
locals_index_wide(Z_tmp_1); |
|
1056 |
__ reg2mem_opt(Z_tos, aaddress(_masm, Z_tmp_1)); |
|
1057 |
} |
|
1058 |
||
1059 |
void TemplateTable::iastore() { |
|
1060 |
transition(itos, vtos); |
|
1061 |
||
1062 |
Register index = Z_ARG3; // Index_check expects index in Z_ARG3. |
|
1063 |
// Value is in Z_tos ... |
|
1064 |
__ pop_i(index); // index |
|
1065 |
__ pop_ptr(Z_tmp_1); // array |
|
1066 |
index_check(Z_tmp_1, index, LogBytesPerInt); |
|
1067 |
// ... and then move the value. |
|
1068 |
__ reg2mem_opt(Z_tos, |
|
1069 |
Address(Z_tmp_1, index, arrayOopDesc::base_offset_in_bytes(T_INT)), |
|
1070 |
false); |
|
1071 |
} |
|
1072 |
||
1073 |
void TemplateTable::lastore() { |
|
1074 |
transition(ltos, vtos); |
|
1075 |
||
1076 |
__ pop_i(Z_ARG3); |
|
1077 |
__ pop_ptr(Z_tmp_2); |
|
1078 |
// Z_tos : value |
|
1079 |
// Z_ARG3 : index |
|
1080 |
// Z_tmp_2 : array |
|
1081 |
index_check(Z_tmp_2, Z_ARG3, LogBytesPerLong); // Prefer index in Z_ARG3. |
|
1082 |
__ reg2mem_opt(Z_tos, |
|
1083 |
Address(Z_tmp_2, Z_ARG3, arrayOopDesc::base_offset_in_bytes(T_LONG))); |
|
1084 |
} |
|
1085 |
||
1086 |
void TemplateTable::fastore() { |
|
1087 |
transition(ftos, vtos); |
|
1088 |
||
1089 |
__ pop_i(Z_ARG3); |
|
1090 |
__ pop_ptr(Z_tmp_2); |
|
1091 |
// Z_ftos : value |
|
1092 |
// Z_ARG3 : index |
|
1093 |
// Z_tmp_2 : array |
|
1094 |
index_check(Z_tmp_2, Z_ARG3, LogBytesPerInt); // Prefer index in Z_ARG3. |
|
1095 |
__ freg2mem_opt(Z_ftos, |
|
1096 |
Address(Z_tmp_2, Z_ARG3, arrayOopDesc::base_offset_in_bytes(T_FLOAT)), |
|
1097 |
false); |
|
1098 |
} |
|
1099 |
||
1100 |
void TemplateTable::dastore() { |
|
1101 |
transition(dtos, vtos); |
|
1102 |
||
1103 |
__ pop_i(Z_ARG3); |
|
1104 |
__ pop_ptr(Z_tmp_2); |
|
1105 |
// Z_ftos : value |
|
1106 |
// Z_ARG3 : index |
|
1107 |
// Z_tmp_2 : array |
|
1108 |
index_check(Z_tmp_2, Z_ARG3, LogBytesPerLong); // Prefer index in Z_ARG3. |
|
1109 |
__ freg2mem_opt(Z_ftos, |
|
1110 |
Address(Z_tmp_2, Z_ARG3, arrayOopDesc::base_offset_in_bytes(T_DOUBLE))); |
|
1111 |
} |
|
1112 |
||
1113 |
void TemplateTable::aastore() { |
|
1114 |
NearLabel is_null, ok_is_subtype, done; |
|
1115 |
transition(vtos, vtos); |
|
1116 |
||
1117 |
// stack: ..., array, index, value |
|
1118 |
||
1119 |
Register Rvalue = Z_tos; |
|
1120 |
Register Rarray = Z_ARG2; |
|
1121 |
Register Rindex = Z_ARG3; // Convention for index_check(). |
|
1122 |
||
1123 |
__ load_ptr(0, Rvalue); |
|
1124 |
__ z_l(Rindex, Address(Z_esp, Interpreter::expr_offset_in_bytes(1))); |
|
1125 |
__ load_ptr(2, Rarray); |
|
1126 |
||
1127 |
unsigned const int shift = LogBytesPerHeapOop; |
|
1128 |
index_check(Rarray, Rindex, shift); // side effect: Rindex = Rindex << shift |
|
1129 |
Register Rstore_addr = Rindex; |
|
1130 |
// Address where the store goes to, i.e. &(Rarry[index]) |
|
1131 |
__ load_address(Rstore_addr, Address(Rarray, Rindex, arrayOopDesc::base_offset_in_bytes(T_OBJECT))); |
|
1132 |
||
1133 |
// do array store check - check for NULL value first. |
|
1134 |
__ compareU64_and_branch(Rvalue, (intptr_t)0, Assembler::bcondEqual, is_null); |
|
1135 |
||
1136 |
Register Rsub_klass = Z_ARG4; |
|
1137 |
Register Rsuper_klass = Z_ARG5; |
|
1138 |
__ load_klass(Rsub_klass, Rvalue); |
|
1139 |
// Load superklass. |
|
1140 |
__ load_klass(Rsuper_klass, Rarray); |
|
1141 |
__ z_lg(Rsuper_klass, Address(Rsuper_klass, ObjArrayKlass::element_klass_offset())); |
|
1142 |
||
1143 |
// Generate a fast subtype check. Branch to ok_is_subtype if no failure. |
|
1144 |
// Throw if failure. |
|
1145 |
Register tmp1 = Z_tmp_1; |
|
1146 |
Register tmp2 = Z_tmp_2; |
|
1147 |
__ gen_subtype_check(Rsub_klass, Rsuper_klass, tmp1, tmp2, ok_is_subtype); |
|
1148 |
||
1149 |
// Fall through on failure. |
|
1150 |
// Object is in Rvalue == Z_tos. |
|
1151 |
assert(Rvalue == Z_tos, "that's the expected location"); |
|
1152 |
__ load_absolute_address(tmp1, Interpreter::_throw_ArrayStoreException_entry); |
|
1153 |
__ z_br(tmp1); |
|
1154 |
||
1155 |
// Come here on success. |
|
1156 |
__ bind(ok_is_subtype); |
|
1157 |
||
1158 |
// Now store using the appropriate barrier. |
|
1159 |
Register tmp3 = Rsub_klass; |
|
1160 |
do_oop_store(_masm, Rstore_addr, (intptr_t)0/*offset*/, Rvalue, false/*val==null*/, |
|
1161 |
tmp3, tmp2, tmp1, _bs->kind(), true); |
|
1162 |
__ z_bru(done); |
|
1163 |
||
1164 |
// Have a NULL in Rvalue. |
|
1165 |
__ bind(is_null); |
|
1166 |
__ profile_null_seen(tmp1); |
|
1167 |
||
1168 |
// Store a NULL. |
|
1169 |
do_oop_store(_masm, Rstore_addr, (intptr_t)0/*offset*/, Rvalue, true/*val==null*/, |
|
1170 |
tmp3, tmp2, tmp1, _bs->kind(), true); |
|
1171 |
||
1172 |
// Pop stack arguments. |
|
1173 |
__ bind(done); |
|
1174 |
__ add2reg(Z_esp, 3 * Interpreter::stackElementSize); |
|
1175 |
} |
|
1176 |
||
1177 |
||
1178 |
void TemplateTable::bastore() { |
|
1179 |
transition(itos, vtos); |
|
1180 |
||
1181 |
__ pop_i(Z_ARG3); |
|
1182 |
__ pop_ptr(Z_tmp_2); |
|
1183 |
// Z_tos : value |
|
1184 |
// Z_ARG3 : index |
|
1185 |
// Z_tmp_2 : array |
|
1186 |
// No index shift necessary - pass 0. |
|
1187 |
index_check(Z_tmp_2, Z_ARG3, 0); // Prefer index in Z_ARG3. |
|
1188 |
__ z_stc(Z_tos, |
|
1189 |
Address(Z_tmp_2, Z_ARG3, arrayOopDesc::base_offset_in_bytes(T_BYTE))); |
|
1190 |
} |
|
1191 |
||
1192 |
void TemplateTable::castore() { |
|
1193 |
transition(itos, vtos); |
|
1194 |
||
1195 |
__ pop_i(Z_ARG3); |
|
1196 |
__ pop_ptr(Z_tmp_2); |
|
1197 |
// Z_tos : value |
|
1198 |
// Z_ARG3 : index |
|
1199 |
// Z_tmp_2 : array |
|
1200 |
Register index = Z_ARG3; // prefer index in Z_ARG3 |
|
1201 |
index_check(Z_tmp_2, index, LogBytesPerShort); |
|
1202 |
__ z_sth(Z_tos, |
|
1203 |
Address(Z_tmp_2, index, arrayOopDesc::base_offset_in_bytes(T_CHAR))); |
|
1204 |
} |
|
1205 |
||
1206 |
void TemplateTable::sastore() { |
|
1207 |
castore(); |
|
1208 |
} |
|
1209 |
||
1210 |
void TemplateTable::istore(int n) { |
|
1211 |
transition(itos, vtos); |
|
1212 |
__ reg2mem_opt(Z_tos, iaddress(n), false); |
|
1213 |
} |
|
1214 |
||
1215 |
void TemplateTable::lstore(int n) { |
|
1216 |
transition(ltos, vtos); |
|
1217 |
__ reg2mem_opt(Z_tos, laddress(n)); |
|
1218 |
} |
|
1219 |
||
1220 |
void TemplateTable::fstore(int n) { |
|
1221 |
transition(ftos, vtos); |
|
1222 |
__ freg2mem_opt(Z_ftos, faddress(n), false); |
|
1223 |
} |
|
1224 |
||
1225 |
void TemplateTable::dstore(int n) { |
|
1226 |
transition(dtos, vtos); |
|
1227 |
__ freg2mem_opt(Z_ftos, daddress(n)); |
|
1228 |
} |
|
1229 |
||
1230 |
void TemplateTable::astore(int n) { |
|
1231 |
transition(vtos, vtos); |
|
1232 |
__ pop_ptr(Z_tos); |
|
1233 |
__ reg2mem_opt(Z_tos, aaddress(n)); |
|
1234 |
} |
|
1235 |
||
1236 |
void TemplateTable::pop() { |
|
1237 |
transition(vtos, vtos); |
|
1238 |
__ add2reg(Z_esp, Interpreter::stackElementSize); |
|
1239 |
} |
|
1240 |
||
1241 |
void TemplateTable::pop2() { |
|
1242 |
transition(vtos, vtos); |
|
1243 |
__ add2reg(Z_esp, 2 * Interpreter::stackElementSize); |
|
1244 |
} |
|
1245 |
||
1246 |
void TemplateTable::dup() { |
|
1247 |
transition(vtos, vtos); |
|
1248 |
__ load_ptr(0, Z_tos); |
|
1249 |
__ push_ptr(Z_tos); |
|
1250 |
// stack: ..., a, a |
|
1251 |
} |
|
1252 |
||
1253 |
void TemplateTable::dup_x1() { |
|
1254 |
transition(vtos, vtos); |
|
1255 |
||
1256 |
// stack: ..., a, b |
|
1257 |
__ load_ptr(0, Z_tos); // load b |
|
1258 |
__ load_ptr(1, Z_R0_scratch); // load a |
|
1259 |
__ store_ptr(1, Z_tos); // store b |
|
1260 |
__ store_ptr(0, Z_R0_scratch); // store a |
|
1261 |
__ push_ptr(Z_tos); // push b |
|
1262 |
// stack: ..., b, a, b |
|
1263 |
} |
|
1264 |
||
1265 |
void TemplateTable::dup_x2() { |
|
1266 |
transition(vtos, vtos); |
|
1267 |
||
1268 |
// stack: ..., a, b, c |
|
1269 |
__ load_ptr(0, Z_R0_scratch); // load c |
|
1270 |
__ load_ptr(2, Z_R1_scratch); // load a |
|
1271 |
__ store_ptr(2, Z_R0_scratch); // store c in a |
|
1272 |
__ push_ptr(Z_R0_scratch); // push c |
|
1273 |
// stack: ..., c, b, c, c |
|
1274 |
__ load_ptr(2, Z_R0_scratch); // load b |
|
1275 |
__ store_ptr(2, Z_R1_scratch); // store a in b |
|
1276 |
// stack: ..., c, a, c, c |
|
1277 |
__ store_ptr(1, Z_R0_scratch); // store b in c |
|
1278 |
// stack: ..., c, a, b, c |
|
1279 |
} |
|
1280 |
||
1281 |
void TemplateTable::dup2() { |
|
1282 |
transition(vtos, vtos); |
|
1283 |
||
1284 |
// stack: ..., a, b |
|
1285 |
__ load_ptr(1, Z_R0_scratch); // load a |
|
1286 |
__ push_ptr(Z_R0_scratch); // push a |
|
1287 |
__ load_ptr(1, Z_R0_scratch); // load b |
|
1288 |
__ push_ptr(Z_R0_scratch); // push b |
|
1289 |
// stack: ..., a, b, a, b |
|
1290 |
} |
|
1291 |
||
1292 |
void TemplateTable::dup2_x1() { |
|
1293 |
transition(vtos, vtos); |
|
1294 |
||
1295 |
// stack: ..., a, b, c |
|
1296 |
__ load_ptr(0, Z_R0_scratch); // load c |
|
1297 |
__ load_ptr(1, Z_R1_scratch); // load b |
|
1298 |
__ push_ptr(Z_R1_scratch); // push b |
|
1299 |
__ push_ptr(Z_R0_scratch); // push c |
|
1300 |
// stack: ..., a, b, c, b, c |
|
1301 |
__ store_ptr(3, Z_R0_scratch); // store c in b |
|
1302 |
// stack: ..., a, c, c, b, c |
|
1303 |
__ load_ptr( 4, Z_R0_scratch); // load a |
|
1304 |
__ store_ptr(2, Z_R0_scratch); // store a in 2nd c |
|
1305 |
// stack: ..., a, c, a, b, c |
|
1306 |
__ store_ptr(4, Z_R1_scratch); // store b in a |
|
1307 |
// stack: ..., b, c, a, b, c |
|
1308 |
} |
|
1309 |
||
1310 |
void TemplateTable::dup2_x2() { |
|
1311 |
transition(vtos, vtos); |
|
1312 |
||
1313 |
// stack: ..., a, b, c, d |
|
1314 |
__ load_ptr(0, Z_R0_scratch); // load d |
|
1315 |
__ load_ptr(1, Z_R1_scratch); // load c |
|
1316 |
__ push_ptr(Z_R1_scratch); // push c |
|
1317 |
__ push_ptr(Z_R0_scratch); // push d |
|
1318 |
// stack: ..., a, b, c, d, c, d |
|
1319 |
__ load_ptr(4, Z_R1_scratch); // load b |
|
1320 |
__ store_ptr(2, Z_R1_scratch); // store b in d |
|
1321 |
__ store_ptr(4, Z_R0_scratch); // store d in b |
|
1322 |
// stack: ..., a, d, c, b, c, d |
|
1323 |
__ load_ptr(5, Z_R0_scratch); // load a |
|
1324 |
__ load_ptr(3, Z_R1_scratch); // load c |
|
1325 |
__ store_ptr(3, Z_R0_scratch); // store a in c |
|
1326 |
__ store_ptr(5, Z_R1_scratch); // store c in a |
|
1327 |
// stack: ..., c, d, a, b, c, d |
|
1328 |
} |
|
1329 |
||
1330 |
void TemplateTable::swap() { |
|
1331 |
transition(vtos, vtos); |
|
1332 |
||
1333 |
// stack: ..., a, b |
|
1334 |
__ load_ptr(1, Z_R0_scratch); // load a |
|
1335 |
__ load_ptr(0, Z_R1_scratch); // load b |
|
1336 |
__ store_ptr(0, Z_R0_scratch); // store a in b |
|
1337 |
__ store_ptr(1, Z_R1_scratch); // store b in a |
|
1338 |
// stack: ..., b, a |
|
1339 |
} |
|
1340 |
||
1341 |
void TemplateTable::iop2(Operation op) { |
|
1342 |
transition(itos, itos); |
|
1343 |
switch (op) { |
|
1344 |
case add : __ z_ay(Z_tos, __ stackTop()); __ pop_i(); break; |
|
1345 |
case sub : __ z_sy(Z_tos, __ stackTop()); __ pop_i(); __ z_lcr(Z_tos, Z_tos); break; |
|
1346 |
case mul : __ z_msy(Z_tos, __ stackTop()); __ pop_i(); break; |
|
1347 |
case _and : __ z_ny(Z_tos, __ stackTop()); __ pop_i(); break; |
|
1348 |
case _or : __ z_oy(Z_tos, __ stackTop()); __ pop_i(); break; |
|
1349 |
case _xor : __ z_xy(Z_tos, __ stackTop()); __ pop_i(); break; |
|
1350 |
case shl : __ z_lr(Z_tmp_1, Z_tos); |
|
1351 |
__ z_nill(Z_tmp_1, 31); // Lowest 5 bits are shiftamount. |
|
1352 |
__ pop_i(Z_tos); __ z_sll(Z_tos, 0, Z_tmp_1); break; |
|
1353 |
case shr : __ z_lr(Z_tmp_1, Z_tos); |
|
1354 |
__ z_nill(Z_tmp_1, 31); // Lowest 5 bits are shiftamount. |
|
1355 |
__ pop_i(Z_tos); __ z_sra(Z_tos, 0, Z_tmp_1); break; |
|
1356 |
case ushr : __ z_lr(Z_tmp_1, Z_tos); |
|
1357 |
__ z_nill(Z_tmp_1, 31); // Lowest 5 bits are shiftamount. |
|
1358 |
__ pop_i(Z_tos); __ z_srl(Z_tos, 0, Z_tmp_1); break; |
|
1359 |
default : ShouldNotReachHere(); break; |
|
1360 |
} |
|
1361 |
return; |
|
1362 |
} |
|
1363 |
||
1364 |
void TemplateTable::lop2(Operation op) { |
|
1365 |
transition(ltos, ltos); |
|
1366 |
||
1367 |
switch (op) { |
|
1368 |
case add : __ z_ag(Z_tos, __ stackTop()); __ pop_l(); break; |
|
1369 |
case sub : __ z_sg(Z_tos, __ stackTop()); __ pop_l(); __ z_lcgr(Z_tos, Z_tos); break; |
|
1370 |
case mul : __ z_msg(Z_tos, __ stackTop()); __ pop_l(); break; |
|
1371 |
case _and : __ z_ng(Z_tos, __ stackTop()); __ pop_l(); break; |
|
1372 |
case _or : __ z_og(Z_tos, __ stackTop()); __ pop_l(); break; |
|
1373 |
case _xor : __ z_xg(Z_tos, __ stackTop()); __ pop_l(); break; |
|
1374 |
default : ShouldNotReachHere(); break; |
|
1375 |
} |
|
1376 |
return; |
|
1377 |
} |
|
1378 |
||
1379 |
// Common part of idiv/irem. |
|
1380 |
static void idiv_helper(InterpreterMacroAssembler * _masm, address exception) { |
|
1381 |
NearLabel not_null; |
|
1382 |
||
1383 |
// Use register pair Z_tmp_1, Z_tmp_2 for DIVIDE SINGLE. |
|
1384 |
assert(Z_tmp_1->successor() == Z_tmp_2, " need even/odd register pair for idiv/irem"); |
|
1385 |
||
1386 |
// Get dividend. |
|
1387 |
__ pop_i(Z_tmp_2); |
|
1388 |
||
1389 |
// If divisor == 0 throw exception. |
|
1390 |
__ compare32_and_branch(Z_tos, (intptr_t) 0, |
|
1391 |
Assembler::bcondNotEqual, not_null ); |
|
1392 |
__ load_absolute_address(Z_R1_scratch, exception); |
|
1393 |
__ z_br(Z_R1_scratch); |
|
1394 |
||
1395 |
__ bind(not_null); |
|
1396 |
||
1397 |
__ z_lgfr(Z_tmp_2, Z_tmp_2); // Sign extend dividend. |
|
1398 |
__ z_dsgfr(Z_tmp_1, Z_tos); // Do it. |
|
1399 |
} |
|
1400 |
||
1401 |
void TemplateTable::idiv() { |
|
1402 |
transition(itos, itos); |
|
1403 |
||
1404 |
idiv_helper(_masm, Interpreter::_throw_ArithmeticException_entry); |
|
1405 |
__ z_llgfr(Z_tos, Z_tmp_2); // Result is in Z_tmp_2. |
|
1406 |
} |
|
1407 |
||
1408 |
void TemplateTable::irem() { |
|
1409 |
transition(itos, itos); |
|
1410 |
||
1411 |
idiv_helper(_masm, Interpreter::_throw_ArithmeticException_entry); |
|
1412 |
__ z_llgfr(Z_tos, Z_tmp_1); // Result is in Z_tmp_1. |
|
1413 |
} |
|
1414 |
||
1415 |
void TemplateTable::lmul() { |
|
1416 |
transition(ltos, ltos); |
|
1417 |
||
1418 |
// Multiply with memory operand. |
|
1419 |
__ z_msg(Z_tos, __ stackTop()); |
|
1420 |
__ pop_l(); // Pop operand. |
|
1421 |
} |
|
1422 |
||
1423 |
// Common part of ldiv/lrem. |
|
1424 |
// |
|
1425 |
// Input: |
|
1426 |
// Z_tos := the divisor (dividend still on stack) |
|
1427 |
// |
|
1428 |
// Updated registers: |
|
1429 |
// Z_tmp_1 := pop_l() % Z_tos ; if is_ldiv == false |
|
1430 |
// Z_tmp_2 := pop_l() / Z_tos ; if is_ldiv == true |
|
1431 |
// |
|
1432 |
static void ldiv_helper(InterpreterMacroAssembler * _masm, address exception, bool is_ldiv) { |
|
1433 |
NearLabel not_null, done; |
|
1434 |
||
1435 |
// Use register pair Z_tmp_1, Z_tmp_2 for DIVIDE SINGLE. |
|
1436 |
assert(Z_tmp_1->successor() == Z_tmp_2, |
|
1437 |
" need even/odd register pair for idiv/irem"); |
|
1438 |
||
1439 |
// Get dividend. |
|
1440 |
__ pop_l(Z_tmp_2); |
|
1441 |
||
1442 |
// If divisor == 0 throw exception. |
|
1443 |
__ compare64_and_branch(Z_tos, (intptr_t)0, Assembler::bcondNotEqual, not_null); |
|
1444 |
__ load_absolute_address(Z_R1_scratch, exception); |
|
1445 |
__ z_br(Z_R1_scratch); |
|
1446 |
||
1447 |
__ bind(not_null); |
|
1448 |
// Special case for dividend == 0x8000 and divisor == -1. |
|
1449 |
if (is_ldiv) { |
|
1450 |
// result := Z_tmp_2 := - dividend |
|
1451 |
__ z_lcgr(Z_tmp_2, Z_tmp_2); |
|
1452 |
} else { |
|
1453 |
// result remainder := Z_tmp_1 := 0 |
|
1454 |
__ clear_reg(Z_tmp_1, true, false); // Don't set CC. |
|
1455 |
} |
|
1456 |
||
1457 |
// if divisor == -1 goto done |
|
1458 |
__ compare64_and_branch(Z_tos, -1, Assembler::bcondEqual, done); |
|
1459 |
if (is_ldiv) |
|
1460 |
// Restore sign, because divisor != -1. |
|
1461 |
__ z_lcgr(Z_tmp_2, Z_tmp_2); |
|
1462 |
__ z_dsgr(Z_tmp_1, Z_tos); // Do it. |
|
1463 |
__ bind(done); |
|
1464 |
} |
|
1465 |
||
1466 |
void TemplateTable::ldiv() { |
|
1467 |
transition(ltos, ltos); |
|
1468 |
||
1469 |
ldiv_helper(_masm, Interpreter::_throw_ArithmeticException_entry, true /*is_ldiv*/); |
|
1470 |
__ z_lgr(Z_tos, Z_tmp_2); // Result is in Z_tmp_2. |
|
1471 |
} |
|
1472 |
||
1473 |
void TemplateTable::lrem() { |
|
1474 |
transition(ltos, ltos); |
|
1475 |
||
1476 |
ldiv_helper(_masm, Interpreter::_throw_ArithmeticException_entry, false /*is_ldiv*/); |
|
1477 |
__ z_lgr(Z_tos, Z_tmp_1); // Result is in Z_tmp_1. |
|
1478 |
} |
|
1479 |
||
1480 |
void TemplateTable::lshl() { |
|
1481 |
transition(itos, ltos); |
|
1482 |
||
1483 |
// Z_tos: shift amount |
|
1484 |
__ pop_l(Z_tmp_1); // Get shift value. |
|
1485 |
__ z_sllg(Z_tos, Z_tmp_1, 0, Z_tos); |
|
1486 |
} |
|
1487 |
||
1488 |
void TemplateTable::lshr() { |
|
1489 |
transition(itos, ltos); |
|
1490 |
||
1491 |
// Z_tos: shift amount |
|
1492 |
__ pop_l(Z_tmp_1); // Get shift value. |
|
1493 |
__ z_srag(Z_tos, Z_tmp_1, 0, Z_tos); |
|
1494 |
} |
|
1495 |
||
1496 |
void TemplateTable::lushr() { |
|
1497 |
transition(itos, ltos); |
|
1498 |
||
1499 |
// Z_tos: shift amount |
|
1500 |
__ pop_l(Z_tmp_1); // Get shift value. |
|
1501 |
__ z_srlg(Z_tos, Z_tmp_1, 0, Z_tos); |
|
1502 |
} |
|
1503 |
||
1504 |
void TemplateTable::fop2(Operation op) { |
|
1505 |
transition(ftos, ftos); |
|
1506 |
||
1507 |
switch (op) { |
|
1508 |
case add: |
|
1509 |
// Add memory operand. |
|
1510 |
__ z_aeb(Z_ftos, __ stackTop()); __ pop_f(); return; |
|
1511 |
case sub: |
|
1512 |
// Sub memory operand. |
|
1513 |
__ z_ler(Z_F1, Z_ftos); // first operand |
|
1514 |
__ pop_f(Z_ftos); // second operand from stack |
|
1515 |
__ z_sebr(Z_ftos, Z_F1); |
|
1516 |
return; |
|
1517 |
case mul: |
|
1518 |
// Multiply with memory operand. |
|
1519 |
__ z_meeb(Z_ftos, __ stackTop()); __ pop_f(); return; |
|
1520 |
case div: |
|
1521 |
__ z_ler(Z_F1, Z_ftos); // first operand |
|
1522 |
__ pop_f(Z_ftos); // second operand from stack |
|
1523 |
__ z_debr(Z_ftos, Z_F1); |
|
1524 |
return; |
|
1525 |
case rem: |
|
1526 |
// Do runtime call. |
|
1527 |
__ z_ler(Z_FARG2, Z_ftos); // divisor |
|
1528 |
__ pop_f(Z_FARG1); // dividend |
|
1529 |
__ call_VM_leaf(CAST_FROM_FN_PTR(address, SharedRuntime::frem)); |
|
1530 |
// Result should be in the right place (Z_ftos == Z_FRET). |
|
1531 |
return; |
|
1532 |
default: |
|
1533 |
ShouldNotReachHere(); |
|
1534 |
return; |
|
1535 |
} |
|
1536 |
} |
|
1537 |
||
1538 |
void TemplateTable::dop2(Operation op) { |
|
1539 |
transition(dtos, dtos); |
|
1540 |
||
1541 |
switch (op) { |
|
1542 |
case add: |
|
1543 |
// Add memory operand. |
|
1544 |
__ z_adb(Z_ftos, __ stackTop()); __ pop_d(); return; |
|
1545 |
case sub: |
|
1546 |
// Sub memory operand. |
|
1547 |
__ z_ldr(Z_F1, Z_ftos); // first operand |
|
1548 |
__ pop_d(Z_ftos); // second operand from stack |
|
1549 |
__ z_sdbr(Z_ftos, Z_F1); |
|
1550 |
return; |
|
1551 |
case mul: |
|
1552 |
// Multiply with memory operand. |
|
1553 |
__ z_mdb(Z_ftos, __ stackTop()); __ pop_d(); return; |
|
1554 |
case div: |
|
1555 |
__ z_ldr(Z_F1, Z_ftos); // first operand |
|
1556 |
__ pop_d(Z_ftos); // second operand from stack |
|
1557 |
__ z_ddbr(Z_ftos, Z_F1); |
|
1558 |
return; |
|
1559 |
case rem: |
|
1560 |
// Do runtime call. |
|
1561 |
__ z_ldr(Z_FARG2, Z_ftos); // divisor |
|
1562 |
__ pop_d(Z_FARG1); // dividend |
|
1563 |
__ call_VM_leaf(CAST_FROM_FN_PTR(address, SharedRuntime::drem)); |
|
1564 |
// Result should be in the right place (Z_ftos == Z_FRET). |
|
1565 |
return; |
|
1566 |
default: |
|
1567 |
ShouldNotReachHere(); |
|
1568 |
return; |
|
1569 |
} |
|
1570 |
} |
|
1571 |
||
1572 |
void TemplateTable::ineg() { |
|
1573 |
transition(itos, itos); |
|
1574 |
__ z_lcr(Z_tos); |
|
1575 |
} |
|
1576 |
||
1577 |
void TemplateTable::lneg() { |
|
1578 |
transition(ltos, ltos); |
|
1579 |
__ z_lcgr(Z_tos); |
|
1580 |
} |
|
1581 |
||
1582 |
void TemplateTable::fneg() { |
|
1583 |
transition(ftos, ftos); |
|
1584 |
__ z_lcebr(Z_ftos, Z_ftos); |
|
1585 |
} |
|
1586 |
||
1587 |
void TemplateTable::dneg() { |
|
1588 |
transition(dtos, dtos); |
|
1589 |
__ z_lcdbr(Z_ftos, Z_ftos); |
|
1590 |
} |
|
1591 |
||
1592 |
void TemplateTable::iinc() { |
|
1593 |
transition(vtos, vtos); |
|
1594 |
||
1595 |
Address local; |
|
1596 |
__ z_lb(Z_R0_scratch, at_bcp(2)); // Get constant. |
|
1597 |
locals_index(Z_R1_scratch); |
|
1598 |
local = iaddress(_masm, Z_R1_scratch); |
|
1599 |
__ z_a(Z_R0_scratch, local); |
|
1600 |
__ reg2mem_opt(Z_R0_scratch, local, false); |
|
1601 |
} |
|
1602 |
||
1603 |
void TemplateTable::wide_iinc() { |
|
1604 |
transition(vtos, vtos); |
|
1605 |
||
1606 |
// Z_tmp_1 := increment |
|
1607 |
__ get_2_byte_integer_at_bcp(Z_tmp_1, 4, InterpreterMacroAssembler::Signed); |
|
1608 |
// Z_R1_scratch := index of local to increment |
|
1609 |
locals_index_wide(Z_tmp_2); |
|
1610 |
// Load, increment, and store. |
|
1611 |
__ access_local_int(Z_tmp_2, Z_tos); |
|
1612 |
__ z_agr(Z_tos, Z_tmp_1); |
|
1613 |
// Shifted index is still in Z_tmp_2. |
|
1614 |
__ reg2mem_opt(Z_tos, Address(Z_locals, Z_tmp_2), false); |
|
1615 |
} |
|
1616 |
||
1617 |
||
1618 |
void TemplateTable::convert() { |
|
1619 |
// Checking |
|
1620 |
#ifdef ASSERT |
|
1621 |
TosState tos_in = ilgl; |
|
1622 |
TosState tos_out = ilgl; |
|
1623 |
||
1624 |
switch (bytecode()) { |
|
1625 |
case Bytecodes::_i2l: |
|
1626 |
case Bytecodes::_i2f: |
|
1627 |
case Bytecodes::_i2d: |
|
1628 |
case Bytecodes::_i2b: |
|
1629 |
case Bytecodes::_i2c: |
|
1630 |
case Bytecodes::_i2s: |
|
1631 |
tos_in = itos; |
|
1632 |
break; |
|
1633 |
case Bytecodes::_l2i: |
|
1634 |
case Bytecodes::_l2f: |
|
1635 |
case Bytecodes::_l2d: |
|
1636 |
tos_in = ltos; |
|
1637 |
break; |
|
1638 |
case Bytecodes::_f2i: |
|
1639 |
case Bytecodes::_f2l: |
|
1640 |
case Bytecodes::_f2d: |
|
1641 |
tos_in = ftos; |
|
1642 |
break; |
|
1643 |
case Bytecodes::_d2i: |
|
1644 |
case Bytecodes::_d2l: |
|
1645 |
case Bytecodes::_d2f: |
|
1646 |
tos_in = dtos; |
|
1647 |
break; |
|
1648 |
default : |
|
1649 |
ShouldNotReachHere(); |
|
1650 |
} |
|
1651 |
switch (bytecode()) { |
|
1652 |
case Bytecodes::_l2i: |
|
1653 |
case Bytecodes::_f2i: |
|
1654 |
case Bytecodes::_d2i: |
|
1655 |
case Bytecodes::_i2b: |
|
1656 |
case Bytecodes::_i2c: |
|
1657 |
case Bytecodes::_i2s: |
|
1658 |
tos_out = itos; |
|
1659 |
break; |
|
1660 |
case Bytecodes::_i2l: |
|
1661 |
case Bytecodes::_f2l: |
|
1662 |
case Bytecodes::_d2l: |
|
1663 |
tos_out = ltos; |
|
1664 |
break; |
|
1665 |
case Bytecodes::_i2f: |
|
1666 |
case Bytecodes::_l2f: |
|
1667 |
case Bytecodes::_d2f: |
|
1668 |
tos_out = ftos; |
|
1669 |
break; |
|
1670 |
case Bytecodes::_i2d: |
|
1671 |
case Bytecodes::_l2d: |
|
1672 |
case Bytecodes::_f2d: |
|
1673 |
tos_out = dtos; |
|
1674 |
break; |
|
1675 |
default : |
|
1676 |
ShouldNotReachHere(); |
|
1677 |
} |
|
1678 |
||
1679 |
transition(tos_in, tos_out); |
|
1680 |
#endif // ASSERT |
|
1681 |
||
1682 |
// Conversion |
|
1683 |
Label done; |
|
1684 |
switch (bytecode()) { |
|
1685 |
case Bytecodes::_i2l: |
|
1686 |
__ z_lgfr(Z_tos, Z_tos); |
|
1687 |
return; |
|
1688 |
case Bytecodes::_i2f: |
|
1689 |
__ z_cefbr(Z_ftos, Z_tos); |
|
1690 |
return; |
|
1691 |
case Bytecodes::_i2d: |
|
1692 |
__ z_cdfbr(Z_ftos, Z_tos); |
|
1693 |
return; |
|
1694 |
case Bytecodes::_i2b: |
|
1695 |
// Sign extend least significant byte. |
|
1696 |
__ move_reg_if_needed(Z_tos, T_BYTE, Z_tos, T_INT); |
|
1697 |
return; |
|
1698 |
case Bytecodes::_i2c: |
|
1699 |
// Zero extend 2 least significant bytes. |
|
1700 |
__ move_reg_if_needed(Z_tos, T_CHAR, Z_tos, T_INT); |
|
1701 |
return; |
|
1702 |
case Bytecodes::_i2s: |
|
1703 |
// Sign extend 2 least significant bytes. |
|
1704 |
__ move_reg_if_needed(Z_tos, T_SHORT, Z_tos, T_INT); |
|
1705 |
return; |
|
1706 |
case Bytecodes::_l2i: |
|
1707 |
// Sign-extend not needed here, upper 4 bytes of int value in register are ignored. |
|
1708 |
return; |
|
1709 |
case Bytecodes::_l2f: |
|
1710 |
__ z_cegbr(Z_ftos, Z_tos); |
|
1711 |
return; |
|
1712 |
case Bytecodes::_l2d: |
|
1713 |
__ z_cdgbr(Z_ftos, Z_tos); |
|
1714 |
return; |
|
1715 |
case Bytecodes::_f2i: |
|
1716 |
case Bytecodes::_f2l: |
|
1717 |
__ clear_reg(Z_tos, true, false); // Don't set CC. |
|
1718 |
__ z_cebr(Z_ftos, Z_ftos); |
|
1719 |
__ z_brno(done); // NaN -> 0 |
|
1720 |
if (bytecode() == Bytecodes::_f2i) |
|
1721 |
__ z_cfebr(Z_tos, Z_ftos, Assembler::to_zero); |
|
1722 |
else // bytecode() == Bytecodes::_f2l |
|
1723 |
__ z_cgebr(Z_tos, Z_ftos, Assembler::to_zero); |
|
1724 |
break; |
|
1725 |
case Bytecodes::_f2d: |
|
1726 |
__ move_freg_if_needed(Z_ftos, T_DOUBLE, Z_ftos, T_FLOAT); |
|
1727 |
return; |
|
1728 |
case Bytecodes::_d2i: |
|
1729 |
case Bytecodes::_d2l: |
|
1730 |
__ clear_reg(Z_tos, true, false); // Ddon't set CC. |
|
1731 |
__ z_cdbr(Z_ftos, Z_ftos); |
|
1732 |
__ z_brno(done); // NaN -> 0 |
|
1733 |
if (bytecode() == Bytecodes::_d2i) |
|
1734 |
__ z_cfdbr(Z_tos, Z_ftos, Assembler::to_zero); |
|
1735 |
else // Bytecodes::_d2l |
|
1736 |
__ z_cgdbr(Z_tos, Z_ftos, Assembler::to_zero); |
|
1737 |
break; |
|
1738 |
case Bytecodes::_d2f: |
|
1739 |
__ move_freg_if_needed(Z_ftos, T_FLOAT, Z_ftos, T_DOUBLE); |
|
1740 |
return; |
|
1741 |
default: |
|
1742 |
ShouldNotReachHere(); |
|
1743 |
} |
|
1744 |
__ bind(done); |
|
1745 |
} |
|
1746 |
||
1747 |
void TemplateTable::lcmp() { |
|
1748 |
transition(ltos, itos); |
|
1749 |
||
1750 |
Label done; |
|
1751 |
Register val1 = Z_R0_scratch; |
|
1752 |
Register val2 = Z_R1_scratch; |
|
1753 |
||
1754 |
if (VM_Version::has_LoadStoreConditional()) { |
|
1755 |
__ pop_l(val1); // pop value 1. |
|
1756 |
__ z_lghi(val2, -1); // lt value |
|
1757 |
__ z_cgr(val1, Z_tos); // Compare with Z_tos (value 2). Protect CC under all circumstances. |
|
1758 |
__ z_lghi(val1, 1); // gt value |
|
1759 |
__ z_lghi(Z_tos, 0); // eq value |
|
1760 |
||
1761 |
__ z_locgr(Z_tos, val1, Assembler::bcondHigh); |
|
1762 |
__ z_locgr(Z_tos, val2, Assembler::bcondLow); |
|
1763 |
} else { |
|
1764 |
__ pop_l(val1); // Pop value 1. |
|
1765 |
__ z_cgr(val1, Z_tos); // Compare with Z_tos (value 2). Protect CC under all circumstances. |
|
1766 |
||
1767 |
__ z_lghi(Z_tos, 0); // eq value |
|
1768 |
__ z_bre(done); |
|
1769 |
||
1770 |
__ z_lghi(Z_tos, 1); // gt value |
|
1771 |
__ z_brh(done); |
|
1772 |
||
1773 |
__ z_lghi(Z_tos, -1); // lt value |
|
1774 |
} |
|
1775 |
||
1776 |
__ bind(done); |
|
1777 |
} |
|
1778 |
||
1779 |
||
1780 |
void TemplateTable::float_cmp(bool is_float, int unordered_result) { |
|
1781 |
Label done; |
|
1782 |
||
1783 |
if (is_float) { |
|
1784 |
__ pop_f(Z_FARG2); |
|
1785 |
__ z_cebr(Z_FARG2, Z_ftos); |
|
1786 |
} else { |
|
1787 |
__ pop_d(Z_FARG2); |
|
1788 |
__ z_cdbr(Z_FARG2, Z_ftos); |
|
1789 |
} |
|
1790 |
||
1791 |
if (VM_Version::has_LoadStoreConditional()) { |
|
1792 |
Register one = Z_R0_scratch; |
|
1793 |
Register minus_one = Z_R1_scratch; |
|
1794 |
__ z_lghi(minus_one, -1); |
|
1795 |
__ z_lghi(one, 1); |
|
1796 |
__ z_lghi(Z_tos, 0); |
|
1797 |
__ z_locgr(Z_tos, one, unordered_result == 1 ? Assembler::bcondHighOrNotOrdered : Assembler::bcondHigh); |
|
1798 |
__ z_locgr(Z_tos, minus_one, unordered_result == 1 ? Assembler::bcondLow : Assembler::bcondLowOrNotOrdered); |
|
1799 |
} else { |
|
1800 |
// Z_FARG2 == Z_ftos |
|
1801 |
__ clear_reg(Z_tos, false, false); |
|
1802 |
__ z_bre(done); |
|
1803 |
||
1804 |
// F_ARG2 > Z_Ftos, or unordered |
|
1805 |
__ z_lhi(Z_tos, 1); |
|
1806 |
__ z_brc(unordered_result == 1 ? Assembler::bcondHighOrNotOrdered : Assembler::bcondHigh, done); |
|
1807 |
||
1808 |
// F_ARG2 < Z_FTOS, or unordered |
|
1809 |
__ z_lhi(Z_tos, -1); |
|
1810 |
||
1811 |
__ bind(done); |
|
1812 |
} |
|
1813 |
} |
|
1814 |
||
1815 |
void TemplateTable::branch(bool is_jsr, bool is_wide) { |
|
1816 |
const Register bumped_count = Z_tmp_1; |
|
1817 |
const Register method = Z_tmp_2; |
|
1818 |
const Register m_counters = Z_R1_scratch; |
|
1819 |
const Register mdo = Z_tos; |
|
1820 |
||
1821 |
BLOCK_COMMENT("TemplateTable::branch {"); |
|
1822 |
__ get_method(method); |
|
1823 |
__ profile_taken_branch(mdo, bumped_count); |
|
1824 |
||
1825 |
const ByteSize ctr_offset = InvocationCounter::counter_offset(); |
|
1826 |
const ByteSize be_offset = MethodCounters::backedge_counter_offset() + ctr_offset; |
|
1827 |
const ByteSize inv_offset = MethodCounters::invocation_counter_offset() + ctr_offset; |
|
1828 |
||
1829 |
// Get (wide) offset to disp. |
|
1830 |
const Register disp = Z_ARG5; |
|
1831 |
if (is_wide) { |
|
1832 |
__ get_4_byte_integer_at_bcp(disp, 1); |
|
1833 |
} else { |
|
1834 |
__ get_2_byte_integer_at_bcp(disp, 1, InterpreterMacroAssembler::Signed); |
|
1835 |
} |
|
1836 |
||
1837 |
// Handle all the JSR stuff here, then exit. |
|
1838 |
// It's much shorter and cleaner than intermingling with the |
|
1839 |
// non-JSR normal-branch stuff occurring below. |
|
1840 |
if (is_jsr) { |
|
1841 |
// Compute return address as bci in Z_tos. |
|
1842 |
__ z_lgr(Z_R1_scratch, Z_bcp); |
|
1843 |
__ z_sg(Z_R1_scratch, Address(method, Method::const_offset())); |
|
1844 |
__ add2reg(Z_tos, (is_wide ? 5 : 3) - in_bytes(ConstMethod::codes_offset()), Z_R1_scratch); |
|
1845 |
||
1846 |
// Bump bcp to target of JSR. |
|
1847 |
__ z_agr(Z_bcp, disp); |
|
1848 |
// Push return address for "ret" on stack. |
|
1849 |
__ push_ptr(Z_tos); |
|
1850 |
// And away we go! |
|
1851 |
__ dispatch_next(vtos); |
|
1852 |
return; |
|
1853 |
} |
|
1854 |
||
1855 |
// Normal (non-jsr) branch handling. |
|
1856 |
||
1857 |
// Bump bytecode pointer by displacement (take the branch). |
|
1858 |
__ z_agr(Z_bcp, disp); |
|
1859 |
||
1860 |
assert(UseLoopCounter || !UseOnStackReplacement, |
|
1861 |
"on-stack-replacement requires loop counters"); |
|
1862 |
||
1863 |
NearLabel backedge_counter_overflow; |
|
1864 |
NearLabel profile_method; |
|
1865 |
NearLabel dispatch; |
|
1866 |
int increment = InvocationCounter::count_increment; |
|
1867 |
||
1868 |
if (UseLoopCounter) { |
|
1869 |
// Increment backedge counter for backward branches. |
|
1870 |
// disp: target offset |
|
1871 |
// Z_bcp: target bcp |
|
1872 |
// Z_locals: locals pointer |
|
1873 |
// |
|
1874 |
// Count only if backward branch. |
|
1875 |
__ compare32_and_branch(disp, (intptr_t)0, Assembler::bcondHigh, dispatch); |
|
1876 |
||
1877 |
if (TieredCompilation) { |
|
1878 |
Label noCounters; |
|
1879 |
||
1880 |
if (ProfileInterpreter) { |
|
1881 |
NearLabel no_mdo; |
|
1882 |
||
1883 |
// Are we profiling? |
|
1884 |
__ load_and_test_long(mdo, Address(method, Method::method_data_offset())); |
|
1885 |
__ branch_optimized(Assembler::bcondZero, no_mdo); |
|
1886 |
||
1887 |
// Increment the MDO backedge counter. |
|
1888 |
const Address mdo_backedge_counter(mdo, MethodData::backedge_counter_offset() + InvocationCounter::counter_offset()); |
|
1889 |
||
1890 |
const Address mask(mdo, MethodData::backedge_mask_offset()); |
|
1891 |
__ increment_mask_and_jump(mdo_backedge_counter, increment, mask, |
|
1892 |
Z_ARG2, false, Assembler::bcondZero, |
|
1893 |
UseOnStackReplacement ? &backedge_counter_overflow : NULL); |
|
1894 |
__ z_bru(dispatch); |
|
1895 |
__ bind(no_mdo); |
|
1896 |
} |
|
1897 |
||
1898 |
// Increment backedge counter in MethodCounters*. |
|
1899 |
__ get_method_counters(method, m_counters, noCounters); |
|
1900 |
const Address mask(m_counters, MethodCounters::backedge_mask_offset()); |
|
1901 |
__ increment_mask_and_jump(Address(m_counters, be_offset), |
|
1902 |
increment, mask, |
|
1903 |
Z_ARG2, false, Assembler::bcondZero, |
|
1904 |
UseOnStackReplacement ? &backedge_counter_overflow : NULL); |
|
1905 |
__ bind(noCounters); |
|
1906 |
} else { |
|
1907 |
Register counter = Z_tos; |
|
1908 |
Label noCounters; |
|
1909 |
// Get address of MethodCounters object. |
|
1910 |
__ get_method_counters(method, m_counters, noCounters); |
|
1911 |
// Increment backedge counter. |
|
1912 |
__ increment_backedge_counter(m_counters, counter); |
|
1913 |
||
1914 |
if (ProfileInterpreter) { |
|
1915 |
// Test to see if we should create a method data obj. |
|
1916 |
__ z_cl(counter, Address(m_counters, MethodCounters::interpreter_profile_limit_offset())); |
|
1917 |
__ z_brl(dispatch); |
|
1918 |
||
1919 |
// If no method data exists, go to profile method. |
|
1920 |
__ test_method_data_pointer(Z_ARG4/*result unused*/, profile_method); |
|
1921 |
||
1922 |
if (UseOnStackReplacement) { |
|
1923 |
// Check for overflow against 'bumped_count' which is the MDO taken count. |
|
1924 |
__ z_cl(bumped_count, Address(m_counters, MethodCounters::interpreter_backward_branch_limit_offset())); |
|
1925 |
__ z_brl(dispatch); |
|
1926 |
||
1927 |
// When ProfileInterpreter is on, the backedge_count comes |
|
1928 |
// from the methodDataOop, which value does not get reset on |
|
1929 |
// the call to frequency_counter_overflow(). To avoid |
|
1930 |
// excessive calls to the overflow routine while the method is |
|
1931 |
// being compiled, add a second test to make sure the overflow |
|
1932 |
// function is called only once every overflow_frequency. |
|
1933 |
const int overflow_frequency = 1024; |
|
1934 |
__ and_imm(bumped_count, overflow_frequency - 1); |
|
1935 |
__ z_brz(backedge_counter_overflow); |
|
1936 |
||
1937 |
} |
|
1938 |
} else { |
|
1939 |
if (UseOnStackReplacement) { |
|
1940 |
// Check for overflow against 'counter', which is the sum of the |
|
1941 |
// counters. |
|
1942 |
__ z_cl(counter, Address(m_counters, MethodCounters::interpreter_backward_branch_limit_offset())); |
|
1943 |
__ z_brh(backedge_counter_overflow); |
|
1944 |
} |
|
1945 |
} |
|
1946 |
__ bind(noCounters); |
|
1947 |
} |
|
1948 |
||
1949 |
__ bind(dispatch); |
|
1950 |
} |
|
1951 |
||
1952 |
// Pre-load the next target bytecode into rbx. |
|
1953 |
__ z_llgc(Z_bytecode, Address(Z_bcp, (intptr_t) 0)); |
|
1954 |
||
1955 |
// Continue with the bytecode @ target. |
|
1956 |
// Z_tos: Return bci for jsr's, unused otherwise. |
|
1957 |
// Z_bytecode: target bytecode |
|
1958 |
// Z_bcp: target bcp |
|
1959 |
__ dispatch_only(vtos); |
|
1960 |
||
1961 |
// Out-of-line code runtime calls. |
|
1962 |
if (UseLoopCounter) { |
|
1963 |
if (ProfileInterpreter) { |
|
1964 |
// Out-of-line code to allocate method data oop. |
|
1965 |
__ bind(profile_method); |
|
1966 |
||
1967 |
__ call_VM(noreg, |
|
1968 |
CAST_FROM_FN_PTR(address, InterpreterRuntime::profile_method)); |
|
1969 |
__ z_llgc(Z_bytecode, Address(Z_bcp, (intptr_t) 0)); // Restore target bytecode. |
|
1970 |
__ set_method_data_pointer_for_bcp(); |
|
1971 |
__ z_bru(dispatch); |
|
1972 |
} |
|
1973 |
||
1974 |
if (UseOnStackReplacement) { |
|
1975 |
||
1976 |
// invocation counter overflow |
|
1977 |
__ bind(backedge_counter_overflow); |
|
1978 |
||
1979 |
__ z_lcgr(Z_ARG2, disp); // Z_ARG2 := -disp |
|
1980 |
__ z_agr(Z_ARG2, Z_bcp); // Z_ARG2 := branch target bcp - disp == branch bcp |
|
1981 |
__ call_VM(noreg, |
|
1982 |
CAST_FROM_FN_PTR(address, InterpreterRuntime::frequency_counter_overflow), |
|
1983 |
Z_ARG2); |
|
1984 |
||
1985 |
// Z_RET: osr nmethod (osr ok) or NULL (osr not possible). |
|
1986 |
__ compare64_and_branch(Z_RET, (intptr_t) 0, Assembler::bcondEqual, dispatch); |
|
1987 |
||
1988 |
// Nmethod may have been invalidated (VM may block upon call_VM return). |
|
1989 |
__ z_cliy(nmethod::state_offset(), Z_RET, nmethod::in_use); |
|
1990 |
__ z_brne(dispatch); |
|
1991 |
||
1992 |
// Migrate the interpreter frame off of the stack. |
|
1993 |
||
1994 |
__ z_lgr(Z_tmp_1, Z_RET); // Save the nmethod. |
|
1995 |
||
1996 |
call_VM(noreg, |
|
1997 |
CAST_FROM_FN_PTR(address, SharedRuntime::OSR_migration_begin)); |
|
1998 |
||
1999 |
// Z_RET is OSR buffer, move it to expected parameter location. |
|
2000 |
__ lgr_if_needed(Z_ARG1, Z_RET); |
|
2001 |
||
2002 |
// Pop the interpreter frame ... |
|
2003 |
__ pop_interpreter_frame(Z_R14, Z_ARG2/*tmp1*/, Z_ARG3/*tmp2*/); |
|
2004 |
||
2005 |
// ... and begin the OSR nmethod. |
|
2006 |
__ z_lg(Z_R1_scratch, Address(Z_tmp_1, nmethod::osr_entry_point_offset())); |
|
2007 |
__ z_br(Z_R1_scratch); |
|
2008 |
} |
|
2009 |
} |
|
2010 |
BLOCK_COMMENT("} TemplateTable::branch"); |
|
2011 |
} |
|
2012 |
||
2013 |
void TemplateTable::if_0cmp(Condition cc) { |
|
2014 |
transition(itos, vtos); |
|
2015 |
||
2016 |
// Assume branch is more often taken than not (loops use backward branches). |
|
2017 |
NearLabel not_taken; |
|
2018 |
__ compare32_and_branch(Z_tos, (intptr_t) 0, j_not(cc), not_taken); |
|
2019 |
branch(false, false); |
|
2020 |
__ bind(not_taken); |
|
2021 |
__ profile_not_taken_branch(Z_tos); |
|
2022 |
} |
|
2023 |
||
2024 |
void TemplateTable::if_icmp(Condition cc) { |
|
2025 |
transition(itos, vtos); |
|
2026 |
||
2027 |
// Assume branch is more often taken than not (loops use backward branches). |
|
2028 |
NearLabel not_taken; |
|
2029 |
__ pop_i(Z_R0_scratch); |
|
2030 |
__ compare32_and_branch(Z_R0_scratch, Z_tos, j_not(cc), not_taken); |
|
2031 |
branch(false, false); |
|
2032 |
__ bind(not_taken); |
|
2033 |
__ profile_not_taken_branch(Z_tos); |
|
2034 |
} |
|
2035 |
||
2036 |
void TemplateTable::if_nullcmp(Condition cc) { |
|
2037 |
transition(atos, vtos); |
|
2038 |
||
2039 |
// Assume branch is more often taken than not (loops use backward branches) . |
|
2040 |
NearLabel not_taken; |
|
2041 |
__ compare64_and_branch(Z_tos, (intptr_t) 0, j_not(cc), not_taken); |
|
2042 |
branch(false, false); |
|
2043 |
__ bind(not_taken); |
|
2044 |
__ profile_not_taken_branch(Z_tos); |
|
2045 |
} |
|
2046 |
||
2047 |
void TemplateTable::if_acmp(Condition cc) { |
|
2048 |
transition(atos, vtos); |
|
2049 |
// Assume branch is more often taken than not (loops use backward branches). |
|
2050 |
NearLabel not_taken; |
|
2051 |
__ pop_ptr(Z_ARG2); |
|
2052 |
__ verify_oop(Z_ARG2); |
|
2053 |
__ verify_oop(Z_tos); |
|
2054 |
__ compareU64_and_branch(Z_tos, Z_ARG2, j_not(cc), not_taken); |
|
2055 |
branch(false, false); |
|
2056 |
__ bind(not_taken); |
|
2057 |
__ profile_not_taken_branch(Z_ARG3); |
|
2058 |
} |
|
2059 |
||
2060 |
void TemplateTable::ret() { |
|
2061 |
transition(vtos, vtos); |
|
2062 |
||
2063 |
locals_index(Z_tmp_1); |
|
2064 |
// Get return bci, compute return bcp. Must load 64 bits. |
|
2065 |
__ mem2reg_opt(Z_tmp_1, iaddress(_masm, Z_tmp_1)); |
|
2066 |
__ profile_ret(Z_tmp_1, Z_tmp_2); |
|
2067 |
__ get_method(Z_tos); |
|
2068 |
__ mem2reg_opt(Z_R1_scratch, Address(Z_tos, Method::const_offset())); |
|
2069 |
__ load_address(Z_bcp, Address(Z_R1_scratch, Z_tmp_1, ConstMethod::codes_offset())); |
|
2070 |
__ dispatch_next(vtos); |
|
2071 |
} |
|
2072 |
||
2073 |
void TemplateTable::wide_ret() { |
|
2074 |
transition(vtos, vtos); |
|
2075 |
||
2076 |
locals_index_wide(Z_tmp_1); |
|
2077 |
// Get return bci, compute return bcp. |
|
2078 |
__ mem2reg_opt(Z_tmp_1, aaddress(_masm, Z_tmp_1)); |
|
2079 |
__ profile_ret(Z_tmp_1, Z_tmp_2); |
|
2080 |
__ get_method(Z_tos); |
|
2081 |
__ mem2reg_opt(Z_R1_scratch, Address(Z_tos, Method::const_offset())); |
|
2082 |
__ load_address(Z_bcp, Address(Z_R1_scratch, Z_tmp_1, ConstMethod::codes_offset())); |
|
2083 |
__ dispatch_next(vtos); |
|
2084 |
} |
|
2085 |
||
2086 |
void TemplateTable::tableswitch () { |
|
2087 |
transition(itos, vtos); |
|
2088 |
||
2089 |
NearLabel default_case, continue_execution; |
|
2090 |
Register bcp = Z_ARG5; |
|
2091 |
// Align bcp. |
|
2092 |
__ load_address(bcp, at_bcp(BytesPerInt)); |
|
2093 |
__ z_nill(bcp, (-BytesPerInt) & 0xffff); |
|
2094 |
||
2095 |
// Load lo & hi. |
|
2096 |
Register low = Z_tmp_1; |
|
2097 |
Register high = Z_tmp_2; |
|
2098 |
||
2099 |
// Load low into 64 bits, since used for address calculation. |
|
2100 |
__ mem2reg_signed_opt(low, Address(bcp, BytesPerInt)); |
|
2101 |
__ mem2reg_opt(high, Address(bcp, 2 * BytesPerInt), false); |
|
2102 |
// Sign extend "label" value for address calculation. |
|
2103 |
__ z_lgfr(Z_tos, Z_tos); |
|
2104 |
||
2105 |
// Check against lo & hi. |
|
2106 |
__ compare32_and_branch(Z_tos, low, Assembler::bcondLow, default_case); |
|
2107 |
__ compare32_and_branch(Z_tos, high, Assembler::bcondHigh, default_case); |
|
2108 |
||
2109 |
// Lookup dispatch offset. |
|
2110 |
__ z_sgr(Z_tos, low); |
|
2111 |
Register jump_table_offset = Z_ARG3; |
|
2112 |
// Index2offset; index in Z_tos is killed by profile_switch_case. |
|
2113 |
__ z_sllg(jump_table_offset, Z_tos, LogBytesPerInt); |
|
2114 |
__ profile_switch_case(Z_tos, Z_ARG4 /*tmp for mdp*/, low/*tmp*/, Z_bytecode/*tmp*/); |
|
2115 |
||
2116 |
Register index = Z_tmp_2; |
|
2117 |
||
2118 |
// Load index sign extended for addressing. |
|
2119 |
__ mem2reg_signed_opt(index, Address(bcp, jump_table_offset, 3 * BytesPerInt)); |
|
2120 |
||
2121 |
// Continue execution. |
|
2122 |
__ bind(continue_execution); |
|
2123 |
||
2124 |
// Load next bytecode. |
|
2125 |
__ z_llgc(Z_bytecode, Address(Z_bcp, index)); |
|
2126 |
__ z_agr(Z_bcp, index); // Advance bcp. |
|
2127 |
__ dispatch_only(vtos); |
|
2128 |
||
2129 |
// Handle default. |
|
2130 |
__ bind(default_case); |
|
2131 |
||
2132 |
__ profile_switch_default(Z_tos); |
|
2133 |
__ mem2reg_signed_opt(index, Address(bcp)); |
|
2134 |
__ z_bru(continue_execution); |
|
2135 |
} |
|
2136 |
||
2137 |
void TemplateTable::lookupswitch () { |
|
2138 |
transition(itos, itos); |
|
2139 |
__ stop("lookupswitch bytecode should have been rewritten"); |
|
2140 |
} |
|
2141 |
||
2142 |
void TemplateTable::fast_linearswitch () { |
|
2143 |
transition(itos, vtos); |
|
2144 |
||
2145 |
Label loop_entry, loop, found, continue_execution; |
|
2146 |
Register bcp = Z_ARG5; |
|
2147 |
||
2148 |
// Align bcp. |
|
2149 |
__ load_address(bcp, at_bcp(BytesPerInt)); |
|
2150 |
__ z_nill(bcp, (-BytesPerInt) & 0xffff); |
|
2151 |
||
2152 |
// Start search with last case. |
|
2153 |
Register current_case_offset = Z_tmp_1; |
|
2154 |
||
2155 |
__ mem2reg_signed_opt(current_case_offset, Address(bcp, BytesPerInt)); |
|
2156 |
__ z_sllg(current_case_offset, current_case_offset, LogBytesPerWord); // index2bytes |
|
2157 |
__ z_bru(loop_entry); |
|
2158 |
||
2159 |
// table search |
|
2160 |
__ bind(loop); |
|
2161 |
||
2162 |
__ z_c(Z_tos, Address(bcp, current_case_offset, 2 * BytesPerInt)); |
|
2163 |
__ z_bre(found); |
|
2164 |
||
2165 |
__ bind(loop_entry); |
|
2166 |
__ z_aghi(current_case_offset, -2 * BytesPerInt); // Decrement. |
|
2167 |
__ z_brnl(loop); |
|
2168 |
||
2169 |
// default case |
|
2170 |
Register offset = Z_tmp_2; |
|
2171 |
||
2172 |
__ profile_switch_default(Z_tos); |
|
2173 |
// Load offset sign extended for addressing. |
|
2174 |
__ mem2reg_signed_opt(offset, Address(bcp)); |
|
2175 |
__ z_bru(continue_execution); |
|
2176 |
||
2177 |
// Entry found -> get offset. |
|
2178 |
__ bind(found); |
|
2179 |
__ mem2reg_signed_opt(offset, Address(bcp, current_case_offset, 3 * BytesPerInt)); |
|
2180 |
// Profile that this case was taken. |
|
2181 |
Register current_case_idx = Z_ARG4; |
|
2182 |
__ z_srlg(current_case_idx, current_case_offset, LogBytesPerWord); // bytes2index |
|
2183 |
__ profile_switch_case(current_case_idx, Z_tos, bcp, Z_bytecode); |
|
2184 |
||
2185 |
// Continue execution. |
|
2186 |
__ bind(continue_execution); |
|
2187 |
||
2188 |
// Load next bytecode. |
|
2189 |
__ z_llgc(Z_bytecode, Address(Z_bcp, offset, 0)); |
|
2190 |
__ z_agr(Z_bcp, offset); // Advance bcp. |
|
2191 |
__ dispatch_only(vtos); |
|
2192 |
} |
|
2193 |
||
2194 |
||
2195 |
void TemplateTable::fast_binaryswitch() { |
|
2196 |
||
2197 |
transition(itos, vtos); |
|
2198 |
||
2199 |
// Implementation using the following core algorithm: |
|
2200 |
// |
|
2201 |
// int binary_search(int key, LookupswitchPair* array, int n) { |
|
2202 |
// // Binary search according to "Methodik des Programmierens" by |
|
2203 |
// // Edsger W. Dijkstra and W.H.J. Feijen, Addison Wesley Germany 1985. |
|
2204 |
// int i = 0; |
|
2205 |
// int j = n; |
|
2206 |
// while (i+1 < j) { |
|
2207 |
// // invariant P: 0 <= i < j <= n and (a[i] <= key < a[j] or Q) |
|
2208 |
// // with Q: for all i: 0 <= i < n: key < a[i] |
|
2209 |
// // where a stands for the array and assuming that the (inexisting) |
|
2210 |
// // element a[n] is infinitely big. |
|
2211 |
// int h = (i + j) >> 1; |
|
2212 |
// // i < h < j |
|
2213 |
// if (key < array[h].fast_match()) { |
|
2214 |
// j = h; |
|
2215 |
// } else { |
|
2216 |
// i = h; |
|
2217 |
// } |
|
2218 |
// } |
|
2219 |
// // R: a[i] <= key < a[i+1] or Q |
|
2220 |
// // (i.e., if key is within array, i is the correct index) |
|
2221 |
// return i; |
|
2222 |
// } |
|
2223 |
||
2224 |
// Register allocation |
|
2225 |
// Note: Since we use the indices in address operands, we do all the |
|
2226 |
// computation in 64 bits. |
|
2227 |
const Register key = Z_tos; // Already set (tosca). |
|
2228 |
const Register array = Z_tmp_1; |
|
2229 |
const Register i = Z_tmp_2; |
|
2230 |
const Register j = Z_ARG5; |
|
2231 |
const Register h = Z_ARG4; |
|
2232 |
const Register temp = Z_R1_scratch; |
|
2233 |
||
2234 |
// Find array start. |
|
2235 |
__ load_address(array, at_bcp(3 * BytesPerInt)); |
|
2236 |
__ z_nill(array, (-BytesPerInt) & 0xffff); // align |
|
2237 |
||
2238 |
// Initialize i & j. |
|
2239 |
__ clear_reg(i, true, false); // i = 0; Don't set CC. |
|
2240 |
__ mem2reg_signed_opt(j, Address(array, -BytesPerInt)); // j = length(array); |
|
2241 |
||
2242 |
// And start. |
|
2243 |
Label entry; |
|
2244 |
__ z_bru(entry); |
|
2245 |
||
2246 |
// binary search loop |
|
2247 |
{ |
|
2248 |
NearLabel loop; |
|
2249 |
||
2250 |
__ bind(loop); |
|
2251 |
||
2252 |
// int h = (i + j) >> 1; |
|
2253 |
__ add2reg_with_index(h, 0, i, j); // h = i + j; |
|
2254 |
__ z_srag(h, h, 1); // h = (i + j) >> 1; |
|
2255 |
||
2256 |
// if (key < array[h].fast_match()) { |
|
2257 |
// j = h; |
|
2258 |
// } else { |
|
2259 |
// i = h; |
|
2260 |
// } |
|
2261 |
||
2262 |
// Convert array[h].match to native byte-ordering before compare. |
|
2263 |
__ z_sllg(temp, h, LogBytesPerWord); // index2bytes |
|
2264 |
__ mem2reg_opt(temp, Address(array, temp), false); |
|
2265 |
||
2266 |
NearLabel else_; |
|
2267 |
||
2268 |
__ compare32_and_branch(key, temp, Assembler::bcondNotLow, else_); |
|
2269 |
// j = h if (key < array[h].fast_match()) |
|
2270 |
__ z_lgr(j, h); |
|
2271 |
__ z_bru(entry); // continue |
|
2272 |
||
2273 |
__ bind(else_); |
|
2274 |
||
2275 |
// i = h if (key >= array[h].fast_match()) |
|
2276 |
__ z_lgr(i, h); // and fallthrough |
|
2277 |
||
2278 |
// while (i+1 < j) |
|
2279 |
__ bind(entry); |
|
2280 |
||
2281 |
// if (i + 1 < j) continue search |
|
2282 |
__ add2reg(h, 1, i); |
|
2283 |
__ compare64_and_branch(h, j, Assembler::bcondLow, loop); |
|
2284 |
} |
|
2285 |
||
2286 |
// End of binary search, result index is i (must check again!). |
|
2287 |
NearLabel default_case; |
|
2288 |
||
2289 |
// h is no longer needed, so use it to hold the byte offset. |
|
2290 |
__ z_sllg(h, i, LogBytesPerWord); // index2bytes |
|
2291 |
__ mem2reg_opt(temp, Address(array, h), false); |
|
2292 |
__ compare32_and_branch(key, temp, Assembler::bcondNotEqual, default_case); |
|
2293 |
||
2294 |
// entry found -> j = offset |
|
2295 |
__ mem2reg_signed_opt(j, Address(array, h, BytesPerInt)); |
|
2296 |
__ profile_switch_case(i, key, array, Z_bytecode); |
|
2297 |
// Load next bytecode. |
|
2298 |
__ z_llgc(Z_bytecode, Address(Z_bcp, j)); |
|
2299 |
__ z_agr(Z_bcp, j); // Advance bcp. |
|
2300 |
__ dispatch_only(vtos); |
|
2301 |
||
2302 |
// default case -> j = default offset |
|
2303 |
__ bind(default_case); |
|
2304 |
||
2305 |
__ profile_switch_default(i); |
|
2306 |
__ mem2reg_signed_opt(j, Address(array, -2 * BytesPerInt)); |
|
2307 |
// Load next bytecode. |
|
2308 |
__ z_llgc(Z_bytecode, Address(Z_bcp, j)); |
|
2309 |
__ z_agr(Z_bcp, j); // Advance bcp. |
|
2310 |
__ dispatch_only(vtos); |
|
2311 |
} |
|
2312 |
||
2313 |
void TemplateTable::_return(TosState state) { |
|
2314 |
transition(state, state); |
|
2315 |
assert(_desc->calls_vm(), |
|
2316 |
"inconsistent calls_vm information"); // call in remove_activation |
|
2317 |
||
2318 |
if (_desc->bytecode() == Bytecodes::_return_register_finalizer) { |
|
2319 |
Register Rthis = Z_ARG2; |
|
2320 |
Register Rklass = Z_ARG5; |
|
2321 |
Label skip_register_finalizer; |
|
2322 |
assert(state == vtos, "only valid state"); |
|
2323 |
__ z_lg(Rthis, aaddress(0)); |
|
2324 |
__ load_klass(Rklass, Rthis); |
|
2325 |
__ testbit(Address(Rklass, Klass::access_flags_offset()), exact_log2(JVM_ACC_HAS_FINALIZER)); |
|
2326 |
__ z_bfalse(skip_register_finalizer); |
|
2327 |
__ call_VM(noreg, CAST_FROM_FN_PTR(address, InterpreterRuntime::register_finalizer), Rthis); |
|
2328 |
__ bind(skip_register_finalizer); |
|
2329 |
} |
|
2330 |
||
2331 |
__ remove_activation(state, Z_R14); |
|
2332 |
__ z_br(Z_R14); |
|
2333 |
} |
|
2334 |
||
2335 |
// ---------------------------------------------------------------------------- |
|
2336 |
// NOTE: Cpe_offset is already computed as byte offset, so we must not |
|
2337 |
// shift it afterwards! |
|
2338 |
void TemplateTable::resolve_cache_and_index(int byte_no, |
|
2339 |
Register Rcache, |
|
2340 |
Register cpe_offset, |
|
2341 |
size_t index_size) { |
|
2342 |
BLOCK_COMMENT("resolve_cache_and_index {"); |
|
2343 |
NearLabel resolved; |
|
2344 |
const Register bytecode_in_cpcache = Z_R1_scratch; |
|
2345 |
const int total_f1_offset = in_bytes(ConstantPoolCache::base_offset() + ConstantPoolCacheEntry::f1_offset()); |
|
2346 |
assert_different_registers(Rcache, cpe_offset, bytecode_in_cpcache); |
|
2347 |
||
2348 |
Bytecodes::Code code = bytecode(); |
|
2349 |
switch (code) { |
|
2350 |
case Bytecodes::_nofast_getfield: code = Bytecodes::_getfield; break; |
|
2351 |
case Bytecodes::_nofast_putfield: code = Bytecodes::_putfield; break; |
|
2352 |
} |
|
2353 |
||
2354 |
{ |
|
2355 |
assert(byte_no == f1_byte || byte_no == f2_byte, "byte_no out of range"); |
|
2356 |
__ get_cache_and_index_and_bytecode_at_bcp(Rcache, cpe_offset, bytecode_in_cpcache, byte_no, 1, index_size); |
|
2357 |
// Have we resolved this bytecode? |
|
2358 |
__ compare32_and_branch(bytecode_in_cpcache, (int)code, Assembler::bcondEqual, resolved); |
|
2359 |
} |
|
2360 |
||
2361 |
// Resolve first time through. |
|
2362 |
address entry = CAST_FROM_FN_PTR(address, InterpreterRuntime::resolve_from_cache); |
|
2363 |
__ load_const_optimized(Z_ARG2, (int) code); |
|
2364 |
__ call_VM(noreg, entry, Z_ARG2); |
|
2365 |
||
2366 |
// Update registers with resolved info. |
|
2367 |
__ get_cache_and_index_at_bcp(Rcache, cpe_offset, 1, index_size); |
|
2368 |
__ bind(resolved); |
|
2369 |
BLOCK_COMMENT("} resolve_cache_and_index"); |
|
2370 |
} |
|
2371 |
||
2372 |
// The Rcache and index registers must be set before call. |
|
2373 |
// Index is already a byte offset, don't shift! |
|
2374 |
void TemplateTable::load_field_cp_cache_entry(Register obj, |
|
2375 |
Register cache, |
|
2376 |
Register index, |
|
2377 |
Register off, |
|
2378 |
Register flags, |
|
2379 |
bool is_static = false) { |
|
2380 |
assert_different_registers(cache, index, flags, off); |
|
2381 |
ByteSize cp_base_offset = ConstantPoolCache::base_offset(); |
|
2382 |
||
2383 |
// Field offset |
|
2384 |
__ mem2reg_opt(off, Address(cache, index, cp_base_offset + ConstantPoolCacheEntry::f2_offset())); |
|
2385 |
// Flags. Must load 64 bits. |
|
2386 |
__ mem2reg_opt(flags, Address(cache, index, cp_base_offset + ConstantPoolCacheEntry::flags_offset())); |
|
2387 |
||
2388 |
// klass overwrite register |
|
2389 |
if (is_static) { |
|
2390 |
__ mem2reg_opt(obj, Address(cache, index, cp_base_offset + ConstantPoolCacheEntry::f1_offset())); |
|
2391 |
__ mem2reg_opt(obj, Address(obj, Klass::java_mirror_offset())); |
|
47580 | 2392 |
__ resolve_oop_handle(obj); |
42065 | 2393 |
} |
2394 |
} |
|
2395 |
||
2396 |
void TemplateTable::load_invoke_cp_cache_entry(int byte_no, |
|
2397 |
Register method, |
|
2398 |
Register itable_index, |
|
2399 |
Register flags, |
|
2400 |
bool is_invokevirtual, |
|
2401 |
bool is_invokevfinal, // unused |
|
2402 |
bool is_invokedynamic) { |
|
2403 |
BLOCK_COMMENT("load_invoke_cp_cache_entry {"); |
|
2404 |
// Setup registers. |
|
2405 |
const Register cache = Z_ARG1; |
|
2406 |
const Register cpe_offset= flags; |
|
2407 |
const ByteSize base_off = ConstantPoolCache::base_offset(); |
|
2408 |
const ByteSize f1_off = ConstantPoolCacheEntry::f1_offset(); |
|
2409 |
const ByteSize f2_off = ConstantPoolCacheEntry::f2_offset(); |
|
2410 |
const ByteSize flags_off = ConstantPoolCacheEntry::flags_offset(); |
|
2411 |
const int method_offset = in_bytes(base_off + ((byte_no == f2_byte) ? f2_off : f1_off)); |
|
2412 |
const int flags_offset = in_bytes(base_off + flags_off); |
|
2413 |
// Access constant pool cache fields. |
|
2414 |
const int index_offset = in_bytes(base_off + f2_off); |
|
2415 |
||
2416 |
assert_different_registers(method, itable_index, flags, cache); |
|
2417 |
assert(is_invokevirtual == (byte_no == f2_byte), "is_invokevirtual flag redundant"); |
|
2418 |
||
2419 |
if (is_invokevfinal) { |
|
2420 |
// Already resolved. |
|
2421 |
assert(itable_index == noreg, "register not used"); |
|
2422 |
__ get_cache_and_index_at_bcp(cache, cpe_offset, 1); |
|
2423 |
} else { |
|
2424 |
// Need to resolve. |
|
2425 |
resolve_cache_and_index(byte_no, cache, cpe_offset, is_invokedynamic ? sizeof(u4) : sizeof(u2)); |
|
2426 |
} |
|
2427 |
__ z_lg(method, Address(cache, cpe_offset, method_offset)); |
|
2428 |
||
2429 |
if (itable_index != noreg) { |
|
2430 |
__ z_lg(itable_index, Address(cache, cpe_offset, index_offset)); |
|
2431 |
} |
|
2432 |
||
2433 |
// Only load the lower 4 bytes and fill high bytes of flags with zeros. |
|
2434 |
// Callers depend on this zero-extension!!! |
|
2435 |
// Attention: overwrites cpe_offset == flags |
|
2436 |
__ z_llgf(flags, Address(cache, cpe_offset, flags_offset + (BytesPerLong-BytesPerInt))); |
|
2437 |
||
2438 |
BLOCK_COMMENT("} load_invoke_cp_cache_entry"); |
|
2439 |
} |
|
2440 |
||
2441 |
// The registers cache and index expected to be set before call. |
|
2442 |
// Correct values of the cache and index registers are preserved. |
|
2443 |
void TemplateTable::jvmti_post_field_access(Register cache, Register index, |
|
2444 |
bool is_static, bool has_tos) { |
|
2445 |
||
2446 |
// Do the JVMTI work here to avoid disturbing the register state below. |
|
2447 |
// We use c_rarg registers here because we want to use the register used in |
|
2448 |
// the call to the VM |
|
2449 |
if (!JvmtiExport::can_post_field_access()) { |
|
2450 |
return; |
|
2451 |
} |
|
2452 |
||
2453 |
// Check to see if a field access watch has been set before we |
|
2454 |
// take the time to call into the VM. |
|
2455 |
Label exit; |
|
2456 |
assert_different_registers(cache, index, Z_tos); |
|
2457 |
__ load_absolute_address(Z_tos, (address)JvmtiExport::get_field_access_count_addr()); |
|
2458 |
__ load_and_test_int(Z_R0, Address(Z_tos)); |
|
2459 |
__ z_brz(exit); |
|
2460 |
||
2461 |
// Index is returned as byte offset, do not shift! |
|
2462 |
__ get_cache_and_index_at_bcp(Z_ARG3, Z_R1_scratch, 1); |
|
2463 |
||
2464 |
// cache entry pointer |
|
2465 |
__ add2reg_with_index(Z_ARG3, |
|
2466 |
in_bytes(ConstantPoolCache::base_offset()), |
|
2467 |
Z_ARG3, Z_R1_scratch); |
|
2468 |
||
2469 |
if (is_static) { |
|
2470 |
__ clear_reg(Z_ARG2, true, false); // NULL object reference. Don't set CC. |
|
2471 |
} else { |
|
2472 |
__ mem2reg_opt(Z_ARG2, at_tos()); // Get object pointer without popping it. |
|
2473 |
__ verify_oop(Z_ARG2); |
|
2474 |
} |
|
2475 |
// Z_ARG2: object pointer or NULL |
|
2476 |
// Z_ARG3: cache entry pointer |
|
2477 |
__ call_VM(noreg, |
|
2478 |
CAST_FROM_FN_PTR(address, InterpreterRuntime::post_field_access), |
|
2479 |
Z_ARG2, Z_ARG3); |
|
2480 |
__ get_cache_and_index_at_bcp(cache, index, 1); |
|
2481 |
||
2482 |
__ bind(exit); |
|
2483 |
} |
|
2484 |
||
2485 |
void TemplateTable::pop_and_check_object(Register r) { |
|
2486 |
__ pop_ptr(r); |
|
2487 |
__ null_check(r); // for field access must check obj. |
|
2488 |
__ verify_oop(r); |
|
2489 |
} |
|
2490 |
||
2491 |
void TemplateTable::getfield_or_static(int byte_no, bool is_static, RewriteControl rc) { |
|
2492 |
transition(vtos, vtos); |
|
2493 |
||
2494 |
const Register cache = Z_tmp_1; |
|
2495 |
const Register index = Z_tmp_2; |
|
2496 |
const Register obj = Z_tmp_1; |
|
2497 |
const Register off = Z_ARG2; |
|
2498 |
const Register flags = Z_ARG1; |
|
2499 |
const Register bc = Z_tmp_1; // Uses same reg as obj, so don't mix them. |
|
2500 |
||
2501 |
resolve_cache_and_index(byte_no, cache, index, sizeof(u2)); |
|
2502 |
jvmti_post_field_access(cache, index, is_static, false); |
|
2503 |
load_field_cp_cache_entry(obj, cache, index, off, flags, is_static); |
|
2504 |
||
2505 |
if (!is_static) { |
|
2506 |
// Obj is on the stack. |
|
2507 |
pop_and_check_object(obj); |
|
2508 |
} |
|
2509 |
||
2510 |
// Displacement is 0, so any store instruction will be fine on any CPU. |
|
2511 |
const Address field(obj, off); |
|
2512 |
||
2513 |
Label is_Byte, is_Bool, is_Int, is_Short, is_Char, |
|
2514 |
is_Long, is_Float, is_Object, is_Double; |
|
2515 |
Label is_badState8, is_badState9, is_badStateA, is_badStateB, |
|
2516 |
is_badStateC, is_badStateD, is_badStateE, is_badStateF, |
|
2517 |
is_badState; |
|
2518 |
Label branchTable, atosHandler, Done; |
|
2519 |
Register br_tab = Z_R1_scratch; |
|
2520 |
bool do_rewrite = !is_static && (rc == may_rewrite); |
|
2521 |
bool dont_rewrite = (is_static || (rc == may_not_rewrite)); |
|
2522 |
||
2523 |
assert(do_rewrite == !dont_rewrite, "Oops, code is not fit for that"); |
|
2524 |
assert(btos == 0, "change code, btos != 0"); |
|
2525 |
||
2526 |
// Calculate branch table size. Generated code size depends on ASSERT and on bytecode rewriting. |
|
2527 |
#ifdef ASSERT |
|
2528 |
const unsigned int bsize = dont_rewrite ? BTB_MINSIZE*1 : BTB_MINSIZE*4; |
|
2529 |
#else |
|
2530 |
const unsigned int bsize = dont_rewrite ? BTB_MINSIZE*1 : BTB_MINSIZE*4; |
|
2531 |
#endif |
|
2532 |
||
2533 |
// Calculate address of branch table entry and branch there. |
|
2534 |
{ |
|
2535 |
const int bit_shift = exact_log2(bsize); // Size of each branch table entry. |
|
2536 |
const int r_bitpos = 63 - bit_shift; |
|
2537 |
const int l_bitpos = r_bitpos - ConstantPoolCacheEntry::tos_state_bits + 1; |
|
2538 |
const int n_rotate = (bit_shift-ConstantPoolCacheEntry::tos_state_shift); |
|
2539 |
__ z_larl(br_tab, branchTable); |
|
2540 |
__ rotate_then_insert(flags, flags, l_bitpos, r_bitpos, n_rotate, true); |
|
2541 |
} |
|
2542 |
__ z_bc(Assembler::bcondAlways, 0, flags, br_tab); |
|
2543 |
||
2544 |
__ align_address(bsize); |
|
2545 |
BIND(branchTable); |
|
2546 |
||
2547 |
// btos |
|
2548 |
BTB_BEGIN(is_Byte, bsize, "getfield_or_static:is_Byte"); |
|
2549 |
__ z_lb(Z_tos, field); |
|
2550 |
__ push(btos); |
|
2551 |
// Rewrite bytecode to be faster. |
|
2552 |
if (do_rewrite) { |
|
2553 |
patch_bytecode(Bytecodes::_fast_bgetfield, bc, Z_ARG5); |
|
2554 |
} |
|
2555 |
__ z_bru(Done); |
|
2556 |
BTB_END(is_Byte, bsize, "getfield_or_static:is_Byte"); |
|
2557 |
||
2558 |
// ztos |
|
2559 |
BTB_BEGIN(is_Bool, bsize, "getfield_or_static:is_Bool"); |
|
2560 |
__ z_lb(Z_tos, field); |
|
2561 |
__ push(ztos); |
|
2562 |
// Rewrite bytecode to be faster. |
|
2563 |
if (do_rewrite) { |
|
2564 |
// Use btos rewriting, no truncating to t/f bit is needed for getfield. |
|
2565 |
patch_bytecode(Bytecodes::_fast_bgetfield, bc, Z_ARG5); |
|
2566 |
} |
|
2567 |
__ z_bru(Done); |
|
2568 |
BTB_END(is_Bool, bsize, "getfield_or_static:is_Bool"); |
|
2569 |
||
2570 |
// ctos |
|
2571 |
BTB_BEGIN(is_Char, bsize, "getfield_or_static:is_Char"); |
|
2572 |
// Load into 64 bits, works on all CPUs. |
|
2573 |
__ z_llgh(Z_tos, field); |
|
2574 |
__ push(ctos); |
|
2575 |
// Rewrite bytecode to be faster. |
|
2576 |
if (do_rewrite) { |
|
2577 |
patch_bytecode(Bytecodes::_fast_cgetfield, bc, Z_ARG5); |
|
2578 |
} |
|
2579 |
__ z_bru(Done); |
|
2580 |
BTB_END(is_Char, bsize, "getfield_or_static:is_Char"); |
|
2581 |
||
2582 |
// stos |
|
2583 |
BTB_BEGIN(is_Short, bsize, "getfield_or_static:is_Short"); |
|
2584 |
__ z_lh(Z_tos, field); |
|
2585 |
__ push(stos); |
|
2586 |
// Rewrite bytecode to be faster. |
|
2587 |
if (do_rewrite) { |
|
2588 |
patch_bytecode(Bytecodes::_fast_sgetfield, bc, Z_ARG5); |
|
2589 |
} |
|
2590 |
__ z_bru(Done); |
|
2591 |
BTB_END(is_Short, bsize, "getfield_or_static:is_Short"); |
|
2592 |
||
2593 |
// itos |
|
2594 |
BTB_BEGIN(is_Int, bsize, "getfield_or_static:is_Int"); |
|
2595 |
__ mem2reg_opt(Z_tos, field, false); |
|
2596 |
__ push(itos); |
|
2597 |
// Rewrite bytecode to be faster. |
|
2598 |
if (do_rewrite) { |
|
2599 |
patch_bytecode(Bytecodes::_fast_igetfield, bc, Z_ARG5); |
|
2600 |
} |
|
2601 |
__ z_bru(Done); |
|
2602 |
BTB_END(is_Int, bsize, "getfield_or_static:is_Int"); |
|
2603 |
||
2604 |
// ltos |
|
2605 |
BTB_BEGIN(is_Long, bsize, "getfield_or_static:is_Long"); |
|
2606 |
__ mem2reg_opt(Z_tos, field); |
|
2607 |
__ push(ltos); |
|
2608 |
// Rewrite bytecode to be faster. |
|
2609 |
if (do_rewrite) { |
|
2610 |
patch_bytecode(Bytecodes::_fast_lgetfield, bc, Z_ARG5); |
|
2611 |
} |
|
2612 |
__ z_bru(Done); |
|
2613 |
BTB_END(is_Long, bsize, "getfield_or_static:is_Long"); |
|
2614 |
||
2615 |
// ftos |
|
2616 |
BTB_BEGIN(is_Float, bsize, "getfield_or_static:is_Float"); |
|
2617 |
__ mem2freg_opt(Z_ftos, field, false); |
|
2618 |
__ push(ftos); |
|
2619 |
// Rewrite bytecode to be faster. |
|
2620 |
if (do_rewrite) { |
|
2621 |
patch_bytecode(Bytecodes::_fast_fgetfield, bc, Z_ARG5); |
|
2622 |
} |
|
2623 |
__ z_bru(Done); |
|
2624 |
BTB_END(is_Float, bsize, "getfield_or_static:is_Float"); |
|
2625 |
||
2626 |
// dtos |
|
2627 |
BTB_BEGIN(is_Double, bsize, "getfield_or_static:is_Double"); |
|
2628 |
__ mem2freg_opt(Z_ftos, field); |
|
2629 |
__ push(dtos); |
|
2630 |
// Rewrite bytecode to be faster. |
|
2631 |
if (do_rewrite) { |
|
2632 |
patch_bytecode(Bytecodes::_fast_dgetfield, bc, Z_ARG5); |
|
2633 |
} |
|
2634 |
__ z_bru(Done); |
|
2635 |
BTB_END(is_Double, bsize, "getfield_or_static:is_Double"); |
|
2636 |
||
2637 |
// atos |
|
2638 |
BTB_BEGIN(is_Object, bsize, "getfield_or_static:is_Object"); |
|
2639 |
__ z_bru(atosHandler); |
|
2640 |
BTB_END(is_Object, bsize, "getfield_or_static:is_Object"); |
|
2641 |
||
2642 |
// Bad state detection comes at no extra runtime cost. |
|
2643 |
BTB_BEGIN(is_badState8, bsize, "getfield_or_static:is_badState8"); |
|
2644 |
__ z_illtrap(); |
|
2645 |
__ z_bru(is_badState); |
|
2646 |
BTB_END( is_badState8, bsize, "getfield_or_static:is_badState8"); |
|
2647 |
BTB_BEGIN(is_badState9, bsize, "getfield_or_static:is_badState9"); |
|
2648 |
__ z_illtrap(); |
|
2649 |
__ z_bru(is_badState); |
|
2650 |
BTB_END( is_badState9, bsize, "getfield_or_static:is_badState9"); |
|
2651 |
BTB_BEGIN(is_badStateA, bsize, "getfield_or_static:is_badStateA"); |
|
2652 |
__ z_illtrap(); |
|
2653 |
__ z_bru(is_badState); |
|
2654 |
BTB_END( is_badStateA, bsize, "getfield_or_static:is_badStateA"); |
|
2655 |
BTB_BEGIN(is_badStateB, bsize, "getfield_or_static:is_badStateB"); |
|
2656 |
__ z_illtrap(); |
|
2657 |
__ z_bru(is_badState); |
|
2658 |
BTB_END( is_badStateB, bsize, "getfield_or_static:is_badStateB"); |
|
2659 |
BTB_BEGIN(is_badStateC, bsize, "getfield_or_static:is_badStateC"); |
|
2660 |
__ z_illtrap(); |
|
2661 |
__ z_bru(is_badState); |
|
2662 |
BTB_END( is_badStateC, bsize, "getfield_or_static:is_badStateC"); |
|
2663 |
BTB_BEGIN(is_badStateD, bsize, "getfield_or_static:is_badStateD"); |
|
2664 |
__ z_illtrap(); |
|
2665 |
__ z_bru(is_badState); |
|
2666 |
BTB_END( is_badStateD, bsize, "getfield_or_static:is_badStateD"); |
|
2667 |
BTB_BEGIN(is_badStateE, bsize, "getfield_or_static:is_badStateE"); |
|
2668 |
__ z_illtrap(); |
|
2669 |
__ z_bru(is_badState); |
|
2670 |
BTB_END( is_badStateE, bsize, "getfield_or_static:is_badStateE"); |
|
2671 |
BTB_BEGIN(is_badStateF, bsize, "getfield_or_static:is_badStateF"); |
|
2672 |
__ z_illtrap(); |
|
2673 |
__ z_bru(is_badState); |
|
2674 |
BTB_END( is_badStateF, bsize, "getfield_or_static:is_badStateF"); |
|
2675 |
||
2676 |
__ align_address(64); |
|
2677 |
BIND(is_badState); // Do this outside branch table. Needs a lot of space. |
|
2678 |
{ |
|
2679 |
unsigned int b_off = __ offset(); |
|
2680 |
if (is_static) { |
|
2681 |
__ stop_static("Bad state in getstatic"); |
|
2682 |
} else { |
|
2683 |
__ stop_static("Bad state in getfield"); |
|
2684 |
} |
|
2685 |
unsigned int e_off = __ offset(); |
|
2686 |
} |
|
2687 |
||
2688 |
__ align_address(64); |
|
2689 |
BIND(atosHandler); // Oops are really complicated to handle. |
|
2690 |
// There is a lot of code generated. |
|
2691 |
// Therefore: generate the handler outside of branch table. |
|
2692 |
// There is no performance penalty. The additional branch |
|
2693 |
// to here is compensated for by the fallthru to "Done". |
|
2694 |
{ |
|
2695 |
unsigned int b_off = __ offset(); |
|
2696 |
__ load_heap_oop(Z_tos, field); |
|
2697 |
__ verify_oop(Z_tos); |
|
2698 |
__ push(atos); |
|
2699 |
if (do_rewrite) { |
|
2700 |
patch_bytecode(Bytecodes::_fast_agetfield, bc, Z_ARG5); |
|
2701 |
} |
|
2702 |
unsigned int e_off = __ offset(); |
|
2703 |
} |
|
2704 |
||
2705 |
BIND(Done); |
|
2706 |
} |
|
2707 |
||
2708 |
void TemplateTable::getfield(int byte_no) { |
|
2709 |
BLOCK_COMMENT("getfield {"); |
|
2710 |
getfield_or_static(byte_no, false); |
|
2711 |
BLOCK_COMMENT("} getfield"); |
|
2712 |
} |
|
2713 |
||
2714 |
void TemplateTable::nofast_getfield(int byte_no) { |
|
2715 |
getfield_or_static(byte_no, false, may_not_rewrite); |
|
2716 |
} |
|
2717 |
||
2718 |
void TemplateTable::getstatic(int byte_no) { |
|
2719 |
BLOCK_COMMENT("getstatic {"); |
|
2720 |
getfield_or_static(byte_no, true); |
|
2721 |
BLOCK_COMMENT("} getstatic"); |
|
2722 |
} |
|
2723 |
||
2724 |
// The registers cache and index expected to be set before call. The |
|
2725 |
// function may destroy various registers, just not the cache and |
|
2726 |
// index registers. |
|
2727 |
void TemplateTable::jvmti_post_field_mod(Register cache, |
|
2728 |
Register index, bool is_static) { |
|
2729 |
transition(vtos, vtos); |
|
2730 |
||
2731 |
if (!JvmtiExport::can_post_field_modification()) { |
|
2732 |
return; |
|
2733 |
} |
|
2734 |
||
2735 |
BLOCK_COMMENT("jvmti_post_field_mod {"); |
|
2736 |
||
2737 |
// Check to see if a field modification watch has been set before |
|
2738 |
// we take the time to call into the VM. |
|
2739 |
Label L1; |
|
2740 |
ByteSize cp_base_offset = ConstantPoolCache::base_offset(); |
|
2741 |
assert_different_registers(cache, index, Z_tos); |
|
2742 |
||
2743 |
__ load_absolute_address(Z_tos, (address)JvmtiExport::get_field_modification_count_addr()); |
|
2744 |
__ load_and_test_int(Z_R0, Address(Z_tos)); |
|
2745 |
__ z_brz(L1); |
|
2746 |
||
2747 |
// Index is returned as byte offset, do not shift! |
|
2748 |
__ get_cache_and_index_at_bcp(Z_ARG3, Z_R1_scratch, 1); |
|
2749 |
||
2750 |
if (is_static) { |
|
2751 |
// Life is simple. Null out the object pointer. |
|
2752 |
__ clear_reg(Z_ARG2, true, false); // Don't set CC. |
|
2753 |
} else { |
|
2754 |
// Life is harder. The stack holds the value on top, followed by |
|
2755 |
// the object. We don't know the size of the value, though. It |
|
2756 |
// could be one or two words depending on its type. As a result, |
|
2757 |
// we must find the type to determine where the object is. |
|
2758 |
__ mem2reg_opt(Z_ARG4, |
|
2759 |
Address(Z_ARG3, Z_R1_scratch, |
|
2760 |
in_bytes(cp_base_offset + ConstantPoolCacheEntry::flags_offset()) + |
|
2761 |
(BytesPerLong - BytesPerInt)), |
|
2762 |
false); |
|
2763 |
__ z_srl(Z_ARG4, ConstantPoolCacheEntry::tos_state_shift); |
|
2764 |
// Make sure we don't need to mask Z_ARG4 for tos_state after the above shift. |
|
2765 |
ConstantPoolCacheEntry::verify_tos_state_shift(); |
|
2766 |
__ mem2reg_opt(Z_ARG2, at_tos(1)); // Initially assume a one word jvalue. |
|
2767 |
||
2768 |
NearLabel load_dtos, cont; |
|
2769 |
||
2770 |
__ compareU32_and_branch(Z_ARG4, (intptr_t) ltos, |
|
2771 |
Assembler::bcondNotEqual, load_dtos); |
|
2772 |
__ mem2reg_opt(Z_ARG2, at_tos(2)); // ltos (two word jvalue) |
|
2773 |
__ z_bru(cont); |
|
2774 |
||
2775 |
__ bind(load_dtos); |
|
2776 |
__ compareU32_and_branch(Z_ARG4, (intptr_t)dtos, Assembler::bcondNotEqual, cont); |
|
2777 |
__ mem2reg_opt(Z_ARG2, at_tos(2)); // dtos (two word jvalue) |
|
2778 |
||
2779 |
__ bind(cont); |
|
2780 |
} |
|
2781 |
// cache entry pointer |
|
2782 |
||
2783 |
__ add2reg_with_index(Z_ARG3, in_bytes(cp_base_offset), Z_ARG3, Z_R1_scratch); |
|
2784 |
||
2785 |
// object(tos) |
|
2786 |
__ load_address(Z_ARG4, Address(Z_esp, Interpreter::stackElementSize)); |
|
2787 |
// Z_ARG2: object pointer set up above (NULL if static) |
|
2788 |
// Z_ARG3: cache entry pointer |
|
2789 |
// Z_ARG4: jvalue object on the stack |
|
2790 |
__ call_VM(noreg, |
|
2791 |
CAST_FROM_FN_PTR(address, InterpreterRuntime::post_field_modification), |
|
2792 |
Z_ARG2, Z_ARG3, Z_ARG4); |
|
2793 |
__ get_cache_and_index_at_bcp(cache, index, 1); |
|
2794 |
||
2795 |
__ bind(L1); |
|
2796 |
BLOCK_COMMENT("} jvmti_post_field_mod"); |
|
2797 |
} |
|
2798 |
||
2799 |
||
2800 |
void TemplateTable::putfield_or_static(int byte_no, bool is_static, RewriteControl rc) { |
|
2801 |
transition(vtos, vtos); |
|
2802 |
||
2803 |
const Register cache = Z_tmp_1; |
|
2804 |
const Register index = Z_ARG5; |
|
2805 |
const Register obj = Z_tmp_1; |
|
2806 |
const Register off = Z_tmp_2; |
|
2807 |
const Register flags = Z_R1_scratch; |
|
2808 |
const Register br_tab = Z_ARG5; |
|
2809 |
const Register bc = Z_tmp_1; |
|
2810 |
const Register oopStore_tmp1 = Z_R1_scratch; |
|
2811 |
const Register oopStore_tmp2 = Z_ARG5; |
|
2812 |
const Register oopStore_tmp3 = Z_R0_scratch; |
|
2813 |
||
2814 |
resolve_cache_and_index(byte_no, cache, index, sizeof(u2)); |
|
2815 |
jvmti_post_field_mod(cache, index, is_static); |
|
2816 |
load_field_cp_cache_entry(obj, cache, index, off, flags, is_static); |
|
2817 |
// begin of life for: |
|
2818 |
// obj, off long life range |
|
2819 |
// flags short life range, up to branch into branch table |
|
2820 |
// end of life for: |
|
2821 |
// cache, index |
|
2822 |
||
2823 |
const Address field(obj, off); |
|
2824 |
Label is_Byte, is_Bool, is_Int, is_Short, is_Char, |
|
2825 |
is_Long, is_Float, is_Object, is_Double; |
|
2826 |
Label is_badState8, is_badState9, is_badStateA, is_badStateB, |
|
2827 |
is_badStateC, is_badStateD, is_badStateE, is_badStateF, |
|
2828 |
is_badState; |
|
2829 |
Label branchTable, atosHandler, Done; |
|
2830 |
bool do_rewrite = !is_static && (rc == may_rewrite); |
|
2831 |
bool dont_rewrite = (is_static || (rc == may_not_rewrite)); |
|
2832 |
||
2833 |
assert(do_rewrite == !dont_rewrite, "Oops, code is not fit for that"); |
|
2834 |
||
2835 |
assert(btos == 0, "change code, btos != 0"); |
|
2836 |
||
2837 |
#ifdef ASSERT |
|
2838 |
const unsigned int bsize = is_static ? BTB_MINSIZE*1 : BTB_MINSIZE*4; |
|
2839 |
#else |
|
2840 |
const unsigned int bsize = is_static ? BTB_MINSIZE*1 : BTB_MINSIZE*8; |
|
2841 |
#endif |
|
2842 |
||
2843 |
// Calculate address of branch table entry and branch there. |
|
2844 |
{ |
|
2845 |
const int bit_shift = exact_log2(bsize); // Size of each branch table entry. |
|
2846 |
const int r_bitpos = 63 - bit_shift; |
|
2847 |
const int l_bitpos = r_bitpos - ConstantPoolCacheEntry::tos_state_bits + 1; |
|
2848 |
const int n_rotate = (bit_shift-ConstantPoolCacheEntry::tos_state_shift); |
|
2849 |
__ z_larl(br_tab, branchTable); |
|
2850 |
__ rotate_then_insert(flags, flags, l_bitpos, r_bitpos, n_rotate, true); |
|
2851 |
__ z_bc(Assembler::bcondAlways, 0, flags, br_tab); |
|
2852 |
} |
|
2853 |
// end of life for: |
|
2854 |
// flags, br_tab |
|
2855 |
||
2856 |
__ align_address(bsize); |
|
2857 |
BIND(branchTable); |
|
2858 |
||
2859 |
// btos |
|
2860 |
BTB_BEGIN(is_Byte, bsize, "putfield_or_static:is_Byte"); |
|
2861 |
__ pop(btos); |
|
2862 |
if (!is_static) { |
|
2863 |
pop_and_check_object(obj); |
|
2864 |
} |
|
2865 |
__ z_stc(Z_tos, field); |
|
2866 |
if (do_rewrite) { |
|
2867 |
patch_bytecode(Bytecodes::_fast_bputfield, bc, Z_ARG5, true, byte_no); |
|
2868 |
} |
|
2869 |
__ z_bru(Done); |
|
2870 |
BTB_END( is_Byte, bsize, "putfield_or_static:is_Byte"); |
|
2871 |
||
2872 |
// ztos |
|
2873 |
BTB_BEGIN(is_Bool, bsize, "putfield_or_static:is_Bool"); |
|
2874 |
__ pop(ztos); |
|
2875 |
if (do_rewrite) { |
|
2876 |
pop_and_check_object(obj); |
|
2877 |
} |
|
2878 |
__ z_nilf(Z_tos, 0x1); |
|
2879 |
__ z_stc(Z_tos, field); |
|
2880 |
if (!is_static) { |
|
2881 |
patch_bytecode(Bytecodes::_fast_zputfield, bc, Z_ARG5, true, byte_no); |
|
2882 |
} |
|
2883 |
__ z_bru(Done); |
|
2884 |
BTB_END(is_Bool, bsize, "putfield_or_static:is_Bool"); |
|
2885 |
||
2886 |
// ctos |
|
2887 |
BTB_BEGIN(is_Char, bsize, "putfield_or_static:is_Char"); |
|
2888 |
__ pop(ctos); |
|
2889 |
if (!is_static) { |
|
2890 |
pop_and_check_object(obj); |
|
2891 |
} |
|
2892 |
__ z_sth(Z_tos, field); |
|
2893 |
if (do_rewrite) { |
|
2894 |
patch_bytecode(Bytecodes::_fast_cputfield, bc, Z_ARG5, true, byte_no); |
|
2895 |
} |
|
2896 |
__ z_bru(Done); |
|
2897 |
BTB_END( is_Char, bsize, "putfield_or_static:is_Char"); |
|
2898 |
||
2899 |
// stos |
|
2900 |
BTB_BEGIN(is_Short, bsize, "putfield_or_static:is_Short"); |
|
2901 |
__ pop(stos); |
|
2902 |
if (!is_static) { |
|
2903 |
pop_and_check_object(obj); |
|
2904 |
} |
|
2905 |
__ z_sth(Z_tos, field); |
|
2906 |
if (do_rewrite) { |
|
2907 |
patch_bytecode(Bytecodes::_fast_sputfield, bc, Z_ARG5, true, byte_no); |
|
2908 |
} |
|
2909 |
__ z_bru(Done); |
|
2910 |
BTB_END( is_Short, bsize, "putfield_or_static:is_Short"); |
|
2911 |
||
2912 |
// itos |
|
2913 |
BTB_BEGIN(is_Int, bsize, "putfield_or_static:is_Int"); |
|
2914 |
__ pop(itos); |
|
2915 |
if (!is_static) { |
|
2916 |
pop_and_check_object(obj); |
|
2917 |
} |
|
2918 |
__ reg2mem_opt(Z_tos, field, false); |
|
2919 |
if (do_rewrite) { |
|
2920 |
patch_bytecode(Bytecodes::_fast_iputfield, bc, Z_ARG5, true, byte_no); |
|
2921 |
} |
|
2922 |
__ z_bru(Done); |
|
2923 |
BTB_END( is_Int, bsize, "putfield_or_static:is_Int"); |
|
2924 |
||
2925 |
// ltos |
|
2926 |
BTB_BEGIN(is_Long, bsize, "putfield_or_static:is_Long"); |
|
2927 |
__ pop(ltos); |
|
2928 |
if (!is_static) { |
|
2929 |
pop_and_check_object(obj); |
|
2930 |
} |
|
2931 |
__ reg2mem_opt(Z_tos, field); |
|
2932 |
if (do_rewrite) { |
|
2933 |
patch_bytecode(Bytecodes::_fast_lputfield, bc, Z_ARG5, true, byte_no); |
|
2934 |
} |
|
2935 |
__ z_bru(Done); |
|
2936 |
BTB_END( is_Long, bsize, "putfield_or_static:is_Long"); |
|
2937 |
||
2938 |
// ftos |
|
2939 |
BTB_BEGIN(is_Float, bsize, "putfield_or_static:is_Float"); |
|
2940 |
__ pop(ftos); |
|
2941 |
if (!is_static) { |
|
2942 |
pop_and_check_object(obj); |
|
2943 |
} |
|
2944 |
__ freg2mem_opt(Z_ftos, field, false); |
|
2945 |
if (do_rewrite) { |
|
2946 |
patch_bytecode(Bytecodes::_fast_fputfield, bc, Z_ARG5, true, byte_no); |
|
2947 |
} |
|
2948 |
__ z_bru(Done); |
|
2949 |
BTB_END( is_Float, bsize, "putfield_or_static:is_Float"); |
|
2950 |
||
2951 |
// dtos |
|
2952 |
BTB_BEGIN(is_Double, bsize, "putfield_or_static:is_Double"); |
|
2953 |
__ pop(dtos); |
|
2954 |
if (!is_static) { |
|
2955 |
pop_and_check_object(obj); |
|
2956 |
} |
|
2957 |
__ freg2mem_opt(Z_ftos, field); |
|
2958 |
if (do_rewrite) { |
|
2959 |
patch_bytecode(Bytecodes::_fast_dputfield, bc, Z_ARG5, true, byte_no); |
|
2960 |
} |
|
2961 |
__ z_bru(Done); |
|
2962 |
BTB_END( is_Double, bsize, "putfield_or_static:is_Double"); |
|
2963 |
||
2964 |
// atos |
|
2965 |
BTB_BEGIN(is_Object, bsize, "putfield_or_static:is_Object"); |
|
2966 |
__ z_bru(atosHandler); |
|
2967 |
BTB_END( is_Object, bsize, "putfield_or_static:is_Object"); |
|
2968 |
||
2969 |
// Bad state detection comes at no extra runtime cost. |
|
2970 |
BTB_BEGIN(is_badState8, bsize, "putfield_or_static:is_badState8"); |
|
2971 |
__ z_illtrap(); |
|
2972 |
__ z_bru(is_badState); |
|
2973 |
BTB_END( is_badState8, bsize, "putfield_or_static:is_badState8"); |
|
2974 |
BTB_BEGIN(is_badState9, bsize, "putfield_or_static:is_badState9"); |
|
2975 |
__ z_illtrap(); |
|
2976 |
__ z_bru(is_badState); |
|
2977 |
BTB_END( is_badState9, bsize, "putfield_or_static:is_badState9"); |
|
2978 |
BTB_BEGIN(is_badStateA, bsize, "putfield_or_static:is_badStateA"); |
|
2979 |
__ z_illtrap(); |
|
2980 |
__ z_bru(is_badState); |
|
2981 |
BTB_END( is_badStateA, bsize, "putfield_or_static:is_badStateA"); |
|
2982 |
BTB_BEGIN(is_badStateB, bsize, "putfield_or_static:is_badStateB"); |
|
2983 |
__ z_illtrap(); |
|
2984 |
__ z_bru(is_badState); |
|
2985 |
BTB_END( is_badStateB, bsize, "putfield_or_static:is_badStateB"); |
|
2986 |
BTB_BEGIN(is_badStateC, bsize, "putfield_or_static:is_badStateC"); |
|
2987 |
__ z_illtrap(); |
|
2988 |
__ z_bru(is_badState); |
|
2989 |
BTB_END( is_badStateC, bsize, "putfield_or_static:is_badStateC"); |
|
2990 |
BTB_BEGIN(is_badStateD, bsize, "putfield_or_static:is_badStateD"); |
|
2991 |
__ z_illtrap(); |
|
2992 |
__ z_bru(is_badState); |
|
2993 |
BTB_END( is_badStateD, bsize, "putfield_or_static:is_badStateD"); |
|
2994 |
BTB_BEGIN(is_badStateE, bsize, "putfield_or_static:is_badStateE"); |
|
2995 |
__ z_illtrap(); |
|
2996 |
__ z_bru(is_badState); |
|
2997 |
BTB_END( is_badStateE, bsize, "putfield_or_static:is_badStateE"); |
|
2998 |
BTB_BEGIN(is_badStateF, bsize, "putfield_or_static:is_badStateF"); |
|
2999 |
__ z_illtrap(); |
|
3000 |
__ z_bru(is_badState); |
|
3001 |
BTB_END( is_badStateF, bsize, "putfield_or_static:is_badStateF"); |
|
3002 |
||
3003 |
__ align_address(64); |
|
3004 |
BIND(is_badState); // Do this outside branch table. Needs a lot of space. |
|
3005 |
{ |
|
3006 |
unsigned int b_off = __ offset(); |
|
3007 |
if (is_static) __ stop_static("Bad state in putstatic"); |
|
3008 |
else __ stop_static("Bad state in putfield"); |
|
3009 |
unsigned int e_off = __ offset(); |
|
3010 |
} |
|
3011 |
||
3012 |
__ align_address(64); |
|
3013 |
BIND(atosHandler); // Oops are really complicated to handle. |
|
3014 |
// There is a lot of code generated. |
|
3015 |
// Therefore: generate the handler outside of branch table. |
|
3016 |
// There is no performance penalty. The additional branch |
|
3017 |
// to here is compensated for by the fallthru to "Done". |
|
3018 |
{ |
|
3019 |
unsigned int b_off = __ offset(); |
|
3020 |
__ pop(atos); |
|
3021 |
if (!is_static) { |
|
3022 |
pop_and_check_object(obj); |
|
3023 |
} |
|
3024 |
// Store into the field |
|
3025 |
do_oop_store(_masm, obj, off, Z_tos, false, |
|
3026 |
oopStore_tmp1, oopStore_tmp2, oopStore_tmp3, _bs->kind(), false); |
|
3027 |
if (do_rewrite) { |
|
3028 |
patch_bytecode(Bytecodes::_fast_aputfield, bc, Z_ARG5, true, byte_no); |
|
3029 |
} |
|
3030 |
// __ z_bru(Done); // fallthru |
|
3031 |
unsigned int e_off = __ offset(); |
|
3032 |
} |
|
3033 |
||
3034 |
BIND(Done); |
|
3035 |
||
3036 |
// Check for volatile store. |
|
3037 |
Label notVolatile; |
|
3038 |
||
3039 |
__ testbit(Z_ARG4, ConstantPoolCacheEntry::is_volatile_shift); |
|
3040 |
__ z_brz(notVolatile); |
|
3041 |
__ z_fence(); |
|
3042 |
||
3043 |
BIND(notVolatile); |
|
3044 |
} |
|
3045 |
||
3046 |
void TemplateTable::putfield(int byte_no) { |
|
3047 |
BLOCK_COMMENT("putfield {"); |
|
3048 |
putfield_or_static(byte_no, false); |
|
3049 |
BLOCK_COMMENT("} putfield"); |
|
3050 |
} |
|
3051 |
||
3052 |
void TemplateTable::nofast_putfield(int byte_no) { |
|
3053 |
putfield_or_static(byte_no, false, may_not_rewrite); |
|
3054 |
} |
|
3055 |
||
3056 |
void TemplateTable::putstatic(int byte_no) { |
|
3057 |
BLOCK_COMMENT("putstatic {"); |
|
3058 |
putfield_or_static(byte_no, true); |
|
3059 |
BLOCK_COMMENT("} putstatic"); |
|
3060 |
} |
|
3061 |
||
3062 |
// Push the tos value back to the stack. |
|
3063 |
// gc will find oops there and update. |
|
3064 |
void TemplateTable::jvmti_post_fast_field_mod() { |
|
3065 |
||
3066 |
if (!JvmtiExport::can_post_field_modification()) { |
|
3067 |
return; |
|
3068 |
} |
|
3069 |
||
3070 |
// Check to see if a field modification watch has been set before |
|
3071 |
// we take the time to call into the VM. |
|
3072 |
Label exit; |
|
3073 |
||
3074 |
BLOCK_COMMENT("jvmti_post_fast_field_mod {"); |
|
3075 |
||
3076 |
__ load_absolute_address(Z_R1_scratch, |
|
3077 |
(address) JvmtiExport::get_field_modification_count_addr()); |
|
3078 |
__ load_and_test_int(Z_R0_scratch, Address(Z_R1_scratch)); |
|
3079 |
__ z_brz(exit); |
|
3080 |
||
3081 |
Register obj = Z_tmp_1; |
|
3082 |
||
3083 |
__ pop_ptr(obj); // Copy the object pointer from tos. |
|
3084 |
__ verify_oop(obj); |
|
3085 |
__ push_ptr(obj); // Put the object pointer back on tos. |
|
3086 |
||
3087 |
// Save tos values before call_VM() clobbers them. Since we have |
|
3088 |
// to do it for every data type, we use the saved values as the |
|
3089 |
// jvalue object. |
|
3090 |
switch (bytecode()) { // Load values into the jvalue object. |
|
3091 |
case Bytecodes::_fast_aputfield: |
|
3092 |
__ push_ptr(Z_tos); |
|
3093 |
break; |
|
3094 |
case Bytecodes::_fast_bputfield: |
|
3095 |
case Bytecodes::_fast_zputfield: |
|
3096 |
case Bytecodes::_fast_sputfield: |
|
3097 |
case Bytecodes::_fast_cputfield: |
|
3098 |
case Bytecodes::_fast_iputfield: |
|
3099 |
__ push_i(Z_tos); |
|
3100 |
break; |
|
3101 |
case Bytecodes::_fast_dputfield: |
|
3102 |
__ push_d(); |
|
3103 |
break; |
|
3104 |
case Bytecodes::_fast_fputfield: |
|
3105 |
__ push_f(); |
|
3106 |
break; |
|
3107 |
case Bytecodes::_fast_lputfield: |
|
3108 |
__ push_l(Z_tos); |
|
3109 |
break; |
|
3110 |
||
3111 |
default: |
|
3112 |
ShouldNotReachHere(); |
|
3113 |
} |
|
3114 |
||
3115 |
// jvalue on the stack |
|
3116 |
__ load_address(Z_ARG4, Address(Z_esp, Interpreter::stackElementSize)); |
|
3117 |
// Access constant pool cache entry. |
|
3118 |
__ get_cache_entry_pointer_at_bcp(Z_ARG3, Z_tos, 1); |
|
3119 |
__ verify_oop(obj); |
|
3120 |
||
3121 |
// obj : object pointer copied above |
|
3122 |
// Z_ARG3: cache entry pointer |
|
3123 |
// Z_ARG4: jvalue object on the stack |
|
3124 |
__ call_VM(noreg, |
|
3125 |
CAST_FROM_FN_PTR(address, InterpreterRuntime::post_field_modification), |
|
3126 |
obj, Z_ARG3, Z_ARG4); |
|
3127 |
||
3128 |
switch (bytecode()) { // Restore tos values. |
|
3129 |
case Bytecodes::_fast_aputfield: |
|
3130 |
__ pop_ptr(Z_tos); |
|
3131 |
break; |
|
3132 |
case Bytecodes::_fast_bputfield: |
|
3133 |
case Bytecodes::_fast_zputfield: |
|
3134 |
case Bytecodes::_fast_sputfield: |
|
3135 |
case Bytecodes::_fast_cputfield: |
|
3136 |
case Bytecodes::_fast_iputfield: |
|
3137 |
__ pop_i(Z_tos); |
|
3138 |
break; |
|
3139 |
case Bytecodes::_fast_dputfield: |
|
3140 |
__ pop_d(Z_ftos); |
|
3141 |
break; |
|
3142 |
case Bytecodes::_fast_fputfield: |
|
3143 |
__ pop_f(Z_ftos); |
|
3144 |
break; |
|
3145 |
case Bytecodes::_fast_lputfield: |
|
3146 |
__ pop_l(Z_tos); |
|
3147 |
break; |
|
3148 |
} |
|
3149 |
||
3150 |
__ bind(exit); |
|
3151 |
BLOCK_COMMENT("} jvmti_post_fast_field_mod"); |
|
3152 |
} |
|
3153 |
||
3154 |
void TemplateTable::fast_storefield(TosState state) { |
|
3155 |
transition(state, vtos); |
|
3156 |
||
3157 |
ByteSize base = ConstantPoolCache::base_offset(); |
|
3158 |
jvmti_post_fast_field_mod(); |
|
3159 |
||
3160 |
// Access constant pool cache. |
|
3161 |
Register cache = Z_tmp_1; |
|
3162 |
Register index = Z_tmp_2; |
|
3163 |
Register flags = Z_ARG5; |
|
3164 |
||
3165 |
// Index comes in bytes, don't shift afterwards! |
|
3166 |
__ get_cache_and_index_at_bcp(cache, index, 1); |
|
3167 |
||
3168 |
// Test for volatile. |
|
3169 |
assert(!flags->is_volatile(), "do_oop_store could perform leaf RT call"); |
|
3170 |
__ z_lg(flags, Address(cache, index, base + ConstantPoolCacheEntry::flags_offset())); |
|
3171 |
||
3172 |
// Replace index with field offset from cache entry. |
|
3173 |
Register field_offset = index; |
|
3174 |
__ z_lg(field_offset, Address(cache, index, base + ConstantPoolCacheEntry::f2_offset())); |
|
3175 |
||
3176 |
// Get object from stack. |
|
3177 |
Register obj = cache; |
|
3178 |
||
3179 |
pop_and_check_object(obj); |
|
3180 |
||
3181 |
// field address |
|
3182 |
const Address field(obj, field_offset); |
|
3183 |
||
3184 |
// access field |
|
3185 |
switch (bytecode()) { |
|
3186 |
case Bytecodes::_fast_aputfield: |
|
3187 |
do_oop_store(_masm, obj, field_offset, Z_tos, false, |
|
3188 |
Z_ARG2, Z_ARG3, Z_ARG4, _bs->kind(), false); |
|
3189 |
break; |
|
3190 |
case Bytecodes::_fast_lputfield: |
|
3191 |
__ reg2mem_opt(Z_tos, field); |
|
3192 |
break; |
|
3193 |
case Bytecodes::_fast_iputfield: |
|
3194 |
__ reg2mem_opt(Z_tos, field, false); |
|
3195 |
break; |
|
3196 |
case Bytecodes::_fast_zputfield: |
|
3197 |
__ z_nilf(Z_tos, 0x1); |
|
3198 |
// fall through to bputfield |
|
3199 |
case Bytecodes::_fast_bputfield: |
|
3200 |
__ z_stc(Z_tos, field); |
|
3201 |
break; |
|
3202 |
case Bytecodes::_fast_sputfield: |
|
3203 |
// fall through |
|
3204 |
case Bytecodes::_fast_cputfield: |
|
3205 |
__ z_sth(Z_tos, field); |
|
3206 |
break; |
|
3207 |
case Bytecodes::_fast_fputfield: |
|
3208 |
__ freg2mem_opt(Z_ftos, field, false); |
|
3209 |
break; |
|
3210 |
case Bytecodes::_fast_dputfield: |
|
3211 |
__ freg2mem_opt(Z_ftos, field); |
|
3212 |
break; |
|
3213 |
default: |
|
3214 |
ShouldNotReachHere(); |
|
3215 |
} |
|
3216 |
||
3217 |
// Check for volatile store. |
|
3218 |
Label notVolatile; |
|
3219 |
||
3220 |
__ testbit(flags, ConstantPoolCacheEntry::is_volatile_shift); |
|
3221 |
__ z_brz(notVolatile); |
|
3222 |
__ z_fence(); |
|
3223 |
||
3224 |
__ bind(notVolatile); |
|
3225 |
} |
|
3226 |
||
3227 |
void TemplateTable::fast_accessfield(TosState state) { |
|
3228 |
transition(atos, state); |
|
3229 |
||
3230 |
Register obj = Z_tos; |
|
3231 |
||
3232 |
// Do the JVMTI work here to avoid disturbing the register state below |
|
3233 |
if (JvmtiExport::can_post_field_access()) { |
|
3234 |
// Check to see if a field access watch has been set before we |
|
3235 |
// take the time to call into the VM. |
|
3236 |
Label cont; |
|
3237 |
||
3238 |
__ load_absolute_address(Z_R1_scratch, |
|
3239 |
(address)JvmtiExport::get_field_access_count_addr()); |
|
3240 |
__ load_and_test_int(Z_R0_scratch, Address(Z_R1_scratch)); |
|
3241 |
__ z_brz(cont); |
|
3242 |
||
3243 |
// Access constant pool cache entry. |
|
3244 |
||
3245 |
__ get_cache_entry_pointer_at_bcp(Z_ARG3, Z_tmp_1, 1); |
|
3246 |
__ verify_oop(obj); |
|
3247 |
__ push_ptr(obj); // Save object pointer before call_VM() clobbers it. |
|
3248 |
__ z_lgr(Z_ARG2, obj); |
|
3249 |
||
3250 |
// Z_ARG2: object pointer copied above |
|
3251 |
// Z_ARG3: cache entry pointer |
|
3252 |
__ call_VM(noreg, |
|
3253 |
CAST_FROM_FN_PTR(address, InterpreterRuntime::post_field_access), |
|
3254 |
Z_ARG2, Z_ARG3); |
|
3255 |
__ pop_ptr(obj); // Restore object pointer. |
|
3256 |
||
3257 |
__ bind(cont); |
|
3258 |
} |
|
3259 |
||
3260 |
// Access constant pool cache. |
|
3261 |
Register cache = Z_tmp_1; |
|
3262 |
Register index = Z_tmp_2; |
|
3263 |
||
3264 |
// Index comes in bytes, don't shift afterwards! |
|
3265 |
__ get_cache_and_index_at_bcp(cache, index, 1); |
|
3266 |
// Replace index with field offset from cache entry. |
|
3267 |
__ mem2reg_opt(index, |
|
3268 |
Address(cache, index, |
|
3269 |
ConstantPoolCache::base_offset() + ConstantPoolCacheEntry::f2_offset())); |
|
3270 |
||
3271 |
__ verify_oop(obj); |
|
3272 |
__ null_check(obj); |
|
3273 |
||
3274 |
Address field(obj, index); |
|
3275 |
||
3276 |
// access field |
|
3277 |
switch (bytecode()) { |
|
3278 |
case Bytecodes::_fast_agetfield: |
|
3279 |
__ load_heap_oop(Z_tos, field); |
|
3280 |
__ verify_oop(Z_tos); |
|
3281 |
return; |
|
3282 |
case Bytecodes::_fast_lgetfield: |
|
3283 |
__ mem2reg_opt(Z_tos, field); |
|
3284 |
return; |
|
3285 |
case Bytecodes::_fast_igetfield: |
|
3286 |
__ mem2reg_opt(Z_tos, field, false); |
|
3287 |
return; |
|
3288 |
case Bytecodes::_fast_bgetfield: |
|
3289 |
__ z_lb(Z_tos, field); |
|
3290 |
return; |
|
3291 |
case Bytecodes::_fast_sgetfield: |
|
3292 |
__ z_lh(Z_tos, field); |
|
3293 |
return; |
|
3294 |
case Bytecodes::_fast_cgetfield: |
|
3295 |
__ z_llgh(Z_tos, field); // Load into 64 bits, works on all CPUs. |
|
3296 |
return; |
|
3297 |
case Bytecodes::_fast_fgetfield: |
|
3298 |
__ mem2freg_opt(Z_ftos, field, false); |
|
3299 |
return; |
|
3300 |
case Bytecodes::_fast_dgetfield: |
|
3301 |
__ mem2freg_opt(Z_ftos, field); |
|
3302 |
return; |
|
3303 |
default: |
|
3304 |
ShouldNotReachHere(); |
|
3305 |
} |
|
3306 |
} |
|
3307 |
||
3308 |
void TemplateTable::fast_xaccess(TosState state) { |
|
3309 |
transition(vtos, state); |
|
3310 |
||
3311 |
Register receiver = Z_tos; |
|
3312 |
// Get receiver. |
|
3313 |
__ mem2reg_opt(Z_tos, aaddress(0)); |
|
3314 |
||
3315 |
// Access constant pool cache. |
|
3316 |
Register cache = Z_tmp_1; |
|
3317 |
Register index = Z_tmp_2; |
|
3318 |
||
3319 |
// Index comes in bytes, don't shift afterwards! |
|
3320 |
__ get_cache_and_index_at_bcp(cache, index, 2); |
|
3321 |
// Replace index with field offset from cache entry. |
|
3322 |
__ mem2reg_opt(index, |
|
3323 |
Address(cache, index, |
|
3324 |
ConstantPoolCache::base_offset() + ConstantPoolCacheEntry::f2_offset())); |
|
3325 |
||
3326 |
// Make sure exception is reported in correct bcp range (getfield is |
|
3327 |
// next instruction). |
|
3328 |
__ add2reg(Z_bcp, 1); |
|
3329 |
__ null_check(receiver); |
|
3330 |
switch (state) { |
|
3331 |
case itos: |
|
3332 |
__ mem2reg_opt(Z_tos, Address(receiver, index), false); |
|
3333 |
break; |
|
3334 |
case atos: |
|
3335 |
__ load_heap_oop(Z_tos, Address(receiver, index)); |
|
3336 |
__ verify_oop(Z_tos); |
|
3337 |
break; |
|
3338 |
case ftos: |
|
3339 |
__ mem2freg_opt(Z_ftos, Address(receiver, index)); |
|
3340 |
break; |
|
3341 |
default: |
|
3342 |
ShouldNotReachHere(); |
|
3343 |
} |
|
3344 |
||
3345 |
// Reset bcp to original position. |
|
3346 |
__ add2reg(Z_bcp, -1); |
|
3347 |
} |
|
3348 |
||
3349 |
//----------------------------------------------------------------------------- |
|
3350 |
// Calls |
|
3351 |
||
3352 |
void TemplateTable::prepare_invoke(int byte_no, |
|
3353 |
Register method, // linked method (or i-klass) |
|
3354 |
Register index, // itable index, MethodType, etc. |
|
3355 |
Register recv, // If caller wants to see it. |
|
3356 |
Register flags) { // If caller wants to test it. |
|
3357 |
// Determine flags. |
|
3358 |
const Bytecodes::Code code = bytecode(); |
|
3359 |
const bool is_invokeinterface = code == Bytecodes::_invokeinterface; |
|
3360 |
const bool is_invokedynamic = code == Bytecodes::_invokedynamic; |
|
3361 |
const bool is_invokehandle = code == Bytecodes::_invokehandle; |
|
3362 |
const bool is_invokevirtual = code == Bytecodes::_invokevirtual; |
|
3363 |
const bool is_invokespecial = code == Bytecodes::_invokespecial; |
|
3364 |
const bool load_receiver = (recv != noreg); |
|
3365 |
assert(load_receiver == (code != Bytecodes::_invokestatic && code != Bytecodes::_invokedynamic), ""); |
|
3366 |
||
3367 |
// Setup registers & access constant pool cache. |
|
3368 |
if (recv == noreg) { recv = Z_ARG1; } |
|
3369 |
if (flags == noreg) { flags = Z_ARG2; } |
|
3370 |
assert_different_registers(method, Z_R14, index, recv, flags); |
|
3371 |
||
3372 |
BLOCK_COMMENT("prepare_invoke {"); |
|
3373 |
||
3374 |
load_invoke_cp_cache_entry(byte_no, method, index, flags, is_invokevirtual, false, is_invokedynamic); |
|
3375 |
||
3376 |
// Maybe push appendix to arguments. |
|
3377 |
if (is_invokedynamic || is_invokehandle) { |
|
3378 |
Label L_no_push; |
|
3379 |
Register resolved_reference = Z_R1_scratch; |
|
3380 |
__ testbit(flags, ConstantPoolCacheEntry::has_appendix_shift); |
|
3381 |
__ z_bfalse(L_no_push); |
|
3382 |
// Push the appendix as a trailing parameter. |
|
3383 |
// This must be done before we get the receiver, |
|
3384 |
// since the parameter_size includes it. |
|
3385 |
__ load_resolved_reference_at_index(resolved_reference, index); |
|
3386 |
__ verify_oop(resolved_reference); |
|
3387 |
__ push_ptr(resolved_reference); // Push appendix (MethodType, CallSite, etc.). |
|
3388 |
__ bind(L_no_push); |
|
3389 |
} |
|
3390 |
||
3391 |
// Load receiver if needed (after appendix is pushed so parameter size is correct). |
|
3392 |
if (load_receiver) { |
|
3393 |
assert(!is_invokedynamic, ""); |
|
3394 |
// recv := int2long(flags & ConstantPoolCacheEntry::parameter_size_mask) << 3 |
|
3395 |
// Flags is zero-extended int2long when loaded during load_invoke_cp_cache_entry(). |
|
3396 |
// Only the least significant byte (psize) of flags is used. |
|
3397 |
{ |
|
3398 |
const unsigned int logSES = Interpreter::logStackElementSize; |
|
3399 |
const int bit_shift = logSES; |
|
3400 |
const int r_bitpos = 63 - bit_shift; |
|
3401 |
const int l_bitpos = r_bitpos - ConstantPoolCacheEntry::parameter_size_bits + 1; |
|
3402 |
const int n_rotate = bit_shift; |
|
3403 |
assert(ConstantPoolCacheEntry::parameter_size_mask == 255, "adapt bitpositions"); |
|
3404 |
__ rotate_then_insert(recv, flags, l_bitpos, r_bitpos, n_rotate, true); |
|
3405 |
} |
|
3406 |
// Recv now contains #arguments * StackElementSize. |
|
3407 |
||
3408 |
Address recv_addr(Z_esp, recv); |
|
3409 |
__ z_lg(recv, recv_addr); |
|
3410 |
__ verify_oop(recv); |
|
3411 |
} |
|
3412 |
||
3413 |
// Compute return type. |
|
3414 |
// ret_type is used by callers (invokespecial, invokestatic) at least. |
|
3415 |
Register ret_type = Z_R1_scratch; |
|
3416 |
assert_different_registers(ret_type, method); |
|
3417 |
||
3418 |
const address table_addr = (address)Interpreter::invoke_return_entry_table_for(code); |
|
3419 |
__ load_absolute_address(Z_R14, table_addr); |
|
3420 |
||
3421 |
{ |
|
3422 |
const int bit_shift = LogBytesPerWord; // Size of each table entry. |
|
3423 |
const int r_bitpos = 63 - bit_shift; |
|
3424 |
const int l_bitpos = r_bitpos - ConstantPoolCacheEntry::tos_state_bits + 1; |
|
3425 |
const int n_rotate = bit_shift-ConstantPoolCacheEntry::tos_state_shift; |
|
3426 |
__ rotate_then_insert(ret_type, flags, l_bitpos, r_bitpos, n_rotate, true); |
|
3427 |
// Make sure we don't need to mask flags for tos_state after the above shift. |
|
3428 |
ConstantPoolCacheEntry::verify_tos_state_shift(); |
|
3429 |
} |
|
3430 |
||
3431 |
__ z_lg(Z_R14, Address(Z_R14, ret_type)); // Load return address. |
|
3432 |
BLOCK_COMMENT("} prepare_invoke"); |
|
3433 |
} |
|
3434 |
||
3435 |
||
3436 |
void TemplateTable::invokevirtual_helper(Register index, |
|
3437 |
Register recv, |
|
3438 |
Register flags) { |
|
3439 |
// Uses temporary registers Z_tmp_2, Z_ARG4. |
|
3440 |
assert_different_registers(index, recv, Z_tmp_2, Z_ARG4); |
|
3441 |
||
3442 |
// Test for an invoke of a final method. |
|
3443 |
Label notFinal; |
|
3444 |
||
3445 |
BLOCK_COMMENT("invokevirtual_helper {"); |
|
3446 |
||
3447 |
__ testbit(flags, ConstantPoolCacheEntry::is_vfinal_shift); |
|
3448 |
__ z_brz(notFinal); |
|
3449 |
||
3450 |
const Register method = index; // Method must be Z_ARG3. |
|
3451 |
assert(method == Z_ARG3, "method must be second argument for interpreter calling convention"); |
|
3452 |
||
3453 |
// Do the call - the index is actually the method to call. |
|
3454 |
// That is, f2 is a vtable index if !is_vfinal, else f2 is a method. |
|
3455 |
||
3456 |
// It's final, need a null check here! |
|
3457 |
__ null_check(recv); |
|
3458 |
||
3459 |
// Profile this call. |
|
3460 |
__ profile_final_call(Z_tmp_2); |
|
3461 |
__ profile_arguments_type(Z_tmp_2, method, Z_ARG5, true); // Argument type profiling. |
|
3462 |
__ jump_from_interpreted(method, Z_tmp_2); |
|
3463 |
||
3464 |
__ bind(notFinal); |
|
3465 |
||
3466 |
// Get receiver klass. |
|
3467 |
__ null_check(recv, Z_R0_scratch, oopDesc::klass_offset_in_bytes()); |
|
3468 |
__ load_klass(Z_tmp_2, recv); |
|
3469 |
||
3470 |
// Profile this call. |
|
3471 |
__ profile_virtual_call(Z_tmp_2, Z_ARG4, Z_ARG5); |
|
3472 |
||
3473 |
// Get target method & entry point. |
|
3474 |
__ z_sllg(index, index, exact_log2(vtableEntry::size_in_bytes())); |
|
3475 |
__ mem2reg_opt(method, |
|
3476 |
Address(Z_tmp_2, index, |
|
46280
6eef3d367beb
8175269: [s390] cleanup calls to vtable_start_offset() and vtable_length_offset()
lucy
parents:
42556
diff
changeset
|
3477 |
Klass::vtable_start_offset() + in_ByteSize(vtableEntry::method_offset_in_bytes()))); |
42065 | 3478 |
__ profile_arguments_type(Z_ARG4, method, Z_ARG5, true); |
3479 |
__ jump_from_interpreted(method, Z_ARG4); |
|
3480 |
BLOCK_COMMENT("} invokevirtual_helper"); |
|
3481 |
} |
|
3482 |
||
3483 |
void TemplateTable::invokevirtual(int byte_no) { |
|
3484 |
transition(vtos, vtos); |
|
3485 |
||
3486 |
assert(byte_no == f2_byte, "use this argument"); |
|
3487 |
prepare_invoke(byte_no, |
|
3488 |
Z_ARG3, // method or vtable index |
|
3489 |
noreg, // unused itable index |
|
3490 |
Z_ARG1, // recv |
|
3491 |
Z_ARG2); // flags |
|
3492 |
||
3493 |
// Z_ARG3 : index |
|
3494 |
// Z_ARG1 : receiver |
|
3495 |
// Z_ARG2 : flags |
|
3496 |
invokevirtual_helper(Z_ARG3, Z_ARG1, Z_ARG2); |
|
3497 |
} |
|
3498 |
||
3499 |
void TemplateTable::invokespecial(int byte_no) { |
|
3500 |
transition(vtos, vtos); |
|
3501 |
||
3502 |
assert(byte_no == f1_byte, "use this argument"); |
|
3503 |
Register Rmethod = Z_tmp_2; |
|
3504 |
prepare_invoke(byte_no, Rmethod, noreg, // Get f1 method. |
|
3505 |
Z_ARG3); // Get receiver also for null check. |
|
3506 |
__ verify_oop(Z_ARG3); |
|
3507 |
__ null_check(Z_ARG3); |
|
3508 |
// Do the call. |
|
3509 |
__ profile_call(Z_ARG2); |
|
3510 |
__ profile_arguments_type(Z_ARG2, Rmethod, Z_ARG5, false); |
|
3511 |
__ jump_from_interpreted(Rmethod, Z_R1_scratch); |
|
3512 |
} |
|
3513 |
||
3514 |
void TemplateTable::invokestatic(int byte_no) { |
|
3515 |
transition(vtos, vtos); |
|
3516 |
||
3517 |
assert(byte_no == f1_byte, "use this argument"); |
|
3518 |
Register Rmethod = Z_tmp_2; |
|
3519 |
prepare_invoke(byte_no, Rmethod); // Get f1 method. |
|
3520 |
// Do the call. |
|
3521 |
__ profile_call(Z_ARG2); |
|
3522 |
__ profile_arguments_type(Z_ARG2, Rmethod, Z_ARG5, false); |
|
3523 |
__ jump_from_interpreted(Rmethod, Z_R1_scratch); |
|
3524 |
} |
|
3525 |
||
3526 |
// Outdated feature, and we don't support it. |
|
3527 |
void TemplateTable::fast_invokevfinal(int byte_no) { |
|
3528 |
transition(vtos, vtos); |
|
3529 |
assert(byte_no == f2_byte, "use this argument"); |
|
3530 |
__ stop("fast_invokevfinal not used on linuxs390x"); |
|
3531 |
} |
|
3532 |
||
3533 |
void TemplateTable::invokeinterface(int byte_no) { |
|
3534 |
transition(vtos, vtos); |
|
3535 |
||
3536 |
assert(byte_no == f1_byte, "use this argument"); |
|
3537 |
Register interface = Z_tos; |
|
3538 |
Register index = Z_ARG3; |
|
3539 |
Register receiver = Z_tmp_1; |
|
3540 |
Register flags = Z_ARG5; |
|
3541 |
||
3542 |
BLOCK_COMMENT("invokeinterface {"); |
|
3543 |
||
3544 |
// Destroys Z_ARG1 and Z_ARG2, thus use Z_ARG4 and copy afterwards. |
|
3545 |
prepare_invoke(byte_no, Z_ARG4, index, // Get f1 klassOop, f2 itable index. |
|
3546 |
receiver, flags); |
|
3547 |
||
3548 |
// Z_R14 (== Z_bytecode) : return entry |
|
3549 |
||
3550 |
__ z_lgr(interface, Z_ARG4); |
|
3551 |
||
3552 |
// Special case of invokeinterface called for virtual method of |
|
3553 |
// java.lang.Object. See cpCacheOop.cpp for details. |
|
3554 |
// This code isn't produced by javac, but could be produced by |
|
3555 |
// another compliant java compiler. |
|
3556 |
Label notMethod; |
|
3557 |
__ testbit(flags, ConstantPoolCacheEntry::is_forced_virtual_shift); |
|
3558 |
__ z_brz(notMethod); |
|
3559 |
invokevirtual_helper(index, receiver, flags); |
|
3560 |
__ bind(notMethod); |
|
3561 |
||
3562 |
// Get receiver klass into klass - also a null check. |
|
3563 |
Register klass = flags; |
|
3564 |
||
3565 |
__ restore_locals(); |
|
3566 |
__ load_klass(klass, receiver); |
|
3567 |
||
3568 |
// Profile this call. |
|
3569 |
__ profile_virtual_call(klass, Z_ARG2/*mdp*/, Z_ARG4/*scratch*/); |
|
3570 |
||
3571 |
NearLabel no_such_interface, no_such_method; |
|
3572 |
Register method = Z_tmp_2; |
|
3573 |
||
3574 |
// TK 2010-08-24: save the index to Z_ARG4. needed in case of an error |
|
3575 |
// in throw_AbstractMethodErrorByTemplateTable |
|
3576 |
__ z_lgr(Z_ARG4, index); |
|
3577 |
// TK 2011-03-24: copy also klass because it could be changed in |
|
3578 |
// lookup_interface_method |
|
3579 |
__ z_lgr(Z_ARG2, klass); |
|
3580 |
__ lookup_interface_method(// inputs: rec. class, interface, itable index |
|
3581 |
klass, interface, index, |
|
3582 |
// outputs: method, scan temp. reg |
|
3583 |
method, Z_tmp_2, Z_R1_scratch, |
|
3584 |
no_such_interface); |
|
3585 |
||
3586 |
// Check for abstract method error. |
|
3587 |
// Note: This should be done more efficiently via a throw_abstract_method_error |
|
3588 |
// interpreter entry point and a conditional jump to it in case of a null |
|
3589 |
// method. |
|
3590 |
__ compareU64_and_branch(method, (intptr_t) 0, |
|
3591 |
Assembler::bcondZero, no_such_method); |
|
3592 |
||
3593 |
__ profile_arguments_type(Z_ARG3, method, Z_ARG5, true); |
|
3594 |
||
3595 |
// Do the call. |
|
3596 |
__ jump_from_interpreted(method, Z_ARG5); |
|
3597 |
__ should_not_reach_here(); |
|
3598 |
||
3599 |
// exception handling code follows... |
|
3600 |
// Note: Must restore interpreter registers to canonical |
|
3601 |
// state for exception handling to work correctly! |
|
3602 |
||
3603 |
__ bind(no_such_method); |
|
3604 |
||
3605 |
// Throw exception. |
|
3606 |
__ restore_bcp(); // Bcp must be correct for exception handler (was destroyed). |
|
3607 |
__ restore_locals(); // Make sure locals pointer is correct as well (was destroyed). |
|
3608 |
// TK 2010-08-24: Call throw_AbstractMethodErrorByTemplateTable now with the |
|
3609 |
// relevant information for generating a better error message |
|
3610 |
__ call_VM(noreg, |
|
3611 |
CAST_FROM_FN_PTR(address, |
|
3612 |
InterpreterRuntime::throw_AbstractMethodError), |
|
3613 |
Z_ARG2, interface, Z_ARG4); |
|
3614 |
// The call_VM checks for exception, so we should never return here. |
|
3615 |
__ should_not_reach_here(); |
|
3616 |
||
3617 |
__ bind(no_such_interface); |
|
3618 |
||
3619 |
// Throw exception. |
|
3620 |
__ restore_bcp(); // Bcp must be correct for exception handler (was destroyed). |
|
3621 |
__ restore_locals(); // Make sure locals pointer is correct as well (was destroyed). |
|
3622 |
// TK 2010-08-24: Call throw_IncompatibleClassChangeErrorByTemplateTable now with the |
|
3623 |
// relevant information for generating a better error message |
|
3624 |
__ call_VM(noreg, |
|
3625 |
CAST_FROM_FN_PTR(address, |
|
3626 |
InterpreterRuntime::throw_IncompatibleClassChangeError), |
|
3627 |
Z_ARG2, interface); |
|
3628 |
// The call_VM checks for exception, so we should never return here. |
|
3629 |
__ should_not_reach_here(); |
|
3630 |
||
3631 |
BLOCK_COMMENT("} invokeinterface"); |
|
3632 |
return; |
|
3633 |
} |
|
3634 |
||
3635 |
void TemplateTable::invokehandle(int byte_no) { |
|
3636 |
transition(vtos, vtos); |
|
3637 |
||
3638 |
const Register method = Z_tmp_2; |
|
3639 |
const Register recv = Z_ARG5; |
|
3640 |
const Register mtype = Z_tmp_1; |
|
3641 |
prepare_invoke(byte_no, |
|
3642 |
method, mtype, // Get f2 method, f1 MethodType. |
|
3643 |
recv); |
|
3644 |
__ verify_method_ptr(method); |
|
3645 |
__ verify_oop(recv); |
|
3646 |
__ null_check(recv); |
|
3647 |
||
3648 |
// Note: Mtype is already pushed (if necessary) by prepare_invoke. |
|
3649 |
||
3650 |
// FIXME: profile the LambdaForm also. |
|
3651 |
__ profile_final_call(Z_ARG2); |
|
3652 |
__ profile_arguments_type(Z_ARG3, method, Z_ARG5, true); |
|
3653 |
||
3654 |
__ jump_from_interpreted(method, Z_ARG3); |
|
3655 |
} |
|
3656 |
||
3657 |
void TemplateTable::invokedynamic(int byte_no) { |
|
3658 |
transition(vtos, vtos); |
|
3659 |
||
3660 |
const Register Rmethod = Z_tmp_2; |
|
3661 |
const Register Rcallsite = Z_tmp_1; |
|
3662 |
||
3663 |
prepare_invoke(byte_no, Rmethod, Rcallsite); |
|
3664 |
||
3665 |
// Rmethod: CallSite object (from f1) |
|
3666 |
// Rcallsite: MH.linkToCallSite method (from f2) |
|
3667 |
||
3668 |
// Note: Callsite is already pushed by prepare_invoke. |
|
3669 |
||
3670 |
// TODO: should make a type profile for any invokedynamic that takes a ref argument. |
|
3671 |
// Profile this call. |
|
3672 |
__ profile_call(Z_ARG2); |
|
3673 |
__ profile_arguments_type(Z_ARG2, Rmethod, Z_ARG5, false); |
|
3674 |
__ jump_from_interpreted(Rmethod, Z_ARG2); |
|
3675 |
} |
|
3676 |
||
3677 |
//----------------------------------------------------------------------------- |
|
3678 |
// Allocation |
|
3679 |
||
3680 |
// Original comment on "allow_shared_alloc": |
|
3681 |
// Always go the slow path. |
|
3682 |
// + Eliminated optimization within the template-based interpreter: |
|
3683 |
// If an allocation is done within the interpreter without using |
|
3684 |
// tlabs, the interpreter tries to do the allocation directly |
|
3685 |
// on the heap. |
|
3686 |
// + That means the profiling hooks are not considered and allocations |
|
3687 |
// get lost for the profiling framework. |
|
3688 |
// + However, we do not think that this optimization is really needed, |
|
3689 |
// so we always go now the slow path through the VM in this case -- |
|
3690 |
// spec jbb2005 shows no measurable performance degradation. |
|
3691 |
void TemplateTable::_new() { |
|
3692 |
transition(vtos, atos); |
|
3693 |
address prev_instr_address = NULL; |
|
3694 |
Register tags = Z_tmp_1; |
|
3695 |
Register RallocatedObject = Z_tos; |
|
3696 |
Register cpool = Z_ARG2; |
|
3697 |
Register tmp = Z_ARG3; // RobjectFields==tmp and Rsize==offset must be a register pair. |
|
3698 |
Register offset = Z_ARG4; |
|
3699 |
Label slow_case; |
|
3700 |
Label done; |
|
3701 |
Label initialize_header; |
|
3702 |
Label initialize_object; // Including clearing the fields. |
|
3703 |
Label allocate_shared; |
|
3704 |
||
3705 |
BLOCK_COMMENT("TemplateTable::_new {"); |
|
3706 |
__ get_2_byte_integer_at_bcp(offset/*dest*/, 1, InterpreterMacroAssembler::Unsigned); |
|
3707 |
__ get_cpool_and_tags(cpool, tags); |
|
3708 |
// Make sure the class we're about to instantiate has been resolved. |
|
3709 |
// This is done before loading InstanceKlass to be consistent with the order |
|
3710 |
// how Constant Pool is updated (see ConstantPool::klass_at_put). |
|
3711 |
const int tags_offset = Array<u1>::base_offset_in_bytes(); |
|
3712 |
__ load_address(tmp, Address(tags, offset, tags_offset)); |
|
3713 |
__ z_cli(0, tmp, JVM_CONSTANT_Class); |
|
3714 |
__ z_brne(slow_case); |
|
3715 |
||
3716 |
__ z_sllg(offset, offset, LogBytesPerWord); // Convert to to offset. |
|
3717 |
// Get InstanceKlass. |
|
3718 |
Register iklass = cpool; |
|
46427
54713555867e
8171392: Move Klass pointers outside of ConstantPool entries so ConstantPool can be read-only
iklam
parents:
46280
diff
changeset
|
3719 |
__ load_resolved_klass_at_offset(cpool, offset, iklass); |
42065 | 3720 |
|
3721 |
// Make sure klass is initialized & doesn't have finalizer. |
|
3722 |
// Make sure klass is fully initialized. |
|
3723 |
const int state_offset = in_bytes(InstanceKlass::init_state_offset()); |
|
3724 |
if (Immediate::is_uimm12(state_offset)) { |
|
3725 |
__ z_cli(state_offset, iklass, InstanceKlass::fully_initialized); |
|
3726 |
} else { |
|
3727 |
__ z_cliy(state_offset, iklass, InstanceKlass::fully_initialized); |
|
3728 |
} |
|
3729 |
__ z_brne(slow_case); |
|
3730 |
||
3731 |
// Get instance_size in InstanceKlass (scaled to a count of bytes). |
|
3732 |
Register Rsize = offset; |
|
3733 |
const int mask = 1 << Klass::_lh_instance_slow_path_bit; |
|
3734 |
__ z_llgf(Rsize, Address(iklass, Klass::layout_helper_offset())); |
|
3735 |
__ z_tmll(Rsize, mask); |
|
3736 |
__ z_btrue(slow_case); |
|
3737 |
||
3738 |
// Allocate the instance |
|
3739 |
// 1) Try to allocate in the TLAB. |
|
3740 |
// 2) If fail and the object is large allocate in the shared Eden. |
|
3741 |
// 3) If the above fails (or is not applicable), go to a slow case |
|
3742 |
// (creates a new TLAB, etc.). |
|
3743 |
||
3744 |
// Always go the slow path. See comment above this template. |
|
3745 |
const bool allow_shared_alloc = false; |
|
3746 |
||
3747 |
if (UseTLAB) { |
|
3748 |
Register RoldTopValue = RallocatedObject; |
|
3749 |
Register RnewTopValue = tmp; |
|
3750 |
__ z_lg(RoldTopValue, Address(Z_thread, JavaThread::tlab_top_offset())); |
|
3751 |
__ load_address(RnewTopValue, Address(RoldTopValue, Rsize)); |
|
3752 |
__ z_cg(RnewTopValue, Address(Z_thread, JavaThread::tlab_end_offset())); |
|
3753 |
__ z_brh(allow_shared_alloc ? allocate_shared : slow_case); |
|
3754 |
__ z_stg(RnewTopValue, Address(Z_thread, JavaThread::tlab_top_offset())); |
|
3755 |
if (ZeroTLAB) { |
|
3756 |
// The fields have been already cleared. |
|
3757 |
__ z_bru(initialize_header); |
|
3758 |
} else { |
|
3759 |
// Initialize both the header and fields. |
|
3760 |
if (allow_shared_alloc) { |
|
3761 |
__ z_bru(initialize_object); |
|
3762 |
} else { |
|
3763 |
// Fallthrough to initialize_object, but assert that it is on fall through path. |
|
3764 |
prev_instr_address = __ pc(); |
|
3765 |
} |
|
3766 |
} |
|
3767 |
} |
|
3768 |
||
3769 |
if (allow_shared_alloc) { |
|
3770 |
// Allocation in shared Eden not implemented, because sapjvm allocation trace does not allow it. |
|
3771 |
Unimplemented(); |
|
3772 |
} |
|
3773 |
||
3774 |
if (UseTLAB) { |
|
3775 |
Register RobjectFields = tmp; |
|
3776 |
Register Rzero = Z_R1_scratch; |
|
3777 |
||
3778 |
assert(ZeroTLAB || prev_instr_address == __ pc(), |
|
3779 |
"must not omit jump to initialize_object above, as it is not on the fall through path"); |
|
3780 |
__ clear_reg(Rzero, true /*whole reg*/, false); // Load 0L into Rzero. Don't set CC. |
|
3781 |
||
3782 |
// The object is initialized before the header. If the object size is |
|
3783 |
// zero, go directly to the header initialization. |
|
3784 |
__ bind(initialize_object); |
|
3785 |
__ z_aghi(Rsize, (int)-sizeof(oopDesc)); // Subtract header size, set CC. |
|
3786 |
__ z_bre(initialize_header); // Jump if size of fields is zero. |
|
3787 |
||
3788 |
// Initialize object fields. |
|
3789 |
// See documentation for MVCLE instruction!!! |
|
3790 |
assert(RobjectFields->encoding() % 2 == 0, "RobjectFields must be an even register"); |
|
3791 |
assert(Rsize->encoding() == (RobjectFields->encoding()+1), |
|
3792 |
"RobjectFields and Rsize must be a register pair"); |
|
3793 |
assert(Rzero->encoding() % 2 == 1, "Rzero must be an odd register"); |
|
3794 |
||
3795 |
// Set Rzero to 0 and use it as src length, then mvcle will copy nothing |
|
3796 |
// and fill the object with the padding value 0. |
|
3797 |
__ add2reg(RobjectFields, sizeof(oopDesc), RallocatedObject); |
|
3798 |
__ move_long_ext(RobjectFields, as_Register(Rzero->encoding() - 1), 0); |
|
3799 |
||
3800 |
// Initialize object header only. |
|
3801 |
__ bind(initialize_header); |
|
3802 |
if (UseBiasedLocking) { |
|
3803 |
Register prototype = RobjectFields; |
|
3804 |
__ z_lg(prototype, Address(iklass, Klass::prototype_header_offset())); |
|
3805 |
__ z_stg(prototype, Address(RallocatedObject, oopDesc::mark_offset_in_bytes())); |
|
3806 |
} else { |
|
3807 |
__ store_const(Address(RallocatedObject, oopDesc::mark_offset_in_bytes()), |
|
3808 |
(long)markOopDesc::prototype()); |
|
3809 |
} |
|
3810 |
||
3811 |
__ store_klass_gap(Rzero, RallocatedObject); // Zero klass gap for compressed oops. |
|
3812 |
__ store_klass(iklass, RallocatedObject); // Store klass last. |
|
3813 |
||
3814 |
{ |
|
3815 |
SkipIfEqual skip(_masm, &DTraceAllocProbes, false, Z_ARG5 /*scratch*/); |
|
3816 |
// Trigger dtrace event for fastpath. |
|
3817 |
__ push(atos); // Save the return value. |
|
3818 |
__ call_VM_leaf(CAST_FROM_FN_PTR(address, SharedRuntime::dtrace_object_alloc), RallocatedObject); |
|
3819 |
__ pop(atos); // Restore the return value. |
|
3820 |
} |
|
3821 |
__ z_bru(done); |
|
3822 |
} |
|
3823 |
||
3824 |
// slow case |
|
3825 |
__ bind(slow_case); |
|
3826 |
__ get_constant_pool(Z_ARG2); |
|
3827 |
__ get_2_byte_integer_at_bcp(Z_ARG3/*dest*/, 1, InterpreterMacroAssembler::Unsigned); |
|
3828 |
call_VM(Z_tos, CAST_FROM_FN_PTR(address, InterpreterRuntime::_new), Z_ARG2, Z_ARG3); |
|
3829 |
__ verify_oop(Z_tos); |
|
3830 |
||
3831 |
// continue |
|
3832 |
__ bind(done); |
|
3833 |
||
3834 |
BLOCK_COMMENT("} TemplateTable::_new"); |
|
3835 |
} |
|
3836 |
||
3837 |
void TemplateTable::newarray() { |
|
3838 |
transition(itos, atos); |
|
3839 |
||
3840 |
// Call runtime. |
|
3841 |
__ z_llgc(Z_ARG2, at_bcp(1)); // type |
|
42556
c03d98321ad1
8169317: [s390] Various minor bug fixes and adaptions.
goetz
parents:
42065
diff
changeset
|
3842 |
__ z_lgfr(Z_ARG3, Z_tos); // size |
42065 | 3843 |
call_VM(Z_RET, |
3844 |
CAST_FROM_FN_PTR(address, InterpreterRuntime::newarray), |
|
42556
c03d98321ad1
8169317: [s390] Various minor bug fixes and adaptions.
goetz
parents:
42065
diff
changeset
|
3845 |
Z_ARG2, Z_ARG3); |
42065 | 3846 |
} |
3847 |
||
3848 |
void TemplateTable::anewarray() { |
|
3849 |
transition(itos, atos); |
|
3850 |
__ get_2_byte_integer_at_bcp(Z_ARG3, 1, InterpreterMacroAssembler::Unsigned); |
|
3851 |
__ get_constant_pool(Z_ARG2); |
|
42556
c03d98321ad1
8169317: [s390] Various minor bug fixes and adaptions.
goetz
parents:
42065
diff
changeset
|
3852 |
__ z_lgfr(Z_ARG4, Z_tos); |
42065 | 3853 |
call_VM(Z_tos, CAST_FROM_FN_PTR(address, InterpreterRuntime::anewarray), |
3854 |
Z_ARG2, Z_ARG3, Z_ARG4); |
|
3855 |
} |
|
3856 |
||
3857 |
void TemplateTable::arraylength() { |
|
3858 |
transition(atos, itos); |
|
3859 |
||
3860 |
int offset = arrayOopDesc::length_offset_in_bytes(); |
|
3861 |
||
3862 |
__ null_check(Z_tos, Z_R0_scratch, offset); |
|
3863 |
__ mem2reg_opt(Z_tos, Address(Z_tos, offset), false); |
|
3864 |
} |
|
3865 |
||
3866 |
void TemplateTable::checkcast() { |
|
3867 |
transition(atos, atos); |
|
3868 |
||
3869 |
NearLabel done, is_null, ok_is_subtype, quicked, resolved; |
|
3870 |
||
3871 |
BLOCK_COMMENT("checkcast {"); |
|
3872 |
// If object is NULL, we are almost done. |
|
3873 |
__ compareU64_and_branch(Z_tos, (intptr_t) 0, Assembler::bcondZero, is_null); |
|
3874 |
||
3875 |
// Get cpool & tags index. |
|
3876 |
Register cpool = Z_tmp_1; |
|
3877 |
Register tags = Z_tmp_2; |
|
3878 |
Register index = Z_ARG5; |
|
3879 |
||
3880 |
__ get_cpool_and_tags(cpool, tags); |
|
3881 |
__ get_2_byte_integer_at_bcp(index, 1, InterpreterMacroAssembler::Unsigned); |
|
3882 |
// See if bytecode has already been quicked. |
|
3883 |
// Note: For CLI, we would have to add the index to the tags pointer first, |
|
3884 |
// thus load and compare in a "classic" manner. |
|
3885 |
__ z_llgc(Z_R0_scratch, |
|
3886 |
Address(tags, index, Array<u1>::base_offset_in_bytes())); |
|
3887 |
__ compareU64_and_branch(Z_R0_scratch, JVM_CONSTANT_Class, |
|
3888 |
Assembler::bcondEqual, quicked); |
|
3889 |
||
3890 |
__ push(atos); // Save receiver for result, and for GC. |
|
3891 |
call_VM(noreg, CAST_FROM_FN_PTR(address, InterpreterRuntime::quicken_io_cc)); |
|
3892 |
__ get_vm_result_2(Z_tos); |
|
3893 |
||
3894 |
Register receiver = Z_ARG4; |
|
3895 |
Register klass = Z_tos; |
|
3896 |
Register subklass = Z_ARG5; |
|
3897 |
||
3898 |
__ pop_ptr(receiver); // restore receiver |
|
3899 |
__ z_bru(resolved); |
|
3900 |
||
3901 |
// Get superklass in klass and subklass in subklass. |
|
3902 |
__ bind(quicked); |
|
3903 |
||
3904 |
__ z_lgr(Z_ARG4, Z_tos); // Save receiver. |
|
3905 |
__ z_sllg(index, index, LogBytesPerWord); // index2bytes for addressing |
|
46427
54713555867e
8171392: Move Klass pointers outside of ConstantPool entries so ConstantPool can be read-only
iklam
parents:
46280
diff
changeset
|
3906 |
__ load_resolved_klass_at_offset(cpool, index, klass); |
42065 | 3907 |
|
3908 |
__ bind(resolved); |
|
3909 |
||
3910 |
__ load_klass(subklass, receiver); |
|
3911 |
||
3912 |
// Generate subtype check. Object in receiver. |
|
3913 |
// Superklass in klass. Subklass in subklass. |
|
3914 |
__ gen_subtype_check(subklass, klass, Z_ARG3, Z_tmp_1, ok_is_subtype); |
|
3915 |
||
3916 |
// Come here on failure. |
|
3917 |
__ push_ptr(receiver); |
|
3918 |
// Object is at TOS, target klass oop expected in rax by convention. |
|
3919 |
__ z_brul((address) Interpreter::_throw_ClassCastException_entry); |
|
3920 |
||
3921 |
// Come here on success. |
|
3922 |
__ bind(ok_is_subtype); |
|
3923 |
||
3924 |
__ z_lgr(Z_tos, receiver); // Restore object. |
|
3925 |
||
3926 |
// Collect counts on whether this test sees NULLs a lot or not. |
|
3927 |
if (ProfileInterpreter) { |
|
3928 |
__ z_bru(done); |
|
3929 |
__ bind(is_null); |
|
3930 |
__ profile_null_seen(Z_tmp_1); |
|
3931 |
} else { |
|
3932 |
__ bind(is_null); // Same as 'done'. |
|
3933 |
} |
|
3934 |
||
3935 |
__ bind(done); |
|
3936 |
BLOCK_COMMENT("} checkcast"); |
|
3937 |
} |
|
3938 |
||
3939 |
void TemplateTable::instanceof() { |
|
3940 |
transition(atos, itos); |
|
3941 |
||
3942 |
NearLabel done, is_null, ok_is_subtype, quicked, resolved; |
|
3943 |
||
3944 |
BLOCK_COMMENT("instanceof {"); |
|
3945 |
// If object is NULL, we are almost done. |
|
3946 |
__ compareU64_and_branch(Z_tos, (intptr_t) 0, Assembler::bcondZero, is_null); |
|
3947 |
||
3948 |
// Get cpool & tags index. |
|
3949 |
Register cpool = Z_tmp_1; |
|
3950 |
Register tags = Z_tmp_2; |
|
3951 |
Register index = Z_ARG5; |
|
3952 |
||
3953 |
__ get_cpool_and_tags(cpool, tags); |
|
3954 |
__ get_2_byte_integer_at_bcp(index, 1, InterpreterMacroAssembler::Unsigned); |
|
3955 |
// See if bytecode has already been quicked. |
|
3956 |
// Note: For CLI, we would have to add the index to the tags pointer first, |
|
3957 |
// thus load and compare in a "classic" manner. |
|
3958 |
__ z_llgc(Z_R0_scratch, |
|
3959 |
Address(tags, index, Array<u1>::base_offset_in_bytes())); |
|
3960 |
__ compareU64_and_branch(Z_R0_scratch, JVM_CONSTANT_Class, Assembler::bcondEqual, quicked); |
|
3961 |
||
3962 |
__ push(atos); // Save receiver for result, and for GC. |
|
3963 |
call_VM(noreg, CAST_FROM_FN_PTR(address, InterpreterRuntime::quicken_io_cc)); |
|
3964 |
__ get_vm_result_2(Z_tos); |
|
3965 |
||
3966 |
Register receiver = Z_tmp_2; |
|
3967 |
Register klass = Z_tos; |
|
3968 |
Register subklass = Z_tmp_2; |
|
3969 |
||
3970 |
__ pop_ptr(receiver); // Restore receiver. |
|
3971 |
__ verify_oop(receiver); |
|
3972 |
__ load_klass(subklass, subklass); |
|
3973 |
__ z_bru(resolved); |
|
3974 |
||
3975 |
// Get superklass in klass and subklass in subklass. |
|
3976 |
__ bind(quicked); |
|
3977 |
||
3978 |
__ load_klass(subklass, Z_tos); |
|
3979 |
__ z_sllg(index, index, LogBytesPerWord); // index2bytes for addressing |
|
46427
54713555867e
8171392: Move Klass pointers outside of ConstantPool entries so ConstantPool can be read-only
iklam
parents:
46280
diff
changeset
|
3980 |
__ load_resolved_klass_at_offset(cpool, index, klass); |
42065 | 3981 |
|
3982 |
__ bind(resolved); |
|
3983 |
||
3984 |
// Generate subtype check. |
|
3985 |
// Superklass in klass. Subklass in subklass. |
|
3986 |
__ gen_subtype_check(subklass, klass, Z_ARG4, Z_ARG5, ok_is_subtype); |
|
3987 |
||
3988 |
// Come here on failure. |
|
3989 |
__ clear_reg(Z_tos, true, false); |
|
3990 |
__ z_bru(done); |
|
3991 |
||
3992 |
// Come here on success. |
|
3993 |
__ bind(ok_is_subtype); |
|
3994 |
__ load_const_optimized(Z_tos, 1); |
|
3995 |
||
3996 |
// Collect counts on whether this test sees NULLs a lot or not. |
|
3997 |
if (ProfileInterpreter) { |
|
3998 |
__ z_bru(done); |
|
3999 |
__ bind(is_null); |
|
4000 |
__ profile_null_seen(Z_tmp_1); |
|
4001 |
} else { |
|
4002 |
__ bind(is_null); // same as 'done' |
|
4003 |
} |
|
4004 |
||
4005 |
__ bind(done); |
|
4006 |
// tos = 0: obj == NULL or obj is not an instanceof the specified klass |
|
4007 |
// tos = 1: obj != NULL and obj is an instanceof the specified klass |
|
4008 |
BLOCK_COMMENT("} instanceof"); |
|
4009 |
} |
|
4010 |
||
4011 |
//----------------------------------------------------------------------------- |
|
4012 |
// Breakpoints |
|
4013 |
void TemplateTable::_breakpoint() { |
|
4014 |
||
4015 |
// Note: We get here even if we are single stepping. |
|
4016 |
// Jbug insists on setting breakpoints at every bytecode |
|
4017 |
// even if we are in single step mode. |
|
4018 |
||
4019 |
transition(vtos, vtos); |
|
4020 |
||
4021 |
// Get the unpatched byte code. |
|
4022 |
__ get_method(Z_ARG2); |
|
4023 |
__ call_VM(noreg, |
|
4024 |
CAST_FROM_FN_PTR(address, InterpreterRuntime::get_original_bytecode_at), |
|
4025 |
Z_ARG2, Z_bcp); |
|
4026 |
// Save the result to a register that is preserved over C-function calls. |
|
4027 |
__ z_lgr(Z_tmp_1, Z_RET); |
|
4028 |
||
4029 |
// Post the breakpoint event. |
|
4030 |
__ get_method(Z_ARG2); |
|
4031 |
__ call_VM(noreg, |
|
4032 |
CAST_FROM_FN_PTR(address, InterpreterRuntime::_breakpoint), |
|
4033 |
Z_ARG2, Z_bcp); |
|
4034 |
||
4035 |
// Must restore the bytecode, because call_VM destroys Z_bytecode. |
|
4036 |
__ z_lgr(Z_bytecode, Z_tmp_1); |
|
4037 |
||
4038 |
// Complete the execution of original bytecode. |
|
4039 |
__ dispatch_only_normal(vtos); |
|
4040 |
} |
|
4041 |
||
4042 |
||
4043 |
// Exceptions |
|
4044 |
||
4045 |
void TemplateTable::athrow() { |
|
4046 |
transition(atos, vtos); |
|
4047 |
__ null_check(Z_tos); |
|
4048 |
__ load_absolute_address(Z_ARG2, Interpreter::throw_exception_entry()); |
|
4049 |
__ z_br(Z_ARG2); |
|
4050 |
} |
|
4051 |
||
4052 |
// Synchronization |
|
4053 |
// |
|
4054 |
// Note: monitorenter & exit are symmetric routines; which is reflected |
|
4055 |
// in the assembly code structure as well |
|
4056 |
// |
|
4057 |
// Stack layout: |
|
4058 |
// |
|
4059 |
// callers_sp <- Z_SP (callers_sp == Z_fp (own fp)) |
|
4060 |
// return_pc |
|
4061 |
// [rest of ABI_160] |
|
4062 |
// /slot o: free |
|
4063 |
// / ... free |
|
4064 |
// oper. | slot n+1: free <- Z_esp points to first free slot |
|
4065 |
// stack | slot n: val caches IJAVA_STATE.esp |
|
4066 |
// | ... |
|
4067 |
// \slot 0: val |
|
4068 |
// /slot m <- IJAVA_STATE.monitors = monitor block top |
|
4069 |
// | ... |
|
4070 |
// monitors| slot 2 |
|
4071 |
// | slot 1 |
|
4072 |
// \slot 0 |
|
4073 |
// /slot l <- monitor block bot |
|
4074 |
// ijava_state | ... |
|
4075 |
// | slot 2 |
|
4076 |
// \slot 0 |
|
4077 |
// <- Z_fp |
|
4078 |
void TemplateTable::monitorenter() { |
|
4079 |
transition(atos, vtos); |
|
4080 |
||
4081 |
BLOCK_COMMENT("monitorenter {"); |
|
4082 |
||
4083 |
// Check for NULL object. |
|
4084 |
__ null_check(Z_tos); |
|
4085 |
const int entry_size = frame::interpreter_frame_monitor_size() * wordSize; |
|
4086 |
NearLabel allocated; |
|
4087 |
// Initialize entry pointer. |
|
4088 |
const Register Rfree_slot = Z_tmp_1; |
|
4089 |
__ clear_reg(Rfree_slot, true, false); // Points to free slot or NULL. Don't set CC. |
|
4090 |
||
4091 |
// Find a free slot in the monitor block from top to bot (result in Rfree_slot). |
|
4092 |
{ |
|
4093 |
const Register Rcurr_monitor = Z_ARG2; |
|
4094 |
const Register Rbot = Z_ARG3; // Points to word under bottom of monitor block. |
|
4095 |
const Register Rlocked_obj = Z_ARG4; |
|
4096 |
NearLabel loop, exit, not_free; |
|
4097 |
// Starting with top-most entry. |
|
4098 |
__ get_monitors(Rcurr_monitor); // Rcur_monitor = IJAVA_STATE.monitors |
|
4099 |
__ add2reg(Rbot, -frame::z_ijava_state_size, Z_fp); |
|
4100 |
||
4101 |
#ifdef ASSERT |
|
4102 |
address reentry = NULL; |
|
4103 |
{ NearLabel ok; |
|
4104 |
__ compareU64_and_branch(Rcurr_monitor, Rbot, Assembler::bcondNotHigh, ok); |
|
4105 |
reentry = __ stop_chain_static(reentry, "IJAVA_STATE.monitors points below monitor block bottom"); |
|
4106 |
__ bind(ok); |
|
4107 |
} |
|
4108 |
{ NearLabel ok; |
|
4109 |
__ compareU64_and_branch(Rcurr_monitor, Z_esp, Assembler::bcondHigh, ok); |
|
4110 |
reentry = __ stop_chain_static(reentry, "IJAVA_STATE.monitors above Z_esp"); |
|
4111 |
__ bind(ok); |
|
4112 |
} |
|
4113 |
#endif |
|
4114 |
||
4115 |
// Check if bottom reached, i.e. if there is at least one monitor. |
|
4116 |
__ compareU64_and_branch(Rcurr_monitor, Rbot, Assembler::bcondEqual, exit); |
|
4117 |
||
4118 |
__ bind(loop); |
|
4119 |
// Check if current entry is used. |
|
4120 |
__ load_and_test_long(Rlocked_obj, Address(Rcurr_monitor, BasicObjectLock::obj_offset_in_bytes())); |
|
4121 |
__ z_brne(not_free); |
|
4122 |
// If not used then remember entry in Rfree_slot. |
|
4123 |
__ z_lgr(Rfree_slot, Rcurr_monitor); |
|
4124 |
__ bind(not_free); |
|
4125 |
// Exit if current entry is for same object; this guarantees, that new monitor |
|
4126 |
// used for recursive lock is above the older one. |
|
4127 |
__ compareU64_and_branch(Rlocked_obj, Z_tos, Assembler::bcondEqual, exit); |
|
4128 |
// otherwise advance to next entry |
|
4129 |
__ add2reg(Rcurr_monitor, entry_size); |
|
4130 |
// Check if bottom reached, if not at bottom then check this entry. |
|
4131 |
__ compareU64_and_branch(Rcurr_monitor, Rbot, Assembler::bcondNotEqual, loop); |
|
4132 |
__ bind(exit); |
|
4133 |
} |
|
4134 |
||
4135 |
// Rfree_slot != NULL -> found one |
|
4136 |
__ compareU64_and_branch(Rfree_slot, (intptr_t)0L, Assembler::bcondNotEqual, allocated); |
|
4137 |
||
4138 |
// Allocate one if there's no free slot. |
|
4139 |
__ add_monitor_to_stack(false, Z_ARG3, Z_ARG4, Z_ARG5); |
|
4140 |
__ get_monitors(Rfree_slot); |
|
4141 |
||
4142 |
// Rfree_slot: points to monitor entry. |
|
4143 |
__ bind(allocated); |
|
4144 |
||
4145 |
// Increment bcp to point to the next bytecode, so exception |
|
4146 |
// handling for async. exceptions work correctly. |
|
4147 |
// The object has already been poped from the stack, so the |
|
4148 |
// expression stack looks correct. |
|
4149 |
__ add2reg(Z_bcp, 1, Z_bcp); |
|
4150 |
||
4151 |
// Store object. |
|
4152 |
__ z_stg(Z_tos, BasicObjectLock::obj_offset_in_bytes(), Rfree_slot); |
|
4153 |
__ lock_object(Rfree_slot, Z_tos); |
|
4154 |
||
4155 |
// Check to make sure this monitor doesn't cause stack overflow after locking. |
|
4156 |
__ save_bcp(); // in case of exception |
|
4157 |
__ generate_stack_overflow_check(0); |
|
4158 |
||
4159 |
// The bcp has already been incremented. Just need to dispatch to |
|
4160 |
// next instruction. |
|
4161 |
__ dispatch_next(vtos); |
|
4162 |
||
4163 |
BLOCK_COMMENT("} monitorenter"); |
|
4164 |
} |
|
4165 |
||
4166 |
||
4167 |
void TemplateTable::monitorexit() { |
|
4168 |
transition(atos, vtos); |
|
4169 |
||
4170 |
BLOCK_COMMENT("monitorexit {"); |
|
4171 |
||
4172 |
// Check for NULL object. |
|
4173 |
__ null_check(Z_tos); |
|
4174 |
||
4175 |
NearLabel found, not_found; |
|
4176 |
const Register Rcurr_monitor = Z_ARG2; |
|
4177 |
||
4178 |
// Find matching slot. |
|
4179 |
{ |
|
4180 |
const int entry_size = frame::interpreter_frame_monitor_size() * wordSize; |
|
4181 |
NearLabel entry, loop; |
|
4182 |
||
4183 |
const Register Rbot = Z_ARG3; // Points to word under bottom of monitor block. |
|
4184 |
const Register Rlocked_obj = Z_ARG4; |
|
4185 |
// Starting with top-most entry. |
|
4186 |
__ get_monitors(Rcurr_monitor); // Rcur_monitor = IJAVA_STATE.monitors |
|
4187 |
__ add2reg(Rbot, -frame::z_ijava_state_size, Z_fp); |
|
4188 |
||
4189 |
#ifdef ASSERT |
|
4190 |
address reentry = NULL; |
|
4191 |
{ NearLabel ok; |
|
4192 |
__ compareU64_and_branch(Rcurr_monitor, Rbot, Assembler::bcondNotHigh, ok); |
|
4193 |
reentry = __ stop_chain_static(reentry, "IJAVA_STATE.monitors points below monitor block bottom"); |
|
4194 |
__ bind(ok); |
|
4195 |
} |
|
4196 |
{ NearLabel ok; |
|
4197 |
__ compareU64_and_branch(Rcurr_monitor, Z_esp, Assembler::bcondHigh, ok); |
|
4198 |
reentry = __ stop_chain_static(reentry, "IJAVA_STATE.monitors above Z_esp"); |
|
4199 |
__ bind(ok); |
|
4200 |
} |
|
4201 |
#endif |
|
4202 |
||
4203 |
// Check if bottom reached, i.e. if there is at least one monitor. |
|
4204 |
__ compareU64_and_branch(Rcurr_monitor, Rbot, Assembler::bcondEqual, not_found); |
|
4205 |
||
4206 |
__ bind(loop); |
|
4207 |
// Check if current entry is for same object. |
|
4208 |
__ z_lg(Rlocked_obj, Address(Rcurr_monitor, BasicObjectLock::obj_offset_in_bytes())); |
|
4209 |
// If same object then stop searching. |
|
4210 |
__ compareU64_and_branch(Rlocked_obj, Z_tos, Assembler::bcondEqual, found); |
|
4211 |
// Otherwise advance to next entry. |
|
4212 |
__ add2reg(Rcurr_monitor, entry_size); |
|
4213 |
// Check if bottom reached, if not at bottom then check this entry. |
|
4214 |
__ compareU64_and_branch(Rcurr_monitor, Rbot, Assembler::bcondNotEqual, loop); |
|
4215 |
} |
|
4216 |
||
4217 |
__ bind(not_found); |
|
4218 |
// Error handling. Unlocking was not block-structured. |
|
4219 |
__ call_VM(noreg, CAST_FROM_FN_PTR(address, |
|
4220 |
InterpreterRuntime::throw_illegal_monitor_state_exception)); |
|
4221 |
__ should_not_reach_here(); |
|
4222 |
||
4223 |
__ bind(found); |
|
4224 |
__ push_ptr(Z_tos); // Make sure object is on stack (contract with oopMaps). |
|
4225 |
__ unlock_object(Rcurr_monitor, Z_tos); |
|
4226 |
__ pop_ptr(Z_tos); // Discard object. |
|
4227 |
BLOCK_COMMENT("} monitorexit"); |
|
4228 |
} |
|
4229 |
||
4230 |
// Wide instructions |
|
4231 |
void TemplateTable::wide() { |
|
4232 |
transition(vtos, vtos); |
|
4233 |
||
4234 |
__ z_llgc(Z_R1_scratch, at_bcp(1)); |
|
4235 |
__ z_sllg(Z_R1_scratch, Z_R1_scratch, LogBytesPerWord); |
|
4236 |
__ load_absolute_address(Z_tmp_1, (address) Interpreter::_wentry_point); |
|
4237 |
__ mem2reg_opt(Z_tmp_1, Address(Z_tmp_1, Z_R1_scratch)); |
|
4238 |
__ z_br(Z_tmp_1); |
|
4239 |
// Note: the bcp increment step is part of the individual wide |
|
4240 |
// bytecode implementations. |
|
4241 |
} |
|
4242 |
||
4243 |
// Multi arrays |
|
4244 |
void TemplateTable::multianewarray() { |
|
4245 |
transition(vtos, atos); |
|
4246 |
||
4247 |
__ z_llgc(Z_tmp_1, at_bcp(3)); // Get number of dimensions. |
|
4248 |
// Slot count to byte offset. |
|
4249 |
__ z_sllg(Z_tmp_1, Z_tmp_1, Interpreter::logStackElementSize); |
|
4250 |
// Z_esp points past last_dim, so set to Z_ARG2 to first_dim address. |
|
4251 |
__ load_address(Z_ARG2, Address(Z_esp, Z_tmp_1)); |
|
4252 |
call_VM(Z_RET, |
|
4253 |
CAST_FROM_FN_PTR(address, InterpreterRuntime::multianewarray), |
|
4254 |
Z_ARG2); |
|
4255 |
// Pop dimensions from expression stack. |
|
4256 |
__ z_agr(Z_esp, Z_tmp_1); |
|
4257 |
} |