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 } 60 61 void DataLayout::clean_weak_klass_links(BoolObjectClosure* cl) { 62 ResourceMark m; 63 data_in()->clean_weak_klass_links(cl); 64 } 65 66 67 // ================================================================== 68 // ProfileData 69 // 70 // A ProfileData object is created to refer to a section of profiling 71 // data in a structured way. 72 73 // Constructor for invalid ProfileData. 74 ProfileData::ProfileData() { 75 _data = NULL; 76 } 77 78 #ifndef PRODUCT 79 void ProfileData::print_shared(outputStream* st, const char* name) { 80 st->print("bci: %d", bci()); 81 st->fill_to(tab_width_one); 82 st->print("%s", name); 83 tab(st); 84 int trap = trap_state(); 85 if (trap != 0) { 86 char buf[100]; 87 st->print("trap(%s) ", Deoptimization::format_trap_state(buf, sizeof(buf), trap)); 88 } 89 int flags = data()->flags(); 90 if (flags != 0) 91 st->print("flags(%d) ", flags); 92 } 93 94 void ProfileData::tab(outputStream* st) { 95 st->fill_to(tab_width_two); 96 } 97 #endif // !PRODUCT 98 99 // ================================================================== 100 // BitData 101 // 102 // A BitData corresponds to a one-bit flag. This is used to indicate 103 // whether a checkcast bytecode has seen a null value. 104 105 106 #ifndef PRODUCT 107 void BitData::print_data_on(outputStream* st) { 108 print_shared(st, "BitData"); 109 } 110 #endif // !PRODUCT 111 112 // ================================================================== 113 // CounterData 114 // 115 // A CounterData corresponds to a simple counter. 116 117 #ifndef PRODUCT 118 void CounterData::print_data_on(outputStream* st) { 119 print_shared(st, "CounterData"); 120 st->print_cr("count(%u)", count()); 121 } 122 #endif // !PRODUCT 123 124 // ================================================================== 125 // JumpData 126 // 127 // A JumpData is used to access profiling information for a direct 128 // branch. It is a counter, used for counting the number of branches, 129 // plus a data displacement, used for realigning the data pointer to 130 // the corresponding target bci. 131 132 void JumpData::post_initialize(BytecodeStream* stream, MethodData* mdo) { 133 assert(stream->bci() == bci(), "wrong pos"); 134 int target; 135 Bytecodes::Code c = stream->code(); 136 if (c == Bytecodes::_goto_w || c == Bytecodes::_jsr_w) { 137 target = stream->dest_w(); 138 } else { 139 target = stream->dest(); 140 } 141 int my_di = mdo->dp_to_di(dp()); 142 int target_di = mdo->bci_to_di(target); 143 int offset = target_di - my_di; 144 set_displacement(offset); 145 } 146 147 #ifndef PRODUCT 148 void JumpData::print_data_on(outputStream* st) { 149 print_shared(st, "JumpData"); 150 st->print_cr("taken(%u) displacement(%d)", taken(), displacement()); 151 } 152 #endif // !PRODUCT 153 154 // ================================================================== 155 // ReceiverTypeData 156 // 157 // A ReceiverTypeData is used to access profiling information about a 158 // dynamic type check. It consists of a counter which counts the total times 159 // that the check is reached, and a series of (Klass*, count) pairs 160 // which are used to store a type profile for the receiver of the check. 161 162 void ReceiverTypeData::clean_weak_klass_links(BoolObjectClosure* is_alive_cl) { 163 for (uint row = 0; row < row_limit(); row++) { 164 Klass* p = receiver(row); 165 if (p != NULL && !p->is_loader_alive(is_alive_cl)) { 166 clear_row(row); 167 } 168 } 169 } 170 171 #ifndef PRODUCT 172 void ReceiverTypeData::print_receiver_data_on(outputStream* st) { 173 uint row; 174 int entries = 0; 175 for (row = 0; row < row_limit(); row++) { 176 if (receiver(row) != NULL) entries++; 177 } 178 st->print_cr("count(%u) entries(%u)", count(), entries); 179 int total = count(); 180 for (row = 0; row < row_limit(); row++) { 181 if (receiver(row) != NULL) { 182 total += receiver_count(row); 183 } 184 } 185 for (row = 0; row < row_limit(); row++) { 186 if (receiver(row) != NULL) { 187 tab(st); 188 receiver(row)->print_value_on(st); 189 st->print_cr("(%u %4.2f)", receiver_count(row), (float) receiver_count(row) / (float) total); 190 } 191 } 192 } 193 void ReceiverTypeData::print_data_on(outputStream* st) { 194 print_shared(st, "ReceiverTypeData"); 195 print_receiver_data_on(st); 196 } 197 void VirtualCallData::print_data_on(outputStream* st) { 198 print_shared(st, "VirtualCallData"); 199 print_receiver_data_on(st); 200 } 201 #endif // !PRODUCT 202 203 // ================================================================== 204 // RetData 205 // 206 // A RetData is used to access profiling information for a ret bytecode. 207 // It is composed of a count of the number of times that the ret has 208 // been executed, followed by a series of triples of the form 209 // (bci, count, di) which count the number of times that some bci was the 210 // target of the ret and cache a corresponding displacement. 211 212 void RetData::post_initialize(BytecodeStream* stream, MethodData* mdo) { 213 for (uint row = 0; row < row_limit(); row++) { 214 set_bci_displacement(row, -1); 215 set_bci(row, no_bci); 216 } 217 // release so other threads see a consistent state. bci is used as 218 // a valid flag for bci_displacement. 219 OrderAccess::release(); 220 } 221 222 // This routine needs to atomically update the RetData structure, so the 223 // caller needs to hold the RetData_lock before it gets here. Since taking 224 // the lock can block (and allow GC) and since RetData is a ProfileData is a 225 // wrapper around a derived oop, taking the lock in _this_ method will 226 // basically cause the 'this' pointer's _data field to contain junk after the 227 // lock. We require the caller to take the lock before making the ProfileData 228 // structure. Currently the only caller is InterpreterRuntime::update_mdp_for_ret 229 address RetData::fixup_ret(int return_bci, MethodData* h_mdo) { 230 // First find the mdp which corresponds to the return bci. 231 address mdp = h_mdo->bci_to_dp(return_bci); 232 233 // Now check to see if any of the cache slots are open. 234 for (uint row = 0; row < row_limit(); row++) { 235 if (bci(row) == no_bci) { 236 set_bci_displacement(row, mdp - dp()); 237 set_bci_count(row, DataLayout::counter_increment); 238 // Barrier to ensure displacement is written before the bci; allows 239 // the interpreter to read displacement without fear of race condition. 240 release_set_bci(row, return_bci); 241 break; 242 } 243 } 244 return mdp; 245 } 246 247 248 #ifndef PRODUCT 249 void RetData::print_data_on(outputStream* st) { 250 print_shared(st, "RetData"); 251 uint row; 252 int entries = 0; 253 for (row = 0; row < row_limit(); row++) { 254 if (bci(row) != no_bci) entries++; 255 } 256 st->print_cr("count(%u) entries(%u)", count(), entries); 257 for (row = 0; row < row_limit(); row++) { 258 if (bci(row) != no_bci) { 259 tab(st); 260 st->print_cr("bci(%d: count(%u) displacement(%d))", 261 bci(row), bci_count(row), bci_displacement(row)); 262 } 263 } 264 } 265 #endif // !PRODUCT 266 267 // ================================================================== 268 // BranchData 269 // 270 // A BranchData is used to access profiling data for a two-way branch. 271 // It consists of taken and not_taken counts as well as a data displacement 272 // for the taken case. 273 274 void BranchData::post_initialize(BytecodeStream* stream, MethodData* mdo) { 275 assert(stream->bci() == bci(), "wrong pos"); 276 int target = stream->dest(); 277 int my_di = mdo->dp_to_di(dp()); 278 int target_di = mdo->bci_to_di(target); 279 int offset = target_di - my_di; 280 set_displacement(offset); 281 } 282 283 #ifndef PRODUCT 284 void BranchData::print_data_on(outputStream* st) { 285 print_shared(st, "BranchData"); 286 st->print_cr("taken(%u) displacement(%d)", 287 taken(), displacement()); 288 tab(st); 289 st->print_cr("not taken(%u)", not_taken()); 290 } 291 #endif 292 293 // ================================================================== 294 // MultiBranchData 295 // 296 // A MultiBranchData is used to access profiling information for 297 // a multi-way branch (*switch bytecodes). It consists of a series 298 // of (count, displacement) pairs, which count the number of times each 299 // case was taken and specify the data displacment for each branch target. 300 301 int MultiBranchData::compute_cell_count(BytecodeStream* stream) { 302 int cell_count = 0; 303 if (stream->code() == Bytecodes::_tableswitch) { 304 Bytecode_tableswitch sw(stream->method()(), stream->bcp()); 305 cell_count = 1 + per_case_cell_count * (1 + sw.length()); // 1 for default 306 } else { 307 Bytecode_lookupswitch sw(stream->method()(), stream->bcp()); 308 cell_count = 1 + per_case_cell_count * (sw.number_of_pairs() + 1); // 1 for default 309 } 310 return cell_count; 311 } 312 313 void MultiBranchData::post_initialize(BytecodeStream* stream, 314 MethodData* mdo) { 315 assert(stream->bci() == bci(), "wrong pos"); 316 int target; 317 int my_di; 318 int target_di; 319 int offset; 320 if (stream->code() == Bytecodes::_tableswitch) { 321 Bytecode_tableswitch sw(stream->method()(), stream->bcp()); 322 int len = sw.length(); 323 assert(array_len() == per_case_cell_count * (len + 1), "wrong len"); 324 for (int count = 0; count < len; count++) { 325 target = sw.dest_offset_at(count) + bci(); 326 my_di = mdo->dp_to_di(dp()); 327 target_di = mdo->bci_to_di(target); 328 offset = target_di - my_di; 329 set_displacement_at(count, offset); 330 } 331 target = sw.default_offset() + bci(); 332 my_di = mdo->dp_to_di(dp()); 333 target_di = mdo->bci_to_di(target); 334 offset = target_di - my_di; 335 set_default_displacement(offset); 336 337 } else { 338 Bytecode_lookupswitch sw(stream->method()(), stream->bcp()); 339 int npairs = sw.number_of_pairs(); 340 assert(array_len() == per_case_cell_count * (npairs + 1), "wrong len"); 341 for (int count = 0; count < npairs; count++) { 342 LookupswitchPair pair = sw.pair_at(count); 343 target = pair.offset() + bci(); 344 my_di = mdo->dp_to_di(dp()); 345 target_di = mdo->bci_to_di(target); 346 offset = target_di - my_di; 347 set_displacement_at(count, offset); 348 } 349 target = sw.default_offset() + bci(); 350 my_di = mdo->dp_to_di(dp()); 351 target_di = mdo->bci_to_di(target); 352 offset = target_di - my_di; 353 set_default_displacement(offset); 354 } 355 } 356 357 #ifndef PRODUCT 358 void MultiBranchData::print_data_on(outputStream* st) { 359 print_shared(st, "MultiBranchData"); 360 st->print_cr("default_count(%u) displacement(%d)", 361 default_count(), default_displacement()); 362 int cases = number_of_cases(); 363 for (int i = 0; i < cases; i++) { 364 tab(st); 365 st->print_cr("count(%u) displacement(%d)", 366 count_at(i), displacement_at(i)); 367 } 368 } 369 #endif 370 371 #ifndef PRODUCT 372 void ArgInfoData::print_data_on(outputStream* st) { 373 print_shared(st, "ArgInfoData"); 374 int nargs = number_of_args(); 375 for (int i = 0; i < nargs; i++) { 376 st->print(" 0x%x", arg_modified(i)); 377 } 378 st->cr(); 379 } 380 381 #endif 382 // ================================================================== 383 // MethodData* 384 // 385 // A MethodData* holds information which has been collected about 386 // a method. 387 388 MethodData* MethodData::allocate(ClassLoaderData* loader_data, methodHandle method, TRAPS) { 389 int size = MethodData::compute_allocation_size_in_words(method); 390 391 return new (loader_data, size, false, MetaspaceObj::MethodDataType, THREAD) 392 MethodData(method(), size, CHECK_NULL); 393 } 394 395 int MethodData::bytecode_cell_count(Bytecodes::Code code) { 396 #if defined(COMPILER1) && !defined(COMPILER2) 397 return no_profile_data; 398 #else 399 switch (code) { 400 case Bytecodes::_checkcast: 401 case Bytecodes::_instanceof: 402 case Bytecodes::_aastore: 403 if (TypeProfileCasts) { 404 return ReceiverTypeData::static_cell_count(); 405 } else { 406 return BitData::static_cell_count(); 407 } 408 case Bytecodes::_invokespecial: 409 case Bytecodes::_invokestatic: 410 return CounterData::static_cell_count(); 411 case Bytecodes::_goto: 412 case Bytecodes::_goto_w: 413 case Bytecodes::_jsr: 414 case Bytecodes::_jsr_w: 415 return JumpData::static_cell_count(); 416 case Bytecodes::_invokevirtual: 417 case Bytecodes::_invokeinterface: 418 return VirtualCallData::static_cell_count(); 419 case Bytecodes::_invokedynamic: 420 return CounterData::static_cell_count(); 421 case Bytecodes::_ret: 422 return RetData::static_cell_count(); 423 case Bytecodes::_ifeq: 424 case Bytecodes::_ifne: 425 case Bytecodes::_iflt: 426 case Bytecodes::_ifge: 427 case Bytecodes::_ifgt: 428 case Bytecodes::_ifle: 429 case Bytecodes::_if_icmpeq: 430 case Bytecodes::_if_icmpne: 431 case Bytecodes::_if_icmplt: 432 case Bytecodes::_if_icmpge: 433 case Bytecodes::_if_icmpgt: 434 case Bytecodes::_if_icmple: 435 case Bytecodes::_if_acmpeq: 436 case Bytecodes::_if_acmpne: 437 case Bytecodes::_ifnull: 438 case Bytecodes::_ifnonnull: 439 return BranchData::static_cell_count(); 440 case Bytecodes::_lookupswitch: 441 case Bytecodes::_tableswitch: 442 return variable_cell_count; 443 } 444 return no_profile_data; 445 #endif 446 } 447 448 // Compute the size of the profiling information corresponding to 449 // the current bytecode. 450 int MethodData::compute_data_size(BytecodeStream* stream) { 451 int cell_count = bytecode_cell_count(stream->code()); 452 if (cell_count == no_profile_data) { 453 return 0; 454 } 455 if (cell_count == variable_cell_count) { 456 cell_count = MultiBranchData::compute_cell_count(stream); 457 } 458 // Note: cell_count might be zero, meaning that there is just 459 // a DataLayout header, with no extra cells. 460 assert(cell_count >= 0, "sanity"); 461 return DataLayout::compute_size_in_bytes(cell_count); 462 } 463 464 int MethodData::compute_extra_data_count(int data_size, int empty_bc_count) { 465 if (ProfileTraps) { 466 // Assume that up to 3% of BCIs with no MDP will need to allocate one. 467 int extra_data_count = (uint)(empty_bc_count * 3) / 128 + 1; 468 // If the method is large, let the extra BCIs grow numerous (to ~1%). 469 int one_percent_of_data 470 = (uint)data_size / (DataLayout::header_size_in_bytes()*128); 471 if (extra_data_count < one_percent_of_data) 472 extra_data_count = one_percent_of_data; 473 if (extra_data_count > empty_bc_count) 474 extra_data_count = empty_bc_count; // no need for more 475 return extra_data_count; 476 } else { 477 return 0; 478 } 479 } 480 481 // Compute the size of the MethodData* necessary to store 482 // profiling information about a given method. Size is in bytes. 483 int MethodData::compute_allocation_size_in_bytes(methodHandle method) { 484 int data_size = 0; 485 BytecodeStream stream(method); 486 Bytecodes::Code c; 487 int empty_bc_count = 0; // number of bytecodes lacking data 488 while ((c = stream.next()) >= 0) { 489 int size_in_bytes = compute_data_size(&stream); 490 data_size += size_in_bytes; 491 if (size_in_bytes == 0) empty_bc_count += 1; 492 } 493 int object_size = in_bytes(data_offset()) + data_size; 494 495 // Add some extra DataLayout cells (at least one) to track stray traps. 496 int extra_data_count = compute_extra_data_count(data_size, empty_bc_count); 497 object_size += extra_data_count * DataLayout::compute_size_in_bytes(0); 498 499 // Add a cell to record information about modified arguments. 500 int arg_size = method->size_of_parameters(); 501 object_size += DataLayout::compute_size_in_bytes(arg_size+1); 502 return object_size; 503 } 504 505 // Compute the size of the MethodData* necessary to store 506 // profiling information about a given method. Size is in words 507 int MethodData::compute_allocation_size_in_words(methodHandle method) { 508 int byte_size = compute_allocation_size_in_bytes(method); 509 int word_size = align_size_up(byte_size, BytesPerWord) / BytesPerWord; 510 return align_object_size(word_size); 511 } 512 513 // Initialize an individual data segment. Returns the size of 514 // the segment in bytes. 515 int MethodData::initialize_data(BytecodeStream* stream, 516 int data_index) { 517 #if defined(COMPILER1) && !defined(COMPILER2) 518 return 0; 519 #else 520 int cell_count = -1; 521 int tag = DataLayout::no_tag; 522 DataLayout* data_layout = data_layout_at(data_index); 523 Bytecodes::Code c = stream->code(); 524 switch (c) { 525 case Bytecodes::_checkcast: 526 case Bytecodes::_instanceof: 527 case Bytecodes::_aastore: 528 if (TypeProfileCasts) { 529 cell_count = ReceiverTypeData::static_cell_count(); 530 tag = DataLayout::receiver_type_data_tag; 531 } else { 532 cell_count = BitData::static_cell_count(); 533 tag = DataLayout::bit_data_tag; 534 } 535 break; 536 case Bytecodes::_invokespecial: 537 case Bytecodes::_invokestatic: 538 cell_count = CounterData::static_cell_count(); 539 tag = DataLayout::counter_data_tag; 540 break; 541 case Bytecodes::_goto: 542 case Bytecodes::_goto_w: 543 case Bytecodes::_jsr: 544 case Bytecodes::_jsr_w: 545 cell_count = JumpData::static_cell_count(); 546 tag = DataLayout::jump_data_tag; 547 break; 548 case Bytecodes::_invokevirtual: 549 case Bytecodes::_invokeinterface: 550 cell_count = VirtualCallData::static_cell_count(); 551 tag = DataLayout::virtual_call_data_tag; 552 break; 553 case Bytecodes::_invokedynamic: 554 // %%% should make a type profile for any invokedynamic that takes a ref argument 555 cell_count = CounterData::static_cell_count(); 556 tag = DataLayout::counter_data_tag; 557 break; 558 case Bytecodes::_ret: 559 cell_count = RetData::static_cell_count(); 560 tag = DataLayout::ret_data_tag; 561 break; 562 case Bytecodes::_ifeq: 563 case Bytecodes::_ifne: 564 case Bytecodes::_iflt: 565 case Bytecodes::_ifge: 566 case Bytecodes::_ifgt: 567 case Bytecodes::_ifle: 568 case Bytecodes::_if_icmpeq: 569 case Bytecodes::_if_icmpne: 570 case Bytecodes::_if_icmplt: 571 case Bytecodes::_if_icmpge: 572 case Bytecodes::_if_icmpgt: 573 case Bytecodes::_if_icmple: 574 case Bytecodes::_if_acmpeq: 575 case Bytecodes::_if_acmpne: 576 case Bytecodes::_ifnull: 577 case Bytecodes::_ifnonnull: 578 cell_count = BranchData::static_cell_count(); 579 tag = DataLayout::branch_data_tag; 580 break; 581 case Bytecodes::_lookupswitch: 582 case Bytecodes::_tableswitch: 583 cell_count = MultiBranchData::compute_cell_count(stream); 584 tag = DataLayout::multi_branch_data_tag; 585 break; 586 } 587 assert(tag == DataLayout::multi_branch_data_tag || 588 cell_count == bytecode_cell_count(c), "cell counts must agree"); 589 if (cell_count >= 0) { 590 assert(tag != DataLayout::no_tag, "bad tag"); 591 assert(bytecode_has_profile(c), "agree w/ BHP"); 592 data_layout->initialize(tag, stream->bci(), cell_count); 593 return DataLayout::compute_size_in_bytes(cell_count); 594 } else { 595 assert(!bytecode_has_profile(c), "agree w/ !BHP"); 596 return 0; 597 } 598 #endif 599 } 600 601 // Get the data at an arbitrary (sort of) data index. 602 ProfileData* MethodData::data_at(int data_index) const { 603 if (out_of_bounds(data_index)) { 604 return NULL; 605 } 606 DataLayout* data_layout = data_layout_at(data_index); 607 return data_layout->data_in(); 608 } 609 610 ProfileData* DataLayout::data_in() { 611 switch (tag()) { 612 case DataLayout::no_tag: 613 default: 614 ShouldNotReachHere(); 615 return NULL; 616 case DataLayout::bit_data_tag: 617 return new BitData(this); 618 case DataLayout::counter_data_tag: 619 return new CounterData(this); 620 case DataLayout::jump_data_tag: 621 return new JumpData(this); 622 case DataLayout::receiver_type_data_tag: 623 return new ReceiverTypeData(this); 624 case DataLayout::virtual_call_data_tag: 625 return new VirtualCallData(this); 626 case DataLayout::ret_data_tag: 627 return new RetData(this); 628 case DataLayout::branch_data_tag: 629 return new BranchData(this); 630 case DataLayout::multi_branch_data_tag: 631 return new MultiBranchData(this); 632 case DataLayout::arg_info_data_tag: 633 return new ArgInfoData(this); 634 }; 635 } 636 637 // Iteration over data. 638 ProfileData* MethodData::next_data(ProfileData* current) const { 639 int current_index = dp_to_di(current->dp()); 640 int next_index = current_index + current->size_in_bytes(); 641 ProfileData* next = data_at(next_index); 642 return next; 643 } 644 645 // Give each of the data entries a chance to perform specific 646 // data initialization. 647 void MethodData::post_initialize(BytecodeStream* stream) { 648 ResourceMark rm; 649 ProfileData* data; 650 for (data = first_data(); is_valid(data); data = next_data(data)) { 651 stream->set_start(data->bci()); 652 stream->next(); 653 data->post_initialize(stream, this); 654 } 655 } 656 657 // Initialize the MethodData* corresponding to a given method. 658 MethodData::MethodData(methodHandle method, int size, TRAPS) { 659 No_Safepoint_Verifier no_safepoint; // init function atomic wrt GC 660 ResourceMark rm; 661 // Set the method back-pointer. 662 _method = method(); 663 664 init(); 665 set_creation_mileage(mileage_of(method())); 666 667 // Go through the bytecodes and allocate and initialize the 668 // corresponding data cells. 669 int data_size = 0; 670 int empty_bc_count = 0; // number of bytecodes lacking data 671 _data[0] = 0; // apparently not set below. 672 BytecodeStream stream(method); 673 Bytecodes::Code c; 674 while ((c = stream.next()) >= 0) { 675 int size_in_bytes = initialize_data(&stream, data_size); 676 data_size += size_in_bytes; 677 if (size_in_bytes == 0) empty_bc_count += 1; 678 } 679 _data_size = data_size; 680 int object_size = in_bytes(data_offset()) + data_size; 681 682 // Add some extra DataLayout cells (at least one) to track stray traps. 683 int extra_data_count = compute_extra_data_count(data_size, empty_bc_count); 684 int extra_size = extra_data_count * DataLayout::compute_size_in_bytes(0); 685 686 // Add a cell to record information about modified arguments. 687 // Set up _args_modified array after traps cells so that 688 // the code for traps cells works. 689 DataLayout *dp = data_layout_at(data_size + extra_size); 690 691 int arg_size = method->size_of_parameters(); 692 dp->initialize(DataLayout::arg_info_data_tag, 0, arg_size+1); 693 694 object_size += extra_size + DataLayout::compute_size_in_bytes(arg_size+1); 695 696 // Set an initial hint. Don't use set_hint_di() because 697 // first_di() may be out of bounds if data_size is 0. 698 // In that situation, _hint_di is never used, but at 699 // least well-defined. 700 _hint_di = first_di(); 701 702 post_initialize(&stream); 703 704 set_size(object_size); 705 } 706 707 void MethodData::init() { 708 _invocation_counter.init(); 709 _backedge_counter.init(); 710 _invocation_counter_start = 0; 711 _backedge_counter_start = 0; 712 _num_loops = 0; 713 _num_blocks = 0; 714 _highest_comp_level = 0; 715 _highest_osr_comp_level = 0; 716 _would_profile = true; 717 718 // Initialize flags and trap history. 719 _nof_decompiles = 0; 720 _nof_overflow_recompiles = 0; 721 _nof_overflow_traps = 0; 722 clear_escape_info(); 723 assert(sizeof(_trap_hist) % sizeof(HeapWord) == 0, "align"); 724 Copy::zero_to_words((HeapWord*) &_trap_hist, 725 sizeof(_trap_hist) / sizeof(HeapWord)); 726 } 727 728 // Get a measure of how much mileage the method has on it. 729 int MethodData::mileage_of(Method* method) { 730 int mileage = 0; 731 if (TieredCompilation) { 732 mileage = MAX2(method->invocation_count(), method->backedge_count()); 733 } else { 734 int iic = method->interpreter_invocation_count(); 735 if (mileage < iic) mileage = iic; 736 MethodCounters* mcs = method->method_counters(); 737 if (mcs != NULL) { 738 InvocationCounter* ic = mcs->invocation_counter(); 739 InvocationCounter* bc = mcs->backedge_counter(); 740 int icval = ic->count(); 741 if (ic->carry()) icval += CompileThreshold; 742 if (mileage < icval) mileage = icval; 743 int bcval = bc->count(); 744 if (bc->carry()) bcval += CompileThreshold; 745 if (mileage < bcval) mileage = bcval; 746 } 747 } 748 return mileage; 749 } 750 751 bool MethodData::is_mature() const { 752 return CompilationPolicy::policy()->is_mature(_method); 753 } 754 755 // Translate a bci to its corresponding data index (di). 756 address MethodData::bci_to_dp(int bci) { 757 ResourceMark rm; 758 ProfileData* data = data_before(bci); 759 ProfileData* prev = NULL; 760 for ( ; is_valid(data); data = next_data(data)) { 761 if (data->bci() >= bci) { 762 if (data->bci() == bci) set_hint_di(dp_to_di(data->dp())); 763 else if (prev != NULL) set_hint_di(dp_to_di(prev->dp())); 764 return data->dp(); 765 } 766 prev = data; 767 } 768 return (address)limit_data_position(); 769 } 770 771 // Translate a bci to its corresponding data, or NULL. 772 ProfileData* MethodData::bci_to_data(int bci) { 773 ProfileData* data = data_before(bci); 774 for ( ; is_valid(data); data = next_data(data)) { 775 if (data->bci() == bci) { 776 set_hint_di(dp_to_di(data->dp())); 777 return data; 778 } else if (data->bci() > bci) { 779 break; 780 } 781 } 782 return bci_to_extra_data(bci, false); 783 } 784 785 // Translate a bci to its corresponding extra data, or NULL. 786 ProfileData* MethodData::bci_to_extra_data(int bci, bool create_if_missing) { 787 DataLayout* dp = extra_data_base(); 788 DataLayout* end = extra_data_limit(); 789 DataLayout* avail = NULL; 790 for (; dp < end; dp = next_extra(dp)) { 791 // No need for "OrderAccess::load_acquire" ops, 792 // since the data structure is monotonic. 793 if (dp->tag() == DataLayout::no_tag) break; 794 if (dp->tag() == DataLayout::arg_info_data_tag) { 795 dp = end; // ArgInfoData is at the end of extra data section. 796 break; 797 } 798 if (dp->bci() == bci) { 799 assert(dp->tag() == DataLayout::bit_data_tag, "sane"); 800 return new BitData(dp); 801 } 802 } 803 if (create_if_missing && dp < end) { 804 // Allocate this one. There is no mutual exclusion, 805 // so two threads could allocate different BCIs to the 806 // same data layout. This means these extra data 807 // records, like most other MDO contents, must not be 808 // trusted too much. 809 DataLayout temp; 810 temp.initialize(DataLayout::bit_data_tag, bci, 0); 811 dp->release_set_header(temp.header()); 812 assert(dp->tag() == DataLayout::bit_data_tag, "sane"); 813 //NO: assert(dp->bci() == bci, "no concurrent allocation"); 814 return new BitData(dp); 815 } 816 return NULL; 817 } 818 819 ArgInfoData *MethodData::arg_info() { 820 DataLayout* dp = extra_data_base(); 821 DataLayout* end = extra_data_limit(); 822 for (; dp < end; dp = next_extra(dp)) { 823 if (dp->tag() == DataLayout::arg_info_data_tag) 824 return new ArgInfoData(dp); 825 } 826 return NULL; 827 } 828 829 // Printing 830 831 #ifndef PRODUCT 832 833 void MethodData::print_on(outputStream* st) const { 834 assert(is_methodData(), "should be method data"); 835 st->print("method data for "); 836 method()->print_value_on(st); 837 st->cr(); 838 print_data_on(st); 839 } 840 841 #endif //PRODUCT 842 843 void MethodData::print_value_on(outputStream* st) const { 844 assert(is_methodData(), "should be method data"); 845 st->print("method data for "); 846 method()->print_value_on(st); 847 } 848 849 #ifndef PRODUCT 850 void MethodData::print_data_on(outputStream* st) const { 851 ResourceMark rm; 852 ProfileData* data = first_data(); 853 for ( ; is_valid(data); data = next_data(data)) { 854 st->print("%d", dp_to_di(data->dp())); 855 st->fill_to(6); 856 data->print_data_on(st); 857 } 858 st->print_cr("--- Extra data:"); 859 DataLayout* dp = extra_data_base(); 860 DataLayout* end = extra_data_limit(); 861 for (; dp < end; dp = next_extra(dp)) { 862 // No need for "OrderAccess::load_acquire" ops, 863 // since the data structure is monotonic. 864 if (dp->tag() == DataLayout::no_tag) continue; 865 if (dp->tag() == DataLayout::bit_data_tag) { 866 data = new BitData(dp); 867 } else { 868 assert(dp->tag() == DataLayout::arg_info_data_tag, "must be BitData or ArgInfo"); 869 data = new ArgInfoData(dp); 870 dp = end; // ArgInfoData is at the end of extra data section. 871 } 872 st->print("%d", dp_to_di(data->dp())); 873 st->fill_to(6); 874 data->print_data_on(st); 875 } 876 } 877 #endif 878 879 #if INCLUDE_SERVICES 880 // Size Statistics 881 void MethodData::collect_statistics(KlassSizeStats *sz) const { 882 int n = sz->count(this); 883 sz->_method_data_bytes += n; 884 sz->_method_all_bytes += n; 885 sz->_rw_bytes += n; 886 } 887 #endif // INCLUDE_SERVICES 888 889 // Verification 890 891 void MethodData::verify_on(outputStream* st) { 892 guarantee(is_methodData(), "object must be method data"); 893 // guarantee(m->is_perm(), "should be in permspace"); 894 this->verify_data_on(st); 895 } 896 897 void MethodData::verify_data_on(outputStream* st) { 898 NEEDS_CLEANUP; 899 // not yet implemented. 900 }