1 /*
2 * Copyright 1997-2010 Sun Microsystems, Inc. All Rights Reserved.
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/_frame_sparc.cpp.incl"
27
28 void RegisterMap::pd_clear() {
29 if (_thread->has_last_Java_frame()) {
30 frame fr = _thread->last_frame();
31 _window = fr.sp();
32 } else {
33 _window = NULL;
34 }
35 _younger_window = NULL;
36 }
37
38
39 // Unified register numbering scheme: each 32-bits counts as a register
40 // number, so all the V9 registers take 2 slots.
41 const static int R_L_nums[] = {0+040,2+040,4+040,6+040,8+040,10+040,12+040,14+040};
42 const static int R_I_nums[] = {0+060,2+060,4+060,6+060,8+060,10+060,12+060,14+060};
43 const static int R_O_nums[] = {0+020,2+020,4+020,6+020,8+020,10+020,12+020,14+020};
44 const static int R_G_nums[] = {0+000,2+000,4+000,6+000,8+000,10+000,12+000,14+000};
45 static RegisterMap::LocationValidType bad_mask = 0;
46 static RegisterMap::LocationValidType R_LIO_mask = 0;
47 static bool register_map_inited = false;
48
49 static void register_map_init() {
50 if (!register_map_inited) {
51 register_map_inited = true;
52 int i;
53 for (i = 0; i < 8; i++) {
54 assert(R_L_nums[i] < RegisterMap::location_valid_type_size, "in first chunk");
55 assert(R_I_nums[i] < RegisterMap::location_valid_type_size, "in first chunk");
56 assert(R_O_nums[i] < RegisterMap::location_valid_type_size, "in first chunk");
57 assert(R_G_nums[i] < RegisterMap::location_valid_type_size, "in first chunk");
58 }
59
60 bad_mask |= (1LL << R_O_nums[6]); // SP
61 bad_mask |= (1LL << R_O_nums[7]); // cPC
62 bad_mask |= (1LL << R_I_nums[6]); // FP
63 bad_mask |= (1LL << R_I_nums[7]); // rPC
64 bad_mask |= (1LL << R_G_nums[2]); // TLS
65 bad_mask |= (1LL << R_G_nums[7]); // reserved by libthread
66
67 for (i = 0; i < 8; i++) {
68 R_LIO_mask |= (1LL << R_L_nums[i]);
69 R_LIO_mask |= (1LL << R_I_nums[i]);
70 R_LIO_mask |= (1LL << R_O_nums[i]);
71 }
72 }
73 }
74
75
76 address RegisterMap::pd_location(VMReg regname) const {
77 register_map_init();
78
79 assert(regname->is_reg(), "sanity check");
80 // Only the GPRs get handled this way
81 if( !regname->is_Register())
82 return NULL;
83
84 // don't talk about bad registers
85 if ((bad_mask & ((LocationValidType)1 << regname->value())) != 0) {
86 return NULL;
87 }
88
89 // Convert to a GPR
90 Register reg;
91 int second_word = 0;
92 // 32-bit registers for in, out and local
93 if (!regname->is_concrete()) {
94 // HMM ought to return NULL for any non-concrete (odd) vmreg
95 // this all tied up in the fact we put out double oopMaps for
96 // register locations. When that is fixed we'd will return NULL
97 // (or assert here).
98 reg = regname->prev()->as_Register();
99 #ifdef _LP64
100 second_word = sizeof(jint);
101 #else
102 return NULL;
103 #endif // _LP64
104 } else {
105 reg = regname->as_Register();
106 }
107 if (reg->is_out()) {
108 assert(_younger_window != NULL, "Younger window should be available");
109 return second_word + (address)&_younger_window[reg->after_save()->sp_offset_in_saved_window()];
110 }
111 if (reg->is_local() || reg->is_in()) {
112 assert(_window != NULL, "Window should be available");
113 return second_word + (address)&_window[reg->sp_offset_in_saved_window()];
114 }
115 // Only the window'd GPRs get handled this way; not the globals.
116 return NULL;
117 }
118
119
120 #ifdef ASSERT
121 void RegisterMap::check_location_valid() {
122 register_map_init();
123 assert((_location_valid[0] & bad_mask) == 0, "cannot have special locations for SP,FP,TLS,etc.");
124 }
125 #endif
126
127 // We are shifting windows. That means we are moving all %i to %o,
128 // getting rid of all current %l, and keeping all %g. This is only
129 // complicated if any of the location pointers for these are valid.
130 // The normal case is that everything is in its standard register window
131 // home, and _location_valid[0] is zero. In that case, this routine
132 // does exactly nothing.
133 void RegisterMap::shift_individual_registers() {
134 if (!update_map()) return; // this only applies to maps with locations
135 register_map_init();
136 check_location_valid();
137
138 LocationValidType lv = _location_valid[0];
139 LocationValidType lv0 = lv;
140
141 lv &= ~R_LIO_mask; // clear %l, %o, %i regs
142
143 // if we cleared some non-%g locations, we may have to do some shifting
144 if (lv != lv0) {
145 // copy %i0-%i5 to %o0-%o5, if they have special locations
146 // This can happen in within stubs which spill argument registers
147 // around a dynamic link operation, such as resolve_opt_virtual_call.
148 for (int i = 0; i < 8; i++) {
149 if (lv0 & (1LL << R_I_nums[i])) {
150 _location[R_O_nums[i]] = _location[R_I_nums[i]];
151 lv |= (1LL << R_O_nums[i]);
152 }
153 }
154 }
155
156 _location_valid[0] = lv;
157 check_location_valid();
158 }
159
160 bool frame::safe_for_sender(JavaThread *thread) {
161
162 address _SP = (address) sp();
163 address _FP = (address) fp();
164 address _UNEXTENDED_SP = (address) unextended_sp();
165 // sp must be within the stack
166 bool sp_safe = (_SP <= thread->stack_base()) &&
167 (_SP >= thread->stack_base() - thread->stack_size());
168
169 if (!sp_safe) {
170 return false;
171 }
172
173 // unextended sp must be within the stack and above or equal sp
174 bool unextended_sp_safe = (_UNEXTENDED_SP <= thread->stack_base()) &&
175 (_UNEXTENDED_SP >= _SP);
176
177 if (!unextended_sp_safe) return false;
178
179 // an fp must be within the stack and above (but not equal) sp
180 bool fp_safe = (_FP <= thread->stack_base()) &&
181 (_FP > _SP);
182
183 // We know sp/unextended_sp are safe only fp is questionable here
184
185 // If the current frame is known to the code cache then we can attempt to
186 // to construct the sender and do some validation of it. This goes a long way
187 // toward eliminating issues when we get in frame construction code
188
189 if (_cb != NULL ) {
190
191 // First check if frame is complete and tester is reliable
192 // Unfortunately we can only check frame complete for runtime stubs and nmethod
193 // other generic buffer blobs are more problematic so we just assume they are
194 // ok. adapter blobs never have a frame complete and are never ok.
195
196 if (!_cb->is_frame_complete_at(_pc)) {
197 if (_cb->is_nmethod() || _cb->is_adapter_blob() || _cb->is_runtime_stub()) {
198 return false;
199 }
200 }
201
202 // Entry frame checks
203 if (is_entry_frame()) {
204 // an entry frame must have a valid fp.
205
206 if (!fp_safe) {
207 return false;
208 }
209
210 // Validate the JavaCallWrapper an entry frame must have
211
212 address jcw = (address)entry_frame_call_wrapper();
213
214 bool jcw_safe = (jcw <= thread->stack_base()) && ( jcw > _FP);
215
216 return jcw_safe;
217
218 }
219
220 intptr_t* younger_sp = sp();
221 intptr_t* _SENDER_SP = sender_sp(); // sender is actually just _FP
222 bool adjusted_stack = is_interpreted_frame();
223
224 address sender_pc = (address)younger_sp[I7->sp_offset_in_saved_window()] + pc_return_offset;
225
226
227 // We must always be able to find a recognizable pc
228 CodeBlob* sender_blob = CodeCache::find_blob_unsafe(sender_pc);
229 if (sender_pc == NULL || sender_blob == NULL) {
230 return false;
231 }
232
233 // It should be safe to construct the sender though it might not be valid
234
235 frame sender(_SENDER_SP, younger_sp, adjusted_stack);
236
237 // Do we have a valid fp?
238 address sender_fp = (address) sender.fp();
239
240 // an fp must be within the stack and above (but not equal) current frame's _FP
241
242 bool sender_fp_safe = (sender_fp <= thread->stack_base()) &&
243 (sender_fp > _FP);
244
245 if (!sender_fp_safe) {
246 return false;
247 }
248
249
250 // If the potential sender is the interpreter then we can do some more checking
251 if (Interpreter::contains(sender_pc)) {
252 return sender.is_interpreted_frame_valid(thread);
253 }
254
255 // Could just be some random pointer within the codeBlob
256 if (!sender.cb()->instructions_contains(sender_pc)) return false;
257
258 // We should never be able to see an adapter if the current frame is something from code cache
259
260 if ( sender_blob->is_adapter_blob()) {
261 return false;
262 }
263
264 if( sender.is_entry_frame()) {
265 // Validate the JavaCallWrapper an entry frame must have
266
267 address jcw = (address)sender.entry_frame_call_wrapper();
268
269 bool jcw_safe = (jcw <= thread->stack_base()) && ( jcw > sender_fp);
270
271 return jcw_safe;
272 }
273
274 // If the frame size is 0 something is bad because every nmethod has a non-zero frame size
275 // because you must allocate window space
276
277 if (sender_blob->frame_size() == 0) {
278 assert(!sender_blob->is_nmethod(), "should count return address at least");
279 return false;
280 }
281
282 // The sender should positively be an nmethod or call_stub. On sparc we might in fact see something else.
283 // The cause of this is because at a save instruction the O7 we get is a leftover from an earlier
284 // window use. So if a runtime stub creates two frames (common in fastdebug/jvmg) then we see the
285 // stale pc. So if the sender blob is not something we'd expect we have little choice but to declare
286 // the stack unwalkable. pd_get_top_frame_for_signal_handler tries to recover from this by unwinding
287 // that initial frame and retrying.
288
289 if (!sender_blob->is_nmethod()) {
290 return false;
291 }
292
293 // Could put some more validation for the potential non-interpreted sender
294 // frame we'd create by calling sender if I could think of any. Wait for next crash in forte...
295
296 // One idea is seeing if the sender_pc we have is one that we'd expect to call to current cb
297
298 // We've validated the potential sender that would be created
299
300 return true;
301
302 }
303
304 // Must be native-compiled frame. Since sender will try and use fp to find
305 // linkages it must be safe
306
307 if (!fp_safe) return false;
308
309 // could try and do some more potential verification of native frame if we could think of some...
310
311 return true;
312 }
313
314 // constructors
315
316 // Construct an unpatchable, deficient frame
317 frame::frame(intptr_t* sp, unpatchable_t, address pc, CodeBlob* cb) {
318 #ifdef _LP64
319 assert( (((intptr_t)sp & (wordSize-1)) == 0), "frame constructor passed an invalid sp");
320 #endif
321 _sp = sp;
322 _younger_sp = NULL;
323 _pc = pc;
324 _cb = cb;
325 _sp_adjustment_by_callee = 0;
326 assert(pc == NULL && cb == NULL || pc != NULL, "can't have a cb and no pc!");
327 if (_cb == NULL && _pc != NULL ) {
328 _cb = CodeCache::find_blob(_pc);
329 }
330 _deopt_state = unknown;
331 #ifdef ASSERT
332 if ( _cb != NULL && _cb->is_nmethod()) {
333 // Without a valid unextended_sp() we can't convert the pc to "original"
334 assert(!((nmethod*)_cb)->is_deopt_pc(_pc), "invariant broken");
335 }
336 #endif // ASSERT
337 }
338
339 frame::frame(intptr_t* sp, intptr_t* younger_sp, bool younger_frame_is_interpreted) :
340 _sp(sp),
341 _younger_sp(younger_sp),
342 _deopt_state(unknown),
343 _sp_adjustment_by_callee(0) {
344 if (younger_sp == NULL) {
345 // make a deficient frame which doesn't know where its PC is
346 _pc = NULL;
347 _cb = NULL;
348 } else {
349 _pc = (address)younger_sp[I7->sp_offset_in_saved_window()] + pc_return_offset;
350 assert( (intptr_t*)younger_sp[FP->sp_offset_in_saved_window()] == (intptr_t*)((intptr_t)sp - STACK_BIAS), "younger_sp must be valid");
351 // Any frame we ever build should always "safe" therefore we should not have to call
352 // find_blob_unsafe
353 // In case of native stubs, the pc retrieved here might be
354 // wrong. (the _last_native_pc will have the right value)
355 // So do not put add any asserts on the _pc here.
356 }
357
358 if (_pc != NULL)
359 _cb = CodeCache::find_blob(_pc);
360
361 // Check for MethodHandle call sites.
362 if (_cb != NULL) {
363 nmethod* nm = _cb->as_nmethod_or_null();
364 if (nm != NULL) {
365 if (nm->is_deopt_mh_entry(_pc) || nm->is_method_handle_return(_pc)) {
366 _sp_adjustment_by_callee = (intptr_t*) ((intptr_t) sp[L7_mh_SP_save->sp_offset_in_saved_window()] + STACK_BIAS) - sp;
367 // The SP is already adjusted by this MH call site, don't
368 // overwrite this value with the wrong interpreter value.
369 younger_frame_is_interpreted = false;
370 }
371 }
372 }
373
374 if (younger_frame_is_interpreted) {
375 // compute adjustment to this frame's SP made by its interpreted callee
376 _sp_adjustment_by_callee = (intptr_t*) ((intptr_t) younger_sp[I5_savedSP->sp_offset_in_saved_window()] + STACK_BIAS) - sp;
377 }
378
379 // It is important that the frame is fully constructed when we do
380 // this lookup as get_deopt_original_pc() needs a correct value for
381 // unextended_sp() which uses _sp_adjustment_by_callee.
382 if (_pc != NULL) {
383 address original_pc = nmethod::get_deopt_original_pc(this);
384 if (original_pc != NULL) {
385 _pc = original_pc;
386 _deopt_state = is_deoptimized;
387 } else {
388 _deopt_state = not_deoptimized;
389 }
390 }
391 }
392
393 bool frame::is_interpreted_frame() const {
394 return Interpreter::contains(pc());
395 }
396
397 // sender_sp
398
399 intptr_t* frame::interpreter_frame_sender_sp() const {
400 assert(is_interpreted_frame(), "interpreted frame expected");
401 return fp();
402 }
403
404 #ifndef CC_INTERP
405 void frame::set_interpreter_frame_sender_sp(intptr_t* sender_sp) {
406 assert(is_interpreted_frame(), "interpreted frame expected");
407 Unimplemented();
408 }
409 #endif // CC_INTERP
410
411
412 #ifdef ASSERT
413 // Debugging aid
414 static frame nth_sender(int n) {
415 frame f = JavaThread::current()->last_frame();
416
417 for(int i = 0; i < n; ++i)
418 f = f.sender((RegisterMap*)NULL);
419
420 printf("first frame %d\n", f.is_first_frame() ? 1 : 0);
421 printf("interpreted frame %d\n", f.is_interpreted_frame() ? 1 : 0);
422 printf("java frame %d\n", f.is_java_frame() ? 1 : 0);
423 printf("entry frame %d\n", f.is_entry_frame() ? 1 : 0);
424 printf("native frame %d\n", f.is_native_frame() ? 1 : 0);
425 if (f.is_compiled_frame()) {
426 if (f.is_deoptimized_frame())
427 printf("deoptimized frame 1\n");
428 else
429 printf("compiled frame 1\n");
430 }
431
432 return f;
433 }
434 #endif
435
436
437 frame frame::sender_for_entry_frame(RegisterMap *map) const {
438 assert(map != NULL, "map must be set");
439 // Java frame called from C; skip all C frames and return top C
440 // frame of that chunk as the sender
441 JavaFrameAnchor* jfa = entry_frame_call_wrapper()->anchor();
442 assert(!entry_frame_is_first(), "next Java fp must be non zero");
443 assert(jfa->last_Java_sp() > _sp, "must be above this frame on stack");
444 intptr_t* last_Java_sp = jfa->last_Java_sp();
445 // Since we are walking the stack now this nested anchor is obviously walkable
446 // even if it wasn't when it was stacked.
447 if (!jfa->walkable()) {
448 // Capture _last_Java_pc (if needed) and mark anchor walkable.
449 jfa->capture_last_Java_pc(_sp);
450 }
451 assert(jfa->last_Java_pc() != NULL, "No captured pc!");
452 map->clear();
453 map->make_integer_regs_unsaved();
454 map->shift_window(last_Java_sp, NULL);
455 assert(map->include_argument_oops(), "should be set by clear");
456 return frame(last_Java_sp, frame::unpatchable, jfa->last_Java_pc());
457 }
458
459 frame frame::sender_for_interpreter_frame(RegisterMap *map) const {
460 ShouldNotCallThis();
461 return sender(map);
462 }
463
464 frame frame::sender_for_compiled_frame(RegisterMap *map) const {
465 ShouldNotCallThis();
466 return sender(map);
467 }
468
469 frame frame::sender(RegisterMap* map) const {
470 assert(map != NULL, "map must be set");
471
472 assert(CodeCache::find_blob_unsafe(_pc) == _cb, "inconsistent");
473
474 // Default is not to follow arguments; update it accordingly below
475 map->set_include_argument_oops(false);
476
477 if (is_entry_frame()) return sender_for_entry_frame(map);
478
479 intptr_t* younger_sp = sp();
480 intptr_t* sp = sender_sp();
481
482 // Note: The version of this operation on any platform with callee-save
483 // registers must update the register map (if not null).
484 // In order to do this correctly, the various subtypes of
485 // of frame (interpreted, compiled, glue, native),
486 // must be distinguished. There is no need on SPARC for
487 // such distinctions, because all callee-save registers are
488 // preserved for all frames via SPARC-specific mechanisms.
489 //
490 // *** HOWEVER, *** if and when we make any floating-point
491 // registers callee-saved, then we will have to copy over
492 // the RegisterMap update logic from the Intel code.
493
494 // The constructor of the sender must know whether this frame is interpreted so it can set the
495 // sender's _sp_adjustment_by_callee field. An osr adapter frame was originally
496 // interpreted but its pc is in the code cache (for c1 -> osr_frame_return_id stub), so it must be
497 // explicitly recognized.
498
499 bool frame_is_interpreted = is_interpreted_frame();
500 if (frame_is_interpreted) {
501 map->make_integer_regs_unsaved();
502 map->shift_window(sp, younger_sp);
503 } else if (_cb != NULL) {
504 // Update the locations of implicitly saved registers to be their
505 // addresses in the register save area.
506 // For %o registers, the addresses of %i registers in the next younger
507 // frame are used.
508 map->shift_window(sp, younger_sp);
509 if (map->update_map()) {
510 // Tell GC to use argument oopmaps for some runtime stubs that need it.
511 // For C1, the runtime stub might not have oop maps, so set this flag
512 // outside of update_register_map.
513 map->set_include_argument_oops(_cb->caller_must_gc_arguments(map->thread()));
514 if (_cb->oop_maps() != NULL) {
515 OopMapSet::update_register_map(this, map);
516 }
517 }
518 }
519 return frame(sp, younger_sp, frame_is_interpreted);
520 }
521
522
523 void frame::patch_pc(Thread* thread, address pc) {
524 if(thread == Thread::current()) {
525 StubRoutines::Sparc::flush_callers_register_windows_func()();
526 }
527 if (TracePcPatching) {
528 // QQQ this assert is invalid (or too strong anyway) sice _pc could
529 // be original pc and frame could have the deopt pc.
530 // assert(_pc == *O7_addr() + pc_return_offset, "frame has wrong pc");
531 tty->print_cr("patch_pc at address 0x%x [0x%x -> 0x%x] ", O7_addr(), _pc, pc);
532 }
533 _cb = CodeCache::find_blob(pc);
534 *O7_addr() = pc - pc_return_offset;
535 _cb = CodeCache::find_blob(_pc);
536 address original_pc = nmethod::get_deopt_original_pc(this);
537 if (original_pc != NULL) {
538 assert(original_pc == _pc, "expected original to be stored before patching");
539 _deopt_state = is_deoptimized;
540 } else {
541 _deopt_state = not_deoptimized;
542 }
543 }
544
545
546 static bool sp_is_valid(intptr_t* old_sp, intptr_t* young_sp, intptr_t* sp) {
547 return (((intptr_t)sp & (2*wordSize-1)) == 0 &&
548 sp <= old_sp &&
549 sp >= young_sp);
550 }
551
552
553 /*
554 Find the (biased) sp that is just younger than old_sp starting at sp.
555 If not found return NULL. Register windows are assumed to be flushed.
556 */
557 intptr_t* frame::next_younger_sp_or_null(intptr_t* old_sp, intptr_t* sp) {
558
559 intptr_t* previous_sp = NULL;
560 intptr_t* orig_sp = sp;
561
562 int max_frames = (old_sp - sp) / 16; // Minimum frame size is 16
563 int max_frame2 = max_frames;
564 while(sp != old_sp && sp_is_valid(old_sp, orig_sp, sp)) {
565 if (max_frames-- <= 0)
566 // too many frames have gone by; invalid parameters given to this function
567 break;
568 previous_sp = sp;
569 sp = (intptr_t*)sp[FP->sp_offset_in_saved_window()];
570 sp = (intptr_t*)((intptr_t)sp + STACK_BIAS);
571 }
572
573 return (sp == old_sp ? previous_sp : NULL);
574 }
575
576 /*
577 Determine if "sp" is a valid stack pointer. "sp" is assumed to be younger than
578 "valid_sp". So if "sp" is valid itself then it should be possible to walk frames
579 from "sp" to "valid_sp". The assumption is that the registers windows for the
580 thread stack in question are flushed.
581 */
582 bool frame::is_valid_stack_pointer(intptr_t* valid_sp, intptr_t* sp) {
583 return next_younger_sp_or_null(valid_sp, sp) != NULL;
584 }
585
586
587 bool frame::interpreter_frame_equals_unpacked_fp(intptr_t* fp) {
588 assert(is_interpreted_frame(), "must be interpreter frame");
589 return this->fp() == fp;
590 }
591
592
593 void frame::pd_gc_epilog() {
594 if (is_interpreted_frame()) {
595 // set constant pool cache entry for interpreter
596 methodOop m = interpreter_frame_method();
597
598 *interpreter_frame_cpoolcache_addr() = m->constants()->cache();
599 }
600 }
601
602
603 bool frame::is_interpreted_frame_valid(JavaThread* thread) const {
604 #ifdef CC_INTERP
605 // Is there anything to do?
606 #else
607 assert(is_interpreted_frame(), "Not an interpreted frame");
608 // These are reasonable sanity checks
609 if (fp() == 0 || (intptr_t(fp()) & (2*wordSize-1)) != 0) {
610 return false;
611 }
612 if (sp() == 0 || (intptr_t(sp()) & (2*wordSize-1)) != 0) {
613 return false;
614 }
615
616 const intptr_t interpreter_frame_initial_sp_offset = interpreter_frame_vm_local_words;
617 if (fp() + interpreter_frame_initial_sp_offset < sp()) {
618 return false;
619 }
620 // These are hacks to keep us out of trouble.
621 // The problem with these is that they mask other problems
622 if (fp() <= sp()) { // this attempts to deal with unsigned comparison above
623 return false;
624 }
625 // do some validation of frame elements
626
627 // first the method
628
629 methodOop m = *interpreter_frame_method_addr();
630
631 // validate the method we'd find in this potential sender
632 if (!Universe::heap()->is_valid_method(m)) return false;
633
634 // stack frames shouldn't be much larger than max_stack elements
635
636 if (fp() - sp() > 1024 + m->max_stack()*Interpreter::stackElementSize()) {
637 return false;
638 }
639
640 // validate bci/bcx
641
642 intptr_t bcx = interpreter_frame_bcx();
643 if (m->validate_bci_from_bcx(bcx) < 0) {
644 return false;
645 }
646
647 // validate constantPoolCacheOop
648
649 constantPoolCacheOop cp = *interpreter_frame_cache_addr();
650
651 if (cp == NULL ||
652 !Space::is_aligned(cp) ||
653 !Universe::heap()->is_permanent((void*)cp)) return false;
654
655 // validate locals
656
657 address locals = (address) *interpreter_frame_locals_addr();
658
659 if (locals > thread->stack_base() || locals < (address) fp()) return false;
660
661 // We'd have to be pretty unlucky to be mislead at this point
662 #endif /* CC_INTERP */
663 return true;
664 }
665
666
667 // Windows have been flushed on entry (but not marked). Capture the pc that
668 // is the return address to the frame that contains "sp" as its stack pointer.
669 // This pc resides in the called of the frame corresponding to "sp".
670 // As a side effect we mark this JavaFrameAnchor as having flushed the windows.
671 // This side effect lets us mark stacked JavaFrameAnchors (stacked in the
672 // call_helper) as flushed when we have flushed the windows for the most
673 // recent (i.e. current) JavaFrameAnchor. This saves useless flushing calls
674 // and lets us find the pc just once rather than multiple times as it did
675 // in the bad old _post_Java_state days.
676 //
677 void JavaFrameAnchor::capture_last_Java_pc(intptr_t* sp) {
678 if (last_Java_sp() != NULL && last_Java_pc() == NULL) {
679 // try and find the sp just younger than _last_Java_sp
680 intptr_t* _post_Java_sp = frame::next_younger_sp_or_null(last_Java_sp(), sp);
681 // Really this should never fail otherwise VM call must have non-standard
682 // frame linkage (bad) or stack is not properly flushed (worse).
683 guarantee(_post_Java_sp != NULL, "bad stack!");
684 _last_Java_pc = (address) _post_Java_sp[ I7->sp_offset_in_saved_window()] + frame::pc_return_offset;
685
686 }
687 set_window_flushed();
688 }
689
690 void JavaFrameAnchor::make_walkable(JavaThread* thread) {
691 if (walkable()) return;
692 // Eventually make an assert
693 guarantee(Thread::current() == (Thread*)thread, "only current thread can flush its registers");
694 // We always flush in case the profiler wants it but we won't mark
695 // the windows as flushed unless we have a last_Java_frame
696 intptr_t* sp = StubRoutines::Sparc::flush_callers_register_windows_func()();
697 if (last_Java_sp() != NULL ) {
698 capture_last_Java_pc(sp);
699 }
700 }
701
702 intptr_t* frame::entry_frame_argument_at(int offset) const {
703 // convert offset to index to deal with tsi
704 int index = (Interpreter::expr_offset_in_bytes(offset)/wordSize);
705
706 intptr_t* LSP = (intptr_t*) sp()[Lentry_args->sp_offset_in_saved_window()];
707 return &LSP[index+1];
708 }
709
710
711 BasicType frame::interpreter_frame_result(oop* oop_result, jvalue* value_result) {
712 assert(is_interpreted_frame(), "interpreted frame expected");
713 methodOop method = interpreter_frame_method();
714 BasicType type = method->result_type();
715
716 if (method->is_native()) {
717 // Prior to notifying the runtime of the method_exit the possible result
718 // value is saved to l_scratch and d_scratch.
719
720 #ifdef CC_INTERP
721 interpreterState istate = get_interpreterState();
722 intptr_t* l_scratch = (intptr_t*) &istate->_native_lresult;
723 intptr_t* d_scratch = (intptr_t*) &istate->_native_fresult;
724 #else /* CC_INTERP */
725 intptr_t* l_scratch = fp() + interpreter_frame_l_scratch_fp_offset;
726 intptr_t* d_scratch = fp() + interpreter_frame_d_scratch_fp_offset;
727 #endif /* CC_INTERP */
728
729 address l_addr = (address)l_scratch;
730 #ifdef _LP64
731 // On 64-bit the result for 1/8/16/32-bit result types is in the other
732 // word half
733 l_addr += wordSize/2;
734 #endif
735
736 switch (type) {
737 case T_OBJECT:
738 case T_ARRAY: {
739 #ifdef CC_INTERP
740 *oop_result = istate->_oop_temp;
741 #else
742 oop obj = (oop) at(interpreter_frame_oop_temp_offset);
743 assert(obj == NULL || Universe::heap()->is_in(obj), "sanity check");
744 *oop_result = obj;
745 #endif // CC_INTERP
746 break;
747 }
748
749 case T_BOOLEAN : { jint* p = (jint*)l_addr; value_result->z = (jboolean)((*p) & 0x1); break; }
750 case T_BYTE : { jint* p = (jint*)l_addr; value_result->b = (jbyte)((*p) & 0xff); break; }
751 case T_CHAR : { jint* p = (jint*)l_addr; value_result->c = (jchar)((*p) & 0xffff); break; }
752 case T_SHORT : { jint* p = (jint*)l_addr; value_result->s = (jshort)((*p) & 0xffff); break; }
753 case T_INT : value_result->i = *(jint*)l_addr; break;
754 case T_LONG : value_result->j = *(jlong*)l_scratch; break;
755 case T_FLOAT : value_result->f = *(jfloat*)d_scratch; break;
756 case T_DOUBLE : value_result->d = *(jdouble*)d_scratch; break;
757 case T_VOID : /* Nothing to do */ break;
758 default : ShouldNotReachHere();
759 }
760 } else {
761 intptr_t* tos_addr = interpreter_frame_tos_address();
762
763 switch(type) {
764 case T_OBJECT:
765 case T_ARRAY: {
766 oop obj = (oop)*tos_addr;
767 assert(obj == NULL || Universe::heap()->is_in(obj), "sanity check");
768 *oop_result = obj;
769 break;
770 }
771 case T_BOOLEAN : { jint* p = (jint*)tos_addr; value_result->z = (jboolean)((*p) & 0x1); break; }
772 case T_BYTE : { jint* p = (jint*)tos_addr; value_result->b = (jbyte)((*p) & 0xff); break; }
773 case T_CHAR : { jint* p = (jint*)tos_addr; value_result->c = (jchar)((*p) & 0xffff); break; }
774 case T_SHORT : { jint* p = (jint*)tos_addr; value_result->s = (jshort)((*p) & 0xffff); break; }
775 case T_INT : value_result->i = *(jint*)tos_addr; break;
776 case T_LONG : value_result->j = *(jlong*)tos_addr; break;
777 case T_FLOAT : value_result->f = *(jfloat*)tos_addr; break;
778 case T_DOUBLE : value_result->d = *(jdouble*)tos_addr; break;
779 case T_VOID : /* Nothing to do */ break;
780 default : ShouldNotReachHere();
781 }
782 };
783
784 return type;
785 }
786
787 // Lesp pointer is one word lower than the top item on the stack.
788 intptr_t* frame::interpreter_frame_tos_at(jint offset) const {
789 int index = (Interpreter::expr_offset_in_bytes(offset)/wordSize) - 1;
790 return &interpreter_frame_tos_address()[index];
791 }