Mercurial > hg > graal-jvmci-8
annotate src/cpu/ppc/vm/templateInterpreter_ppc.cpp @ 17917:63c5920a038d
8042309: Some bugfixes for the ppc64 port.
Reviewed-by: kvn
author | goetz |
---|---|
date | Fri, 02 May 2014 14:53:06 +0200 |
parents | 6048424d3865 |
children | 0bf37f737702 |
rev | line source |
---|---|
17804 | 1 /* |
2 * Copyright (c) 2014, Oracle and/or its affiliates. All rights reserved. | |
3 * Copyright 2013, 2014 SAP AG. All rights reserved. | |
4 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. | |
5 * | |
6 * This code is free software; you can redistribute it and/or modify it | |
7 * under the terms of the GNU General Public License version 2 only, as | |
8 * published by the Free Software Foundation. | |
9 * | |
10 * This code is distributed in the hope that it will be useful, but WITHOUT | |
11 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
12 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
13 * version 2 for more details (a copy is included in the LICENSE file that | |
14 * accompanied this code). | |
15 * | |
16 * You should have received a copy of the GNU General Public License version | |
17 * 2 along with this work; if not, write to the Free Software Foundation, | |
18 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. | |
19 * | |
20 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA | |
21 * or visit www.oracle.com if you need additional information or have any | |
22 * questions. | |
23 * | |
24 */ | |
25 | |
26 #include "precompiled.hpp" | |
27 #ifndef CC_INTERP | |
28 #include "asm/macroAssembler.inline.hpp" | |
29 #include "interpreter/bytecodeHistogram.hpp" | |
30 #include "interpreter/interpreter.hpp" | |
31 #include "interpreter/interpreterGenerator.hpp" | |
32 #include "interpreter/interpreterRuntime.hpp" | |
33 #include "interpreter/templateTable.hpp" | |
34 #include "oops/arrayOop.hpp" | |
35 #include "oops/methodData.hpp" | |
36 #include "oops/method.hpp" | |
37 #include "oops/oop.inline.hpp" | |
38 #include "prims/jvmtiExport.hpp" | |
39 #include "prims/jvmtiThreadState.hpp" | |
40 #include "runtime/arguments.hpp" | |
41 #include "runtime/deoptimization.hpp" | |
42 #include "runtime/frame.inline.hpp" | |
43 #include "runtime/sharedRuntime.hpp" | |
44 #include "runtime/stubRoutines.hpp" | |
45 #include "runtime/synchronizer.hpp" | |
46 #include "runtime/timer.hpp" | |
47 #include "runtime/vframeArray.hpp" | |
48 #include "utilities/debug.hpp" | |
49 #include "utilities/macros.hpp" | |
50 | |
51 #undef __ | |
52 #define __ _masm-> | |
53 | |
54 #ifdef PRODUCT | |
55 #define BLOCK_COMMENT(str) /* nothing */ | |
56 #else | |
57 #define BLOCK_COMMENT(str) __ block_comment(str) | |
58 #endif | |
59 | |
60 #define BIND(label) bind(label); BLOCK_COMMENT(#label ":") | |
61 | |
62 //----------------------------------------------------------------------------- | |
63 | |
64 // Actually we should never reach here since we do stack overflow checks before pushing any frame. | |
65 address TemplateInterpreterGenerator::generate_StackOverflowError_handler() { | |
66 address entry = __ pc(); | |
67 __ unimplemented("generate_StackOverflowError_handler"); | |
68 return entry; | |
69 } | |
70 | |
71 address TemplateInterpreterGenerator::generate_ArrayIndexOutOfBounds_handler(const char* name) { | |
72 address entry = __ pc(); | |
73 __ empty_expression_stack(); | |
74 __ load_const_optimized(R4_ARG2, (address) name); | |
75 // Index is in R17_tos. | |
76 __ mr(R5_ARG3, R17_tos); | |
77 __ call_VM(noreg, CAST_FROM_FN_PTR(address, InterpreterRuntime::throw_ArrayIndexOutOfBoundsException)); | |
78 return entry; | |
79 } | |
80 | |
81 #if 0 | |
82 // Call special ClassCastException constructor taking object to cast | |
83 // and target class as arguments. | |
17917 | 84 address TemplateInterpreterGenerator::generate_ClassCastException_verbose_handler() { |
17804 | 85 address entry = __ pc(); |
86 | |
87 // Expression stack must be empty before entering the VM if an | |
88 // exception happened. | |
89 __ empty_expression_stack(); | |
17917 | 90 |
17804 | 91 // Thread will be loaded to R3_ARG1. |
17917 | 92 // Target class oop is in register R5_ARG3 by convention! |
93 __ call_VM(noreg, CAST_FROM_FN_PTR(address, InterpreterRuntime::throw_ClassCastException_verbose, R17_tos, R5_ARG3)); | |
17804 | 94 // Above call must not return here since exception pending. |
17917 | 95 DEBUG_ONLY(__ should_not_reach_here();) |
17804 | 96 return entry; |
97 } | |
98 #endif | |
99 | |
100 address TemplateInterpreterGenerator::generate_ClassCastException_handler() { | |
101 address entry = __ pc(); | |
102 // Expression stack must be empty before entering the VM if an | |
103 // exception happened. | |
104 __ empty_expression_stack(); | |
105 | |
106 // Load exception object. | |
107 // Thread will be loaded to R3_ARG1. | |
108 __ call_VM(noreg, CAST_FROM_FN_PTR(address, InterpreterRuntime::throw_ClassCastException), R17_tos); | |
109 #ifdef ASSERT | |
110 // Above call must not return here since exception pending. | |
111 __ should_not_reach_here(); | |
112 #endif | |
113 return entry; | |
114 } | |
115 | |
116 address TemplateInterpreterGenerator::generate_exception_handler_common(const char* name, const char* message, bool pass_oop) { | |
117 address entry = __ pc(); | |
118 //__ untested("generate_exception_handler_common"); | |
119 Register Rexception = R17_tos; | |
120 | |
121 // Expression stack must be empty before entering the VM if an exception happened. | |
122 __ empty_expression_stack(); | |
123 | |
124 __ load_const_optimized(R4_ARG2, (address) name, R11_scratch1); | |
125 if (pass_oop) { | |
126 __ mr(R5_ARG3, Rexception); | |
127 __ call_VM(Rexception, CAST_FROM_FN_PTR(address, InterpreterRuntime::create_klass_exception), false); | |
128 } else { | |
129 __ load_const_optimized(R5_ARG3, (address) message, R11_scratch1); | |
130 __ call_VM(Rexception, CAST_FROM_FN_PTR(address, InterpreterRuntime::create_exception), false); | |
131 } | |
132 | |
133 // Throw exception. | |
134 __ mr(R3_ARG1, Rexception); | |
135 __ load_const_optimized(R11_scratch1, Interpreter::throw_exception_entry(), R12_scratch2); | |
136 __ mtctr(R11_scratch1); | |
137 __ bctr(); | |
138 | |
139 return entry; | |
140 } | |
141 | |
142 address TemplateInterpreterGenerator::generate_continuation_for(TosState state) { | |
143 address entry = __ pc(); | |
144 __ unimplemented("generate_continuation_for"); | |
145 return entry; | |
146 } | |
147 | |
148 // This entry is returned to when a call returns to the interpreter. | |
149 // When we arrive here, we expect that the callee stack frame is already popped. | |
150 address TemplateInterpreterGenerator::generate_return_entry_for(TosState state, int step, size_t index_size) { | |
151 address entry = __ pc(); | |
152 | |
153 // Move the value out of the return register back to the TOS cache of current frame. | |
154 switch (state) { | |
155 case ltos: | |
156 case btos: | |
157 case ctos: | |
158 case stos: | |
159 case atos: | |
160 case itos: __ mr(R17_tos, R3_RET); break; // RET -> TOS cache | |
161 case ftos: | |
162 case dtos: __ fmr(F15_ftos, F1_RET); break; // TOS cache -> GR_FRET | |
163 case vtos: break; // Nothing to do, this was a void return. | |
164 default : ShouldNotReachHere(); | |
165 } | |
166 | |
167 __ restore_interpreter_state(R11_scratch1); // Sets R11_scratch1 = fp. | |
168 __ ld(R12_scratch2, _ijava_state_neg(top_frame_sp), R11_scratch1); | |
169 __ resize_frame_absolute(R12_scratch2, R11_scratch1, R0); | |
170 | |
171 // Compiled code destroys templateTableBase, reload. | |
172 __ load_const_optimized(R25_templateTableBase, (address)Interpreter::dispatch_table((TosState)0), R12_scratch2); | |
173 | |
174 const Register cache = R11_scratch1; | |
175 const Register size = R12_scratch2; | |
176 __ get_cache_and_index_at_bcp(cache, 1, index_size); | |
177 | |
178 // Big Endian (get least significant byte of 64 bit value): | |
179 __ lbz(size, in_bytes(ConstantPoolCache::base_offset() + ConstantPoolCacheEntry::flags_offset()) + 7, cache); | |
180 __ sldi(size, size, Interpreter::logStackElementSize); | |
181 __ add(R15_esp, R15_esp, size); | |
182 __ dispatch_next(state, step); | |
183 return entry; | |
184 } | |
185 | |
186 address TemplateInterpreterGenerator::generate_deopt_entry_for(TosState state, int step) { | |
187 address entry = __ pc(); | |
188 // If state != vtos, we're returning from a native method, which put it's result | |
189 // into the result register. So move the value out of the return register back | |
190 // to the TOS cache of current frame. | |
191 | |
192 switch (state) { | |
193 case ltos: | |
194 case btos: | |
195 case ctos: | |
196 case stos: | |
197 case atos: | |
198 case itos: __ mr(R17_tos, R3_RET); break; // GR_RET -> TOS cache | |
199 case ftos: | |
200 case dtos: __ fmr(F15_ftos, F1_RET); break; // TOS cache -> GR_FRET | |
201 case vtos: break; // Nothing to do, this was a void return. | |
202 default : ShouldNotReachHere(); | |
203 } | |
204 | |
205 // Load LcpoolCache @@@ should be already set! | |
206 __ get_constant_pool_cache(R27_constPoolCache); | |
207 | |
208 // Handle a pending exception, fall through if none. | |
209 __ check_and_forward_exception(R11_scratch1, R12_scratch2); | |
210 | |
211 // Start executing bytecodes. | |
212 __ dispatch_next(state, step); | |
213 | |
214 return entry; | |
215 } | |
216 | |
217 // A result handler converts the native result into java format. | |
218 // Use the shared code between c++ and template interpreter. | |
219 address TemplateInterpreterGenerator::generate_result_handler_for(BasicType type) { | |
220 return AbstractInterpreterGenerator::generate_result_handler_for(type); | |
221 } | |
222 | |
223 address TemplateInterpreterGenerator::generate_safept_entry_for(TosState state, address runtime_entry) { | |
224 address entry = __ pc(); | |
225 | |
226 __ push(state); | |
227 __ call_VM(noreg, runtime_entry); | |
228 __ dispatch_via(vtos, Interpreter::_normal_table.table_for(vtos)); | |
229 | |
230 return entry; | |
231 } | |
232 | |
233 // Helpers for commoning out cases in the various type of method entries. | |
234 | |
235 // Increment invocation count & check for overflow. | |
236 // | |
237 // Note: checking for negative value instead of overflow | |
238 // so we have a 'sticky' overflow test. | |
239 // | |
240 void TemplateInterpreterGenerator::generate_counter_incr(Label* overflow, Label* profile_method, Label* profile_method_continue) { | |
241 // Note: In tiered we increment either counters in method or in MDO depending if we're profiling or not. | |
242 Register Rscratch1 = R11_scratch1; | |
243 Register Rscratch2 = R12_scratch2; | |
244 Register R3_counters = R3_ARG1; | |
245 Label done; | |
246 | |
247 if (TieredCompilation) { | |
248 const int increment = InvocationCounter::count_increment; | |
249 const int mask = ((1 << Tier0InvokeNotifyFreqLog) - 1) << InvocationCounter::count_shift; | |
250 Label no_mdo; | |
251 if (ProfileInterpreter) { | |
252 const Register Rmdo = Rscratch1; | |
253 // If no method data exists, go to profile_continue. | |
254 __ ld(Rmdo, in_bytes(Method::method_data_offset()), R19_method); | |
255 __ cmpdi(CCR0, Rmdo, 0); | |
256 __ beq(CCR0, no_mdo); | |
257 | |
258 // Increment backedge counter in the MDO. | |
259 const int mdo_bc_offs = in_bytes(MethodData::backedge_counter_offset()) + in_bytes(InvocationCounter::counter_offset()); | |
260 __ lwz(Rscratch2, mdo_bc_offs, Rmdo); | |
261 __ addi(Rscratch2, Rscratch2, increment); | |
262 __ stw(Rscratch2, mdo_bc_offs, Rmdo); | |
263 __ load_const_optimized(Rscratch1, mask, R0); | |
264 __ and_(Rscratch1, Rscratch2, Rscratch1); | |
265 __ bne(CCR0, done); | |
266 __ b(*overflow); | |
267 } | |
268 | |
269 // Increment counter in MethodCounters*. | |
270 const int mo_bc_offs = in_bytes(MethodCounters::backedge_counter_offset()) + in_bytes(InvocationCounter::counter_offset()); | |
271 __ bind(no_mdo); | |
272 __ get_method_counters(R19_method, R3_counters, done); | |
273 __ lwz(Rscratch2, mo_bc_offs, R3_counters); | |
274 __ addi(Rscratch2, Rscratch2, increment); | |
275 __ stw(Rscratch2, mo_bc_offs, R3_counters); | |
276 __ load_const_optimized(Rscratch1, mask, R0); | |
277 __ and_(Rscratch1, Rscratch2, Rscratch1); | |
278 __ beq(CCR0, *overflow); | |
279 | |
280 __ bind(done); | |
281 | |
282 } else { | |
283 | |
284 // Update standard invocation counters. | |
285 Register Rsum_ivc_bec = R4_ARG2; | |
286 __ get_method_counters(R19_method, R3_counters, done); | |
287 __ increment_invocation_counter(R3_counters, Rsum_ivc_bec, R12_scratch2); | |
288 // Increment interpreter invocation counter. | |
289 if (ProfileInterpreter) { // %%% Merge this into methodDataOop. | |
290 __ lwz(R12_scratch2, in_bytes(MethodCounters::interpreter_invocation_counter_offset()), R3_counters); | |
291 __ addi(R12_scratch2, R12_scratch2, 1); | |
292 __ stw(R12_scratch2, in_bytes(MethodCounters::interpreter_invocation_counter_offset()), R3_counters); | |
293 } | |
294 // Check if we must create a method data obj. | |
295 if (ProfileInterpreter && profile_method != NULL) { | |
296 const Register profile_limit = Rscratch1; | |
297 int pl_offs = __ load_const_optimized(profile_limit, &InvocationCounter::InterpreterProfileLimit, R0, true); | |
298 __ lwz(profile_limit, pl_offs, profile_limit); | |
299 // Test to see if we should create a method data oop. | |
300 __ cmpw(CCR0, Rsum_ivc_bec, profile_limit); | |
301 __ blt(CCR0, *profile_method_continue); | |
302 // If no method data exists, go to profile_method. | |
303 __ test_method_data_pointer(*profile_method); | |
304 } | |
305 // Finally check for counter overflow. | |
306 if (overflow) { | |
307 const Register invocation_limit = Rscratch1; | |
308 int il_offs = __ load_const_optimized(invocation_limit, &InvocationCounter::InterpreterInvocationLimit, R0, true); | |
309 __ lwz(invocation_limit, il_offs, invocation_limit); | |
310 assert(4 == sizeof(InvocationCounter::InterpreterInvocationLimit), "unexpected field size"); | |
311 __ cmpw(CCR0, Rsum_ivc_bec, invocation_limit); | |
312 __ bge(CCR0, *overflow); | |
313 } | |
314 | |
315 __ bind(done); | |
316 } | |
317 } | |
318 | |
319 // Generate code to initiate compilation on invocation counter overflow. | |
320 void TemplateInterpreterGenerator::generate_counter_overflow(Label& continue_entry) { | |
321 // Generate code to initiate compilation on the counter overflow. | |
322 | |
323 // InterpreterRuntime::frequency_counter_overflow takes one arguments, | |
324 // which indicates if the counter overflow occurs at a backwards branch (NULL bcp) | |
325 // We pass zero in. | |
326 // The call returns the address of the verified entry point for the method or NULL | |
327 // if the compilation did not complete (either went background or bailed out). | |
328 // | |
329 // Unlike the C++ interpreter above: Check exceptions! | |
330 // Assumption: Caller must set the flag "do_not_unlock_if_sychronized" if the monitor of a sync'ed | |
331 // method has not yet been created. Thus, no unlocking of a non-existing monitor can occur. | |
332 | |
333 __ li(R4_ARG2, 0); | |
334 __ call_VM(noreg, CAST_FROM_FN_PTR(address, InterpreterRuntime::frequency_counter_overflow), R4_ARG2, true); | |
335 | |
336 // Returns verified_entry_point or NULL. | |
337 // We ignore it in any case. | |
338 __ b(continue_entry); | |
339 } | |
340 | |
341 void TemplateInterpreterGenerator::generate_stack_overflow_check(Register Rmem_frame_size, Register Rscratch1) { | |
342 assert_different_registers(Rmem_frame_size, Rscratch1); | |
343 __ generate_stack_overflow_check_with_compare_and_throw(Rmem_frame_size, Rscratch1); | |
344 } | |
345 | |
346 void TemplateInterpreterGenerator::unlock_method(bool check_exceptions) { | |
347 __ unlock_object(R26_monitor, check_exceptions); | |
348 } | |
349 | |
350 // Lock the current method, interpreter register window must be set up! | |
351 void TemplateInterpreterGenerator::lock_method(Register Rflags, Register Rscratch1, Register Rscratch2, bool flags_preloaded) { | |
352 const Register Robj_to_lock = Rscratch2; | |
353 | |
354 { | |
355 if (!flags_preloaded) { | |
356 __ lwz(Rflags, method_(access_flags)); | |
357 } | |
358 | |
359 #ifdef ASSERT | |
360 // Check if methods needs synchronization. | |
361 { | |
362 Label Lok; | |
363 __ testbitdi(CCR0, R0, Rflags, JVM_ACC_SYNCHRONIZED_BIT); | |
364 __ btrue(CCR0,Lok); | |
365 __ stop("method doesn't need synchronization"); | |
366 __ bind(Lok); | |
367 } | |
368 #endif // ASSERT | |
369 } | |
370 | |
371 // Get synchronization object to Rscratch2. | |
372 { | |
373 const int mirror_offset = in_bytes(Klass::java_mirror_offset()); | |
374 Label Lstatic; | |
375 Label Ldone; | |
376 | |
377 __ testbitdi(CCR0, R0, Rflags, JVM_ACC_STATIC_BIT); | |
378 __ btrue(CCR0, Lstatic); | |
379 | |
380 // Non-static case: load receiver obj from stack and we're done. | |
381 __ ld(Robj_to_lock, R18_locals); | |
382 __ b(Ldone); | |
383 | |
384 __ bind(Lstatic); // Static case: Lock the java mirror | |
385 __ ld(Robj_to_lock, in_bytes(Method::const_offset()), R19_method); | |
386 __ ld(Robj_to_lock, in_bytes(ConstMethod::constants_offset()), Robj_to_lock); | |
387 __ ld(Robj_to_lock, ConstantPool::pool_holder_offset_in_bytes(), Robj_to_lock); | |
388 __ ld(Robj_to_lock, mirror_offset, Robj_to_lock); | |
389 | |
390 __ bind(Ldone); | |
391 __ verify_oop(Robj_to_lock); | |
392 } | |
393 | |
394 // Got the oop to lock => execute! | |
395 __ add_monitor_to_stack(true, Rscratch1, R0); | |
396 | |
397 __ std(Robj_to_lock, BasicObjectLock::obj_offset_in_bytes(), R26_monitor); | |
398 __ lock_object(R26_monitor, Robj_to_lock); | |
399 } | |
400 | |
401 // Generate a fixed interpreter frame for pure interpreter | |
402 // and I2N native transition frames. | |
403 // | |
404 // Before (stack grows downwards): | |
405 // | |
406 // | ... | | |
407 // |------------- | | |
408 // | java arg0 | | |
409 // | ... | | |
410 // | java argn | | |
411 // | | <- R15_esp | |
412 // | | | |
413 // |--------------| | |
414 // | abi_112 | | |
415 // | | <- R1_SP | |
416 // |==============| | |
417 // | |
418 // | |
419 // After: | |
420 // | |
421 // | ... | | |
422 // | java arg0 |<- R18_locals | |
423 // | ... | | |
424 // | java argn | | |
425 // |--------------| | |
426 // | | | |
427 // | java locals | | |
428 // | | | |
429 // |--------------| | |
430 // | abi_48 | | |
431 // |==============| | |
432 // | | | |
433 // | istate | | |
434 // | | | |
435 // |--------------| | |
436 // | monitor |<- R26_monitor | |
437 // |--------------| | |
438 // | |<- R15_esp | |
439 // | expression | | |
440 // | stack | | |
441 // | | | |
442 // |--------------| | |
443 // | | | |
444 // | abi_112 |<- R1_SP | |
445 // |==============| | |
446 // | |
447 // The top most frame needs an abi space of 112 bytes. This space is needed, | |
448 // since we call to c. The c function may spill their arguments to the caller | |
449 // frame. When we call to java, we don't need these spill slots. In order to save | |
450 // space on the stack, we resize the caller. However, java local reside in | |
451 // the caller frame and the frame has to be increased. The frame_size for the | |
452 // current frame was calculated based on max_stack as size for the expression | |
453 // stack. At the call, just a part of the expression stack might be used. | |
454 // We don't want to waste this space and cut the frame back accordingly. | |
455 // The resulting amount for resizing is calculated as follows: | |
456 // resize = (number_of_locals - number_of_arguments) * slot_size | |
457 // + (R1_SP - R15_esp) + 48 | |
458 // | |
459 // The size for the callee frame is calculated: | |
460 // framesize = 112 + max_stack + monitor + state_size | |
461 // | |
462 // maxstack: Max number of slots on the expression stack, loaded from the method. | |
463 // monitor: We statically reserve room for one monitor object. | |
464 // state_size: We save the current state of the interpreter to this area. | |
465 // | |
466 void TemplateInterpreterGenerator::generate_fixed_frame(bool native_call, Register Rsize_of_parameters, Register Rsize_of_locals) { | |
467 Register parent_frame_resize = R6_ARG4, // Frame will grow by this number of bytes. | |
468 top_frame_size = R7_ARG5, | |
469 Rconst_method = R8_ARG6; | |
470 | |
471 assert_different_registers(Rsize_of_parameters, Rsize_of_locals, parent_frame_resize, top_frame_size); | |
472 | |
473 __ ld(Rconst_method, method_(const)); | |
474 __ lhz(Rsize_of_parameters /* number of params */, | |
475 in_bytes(ConstMethod::size_of_parameters_offset()), Rconst_method); | |
476 if (native_call) { | |
477 // If we're calling a native method, we reserve space for the worst-case signature | |
478 // handler varargs vector, which is max(Argument::n_register_parameters, parameter_count+2). | |
479 // We add two slots to the parameter_count, one for the jni | |
480 // environment and one for a possible native mirror. | |
481 Label skip_native_calculate_max_stack; | |
482 __ addi(top_frame_size, Rsize_of_parameters, 2); | |
483 __ cmpwi(CCR0, top_frame_size, Argument::n_register_parameters); | |
484 __ bge(CCR0, skip_native_calculate_max_stack); | |
485 __ li(top_frame_size, Argument::n_register_parameters); | |
486 __ bind(skip_native_calculate_max_stack); | |
487 __ sldi(Rsize_of_parameters, Rsize_of_parameters, Interpreter::logStackElementSize); | |
488 __ sldi(top_frame_size, top_frame_size, Interpreter::logStackElementSize); | |
489 __ sub(parent_frame_resize, R1_SP, R15_esp); // <0, off by Interpreter::stackElementSize! | |
490 assert(Rsize_of_locals == noreg, "Rsize_of_locals not initialized"); // Only relevant value is Rsize_of_parameters. | |
491 } else { | |
492 __ lhz(Rsize_of_locals /* number of params */, in_bytes(ConstMethod::size_of_locals_offset()), Rconst_method); | |
493 __ sldi(Rsize_of_parameters, Rsize_of_parameters, Interpreter::logStackElementSize); | |
494 __ sldi(Rsize_of_locals, Rsize_of_locals, Interpreter::logStackElementSize); | |
495 __ lhz(top_frame_size, in_bytes(ConstMethod::max_stack_offset()), Rconst_method); | |
496 __ sub(R11_scratch1, Rsize_of_locals, Rsize_of_parameters); // >=0 | |
497 __ sub(parent_frame_resize, R1_SP, R15_esp); // <0, off by Interpreter::stackElementSize! | |
498 __ sldi(top_frame_size, top_frame_size, Interpreter::logStackElementSize); | |
499 __ add(parent_frame_resize, parent_frame_resize, R11_scratch1); | |
500 } | |
501 | |
502 // Compute top frame size. | |
503 __ addi(top_frame_size, top_frame_size, frame::abi_reg_args_size + frame::ijava_state_size); | |
504 | |
505 // Cut back area between esp and max_stack. | |
506 __ addi(parent_frame_resize, parent_frame_resize, frame::abi_minframe_size - Interpreter::stackElementSize); | |
507 | |
508 __ round_to(top_frame_size, frame::alignment_in_bytes); | |
509 __ round_to(parent_frame_resize, frame::alignment_in_bytes); | |
510 // parent_frame_resize = (locals-parameters) - (ESP-SP-ABI48) Rounded to frame alignment size. | |
511 // Enlarge by locals-parameters (not in case of native_call), shrink by ESP-SP-ABI48. | |
512 | |
513 { | |
514 // -------------------------------------------------------------------------- | |
515 // Stack overflow check | |
516 | |
517 Label cont; | |
518 __ add(R11_scratch1, parent_frame_resize, top_frame_size); | |
519 generate_stack_overflow_check(R11_scratch1, R12_scratch2); | |
520 } | |
521 | |
522 // Set up interpreter state registers. | |
523 | |
524 __ add(R18_locals, R15_esp, Rsize_of_parameters); | |
525 __ ld(R27_constPoolCache, in_bytes(ConstMethod::constants_offset()), Rconst_method); | |
526 __ ld(R27_constPoolCache, ConstantPool::cache_offset_in_bytes(), R27_constPoolCache); | |
527 | |
528 // Set method data pointer. | |
529 if (ProfileInterpreter) { | |
530 Label zero_continue; | |
531 __ ld(R28_mdx, method_(method_data)); | |
532 __ cmpdi(CCR0, R28_mdx, 0); | |
533 __ beq(CCR0, zero_continue); | |
534 __ addi(R28_mdx, R28_mdx, in_bytes(MethodData::data_offset())); | |
535 __ bind(zero_continue); | |
536 } | |
537 | |
538 if (native_call) { | |
539 __ li(R14_bcp, 0); // Must initialize. | |
540 } else { | |
541 __ add(R14_bcp, in_bytes(ConstMethod::codes_offset()), Rconst_method); | |
542 } | |
543 | |
544 // Resize parent frame. | |
545 __ mflr(R12_scratch2); | |
546 __ neg(parent_frame_resize, parent_frame_resize); | |
547 __ resize_frame(parent_frame_resize, R11_scratch1); | |
548 __ std(R12_scratch2, _abi(lr), R1_SP); | |
549 | |
550 __ addi(R26_monitor, R1_SP, - frame::ijava_state_size); | |
551 __ addi(R15_esp, R26_monitor, - Interpreter::stackElementSize); | |
552 | |
553 // Store values. | |
554 // R15_esp, R14_bcp, R26_monitor, R28_mdx are saved at java calls | |
555 // in InterpreterMacroAssembler::call_from_interpreter. | |
556 __ std(R19_method, _ijava_state_neg(method), R1_SP); | |
557 __ std(R21_sender_SP, _ijava_state_neg(sender_sp), R1_SP); | |
558 __ std(R27_constPoolCache, _ijava_state_neg(cpoolCache), R1_SP); | |
559 __ std(R18_locals, _ijava_state_neg(locals), R1_SP); | |
560 | |
561 // Note: esp, bcp, monitor, mdx live in registers. Hence, the correct version can only | |
562 // be found in the frame after save_interpreter_state is done. This is always true | |
563 // for non-top frames. But when a signal occurs, dumping the top frame can go wrong, | |
564 // because e.g. frame::interpreter_frame_bcp() will not access the correct value | |
565 // (Enhanced Stack Trace). | |
566 // The signal handler does not save the interpreter state into the frame. | |
567 __ li(R0, 0); | |
568 #ifdef ASSERT | |
569 // Fill remaining slots with constants. | |
570 __ load_const_optimized(R11_scratch1, 0x5afe); | |
571 __ load_const_optimized(R12_scratch2, 0xdead); | |
572 #endif | |
573 // We have to initialize some frame slots for native calls (accessed by GC). | |
574 if (native_call) { | |
575 __ std(R26_monitor, _ijava_state_neg(monitors), R1_SP); | |
576 __ std(R14_bcp, _ijava_state_neg(bcp), R1_SP); | |
577 if (ProfileInterpreter) { __ std(R28_mdx, _ijava_state_neg(mdx), R1_SP); } | |
578 } | |
579 #ifdef ASSERT | |
580 else { | |
581 __ std(R12_scratch2, _ijava_state_neg(monitors), R1_SP); | |
582 __ std(R12_scratch2, _ijava_state_neg(bcp), R1_SP); | |
583 __ std(R12_scratch2, _ijava_state_neg(mdx), R1_SP); | |
584 } | |
585 __ std(R11_scratch1, _ijava_state_neg(ijava_reserved), R1_SP); | |
586 __ std(R12_scratch2, _ijava_state_neg(esp), R1_SP); | |
587 __ std(R12_scratch2, _ijava_state_neg(lresult), R1_SP); | |
588 __ std(R12_scratch2, _ijava_state_neg(fresult), R1_SP); | |
589 #endif | |
590 __ subf(R12_scratch2, top_frame_size, R1_SP); | |
591 __ std(R0, _ijava_state_neg(oop_tmp), R1_SP); | |
592 __ std(R12_scratch2, _ijava_state_neg(top_frame_sp), R1_SP); | |
593 | |
594 // Push top frame. | |
595 __ push_frame(top_frame_size, R11_scratch1); | |
596 } | |
597 | |
598 // End of helpers | |
599 | |
600 // ============================================================================ | |
601 // Various method entries | |
602 // | |
603 | |
604 // Empty method, generate a very fast return. We must skip this entry if | |
605 // someone's debugging, indicated by the flag | |
606 // "interp_mode" in the Thread obj. | |
607 // Note: empty methods are generated mostly methods that do assertions, which are | |
608 // disabled in the "java opt build". | |
609 address TemplateInterpreterGenerator::generate_empty_entry(void) { | |
610 if (!UseFastEmptyMethods) { | |
611 NOT_PRODUCT(__ should_not_reach_here();) | |
612 return Interpreter::entry_for_kind(Interpreter::zerolocals); | |
613 } | |
614 | |
615 Label Lslow_path; | |
616 const Register Rjvmti_mode = R11_scratch1; | |
617 address entry = __ pc(); | |
618 | |
619 __ lwz(Rjvmti_mode, thread_(interp_only_mode)); | |
620 __ cmpwi(CCR0, Rjvmti_mode, 0); | |
621 __ bne(CCR0, Lslow_path); // jvmti_mode!=0 | |
622 | |
623 // Noone's debuggin: Simply return. | |
624 // Pop c2i arguments (if any) off when we return. | |
625 #ifdef ASSERT | |
626 __ ld(R9_ARG7, 0, R1_SP); | |
627 __ ld(R10_ARG8, 0, R21_sender_SP); | |
628 __ cmpd(CCR0, R9_ARG7, R10_ARG8); | |
629 __ asm_assert_eq("backlink", 0x545); | |
630 #endif // ASSERT | |
631 __ mr(R1_SP, R21_sender_SP); // Cut the stack back to where the caller started. | |
632 | |
633 // And we're done. | |
634 __ blr(); | |
635 | |
636 __ bind(Lslow_path); | |
637 __ branch_to_entry(Interpreter::entry_for_kind(Interpreter::zerolocals), R11_scratch1); | |
638 __ flush(); | |
639 | |
640 return entry; | |
641 } | |
642 | |
643 // Support abs and sqrt like in compiler. | |
644 // For others we can use a normal (native) entry. | |
645 | |
646 inline bool math_entry_available(AbstractInterpreter::MethodKind kind) { | |
647 // Provide math entry with debugging on demand. | |
648 // Note: Debugging changes which code will get executed: | |
649 // Debugging or disabled InlineIntrinsics: java method will get interpreted and performs a native call. | |
650 // Not debugging and enabled InlineIntrinics: processor instruction will get used. | |
651 // Result might differ slightly due to rounding etc. | |
652 if (!InlineIntrinsics && (!FLAG_IS_ERGO(InlineIntrinsics))) return false; // Generate a vanilla entry. | |
653 | |
654 return ((kind==Interpreter::java_lang_math_sqrt && VM_Version::has_fsqrt()) || | |
655 (kind==Interpreter::java_lang_math_abs)); | |
656 } | |
657 | |
658 address TemplateInterpreterGenerator::generate_math_entry(AbstractInterpreter::MethodKind kind) { | |
659 if (!math_entry_available(kind)) { | |
660 NOT_PRODUCT(__ should_not_reach_here();) | |
661 return Interpreter::entry_for_kind(Interpreter::zerolocals); | |
662 } | |
663 | |
664 Label Lslow_path; | |
665 const Register Rjvmti_mode = R11_scratch1; | |
666 address entry = __ pc(); | |
667 | |
668 // Provide math entry with debugging on demand. | |
669 __ lwz(Rjvmti_mode, thread_(interp_only_mode)); | |
670 __ cmpwi(CCR0, Rjvmti_mode, 0); | |
671 __ bne(CCR0, Lslow_path); // jvmti_mode!=0 | |
672 | |
673 __ lfd(F1_RET, Interpreter::stackElementSize, R15_esp); | |
674 | |
675 // Pop c2i arguments (if any) off when we return. | |
676 #ifdef ASSERT | |
677 __ ld(R9_ARG7, 0, R1_SP); | |
678 __ ld(R10_ARG8, 0, R21_sender_SP); | |
679 __ cmpd(CCR0, R9_ARG7, R10_ARG8); | |
680 __ asm_assert_eq("backlink", 0x545); | |
681 #endif // ASSERT | |
682 __ mr(R1_SP, R21_sender_SP); // Cut the stack back to where the caller started. | |
683 | |
684 if (kind == Interpreter::java_lang_math_sqrt) { | |
685 __ fsqrt(F1_RET, F1_RET); | |
686 } else if (kind == Interpreter::java_lang_math_abs) { | |
687 __ fabs(F1_RET, F1_RET); | |
688 } else { | |
689 ShouldNotReachHere(); | |
690 } | |
691 | |
692 // And we're done. | |
693 __ blr(); | |
694 | |
695 // Provide slow path for JVMTI case. | |
696 __ bind(Lslow_path); | |
697 __ branch_to_entry(Interpreter::entry_for_kind(Interpreter::zerolocals), R12_scratch2); | |
698 __ flush(); | |
699 | |
700 return entry; | |
701 } | |
702 | |
703 // Interpreter stub for calling a native method. (asm interpreter) | |
704 // This sets up a somewhat different looking stack for calling the | |
705 // native method than the typical interpreter frame setup. | |
706 // | |
707 // On entry: | |
708 // R19_method - method | |
709 // R16_thread - JavaThread* | |
710 // R15_esp - intptr_t* sender tos | |
711 // | |
712 // abstract stack (grows up) | |
713 // [ IJava (caller of JNI callee) ] <-- ASP | |
714 // ... | |
715 address TemplateInterpreterGenerator::generate_native_entry(bool synchronized) { | |
716 | |
717 address entry = __ pc(); | |
718 | |
719 const bool inc_counter = UseCompiler || CountCompiledCalls; | |
720 | |
721 // ----------------------------------------------------------------------------- | |
722 // Allocate a new frame that represents the native callee (i2n frame). | |
723 // This is not a full-blown interpreter frame, but in particular, the | |
724 // following registers are valid after this: | |
725 // - R19_method | |
726 // - R18_local (points to start of argumuments to native function) | |
727 // | |
728 // abstract stack (grows up) | |
729 // [ IJava (caller of JNI callee) ] <-- ASP | |
730 // ... | |
731 | |
732 const Register signature_handler_fd = R11_scratch1; | |
733 const Register pending_exception = R0; | |
734 const Register result_handler_addr = R31; | |
735 const Register native_method_fd = R11_scratch1; | |
736 const Register access_flags = R22_tmp2; | |
737 const Register active_handles = R11_scratch1; // R26_monitor saved to state. | |
738 const Register sync_state = R12_scratch2; | |
739 const Register sync_state_addr = sync_state; // Address is dead after use. | |
740 const Register suspend_flags = R11_scratch1; | |
741 | |
742 //============================================================================= | |
743 // Allocate new frame and initialize interpreter state. | |
744 | |
745 Label exception_return; | |
746 Label exception_return_sync_check; | |
747 Label stack_overflow_return; | |
748 | |
749 // Generate new interpreter state and jump to stack_overflow_return in case of | |
750 // a stack overflow. | |
751 //generate_compute_interpreter_state(stack_overflow_return); | |
752 | |
753 Register size_of_parameters = R22_tmp2; | |
754 | |
755 generate_fixed_frame(true, size_of_parameters, noreg /* unused */); | |
756 | |
757 //============================================================================= | |
758 // Increment invocation counter. On overflow, entry to JNI method | |
759 // will be compiled. | |
760 Label invocation_counter_overflow, continue_after_compile; | |
761 if (inc_counter) { | |
762 if (synchronized) { | |
763 // Since at this point in the method invocation the exception handler | |
764 // would try to exit the monitor of synchronized methods which hasn't | |
765 // been entered yet, we set the thread local variable | |
766 // _do_not_unlock_if_synchronized to true. If any exception was thrown by | |
767 // runtime, exception handling i.e. unlock_if_synchronized_method will | |
768 // check this thread local flag. | |
769 // This flag has two effects, one is to force an unwind in the topmost | |
770 // interpreter frame and not perform an unlock while doing so. | |
771 __ li(R0, 1); | |
772 __ stb(R0, in_bytes(JavaThread::do_not_unlock_if_synchronized_offset()), R16_thread); | |
773 } | |
774 generate_counter_incr(&invocation_counter_overflow, NULL, NULL); | |
775 | |
776 __ BIND(continue_after_compile); | |
777 // Reset the _do_not_unlock_if_synchronized flag. | |
778 if (synchronized) { | |
779 __ li(R0, 0); | |
780 __ stb(R0, in_bytes(JavaThread::do_not_unlock_if_synchronized_offset()), R16_thread); | |
781 } | |
782 } | |
783 | |
784 // access_flags = method->access_flags(); | |
785 // Load access flags. | |
786 assert(access_flags->is_nonvolatile(), | |
787 "access_flags must be in a non-volatile register"); | |
788 // Type check. | |
789 assert(4 == sizeof(AccessFlags), "unexpected field size"); | |
790 __ lwz(access_flags, method_(access_flags)); | |
791 | |
792 // We don't want to reload R19_method and access_flags after calls | |
793 // to some helper functions. | |
794 assert(R19_method->is_nonvolatile(), | |
795 "R19_method must be a non-volatile register"); | |
796 | |
797 // Check for synchronized methods. Must happen AFTER invocation counter | |
798 // check, so method is not locked if counter overflows. | |
799 | |
800 if (synchronized) { | |
801 lock_method(access_flags, R11_scratch1, R12_scratch2, true); | |
802 | |
803 // Update monitor in state. | |
804 __ ld(R11_scratch1, 0, R1_SP); | |
805 __ std(R26_monitor, _ijava_state_neg(monitors), R11_scratch1); | |
806 } | |
807 | |
808 // jvmti/jvmpi support | |
809 __ notify_method_entry(); | |
810 | |
811 //============================================================================= | |
812 // Get and call the signature handler. | |
813 | |
814 __ ld(signature_handler_fd, method_(signature_handler)); | |
815 Label call_signature_handler; | |
816 | |
817 __ cmpdi(CCR0, signature_handler_fd, 0); | |
818 __ bne(CCR0, call_signature_handler); | |
819 | |
820 // Method has never been called. Either generate a specialized | |
821 // handler or point to the slow one. | |
822 // | |
823 // Pass parameter 'false' to avoid exception check in call_VM. | |
824 __ call_VM(noreg, CAST_FROM_FN_PTR(address, InterpreterRuntime::prepare_native_call), R19_method, false); | |
825 | |
826 // Check for an exception while looking up the target method. If we | |
827 // incurred one, bail. | |
828 __ ld(pending_exception, thread_(pending_exception)); | |
829 __ cmpdi(CCR0, pending_exception, 0); | |
830 __ bne(CCR0, exception_return_sync_check); // Has pending exception. | |
831 | |
832 // Reload signature handler, it may have been created/assigned in the meanwhile. | |
833 __ ld(signature_handler_fd, method_(signature_handler)); | |
834 __ twi_0(signature_handler_fd); // Order wrt. load of klass mirror and entry point (isync is below). | |
835 | |
836 __ BIND(call_signature_handler); | |
837 | |
838 // Before we call the signature handler we push a new frame to | |
839 // protect the interpreter frame volatile registers when we return | |
840 // from jni but before we can get back to Java. | |
841 | |
842 // First set the frame anchor while the SP/FP registers are | |
843 // convenient and the slow signature handler can use this same frame | |
844 // anchor. | |
845 | |
846 // We have a TOP_IJAVA_FRAME here, which belongs to us. | |
847 __ set_top_ijava_frame_at_SP_as_last_Java_frame(R1_SP, R12_scratch2/*tmp*/); | |
848 | |
849 // Now the interpreter frame (and its call chain) have been | |
850 // invalidated and flushed. We are now protected against eager | |
851 // being enabled in native code. Even if it goes eager the | |
852 // registers will be reloaded as clean and we will invalidate after | |
853 // the call so no spurious flush should be possible. | |
854 | |
855 // Call signature handler and pass locals address. | |
856 // | |
857 // Our signature handlers copy required arguments to the C stack | |
858 // (outgoing C args), R3_ARG1 to R10_ARG8, and FARG1 to FARG13. | |
859 __ mr(R3_ARG1, R18_locals); | |
860 __ ld(signature_handler_fd, 0, signature_handler_fd); | |
861 | |
862 __ call_stub(signature_handler_fd); | |
863 | |
864 // Remove the register parameter varargs slots we allocated in | |
865 // compute_interpreter_state. SP+16 ends up pointing to the ABI | |
866 // outgoing argument area. | |
867 // | |
868 // Not needed on PPC64. | |
869 //__ add(SP, SP, Argument::n_register_parameters*BytesPerWord); | |
870 | |
871 assert(result_handler_addr->is_nonvolatile(), "result_handler_addr must be in a non-volatile register"); | |
872 // Save across call to native method. | |
873 __ mr(result_handler_addr, R3_RET); | |
874 | |
875 __ isync(); // Acquire signature handler before trying to fetch the native entry point and klass mirror. | |
876 | |
877 // Set up fixed parameters and call the native method. | |
878 // If the method is static, get mirror into R4_ARG2. | |
879 { | |
880 Label method_is_not_static; | |
881 // Access_flags is non-volatile and still, no need to restore it. | |
882 | |
883 // Restore access flags. | |
884 __ testbitdi(CCR0, R0, access_flags, JVM_ACC_STATIC_BIT); | |
885 __ bfalse(CCR0, method_is_not_static); | |
886 | |
887 // constants = method->constants(); | |
888 __ ld(R11_scratch1, in_bytes(Method::const_offset()), R19_method); | |
889 __ ld(R11_scratch1, in_bytes(ConstMethod::constants_offset()), R11_scratch1); | |
890 // pool_holder = method->constants()->pool_holder(); | |
891 __ ld(R11_scratch1/*pool_holder*/, ConstantPool::pool_holder_offset_in_bytes(), | |
892 R11_scratch1/*constants*/); | |
893 | |
894 const int mirror_offset = in_bytes(Klass::java_mirror_offset()); | |
895 | |
896 // mirror = pool_holder->klass_part()->java_mirror(); | |
897 __ ld(R0/*mirror*/, mirror_offset, R11_scratch1/*pool_holder*/); | |
898 // state->_native_mirror = mirror; | |
899 | |
900 __ ld(R11_scratch1, 0, R1_SP); | |
901 __ std(R0/*mirror*/, _ijava_state_neg(oop_tmp), R11_scratch1); | |
902 // R4_ARG2 = &state->_oop_temp; | |
903 __ addi(R4_ARG2, R11_scratch1, _ijava_state_neg(oop_tmp)); | |
904 __ BIND(method_is_not_static); | |
905 } | |
906 | |
907 // At this point, arguments have been copied off the stack into | |
908 // their JNI positions. Oops are boxed in-place on the stack, with | |
909 // handles copied to arguments. The result handler address is in a | |
910 // register. | |
911 | |
912 // Pass JNIEnv address as first parameter. | |
913 __ addir(R3_ARG1, thread_(jni_environment)); | |
914 | |
915 // Load the native_method entry before we change the thread state. | |
916 __ ld(native_method_fd, method_(native_function)); | |
917 | |
918 //============================================================================= | |
919 // Transition from _thread_in_Java to _thread_in_native. As soon as | |
920 // we make this change the safepoint code needs to be certain that | |
921 // the last Java frame we established is good. The pc in that frame | |
922 // just needs to be near here not an actual return address. | |
923 | |
924 // We use release_store_fence to update values like the thread state, where | |
925 // we don't want the current thread to continue until all our prior memory | |
926 // accesses (including the new thread state) are visible to other threads. | |
927 __ li(R0, _thread_in_native); | |
928 __ release(); | |
929 | |
930 // TODO PPC port assert(4 == JavaThread::sz_thread_state(), "unexpected field size"); | |
931 __ stw(R0, thread_(thread_state)); | |
932 | |
933 if (UseMembar) { | |
934 __ fence(); | |
935 } | |
936 | |
937 //============================================================================= | |
938 // Call the native method. Argument registers must not have been | |
939 // overwritten since "__ call_stub(signature_handler);" (except for | |
940 // ARG1 and ARG2 for static methods). | |
941 __ call_c(native_method_fd); | |
942 | |
943 __ li(R0, 0); | |
944 __ ld(R11_scratch1, 0, R1_SP); | |
945 __ std(R3_RET, _ijava_state_neg(lresult), R11_scratch1); | |
946 __ stfd(F1_RET, _ijava_state_neg(fresult), R11_scratch1); | |
947 __ std(R0/*mirror*/, _ijava_state_neg(oop_tmp), R11_scratch1); // reset | |
948 | |
949 // Note: C++ interpreter needs the following here: | |
950 // The frame_manager_lr field, which we use for setting the last | |
951 // java frame, gets overwritten by the signature handler. Restore | |
952 // it now. | |
953 //__ get_PC_trash_LR(R11_scratch1); | |
954 //__ std(R11_scratch1, _top_ijava_frame_abi(frame_manager_lr), R1_SP); | |
955 | |
956 // Because of GC R19_method may no longer be valid. | |
957 | |
958 // Block, if necessary, before resuming in _thread_in_Java state. | |
959 // In order for GC to work, don't clear the last_Java_sp until after | |
960 // blocking. | |
961 | |
962 //============================================================================= | |
963 // Switch thread to "native transition" state before reading the | |
964 // synchronization state. This additional state is necessary | |
965 // because reading and testing the synchronization state is not | |
966 // atomic w.r.t. GC, as this scenario demonstrates: Java thread A, | |
967 // in _thread_in_native state, loads _not_synchronized and is | |
968 // preempted. VM thread changes sync state to synchronizing and | |
969 // suspends threads for GC. Thread A is resumed to finish this | |
970 // native method, but doesn't block here since it didn't see any | |
971 // synchronization in progress, and escapes. | |
972 | |
973 // We use release_store_fence to update values like the thread state, where | |
974 // we don't want the current thread to continue until all our prior memory | |
975 // accesses (including the new thread state) are visible to other threads. | |
976 __ li(R0/*thread_state*/, _thread_in_native_trans); | |
977 __ release(); | |
978 __ stw(R0/*thread_state*/, thread_(thread_state)); | |
979 if (UseMembar) { | |
980 __ fence(); | |
981 } | |
982 // Write serialization page so that the VM thread can do a pseudo remote | |
983 // membar. We use the current thread pointer to calculate a thread | |
984 // specific offset to write to within the page. This minimizes bus | |
985 // traffic due to cache line collision. | |
986 else { | |
987 __ serialize_memory(R16_thread, R11_scratch1, R12_scratch2); | |
988 } | |
989 | |
990 // Now before we return to java we must look for a current safepoint | |
991 // (a new safepoint can not start since we entered native_trans). | |
992 // We must check here because a current safepoint could be modifying | |
993 // the callers registers right this moment. | |
994 | |
995 // Acquire isn't strictly necessary here because of the fence, but | |
996 // sync_state is declared to be volatile, so we do it anyway | |
997 // (cmp-br-isync on one path, release (same as acquire on PPC64) on the other path). | |
998 int sync_state_offs = __ load_const_optimized(sync_state_addr, SafepointSynchronize::address_of_state(), /*temp*/R0, true); | |
999 | |
1000 // TODO PPC port assert(4 == SafepointSynchronize::sz_state(), "unexpected field size"); | |
1001 __ lwz(sync_state, sync_state_offs, sync_state_addr); | |
1002 | |
1003 // TODO PPC port assert(4 == Thread::sz_suspend_flags(), "unexpected field size"); | |
1004 __ lwz(suspend_flags, thread_(suspend_flags)); | |
1005 | |
1006 Label sync_check_done; | |
1007 Label do_safepoint; | |
1008 // No synchronization in progress nor yet synchronized. | |
1009 __ cmpwi(CCR0, sync_state, SafepointSynchronize::_not_synchronized); | |
1010 // Not suspended. | |
1011 __ cmpwi(CCR1, suspend_flags, 0); | |
1012 | |
1013 __ bne(CCR0, do_safepoint); | |
1014 __ beq(CCR1, sync_check_done); | |
1015 __ bind(do_safepoint); | |
1016 __ isync(); | |
1017 // Block. We do the call directly and leave the current | |
1018 // last_Java_frame setup undisturbed. We must save any possible | |
1019 // native result across the call. No oop is present. | |
1020 | |
1021 __ mr(R3_ARG1, R16_thread); | |
1022 __ call_c(CAST_FROM_FN_PTR(FunctionDescriptor*, JavaThread::check_special_condition_for_native_trans), | |
1023 relocInfo::none); | |
1024 | |
1025 __ bind(sync_check_done); | |
1026 | |
1027 //============================================================================= | |
1028 // <<<<<< Back in Interpreter Frame >>>>> | |
1029 | |
1030 // We are in thread_in_native_trans here and back in the normal | |
1031 // interpreter frame. We don't have to do anything special about | |
1032 // safepoints and we can switch to Java mode anytime we are ready. | |
1033 | |
1034 // Note: frame::interpreter_frame_result has a dependency on how the | |
1035 // method result is saved across the call to post_method_exit. For | |
1036 // native methods it assumes that the non-FPU/non-void result is | |
1037 // saved in _native_lresult and a FPU result in _native_fresult. If | |
1038 // this changes then the interpreter_frame_result implementation | |
1039 // will need to be updated too. | |
1040 | |
1041 // On PPC64, we have stored the result directly after the native call. | |
1042 | |
1043 //============================================================================= | |
1044 // Back in Java | |
1045 | |
1046 // We use release_store_fence to update values like the thread state, where | |
1047 // we don't want the current thread to continue until all our prior memory | |
1048 // accesses (including the new thread state) are visible to other threads. | |
1049 __ li(R0/*thread_state*/, _thread_in_Java); | |
1050 __ release(); | |
1051 __ stw(R0/*thread_state*/, thread_(thread_state)); | |
1052 if (UseMembar) { | |
1053 __ fence(); | |
1054 } | |
1055 | |
1056 __ reset_last_Java_frame(); | |
1057 | |
1058 // Jvmdi/jvmpi support. Whether we've got an exception pending or | |
1059 // not, and whether unlocking throws an exception or not, we notify | |
1060 // on native method exit. If we do have an exception, we'll end up | |
1061 // in the caller's context to handle it, so if we don't do the | |
1062 // notify here, we'll drop it on the floor. | |
1063 __ notify_method_exit(true/*native method*/, | |
1064 ilgl /*illegal state (not used for native methods)*/, | |
1065 InterpreterMacroAssembler::NotifyJVMTI, | |
1066 false /*check_exceptions*/); | |
1067 | |
1068 //============================================================================= | |
1069 // Handle exceptions | |
1070 | |
1071 if (synchronized) { | |
1072 // Don't check for exceptions since we're still in the i2n frame. Do that | |
1073 // manually afterwards. | |
1074 unlock_method(false); | |
1075 } | |
1076 | |
1077 // Reset active handles after returning from native. | |
1078 // thread->active_handles()->clear(); | |
1079 __ ld(active_handles, thread_(active_handles)); | |
1080 // TODO PPC port assert(4 == JNIHandleBlock::top_size_in_bytes(), "unexpected field size"); | |
1081 __ li(R0, 0); | |
1082 __ stw(R0, JNIHandleBlock::top_offset_in_bytes(), active_handles); | |
1083 | |
1084 Label exception_return_sync_check_already_unlocked; | |
1085 __ ld(R0/*pending_exception*/, thread_(pending_exception)); | |
1086 __ cmpdi(CCR0, R0/*pending_exception*/, 0); | |
1087 __ bne(CCR0, exception_return_sync_check_already_unlocked); | |
1088 | |
1089 //----------------------------------------------------------------------------- | |
1090 // No exception pending. | |
1091 | |
1092 // Move native method result back into proper registers and return. | |
1093 // Invoke result handler (may unbox/promote). | |
1094 __ ld(R11_scratch1, 0, R1_SP); | |
1095 __ ld(R3_RET, _ijava_state_neg(lresult), R11_scratch1); | |
1096 __ lfd(F1_RET, _ijava_state_neg(fresult), R11_scratch1); | |
1097 __ call_stub(result_handler_addr); | |
1098 | |
1099 __ merge_frames(/*top_frame_sp*/ R21_sender_SP, /*return_pc*/ R0, R11_scratch1, R12_scratch2); | |
1100 | |
1101 // Must use the return pc which was loaded from the caller's frame | |
1102 // as the VM uses return-pc-patching for deoptimization. | |
1103 __ mtlr(R0); | |
1104 __ blr(); | |
1105 | |
1106 //----------------------------------------------------------------------------- | |
1107 // An exception is pending. We call into the runtime only if the | |
1108 // caller was not interpreted. If it was interpreted the | |
1109 // interpreter will do the correct thing. If it isn't interpreted | |
1110 // (call stub/compiled code) we will change our return and continue. | |
1111 | |
1112 __ BIND(exception_return_sync_check); | |
1113 | |
1114 if (synchronized) { | |
1115 // Don't check for exceptions since we're still in the i2n frame. Do that | |
1116 // manually afterwards. | |
1117 unlock_method(false); | |
1118 } | |
1119 __ BIND(exception_return_sync_check_already_unlocked); | |
1120 | |
1121 const Register return_pc = R31; | |
1122 | |
1123 __ ld(return_pc, 0, R1_SP); | |
1124 __ ld(return_pc, _abi(lr), return_pc); | |
1125 | |
1126 // Get the address of the exception handler. | |
1127 __ call_VM_leaf(CAST_FROM_FN_PTR(address, SharedRuntime::exception_handler_for_return_address), | |
1128 R16_thread, | |
1129 return_pc /* return pc */); | |
1130 __ merge_frames(/*top_frame_sp*/ R21_sender_SP, noreg, R11_scratch1, R12_scratch2); | |
1131 | |
1132 // Load the PC of the the exception handler into LR. | |
1133 __ mtlr(R3_RET); | |
1134 | |
1135 // Load exception into R3_ARG1 and clear pending exception in thread. | |
1136 __ ld(R3_ARG1/*exception*/, thread_(pending_exception)); | |
1137 __ li(R4_ARG2, 0); | |
1138 __ std(R4_ARG2, thread_(pending_exception)); | |
1139 | |
1140 // Load the original return pc into R4_ARG2. | |
1141 __ mr(R4_ARG2/*issuing_pc*/, return_pc); | |
1142 | |
1143 // Return to exception handler. | |
1144 __ blr(); | |
1145 | |
1146 //============================================================================= | |
1147 // Counter overflow. | |
1148 | |
1149 if (inc_counter) { | |
1150 // Handle invocation counter overflow. | |
1151 __ bind(invocation_counter_overflow); | |
1152 | |
1153 generate_counter_overflow(continue_after_compile); | |
1154 } | |
1155 | |
1156 return entry; | |
1157 } | |
1158 | |
1159 // Generic interpreted method entry to (asm) interpreter. | |
1160 // | |
1161 address TemplateInterpreterGenerator::generate_normal_entry(bool synchronized) { | |
1162 bool inc_counter = UseCompiler || CountCompiledCalls; | |
1163 address entry = __ pc(); | |
1164 // Generate the code to allocate the interpreter stack frame. | |
1165 Register Rsize_of_parameters = R4_ARG2, // Written by generate_fixed_frame. | |
1166 Rsize_of_locals = R5_ARG3; // Written by generate_fixed_frame. | |
1167 | |
1168 generate_fixed_frame(false, Rsize_of_parameters, Rsize_of_locals); | |
1169 | |
1170 #ifdef FAST_DISPATCH | |
1171 __ unimplemented("Fast dispatch in generate_normal_entry"); | |
1172 #if 0 | |
1173 __ set((intptr_t)Interpreter::dispatch_table(), IdispatchTables); | |
1174 // Set bytecode dispatch table base. | |
1175 #endif | |
1176 #endif | |
1177 | |
1178 // -------------------------------------------------------------------------- | |
1179 // Zero out non-parameter locals. | |
1180 // Note: *Always* zero out non-parameter locals as Sparc does. It's not | |
1181 // worth to ask the flag, just do it. | |
1182 Register Rslot_addr = R6_ARG4, | |
1183 Rnum = R7_ARG5; | |
1184 Label Lno_locals, Lzero_loop; | |
1185 | |
1186 // Set up the zeroing loop. | |
1187 __ subf(Rnum, Rsize_of_parameters, Rsize_of_locals); | |
1188 __ subf(Rslot_addr, Rsize_of_parameters, R18_locals); | |
1189 __ srdi_(Rnum, Rnum, Interpreter::logStackElementSize); | |
1190 __ beq(CCR0, Lno_locals); | |
1191 __ li(R0, 0); | |
1192 __ mtctr(Rnum); | |
1193 | |
1194 // The zero locals loop. | |
1195 __ bind(Lzero_loop); | |
1196 __ std(R0, 0, Rslot_addr); | |
1197 __ addi(Rslot_addr, Rslot_addr, -Interpreter::stackElementSize); | |
1198 __ bdnz(Lzero_loop); | |
1199 | |
1200 __ bind(Lno_locals); | |
1201 | |
1202 // -------------------------------------------------------------------------- | |
1203 // Counter increment and overflow check. | |
1204 Label invocation_counter_overflow, | |
1205 profile_method, | |
1206 profile_method_continue; | |
1207 if (inc_counter || ProfileInterpreter) { | |
1208 | |
1209 Register Rdo_not_unlock_if_synchronized_addr = R11_scratch1; | |
1210 if (synchronized) { | |
1211 // Since at this point in the method invocation the exception handler | |
1212 // would try to exit the monitor of synchronized methods which hasn't | |
1213 // been entered yet, we set the thread local variable | |
1214 // _do_not_unlock_if_synchronized to true. If any exception was thrown by | |
1215 // runtime, exception handling i.e. unlock_if_synchronized_method will | |
1216 // check this thread local flag. | |
1217 // This flag has two effects, one is to force an unwind in the topmost | |
1218 // interpreter frame and not perform an unlock while doing so. | |
1219 __ li(R0, 1); | |
1220 __ stb(R0, in_bytes(JavaThread::do_not_unlock_if_synchronized_offset()), R16_thread); | |
1221 } | |
1222 // Increment invocation counter and check for overflow. | |
1223 if (inc_counter) { | |
1224 generate_counter_incr(&invocation_counter_overflow, &profile_method, &profile_method_continue); | |
1225 } | |
1226 | |
1227 __ bind(profile_method_continue); | |
1228 | |
1229 // Reset the _do_not_unlock_if_synchronized flag. | |
1230 if (synchronized) { | |
1231 __ li(R0, 0); | |
1232 __ stb(R0, in_bytes(JavaThread::do_not_unlock_if_synchronized_offset()), R16_thread); | |
1233 } | |
1234 } | |
1235 | |
1236 // -------------------------------------------------------------------------- | |
1237 // Locking of synchronized methods. Must happen AFTER invocation_counter | |
1238 // check and stack overflow check, so method is not locked if overflows. | |
1239 if (synchronized) { | |
1240 lock_method(R3_ARG1, R4_ARG2, R5_ARG3); | |
1241 } | |
1242 #ifdef ASSERT | |
1243 else { | |
1244 Label Lok; | |
1245 __ lwz(R0, in_bytes(Method::access_flags_offset()), R19_method); | |
1246 __ andi_(R0, R0, JVM_ACC_SYNCHRONIZED); | |
1247 __ asm_assert_eq("method needs synchronization", 0x8521); | |
1248 __ bind(Lok); | |
1249 } | |
1250 #endif // ASSERT | |
1251 | |
1252 __ verify_thread(); | |
1253 | |
1254 // -------------------------------------------------------------------------- | |
1255 // JVMTI support | |
1256 __ notify_method_entry(); | |
1257 | |
1258 // -------------------------------------------------------------------------- | |
1259 // Start executing instructions. | |
1260 __ dispatch_next(vtos); | |
1261 | |
1262 // -------------------------------------------------------------------------- | |
1263 // Out of line counter overflow and MDO creation code. | |
1264 if (ProfileInterpreter) { | |
1265 // We have decided to profile this method in the interpreter. | |
1266 __ bind(profile_method); | |
1267 __ call_VM(noreg, CAST_FROM_FN_PTR(address, InterpreterRuntime::profile_method)); | |
1268 __ set_method_data_pointer_for_bcp(); | |
1269 __ b(profile_method_continue); | |
1270 } | |
1271 | |
1272 if (inc_counter) { | |
1273 // Handle invocation counter overflow. | |
1274 __ bind(invocation_counter_overflow); | |
1275 generate_counter_overflow(profile_method_continue); | |
1276 } | |
1277 return entry; | |
1278 } | |
1279 | |
1280 // ============================================================================= | |
1281 // Entry points | |
1282 | |
1283 address AbstractInterpreterGenerator::generate_method_entry( | |
1284 AbstractInterpreter::MethodKind kind) { | |
1285 // Determine code generation flags. | |
1286 bool synchronized = false; | |
1287 address entry_point = NULL; | |
1288 | |
1289 switch (kind) { | |
1290 case Interpreter::zerolocals : break; | |
1291 case Interpreter::zerolocals_synchronized: synchronized = true; break; | |
1292 case Interpreter::native : entry_point = ((InterpreterGenerator*) this)->generate_native_entry(false); break; | |
1293 case Interpreter::native_synchronized : entry_point = ((InterpreterGenerator*) this)->generate_native_entry(true); break; | |
1294 case Interpreter::empty : entry_point = ((InterpreterGenerator*) this)->generate_empty_entry(); break; | |
1295 case Interpreter::accessor : entry_point = ((InterpreterGenerator*) this)->generate_accessor_entry(); break; | |
1296 case Interpreter::abstract : entry_point = ((InterpreterGenerator*) this)->generate_abstract_entry(); break; | |
1297 | |
1298 case Interpreter::java_lang_math_sin : // fall thru | |
1299 case Interpreter::java_lang_math_cos : // fall thru | |
1300 case Interpreter::java_lang_math_tan : // fall thru | |
1301 case Interpreter::java_lang_math_abs : // fall thru | |
1302 case Interpreter::java_lang_math_log : // fall thru | |
1303 case Interpreter::java_lang_math_log10 : // fall thru | |
1304 case Interpreter::java_lang_math_sqrt : // fall thru | |
1305 case Interpreter::java_lang_math_pow : // fall thru | |
1306 case Interpreter::java_lang_math_exp : entry_point = ((InterpreterGenerator*) this)->generate_math_entry(kind); break; | |
1307 case Interpreter::java_lang_ref_reference_get | |
1308 : entry_point = ((InterpreterGenerator*)this)->generate_Reference_get_entry(); break; | |
1309 default : ShouldNotReachHere(); break; | |
1310 } | |
1311 | |
1312 if (entry_point) { | |
1313 return entry_point; | |
1314 } | |
1315 | |
1316 return ((InterpreterGenerator*) this)->generate_normal_entry(synchronized); | |
1317 } | |
1318 | |
1319 // These should never be compiled since the interpreter will prefer | |
1320 // the compiled version to the intrinsic version. | |
1321 bool AbstractInterpreter::can_be_compiled(methodHandle m) { | |
1322 return !math_entry_available(method_kind(m)); | |
1323 } | |
1324 | |
1325 // How much stack a method activation needs in stack slots. | |
1326 // We must calc this exactly like in generate_fixed_frame. | |
1327 // Note: This returns the conservative size assuming maximum alignment. | |
1328 int AbstractInterpreter::size_top_interpreter_activation(Method* method) { | |
1329 const int max_alignment_size = 2; | |
1330 const int abi_scratch = frame::abi_reg_args_size; | |
1331 return method->max_locals() + method->max_stack() + frame::interpreter_frame_monitor_size() + max_alignment_size + abi_scratch; | |
1332 } | |
1333 | |
1334 // Fills a sceletal interpreter frame generated during deoptimizations | |
1335 // and returns the frame size in slots. | |
1336 // | |
1337 // Parameters: | |
1338 // | |
1339 // interpreter_frame == NULL: | |
1340 // Only calculate the size of an interpreter activation, no actual layout. | |
1341 // Note: This calculation must exactly parallel the frame setup | |
1342 // in TemplateInterpreter::generate_normal_entry. But it does not | |
1343 // account for the SP alignment, that might further enhance the | |
1344 // frame size, depending on FP. | |
1345 // | |
1346 // interpreter_frame != NULL: | |
1347 // set up the method, locals, and monitors. | |
1348 // The frame interpreter_frame, if not NULL, is guaranteed to be the | |
1349 // right size, as determined by a previous call to this method. | |
1350 // It is also guaranteed to be walkable even though it is in a skeletal state | |
1351 // | |
1352 // is_top_frame == true: | |
1353 // We're processing the *oldest* interpreter frame! | |
1354 // | |
1355 // pop_frame_extra_args: | |
1356 // If this is != 0 we are returning to a deoptimized frame by popping | |
1357 // off the callee frame. We want to re-execute the call that called the | |
1358 // callee interpreted, but since the return to the interpreter would pop | |
1359 // the arguments off advance the esp by dummy popframe_extra_args slots. | |
1360 // Popping off those will establish the stack layout as it was before the call. | |
1361 // | |
1362 int AbstractInterpreter::layout_activation(Method* method, | |
1363 int tempcount, | |
1364 int popframe_extra_args, | |
1365 int moncount, | |
1366 int caller_actual_parameters, | |
1367 int callee_param_count, | |
1368 int callee_locals, | |
1369 frame* caller, | |
1370 frame* interpreter_frame, | |
1371 bool is_top_frame, | |
1372 bool is_bottom_frame) { | |
1373 | |
1374 const int max_alignment_space = 2; | |
1375 const int abi_scratch = is_top_frame ? (frame::abi_reg_args_size / Interpreter::stackElementSize) : | |
1376 (frame::abi_minframe_size / Interpreter::stackElementSize) ; | |
1377 const int conservative_framesize_in_slots = | |
1378 method->max_stack() + callee_locals - callee_param_count + | |
1379 (moncount * frame::interpreter_frame_monitor_size()) + max_alignment_space + | |
1380 abi_scratch + frame::ijava_state_size / Interpreter::stackElementSize; | |
1381 | |
1382 assert(!is_top_frame || conservative_framesize_in_slots * 8 > frame::abi_reg_args_size + frame::ijava_state_size, "frame too small"); | |
1383 | |
1384 if (interpreter_frame == NULL) { | |
1385 // Since we don't know the exact alignment, we return the conservative size. | |
1386 return (conservative_framesize_in_slots & -2); | |
1387 } else { | |
1388 // Now we know our caller, calc the exact frame layout and size. | |
1389 intptr_t* locals_base = (caller->is_interpreted_frame()) ? | |
1390 caller->interpreter_frame_esp() + caller_actual_parameters : | |
1391 caller->sp() + method->max_locals() - 1 + (frame::abi_minframe_size / Interpreter::stackElementSize) ; | |
1392 | |
1393 intptr_t* monitor_base = caller->sp() - frame::ijava_state_size / Interpreter::stackElementSize ; | |
1394 intptr_t* monitor = monitor_base - (moncount * frame::interpreter_frame_monitor_size()); | |
1395 intptr_t* esp_base = monitor - 1; | |
1396 intptr_t* esp = esp_base - tempcount - popframe_extra_args; | |
1397 intptr_t* sp = (intptr_t *) (((intptr_t) (esp_base- callee_locals + callee_param_count - method->max_stack()- abi_scratch)) & -StackAlignmentInBytes); | |
1398 intptr_t* sender_sp = caller->sp() + (frame::abi_minframe_size - frame::abi_reg_args_size) / Interpreter::stackElementSize; | |
1399 intptr_t* top_frame_sp = is_top_frame ? sp : sp + (frame::abi_minframe_size - frame::abi_reg_args_size) / Interpreter::stackElementSize; | |
1400 | |
1401 interpreter_frame->interpreter_frame_set_method(method); | |
1402 interpreter_frame->interpreter_frame_set_locals(locals_base); | |
1403 interpreter_frame->interpreter_frame_set_cpcache(method->constants()->cache()); | |
1404 interpreter_frame->interpreter_frame_set_esp(esp); | |
1405 interpreter_frame->interpreter_frame_set_monitor_end((BasicObjectLock *)monitor); | |
1406 interpreter_frame->interpreter_frame_set_top_frame_sp(top_frame_sp); | |
1407 if (!is_bottom_frame) { | |
1408 interpreter_frame->interpreter_frame_set_sender_sp(sender_sp); | |
1409 } | |
1410 | |
1411 int framesize_in_slots = caller->sp() - sp; | |
1412 assert(!is_top_frame ||framesize_in_slots >= (frame::abi_reg_args_size / Interpreter::stackElementSize) + frame::ijava_state_size / Interpreter::stackElementSize, "frame too small"); | |
1413 assert(framesize_in_slots <= conservative_framesize_in_slots, "exact frame size must be smaller than the convervative size!"); | |
1414 return framesize_in_slots; | |
1415 } | |
1416 } | |
1417 | |
1418 // ============================================================================= | |
1419 // Exceptions | |
1420 | |
1421 void TemplateInterpreterGenerator::generate_throw_exception() { | |
1422 Register Rexception = R17_tos, | |
1423 Rcontinuation = R3_RET; | |
1424 | |
1425 // -------------------------------------------------------------------------- | |
1426 // Entry point if an method returns with a pending exception (rethrow). | |
1427 Interpreter::_rethrow_exception_entry = __ pc(); | |
1428 { | |
1429 __ restore_interpreter_state(R11_scratch1); // Sets R11_scratch1 = fp. | |
1430 __ ld(R12_scratch2, _ijava_state_neg(top_frame_sp), R11_scratch1); | |
1431 __ resize_frame_absolute(R12_scratch2, R11_scratch1, R0); | |
1432 | |
1433 // Compiled code destroys templateTableBase, reload. | |
1434 __ load_const_optimized(R25_templateTableBase, (address)Interpreter::dispatch_table((TosState)0), R11_scratch1); | |
1435 } | |
1436 | |
1437 // Entry point if a interpreted method throws an exception (throw). | |
1438 Interpreter::_throw_exception_entry = __ pc(); | |
1439 { | |
1440 __ mr(Rexception, R3_RET); | |
1441 | |
1442 __ verify_thread(); | |
1443 __ verify_oop(Rexception); | |
1444 | |
1445 // Expression stack must be empty before entering the VM in case of an exception. | |
1446 __ empty_expression_stack(); | |
1447 // Find exception handler address and preserve exception oop. | |
1448 // Call C routine to find handler and jump to it. | |
1449 __ call_VM(Rexception, CAST_FROM_FN_PTR(address, InterpreterRuntime::exception_handler_for_exception), Rexception); | |
1450 __ mtctr(Rcontinuation); | |
1451 // Push exception for exception handler bytecodes. | |
1452 __ push_ptr(Rexception); | |
1453 | |
1454 // Jump to exception handler (may be remove activation entry!). | |
1455 __ bctr(); | |
1456 } | |
1457 | |
1458 // If the exception is not handled in the current frame the frame is | |
1459 // removed and the exception is rethrown (i.e. exception | |
1460 // continuation is _rethrow_exception). | |
1461 // | |
1462 // Note: At this point the bci is still the bxi for the instruction | |
1463 // which caused the exception and the expression stack is | |
1464 // empty. Thus, for any VM calls at this point, GC will find a legal | |
1465 // oop map (with empty expression stack). | |
1466 | |
1467 // In current activation | |
1468 // tos: exception | |
1469 // bcp: exception bcp | |
1470 | |
1471 // -------------------------------------------------------------------------- | |
1472 // JVMTI PopFrame support | |
1473 | |
1474 Interpreter::_remove_activation_preserving_args_entry = __ pc(); | |
1475 { | |
1476 // Set the popframe_processing bit in popframe_condition indicating that we are | |
1477 // currently handling popframe, so that call_VMs that may happen later do not | |
1478 // trigger new popframe handling cycles. | |
1479 __ lwz(R11_scratch1, in_bytes(JavaThread::popframe_condition_offset()), R16_thread); | |
1480 __ ori(R11_scratch1, R11_scratch1, JavaThread::popframe_processing_bit); | |
1481 __ stw(R11_scratch1, in_bytes(JavaThread::popframe_condition_offset()), R16_thread); | |
1482 | |
1483 // Empty the expression stack, as in normal exception handling. | |
1484 __ empty_expression_stack(); | |
1485 __ unlock_if_synchronized_method(vtos, /* throw_monitor_exception */ false, /* install_monitor_exception */ false); | |
1486 | |
1487 // Check to see whether we are returning to a deoptimized frame. | |
1488 // (The PopFrame call ensures that the caller of the popped frame is | |
1489 // either interpreted or compiled and deoptimizes it if compiled.) | |
1490 // Note that we don't compare the return PC against the | |
1491 // deoptimization blob's unpack entry because of the presence of | |
1492 // adapter frames in C2. | |
1493 Label Lcaller_not_deoptimized; | |
1494 Register return_pc = R3_ARG1; | |
1495 __ ld(return_pc, 0, R1_SP); | |
1496 __ ld(return_pc, _abi(lr), return_pc); | |
1497 __ call_VM_leaf(CAST_FROM_FN_PTR(address, InterpreterRuntime::interpreter_contains), return_pc); | |
1498 __ cmpdi(CCR0, R3_RET, 0); | |
1499 __ bne(CCR0, Lcaller_not_deoptimized); | |
1500 | |
1501 // The deoptimized case. | |
1502 // In this case, we can't call dispatch_next() after the frame is | |
1503 // popped, but instead must save the incoming arguments and restore | |
1504 // them after deoptimization has occurred. | |
1505 __ ld(R4_ARG2, in_bytes(Method::const_offset()), R19_method); | |
1506 __ lhz(R4_ARG2 /* number of params */, in_bytes(ConstMethod::size_of_parameters_offset()), R4_ARG2); | |
1507 __ slwi(R4_ARG2, R4_ARG2, Interpreter::logStackElementSize); | |
1508 __ addi(R5_ARG3, R18_locals, Interpreter::stackElementSize); | |
1509 __ subf(R5_ARG3, R4_ARG2, R5_ARG3); | |
1510 // Save these arguments. | |
1511 __ call_VM_leaf(CAST_FROM_FN_PTR(address, Deoptimization::popframe_preserve_args), R16_thread, R4_ARG2, R5_ARG3); | |
1512 | |
1513 // Inform deoptimization that it is responsible for restoring these arguments. | |
1514 __ load_const_optimized(R11_scratch1, JavaThread::popframe_force_deopt_reexecution_bit); | |
1515 __ stw(R11_scratch1, in_bytes(JavaThread::popframe_condition_offset()), R16_thread); | |
1516 | |
1517 // Return from the current method into the deoptimization blob. Will eventually | |
1518 // end up in the deopt interpeter entry, deoptimization prepared everything that | |
1519 // we will reexecute the call that called us. | |
1520 __ merge_frames(/*top_frame_sp*/ R21_sender_SP, /*reload return_pc*/ return_pc, R11_scratch1, R12_scratch2); | |
1521 __ mtlr(return_pc); | |
1522 __ blr(); | |
1523 | |
1524 // The non-deoptimized case. | |
1525 __ bind(Lcaller_not_deoptimized); | |
1526 | |
1527 // Clear the popframe condition flag. | |
1528 __ li(R0, 0); | |
1529 __ stw(R0, in_bytes(JavaThread::popframe_condition_offset()), R16_thread); | |
1530 | |
1531 // Get out of the current method and re-execute the call that called us. | |
17917 | 1532 __ merge_frames(/*top_frame_sp*/ R21_sender_SP, /*return_pc*/ noreg, R11_scratch1, R12_scratch2); |
17804 | 1533 __ restore_interpreter_state(R11_scratch1); |
1534 __ ld(R12_scratch2, _ijava_state_neg(top_frame_sp), R11_scratch1); | |
1535 __ resize_frame_absolute(R12_scratch2, R11_scratch1, R0); | |
1536 if (ProfileInterpreter) { | |
1537 __ set_method_data_pointer_for_bcp(); | |
1538 } | |
17917 | 1539 #if INCLUDE_JVMTI |
1540 Label L_done; | |
1541 | |
1542 __ lbz(R11_scratch1, 0, R14_bcp); | |
1543 __ cmpwi(CCR0, R11_scratch1, Bytecodes::_invokestatic); | |
1544 __ bne(CCR0, L_done); | |
1545 | |
1546 // The member name argument must be restored if _invokestatic is re-executed after a PopFrame call. | |
1547 // Detect such a case in the InterpreterRuntime function and return the member name argument, or NULL. | |
1548 __ ld(R4_ARG2, 0, R18_locals); | |
1549 __ call_VM(R11_scratch1, CAST_FROM_FN_PTR(address, InterpreterRuntime::member_name_arg_or_null), | |
1550 R4_ARG2, R19_method, R14_bcp); | |
1551 | |
1552 __ cmpdi(CCR0, R11_scratch1, 0); | |
1553 __ beq(CCR0, L_done); | |
1554 | |
1555 __ std(R11_scratch1, wordSize, R15_esp); | |
1556 __ bind(L_done); | |
1557 #endif // INCLUDE_JVMTI | |
17804 | 1558 __ dispatch_next(vtos); |
1559 } | |
1560 // end of JVMTI PopFrame support | |
1561 | |
1562 // -------------------------------------------------------------------------- | |
1563 // Remove activation exception entry. | |
1564 // This is jumped to if an interpreted method can't handle an exception itself | |
1565 // (we come from the throw/rethrow exception entry above). We're going to call | |
1566 // into the VM to find the exception handler in the caller, pop the current | |
1567 // frame and return the handler we calculated. | |
1568 Interpreter::_remove_activation_entry = __ pc(); | |
1569 { | |
1570 __ pop_ptr(Rexception); | |
1571 __ verify_thread(); | |
1572 __ verify_oop(Rexception); | |
1573 __ std(Rexception, in_bytes(JavaThread::vm_result_offset()), R16_thread); | |
1574 | |
1575 __ unlock_if_synchronized_method(vtos, /* throw_monitor_exception */ false, true); | |
1576 __ notify_method_exit(false, vtos, InterpreterMacroAssembler::SkipNotifyJVMTI, false); | |
1577 | |
1578 __ get_vm_result(Rexception); | |
1579 | |
1580 // We are done with this activation frame; find out where to go next. | |
1581 // The continuation point will be an exception handler, which expects | |
1582 // the following registers set up: | |
1583 // | |
1584 // RET: exception oop | |
1585 // ARG2: Issuing PC (see generate_exception_blob()), only used if the caller is compiled. | |
1586 | |
1587 Register return_pc = R31; // Needs to survive the runtime call. | |
1588 __ ld(return_pc, 0, R1_SP); | |
1589 __ ld(return_pc, _abi(lr), return_pc); | |
1590 __ call_VM_leaf(CAST_FROM_FN_PTR(address, SharedRuntime::exception_handler_for_return_address), R16_thread, return_pc); | |
1591 | |
1592 // Remove the current activation. | |
1593 __ merge_frames(/*top_frame_sp*/ R21_sender_SP, /*return_pc*/ noreg, R11_scratch1, R12_scratch2); | |
1594 | |
1595 __ mr(R4_ARG2, return_pc); | |
1596 __ mtlr(R3_RET); | |
1597 __ mr(R3_RET, Rexception); | |
1598 __ blr(); | |
1599 } | |
1600 } | |
1601 | |
1602 // JVMTI ForceEarlyReturn support. | |
1603 // Returns "in the middle" of a method with a "fake" return value. | |
1604 address TemplateInterpreterGenerator::generate_earlyret_entry_for(TosState state) { | |
1605 | |
1606 Register Rscratch1 = R11_scratch1, | |
1607 Rscratch2 = R12_scratch2; | |
1608 | |
1609 address entry = __ pc(); | |
1610 __ empty_expression_stack(); | |
1611 | |
1612 __ load_earlyret_value(state, Rscratch1); | |
1613 | |
1614 __ ld(Rscratch1, in_bytes(JavaThread::jvmti_thread_state_offset()), R16_thread); | |
1615 // Clear the earlyret state. | |
1616 __ li(R0, 0); | |
1617 __ stw(R0, in_bytes(JvmtiThreadState::earlyret_state_offset()), Rscratch1); | |
1618 | |
1619 __ remove_activation(state, false, false); | |
1620 // Copied from TemplateTable::_return. | |
1621 // Restoration of lr done by remove_activation. | |
1622 switch (state) { | |
1623 case ltos: | |
1624 case btos: | |
1625 case ctos: | |
1626 case stos: | |
1627 case atos: | |
1628 case itos: __ mr(R3_RET, R17_tos); break; | |
1629 case ftos: | |
1630 case dtos: __ fmr(F1_RET, F15_ftos); break; | |
1631 case vtos: // This might be a constructor. Final fields (and volatile fields on PPC64) need | |
1632 // to get visible before the reference to the object gets stored anywhere. | |
1633 __ membar(Assembler::StoreStore); break; | |
1634 default : ShouldNotReachHere(); | |
1635 } | |
1636 __ blr(); | |
1637 | |
1638 return entry; | |
1639 } // end of ForceEarlyReturn support | |
1640 | |
1641 //----------------------------------------------------------------------------- | |
1642 // Helper for vtos entry point generation | |
1643 | |
1644 void TemplateInterpreterGenerator::set_vtos_entry_points(Template* t, | |
1645 address& bep, | |
1646 address& cep, | |
1647 address& sep, | |
1648 address& aep, | |
1649 address& iep, | |
1650 address& lep, | |
1651 address& fep, | |
1652 address& dep, | |
1653 address& vep) { | |
1654 assert(t->is_valid() && t->tos_in() == vtos, "illegal template"); | |
1655 Label L; | |
1656 | |
1657 aep = __ pc(); __ push_ptr(); __ b(L); | |
1658 fep = __ pc(); __ push_f(); __ b(L); | |
1659 dep = __ pc(); __ push_d(); __ b(L); | |
1660 lep = __ pc(); __ push_l(); __ b(L); | |
1661 __ align(32, 12, 24); // align L | |
1662 bep = cep = sep = | |
1663 iep = __ pc(); __ push_i(); | |
1664 vep = __ pc(); | |
1665 __ bind(L); | |
1666 generate_and_dispatch(t); | |
1667 } | |
1668 | |
1669 //----------------------------------------------------------------------------- | |
1670 // Generation of individual instructions | |
1671 | |
1672 // helpers for generate_and_dispatch | |
1673 | |
1674 InterpreterGenerator::InterpreterGenerator(StubQueue* code) | |
1675 : TemplateInterpreterGenerator(code) { | |
1676 generate_all(); // Down here so it can be "virtual". | |
1677 } | |
1678 | |
1679 //----------------------------------------------------------------------------- | |
1680 | |
1681 // Non-product code | |
1682 #ifndef PRODUCT | |
1683 address TemplateInterpreterGenerator::generate_trace_code(TosState state) { | |
1684 //__ flush_bundle(); | |
1685 address entry = __ pc(); | |
1686 | |
17848
6048424d3865
8038201: Clean up misleading usage of malloc() in init_system_properties_values()
goetz
parents:
17804
diff
changeset
|
1687 const char *bname = NULL; |
17804 | 1688 uint tsize = 0; |
1689 switch(state) { | |
1690 case ftos: | |
1691 bname = "trace_code_ftos {"; | |
1692 tsize = 2; | |
1693 break; | |
1694 case btos: | |
1695 bname = "trace_code_btos {"; | |
1696 tsize = 2; | |
1697 break; | |
1698 case ctos: | |
1699 bname = "trace_code_ctos {"; | |
1700 tsize = 2; | |
1701 break; | |
1702 case stos: | |
1703 bname = "trace_code_stos {"; | |
1704 tsize = 2; | |
1705 break; | |
1706 case itos: | |
1707 bname = "trace_code_itos {"; | |
1708 tsize = 2; | |
1709 break; | |
1710 case ltos: | |
1711 bname = "trace_code_ltos {"; | |
1712 tsize = 3; | |
1713 break; | |
1714 case atos: | |
1715 bname = "trace_code_atos {"; | |
1716 tsize = 2; | |
1717 break; | |
1718 case vtos: | |
1719 // Note: In case of vtos, the topmost of stack value could be a int or doubl | |
1720 // In case of a double (2 slots) we won't see the 2nd stack value. | |
1721 // Maybe we simply should print the topmost 3 stack slots to cope with the problem. | |
1722 bname = "trace_code_vtos {"; | |
1723 tsize = 2; | |
1724 | |
1725 break; | |
1726 case dtos: | |
1727 bname = "trace_code_dtos {"; | |
1728 tsize = 3; | |
1729 break; | |
1730 default: | |
1731 ShouldNotReachHere(); | |
1732 } | |
1733 BLOCK_COMMENT(bname); | |
1734 | |
1735 // Support short-cut for TraceBytecodesAt. | |
1736 // Don't call into the VM if we don't want to trace to speed up things. | |
1737 Label Lskip_vm_call; | |
1738 if (TraceBytecodesAt > 0 && TraceBytecodesAt < max_intx) { | |
1739 int offs1 = __ load_const_optimized(R11_scratch1, (address) &TraceBytecodesAt, R0, true); | |
1740 int offs2 = __ load_const_optimized(R12_scratch2, (address) &BytecodeCounter::_counter_value, R0, true); | |
1741 __ ld(R11_scratch1, offs1, R11_scratch1); | |
1742 __ lwa(R12_scratch2, offs2, R12_scratch2); | |
1743 __ cmpd(CCR0, R12_scratch2, R11_scratch1); | |
1744 __ blt(CCR0, Lskip_vm_call); | |
1745 } | |
1746 | |
1747 __ push(state); | |
1748 // Load 2 topmost expression stack values. | |
1749 __ ld(R6_ARG4, tsize*Interpreter::stackElementSize, R15_esp); | |
1750 __ ld(R5_ARG3, Interpreter::stackElementSize, R15_esp); | |
1751 __ mflr(R31); | |
1752 __ call_VM(noreg, CAST_FROM_FN_PTR(address, SharedRuntime::trace_bytecode), /* unused */ R4_ARG2, R5_ARG3, R6_ARG4, false); | |
1753 __ mtlr(R31); | |
1754 __ pop(state); | |
1755 | |
1756 if (TraceBytecodesAt > 0 && TraceBytecodesAt < max_intx) { | |
1757 __ bind(Lskip_vm_call); | |
1758 } | |
1759 __ blr(); | |
1760 BLOCK_COMMENT("} trace_code"); | |
1761 return entry; | |
1762 } | |
1763 | |
1764 void TemplateInterpreterGenerator::count_bytecode() { | |
1765 int offs = __ load_const_optimized(R11_scratch1, (address) &BytecodeCounter::_counter_value, R12_scratch2, true); | |
1766 __ lwz(R12_scratch2, offs, R11_scratch1); | |
1767 __ addi(R12_scratch2, R12_scratch2, 1); | |
1768 __ stw(R12_scratch2, offs, R11_scratch1); | |
1769 } | |
1770 | |
1771 void TemplateInterpreterGenerator::histogram_bytecode(Template* t) { | |
1772 int offs = __ load_const_optimized(R11_scratch1, (address) &BytecodeHistogram::_counters[t->bytecode()], R12_scratch2, true); | |
1773 __ lwz(R12_scratch2, offs, R11_scratch1); | |
1774 __ addi(R12_scratch2, R12_scratch2, 1); | |
1775 __ stw(R12_scratch2, offs, R11_scratch1); | |
1776 } | |
1777 | |
1778 void TemplateInterpreterGenerator::histogram_bytecode_pair(Template* t) { | |
1779 const Register addr = R11_scratch1, | |
1780 tmp = R12_scratch2; | |
1781 // Get index, shift out old bytecode, bring in new bytecode, and store it. | |
1782 // _index = (_index >> log2_number_of_codes) | | |
1783 // (bytecode << log2_number_of_codes); | |
1784 int offs1 = __ load_const_optimized(addr, (address)&BytecodePairHistogram::_index, tmp, true); | |
1785 __ lwz(tmp, offs1, addr); | |
1786 __ srwi(tmp, tmp, BytecodePairHistogram::log2_number_of_codes); | |
1787 __ ori(tmp, tmp, ((int) t->bytecode()) << BytecodePairHistogram::log2_number_of_codes); | |
1788 __ stw(tmp, offs1, addr); | |
1789 | |
1790 // Bump bucket contents. | |
1791 // _counters[_index] ++; | |
1792 int offs2 = __ load_const_optimized(addr, (address)&BytecodePairHistogram::_counters, R0, true); | |
1793 __ sldi(tmp, tmp, LogBytesPerInt); | |
1794 __ add(addr, tmp, addr); | |
1795 __ lwz(tmp, offs2, addr); | |
1796 __ addi(tmp, tmp, 1); | |
1797 __ stw(tmp, offs2, addr); | |
1798 } | |
1799 | |
1800 void TemplateInterpreterGenerator::trace_bytecode(Template* t) { | |
1801 // Call a little run-time stub to avoid blow-up for each bytecode. | |
1802 // The run-time runtime saves the right registers, depending on | |
1803 // the tosca in-state for the given template. | |
1804 | |
1805 assert(Interpreter::trace_code(t->tos_in()) != NULL, | |
1806 "entry must have been generated"); | |
1807 | |
1808 // Note: we destroy LR here. | |
1809 __ bl(Interpreter::trace_code(t->tos_in())); | |
1810 } | |
1811 | |
1812 void TemplateInterpreterGenerator::stop_interpreter_at() { | |
1813 Label L; | |
1814 int offs1 = __ load_const_optimized(R11_scratch1, (address) &StopInterpreterAt, R0, true); | |
1815 int offs2 = __ load_const_optimized(R12_scratch2, (address) &BytecodeCounter::_counter_value, R0, true); | |
1816 __ ld(R11_scratch1, offs1, R11_scratch1); | |
1817 __ lwa(R12_scratch2, offs2, R12_scratch2); | |
1818 __ cmpd(CCR0, R12_scratch2, R11_scratch1); | |
1819 __ bne(CCR0, L); | |
1820 __ illtrap(); | |
1821 __ bind(L); | |
1822 } | |
1823 | |
1824 #endif // !PRODUCT | |
1825 #endif // !CC_INTERP |