jdk8-mips64-public/hotspot: src/cpu/x86/vm/frame

     1 /*

     2  * Copyright (c) 1997, 2010, Oracle and/or its affiliates. All rights reserved.

     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  */

    25 // Inline functions for Intel frames:

    27 // Constructors:

    29 inline frame::frame() {

    30   _pc = NULL;

    31   _sp = NULL;

    32   _unextended_sp = NULL;

    33   _fp = NULL;

    34   _cb = NULL;

    35   _deopt_state = unknown;

    36 }

    38 inline frame::frame(intptr_t* sp, intptr_t* fp, address pc) {

    39   _sp = sp;

    40   _unextended_sp = sp;

    41   _fp = fp;

    42   _pc = pc;

    43   assert(pc != NULL, "no pc?");

    44   _cb = CodeCache::find_blob(pc);

    46   address original_pc = nmethod::get_deopt_original_pc(this);

    47   if (original_pc != NULL) {

    48     _pc = original_pc;

    49     _deopt_state = is_deoptimized;

    50   } else {

    51     _deopt_state = not_deoptimized;

    52   }

    53 }

    55 inline frame::frame(intptr_t* sp, intptr_t* unextended_sp, intptr_t* fp, address pc) {

    56   _sp = sp;

    57   _unextended_sp = unextended_sp;

    58   _fp = fp;

    59   _pc = pc;

    60   assert(pc != NULL, "no pc?");

    61   _cb = CodeCache::find_blob(pc);

    63   address original_pc = nmethod::get_deopt_original_pc(this);

    64   if (original_pc != NULL) {

    65     _pc = original_pc;

    66     assert(((nmethod*)_cb)->code_contains(_pc), "original PC must be in nmethod");

    67     _deopt_state = is_deoptimized;

    68   } else {

    69     _deopt_state = not_deoptimized;

    70   }

    71 }

    73 inline frame::frame(intptr_t* sp, intptr_t* fp) {

    74   _sp = sp;

    75   _unextended_sp = sp;

    76   _fp = fp;

    77   _pc = (address)(sp[-1]);

    79   // Here's a sticky one. This constructor can be called via AsyncGetCallTrace

    80   // when last_Java_sp is non-null but the pc fetched is junk. If we are truly

    81   // unlucky the junk value could be to a zombied method and we'll die on the

    82   // find_blob call. This is also why we can have no asserts on the validity

    83   // of the pc we find here. AsyncGetCallTrace -> pd_get_top_frame_for_signal_handler

    84   // -> pd_last_frame should use a specialized version of pd_last_frame which could

    85   // call a specilaized frame constructor instead of this one.

    86   // Then we could use the assert below. However this assert is of somewhat dubious

    87   // value.

    88   // assert(_pc != NULL, "no pc?");

    90   _cb = CodeCache::find_blob(_pc);

    92   address original_pc = nmethod::get_deopt_original_pc(this);

    93   if (original_pc != NULL) {

    94     _pc = original_pc;

    95     _deopt_state = is_deoptimized;

    96   } else {

    97     _deopt_state = not_deoptimized;

    98   }

    99 }

   101 // Accessors

   103 inline bool frame::equal(frame other) const {

   104   bool ret =  sp() == other.sp()

   105               && unextended_sp() == other.unextended_sp()

   106               && fp() == other.fp()

   107               && pc() == other.pc();

   108   assert(!ret || ret && cb() == other.cb() && _deopt_state == other._deopt_state, "inconsistent construction");

   109   return ret;

   110 }

   112 // Return unique id for this frame. The id must have a value where we can distinguish

   113 // identity and younger/older relationship. NULL represents an invalid (incomparable)

   114 // frame.

   115 inline intptr_t* frame::id(void) const { return unextended_sp(); }

   117 // Relationals on frames based

   118 // Return true if the frame is younger (more recent activation) than the frame represented by id

   119 inline bool frame::is_younger(intptr_t* id) const { assert(this->id() != NULL && id != NULL, "NULL frame id");

   120                                                     return this->id() < id ; }

   122 // Return true if the frame is older (less recent activation) than the frame represented by id

   123 inline bool frame::is_older(intptr_t* id) const   { assert(this->id() != NULL && id != NULL, "NULL frame id");

   124                                                     return this->id() > id ; }

   128 inline intptr_t* frame::link() const              { return (intptr_t*) *(intptr_t **)addr_at(link_offset); }

   129 inline void      frame::set_link(intptr_t* addr)  { *(intptr_t **)addr_at(link_offset) = addr; }

   132 inline intptr_t* frame::unextended_sp() const     { return _unextended_sp; }

   134 // Return address:

   136 inline address* frame::sender_pc_addr()      const { return (address*) addr_at( return_addr_offset); }

   137 inline address  frame::sender_pc()           const { return *sender_pc_addr(); }

   139 // return address of param, zero origin index.

   140 inline address* frame::native_param_addr(int idx) const { return (address*) addr_at( native_frame_initial_param_offset+idx); }

   142 #ifdef CC_INTERP

   144 inline interpreterState frame::get_interpreterState() const {

   145   return ((interpreterState)addr_at( -((int)sizeof(BytecodeInterpreter))/wordSize ));

   146 }

   148 inline intptr_t*    frame::sender_sp()        const {

   149   // Hmm this seems awfully expensive QQQ, is this really called with interpreted frames?

   150   if (is_interpreted_frame()) {

   151     assert(false, "should never happen");

   152     return get_interpreterState()->sender_sp();

   153   } else {

   154     return            addr_at(sender_sp_offset);

   155   }

   156 }

   158 inline intptr_t** frame::interpreter_frame_locals_addr() const {

   159   assert(is_interpreted_frame(), "must be interpreted");

   160   return &(get_interpreterState()->_locals);

   161 }

   163 inline intptr_t* frame::interpreter_frame_bcx_addr() const {

   164   assert(is_interpreted_frame(), "must be interpreted");

   165   return (intptr_t*) &(get_interpreterState()->_bcp);

   166 }

   169 // Constant pool cache

   171 inline constantPoolCacheOop* frame::interpreter_frame_cache_addr() const {

   172   assert(is_interpreted_frame(), "must be interpreted");

   173   return &(get_interpreterState()->_constants);

   174 }

   176 // Method

   178 inline methodOop* frame::interpreter_frame_method_addr() const {

   179   assert(is_interpreted_frame(), "must be interpreted");

   180   return &(get_interpreterState()->_method);

   181 }

   183 inline intptr_t* frame::interpreter_frame_mdx_addr() const {

   184   assert(is_interpreted_frame(), "must be interpreted");

   185   return (intptr_t*) &(get_interpreterState()->_mdx);

   186 }

   188 // top of expression stack

   189 inline intptr_t* frame::interpreter_frame_tos_address() const {

   190   assert(is_interpreted_frame(), "wrong frame type");

   191   return get_interpreterState()->_stack + 1;

   192 }

   194 #else /* asm interpreter */

   195 inline intptr_t*    frame::sender_sp()        const { return            addr_at(   sender_sp_offset); }

   197 inline intptr_t** frame::interpreter_frame_locals_addr() const {

   198   return (intptr_t**)addr_at(interpreter_frame_locals_offset);

   199 }

   201 inline intptr_t* frame::interpreter_frame_last_sp() const {

   202   return *(intptr_t**)addr_at(interpreter_frame_last_sp_offset);

   203 }

   205 inline intptr_t* frame::interpreter_frame_bcx_addr() const {

   206   return (intptr_t*)addr_at(interpreter_frame_bcx_offset);

   207 }

   210 inline intptr_t* frame::interpreter_frame_mdx_addr() const {

   211   return (intptr_t*)addr_at(interpreter_frame_mdx_offset);

   212 }

   216 // Constant pool cache

   218 inline constantPoolCacheOop* frame::interpreter_frame_cache_addr() const {

   219   return (constantPoolCacheOop*)addr_at(interpreter_frame_cache_offset);

   220 }

   222 // Method

   224 inline methodOop* frame::interpreter_frame_method_addr() const {

   225   return (methodOop*)addr_at(interpreter_frame_method_offset);

   226 }

   228 // top of expression stack

   229 inline intptr_t* frame::interpreter_frame_tos_address() const {

   230   intptr_t* last_sp = interpreter_frame_last_sp();

   231   if (last_sp == NULL) {

   232     return sp();

   233   } else {

   234     // sp() may have been extended or shrunk by an adapter.  At least

   235     // check that we don't fall behind the legal region.

   236     // For top deoptimized frame last_sp == interpreter_frame_monitor_end.

   237     assert(last_sp <= (intptr_t*) interpreter_frame_monitor_end(), "bad tos");

   238     return last_sp;

   239   }

   240 }

   242 #endif /* CC_INTERP */

   244 inline int frame::pd_oop_map_offset_adjustment() const {

   245   return 0;

   246 }

   248 inline int frame::interpreter_frame_monitor_size() {

   249   return BasicObjectLock::size();

   250 }

   253 // expression stack

   254 // (the max_stack arguments are used by the GC; see class FrameClosure)

   256 inline intptr_t* frame::interpreter_frame_expression_stack() const {

   257   intptr_t* monitor_end = (intptr_t*) interpreter_frame_monitor_end();

   258   return monitor_end-1;

   259 }

   262 inline jint frame::interpreter_frame_expression_stack_direction() { return -1; }

   265 // Entry frames

   267 inline JavaCallWrapper* frame::entry_frame_call_wrapper() const {

   268  return (JavaCallWrapper*)at(entry_frame_call_wrapper_offset);

   269 }

   272 // Compiled frames

   274 inline int frame::local_offset_for_compiler(int local_index, int nof_args, int max_nof_locals, int max_nof_monitors) {

   275   return (nof_args - local_index + (local_index < nof_args ? 1: -1));

   276 }

   278 inline int frame::monitor_offset_for_compiler(int local_index, int nof_args, int max_nof_locals, int max_nof_monitors) {

   279   return local_offset_for_compiler(local_index, nof_args, max_nof_locals, max_nof_monitors);

   280 }

   282 inline int frame::min_local_offset_for_compiler(int nof_args, int max_nof_locals, int max_nof_monitors) {

   283   return (nof_args - (max_nof_locals + max_nof_monitors*2) - 1);

   284 }

   286 inline bool frame::volatile_across_calls(Register reg) {

   287   return true;

   288 }

   292 inline oop frame::saved_oop_result(RegisterMap* map) const       {

   293   return *((oop*) map->location(rax->as_VMReg()));

   294 }

   296 inline void frame::set_saved_oop_result(RegisterMap* map, oop obj) {

   297   *((oop*) map->location(rax->as_VMReg())) = obj;

   298 }

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

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

Mercurial > jdk8-mips64-public > hotspot / file revision

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

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