Lines Matching refs:frame

61 // interpreter frame we will be creating to replace vf
161 frame* caller,
179 assert(is_top_frame, "reexecute allowed only for the top frame");
201 assert(*bcp != Bytecodes::_monitorenter || is_top_frame, "a _monitorenter must be a top frame");
215 // Pop top frame after deoptimization
220 // to pop frame and preserve the args
225 // Reexecute invoke in top frame
234 // Force early return from top frame after deoptimization
241 // Possibly override the previous pc computation of the top (youngest) frame
265 // Setup the interpreter frame
284 // Update the pc in the frame object and overwrite the temporary pc
285 // we placed in the skeletal frame now that we finally know the
302 iframe()->interpreter_frame_set_bcx((intptr_t)bcp); // cannot use bcp because frame is not initialized yet
314 // If this is an intermediate frame (i.e. not top frame) then this
360 // An interpreted frame was popped but it returns to a deoptimized
361 // frame. The incoming arguments to the interpreted activation
364 // we put them back into the just-unpacked interpreter frame.
377 if (frame::interpreter_frame_expression_stack_direction() < 0) {
446 RegisterMap *reg_map, frame sender, frame caller, frame self) {
480 // frame::oopmapreg_to_location does.
508 void vframeArray::unpack_to_stack(frame &unpack_frame, int exec_mode, int caller_actual_parameters) {
520 // Get the youngest frame we will unpack (last to be unpacked)
521 frame me = unpack_frame.sender(&map);
525 // Get the caller frame (possibly skeletal)
529 // Do the unpacking of interpreter frames; the frame at index 0 represents the top activation, so it has no callee
531 frame* caller_frame = &me;
606 st->print_cr(" - frame size: %d", frame_size());