src/cpu/x86/vm/frame_x86.inline.hpp

Mon, 09 Mar 2009 13:28:46 -0700

author
xdono
date
Mon, 09 Mar 2009 13:28:46 -0700
changeset 1014
0fbdb4381b99
parent 955
52a431267315
child 1572
97125851f396
permissions
-rw-r--r--

6814575: Update copyright year
Summary: Update copyright for files that have been modified in 2009, up to 03/09
Reviewed-by: katleman, tbell, ohair

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

mercurial