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