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 | /* |
stefank@2314 | 2 | * Copyright (c) 2003, 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 | #include "precompiled.hpp" |
stefank@2314 | 26 | #include "asm/assembler.hpp" |
stefank@2314 | 27 | #include "interpreter/bytecodeHistogram.hpp" |
stefank@2314 | 28 | #include "interpreter/interpreter.hpp" |
stefank@2314 | 29 | #include "interpreter/interpreterGenerator.hpp" |
stefank@2314 | 30 | #include "interpreter/interpreterRuntime.hpp" |
stefank@2314 | 31 | #include "interpreter/templateTable.hpp" |
stefank@2314 | 32 | #include "oops/arrayOop.hpp" |
stefank@2314 | 33 | #include "oops/methodDataOop.hpp" |
stefank@2314 | 34 | #include "oops/methodOop.hpp" |
stefank@2314 | 35 | #include "oops/oop.inline.hpp" |
stefank@2314 | 36 | #include "prims/jvmtiExport.hpp" |
stefank@2314 | 37 | #include "prims/jvmtiThreadState.hpp" |
stefank@2314 | 38 | #include "prims/methodHandles.hpp" |
stefank@2314 | 39 | #include "runtime/arguments.hpp" |
stefank@2314 | 40 | #include "runtime/deoptimization.hpp" |
stefank@2314 | 41 | #include "runtime/frame.inline.hpp" |
stefank@2314 | 42 | #include "runtime/sharedRuntime.hpp" |
stefank@2314 | 43 | #include "runtime/stubRoutines.hpp" |
stefank@2314 | 44 | #include "runtime/synchronizer.hpp" |
stefank@2314 | 45 | #include "runtime/timer.hpp" |
stefank@2314 | 46 | #include "runtime/vframeArray.hpp" |
stefank@2314 | 47 | #include "utilities/debug.hpp" |
stefank@2314 | 48 | #ifdef COMPILER1 |
stefank@2314 | 49 | #include "c1/c1_Runtime1.hpp" |
stefank@2314 | 50 | #endif |
duke@435 | 51 | |
duke@435 | 52 | #define __ _masm-> |
duke@435 | 53 | |
duke@435 | 54 | |
duke@435 | 55 | #ifdef _WIN64 |
duke@435 | 56 | address AbstractInterpreterGenerator::generate_slow_signature_handler() { |
duke@435 | 57 | address entry = __ pc(); |
duke@435 | 58 | |
duke@435 | 59 | // rbx: method |
duke@435 | 60 | // r14: pointer to locals |
duke@435 | 61 | // c_rarg3: first stack arg - wordSize |
never@739 | 62 | __ mov(c_rarg3, rsp); |
duke@435 | 63 | // adjust rsp |
never@739 | 64 | __ subptr(rsp, 4 * wordSize); |
duke@435 | 65 | __ call_VM(noreg, |
duke@435 | 66 | CAST_FROM_FN_PTR(address, |
duke@435 | 67 | InterpreterRuntime::slow_signature_handler), |
duke@435 | 68 | rbx, r14, c_rarg3); |
duke@435 | 69 | |
duke@435 | 70 | // rax: result handler |
duke@435 | 71 | |
duke@435 | 72 | // Stack layout: |
duke@435 | 73 | // rsp: 3 integer or float args (if static first is unused) |
duke@435 | 74 | // 1 float/double identifiers |
duke@435 | 75 | // return address |
duke@435 | 76 | // stack args |
duke@435 | 77 | // garbage |
duke@435 | 78 | // expression stack bottom |
duke@435 | 79 | // bcp (NULL) |
duke@435 | 80 | // ... |
duke@435 | 81 | |
duke@435 | 82 | // Do FP first so we can use c_rarg3 as temp |
duke@435 | 83 | __ movl(c_rarg3, Address(rsp, 3 * wordSize)); // float/double identifiers |
duke@435 | 84 | |
duke@435 | 85 | for ( int i= 0; i < Argument::n_int_register_parameters_c-1; i++ ) { |
duke@435 | 86 | XMMRegister floatreg = as_XMMRegister(i+1); |
duke@435 | 87 | Label isfloatordouble, isdouble, next; |
duke@435 | 88 | |
duke@435 | 89 | __ testl(c_rarg3, 1 << (i*2)); // Float or Double? |
duke@435 | 90 | __ jcc(Assembler::notZero, isfloatordouble); |
duke@435 | 91 | |
duke@435 | 92 | // Do Int register here |
duke@435 | 93 | switch ( i ) { |
duke@435 | 94 | case 0: |
duke@435 | 95 | __ movl(rscratch1, Address(rbx, methodOopDesc::access_flags_offset())); |
duke@435 | 96 | __ testl(rscratch1, JVM_ACC_STATIC); |
never@739 | 97 | __ cmovptr(Assembler::zero, c_rarg1, Address(rsp, 0)); |
duke@435 | 98 | break; |
duke@435 | 99 | case 1: |
never@739 | 100 | __ movptr(c_rarg2, Address(rsp, wordSize)); |
duke@435 | 101 | break; |
duke@435 | 102 | case 2: |
never@739 | 103 | __ movptr(c_rarg3, Address(rsp, 2 * wordSize)); |
duke@435 | 104 | break; |
duke@435 | 105 | default: |
duke@435 | 106 | break; |
duke@435 | 107 | } |
duke@435 | 108 | |
duke@435 | 109 | __ jmp (next); |
duke@435 | 110 | |
duke@435 | 111 | __ bind(isfloatordouble); |
duke@435 | 112 | __ testl(c_rarg3, 1 << ((i*2)+1)); // Double? |
duke@435 | 113 | __ jcc(Assembler::notZero, isdouble); |
duke@435 | 114 | |
duke@435 | 115 | // Do Float Here |
duke@435 | 116 | __ movflt(floatreg, Address(rsp, i * wordSize)); |
duke@435 | 117 | __ jmp(next); |
duke@435 | 118 | |
duke@435 | 119 | // Do Double here |
duke@435 | 120 | __ bind(isdouble); |
duke@435 | 121 | __ movdbl(floatreg, Address(rsp, i * wordSize)); |
duke@435 | 122 | |
duke@435 | 123 | __ bind(next); |
duke@435 | 124 | } |
duke@435 | 125 | |
duke@435 | 126 | |
duke@435 | 127 | // restore rsp |
never@739 | 128 | __ addptr(rsp, 4 * wordSize); |
duke@435 | 129 | |
duke@435 | 130 | __ ret(0); |
duke@435 | 131 | |
duke@435 | 132 | return entry; |
duke@435 | 133 | } |
duke@435 | 134 | #else |
duke@435 | 135 | address AbstractInterpreterGenerator::generate_slow_signature_handler() { |
duke@435 | 136 | address entry = __ pc(); |
duke@435 | 137 | |
duke@435 | 138 | // rbx: method |
duke@435 | 139 | // r14: pointer to locals |
duke@435 | 140 | // c_rarg3: first stack arg - wordSize |
never@739 | 141 | __ mov(c_rarg3, rsp); |
duke@435 | 142 | // adjust rsp |
never@739 | 143 | __ subptr(rsp, 14 * wordSize); |
duke@435 | 144 | __ call_VM(noreg, |
duke@435 | 145 | CAST_FROM_FN_PTR(address, |
duke@435 | 146 | InterpreterRuntime::slow_signature_handler), |
duke@435 | 147 | rbx, r14, c_rarg3); |
duke@435 | 148 | |
duke@435 | 149 | // rax: result handler |
duke@435 | 150 | |
duke@435 | 151 | // Stack layout: |
duke@435 | 152 | // rsp: 5 integer args (if static first is unused) |
duke@435 | 153 | // 1 float/double identifiers |
duke@435 | 154 | // 8 double args |
duke@435 | 155 | // return address |
duke@435 | 156 | // stack args |
duke@435 | 157 | // garbage |
duke@435 | 158 | // expression stack bottom |
duke@435 | 159 | // bcp (NULL) |
duke@435 | 160 | // ... |
duke@435 | 161 | |
duke@435 | 162 | // Do FP first so we can use c_rarg3 as temp |
duke@435 | 163 | __ movl(c_rarg3, Address(rsp, 5 * wordSize)); // float/double identifiers |
duke@435 | 164 | |
duke@435 | 165 | for (int i = 0; i < Argument::n_float_register_parameters_c; i++) { |
duke@435 | 166 | const XMMRegister r = as_XMMRegister(i); |
duke@435 | 167 | |
duke@435 | 168 | Label d, done; |
duke@435 | 169 | |
duke@435 | 170 | __ testl(c_rarg3, 1 << i); |
duke@435 | 171 | __ jcc(Assembler::notZero, d); |
duke@435 | 172 | __ movflt(r, Address(rsp, (6 + i) * wordSize)); |
duke@435 | 173 | __ jmp(done); |
duke@435 | 174 | __ bind(d); |
duke@435 | 175 | __ movdbl(r, Address(rsp, (6 + i) * wordSize)); |
duke@435 | 176 | __ bind(done); |
duke@435 | 177 | } |
duke@435 | 178 | |
duke@435 | 179 | // Now handle integrals. Only do c_rarg1 if not static. |
duke@435 | 180 | __ movl(c_rarg3, Address(rbx, methodOopDesc::access_flags_offset())); |
duke@435 | 181 | __ testl(c_rarg3, JVM_ACC_STATIC); |
never@739 | 182 | __ cmovptr(Assembler::zero, c_rarg1, Address(rsp, 0)); |
duke@435 | 183 | |
never@739 | 184 | __ movptr(c_rarg2, Address(rsp, wordSize)); |
never@739 | 185 | __ movptr(c_rarg3, Address(rsp, 2 * wordSize)); |
never@739 | 186 | __ movptr(c_rarg4, Address(rsp, 3 * wordSize)); |
never@739 | 187 | __ movptr(c_rarg5, Address(rsp, 4 * wordSize)); |
duke@435 | 188 | |
duke@435 | 189 | // restore rsp |
never@739 | 190 | __ addptr(rsp, 14 * wordSize); |
duke@435 | 191 | |
duke@435 | 192 | __ ret(0); |
duke@435 | 193 | |
duke@435 | 194 | return entry; |
duke@435 | 195 | } |
duke@435 | 196 | #endif |
duke@435 | 197 | |
duke@435 | 198 | |
duke@435 | 199 | // |
duke@435 | 200 | // Various method entries |
duke@435 | 201 | // |
duke@435 | 202 | |
never@739 | 203 | address InterpreterGenerator::generate_math_entry(AbstractInterpreter::MethodKind kind) { |
never@739 | 204 | |
never@739 | 205 | // rbx,: methodOop |
never@739 | 206 | // rcx: scratrch |
never@739 | 207 | // r13: sender sp |
duke@435 | 208 | |
duke@435 | 209 | if (!InlineIntrinsics) return NULL; // Generate a vanilla entry |
duke@435 | 210 | |
duke@435 | 211 | address entry_point = __ pc(); |
duke@435 | 212 | |
duke@435 | 213 | // These don't need a safepoint check because they aren't virtually |
duke@435 | 214 | // callable. We won't enter these intrinsics from compiled code. |
duke@435 | 215 | // If in the future we added an intrinsic which was virtually callable |
duke@435 | 216 | // we'd have to worry about how to safepoint so that this code is used. |
duke@435 | 217 | |
duke@435 | 218 | // mathematical functions inlined by compiler |
duke@435 | 219 | // (interpreter must provide identical implementation |
duke@435 | 220 | // in order to avoid monotonicity bugs when switching |
duke@435 | 221 | // from interpreter to compiler in the middle of some |
duke@435 | 222 | // computation) |
never@739 | 223 | // |
never@739 | 224 | // stack: [ ret adr ] <-- rsp |
never@739 | 225 | // [ lo(arg) ] |
never@739 | 226 | // [ hi(arg) ] |
never@739 | 227 | // |
duke@435 | 228 | |
duke@435 | 229 | // Note: For JDK 1.2 StrictMath doesn't exist and Math.sin/cos/sqrt are |
duke@435 | 230 | // native methods. Interpreter::method_kind(...) does a check for |
duke@435 | 231 | // native methods first before checking for intrinsic methods and |
duke@435 | 232 | // thus will never select this entry point. Make sure it is not |
duke@435 | 233 | // called accidentally since the SharedRuntime entry points will |
duke@435 | 234 | // not work for JDK 1.2. |
duke@435 | 235 | // |
duke@435 | 236 | // We no longer need to check for JDK 1.2 since it's EOL'ed. |
duke@435 | 237 | // The following check existed in pre 1.6 implementation, |
duke@435 | 238 | // if (Universe::is_jdk12x_version()) { |
duke@435 | 239 | // __ should_not_reach_here(); |
duke@435 | 240 | // } |
duke@435 | 241 | // Universe::is_jdk12x_version() always returns false since |
duke@435 | 242 | // the JDK version is not yet determined when this method is called. |
duke@435 | 243 | // This method is called during interpreter_init() whereas |
duke@435 | 244 | // JDK version is only determined when universe2_init() is called. |
duke@435 | 245 | |
duke@435 | 246 | // Note: For JDK 1.3 StrictMath exists and Math.sin/cos/sqrt are |
duke@435 | 247 | // java methods. Interpreter::method_kind(...) will select |
duke@435 | 248 | // this entry point for the corresponding methods in JDK 1.3. |
never@739 | 249 | // get argument |
duke@435 | 250 | |
never@739 | 251 | if (kind == Interpreter::java_lang_math_sqrt) { |
never@739 | 252 | __ sqrtsd(xmm0, Address(rsp, wordSize)); |
never@739 | 253 | } else { |
never@739 | 254 | __ fld_d(Address(rsp, wordSize)); |
never@739 | 255 | switch (kind) { |
never@739 | 256 | case Interpreter::java_lang_math_sin : |
never@739 | 257 | __ trigfunc('s'); |
never@739 | 258 | break; |
never@739 | 259 | case Interpreter::java_lang_math_cos : |
never@739 | 260 | __ trigfunc('c'); |
never@739 | 261 | break; |
never@739 | 262 | case Interpreter::java_lang_math_tan : |
never@739 | 263 | __ trigfunc('t'); |
never@739 | 264 | break; |
never@739 | 265 | case Interpreter::java_lang_math_abs: |
never@739 | 266 | __ fabs(); |
never@739 | 267 | break; |
never@739 | 268 | case Interpreter::java_lang_math_log: |
never@739 | 269 | __ flog(); |
never@739 | 270 | break; |
never@739 | 271 | case Interpreter::java_lang_math_log10: |
never@739 | 272 | __ flog10(); |
never@739 | 273 | break; |
never@739 | 274 | default : |
never@739 | 275 | ShouldNotReachHere(); |
never@739 | 276 | } |
never@739 | 277 | |
never@739 | 278 | // return double result in xmm0 for interpreter and compilers. |
never@739 | 279 | __ subptr(rsp, 2*wordSize); |
never@739 | 280 | // Round to 64bit precision |
never@739 | 281 | __ fstp_d(Address(rsp, 0)); |
never@739 | 282 | __ movdbl(xmm0, Address(rsp, 0)); |
never@739 | 283 | __ addptr(rsp, 2*wordSize); |
never@739 | 284 | } |
never@739 | 285 | |
never@739 | 286 | |
never@739 | 287 | __ pop(rax); |
never@739 | 288 | __ mov(rsp, r13); |
duke@435 | 289 | __ jmp(rax); |
duke@435 | 290 | |
duke@435 | 291 | return entry_point; |
duke@435 | 292 | } |
duke@435 | 293 | |
duke@435 | 294 | |
duke@435 | 295 | // Abstract method entry |
duke@435 | 296 | // Attempt to execute abstract method. Throw exception |
duke@435 | 297 | address InterpreterGenerator::generate_abstract_entry(void) { |
duke@435 | 298 | // rbx: methodOop |
duke@435 | 299 | // r13: sender SP |
duke@435 | 300 | |
duke@435 | 301 | address entry_point = __ pc(); |
duke@435 | 302 | |
duke@435 | 303 | // abstract method entry |
duke@435 | 304 | |
twisti@1543 | 305 | // pop return address, reset last_sp to NULL |
twisti@1543 | 306 | __ empty_expression_stack(); |
twisti@1543 | 307 | __ restore_bcp(); // rsi must be correct for exception handler (was destroyed) |
twisti@1543 | 308 | __ restore_locals(); // make sure locals pointer is correct as well (was destroyed) |
duke@435 | 309 | |
duke@435 | 310 | // throw exception |
duke@435 | 311 | __ call_VM(noreg, CAST_FROM_FN_PTR(address, |
duke@435 | 312 | InterpreterRuntime::throw_AbstractMethodError)); |
duke@435 | 313 | // the call_VM checks for exception, so we should never return here. |
duke@435 | 314 | __ should_not_reach_here(); |
duke@435 | 315 | |
duke@435 | 316 | return entry_point; |
duke@435 | 317 | } |
duke@435 | 318 | |
duke@435 | 319 | |
jrose@1145 | 320 | // Method handle invoker |
jrose@1145 | 321 | // Dispatch a method of the form java.dyn.MethodHandles::invoke(...) |
jrose@1145 | 322 | address InterpreterGenerator::generate_method_handle_entry(void) { |
jrose@1145 | 323 | if (!EnableMethodHandles) { |
jrose@1145 | 324 | return generate_abstract_entry(); |
jrose@1145 | 325 | } |
twisti@1543 | 326 | |
twisti@1543 | 327 | address entry_point = MethodHandles::generate_method_handle_interpreter_entry(_masm); |
twisti@1543 | 328 | |
twisti@1543 | 329 | return entry_point; |
jrose@1145 | 330 | } |
jrose@1145 | 331 | |
jrose@1145 | 332 | |
duke@435 | 333 | // Empty method, generate a very fast return. |
duke@435 | 334 | |
duke@435 | 335 | address InterpreterGenerator::generate_empty_entry(void) { |
duke@435 | 336 | // rbx: methodOop |
duke@435 | 337 | // r13: sender sp must set sp to this value on return |
duke@435 | 338 | |
duke@435 | 339 | if (!UseFastEmptyMethods) { |
duke@435 | 340 | return NULL; |
duke@435 | 341 | } |
duke@435 | 342 | |
duke@435 | 343 | address entry_point = __ pc(); |
duke@435 | 344 | |
duke@435 | 345 | // If we need a safepoint check, generate full interpreter entry. |
duke@435 | 346 | Label slow_path; |
duke@435 | 347 | __ cmp32(ExternalAddress(SafepointSynchronize::address_of_state()), |
duke@435 | 348 | SafepointSynchronize::_not_synchronized); |
duke@435 | 349 | __ jcc(Assembler::notEqual, slow_path); |
duke@435 | 350 | |
duke@435 | 351 | // do nothing for empty methods (do not even increment invocation counter) |
duke@435 | 352 | // Code: _return |
duke@435 | 353 | // _return |
duke@435 | 354 | // return w/o popping parameters |
never@739 | 355 | __ pop(rax); |
never@739 | 356 | __ mov(rsp, r13); |
duke@435 | 357 | __ jmp(rax); |
duke@435 | 358 | |
duke@435 | 359 | __ bind(slow_path); |
duke@435 | 360 | (void) generate_normal_entry(false); |
duke@435 | 361 | return entry_point; |
duke@435 | 362 | |
duke@435 | 363 | } |
duke@435 | 364 | |
duke@435 | 365 | // This method tells the deoptimizer how big an interpreted frame must be: |
duke@435 | 366 | int AbstractInterpreter::size_activation(methodOop method, |
duke@435 | 367 | int tempcount, |
duke@435 | 368 | int popframe_extra_args, |
duke@435 | 369 | int moncount, |
duke@435 | 370 | int callee_param_count, |
duke@435 | 371 | int callee_locals, |
duke@435 | 372 | bool is_top_frame) { |
duke@435 | 373 | return layout_activation(method, |
duke@435 | 374 | tempcount, popframe_extra_args, moncount, |
duke@435 | 375 | callee_param_count, callee_locals, |
duke@435 | 376 | (frame*) NULL, (frame*) NULL, is_top_frame); |
duke@435 | 377 | } |
duke@435 | 378 | |
duke@435 | 379 | void Deoptimization::unwind_callee_save_values(frame* f, vframeArray* vframe_array) { |
duke@435 | 380 | |
duke@435 | 381 | // This code is sort of the equivalent of C2IAdapter::setup_stack_frame back in |
duke@435 | 382 | // the days we had adapter frames. When we deoptimize a situation where a |
duke@435 | 383 | // compiled caller calls a compiled caller will have registers it expects |
duke@435 | 384 | // to survive the call to the callee. If we deoptimize the callee the only |
duke@435 | 385 | // way we can restore these registers is to have the oldest interpreter |
duke@435 | 386 | // frame that we create restore these values. That is what this routine |
duke@435 | 387 | // will accomplish. |
duke@435 | 388 | |
duke@435 | 389 | // At the moment we have modified c2 to not have any callee save registers |
duke@435 | 390 | // so this problem does not exist and this routine is just a place holder. |
duke@435 | 391 | |
duke@435 | 392 | assert(f->is_interpreted_frame(), "must be interpreted"); |
duke@435 | 393 | } |