42664
|
1 |
/*
|
|
2 |
* Copyright (c) 2008, 2016, Oracle and/or its affiliates. All rights reserved.
|
|
3 |
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
|
|
4 |
*
|
|
5 |
* This code is free software; you can redistribute it and/or modify it
|
|
6 |
* under the terms of the GNU General Public License version 2 only, as
|
|
7 |
* published by the Free Software Foundation.
|
|
8 |
*
|
|
9 |
* This code is distributed in the hope that it will be useful, but WITHOUT
|
|
10 |
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
|
11 |
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
|
12 |
* version 2 for more details (a copy is included in the LICENSE file that
|
|
13 |
* accompanied this code).
|
|
14 |
*
|
|
15 |
* You should have received a copy of the GNU General Public License version
|
|
16 |
* 2 along with this work; if not, write to the Free Software Foundation,
|
|
17 |
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
|
|
18 |
*
|
|
19 |
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
|
|
20 |
* or visit www.oracle.com if you need additional information or have any
|
|
21 |
* questions.
|
|
22 |
*
|
|
23 |
*/
|
|
24 |
|
|
25 |
#ifndef CPU_ARM_VM_FRAME_ARM_INLINE_HPP
|
|
26 |
#define CPU_ARM_VM_FRAME_ARM_INLINE_HPP
|
|
27 |
|
|
28 |
#include "code/codeCache.hpp"
|
|
29 |
#include "code/vmreg.inline.hpp"
|
|
30 |
|
|
31 |
// Inline functions for ARM frames:
|
|
32 |
|
|
33 |
// Constructors:
|
|
34 |
|
|
35 |
inline frame::frame() {
|
|
36 |
_pc = NULL;
|
|
37 |
_sp = NULL;
|
|
38 |
_unextended_sp = NULL;
|
|
39 |
_fp = NULL;
|
|
40 |
_cb = NULL;
|
|
41 |
_deopt_state = unknown;
|
|
42 |
}
|
|
43 |
|
|
44 |
inline void frame::init(intptr_t* sp, intptr_t* fp, address pc) {
|
|
45 |
_sp = sp;
|
|
46 |
_unextended_sp = sp;
|
|
47 |
_fp = fp;
|
|
48 |
_pc = pc;
|
|
49 |
assert(pc != NULL, "no pc?");
|
|
50 |
_cb = CodeCache::find_blob(pc);
|
|
51 |
adjust_unextended_sp();
|
|
52 |
|
|
53 |
address original_pc = CompiledMethod::get_deopt_original_pc(this);
|
|
54 |
if (original_pc != NULL) {
|
|
55 |
_pc = original_pc;
|
|
56 |
_deopt_state = is_deoptimized;
|
|
57 |
} else {
|
|
58 |
_deopt_state = not_deoptimized;
|
|
59 |
}
|
|
60 |
}
|
|
61 |
|
|
62 |
inline frame::frame(intptr_t* sp, intptr_t* fp, address pc) {
|
|
63 |
init(sp, fp, pc);
|
|
64 |
}
|
|
65 |
|
|
66 |
inline frame::frame(intptr_t* sp, intptr_t* unextended_sp, intptr_t* fp, address pc) {
|
|
67 |
_sp = sp;
|
|
68 |
_unextended_sp = unextended_sp;
|
|
69 |
_fp = fp;
|
|
70 |
_pc = pc;
|
|
71 |
assert(pc != NULL, "no pc?");
|
|
72 |
_cb = CodeCache::find_blob(pc);
|
|
73 |
adjust_unextended_sp();
|
|
74 |
|
|
75 |
address original_pc = CompiledMethod::get_deopt_original_pc(this);
|
|
76 |
if (original_pc != NULL) {
|
|
77 |
_pc = original_pc;
|
|
78 |
assert(_cb->as_compiled_method()->insts_contains(_pc), "original PC must be in CompiledMethod");
|
|
79 |
_deopt_state = is_deoptimized;
|
|
80 |
} else {
|
|
81 |
_deopt_state = not_deoptimized;
|
|
82 |
}
|
|
83 |
}
|
|
84 |
|
|
85 |
#ifndef AARCH64
|
|
86 |
|
|
87 |
inline frame::frame(intptr_t* sp, intptr_t* fp) {
|
|
88 |
_sp = sp;
|
|
89 |
_unextended_sp = sp;
|
|
90 |
_fp = fp;
|
|
91 |
assert(sp != NULL,"null SP ?");
|
|
92 |
_pc = (address)(sp[-1]);
|
|
93 |
// assert(_pc != NULL, "no pc?"); // see comments in x86
|
|
94 |
_cb = CodeCache::find_blob(_pc);
|
|
95 |
adjust_unextended_sp();
|
|
96 |
|
|
97 |
address original_pc = CompiledMethod::get_deopt_original_pc(this);
|
|
98 |
if (original_pc != NULL) {
|
|
99 |
_pc = original_pc;
|
|
100 |
_deopt_state = is_deoptimized;
|
|
101 |
} else {
|
|
102 |
_deopt_state = not_deoptimized;
|
|
103 |
}
|
|
104 |
}
|
|
105 |
|
|
106 |
#endif // !AARCH64
|
|
107 |
|
|
108 |
// Accessors
|
|
109 |
|
|
110 |
inline bool frame::equal(frame other) const {
|
|
111 |
bool ret = sp() == other.sp()
|
|
112 |
&& unextended_sp() == other.unextended_sp()
|
|
113 |
&& fp() == other.fp()
|
|
114 |
&& pc() == other.pc();
|
|
115 |
assert(!ret || ret && cb() == other.cb() && _deopt_state == other._deopt_state, "inconsistent construction");
|
|
116 |
return ret;
|
|
117 |
}
|
|
118 |
|
|
119 |
// Return unique id for this frame. The id must have a value where we can distinguish
|
|
120 |
// identity and younger/older relationship. NULL represents an invalid (incomparable)
|
|
121 |
// frame.
|
|
122 |
inline intptr_t* frame::id(void) const { return unextended_sp(); }
|
|
123 |
|
|
124 |
// Relationals on frames based
|
|
125 |
// Return true if the frame is younger (more recent activation) than the frame represented by id
|
|
126 |
inline bool frame::is_younger(intptr_t* id) const { assert(this->id() != NULL && id != NULL, "NULL frame id");
|
|
127 |
return this->id() < id ; }
|
|
128 |
|
|
129 |
// Return true if the frame is older (less recent activation) than the frame represented by id
|
|
130 |
inline bool frame::is_older(intptr_t* id) const { assert(this->id() != NULL && id != NULL, "NULL frame id");
|
|
131 |
return this->id() > id ; }
|
|
132 |
|
|
133 |
|
|
134 |
|
|
135 |
inline intptr_t* frame::link() const { return (intptr_t*) *(intptr_t **)addr_at(link_offset); }
|
|
136 |
|
|
137 |
inline intptr_t* frame::unextended_sp() const { return _unextended_sp; }
|
|
138 |
|
|
139 |
// Return address:
|
|
140 |
|
|
141 |
inline address* frame::sender_pc_addr() const { return (address*) addr_at(return_addr_offset); }
|
|
142 |
inline address frame::sender_pc() const { return *sender_pc_addr(); }
|
|
143 |
|
|
144 |
inline intptr_t* frame::sender_sp() const { return addr_at(sender_sp_offset); }
|
|
145 |
|
|
146 |
inline intptr_t** frame::interpreter_frame_locals_addr() const {
|
|
147 |
return (intptr_t**)addr_at(interpreter_frame_locals_offset);
|
|
148 |
}
|
|
149 |
|
|
150 |
#ifndef AARCH64
|
|
151 |
inline intptr_t* frame::interpreter_frame_last_sp() const {
|
|
152 |
return *(intptr_t**)addr_at(interpreter_frame_last_sp_offset);
|
|
153 |
}
|
|
154 |
#endif // !AARCH64
|
|
155 |
|
|
156 |
inline intptr_t* frame::interpreter_frame_bcp_addr() const {
|
|
157 |
return (intptr_t*)addr_at(interpreter_frame_bcp_offset);
|
|
158 |
}
|
|
159 |
|
|
160 |
inline intptr_t* frame::interpreter_frame_mdp_addr() const {
|
|
161 |
return (intptr_t*)addr_at(interpreter_frame_mdp_offset);
|
|
162 |
}
|
|
163 |
|
|
164 |
|
|
165 |
// Constant pool cache
|
|
166 |
|
|
167 |
inline ConstantPoolCache** frame::interpreter_frame_cache_addr() const {
|
|
168 |
return (ConstantPoolCache**)addr_at(interpreter_frame_cache_offset);
|
|
169 |
}
|
|
170 |
|
|
171 |
// Method
|
|
172 |
|
|
173 |
inline Method** frame::interpreter_frame_method_addr() const {
|
|
174 |
return (Method**)addr_at(interpreter_frame_method_offset);
|
|
175 |
}
|
|
176 |
|
|
177 |
inline oop* frame::interpreter_frame_mirror_addr() const {
|
|
178 |
return (oop*)addr_at(interpreter_frame_mirror_offset);
|
|
179 |
}
|
|
180 |
|
|
181 |
// top of expression stack
|
|
182 |
inline intptr_t* frame::interpreter_frame_tos_address() const {
|
|
183 |
#ifdef AARCH64
|
|
184 |
intptr_t* stack_top = (intptr_t*)*addr_at(interpreter_frame_stack_top_offset);
|
|
185 |
assert(stack_top != NULL, "should be stored before call");
|
|
186 |
assert(stack_top <= (intptr_t*) interpreter_frame_monitor_end(), "bad tos");
|
|
187 |
return stack_top;
|
|
188 |
#else
|
|
189 |
intptr_t* last_sp = interpreter_frame_last_sp();
|
|
190 |
if (last_sp == NULL ) {
|
|
191 |
return sp();
|
|
192 |
} else {
|
|
193 |
// sp() may have been extended or shrunk by an adapter. At least
|
|
194 |
// check that we don't fall behind the legal region.
|
|
195 |
// For top deoptimized frame last_sp == interpreter_frame_monitor_end.
|
|
196 |
assert(last_sp <= (intptr_t*) interpreter_frame_monitor_end(), "bad tos");
|
|
197 |
return last_sp;
|
|
198 |
}
|
|
199 |
#endif // AARCH64
|
|
200 |
}
|
|
201 |
|
|
202 |
inline oop* frame::interpreter_frame_temp_oop_addr() const {
|
|
203 |
return (oop *)(fp() + interpreter_frame_oop_temp_offset);
|
|
204 |
}
|
|
205 |
|
|
206 |
inline int frame::interpreter_frame_monitor_size() {
|
|
207 |
return BasicObjectLock::size();
|
|
208 |
}
|
|
209 |
|
|
210 |
|
|
211 |
// expression stack
|
|
212 |
// (the max_stack arguments are used by the GC; see class FrameClosure)
|
|
213 |
|
|
214 |
inline intptr_t* frame::interpreter_frame_expression_stack() const {
|
|
215 |
intptr_t* monitor_end = (intptr_t*) interpreter_frame_monitor_end();
|
|
216 |
return monitor_end-1;
|
|
217 |
}
|
|
218 |
|
|
219 |
|
|
220 |
inline jint frame::interpreter_frame_expression_stack_direction() { return -1; }
|
|
221 |
|
|
222 |
|
|
223 |
// Entry frames
|
|
224 |
|
|
225 |
inline JavaCallWrapper** frame::entry_frame_call_wrapper_addr() const {
|
|
226 |
return (JavaCallWrapper**)addr_at(entry_frame_call_wrapper_offset);
|
|
227 |
}
|
|
228 |
|
|
229 |
|
|
230 |
// Compiled frames
|
|
231 |
|
|
232 |
inline bool frame::volatile_across_calls(Register reg) {
|
|
233 |
return true;
|
|
234 |
}
|
|
235 |
|
|
236 |
inline oop frame::saved_oop_result(RegisterMap* map) const {
|
|
237 |
oop* result_adr = (oop*) map->location(R0->as_VMReg());
|
|
238 |
guarantee(result_adr != NULL, "bad register save location");
|
|
239 |
return (*result_adr);
|
|
240 |
}
|
|
241 |
|
|
242 |
inline void frame::set_saved_oop_result(RegisterMap* map, oop obj) {
|
|
243 |
oop* result_adr = (oop*) map->location(R0->as_VMReg());
|
|
244 |
guarantee(result_adr != NULL, "bad register save location");
|
|
245 |
*result_adr = obj;
|
|
246 |
}
|
|
247 |
|
|
248 |
#endif // CPU_ARM_VM_FRAME_ARM_INLINE_HPP
|