Print this page
rev 1082 : [mq]: indy.compiler.patch
| Split |
Close |
| Expand all |
| Collapse all |
--- old/src/cpu/x86/vm/frame_x86.inline.hpp
+++ new/src/cpu/x86/vm/frame_x86.inline.hpp
1 1 /*
2 2 * Copyright 1997-2009 Sun Microsystems, Inc. All Rights Reserved.
3 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 4 *
5 5 * This code is free software; you can redistribute it and/or modify it
6 6 * under the terms of the GNU General Public License version 2 only, as
7 7 * published by the Free Software Foundation.
8 8 *
9 9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 12 * version 2 for more details (a copy is included in the LICENSE file that
13 13 * accompanied this code).
14 14 *
15 15 * You should have received a copy of the GNU General Public License version
16 16 * 2 along with this work; if not, write to the Free Software Foundation,
17 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 18 *
19 19 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
20 20 * CA 95054 USA or visit www.sun.com if you need additional information or
21 21 * have any questions.
22 22 *
23 23 */
24 24
25 25 // Inline functions for Intel frames:
26 26
27 27 // Constructors:
28 28
29 29 inline frame::frame() {
30 30 _pc = NULL;
31 31 _sp = NULL;
32 32 _unextended_sp = NULL;
33 33 _fp = NULL;
34 34 _cb = NULL;
35 35 _deopt_state = unknown;
36 36 }
37 37
38 38 inline frame:: frame(intptr_t* sp, intptr_t* fp, address pc) {
39 39 _sp = sp;
40 40 _unextended_sp = sp;
41 41 _fp = fp;
42 42 _pc = pc;
43 43 assert(pc != NULL, "no pc?");
44 44 _cb = CodeCache::find_blob(pc);
45 45 _deopt_state = not_deoptimized;
46 46 if (_cb != NULL && _cb->is_nmethod() && ((nmethod*)_cb)->is_deopt_pc(_pc)) {
47 47 _pc = (((nmethod*)_cb)->get_original_pc(this));
48 48 _deopt_state = is_deoptimized;
49 49 } else {
50 50 _deopt_state = not_deoptimized;
51 51 }
52 52 }
53 53
54 54 inline frame:: frame(intptr_t* sp, intptr_t* unextended_sp, intptr_t* fp, address pc) {
55 55 _sp = sp;
56 56 _unextended_sp = unextended_sp;
57 57 _fp = fp;
58 58 _pc = pc;
59 59 assert(pc != NULL, "no pc?");
60 60 _cb = CodeCache::find_blob(pc);
61 61 _deopt_state = not_deoptimized;
62 62 if (_cb != NULL && _cb->is_nmethod() && ((nmethod*)_cb)->is_deopt_pc(_pc)) {
63 63 _pc = (((nmethod*)_cb)->get_original_pc(this));
64 64 _deopt_state = is_deoptimized;
65 65 } else {
66 66 _deopt_state = not_deoptimized;
67 67 }
68 68 }
69 69
70 70 inline frame::frame(intptr_t* sp, intptr_t* fp) {
71 71 _sp = sp;
72 72 _unextended_sp = sp;
73 73 _fp = fp;
74 74 _pc = (address)(sp[-1]);
75 75
76 76 // Here's a sticky one. This constructor can be called via AsyncGetCallTrace
77 77 // when last_Java_sp is non-null but the pc fetched is junk. If we are truly
78 78 // unlucky the junk value could be to a zombied method and we'll die on the
79 79 // find_blob call. This is also why we can have no asserts on the validity
80 80 // of the pc we find here. AsyncGetCallTrace -> pd_get_top_frame_for_signal_handler
81 81 // -> pd_last_frame should use a specialized version of pd_last_frame which could
82 82 // call a specilaized frame constructor instead of this one.
83 83 // Then we could use the assert below. However this assert is of somewhat dubious
84 84 // value.
85 85 // assert(_pc != NULL, "no pc?");
86 86
87 87 _cb = CodeCache::find_blob(_pc);
88 88
89 89 _deopt_state = not_deoptimized;
90 90 if (_cb != NULL && _cb->is_nmethod() && ((nmethod*)_cb)->is_deopt_pc(_pc)) {
91 91 _pc = (((nmethod*)_cb)->get_original_pc(this));
92 92 _deopt_state = is_deoptimized;
93 93 } else {
94 94 _deopt_state = not_deoptimized;
95 95 }
96 96 }
97 97
98 98 // Accessors
99 99
100 100 inline bool frame::equal(frame other) const {
101 101 bool ret = sp() == other.sp()
102 102 && unextended_sp() == other.unextended_sp()
103 103 && fp() == other.fp()
104 104 && pc() == other.pc();
105 105 assert(!ret || ret && cb() == other.cb() && _deopt_state == other._deopt_state, "inconsistent construction");
106 106 return ret;
107 107 }
108 108
109 109 // Return unique id for this frame. The id must have a value where we can distinguish
110 110 // identity and younger/older relationship. NULL represents an invalid (incomparable)
111 111 // frame.
112 112 inline intptr_t* frame::id(void) const { return unextended_sp(); }
113 113
114 114 // Relationals on frames based
115 115 // Return true if the frame is younger (more recent activation) than the frame represented by id
116 116 inline bool frame::is_younger(intptr_t* id) const { assert(this->id() != NULL && id != NULL, "NULL frame id");
117 117 return this->id() < id ; }
118 118
119 119 // Return true if the frame is older (less recent activation) than the frame represented by id
120 120 inline bool frame::is_older(intptr_t* id) const { assert(this->id() != NULL && id != NULL, "NULL frame id");
121 121 return this->id() > id ; }
122 122
123 123
124 124
125 125 inline intptr_t* frame::link() const { return (intptr_t*) *(intptr_t **)addr_at(link_offset); }
126 126 inline void frame::set_link(intptr_t* addr) { *(intptr_t **)addr_at(link_offset) = addr; }
127 127
128 128
129 129 inline intptr_t* frame::unextended_sp() const { return _unextended_sp; }
130 130
131 131 // Return address:
132 132
133 133 inline address* frame::sender_pc_addr() const { return (address*) addr_at( return_addr_offset); }
134 134 inline address frame::sender_pc() const { return *sender_pc_addr(); }
135 135
136 136 // return address of param, zero origin index.
137 137 inline address* frame::native_param_addr(int idx) const { return (address*) addr_at( native_frame_initial_param_offset+idx); }
138 138
139 139 #ifdef CC_INTERP
140 140
141 141 inline interpreterState frame::get_interpreterState() const {
142 142 return ((interpreterState)addr_at( -((int)sizeof(BytecodeInterpreter))/wordSize ));
143 143 }
144 144
145 145 inline intptr_t* frame::sender_sp() const {
146 146 // Hmm this seems awfully expensive QQQ, is this really called with interpreted frames?
147 147 if (is_interpreted_frame()) {
148 148 assert(false, "should never happen");
149 149 return get_interpreterState()->sender_sp();
150 150 } else {
151 151 return addr_at(sender_sp_offset);
152 152 }
153 153 }
154 154
155 155 inline intptr_t** frame::interpreter_frame_locals_addr() const {
156 156 assert(is_interpreted_frame(), "must be interpreted");
157 157 return &(get_interpreterState()->_locals);
158 158 }
159 159
160 160 inline intptr_t* frame::interpreter_frame_bcx_addr() const {
161 161 assert(is_interpreted_frame(), "must be interpreted");
162 162 return (intptr_t*) &(get_interpreterState()->_bcp);
163 163 }
164 164
165 165
166 166 // Constant pool cache
167 167
168 168 inline constantPoolCacheOop* frame::interpreter_frame_cache_addr() const {
169 169 assert(is_interpreted_frame(), "must be interpreted");
170 170 return &(get_interpreterState()->_constants);
171 171 }
172 172
173 173 // Method
174 174
175 175 inline methodOop* frame::interpreter_frame_method_addr() const {
176 176 assert(is_interpreted_frame(), "must be interpreted");
177 177 return &(get_interpreterState()->_method);
178 178 }
179 179
180 180 inline intptr_t* frame::interpreter_frame_mdx_addr() const {
181 181 assert(is_interpreted_frame(), "must be interpreted");
182 182 return (intptr_t*) &(get_interpreterState()->_mdx);
183 183 }
184 184
185 185 // top of expression stack
186 186 inline intptr_t* frame::interpreter_frame_tos_address() const {
187 187 assert(is_interpreted_frame(), "wrong frame type");
188 188 return get_interpreterState()->_stack + 1;
189 189 }
190 190
191 191 #else /* asm interpreter */
192 192 inline intptr_t* frame::sender_sp() const { return addr_at( sender_sp_offset); }
193 193
194 194 inline intptr_t** frame::interpreter_frame_locals_addr() const {
195 195 return (intptr_t**)addr_at(interpreter_frame_locals_offset);
196 196 }
197 197
198 198 inline intptr_t* frame::interpreter_frame_last_sp() const {
199 199 return *(intptr_t**)addr_at(interpreter_frame_last_sp_offset);
200 200 }
201 201
202 202 inline intptr_t* frame::interpreter_frame_bcx_addr() const {
203 203 return (intptr_t*)addr_at(interpreter_frame_bcx_offset);
204 204 }
205 205
206 206
207 207 inline intptr_t* frame::interpreter_frame_mdx_addr() const {
208 208 return (intptr_t*)addr_at(interpreter_frame_mdx_offset);
209 209 }
210 210
211 211
212 212
213 213 // Constant pool cache
214 214
215 215 inline constantPoolCacheOop* frame::interpreter_frame_cache_addr() const {
216 216 return (constantPoolCacheOop*)addr_at(interpreter_frame_cache_offset);
217 217 }
|
↓ open down ↓ |
217 lines elided |
↑ open up ↑ |
218 218
219 219 // Method
220 220
221 221 inline methodOop* frame::interpreter_frame_method_addr() const {
222 222 return (methodOop*)addr_at(interpreter_frame_method_offset);
223 223 }
224 224
225 225 // top of expression stack
226 226 inline intptr_t* frame::interpreter_frame_tos_address() const {
227 227 intptr_t* last_sp = interpreter_frame_last_sp();
228 - if (last_sp == NULL ) {
228 + if (last_sp == NULL) {
229 229 return sp();
230 230 } else {
231 - // sp() may have been extended by an adapter
232 - assert(last_sp < fp() && last_sp >= sp(), "bad tos");
231 + // sp() may have been extended or shrunk by an adapter. At least
232 + // check that we don't fall behind the legal region.
233 + assert(last_sp < (intptr_t*) interpreter_frame_monitor_begin(), "bad tos");
233 234 return last_sp;
234 235 }
235 236 }
236 237
237 238 #endif /* CC_INTERP */
238 239
239 240 inline int frame::pd_oop_map_offset_adjustment() const {
240 241 return 0;
241 242 }
242 243
243 244 inline int frame::interpreter_frame_monitor_size() {
244 245 return BasicObjectLock::size();
245 246 }
246 247
247 248
248 249 // expression stack
249 250 // (the max_stack arguments are used by the GC; see class FrameClosure)
250 251
251 252 inline intptr_t* frame::interpreter_frame_expression_stack() const {
252 253 intptr_t* monitor_end = (intptr_t*) interpreter_frame_monitor_end();
253 254 return monitor_end-1;
254 255 }
255 256
256 257
257 258 inline jint frame::interpreter_frame_expression_stack_direction() { return -1; }
258 259
259 260
260 261 // Entry frames
261 262
262 263 inline JavaCallWrapper* frame::entry_frame_call_wrapper() const {
263 264 return (JavaCallWrapper*)at(entry_frame_call_wrapper_offset);
264 265 }
265 266
266 267
267 268 // Compiled frames
268 269
269 270 inline int frame::local_offset_for_compiler(int local_index, int nof_args, int max_nof_locals, int max_nof_monitors) {
270 271 return (nof_args - local_index + (local_index < nof_args ? 1: -1));
271 272 }
272 273
273 274 inline int frame::monitor_offset_for_compiler(int local_index, int nof_args, int max_nof_locals, int max_nof_monitors) {
274 275 return local_offset_for_compiler(local_index, nof_args, max_nof_locals, max_nof_monitors);
275 276 }
276 277
277 278 inline int frame::min_local_offset_for_compiler(int nof_args, int max_nof_locals, int max_nof_monitors) {
278 279 return (nof_args - (max_nof_locals + max_nof_monitors*2) - 1);
279 280 }
280 281
281 282 inline bool frame::volatile_across_calls(Register reg) {
282 283 return true;
283 284 }
284 285
285 286
286 287
287 288 inline oop frame::saved_oop_result(RegisterMap* map) const {
288 289 return *((oop*) map->location(rax->as_VMReg()));
289 290 }
290 291
291 292 inline void frame::set_saved_oop_result(RegisterMap* map, oop obj) {
292 293 *((oop*) map->location(rax->as_VMReg())) = obj;
293 294 }
|
↓ open down ↓ |
51 lines elided |
↑ open up ↑ |
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX