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