1 /* 2 * Copyright (c) 2014, 2016, Oracle and/or its affiliates. All rights reserved. 3 * Copyright (c) 2015 SAP SE. 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 int AbstractInterpreter::BasicType_as_index(BasicType type) { 35 int i = 0; 36 switch (type) { 37 case T_BOOLEAN: i = 0; break; 38 case T_CHAR : i = 1; break; 39 case T_BYTE : i = 2; break; 40 case T_SHORT : i = 3; break; 41 case T_INT : i = 4; break; 42 case T_LONG : i = 5; break; 43 case T_VOID : i = 6; break; 44 case T_FLOAT : i = 7; break; 45 case T_DOUBLE : i = 8; break; 46 case T_OBJECT : i = 9; break; 47 case T_ARRAY : i = 9; break; 48 default : ShouldNotReachHere(); 49 } 50 assert(0 <= i && i < AbstractInterpreter::number_of_result_handlers, "index out of bounds"); 51 return i; 52 } 53 54 // These should never be compiled since the interpreter will prefer 55 // the compiled version to the intrinsic version. 56 bool AbstractInterpreter::can_be_compiled(methodHandle m) { 57 switch (method_kind(m)) { 58 case Interpreter::java_lang_math_sin : // fall thru 59 case Interpreter::java_lang_math_cos : // fall thru 60 case Interpreter::java_lang_math_tan : // fall thru 61 case Interpreter::java_lang_math_abs : // fall thru 62 case Interpreter::java_lang_math_log : // fall thru 63 case Interpreter::java_lang_math_log10 : // fall thru 64 case Interpreter::java_lang_math_sqrt : // fall thru 65 case Interpreter::java_lang_math_pow : // fall thru 66 case Interpreter::java_lang_math_exp : // fall thru 67 case Interpreter::java_lang_math_fmaD : // fall thru 68 case Interpreter::java_lang_math_fmaF : 69 return false; 70 default: 71 return true; 72 } 73 } 74 75 // How much stack a method activation needs in stack slots. 76 // We must calc this exactly like in generate_fixed_frame. 77 // Note: This returns the conservative size assuming maximum alignment. 78 int AbstractInterpreter::size_top_interpreter_activation(Method* method) { 79 const int max_alignment_size = 2; 80 const int abi_scratch = frame::abi_reg_args_size; 81 return method->max_locals() + method->max_stack() + 82 frame::interpreter_frame_monitor_size() + max_alignment_size + abi_scratch; 83 } 84 85 // Returns number of stackElementWords needed for the interpreter frame with the 86 // given sections. 87 // This overestimates the stack by one slot in case of alignments. 88 int AbstractInterpreter::size_activation(int max_stack, 89 int temps, 90 int extra_args, 91 int monitors, 92 int callee_params, 93 int callee_locals, 94 bool is_top_frame) { 95 // Note: This calculation must exactly parallel the frame setup 96 // in TemplateInterpreterGenerator::generate_fixed_frame. 97 assert(Interpreter::stackElementWords == 1, "sanity"); 98 const int max_alignment_space = StackAlignmentInBytes / Interpreter::stackElementSize; 99 const int abi_scratch = is_top_frame ? (frame::abi_reg_args_size / Interpreter::stackElementSize) : 100 (frame::abi_minframe_size / Interpreter::stackElementSize); 101 const int size = 102 max_stack + 103 (callee_locals - callee_params) + 104 monitors * frame::interpreter_frame_monitor_size() + 105 max_alignment_space + 106 abi_scratch + 107 frame::ijava_state_size / Interpreter::stackElementSize; 108 109 // Fixed size of an interpreter frame, align to 16-byte. 110 return (size & -2); 111 } 112 113 // Fills a sceletal interpreter frame generated during deoptimizations. 114 // 115 // Parameters: 116 // 117 // interpreter_frame != NULL: 118 // set up the method, locals, and monitors. 119 // The frame interpreter_frame, if not NULL, is guaranteed to be the 120 // right size, as determined by a previous call to this method. 121 // It is also guaranteed to be walkable even though it is in a skeletal state 122 // 123 // is_top_frame == true: 124 // We're processing the *oldest* interpreter frame! 125 // 126 // pop_frame_extra_args: 127 // If this is != 0 we are returning to a deoptimized frame by popping 128 // off the callee frame. We want to re-execute the call that called the 129 // callee interpreted, but since the return to the interpreter would pop 130 // the arguments off advance the esp by dummy popframe_extra_args slots. 131 // Popping off those will establish the stack layout as it was before the call. 132 // 133 void AbstractInterpreter::layout_activation(Method* method, 134 int tempcount, 135 int popframe_extra_args, 136 int moncount, 137 int caller_actual_parameters, 138 int callee_param_count, 139 int callee_locals_count, 140 frame* caller, 141 frame* interpreter_frame, 142 bool is_top_frame, 143 bool is_bottom_frame) { 144 145 const int abi_scratch = is_top_frame ? (frame::abi_reg_args_size / Interpreter::stackElementSize) : 146 (frame::abi_minframe_size / Interpreter::stackElementSize); 147 148 intptr_t* locals_base = (caller->is_interpreted_frame()) ? 149 caller->interpreter_frame_esp() + caller_actual_parameters : 150 caller->sp() + method->max_locals() - 1 + (frame::abi_minframe_size / Interpreter::stackElementSize); 151 152 intptr_t* monitor_base = caller->sp() - frame::ijava_state_size / Interpreter::stackElementSize; 153 intptr_t* monitor = monitor_base - (moncount * frame::interpreter_frame_monitor_size()); 154 intptr_t* esp_base = monitor - 1; 155 intptr_t* esp = esp_base - tempcount - popframe_extra_args; 156 intptr_t* sp = (intptr_t *) (((intptr_t) (esp_base - callee_locals_count + callee_param_count - method->max_stack()- abi_scratch)) & -StackAlignmentInBytes); 157 intptr_t* sender_sp = caller->sp() + (frame::abi_minframe_size - frame::abi_reg_args_size) / Interpreter::stackElementSize; 158 intptr_t* top_frame_sp = is_top_frame ? sp : sp + (frame::abi_minframe_size - frame::abi_reg_args_size) / Interpreter::stackElementSize; 159 160 interpreter_frame->interpreter_frame_set_method(method); 161 interpreter_frame->interpreter_frame_set_mirror(method->method_holder()->java_mirror()); 162 interpreter_frame->interpreter_frame_set_locals(locals_base); 163 interpreter_frame->interpreter_frame_set_cpcache(method->constants()->cache()); 164 interpreter_frame->interpreter_frame_set_esp(esp); 165 interpreter_frame->interpreter_frame_set_monitor_end((BasicObjectLock *)monitor); 166 interpreter_frame->interpreter_frame_set_top_frame_sp(top_frame_sp); 167 if (!is_bottom_frame) { 168 interpreter_frame->interpreter_frame_set_sender_sp(sender_sp); 169 } 170 }