1 /* 2 * Copyright (c) 2000, 2016, 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 */ 24 25 #include "precompiled.hpp" 26 #include "classfile/systemDictionary.hpp" 27 #include "compiler/compilerOracle.hpp" 28 #include "interpreter/bytecode.hpp" 29 #include "interpreter/bytecodeStream.hpp" 30 #include "interpreter/linkResolver.hpp" 31 #include "memory/heapInspection.hpp" 32 #include "memory/resourceArea.hpp" 33 #include "oops/methodData.hpp" 34 #include "prims/jvmtiRedefineClasses.hpp" 35 #include "runtime/arguments.hpp" 36 #include "runtime/compilationPolicy.hpp" 37 #include "runtime/deoptimization.hpp" 38 #include "runtime/handles.inline.hpp" 39 #include "runtime/orderAccess.inline.hpp" 40 #include "utilities/copy.hpp" 41 42 // ================================================================== 43 // DataLayout 44 // 45 // Overlay for generic profiling data. 46 47 // Some types of data layouts need a length field. 48 bool DataLayout::needs_array_len(u1 tag) { 49 return (tag == multi_branch_data_tag) || (tag == arg_info_data_tag) || (tag == parameters_type_data_tag); 50 } 51 52 // Perform generic initialization of the data. More specific 53 // initialization occurs in overrides of ProfileData::post_initialize. 54 void DataLayout::initialize(u1 tag, u2 bci, int cell_count) { 55 _header._bits = (intptr_t)0; 56 _header._struct._tag = tag; 57 _header._struct._bci = bci; 58 for (int i = 0; i < cell_count; i++) { 59 set_cell_at(i, (intptr_t)0); 60 } 61 if (needs_array_len(tag)) { 62 set_cell_at(ArrayData::array_len_off_set, cell_count - 1); // -1 for header. 63 } 64 if (tag == call_type_data_tag) { 65 CallTypeData::initialize(this, cell_count); 66 } else if (tag == virtual_call_type_data_tag) { 67 VirtualCallTypeData::initialize(this, cell_count); 68 } 69 } 70 71 void DataLayout::clean_weak_klass_links(BoolObjectClosure* cl) { 72 ResourceMark m; 73 data_in()->clean_weak_klass_links(cl); 74 } 75 76 77 // ================================================================== 78 // ProfileData 79 // 80 // A ProfileData object is created to refer to a section of profiling 81 // data in a structured way. 82 83 // Constructor for invalid ProfileData. 84 ProfileData::ProfileData() { 85 _data = NULL; 86 } 87 88 char* ProfileData::print_data_on_helper(const MethodData* md) const { 89 DataLayout* dp = md->extra_data_base(); 90 DataLayout* end = md->args_data_limit(); 91 stringStream ss; 92 for (;; dp = MethodData::next_extra(dp)) { 93 assert(dp < end, "moved past end of extra data"); 94 switch(dp->tag()) { 95 case DataLayout::speculative_trap_data_tag: 96 if (dp->bci() == bci()) { 97 SpeculativeTrapData* data = new SpeculativeTrapData(dp); 98 int trap = data->trap_state(); 99 char buf[100]; 100 ss.print("trap/"); 101 data->method()->print_short_name(&ss); 102 ss.print("(%s) ", Deoptimization::format_trap_state(buf, sizeof(buf), trap)); 103 } 104 break; 105 case DataLayout::bit_data_tag: 106 break; 107 case DataLayout::no_tag: 108 case DataLayout::arg_info_data_tag: 109 return ss.as_string(); 110 break; 111 default: 112 fatal("unexpected tag %d", dp->tag()); 113 } 114 } 115 return NULL; 116 } 117 118 void ProfileData::print_data_on(outputStream* st, const MethodData* md) const { 119 print_data_on(st, print_data_on_helper(md)); 120 } 121 122 void ProfileData::print_shared(outputStream* st, const char* name, const char* extra) const { 123 st->print("bci: %d", bci()); 124 st->fill_to(tab_width_one); 125 st->print("%s", name); 126 tab(st); 127 int trap = trap_state(); 128 if (trap != 0) { 129 char buf[100]; 130 st->print("trap(%s) ", Deoptimization::format_trap_state(buf, sizeof(buf), trap)); 131 } 132 if (extra != NULL) { 133 st->print("%s", extra); 134 } 135 int flags = data()->flags(); 136 if (flags != 0) { 137 st->print("flags(%d) ", flags); 138 } 139 } 140 141 void ProfileData::tab(outputStream* st, bool first) const { 142 st->fill_to(first ? tab_width_one : tab_width_two); 143 } 144 145 // ================================================================== 146 // BitData 147 // 148 // A BitData corresponds to a one-bit flag. This is used to indicate 149 // whether a checkcast bytecode has seen a null value. 150 151 152 void BitData::print_data_on(outputStream* st, const char* extra) const { 153 print_shared(st, "BitData", extra); 154 st->cr(); 155 } 156 157 // ================================================================== 158 // CounterData 159 // 160 // A CounterData corresponds to a simple counter. 161 162 void CounterData::print_data_on(outputStream* st, const char* extra) const { 163 print_shared(st, "CounterData", extra); 164 st->print_cr("count(%u)", count()); 165 } 166 167 // ================================================================== 168 // JumpData 169 // 170 // A JumpData is used to access profiling information for a direct 171 // branch. It is a counter, used for counting the number of branches, 172 // plus a data displacement, used for realigning the data pointer to 173 // the corresponding target bci. 174 175 void JumpData::post_initialize(BytecodeStream* stream, MethodData* mdo) { 176 assert(stream->bci() == bci(), "wrong pos"); 177 int target; 178 Bytecodes::Code c = stream->code(); 179 if (c == Bytecodes::_goto_w || c == Bytecodes::_jsr_w) { 180 target = stream->dest_w(); 181 } else { 182 target = stream->dest(); 183 } 184 int my_di = mdo->dp_to_di(dp()); 185 int target_di = mdo->bci_to_di(target); 186 int offset = target_di - my_di; 187 set_displacement(offset); 188 } 189 190 void JumpData::print_data_on(outputStream* st, const char* extra) const { 191 print_shared(st, "JumpData", extra); 192 st->print_cr("taken(%u) displacement(%d)", taken(), displacement()); 193 } 194 195 int TypeStackSlotEntries::compute_cell_count(Symbol* signature, bool include_receiver, int max) { 196 // Parameter profiling include the receiver 197 int args_count = include_receiver ? 1 : 0; 198 ResourceMark rm; 199 SignatureStream ss(signature); 200 args_count += ss.reference_parameter_count(); 201 args_count = MIN2(args_count, max); 202 return args_count * per_arg_cell_count; 203 } 204 205 int TypeEntriesAtCall::compute_cell_count(BytecodeStream* stream) { 206 assert(Bytecodes::is_invoke(stream->code()), "should be invoke"); 207 assert(TypeStackSlotEntries::per_arg_count() > ReturnTypeEntry::static_cell_count(), "code to test for arguments/results broken"); 208 const methodHandle m = stream->method(); 209 int bci = stream->bci(); 210 Bytecode_invoke inv(m, bci); 211 int args_cell = 0; 212 if (MethodData::profile_arguments_for_invoke(m, bci)) { 213 args_cell = TypeStackSlotEntries::compute_cell_count(inv.signature(), false, TypeProfileArgsLimit); 214 } 215 int ret_cell = 0; 216 if (MethodData::profile_return_for_invoke(m, bci) && (inv.result_type() == T_OBJECT || inv.result_type() == T_ARRAY)) { 217 ret_cell = ReturnTypeEntry::static_cell_count(); 218 } 219 int header_cell = 0; 220 if (args_cell + ret_cell > 0) { 221 header_cell = header_cell_count(); 222 } 223 224 return header_cell + args_cell + ret_cell; 225 } 226 227 class ArgumentOffsetComputer : public SignatureInfo { 228 private: 229 int _max; 230 GrowableArray<int> _offsets; 231 232 void set(int size, BasicType type) { _size += size; } 233 void do_object(int begin, int end) { 234 if (_offsets.length() < _max) { 235 _offsets.push(_size); 236 } 237 SignatureInfo::do_object(begin, end); 238 } 239 void do_array (int begin, int end) { 240 if (_offsets.length() < _max) { 241 _offsets.push(_size); 242 } 243 SignatureInfo::do_array(begin, end); 244 } 245 246 public: 247 ArgumentOffsetComputer(Symbol* signature, int max) 248 : SignatureInfo(signature), _max(max), _offsets(Thread::current(), max) { 249 } 250 251 int total() { lazy_iterate_parameters(); return _size; } 252 253 int off_at(int i) const { return _offsets.at(i); } 254 }; 255 256 void TypeStackSlotEntries::post_initialize(Symbol* signature, bool has_receiver, bool include_receiver) { 257 ResourceMark rm; 258 int start = 0; 259 // Parameter profiling include the receiver 260 if (include_receiver && has_receiver) { 261 set_stack_slot(0, 0); 262 set_type(0, type_none()); 263 start += 1; 264 } 265 ArgumentOffsetComputer aos(signature, _number_of_entries-start); 266 aos.total(); 267 for (int i = start; i < _number_of_entries; i++) { 268 set_stack_slot(i, aos.off_at(i-start) + (has_receiver ? 1 : 0)); 269 set_type(i, type_none()); 270 } 271 } 272 273 void CallTypeData::post_initialize(BytecodeStream* stream, MethodData* mdo) { 274 assert(Bytecodes::is_invoke(stream->code()), "should be invoke"); 275 Bytecode_invoke inv(stream->method(), stream->bci()); 276 277 SignatureStream ss(inv.signature()); 278 if (has_arguments()) { 279 #ifdef ASSERT 280 ResourceMark rm; 281 int count = MIN2(ss.reference_parameter_count(), (int)TypeProfileArgsLimit); 282 assert(count > 0, "room for args type but none found?"); 283 check_number_of_arguments(count); 284 #endif 285 _args.post_initialize(inv.signature(), inv.has_receiver(), false); 286 } 287 288 if (has_return()) { 289 assert(inv.result_type() == T_OBJECT || inv.result_type() == T_ARRAY, "room for a ret type but doesn't return obj?"); 290 _ret.post_initialize(); 291 } 292 } 293 294 void VirtualCallTypeData::post_initialize(BytecodeStream* stream, MethodData* mdo) { 295 assert(Bytecodes::is_invoke(stream->code()), "should be invoke"); 296 Bytecode_invoke inv(stream->method(), stream->bci()); 297 298 if (has_arguments()) { 299 #ifdef ASSERT 300 ResourceMark rm; 301 SignatureStream ss(inv.signature()); 302 int count = MIN2(ss.reference_parameter_count(), (int)TypeProfileArgsLimit); 303 assert(count > 0, "room for args type but none found?"); 304 check_number_of_arguments(count); 305 #endif 306 _args.post_initialize(inv.signature(), inv.has_receiver(), false); 307 } 308 309 if (has_return()) { 310 assert(inv.result_type() == T_OBJECT || inv.result_type() == T_ARRAY, "room for a ret type but doesn't return obj?"); 311 _ret.post_initialize(); 312 } 313 } 314 315 bool TypeEntries::is_loader_alive(BoolObjectClosure* is_alive_cl, intptr_t p) { 316 Klass* k = (Klass*)klass_part(p); 317 return k != NULL && k->is_loader_alive(is_alive_cl); 318 } 319 320 void TypeStackSlotEntries::clean_weak_klass_links(BoolObjectClosure* is_alive_cl) { 321 for (int i = 0; i < _number_of_entries; i++) { 322 intptr_t p = type(i); 323 if (!is_loader_alive(is_alive_cl, p)) { 324 set_type(i, with_status((Klass*)NULL, p)); 325 } 326 } 327 } 328 329 void ReturnTypeEntry::clean_weak_klass_links(BoolObjectClosure* is_alive_cl) { 330 intptr_t p = type(); 331 if (!is_loader_alive(is_alive_cl, p)) { 332 set_type(with_status((Klass*)NULL, p)); 333 } 334 } 335 336 bool TypeEntriesAtCall::return_profiling_enabled() { 337 return MethodData::profile_return(); 338 } 339 340 bool TypeEntriesAtCall::arguments_profiling_enabled() { 341 return MethodData::profile_arguments(); 342 } 343 344 void TypeEntries::print_klass(outputStream* st, intptr_t k) { 345 if (is_type_none(k)) { 346 st->print("none"); 347 } else if (is_type_unknown(k)) { 348 st->print("unknown"); 349 } else { 350 valid_klass(k)->print_value_on(st); 351 } 352 if (was_null_seen(k)) { 353 st->print(" (null seen)"); 354 } 355 } 356 357 void TypeStackSlotEntries::print_data_on(outputStream* st) const { 358 for (int i = 0; i < _number_of_entries; i++) { 359 _pd->tab(st); 360 st->print("%d: stack(%u) ", i, stack_slot(i)); 361 print_klass(st, type(i)); 362 st->cr(); 363 } 364 } 365 366 void ReturnTypeEntry::print_data_on(outputStream* st) const { 367 _pd->tab(st); 368 print_klass(st, type()); 369 st->cr(); 370 } 371 372 void CallTypeData::print_data_on(outputStream* st, const char* extra) const { 373 CounterData::print_data_on(st, extra); 374 if (has_arguments()) { 375 tab(st, true); 376 st->print("argument types"); 377 _args.print_data_on(st); 378 } 379 if (has_return()) { 380 tab(st, true); 381 st->print("return type"); 382 _ret.print_data_on(st); 383 } 384 } 385 386 void VirtualCallTypeData::print_data_on(outputStream* st, const char* extra) const { 387 VirtualCallData::print_data_on(st, extra); 388 if (has_arguments()) { 389 tab(st, true); 390 st->print("argument types"); 391 _args.print_data_on(st); 392 } 393 if (has_return()) { 394 tab(st, true); 395 st->print("return type"); 396 _ret.print_data_on(st); 397 } 398 } 399 400 // ================================================================== 401 // ReceiverTypeData 402 // 403 // A ReceiverTypeData is used to access profiling information about a 404 // dynamic type check. It consists of a counter which counts the total times 405 // that the check is reached, and a series of (Klass*, count) pairs 406 // which are used to store a type profile for the receiver of the check. 407 408 void ReceiverTypeData::clean_weak_klass_links(BoolObjectClosure* is_alive_cl) { 409 for (uint row = 0; row < row_limit(); row++) { 410 Klass* p = receiver(row); 411 if (p != NULL && !p->is_loader_alive(is_alive_cl)) { 412 clear_row(row); 413 } 414 } 415 } 416 417 #if INCLUDE_JVMCI 418 void VirtualCallData::clean_weak_klass_links(BoolObjectClosure* is_alive_cl) { 419 ReceiverTypeData::clean_weak_klass_links(is_alive_cl); 420 for (uint row = 0; row < method_row_limit(); row++) { 421 Method* p = method(row); 422 if (p != NULL && !p->method_holder()->is_loader_alive(is_alive_cl)) { 423 clear_method_row(row); 424 } 425 } 426 } 427 428 void VirtualCallData::clean_weak_method_links() { 429 ReceiverTypeData::clean_weak_method_links(); 430 for (uint row = 0; row < method_row_limit(); row++) { 431 Method* p = method(row); 432 if (p != NULL && !p->on_stack()) { 433 clear_method_row(row); 434 } 435 } 436 } 437 #endif // INCLUDE_JVMCI 438 439 void ReceiverTypeData::print_receiver_data_on(outputStream* st) const { 440 uint row; 441 int entries = 0; 442 for (row = 0; row < row_limit(); row++) { 443 if (receiver(row) != NULL) entries++; 444 } 445 #if INCLUDE_JVMCI 446 st->print_cr("count(%u) nonprofiled_count(%u) entries(%u)", count(), nonprofiled_count(), entries); 447 #else 448 st->print_cr("count(%u) entries(%u)", count(), entries); 449 #endif 450 int total = count(); 451 for (row = 0; row < row_limit(); row++) { 452 if (receiver(row) != NULL) { 453 total += receiver_count(row); 454 } 455 } 456 for (row = 0; row < row_limit(); row++) { 457 if (receiver(row) != NULL) { 458 tab(st); 459 receiver(row)->print_value_on(st); 460 st->print_cr("(%u %4.2f)", receiver_count(row), (float) receiver_count(row) / (float) total); 461 } 462 } 463 } 464 void ReceiverTypeData::print_data_on(outputStream* st, const char* extra) const { 465 print_shared(st, "ReceiverTypeData", extra); 466 print_receiver_data_on(st); 467 } 468 469 #if INCLUDE_JVMCI 470 void VirtualCallData::print_method_data_on(outputStream* st) const { 471 uint row; 472 int entries = 0; 473 for (row = 0; row < method_row_limit(); row++) { 474 if (method(row) != NULL) entries++; 475 } 476 tab(st); 477 st->print_cr("method_entries(%u)", entries); 478 int total = count(); 479 for (row = 0; row < method_row_limit(); row++) { 480 if (method(row) != NULL) { 481 total += method_count(row); 482 } 483 } 484 for (row = 0; row < method_row_limit(); row++) { 485 if (method(row) != NULL) { 486 tab(st); 487 method(row)->print_value_on(st); 488 st->print_cr("(%u %4.2f)", method_count(row), (float) method_count(row) / (float) total); 489 } 490 } 491 } 492 #endif // INCLUDE_JVMCI 493 494 void VirtualCallData::print_data_on(outputStream* st, const char* extra) const { 495 print_shared(st, "VirtualCallData", extra); 496 print_receiver_data_on(st); 497 print_method_data_on(st); 498 } 499 500 // ================================================================== 501 // RetData 502 // 503 // A RetData is used to access profiling information for a ret bytecode. 504 // It is composed of a count of the number of times that the ret has 505 // been executed, followed by a series of triples of the form 506 // (bci, count, di) which count the number of times that some bci was the 507 // target of the ret and cache a corresponding displacement. 508 509 void RetData::post_initialize(BytecodeStream* stream, MethodData* mdo) { 510 for (uint row = 0; row < row_limit(); row++) { 511 set_bci_displacement(row, -1); 512 set_bci(row, no_bci); 513 } 514 // release so other threads see a consistent state. bci is used as 515 // a valid flag for bci_displacement. 516 OrderAccess::release(); 517 } 518 519 // This routine needs to atomically update the RetData structure, so the 520 // caller needs to hold the RetData_lock before it gets here. Since taking 521 // the lock can block (and allow GC) and since RetData is a ProfileData is a 522 // wrapper around a derived oop, taking the lock in _this_ method will 523 // basically cause the 'this' pointer's _data field to contain junk after the 524 // lock. We require the caller to take the lock before making the ProfileData 525 // structure. Currently the only caller is InterpreterRuntime::update_mdp_for_ret 526 address RetData::fixup_ret(int return_bci, MethodData* h_mdo) { 527 // First find the mdp which corresponds to the return bci. 528 address mdp = h_mdo->bci_to_dp(return_bci); 529 530 // Now check to see if any of the cache slots are open. 531 for (uint row = 0; row < row_limit(); row++) { 532 if (bci(row) == no_bci) { 533 set_bci_displacement(row, mdp - dp()); 534 set_bci_count(row, DataLayout::counter_increment); 535 // Barrier to ensure displacement is written before the bci; allows 536 // the interpreter to read displacement without fear of race condition. 537 release_set_bci(row, return_bci); 538 break; 539 } 540 } 541 return mdp; 542 } 543 544 #ifdef CC_INTERP 545 DataLayout* RetData::advance(MethodData *md, int bci) { 546 return (DataLayout*) md->bci_to_dp(bci); 547 } 548 #endif // CC_INTERP 549 550 void RetData::print_data_on(outputStream* st, const char* extra) const { 551 print_shared(st, "RetData", extra); 552 uint row; 553 int entries = 0; 554 for (row = 0; row < row_limit(); row++) { 555 if (bci(row) != no_bci) entries++; 556 } 557 st->print_cr("count(%u) entries(%u)", count(), entries); 558 for (row = 0; row < row_limit(); row++) { 559 if (bci(row) != no_bci) { 560 tab(st); 561 st->print_cr("bci(%d: count(%u) displacement(%d))", 562 bci(row), bci_count(row), bci_displacement(row)); 563 } 564 } 565 } 566 567 // ================================================================== 568 // BranchData 569 // 570 // A BranchData is used to access profiling data for a two-way branch. 571 // It consists of taken and not_taken counts as well as a data displacement 572 // for the taken case. 573 574 void BranchData::post_initialize(BytecodeStream* stream, MethodData* mdo) { 575 assert(stream->bci() == bci(), "wrong pos"); 576 int target = stream->dest(); 577 int my_di = mdo->dp_to_di(dp()); 578 int target_di = mdo->bci_to_di(target); 579 int offset = target_di - my_di; 580 set_displacement(offset); 581 } 582 583 void BranchData::print_data_on(outputStream* st, const char* extra) const { 584 print_shared(st, "BranchData", extra); 585 st->print_cr("taken(%u) displacement(%d)", 586 taken(), displacement()); 587 tab(st); 588 st->print_cr("not taken(%u)", not_taken()); 589 } 590 591 // ================================================================== 592 // MultiBranchData 593 // 594 // A MultiBranchData is used to access profiling information for 595 // a multi-way branch (*switch bytecodes). It consists of a series 596 // of (count, displacement) pairs, which count the number of times each 597 // case was taken and specify the data displacment for each branch target. 598 599 int MultiBranchData::compute_cell_count(BytecodeStream* stream) { 600 int cell_count = 0; 601 if (stream->code() == Bytecodes::_tableswitch) { 602 Bytecode_tableswitch sw(stream->method()(), stream->bcp()); 603 cell_count = 1 + per_case_cell_count * (1 + sw.length()); // 1 for default 604 } else { 605 Bytecode_lookupswitch sw(stream->method()(), stream->bcp()); 606 cell_count = 1 + per_case_cell_count * (sw.number_of_pairs() + 1); // 1 for default 607 } 608 return cell_count; 609 } 610 611 void MultiBranchData::post_initialize(BytecodeStream* stream, 612 MethodData* mdo) { 613 assert(stream->bci() == bci(), "wrong pos"); 614 int target; 615 int my_di; 616 int target_di; 617 int offset; 618 if (stream->code() == Bytecodes::_tableswitch) { 619 Bytecode_tableswitch sw(stream->method()(), stream->bcp()); 620 int len = sw.length(); 621 assert(array_len() == per_case_cell_count * (len + 1), "wrong len"); 622 for (int count = 0; count < len; count++) { 623 target = sw.dest_offset_at(count) + bci(); 624 my_di = mdo->dp_to_di(dp()); 625 target_di = mdo->bci_to_di(target); 626 offset = target_di - my_di; 627 set_displacement_at(count, offset); 628 } 629 target = sw.default_offset() + bci(); 630 my_di = mdo->dp_to_di(dp()); 631 target_di = mdo->bci_to_di(target); 632 offset = target_di - my_di; 633 set_default_displacement(offset); 634 635 } else { 636 Bytecode_lookupswitch sw(stream->method()(), stream->bcp()); 637 int npairs = sw.number_of_pairs(); 638 assert(array_len() == per_case_cell_count * (npairs + 1), "wrong len"); 639 for (int count = 0; count < npairs; count++) { 640 LookupswitchPair pair = sw.pair_at(count); 641 target = pair.offset() + bci(); 642 my_di = mdo->dp_to_di(dp()); 643 target_di = mdo->bci_to_di(target); 644 offset = target_di - my_di; 645 set_displacement_at(count, offset); 646 } 647 target = sw.default_offset() + bci(); 648 my_di = mdo->dp_to_di(dp()); 649 target_di = mdo->bci_to_di(target); 650 offset = target_di - my_di; 651 set_default_displacement(offset); 652 } 653 } 654 655 void MultiBranchData::print_data_on(outputStream* st, const char* extra) const { 656 print_shared(st, "MultiBranchData", extra); 657 st->print_cr("default_count(%u) displacement(%d)", 658 default_count(), default_displacement()); 659 int cases = number_of_cases(); 660 for (int i = 0; i < cases; i++) { 661 tab(st); 662 st->print_cr("count(%u) displacement(%d)", 663 count_at(i), displacement_at(i)); 664 } 665 } 666 667 void ArgInfoData::print_data_on(outputStream* st, const char* extra) const { 668 print_shared(st, "ArgInfoData", extra); 669 int nargs = number_of_args(); 670 for (int i = 0; i < nargs; i++) { 671 st->print(" 0x%x", arg_modified(i)); 672 } 673 st->cr(); 674 } 675 676 int ParametersTypeData::compute_cell_count(Method* m) { 677 if (!MethodData::profile_parameters_for_method(m)) { 678 return 0; 679 } 680 int max = TypeProfileParmsLimit == -1 ? INT_MAX : TypeProfileParmsLimit; 681 int obj_args = TypeStackSlotEntries::compute_cell_count(m->signature(), !m->is_static(), max); 682 if (obj_args > 0) { 683 return obj_args + 1; // 1 cell for array len 684 } 685 return 0; 686 } 687 688 void ParametersTypeData::post_initialize(BytecodeStream* stream, MethodData* mdo) { 689 _parameters.post_initialize(mdo->method()->signature(), !mdo->method()->is_static(), true); 690 } 691 692 bool ParametersTypeData::profiling_enabled() { 693 return MethodData::profile_parameters(); 694 } 695 696 void ParametersTypeData::print_data_on(outputStream* st, const char* extra) const { 697 st->print("parameter types"); // FIXME extra ignored? 698 _parameters.print_data_on(st); 699 } 700 701 void SpeculativeTrapData::print_data_on(outputStream* st, const char* extra) const { 702 print_shared(st, "SpeculativeTrapData", extra); 703 tab(st); 704 method()->print_short_name(st); 705 st->cr(); 706 } 707 708 // ================================================================== 709 // MethodData* 710 // 711 // A MethodData* holds information which has been collected about 712 // a method. 713 714 MethodData* MethodData::allocate(ClassLoaderData* loader_data, const methodHandle& method, TRAPS) { 715 int size = MethodData::compute_allocation_size_in_words(method); 716 717 return new (loader_data, size, false, MetaspaceObj::MethodDataType, THREAD) 718 MethodData(method(), size, THREAD); 719 } 720 721 int MethodData::bytecode_cell_count(Bytecodes::Code code) { 722 if (is_client_compilation_mode_vm()) { 723 return no_profile_data; 724 } 725 switch (code) { 726 case Bytecodes::_checkcast: 727 case Bytecodes::_instanceof: 728 case Bytecodes::_aastore: 729 if (TypeProfileCasts) { 730 return ReceiverTypeData::static_cell_count(); 731 } else { 732 return BitData::static_cell_count(); 733 } 734 case Bytecodes::_invokespecial: 735 case Bytecodes::_invokestatic: 736 if (MethodData::profile_arguments() || MethodData::profile_return()) { 737 return variable_cell_count; 738 } else { 739 return CounterData::static_cell_count(); 740 } 741 case Bytecodes::_goto: 742 case Bytecodes::_goto_w: 743 case Bytecodes::_jsr: 744 case Bytecodes::_jsr_w: 745 return JumpData::static_cell_count(); 746 case Bytecodes::_invokevirtual: 747 case Bytecodes::_invokeinterface: 748 if (MethodData::profile_arguments() || MethodData::profile_return()) { 749 return variable_cell_count; 750 } else { 751 return VirtualCallData::static_cell_count(); 752 } 753 case Bytecodes::_invokedynamic: 754 if (MethodData::profile_arguments() || MethodData::profile_return()) { 755 return variable_cell_count; 756 } else { 757 return CounterData::static_cell_count(); 758 } 759 case Bytecodes::_ret: 760 return RetData::static_cell_count(); 761 case Bytecodes::_ifeq: 762 case Bytecodes::_ifne: 763 case Bytecodes::_iflt: 764 case Bytecodes::_ifge: 765 case Bytecodes::_ifgt: 766 case Bytecodes::_ifle: 767 case Bytecodes::_if_icmpeq: 768 case Bytecodes::_if_icmpne: 769 case Bytecodes::_if_icmplt: 770 case Bytecodes::_if_icmpge: 771 case Bytecodes::_if_icmpgt: 772 case Bytecodes::_if_icmple: 773 case Bytecodes::_if_acmpeq: 774 case Bytecodes::_if_acmpne: 775 case Bytecodes::_ifnull: 776 case Bytecodes::_ifnonnull: 777 return BranchData::static_cell_count(); 778 case Bytecodes::_lookupswitch: 779 case Bytecodes::_tableswitch: 780 return variable_cell_count; 781 } 782 return no_profile_data; 783 } 784 785 // Compute the size of the profiling information corresponding to 786 // the current bytecode. 787 int MethodData::compute_data_size(BytecodeStream* stream) { 788 int cell_count = bytecode_cell_count(stream->code()); 789 if (cell_count == no_profile_data) { 790 return 0; 791 } 792 if (cell_count == variable_cell_count) { 793 switch (stream->code()) { 794 case Bytecodes::_lookupswitch: 795 case Bytecodes::_tableswitch: 796 cell_count = MultiBranchData::compute_cell_count(stream); 797 break; 798 case Bytecodes::_invokespecial: 799 case Bytecodes::_invokestatic: 800 case Bytecodes::_invokedynamic: 801 assert(MethodData::profile_arguments() || MethodData::profile_return(), "should be collecting args profile"); 802 if (profile_arguments_for_invoke(stream->method(), stream->bci()) || 803 profile_return_for_invoke(stream->method(), stream->bci())) { 804 cell_count = CallTypeData::compute_cell_count(stream); 805 } else { 806 cell_count = CounterData::static_cell_count(); 807 } 808 break; 809 case Bytecodes::_invokevirtual: 810 case Bytecodes::_invokeinterface: { 811 assert(MethodData::profile_arguments() || MethodData::profile_return(), "should be collecting args profile"); 812 if (profile_arguments_for_invoke(stream->method(), stream->bci()) || 813 profile_return_for_invoke(stream->method(), stream->bci())) { 814 cell_count = VirtualCallTypeData::compute_cell_count(stream); 815 } else { 816 cell_count = VirtualCallData::static_cell_count(); 817 } 818 break; 819 } 820 default: 821 fatal("unexpected bytecode for var length profile data"); 822 } 823 } 824 // Note: cell_count might be zero, meaning that there is just 825 // a DataLayout header, with no extra cells. 826 assert(cell_count >= 0, "sanity"); 827 return DataLayout::compute_size_in_bytes(cell_count); 828 } 829 830 bool MethodData::is_speculative_trap_bytecode(Bytecodes::Code code) { 831 // Bytecodes for which we may use speculation 832 switch (code) { 833 case Bytecodes::_checkcast: 834 case Bytecodes::_instanceof: 835 case Bytecodes::_aastore: 836 case Bytecodes::_invokevirtual: 837 case Bytecodes::_invokeinterface: 838 case Bytecodes::_if_acmpeq: 839 case Bytecodes::_if_acmpne: 840 case Bytecodes::_ifnull: 841 case Bytecodes::_ifnonnull: 842 case Bytecodes::_invokestatic: 843 #ifdef COMPILER2 844 if (is_server_compilation_mode_vm()) { 845 return UseTypeSpeculation; 846 } 847 #endif 848 default: 849 return false; 850 } 851 return false; 852 } 853 854 int MethodData::compute_extra_data_count(int data_size, int empty_bc_count, bool needs_speculative_traps) { 855 #if INCLUDE_JVMCI 856 if (ProfileTraps) { 857 // Assume that up to 30% of the possibly trapping BCIs with no MDP will need to allocate one. 858 int extra_data_count = MIN2(empty_bc_count, MAX2(4, (empty_bc_count * 30) / 100)); 859 860 // Make sure we have a minimum number of extra data slots to 861 // allocate SpeculativeTrapData entries. We would want to have one 862 // entry per compilation that inlines this method and for which 863 // some type speculation assumption fails. So the room we need for 864 // the SpeculativeTrapData entries doesn't directly depend on the 865 // size of the method. Because it's hard to estimate, we reserve 866 // space for an arbitrary number of entries. 867 int spec_data_count = (needs_speculative_traps ? SpecTrapLimitExtraEntries : 0) * 868 (SpeculativeTrapData::static_cell_count() + DataLayout::header_size_in_cells()); 869 870 return MAX2(extra_data_count, spec_data_count); 871 } else { 872 return 0; 873 } 874 #else // INCLUDE_JVMCI 875 if (ProfileTraps) { 876 // Assume that up to 3% of BCIs with no MDP will need to allocate one. 877 int extra_data_count = (uint)(empty_bc_count * 3) / 128 + 1; 878 // If the method is large, let the extra BCIs grow numerous (to ~1%). 879 int one_percent_of_data 880 = (uint)data_size / (DataLayout::header_size_in_bytes()*128); 881 if (extra_data_count < one_percent_of_data) 882 extra_data_count = one_percent_of_data; 883 if (extra_data_count > empty_bc_count) 884 extra_data_count = empty_bc_count; // no need for more 885 886 // Make sure we have a minimum number of extra data slots to 887 // allocate SpeculativeTrapData entries. We would want to have one 888 // entry per compilation that inlines this method and for which 889 // some type speculation assumption fails. So the room we need for 890 // the SpeculativeTrapData entries doesn't directly depend on the 891 // size of the method. Because it's hard to estimate, we reserve 892 // space for an arbitrary number of entries. 893 int spec_data_count = (needs_speculative_traps ? SpecTrapLimitExtraEntries : 0) * 894 (SpeculativeTrapData::static_cell_count() + DataLayout::header_size_in_cells()); 895 896 return MAX2(extra_data_count, spec_data_count); 897 } else { 898 return 0; 899 } 900 #endif // INCLUDE_JVMCI 901 } 902 903 // Compute the size of the MethodData* necessary to store 904 // profiling information about a given method. Size is in bytes. 905 int MethodData::compute_allocation_size_in_bytes(const methodHandle& method) { 906 int data_size = 0; 907 BytecodeStream stream(method); 908 Bytecodes::Code c; 909 int empty_bc_count = 0; // number of bytecodes lacking data 910 bool needs_speculative_traps = false; 911 while ((c = stream.next()) >= 0) { 912 int size_in_bytes = compute_data_size(&stream); 913 data_size += size_in_bytes; 914 if (size_in_bytes == 0 JVMCI_ONLY(&& Bytecodes::can_trap(c))) empty_bc_count += 1; 915 needs_speculative_traps = needs_speculative_traps || is_speculative_trap_bytecode(c); 916 } 917 int object_size = in_bytes(data_offset()) + data_size; 918 919 // Add some extra DataLayout cells (at least one) to track stray traps. 920 int extra_data_count = compute_extra_data_count(data_size, empty_bc_count, needs_speculative_traps); 921 object_size += extra_data_count * DataLayout::compute_size_in_bytes(0); 922 923 // Add a cell to record information about modified arguments. 924 int arg_size = method->size_of_parameters(); 925 object_size += DataLayout::compute_size_in_bytes(arg_size+1); 926 927 // Reserve room for an area of the MDO dedicated to profiling of 928 // parameters 929 int args_cell = ParametersTypeData::compute_cell_count(method()); 930 if (args_cell > 0) { 931 object_size += DataLayout::compute_size_in_bytes(args_cell); 932 } 933 return object_size; 934 } 935 936 // Compute the size of the MethodData* necessary to store 937 // profiling information about a given method. Size is in words 938 int MethodData::compute_allocation_size_in_words(const methodHandle& method) { 939 int byte_size = compute_allocation_size_in_bytes(method); 940 int word_size = align_size_up(byte_size, BytesPerWord) / BytesPerWord; 941 return align_metadata_size(word_size); 942 } 943 944 // Initialize an individual data segment. Returns the size of 945 // the segment in bytes. 946 int MethodData::initialize_data(BytecodeStream* stream, 947 int data_index) { 948 if (is_client_compilation_mode_vm()) { 949 return 0; 950 } 951 int cell_count = -1; 952 int tag = DataLayout::no_tag; 953 DataLayout* data_layout = data_layout_at(data_index); 954 Bytecodes::Code c = stream->code(); 955 switch (c) { 956 case Bytecodes::_checkcast: 957 case Bytecodes::_instanceof: 958 case Bytecodes::_aastore: 959 if (TypeProfileCasts) { 960 cell_count = ReceiverTypeData::static_cell_count(); 961 tag = DataLayout::receiver_type_data_tag; 962 } else { 963 cell_count = BitData::static_cell_count(); 964 tag = DataLayout::bit_data_tag; 965 } 966 break; 967 case Bytecodes::_invokespecial: 968 case Bytecodes::_invokestatic: { 969 int counter_data_cell_count = CounterData::static_cell_count(); 970 if (profile_arguments_for_invoke(stream->method(), stream->bci()) || 971 profile_return_for_invoke(stream->method(), stream->bci())) { 972 cell_count = CallTypeData::compute_cell_count(stream); 973 } else { 974 cell_count = counter_data_cell_count; 975 } 976 if (cell_count > counter_data_cell_count) { 977 tag = DataLayout::call_type_data_tag; 978 } else { 979 tag = DataLayout::counter_data_tag; 980 } 981 break; 982 } 983 case Bytecodes::_goto: 984 case Bytecodes::_goto_w: 985 case Bytecodes::_jsr: 986 case Bytecodes::_jsr_w: 987 cell_count = JumpData::static_cell_count(); 988 tag = DataLayout::jump_data_tag; 989 break; 990 case Bytecodes::_invokevirtual: 991 case Bytecodes::_invokeinterface: { 992 int virtual_call_data_cell_count = VirtualCallData::static_cell_count(); 993 if (profile_arguments_for_invoke(stream->method(), stream->bci()) || 994 profile_return_for_invoke(stream->method(), stream->bci())) { 995 cell_count = VirtualCallTypeData::compute_cell_count(stream); 996 } else { 997 cell_count = virtual_call_data_cell_count; 998 } 999 if (cell_count > virtual_call_data_cell_count) { 1000 tag = DataLayout::virtual_call_type_data_tag; 1001 } else { 1002 tag = DataLayout::virtual_call_data_tag; 1003 } 1004 break; 1005 } 1006 case Bytecodes::_invokedynamic: { 1007 // %%% should make a type profile for any invokedynamic that takes a ref argument 1008 int counter_data_cell_count = CounterData::static_cell_count(); 1009 if (profile_arguments_for_invoke(stream->method(), stream->bci()) || 1010 profile_return_for_invoke(stream->method(), stream->bci())) { 1011 cell_count = CallTypeData::compute_cell_count(stream); 1012 } else { 1013 cell_count = counter_data_cell_count; 1014 } 1015 if (cell_count > counter_data_cell_count) { 1016 tag = DataLayout::call_type_data_tag; 1017 } else { 1018 tag = DataLayout::counter_data_tag; 1019 } 1020 break; 1021 } 1022 case Bytecodes::_ret: 1023 cell_count = RetData::static_cell_count(); 1024 tag = DataLayout::ret_data_tag; 1025 break; 1026 case Bytecodes::_ifeq: 1027 case Bytecodes::_ifne: 1028 case Bytecodes::_iflt: 1029 case Bytecodes::_ifge: 1030 case Bytecodes::_ifgt: 1031 case Bytecodes::_ifle: 1032 case Bytecodes::_if_icmpeq: 1033 case Bytecodes::_if_icmpne: 1034 case Bytecodes::_if_icmplt: 1035 case Bytecodes::_if_icmpge: 1036 case Bytecodes::_if_icmpgt: 1037 case Bytecodes::_if_icmple: 1038 case Bytecodes::_if_acmpeq: 1039 case Bytecodes::_if_acmpne: 1040 case Bytecodes::_ifnull: 1041 case Bytecodes::_ifnonnull: 1042 cell_count = BranchData::static_cell_count(); 1043 tag = DataLayout::branch_data_tag; 1044 break; 1045 case Bytecodes::_lookupswitch: 1046 case Bytecodes::_tableswitch: 1047 cell_count = MultiBranchData::compute_cell_count(stream); 1048 tag = DataLayout::multi_branch_data_tag; 1049 break; 1050 } 1051 assert(tag == DataLayout::multi_branch_data_tag || 1052 ((MethodData::profile_arguments() || MethodData::profile_return()) && 1053 (tag == DataLayout::call_type_data_tag || 1054 tag == DataLayout::counter_data_tag || 1055 tag == DataLayout::virtual_call_type_data_tag || 1056 tag == DataLayout::virtual_call_data_tag)) || 1057 cell_count == bytecode_cell_count(c), "cell counts must agree"); 1058 if (cell_count >= 0) { 1059 assert(tag != DataLayout::no_tag, "bad tag"); 1060 assert(bytecode_has_profile(c), "agree w/ BHP"); 1061 data_layout->initialize(tag, stream->bci(), cell_count); 1062 return DataLayout::compute_size_in_bytes(cell_count); 1063 } else { 1064 assert(!bytecode_has_profile(c), "agree w/ !BHP"); 1065 return 0; 1066 } 1067 } 1068 1069 // Get the data at an arbitrary (sort of) data index. 1070 ProfileData* MethodData::data_at(int data_index) const { 1071 if (out_of_bounds(data_index)) { 1072 return NULL; 1073 } 1074 DataLayout* data_layout = data_layout_at(data_index); 1075 return data_layout->data_in(); 1076 } 1077 1078 ProfileData* DataLayout::data_in() { 1079 switch (tag()) { 1080 case DataLayout::no_tag: 1081 default: 1082 ShouldNotReachHere(); 1083 return NULL; 1084 case DataLayout::bit_data_tag: 1085 return new BitData(this); 1086 case DataLayout::counter_data_tag: 1087 return new CounterData(this); 1088 case DataLayout::jump_data_tag: 1089 return new JumpData(this); 1090 case DataLayout::receiver_type_data_tag: 1091 return new ReceiverTypeData(this); 1092 case DataLayout::virtual_call_data_tag: 1093 return new VirtualCallData(this); 1094 case DataLayout::ret_data_tag: 1095 return new RetData(this); 1096 case DataLayout::branch_data_tag: 1097 return new BranchData(this); 1098 case DataLayout::multi_branch_data_tag: 1099 return new MultiBranchData(this); 1100 case DataLayout::arg_info_data_tag: 1101 return new ArgInfoData(this); 1102 case DataLayout::call_type_data_tag: 1103 return new CallTypeData(this); 1104 case DataLayout::virtual_call_type_data_tag: 1105 return new VirtualCallTypeData(this); 1106 case DataLayout::parameters_type_data_tag: 1107 return new ParametersTypeData(this); 1108 case DataLayout::speculative_trap_data_tag: 1109 return new SpeculativeTrapData(this); 1110 } 1111 } 1112 1113 // Iteration over data. 1114 ProfileData* MethodData::next_data(ProfileData* current) const { 1115 int current_index = dp_to_di(current->dp()); 1116 int next_index = current_index + current->size_in_bytes(); 1117 ProfileData* next = data_at(next_index); 1118 return next; 1119 } 1120 1121 // Give each of the data entries a chance to perform specific 1122 // data initialization. 1123 void MethodData::post_initialize(BytecodeStream* stream) { 1124 ResourceMark rm; 1125 ProfileData* data; 1126 for (data = first_data(); is_valid(data); data = next_data(data)) { 1127 stream->set_start(data->bci()); 1128 stream->next(); 1129 data->post_initialize(stream, this); 1130 } 1131 if (_parameters_type_data_di != no_parameters) { 1132 parameters_type_data()->post_initialize(NULL, this); 1133 } 1134 } 1135 1136 // Initialize the MethodData* corresponding to a given method. 1137 MethodData::MethodData(const methodHandle& method, int size, TRAPS) 1138 : _extra_data_lock(Monitor::leaf, "MDO extra data lock"), 1139 _parameters_type_data_di(parameters_uninitialized) { 1140 // Set the method back-pointer. 1141 _method = method(); 1142 initialize(); 1143 } 1144 1145 void MethodData::initialize() { 1146 NoSafepointVerifier no_safepoint; // init function atomic wrt GC 1147 ResourceMark rm; 1148 1149 init(); 1150 set_creation_mileage(mileage_of(method())); 1151 1152 // Go through the bytecodes and allocate and initialize the 1153 // corresponding data cells. 1154 int data_size = 0; 1155 int empty_bc_count = 0; // number of bytecodes lacking data 1156 _data[0] = 0; // apparently not set below. 1157 BytecodeStream stream(method()); 1158 Bytecodes::Code c; 1159 bool needs_speculative_traps = false; 1160 while ((c = stream.next()) >= 0) { 1161 int size_in_bytes = initialize_data(&stream, data_size); 1162 data_size += size_in_bytes; 1163 if (size_in_bytes == 0 JVMCI_ONLY(&& Bytecodes::can_trap(c))) empty_bc_count += 1; 1164 needs_speculative_traps = needs_speculative_traps || is_speculative_trap_bytecode(c); 1165 } 1166 _data_size = data_size; 1167 int object_size = in_bytes(data_offset()) + data_size; 1168 1169 // Add some extra DataLayout cells (at least one) to track stray traps. 1170 int extra_data_count = compute_extra_data_count(data_size, empty_bc_count, needs_speculative_traps); 1171 int extra_size = extra_data_count * DataLayout::compute_size_in_bytes(0); 1172 1173 // Let's zero the space for the extra data 1174 Copy::zero_to_bytes(((address)_data) + data_size, extra_size); 1175 1176 // Add a cell to record information about modified arguments. 1177 // Set up _args_modified array after traps cells so that 1178 // the code for traps cells works. 1179 DataLayout *dp = data_layout_at(data_size + extra_size); 1180 1181 int arg_size = method()->size_of_parameters(); 1182 dp->initialize(DataLayout::arg_info_data_tag, 0, arg_size+1); 1183 1184 int arg_data_size = DataLayout::compute_size_in_bytes(arg_size+1); 1185 object_size += extra_size + arg_data_size; 1186 1187 int parms_cell = ParametersTypeData::compute_cell_count(method()); 1188 // If we are profiling parameters, we reserver an area near the end 1189 // of the MDO after the slots for bytecodes (because there's no bci 1190 // for method entry so they don't fit with the framework for the 1191 // profiling of bytecodes). We store the offset within the MDO of 1192 // this area (or -1 if no parameter is profiled) 1193 if (parms_cell > 0) { 1194 object_size += DataLayout::compute_size_in_bytes(parms_cell); 1195 _parameters_type_data_di = data_size + extra_size + arg_data_size; 1196 DataLayout *dp = data_layout_at(data_size + extra_size + arg_data_size); 1197 dp->initialize(DataLayout::parameters_type_data_tag, 0, parms_cell); 1198 } else { 1199 _parameters_type_data_di = no_parameters; 1200 } 1201 1202 // Set an initial hint. Don't use set_hint_di() because 1203 // first_di() may be out of bounds if data_size is 0. 1204 // In that situation, _hint_di is never used, but at 1205 // least well-defined. 1206 _hint_di = first_di(); 1207 1208 post_initialize(&stream); 1209 1210 assert(object_size == compute_allocation_size_in_bytes(methodHandle(_method)), "MethodData: computed size != initialized size"); 1211 set_size(object_size); 1212 } 1213 1214 void MethodData::init() { 1215 _invocation_counter.init(); 1216 _backedge_counter.init(); 1217 _invocation_counter_start = 0; 1218 _backedge_counter_start = 0; 1219 1220 // Set per-method invoke- and backedge mask. 1221 double scale = 1.0; 1222 CompilerOracle::has_option_value(_method, "CompileThresholdScaling", scale); 1223 _invoke_mask = right_n_bits(Arguments::scaled_freq_log(Tier0InvokeNotifyFreqLog, scale)) << InvocationCounter::count_shift; 1224 _backedge_mask = right_n_bits(Arguments::scaled_freq_log(Tier0BackedgeNotifyFreqLog, scale)) << InvocationCounter::count_shift; 1225 1226 _tenure_traps = 0; 1227 _num_loops = 0; 1228 _num_blocks = 0; 1229 _would_profile = unknown; 1230 1231 #if INCLUDE_JVMCI 1232 _jvmci_ir_size = 0; 1233 #endif 1234 1235 #if INCLUDE_RTM_OPT 1236 _rtm_state = NoRTM; // No RTM lock eliding by default 1237 if (UseRTMLocking && 1238 !CompilerOracle::has_option_string(_method, "NoRTMLockEliding")) { 1239 if (CompilerOracle::has_option_string(_method, "UseRTMLockEliding") || !UseRTMDeopt) { 1240 // Generate RTM lock eliding code without abort ratio calculation code. 1241 _rtm_state = UseRTM; 1242 } else if (UseRTMDeopt) { 1243 // Generate RTM lock eliding code and include abort ratio calculation 1244 // code if UseRTMDeopt is on. 1245 _rtm_state = ProfileRTM; 1246 } 1247 } 1248 #endif 1249 1250 // Initialize flags and trap history. 1251 _nof_decompiles = 0; 1252 _nof_overflow_recompiles = 0; 1253 _nof_overflow_traps = 0; 1254 clear_escape_info(); 1255 assert(sizeof(_trap_hist) % sizeof(HeapWord) == 0, "align"); 1256 Copy::zero_to_words((HeapWord*) &_trap_hist, 1257 sizeof(_trap_hist) / sizeof(HeapWord)); 1258 } 1259 1260 // Get a measure of how much mileage the method has on it. 1261 int MethodData::mileage_of(Method* method) { 1262 int mileage = 0; 1263 if (TieredCompilation) { 1264 mileage = MAX2(method->invocation_count(), method->backedge_count()); 1265 } else { 1266 int iic = method->interpreter_invocation_count(); 1267 if (mileage < iic) mileage = iic; 1268 MethodCounters* mcs = method->method_counters(); 1269 if (mcs != NULL) { 1270 InvocationCounter* ic = mcs->invocation_counter(); 1271 InvocationCounter* bc = mcs->backedge_counter(); 1272 int icval = ic->count(); 1273 if (ic->carry()) icval += CompileThreshold; 1274 if (mileage < icval) mileage = icval; 1275 int bcval = bc->count(); 1276 if (bc->carry()) bcval += CompileThreshold; 1277 if (mileage < bcval) mileage = bcval; 1278 } 1279 } 1280 return mileage; 1281 } 1282 1283 bool MethodData::is_mature() const { 1284 return CompilationPolicy::policy()->is_mature(_method); 1285 } 1286 1287 // Translate a bci to its corresponding data index (di). 1288 address MethodData::bci_to_dp(int bci) { 1289 ResourceMark rm; 1290 ProfileData* data = data_before(bci); 1291 ProfileData* prev = NULL; 1292 for ( ; is_valid(data); data = next_data(data)) { 1293 if (data->bci() >= bci) { 1294 if (data->bci() == bci) set_hint_di(dp_to_di(data->dp())); 1295 else if (prev != NULL) set_hint_di(dp_to_di(prev->dp())); 1296 return data->dp(); 1297 } 1298 prev = data; 1299 } 1300 return (address)limit_data_position(); 1301 } 1302 1303 // Translate a bci to its corresponding data, or NULL. 1304 ProfileData* MethodData::bci_to_data(int bci) { 1305 ProfileData* data = data_before(bci); 1306 for ( ; is_valid(data); data = next_data(data)) { 1307 if (data->bci() == bci) { 1308 set_hint_di(dp_to_di(data->dp())); 1309 return data; 1310 } else if (data->bci() > bci) { 1311 break; 1312 } 1313 } 1314 return bci_to_extra_data(bci, NULL, false); 1315 } 1316 1317 DataLayout* MethodData::next_extra(DataLayout* dp) { 1318 int nb_cells = 0; 1319 switch(dp->tag()) { 1320 case DataLayout::bit_data_tag: 1321 case DataLayout::no_tag: 1322 nb_cells = BitData::static_cell_count(); 1323 break; 1324 case DataLayout::speculative_trap_data_tag: 1325 nb_cells = SpeculativeTrapData::static_cell_count(); 1326 break; 1327 default: 1328 fatal("unexpected tag %d", dp->tag()); 1329 } 1330 return (DataLayout*)((address)dp + DataLayout::compute_size_in_bytes(nb_cells)); 1331 } 1332 1333 ProfileData* MethodData::bci_to_extra_data_helper(int bci, Method* m, DataLayout*& dp, bool concurrent) { 1334 DataLayout* end = args_data_limit(); 1335 1336 for (;; dp = next_extra(dp)) { 1337 assert(dp < end, "moved past end of extra data"); 1338 // No need for "OrderAccess::load_acquire" ops, 1339 // since the data structure is monotonic. 1340 switch(dp->tag()) { 1341 case DataLayout::no_tag: 1342 return NULL; 1343 case DataLayout::arg_info_data_tag: 1344 dp = end; 1345 return NULL; // ArgInfoData is at the end of extra data section. 1346 case DataLayout::bit_data_tag: 1347 if (m == NULL && dp->bci() == bci) { 1348 return new BitData(dp); 1349 } 1350 break; 1351 case DataLayout::speculative_trap_data_tag: 1352 if (m != NULL) { 1353 SpeculativeTrapData* data = new SpeculativeTrapData(dp); 1354 // data->method() may be null in case of a concurrent 1355 // allocation. Maybe it's for the same method. Try to use that 1356 // entry in that case. 1357 if (dp->bci() == bci) { 1358 if (data->method() == NULL) { 1359 assert(concurrent, "impossible because no concurrent allocation"); 1360 return NULL; 1361 } else if (data->method() == m) { 1362 return data; 1363 } 1364 } 1365 } 1366 break; 1367 default: 1368 fatal("unexpected tag %d", dp->tag()); 1369 } 1370 } 1371 return NULL; 1372 } 1373 1374 1375 // Translate a bci to its corresponding extra data, or NULL. 1376 ProfileData* MethodData::bci_to_extra_data(int bci, Method* m, bool create_if_missing) { 1377 // This code assumes an entry for a SpeculativeTrapData is 2 cells 1378 assert(2*DataLayout::compute_size_in_bytes(BitData::static_cell_count()) == 1379 DataLayout::compute_size_in_bytes(SpeculativeTrapData::static_cell_count()), 1380 "code needs to be adjusted"); 1381 1382 // Do not create one of these if method has been redefined. 1383 if (m != NULL && m->is_old()) { 1384 return NULL; 1385 } 1386 1387 DataLayout* dp = extra_data_base(); 1388 DataLayout* end = args_data_limit(); 1389 1390 // Allocation in the extra data space has to be atomic because not 1391 // all entries have the same size and non atomic concurrent 1392 // allocation would result in a corrupted extra data space. 1393 ProfileData* result = bci_to_extra_data_helper(bci, m, dp, true); 1394 if (result != NULL) { 1395 return result; 1396 } 1397 1398 if (create_if_missing && dp < end) { 1399 MutexLocker ml(&_extra_data_lock); 1400 // Check again now that we have the lock. Another thread may 1401 // have added extra data entries. 1402 ProfileData* result = bci_to_extra_data_helper(bci, m, dp, false); 1403 if (result != NULL || dp >= end) { 1404 return result; 1405 } 1406 1407 assert(dp->tag() == DataLayout::no_tag || (dp->tag() == DataLayout::speculative_trap_data_tag && m != NULL), "should be free"); 1408 assert(next_extra(dp)->tag() == DataLayout::no_tag || next_extra(dp)->tag() == DataLayout::arg_info_data_tag, "should be free or arg info"); 1409 u1 tag = m == NULL ? DataLayout::bit_data_tag : DataLayout::speculative_trap_data_tag; 1410 // SpeculativeTrapData is 2 slots. Make sure we have room. 1411 if (m != NULL && next_extra(dp)->tag() != DataLayout::no_tag) { 1412 return NULL; 1413 } 1414 DataLayout temp; 1415 temp.initialize(tag, bci, 0); 1416 1417 dp->set_header(temp.header()); 1418 assert(dp->tag() == tag, "sane"); 1419 assert(dp->bci() == bci, "no concurrent allocation"); 1420 if (tag == DataLayout::bit_data_tag) { 1421 return new BitData(dp); 1422 } else { 1423 SpeculativeTrapData* data = new SpeculativeTrapData(dp); 1424 data->set_method(m); 1425 return data; 1426 } 1427 } 1428 return NULL; 1429 } 1430 1431 ArgInfoData *MethodData::arg_info() { 1432 DataLayout* dp = extra_data_base(); 1433 DataLayout* end = args_data_limit(); 1434 for (; dp < end; dp = next_extra(dp)) { 1435 if (dp->tag() == DataLayout::arg_info_data_tag) 1436 return new ArgInfoData(dp); 1437 } 1438 return NULL; 1439 } 1440 1441 // Printing 1442 1443 void MethodData::print_on(outputStream* st) const { 1444 assert(is_methodData(), "should be method data"); 1445 st->print("method data for "); 1446 method()->print_value_on(st); 1447 st->cr(); 1448 print_data_on(st); 1449 } 1450 1451 void MethodData::print_value_on(outputStream* st) const { 1452 assert(is_methodData(), "should be method data"); 1453 st->print("method data for "); 1454 method()->print_value_on(st); 1455 } 1456 1457 void MethodData::print_data_on(outputStream* st) const { 1458 ResourceMark rm; 1459 ProfileData* data = first_data(); 1460 if (_parameters_type_data_di != no_parameters) { 1461 parameters_type_data()->print_data_on(st); 1462 } 1463 for ( ; is_valid(data); data = next_data(data)) { 1464 st->print("%d", dp_to_di(data->dp())); 1465 st->fill_to(6); 1466 data->print_data_on(st, this); 1467 } 1468 st->print_cr("--- Extra data:"); 1469 DataLayout* dp = extra_data_base(); 1470 DataLayout* end = args_data_limit(); 1471 for (;; dp = next_extra(dp)) { 1472 assert(dp < end, "moved past end of extra data"); 1473 // No need for "OrderAccess::load_acquire" ops, 1474 // since the data structure is monotonic. 1475 switch(dp->tag()) { 1476 case DataLayout::no_tag: 1477 continue; 1478 case DataLayout::bit_data_tag: 1479 data = new BitData(dp); 1480 break; 1481 case DataLayout::speculative_trap_data_tag: 1482 data = new SpeculativeTrapData(dp); 1483 break; 1484 case DataLayout::arg_info_data_tag: 1485 data = new ArgInfoData(dp); 1486 dp = end; // ArgInfoData is at the end of extra data section. 1487 break; 1488 default: 1489 fatal("unexpected tag %d", dp->tag()); 1490 } 1491 st->print("%d", dp_to_di(data->dp())); 1492 st->fill_to(6); 1493 data->print_data_on(st); 1494 if (dp >= end) return; 1495 } 1496 } 1497 1498 #if INCLUDE_SERVICES 1499 // Size Statistics 1500 void MethodData::collect_statistics(KlassSizeStats *sz) const { 1501 int n = sz->count(this); 1502 sz->_method_data_bytes += n; 1503 sz->_method_all_bytes += n; 1504 sz->_rw_bytes += n; 1505 } 1506 #endif // INCLUDE_SERVICES 1507 1508 // Verification 1509 1510 void MethodData::verify_on(outputStream* st) { 1511 guarantee(is_methodData(), "object must be method data"); 1512 // guarantee(m->is_perm(), "should be in permspace"); 1513 this->verify_data_on(st); 1514 } 1515 1516 void MethodData::verify_data_on(outputStream* st) { 1517 NEEDS_CLEANUP; 1518 // not yet implemented. 1519 } 1520 1521 bool MethodData::profile_jsr292(const methodHandle& m, int bci) { 1522 if (m->is_compiled_lambda_form()) { 1523 return true; 1524 } 1525 1526 Bytecode_invoke inv(m , bci); 1527 return inv.is_invokedynamic() || inv.is_invokehandle(); 1528 } 1529 1530 bool MethodData::profile_unsafe(const methodHandle& m, int bci) { 1531 Bytecode_invoke inv(m , bci); 1532 if (inv.is_invokevirtual() && inv.klass() == vmSymbols::jdk_internal_misc_Unsafe()) { 1533 ResourceMark rm; 1534 char* name = inv.name()->as_C_string(); 1535 if (!strncmp(name, "get", 3) || !strncmp(name, "put", 3)) { 1536 return true; 1537 } 1538 } 1539 return false; 1540 } 1541 1542 int MethodData::profile_arguments_flag() { 1543 return TypeProfileLevel % 10; 1544 } 1545 1546 bool MethodData::profile_arguments() { 1547 return profile_arguments_flag() > no_type_profile && profile_arguments_flag() <= type_profile_all; 1548 } 1549 1550 bool MethodData::profile_arguments_jsr292_only() { 1551 return profile_arguments_flag() == type_profile_jsr292; 1552 } 1553 1554 bool MethodData::profile_all_arguments() { 1555 return profile_arguments_flag() == type_profile_all; 1556 } 1557 1558 bool MethodData::profile_arguments_for_invoke(const methodHandle& m, int bci) { 1559 if (!profile_arguments()) { 1560 return false; 1561 } 1562 1563 if (profile_all_arguments()) { 1564 return true; 1565 } 1566 1567 if (profile_unsafe(m, bci)) { 1568 return true; 1569 } 1570 1571 assert(profile_arguments_jsr292_only(), "inconsistent"); 1572 return profile_jsr292(m, bci); 1573 } 1574 1575 int MethodData::profile_return_flag() { 1576 return (TypeProfileLevel % 100) / 10; 1577 } 1578 1579 bool MethodData::profile_return() { 1580 return profile_return_flag() > no_type_profile && profile_return_flag() <= type_profile_all; 1581 } 1582 1583 bool MethodData::profile_return_jsr292_only() { 1584 return profile_return_flag() == type_profile_jsr292; 1585 } 1586 1587 bool MethodData::profile_all_return() { 1588 return profile_return_flag() == type_profile_all; 1589 } 1590 1591 bool MethodData::profile_return_for_invoke(const methodHandle& m, int bci) { 1592 if (!profile_return()) { 1593 return false; 1594 } 1595 1596 if (profile_all_return()) { 1597 return true; 1598 } 1599 1600 assert(profile_return_jsr292_only(), "inconsistent"); 1601 return profile_jsr292(m, bci); 1602 } 1603 1604 int MethodData::profile_parameters_flag() { 1605 return TypeProfileLevel / 100; 1606 } 1607 1608 bool MethodData::profile_parameters() { 1609 return profile_parameters_flag() > no_type_profile && profile_parameters_flag() <= type_profile_all; 1610 } 1611 1612 bool MethodData::profile_parameters_jsr292_only() { 1613 return profile_parameters_flag() == type_profile_jsr292; 1614 } 1615 1616 bool MethodData::profile_all_parameters() { 1617 return profile_parameters_flag() == type_profile_all; 1618 } 1619 1620 bool MethodData::profile_parameters_for_method(const methodHandle& m) { 1621 if (!profile_parameters()) { 1622 return false; 1623 } 1624 1625 if (profile_all_parameters()) { 1626 return true; 1627 } 1628 1629 assert(profile_parameters_jsr292_only(), "inconsistent"); 1630 return m->is_compiled_lambda_form(); 1631 } 1632 1633 void MethodData::clean_extra_data_helper(DataLayout* dp, int shift, bool reset) { 1634 if (shift == 0) { 1635 return; 1636 } 1637 if (!reset) { 1638 // Move all cells of trap entry at dp left by "shift" cells 1639 intptr_t* start = (intptr_t*)dp; 1640 intptr_t* end = (intptr_t*)next_extra(dp); 1641 for (intptr_t* ptr = start; ptr < end; ptr++) { 1642 *(ptr-shift) = *ptr; 1643 } 1644 } else { 1645 // Reset "shift" cells stopping at dp 1646 intptr_t* start = ((intptr_t*)dp) - shift; 1647 intptr_t* end = (intptr_t*)dp; 1648 for (intptr_t* ptr = start; ptr < end; ptr++) { 1649 *ptr = 0; 1650 } 1651 } 1652 } 1653 1654 class CleanExtraDataClosure : public StackObj { 1655 public: 1656 virtual bool is_live(Method* m) = 0; 1657 }; 1658 1659 // Check for entries that reference an unloaded method 1660 class CleanExtraDataKlassClosure : public CleanExtraDataClosure { 1661 private: 1662 BoolObjectClosure* _is_alive; 1663 public: 1664 CleanExtraDataKlassClosure(BoolObjectClosure* is_alive) : _is_alive(is_alive) {} 1665 bool is_live(Method* m) { 1666 return m->method_holder()->is_loader_alive(_is_alive); 1667 } 1668 }; 1669 1670 // Check for entries that reference a redefined method 1671 class CleanExtraDataMethodClosure : public CleanExtraDataClosure { 1672 public: 1673 CleanExtraDataMethodClosure() {} 1674 bool is_live(Method* m) { return !m->is_old(); } 1675 }; 1676 1677 1678 // Remove SpeculativeTrapData entries that reference an unloaded or 1679 // redefined method 1680 void MethodData::clean_extra_data(CleanExtraDataClosure* cl) { 1681 DataLayout* dp = extra_data_base(); 1682 DataLayout* end = args_data_limit(); 1683 1684 int shift = 0; 1685 for (; dp < end; dp = next_extra(dp)) { 1686 switch(dp->tag()) { 1687 case DataLayout::speculative_trap_data_tag: { 1688 SpeculativeTrapData* data = new SpeculativeTrapData(dp); 1689 Method* m = data->method(); 1690 assert(m != NULL, "should have a method"); 1691 if (!cl->is_live(m)) { 1692 // "shift" accumulates the number of cells for dead 1693 // SpeculativeTrapData entries that have been seen so 1694 // far. Following entries must be shifted left by that many 1695 // cells to remove the dead SpeculativeTrapData entries. 1696 shift += (int)((intptr_t*)next_extra(dp) - (intptr_t*)dp); 1697 } else { 1698 // Shift this entry left if it follows dead 1699 // SpeculativeTrapData entries 1700 clean_extra_data_helper(dp, shift); 1701 } 1702 break; 1703 } 1704 case DataLayout::bit_data_tag: 1705 // Shift this entry left if it follows dead SpeculativeTrapData 1706 // entries 1707 clean_extra_data_helper(dp, shift); 1708 continue; 1709 case DataLayout::no_tag: 1710 case DataLayout::arg_info_data_tag: 1711 // We are at end of the live trap entries. The previous "shift" 1712 // cells contain entries that are either dead or were shifted 1713 // left. They need to be reset to no_tag 1714 clean_extra_data_helper(dp, shift, true); 1715 return; 1716 default: 1717 fatal("unexpected tag %d", dp->tag()); 1718 } 1719 } 1720 } 1721 1722 // Verify there's no unloaded or redefined method referenced by a 1723 // SpeculativeTrapData entry 1724 void MethodData::verify_extra_data_clean(CleanExtraDataClosure* cl) { 1725 #ifdef ASSERT 1726 DataLayout* dp = extra_data_base(); 1727 DataLayout* end = args_data_limit(); 1728 1729 for (; dp < end; dp = next_extra(dp)) { 1730 switch(dp->tag()) { 1731 case DataLayout::speculative_trap_data_tag: { 1732 SpeculativeTrapData* data = new SpeculativeTrapData(dp); 1733 Method* m = data->method(); 1734 assert(m != NULL && cl->is_live(m), "Method should exist"); 1735 break; 1736 } 1737 case DataLayout::bit_data_tag: 1738 continue; 1739 case DataLayout::no_tag: 1740 case DataLayout::arg_info_data_tag: 1741 return; 1742 default: 1743 fatal("unexpected tag %d", dp->tag()); 1744 } 1745 } 1746 #endif 1747 } 1748 1749 void MethodData::clean_method_data(BoolObjectClosure* is_alive) { 1750 ResourceMark rm; 1751 for (ProfileData* data = first_data(); 1752 is_valid(data); 1753 data = next_data(data)) { 1754 data->clean_weak_klass_links(is_alive); 1755 } 1756 ParametersTypeData* parameters = parameters_type_data(); 1757 if (parameters != NULL) { 1758 parameters->clean_weak_klass_links(is_alive); 1759 } 1760 1761 CleanExtraDataKlassClosure cl(is_alive); 1762 clean_extra_data(&cl); 1763 verify_extra_data_clean(&cl); 1764 } 1765 1766 void MethodData::clean_weak_method_links() { 1767 ResourceMark rm; 1768 for (ProfileData* data = first_data(); 1769 is_valid(data); 1770 data = next_data(data)) { 1771 data->clean_weak_method_links(); 1772 } 1773 1774 CleanExtraDataMethodClosure cl; 1775 clean_extra_data(&cl); 1776 verify_extra_data_clean(&cl); 1777 } 1778 1779 #ifdef ASSERT 1780 void MethodData::verify_clean_weak_method_links() { 1781 ResourceMark rm; 1782 for (ProfileData* data = first_data(); 1783 is_valid(data); 1784 data = next_data(data)) { 1785 data->verify_clean_weak_method_links(); 1786 } 1787 1788 CleanExtraDataMethodClosure cl; 1789 verify_extra_data_clean(&cl); 1790 } 1791 #endif // ASSERT