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 // Support abs and sqrt like in compiler.
55 // For others we can use a normal (native) entry.
56 bool AbstractInterpreter::math_entry_available(AbstractInterpreter::MethodKind kind) {
57 if (!InlineIntrinsics) return false;
58
59 return ((kind==Interpreter::java_lang_math_sqrt && VM_Version::has_fsqrt()) ||
60 (kind==Interpreter::java_lang_math_abs));
61 }
62
63 // These should never be compiled since the interpreter will prefer
64 // the compiled version to the intrinsic version.
65 bool AbstractInterpreter::can_be_compiled(methodHandle m) {
66 return !math_entry_available(method_kind(m));
67 }
68
69 // How much stack a method activation needs in stack slots.
70 // We must calc this exactly like in generate_fixed_frame.
71 // Note: This returns the conservative size assuming maximum alignment.
72 int AbstractInterpreter::size_top_interpreter_activation(Method* method) {
73 const int max_alignment_size = 2;
74 const int abi_scratch = frame::abi_reg_args_size;
75 return method->max_locals() + method->max_stack() +
76 frame::interpreter_frame_monitor_size() + max_alignment_size + abi_scratch;
77 }
78
79 // Returns number of stackElementWords needed for the interpreter frame with the
80 // given sections.
81 // This overestimates the stack by one slot in case of alignments.
82 int AbstractInterpreter::size_activation(int max_stack,
83 int temps,
84 int extra_args,
85 int monitors,
86 int callee_params,
87 int callee_locals,
88 bool is_top_frame) {
89 // Note: This calculation must exactly parallel the frame setup
90 // in TemplateInterpreterGenerator::generate_fixed_frame.
91 assert(Interpreter::stackElementWords == 1, "sanity");
92 const int max_alignment_space = StackAlignmentInBytes / Interpreter::stackElementSize;
93 const int abi_scratch = is_top_frame ? (frame::abi_reg_args_size / Interpreter::stackElementSize) :
94 (frame::abi_minframe_size / Interpreter::stackElementSize);
95 const int size =
96 max_stack +
97 (callee_locals - callee_params) +
98 monitors * frame::interpreter_frame_monitor_size() +
99 max_alignment_space +
100 abi_scratch +
101 frame::ijava_state_size / Interpreter::stackElementSize;
102
103 // Fixed size of an interpreter frame, align to 16-byte.
104 return (size & -2);
105 }
106
107 // Fills a sceletal interpreter frame generated during deoptimizations.
108 //
109 // Parameters:
110 //
111 // interpreter_frame != NULL:
112 // set up the method, locals, and monitors.
113 // The frame interpreter_frame, if not NULL, is guaranteed to be the
114 // right size, as determined by a previous call to this method.
115 // It is also guaranteed to be walkable even though it is in a skeletal state
116 //
117 // is_top_frame == true:
118 // We're processing the *oldest* interpreter frame!
119 //
120 // pop_frame_extra_args:
121 // If this is != 0 we are returning to a deoptimized frame by popping
122 // off the callee frame. We want to re-execute the call that called the
123 // callee interpreted, but since the return to the interpreter would pop
124 // the arguments off advance the esp by dummy popframe_extra_args slots.
125 // Popping off those will establish the stack layout as it was before the call.
126 //
127 void AbstractInterpreter::layout_activation(Method* method,
128 int tempcount,
129 int popframe_extra_args,
130 int moncount,
131 int caller_actual_parameters,
132 int callee_param_count,
133 int callee_locals_count,
134 frame* caller,
135 frame* interpreter_frame,
136 bool is_top_frame,
137 bool is_bottom_frame) {
138
139 const int abi_scratch = is_top_frame ? (frame::abi_reg_args_size / Interpreter::stackElementSize) :
140 (frame::abi_minframe_size / Interpreter::stackElementSize);
141
142 intptr_t* locals_base = (caller->is_interpreted_frame()) ?
143 caller->interpreter_frame_esp() + caller_actual_parameters :
144 caller->sp() + method->max_locals() - 1 + (frame::abi_minframe_size / Interpreter::stackElementSize);
145
146 intptr_t* monitor_base = caller->sp() - frame::ijava_state_size / Interpreter::stackElementSize;
147 intptr_t* monitor = monitor_base - (moncount * frame::interpreter_frame_monitor_size());
148 intptr_t* esp_base = monitor - 1;
149 intptr_t* esp = esp_base - tempcount - popframe_extra_args;
150 intptr_t* sp = (intptr_t *) (((intptr_t) (esp_base - callee_locals_count + callee_param_count - method->max_stack()- abi_scratch)) & -StackAlignmentInBytes);
151 intptr_t* sender_sp = caller->sp() + (frame::abi_minframe_size - frame::abi_reg_args_size) / Interpreter::stackElementSize;
152 intptr_t* top_frame_sp = is_top_frame ? sp : sp + (frame::abi_minframe_size - frame::abi_reg_args_size) / Interpreter::stackElementSize;
153
154 interpreter_frame->interpreter_frame_set_method(method);
155 interpreter_frame->interpreter_frame_set_mirror(method->method_holder()->java_mirror());
156 interpreter_frame->interpreter_frame_set_locals(locals_base);
157 interpreter_frame->interpreter_frame_set_cpcache(method->constants()->cache());
158 interpreter_frame->interpreter_frame_set_esp(esp);
159 interpreter_frame->interpreter_frame_set_monitor_end((BasicObjectLock *)monitor);
160 interpreter_frame->interpreter_frame_set_top_frame_sp(top_frame_sp);
161 if (!is_bottom_frame) {
162 interpreter_frame->interpreter_frame_set_sender_sp(sender_sp);
163 }
164 }