Fri, 07 Jan 2011 10:42:32 -0500
7003271: Hotspot should track cumulative Java heap bytes allocated on a per-thread basis
Summary: Track allocated bytes in Thread's, update on TLAB retirement and direct allocation in Eden and tenured, add JNI methods for ThreadMXBean.
Reviewed-by: coleenp, kvn, dholmes, ysr
duke@435 | 1 | /* |
trims@1907 | 2 | * Copyright (c) 1997, 2010, Oracle and/or its affiliates. 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 | * |
trims@1907 | 19 | * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
trims@1907 | 20 | * or visit www.oracle.com if you need additional information or have any |
trims@1907 | 21 | * questions. |
duke@435 | 22 | * |
duke@435 | 23 | */ |
duke@435 | 24 | |
stefank@2314 | 25 | #ifndef CPU_X86_VM_FRAME_X86_INLINE_HPP |
stefank@2314 | 26 | #define CPU_X86_VM_FRAME_X86_INLINE_HPP |
stefank@2314 | 27 | |
duke@435 | 28 | // Inline functions for Intel frames: |
duke@435 | 29 | |
duke@435 | 30 | // Constructors: |
duke@435 | 31 | |
duke@435 | 32 | inline frame::frame() { |
duke@435 | 33 | _pc = NULL; |
duke@435 | 34 | _sp = NULL; |
duke@435 | 35 | _unextended_sp = NULL; |
duke@435 | 36 | _fp = NULL; |
duke@435 | 37 | _cb = NULL; |
duke@435 | 38 | _deopt_state = unknown; |
duke@435 | 39 | } |
duke@435 | 40 | |
twisti@1639 | 41 | inline frame::frame(intptr_t* sp, intptr_t* fp, address pc) { |
duke@435 | 42 | _sp = sp; |
duke@435 | 43 | _unextended_sp = sp; |
duke@435 | 44 | _fp = fp; |
duke@435 | 45 | _pc = pc; |
duke@435 | 46 | assert(pc != NULL, "no pc?"); |
duke@435 | 47 | _cb = CodeCache::find_blob(pc); |
twisti@1639 | 48 | |
twisti@1639 | 49 | address original_pc = nmethod::get_deopt_original_pc(this); |
twisti@1639 | 50 | if (original_pc != NULL) { |
twisti@1639 | 51 | _pc = original_pc; |
duke@435 | 52 | _deopt_state = is_deoptimized; |
duke@435 | 53 | } else { |
duke@435 | 54 | _deopt_state = not_deoptimized; |
duke@435 | 55 | } |
duke@435 | 56 | } |
duke@435 | 57 | |
twisti@1639 | 58 | inline frame::frame(intptr_t* sp, intptr_t* unextended_sp, intptr_t* fp, address pc) { |
duke@435 | 59 | _sp = sp; |
duke@435 | 60 | _unextended_sp = unextended_sp; |
duke@435 | 61 | _fp = fp; |
duke@435 | 62 | _pc = pc; |
duke@435 | 63 | assert(pc != NULL, "no pc?"); |
duke@435 | 64 | _cb = CodeCache::find_blob(pc); |
twisti@1639 | 65 | |
twisti@1639 | 66 | address original_pc = nmethod::get_deopt_original_pc(this); |
twisti@1639 | 67 | if (original_pc != NULL) { |
twisti@1639 | 68 | _pc = original_pc; |
twisti@2103 | 69 | assert(((nmethod*)_cb)->insts_contains(_pc), "original PC must be in nmethod"); |
duke@435 | 70 | _deopt_state = is_deoptimized; |
duke@435 | 71 | } else { |
duke@435 | 72 | _deopt_state = not_deoptimized; |
duke@435 | 73 | } |
duke@435 | 74 | } |
duke@435 | 75 | |
duke@435 | 76 | inline frame::frame(intptr_t* sp, intptr_t* fp) { |
duke@435 | 77 | _sp = sp; |
duke@435 | 78 | _unextended_sp = sp; |
duke@435 | 79 | _fp = fp; |
duke@435 | 80 | _pc = (address)(sp[-1]); |
sgoldman@542 | 81 | |
sgoldman@542 | 82 | // Here's a sticky one. This constructor can be called via AsyncGetCallTrace |
sgoldman@542 | 83 | // when last_Java_sp is non-null but the pc fetched is junk. If we are truly |
sgoldman@542 | 84 | // unlucky the junk value could be to a zombied method and we'll die on the |
sgoldman@542 | 85 | // find_blob call. This is also why we can have no asserts on the validity |
sgoldman@542 | 86 | // of the pc we find here. AsyncGetCallTrace -> pd_get_top_frame_for_signal_handler |
sgoldman@542 | 87 | // -> pd_last_frame should use a specialized version of pd_last_frame which could |
sgoldman@542 | 88 | // call a specilaized frame constructor instead of this one. |
sgoldman@542 | 89 | // Then we could use the assert below. However this assert is of somewhat dubious |
sgoldman@542 | 90 | // value. |
sgoldman@542 | 91 | // assert(_pc != NULL, "no pc?"); |
sgoldman@542 | 92 | |
duke@435 | 93 | _cb = CodeCache::find_blob(_pc); |
duke@435 | 94 | |
twisti@1639 | 95 | address original_pc = nmethod::get_deopt_original_pc(this); |
twisti@1639 | 96 | if (original_pc != NULL) { |
twisti@1639 | 97 | _pc = original_pc; |
duke@435 | 98 | _deopt_state = is_deoptimized; |
duke@435 | 99 | } else { |
duke@435 | 100 | _deopt_state = not_deoptimized; |
duke@435 | 101 | } |
duke@435 | 102 | } |
duke@435 | 103 | |
duke@435 | 104 | // Accessors |
duke@435 | 105 | |
duke@435 | 106 | inline bool frame::equal(frame other) const { |
duke@435 | 107 | bool ret = sp() == other.sp() |
duke@435 | 108 | && unextended_sp() == other.unextended_sp() |
duke@435 | 109 | && fp() == other.fp() |
duke@435 | 110 | && pc() == other.pc(); |
duke@435 | 111 | assert(!ret || ret && cb() == other.cb() && _deopt_state == other._deopt_state, "inconsistent construction"); |
duke@435 | 112 | return ret; |
duke@435 | 113 | } |
duke@435 | 114 | |
duke@435 | 115 | // Return unique id for this frame. The id must have a value where we can distinguish |
duke@435 | 116 | // identity and younger/older relationship. NULL represents an invalid (incomparable) |
duke@435 | 117 | // frame. |
duke@435 | 118 | inline intptr_t* frame::id(void) const { return unextended_sp(); } |
duke@435 | 119 | |
duke@435 | 120 | // Relationals on frames based |
duke@435 | 121 | // Return true if the frame is younger (more recent activation) than the frame represented by id |
duke@435 | 122 | inline bool frame::is_younger(intptr_t* id) const { assert(this->id() != NULL && id != NULL, "NULL frame id"); |
duke@435 | 123 | return this->id() < id ; } |
duke@435 | 124 | |
duke@435 | 125 | // Return true if the frame is older (less recent activation) than the frame represented by id |
duke@435 | 126 | inline bool frame::is_older(intptr_t* id) const { assert(this->id() != NULL && id != NULL, "NULL frame id"); |
duke@435 | 127 | return this->id() > id ; } |
duke@435 | 128 | |
duke@435 | 129 | |
duke@435 | 130 | |
duke@435 | 131 | inline intptr_t* frame::link() const { return (intptr_t*) *(intptr_t **)addr_at(link_offset); } |
duke@435 | 132 | inline void frame::set_link(intptr_t* addr) { *(intptr_t **)addr_at(link_offset) = addr; } |
duke@435 | 133 | |
duke@435 | 134 | |
duke@435 | 135 | inline intptr_t* frame::unextended_sp() const { return _unextended_sp; } |
duke@435 | 136 | |
duke@435 | 137 | // Return address: |
duke@435 | 138 | |
duke@435 | 139 | inline address* frame::sender_pc_addr() const { return (address*) addr_at( return_addr_offset); } |
duke@435 | 140 | inline address frame::sender_pc() const { return *sender_pc_addr(); } |
duke@435 | 141 | |
duke@435 | 142 | // return address of param, zero origin index. |
duke@435 | 143 | inline address* frame::native_param_addr(int idx) const { return (address*) addr_at( native_frame_initial_param_offset+idx); } |
duke@435 | 144 | |
duke@435 | 145 | #ifdef CC_INTERP |
duke@435 | 146 | |
duke@435 | 147 | inline interpreterState frame::get_interpreterState() const { |
coleenp@955 | 148 | return ((interpreterState)addr_at( -((int)sizeof(BytecodeInterpreter))/wordSize )); |
duke@435 | 149 | } |
duke@435 | 150 | |
duke@435 | 151 | inline intptr_t* frame::sender_sp() const { |
duke@435 | 152 | // Hmm this seems awfully expensive QQQ, is this really called with interpreted frames? |
duke@435 | 153 | if (is_interpreted_frame()) { |
duke@435 | 154 | assert(false, "should never happen"); |
duke@435 | 155 | return get_interpreterState()->sender_sp(); |
duke@435 | 156 | } else { |
duke@435 | 157 | return addr_at(sender_sp_offset); |
duke@435 | 158 | } |
duke@435 | 159 | } |
duke@435 | 160 | |
duke@435 | 161 | inline intptr_t** frame::interpreter_frame_locals_addr() const { |
duke@435 | 162 | assert(is_interpreted_frame(), "must be interpreted"); |
duke@435 | 163 | return &(get_interpreterState()->_locals); |
duke@435 | 164 | } |
duke@435 | 165 | |
duke@435 | 166 | inline intptr_t* frame::interpreter_frame_bcx_addr() const { |
duke@435 | 167 | assert(is_interpreted_frame(), "must be interpreted"); |
never@739 | 168 | return (intptr_t*) &(get_interpreterState()->_bcp); |
duke@435 | 169 | } |
duke@435 | 170 | |
duke@435 | 171 | |
duke@435 | 172 | // Constant pool cache |
duke@435 | 173 | |
duke@435 | 174 | inline constantPoolCacheOop* frame::interpreter_frame_cache_addr() const { |
duke@435 | 175 | assert(is_interpreted_frame(), "must be interpreted"); |
duke@435 | 176 | return &(get_interpreterState()->_constants); |
duke@435 | 177 | } |
duke@435 | 178 | |
duke@435 | 179 | // Method |
duke@435 | 180 | |
duke@435 | 181 | inline methodOop* frame::interpreter_frame_method_addr() const { |
duke@435 | 182 | assert(is_interpreted_frame(), "must be interpreted"); |
duke@435 | 183 | return &(get_interpreterState()->_method); |
duke@435 | 184 | } |
duke@435 | 185 | |
duke@435 | 186 | inline intptr_t* frame::interpreter_frame_mdx_addr() const { |
duke@435 | 187 | assert(is_interpreted_frame(), "must be interpreted"); |
never@739 | 188 | return (intptr_t*) &(get_interpreterState()->_mdx); |
duke@435 | 189 | } |
duke@435 | 190 | |
duke@435 | 191 | // top of expression stack |
duke@435 | 192 | inline intptr_t* frame::interpreter_frame_tos_address() const { |
duke@435 | 193 | assert(is_interpreted_frame(), "wrong frame type"); |
duke@435 | 194 | return get_interpreterState()->_stack + 1; |
duke@435 | 195 | } |
duke@435 | 196 | |
duke@435 | 197 | #else /* asm interpreter */ |
duke@435 | 198 | inline intptr_t* frame::sender_sp() const { return addr_at( sender_sp_offset); } |
duke@435 | 199 | |
duke@435 | 200 | inline intptr_t** frame::interpreter_frame_locals_addr() const { |
duke@435 | 201 | return (intptr_t**)addr_at(interpreter_frame_locals_offset); |
duke@435 | 202 | } |
duke@435 | 203 | |
duke@435 | 204 | inline intptr_t* frame::interpreter_frame_last_sp() const { |
duke@435 | 205 | return *(intptr_t**)addr_at(interpreter_frame_last_sp_offset); |
duke@435 | 206 | } |
duke@435 | 207 | |
duke@435 | 208 | inline intptr_t* frame::interpreter_frame_bcx_addr() const { |
duke@435 | 209 | return (intptr_t*)addr_at(interpreter_frame_bcx_offset); |
duke@435 | 210 | } |
duke@435 | 211 | |
duke@435 | 212 | |
duke@435 | 213 | inline intptr_t* frame::interpreter_frame_mdx_addr() const { |
duke@435 | 214 | return (intptr_t*)addr_at(interpreter_frame_mdx_offset); |
duke@435 | 215 | } |
duke@435 | 216 | |
duke@435 | 217 | |
duke@435 | 218 | |
duke@435 | 219 | // Constant pool cache |
duke@435 | 220 | |
duke@435 | 221 | inline constantPoolCacheOop* frame::interpreter_frame_cache_addr() const { |
duke@435 | 222 | return (constantPoolCacheOop*)addr_at(interpreter_frame_cache_offset); |
duke@435 | 223 | } |
duke@435 | 224 | |
duke@435 | 225 | // Method |
duke@435 | 226 | |
duke@435 | 227 | inline methodOop* frame::interpreter_frame_method_addr() const { |
duke@435 | 228 | return (methodOop*)addr_at(interpreter_frame_method_offset); |
duke@435 | 229 | } |
duke@435 | 230 | |
duke@435 | 231 | // top of expression stack |
duke@435 | 232 | inline intptr_t* frame::interpreter_frame_tos_address() const { |
duke@435 | 233 | intptr_t* last_sp = interpreter_frame_last_sp(); |
twisti@1572 | 234 | if (last_sp == NULL) { |
duke@435 | 235 | return sp(); |
duke@435 | 236 | } else { |
twisti@1572 | 237 | // sp() may have been extended or shrunk by an adapter. At least |
twisti@1572 | 238 | // check that we don't fall behind the legal region. |
kvn@1690 | 239 | // For top deoptimized frame last_sp == interpreter_frame_monitor_end. |
kvn@1690 | 240 | assert(last_sp <= (intptr_t*) interpreter_frame_monitor_end(), "bad tos"); |
duke@435 | 241 | return last_sp; |
duke@435 | 242 | } |
duke@435 | 243 | } |
duke@435 | 244 | |
duke@435 | 245 | #endif /* CC_INTERP */ |
duke@435 | 246 | |
duke@435 | 247 | inline int frame::pd_oop_map_offset_adjustment() const { |
duke@435 | 248 | return 0; |
duke@435 | 249 | } |
duke@435 | 250 | |
duke@435 | 251 | inline int frame::interpreter_frame_monitor_size() { |
duke@435 | 252 | return BasicObjectLock::size(); |
duke@435 | 253 | } |
duke@435 | 254 | |
duke@435 | 255 | |
duke@435 | 256 | // expression stack |
duke@435 | 257 | // (the max_stack arguments are used by the GC; see class FrameClosure) |
duke@435 | 258 | |
duke@435 | 259 | inline intptr_t* frame::interpreter_frame_expression_stack() const { |
duke@435 | 260 | intptr_t* monitor_end = (intptr_t*) interpreter_frame_monitor_end(); |
duke@435 | 261 | return monitor_end-1; |
duke@435 | 262 | } |
duke@435 | 263 | |
duke@435 | 264 | |
duke@435 | 265 | inline jint frame::interpreter_frame_expression_stack_direction() { return -1; } |
duke@435 | 266 | |
duke@435 | 267 | |
duke@435 | 268 | // Entry frames |
duke@435 | 269 | |
duke@435 | 270 | inline JavaCallWrapper* frame::entry_frame_call_wrapper() const { |
duke@435 | 271 | return (JavaCallWrapper*)at(entry_frame_call_wrapper_offset); |
duke@435 | 272 | } |
duke@435 | 273 | |
duke@435 | 274 | |
duke@435 | 275 | // Compiled frames |
duke@435 | 276 | |
duke@435 | 277 | inline int frame::local_offset_for_compiler(int local_index, int nof_args, int max_nof_locals, int max_nof_monitors) { |
duke@435 | 278 | return (nof_args - local_index + (local_index < nof_args ? 1: -1)); |
duke@435 | 279 | } |
duke@435 | 280 | |
duke@435 | 281 | inline int frame::monitor_offset_for_compiler(int local_index, int nof_args, int max_nof_locals, int max_nof_monitors) { |
duke@435 | 282 | return local_offset_for_compiler(local_index, nof_args, max_nof_locals, max_nof_monitors); |
duke@435 | 283 | } |
duke@435 | 284 | |
duke@435 | 285 | inline int frame::min_local_offset_for_compiler(int nof_args, int max_nof_locals, int max_nof_monitors) { |
duke@435 | 286 | return (nof_args - (max_nof_locals + max_nof_monitors*2) - 1); |
duke@435 | 287 | } |
duke@435 | 288 | |
duke@435 | 289 | inline bool frame::volatile_across_calls(Register reg) { |
duke@435 | 290 | return true; |
duke@435 | 291 | } |
duke@435 | 292 | |
duke@435 | 293 | |
duke@435 | 294 | |
duke@435 | 295 | inline oop frame::saved_oop_result(RegisterMap* map) const { |
duke@435 | 296 | return *((oop*) map->location(rax->as_VMReg())); |
duke@435 | 297 | } |
duke@435 | 298 | |
duke@435 | 299 | inline void frame::set_saved_oop_result(RegisterMap* map, oop obj) { |
duke@435 | 300 | *((oop*) map->location(rax->as_VMReg())) = obj; |
duke@435 | 301 | } |
stefank@2314 | 302 | |
stefank@2314 | 303 | #endif // CPU_X86_VM_FRAME_X86_INLINE_HPP |