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