1.1 --- /dev/null Thu Jan 01 00:00:00 1970 +0000
1.2 +++ b/src/cpu/sparc/vm/frame_sparc.inline.hpp Sat Dec 01 00:00:00 2007 +0000
1.3 @@ -0,0 +1,297 @@
1.4 +/*
1.5 + * Copyright 1997-2007 Sun Microsystems, Inc. All Rights Reserved.
1.6 + * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
1.7 + *
1.8 + * This code is free software; you can redistribute it and/or modify it
1.9 + * under the terms of the GNU General Public License version 2 only, as
1.10 + * published by the Free Software Foundation.
1.11 + *
1.12 + * This code is distributed in the hope that it will be useful, but WITHOUT
1.13 + * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
1.14 + * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
1.15 + * version 2 for more details (a copy is included in the LICENSE file that
1.16 + * accompanied this code).
1.17 + *
1.18 + * You should have received a copy of the GNU General Public License version
1.19 + * 2 along with this work; if not, write to the Free Software Foundation,
1.20 + * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
1.21 + *
1.22 + * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
1.23 + * CA 95054 USA or visit www.sun.com if you need additional information or
1.24 + * have any questions.
1.25 + *
1.26 + */
1.27 +
1.28 +// Inline functions for SPARC frames:
1.29 +
1.30 +// Constructors
1.31 +
1.32 +inline frame::frame() {
1.33 + _pc = NULL;
1.34 + _sp = NULL;
1.35 + _younger_sp = NULL;
1.36 + _cb = NULL;
1.37 + _deopt_state = unknown;
1.38 + _sp_adjustment_by_callee = 0;
1.39 +}
1.40 +
1.41 +// Accessors:
1.42 +
1.43 +inline bool frame::equal(frame other) const {
1.44 + bool ret = sp() == other.sp()
1.45 + && fp() == other.fp()
1.46 + && pc() == other.pc();
1.47 + assert(!ret || ret && cb() == other.cb() && _deopt_state == other._deopt_state, "inconsistent construction");
1.48 + return ret;
1.49 +}
1.50 +
1.51 +// Return unique id for this frame. The id must have a value where we can distinguish
1.52 +// identity and younger/older relationship. NULL represents an invalid (incomparable)
1.53 +// frame.
1.54 +inline intptr_t* frame::id(void) const { return unextended_sp(); }
1.55 +
1.56 +// Relationals on frames based
1.57 +// Return true if the frame is younger (more recent activation) than the frame represented by id
1.58 +inline bool frame::is_younger(intptr_t* id) const { assert(this->id() != NULL && id != NULL, "NULL frame id");
1.59 + return this->id() < id ; }
1.60 +
1.61 +// Return true if the frame is older (less recent activation) than the frame represented by id
1.62 +inline bool frame::is_older(intptr_t* id) const { assert(this->id() != NULL && id != NULL, "NULL frame id");
1.63 + return this->id() > id ; }
1.64 +
1.65 +inline int frame::frame_size() const { return sender_sp() - sp(); }
1.66 +
1.67 +inline intptr_t* frame::link() const { return (intptr_t *)(fp()[FP->sp_offset_in_saved_window()] + STACK_BIAS); }
1.68 +
1.69 +inline void frame::set_link(intptr_t* addr) { assert(link()==addr, "frame nesting is controlled by hardware"); }
1.70 +
1.71 +inline intptr_t* frame::unextended_sp() const { return sp() + _sp_adjustment_by_callee; }
1.72 +
1.73 +// return address:
1.74 +
1.75 +inline address frame::sender_pc() const { return *I7_addr() + pc_return_offset; }
1.76 +
1.77 +inline address* frame::I7_addr() const { return (address*) &sp()[ I7->sp_offset_in_saved_window()]; }
1.78 +inline address* frame::I0_addr() const { return (address*) &sp()[ I0->sp_offset_in_saved_window()]; }
1.79 +
1.80 +inline address* frame::O7_addr() const { return (address*) &younger_sp()[ I7->sp_offset_in_saved_window()]; }
1.81 +inline address* frame::O0_addr() const { return (address*) &younger_sp()[ I0->sp_offset_in_saved_window()]; }
1.82 +
1.83 +inline intptr_t* frame::sender_sp() const { return fp(); }
1.84 +
1.85 +// Used only in frame::oopmapreg_to_location
1.86 +// This return a value in VMRegImpl::slot_size
1.87 +inline int frame::pd_oop_map_offset_adjustment() const {
1.88 + return _sp_adjustment_by_callee * VMRegImpl::slots_per_word;
1.89 +}
1.90 +
1.91 +#ifdef CC_INTERP
1.92 +inline intptr_t** frame::interpreter_frame_locals_addr() const {
1.93 + interpreterState istate = get_interpreterState();
1.94 + return (intptr_t**) &istate->_locals;
1.95 +}
1.96 +
1.97 +inline intptr_t* frame::interpreter_frame_bcx_addr() const {
1.98 + interpreterState istate = get_interpreterState();
1.99 + return (intptr_t*) &istate->_bcp;
1.100 +}
1.101 +
1.102 +inline intptr_t* frame::interpreter_frame_mdx_addr() const {
1.103 + interpreterState istate = get_interpreterState();
1.104 + return (intptr_t*) &istate->_mdx;
1.105 +}
1.106 +
1.107 +inline jint frame::interpreter_frame_expression_stack_direction() { return -1; }
1.108 +
1.109 +// bottom(base) of the expression stack (highest address)
1.110 +inline intptr_t* frame::interpreter_frame_expression_stack() const {
1.111 + return (intptr_t*)interpreter_frame_monitor_end() - 1;
1.112 +}
1.113 +
1.114 +// top of expression stack (lowest address)
1.115 +inline intptr_t* frame::interpreter_frame_tos_address() const {
1.116 + interpreterState istate = get_interpreterState();
1.117 + return istate->_stack + 1; // Is this off by one? QQQ
1.118 +}
1.119 +
1.120 +// monitor elements
1.121 +
1.122 +// in keeping with Intel side: end is lower in memory than begin;
1.123 +// and beginning element is oldest element
1.124 +// Also begin is one past last monitor.
1.125 +
1.126 +inline BasicObjectLock* frame::interpreter_frame_monitor_begin() const {
1.127 + return get_interpreterState()->monitor_base();
1.128 +}
1.129 +
1.130 +inline BasicObjectLock* frame::interpreter_frame_monitor_end() const {
1.131 + return (BasicObjectLock*) get_interpreterState()->stack_base();
1.132 +}
1.133 +
1.134 +
1.135 +inline int frame::interpreter_frame_monitor_size() {
1.136 + return round_to(BasicObjectLock::size(), WordsPerLong);
1.137 +}
1.138 +
1.139 +inline methodOop* frame::interpreter_frame_method_addr() const {
1.140 + interpreterState istate = get_interpreterState();
1.141 + return &istate->_method;
1.142 +}
1.143 +
1.144 +
1.145 +// Constant pool cache
1.146 +
1.147 +// where LcpoolCache is saved:
1.148 +inline constantPoolCacheOop* frame::interpreter_frame_cpoolcache_addr() const {
1.149 + interpreterState istate = get_interpreterState();
1.150 + return &istate->_constants; // should really use accessor
1.151 + }
1.152 +
1.153 +inline constantPoolCacheOop* frame::interpreter_frame_cache_addr() const {
1.154 + interpreterState istate = get_interpreterState();
1.155 + return &istate->_constants;
1.156 +}
1.157 +
1.158 +#else // !CC_INTERP
1.159 +
1.160 +inline intptr_t** frame::interpreter_frame_locals_addr() const {
1.161 + return (intptr_t**) sp_addr_at( Llocals->sp_offset_in_saved_window());
1.162 +}
1.163 +
1.164 +inline intptr_t* frame::interpreter_frame_bcx_addr() const {
1.165 + // %%%%% reinterpreting Lbcp as a bcx
1.166 + return (intptr_t*) sp_addr_at( Lbcp->sp_offset_in_saved_window());
1.167 +}
1.168 +
1.169 +inline intptr_t* frame::interpreter_frame_mdx_addr() const {
1.170 + // %%%%% reinterpreting ImethodDataPtr as a mdx
1.171 + return (intptr_t*) sp_addr_at( ImethodDataPtr->sp_offset_in_saved_window());
1.172 +}
1.173 +
1.174 +inline jint frame::interpreter_frame_expression_stack_direction() { return -1; }
1.175 +
1.176 +// bottom(base) of the expression stack (highest address)
1.177 +inline intptr_t* frame::interpreter_frame_expression_stack() const {
1.178 + return (intptr_t*)interpreter_frame_monitors() - 1;
1.179 +}
1.180 +
1.181 +// top of expression stack (lowest address)
1.182 +inline intptr_t* frame::interpreter_frame_tos_address() const {
1.183 + return *interpreter_frame_esp_addr() + 1;
1.184 +}
1.185 +
1.186 +inline void frame::interpreter_frame_set_tos_address( intptr_t* x ) {
1.187 + *interpreter_frame_esp_addr() = x - 1;
1.188 +}
1.189 +
1.190 +// monitor elements
1.191 +
1.192 +// in keeping with Intel side: end is lower in memory than begin;
1.193 +// and beginning element is oldest element
1.194 +// Also begin is one past last monitor.
1.195 +
1.196 +inline BasicObjectLock* frame::interpreter_frame_monitor_begin() const {
1.197 + int rounded_vm_local_words = round_to(frame::interpreter_frame_vm_local_words, WordsPerLong);
1.198 + return (BasicObjectLock *)fp_addr_at(-rounded_vm_local_words);
1.199 +}
1.200 +
1.201 +inline BasicObjectLock* frame::interpreter_frame_monitor_end() const {
1.202 + return interpreter_frame_monitors();
1.203 +}
1.204 +
1.205 +
1.206 +inline void frame::interpreter_frame_set_monitor_end(BasicObjectLock* value) {
1.207 + interpreter_frame_set_monitors(value);
1.208 +}
1.209 +
1.210 +inline int frame::interpreter_frame_monitor_size() {
1.211 + return round_to(BasicObjectLock::size(), WordsPerLong);
1.212 +}
1.213 +
1.214 +inline methodOop* frame::interpreter_frame_method_addr() const {
1.215 + return (methodOop*)sp_addr_at( Lmethod->sp_offset_in_saved_window());
1.216 +}
1.217 +
1.218 +
1.219 +// Constant pool cache
1.220 +
1.221 +// where LcpoolCache is saved:
1.222 +inline constantPoolCacheOop* frame::interpreter_frame_cpoolcache_addr() const {
1.223 + return (constantPoolCacheOop*)sp_addr_at(LcpoolCache->sp_offset_in_saved_window());
1.224 + }
1.225 +
1.226 +inline constantPoolCacheOop* frame::interpreter_frame_cache_addr() const {
1.227 + return (constantPoolCacheOop*)sp_addr_at( LcpoolCache->sp_offset_in_saved_window());
1.228 +}
1.229 +#endif // CC_INTERP
1.230 +
1.231 +
1.232 +inline JavaCallWrapper* frame::entry_frame_call_wrapper() const {
1.233 + // note: adjust this code if the link argument in StubGenerator::call_stub() changes!
1.234 + const Argument link = Argument(0, false);
1.235 + return (JavaCallWrapper*)sp()[link.as_in().as_register()->sp_offset_in_saved_window()];
1.236 +}
1.237 +
1.238 +
1.239 +inline int frame::local_offset_for_compiler(int local_index, int nof_args, int max_nof_locals, int max_nof_monitors) {
1.240 + // always allocate non-argument locals 0..5 as if they were arguments:
1.241 + int allocated_above_frame = nof_args;
1.242 + if (allocated_above_frame < callee_register_argument_save_area_words)
1.243 + allocated_above_frame = callee_register_argument_save_area_words;
1.244 + if (allocated_above_frame > max_nof_locals)
1.245 + allocated_above_frame = max_nof_locals;
1.246 +
1.247 + // Note: monitors (BasicLock blocks) are never allocated in argument slots
1.248 + //assert(local_index >= 0 && local_index < max_nof_locals, "bad local index");
1.249 + if (local_index < allocated_above_frame)
1.250 + return local_index + callee_register_argument_save_area_sp_offset;
1.251 + else
1.252 + return local_index - (max_nof_locals + max_nof_monitors*2) + compiler_frame_vm_locals_fp_offset;
1.253 +}
1.254 +
1.255 +inline int frame::monitor_offset_for_compiler(int local_index, int nof_args, int max_nof_locals, int max_nof_monitors) {
1.256 + assert(local_index >= max_nof_locals && ((local_index - max_nof_locals) & 1) && (local_index - max_nof_locals) < max_nof_monitors*2, "bad monitor index");
1.257 +
1.258 + // The compiler uses the __higher__ of two indexes allocated to the monitor.
1.259 + // Increasing local indexes are mapped to increasing memory locations,
1.260 + // so the start of the BasicLock is associated with the __lower__ index.
1.261 +
1.262 + int offset = (local_index-1) - (max_nof_locals + max_nof_monitors*2) + compiler_frame_vm_locals_fp_offset;
1.263 +
1.264 + // We allocate monitors aligned zero mod 8:
1.265 + assert((offset & 1) == 0, "monitor must be an an even address.");
1.266 + // This works because all monitors are allocated after
1.267 + // all locals, and because the highest address corresponding to any
1.268 + // monitor index is always even.
1.269 + assert((compiler_frame_vm_locals_fp_offset & 1) == 0, "end of monitors must be even address");
1.270 +
1.271 + return offset;
1.272 +}
1.273 +
1.274 +inline int frame::min_local_offset_for_compiler(int nof_args, int max_nof_locals, int max_nof_monitors) {
1.275 + // always allocate non-argument locals 0..5 as if they were arguments:
1.276 + int allocated_above_frame = nof_args;
1.277 + if (allocated_above_frame < callee_register_argument_save_area_words)
1.278 + allocated_above_frame = callee_register_argument_save_area_words;
1.279 + if (allocated_above_frame > max_nof_locals)
1.280 + allocated_above_frame = max_nof_locals;
1.281 +
1.282 + int allocated_in_frame = (max_nof_locals + max_nof_monitors*2) - allocated_above_frame;
1.283 +
1.284 + return compiler_frame_vm_locals_fp_offset - allocated_in_frame;
1.285 +}
1.286 +
1.287 +// On SPARC, the %lN and %iN registers are non-volatile.
1.288 +inline bool frame::volatile_across_calls(Register reg) {
1.289 + // This predicate is (presently) applied only to temporary registers,
1.290 + // and so it need not recognize non-volatile globals.
1.291 + return reg->is_out() || reg->is_global();
1.292 +}
1.293 +
1.294 +inline oop frame::saved_oop_result(RegisterMap* map) const {
1.295 + return *((oop*) map->location(O0->as_VMReg()));
1.296 +}
1.297 +
1.298 +inline void frame::set_saved_oop_result(RegisterMap* map, oop obj) {
1.299 + *((oop*) map->location(O0->as_VMReg())) = obj;
1.300 +}
