author | coleenp |
Wed, 06 Jun 2018 10:45:40 -0400 | |
changeset 50429 | 83aec1d357d4 |
parent 49480 | d7df2dd501ce |
child 52351 | 0ecb4e520110 |
permissions | -rw-r--r-- |
42664 | 1 |
/* |
49397 | 2 |
* Copyright (c) 2008, 2018, Oracle and/or its affiliates. All rights reserved. |
42664 | 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; |
|
43474
8fbf946045f6
8172844: Assert fails in deoptimization due to original PC at the end of code section
zmajo
parents:
42664
diff
changeset
|
78 |
assert(_cb->as_compiled_method()->insts_contains_inclusive(_pc), |
8fbf946045f6
8172844: Assert fails in deoptimization due to original PC at the end of code section
zmajo
parents:
42664
diff
changeset
|
79 |
"original PC must be in the main code section of the the compiled method (or must be immediately following it)"); |
42664 | 80 |
_deopt_state = is_deoptimized; |
81 |
} else { |
|
82 |
_deopt_state = not_deoptimized; |
|
83 |
} |
|
84 |
} |
|
85 |
||
86 |
#ifndef AARCH64 |
|
87 |
||
88 |
inline frame::frame(intptr_t* sp, intptr_t* fp) { |
|
89 |
_sp = sp; |
|
90 |
_unextended_sp = sp; |
|
91 |
_fp = fp; |
|
92 |
assert(sp != NULL,"null SP ?"); |
|
93 |
_pc = (address)(sp[-1]); |
|
94 |
// assert(_pc != NULL, "no pc?"); // see comments in x86 |
|
95 |
_cb = CodeCache::find_blob(_pc); |
|
96 |
adjust_unextended_sp(); |
|
97 |
||
98 |
address original_pc = CompiledMethod::get_deopt_original_pc(this); |
|
99 |
if (original_pc != NULL) { |
|
100 |
_pc = original_pc; |
|
101 |
_deopt_state = is_deoptimized; |
|
102 |
} else { |
|
103 |
_deopt_state = not_deoptimized; |
|
104 |
} |
|
105 |
} |
|
106 |
||
107 |
#endif // !AARCH64 |
|
108 |
||
109 |
// Accessors |
|
110 |
||
111 |
inline bool frame::equal(frame other) const { |
|
112 |
bool ret = sp() == other.sp() |
|
113 |
&& unextended_sp() == other.unextended_sp() |
|
114 |
&& fp() == other.fp() |
|
115 |
&& pc() == other.pc(); |
|
116 |
assert(!ret || ret && cb() == other.cb() && _deopt_state == other._deopt_state, "inconsistent construction"); |
|
117 |
return ret; |
|
118 |
} |
|
119 |
||
120 |
// Return unique id for this frame. The id must have a value where we can distinguish |
|
121 |
// identity and younger/older relationship. NULL represents an invalid (incomparable) |
|
122 |
// frame. |
|
123 |
inline intptr_t* frame::id(void) const { return unextended_sp(); } |
|
124 |
||
125 |
// Relationals on frames based |
|
126 |
// Return true if the frame is younger (more recent activation) than the frame represented by id |
|
127 |
inline bool frame::is_younger(intptr_t* id) const { assert(this->id() != NULL && id != NULL, "NULL frame id"); |
|
128 |
return this->id() < id ; } |
|
129 |
||
130 |
// Return true if the frame is older (less recent activation) than the frame represented by id |
|
131 |
inline bool frame::is_older(intptr_t* id) const { assert(this->id() != NULL && id != NULL, "NULL frame id"); |
|
132 |
return this->id() > id ; } |
|
133 |
||
134 |
||
135 |
||
136 |
inline intptr_t* frame::link() const { return (intptr_t*) *(intptr_t **)addr_at(link_offset); } |
|
137 |
||
138 |
inline intptr_t* frame::unextended_sp() const { return _unextended_sp; } |
|
139 |
||
140 |
// Return address: |
|
141 |
||
142 |
inline address* frame::sender_pc_addr() const { return (address*) addr_at(return_addr_offset); } |
|
143 |
inline address frame::sender_pc() const { return *sender_pc_addr(); } |
|
144 |
||
145 |
inline intptr_t* frame::sender_sp() const { return addr_at(sender_sp_offset); } |
|
146 |
||
147 |
inline intptr_t** frame::interpreter_frame_locals_addr() const { |
|
148 |
return (intptr_t**)addr_at(interpreter_frame_locals_offset); |
|
149 |
} |
|
150 |
||
151 |
#ifndef AARCH64 |
|
152 |
inline intptr_t* frame::interpreter_frame_last_sp() const { |
|
153 |
return *(intptr_t**)addr_at(interpreter_frame_last_sp_offset); |
|
154 |
} |
|
155 |
#endif // !AARCH64 |
|
156 |
||
157 |
inline intptr_t* frame::interpreter_frame_bcp_addr() const { |
|
158 |
return (intptr_t*)addr_at(interpreter_frame_bcp_offset); |
|
159 |
} |
|
160 |
||
161 |
inline intptr_t* frame::interpreter_frame_mdp_addr() const { |
|
162 |
return (intptr_t*)addr_at(interpreter_frame_mdp_offset); |
|
163 |
} |
|
164 |
||
165 |
||
166 |
// Constant pool cache |
|
167 |
||
168 |
inline ConstantPoolCache** frame::interpreter_frame_cache_addr() const { |
|
169 |
return (ConstantPoolCache**)addr_at(interpreter_frame_cache_offset); |
|
170 |
} |
|
171 |
||
172 |
// Method |
|
173 |
||
174 |
inline Method** frame::interpreter_frame_method_addr() const { |
|
175 |
return (Method**)addr_at(interpreter_frame_method_offset); |
|
176 |
} |
|
177 |
||
178 |
inline oop* frame::interpreter_frame_mirror_addr() const { |
|
179 |
return (oop*)addr_at(interpreter_frame_mirror_offset); |
|
180 |
} |
|
181 |
||
182 |
// top of expression stack |
|
183 |
inline intptr_t* frame::interpreter_frame_tos_address() const { |
|
184 |
#ifdef AARCH64 |
|
185 |
intptr_t* stack_top = (intptr_t*)*addr_at(interpreter_frame_stack_top_offset); |
|
186 |
assert(stack_top != NULL, "should be stored before call"); |
|
187 |
assert(stack_top <= (intptr_t*) interpreter_frame_monitor_end(), "bad tos"); |
|
188 |
return stack_top; |
|
189 |
#else |
|
190 |
intptr_t* last_sp = interpreter_frame_last_sp(); |
|
191 |
if (last_sp == NULL ) { |
|
192 |
return sp(); |
|
193 |
} else { |
|
194 |
// sp() may have been extended or shrunk by an adapter. At least |
|
195 |
// check that we don't fall behind the legal region. |
|
196 |
// For top deoptimized frame last_sp == interpreter_frame_monitor_end. |
|
197 |
assert(last_sp <= (intptr_t*) interpreter_frame_monitor_end(), "bad tos"); |
|
198 |
return last_sp; |
|
199 |
} |
|
200 |
#endif // AARCH64 |
|
201 |
} |
|
202 |
||
203 |
inline oop* frame::interpreter_frame_temp_oop_addr() const { |
|
204 |
return (oop *)(fp() + interpreter_frame_oop_temp_offset); |
|
205 |
} |
|
206 |
||
207 |
inline int frame::interpreter_frame_monitor_size() { |
|
208 |
return BasicObjectLock::size(); |
|
209 |
} |
|
210 |
||
211 |
||
212 |
// expression stack |
|
213 |
// (the max_stack arguments are used by the GC; see class FrameClosure) |
|
214 |
||
215 |
inline intptr_t* frame::interpreter_frame_expression_stack() const { |
|
216 |
intptr_t* monitor_end = (intptr_t*) interpreter_frame_monitor_end(); |
|
217 |
return monitor_end-1; |
|
218 |
} |
|
219 |
||
220 |
||
221 |
// Entry frames |
|
222 |
||
223 |
inline JavaCallWrapper** frame::entry_frame_call_wrapper_addr() const { |
|
224 |
return (JavaCallWrapper**)addr_at(entry_frame_call_wrapper_offset); |
|
225 |
} |
|
226 |
||
227 |
||
228 |
// Compiled frames |
|
229 |
||
230 |
inline oop frame::saved_oop_result(RegisterMap* map) const { |
|
231 |
oop* result_adr = (oop*) map->location(R0->as_VMReg()); |
|
232 |
guarantee(result_adr != NULL, "bad register save location"); |
|
233 |
return (*result_adr); |
|
234 |
} |
|
235 |
||
236 |
inline void frame::set_saved_oop_result(RegisterMap* map, oop obj) { |
|
237 |
oop* result_adr = (oop*) map->location(R0->as_VMReg()); |
|
238 |
guarantee(result_adr != NULL, "bad register save location"); |
|
239 |
*result_adr = obj; |
|
240 |
} |
|
241 |
||
242 |
#endif // CPU_ARM_VM_FRAME_ARM_INLINE_HPP |