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