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