Mercurial > hg > truffle
annotate src/cpu/sparc/vm/interp_masm_sparc.cpp @ 3336:2e038ad0c1d0
7009361: JSR 292 Invalid value on stack on solaris-sparc with -Xcomp
Reviewed-by: kvn, twisti
author | never |
---|---|
date | Mon, 02 May 2011 18:53:37 -0700 |
parents | 38fea01eb669 |
children | 3d42f82cd811 |
rev | line source |
---|---|
0 | 1 /* |
2118
dd031b2226de
4930919: race condition in MDO creation at back branch locations
iveresov
parents:
1972
diff
changeset
|
2 * Copyright (c) 1997, 2011, Oracle and/or its affiliates. All rights reserved. |
0 | 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
4 * | |
5 * This code is free software; you can redistribute it and/or modify it | |
6 * under the terms of the GNU General Public License version 2 only, as | |
7 * published by the Free Software Foundation. | |
8 * | |
9 * This code is distributed in the hope that it will be useful, but WITHOUT | |
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
12 * version 2 for more details (a copy is included in the LICENSE file that | |
13 * accompanied this code). | |
14 * | |
15 * You should have received a copy of the GNU General Public License version | |
16 * 2 along with this work; if not, write to the Free Software Foundation, | |
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. | |
18 * | |
1552
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1506
diff
changeset
|
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1506
diff
changeset
|
20 * or visit www.oracle.com if you need additional information or have any |
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1506
diff
changeset
|
21 * questions. |
0 | 22 * |
23 */ | |
24 | |
1972 | 25 #include "precompiled.hpp" |
26 #include "interp_masm_sparc.hpp" | |
27 #include "interpreter/interpreter.hpp" | |
28 #include "interpreter/interpreterRuntime.hpp" | |
29 #include "oops/arrayOop.hpp" | |
30 #include "oops/markOop.hpp" | |
31 #include "oops/methodDataOop.hpp" | |
32 #include "oops/methodOop.hpp" | |
33 #include "prims/jvmtiExport.hpp" | |
34 #include "prims/jvmtiRedefineClassesTrace.hpp" | |
35 #include "prims/jvmtiThreadState.hpp" | |
36 #include "runtime/basicLock.hpp" | |
37 #include "runtime/biasedLocking.hpp" | |
38 #include "runtime/sharedRuntime.hpp" | |
39 #ifdef TARGET_OS_FAMILY_linux | |
40 # include "thread_linux.inline.hpp" | |
41 #endif | |
42 #ifdef TARGET_OS_FAMILY_solaris | |
43 # include "thread_solaris.inline.hpp" | |
44 #endif | |
0 | 45 |
46 #ifndef CC_INTERP | |
47 #ifndef FAST_DISPATCH | |
48 #define FAST_DISPATCH 1 | |
49 #endif | |
50 #undef FAST_DISPATCH | |
51 | |
52 // Implementation of InterpreterMacroAssembler | |
53 | |
54 // This file specializes the assember with interpreter-specific macros | |
55 | |
727 | 56 const Address InterpreterMacroAssembler::l_tmp(FP, (frame::interpreter_frame_l_scratch_fp_offset * wordSize) + STACK_BIAS); |
57 const Address InterpreterMacroAssembler::d_tmp(FP, (frame::interpreter_frame_d_scratch_fp_offset * wordSize) + STACK_BIAS); | |
0 | 58 |
59 #else // CC_INTERP | |
60 #ifndef STATE | |
61 #define STATE(field_name) Lstate, in_bytes(byte_offset_of(BytecodeInterpreter, field_name)) | |
62 #endif // STATE | |
63 | |
64 #endif // CC_INTERP | |
65 | |
66 void InterpreterMacroAssembler::compute_extra_locals_size_in_bytes(Register args_size, Register locals_size, Register delta) { | |
67 // Note: this algorithm is also used by C1's OSR entry sequence. | |
68 // Any changes should also be applied to CodeEmitter::emit_osr_entry(). | |
69 assert_different_registers(args_size, locals_size); | |
70 // max_locals*2 for TAGS. Assumes that args_size has already been adjusted. | |
71 subcc(locals_size, args_size, delta);// extra space for non-arguments locals in words | |
72 // Use br/mov combination because it works on both V8 and V9 and is | |
73 // faster. | |
74 Label skip_move; | |
75 br(Assembler::negative, true, Assembler::pt, skip_move); | |
76 delayed()->mov(G0, delta); | |
77 bind(skip_move); | |
78 round_to(delta, WordsPerLong); // make multiple of 2 (SP must be 2-word aligned) | |
79 sll(delta, LogBytesPerWord, delta); // extra space for locals in bytes | |
80 } | |
81 | |
82 #ifndef CC_INTERP | |
83 | |
84 // Dispatch code executed in the prolog of a bytecode which does not do it's | |
85 // own dispatch. The dispatch address is computed and placed in IdispatchAddress | |
86 void InterpreterMacroAssembler::dispatch_prolog(TosState state, int bcp_incr) { | |
87 assert_not_delayed(); | |
88 #ifdef FAST_DISPATCH | |
89 // FAST_DISPATCH and ProfileInterpreter are mutually exclusive since | |
90 // they both use I2. | |
91 assert(!ProfileInterpreter, "FAST_DISPATCH and +ProfileInterpreter are mutually exclusive"); | |
92 ldub(Lbcp, bcp_incr, Lbyte_code); // load next bytecode | |
93 add(Lbyte_code, Interpreter::distance_from_dispatch_table(state), Lbyte_code); | |
94 // add offset to correct dispatch table | |
95 sll(Lbyte_code, LogBytesPerWord, Lbyte_code); // multiply by wordSize | |
96 ld_ptr(IdispatchTables, Lbyte_code, IdispatchAddress);// get entry addr | |
97 #else | |
727 | 98 ldub( Lbcp, bcp_incr, Lbyte_code); // load next bytecode |
0 | 99 // dispatch table to use |
727 | 100 AddressLiteral tbl(Interpreter::dispatch_table(state)); |
101 sll(Lbyte_code, LogBytesPerWord, Lbyte_code); // multiply by wordSize | |
102 set(tbl, G3_scratch); // compute addr of table | |
103 ld_ptr(G3_scratch, Lbyte_code, IdispatchAddress); // get entry addr | |
0 | 104 #endif |
105 } | |
106 | |
107 | |
108 // Dispatch code executed in the epilog of a bytecode which does not do it's | |
109 // own dispatch. The dispatch address in IdispatchAddress is used for the | |
110 // dispatch. | |
111 void InterpreterMacroAssembler::dispatch_epilog(TosState state, int bcp_incr) { | |
112 assert_not_delayed(); | |
113 verify_FPU(1, state); | |
114 interp_verify_oop(Otos_i, state, __FILE__, __LINE__); | |
115 jmp( IdispatchAddress, 0 ); | |
116 if (bcp_incr != 0) delayed()->inc(Lbcp, bcp_incr); | |
117 else delayed()->nop(); | |
118 } | |
119 | |
120 | |
121 void InterpreterMacroAssembler::dispatch_next(TosState state, int bcp_incr) { | |
122 // %%%% consider branching to a single shared dispatch stub (for each bcp_incr) | |
123 assert_not_delayed(); | |
124 ldub( Lbcp, bcp_incr, Lbyte_code); // load next bytecode | |
125 dispatch_Lbyte_code(state, Interpreter::dispatch_table(state), bcp_incr); | |
126 } | |
127 | |
128 | |
129 void InterpreterMacroAssembler::dispatch_next_noverify_oop(TosState state, int bcp_incr) { | |
130 // %%%% consider branching to a single shared dispatch stub (for each bcp_incr) | |
131 assert_not_delayed(); | |
132 ldub( Lbcp, bcp_incr, Lbyte_code); // load next bytecode | |
133 dispatch_Lbyte_code(state, Interpreter::dispatch_table(state), bcp_incr, false); | |
134 } | |
135 | |
136 | |
137 void InterpreterMacroAssembler::dispatch_via(TosState state, address* table) { | |
138 // load current bytecode | |
139 assert_not_delayed(); | |
140 ldub( Lbcp, 0, Lbyte_code); // load next bytecode | |
141 dispatch_base(state, table); | |
142 } | |
143 | |
144 | |
145 void InterpreterMacroAssembler::call_VM_leaf_base( | |
146 Register java_thread, | |
147 address entry_point, | |
148 int number_of_arguments | |
149 ) { | |
150 if (!java_thread->is_valid()) | |
151 java_thread = L7_thread_cache; | |
152 // super call | |
153 MacroAssembler::call_VM_leaf_base(java_thread, entry_point, number_of_arguments); | |
154 } | |
155 | |
156 | |
157 void InterpreterMacroAssembler::call_VM_base( | |
158 Register oop_result, | |
159 Register java_thread, | |
160 Register last_java_sp, | |
161 address entry_point, | |
162 int number_of_arguments, | |
163 bool check_exception | |
164 ) { | |
165 if (!java_thread->is_valid()) | |
166 java_thread = L7_thread_cache; | |
167 // See class ThreadInVMfromInterpreter, which assumes that the interpreter | |
168 // takes responsibility for setting its own thread-state on call-out. | |
169 // However, ThreadInVMfromInterpreter resets the state to "in_Java". | |
170 | |
171 //save_bcp(); // save bcp | |
172 MacroAssembler::call_VM_base(oop_result, java_thread, last_java_sp, entry_point, number_of_arguments, check_exception); | |
173 //restore_bcp(); // restore bcp | |
174 //restore_locals(); // restore locals pointer | |
175 } | |
176 | |
177 | |
178 void InterpreterMacroAssembler::check_and_handle_popframe(Register scratch_reg) { | |
179 if (JvmtiExport::can_pop_frame()) { | |
180 Label L; | |
181 | |
182 // Check the "pending popframe condition" flag in the current thread | |
727 | 183 ld(G2_thread, JavaThread::popframe_condition_offset(), scratch_reg); |
0 | 184 |
185 // Initiate popframe handling only if it is not already being processed. If the flag | |
186 // has the popframe_processing bit set, it means that this code is called *during* popframe | |
187 // handling - we don't want to reenter. | |
188 btst(JavaThread::popframe_pending_bit, scratch_reg); | |
189 br(zero, false, pt, L); | |
190 delayed()->nop(); | |
191 btst(JavaThread::popframe_processing_bit, scratch_reg); | |
192 br(notZero, false, pt, L); | |
193 delayed()->nop(); | |
194 | |
195 // Call Interpreter::remove_activation_preserving_args_entry() to get the | |
196 // address of the same-named entrypoint in the generated interpreter code. | |
197 call_VM_leaf(noreg, CAST_FROM_FN_PTR(address, Interpreter::remove_activation_preserving_args_entry)); | |
198 | |
199 // Jump to Interpreter::_remove_activation_preserving_args_entry | |
200 jmpl(O0, G0, G0); | |
201 delayed()->nop(); | |
202 bind(L); | |
203 } | |
204 } | |
205 | |
206 | |
207 void InterpreterMacroAssembler::load_earlyret_value(TosState state) { | |
208 Register thr_state = G4_scratch; | |
727 | 209 ld_ptr(G2_thread, JavaThread::jvmti_thread_state_offset(), thr_state); |
210 const Address tos_addr(thr_state, JvmtiThreadState::earlyret_tos_offset()); | |
211 const Address oop_addr(thr_state, JvmtiThreadState::earlyret_oop_offset()); | |
212 const Address val_addr(thr_state, JvmtiThreadState::earlyret_value_offset()); | |
0 | 213 switch (state) { |
214 case ltos: ld_long(val_addr, Otos_l); break; | |
215 case atos: ld_ptr(oop_addr, Otos_l); | |
216 st_ptr(G0, oop_addr); break; | |
217 case btos: // fall through | |
218 case ctos: // fall through | |
219 case stos: // fall through | |
220 case itos: ld(val_addr, Otos_l1); break; | |
221 case ftos: ldf(FloatRegisterImpl::S, val_addr, Ftos_f); break; | |
222 case dtos: ldf(FloatRegisterImpl::D, val_addr, Ftos_d); break; | |
223 case vtos: /* nothing to do */ break; | |
224 default : ShouldNotReachHere(); | |
225 } | |
226 // Clean up tos value in the jvmti thread state | |
227 or3(G0, ilgl, G3_scratch); | |
228 stw(G3_scratch, tos_addr); | |
229 st_long(G0, val_addr); | |
230 interp_verify_oop(Otos_i, state, __FILE__, __LINE__); | |
231 } | |
232 | |
233 | |
234 void InterpreterMacroAssembler::check_and_handle_earlyret(Register scratch_reg) { | |
235 if (JvmtiExport::can_force_early_return()) { | |
236 Label L; | |
237 Register thr_state = G3_scratch; | |
727 | 238 ld_ptr(G2_thread, JavaThread::jvmti_thread_state_offset(), thr_state); |
0 | 239 tst(thr_state); |
240 br(zero, false, pt, L); // if (thread->jvmti_thread_state() == NULL) exit; | |
241 delayed()->nop(); | |
242 | |
243 // Initiate earlyret handling only if it is not already being processed. | |
244 // If the flag has the earlyret_processing bit set, it means that this code | |
245 // is called *during* earlyret handling - we don't want to reenter. | |
727 | 246 ld(thr_state, JvmtiThreadState::earlyret_state_offset(), G4_scratch); |
0 | 247 cmp(G4_scratch, JvmtiThreadState::earlyret_pending); |
248 br(Assembler::notEqual, false, pt, L); | |
249 delayed()->nop(); | |
250 | |
251 // Call Interpreter::remove_activation_early_entry() to get the address of the | |
252 // same-named entrypoint in the generated interpreter code | |
727 | 253 ld(thr_state, JvmtiThreadState::earlyret_tos_offset(), Otos_l1); |
0 | 254 call_VM_leaf(noreg, CAST_FROM_FN_PTR(address, Interpreter::remove_activation_early_entry), Otos_l1); |
255 | |
256 // Jump to Interpreter::_remove_activation_early_entry | |
257 jmpl(O0, G0, G0); | |
258 delayed()->nop(); | |
259 bind(L); | |
260 } | |
261 } | |
262 | |
263 | |
1295 | 264 void InterpreterMacroAssembler::super_call_VM_leaf(Register thread_cache, address entry_point, Register arg_1, Register arg_2) { |
0 | 265 mov(arg_1, O0); |
1295 | 266 mov(arg_2, O1); |
267 MacroAssembler::call_VM_leaf_base(thread_cache, entry_point, 2); | |
0 | 268 } |
269 #endif /* CC_INTERP */ | |
270 | |
271 | |
272 #ifndef CC_INTERP | |
273 | |
274 void InterpreterMacroAssembler::dispatch_base(TosState state, address* table) { | |
275 assert_not_delayed(); | |
276 dispatch_Lbyte_code(state, table); | |
277 } | |
278 | |
279 | |
280 void InterpreterMacroAssembler::dispatch_normal(TosState state) { | |
281 dispatch_base(state, Interpreter::normal_table(state)); | |
282 } | |
283 | |
284 | |
285 void InterpreterMacroAssembler::dispatch_only(TosState state) { | |
286 dispatch_base(state, Interpreter::dispatch_table(state)); | |
287 } | |
288 | |
289 | |
290 // common code to dispatch and dispatch_only | |
291 // dispatch value in Lbyte_code and increment Lbcp | |
292 | |
293 void InterpreterMacroAssembler::dispatch_Lbyte_code(TosState state, address* table, int bcp_incr, bool verify) { | |
294 verify_FPU(1, state); | |
295 // %%%%% maybe implement +VerifyActivationFrameSize here | |
296 //verify_thread(); //too slow; we will just verify on method entry & exit | |
297 if (verify) interp_verify_oop(Otos_i, state, __FILE__, __LINE__); | |
298 #ifdef FAST_DISPATCH | |
299 if (table == Interpreter::dispatch_table(state)) { | |
300 // use IdispatchTables | |
301 add(Lbyte_code, Interpreter::distance_from_dispatch_table(state), Lbyte_code); | |
302 // add offset to correct dispatch table | |
303 sll(Lbyte_code, LogBytesPerWord, Lbyte_code); // multiply by wordSize | |
304 ld_ptr(IdispatchTables, Lbyte_code, G3_scratch); // get entry addr | |
305 } else { | |
306 #endif | |
307 // dispatch table to use | |
727 | 308 AddressLiteral tbl(table); |
0 | 309 sll(Lbyte_code, LogBytesPerWord, Lbyte_code); // multiply by wordSize |
727 | 310 set(tbl, G3_scratch); // compute addr of table |
0 | 311 ld_ptr(G3_scratch, Lbyte_code, G3_scratch); // get entry addr |
312 #ifdef FAST_DISPATCH | |
313 } | |
314 #endif | |
315 jmp( G3_scratch, 0 ); | |
316 if (bcp_incr != 0) delayed()->inc(Lbcp, bcp_incr); | |
317 else delayed()->nop(); | |
318 } | |
319 | |
320 | |
321 // Helpers for expression stack | |
322 | |
323 // Longs and doubles are Category 2 computational types in the | |
324 // JVM specification (section 3.11.1) and take 2 expression stack or | |
325 // local slots. | |
326 // Aligning them on 32 bit with tagged stacks is hard because the code generated | |
327 // for the dup* bytecodes depends on what types are already on the stack. | |
328 // If the types are split into the two stack/local slots, that is much easier | |
329 // (and we can use 0 for non-reference tags). | |
330 | |
331 // Known good alignment in _LP64 but unknown otherwise | |
332 void InterpreterMacroAssembler::load_unaligned_double(Register r1, int offset, FloatRegister d) { | |
333 assert_not_delayed(); | |
334 | |
335 #ifdef _LP64 | |
336 ldf(FloatRegisterImpl::D, r1, offset, d); | |
337 #else | |
338 ldf(FloatRegisterImpl::S, r1, offset, d); | |
1506 | 339 ldf(FloatRegisterImpl::S, r1, offset + Interpreter::stackElementSize, d->successor()); |
0 | 340 #endif |
341 } | |
342 | |
343 // Known good alignment in _LP64 but unknown otherwise | |
344 void InterpreterMacroAssembler::store_unaligned_double(FloatRegister d, Register r1, int offset) { | |
345 assert_not_delayed(); | |
346 | |
347 #ifdef _LP64 | |
348 stf(FloatRegisterImpl::D, d, r1, offset); | |
349 // store something more useful here | |
1506 | 350 debug_only(stx(G0, r1, offset+Interpreter::stackElementSize);) |
0 | 351 #else |
352 stf(FloatRegisterImpl::S, d, r1, offset); | |
1506 | 353 stf(FloatRegisterImpl::S, d->successor(), r1, offset + Interpreter::stackElementSize); |
0 | 354 #endif |
355 } | |
356 | |
357 | |
358 // Known good alignment in _LP64 but unknown otherwise | |
359 void InterpreterMacroAssembler::load_unaligned_long(Register r1, int offset, Register rd) { | |
360 assert_not_delayed(); | |
361 #ifdef _LP64 | |
362 ldx(r1, offset, rd); | |
363 #else | |
364 ld(r1, offset, rd); | |
1506 | 365 ld(r1, offset + Interpreter::stackElementSize, rd->successor()); |
0 | 366 #endif |
367 } | |
368 | |
369 // Known good alignment in _LP64 but unknown otherwise | |
370 void InterpreterMacroAssembler::store_unaligned_long(Register l, Register r1, int offset) { | |
371 assert_not_delayed(); | |
372 | |
373 #ifdef _LP64 | |
374 stx(l, r1, offset); | |
375 // store something more useful here | |
1506 | 376 debug_only(stx(G0, r1, offset+Interpreter::stackElementSize);) |
0 | 377 #else |
378 st(l, r1, offset); | |
1506 | 379 st(l->successor(), r1, offset + Interpreter::stackElementSize); |
0 | 380 #endif |
381 } | |
382 | |
383 void InterpreterMacroAssembler::pop_i(Register r) { | |
384 assert_not_delayed(); | |
385 ld(Lesp, Interpreter::expr_offset_in_bytes(0), r); | |
1506 | 386 inc(Lesp, Interpreter::stackElementSize); |
0 | 387 debug_only(verify_esp(Lesp)); |
388 } | |
389 | |
390 void InterpreterMacroAssembler::pop_ptr(Register r, Register scratch) { | |
391 assert_not_delayed(); | |
392 ld_ptr(Lesp, Interpreter::expr_offset_in_bytes(0), r); | |
1506 | 393 inc(Lesp, Interpreter::stackElementSize); |
0 | 394 debug_only(verify_esp(Lesp)); |
395 } | |
396 | |
397 void InterpreterMacroAssembler::pop_l(Register r) { | |
398 assert_not_delayed(); | |
399 load_unaligned_long(Lesp, Interpreter::expr_offset_in_bytes(0), r); | |
1506 | 400 inc(Lesp, 2*Interpreter::stackElementSize); |
0 | 401 debug_only(verify_esp(Lesp)); |
402 } | |
403 | |
404 | |
405 void InterpreterMacroAssembler::pop_f(FloatRegister f, Register scratch) { | |
406 assert_not_delayed(); | |
407 ldf(FloatRegisterImpl::S, Lesp, Interpreter::expr_offset_in_bytes(0), f); | |
1506 | 408 inc(Lesp, Interpreter::stackElementSize); |
0 | 409 debug_only(verify_esp(Lesp)); |
410 } | |
411 | |
412 | |
413 void InterpreterMacroAssembler::pop_d(FloatRegister f, Register scratch) { | |
414 assert_not_delayed(); | |
415 load_unaligned_double(Lesp, Interpreter::expr_offset_in_bytes(0), f); | |
1506 | 416 inc(Lesp, 2*Interpreter::stackElementSize); |
0 | 417 debug_only(verify_esp(Lesp)); |
418 } | |
419 | |
420 | |
421 void InterpreterMacroAssembler::push_i(Register r) { | |
422 assert_not_delayed(); | |
423 debug_only(verify_esp(Lesp)); | |
1506 | 424 st(r, Lesp, 0); |
425 dec(Lesp, Interpreter::stackElementSize); | |
0 | 426 } |
427 | |
428 void InterpreterMacroAssembler::push_ptr(Register r) { | |
429 assert_not_delayed(); | |
1506 | 430 st_ptr(r, Lesp, 0); |
431 dec(Lesp, Interpreter::stackElementSize); | |
0 | 432 } |
433 | |
434 // remember: our convention for longs in SPARC is: | |
435 // O0 (Otos_l1) has high-order part in first word, | |
436 // O1 (Otos_l2) has low-order part in second word | |
437 | |
438 void InterpreterMacroAssembler::push_l(Register r) { | |
439 assert_not_delayed(); | |
440 debug_only(verify_esp(Lesp)); | |
1506 | 441 // Longs are stored in memory-correct order, even if unaligned. |
442 int offset = -Interpreter::stackElementSize; | |
0 | 443 store_unaligned_long(r, Lesp, offset); |
1506 | 444 dec(Lesp, 2 * Interpreter::stackElementSize); |
0 | 445 } |
446 | |
447 | |
448 void InterpreterMacroAssembler::push_f(FloatRegister f) { | |
449 assert_not_delayed(); | |
450 debug_only(verify_esp(Lesp)); | |
1506 | 451 stf(FloatRegisterImpl::S, f, Lesp, 0); |
452 dec(Lesp, Interpreter::stackElementSize); | |
0 | 453 } |
454 | |
455 | |
456 void InterpreterMacroAssembler::push_d(FloatRegister d) { | |
457 assert_not_delayed(); | |
458 debug_only(verify_esp(Lesp)); | |
1506 | 459 // Longs are stored in memory-correct order, even if unaligned. |
460 int offset = -Interpreter::stackElementSize; | |
0 | 461 store_unaligned_double(d, Lesp, offset); |
1506 | 462 dec(Lesp, 2 * Interpreter::stackElementSize); |
0 | 463 } |
464 | |
465 | |
466 void InterpreterMacroAssembler::push(TosState state) { | |
467 interp_verify_oop(Otos_i, state, __FILE__, __LINE__); | |
468 switch (state) { | |
469 case atos: push_ptr(); break; | |
470 case btos: push_i(); break; | |
471 case ctos: | |
472 case stos: push_i(); break; | |
473 case itos: push_i(); break; | |
474 case ltos: push_l(); break; | |
475 case ftos: push_f(); break; | |
476 case dtos: push_d(); break; | |
477 case vtos: /* nothing to do */ break; | |
478 default : ShouldNotReachHere(); | |
479 } | |
480 } | |
481 | |
482 | |
483 void InterpreterMacroAssembler::pop(TosState state) { | |
484 switch (state) { | |
485 case atos: pop_ptr(); break; | |
486 case btos: pop_i(); break; | |
487 case ctos: | |
488 case stos: pop_i(); break; | |
489 case itos: pop_i(); break; | |
490 case ltos: pop_l(); break; | |
491 case ftos: pop_f(); break; | |
492 case dtos: pop_d(); break; | |
493 case vtos: /* nothing to do */ break; | |
494 default : ShouldNotReachHere(); | |
495 } | |
496 interp_verify_oop(Otos_i, state, __FILE__, __LINE__); | |
497 } | |
498 | |
499 | |
1506 | 500 // Helpers for swap and dup |
501 void InterpreterMacroAssembler::load_ptr(int n, Register val) { | |
0 | 502 ld_ptr(Lesp, Interpreter::expr_offset_in_bytes(n), val); |
503 } | |
1506 | 504 void InterpreterMacroAssembler::store_ptr(int n, Register val) { |
0 | 505 st_ptr(val, Lesp, Interpreter::expr_offset_in_bytes(n)); |
506 } | |
507 | |
508 | |
509 void InterpreterMacroAssembler::load_receiver(Register param_count, | |
510 Register recv) { | |
1506 | 511 sll(param_count, Interpreter::logStackElementSize, param_count); |
0 | 512 ld_ptr(Lesp, param_count, recv); // gets receiver Oop |
513 } | |
514 | |
515 void InterpreterMacroAssembler::empty_expression_stack() { | |
516 // Reset Lesp. | |
517 sub( Lmonitors, wordSize, Lesp ); | |
518 | |
519 // Reset SP by subtracting more space from Lesp. | |
520 Label done; | |
521 verify_oop(Lmethod); | |
727 | 522 assert(G4_scratch != Gframe_size, "Only you can prevent register aliasing!"); |
0 | 523 |
524 // A native does not need to do this, since its callee does not change SP. | |
727 | 525 ld(Lmethod, methodOopDesc::access_flags_offset(), Gframe_size); // Load access flags. |
0 | 526 btst(JVM_ACC_NATIVE, Gframe_size); |
527 br(Assembler::notZero, false, Assembler::pt, done); | |
528 delayed()->nop(); | |
529 | |
530 // Compute max expression stack+register save area | |
727 | 531 lduh(Lmethod, in_bytes(methodOopDesc::max_stack_offset()), Gframe_size); // Load max stack. |
0 | 532 add( Gframe_size, frame::memory_parameter_word_sp_offset, Gframe_size ); |
533 | |
534 // | |
535 // now set up a stack frame with the size computed above | |
536 // | |
537 //round_to( Gframe_size, WordsPerLong ); // -- moved down to the "and" below | |
538 sll( Gframe_size, LogBytesPerWord, Gframe_size ); | |
539 sub( Lesp, Gframe_size, Gframe_size ); | |
540 and3( Gframe_size, -(2 * wordSize), Gframe_size ); // align SP (downwards) to an 8/16-byte boundary | |
541 debug_only(verify_sp(Gframe_size, G4_scratch)); | |
542 #ifdef _LP64 | |
543 sub(Gframe_size, STACK_BIAS, Gframe_size ); | |
544 #endif | |
545 mov(Gframe_size, SP); | |
546 | |
547 bind(done); | |
548 } | |
549 | |
550 | |
551 #ifdef ASSERT | |
552 void InterpreterMacroAssembler::verify_sp(Register Rsp, Register Rtemp) { | |
553 Label Bad, OK; | |
554 | |
555 // Saved SP must be aligned. | |
556 #ifdef _LP64 | |
557 btst(2*BytesPerWord-1, Rsp); | |
558 #else | |
559 btst(LongAlignmentMask, Rsp); | |
560 #endif | |
561 br(Assembler::notZero, false, Assembler::pn, Bad); | |
562 delayed()->nop(); | |
563 | |
564 // Saved SP, plus register window size, must not be above FP. | |
565 add(Rsp, frame::register_save_words * wordSize, Rtemp); | |
566 #ifdef _LP64 | |
567 sub(Rtemp, STACK_BIAS, Rtemp); // Bias Rtemp before cmp to FP | |
568 #endif | |
569 cmp(Rtemp, FP); | |
570 brx(Assembler::greaterUnsigned, false, Assembler::pn, Bad); | |
571 delayed()->nop(); | |
572 | |
573 // Saved SP must not be ridiculously below current SP. | |
574 size_t maxstack = MAX2(JavaThread::stack_size_at_create(), (size_t) 4*K*K); | |
575 set(maxstack, Rtemp); | |
576 sub(SP, Rtemp, Rtemp); | |
577 #ifdef _LP64 | |
578 add(Rtemp, STACK_BIAS, Rtemp); // Unbias Rtemp before cmp to Rsp | |
579 #endif | |
580 cmp(Rsp, Rtemp); | |
581 brx(Assembler::lessUnsigned, false, Assembler::pn, Bad); | |
582 delayed()->nop(); | |
583 | |
584 br(Assembler::always, false, Assembler::pn, OK); | |
585 delayed()->nop(); | |
586 | |
587 bind(Bad); | |
588 stop("on return to interpreted call, restored SP is corrupted"); | |
589 | |
590 bind(OK); | |
591 } | |
592 | |
593 | |
594 void InterpreterMacroAssembler::verify_esp(Register Resp) { | |
595 // about to read or write Resp[0] | |
596 // make sure it is not in the monitors or the register save area | |
597 Label OK1, OK2; | |
598 | |
599 cmp(Resp, Lmonitors); | |
600 brx(Assembler::lessUnsigned, true, Assembler::pt, OK1); | |
601 delayed()->sub(Resp, frame::memory_parameter_word_sp_offset * wordSize, Resp); | |
602 stop("too many pops: Lesp points into monitor area"); | |
603 bind(OK1); | |
604 #ifdef _LP64 | |
605 sub(Resp, STACK_BIAS, Resp); | |
606 #endif | |
607 cmp(Resp, SP); | |
608 brx(Assembler::greaterEqualUnsigned, false, Assembler::pt, OK2); | |
609 delayed()->add(Resp, STACK_BIAS + frame::memory_parameter_word_sp_offset * wordSize, Resp); | |
610 stop("too many pushes: Lesp points into register window"); | |
611 bind(OK2); | |
612 } | |
613 #endif // ASSERT | |
614 | |
615 // Load compiled (i2c) or interpreter entry when calling from interpreted and | |
616 // do the call. Centralized so that all interpreter calls will do the same actions. | |
617 // If jvmti single stepping is on for a thread we must not call compiled code. | |
618 void InterpreterMacroAssembler::call_from_interpreter(Register target, Register scratch, Register Rret) { | |
619 | |
620 // Assume we want to go compiled if available | |
621 | |
622 ld_ptr(G5_method, in_bytes(methodOopDesc::from_interpreted_offset()), target); | |
623 | |
624 if (JvmtiExport::can_post_interpreter_events()) { | |
625 // JVMTI events, such as single-stepping, are implemented partly by avoiding running | |
626 // compiled code in threads for which the event is enabled. Check here for | |
627 // interp_only_mode if these events CAN be enabled. | |
628 verify_thread(); | |
629 Label skip_compiled_code; | |
630 | |
727 | 631 const Address interp_only(G2_thread, JavaThread::interp_only_mode_offset()); |
0 | 632 ld(interp_only, scratch); |
633 tst(scratch); | |
634 br(Assembler::notZero, true, Assembler::pn, skip_compiled_code); | |
635 delayed()->ld_ptr(G5_method, in_bytes(methodOopDesc::interpreter_entry_offset()), target); | |
636 bind(skip_compiled_code); | |
637 } | |
638 | |
639 // the i2c_adapters need methodOop in G5_method (right? %%%) | |
640 // do the call | |
641 #ifdef ASSERT | |
642 { | |
643 Label ok; | |
644 br_notnull(target, false, Assembler::pt, ok); | |
645 delayed()->nop(); | |
646 stop("null entry point"); | |
647 bind(ok); | |
648 } | |
649 #endif // ASSERT | |
650 | |
651 // Adjust Rret first so Llast_SP can be same as Rret | |
652 add(Rret, -frame::pc_return_offset, O7); | |
653 add(Lesp, BytesPerWord, Gargs); // setup parameter pointer | |
654 // Record SP so we can remove any stack space allocated by adapter transition | |
655 jmp(target, 0); | |
656 delayed()->mov(SP, Llast_SP); | |
657 } | |
658 | |
659 void InterpreterMacroAssembler::if_cmp(Condition cc, bool ptr_compare) { | |
660 assert_not_delayed(); | |
661 | |
662 Label not_taken; | |
663 if (ptr_compare) brx(cc, false, Assembler::pn, not_taken); | |
664 else br (cc, false, Assembler::pn, not_taken); | |
665 delayed()->nop(); | |
666 | |
667 TemplateTable::branch(false,false); | |
668 | |
669 bind(not_taken); | |
670 | |
671 profile_not_taken_branch(G3_scratch); | |
672 } | |
673 | |
674 | |
675 void InterpreterMacroAssembler::get_2_byte_integer_at_bcp( | |
676 int bcp_offset, | |
677 Register Rtmp, | |
678 Register Rdst, | |
679 signedOrNot is_signed, | |
680 setCCOrNot should_set_CC ) { | |
681 assert(Rtmp != Rdst, "need separate temp register"); | |
682 assert_not_delayed(); | |
683 switch (is_signed) { | |
684 default: ShouldNotReachHere(); | |
685 | |
686 case Signed: ldsb( Lbcp, bcp_offset, Rdst ); break; // high byte | |
687 case Unsigned: ldub( Lbcp, bcp_offset, Rdst ); break; // high byte | |
688 } | |
689 ldub( Lbcp, bcp_offset + 1, Rtmp ); // low byte | |
690 sll( Rdst, BitsPerByte, Rdst); | |
691 switch (should_set_CC ) { | |
692 default: ShouldNotReachHere(); | |
693 | |
694 case set_CC: orcc( Rdst, Rtmp, Rdst ); break; | |
695 case dont_set_CC: or3( Rdst, Rtmp, Rdst ); break; | |
696 } | |
697 } | |
698 | |
699 | |
700 void InterpreterMacroAssembler::get_4_byte_integer_at_bcp( | |
701 int bcp_offset, | |
702 Register Rtmp, | |
703 Register Rdst, | |
704 setCCOrNot should_set_CC ) { | |
705 assert(Rtmp != Rdst, "need separate temp register"); | |
706 assert_not_delayed(); | |
707 add( Lbcp, bcp_offset, Rtmp); | |
708 andcc( Rtmp, 3, G0); | |
709 Label aligned; | |
710 switch (should_set_CC ) { | |
711 default: ShouldNotReachHere(); | |
712 | |
713 case set_CC: break; | |
714 case dont_set_CC: break; | |
715 } | |
716 | |
717 br(Assembler::zero, true, Assembler::pn, aligned); | |
718 #ifdef _LP64 | |
719 delayed()->ldsw(Rtmp, 0, Rdst); | |
720 #else | |
721 delayed()->ld(Rtmp, 0, Rdst); | |
722 #endif | |
723 | |
724 ldub(Lbcp, bcp_offset + 3, Rdst); | |
725 ldub(Lbcp, bcp_offset + 2, Rtmp); sll(Rtmp, 8, Rtmp); or3(Rtmp, Rdst, Rdst); | |
726 ldub(Lbcp, bcp_offset + 1, Rtmp); sll(Rtmp, 16, Rtmp); or3(Rtmp, Rdst, Rdst); | |
727 #ifdef _LP64 | |
728 ldsb(Lbcp, bcp_offset + 0, Rtmp); sll(Rtmp, 24, Rtmp); | |
729 #else | |
730 // Unsigned load is faster than signed on some implementations | |
731 ldub(Lbcp, bcp_offset + 0, Rtmp); sll(Rtmp, 24, Rtmp); | |
732 #endif | |
733 or3(Rtmp, Rdst, Rdst ); | |
734 | |
735 bind(aligned); | |
736 if (should_set_CC == set_CC) tst(Rdst); | |
737 } | |
738 | |
739 | |
1503 | 740 void InterpreterMacroAssembler::get_cache_index_at_bcp(Register cache, Register tmp, |
1565 | 741 int bcp_offset, size_t index_size) { |
1503 | 742 assert(bcp_offset > 0, "bcp is still pointing to start of bytecode"); |
1565 | 743 if (index_size == sizeof(u2)) { |
1503 | 744 get_2_byte_integer_at_bcp(bcp_offset, cache, tmp, Unsigned); |
1565 | 745 } else if (index_size == sizeof(u4)) { |
2416
38fea01eb669
6817525: turn on method handle functionality by default for JSR 292
twisti
parents:
2118
diff
changeset
|
746 assert(EnableInvokeDynamic, "giant index used only for JSR 292"); |
1503 | 747 get_4_byte_integer_at_bcp(bcp_offset, cache, tmp); |
748 assert(constantPoolCacheOopDesc::decode_secondary_index(~123) == 123, "else change next line"); | |
749 xor3(tmp, -1, tmp); // convert to plain index | |
1565 | 750 } else if (index_size == sizeof(u1)) { |
2416
38fea01eb669
6817525: turn on method handle functionality by default for JSR 292
twisti
parents:
2118
diff
changeset
|
751 assert(EnableInvokeDynamic, "tiny index used only for JSR 292"); |
1565 | 752 ldub(Lbcp, bcp_offset, tmp); |
753 } else { | |
754 ShouldNotReachHere(); | |
1503 | 755 } |
756 } | |
757 | |
758 | |
759 void InterpreterMacroAssembler::get_cache_and_index_at_bcp(Register cache, Register tmp, | |
1565 | 760 int bcp_offset, size_t index_size) { |
0 | 761 assert(bcp_offset > 0, "bcp is still pointing to start of bytecode"); |
762 assert_different_registers(cache, tmp); | |
763 assert_not_delayed(); | |
1565 | 764 get_cache_index_at_bcp(cache, tmp, bcp_offset, index_size); |
1503 | 765 // convert from field index to ConstantPoolCacheEntry index and from |
766 // word index to byte offset | |
0 | 767 sll(tmp, exact_log2(in_words(ConstantPoolCacheEntry::size()) * BytesPerWord), tmp); |
768 add(LcpoolCache, tmp, cache); | |
769 } | |
770 | |
771 | |
1503 | 772 void InterpreterMacroAssembler::get_cache_entry_pointer_at_bcp(Register cache, Register tmp, |
1565 | 773 int bcp_offset, size_t index_size) { |
0 | 774 assert(bcp_offset > 0, "bcp is still pointing to start of bytecode"); |
775 assert_different_registers(cache, tmp); | |
776 assert_not_delayed(); | |
1565 | 777 if (index_size == sizeof(u2)) { |
778 get_2_byte_integer_at_bcp(bcp_offset, cache, tmp, Unsigned); | |
779 } else { | |
780 ShouldNotReachHere(); // other sizes not supported here | |
781 } | |
0 | 782 // convert from field index to ConstantPoolCacheEntry index |
783 // and from word index to byte offset | |
784 sll(tmp, exact_log2(in_words(ConstantPoolCacheEntry::size()) * BytesPerWord), tmp); | |
785 // skip past the header | |
786 add(tmp, in_bytes(constantPoolCacheOopDesc::base_offset()), tmp); | |
787 // construct pointer to cache entry | |
788 add(LcpoolCache, tmp, cache); | |
789 } | |
790 | |
791 | |
792 // Generate a subtype check: branch to ok_is_subtype if sub_klass is | |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
793 // a subtype of super_klass. Blows registers Rsuper_klass, Rsub_klass, tmp1, tmp2. |
0 | 794 void InterpreterMacroAssembler::gen_subtype_check(Register Rsub_klass, |
795 Register Rsuper_klass, | |
796 Register Rtmp1, | |
797 Register Rtmp2, | |
798 Register Rtmp3, | |
799 Label &ok_is_subtype ) { | |
644
c517646eef23
6813212: factor duplicated assembly code for general subclass check (for 6655638)
jrose
parents:
614
diff
changeset
|
800 Label not_subtype; |
0 | 801 |
802 // Profile the not-null value's klass. | |
803 profile_typecheck(Rsub_klass, Rtmp1); | |
804 | |
644
c517646eef23
6813212: factor duplicated assembly code for general subclass check (for 6655638)
jrose
parents:
614
diff
changeset
|
805 check_klass_subtype_fast_path(Rsub_klass, Rsuper_klass, |
c517646eef23
6813212: factor duplicated assembly code for general subclass check (for 6655638)
jrose
parents:
614
diff
changeset
|
806 Rtmp1, Rtmp2, |
c517646eef23
6813212: factor duplicated assembly code for general subclass check (for 6655638)
jrose
parents:
614
diff
changeset
|
807 &ok_is_subtype, ¬_subtype, NULL); |
c517646eef23
6813212: factor duplicated assembly code for general subclass check (for 6655638)
jrose
parents:
614
diff
changeset
|
808 |
c517646eef23
6813212: factor duplicated assembly code for general subclass check (for 6655638)
jrose
parents:
614
diff
changeset
|
809 check_klass_subtype_slow_path(Rsub_klass, Rsuper_klass, |
c517646eef23
6813212: factor duplicated assembly code for general subclass check (for 6655638)
jrose
parents:
614
diff
changeset
|
810 Rtmp1, Rtmp2, Rtmp3, /*hack:*/ noreg, |
c517646eef23
6813212: factor duplicated assembly code for general subclass check (for 6655638)
jrose
parents:
614
diff
changeset
|
811 &ok_is_subtype, NULL); |
0 | 812 |
813 bind(not_subtype); | |
814 profile_typecheck_failed(Rtmp1); | |
815 } | |
816 | |
817 // Separate these two to allow for delay slot in middle | |
818 // These are used to do a test and full jump to exception-throwing code. | |
819 | |
820 // %%%%% Could possibly reoptimize this by testing to see if could use | |
821 // a single conditional branch (i.e. if span is small enough. | |
822 // If you go that route, than get rid of the split and give up | |
823 // on the delay-slot hack. | |
824 | |
825 void InterpreterMacroAssembler::throw_if_not_1_icc( Condition ok_condition, | |
826 Label& ok ) { | |
827 assert_not_delayed(); | |
828 br(ok_condition, true, pt, ok); | |
829 // DELAY SLOT | |
830 } | |
831 | |
832 void InterpreterMacroAssembler::throw_if_not_1_xcc( Condition ok_condition, | |
833 Label& ok ) { | |
834 assert_not_delayed(); | |
835 bp( ok_condition, true, Assembler::xcc, pt, ok); | |
836 // DELAY SLOT | |
837 } | |
838 | |
839 void InterpreterMacroAssembler::throw_if_not_1_x( Condition ok_condition, | |
840 Label& ok ) { | |
841 assert_not_delayed(); | |
842 brx(ok_condition, true, pt, ok); | |
843 // DELAY SLOT | |
844 } | |
845 | |
846 void InterpreterMacroAssembler::throw_if_not_2( address throw_entry_point, | |
847 Register Rscratch, | |
848 Label& ok ) { | |
849 assert(throw_entry_point != NULL, "entry point must be generated by now"); | |
727 | 850 AddressLiteral dest(throw_entry_point); |
851 jump_to(dest, Rscratch); | |
0 | 852 delayed()->nop(); |
853 bind(ok); | |
854 } | |
855 | |
856 | |
857 // And if you cannot use the delay slot, here is a shorthand: | |
858 | |
859 void InterpreterMacroAssembler::throw_if_not_icc( Condition ok_condition, | |
860 address throw_entry_point, | |
861 Register Rscratch ) { | |
862 Label ok; | |
863 if (ok_condition != never) { | |
864 throw_if_not_1_icc( ok_condition, ok); | |
865 delayed()->nop(); | |
866 } | |
867 throw_if_not_2( throw_entry_point, Rscratch, ok); | |
868 } | |
869 void InterpreterMacroAssembler::throw_if_not_xcc( Condition ok_condition, | |
870 address throw_entry_point, | |
871 Register Rscratch ) { | |
872 Label ok; | |
873 if (ok_condition != never) { | |
874 throw_if_not_1_xcc( ok_condition, ok); | |
875 delayed()->nop(); | |
876 } | |
877 throw_if_not_2( throw_entry_point, Rscratch, ok); | |
878 } | |
879 void InterpreterMacroAssembler::throw_if_not_x( Condition ok_condition, | |
880 address throw_entry_point, | |
881 Register Rscratch ) { | |
882 Label ok; | |
883 if (ok_condition != never) { | |
884 throw_if_not_1_x( ok_condition, ok); | |
885 delayed()->nop(); | |
886 } | |
887 throw_if_not_2( throw_entry_point, Rscratch, ok); | |
888 } | |
889 | |
890 // Check that index is in range for array, then shift index by index_shift, and put arrayOop + shifted_index into res | |
891 // Note: res is still shy of address by array offset into object. | |
892 | |
893 void InterpreterMacroAssembler::index_check_without_pop(Register array, Register index, int index_shift, Register tmp, Register res) { | |
894 assert_not_delayed(); | |
895 | |
896 verify_oop(array); | |
897 #ifdef _LP64 | |
898 // sign extend since tos (index) can be a 32bit value | |
899 sra(index, G0, index); | |
900 #endif // _LP64 | |
901 | |
902 // check array | |
903 Label ptr_ok; | |
904 tst(array); | |
905 throw_if_not_1_x( notZero, ptr_ok ); | |
906 delayed()->ld( array, arrayOopDesc::length_offset_in_bytes(), tmp ); // check index | |
907 throw_if_not_2( Interpreter::_throw_NullPointerException_entry, G3_scratch, ptr_ok); | |
908 | |
909 Label index_ok; | |
910 cmp(index, tmp); | |
911 throw_if_not_1_icc( lessUnsigned, index_ok ); | |
912 if (index_shift > 0) delayed()->sll(index, index_shift, index); | |
913 else delayed()->add(array, index, res); // addr - const offset in index | |
914 // convention: move aberrant index into G3_scratch for exception message | |
915 mov(index, G3_scratch); | |
916 throw_if_not_2( Interpreter::_throw_ArrayIndexOutOfBoundsException_entry, G4_scratch, index_ok); | |
917 | |
918 // add offset if didn't do it in delay slot | |
919 if (index_shift > 0) add(array, index, res); // addr - const offset in index | |
920 } | |
921 | |
922 | |
923 void InterpreterMacroAssembler::index_check(Register array, Register index, int index_shift, Register tmp, Register res) { | |
924 assert_not_delayed(); | |
925 | |
926 // pop array | |
927 pop_ptr(array); | |
928 | |
929 // check array | |
930 index_check_without_pop(array, index, index_shift, tmp, res); | |
931 } | |
932 | |
933 | |
934 void InterpreterMacroAssembler::get_constant_pool(Register Rdst) { | |
935 ld_ptr(Lmethod, in_bytes(methodOopDesc::constants_offset()), Rdst); | |
936 } | |
937 | |
938 | |
939 void InterpreterMacroAssembler::get_constant_pool_cache(Register Rdst) { | |
940 get_constant_pool(Rdst); | |
941 ld_ptr(Rdst, constantPoolOopDesc::cache_offset_in_bytes(), Rdst); | |
942 } | |
943 | |
944 | |
945 void InterpreterMacroAssembler::get_cpool_and_tags(Register Rcpool, Register Rtags) { | |
946 get_constant_pool(Rcpool); | |
947 ld_ptr(Rcpool, constantPoolOopDesc::tags_offset_in_bytes(), Rtags); | |
948 } | |
949 | |
950 | |
951 // unlock if synchronized method | |
952 // | |
953 // Unlock the receiver if this is a synchronized method. | |
954 // Unlock any Java monitors from syncronized blocks. | |
955 // | |
956 // If there are locked Java monitors | |
957 // If throw_monitor_exception | |
958 // throws IllegalMonitorStateException | |
959 // Else if install_monitor_exception | |
960 // installs IllegalMonitorStateException | |
961 // Else | |
962 // no error processing | |
963 void InterpreterMacroAssembler::unlock_if_synchronized_method(TosState state, | |
964 bool throw_monitor_exception, | |
965 bool install_monitor_exception) { | |
966 Label unlocked, unlock, no_unlock; | |
967 | |
968 // get the value of _do_not_unlock_if_synchronized into G1_scratch | |
727 | 969 const Address do_not_unlock_if_synchronized(G2_thread, |
970 JavaThread::do_not_unlock_if_synchronized_offset()); | |
0 | 971 ldbool(do_not_unlock_if_synchronized, G1_scratch); |
972 stbool(G0, do_not_unlock_if_synchronized); // reset the flag | |
973 | |
974 // check if synchronized method | |
727 | 975 const Address access_flags(Lmethod, methodOopDesc::access_flags_offset()); |
0 | 976 interp_verify_oop(Otos_i, state, __FILE__, __LINE__); |
977 push(state); // save tos | |
727 | 978 ld(access_flags, G3_scratch); // Load access flags. |
0 | 979 btst(JVM_ACC_SYNCHRONIZED, G3_scratch); |
727 | 980 br(zero, false, pt, unlocked); |
0 | 981 delayed()->nop(); |
982 | |
983 // Don't unlock anything if the _do_not_unlock_if_synchronized flag | |
984 // is set. | |
985 tstbool(G1_scratch); | |
986 br(Assembler::notZero, false, pn, no_unlock); | |
987 delayed()->nop(); | |
988 | |
989 // BasicObjectLock will be first in list, since this is a synchronized method. However, need | |
990 // to check that the object has not been unlocked by an explicit monitorexit bytecode. | |
991 | |
992 //Intel: if (throw_monitor_exception) ... else ... | |
993 // Entry already unlocked, need to throw exception | |
994 //... | |
995 | |
996 // pass top-most monitor elem | |
997 add( top_most_monitor(), O1 ); | |
998 | |
999 ld_ptr(O1, BasicObjectLock::obj_offset_in_bytes(), G3_scratch); | |
1000 br_notnull(G3_scratch, false, pt, unlock); | |
1001 delayed()->nop(); | |
1002 | |
1003 if (throw_monitor_exception) { | |
1004 // Entry already unlocked need to throw an exception | |
1005 MacroAssembler::call_VM(noreg, CAST_FROM_FN_PTR(address, InterpreterRuntime::throw_illegal_monitor_state_exception)); | |
1006 should_not_reach_here(); | |
1007 } else { | |
1008 // Monitor already unlocked during a stack unroll. | |
1009 // If requested, install an illegal_monitor_state_exception. | |
1010 // Continue with stack unrolling. | |
1011 if (install_monitor_exception) { | |
1012 MacroAssembler::call_VM(noreg, CAST_FROM_FN_PTR(address, InterpreterRuntime::new_illegal_monitor_state_exception)); | |
1013 } | |
1014 ba(false, unlocked); | |
1015 delayed()->nop(); | |
1016 } | |
1017 | |
1018 bind(unlock); | |
1019 | |
1020 unlock_object(O1); | |
1021 | |
1022 bind(unlocked); | |
1023 | |
1024 // I0, I1: Might contain return value | |
1025 | |
1026 // Check that all monitors are unlocked | |
1027 { Label loop, exception, entry, restart; | |
1028 | |
1029 Register Rmptr = O0; | |
1030 Register Rtemp = O1; | |
1031 Register Rlimit = Lmonitors; | |
1032 const jint delta = frame::interpreter_frame_monitor_size() * wordSize; | |
1033 assert( (delta & LongAlignmentMask) == 0, | |
1034 "sizeof BasicObjectLock must be even number of doublewords"); | |
1035 | |
1036 #ifdef ASSERT | |
1037 add(top_most_monitor(), Rmptr, delta); | |
1038 { Label L; | |
1039 // ensure that Rmptr starts out above (or at) Rlimit | |
1040 cmp(Rmptr, Rlimit); | |
1041 brx(Assembler::greaterEqualUnsigned, false, pn, L); | |
1042 delayed()->nop(); | |
1043 stop("monitor stack has negative size"); | |
1044 bind(L); | |
1045 } | |
1046 #endif | |
1047 bind(restart); | |
1048 ba(false, entry); | |
1049 delayed()-> | |
1050 add(top_most_monitor(), Rmptr, delta); // points to current entry, starting with bottom-most entry | |
1051 | |
1052 // Entry is still locked, need to throw exception | |
1053 bind(exception); | |
1054 if (throw_monitor_exception) { | |
1055 MacroAssembler::call_VM(noreg, CAST_FROM_FN_PTR(address, InterpreterRuntime::throw_illegal_monitor_state_exception)); | |
1056 should_not_reach_here(); | |
1057 } else { | |
1058 // Stack unrolling. Unlock object and if requested, install illegal_monitor_exception. | |
1059 // Unlock does not block, so don't have to worry about the frame | |
1060 unlock_object(Rmptr); | |
1061 if (install_monitor_exception) { | |
1062 MacroAssembler::call_VM(noreg, CAST_FROM_FN_PTR(address, InterpreterRuntime::new_illegal_monitor_state_exception)); | |
1063 } | |
1064 ba(false, restart); | |
1065 delayed()->nop(); | |
1066 } | |
1067 | |
1068 bind(loop); | |
1069 cmp(Rtemp, G0); // check if current entry is used | |
1070 brx(Assembler::notEqual, false, pn, exception); | |
1071 delayed()-> | |
1072 dec(Rmptr, delta); // otherwise advance to next entry | |
1073 #ifdef ASSERT | |
1074 { Label L; | |
1075 // ensure that Rmptr has not somehow stepped below Rlimit | |
1076 cmp(Rmptr, Rlimit); | |
1077 brx(Assembler::greaterEqualUnsigned, false, pn, L); | |
1078 delayed()->nop(); | |
1079 stop("ran off the end of the monitor stack"); | |
1080 bind(L); | |
1081 } | |
1082 #endif | |
1083 bind(entry); | |
1084 cmp(Rmptr, Rlimit); // check if bottom reached | |
1085 brx(Assembler::notEqual, true, pn, loop); // if not at bottom then check this entry | |
1086 delayed()-> | |
1087 ld_ptr(Rmptr, BasicObjectLock::obj_offset_in_bytes() - delta, Rtemp); | |
1088 } | |
1089 | |
1090 bind(no_unlock); | |
1091 pop(state); | |
1092 interp_verify_oop(Otos_i, state, __FILE__, __LINE__); | |
1093 } | |
1094 | |
1095 | |
1096 // remove activation | |
1097 // | |
1098 // Unlock the receiver if this is a synchronized method. | |
1099 // Unlock any Java monitors from syncronized blocks. | |
1100 // Remove the activation from the stack. | |
1101 // | |
1102 // If there are locked Java monitors | |
1103 // If throw_monitor_exception | |
1104 // throws IllegalMonitorStateException | |
1105 // Else if install_monitor_exception | |
1106 // installs IllegalMonitorStateException | |
1107 // Else | |
1108 // no error processing | |
1109 void InterpreterMacroAssembler::remove_activation(TosState state, | |
1110 bool throw_monitor_exception, | |
1111 bool install_monitor_exception) { | |
1112 | |
1113 unlock_if_synchronized_method(state, throw_monitor_exception, install_monitor_exception); | |
1114 | |
1115 // save result (push state before jvmti call and pop it afterwards) and notify jvmti | |
1116 notify_method_exit(false, state, NotifyJVMTI); | |
1117 | |
1118 interp_verify_oop(Otos_i, state, __FILE__, __LINE__); | |
1119 verify_oop(Lmethod); | |
1120 verify_thread(); | |
1121 | |
1122 // return tos | |
1123 assert(Otos_l1 == Otos_i, "adjust code below"); | |
1124 switch (state) { | |
1125 #ifdef _LP64 | |
1126 case ltos: mov(Otos_l, Otos_l->after_save()); break; // O0 -> I0 | |
1127 #else | |
1128 case ltos: mov(Otos_l2, Otos_l2->after_save()); // fall through // O1 -> I1 | |
1129 #endif | |
1130 case btos: // fall through | |
1131 case ctos: | |
1132 case stos: // fall through | |
1133 case atos: // fall through | |
1134 case itos: mov(Otos_l1, Otos_l1->after_save()); break; // O0 -> I0 | |
1135 case ftos: // fall through | |
1136 case dtos: // fall through | |
1137 case vtos: /* nothing to do */ break; | |
1138 default : ShouldNotReachHere(); | |
1139 } | |
1140 | |
1141 #if defined(COMPILER2) && !defined(_LP64) | |
1142 if (state == ltos) { | |
1143 // C2 expects long results in G1 we can't tell if we're returning to interpreted | |
1144 // or compiled so just be safe use G1 and O0/O1 | |
1145 | |
1146 // Shift bits into high (msb) of G1 | |
1147 sllx(Otos_l1->after_save(), 32, G1); | |
1148 // Zero extend low bits | |
1149 srl (Otos_l2->after_save(), 0, Otos_l2->after_save()); | |
1150 or3 (Otos_l2->after_save(), G1, G1); | |
1151 } | |
1152 #endif /* COMPILER2 */ | |
1153 | |
1154 } | |
1155 #endif /* CC_INTERP */ | |
1156 | |
1157 | |
1158 // Lock object | |
1159 // | |
1160 // Argument - lock_reg points to the BasicObjectLock to be used for locking, | |
1161 // it must be initialized with the object to lock | |
1162 void InterpreterMacroAssembler::lock_object(Register lock_reg, Register Object) { | |
1163 if (UseHeavyMonitors) { | |
1164 call_VM(noreg, CAST_FROM_FN_PTR(address, InterpreterRuntime::monitorenter), lock_reg); | |
1165 } | |
1166 else { | |
1167 Register obj_reg = Object; | |
1168 Register mark_reg = G4_scratch; | |
1169 Register temp_reg = G1_scratch; | |
727 | 1170 Address lock_addr(lock_reg, BasicObjectLock::lock_offset_in_bytes()); |
1171 Address mark_addr(obj_reg, oopDesc::mark_offset_in_bytes()); | |
0 | 1172 Label done; |
1173 | |
1174 Label slow_case; | |
1175 | |
1176 assert_different_registers(lock_reg, obj_reg, mark_reg, temp_reg); | |
1177 | |
1178 // load markOop from object into mark_reg | |
1179 ld_ptr(mark_addr, mark_reg); | |
1180 | |
1181 if (UseBiasedLocking) { | |
1182 biased_locking_enter(obj_reg, mark_reg, temp_reg, done, &slow_case); | |
1183 } | |
1184 | |
1185 // get the address of basicLock on stack that will be stored in the object | |
1186 // we need a temporary register here as we do not want to clobber lock_reg | |
1187 // (cas clobbers the destination register) | |
1188 mov(lock_reg, temp_reg); | |
1189 // set mark reg to be (markOop of object | UNLOCK_VALUE) | |
1190 or3(mark_reg, markOopDesc::unlocked_value, mark_reg); | |
1191 // initialize the box (Must happen before we update the object mark!) | |
1192 st_ptr(mark_reg, lock_addr, BasicLock::displaced_header_offset_in_bytes()); | |
1193 // compare and exchange object_addr, markOop | 1, stack address of basicLock | |
1194 assert(mark_addr.disp() == 0, "cas must take a zero displacement"); | |
1195 casx_under_lock(mark_addr.base(), mark_reg, temp_reg, | |
1196 (address)StubRoutines::Sparc::atomic_memory_operation_lock_addr()); | |
1197 | |
1198 // if the compare and exchange succeeded we are done (we saw an unlocked object) | |
1199 cmp(mark_reg, temp_reg); | |
1200 brx(Assembler::equal, true, Assembler::pt, done); | |
1201 delayed()->nop(); | |
1202 | |
1203 // We did not see an unlocked object so try the fast recursive case | |
1204 | |
1205 // Check if owner is self by comparing the value in the markOop of object | |
1206 // with the stack pointer | |
1207 sub(temp_reg, SP, temp_reg); | |
1208 #ifdef _LP64 | |
1209 sub(temp_reg, STACK_BIAS, temp_reg); | |
1210 #endif | |
1211 assert(os::vm_page_size() > 0xfff, "page size too small - change the constant"); | |
1212 | |
1213 // Composite "andcc" test: | |
1214 // (a) %sp -vs- markword proximity check, and, | |
1215 // (b) verify mark word LSBs == 0 (Stack-locked). | |
1216 // | |
1217 // FFFFF003/FFFFFFFFFFFF003 is (markOopDesc::lock_mask_in_place | -os::vm_page_size()) | |
1218 // Note that the page size used for %sp proximity testing is arbitrary and is | |
1219 // unrelated to the actual MMU page size. We use a 'logical' page size of | |
1220 // 4096 bytes. F..FFF003 is designed to fit conveniently in the SIMM13 immediate | |
1221 // field of the andcc instruction. | |
1222 andcc (temp_reg, 0xFFFFF003, G0) ; | |
1223 | |
1224 // if condition is true we are done and hence we can store 0 in the displaced | |
1225 // header indicating it is a recursive lock and be done | |
1226 brx(Assembler::zero, true, Assembler::pt, done); | |
1227 delayed()->st_ptr(G0, lock_addr, BasicLock::displaced_header_offset_in_bytes()); | |
1228 | |
1229 // none of the above fast optimizations worked so we have to get into the | |
1230 // slow case of monitor enter | |
1231 bind(slow_case); | |
1232 call_VM(noreg, CAST_FROM_FN_PTR(address, InterpreterRuntime::monitorenter), lock_reg); | |
1233 | |
1234 bind(done); | |
1235 } | |
1236 } | |
1237 | |
1238 // Unlocks an object. Used in monitorexit bytecode and remove_activation. | |
1239 // | |
1240 // Argument - lock_reg points to the BasicObjectLock for lock | |
1241 // Throw IllegalMonitorException if object is not locked by current thread | |
1242 void InterpreterMacroAssembler::unlock_object(Register lock_reg) { | |
1243 if (UseHeavyMonitors) { | |
1244 call_VM(noreg, CAST_FROM_FN_PTR(address, InterpreterRuntime::monitorexit), lock_reg); | |
1245 } else { | |
1246 Register obj_reg = G3_scratch; | |
1247 Register mark_reg = G4_scratch; | |
1248 Register displaced_header_reg = G1_scratch; | |
727 | 1249 Address lockobj_addr(lock_reg, BasicObjectLock::obj_offset_in_bytes()); |
1250 Address mark_addr(obj_reg, oopDesc::mark_offset_in_bytes()); | |
0 | 1251 Label done; |
1252 | |
1253 if (UseBiasedLocking) { | |
1254 // load the object out of the BasicObjectLock | |
1255 ld_ptr(lockobj_addr, obj_reg); | |
1256 biased_locking_exit(mark_addr, mark_reg, done, true); | |
1257 st_ptr(G0, lockobj_addr); // free entry | |
1258 } | |
1259 | |
1260 // Test first if we are in the fast recursive case | |
727 | 1261 Address lock_addr(lock_reg, BasicObjectLock::lock_offset_in_bytes() + BasicLock::displaced_header_offset_in_bytes()); |
1262 ld_ptr(lock_addr, displaced_header_reg); | |
0 | 1263 br_null(displaced_header_reg, true, Assembler::pn, done); |
1264 delayed()->st_ptr(G0, lockobj_addr); // free entry | |
1265 | |
1266 // See if it is still a light weight lock, if so we just unlock | |
1267 // the object and we are done | |
1268 | |
1269 if (!UseBiasedLocking) { | |
1270 // load the object out of the BasicObjectLock | |
1271 ld_ptr(lockobj_addr, obj_reg); | |
1272 } | |
1273 | |
1274 // we have the displaced header in displaced_header_reg | |
1275 // we expect to see the stack address of the basicLock in case the | |
1276 // lock is still a light weight lock (lock_reg) | |
1277 assert(mark_addr.disp() == 0, "cas must take a zero displacement"); | |
1278 casx_under_lock(mark_addr.base(), lock_reg, displaced_header_reg, | |
1279 (address)StubRoutines::Sparc::atomic_memory_operation_lock_addr()); | |
1280 cmp(lock_reg, displaced_header_reg); | |
1281 brx(Assembler::equal, true, Assembler::pn, done); | |
1282 delayed()->st_ptr(G0, lockobj_addr); // free entry | |
1283 | |
1284 // The lock has been converted into a heavy lock and hence | |
1285 // we need to get into the slow case | |
1286 | |
1287 call_VM(noreg, CAST_FROM_FN_PTR(address, InterpreterRuntime::monitorexit), lock_reg); | |
1288 | |
1289 bind(done); | |
1290 } | |
1291 } | |
1292 | |
1293 #ifndef CC_INTERP | |
1294 | |
1295 // Get the method data pointer from the methodOop and set the | |
1296 // specified register to its value. | |
1297 | |
2118
dd031b2226de
4930919: race condition in MDO creation at back branch locations
iveresov
parents:
1972
diff
changeset
|
1298 void InterpreterMacroAssembler::set_method_data_pointer() { |
0 | 1299 assert(ProfileInterpreter, "must be profiling interpreter"); |
1300 Label get_continue; | |
1301 | |
1302 ld_ptr(Lmethod, in_bytes(methodOopDesc::method_data_offset()), ImethodDataPtr); | |
1303 test_method_data_pointer(get_continue); | |
1304 add(ImethodDataPtr, in_bytes(methodDataOopDesc::data_offset()), ImethodDataPtr); | |
1305 bind(get_continue); | |
1306 } | |
1307 | |
1308 // Set the method data pointer for the current bcp. | |
1309 | |
1310 void InterpreterMacroAssembler::set_method_data_pointer_for_bcp() { | |
1311 assert(ProfileInterpreter, "must be profiling interpreter"); | |
1312 Label zero_continue; | |
1313 | |
1314 // Test MDO to avoid the call if it is NULL. | |
2118
dd031b2226de
4930919: race condition in MDO creation at back branch locations
iveresov
parents:
1972
diff
changeset
|
1315 ld_ptr(Lmethod, in_bytes(methodOopDesc::method_data_offset()), ImethodDataPtr); |
0 | 1316 test_method_data_pointer(zero_continue); |
1317 call_VM_leaf(noreg, CAST_FROM_FN_PTR(address, InterpreterRuntime::bcp_to_di), Lmethod, Lbcp); | |
2118
dd031b2226de
4930919: race condition in MDO creation at back branch locations
iveresov
parents:
1972
diff
changeset
|
1318 add(ImethodDataPtr, in_bytes(methodDataOopDesc::data_offset()), ImethodDataPtr); |
dd031b2226de
4930919: race condition in MDO creation at back branch locations
iveresov
parents:
1972
diff
changeset
|
1319 add(ImethodDataPtr, O0, ImethodDataPtr); |
0 | 1320 bind(zero_continue); |
1321 } | |
1322 | |
1323 // Test ImethodDataPtr. If it is null, continue at the specified label | |
1324 | |
1325 void InterpreterMacroAssembler::test_method_data_pointer(Label& zero_continue) { | |
1326 assert(ProfileInterpreter, "must be profiling interpreter"); | |
1327 #ifdef _LP64 | |
1328 bpr(Assembler::rc_z, false, Assembler::pn, ImethodDataPtr, zero_continue); | |
1329 #else | |
1330 tst(ImethodDataPtr); | |
1331 br(Assembler::zero, false, Assembler::pn, zero_continue); | |
1332 #endif | |
1333 delayed()->nop(); | |
1334 } | |
1335 | |
1336 void InterpreterMacroAssembler::verify_method_data_pointer() { | |
1337 assert(ProfileInterpreter, "must be profiling interpreter"); | |
1338 #ifdef ASSERT | |
1339 Label verify_continue; | |
1340 test_method_data_pointer(verify_continue); | |
1341 | |
1342 // If the mdp is valid, it will point to a DataLayout header which is | |
1343 // consistent with the bcp. The converse is highly probable also. | |
1344 lduh(ImethodDataPtr, in_bytes(DataLayout::bci_offset()), G3_scratch); | |
727 | 1345 ld_ptr(Lmethod, methodOopDesc::const_offset(), O5); |
0 | 1346 add(G3_scratch, in_bytes(constMethodOopDesc::codes_offset()), G3_scratch); |
1347 add(G3_scratch, O5, G3_scratch); | |
1348 cmp(Lbcp, G3_scratch); | |
1349 brx(Assembler::equal, false, Assembler::pt, verify_continue); | |
1350 | |
1351 Register temp_reg = O5; | |
1352 delayed()->mov(ImethodDataPtr, temp_reg); | |
1353 // %%% should use call_VM_leaf here? | |
1354 //call_VM_leaf(noreg, ..., Lmethod, Lbcp, ImethodDataPtr); | |
1355 save_frame_and_mov(sizeof(jdouble) / wordSize, Lmethod, O0, Lbcp, O1); | |
727 | 1356 Address d_save(FP, -sizeof(jdouble) + STACK_BIAS); |
0 | 1357 stf(FloatRegisterImpl::D, Ftos_d, d_save); |
1358 mov(temp_reg->after_save(), O2); | |
1359 save_thread(L7_thread_cache); | |
1360 call(CAST_FROM_FN_PTR(address, InterpreterRuntime::verify_mdp), relocInfo::none); | |
1361 delayed()->nop(); | |
1362 restore_thread(L7_thread_cache); | |
1363 ldf(FloatRegisterImpl::D, d_save, Ftos_d); | |
1364 restore(); | |
1365 bind(verify_continue); | |
1366 #endif // ASSERT | |
1367 } | |
1368 | |
1369 void InterpreterMacroAssembler::test_invocation_counter_for_mdp(Register invocation_count, | |
1370 Register Rtmp, | |
1371 Label &profile_continue) { | |
1372 assert(ProfileInterpreter, "must be profiling interpreter"); | |
1373 // Control will flow to "profile_continue" if the counter is less than the | |
1374 // limit or if we call profile_method() | |
1375 | |
1376 Label done; | |
1377 | |
1378 // if no method data exists, and the counter is high enough, make one | |
1379 #ifdef _LP64 | |
1380 bpr(Assembler::rc_nz, false, Assembler::pn, ImethodDataPtr, done); | |
1381 #else | |
1382 tst(ImethodDataPtr); | |
1383 br(Assembler::notZero, false, Assembler::pn, done); | |
1384 #endif | |
1385 | |
1386 // Test to see if we should create a method data oop | |
727 | 1387 AddressLiteral profile_limit((address) &InvocationCounter::InterpreterProfileLimit); |
0 | 1388 #ifdef _LP64 |
1389 delayed()->nop(); | |
727 | 1390 sethi(profile_limit, Rtmp); |
0 | 1391 #else |
727 | 1392 delayed()->sethi(profile_limit, Rtmp); |
0 | 1393 #endif |
727 | 1394 ld(Rtmp, profile_limit.low10(), Rtmp); |
0 | 1395 cmp(invocation_count, Rtmp); |
1396 br(Assembler::lessUnsigned, false, Assembler::pn, profile_continue); | |
1397 delayed()->nop(); | |
1398 | |
1399 // Build it now. | |
2118
dd031b2226de
4930919: race condition in MDO creation at back branch locations
iveresov
parents:
1972
diff
changeset
|
1400 call_VM(noreg, CAST_FROM_FN_PTR(address, InterpreterRuntime::profile_method)); |
dd031b2226de
4930919: race condition in MDO creation at back branch locations
iveresov
parents:
1972
diff
changeset
|
1401 set_method_data_pointer_for_bcp(); |
0 | 1402 ba(false, profile_continue); |
1403 delayed()->nop(); | |
1404 bind(done); | |
1405 } | |
1406 | |
1407 // Store a value at some constant offset from the method data pointer. | |
1408 | |
1409 void InterpreterMacroAssembler::set_mdp_data_at(int constant, Register value) { | |
1410 assert(ProfileInterpreter, "must be profiling interpreter"); | |
1411 st_ptr(value, ImethodDataPtr, constant); | |
1412 } | |
1413 | |
1414 void InterpreterMacroAssembler::increment_mdp_data_at(Address counter, | |
1415 Register bumped_count, | |
1416 bool decrement) { | |
1417 assert(ProfileInterpreter, "must be profiling interpreter"); | |
1418 | |
1419 // Load the counter. | |
1420 ld_ptr(counter, bumped_count); | |
1421 | |
1422 if (decrement) { | |
1423 // Decrement the register. Set condition codes. | |
1424 subcc(bumped_count, DataLayout::counter_increment, bumped_count); | |
1425 | |
1426 // If the decrement causes the counter to overflow, stay negative | |
1427 Label L; | |
1428 brx(Assembler::negative, true, Assembler::pn, L); | |
1429 | |
1430 // Store the decremented counter, if it is still negative. | |
1431 delayed()->st_ptr(bumped_count, counter); | |
1432 bind(L); | |
1433 } else { | |
1434 // Increment the register. Set carry flag. | |
1435 addcc(bumped_count, DataLayout::counter_increment, bumped_count); | |
1436 | |
1437 // If the increment causes the counter to overflow, pull back by 1. | |
1438 assert(DataLayout::counter_increment == 1, "subc works"); | |
1439 subc(bumped_count, G0, bumped_count); | |
1440 | |
1441 // Store the incremented counter. | |
1442 st_ptr(bumped_count, counter); | |
1443 } | |
1444 } | |
1445 | |
1446 // Increment the value at some constant offset from the method data pointer. | |
1447 | |
1448 void InterpreterMacroAssembler::increment_mdp_data_at(int constant, | |
1449 Register bumped_count, | |
1450 bool decrement) { | |
1451 // Locate the counter at a fixed offset from the mdp: | |
727 | 1452 Address counter(ImethodDataPtr, constant); |
0 | 1453 increment_mdp_data_at(counter, bumped_count, decrement); |
1454 } | |
1455 | |
1456 // Increment the value at some non-fixed (reg + constant) offset from | |
1457 // the method data pointer. | |
1458 | |
1459 void InterpreterMacroAssembler::increment_mdp_data_at(Register reg, | |
1460 int constant, | |
1461 Register bumped_count, | |
1462 Register scratch2, | |
1463 bool decrement) { | |
1464 // Add the constant to reg to get the offset. | |
1465 add(ImethodDataPtr, reg, scratch2); | |
727 | 1466 Address counter(scratch2, constant); |
0 | 1467 increment_mdp_data_at(counter, bumped_count, decrement); |
1468 } | |
1469 | |
1470 // Set a flag value at the current method data pointer position. | |
1471 // Updates a single byte of the header, to avoid races with other header bits. | |
1472 | |
1473 void InterpreterMacroAssembler::set_mdp_flag_at(int flag_constant, | |
1474 Register scratch) { | |
1475 assert(ProfileInterpreter, "must be profiling interpreter"); | |
1476 // Load the data header | |
1477 ldub(ImethodDataPtr, in_bytes(DataLayout::flags_offset()), scratch); | |
1478 | |
1479 // Set the flag | |
1480 or3(scratch, flag_constant, scratch); | |
1481 | |
1482 // Store the modified header. | |
1483 stb(scratch, ImethodDataPtr, in_bytes(DataLayout::flags_offset())); | |
1484 } | |
1485 | |
1486 // Test the location at some offset from the method data pointer. | |
1487 // If it is not equal to value, branch to the not_equal_continue Label. | |
1488 // Set condition codes to match the nullness of the loaded value. | |
1489 | |
1490 void InterpreterMacroAssembler::test_mdp_data_at(int offset, | |
1491 Register value, | |
1492 Label& not_equal_continue, | |
1493 Register scratch) { | |
1494 assert(ProfileInterpreter, "must be profiling interpreter"); | |
1495 ld_ptr(ImethodDataPtr, offset, scratch); | |
1496 cmp(value, scratch); | |
1497 brx(Assembler::notEqual, false, Assembler::pn, not_equal_continue); | |
1498 delayed()->tst(scratch); | |
1499 } | |
1500 | |
1501 // Update the method data pointer by the displacement located at some fixed | |
1502 // offset from the method data pointer. | |
1503 | |
1504 void InterpreterMacroAssembler::update_mdp_by_offset(int offset_of_disp, | |
1505 Register scratch) { | |
1506 assert(ProfileInterpreter, "must be profiling interpreter"); | |
1507 ld_ptr(ImethodDataPtr, offset_of_disp, scratch); | |
1508 add(ImethodDataPtr, scratch, ImethodDataPtr); | |
1509 } | |
1510 | |
1511 // Update the method data pointer by the displacement located at the | |
1512 // offset (reg + offset_of_disp). | |
1513 | |
1514 void InterpreterMacroAssembler::update_mdp_by_offset(Register reg, | |
1515 int offset_of_disp, | |
1516 Register scratch) { | |
1517 assert(ProfileInterpreter, "must be profiling interpreter"); | |
1518 add(reg, offset_of_disp, scratch); | |
1519 ld_ptr(ImethodDataPtr, scratch, scratch); | |
1520 add(ImethodDataPtr, scratch, ImethodDataPtr); | |
1521 } | |
1522 | |
1523 // Update the method data pointer by a simple constant displacement. | |
1524 | |
1525 void InterpreterMacroAssembler::update_mdp_by_constant(int constant) { | |
1526 assert(ProfileInterpreter, "must be profiling interpreter"); | |
1527 add(ImethodDataPtr, constant, ImethodDataPtr); | |
1528 } | |
1529 | |
1530 // Update the method data pointer for a _ret bytecode whose target | |
1531 // was not among our cached targets. | |
1532 | |
1533 void InterpreterMacroAssembler::update_mdp_for_ret(TosState state, | |
1534 Register return_bci) { | |
1535 assert(ProfileInterpreter, "must be profiling interpreter"); | |
1536 push(state); | |
1537 st_ptr(return_bci, l_tmp); // protect return_bci, in case it is volatile | |
1538 call_VM(noreg, CAST_FROM_FN_PTR(address, InterpreterRuntime::update_mdp_for_ret), return_bci); | |
1539 ld_ptr(l_tmp, return_bci); | |
1540 pop(state); | |
1541 } | |
1542 | |
1543 // Count a taken branch in the bytecodes. | |
1544 | |
1545 void InterpreterMacroAssembler::profile_taken_branch(Register scratch, Register bumped_count) { | |
1546 if (ProfileInterpreter) { | |
1547 Label profile_continue; | |
1548 | |
1549 // If no method data exists, go to profile_continue. | |
1550 test_method_data_pointer(profile_continue); | |
1551 | |
1552 // We are taking a branch. Increment the taken count. | |
1553 increment_mdp_data_at(in_bytes(JumpData::taken_offset()), bumped_count); | |
1554 | |
1555 // The method data pointer needs to be updated to reflect the new target. | |
1556 update_mdp_by_offset(in_bytes(JumpData::displacement_offset()), scratch); | |
1557 bind (profile_continue); | |
1558 } | |
1559 } | |
1560 | |
1561 | |
1562 // Count a not-taken branch in the bytecodes. | |
1563 | |
1564 void InterpreterMacroAssembler::profile_not_taken_branch(Register scratch) { | |
1565 if (ProfileInterpreter) { | |
1566 Label profile_continue; | |
1567 | |
1568 // If no method data exists, go to profile_continue. | |
1569 test_method_data_pointer(profile_continue); | |
1570 | |
1571 // We are taking a branch. Increment the not taken count. | |
1572 increment_mdp_data_at(in_bytes(BranchData::not_taken_offset()), scratch); | |
1573 | |
1574 // The method data pointer needs to be updated to correspond to the | |
1575 // next bytecode. | |
1576 update_mdp_by_constant(in_bytes(BranchData::branch_data_size())); | |
1577 bind (profile_continue); | |
1578 } | |
1579 } | |
1580 | |
1581 | |
1582 // Count a non-virtual call in the bytecodes. | |
1583 | |
1584 void InterpreterMacroAssembler::profile_call(Register scratch) { | |
1585 if (ProfileInterpreter) { | |
1586 Label profile_continue; | |
1587 | |
1588 // If no method data exists, go to profile_continue. | |
1589 test_method_data_pointer(profile_continue); | |
1590 | |
1591 // We are making a call. Increment the count. | |
1592 increment_mdp_data_at(in_bytes(CounterData::count_offset()), scratch); | |
1593 | |
1594 // The method data pointer needs to be updated to reflect the new target. | |
1595 update_mdp_by_constant(in_bytes(CounterData::counter_data_size())); | |
1596 bind (profile_continue); | |
1597 } | |
1598 } | |
1599 | |
1600 | |
1601 // Count a final call in the bytecodes. | |
1602 | |
1603 void InterpreterMacroAssembler::profile_final_call(Register scratch) { | |
1604 if (ProfileInterpreter) { | |
1605 Label profile_continue; | |
1606 | |
1607 // If no method data exists, go to profile_continue. | |
1608 test_method_data_pointer(profile_continue); | |
1609 | |
1610 // We are making a call. Increment the count. | |
1611 increment_mdp_data_at(in_bytes(CounterData::count_offset()), scratch); | |
1612 | |
1613 // The method data pointer needs to be updated to reflect the new target. | |
1614 update_mdp_by_constant(in_bytes(VirtualCallData::virtual_call_data_size())); | |
1615 bind (profile_continue); | |
1616 } | |
1617 } | |
1618 | |
1619 | |
1620 // Count a virtual call in the bytecodes. | |
1621 | |
1622 void InterpreterMacroAssembler::profile_virtual_call(Register receiver, | |
1503 | 1623 Register scratch, |
1624 bool receiver_can_be_null) { | |
0 | 1625 if (ProfileInterpreter) { |
1626 Label profile_continue; | |
1627 | |
1628 // If no method data exists, go to profile_continue. | |
1629 test_method_data_pointer(profile_continue); | |
1630 | |
1503 | 1631 |
1632 Label skip_receiver_profile; | |
1633 if (receiver_can_be_null) { | |
1634 Label not_null; | |
1635 tst(receiver); | |
1636 brx(Assembler::notZero, false, Assembler::pt, not_null); | |
1637 delayed()->nop(); | |
1638 // We are making a call. Increment the count for null receiver. | |
1639 increment_mdp_data_at(in_bytes(CounterData::count_offset()), scratch); | |
1640 ba(false, skip_receiver_profile); | |
1641 delayed()->nop(); | |
1642 bind(not_null); | |
1643 } | |
1644 | |
0 | 1645 // Record the receiver type. |
1206
87684f1a88b5
6614597: Performance variability in jvm2008 xml.validation
kvn
parents:
967
diff
changeset
|
1646 record_klass_in_profile(receiver, scratch, true); |
1503 | 1647 bind(skip_receiver_profile); |
0 | 1648 |
1649 // The method data pointer needs to be updated to reflect the new target. | |
1650 update_mdp_by_constant(in_bytes(VirtualCallData::virtual_call_data_size())); | |
1651 bind (profile_continue); | |
1652 } | |
1653 } | |
1654 | |
1655 void InterpreterMacroAssembler::record_klass_in_profile_helper( | |
1656 Register receiver, Register scratch, | |
1206
87684f1a88b5
6614597: Performance variability in jvm2008 xml.validation
kvn
parents:
967
diff
changeset
|
1657 int start_row, Label& done, bool is_virtual_call) { |
87684f1a88b5
6614597: Performance variability in jvm2008 xml.validation
kvn
parents:
967
diff
changeset
|
1658 if (TypeProfileWidth == 0) { |
87684f1a88b5
6614597: Performance variability in jvm2008 xml.validation
kvn
parents:
967
diff
changeset
|
1659 if (is_virtual_call) { |
87684f1a88b5
6614597: Performance variability in jvm2008 xml.validation
kvn
parents:
967
diff
changeset
|
1660 increment_mdp_data_at(in_bytes(CounterData::count_offset()), scratch); |
87684f1a88b5
6614597: Performance variability in jvm2008 xml.validation
kvn
parents:
967
diff
changeset
|
1661 } |
967
6918603297f7
6858208: jvm crash when specifying TypeProfileWidth=0 on jdk 6.0
poonam
parents:
727
diff
changeset
|
1662 return; |
1206
87684f1a88b5
6614597: Performance variability in jvm2008 xml.validation
kvn
parents:
967
diff
changeset
|
1663 } |
967
6918603297f7
6858208: jvm crash when specifying TypeProfileWidth=0 on jdk 6.0
poonam
parents:
727
diff
changeset
|
1664 |
0 | 1665 int last_row = VirtualCallData::row_limit() - 1; |
1666 assert(start_row <= last_row, "must be work left to do"); | |
1667 // Test this row for both the receiver and for null. | |
1668 // Take any of three different outcomes: | |
1669 // 1. found receiver => increment count and goto done | |
1670 // 2. found null => keep looking for case 1, maybe allocate this cell | |
1671 // 3. found something else => keep looking for cases 1 and 2 | |
1672 // Case 3 is handled by a recursive call. | |
1673 for (int row = start_row; row <= last_row; row++) { | |
1674 Label next_test; | |
1675 bool test_for_null_also = (row == start_row); | |
1676 | |
1677 // See if the receiver is receiver[n]. | |
1678 int recvr_offset = in_bytes(VirtualCallData::receiver_offset(row)); | |
1679 test_mdp_data_at(recvr_offset, receiver, next_test, scratch); | |
1206
87684f1a88b5
6614597: Performance variability in jvm2008 xml.validation
kvn
parents:
967
diff
changeset
|
1680 // delayed()->tst(scratch); |
0 | 1681 |
1682 // The receiver is receiver[n]. Increment count[n]. | |
1683 int count_offset = in_bytes(VirtualCallData::receiver_count_offset(row)); | |
1684 increment_mdp_data_at(count_offset, scratch); | |
1685 ba(false, done); | |
1686 delayed()->nop(); | |
1687 bind(next_test); | |
1688 | |
1689 if (test_for_null_also) { | |
1206
87684f1a88b5
6614597: Performance variability in jvm2008 xml.validation
kvn
parents:
967
diff
changeset
|
1690 Label found_null; |
0 | 1691 // Failed the equality check on receiver[n]... Test for null. |
1692 if (start_row == last_row) { | |
1693 // The only thing left to do is handle the null case. | |
1206
87684f1a88b5
6614597: Performance variability in jvm2008 xml.validation
kvn
parents:
967
diff
changeset
|
1694 if (is_virtual_call) { |
87684f1a88b5
6614597: Performance variability in jvm2008 xml.validation
kvn
parents:
967
diff
changeset
|
1695 brx(Assembler::zero, false, Assembler::pn, found_null); |
87684f1a88b5
6614597: Performance variability in jvm2008 xml.validation
kvn
parents:
967
diff
changeset
|
1696 delayed()->nop(); |
87684f1a88b5
6614597: Performance variability in jvm2008 xml.validation
kvn
parents:
967
diff
changeset
|
1697 // Receiver did not match any saved receiver and there is no empty row for it. |
1251
576e77447e3c
6923002: assert(false,"this call site should not be polymorphic")
kvn
parents:
1206
diff
changeset
|
1698 // Increment total counter to indicate polymorphic case. |
1206
87684f1a88b5
6614597: Performance variability in jvm2008 xml.validation
kvn
parents:
967
diff
changeset
|
1699 increment_mdp_data_at(in_bytes(CounterData::count_offset()), scratch); |
87684f1a88b5
6614597: Performance variability in jvm2008 xml.validation
kvn
parents:
967
diff
changeset
|
1700 ba(false, done); |
87684f1a88b5
6614597: Performance variability in jvm2008 xml.validation
kvn
parents:
967
diff
changeset
|
1701 delayed()->nop(); |
87684f1a88b5
6614597: Performance variability in jvm2008 xml.validation
kvn
parents:
967
diff
changeset
|
1702 bind(found_null); |
87684f1a88b5
6614597: Performance variability in jvm2008 xml.validation
kvn
parents:
967
diff
changeset
|
1703 } else { |
87684f1a88b5
6614597: Performance variability in jvm2008 xml.validation
kvn
parents:
967
diff
changeset
|
1704 brx(Assembler::notZero, false, Assembler::pt, done); |
87684f1a88b5
6614597: Performance variability in jvm2008 xml.validation
kvn
parents:
967
diff
changeset
|
1705 delayed()->nop(); |
87684f1a88b5
6614597: Performance variability in jvm2008 xml.validation
kvn
parents:
967
diff
changeset
|
1706 } |
0 | 1707 break; |
1708 } | |
1709 // Since null is rare, make it be the branch-taken case. | |
1710 brx(Assembler::zero, false, Assembler::pn, found_null); | |
1711 delayed()->nop(); | |
1712 | |
1713 // Put all the "Case 3" tests here. | |
1206
87684f1a88b5
6614597: Performance variability in jvm2008 xml.validation
kvn
parents:
967
diff
changeset
|
1714 record_klass_in_profile_helper(receiver, scratch, start_row + 1, done, is_virtual_call); |
0 | 1715 |
1716 // Found a null. Keep searching for a matching receiver, | |
1717 // but remember that this is an empty (unused) slot. | |
1718 bind(found_null); | |
1719 } | |
1720 } | |
1721 | |
1722 // In the fall-through case, we found no matching receiver, but we | |
1723 // observed the receiver[start_row] is NULL. | |
1724 | |
1725 // Fill in the receiver field and increment the count. | |
1726 int recvr_offset = in_bytes(VirtualCallData::receiver_offset(start_row)); | |
1727 set_mdp_data_at(recvr_offset, receiver); | |
1728 int count_offset = in_bytes(VirtualCallData::receiver_count_offset(start_row)); | |
1729 mov(DataLayout::counter_increment, scratch); | |
1730 set_mdp_data_at(count_offset, scratch); | |
1206
87684f1a88b5
6614597: Performance variability in jvm2008 xml.validation
kvn
parents:
967
diff
changeset
|
1731 if (start_row > 0) { |
87684f1a88b5
6614597: Performance variability in jvm2008 xml.validation
kvn
parents:
967
diff
changeset
|
1732 ba(false, done); |
87684f1a88b5
6614597: Performance variability in jvm2008 xml.validation
kvn
parents:
967
diff
changeset
|
1733 delayed()->nop(); |
87684f1a88b5
6614597: Performance variability in jvm2008 xml.validation
kvn
parents:
967
diff
changeset
|
1734 } |
0 | 1735 } |
1736 | |
1737 void InterpreterMacroAssembler::record_klass_in_profile(Register receiver, | |
1206
87684f1a88b5
6614597: Performance variability in jvm2008 xml.validation
kvn
parents:
967
diff
changeset
|
1738 Register scratch, bool is_virtual_call) { |
0 | 1739 assert(ProfileInterpreter, "must be profiling"); |
1740 Label done; | |
1741 | |
1206
87684f1a88b5
6614597: Performance variability in jvm2008 xml.validation
kvn
parents:
967
diff
changeset
|
1742 record_klass_in_profile_helper(receiver, scratch, 0, done, is_virtual_call); |
0 | 1743 |
1744 bind (done); | |
1745 } | |
1746 | |
1747 | |
1748 // Count a ret in the bytecodes. | |
1749 | |
1750 void InterpreterMacroAssembler::profile_ret(TosState state, | |
1751 Register return_bci, | |
1752 Register scratch) { | |
1753 if (ProfileInterpreter) { | |
1754 Label profile_continue; | |
1755 uint row; | |
1756 | |
1757 // If no method data exists, go to profile_continue. | |
1758 test_method_data_pointer(profile_continue); | |
1759 | |
1760 // Update the total ret count. | |
1761 increment_mdp_data_at(in_bytes(CounterData::count_offset()), scratch); | |
1762 | |
1763 for (row = 0; row < RetData::row_limit(); row++) { | |
1764 Label next_test; | |
1765 | |
1766 // See if return_bci is equal to bci[n]: | |
1767 test_mdp_data_at(in_bytes(RetData::bci_offset(row)), | |
1768 return_bci, next_test, scratch); | |
1769 | |
1770 // return_bci is equal to bci[n]. Increment the count. | |
1771 increment_mdp_data_at(in_bytes(RetData::bci_count_offset(row)), scratch); | |
1772 | |
1773 // The method data pointer needs to be updated to reflect the new target. | |
1774 update_mdp_by_offset(in_bytes(RetData::bci_displacement_offset(row)), scratch); | |
1775 ba(false, profile_continue); | |
1776 delayed()->nop(); | |
1777 bind(next_test); | |
1778 } | |
1779 | |
1780 update_mdp_for_ret(state, return_bci); | |
1781 | |
1782 bind (profile_continue); | |
1783 } | |
1784 } | |
1785 | |
1786 // Profile an unexpected null in the bytecodes. | |
1787 void InterpreterMacroAssembler::profile_null_seen(Register scratch) { | |
1788 if (ProfileInterpreter) { | |
1789 Label profile_continue; | |
1790 | |
1791 // If no method data exists, go to profile_continue. | |
1792 test_method_data_pointer(profile_continue); | |
1793 | |
1794 set_mdp_flag_at(BitData::null_seen_byte_constant(), scratch); | |
1795 | |
1796 // The method data pointer needs to be updated. | |
1797 int mdp_delta = in_bytes(BitData::bit_data_size()); | |
1798 if (TypeProfileCasts) { | |
1799 mdp_delta = in_bytes(VirtualCallData::virtual_call_data_size()); | |
1800 } | |
1801 update_mdp_by_constant(mdp_delta); | |
1802 | |
1803 bind (profile_continue); | |
1804 } | |
1805 } | |
1806 | |
1807 void InterpreterMacroAssembler::profile_typecheck(Register klass, | |
1808 Register scratch) { | |
1809 if (ProfileInterpreter) { | |
1810 Label profile_continue; | |
1811 | |
1812 // If no method data exists, go to profile_continue. | |
1813 test_method_data_pointer(profile_continue); | |
1814 | |
1815 int mdp_delta = in_bytes(BitData::bit_data_size()); | |
1816 if (TypeProfileCasts) { | |
1817 mdp_delta = in_bytes(VirtualCallData::virtual_call_data_size()); | |
1818 | |
1819 // Record the object type. | |
1206
87684f1a88b5
6614597: Performance variability in jvm2008 xml.validation
kvn
parents:
967
diff
changeset
|
1820 record_klass_in_profile(klass, scratch, false); |
0 | 1821 } |
1822 | |
1823 // The method data pointer needs to be updated. | |
1824 update_mdp_by_constant(mdp_delta); | |
1825 | |
1826 bind (profile_continue); | |
1827 } | |
1828 } | |
1829 | |
1830 void InterpreterMacroAssembler::profile_typecheck_failed(Register scratch) { | |
1831 if (ProfileInterpreter && TypeProfileCasts) { | |
1832 Label profile_continue; | |
1833 | |
1834 // If no method data exists, go to profile_continue. | |
1835 test_method_data_pointer(profile_continue); | |
1836 | |
1837 int count_offset = in_bytes(CounterData::count_offset()); | |
1838 // Back up the address, since we have already bumped the mdp. | |
1839 count_offset -= in_bytes(VirtualCallData::virtual_call_data_size()); | |
1840 | |
1841 // *Decrement* the counter. We expect to see zero or small negatives. | |
1842 increment_mdp_data_at(count_offset, scratch, true); | |
1843 | |
1844 bind (profile_continue); | |
1845 } | |
1846 } | |
1847 | |
1848 // Count the default case of a switch construct. | |
1849 | |
1850 void InterpreterMacroAssembler::profile_switch_default(Register scratch) { | |
1851 if (ProfileInterpreter) { | |
1852 Label profile_continue; | |
1853 | |
1854 // If no method data exists, go to profile_continue. | |
1855 test_method_data_pointer(profile_continue); | |
1856 | |
1857 // Update the default case count | |
1858 increment_mdp_data_at(in_bytes(MultiBranchData::default_count_offset()), | |
1859 scratch); | |
1860 | |
1861 // The method data pointer needs to be updated. | |
1862 update_mdp_by_offset( | |
1863 in_bytes(MultiBranchData::default_displacement_offset()), | |
1864 scratch); | |
1865 | |
1866 bind (profile_continue); | |
1867 } | |
1868 } | |
1869 | |
1870 // Count the index'th case of a switch construct. | |
1871 | |
1872 void InterpreterMacroAssembler::profile_switch_case(Register index, | |
1873 Register scratch, | |
1874 Register scratch2, | |
1875 Register scratch3) { | |
1876 if (ProfileInterpreter) { | |
1877 Label profile_continue; | |
1878 | |
1879 // If no method data exists, go to profile_continue. | |
1880 test_method_data_pointer(profile_continue); | |
1881 | |
1882 // Build the base (index * per_case_size_in_bytes()) + case_array_offset_in_bytes() | |
1883 set(in_bytes(MultiBranchData::per_case_size()), scratch); | |
1884 smul(index, scratch, scratch); | |
1885 add(scratch, in_bytes(MultiBranchData::case_array_offset()), scratch); | |
1886 | |
1887 // Update the case count | |
1888 increment_mdp_data_at(scratch, | |
1889 in_bytes(MultiBranchData::relative_count_offset()), | |
1890 scratch2, | |
1891 scratch3); | |
1892 | |
1893 // The method data pointer needs to be updated. | |
1894 update_mdp_by_offset(scratch, | |
1895 in_bytes(MultiBranchData::relative_displacement_offset()), | |
1896 scratch2); | |
1897 | |
1898 bind (profile_continue); | |
1899 } | |
1900 } | |
1901 | |
1902 // add a InterpMonitorElem to stack (see frame_sparc.hpp) | |
1903 | |
1904 void InterpreterMacroAssembler::add_monitor_to_stack( bool stack_is_empty, | |
1905 Register Rtemp, | |
1906 Register Rtemp2 ) { | |
1907 | |
1908 Register Rlimit = Lmonitors; | |
1909 const jint delta = frame::interpreter_frame_monitor_size() * wordSize; | |
1910 assert( (delta & LongAlignmentMask) == 0, | |
1911 "sizeof BasicObjectLock must be even number of doublewords"); | |
1912 | |
1913 sub( SP, delta, SP); | |
1914 sub( Lesp, delta, Lesp); | |
1915 sub( Lmonitors, delta, Lmonitors); | |
1916 | |
1917 if (!stack_is_empty) { | |
1918 | |
1919 // must copy stack contents down | |
1920 | |
1921 Label start_copying, next; | |
1922 | |
1923 // untested("monitor stack expansion"); | |
1924 compute_stack_base(Rtemp); | |
1925 ba( false, start_copying ); | |
1926 delayed()->cmp( Rtemp, Rlimit); // done? duplicated below | |
1927 | |
1928 // note: must copy from low memory upwards | |
1929 // On entry to loop, | |
1930 // Rtemp points to new base of stack, Lesp points to new end of stack (1 past TOS) | |
1931 // Loop mutates Rtemp | |
1932 | |
1933 bind( next); | |
1934 | |
1935 st_ptr(Rtemp2, Rtemp, 0); | |
1936 inc(Rtemp, wordSize); | |
1937 cmp(Rtemp, Rlimit); // are we done? (duplicated above) | |
1938 | |
1939 bind( start_copying ); | |
1940 | |
1941 brx( notEqual, true, pn, next ); | |
1942 delayed()->ld_ptr( Rtemp, delta, Rtemp2 ); | |
1943 | |
1944 // done copying stack | |
1945 } | |
1946 } | |
1947 | |
1948 // Locals | |
1949 void InterpreterMacroAssembler::access_local_ptr( Register index, Register dst ) { | |
1950 assert_not_delayed(); | |
1506 | 1951 sll(index, Interpreter::logStackElementSize, index); |
0 | 1952 sub(Llocals, index, index); |
1506 | 1953 ld_ptr(index, 0, dst); |
0 | 1954 // Note: index must hold the effective address--the iinc template uses it |
1955 } | |
1956 | |
1957 // Just like access_local_ptr but the tag is a returnAddress | |
1958 void InterpreterMacroAssembler::access_local_returnAddress(Register index, | |
1959 Register dst ) { | |
1960 assert_not_delayed(); | |
1506 | 1961 sll(index, Interpreter::logStackElementSize, index); |
0 | 1962 sub(Llocals, index, index); |
1506 | 1963 ld_ptr(index, 0, dst); |
0 | 1964 } |
1965 | |
1966 void InterpreterMacroAssembler::access_local_int( Register index, Register dst ) { | |
1967 assert_not_delayed(); | |
1506 | 1968 sll(index, Interpreter::logStackElementSize, index); |
0 | 1969 sub(Llocals, index, index); |
1506 | 1970 ld(index, 0, dst); |
0 | 1971 // Note: index must hold the effective address--the iinc template uses it |
1972 } | |
1973 | |
1974 | |
1975 void InterpreterMacroAssembler::access_local_long( Register index, Register dst ) { | |
1976 assert_not_delayed(); | |
1506 | 1977 sll(index, Interpreter::logStackElementSize, index); |
0 | 1978 sub(Llocals, index, index); |
1979 // First half stored at index n+1 (which grows down from Llocals[n]) | |
1980 load_unaligned_long(index, Interpreter::local_offset_in_bytes(1), dst); | |
1981 } | |
1982 | |
1983 | |
1984 void InterpreterMacroAssembler::access_local_float( Register index, FloatRegister dst ) { | |
1985 assert_not_delayed(); | |
1506 | 1986 sll(index, Interpreter::logStackElementSize, index); |
0 | 1987 sub(Llocals, index, index); |
1506 | 1988 ldf(FloatRegisterImpl::S, index, 0, dst); |
0 | 1989 } |
1990 | |
1991 | |
1992 void InterpreterMacroAssembler::access_local_double( Register index, FloatRegister dst ) { | |
1993 assert_not_delayed(); | |
1506 | 1994 sll(index, Interpreter::logStackElementSize, index); |
0 | 1995 sub(Llocals, index, index); |
1996 load_unaligned_double(index, Interpreter::local_offset_in_bytes(1), dst); | |
1997 } | |
1998 | |
1999 | |
2000 #ifdef ASSERT | |
2001 void InterpreterMacroAssembler::check_for_regarea_stomp(Register Rindex, int offset, Register Rlimit, Register Rscratch, Register Rscratch1) { | |
2002 Label L; | |
2003 | |
2004 assert(Rindex != Rscratch, "Registers cannot be same"); | |
2005 assert(Rindex != Rscratch1, "Registers cannot be same"); | |
2006 assert(Rlimit != Rscratch, "Registers cannot be same"); | |
2007 assert(Rlimit != Rscratch1, "Registers cannot be same"); | |
2008 assert(Rscratch1 != Rscratch, "Registers cannot be same"); | |
2009 | |
2010 // untested("reg area corruption"); | |
2011 add(Rindex, offset, Rscratch); | |
2012 add(Rlimit, 64 + STACK_BIAS, Rscratch1); | |
2013 cmp(Rscratch, Rscratch1); | |
2014 brx(Assembler::greaterEqualUnsigned, false, pn, L); | |
2015 delayed()->nop(); | |
2016 stop("regsave area is being clobbered"); | |
2017 bind(L); | |
2018 } | |
2019 #endif // ASSERT | |
2020 | |
2021 | |
2022 void InterpreterMacroAssembler::store_local_int( Register index, Register src ) { | |
2023 assert_not_delayed(); | |
1506 | 2024 sll(index, Interpreter::logStackElementSize, index); |
0 | 2025 sub(Llocals, index, index); |
1506 | 2026 debug_only(check_for_regarea_stomp(index, 0, FP, G1_scratch, G4_scratch);) |
2027 st(src, index, 0); | |
0 | 2028 } |
2029 | |
1506 | 2030 void InterpreterMacroAssembler::store_local_ptr( Register index, Register src ) { |
0 | 2031 assert_not_delayed(); |
1506 | 2032 sll(index, Interpreter::logStackElementSize, index); |
0 | 2033 sub(Llocals, index, index); |
1506 | 2034 #ifdef ASSERT |
2035 check_for_regarea_stomp(index, 0, FP, G1_scratch, G4_scratch); | |
2036 #endif | |
2037 st_ptr(src, index, 0); | |
0 | 2038 } |
2039 | |
2040 | |
2041 | |
1506 | 2042 void InterpreterMacroAssembler::store_local_ptr( int n, Register src ) { |
2043 st_ptr(src, Llocals, Interpreter::local_offset_in_bytes(n)); | |
0 | 2044 } |
2045 | |
2046 void InterpreterMacroAssembler::store_local_long( Register index, Register src ) { | |
2047 assert_not_delayed(); | |
1506 | 2048 sll(index, Interpreter::logStackElementSize, index); |
0 | 2049 sub(Llocals, index, index); |
1506 | 2050 #ifdef ASSERT |
0 | 2051 check_for_regarea_stomp(index, Interpreter::local_offset_in_bytes(1), FP, G1_scratch, G4_scratch); |
1506 | 2052 #endif |
0 | 2053 store_unaligned_long(src, index, Interpreter::local_offset_in_bytes(1)); // which is n+1 |
2054 } | |
2055 | |
2056 | |
2057 void InterpreterMacroAssembler::store_local_float( Register index, FloatRegister src ) { | |
2058 assert_not_delayed(); | |
1506 | 2059 sll(index, Interpreter::logStackElementSize, index); |
0 | 2060 sub(Llocals, index, index); |
1506 | 2061 #ifdef ASSERT |
2062 check_for_regarea_stomp(index, 0, FP, G1_scratch, G4_scratch); | |
2063 #endif | |
2064 stf(FloatRegisterImpl::S, src, index, 0); | |
0 | 2065 } |
2066 | |
2067 | |
2068 void InterpreterMacroAssembler::store_local_double( Register index, FloatRegister src ) { | |
2069 assert_not_delayed(); | |
1506 | 2070 sll(index, Interpreter::logStackElementSize, index); |
0 | 2071 sub(Llocals, index, index); |
1506 | 2072 #ifdef ASSERT |
0 | 2073 check_for_regarea_stomp(index, Interpreter::local_offset_in_bytes(1), FP, G1_scratch, G4_scratch); |
1506 | 2074 #endif |
0 | 2075 store_unaligned_double(src, index, Interpreter::local_offset_in_bytes(1)); |
2076 } | |
2077 | |
2078 | |
2079 int InterpreterMacroAssembler::top_most_monitor_byte_offset() { | |
2080 const jint delta = frame::interpreter_frame_monitor_size() * wordSize; | |
2081 int rounded_vm_local_words = ::round_to(frame::interpreter_frame_vm_local_words, WordsPerLong); | |
2082 return ((-rounded_vm_local_words * wordSize) - delta ) + STACK_BIAS; | |
2083 } | |
2084 | |
2085 | |
2086 Address InterpreterMacroAssembler::top_most_monitor() { | |
727 | 2087 return Address(FP, top_most_monitor_byte_offset()); |
0 | 2088 } |
2089 | |
2090 | |
2091 void InterpreterMacroAssembler::compute_stack_base( Register Rdest ) { | |
2092 add( Lesp, wordSize, Rdest ); | |
2093 } | |
2094 | |
2095 #endif /* CC_INTERP */ | |
2096 | |
2097 void InterpreterMacroAssembler::increment_invocation_counter( Register Rtmp, Register Rtmp2 ) { | |
2098 assert(UseCompiler, "incrementing must be useful"); | |
2099 #ifdef CC_INTERP | |
727 | 2100 Address inv_counter(G5_method, methodOopDesc::invocation_counter_offset() + |
2101 InvocationCounter::counter_offset()); | |
2102 Address be_counter (G5_method, methodOopDesc::backedge_counter_offset() + | |
2103 InvocationCounter::counter_offset()); | |
0 | 2104 #else |
727 | 2105 Address inv_counter(Lmethod, methodOopDesc::invocation_counter_offset() + |
2106 InvocationCounter::counter_offset()); | |
2107 Address be_counter (Lmethod, methodOopDesc::backedge_counter_offset() + | |
2108 InvocationCounter::counter_offset()); | |
0 | 2109 #endif /* CC_INTERP */ |
2110 int delta = InvocationCounter::count_increment; | |
2111 | |
2112 // Load each counter in a register | |
2113 ld( inv_counter, Rtmp ); | |
2114 ld( be_counter, Rtmp2 ); | |
2115 | |
2116 assert( is_simm13( delta ), " delta too large."); | |
2117 | |
2118 // Add the delta to the invocation counter and store the result | |
2119 add( Rtmp, delta, Rtmp ); | |
2120 | |
2121 // Mask the backedge counter | |
2122 and3( Rtmp2, InvocationCounter::count_mask_value, Rtmp2 ); | |
2123 | |
2124 // Store value | |
2125 st( Rtmp, inv_counter); | |
2126 | |
2127 // Add invocation counter + backedge counter | |
2128 add( Rtmp, Rtmp2, Rtmp); | |
2129 | |
2130 // Note that this macro must leave the backedge_count + invocation_count in Rtmp! | |
2131 } | |
2132 | |
2133 void InterpreterMacroAssembler::increment_backedge_counter( Register Rtmp, Register Rtmp2 ) { | |
2134 assert(UseCompiler, "incrementing must be useful"); | |
2135 #ifdef CC_INTERP | |
727 | 2136 Address be_counter (G5_method, methodOopDesc::backedge_counter_offset() + |
2137 InvocationCounter::counter_offset()); | |
2138 Address inv_counter(G5_method, methodOopDesc::invocation_counter_offset() + | |
2139 InvocationCounter::counter_offset()); | |
0 | 2140 #else |
727 | 2141 Address be_counter (Lmethod, methodOopDesc::backedge_counter_offset() + |
2142 InvocationCounter::counter_offset()); | |
2143 Address inv_counter(Lmethod, methodOopDesc::invocation_counter_offset() + | |
2144 InvocationCounter::counter_offset()); | |
0 | 2145 #endif /* CC_INTERP */ |
2146 int delta = InvocationCounter::count_increment; | |
2147 // Load each counter in a register | |
2148 ld( be_counter, Rtmp ); | |
2149 ld( inv_counter, Rtmp2 ); | |
2150 | |
2151 // Add the delta to the backedge counter | |
2152 add( Rtmp, delta, Rtmp ); | |
2153 | |
2154 // Mask the invocation counter, add to backedge counter | |
2155 and3( Rtmp2, InvocationCounter::count_mask_value, Rtmp2 ); | |
2156 | |
2157 // and store the result to memory | |
2158 st( Rtmp, be_counter ); | |
2159 | |
2160 // Add backedge + invocation counter | |
2161 add( Rtmp, Rtmp2, Rtmp ); | |
2162 | |
2163 // Note that this macro must leave backedge_count + invocation_count in Rtmp! | |
2164 } | |
2165 | |
2166 #ifndef CC_INTERP | |
2167 void InterpreterMacroAssembler::test_backedge_count_for_osr( Register backedge_count, | |
2168 Register branch_bcp, | |
2169 Register Rtmp ) { | |
2170 Label did_not_overflow; | |
2171 Label overflow_with_error; | |
2172 assert_different_registers(backedge_count, Rtmp, branch_bcp); | |
2173 assert(UseOnStackReplacement,"Must UseOnStackReplacement to test_backedge_count_for_osr"); | |
2174 | |
727 | 2175 AddressLiteral limit(&InvocationCounter::InterpreterBackwardBranchLimit); |
0 | 2176 load_contents(limit, Rtmp); |
2177 cmp(backedge_count, Rtmp); | |
2178 br(Assembler::lessUnsigned, false, Assembler::pt, did_not_overflow); | |
2179 delayed()->nop(); | |
2180 | |
2181 // When ProfileInterpreter is on, the backedge_count comes from the | |
2182 // methodDataOop, which value does not get reset on the call to | |
2183 // frequency_counter_overflow(). To avoid excessive calls to the overflow | |
2184 // routine while the method is being compiled, add a second test to make sure | |
2185 // the overflow function is called only once every overflow_frequency. | |
2186 if (ProfileInterpreter) { | |
2187 const int overflow_frequency = 1024; | |
2188 andcc(backedge_count, overflow_frequency-1, Rtmp); | |
2189 brx(Assembler::notZero, false, Assembler::pt, did_not_overflow); | |
2190 delayed()->nop(); | |
2191 } | |
2192 | |
2193 // overflow in loop, pass branch bytecode | |
2194 set(6,Rtmp); | |
2195 call_VM(noreg, CAST_FROM_FN_PTR(address, InterpreterRuntime::frequency_counter_overflow), branch_bcp, Rtmp); | |
2196 | |
2197 // Was an OSR adapter generated? | |
2198 // O0 = osr nmethod | |
2199 tst(O0); | |
2200 brx(Assembler::zero, false, Assembler::pn, overflow_with_error); | |
2201 delayed()->nop(); | |
2202 | |
2203 // Has the nmethod been invalidated already? | |
2204 ld(O0, nmethod::entry_bci_offset(), O2); | |
2205 cmp(O2, InvalidOSREntryBci); | |
2206 br(Assembler::equal, false, Assembler::pn, overflow_with_error); | |
2207 delayed()->nop(); | |
2208 | |
2209 // migrate the interpreter frame off of the stack | |
2210 | |
2211 mov(G2_thread, L7); | |
2212 // save nmethod | |
2213 mov(O0, L6); | |
2214 set_last_Java_frame(SP, noreg); | |
2215 call_VM_leaf(noreg, CAST_FROM_FN_PTR(address, SharedRuntime::OSR_migration_begin), L7); | |
2216 reset_last_Java_frame(); | |
2217 mov(L7, G2_thread); | |
2218 | |
2219 // move OSR nmethod to I1 | |
2220 mov(L6, I1); | |
2221 | |
2222 // OSR buffer to I0 | |
2223 mov(O0, I0); | |
2224 | |
2225 // remove the interpreter frame | |
2226 restore(I5_savedSP, 0, SP); | |
2227 | |
2228 // Jump to the osr code. | |
2229 ld_ptr(O1, nmethod::osr_entry_point_offset(), O2); | |
2230 jmp(O2, G0); | |
2231 delayed()->nop(); | |
2232 | |
2233 bind(overflow_with_error); | |
2234 | |
2235 bind(did_not_overflow); | |
2236 } | |
2237 | |
2238 | |
2239 | |
2240 void InterpreterMacroAssembler::interp_verify_oop(Register reg, TosState state, const char * file, int line) { | |
2241 if (state == atos) { MacroAssembler::_verify_oop(reg, "broken oop ", file, line); } | |
2242 } | |
2243 | |
2244 | |
2245 // local helper function for the verify_oop_or_return_address macro | |
2246 static bool verify_return_address(methodOopDesc* m, int bci) { | |
2247 #ifndef PRODUCT | |
2248 address pc = (address)(m->constMethod()) | |
2249 + in_bytes(constMethodOopDesc::codes_offset()) + bci; | |
2250 // assume it is a valid return address if it is inside m and is preceded by a jsr | |
2251 if (!m->contains(pc)) return false; | |
2252 address jsr_pc; | |
2253 jsr_pc = pc - Bytecodes::length_for(Bytecodes::_jsr); | |
2254 if (*jsr_pc == Bytecodes::_jsr && jsr_pc >= m->code_base()) return true; | |
2255 jsr_pc = pc - Bytecodes::length_for(Bytecodes::_jsr_w); | |
2256 if (*jsr_pc == Bytecodes::_jsr_w && jsr_pc >= m->code_base()) return true; | |
2257 #endif // PRODUCT | |
2258 return false; | |
2259 } | |
2260 | |
2261 | |
2262 void InterpreterMacroAssembler::verify_oop_or_return_address(Register reg, Register Rtmp) { | |
2263 if (!VerifyOops) return; | |
2264 // the VM documentation for the astore[_wide] bytecode allows | |
2265 // the TOS to be not only an oop but also a return address | |
2266 Label test; | |
2267 Label skip; | |
2268 // See if it is an address (in the current method): | |
2269 | |
2270 mov(reg, Rtmp); | |
2271 const int log2_bytecode_size_limit = 16; | |
2272 srl(Rtmp, log2_bytecode_size_limit, Rtmp); | |
2273 br_notnull( Rtmp, false, pt, test ); | |
2274 delayed()->nop(); | |
2275 | |
2276 // %%% should use call_VM_leaf here? | |
2277 save_frame_and_mov(0, Lmethod, O0, reg, O1); | |
2278 save_thread(L7_thread_cache); | |
2279 call(CAST_FROM_FN_PTR(address,verify_return_address), relocInfo::none); | |
2280 delayed()->nop(); | |
2281 restore_thread(L7_thread_cache); | |
2282 br_notnull( O0, false, pt, skip ); | |
2283 delayed()->restore(); | |
2284 | |
2285 // Perform a more elaborate out-of-line call | |
2286 // Not an address; verify it: | |
2287 bind(test); | |
2288 verify_oop(reg); | |
2289 bind(skip); | |
2290 } | |
2291 | |
2292 | |
2293 void InterpreterMacroAssembler::verify_FPU(int stack_depth, TosState state) { | |
2294 if (state == ftos || state == dtos) MacroAssembler::verify_FPU(stack_depth); | |
2295 } | |
2296 #endif /* CC_INTERP */ | |
2297 | |
2298 // Inline assembly for: | |
2299 // | |
2300 // if (thread is in interp_only_mode) { | |
2301 // InterpreterRuntime::post_method_entry(); | |
2302 // } | |
2303 // if (DTraceMethodProbes) { | |
605 | 2304 // SharedRuntime::dtrace_method_entry(method, receiver); |
0 | 2305 // } |
610
70998f2e05ef
6805864: 4/3 Problem with jvmti->redefineClasses: some methods don't get redefined
dcubed
parents:
422
diff
changeset
|
2306 // if (RC_TRACE_IN_RANGE(0x00001000, 0x00002000)) { |
70998f2e05ef
6805864: 4/3 Problem with jvmti->redefineClasses: some methods don't get redefined
dcubed
parents:
422
diff
changeset
|
2307 // SharedRuntime::rc_trace_method_entry(method, receiver); |
0 | 2308 // } |
2309 | |
2310 void InterpreterMacroAssembler::notify_method_entry() { | |
2311 | |
2312 // C++ interpreter only uses this for native methods. | |
2313 | |
2314 // Whenever JVMTI puts a thread in interp_only_mode, method | |
2315 // entry/exit events are sent for that thread to track stack | |
2316 // depth. If it is possible to enter interp_only_mode we add | |
2317 // the code to check if the event should be sent. | |
2318 if (JvmtiExport::can_post_interpreter_events()) { | |
2319 Label L; | |
2320 Register temp_reg = O5; | |
727 | 2321 const Address interp_only(G2_thread, JavaThread::interp_only_mode_offset()); |
0 | 2322 ld(interp_only, temp_reg); |
2323 tst(temp_reg); | |
2324 br(zero, false, pt, L); | |
2325 delayed()->nop(); | |
2326 call_VM(noreg, CAST_FROM_FN_PTR(address, InterpreterRuntime::post_method_entry)); | |
2327 bind(L); | |
2328 } | |
2329 | |
2330 { | |
2331 Register temp_reg = O5; | |
2332 SkipIfEqual skip_if(this, temp_reg, &DTraceMethodProbes, zero); | |
2333 call_VM_leaf(noreg, | |
2334 CAST_FROM_FN_PTR(address, SharedRuntime::dtrace_method_entry), | |
2335 G2_thread, Lmethod); | |
2336 } | |
610
70998f2e05ef
6805864: 4/3 Problem with jvmti->redefineClasses: some methods don't get redefined
dcubed
parents:
422
diff
changeset
|
2337 |
70998f2e05ef
6805864: 4/3 Problem with jvmti->redefineClasses: some methods don't get redefined
dcubed
parents:
422
diff
changeset
|
2338 // RedefineClasses() tracing support for obsolete method entry |
70998f2e05ef
6805864: 4/3 Problem with jvmti->redefineClasses: some methods don't get redefined
dcubed
parents:
422
diff
changeset
|
2339 if (RC_TRACE_IN_RANGE(0x00001000, 0x00002000)) { |
70998f2e05ef
6805864: 4/3 Problem with jvmti->redefineClasses: some methods don't get redefined
dcubed
parents:
422
diff
changeset
|
2340 call_VM_leaf(noreg, |
70998f2e05ef
6805864: 4/3 Problem with jvmti->redefineClasses: some methods don't get redefined
dcubed
parents:
422
diff
changeset
|
2341 CAST_FROM_FN_PTR(address, SharedRuntime::rc_trace_method_entry), |
70998f2e05ef
6805864: 4/3 Problem with jvmti->redefineClasses: some methods don't get redefined
dcubed
parents:
422
diff
changeset
|
2342 G2_thread, Lmethod); |
70998f2e05ef
6805864: 4/3 Problem with jvmti->redefineClasses: some methods don't get redefined
dcubed
parents:
422
diff
changeset
|
2343 } |
0 | 2344 } |
2345 | |
2346 | |
2347 // Inline assembly for: | |
2348 // | |
2349 // if (thread is in interp_only_mode) { | |
2350 // // save result | |
2351 // InterpreterRuntime::post_method_exit(); | |
2352 // // restore result | |
2353 // } | |
2354 // if (DTraceMethodProbes) { | |
2355 // SharedRuntime::dtrace_method_exit(thread, method); | |
2356 // } | |
2357 // | |
2358 // Native methods have their result stored in d_tmp and l_tmp | |
2359 // Java methods have their result stored in the expression stack | |
2360 | |
2361 void InterpreterMacroAssembler::notify_method_exit(bool is_native_method, | |
2362 TosState state, | |
2363 NotifyMethodExitMode mode) { | |
2364 // C++ interpreter only uses this for native methods. | |
2365 | |
2366 // Whenever JVMTI puts a thread in interp_only_mode, method | |
2367 // entry/exit events are sent for that thread to track stack | |
2368 // depth. If it is possible to enter interp_only_mode we add | |
2369 // the code to check if the event should be sent. | |
2370 if (mode == NotifyJVMTI && JvmtiExport::can_post_interpreter_events()) { | |
2371 Label L; | |
2372 Register temp_reg = O5; | |
727 | 2373 const Address interp_only(G2_thread, JavaThread::interp_only_mode_offset()); |
0 | 2374 ld(interp_only, temp_reg); |
2375 tst(temp_reg); | |
2376 br(zero, false, pt, L); | |
2377 delayed()->nop(); | |
2378 | |
2379 // Note: frame::interpreter_frame_result has a dependency on how the | |
2380 // method result is saved across the call to post_method_exit. For | |
2381 // native methods it assumes the result registers are saved to | |
2382 // l_scratch and d_scratch. If this changes then the interpreter_frame_result | |
2383 // implementation will need to be updated too. | |
2384 | |
2385 save_return_value(state, is_native_method); | |
2386 call_VM(noreg, | |
2387 CAST_FROM_FN_PTR(address, InterpreterRuntime::post_method_exit)); | |
2388 restore_return_value(state, is_native_method); | |
2389 bind(L); | |
2390 } | |
2391 | |
2392 { | |
2393 Register temp_reg = O5; | |
2394 // Dtrace notification | |
2395 SkipIfEqual skip_if(this, temp_reg, &DTraceMethodProbes, zero); | |
2396 save_return_value(state, is_native_method); | |
2397 call_VM_leaf( | |
2398 noreg, | |
2399 CAST_FROM_FN_PTR(address, SharedRuntime::dtrace_method_exit), | |
2400 G2_thread, Lmethod); | |
2401 restore_return_value(state, is_native_method); | |
2402 } | |
2403 } | |
2404 | |
2405 void InterpreterMacroAssembler::save_return_value(TosState state, bool is_native_call) { | |
2406 #ifdef CC_INTERP | |
2407 // result potentially in O0/O1: save it across calls | |
2408 stf(FloatRegisterImpl::D, F0, STATE(_native_fresult)); | |
2409 #ifdef _LP64 | |
2410 stx(O0, STATE(_native_lresult)); | |
2411 #else | |
2412 std(O0, STATE(_native_lresult)); | |
2413 #endif | |
2414 #else // CC_INTERP | |
2415 if (is_native_call) { | |
2416 stf(FloatRegisterImpl::D, F0, d_tmp); | |
2417 #ifdef _LP64 | |
2418 stx(O0, l_tmp); | |
2419 #else | |
2420 std(O0, l_tmp); | |
2421 #endif | |
2422 } else { | |
2423 push(state); | |
2424 } | |
2425 #endif // CC_INTERP | |
2426 } | |
2427 | |
2428 void InterpreterMacroAssembler::restore_return_value( TosState state, bool is_native_call) { | |
2429 #ifdef CC_INTERP | |
2430 ldf(FloatRegisterImpl::D, STATE(_native_fresult), F0); | |
2431 #ifdef _LP64 | |
2432 ldx(STATE(_native_lresult), O0); | |
2433 #else | |
2434 ldd(STATE(_native_lresult), O0); | |
2435 #endif | |
2436 #else // CC_INTERP | |
2437 if (is_native_call) { | |
2438 ldf(FloatRegisterImpl::D, d_tmp, F0); | |
2439 #ifdef _LP64 | |
2440 ldx(l_tmp, O0); | |
2441 #else | |
2442 ldd(l_tmp, O0); | |
2443 #endif | |
2444 } else { | |
2445 pop(state); | |
2446 } | |
2447 #endif // CC_INTERP | |
2448 } | |
1783 | 2449 |
2450 // Jump if ((*counter_addr += increment) & mask) satisfies the condition. | |
2451 void InterpreterMacroAssembler::increment_mask_and_jump(Address counter_addr, | |
2452 int increment, int mask, | |
2453 Register scratch1, Register scratch2, | |
2454 Condition cond, Label *where) { | |
2455 ld(counter_addr, scratch1); | |
2456 add(scratch1, increment, scratch1); | |
2457 if (is_simm13(mask)) { | |
2458 andcc(scratch1, mask, G0); | |
2459 } else { | |
2460 set(mask, scratch2); | |
2461 andcc(scratch1, scratch2, G0); | |
2462 } | |
2463 br(cond, false, Assembler::pn, *where); | |
2464 delayed()->st(scratch1, counter_addr); | |
2465 } |