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