src/share/vm/runtime/deoptimization.cpp

rev 6132 : 8032410: compiler/uncommontrap/TestStackBangRbp.java times out on Solaris-Sparc V9
Summary: make compiled code bang the stack by the worst case size of the interpreter frame at deoptimization points.
Reviewed-by:
rev 6133 : [mq]: newstackbang-reviews

*** 418,436 ****
    int callee_locals = 0;
    for (int index = 0; index < array->frames(); index++ ) {
      // frame[number_of_frames - 1 ] = on_stack_size(youngest)
      // frame[number_of_frames - 2 ] = on_stack_size(sender(youngest))
      // frame[number_of_frames - 3 ] = on_stack_size(sender(sender(youngest)))
!     int caller_parms = callee_parameters;
!     if ((index == array->frames() - 1) && caller_was_method_handle) {
!       caller_parms = 0;
!     }
!     frame_sizes[number_of_frames - 1 - index] = BytesPerWord * array->element(index)->on_stack_size(caller_parms,
!                                                                                                     callee_parameters,
                                                                                                      callee_locals,
                                                                                                      index == 0,
-                                                                                                     index == array->frames() - 1,
                                                                                                      popframe_extra_args);
      // This pc doesn't have to be perfect just good enough to identify the frame
      // as interpreted so the skeleton frame will be walkable
      // The correct pc will be set when the skeleton frame is completely filled out
      // The final pc we store in the loop is wrong and will be overwritten below
--- 418,430 ----
    int callee_locals = 0;
    for (int index = 0; index < array->frames(); index++ ) {
      // frame[number_of_frames - 1 ] = on_stack_size(youngest)
      // frame[number_of_frames - 2 ] = on_stack_size(sender(youngest))
      // frame[number_of_frames - 3 ] = on_stack_size(sender(sender(youngest)))
!     frame_sizes[number_of_frames - 1 - index] = BytesPerWord * array->element(index)->on_stack_size(callee_parameters,
                                                                                                      callee_locals,
                                                                                                      index == 0,
                                                                                                      popframe_extra_args);
      // This pc doesn't have to be perfect just good enough to identify the frame
      // as interpreted so the skeleton frame will be walkable
      // The correct pc will be set when the skeleton frame is completely filled out
      // The final pc we store in the loop is wrong and will be overwritten below