1 /*
2 * Copyright (c) 1997, 2010, 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 #ifndef CPU_AARCH64_VM_FRAME_AARCH64_INLINE_HPP
27 #define CPU_AARCH64_VM_FRAME_AARCH64_INLINE_HPP
28
29 #include "code/codeCache.hpp"
30 #include "code/vmreg.inline.hpp"
31
32 // Inline functions for AArch64 frames:
33
34 // Constructors:
35
36 inline frame::frame() {
37 _pc = NULL;
38 _sp = NULL;
39 _unextended_sp = NULL;
40 _fp = NULL;
41 _cb = NULL;
42 _deopt_state = unknown;
43 }
44
45 static int spin;
46
47 inline void frame::init(intptr_t* sp, intptr_t* fp, address pc) {
48 intptr_t a = intptr_t(sp);
49 intptr_t b = intptr_t(fp);
50 #ifndef PRODUCT
51 if (fp)
52 if (sp > fp || (fp - sp > 0x100000))
53 for(;;)
54 asm("nop");
55 #endif
56 _sp = sp;
57 _unextended_sp = sp;
58 _fp = fp;
59 _pc = pc;
60 assert(pc != NULL, "no pc?");
61 _cb = CodeCache::find_blob(pc);
62 adjust_unextended_sp();
63
64 address original_pc = nmethod::get_deopt_original_pc(this);
65 if (original_pc != NULL) {
66 _pc = original_pc;
67 _deopt_state = is_deoptimized;
68 } else {
69 _deopt_state = not_deoptimized;
70 }
71 }
72
73 inline frame::frame(intptr_t* sp, intptr_t* fp, address pc) {
74 init(sp, fp, pc);
75 }
76
77 inline frame::frame(intptr_t* sp, intptr_t* unextended_sp, intptr_t* fp, address pc) {
78 intptr_t a = intptr_t(sp);
79 intptr_t b = intptr_t(fp);
80 #ifndef PRODUCT
81 if (fp)
82 if (sp > fp || (fp - sp > 0x100000))
83 for(;;)
84 asm("nop");
85 #endif
86 _sp = sp;
87 _unextended_sp = unextended_sp;
88 _fp = fp;
89 _pc = pc;
90 assert(pc != NULL, "no pc?");
91 _cb = CodeCache::find_blob(pc);
92 adjust_unextended_sp();
93
94 address original_pc = nmethod::get_deopt_original_pc(this);
95 if (original_pc != NULL) {
96 _pc = original_pc;
97 assert(((nmethod*)_cb)->insts_contains(_pc), "original PC must be in nmethod");
98 _deopt_state = is_deoptimized;
99 } else {
100 _deopt_state = not_deoptimized;
101 }
102 }
103
104 inline frame::frame(intptr_t* sp, intptr_t* fp) {
105 intptr_t a = intptr_t(sp);
106 intptr_t b = intptr_t(fp);
107 #ifndef PRODUCT
108 if (fp)
109 if (sp > fp || (fp - sp > 0x100000))
110 for(;;)
111 asm("nop");
112 #endif
113 _sp = sp;
114 _unextended_sp = sp;
115 _fp = fp;
116 _pc = (address)(sp[-1]);
117
118 // Here's a sticky one. This constructor can be called via AsyncGetCallTrace
119 // when last_Java_sp is non-null but the pc fetched is junk. If we are truly
120 // unlucky the junk value could be to a zombied method and we'll die on the
121 // find_blob call. This is also why we can have no asserts on the validity
122 // of the pc we find here. AsyncGetCallTrace -> pd_get_top_frame_for_signal_handler
123 // -> pd_last_frame should use a specialized version of pd_last_frame which could
124 // call a specilaized frame constructor instead of this one.
125 // Then we could use the assert below. However this assert is of somewhat dubious
126 // value.
127 // assert(_pc != NULL, "no pc?");
128
129 _cb = CodeCache::find_blob(_pc);
130 adjust_unextended_sp();
131
132 address original_pc = nmethod::get_deopt_original_pc(this);
133 if (original_pc != NULL) {
134 _pc = original_pc;
135 _deopt_state = is_deoptimized;
136 } else {
137 _deopt_state = not_deoptimized;
138 }
139 }
140
141 // Accessors
142
143 inline bool frame::equal(frame other) const {
144 bool ret = sp() == other.sp()
145 && unextended_sp() == other.unextended_sp()
146 && fp() == other.fp()
147 && pc() == other.pc();
148 assert(!ret || ret && cb() == other.cb() && _deopt_state == other._deopt_state, "inconsistent construction");
149 return ret;
150 }
151
152 // Return unique id for this frame. The id must have a value where we can distinguish
153 // identity and younger/older relationship. NULL represents an invalid (incomparable)
154 // frame.
155 inline intptr_t* frame::id(void) const { return unextended_sp(); }
156
157 // Relationals on frames based
158 // Return true if the frame is younger (more recent activation) than the frame represented by id
159 inline bool frame::is_younger(intptr_t* id) const { assert(this->id() != NULL && id != NULL, "NULL frame id");
160 return this->id() < id ; }
161
162 // Return true if the frame is older (less recent activation) than the frame represented by id
163 inline bool frame::is_older(intptr_t* id) const { assert(this->id() != NULL && id != NULL, "NULL frame id");
164 return this->id() > id ; }
165
166
167
168 inline intptr_t* frame::link() const { return (intptr_t*) *(intptr_t **)addr_at(link_offset); }
169 inline void frame::set_link(intptr_t* addr) { *(intptr_t **)addr_at(link_offset) = addr; }
170
171
172 inline intptr_t* frame::unextended_sp() const { return _unextended_sp; }
173
174 // Return address:
175
176 inline address* frame::sender_pc_addr() const { return (address*) addr_at( return_addr_offset); }
177 inline address frame::sender_pc() const { return *sender_pc_addr(); }
178
179 // return address of param, zero origin index.
180 inline address* frame::native_param_addr(int idx) const { return (address*) addr_at( native_frame_initial_param_offset+idx); }
181
182 #ifdef CC_INTERP
183
184 inline interpreterState frame::get_interpreterState() const {
185 return ((interpreterState)addr_at( -((int)sizeof(BytecodeInterpreter))/wordSize ));
186 }
187
188 inline intptr_t* frame::sender_sp() const {
189 // Hmm this seems awfully expensive QQQ, is this really called with interpreted frames?
190 if (is_interpreted_frame()) {
191 assert(false, "should never happen");
192 return get_interpreterState()->sender_sp();
193 } else {
194 return addr_at(sender_sp_offset);
195 }
196 }
197
198 inline intptr_t** frame::interpreter_frame_locals_addr() const {
199 assert(is_interpreted_frame(), "must be interpreted");
200 return &(get_interpreterState()->_locals);
201 }
202
203 inline intptr_t* frame::interpreter_frame_bcx_addr() const {
204 assert(is_interpreted_frame(), "must be interpreted");
205 return (intptr_t*) &(get_interpreterState()->_bcp);
206 }
207
208
209 // Constant pool cache
210
211 inline constantPoolCacheOop* frame::interpreter_frame_cache_addr() const {
212 assert(is_interpreted_frame(), "must be interpreted");
213 return &(get_interpreterState()->_constants);
214 }
215
216 // Method
217
218 inline methodOop* frame::interpreter_frame_method_addr() const {
219 assert(is_interpreted_frame(), "must be interpreted");
220 return &(get_interpreterState()->_method);
221 }
222
223 inline intptr_t* frame::interpreter_frame_mdx_addr() const {
224 assert(is_interpreted_frame(), "must be interpreted");
225 return (intptr_t*) &(get_interpreterState()->_mdx);
226 }
227
228 // top of expression stack
229 inline intptr_t* frame::interpreter_frame_tos_address() const {
230 assert(is_interpreted_frame(), "wrong frame type");
231 return get_interpreterState()->_stack + 1;
232 }
233
234 #else /* asm interpreter */
235 inline intptr_t* frame::sender_sp() const { return addr_at( sender_sp_offset); }
236
237 inline intptr_t** frame::interpreter_frame_locals_addr() const {
238 return (intptr_t**)addr_at(interpreter_frame_locals_offset);
239 }
240
241 inline intptr_t* frame::interpreter_frame_last_sp() const {
242 return *(intptr_t**)addr_at(interpreter_frame_last_sp_offset);
243 }
244
245 inline intptr_t* frame::interpreter_frame_bcp_addr() const {
246 return (intptr_t*)addr_at(interpreter_frame_bcp_offset);
247 }
248
249 inline intptr_t* frame::interpreter_frame_mdp_addr() const {
250 return (intptr_t*)addr_at(interpreter_frame_mdp_offset);
251 }
252
253
254 // Constant pool cache
255
256 inline ConstantPoolCache** frame::interpreter_frame_cache_addr() const {
257 return (ConstantPoolCache**)addr_at(interpreter_frame_cache_offset);
258 }
259
260 // Method
261
262 inline Method** frame::interpreter_frame_method_addr() const {
263 return (Method**)addr_at(interpreter_frame_method_offset);
264 }
265
266 // top of expression stack
267 inline intptr_t* frame::interpreter_frame_tos_address() const {
268 intptr_t* last_sp = interpreter_frame_last_sp();
269 if (last_sp == NULL) {
270 return sp();
271 } else {
272 // sp() may have been extended or shrunk by an adapter. At least
273 // check that we don't fall behind the legal region.
274 // For top deoptimized frame last_sp == interpreter_frame_monitor_end.
275 assert(last_sp <= (intptr_t*) interpreter_frame_monitor_end(), "bad tos");
276 return last_sp;
277 }
278 }
279
280 inline oop* frame::interpreter_frame_temp_oop_addr() const {
281 return (oop *)(fp() + interpreter_frame_oop_temp_offset);
282 }
283
284 #endif /* CC_INTERP */
285
286 inline int frame::pd_oop_map_offset_adjustment() const {
287 return 0;
288 }
289
290 inline int frame::interpreter_frame_monitor_size() {
291 return BasicObjectLock::size();
292 }
293
294
295 // expression stack
296 // (the max_stack arguments are used by the GC; see class FrameClosure)
297
298 inline intptr_t* frame::interpreter_frame_expression_stack() const {
299 intptr_t* monitor_end = (intptr_t*) interpreter_frame_monitor_end();
300 return monitor_end-1;
301 }
302
303
304 inline jint frame::interpreter_frame_expression_stack_direction() { return -1; }
305
306
307 // Entry frames
308
309 inline JavaCallWrapper** frame::entry_frame_call_wrapper_addr() const {
310 return (JavaCallWrapper**)addr_at(entry_frame_call_wrapper_offset);
311 }
312
313
314 // Compiled frames
315
316 inline int frame::local_offset_for_compiler(int local_index, int nof_args, int max_nof_locals, int max_nof_monitors) {
317 return (nof_args - local_index + (local_index < nof_args ? 1: -1));
318 }
319
320 inline int frame::monitor_offset_for_compiler(int local_index, int nof_args, int max_nof_locals, int max_nof_monitors) {
321 return local_offset_for_compiler(local_index, nof_args, max_nof_locals, max_nof_monitors);
322 }
323
324 inline int frame::min_local_offset_for_compiler(int nof_args, int max_nof_locals, int max_nof_monitors) {
325 return (nof_args - (max_nof_locals + max_nof_monitors*2) - 1);
326 }
327
328 inline bool frame::volatile_across_calls(Register reg) {
329 return true;
330 }
331
332
333
334 inline oop frame::saved_oop_result(RegisterMap* map) const {
335 oop* result_adr = (oop *)map->location(r0->as_VMReg());
336 guarantee(result_adr != NULL, "bad register save location");
337
338 return (*result_adr);
339 }
340
341 inline void frame::set_saved_oop_result(RegisterMap* map, oop obj) {
342 oop* result_adr = (oop *)map->location(r0->as_VMReg());
343 guarantee(result_adr != NULL, "bad register save location");
344
345 *result_adr = obj;
346 }
347
348 #endif // CPU_AARCH64_VM_FRAME_AARCH64_INLINE_HPP