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 // Size of interpreter code. Increase if too small. Interpreter will |
|
35 // fail with a guarantee ("not enough space for interpreter generation"); |
|
36 // if too small. |
|
37 // Run with +PrintInterpreter to get the VM to print out the size. |
|
38 // Max size with JVMTI |
|
39 int TemplateInterpreter::InterpreterCodeSize = 200 * 1024; |
|
40 |
|
41 int AbstractInterpreter::BasicType_as_index(BasicType type) { |
|
42 int i = 0; |
|
43 switch (type) { |
|
44 case T_BOOLEAN: i = 0; break; |
|
45 case T_CHAR : i = 1; break; |
|
46 case T_BYTE : i = 2; break; |
|
47 case T_SHORT : i = 3; break; |
|
48 case T_INT : i = 4; break; |
|
49 case T_LONG : i = 5; break; |
|
50 case T_VOID : i = 6; break; |
|
51 case T_FLOAT : i = 7; break; |
|
52 case T_DOUBLE : i = 8; break; |
|
53 case T_OBJECT : i = 9; break; |
|
54 case T_ARRAY : i = 9; break; |
|
55 default : ShouldNotReachHere(); |
|
56 } |
|
57 assert(0 <= i && i < AbstractInterpreter::number_of_result_handlers, |
|
58 "index out of bounds"); |
|
59 return i; |
|
60 } |
|
61 |
|
62 // These should never be compiled since the interpreter will prefer |
|
63 // the compiled version to the intrinsic version. |
|
64 bool AbstractInterpreter::can_be_compiled(methodHandle m) { |
|
65 switch (method_kind(m)) { |
|
66 case Interpreter::java_lang_math_sin : // fall thru |
|
67 case Interpreter::java_lang_math_cos : // fall thru |
|
68 case Interpreter::java_lang_math_tan : // fall thru |
|
69 case Interpreter::java_lang_math_abs : // fall thru |
|
70 case Interpreter::java_lang_math_log : // fall thru |
|
71 case Interpreter::java_lang_math_log10 : // fall thru |
|
72 case Interpreter::java_lang_math_sqrt : // fall thru |
|
73 case Interpreter::java_lang_math_pow : // fall thru |
|
74 case Interpreter::java_lang_math_exp : |
|
75 return false; |
|
76 default: |
|
77 return true; |
|
78 } |
|
79 } |
|
80 |
|
81 // How much stack a method activation needs in words. |
|
82 int AbstractInterpreter::size_top_interpreter_activation(Method* method) { |
|
83 const int entry_size = frame::interpreter_frame_monitor_size(); |
|
84 |
|
85 // total overhead size: entry_size + (saved rfp thru expr stack |
|
86 // bottom). be sure to change this if you add/subtract anything |
|
87 // to/from the overhead area |
|
88 const int overhead_size = |
|
89 -(frame::interpreter_frame_initial_sp_offset) + entry_size; |
|
90 |
|
91 const int stub_code = frame::entry_frame_after_call_words; |
|
92 const int method_stack = (method->max_locals() + method->max_stack()) * |
|
93 Interpreter::stackElementWords; |
|
94 return (overhead_size + method_stack + stub_code); |
|
95 } |
|
96 |
|
97 // asm based interpreter deoptimization helpers |
|
98 int AbstractInterpreter::size_activation(int max_stack, |
|
99 int temps, |
|
100 int extra_args, |
|
101 int monitors, |
|
102 int callee_params, |
|
103 int callee_locals, |
|
104 bool is_top_frame) { |
|
105 // Note: This calculation must exactly parallel the frame setup |
|
106 // in TemplateInterpreterGenerator::generate_method_entry. |
|
107 |
|
108 // fixed size of an interpreter frame: |
|
109 int overhead = frame::sender_sp_offset - |
|
110 frame::interpreter_frame_initial_sp_offset; |
|
111 // Our locals were accounted for by the caller (or last_frame_adjust |
|
112 // on the transistion) Since the callee parameters already account |
|
113 // for the callee's params we only need to account for the extra |
|
114 // locals. |
|
115 int size = overhead + |
|
116 (callee_locals - callee_params)*Interpreter::stackElementWords + |
|
117 monitors * frame::interpreter_frame_monitor_size() + |
|
118 temps* Interpreter::stackElementWords + extra_args; |
|
119 |
|
120 // On AArch64 we always keep the stack pointer 16-aligned, so we |
|
121 // must round up here. |
|
122 size = round_to(size, 2); |
|
123 |
|
124 return size; |
|
125 } |
|
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, |
|
134 frame* caller, |
|
135 frame* interpreter_frame, |
|
136 bool is_top_frame, |
|
137 bool is_bottom_frame) { |
|
138 // The frame interpreter_frame is guaranteed to be the right size, |
|
139 // as determined by a previous call to the size_activation() method. |
|
140 // It is also guaranteed to be walkable even though it is in a |
|
141 // skeletal state |
|
142 |
|
143 int max_locals = method->max_locals() * Interpreter::stackElementWords; |
|
144 int extra_locals = (method->max_locals() - method->size_of_parameters()) * |
|
145 Interpreter::stackElementWords; |
|
146 |
|
147 #ifdef ASSERT |
|
148 assert(caller->sp() == interpreter_frame->sender_sp(), "Frame not properly walkable"); |
|
149 #endif |
|
150 |
|
151 interpreter_frame->interpreter_frame_set_method(method); |
|
152 // NOTE the difference in using sender_sp and |
|
153 // interpreter_frame_sender_sp interpreter_frame_sender_sp is |
|
154 // the original sp of the caller (the unextended_sp) and |
|
155 // sender_sp is fp+8/16 (32bit/64bit) XXX |
|
156 intptr_t* locals = interpreter_frame->sender_sp() + max_locals - 1; |
|
157 |
|
158 #ifdef ASSERT |
|
159 if (caller->is_interpreted_frame()) { |
|
160 assert(locals < caller->fp() + frame::interpreter_frame_initial_sp_offset, "bad placement"); |
|
161 } |
|
162 #endif |
|
163 |
|
164 interpreter_frame->interpreter_frame_set_locals(locals); |
|
165 BasicObjectLock* montop = interpreter_frame->interpreter_frame_monitor_begin(); |
|
166 BasicObjectLock* monbot = montop - moncount; |
|
167 interpreter_frame->interpreter_frame_set_monitor_end(monbot); |
|
168 |
|
169 // Set last_sp |
|
170 intptr_t* esp = (intptr_t*) monbot - |
|
171 tempcount*Interpreter::stackElementWords - |
|
172 popframe_extra_args; |
|
173 interpreter_frame->interpreter_frame_set_last_sp(esp); |
|
174 |
|
175 // All frames but the initial (oldest) interpreter frame we fill in have |
|
176 // a value for sender_sp that allows walking the stack but isn't |
|
177 // truly correct. Correct the value here. |
|
178 if (extra_locals != 0 && |
|
179 interpreter_frame->sender_sp() == |
|
180 interpreter_frame->interpreter_frame_sender_sp()) { |
|
181 interpreter_frame->set_interpreter_frame_sender_sp(caller->sp() + |
|
182 extra_locals); |
|
183 } |
|
184 *interpreter_frame->interpreter_frame_cache_addr() = |
|
185 method->constants()->cache(); |
|
186 } |
|