1.1 --- /dev/null Thu Jan 01 00:00:00 1970 +0000
1.2 +++ b/src/cpu/sparc/vm/frame_sparc.inline.hpp Wed Apr 27 01:25:04 2016 +0800
1.3 @@ -0,0 +1,324 @@
1.4 +/*
1.5 + * Copyright (c) 1997, 2013, Oracle and/or its affiliates. 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 Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
1.23 + * or visit www.oracle.com if you need additional information or have any
1.24 + * questions.
1.25 + *
1.26 + */
1.27 +
1.28 +#ifndef CPU_SPARC_VM_FRAME_SPARC_INLINE_HPP
1.29 +#define CPU_SPARC_VM_FRAME_SPARC_INLINE_HPP
1.30 +
1.31 +#include "asm/macroAssembler.hpp"
1.32 +
1.33 +// Inline functions for SPARC frames:
1.34 +
1.35 +// Constructors
1.36 +
1.37 +inline frame::frame() {
1.38 + _pc = NULL;
1.39 + _sp = NULL;
1.40 + _younger_sp = NULL;
1.41 + _cb = NULL;
1.42 + _deopt_state = unknown;
1.43 + _sp_adjustment_by_callee = 0;
1.44 +}
1.45 +
1.46 +// Accessors:
1.47 +
1.48 +inline bool frame::equal(frame other) const {
1.49 + bool ret = sp() == other.sp()
1.50 + && fp() == other.fp()
1.51 + && pc() == other.pc();
1.52 + assert(!ret || ret && cb() == other.cb() && _deopt_state == other._deopt_state, "inconsistent construction");
1.53 + return ret;
1.54 +}
1.55 +
1.56 +// Return unique id for this frame. The id must have a value where we can distinguish
1.57 +// identity and younger/older relationship. NULL represents an invalid (incomparable)
1.58 +// frame.
1.59 +inline intptr_t* frame::id(void) const { return unextended_sp(); }
1.60 +
1.61 +// Relationals on frames based
1.62 +// Return true if the frame is younger (more recent activation) than the frame represented by id
1.63 +inline bool frame::is_younger(intptr_t* id) const { assert(this->id() != NULL && id != NULL, "NULL frame id");
1.64 + return this->id() < id ; }
1.65 +
1.66 +// Return true if the frame is older (less recent activation) than the frame represented by id
1.67 +inline bool frame::is_older(intptr_t* id) const { assert(this->id() != NULL && id != NULL, "NULL frame id");
1.68 + return this->id() > id ; }
1.69 +
1.70 +inline int frame::frame_size(RegisterMap* map) const { return sender_sp() - sp(); }
1.71 +
1.72 +inline intptr_t* frame::link() const { return (intptr_t *)(fp()[FP->sp_offset_in_saved_window()] + STACK_BIAS); }
1.73 +
1.74 +inline void frame::set_link(intptr_t* addr) { assert(link()==addr, "frame nesting is controlled by hardware"); }
1.75 +
1.76 +inline intptr_t* frame::unextended_sp() const { return sp() + _sp_adjustment_by_callee; }
1.77 +
1.78 +// return address:
1.79 +
1.80 +inline address frame::sender_pc() const { return *I7_addr() + pc_return_offset; }
1.81 +
1.82 +inline address* frame::I7_addr() const { return (address*) &sp()[ I7->sp_offset_in_saved_window()]; }
1.83 +inline address* frame::I0_addr() const { return (address*) &sp()[ I0->sp_offset_in_saved_window()]; }
1.84 +
1.85 +inline address* frame::O7_addr() const { return (address*) &younger_sp()[ I7->sp_offset_in_saved_window()]; }
1.86 +inline address* frame::O0_addr() const { return (address*) &younger_sp()[ I0->sp_offset_in_saved_window()]; }
1.87 +
1.88 +inline intptr_t* frame::sender_sp() const { return fp(); }
1.89 +
1.90 +inline intptr_t* frame::real_fp() const { return fp(); }
1.91 +
1.92 +// Used only in frame::oopmapreg_to_location
1.93 +// This return a value in VMRegImpl::slot_size
1.94 +inline int frame::pd_oop_map_offset_adjustment() const {
1.95 + return _sp_adjustment_by_callee * VMRegImpl::slots_per_word;
1.96 +}
1.97 +
1.98 +#ifdef CC_INTERP
1.99 +inline intptr_t** frame::interpreter_frame_locals_addr() const {
1.100 + interpreterState istate = get_interpreterState();
1.101 + return (intptr_t**) &istate->_locals;
1.102 +}
1.103 +
1.104 +inline intptr_t* frame::interpreter_frame_bcx_addr() const {
1.105 + interpreterState istate = get_interpreterState();
1.106 + return (intptr_t*) &istate->_bcp;
1.107 +}
1.108 +
1.109 +inline intptr_t* frame::interpreter_frame_mdx_addr() const {
1.110 + interpreterState istate = get_interpreterState();
1.111 + return (intptr_t*) &istate->_mdx;
1.112 +}
1.113 +
1.114 +inline jint frame::interpreter_frame_expression_stack_direction() { return -1; }
1.115 +
1.116 +// bottom(base) of the expression stack (highest address)
1.117 +inline intptr_t* frame::interpreter_frame_expression_stack() const {
1.118 + return (intptr_t*)interpreter_frame_monitor_end() - 1;
1.119 +}
1.120 +
1.121 +// top of expression stack (lowest address)
1.122 +inline intptr_t* frame::interpreter_frame_tos_address() const {
1.123 + interpreterState istate = get_interpreterState();
1.124 + return istate->_stack + 1; // Is this off by one? QQQ
1.125 +}
1.126 +
1.127 +// monitor elements
1.128 +
1.129 +// in keeping with Intel side: end is lower in memory than begin;
1.130 +// and beginning element is oldest element
1.131 +// Also begin is one past last monitor.
1.132 +
1.133 +inline BasicObjectLock* frame::interpreter_frame_monitor_begin() const {
1.134 + return get_interpreterState()->monitor_base();
1.135 +}
1.136 +
1.137 +inline BasicObjectLock* frame::interpreter_frame_monitor_end() const {
1.138 + return (BasicObjectLock*) get_interpreterState()->stack_base();
1.139 +}
1.140 +
1.141 +
1.142 +inline int frame::interpreter_frame_monitor_size() {
1.143 + return round_to(BasicObjectLock::size(), WordsPerLong);
1.144 +}
1.145 +
1.146 +inline Method** frame::interpreter_frame_method_addr() const {
1.147 + interpreterState istate = get_interpreterState();
1.148 + return &istate->_method;
1.149 +}
1.150 +
1.151 +
1.152 +// Constant pool cache
1.153 +
1.154 +// where LcpoolCache is saved:
1.155 +inline ConstantPoolCache** frame::interpreter_frame_cpoolcache_addr() const {
1.156 + interpreterState istate = get_interpreterState();
1.157 + return &istate->_constants; // should really use accessor
1.158 + }
1.159 +
1.160 +inline ConstantPoolCache** frame::interpreter_frame_cache_addr() const {
1.161 + interpreterState istate = get_interpreterState();
1.162 + return &istate->_constants;
1.163 +}
1.164 +
1.165 +#else // !CC_INTERP
1.166 +
1.167 +inline intptr_t** frame::interpreter_frame_locals_addr() const {
1.168 + return (intptr_t**) sp_addr_at( Llocals->sp_offset_in_saved_window());
1.169 +}
1.170 +
1.171 +inline intptr_t* frame::interpreter_frame_bcx_addr() const {
1.172 + // %%%%% reinterpreting Lbcp as a bcx
1.173 + return (intptr_t*) sp_addr_at( Lbcp->sp_offset_in_saved_window());
1.174 +}
1.175 +
1.176 +inline intptr_t* frame::interpreter_frame_mdx_addr() const {
1.177 + // %%%%% reinterpreting ImethodDataPtr as a mdx
1.178 + return (intptr_t*) sp_addr_at( ImethodDataPtr->sp_offset_in_saved_window());
1.179 +}
1.180 +
1.181 +inline jint frame::interpreter_frame_expression_stack_direction() { return -1; }
1.182 +
1.183 +// bottom(base) of the expression stack (highest address)
1.184 +inline intptr_t* frame::interpreter_frame_expression_stack() const {
1.185 + return (intptr_t*)interpreter_frame_monitors() - 1;
1.186 +}
1.187 +
1.188 +// top of expression stack (lowest address)
1.189 +inline intptr_t* frame::interpreter_frame_tos_address() const {
1.190 + return *interpreter_frame_esp_addr() + 1;
1.191 +}
1.192 +
1.193 +inline BasicObjectLock** frame::interpreter_frame_monitors_addr() const {
1.194 + return (BasicObjectLock**) sp_addr_at(Lmonitors->sp_offset_in_saved_window());
1.195 +}
1.196 +inline intptr_t** frame::interpreter_frame_esp_addr() const {
1.197 + return (intptr_t**)sp_addr_at(Lesp->sp_offset_in_saved_window());
1.198 +}
1.199 +
1.200 +inline void frame::interpreter_frame_set_tos_address( intptr_t* x ) {
1.201 + *interpreter_frame_esp_addr() = x - 1;
1.202 +}
1.203 +
1.204 +// monitor elements
1.205 +
1.206 +// in keeping with Intel side: end is lower in memory than begin;
1.207 +// and beginning element is oldest element
1.208 +// Also begin is one past last monitor.
1.209 +
1.210 +inline BasicObjectLock* frame::interpreter_frame_monitor_begin() const {
1.211 + int rounded_vm_local_words = round_to(frame::interpreter_frame_vm_local_words, WordsPerLong);
1.212 + return (BasicObjectLock *)fp_addr_at(-rounded_vm_local_words);
1.213 +}
1.214 +
1.215 +inline BasicObjectLock* frame::interpreter_frame_monitor_end() const {
1.216 + return interpreter_frame_monitors();
1.217 +}
1.218 +
1.219 +
1.220 +inline void frame::interpreter_frame_set_monitor_end(BasicObjectLock* value) {
1.221 + interpreter_frame_set_monitors(value);
1.222 +}
1.223 +
1.224 +inline int frame::interpreter_frame_monitor_size() {
1.225 + return round_to(BasicObjectLock::size(), WordsPerLong);
1.226 +}
1.227 +
1.228 +inline Method** frame::interpreter_frame_method_addr() const {
1.229 + return (Method**)sp_addr_at( Lmethod->sp_offset_in_saved_window());
1.230 +}
1.231 +
1.232 +inline BasicObjectLock* frame::interpreter_frame_monitors() const {
1.233 + return *interpreter_frame_monitors_addr();
1.234 +}
1.235 +
1.236 +inline void frame::interpreter_frame_set_monitors(BasicObjectLock* monitors) {
1.237 + *interpreter_frame_monitors_addr() = monitors;
1.238 +}
1.239 +
1.240 +// Constant pool cache
1.241 +
1.242 +// where LcpoolCache is saved:
1.243 +inline ConstantPoolCache** frame::interpreter_frame_cpoolcache_addr() const {
1.244 + return (ConstantPoolCache**)sp_addr_at(LcpoolCache->sp_offset_in_saved_window());
1.245 + }
1.246 +
1.247 +inline ConstantPoolCache** frame::interpreter_frame_cache_addr() const {
1.248 + return (ConstantPoolCache**)sp_addr_at( LcpoolCache->sp_offset_in_saved_window());
1.249 +}
1.250 +
1.251 +inline oop* frame::interpreter_frame_temp_oop_addr() const {
1.252 + return (oop *)(fp() + interpreter_frame_oop_temp_offset);
1.253 +}
1.254 +#endif // CC_INTERP
1.255 +
1.256 +
1.257 +inline JavaCallWrapper** frame::entry_frame_call_wrapper_addr() const {
1.258 + // note: adjust this code if the link argument in StubGenerator::call_stub() changes!
1.259 + const Argument link = Argument(0, false);
1.260 + return (JavaCallWrapper**)&sp()[link.as_in().as_register()->sp_offset_in_saved_window()];
1.261 +}
1.262 +
1.263 +
1.264 +inline int frame::local_offset_for_compiler(int local_index, int nof_args, int max_nof_locals, int max_nof_monitors) {
1.265 + // always allocate non-argument locals 0..5 as if they were arguments:
1.266 + int allocated_above_frame = nof_args;
1.267 + if (allocated_above_frame < callee_register_argument_save_area_words)
1.268 + allocated_above_frame = callee_register_argument_save_area_words;
1.269 + if (allocated_above_frame > max_nof_locals)
1.270 + allocated_above_frame = max_nof_locals;
1.271 +
1.272 + // Note: monitors (BasicLock blocks) are never allocated in argument slots
1.273 + //assert(local_index >= 0 && local_index < max_nof_locals, "bad local index");
1.274 + if (local_index < allocated_above_frame)
1.275 + return local_index + callee_register_argument_save_area_sp_offset;
1.276 + else
1.277 + return local_index - (max_nof_locals + max_nof_monitors*2) + compiler_frame_vm_locals_fp_offset;
1.278 +}
1.279 +
1.280 +inline int frame::monitor_offset_for_compiler(int local_index, int nof_args, int max_nof_locals, int max_nof_monitors) {
1.281 + 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.282 +
1.283 + // The compiler uses the __higher__ of two indexes allocated to the monitor.
1.284 + // Increasing local indexes are mapped to increasing memory locations,
1.285 + // so the start of the BasicLock is associated with the __lower__ index.
1.286 +
1.287 + int offset = (local_index-1) - (max_nof_locals + max_nof_monitors*2) + compiler_frame_vm_locals_fp_offset;
1.288 +
1.289 + // We allocate monitors aligned zero mod 8:
1.290 + assert((offset & 1) == 0, "monitor must be an an even address.");
1.291 + // This works because all monitors are allocated after
1.292 + // all locals, and because the highest address corresponding to any
1.293 + // monitor index is always even.
1.294 + assert((compiler_frame_vm_locals_fp_offset & 1) == 0, "end of monitors must be even address");
1.295 +
1.296 + return offset;
1.297 +}
1.298 +
1.299 +inline int frame::min_local_offset_for_compiler(int nof_args, int max_nof_locals, int max_nof_monitors) {
1.300 + // always allocate non-argument locals 0..5 as if they were arguments:
1.301 + int allocated_above_frame = nof_args;
1.302 + if (allocated_above_frame < callee_register_argument_save_area_words)
1.303 + allocated_above_frame = callee_register_argument_save_area_words;
1.304 + if (allocated_above_frame > max_nof_locals)
1.305 + allocated_above_frame = max_nof_locals;
1.306 +
1.307 + int allocated_in_frame = (max_nof_locals + max_nof_monitors*2) - allocated_above_frame;
1.308 +
1.309 + return compiler_frame_vm_locals_fp_offset - allocated_in_frame;
1.310 +}
1.311 +
1.312 +// On SPARC, the %lN and %iN registers are non-volatile.
1.313 +inline bool frame::volatile_across_calls(Register reg) {
1.314 + // This predicate is (presently) applied only to temporary registers,
1.315 + // and so it need not recognize non-volatile globals.
1.316 + return reg->is_out() || reg->is_global();
1.317 +}
1.318 +
1.319 +inline oop frame::saved_oop_result(RegisterMap* map) const {
1.320 + return *((oop*) map->location(O0->as_VMReg()));
1.321 +}
1.322 +
1.323 +inline void frame::set_saved_oop_result(RegisterMap* map, oop obj) {
1.324 + *((oop*) map->location(O0->as_VMReg())) = obj;
1.325 +}
1.326 +
1.327 +#endif // CPU_SPARC_VM_FRAME_SPARC_INLINE_HPP
