rev 13183 : 8183232: Avoid resolving method_kind in AbstractInterpreter::can_be_compiled
Reviewed-by: coleenp, mdoerr, neliasso

   1 /*
   2  * Copyright (c) 2003, 2017, Oracle and/or its affiliates. All rights reserved.
   3  * Copyright (c) 2014, Red Hat Inc. 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 #include "interpreter/interpreter.hpp"
  28 #include "oops/constMethod.hpp"
  29 #include "oops/method.hpp"
  30 #include "runtime/frame.inline.hpp"
  31 #include "utilities/debug.hpp"
  32 #include "utilities/macros.hpp"
  33 
  34 
  35 int AbstractInterpreter::BasicType_as_index(BasicType type) {
  36   int i = 0;
  37   switch (type) {
  38     case T_BOOLEAN: i = 0; break;
  39     case T_CHAR   : i = 1; break;
  40     case T_BYTE   : i = 2; break;
  41     case T_SHORT  : i = 3; break;
  42     case T_INT    : i = 4; break;
  43     case T_LONG   : i = 5; break;
  44     case T_VOID   : i = 6; break;
  45     case T_FLOAT  : i = 7; break;
  46     case T_DOUBLE : i = 8; break;
  47     case T_OBJECT : i = 9; break;
  48     case T_ARRAY  : i = 9; break;
  49     default       : ShouldNotReachHere();
  50   }
  51   assert(0 <= i && i < AbstractInterpreter::number_of_result_handlers,
  52          "index out of bounds");
  53   return i;





















  54 }
  55 
  56 // How much stack a method activation needs in words.
  57 int AbstractInterpreter::size_top_interpreter_activation(Method* method) {
  58   const int entry_size = frame::interpreter_frame_monitor_size();
  59 
  60   // total overhead size: entry_size + (saved rfp thru expr stack
  61   // bottom).  be sure to change this if you add/subtract anything
  62   // to/from the overhead area
  63   const int overhead_size =
  64     -(frame::interpreter_frame_initial_sp_offset) + entry_size;
  65 
  66   const int stub_code = frame::entry_frame_after_call_words;
  67   const int method_stack = (method->max_locals() + method->max_stack()) *
  68                            Interpreter::stackElementWords;
  69   return (overhead_size + method_stack + stub_code);
  70 }
  71 
  72 // asm based interpreter deoptimization helpers
  73 int AbstractInterpreter::size_activation(int max_stack,
  74                                          int temps,
  75                                          int extra_args,
  76                                          int monitors,
  77                                          int callee_params,
  78                                          int callee_locals,
  79                                          bool is_top_frame) {
  80   // Note: This calculation must exactly parallel the frame setup
  81   // in TemplateInterpreterGenerator::generate_method_entry.
  82 
  83   // fixed size of an interpreter frame:
  84   int overhead = frame::sender_sp_offset -
  85                  frame::interpreter_frame_initial_sp_offset;
  86   // Our locals were accounted for by the caller (or last_frame_adjust
  87   // on the transistion) Since the callee parameters already account
  88   // for the callee's params we only need to account for the extra
  89   // locals.
  90   int size = overhead +
  91          (callee_locals - callee_params) +
  92          monitors * frame::interpreter_frame_monitor_size() +
  93          // On the top frame, at all times SP <= ESP, and SP is
  94          // 16-aligned.  We ensure this by adjusting SP on method
  95          // entry and re-entry to allow room for the maximum size of
  96          // the expression stack.  When we call another method we bump
  97          // SP so that no stack space is wasted.  So, only on the top
  98          // frame do we need to allow max_stack words.
  99          (is_top_frame ? max_stack : temps + extra_args);
 100 
 101   // On AArch64 we always keep the stack pointer 16-aligned, so we
 102   // must round up here.
 103   size = round_to(size, 2);
 104 
 105   return size;
 106 }
 107 
 108 void AbstractInterpreter::layout_activation(Method* method,
 109                                             int tempcount,
 110                                             int popframe_extra_args,
 111                                             int moncount,
 112                                             int caller_actual_parameters,
 113                                             int callee_param_count,
 114                                             int callee_locals,
 115                                             frame* caller,
 116                                             frame* interpreter_frame,
 117                                             bool is_top_frame,
 118                                             bool is_bottom_frame) {
 119   // The frame interpreter_frame is guaranteed to be the right size,
 120   // as determined by a previous call to the size_activation() method.
 121   // It is also guaranteed to be walkable even though it is in a
 122   // skeletal state
 123 
 124   int max_locals = method->max_locals() * Interpreter::stackElementWords;
 125   int extra_locals = (method->max_locals() - method->size_of_parameters()) *
 126     Interpreter::stackElementWords;
 127 
 128 #ifdef ASSERT
 129   assert(caller->sp() == interpreter_frame->sender_sp(), "Frame not properly walkable");
 130 #endif
 131 
 132   interpreter_frame->interpreter_frame_set_method(method);
 133   // NOTE the difference in using sender_sp and
 134   // interpreter_frame_sender_sp interpreter_frame_sender_sp is
 135   // the original sp of the caller (the unextended_sp) and
 136   // sender_sp is fp+8/16 (32bit/64bit) XXX
 137   intptr_t* locals = interpreter_frame->sender_sp() + max_locals - 1;
 138 
 139 #ifdef ASSERT
 140   if (caller->is_interpreted_frame()) {
 141     assert(locals < caller->fp() + frame::interpreter_frame_initial_sp_offset, "bad placement");
 142   }
 143 #endif
 144 
 145   interpreter_frame->interpreter_frame_set_locals(locals);
 146   BasicObjectLock* montop = interpreter_frame->interpreter_frame_monitor_begin();
 147   BasicObjectLock* monbot = montop - moncount;
 148   interpreter_frame->interpreter_frame_set_monitor_end(monbot);
 149 
 150   // Set last_sp
 151   intptr_t*  esp = (intptr_t*) monbot -
 152     tempcount*Interpreter::stackElementWords -
 153     popframe_extra_args;
 154   interpreter_frame->interpreter_frame_set_last_sp(esp);
 155 
 156   // All frames but the initial (oldest) interpreter frame we fill in have
 157   // a value for sender_sp that allows walking the stack but isn't
 158   // truly correct. Correct the value here.
 159   if (extra_locals != 0 &&
 160       interpreter_frame->sender_sp() ==
 161       interpreter_frame->interpreter_frame_sender_sp()) {
 162     interpreter_frame->set_interpreter_frame_sender_sp(caller->sp() +
 163                                                        extra_locals);
 164   }
 165   *interpreter_frame->interpreter_frame_cache_addr() =
 166     method->constants()->cache();
 167   *interpreter_frame->interpreter_frame_mirror_addr() =
 168     method->method_holder()->java_mirror();
 169 }
--- EOF ---