1 /* 2 * Copyright (c) 2000, 2013, 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 "interpreter/bytecode.hpp" 28 #include "interpreter/bytecodeStream.hpp" 29 #include "interpreter/linkResolver.hpp" 30 #include "memory/heapInspection.hpp" 31 #include "oops/methodData.hpp" 32 #include "prims/jvmtiRedefineClasses.hpp" 33 #include "runtime/compilationPolicy.hpp" 34 #include "runtime/deoptimization.hpp" 35 #include "runtime/handles.inline.hpp" 36 37 // ================================================================== 38 // DataLayout 39 // 40 // Overlay for generic profiling data. 41 42 // Some types of data layouts need a length field. 43 bool DataLayout::needs_array_len(u1 tag) { 44 return (tag == multi_branch_data_tag) || (tag == arg_info_data_tag); 45 } 46 47 // Perform generic initialization of the data. More specific 48 // initialization occurs in overrides of ProfileData::post_initialize. 49 void DataLayout::initialize(u1 tag, u2 bci, int cell_count) { 50 _header._bits = (intptr_t)0; 51 _header._struct._tag = tag; 52 _header._struct._bci = bci; 53 for (int i = 0; i < cell_count; i++) { 54 set_cell_at(i, (intptr_t)0); 55 } 56 if (needs_array_len(tag)) { 57 set_cell_at(ArrayData::array_len_off_set, cell_count - 1); // -1 for header. 58 } 59 if (tag == call_type_data_tag) { 60 CallTypeData::initialize(this, cell_count); 61 } else if (tag == virtual_call_type_data_tag) { 62 VirtualCallTypeData::initialize(this, cell_count); 63 } 64 } 65 66 void DataLayout::clean_weak_klass_links(BoolObjectClosure* cl) { 67 ResourceMark m; 68 data_in()->clean_weak_klass_links(cl); 69 } 70 71 72 // ================================================================== 73 // ProfileData 74 // 75 // A ProfileData object is created to refer to a section of profiling 76 // data in a structured way. 77 78 // Constructor for invalid ProfileData. 79 ProfileData::ProfileData() { 80 _data = NULL; 81 } 82 83 #ifndef PRODUCT 84 void ProfileData::print_shared(outputStream* st, const char* name) const { 85 st->print("bci: %d", bci()); 86 st->fill_to(tab_width_one); 87 st->print("%s", name); 88 tab(st); 89 int trap = trap_state(); 90 if (trap != 0) { 91 char buf[100]; 92 st->print("trap(%s) ", Deoptimization::format_trap_state(buf, sizeof(buf), trap)); 93 } 94 int flags = data()->flags(); 95 if (flags != 0) 96 st->print("flags(%d) ", flags); 97 } 98 99 void ProfileData::tab(outputStream* st, bool first) const { 100 st->fill_to(first ? tab_width_one : tab_width_two); 101 } 102 #endif // !PRODUCT 103 104 // ================================================================== 105 // BitData 106 // 107 // A BitData corresponds to a one-bit flag. This is used to indicate 108 // whether a checkcast bytecode has seen a null value. 109 110 111 #ifndef PRODUCT 112 void BitData::print_data_on(outputStream* st) const { 113 print_shared(st, "BitData"); 114 } 115 #endif // !PRODUCT 116 117 // ================================================================== 118 // CounterData 119 // 120 // A CounterData corresponds to a simple counter. 121 122 #ifndef PRODUCT 123 void CounterData::print_data_on(outputStream* st) const { 124 print_shared(st, "CounterData"); 125 st->print_cr("count(%u)", count()); 126 } 127 #endif // !PRODUCT 128 129 // ================================================================== 130 // JumpData 131 // 132 // A JumpData is used to access profiling information for a direct 133 // branch. It is a counter, used for counting the number of branches, 134 // plus a data displacement, used for realigning the data pointer to 135 // the corresponding target bci. 136 137 void JumpData::post_initialize(BytecodeStream* stream, MethodData* mdo) { 138 assert(stream->bci() == bci(), "wrong pos"); 139 int target; 140 Bytecodes::Code c = stream->code(); 141 if (c == Bytecodes::_goto_w || c == Bytecodes::_jsr_w) { 142 target = stream->dest_w(); 143 } else { 144 target = stream->dest(); 145 } 146 int my_di = mdo->dp_to_di(dp()); 147 int target_di = mdo->bci_to_di(target); 148 int offset = target_di - my_di; 149 set_displacement(offset); 150 } 151 152 #ifndef PRODUCT 153 void JumpData::print_data_on(outputStream* st) const { 154 print_shared(st, "JumpData"); 155 st->print_cr("taken(%u) displacement(%d)", taken(), displacement()); 156 } 157 #endif // !PRODUCT 158 159 int TypeStackSlotEntries::compute_cell_count(Symbol* signature, int max) { 160 ResourceMark rm; 161 SignatureStream ss(signature); 162 int args_count = MIN2(ss.reference_parameter_count(), max); 163 return args_count * per_arg_cell_count; 164 } 165 166 int TypeEntriesAtCall::compute_cell_count(BytecodeStream* stream) { 167 assert(Bytecodes::is_invoke(stream->code()), "should be invoke"); 168 assert(TypeStackSlotEntries::per_arg_count() > ReturnTypeEntry::static_cell_count(), "code to test for arguments/results broken"); 169 Bytecode_invoke inv(stream->method(), stream->bci()); 170 int args_cell = 0; 171 if (arguments_profiling_enabled()) { 172 args_cell = TypeStackSlotEntries::compute_cell_count(inv.signature(), TypeProfileArgsLimit); 173 } 174 int ret_cell = 0; 175 if (return_profiling_enabled() && (inv.result_type() == T_OBJECT || inv.result_type() == T_ARRAY)) { 176 ret_cell = ReturnTypeEntry::static_cell_count(); 177 } 178 int header_cell = 0; 179 if (args_cell + ret_cell > 0) { 180 header_cell = header_cell_count(); 181 } 182 183 return header_cell + args_cell + ret_cell; 184 } 185 186 class ArgumentOffsetComputer : public SignatureInfo { 187 private: 188 int _max; 189 GrowableArray<int> _offsets; 190 191 void set(int size, BasicType type) { _size += size; } 192 void do_object(int begin, int end) { 193 if (_offsets.length() < _max) { 194 _offsets.push(_size); 195 } 196 SignatureInfo::do_object(begin, end); 197 } 198 void do_array (int begin, int end) { 199 if (_offsets.length() < _max) { 200 _offsets.push(_size); 201 } 202 SignatureInfo::do_array(begin, end); 203 } 204 205 public: 206 ArgumentOffsetComputer(Symbol* signature, int max) 207 : SignatureInfo(signature), _max(max), _offsets(Thread::current(), max) { 208 } 209 210 int total() { lazy_iterate_parameters(); return _size; } 211 212 int off_at(int i) const { return _offsets.at(i); } 213 }; 214 215 void TypeStackSlotEntries::post_initialize(Symbol* signature, bool has_receiver) { 216 ResourceMark rm; 217 ArgumentOffsetComputer aos(signature, _number_of_entries); 218 aos.total(); 219 for (int i = 0; i < _number_of_entries; i++) { 220 set_stack_slot(i, aos.off_at(i) + (has_receiver ? 1 : 0)); 221 set_type(i, type_none()); 222 } 223 } 224 225 void CallTypeData::post_initialize(BytecodeStream* stream, MethodData* mdo) { 226 assert(Bytecodes::is_invoke(stream->code()), "should be invoke"); 227 Bytecode_invoke inv(stream->method(), stream->bci()); 228 229 SignatureStream ss(inv.signature()); 230 if (has_arguments()) { 231 #ifdef ASSERT 232 ResourceMark rm; 233 int count = MIN2(ss.reference_parameter_count(), (int)TypeProfileArgsLimit); 234 assert(count > 0, "room for args type but none found?"); 235 check_number_of_arguments(count); 236 #endif 237 _args.post_initialize(inv.signature(), inv.has_receiver()); 238 } 239 240 if (has_return()) { 241 assert(inv.result_type() == T_OBJECT || inv.result_type() == T_ARRAY, "room for a ret type but doesn't return obj?"); 242 _ret.post_initialize(); 243 } 244 } 245 246 void VirtualCallTypeData::post_initialize(BytecodeStream* stream, MethodData* mdo) { 247 assert(Bytecodes::is_invoke(stream->code()), "should be invoke"); 248 Bytecode_invoke inv(stream->method(), stream->bci()); 249 250 if (has_arguments()) { 251 #ifdef ASSERT 252 ResourceMark rm; 253 SignatureStream ss(inv.signature()); 254 int count = MIN2(ss.reference_parameter_count(), (int)TypeProfileArgsLimit); 255 assert(count > 0, "room for args type but none found?"); 256 check_number_of_arguments(count); 257 #endif 258 _args.post_initialize(inv.signature(), inv.has_receiver()); 259 } 260 261 if (has_return()) { 262 assert(inv.result_type() == T_OBJECT || inv.result_type() == T_ARRAY, "room for a ret type but doesn't return obj?"); 263 _ret.post_initialize(); 264 } 265 } 266 267 bool TypeEntries::is_loader_alive(BoolObjectClosure* is_alive_cl, intptr_t p) { 268 return !is_type_none(p) && 269 !((Klass*)klass_part(p))->is_loader_alive(is_alive_cl); 270 } 271 272 void TypeStackSlotEntries::clean_weak_klass_links(BoolObjectClosure* is_alive_cl) { 273 for (int i = 0; i < _number_of_entries; i++) { 274 intptr_t p = type(i); 275 if (is_loader_alive(is_alive_cl, p)) { 276 set_type(i, type_none()); 277 } 278 } 279 } 280 281 void ReturnTypeEntry::clean_weak_klass_links(BoolObjectClosure* is_alive_cl) { 282 intptr_t p = type(); 283 if (is_loader_alive(is_alive_cl, p)) { 284 set_type(type_none()); 285 } 286 } 287 288 bool TypeEntriesAtCall::return_profiling_enabled() { 289 return MethodData::profile_return(); 290 } 291 292 bool TypeEntriesAtCall::arguments_profiling_enabled() { 293 return MethodData::profile_arguments(); 294 } 295 296 #ifndef PRODUCT 297 void TypeEntries::print_klass(outputStream* st, intptr_t k) { 298 if (is_type_none(k)) { 299 st->print("none"); 300 } else if (is_type_unknown(k)) { 301 st->print("unknown"); 302 } else { 303 valid_klass(k)->print_value_on(st); 304 } 305 if (was_null_seen(k)) { 306 st->print(" (null seen)"); 307 } 308 } 309 310 void TypeStackSlotEntries::print_data_on(outputStream* st) const { 311 for (int i = 0; i < _number_of_entries; i++) { 312 _pd->tab(st); 313 st->print("%d: stack(%u) ", i, stack_slot(i)); 314 print_klass(st, type(i)); 315 st->cr(); 316 } 317 } 318 319 void ReturnTypeEntry::print_data_on(outputStream* st) const { 320 _pd->tab(st); 321 print_klass(st, type()); 322 st->cr(); 323 } 324 325 void CallTypeData::print_data_on(outputStream* st) const { 326 CounterData::print_data_on(st); 327 if (has_arguments()) { 328 tab(st, true); 329 st->print("argument types"); 330 _args.print_data_on(st); 331 } 332 if (has_return()) { 333 tab(st, true); 334 st->print("return type"); 335 _ret.print_data_on(st); 336 } 337 } 338 339 void VirtualCallTypeData::print_data_on(outputStream* st) const { 340 VirtualCallData::print_data_on(st); 341 if (has_arguments()) { 342 tab(st, true); 343 st->print("argument types"); 344 _args.print_data_on(st); 345 } 346 if (has_return()) { 347 tab(st, true); 348 st->print("return type"); 349 _ret.print_data_on(st); 350 } 351 } 352 #endif 353 354 // ================================================================== 355 // ReceiverTypeData 356 // 357 // A ReceiverTypeData is used to access profiling information about a 358 // dynamic type check. It consists of a counter which counts the total times 359 // that the check is reached, and a series of (Klass*, count) pairs 360 // which are used to store a type profile for the receiver of the check. 361 362 void ReceiverTypeData::clean_weak_klass_links(BoolObjectClosure* is_alive_cl) { 363 for (uint row = 0; row < row_limit(); row++) { 364 Klass* p = receiver(row); 365 if (p != NULL && !p->is_loader_alive(is_alive_cl)) { 366 clear_row(row); 367 } 368 } 369 } 370 371 #ifndef PRODUCT 372 void ReceiverTypeData::print_receiver_data_on(outputStream* st) const { 373 uint row; 374 int entries = 0; 375 for (row = 0; row < row_limit(); row++) { 376 if (receiver(row) != NULL) entries++; 377 } 378 st->print_cr("count(%u) entries(%u)", count(), entries); 379 int total = count(); 380 for (row = 0; row < row_limit(); row++) { 381 if (receiver(row) != NULL) { 382 total += receiver_count(row); 383 } 384 } 385 for (row = 0; row < row_limit(); row++) { 386 if (receiver(row) != NULL) { 387 tab(st); 388 receiver(row)->print_value_on(st); 389 st->print_cr("(%u %4.2f)", receiver_count(row), (float) receiver_count(row) / (float) total); 390 } 391 } 392 } 393 void ReceiverTypeData::print_data_on(outputStream* st) const { 394 print_shared(st, "ReceiverTypeData"); 395 print_receiver_data_on(st); 396 } 397 void VirtualCallData::print_data_on(outputStream* st) const { 398 print_shared(st, "VirtualCallData"); 399 print_receiver_data_on(st); 400 } 401 #endif // !PRODUCT 402 403 // ================================================================== 404 // RetData 405 // 406 // A RetData is used to access profiling information for a ret bytecode. 407 // It is composed of a count of the number of times that the ret has 408 // been executed, followed by a series of triples of the form 409 // (bci, count, di) which count the number of times that some bci was the 410 // target of the ret and cache a corresponding displacement. 411 412 void RetData::post_initialize(BytecodeStream* stream, MethodData* mdo) { 413 for (uint row = 0; row < row_limit(); row++) { 414 set_bci_displacement(row, -1); 415 set_bci(row, no_bci); 416 } 417 // release so other threads see a consistent state. bci is used as 418 // a valid flag for bci_displacement. 419 OrderAccess::release(); 420 } 421 422 // This routine needs to atomically update the RetData structure, so the 423 // caller needs to hold the RetData_lock before it gets here. Since taking 424 // the lock can block (and allow GC) and since RetData is a ProfileData is a 425 // wrapper around a derived oop, taking the lock in _this_ method will 426 // basically cause the 'this' pointer's _data field to contain junk after the 427 // lock. We require the caller to take the lock before making the ProfileData 428 // structure. Currently the only caller is InterpreterRuntime::update_mdp_for_ret 429 address RetData::fixup_ret(int return_bci, MethodData* h_mdo) { 430 // First find the mdp which corresponds to the return bci. 431 address mdp = h_mdo->bci_to_dp(return_bci); 432 433 // Now check to see if any of the cache slots are open. 434 for (uint row = 0; row < row_limit(); row++) { 435 if (bci(row) == no_bci) { 436 set_bci_displacement(row, mdp - dp()); 437 set_bci_count(row, DataLayout::counter_increment); 438 // Barrier to ensure displacement is written before the bci; allows 439 // the interpreter to read displacement without fear of race condition. 440 release_set_bci(row, return_bci); 441 break; 442 } 443 } 444 return mdp; 445 } 446 447 448 #ifndef PRODUCT 449 void RetData::print_data_on(outputStream* st) const { 450 print_shared(st, "RetData"); 451 uint row; 452 int entries = 0; 453 for (row = 0; row < row_limit(); row++) { 454 if (bci(row) != no_bci) entries++; 455 } 456 st->print_cr("count(%u) entries(%u)", count(), entries); 457 for (row = 0; row < row_limit(); row++) { 458 if (bci(row) != no_bci) { 459 tab(st); 460 st->print_cr("bci(%d: count(%u) displacement(%d))", 461 bci(row), bci_count(row), bci_displacement(row)); 462 } 463 } 464 } 465 #endif // !PRODUCT 466 467 // ================================================================== 468 // BranchData 469 // 470 // A BranchData is used to access profiling data for a two-way branch. 471 // It consists of taken and not_taken counts as well as a data displacement 472 // for the taken case. 473 474 void BranchData::post_initialize(BytecodeStream* stream, MethodData* mdo) { 475 assert(stream->bci() == bci(), "wrong pos"); 476 int target = stream->dest(); 477 int my_di = mdo->dp_to_di(dp()); 478 int target_di = mdo->bci_to_di(target); 479 int offset = target_di - my_di; 480 set_displacement(offset); 481 } 482 483 #ifndef PRODUCT 484 void BranchData::print_data_on(outputStream* st) const { 485 print_shared(st, "BranchData"); 486 st->print_cr("taken(%u) displacement(%d)", 487 taken(), displacement()); 488 tab(st); 489 st->print_cr("not taken(%u)", not_taken()); 490 } 491 #endif 492 493 // ================================================================== 494 // MultiBranchData 495 // 496 // A MultiBranchData is used to access profiling information for 497 // a multi-way branch (*switch bytecodes). It consists of a series 498 // of (count, displacement) pairs, which count the number of times each 499 // case was taken and specify the data displacment for each branch target. 500 501 int MultiBranchData::compute_cell_count(BytecodeStream* stream) { 502 int cell_count = 0; 503 if (stream->code() == Bytecodes::_tableswitch) { 504 Bytecode_tableswitch sw(stream->method()(), stream->bcp()); 505 cell_count = 1 + per_case_cell_count * (1 + sw.length()); // 1 for default 506 } else { 507 Bytecode_lookupswitch sw(stream->method()(), stream->bcp()); 508 cell_count = 1 + per_case_cell_count * (sw.number_of_pairs() + 1); // 1 for default 509 } 510 return cell_count; 511 } 512 513 void MultiBranchData::post_initialize(BytecodeStream* stream, 514 MethodData* mdo) { 515 assert(stream->bci() == bci(), "wrong pos"); 516 int target; 517 int my_di; 518 int target_di; 519 int offset; 520 if (stream->code() == Bytecodes::_tableswitch) { 521 Bytecode_tableswitch sw(stream->method()(), stream->bcp()); 522 int len = sw.length(); 523 assert(array_len() == per_case_cell_count * (len + 1), "wrong len"); 524 for (int count = 0; count < len; count++) { 525 target = sw.dest_offset_at(count) + bci(); 526 my_di = mdo->dp_to_di(dp()); 527 target_di = mdo->bci_to_di(target); 528 offset = target_di - my_di; 529 set_displacement_at(count, offset); 530 } 531 target = sw.default_offset() + bci(); 532 my_di = mdo->dp_to_di(dp()); 533 target_di = mdo->bci_to_di(target); 534 offset = target_di - my_di; 535 set_default_displacement(offset); 536 537 } else { 538 Bytecode_lookupswitch sw(stream->method()(), stream->bcp()); 539 int npairs = sw.number_of_pairs(); 540 assert(array_len() == per_case_cell_count * (npairs + 1), "wrong len"); 541 for (int count = 0; count < npairs; count++) { 542 LookupswitchPair pair = sw.pair_at(count); 543 target = pair.offset() + bci(); 544 my_di = mdo->dp_to_di(dp()); 545 target_di = mdo->bci_to_di(target); 546 offset = target_di - my_di; 547 set_displacement_at(count, offset); 548 } 549 target = sw.default_offset() + bci(); 550 my_di = mdo->dp_to_di(dp()); 551 target_di = mdo->bci_to_di(target); 552 offset = target_di - my_di; 553 set_default_displacement(offset); 554 } 555 } 556 557 #ifndef PRODUCT 558 void MultiBranchData::print_data_on(outputStream* st) const { 559 print_shared(st, "MultiBranchData"); 560 st->print_cr("default_count(%u) displacement(%d)", 561 default_count(), default_displacement()); 562 int cases = number_of_cases(); 563 for (int i = 0; i < cases; i++) { 564 tab(st); 565 st->print_cr("count(%u) displacement(%d)", 566 count_at(i), displacement_at(i)); 567 } 568 } 569 #endif 570 571 #ifndef PRODUCT 572 void ArgInfoData::print_data_on(outputStream* st) const { 573 print_shared(st, "ArgInfoData"); 574 int nargs = number_of_args(); 575 for (int i = 0; i < nargs; i++) { 576 st->print(" 0x%x", arg_modified(i)); 577 } 578 st->cr(); 579 } 580 581 #endif 582 // ================================================================== 583 // MethodData* 584 // 585 // A MethodData* holds information which has been collected about 586 // a method. 587 588 MethodData* MethodData::allocate(ClassLoaderData* loader_data, methodHandle method, TRAPS) { 589 int size = MethodData::compute_allocation_size_in_words(method); 590 591 return new (loader_data, size, false, MetaspaceObj::MethodDataType, THREAD) 592 MethodData(method(), size, CHECK_NULL); 593 } 594 595 int MethodData::bytecode_cell_count(Bytecodes::Code code) { 596 #if defined(COMPILER1) && !defined(COMPILER2) 597 return no_profile_data; 598 #else 599 switch (code) { 600 case Bytecodes::_checkcast: 601 case Bytecodes::_instanceof: 602 case Bytecodes::_aastore: 603 if (TypeProfileCasts) { 604 return ReceiverTypeData::static_cell_count(); 605 } else { 606 return BitData::static_cell_count(); 607 } 608 case Bytecodes::_invokespecial: 609 case Bytecodes::_invokestatic: 610 if (MethodData::profile_arguments() || MethodData::profile_return()) { 611 return variable_cell_count; 612 } else { 613 return CounterData::static_cell_count(); 614 } 615 case Bytecodes::_goto: 616 case Bytecodes::_goto_w: 617 case Bytecodes::_jsr: 618 case Bytecodes::_jsr_w: 619 return JumpData::static_cell_count(); 620 case Bytecodes::_invokevirtual: 621 case Bytecodes::_invokeinterface: 622 if (MethodData::profile_arguments() || MethodData::profile_return()) { 623 return variable_cell_count; 624 } else { 625 return VirtualCallData::static_cell_count(); 626 } 627 case Bytecodes::_invokedynamic: 628 if (MethodData::profile_arguments() || MethodData::profile_return()) { 629 return variable_cell_count; 630 } else { 631 return CounterData::static_cell_count(); 632 } 633 case Bytecodes::_ret: 634 return RetData::static_cell_count(); 635 case Bytecodes::_ifeq: 636 case Bytecodes::_ifne: 637 case Bytecodes::_iflt: 638 case Bytecodes::_ifge: 639 case Bytecodes::_ifgt: 640 case Bytecodes::_ifle: 641 case Bytecodes::_if_icmpeq: 642 case Bytecodes::_if_icmpne: 643 case Bytecodes::_if_icmplt: 644 case Bytecodes::_if_icmpge: 645 case Bytecodes::_if_icmpgt: 646 case Bytecodes::_if_icmple: 647 case Bytecodes::_if_acmpeq: 648 case Bytecodes::_if_acmpne: 649 case Bytecodes::_ifnull: 650 case Bytecodes::_ifnonnull: 651 return BranchData::static_cell_count(); 652 case Bytecodes::_lookupswitch: 653 case Bytecodes::_tableswitch: 654 return variable_cell_count; 655 } 656 return no_profile_data; 657 #endif 658 } 659 660 // Compute the size of the profiling information corresponding to 661 // the current bytecode. 662 int MethodData::compute_data_size(BytecodeStream* stream) { 663 int cell_count = bytecode_cell_count(stream->code()); 664 if (cell_count == no_profile_data) { 665 return 0; 666 } 667 if (cell_count == variable_cell_count) { 668 switch (stream->code()) { 669 case Bytecodes::_lookupswitch: 670 case Bytecodes::_tableswitch: 671 cell_count = MultiBranchData::compute_cell_count(stream); 672 break; 673 case Bytecodes::_invokespecial: 674 case Bytecodes::_invokestatic: 675 case Bytecodes::_invokedynamic: 676 assert(MethodData::profile_arguments() || MethodData::profile_return(), "should be collecting args profile"); 677 if (profile_arguments_for_invoke(stream->method(), stream->bci()) || 678 profile_return_for_invoke(stream->method(), stream->bci())) { 679 cell_count = CallTypeData::compute_cell_count(stream); 680 } else { 681 cell_count = CounterData::static_cell_count(); 682 } 683 break; 684 case Bytecodes::_invokevirtual: 685 case Bytecodes::_invokeinterface: { 686 assert(MethodData::profile_arguments() || MethodData::profile_return(), "should be collecting args profile"); 687 if (profile_arguments_for_invoke(stream->method(), stream->bci()) || 688 profile_return_for_invoke(stream->method(), stream->bci())) { 689 cell_count = VirtualCallTypeData::compute_cell_count(stream); 690 } else { 691 cell_count = VirtualCallData::static_cell_count(); 692 } 693 break; 694 } 695 default: 696 fatal("unexpected bytecode for var length profile data"); 697 } 698 } 699 // Note: cell_count might be zero, meaning that there is just 700 // a DataLayout header, with no extra cells. 701 assert(cell_count >= 0, "sanity"); 702 return DataLayout::compute_size_in_bytes(cell_count); 703 } 704 705 int MethodData::compute_extra_data_count(int data_size, int empty_bc_count) { 706 if (ProfileTraps) { 707 // Assume that up to 3% of BCIs with no MDP will need to allocate one. 708 int extra_data_count = (uint)(empty_bc_count * 3) / 128 + 1; 709 // If the method is large, let the extra BCIs grow numerous (to ~1%). 710 int one_percent_of_data 711 = (uint)data_size / (DataLayout::header_size_in_bytes()*128); 712 if (extra_data_count < one_percent_of_data) 713 extra_data_count = one_percent_of_data; 714 if (extra_data_count > empty_bc_count) 715 extra_data_count = empty_bc_count; // no need for more 716 return extra_data_count; 717 } else { 718 return 0; 719 } 720 } 721 722 // Compute the size of the MethodData* necessary to store 723 // profiling information about a given method. Size is in bytes. 724 int MethodData::compute_allocation_size_in_bytes(methodHandle method) { 725 int data_size = 0; 726 BytecodeStream stream(method); 727 Bytecodes::Code c; 728 int empty_bc_count = 0; // number of bytecodes lacking data 729 while ((c = stream.next()) >= 0) { 730 int size_in_bytes = compute_data_size(&stream); 731 data_size += size_in_bytes; 732 if (size_in_bytes == 0) empty_bc_count += 1; 733 } 734 int object_size = in_bytes(data_offset()) + data_size; 735 736 // Add some extra DataLayout cells (at least one) to track stray traps. 737 int extra_data_count = compute_extra_data_count(data_size, empty_bc_count); 738 object_size += extra_data_count * DataLayout::compute_size_in_bytes(0); 739 740 // Add a cell to record information about modified arguments. 741 int arg_size = method->size_of_parameters(); 742 object_size += DataLayout::compute_size_in_bytes(arg_size+1); 743 744 return object_size; 745 } 746 747 // Compute the size of the MethodData* necessary to store 748 // profiling information about a given method. Size is in words 749 int MethodData::compute_allocation_size_in_words(methodHandle method) { 750 int byte_size = compute_allocation_size_in_bytes(method); 751 int word_size = align_size_up(byte_size, BytesPerWord) / BytesPerWord; 752 return align_object_size(word_size); 753 } 754 755 // Initialize an individual data segment. Returns the size of 756 // the segment in bytes. 757 int MethodData::initialize_data(BytecodeStream* stream, 758 int data_index) { 759 #if defined(COMPILER1) && !defined(COMPILER2) 760 return 0; 761 #else 762 int cell_count = -1; 763 int tag = DataLayout::no_tag; 764 DataLayout* data_layout = data_layout_at(data_index); 765 Bytecodes::Code c = stream->code(); 766 switch (c) { 767 case Bytecodes::_checkcast: 768 case Bytecodes::_instanceof: 769 case Bytecodes::_aastore: 770 if (TypeProfileCasts) { 771 cell_count = ReceiverTypeData::static_cell_count(); 772 tag = DataLayout::receiver_type_data_tag; 773 } else { 774 cell_count = BitData::static_cell_count(); 775 tag = DataLayout::bit_data_tag; 776 } 777 break; 778 case Bytecodes::_invokespecial: 779 case Bytecodes::_invokestatic: { 780 int counter_data_cell_count = CounterData::static_cell_count(); 781 if (profile_arguments_for_invoke(stream->method(), stream->bci()) || 782 profile_return_for_invoke(stream->method(), stream->bci())) { 783 cell_count = CallTypeData::compute_cell_count(stream); 784 } else { 785 cell_count = counter_data_cell_count; 786 } 787 if (cell_count > counter_data_cell_count) { 788 tag = DataLayout::call_type_data_tag; 789 } else { 790 tag = DataLayout::counter_data_tag; 791 } 792 break; 793 } 794 case Bytecodes::_goto: 795 case Bytecodes::_goto_w: 796 case Bytecodes::_jsr: 797 case Bytecodes::_jsr_w: 798 cell_count = JumpData::static_cell_count(); 799 tag = DataLayout::jump_data_tag; 800 break; 801 case Bytecodes::_invokevirtual: 802 case Bytecodes::_invokeinterface: { 803 int virtual_call_data_cell_count = VirtualCallData::static_cell_count(); 804 if (profile_arguments_for_invoke(stream->method(), stream->bci()) || 805 profile_return_for_invoke(stream->method(), stream->bci())) { 806 cell_count = VirtualCallTypeData::compute_cell_count(stream); 807 } else { 808 cell_count = virtual_call_data_cell_count; 809 } 810 if (cell_count > virtual_call_data_cell_count) { 811 tag = DataLayout::virtual_call_type_data_tag; 812 } else { 813 tag = DataLayout::virtual_call_data_tag; 814 } 815 break; 816 } 817 case Bytecodes::_invokedynamic: { 818 // %%% should make a type profile for any invokedynamic that takes a ref argument 819 int counter_data_cell_count = CounterData::static_cell_count(); 820 if (profile_arguments_for_invoke(stream->method(), stream->bci()) || 821 profile_return_for_invoke(stream->method(), stream->bci())) { 822 cell_count = CallTypeData::compute_cell_count(stream); 823 } else { 824 cell_count = counter_data_cell_count; 825 } 826 if (cell_count > counter_data_cell_count) { 827 tag = DataLayout::call_type_data_tag; 828 } else { 829 tag = DataLayout::counter_data_tag; 830 } 831 break; 832 } 833 case Bytecodes::_ret: 834 cell_count = RetData::static_cell_count(); 835 tag = DataLayout::ret_data_tag; 836 break; 837 case Bytecodes::_ifeq: 838 case Bytecodes::_ifne: 839 case Bytecodes::_iflt: 840 case Bytecodes::_ifge: 841 case Bytecodes::_ifgt: 842 case Bytecodes::_ifle: 843 case Bytecodes::_if_icmpeq: 844 case Bytecodes::_if_icmpne: 845 case Bytecodes::_if_icmplt: 846 case Bytecodes::_if_icmpge: 847 case Bytecodes::_if_icmpgt: 848 case Bytecodes::_if_icmple: 849 case Bytecodes::_if_acmpeq: 850 case Bytecodes::_if_acmpne: 851 case Bytecodes::_ifnull: 852 case Bytecodes::_ifnonnull: 853 cell_count = BranchData::static_cell_count(); 854 tag = DataLayout::branch_data_tag; 855 break; 856 case Bytecodes::_lookupswitch: 857 case Bytecodes::_tableswitch: 858 cell_count = MultiBranchData::compute_cell_count(stream); 859 tag = DataLayout::multi_branch_data_tag; 860 break; 861 } 862 assert(tag == DataLayout::multi_branch_data_tag || 863 ((MethodData::profile_arguments() || MethodData::profile_return()) && 864 (tag == DataLayout::call_type_data_tag || 865 tag == DataLayout::counter_data_tag || 866 tag == DataLayout::virtual_call_type_data_tag || 867 tag == DataLayout::virtual_call_data_tag)) || 868 cell_count == bytecode_cell_count(c), "cell counts must agree"); 869 if (cell_count >= 0) { 870 assert(tag != DataLayout::no_tag, "bad tag"); 871 assert(bytecode_has_profile(c), "agree w/ BHP"); 872 data_layout->initialize(tag, stream->bci(), cell_count); 873 return DataLayout::compute_size_in_bytes(cell_count); 874 } else { 875 assert(!bytecode_has_profile(c), "agree w/ !BHP"); 876 return 0; 877 } 878 #endif 879 } 880 881 // Get the data at an arbitrary (sort of) data index. 882 ProfileData* MethodData::data_at(int data_index) const { 883 if (out_of_bounds(data_index)) { 884 return NULL; 885 } 886 DataLayout* data_layout = data_layout_at(data_index); 887 return data_layout->data_in(); 888 } 889 890 ProfileData* DataLayout::data_in() { 891 switch (tag()) { 892 case DataLayout::no_tag: 893 default: 894 ShouldNotReachHere(); 895 return NULL; 896 case DataLayout::bit_data_tag: 897 return new BitData(this); 898 case DataLayout::counter_data_tag: 899 return new CounterData(this); 900 case DataLayout::jump_data_tag: 901 return new JumpData(this); 902 case DataLayout::receiver_type_data_tag: 903 return new ReceiverTypeData(this); 904 case DataLayout::virtual_call_data_tag: 905 return new VirtualCallData(this); 906 case DataLayout::ret_data_tag: 907 return new RetData(this); 908 case DataLayout::branch_data_tag: 909 return new BranchData(this); 910 case DataLayout::multi_branch_data_tag: 911 return new MultiBranchData(this); 912 case DataLayout::arg_info_data_tag: 913 return new ArgInfoData(this); 914 case DataLayout::call_type_data_tag: 915 return new CallTypeData(this); 916 case DataLayout::virtual_call_type_data_tag: 917 return new VirtualCallTypeData(this); 918 }; 919 } 920 921 // Iteration over data. 922 ProfileData* MethodData::next_data(ProfileData* current) const { 923 int current_index = dp_to_di(current->dp()); 924 int next_index = current_index + current->size_in_bytes(); 925 ProfileData* next = data_at(next_index); 926 return next; 927 } 928 929 // Give each of the data entries a chance to perform specific 930 // data initialization. 931 void MethodData::post_initialize(BytecodeStream* stream) { 932 ResourceMark rm; 933 ProfileData* data; 934 for (data = first_data(); is_valid(data); data = next_data(data)) { 935 stream->set_start(data->bci()); 936 stream->next(); 937 data->post_initialize(stream, this); 938 } 939 } 940 941 // Initialize the MethodData* corresponding to a given method. 942 MethodData::MethodData(methodHandle method, int size, TRAPS) { 943 No_Safepoint_Verifier no_safepoint; // init function atomic wrt GC 944 ResourceMark rm; 945 // Set the method back-pointer. 946 _method = method(); 947 948 init(); 949 set_creation_mileage(mileage_of(method())); 950 951 // Go through the bytecodes and allocate and initialize the 952 // corresponding data cells. 953 int data_size = 0; 954 int empty_bc_count = 0; // number of bytecodes lacking data 955 _data[0] = 0; // apparently not set below. 956 BytecodeStream stream(method); 957 Bytecodes::Code c; 958 while ((c = stream.next()) >= 0) { 959 int size_in_bytes = initialize_data(&stream, data_size); 960 data_size += size_in_bytes; 961 if (size_in_bytes == 0) empty_bc_count += 1; 962 } 963 _data_size = data_size; 964 int object_size = in_bytes(data_offset()) + data_size; 965 966 // Add some extra DataLayout cells (at least one) to track stray traps. 967 int extra_data_count = compute_extra_data_count(data_size, empty_bc_count); 968 int extra_size = extra_data_count * DataLayout::compute_size_in_bytes(0); 969 970 // Add a cell to record information about modified arguments. 971 // Set up _args_modified array after traps cells so that 972 // the code for traps cells works. 973 DataLayout *dp = data_layout_at(data_size + extra_size); 974 975 int arg_size = method->size_of_parameters(); 976 dp->initialize(DataLayout::arg_info_data_tag, 0, arg_size+1); 977 978 object_size += extra_size + DataLayout::compute_size_in_bytes(arg_size+1); 979 980 // Set an initial hint. Don't use set_hint_di() because 981 // first_di() may be out of bounds if data_size is 0. 982 // In that situation, _hint_di is never used, but at 983 // least well-defined. 984 _hint_di = first_di(); 985 986 post_initialize(&stream); 987 988 set_size(object_size); 989 } 990 991 void MethodData::init() { 992 _invocation_counter.init(); 993 _backedge_counter.init(); 994 _invocation_counter_start = 0; 995 _backedge_counter_start = 0; 996 _num_loops = 0; 997 _num_blocks = 0; 998 _highest_comp_level = 0; 999 _highest_osr_comp_level = 0; 1000 _would_profile = true; 1001 1002 // Initialize flags and trap history. 1003 _nof_decompiles = 0; 1004 _nof_overflow_recompiles = 0; 1005 _nof_overflow_traps = 0; 1006 clear_escape_info(); 1007 assert(sizeof(_trap_hist) % sizeof(HeapWord) == 0, "align"); 1008 Copy::zero_to_words((HeapWord*) &_trap_hist, 1009 sizeof(_trap_hist) / sizeof(HeapWord)); 1010 } 1011 1012 // Get a measure of how much mileage the method has on it. 1013 int MethodData::mileage_of(Method* method) { 1014 int mileage = 0; 1015 if (TieredCompilation) { 1016 mileage = MAX2(method->invocation_count(), method->backedge_count()); 1017 } else { 1018 int iic = method->interpreter_invocation_count(); 1019 if (mileage < iic) mileage = iic; 1020 MethodCounters* mcs = method->method_counters(); 1021 if (mcs != NULL) { 1022 InvocationCounter* ic = mcs->invocation_counter(); 1023 InvocationCounter* bc = mcs->backedge_counter(); 1024 int icval = ic->count(); 1025 if (ic->carry()) icval += CompileThreshold; 1026 if (mileage < icval) mileage = icval; 1027 int bcval = bc->count(); 1028 if (bc->carry()) bcval += CompileThreshold; 1029 if (mileage < bcval) mileage = bcval; 1030 } 1031 } 1032 return mileage; 1033 } 1034 1035 bool MethodData::is_mature() const { 1036 return CompilationPolicy::policy()->is_mature(_method); 1037 } 1038 1039 // Translate a bci to its corresponding data index (di). 1040 address MethodData::bci_to_dp(int bci) { 1041 ResourceMark rm; 1042 ProfileData* data = data_before(bci); 1043 ProfileData* prev = NULL; 1044 for ( ; is_valid(data); data = next_data(data)) { 1045 if (data->bci() >= bci) { 1046 if (data->bci() == bci) set_hint_di(dp_to_di(data->dp())); 1047 else if (prev != NULL) set_hint_di(dp_to_di(prev->dp())); 1048 return data->dp(); 1049 } 1050 prev = data; 1051 } 1052 return (address)limit_data_position(); 1053 } 1054 1055 // Translate a bci to its corresponding data, or NULL. 1056 ProfileData* MethodData::bci_to_data(int bci) { 1057 ProfileData* data = data_before(bci); 1058 for ( ; is_valid(data); data = next_data(data)) { 1059 if (data->bci() == bci) { 1060 set_hint_di(dp_to_di(data->dp())); 1061 return data; 1062 } else if (data->bci() > bci) { 1063 break; 1064 } 1065 } 1066 return bci_to_extra_data(bci, false); 1067 } 1068 1069 // Translate a bci to its corresponding extra data, or NULL. 1070 ProfileData* MethodData::bci_to_extra_data(int bci, bool create_if_missing) { 1071 DataLayout* dp = extra_data_base(); 1072 DataLayout* end = extra_data_limit(); 1073 DataLayout* avail = NULL; 1074 for (; dp < end; dp = next_extra(dp)) { 1075 // No need for "OrderAccess::load_acquire" ops, 1076 // since the data structure is monotonic. 1077 if (dp->tag() == DataLayout::no_tag) break; 1078 if (dp->tag() == DataLayout::arg_info_data_tag) { 1079 dp = end; // ArgInfoData is at the end of extra data section. 1080 break; 1081 } 1082 if (dp->bci() == bci) { 1083 assert(dp->tag() == DataLayout::bit_data_tag, "sane"); 1084 return new BitData(dp); 1085 } 1086 } 1087 if (create_if_missing && dp < end) { 1088 // Allocate this one. There is no mutual exclusion, 1089 // so two threads could allocate different BCIs to the 1090 // same data layout. This means these extra data 1091 // records, like most other MDO contents, must not be 1092 // trusted too much. 1093 DataLayout temp; 1094 temp.initialize(DataLayout::bit_data_tag, bci, 0); 1095 dp->release_set_header(temp.header()); 1096 assert(dp->tag() == DataLayout::bit_data_tag, "sane"); 1097 //NO: assert(dp->bci() == bci, "no concurrent allocation"); 1098 return new BitData(dp); 1099 } 1100 return NULL; 1101 } 1102 1103 ArgInfoData *MethodData::arg_info() { 1104 DataLayout* dp = extra_data_base(); 1105 DataLayout* end = extra_data_limit(); 1106 for (; dp < end; dp = next_extra(dp)) { 1107 if (dp->tag() == DataLayout::arg_info_data_tag) 1108 return new ArgInfoData(dp); 1109 } 1110 return NULL; 1111 } 1112 1113 // Printing 1114 1115 #ifndef PRODUCT 1116 1117 void MethodData::print_on(outputStream* st) const { 1118 assert(is_methodData(), "should be method data"); 1119 st->print("method data for "); 1120 method()->print_value_on(st); 1121 st->cr(); 1122 print_data_on(st); 1123 } 1124 1125 #endif //PRODUCT 1126 1127 void MethodData::print_value_on(outputStream* st) const { 1128 assert(is_methodData(), "should be method data"); 1129 st->print("method data for "); 1130 method()->print_value_on(st); 1131 } 1132 1133 #ifndef PRODUCT 1134 void MethodData::print_data_on(outputStream* st) const { 1135 ResourceMark rm; 1136 ProfileData* data = first_data(); 1137 for ( ; is_valid(data); data = next_data(data)) { 1138 st->print("%d", dp_to_di(data->dp())); 1139 st->fill_to(6); 1140 data->print_data_on(st); 1141 } 1142 st->print_cr("--- Extra data:"); 1143 DataLayout* dp = extra_data_base(); 1144 DataLayout* end = extra_data_limit(); 1145 for (; dp < end; dp = next_extra(dp)) { 1146 // No need for "OrderAccess::load_acquire" ops, 1147 // since the data structure is monotonic. 1148 if (dp->tag() == DataLayout::no_tag) continue; 1149 if (dp->tag() == DataLayout::bit_data_tag) { 1150 data = new BitData(dp); 1151 } else { 1152 assert(dp->tag() == DataLayout::arg_info_data_tag, "must be BitData or ArgInfo"); 1153 data = new ArgInfoData(dp); 1154 dp = end; // ArgInfoData is at the end of extra data section. 1155 } 1156 st->print("%d", dp_to_di(data->dp())); 1157 st->fill_to(6); 1158 data->print_data_on(st); 1159 } 1160 } 1161 #endif 1162 1163 #if INCLUDE_SERVICES 1164 // Size Statistics 1165 void MethodData::collect_statistics(KlassSizeStats *sz) const { 1166 int n = sz->count(this); 1167 sz->_method_data_bytes += n; 1168 sz->_method_all_bytes += n; 1169 sz->_rw_bytes += n; 1170 } 1171 #endif // INCLUDE_SERVICES 1172 1173 // Verification 1174 1175 void MethodData::verify_on(outputStream* st) { 1176 guarantee(is_methodData(), "object must be method data"); 1177 // guarantee(m->is_perm(), "should be in permspace"); 1178 this->verify_data_on(st); 1179 } 1180 1181 void MethodData::verify_data_on(outputStream* st) { 1182 NEEDS_CLEANUP; 1183 // not yet implemented. 1184 } 1185 1186 bool MethodData::profile_jsr292(methodHandle m, int bci) { 1187 if (m->is_compiled_lambda_form()) { 1188 return true; 1189 } 1190 1191 Bytecode_invoke inv(m , bci); 1192 return inv.is_invokedynamic() || inv.is_invokehandle(); 1193 } 1194 1195 int MethodData::profile_arguments_flag() { 1196 return TypeProfileLevel % 10; 1197 } 1198 1199 bool MethodData::profile_arguments() { 1200 return profile_arguments_flag() > no_type_profile && profile_arguments_flag() <= type_profile_all; 1201 } 1202 1203 bool MethodData::profile_arguments_jsr292_only() { 1204 return profile_arguments_flag() == type_profile_jsr292; 1205 } 1206 1207 bool MethodData::profile_all_arguments() { 1208 return profile_arguments_flag() == type_profile_all; 1209 } 1210 1211 bool MethodData::profile_arguments_for_invoke(methodHandle m, int bci) { 1212 if (!profile_arguments()) { 1213 return false; 1214 } 1215 1216 if (profile_all_arguments()) { 1217 return true; 1218 } 1219 1220 assert(profile_arguments_jsr292_only(), "inconsistent"); 1221 return profile_jsr292(m, bci); 1222 } 1223 1224 int MethodData::profile_return_flag() { 1225 return TypeProfileLevel / 10; 1226 } 1227 1228 bool MethodData::profile_return() { 1229 return profile_return_flag() > no_type_profile && profile_return_flag() <= type_profile_all; 1230 } 1231 1232 bool MethodData::profile_return_jsr292_only() { 1233 return profile_return_flag() == type_profile_jsr292; 1234 } 1235 1236 bool MethodData::profile_all_return() { 1237 return profile_return_flag() == type_profile_all; 1238 } 1239 1240 bool MethodData::profile_return_for_invoke(methodHandle m, int bci) { 1241 if (!profile_return()) { 1242 return false; 1243 } 1244 1245 if (profile_all_return()) { 1246 return true; 1247 } 1248 1249 assert(profile_return_jsr292_only(), "inconsistent"); 1250 return profile_jsr292(m, bci); 1251 }