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 #ifndef SHARE_VM_OOPS_METHODDATAOOP_HPP 26 #define SHARE_VM_OOPS_METHODDATAOOP_HPP 27 28 #include "interpreter/bytecodes.hpp" 29 #include "memory/universe.hpp" 30 #include "oops/method.hpp" 31 #include "oops/oop.hpp" 32 #include "runtime/orderAccess.hpp" 33 34 class BytecodeStream; 35 class KlassSizeStats; 36 37 // The MethodData object collects counts and other profile information 38 // during zeroth-tier (interpretive) and first-tier execution. 39 // The profile is used later by compilation heuristics. Some heuristics 40 // enable use of aggressive (or "heroic") optimizations. An aggressive 41 // optimization often has a down-side, a corner case that it handles 42 // poorly, but which is thought to be rare. The profile provides 43 // evidence of this rarity for a given method or even BCI. It allows 44 // the compiler to back out of the optimization at places where it 45 // has historically been a poor choice. Other heuristics try to use 46 // specific information gathered about types observed at a given site. 47 // 48 // All data in the profile is approximate. It is expected to be accurate 49 // on the whole, but the system expects occasional inaccuraces, due to 50 // counter overflow, multiprocessor races during data collection, space 51 // limitations, missing MDO blocks, etc. Bad or missing data will degrade 52 // optimization quality but will not affect correctness. Also, each MDO 53 // is marked with its birth-date ("creation_mileage") which can be used 54 // to assess the quality ("maturity") of its data. 55 // 56 // Short (<32-bit) counters are designed to overflow to a known "saturated" 57 // state. Also, certain recorded per-BCI events are given one-bit counters 58 // which overflow to a saturated state which applied to all counters at 59 // that BCI. In other words, there is a small lattice which approximates 60 // the ideal of an infinite-precision counter for each event at each BCI, 61 // and the lattice quickly "bottoms out" in a state where all counters 62 // are taken to be indefinitely large. 63 // 64 // The reader will find many data races in profile gathering code, starting 65 // with invocation counter incrementation. None of these races harm correct 66 // execution of the compiled code. 67 68 // forward decl 69 class ProfileData; 70 71 // DataLayout 72 // 73 // Overlay for generic profiling data. 74 class DataLayout VALUE_OBJ_CLASS_SPEC { 75 friend class VMStructs; 76 77 private: 78 // Every data layout begins with a header. This header 79 // contains a tag, which is used to indicate the size/layout 80 // of the data, 4 bits of flags, which can be used in any way, 81 // 4 bits of trap history (none/one reason/many reasons), 82 // and a bci, which is used to tie this piece of data to a 83 // specific bci in the bytecodes. 84 union { 85 intptr_t _bits; 86 struct { 87 u1 _tag; 88 u1 _flags; 89 u2 _bci; 90 } _struct; 91 } _header; 92 93 // The data layout has an arbitrary number of cells, each sized 94 // to accomodate a pointer or an integer. 95 intptr_t _cells[1]; 96 97 // Some types of data layouts need a length field. 98 static bool needs_array_len(u1 tag); 99 100 public: 101 enum { 102 counter_increment = 1 103 }; 104 105 enum { 106 cell_size = sizeof(intptr_t) 107 }; 108 109 // Tag values 110 enum { 111 no_tag, 112 bit_data_tag, 113 counter_data_tag, 114 jump_data_tag, 115 receiver_type_data_tag, 116 virtual_call_data_tag, 117 ret_data_tag, 118 branch_data_tag, 119 multi_branch_data_tag, 120 arg_info_data_tag, 121 call_type_data_tag, 122 virtual_call_type_data_tag 123 }; 124 125 enum { 126 // The _struct._flags word is formatted as [trap_state:4 | flags:4]. 127 // The trap state breaks down further as [recompile:1 | reason:3]. 128 // This further breakdown is defined in deoptimization.cpp. 129 // See Deoptimization::trap_state_reason for an assert that 130 // trap_bits is big enough to hold reasons < Reason_RECORDED_LIMIT. 131 // 132 // The trap_state is collected only if ProfileTraps is true. 133 trap_bits = 1+3, // 3: enough to distinguish [0..Reason_RECORDED_LIMIT]. 134 trap_shift = BitsPerByte - trap_bits, 135 trap_mask = right_n_bits(trap_bits), 136 trap_mask_in_place = (trap_mask << trap_shift), 137 flag_limit = trap_shift, 138 flag_mask = right_n_bits(flag_limit), 139 first_flag = 0 140 }; 141 142 // Size computation 143 static int header_size_in_bytes() { 144 return cell_size; 145 } 146 static int header_size_in_cells() { 147 return 1; 148 } 149 150 static int compute_size_in_bytes(int cell_count) { 151 return header_size_in_bytes() + cell_count * cell_size; 152 } 153 154 // Initialization 155 void initialize(u1 tag, u2 bci, int cell_count); 156 157 // Accessors 158 u1 tag() { 159 return _header._struct._tag; 160 } 161 162 // Return a few bits of trap state. Range is [0..trap_mask]. 163 // The state tells if traps with zero, one, or many reasons have occurred. 164 // It also tells whether zero or many recompilations have occurred. 165 // The associated trap histogram in the MDO itself tells whether 166 // traps are common or not. If a BCI shows that a trap X has 167 // occurred, and the MDO shows N occurrences of X, we make the 168 // simplifying assumption that all N occurrences can be blamed 169 // on that BCI. 170 int trap_state() const { 171 return ((_header._struct._flags >> trap_shift) & trap_mask); 172 } 173 174 void set_trap_state(int new_state) { 175 assert(ProfileTraps, "used only under +ProfileTraps"); 176 uint old_flags = (_header._struct._flags & flag_mask); 177 _header._struct._flags = (new_state << trap_shift) | old_flags; 178 } 179 180 u1 flags() const { 181 return _header._struct._flags; 182 } 183 184 u2 bci() const { 185 return _header._struct._bci; 186 } 187 188 void set_header(intptr_t value) { 189 _header._bits = value; 190 } 191 void release_set_header(intptr_t value) { 192 OrderAccess::release_store_ptr(&_header._bits, value); 193 } 194 intptr_t header() { 195 return _header._bits; 196 } 197 void set_cell_at(int index, intptr_t value) { 198 _cells[index] = value; 199 } 200 void release_set_cell_at(int index, intptr_t value) { 201 OrderAccess::release_store_ptr(&_cells[index], value); 202 } 203 intptr_t cell_at(int index) const { 204 return _cells[index]; 205 } 206 207 void set_flag_at(int flag_number) { 208 assert(flag_number < flag_limit, "oob"); 209 _header._struct._flags |= (0x1 << flag_number); 210 } 211 bool flag_at(int flag_number) const { 212 assert(flag_number < flag_limit, "oob"); 213 return (_header._struct._flags & (0x1 << flag_number)) != 0; 214 } 215 216 // Low-level support for code generation. 217 static ByteSize header_offset() { 218 return byte_offset_of(DataLayout, _header); 219 } 220 static ByteSize tag_offset() { 221 return byte_offset_of(DataLayout, _header._struct._tag); 222 } 223 static ByteSize flags_offset() { 224 return byte_offset_of(DataLayout, _header._struct._flags); 225 } 226 static ByteSize bci_offset() { 227 return byte_offset_of(DataLayout, _header._struct._bci); 228 } 229 static ByteSize cell_offset(int index) { 230 return byte_offset_of(DataLayout, _cells) + in_ByteSize(index * cell_size); 231 } 232 // Return a value which, when or-ed as a byte into _flags, sets the flag. 233 static int flag_number_to_byte_constant(int flag_number) { 234 assert(0 <= flag_number && flag_number < flag_limit, "oob"); 235 DataLayout temp; temp.set_header(0); 236 temp.set_flag_at(flag_number); 237 return temp._header._struct._flags; 238 } 239 // Return a value which, when or-ed as a word into _header, sets the flag. 240 static intptr_t flag_mask_to_header_mask(int byte_constant) { 241 DataLayout temp; temp.set_header(0); 242 temp._header._struct._flags = byte_constant; 243 return temp._header._bits; 244 } 245 246 ProfileData* data_in(); 247 248 // GC support 249 void clean_weak_klass_links(BoolObjectClosure* cl); 250 }; 251 252 253 // ProfileData class hierarchy 254 class ProfileData; 255 class BitData; 256 class CounterData; 257 class ReceiverTypeData; 258 class VirtualCallData; 259 class VirtualCallTypeData; 260 class RetData; 261 class CallTypeData; 262 class JumpData; 263 class BranchData; 264 class ArrayData; 265 class MultiBranchData; 266 class ArgInfoData; 267 268 // ProfileData 269 // 270 // A ProfileData object is created to refer to a section of profiling 271 // data in a structured way. 272 class ProfileData : public ResourceObj { 273 friend class TypeEntries; 274 friend class ReturnTypeEntry; 275 friend class TypeStackSlotEntries; 276 private: 277 #ifndef PRODUCT 278 enum { 279 tab_width_one = 16, 280 tab_width_two = 36 281 }; 282 #endif // !PRODUCT 283 284 // This is a pointer to a section of profiling data. 285 DataLayout* _data; 286 287 protected: 288 DataLayout* data() { return _data; } 289 const DataLayout* data() const { return _data; } 290 291 enum { 292 cell_size = DataLayout::cell_size 293 }; 294 295 public: 296 // How many cells are in this? 297 virtual int cell_count() const { 298 ShouldNotReachHere(); 299 return -1; 300 } 301 302 // Return the size of this data. 303 int size_in_bytes() { 304 return DataLayout::compute_size_in_bytes(cell_count()); 305 } 306 307 protected: 308 // Low-level accessors for underlying data 309 void set_intptr_at(int index, intptr_t value) { 310 assert(0 <= index && index < cell_count(), "oob"); 311 data()->set_cell_at(index, value); 312 } 313 void release_set_intptr_at(int index, intptr_t value) { 314 assert(0 <= index && index < cell_count(), "oob"); 315 data()->release_set_cell_at(index, value); 316 } 317 intptr_t intptr_at(int index) const { 318 assert(0 <= index && index < cell_count(), "oob"); 319 return data()->cell_at(index); 320 } 321 void set_uint_at(int index, uint value) { 322 set_intptr_at(index, (intptr_t) value); 323 } 324 void release_set_uint_at(int index, uint value) { 325 release_set_intptr_at(index, (intptr_t) value); 326 } 327 uint uint_at(int index) const { 328 return (uint)intptr_at(index); 329 } 330 void set_int_at(int index, int value) { 331 set_intptr_at(index, (intptr_t) value); 332 } 333 void release_set_int_at(int index, int value) { 334 release_set_intptr_at(index, (intptr_t) value); 335 } 336 int int_at(int index) const { 337 return (int)intptr_at(index); 338 } 339 int int_at_unchecked(int index) const { 340 return (int)data()->cell_at(index); 341 } 342 void set_oop_at(int index, oop value) { 343 set_intptr_at(index, cast_from_oop<intptr_t>(value)); 344 } 345 oop oop_at(int index) const { 346 return cast_to_oop(intptr_at(index)); 347 } 348 349 void set_flag_at(int flag_number) { 350 data()->set_flag_at(flag_number); 351 } 352 bool flag_at(int flag_number) const { 353 return data()->flag_at(flag_number); 354 } 355 356 // two convenient imports for use by subclasses: 357 static ByteSize cell_offset(int index) { 358 return DataLayout::cell_offset(index); 359 } 360 static int flag_number_to_byte_constant(int flag_number) { 361 return DataLayout::flag_number_to_byte_constant(flag_number); 362 } 363 364 ProfileData(DataLayout* data) { 365 _data = data; 366 } 367 368 public: 369 // Constructor for invalid ProfileData. 370 ProfileData(); 371 372 u2 bci() const { 373 return data()->bci(); 374 } 375 376 address dp() { 377 return (address)_data; 378 } 379 380 int trap_state() const { 381 return data()->trap_state(); 382 } 383 void set_trap_state(int new_state) { 384 data()->set_trap_state(new_state); 385 } 386 387 // Type checking 388 virtual bool is_BitData() const { return false; } 389 virtual bool is_CounterData() const { return false; } 390 virtual bool is_JumpData() const { return false; } 391 virtual bool is_ReceiverTypeData()const { return false; } 392 virtual bool is_VirtualCallData() const { return false; } 393 virtual bool is_RetData() const { return false; } 394 virtual bool is_BranchData() const { return false; } 395 virtual bool is_ArrayData() const { return false; } 396 virtual bool is_MultiBranchData() const { return false; } 397 virtual bool is_ArgInfoData() const { return false; } 398 virtual bool is_CallTypeData() const { return false; } 399 virtual bool is_VirtualCallTypeData()const { return false; } 400 401 402 BitData* as_BitData() const { 403 assert(is_BitData(), "wrong type"); 404 return is_BitData() ? (BitData*) this : NULL; 405 } 406 CounterData* as_CounterData() const { 407 assert(is_CounterData(), "wrong type"); 408 return is_CounterData() ? (CounterData*) this : NULL; 409 } 410 JumpData* as_JumpData() const { 411 assert(is_JumpData(), "wrong type"); 412 return is_JumpData() ? (JumpData*) this : NULL; 413 } 414 ReceiverTypeData* as_ReceiverTypeData() const { 415 assert(is_ReceiverTypeData(), "wrong type"); 416 return is_ReceiverTypeData() ? (ReceiverTypeData*)this : NULL; 417 } 418 VirtualCallData* as_VirtualCallData() const { 419 assert(is_VirtualCallData(), "wrong type"); 420 return is_VirtualCallData() ? (VirtualCallData*)this : NULL; 421 } 422 RetData* as_RetData() const { 423 assert(is_RetData(), "wrong type"); 424 return is_RetData() ? (RetData*) this : NULL; 425 } 426 BranchData* as_BranchData() const { 427 assert(is_BranchData(), "wrong type"); 428 return is_BranchData() ? (BranchData*) this : NULL; 429 } 430 ArrayData* as_ArrayData() const { 431 assert(is_ArrayData(), "wrong type"); 432 return is_ArrayData() ? (ArrayData*) this : NULL; 433 } 434 MultiBranchData* as_MultiBranchData() const { 435 assert(is_MultiBranchData(), "wrong type"); 436 return is_MultiBranchData() ? (MultiBranchData*)this : NULL; 437 } 438 ArgInfoData* as_ArgInfoData() const { 439 assert(is_ArgInfoData(), "wrong type"); 440 return is_ArgInfoData() ? (ArgInfoData*)this : NULL; 441 } 442 CallTypeData* as_CallTypeData() const { 443 assert(is_CallTypeData(), "wrong type"); 444 return is_CallTypeData() ? (CallTypeData*)this : NULL; 445 } 446 VirtualCallTypeData* as_VirtualCallTypeData() const { 447 assert(is_VirtualCallTypeData(), "wrong type"); 448 return is_VirtualCallTypeData() ? (VirtualCallTypeData*)this : NULL; 449 } 450 451 452 // Subclass specific initialization 453 virtual void post_initialize(BytecodeStream* stream, MethodData* mdo) {} 454 455 // GC support 456 virtual void clean_weak_klass_links(BoolObjectClosure* is_alive_closure) {} 457 458 // CI translation: ProfileData can represent both MethodDataOop data 459 // as well as CIMethodData data. This function is provided for translating 460 // an oop in a ProfileData to the ci equivalent. Generally speaking, 461 // most ProfileData don't require any translation, so we provide the null 462 // translation here, and the required translators are in the ci subclasses. 463 virtual void translate_from(const ProfileData* data) {} 464 465 virtual void print_data_on(outputStream* st) const { 466 ShouldNotReachHere(); 467 } 468 469 #ifndef PRODUCT 470 void print_shared(outputStream* st, const char* name) const; 471 void tab(outputStream* st, bool first = false) const; 472 #endif 473 }; 474 475 // BitData 476 // 477 // A BitData holds a flag or two in its header. 478 class BitData : public ProfileData { 479 protected: 480 enum { 481 // null_seen: 482 // saw a null operand (cast/aastore/instanceof) 483 null_seen_flag = DataLayout::first_flag + 0 484 }; 485 enum { bit_cell_count = 0 }; // no additional data fields needed. 486 public: 487 BitData(DataLayout* layout) : ProfileData(layout) { 488 } 489 490 virtual bool is_BitData() const { return true; } 491 492 static int static_cell_count() { 493 return bit_cell_count; 494 } 495 496 virtual int cell_count() const { 497 return static_cell_count(); 498 } 499 500 // Accessor 501 502 // The null_seen flag bit is specially known to the interpreter. 503 // Consulting it allows the compiler to avoid setting up null_check traps. 504 bool null_seen() { return flag_at(null_seen_flag); } 505 void set_null_seen() { set_flag_at(null_seen_flag); } 506 507 508 // Code generation support 509 static int null_seen_byte_constant() { 510 return flag_number_to_byte_constant(null_seen_flag); 511 } 512 513 static ByteSize bit_data_size() { 514 return cell_offset(bit_cell_count); 515 } 516 517 #ifndef PRODUCT 518 void print_data_on(outputStream* st) const; 519 #endif 520 }; 521 522 // CounterData 523 // 524 // A CounterData corresponds to a simple counter. 525 class CounterData : public BitData { 526 protected: 527 enum { 528 count_off, 529 counter_cell_count 530 }; 531 public: 532 CounterData(DataLayout* layout) : BitData(layout) {} 533 534 virtual bool is_CounterData() const { return true; } 535 536 static int static_cell_count() { 537 return counter_cell_count; 538 } 539 540 virtual int cell_count() const { 541 return static_cell_count(); 542 } 543 544 // Direct accessor 545 uint count() const { 546 return uint_at(count_off); 547 } 548 549 // Code generation support 550 static ByteSize count_offset() { 551 return cell_offset(count_off); 552 } 553 static ByteSize counter_data_size() { 554 return cell_offset(counter_cell_count); 555 } 556 557 void set_count(uint count) { 558 set_uint_at(count_off, count); 559 } 560 561 #ifndef PRODUCT 562 void print_data_on(outputStream* st) const; 563 #endif 564 }; 565 566 // JumpData 567 // 568 // A JumpData is used to access profiling information for a direct 569 // branch. It is a counter, used for counting the number of branches, 570 // plus a data displacement, used for realigning the data pointer to 571 // the corresponding target bci. 572 class JumpData : public ProfileData { 573 protected: 574 enum { 575 taken_off_set, 576 displacement_off_set, 577 jump_cell_count 578 }; 579 580 void set_displacement(int displacement) { 581 set_int_at(displacement_off_set, displacement); 582 } 583 584 public: 585 JumpData(DataLayout* layout) : ProfileData(layout) { 586 assert(layout->tag() == DataLayout::jump_data_tag || 587 layout->tag() == DataLayout::branch_data_tag, "wrong type"); 588 } 589 590 virtual bool is_JumpData() const { return true; } 591 592 static int static_cell_count() { 593 return jump_cell_count; 594 } 595 596 virtual int cell_count() const { 597 return static_cell_count(); 598 } 599 600 // Direct accessor 601 uint taken() const { 602 return uint_at(taken_off_set); 603 } 604 605 void set_taken(uint cnt) { 606 set_uint_at(taken_off_set, cnt); 607 } 608 609 // Saturating counter 610 uint inc_taken() { 611 uint cnt = taken() + 1; 612 // Did we wrap? Will compiler screw us?? 613 if (cnt == 0) cnt--; 614 set_uint_at(taken_off_set, cnt); 615 return cnt; 616 } 617 618 int displacement() const { 619 return int_at(displacement_off_set); 620 } 621 622 // Code generation support 623 static ByteSize taken_offset() { 624 return cell_offset(taken_off_set); 625 } 626 627 static ByteSize displacement_offset() { 628 return cell_offset(displacement_off_set); 629 } 630 631 // Specific initialization. 632 void post_initialize(BytecodeStream* stream, MethodData* mdo); 633 634 #ifndef PRODUCT 635 void print_data_on(outputStream* st) const; 636 #endif 637 }; 638 639 // Entries in a ProfileData object to record types: it can either be 640 // none (no profile), unknown (conflicting profile data) or a klass if 641 // a single one is seen. Whether a null reference was seen is also 642 // recorded. No counter is associated with the type and a single type 643 // is tracked (unlike VirtualCallData). 644 class TypeEntries { 645 646 public: 647 648 // A single cell is used to record information for a type: 649 // - the cell is initialized to 0 650 // - when a type is discovered it is stored in the cell 651 // - bit zero of the cell is used to record whether a null reference 652 // was encountered or not 653 // - bit 1 is set to record a conflict in the type information 654 655 enum { 656 null_seen = 1, 657 type_mask = ~null_seen, 658 type_unknown = 2, 659 status_bits = null_seen | type_unknown, 660 type_klass_mask = ~status_bits 661 }; 662 663 // what to initialize a cell to 664 static intptr_t type_none() { 665 return NULL; 666 } 667 668 // null seen = bit 0 set? 669 static bool was_null_seen(intptr_t v) { 670 return v & null_seen; 671 } 672 673 // conflicting type information = bit 1 set? 674 static bool is_type_unknown(intptr_t v) { 675 return v & type_unknown; 676 } 677 678 // not type information yet = all bits cleared, ignoring bit 0? 679 static bool is_type_none(intptr_t v) { 680 return (v & type_mask) == 0; 681 } 682 683 // recorded type: cell without bit 0 and 1 684 static intptr_t klass_part(intptr_t v) { 685 intptr_t r = v & type_klass_mask; 686 assert (r != NULL, "invalid"); 687 return r; 688 } 689 690 // type recorded 691 static Klass* valid_klass(intptr_t k) { 692 if (!is_type_none(k) && 693 !is_type_unknown(k)) { 694 return (Klass*)klass_part(k); 695 } else { 696 return NULL; 697 } 698 } 699 700 static intptr_t with_status(intptr_t k, intptr_t in) { 701 return k | (in & status_bits); 702 } 703 704 static intptr_t with_status(Klass* k, intptr_t in) { 705 return with_status((intptr_t)k, in); 706 } 707 708 #ifndef PRODUCT 709 static void print_klass(outputStream* st, intptr_t k); 710 #endif 711 712 // GC support 713 static bool is_loader_alive(BoolObjectClosure* is_alive_cl, intptr_t p); 714 715 protected: 716 // ProfileData object these entries are part of 717 ProfileData* _pd; 718 // offset within the ProfileData object where the entries start 719 const int _base_off; 720 721 TypeEntries(int base_off, ProfileData* pd) 722 : _base_off(base_off), _pd(pd) {} 723 724 void set_intptr_at(int index, intptr_t value) { 725 _pd->set_intptr_at(index, value); 726 } 727 728 intptr_t intptr_at(int index) const { 729 return _pd->intptr_at(index); 730 } 731 }; 732 733 // Type entries used for arguments passed at a call and parameters on 734 // method entry. 2 cells per entry: one for the type encoded as in 735 // TypeEntries and one initialized with the stack slot where the 736 // profiled object is to be found so that the interpreter can locate 737 // it quickly. 738 class TypeStackSlotEntries : public TypeEntries { 739 740 private: 741 enum { 742 stack_slot_entry, 743 type_entry, 744 per_arg_cell_count 745 }; 746 747 // offset of cell for stack slot for entry i within ProfileData object 748 int stack_slot_offset(int i) const { 749 return _base_off + stack_slot_local_offset(i); 750 } 751 752 protected: 753 const int _number_of_entries; 754 755 // offset of cell for type for entry i within ProfileData object 756 int type_offset(int i) const { 757 return _base_off + type_local_offset(i); 758 } 759 760 public: 761 762 TypeStackSlotEntries(int base_off, ProfileData* pd, int nb_entries) 763 : TypeEntries(base_off, pd), _number_of_entries(nb_entries) {} 764 765 static int compute_cell_count(Symbol* signature, int max); 766 767 void post_initialize(Symbol* signature, bool has_receiver); 768 769 // offset of cell for stack slot for entry i within this block of cells for a TypeStackSlotEntries 770 static int stack_slot_local_offset(int i) { 771 return i * per_arg_cell_count + stack_slot_entry; 772 } 773 774 // offset of cell for type for entry i within this block of cells for a TypeStackSlotEntries 775 static int type_local_offset(int i) { 776 return i * per_arg_cell_count + type_entry; 777 } 778 779 // stack slot for entry i 780 uint stack_slot(int i) const { 781 assert(i >= 0 && i < _number_of_entries, "oob"); 782 return _pd->uint_at(stack_slot_offset(i)); 783 } 784 785 // set stack slot for entry i 786 void set_stack_slot(int i, uint num) { 787 assert(i >= 0 && i < _number_of_entries, "oob"); 788 _pd->set_uint_at(stack_slot_offset(i), num); 789 } 790 791 // type for entry i 792 intptr_t type(int i) const { 793 assert(i >= 0 && i < _number_of_entries, "oob"); 794 return _pd->intptr_at(type_offset(i)); 795 } 796 797 // set type for entry i 798 void set_type(int i, intptr_t k) { 799 assert(i >= 0 && i < _number_of_entries, "oob"); 800 _pd->set_intptr_at(type_offset(i), k); 801 } 802 803 static ByteSize per_arg_size() { 804 return in_ByteSize(per_arg_cell_count * DataLayout::cell_size); 805 } 806 807 static int per_arg_count() { 808 return per_arg_cell_count ; 809 } 810 811 // GC support 812 void clean_weak_klass_links(BoolObjectClosure* is_alive_closure); 813 814 #ifndef PRODUCT 815 void print_data_on(outputStream* st) const; 816 #endif 817 }; 818 819 // Type entry used for return from a call. A single cell to record the 820 // type. 821 class ReturnTypeEntry : public TypeEntries { 822 823 private: 824 enum { 825 cell_count = 1 826 }; 827 828 public: 829 ReturnTypeEntry(int base_off, ProfileData* pd) 830 : TypeEntries(base_off, pd) {} 831 832 void post_initialize() { 833 set_type(type_none()); 834 } 835 836 intptr_t type() const { 837 return _pd->intptr_at(_base_off); 838 } 839 840 void set_type(intptr_t k) { 841 _pd->set_intptr_at(_base_off, k); 842 } 843 844 static int static_cell_count() { 845 return cell_count; 846 } 847 848 static ByteSize size() { 849 return in_ByteSize(cell_count * DataLayout::cell_size); 850 } 851 852 ByteSize type_offset() { 853 return DataLayout::cell_offset(_base_off); 854 } 855 856 // GC support 857 void clean_weak_klass_links(BoolObjectClosure* is_alive_closure); 858 859 #ifndef PRODUCT 860 void print_data_on(outputStream* st) const; 861 #endif 862 }; 863 864 // Entries to collect type information at a call: contains arguments 865 // (TypeStackSlotEntries), a return type (ReturnTypeEntry) and a 866 // number of cells. Because the number of cells for the return type is 867 // smaller than the number of cells for the type of an arguments, the 868 // number of cells is used to tell how many arguments are profiled and 869 // whether a return value is profiled. See has_arguments() and 870 // has_return(). 871 class TypeEntriesAtCall { 872 private: 873 static int stack_slot_local_offset(int i) { 874 return header_cell_count() + TypeStackSlotEntries::stack_slot_local_offset(i); 875 } 876 877 static int argument_type_local_offset(int i) { 878 return header_cell_count() + TypeStackSlotEntries::type_local_offset(i);; 879 } 880 881 public: 882 883 static int header_cell_count() { 884 return 1; 885 } 886 887 static int cell_count_local_offset() { 888 return 0; 889 } 890 891 static int compute_cell_count(BytecodeStream* stream); 892 893 static void initialize(DataLayout* dl, int base, int cell_count) { 894 int off = base + cell_count_local_offset(); 895 dl->set_cell_at(off, cell_count - base - header_cell_count()); 896 } 897 898 static bool arguments_profiling_enabled(); 899 static bool return_profiling_enabled(); 900 901 // Code generation support 902 static ByteSize cell_count_offset() { 903 return in_ByteSize(cell_count_local_offset() * DataLayout::cell_size); 904 } 905 906 static ByteSize args_data_offset() { 907 return in_ByteSize(header_cell_count() * DataLayout::cell_size); 908 } 909 910 static ByteSize stack_slot_offset(int i) { 911 return in_ByteSize(stack_slot_local_offset(i) * DataLayout::cell_size); 912 } 913 914 static ByteSize argument_type_offset(int i) { 915 return in_ByteSize(argument_type_local_offset(i) * DataLayout::cell_size); 916 } 917 }; 918 919 // CallTypeData 920 // 921 // A CallTypeData is used to access profiling information about a non 922 // virtual call for which we collect type information about arguments 923 // and return value. 924 class CallTypeData : public CounterData { 925 private: 926 // entries for arguments if any 927 TypeStackSlotEntries _args; 928 // entry for return type if any 929 ReturnTypeEntry _ret; 930 931 int cell_count_global_offset() const { 932 return CounterData::static_cell_count() + TypeEntriesAtCall::cell_count_local_offset(); 933 } 934 935 // number of cells not counting the header 936 int cell_count_no_header() const { 937 return uint_at(cell_count_global_offset()); 938 } 939 940 void check_number_of_arguments(uint total) { 941 assert(number_of_arguments() == total, "should be set in DataLayout::initialize"); 942 } 943 944 protected: 945 // An entry for a return value takes less space than an entry for an 946 // argument so if the number of cells exceeds the number of cells 947 // needed for an argument, this object contains type information for 948 // at least one argument. 949 bool has_arguments() const { 950 bool res = cell_count_no_header() >= TypeStackSlotEntries::per_arg_count(); 951 assert (!res || TypeEntriesAtCall::arguments_profiling_enabled(), "no profiling of arguments"); 952 return res; 953 } 954 955 public: 956 CallTypeData(DataLayout* layout) : 957 CounterData(layout), 958 _args(CounterData::static_cell_count()+TypeEntriesAtCall::header_cell_count(), this, number_of_arguments()), 959 _ret(cell_count() - ReturnTypeEntry::static_cell_count(), this) 960 { 961 assert(layout->tag() == DataLayout::call_type_data_tag, "wrong type"); 962 } 963 964 const TypeStackSlotEntries* args() const { 965 assert(has_arguments(), "no profiling of arguments"); 966 return &_args; 967 } 968 969 const ReturnTypeEntry* ret() const { 970 assert(has_return(), "no profiling of return value"); 971 return &_ret; 972 } 973 974 virtual bool is_CallTypeData() const { return true; } 975 976 static int static_cell_count() { 977 return -1; 978 } 979 980 static int compute_cell_count(BytecodeStream* stream) { 981 return CounterData::static_cell_count() + TypeEntriesAtCall::compute_cell_count(stream); 982 } 983 984 static void initialize(DataLayout* dl, int cell_count) { 985 TypeEntriesAtCall::initialize(dl, CounterData::static_cell_count(), cell_count); 986 } 987 988 virtual void post_initialize(BytecodeStream* stream, MethodData* mdo); 989 990 virtual int cell_count() const { 991 return CounterData::static_cell_count() + 992 TypeEntriesAtCall::header_cell_count() + 993 int_at_unchecked(cell_count_global_offset()); 994 } 995 996 uint number_of_arguments() const { 997 return cell_count_no_header() / TypeStackSlotEntries::per_arg_count(); 998 } 999 1000 void set_argument_type(int i, Klass* k) { 1001 assert(has_arguments(), "no arguments!"); 1002 intptr_t current = _args.type(i); 1003 _args.set_type(i, TypeEntries::with_status(k, current)); 1004 } 1005 1006 void set_return_type(Klass* k) { 1007 assert(has_return(), "no return!"); 1008 intptr_t current = _ret.type(); 1009 _ret.set_type(TypeEntries::with_status(k, current)); 1010 } 1011 1012 // An entry for a return value takes less space than an entry for an 1013 // argument, so if the remainder of the number of cells divided by 1014 // the number of cells for an argument is not null, a return value 1015 // is profiled in this object. 1016 bool has_return() const { 1017 bool res = (cell_count_no_header() % TypeStackSlotEntries::per_arg_count()) != 0; 1018 assert (!res || TypeEntriesAtCall::return_profiling_enabled(), "no profiling of return values"); 1019 return res; 1020 } 1021 1022 // Code generation support 1023 static ByteSize args_data_offset() { 1024 return cell_offset(CounterData::static_cell_count()) + TypeEntriesAtCall::args_data_offset(); 1025 } 1026 1027 // GC support 1028 virtual void clean_weak_klass_links(BoolObjectClosure* is_alive_closure) { 1029 if (has_arguments()) { 1030 _args.clean_weak_klass_links(is_alive_closure); 1031 } 1032 if (has_return()) { 1033 _ret.clean_weak_klass_links(is_alive_closure); 1034 } 1035 } 1036 1037 #ifndef PRODUCT 1038 virtual void print_data_on(outputStream* st) const; 1039 #endif 1040 }; 1041 1042 // ReceiverTypeData 1043 // 1044 // A ReceiverTypeData is used to access profiling information about a 1045 // dynamic type check. It consists of a counter which counts the total times 1046 // that the check is reached, and a series of (Klass*, count) pairs 1047 // which are used to store a type profile for the receiver of the check. 1048 class ReceiverTypeData : public CounterData { 1049 protected: 1050 enum { 1051 receiver0_offset = counter_cell_count, 1052 count0_offset, 1053 receiver_type_row_cell_count = (count0_offset + 1) - receiver0_offset 1054 }; 1055 1056 public: 1057 ReceiverTypeData(DataLayout* layout) : CounterData(layout) { 1058 assert(layout->tag() == DataLayout::receiver_type_data_tag || 1059 layout->tag() == DataLayout::virtual_call_data_tag || 1060 layout->tag() == DataLayout::virtual_call_type_data_tag, "wrong type"); 1061 } 1062 1063 virtual bool is_ReceiverTypeData() const { return true; } 1064 1065 static int static_cell_count() { 1066 return counter_cell_count + (uint) TypeProfileWidth * receiver_type_row_cell_count; 1067 } 1068 1069 virtual int cell_count() const { 1070 return static_cell_count(); 1071 } 1072 1073 // Direct accessors 1074 static uint row_limit() { 1075 return TypeProfileWidth; 1076 } 1077 static int receiver_cell_index(uint row) { 1078 return receiver0_offset + row * receiver_type_row_cell_count; 1079 } 1080 static int receiver_count_cell_index(uint row) { 1081 return count0_offset + row * receiver_type_row_cell_count; 1082 } 1083 1084 Klass* receiver(uint row) const { 1085 assert(row < row_limit(), "oob"); 1086 1087 Klass* recv = (Klass*)intptr_at(receiver_cell_index(row)); 1088 assert(recv == NULL || recv->is_klass(), "wrong type"); 1089 return recv; 1090 } 1091 1092 void set_receiver(uint row, Klass* k) { 1093 assert((uint)row < row_limit(), "oob"); 1094 set_intptr_at(receiver_cell_index(row), (uintptr_t)k); 1095 } 1096 1097 uint receiver_count(uint row) const { 1098 assert(row < row_limit(), "oob"); 1099 return uint_at(receiver_count_cell_index(row)); 1100 } 1101 1102 void set_receiver_count(uint row, uint count) { 1103 assert(row < row_limit(), "oob"); 1104 set_uint_at(receiver_count_cell_index(row), count); 1105 } 1106 1107 void clear_row(uint row) { 1108 assert(row < row_limit(), "oob"); 1109 // Clear total count - indicator of polymorphic call site. 1110 // The site may look like as monomorphic after that but 1111 // it allow to have more accurate profiling information because 1112 // there was execution phase change since klasses were unloaded. 1113 // If the site is still polymorphic then MDO will be updated 1114 // to reflect it. But it could be the case that the site becomes 1115 // only bimorphic. Then keeping total count not 0 will be wrong. 1116 // Even if we use monomorphic (when it is not) for compilation 1117 // we will only have trap, deoptimization and recompile again 1118 // with updated MDO after executing method in Interpreter. 1119 // An additional receiver will be recorded in the cleaned row 1120 // during next call execution. 1121 // 1122 // Note: our profiling logic works with empty rows in any slot. 1123 // We do sorting a profiling info (ciCallProfile) for compilation. 1124 // 1125 set_count(0); 1126 set_receiver(row, NULL); 1127 set_receiver_count(row, 0); 1128 } 1129 1130 // Code generation support 1131 static ByteSize receiver_offset(uint row) { 1132 return cell_offset(receiver_cell_index(row)); 1133 } 1134 static ByteSize receiver_count_offset(uint row) { 1135 return cell_offset(receiver_count_cell_index(row)); 1136 } 1137 static ByteSize receiver_type_data_size() { 1138 return cell_offset(static_cell_count()); 1139 } 1140 1141 // GC support 1142 virtual void clean_weak_klass_links(BoolObjectClosure* is_alive_closure); 1143 1144 #ifndef PRODUCT 1145 void print_receiver_data_on(outputStream* st) const; 1146 void print_data_on(outputStream* st) const; 1147 #endif 1148 }; 1149 1150 // VirtualCallData 1151 // 1152 // A VirtualCallData is used to access profiling information about a 1153 // virtual call. For now, it has nothing more than a ReceiverTypeData. 1154 class VirtualCallData : public ReceiverTypeData { 1155 public: 1156 VirtualCallData(DataLayout* layout) : ReceiverTypeData(layout) { 1157 assert(layout->tag() == DataLayout::virtual_call_data_tag || 1158 layout->tag() == DataLayout::virtual_call_type_data_tag, "wrong type"); 1159 } 1160 1161 virtual bool is_VirtualCallData() const { return true; } 1162 1163 static int static_cell_count() { 1164 // At this point we could add more profile state, e.g., for arguments. 1165 // But for now it's the same size as the base record type. 1166 return ReceiverTypeData::static_cell_count(); 1167 } 1168 1169 virtual int cell_count() const { 1170 return static_cell_count(); 1171 } 1172 1173 // Direct accessors 1174 static ByteSize virtual_call_data_size() { 1175 return cell_offset(static_cell_count()); 1176 } 1177 1178 #ifndef PRODUCT 1179 void print_data_on(outputStream* st) const; 1180 #endif 1181 }; 1182 1183 // VirtualCallTypeData 1184 // 1185 // A VirtualCallTypeData is used to access profiling information about 1186 // a virtual call for which we collect type information about 1187 // arguments and return value. 1188 class VirtualCallTypeData : public VirtualCallData { 1189 private: 1190 // entries for arguments if any 1191 TypeStackSlotEntries _args; 1192 // entry for return type if any 1193 ReturnTypeEntry _ret; 1194 1195 int cell_count_global_offset() const { 1196 return VirtualCallData::static_cell_count() + TypeEntriesAtCall::cell_count_local_offset(); 1197 } 1198 1199 // number of cells not counting the header 1200 int cell_count_no_header() const { 1201 return uint_at(cell_count_global_offset()); 1202 } 1203 1204 void check_number_of_arguments(uint total) { 1205 assert(number_of_arguments() == total, "should be set in DataLayout::initialize"); 1206 } 1207 1208 protected: 1209 // An entry for a return value takes less space than an entry for an 1210 // argument so if the number of cells exceeds the number of cells 1211 // needed for an argument, this object contains type information for 1212 // at least one argument. 1213 bool has_arguments() const { 1214 bool res = cell_count_no_header() >= TypeStackSlotEntries::per_arg_count(); 1215 assert (!res || TypeEntriesAtCall::arguments_profiling_enabled(), "no profiling of arguments"); 1216 return res; 1217 } 1218 1219 public: 1220 VirtualCallTypeData(DataLayout* layout) : 1221 VirtualCallData(layout), 1222 _args(VirtualCallData::static_cell_count()+TypeEntriesAtCall::header_cell_count(), this, number_of_arguments()), 1223 _ret(cell_count() - ReturnTypeEntry::static_cell_count(), this) 1224 { 1225 assert(layout->tag() == DataLayout::virtual_call_type_data_tag, "wrong type"); 1226 } 1227 1228 const TypeStackSlotEntries* args() const { 1229 assert(has_arguments(), "no profiling of arguments"); 1230 return &_args; 1231 } 1232 1233 const ReturnTypeEntry* ret() const { 1234 assert(has_return(), "no profiling of return value"); 1235 return &_ret; 1236 } 1237 1238 virtual bool is_VirtualCallTypeData() const { return true; } 1239 1240 static int static_cell_count() { 1241 return -1; 1242 } 1243 1244 static int compute_cell_count(BytecodeStream* stream) { 1245 return VirtualCallData::static_cell_count() + TypeEntriesAtCall::compute_cell_count(stream); 1246 } 1247 1248 static void initialize(DataLayout* dl, int cell_count) { 1249 TypeEntriesAtCall::initialize(dl, VirtualCallData::static_cell_count(), cell_count); 1250 } 1251 1252 virtual void post_initialize(BytecodeStream* stream, MethodData* mdo); 1253 1254 virtual int cell_count() const { 1255 return VirtualCallData::static_cell_count() + 1256 TypeEntriesAtCall::header_cell_count() + 1257 int_at_unchecked(cell_count_global_offset()); 1258 } 1259 1260 uint number_of_arguments() const { 1261 return cell_count_no_header() / TypeStackSlotEntries::per_arg_count(); 1262 } 1263 1264 void set_argument_type(int i, Klass* k) { 1265 assert(has_arguments(), "no arguments!"); 1266 intptr_t current = _args.type(i); 1267 _args.set_type(i, TypeEntries::with_status(k, current)); 1268 } 1269 1270 void set_return_type(Klass* k) { 1271 assert(has_return(), "no return!"); 1272 intptr_t current = _ret.type(); 1273 _ret.set_type(TypeEntries::with_status(k, current)); 1274 } 1275 1276 // An entry for a return value takes less space than an entry for an 1277 // argument, so if the remainder of the number of cells divided by 1278 // the number of cells for an argument is not null, a return value 1279 // is profiled in this object. 1280 bool has_return() const { 1281 bool res = (cell_count_no_header() % TypeStackSlotEntries::per_arg_count()) != 0; 1282 assert (!res || TypeEntriesAtCall::return_profiling_enabled(), "no profiling of return values"); 1283 return res; 1284 } 1285 1286 // Code generation support 1287 static ByteSize args_data_offset() { 1288 return cell_offset(VirtualCallData::static_cell_count()) + TypeEntriesAtCall::args_data_offset(); 1289 } 1290 1291 // GC support 1292 virtual void clean_weak_klass_links(BoolObjectClosure* is_alive_closure) { 1293 ReceiverTypeData::clean_weak_klass_links(is_alive_closure); 1294 if (has_arguments()) { 1295 _args.clean_weak_klass_links(is_alive_closure); 1296 } 1297 if (has_return()) { 1298 _ret.clean_weak_klass_links(is_alive_closure); 1299 } 1300 } 1301 1302 #ifndef PRODUCT 1303 virtual void print_data_on(outputStream* st) const; 1304 #endif 1305 }; 1306 1307 // RetData 1308 // 1309 // A RetData is used to access profiling information for a ret bytecode. 1310 // It is composed of a count of the number of times that the ret has 1311 // been executed, followed by a series of triples of the form 1312 // (bci, count, di) which count the number of times that some bci was the 1313 // target of the ret and cache a corresponding data displacement. 1314 class RetData : public CounterData { 1315 protected: 1316 enum { 1317 bci0_offset = counter_cell_count, 1318 count0_offset, 1319 displacement0_offset, 1320 ret_row_cell_count = (displacement0_offset + 1) - bci0_offset 1321 }; 1322 1323 void set_bci(uint row, int bci) { 1324 assert((uint)row < row_limit(), "oob"); 1325 set_int_at(bci0_offset + row * ret_row_cell_count, bci); 1326 } 1327 void release_set_bci(uint row, int bci) { 1328 assert((uint)row < row_limit(), "oob"); 1329 // 'release' when setting the bci acts as a valid flag for other 1330 // threads wrt bci_count and bci_displacement. 1331 release_set_int_at(bci0_offset + row * ret_row_cell_count, bci); 1332 } 1333 void set_bci_count(uint row, uint count) { 1334 assert((uint)row < row_limit(), "oob"); 1335 set_uint_at(count0_offset + row * ret_row_cell_count, count); 1336 } 1337 void set_bci_displacement(uint row, int disp) { 1338 set_int_at(displacement0_offset + row * ret_row_cell_count, disp); 1339 } 1340 1341 public: 1342 RetData(DataLayout* layout) : CounterData(layout) { 1343 assert(layout->tag() == DataLayout::ret_data_tag, "wrong type"); 1344 } 1345 1346 virtual bool is_RetData() const { return true; } 1347 1348 enum { 1349 no_bci = -1 // value of bci when bci1/2 are not in use. 1350 }; 1351 1352 static int static_cell_count() { 1353 return counter_cell_count + (uint) BciProfileWidth * ret_row_cell_count; 1354 } 1355 1356 virtual int cell_count() const { 1357 return static_cell_count(); 1358 } 1359 1360 static uint row_limit() { 1361 return BciProfileWidth; 1362 } 1363 static int bci_cell_index(uint row) { 1364 return bci0_offset + row * ret_row_cell_count; 1365 } 1366 static int bci_count_cell_index(uint row) { 1367 return count0_offset + row * ret_row_cell_count; 1368 } 1369 static int bci_displacement_cell_index(uint row) { 1370 return displacement0_offset + row * ret_row_cell_count; 1371 } 1372 1373 // Direct accessors 1374 int bci(uint row) const { 1375 return int_at(bci_cell_index(row)); 1376 } 1377 uint bci_count(uint row) const { 1378 return uint_at(bci_count_cell_index(row)); 1379 } 1380 int bci_displacement(uint row) const { 1381 return int_at(bci_displacement_cell_index(row)); 1382 } 1383 1384 // Interpreter Runtime support 1385 address fixup_ret(int return_bci, MethodData* mdo); 1386 1387 // Code generation support 1388 static ByteSize bci_offset(uint row) { 1389 return cell_offset(bci_cell_index(row)); 1390 } 1391 static ByteSize bci_count_offset(uint row) { 1392 return cell_offset(bci_count_cell_index(row)); 1393 } 1394 static ByteSize bci_displacement_offset(uint row) { 1395 return cell_offset(bci_displacement_cell_index(row)); 1396 } 1397 1398 // Specific initialization. 1399 void post_initialize(BytecodeStream* stream, MethodData* mdo); 1400 1401 #ifndef PRODUCT 1402 void print_data_on(outputStream* st) const; 1403 #endif 1404 }; 1405 1406 // BranchData 1407 // 1408 // A BranchData is used to access profiling data for a two-way branch. 1409 // It consists of taken and not_taken counts as well as a data displacement 1410 // for the taken case. 1411 class BranchData : public JumpData { 1412 protected: 1413 enum { 1414 not_taken_off_set = jump_cell_count, 1415 branch_cell_count 1416 }; 1417 1418 void set_displacement(int displacement) { 1419 set_int_at(displacement_off_set, displacement); 1420 } 1421 1422 public: 1423 BranchData(DataLayout* layout) : JumpData(layout) { 1424 assert(layout->tag() == DataLayout::branch_data_tag, "wrong type"); 1425 } 1426 1427 virtual bool is_BranchData() const { return true; } 1428 1429 static int static_cell_count() { 1430 return branch_cell_count; 1431 } 1432 1433 virtual int cell_count() const { 1434 return static_cell_count(); 1435 } 1436 1437 // Direct accessor 1438 uint not_taken() const { 1439 return uint_at(not_taken_off_set); 1440 } 1441 1442 void set_not_taken(uint cnt) { 1443 set_uint_at(not_taken_off_set, cnt); 1444 } 1445 1446 uint inc_not_taken() { 1447 uint cnt = not_taken() + 1; 1448 // Did we wrap? Will compiler screw us?? 1449 if (cnt == 0) cnt--; 1450 set_uint_at(not_taken_off_set, cnt); 1451 return cnt; 1452 } 1453 1454 // Code generation support 1455 static ByteSize not_taken_offset() { 1456 return cell_offset(not_taken_off_set); 1457 } 1458 static ByteSize branch_data_size() { 1459 return cell_offset(branch_cell_count); 1460 } 1461 1462 // Specific initialization. 1463 void post_initialize(BytecodeStream* stream, MethodData* mdo); 1464 1465 #ifndef PRODUCT 1466 void print_data_on(outputStream* st) const; 1467 #endif 1468 }; 1469 1470 // ArrayData 1471 // 1472 // A ArrayData is a base class for accessing profiling data which does 1473 // not have a statically known size. It consists of an array length 1474 // and an array start. 1475 class ArrayData : public ProfileData { 1476 protected: 1477 friend class DataLayout; 1478 1479 enum { 1480 array_len_off_set, 1481 array_start_off_set 1482 }; 1483 1484 uint array_uint_at(int index) const { 1485 int aindex = index + array_start_off_set; 1486 return uint_at(aindex); 1487 } 1488 int array_int_at(int index) const { 1489 int aindex = index + array_start_off_set; 1490 return int_at(aindex); 1491 } 1492 oop array_oop_at(int index) const { 1493 int aindex = index + array_start_off_set; 1494 return oop_at(aindex); 1495 } 1496 void array_set_int_at(int index, int value) { 1497 int aindex = index + array_start_off_set; 1498 set_int_at(aindex, value); 1499 } 1500 1501 // Code generation support for subclasses. 1502 static ByteSize array_element_offset(int index) { 1503 return cell_offset(array_start_off_set + index); 1504 } 1505 1506 public: 1507 ArrayData(DataLayout* layout) : ProfileData(layout) {} 1508 1509 virtual bool is_ArrayData() const { return true; } 1510 1511 static int static_cell_count() { 1512 return -1; 1513 } 1514 1515 int array_len() const { 1516 return int_at_unchecked(array_len_off_set); 1517 } 1518 1519 virtual int cell_count() const { 1520 return array_len() + 1; 1521 } 1522 1523 // Code generation support 1524 static ByteSize array_len_offset() { 1525 return cell_offset(array_len_off_set); 1526 } 1527 static ByteSize array_start_offset() { 1528 return cell_offset(array_start_off_set); 1529 } 1530 }; 1531 1532 // MultiBranchData 1533 // 1534 // A MultiBranchData is used to access profiling information for 1535 // a multi-way branch (*switch bytecodes). It consists of a series 1536 // of (count, displacement) pairs, which count the number of times each 1537 // case was taken and specify the data displacment for each branch target. 1538 class MultiBranchData : public ArrayData { 1539 protected: 1540 enum { 1541 default_count_off_set, 1542 default_disaplacement_off_set, 1543 case_array_start 1544 }; 1545 enum { 1546 relative_count_off_set, 1547 relative_displacement_off_set, 1548 per_case_cell_count 1549 }; 1550 1551 void set_default_displacement(int displacement) { 1552 array_set_int_at(default_disaplacement_off_set, displacement); 1553 } 1554 void set_displacement_at(int index, int displacement) { 1555 array_set_int_at(case_array_start + 1556 index * per_case_cell_count + 1557 relative_displacement_off_set, 1558 displacement); 1559 } 1560 1561 public: 1562 MultiBranchData(DataLayout* layout) : ArrayData(layout) { 1563 assert(layout->tag() == DataLayout::multi_branch_data_tag, "wrong type"); 1564 } 1565 1566 virtual bool is_MultiBranchData() const { return true; } 1567 1568 static int compute_cell_count(BytecodeStream* stream); 1569 1570 int number_of_cases() const { 1571 int alen = array_len() - 2; // get rid of default case here. 1572 assert(alen % per_case_cell_count == 0, "must be even"); 1573 return (alen / per_case_cell_count); 1574 } 1575 1576 uint default_count() const { 1577 return array_uint_at(default_count_off_set); 1578 } 1579 int default_displacement() const { 1580 return array_int_at(default_disaplacement_off_set); 1581 } 1582 1583 uint count_at(int index) const { 1584 return array_uint_at(case_array_start + 1585 index * per_case_cell_count + 1586 relative_count_off_set); 1587 } 1588 int displacement_at(int index) const { 1589 return array_int_at(case_array_start + 1590 index * per_case_cell_count + 1591 relative_displacement_off_set); 1592 } 1593 1594 // Code generation support 1595 static ByteSize default_count_offset() { 1596 return array_element_offset(default_count_off_set); 1597 } 1598 static ByteSize default_displacement_offset() { 1599 return array_element_offset(default_disaplacement_off_set); 1600 } 1601 static ByteSize case_count_offset(int index) { 1602 return case_array_offset() + 1603 (per_case_size() * index) + 1604 relative_count_offset(); 1605 } 1606 static ByteSize case_array_offset() { 1607 return array_element_offset(case_array_start); 1608 } 1609 static ByteSize per_case_size() { 1610 return in_ByteSize(per_case_cell_count) * cell_size; 1611 } 1612 static ByteSize relative_count_offset() { 1613 return in_ByteSize(relative_count_off_set) * cell_size; 1614 } 1615 static ByteSize relative_displacement_offset() { 1616 return in_ByteSize(relative_displacement_off_set) * cell_size; 1617 } 1618 1619 // Specific initialization. 1620 void post_initialize(BytecodeStream* stream, MethodData* mdo); 1621 1622 #ifndef PRODUCT 1623 void print_data_on(outputStream* st) const; 1624 #endif 1625 }; 1626 1627 class ArgInfoData : public ArrayData { 1628 1629 public: 1630 ArgInfoData(DataLayout* layout) : ArrayData(layout) { 1631 assert(layout->tag() == DataLayout::arg_info_data_tag, "wrong type"); 1632 } 1633 1634 virtual bool is_ArgInfoData() const { return true; } 1635 1636 1637 int number_of_args() const { 1638 return array_len(); 1639 } 1640 1641 uint arg_modified(int arg) const { 1642 return array_uint_at(arg); 1643 } 1644 1645 void set_arg_modified(int arg, uint val) { 1646 array_set_int_at(arg, val); 1647 } 1648 1649 #ifndef PRODUCT 1650 void print_data_on(outputStream* st) const; 1651 #endif 1652 }; 1653 1654 // MethodData* 1655 // 1656 // A MethodData* holds information which has been collected about 1657 // a method. Its layout looks like this: 1658 // 1659 // ----------------------------- 1660 // | header | 1661 // | klass | 1662 // ----------------------------- 1663 // | method | 1664 // | size of the MethodData* | 1665 // ----------------------------- 1666 // | Data entries... | 1667 // | (variable size) | 1668 // | | 1669 // . . 1670 // . . 1671 // . . 1672 // | | 1673 // ----------------------------- 1674 // 1675 // The data entry area is a heterogeneous array of DataLayouts. Each 1676 // DataLayout in the array corresponds to a specific bytecode in the 1677 // method. The entries in the array are sorted by the corresponding 1678 // bytecode. Access to the data is via resource-allocated ProfileData, 1679 // which point to the underlying blocks of DataLayout structures. 1680 // 1681 // During interpretation, if profiling in enabled, the interpreter 1682 // maintains a method data pointer (mdp), which points at the entry 1683 // in the array corresponding to the current bci. In the course of 1684 // intepretation, when a bytecode is encountered that has profile data 1685 // associated with it, the entry pointed to by mdp is updated, then the 1686 // mdp is adjusted to point to the next appropriate DataLayout. If mdp 1687 // is NULL to begin with, the interpreter assumes that the current method 1688 // is not (yet) being profiled. 1689 // 1690 // In MethodData* parlance, "dp" is a "data pointer", the actual address 1691 // of a DataLayout element. A "di" is a "data index", the offset in bytes 1692 // from the base of the data entry array. A "displacement" is the byte offset 1693 // in certain ProfileData objects that indicate the amount the mdp must be 1694 // adjusted in the event of a change in control flow. 1695 // 1696 1697 class MethodData : public Metadata { 1698 friend class VMStructs; 1699 private: 1700 friend class ProfileData; 1701 1702 // Back pointer to the Method* 1703 Method* _method; 1704 1705 // Size of this oop in bytes 1706 int _size; 1707 1708 // Cached hint for bci_to_dp and bci_to_data 1709 int _hint_di; 1710 1711 MethodData(methodHandle method, int size, TRAPS); 1712 public: 1713 static MethodData* allocate(ClassLoaderData* loader_data, methodHandle method, TRAPS); 1714 MethodData() {}; // For ciMethodData 1715 1716 bool is_methodData() const volatile { return true; } 1717 1718 // Whole-method sticky bits and flags 1719 enum { 1720 _trap_hist_limit = 17, // decoupled from Deoptimization::Reason_LIMIT 1721 _trap_hist_mask = max_jubyte, 1722 _extra_data_count = 4 // extra DataLayout headers, for trap history 1723 }; // Public flag values 1724 private: 1725 uint _nof_decompiles; // count of all nmethod removals 1726 uint _nof_overflow_recompiles; // recompile count, excluding recomp. bits 1727 uint _nof_overflow_traps; // trap count, excluding _trap_hist 1728 union { 1729 intptr_t _align; 1730 u1 _array[_trap_hist_limit]; 1731 } _trap_hist; 1732 1733 // Support for interprocedural escape analysis, from Thomas Kotzmann. 1734 intx _eflags; // flags on escape information 1735 intx _arg_local; // bit set of non-escaping arguments 1736 intx _arg_stack; // bit set of stack-allocatable arguments 1737 intx _arg_returned; // bit set of returned arguments 1738 1739 int _creation_mileage; // method mileage at MDO creation 1740 1741 // How many invocations has this MDO seen? 1742 // These counters are used to determine the exact age of MDO. 1743 // We need those because in tiered a method can be concurrently 1744 // executed at different levels. 1745 InvocationCounter _invocation_counter; 1746 // Same for backedges. 1747 InvocationCounter _backedge_counter; 1748 // Counter values at the time profiling started. 1749 int _invocation_counter_start; 1750 int _backedge_counter_start; 1751 // Number of loops and blocks is computed when compiling the first 1752 // time with C1. It is used to determine if method is trivial. 1753 short _num_loops; 1754 short _num_blocks; 1755 // Highest compile level this method has ever seen. 1756 u1 _highest_comp_level; 1757 // Same for OSR level 1758 u1 _highest_osr_comp_level; 1759 // Does this method contain anything worth profiling? 1760 bool _would_profile; 1761 1762 // Size of _data array in bytes. (Excludes header and extra_data fields.) 1763 int _data_size; 1764 1765 // Beginning of the data entries 1766 intptr_t _data[1]; 1767 1768 // Helper for size computation 1769 static int compute_data_size(BytecodeStream* stream); 1770 static int bytecode_cell_count(Bytecodes::Code code); 1771 enum { no_profile_data = -1, variable_cell_count = -2 }; 1772 1773 // Helper for initialization 1774 DataLayout* data_layout_at(int data_index) const { 1775 assert(data_index % sizeof(intptr_t) == 0, "unaligned"); 1776 return (DataLayout*) (((address)_data) + data_index); 1777 } 1778 1779 // Initialize an individual data segment. Returns the size of 1780 // the segment in bytes. 1781 int initialize_data(BytecodeStream* stream, int data_index); 1782 1783 // Helper for data_at 1784 DataLayout* limit_data_position() const { 1785 return (DataLayout*)((address)data_base() + _data_size); 1786 } 1787 bool out_of_bounds(int data_index) const { 1788 return data_index >= data_size(); 1789 } 1790 1791 // Give each of the data entries a chance to perform specific 1792 // data initialization. 1793 void post_initialize(BytecodeStream* stream); 1794 1795 // hint accessors 1796 int hint_di() const { return _hint_di; } 1797 void set_hint_di(int di) { 1798 assert(!out_of_bounds(di), "hint_di out of bounds"); 1799 _hint_di = di; 1800 } 1801 ProfileData* data_before(int bci) { 1802 // avoid SEGV on this edge case 1803 if (data_size() == 0) 1804 return NULL; 1805 int hint = hint_di(); 1806 if (data_layout_at(hint)->bci() <= bci) 1807 return data_at(hint); 1808 return first_data(); 1809 } 1810 1811 // What is the index of the first data entry? 1812 int first_di() const { return 0; } 1813 1814 // Find or create an extra ProfileData: 1815 ProfileData* bci_to_extra_data(int bci, bool create_if_missing); 1816 1817 // return the argument info cell 1818 ArgInfoData *arg_info(); 1819 1820 enum { 1821 no_type_profile = 0, 1822 type_profile_jsr292 = 1, 1823 type_profile_all = 2 1824 }; 1825 1826 static bool profile_jsr292(methodHandle m, int bci); 1827 static int profile_arguments_flag(); 1828 static bool profile_arguments_jsr292_only(); 1829 static bool profile_all_arguments(); 1830 static bool profile_arguments_for_invoke(methodHandle m, int bci); 1831 static int profile_return_flag(); 1832 static bool profile_return_jsr292_only(); 1833 static bool profile_all_return(); 1834 static bool profile_return_for_invoke(methodHandle m, int bci); 1835 1836 public: 1837 static int header_size() { 1838 return sizeof(MethodData)/wordSize; 1839 } 1840 1841 // Compute the size of a MethodData* before it is created. 1842 static int compute_allocation_size_in_bytes(methodHandle method); 1843 static int compute_allocation_size_in_words(methodHandle method); 1844 static int compute_extra_data_count(int data_size, int empty_bc_count); 1845 1846 // Determine if a given bytecode can have profile information. 1847 static bool bytecode_has_profile(Bytecodes::Code code) { 1848 return bytecode_cell_count(code) != no_profile_data; 1849 } 1850 1851 // reset into original state 1852 void init(); 1853 1854 // My size 1855 int size_in_bytes() const { return _size; } 1856 int size() const { return align_object_size(align_size_up(_size, BytesPerWord)/BytesPerWord); } 1857 #if INCLUDE_SERVICES 1858 void collect_statistics(KlassSizeStats *sz) const; 1859 #endif 1860 1861 int creation_mileage() const { return _creation_mileage; } 1862 void set_creation_mileage(int x) { _creation_mileage = x; } 1863 1864 int invocation_count() { 1865 if (invocation_counter()->carry()) { 1866 return InvocationCounter::count_limit; 1867 } 1868 return invocation_counter()->count(); 1869 } 1870 int backedge_count() { 1871 if (backedge_counter()->carry()) { 1872 return InvocationCounter::count_limit; 1873 } 1874 return backedge_counter()->count(); 1875 } 1876 1877 int invocation_count_start() { 1878 if (invocation_counter()->carry()) { 1879 return 0; 1880 } 1881 return _invocation_counter_start; 1882 } 1883 1884 int backedge_count_start() { 1885 if (backedge_counter()->carry()) { 1886 return 0; 1887 } 1888 return _backedge_counter_start; 1889 } 1890 1891 int invocation_count_delta() { return invocation_count() - invocation_count_start(); } 1892 int backedge_count_delta() { return backedge_count() - backedge_count_start(); } 1893 1894 void reset_start_counters() { 1895 _invocation_counter_start = invocation_count(); 1896 _backedge_counter_start = backedge_count(); 1897 } 1898 1899 InvocationCounter* invocation_counter() { return &_invocation_counter; } 1900 InvocationCounter* backedge_counter() { return &_backedge_counter; } 1901 1902 void set_would_profile(bool p) { _would_profile = p; } 1903 bool would_profile() const { return _would_profile; } 1904 1905 int highest_comp_level() const { return _highest_comp_level; } 1906 void set_highest_comp_level(int level) { _highest_comp_level = level; } 1907 int highest_osr_comp_level() const { return _highest_osr_comp_level; } 1908 void set_highest_osr_comp_level(int level) { _highest_osr_comp_level = level; } 1909 1910 int num_loops() const { return _num_loops; } 1911 void set_num_loops(int n) { _num_loops = n; } 1912 int num_blocks() const { return _num_blocks; } 1913 void set_num_blocks(int n) { _num_blocks = n; } 1914 1915 bool is_mature() const; // consult mileage and ProfileMaturityPercentage 1916 static int mileage_of(Method* m); 1917 1918 // Support for interprocedural escape analysis, from Thomas Kotzmann. 1919 enum EscapeFlag { 1920 estimated = 1 << 0, 1921 return_local = 1 << 1, 1922 return_allocated = 1 << 2, 1923 allocated_escapes = 1 << 3, 1924 unknown_modified = 1 << 4 1925 }; 1926 1927 intx eflags() { return _eflags; } 1928 intx arg_local() { return _arg_local; } 1929 intx arg_stack() { return _arg_stack; } 1930 intx arg_returned() { return _arg_returned; } 1931 uint arg_modified(int a) { ArgInfoData *aid = arg_info(); 1932 assert(aid != NULL, "arg_info must be not null"); 1933 assert(a >= 0 && a < aid->number_of_args(), "valid argument number"); 1934 return aid->arg_modified(a); } 1935 1936 void set_eflags(intx v) { _eflags = v; } 1937 void set_arg_local(intx v) { _arg_local = v; } 1938 void set_arg_stack(intx v) { _arg_stack = v; } 1939 void set_arg_returned(intx v) { _arg_returned = v; } 1940 void set_arg_modified(int a, uint v) { ArgInfoData *aid = arg_info(); 1941 assert(aid != NULL, "arg_info must be not null"); 1942 assert(a >= 0 && a < aid->number_of_args(), "valid argument number"); 1943 aid->set_arg_modified(a, v); } 1944 1945 void clear_escape_info() { _eflags = _arg_local = _arg_stack = _arg_returned = 0; } 1946 1947 // Location and size of data area 1948 address data_base() const { 1949 return (address) _data; 1950 } 1951 int data_size() const { 1952 return _data_size; 1953 } 1954 1955 // Accessors 1956 Method* method() const { return _method; } 1957 1958 // Get the data at an arbitrary (sort of) data index. 1959 ProfileData* data_at(int data_index) const; 1960 1961 // Walk through the data in order. 1962 ProfileData* first_data() const { return data_at(first_di()); } 1963 ProfileData* next_data(ProfileData* current) const; 1964 bool is_valid(ProfileData* current) const { return current != NULL; } 1965 1966 // Convert a dp (data pointer) to a di (data index). 1967 int dp_to_di(address dp) const { 1968 return dp - ((address)_data); 1969 } 1970 1971 address di_to_dp(int di) { 1972 return (address)data_layout_at(di); 1973 } 1974 1975 // bci to di/dp conversion. 1976 address bci_to_dp(int bci); 1977 int bci_to_di(int bci) { 1978 return dp_to_di(bci_to_dp(bci)); 1979 } 1980 1981 // Get the data at an arbitrary bci, or NULL if there is none. 1982 ProfileData* bci_to_data(int bci); 1983 1984 // Same, but try to create an extra_data record if one is needed: 1985 ProfileData* allocate_bci_to_data(int bci) { 1986 ProfileData* data = bci_to_data(bci); 1987 return (data != NULL) ? data : bci_to_extra_data(bci, true); 1988 } 1989 1990 // Add a handful of extra data records, for trap tracking. 1991 DataLayout* extra_data_base() const { return limit_data_position(); } 1992 DataLayout* extra_data_limit() const { return (DataLayout*)((address)this + size_in_bytes()); } 1993 int extra_data_size() const { return (address)extra_data_limit() 1994 - (address)extra_data_base(); } 1995 static DataLayout* next_extra(DataLayout* dp) { return (DataLayout*)((address)dp + in_bytes(DataLayout::cell_offset(0))); } 1996 1997 // Return (uint)-1 for overflow. 1998 uint trap_count(int reason) const { 1999 assert((uint)reason < _trap_hist_limit, "oob"); 2000 return (int)((_trap_hist._array[reason]+1) & _trap_hist_mask) - 1; 2001 } 2002 // For loops: 2003 static uint trap_reason_limit() { return _trap_hist_limit; } 2004 static uint trap_count_limit() { return _trap_hist_mask; } 2005 uint inc_trap_count(int reason) { 2006 // Count another trap, anywhere in this method. 2007 assert(reason >= 0, "must be single trap"); 2008 if ((uint)reason < _trap_hist_limit) { 2009 uint cnt1 = 1 + _trap_hist._array[reason]; 2010 if ((cnt1 & _trap_hist_mask) != 0) { // if no counter overflow... 2011 _trap_hist._array[reason] = cnt1; 2012 return cnt1; 2013 } else { 2014 return _trap_hist_mask + (++_nof_overflow_traps); 2015 } 2016 } else { 2017 // Could not represent the count in the histogram. 2018 return (++_nof_overflow_traps); 2019 } 2020 } 2021 2022 uint overflow_trap_count() const { 2023 return _nof_overflow_traps; 2024 } 2025 uint overflow_recompile_count() const { 2026 return _nof_overflow_recompiles; 2027 } 2028 void inc_overflow_recompile_count() { 2029 _nof_overflow_recompiles += 1; 2030 } 2031 uint decompile_count() const { 2032 return _nof_decompiles; 2033 } 2034 void inc_decompile_count() { 2035 _nof_decompiles += 1; 2036 if (decompile_count() > (uint)PerMethodRecompilationCutoff) { 2037 method()->set_not_compilable(CompLevel_full_optimization, true, "decompile_count > PerMethodRecompilationCutoff"); 2038 } 2039 } 2040 2041 // Support for code generation 2042 static ByteSize data_offset() { 2043 return byte_offset_of(MethodData, _data[0]); 2044 } 2045 2046 static ByteSize invocation_counter_offset() { 2047 return byte_offset_of(MethodData, _invocation_counter); 2048 } 2049 static ByteSize backedge_counter_offset() { 2050 return byte_offset_of(MethodData, _backedge_counter); 2051 } 2052 2053 // Deallocation support - no pointer fields to deallocate 2054 void deallocate_contents(ClassLoaderData* loader_data) {} 2055 2056 // GC support 2057 void set_size(int object_size_in_bytes) { _size = object_size_in_bytes; } 2058 2059 // Printing 2060 #ifndef PRODUCT 2061 void print_on (outputStream* st) const; 2062 #endif 2063 void print_value_on(outputStream* st) const; 2064 2065 #ifndef PRODUCT 2066 // printing support for method data 2067 void print_data_on(outputStream* st) const; 2068 #endif 2069 2070 const char* internal_name() const { return "{method data}"; } 2071 2072 // verification 2073 void verify_on(outputStream* st); 2074 void verify_data_on(outputStream* st); 2075 2076 static bool profile_arguments(); 2077 static bool profile_return(); 2078 }; 2079 2080 #endif // SHARE_VM_OOPS_METHODDATAOOP_HPP