duke@435: /*
acorn@4497:  * Copyright (c) 2000, 2013, Oracle and/or its affiliates. All rights reserved.
duke@435:  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
duke@435:  *
duke@435:  * This code is free software; you can redistribute it and/or modify it
duke@435:  * under the terms of the GNU General Public License version 2 only, as
duke@435:  * published by the Free Software Foundation.
duke@435:  *
duke@435:  * This code is distributed in the hope that it will be useful, but WITHOUT
duke@435:  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
duke@435:  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
duke@435:  * version 2 for more details (a copy is included in the LICENSE file that
duke@435:  * accompanied this code).
duke@435:  *
duke@435:  * You should have received a copy of the GNU General Public License version
duke@435:  * 2 along with this work; if not, write to the Free Software Foundation,
duke@435:  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
duke@435:  *
trims@1907:  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
trims@1907:  * or visit www.oracle.com if you need additional information or have any
trims@1907:  * questions.
duke@435:  *
duke@435:  */
duke@435: 
stefank@2314: #include "precompiled.hpp"
stefank@2314: #include "classfile/systemDictionary.hpp"
stefank@2314: #include "interpreter/bytecode.hpp"
stefank@2314: #include "interpreter/bytecodeStream.hpp"
stefank@2314: #include "interpreter/linkResolver.hpp"
acorn@4497: #include "memory/heapInspection.hpp"
coleenp@4037: #include "oops/methodData.hpp"
coleenp@4037: #include "prims/jvmtiRedefineClasses.hpp"
stefank@2314: #include "runtime/compilationPolicy.hpp"
stefank@2314: #include "runtime/deoptimization.hpp"
stefank@2314: #include "runtime/handles.inline.hpp"
duke@435: 
duke@435: // ==================================================================
duke@435: // DataLayout
duke@435: //
duke@435: // Overlay for generic profiling data.
duke@435: 
duke@435: // Some types of data layouts need a length field.
duke@435: bool DataLayout::needs_array_len(u1 tag) {
kvn@480:   return (tag == multi_branch_data_tag) || (tag == arg_info_data_tag);
duke@435: }
duke@435: 
duke@435: // Perform generic initialization of the data.  More specific
duke@435: // initialization occurs in overrides of ProfileData::post_initialize.
duke@435: void DataLayout::initialize(u1 tag, u2 bci, int cell_count) {
duke@435:   _header._bits = (intptr_t)0;
duke@435:   _header._struct._tag = tag;
duke@435:   _header._struct._bci = bci;
duke@435:   for (int i = 0; i < cell_count; i++) {
duke@435:     set_cell_at(i, (intptr_t)0);
duke@435:   }
duke@435:   if (needs_array_len(tag)) {
duke@435:     set_cell_at(ArrayData::array_len_off_set, cell_count - 1); // -1 for header.
duke@435:   }
duke@435: }
duke@435: 
coleenp@4037: void DataLayout::clean_weak_klass_links(BoolObjectClosure* cl) {
ysr@1376:   ResourceMark m;
coleenp@4037:   data_in()->clean_weak_klass_links(cl);
ysr@1376: }
ysr@1376: 
ysr@1376: 
duke@435: // ==================================================================
duke@435: // ProfileData
duke@435: //
duke@435: // A ProfileData object is created to refer to a section of profiling
duke@435: // data in a structured way.
duke@435: 
duke@435: // Constructor for invalid ProfileData.
duke@435: ProfileData::ProfileData() {
duke@435:   _data = NULL;
duke@435: }
duke@435: 
duke@435: #ifndef PRODUCT
duke@435: void ProfileData::print_shared(outputStream* st, const char* name) {
duke@435:   st->print("bci: %d", bci());
duke@435:   st->fill_to(tab_width_one);
duke@435:   st->print("%s", name);
duke@435:   tab(st);
duke@435:   int trap = trap_state();
duke@435:   if (trap != 0) {
duke@435:     char buf[100];
duke@435:     st->print("trap(%s) ", Deoptimization::format_trap_state(buf, sizeof(buf), trap));
duke@435:   }
duke@435:   int flags = data()->flags();
duke@435:   if (flags != 0)
duke@435:     st->print("flags(%d) ", flags);
duke@435: }
duke@435: 
duke@435: void ProfileData::tab(outputStream* st) {
duke@435:   st->fill_to(tab_width_two);
duke@435: }
duke@435: #endif // !PRODUCT
duke@435: 
duke@435: // ==================================================================
duke@435: // BitData
duke@435: //
duke@435: // A BitData corresponds to a one-bit flag.  This is used to indicate
duke@435: // whether a checkcast bytecode has seen a null value.
duke@435: 
duke@435: 
duke@435: #ifndef PRODUCT
duke@435: void BitData::print_data_on(outputStream* st) {
duke@435:   print_shared(st, "BitData");
duke@435: }
duke@435: #endif // !PRODUCT
duke@435: 
duke@435: // ==================================================================
duke@435: // CounterData
duke@435: //
duke@435: // A CounterData corresponds to a simple counter.
duke@435: 
duke@435: #ifndef PRODUCT
duke@435: void CounterData::print_data_on(outputStream* st) {
duke@435:   print_shared(st, "CounterData");
duke@435:   st->print_cr("count(%u)", count());
duke@435: }
duke@435: #endif // !PRODUCT
duke@435: 
duke@435: // ==================================================================
duke@435: // JumpData
duke@435: //
duke@435: // A JumpData is used to access profiling information for a direct
duke@435: // branch.  It is a counter, used for counting the number of branches,
duke@435: // plus a data displacement, used for realigning the data pointer to
duke@435: // the corresponding target bci.
duke@435: 
coleenp@4037: void JumpData::post_initialize(BytecodeStream* stream, MethodData* mdo) {
duke@435:   assert(stream->bci() == bci(), "wrong pos");
duke@435:   int target;
duke@435:   Bytecodes::Code c = stream->code();
duke@435:   if (c == Bytecodes::_goto_w || c == Bytecodes::_jsr_w) {
duke@435:     target = stream->dest_w();
duke@435:   } else {
duke@435:     target = stream->dest();
duke@435:   }
duke@435:   int my_di = mdo->dp_to_di(dp());
duke@435:   int target_di = mdo->bci_to_di(target);
duke@435:   int offset = target_di - my_di;
duke@435:   set_displacement(offset);
duke@435: }
duke@435: 
duke@435: #ifndef PRODUCT
duke@435: void JumpData::print_data_on(outputStream* st) {
duke@435:   print_shared(st, "JumpData");
duke@435:   st->print_cr("taken(%u) displacement(%d)", taken(), displacement());
duke@435: }
duke@435: #endif // !PRODUCT
duke@435: 
duke@435: // ==================================================================
duke@435: // ReceiverTypeData
duke@435: //
duke@435: // A ReceiverTypeData is used to access profiling information about a
duke@435: // dynamic type check.  It consists of a counter which counts the total times
coleenp@4037: // that the check is reached, and a series of (Klass*, count) pairs
duke@435: // which are used to store a type profile for the receiver of the check.
duke@435: 
coleenp@4037: void ReceiverTypeData::clean_weak_klass_links(BoolObjectClosure* is_alive_cl) {
ysr@1376:     for (uint row = 0; row < row_limit(); row++) {
coleenp@4037:     Klass* p = receiver(row);
coleenp@4037:     if (p != NULL && !p->is_loader_alive(is_alive_cl)) {
ysr@1376:       clear_row(row);
ysr@1376:     }
ysr@1376:   }
ysr@1376: }
ysr@1376: 
duke@435: #ifndef PRODUCT
duke@435: void ReceiverTypeData::print_receiver_data_on(outputStream* st) {
duke@435:   uint row;
duke@435:   int entries = 0;
duke@435:   for (row = 0; row < row_limit(); row++) {
duke@435:     if (receiver(row) != NULL)  entries++;
duke@435:   }
duke@435:   st->print_cr("count(%u) entries(%u)", count(), entries);
iveresov@2138:   int total = count();
iveresov@2138:   for (row = 0; row < row_limit(); row++) {
iveresov@2138:     if (receiver(row) != NULL) {
iveresov@2138:       total += receiver_count(row);
iveresov@2138:     }
iveresov@2138:   }
duke@435:   for (row = 0; row < row_limit(); row++) {
duke@435:     if (receiver(row) != NULL) {
duke@435:       tab(st);
duke@435:       receiver(row)->print_value_on(st);
iveresov@2138:       st->print_cr("(%u %4.2f)", receiver_count(row), (float) receiver_count(row) / (float) total);
duke@435:     }
duke@435:   }
duke@435: }
duke@435: void ReceiverTypeData::print_data_on(outputStream* st) {
duke@435:   print_shared(st, "ReceiverTypeData");
duke@435:   print_receiver_data_on(st);
duke@435: }
duke@435: void VirtualCallData::print_data_on(outputStream* st) {
duke@435:   print_shared(st, "VirtualCallData");
duke@435:   print_receiver_data_on(st);
duke@435: }
duke@435: #endif // !PRODUCT
duke@435: 
duke@435: // ==================================================================
duke@435: // RetData
duke@435: //
duke@435: // A RetData is used to access profiling information for a ret bytecode.
duke@435: // It is composed of a count of the number of times that the ret has
duke@435: // been executed, followed by a series of triples of the form
duke@435: // (bci, count, di) which count the number of times that some bci was the
duke@435: // target of the ret and cache a corresponding displacement.
duke@435: 
coleenp@4037: void RetData::post_initialize(BytecodeStream* stream, MethodData* mdo) {
duke@435:   for (uint row = 0; row < row_limit(); row++) {
duke@435:     set_bci_displacement(row, -1);
duke@435:     set_bci(row, no_bci);
duke@435:   }
duke@435:   // release so other threads see a consistent state.  bci is used as
duke@435:   // a valid flag for bci_displacement.
duke@435:   OrderAccess::release();
duke@435: }
duke@435: 
duke@435: // This routine needs to atomically update the RetData structure, so the
duke@435: // caller needs to hold the RetData_lock before it gets here.  Since taking
duke@435: // the lock can block (and allow GC) and since RetData is a ProfileData is a
duke@435: // wrapper around a derived oop, taking the lock in _this_ method will
duke@435: // basically cause the 'this' pointer's _data field to contain junk after the
duke@435: // lock.  We require the caller to take the lock before making the ProfileData
duke@435: // structure.  Currently the only caller is InterpreterRuntime::update_mdp_for_ret
coleenp@4037: address RetData::fixup_ret(int return_bci, MethodData* h_mdo) {
duke@435:   // First find the mdp which corresponds to the return bci.
duke@435:   address mdp = h_mdo->bci_to_dp(return_bci);
duke@435: 
duke@435:   // Now check to see if any of the cache slots are open.
duke@435:   for (uint row = 0; row < row_limit(); row++) {
duke@435:     if (bci(row) == no_bci) {
duke@435:       set_bci_displacement(row, mdp - dp());
duke@435:       set_bci_count(row, DataLayout::counter_increment);
duke@435:       // Barrier to ensure displacement is written before the bci; allows
duke@435:       // the interpreter to read displacement without fear of race condition.
duke@435:       release_set_bci(row, return_bci);
duke@435:       break;
duke@435:     }
duke@435:   }
duke@435:   return mdp;
duke@435: }
duke@435: 
duke@435: 
duke@435: #ifndef PRODUCT
duke@435: void RetData::print_data_on(outputStream* st) {
duke@435:   print_shared(st, "RetData");
duke@435:   uint row;
duke@435:   int entries = 0;
duke@435:   for (row = 0; row < row_limit(); row++) {
duke@435:     if (bci(row) != no_bci)  entries++;
duke@435:   }
duke@435:   st->print_cr("count(%u) entries(%u)", count(), entries);
duke@435:   for (row = 0; row < row_limit(); row++) {
duke@435:     if (bci(row) != no_bci) {
duke@435:       tab(st);
duke@435:       st->print_cr("bci(%d: count(%u) displacement(%d))",
duke@435:                    bci(row), bci_count(row), bci_displacement(row));
duke@435:     }
duke@435:   }
duke@435: }
duke@435: #endif // !PRODUCT
duke@435: 
duke@435: // ==================================================================
duke@435: // BranchData
duke@435: //
duke@435: // A BranchData is used to access profiling data for a two-way branch.
duke@435: // It consists of taken and not_taken counts as well as a data displacement
duke@435: // for the taken case.
duke@435: 
coleenp@4037: void BranchData::post_initialize(BytecodeStream* stream, MethodData* mdo) {
duke@435:   assert(stream->bci() == bci(), "wrong pos");
duke@435:   int target = stream->dest();
duke@435:   int my_di = mdo->dp_to_di(dp());
duke@435:   int target_di = mdo->bci_to_di(target);
duke@435:   int offset = target_di - my_di;
duke@435:   set_displacement(offset);
duke@435: }
duke@435: 
duke@435: #ifndef PRODUCT
duke@435: void BranchData::print_data_on(outputStream* st) {
duke@435:   print_shared(st, "BranchData");
duke@435:   st->print_cr("taken(%u) displacement(%d)",
duke@435:                taken(), displacement());
duke@435:   tab(st);
duke@435:   st->print_cr("not taken(%u)", not_taken());
duke@435: }
duke@435: #endif
duke@435: 
duke@435: // ==================================================================
duke@435: // MultiBranchData
duke@435: //
duke@435: // A MultiBranchData is used to access profiling information for
duke@435: // a multi-way branch (*switch bytecodes).  It consists of a series
duke@435: // of (count, displacement) pairs, which count the number of times each
duke@435: // case was taken and specify the data displacment for each branch target.
duke@435: 
duke@435: int MultiBranchData::compute_cell_count(BytecodeStream* stream) {
duke@435:   int cell_count = 0;
duke@435:   if (stream->code() == Bytecodes::_tableswitch) {
never@2462:     Bytecode_tableswitch sw(stream->method()(), stream->bcp());
never@2462:     cell_count = 1 + per_case_cell_count * (1 + sw.length()); // 1 for default
duke@435:   } else {
never@2462:     Bytecode_lookupswitch sw(stream->method()(), stream->bcp());
never@2462:     cell_count = 1 + per_case_cell_count * (sw.number_of_pairs() + 1); // 1 for default
duke@435:   }
duke@435:   return cell_count;
duke@435: }
duke@435: 
duke@435: void MultiBranchData::post_initialize(BytecodeStream* stream,
coleenp@4037:                                       MethodData* mdo) {
duke@435:   assert(stream->bci() == bci(), "wrong pos");
duke@435:   int target;
duke@435:   int my_di;
duke@435:   int target_di;
duke@435:   int offset;
duke@435:   if (stream->code() == Bytecodes::_tableswitch) {
never@2462:     Bytecode_tableswitch sw(stream->method()(), stream->bcp());
never@2462:     int len = sw.length();
duke@435:     assert(array_len() == per_case_cell_count * (len + 1), "wrong len");
duke@435:     for (int count = 0; count < len; count++) {
never@2462:       target = sw.dest_offset_at(count) + bci();
duke@435:       my_di = mdo->dp_to_di(dp());
duke@435:       target_di = mdo->bci_to_di(target);
duke@435:       offset = target_di - my_di;
duke@435:       set_displacement_at(count, offset);
duke@435:     }
never@2462:     target = sw.default_offset() + bci();
duke@435:     my_di = mdo->dp_to_di(dp());
duke@435:     target_di = mdo->bci_to_di(target);
duke@435:     offset = target_di - my_di;
duke@435:     set_default_displacement(offset);
duke@435: 
duke@435:   } else {
never@2462:     Bytecode_lookupswitch sw(stream->method()(), stream->bcp());
never@2462:     int npairs = sw.number_of_pairs();
duke@435:     assert(array_len() == per_case_cell_count * (npairs + 1), "wrong len");
duke@435:     for (int count = 0; count < npairs; count++) {
never@2462:       LookupswitchPair pair = sw.pair_at(count);
never@2462:       target = pair.offset() + bci();
duke@435:       my_di = mdo->dp_to_di(dp());
duke@435:       target_di = mdo->bci_to_di(target);
duke@435:       offset = target_di - my_di;
duke@435:       set_displacement_at(count, offset);
duke@435:     }
never@2462:     target = sw.default_offset() + bci();
duke@435:     my_di = mdo->dp_to_di(dp());
duke@435:     target_di = mdo->bci_to_di(target);
duke@435:     offset = target_di - my_di;
duke@435:     set_default_displacement(offset);
duke@435:   }
duke@435: }
duke@435: 
duke@435: #ifndef PRODUCT
duke@435: void MultiBranchData::print_data_on(outputStream* st) {
duke@435:   print_shared(st, "MultiBranchData");
duke@435:   st->print_cr("default_count(%u) displacement(%d)",
duke@435:                default_count(), default_displacement());
duke@435:   int cases = number_of_cases();
duke@435:   for (int i = 0; i < cases; i++) {
duke@435:     tab(st);
duke@435:     st->print_cr("count(%u) displacement(%d)",
duke@435:                  count_at(i), displacement_at(i));
duke@435:   }
duke@435: }
duke@435: #endif
duke@435: 
kvn@480: #ifndef PRODUCT
kvn@480: void ArgInfoData::print_data_on(outputStream* st) {
kvn@480:   print_shared(st, "ArgInfoData");
kvn@480:   int nargs = number_of_args();
kvn@480:   for (int i = 0; i < nargs; i++) {
kvn@480:     st->print("  0x%x", arg_modified(i));
kvn@480:   }
kvn@480:   st->cr();
kvn@480: }
kvn@480: 
kvn@480: #endif
duke@435: // ==================================================================
coleenp@4037: // MethodData*
duke@435: //
coleenp@4037: // A MethodData* holds information which has been collected about
duke@435: // a method.
duke@435: 
coleenp@4037: MethodData* MethodData::allocate(ClassLoaderData* loader_data, methodHandle method, TRAPS) {
coleenp@4037:   int size = MethodData::compute_allocation_size_in_words(method);
coleenp@4037: 
coleenp@4037:   return new (loader_data, size, false, THREAD) MethodData(method(), size, CHECK_NULL);
coleenp@4037: }
coleenp@4037: 
coleenp@4037: int MethodData::bytecode_cell_count(Bytecodes::Code code) {
roland@4860: #if defined(COMPILER1) && !defined(COMPILER2)
roland@4860:   return no_profile_data;
roland@4860: #else
duke@435:   switch (code) {
duke@435:   case Bytecodes::_checkcast:
duke@435:   case Bytecodes::_instanceof:
duke@435:   case Bytecodes::_aastore:
duke@435:     if (TypeProfileCasts) {
duke@435:       return ReceiverTypeData::static_cell_count();
duke@435:     } else {
duke@435:       return BitData::static_cell_count();
duke@435:     }
duke@435:   case Bytecodes::_invokespecial:
duke@435:   case Bytecodes::_invokestatic:
duke@435:     return CounterData::static_cell_count();
duke@435:   case Bytecodes::_goto:
duke@435:   case Bytecodes::_goto_w:
duke@435:   case Bytecodes::_jsr:
duke@435:   case Bytecodes::_jsr_w:
duke@435:     return JumpData::static_cell_count();
duke@435:   case Bytecodes::_invokevirtual:
duke@435:   case Bytecodes::_invokeinterface:
duke@435:     return VirtualCallData::static_cell_count();
jrose@1161:   case Bytecodes::_invokedynamic:
jrose@1161:     return CounterData::static_cell_count();
duke@435:   case Bytecodes::_ret:
duke@435:     return RetData::static_cell_count();
duke@435:   case Bytecodes::_ifeq:
duke@435:   case Bytecodes::_ifne:
duke@435:   case Bytecodes::_iflt:
duke@435:   case Bytecodes::_ifge:
duke@435:   case Bytecodes::_ifgt:
duke@435:   case Bytecodes::_ifle:
duke@435:   case Bytecodes::_if_icmpeq:
duke@435:   case Bytecodes::_if_icmpne:
duke@435:   case Bytecodes::_if_icmplt:
duke@435:   case Bytecodes::_if_icmpge:
duke@435:   case Bytecodes::_if_icmpgt:
duke@435:   case Bytecodes::_if_icmple:
duke@435:   case Bytecodes::_if_acmpeq:
duke@435:   case Bytecodes::_if_acmpne:
duke@435:   case Bytecodes::_ifnull:
duke@435:   case Bytecodes::_ifnonnull:
duke@435:     return BranchData::static_cell_count();
duke@435:   case Bytecodes::_lookupswitch:
duke@435:   case Bytecodes::_tableswitch:
duke@435:     return variable_cell_count;
duke@435:   }
duke@435:   return no_profile_data;
roland@4860: #endif
duke@435: }
duke@435: 
duke@435: // Compute the size of the profiling information corresponding to
duke@435: // the current bytecode.
coleenp@4037: int MethodData::compute_data_size(BytecodeStream* stream) {
duke@435:   int cell_count = bytecode_cell_count(stream->code());
duke@435:   if (cell_count == no_profile_data) {
duke@435:     return 0;
duke@435:   }
duke@435:   if (cell_count == variable_cell_count) {
duke@435:     cell_count = MultiBranchData::compute_cell_count(stream);
duke@435:   }
duke@435:   // Note:  cell_count might be zero, meaning that there is just
duke@435:   //        a DataLayout header, with no extra cells.
duke@435:   assert(cell_count >= 0, "sanity");
duke@435:   return DataLayout::compute_size_in_bytes(cell_count);
duke@435: }
duke@435: 
coleenp@4037: int MethodData::compute_extra_data_count(int data_size, int empty_bc_count) {
duke@435:   if (ProfileTraps) {
duke@435:     // Assume that up to 3% of BCIs with no MDP will need to allocate one.
duke@435:     int extra_data_count = (uint)(empty_bc_count * 3) / 128 + 1;
duke@435:     // If the method is large, let the extra BCIs grow numerous (to ~1%).
duke@435:     int one_percent_of_data
duke@435:       = (uint)data_size / (DataLayout::header_size_in_bytes()*128);
duke@435:     if (extra_data_count < one_percent_of_data)
duke@435:       extra_data_count = one_percent_of_data;
duke@435:     if (extra_data_count > empty_bc_count)
duke@435:       extra_data_count = empty_bc_count;  // no need for more
duke@435:     return extra_data_count;
duke@435:   } else {
duke@435:     return 0;
duke@435:   }
duke@435: }
duke@435: 
coleenp@4037: // Compute the size of the MethodData* necessary to store
duke@435: // profiling information about a given method.  Size is in bytes.
coleenp@4037: int MethodData::compute_allocation_size_in_bytes(methodHandle method) {
duke@435:   int data_size = 0;
duke@435:   BytecodeStream stream(method);
duke@435:   Bytecodes::Code c;
duke@435:   int empty_bc_count = 0;  // number of bytecodes lacking data
duke@435:   while ((c = stream.next()) >= 0) {
duke@435:     int size_in_bytes = compute_data_size(&stream);
duke@435:     data_size += size_in_bytes;
duke@435:     if (size_in_bytes == 0)  empty_bc_count += 1;
duke@435:   }
duke@435:   int object_size = in_bytes(data_offset()) + data_size;
duke@435: 
duke@435:   // Add some extra DataLayout cells (at least one) to track stray traps.
duke@435:   int extra_data_count = compute_extra_data_count(data_size, empty_bc_count);
duke@435:   object_size += extra_data_count * DataLayout::compute_size_in_bytes(0);
duke@435: 
kvn@480:   // Add a cell to record information about modified arguments.
kvn@480:   int arg_size = method->size_of_parameters();
kvn@480:   object_size += DataLayout::compute_size_in_bytes(arg_size+1);
duke@435:   return object_size;
duke@435: }
duke@435: 
coleenp@4037: // Compute the size of the MethodData* necessary to store
duke@435: // profiling information about a given method.  Size is in words
coleenp@4037: int MethodData::compute_allocation_size_in_words(methodHandle method) {
duke@435:   int byte_size = compute_allocation_size_in_bytes(method);
duke@435:   int word_size = align_size_up(byte_size, BytesPerWord) / BytesPerWord;
duke@435:   return align_object_size(word_size);
duke@435: }
duke@435: 
duke@435: // Initialize an individual data segment.  Returns the size of
duke@435: // the segment in bytes.
coleenp@4037: int MethodData::initialize_data(BytecodeStream* stream,
duke@435:                                        int data_index) {
roland@4860: #if defined(COMPILER1) && !defined(COMPILER2)
roland@4860:   return 0;
roland@4860: #else
duke@435:   int cell_count = -1;
duke@435:   int tag = DataLayout::no_tag;
duke@435:   DataLayout* data_layout = data_layout_at(data_index);
duke@435:   Bytecodes::Code c = stream->code();
duke@435:   switch (c) {
duke@435:   case Bytecodes::_checkcast:
duke@435:   case Bytecodes::_instanceof:
duke@435:   case Bytecodes::_aastore:
duke@435:     if (TypeProfileCasts) {
duke@435:       cell_count = ReceiverTypeData::static_cell_count();
duke@435:       tag = DataLayout::receiver_type_data_tag;
duke@435:     } else {
duke@435:       cell_count = BitData::static_cell_count();
duke@435:       tag = DataLayout::bit_data_tag;
duke@435:     }
duke@435:     break;
duke@435:   case Bytecodes::_invokespecial:
duke@435:   case Bytecodes::_invokestatic:
duke@435:     cell_count = CounterData::static_cell_count();
duke@435:     tag = DataLayout::counter_data_tag;
duke@435:     break;
duke@435:   case Bytecodes::_goto:
duke@435:   case Bytecodes::_goto_w:
duke@435:   case Bytecodes::_jsr:
duke@435:   case Bytecodes::_jsr_w:
duke@435:     cell_count = JumpData::static_cell_count();
duke@435:     tag = DataLayout::jump_data_tag;
duke@435:     break;
duke@435:   case Bytecodes::_invokevirtual:
duke@435:   case Bytecodes::_invokeinterface:
duke@435:     cell_count = VirtualCallData::static_cell_count();
duke@435:     tag = DataLayout::virtual_call_data_tag;
duke@435:     break;
jrose@1161:   case Bytecodes::_invokedynamic:
jrose@1161:     // %%% should make a type profile for any invokedynamic that takes a ref argument
jrose@1161:     cell_count = CounterData::static_cell_count();
jrose@1161:     tag = DataLayout::counter_data_tag;
jrose@1161:     break;
duke@435:   case Bytecodes::_ret:
duke@435:     cell_count = RetData::static_cell_count();
duke@435:     tag = DataLayout::ret_data_tag;
duke@435:     break;
duke@435:   case Bytecodes::_ifeq:
duke@435:   case Bytecodes::_ifne:
duke@435:   case Bytecodes::_iflt:
duke@435:   case Bytecodes::_ifge:
duke@435:   case Bytecodes::_ifgt:
duke@435:   case Bytecodes::_ifle:
duke@435:   case Bytecodes::_if_icmpeq:
duke@435:   case Bytecodes::_if_icmpne:
duke@435:   case Bytecodes::_if_icmplt:
duke@435:   case Bytecodes::_if_icmpge:
duke@435:   case Bytecodes::_if_icmpgt:
duke@435:   case Bytecodes::_if_icmple:
duke@435:   case Bytecodes::_if_acmpeq:
duke@435:   case Bytecodes::_if_acmpne:
duke@435:   case Bytecodes::_ifnull:
duke@435:   case Bytecodes::_ifnonnull:
duke@435:     cell_count = BranchData::static_cell_count();
duke@435:     tag = DataLayout::branch_data_tag;
duke@435:     break;
duke@435:   case Bytecodes::_lookupswitch:
duke@435:   case Bytecodes::_tableswitch:
duke@435:     cell_count = MultiBranchData::compute_cell_count(stream);
duke@435:     tag = DataLayout::multi_branch_data_tag;
duke@435:     break;
duke@435:   }
duke@435:   assert(tag == DataLayout::multi_branch_data_tag ||
duke@435:          cell_count == bytecode_cell_count(c), "cell counts must agree");
duke@435:   if (cell_count >= 0) {
duke@435:     assert(tag != DataLayout::no_tag, "bad tag");
duke@435:     assert(bytecode_has_profile(c), "agree w/ BHP");
duke@435:     data_layout->initialize(tag, stream->bci(), cell_count);
duke@435:     return DataLayout::compute_size_in_bytes(cell_count);
duke@435:   } else {
duke@435:     assert(!bytecode_has_profile(c), "agree w/ !BHP");
duke@435:     return 0;
duke@435:   }
roland@4860: #endif
duke@435: }
duke@435: 
duke@435: // Get the data at an arbitrary (sort of) data index.
coleenp@4037: ProfileData* MethodData::data_at(int data_index) const {
duke@435:   if (out_of_bounds(data_index)) {
duke@435:     return NULL;
duke@435:   }
duke@435:   DataLayout* data_layout = data_layout_at(data_index);
ysr@1376:   return data_layout->data_in();
ysr@1376: }
duke@435: 
ysr@1376: ProfileData* DataLayout::data_in() {
ysr@1376:   switch (tag()) {
duke@435:   case DataLayout::no_tag:
duke@435:   default:
duke@435:     ShouldNotReachHere();
duke@435:     return NULL;
duke@435:   case DataLayout::bit_data_tag:
ysr@1376:     return new BitData(this);
duke@435:   case DataLayout::counter_data_tag:
ysr@1376:     return new CounterData(this);
duke@435:   case DataLayout::jump_data_tag:
ysr@1376:     return new JumpData(this);
duke@435:   case DataLayout::receiver_type_data_tag:
ysr@1376:     return new ReceiverTypeData(this);
duke@435:   case DataLayout::virtual_call_data_tag:
ysr@1376:     return new VirtualCallData(this);
duke@435:   case DataLayout::ret_data_tag:
ysr@1376:     return new RetData(this);
duke@435:   case DataLayout::branch_data_tag:
ysr@1376:     return new BranchData(this);
duke@435:   case DataLayout::multi_branch_data_tag:
ysr@1376:     return new MultiBranchData(this);
kvn@480:   case DataLayout::arg_info_data_tag:
ysr@1376:     return new ArgInfoData(this);
duke@435:   };
duke@435: }
duke@435: 
duke@435: // Iteration over data.
coleenp@4037: ProfileData* MethodData::next_data(ProfileData* current) const {
duke@435:   int current_index = dp_to_di(current->dp());
duke@435:   int next_index = current_index + current->size_in_bytes();
duke@435:   ProfileData* next = data_at(next_index);
duke@435:   return next;
duke@435: }
duke@435: 
duke@435: // Give each of the data entries a chance to perform specific
duke@435: // data initialization.
coleenp@4037: void MethodData::post_initialize(BytecodeStream* stream) {
duke@435:   ResourceMark rm;
duke@435:   ProfileData* data;
duke@435:   for (data = first_data(); is_valid(data); data = next_data(data)) {
duke@435:     stream->set_start(data->bci());
duke@435:     stream->next();
duke@435:     data->post_initialize(stream, this);
duke@435:   }
duke@435: }
duke@435: 
coleenp@4037: // Initialize the MethodData* corresponding to a given method.
coleenp@4037: MethodData::MethodData(methodHandle method, int size, TRAPS) {
coleenp@4037:   No_Safepoint_Verifier no_safepoint;  // init function atomic wrt GC
duke@435:   ResourceMark rm;
duke@435:   // Set the method back-pointer.
duke@435:   _method = method();
iveresov@2138: 
iignatyev@4908:   init();
duke@435:   set_creation_mileage(mileage_of(method()));
duke@435: 
duke@435:   // Go through the bytecodes and allocate and initialize the
duke@435:   // corresponding data cells.
duke@435:   int data_size = 0;
duke@435:   int empty_bc_count = 0;  // number of bytecodes lacking data
coleenp@4712:   _data[0] = 0;  // apparently not set below.
duke@435:   BytecodeStream stream(method);
duke@435:   Bytecodes::Code c;
duke@435:   while ((c = stream.next()) >= 0) {
duke@435:     int size_in_bytes = initialize_data(&stream, data_size);
duke@435:     data_size += size_in_bytes;
duke@435:     if (size_in_bytes == 0)  empty_bc_count += 1;
duke@435:   }
duke@435:   _data_size = data_size;
duke@435:   int object_size = in_bytes(data_offset()) + data_size;
duke@435: 
duke@435:   // Add some extra DataLayout cells (at least one) to track stray traps.
duke@435:   int extra_data_count = compute_extra_data_count(data_size, empty_bc_count);
kvn@480:   int extra_size = extra_data_count * DataLayout::compute_size_in_bytes(0);
kvn@480: 
kvn@480:   // Add a cell to record information about modified arguments.
kvn@480:   // Set up _args_modified array after traps cells so that
kvn@480:   // the code for traps cells works.
kvn@480:   DataLayout *dp = data_layout_at(data_size + extra_size);
kvn@480: 
kvn@480:   int arg_size = method->size_of_parameters();
kvn@480:   dp->initialize(DataLayout::arg_info_data_tag, 0, arg_size+1);
kvn@480: 
kvn@480:   object_size += extra_size + DataLayout::compute_size_in_bytes(arg_size+1);
duke@435: 
duke@435:   // Set an initial hint. Don't use set_hint_di() because
duke@435:   // first_di() may be out of bounds if data_size is 0.
duke@435:   // In that situation, _hint_di is never used, but at
duke@435:   // least well-defined.
duke@435:   _hint_di = first_di();
duke@435: 
duke@435:   post_initialize(&stream);
duke@435: 
coleenp@4037:   set_size(object_size);
iignatyev@4908: }
coleenp@4712: 
iignatyev@4908: void MethodData::init() {
iignatyev@4908:   _invocation_counter.init();
iignatyev@4908:   _backedge_counter.init();
iignatyev@4908:   _invocation_counter_start = 0;
iignatyev@4908:   _backedge_counter_start = 0;
iignatyev@4908:   _num_loops = 0;
iignatyev@4908:   _num_blocks = 0;
iignatyev@4908:   _highest_comp_level = 0;
iignatyev@4908:   _highest_osr_comp_level = 0;
iignatyev@4908:   _would_profile = true;
iignatyev@4908: 
iignatyev@4908:   // Initialize flags and trap history.
iignatyev@4908:   _nof_decompiles = 0;
iignatyev@4908:   _nof_overflow_recompiles = 0;
iignatyev@4908:   _nof_overflow_traps = 0;
iignatyev@4908:   clear_escape_info();
iignatyev@4908:   assert(sizeof(_trap_hist) % sizeof(HeapWord) == 0, "align");
iignatyev@4908:   Copy::zero_to_words((HeapWord*) &_trap_hist,
iignatyev@4908:                       sizeof(_trap_hist) / sizeof(HeapWord));
duke@435: }
duke@435: 
duke@435: // Get a measure of how much mileage the method has on it.
coleenp@4037: int MethodData::mileage_of(Method* method) {
duke@435:   int mileage = 0;
iveresov@2138:   if (TieredCompilation) {
iveresov@2138:     mileage = MAX2(method->invocation_count(), method->backedge_count());
iveresov@2138:   } else {
iveresov@2138:     int iic = method->interpreter_invocation_count();
iveresov@2138:     if (mileage < iic)  mileage = iic;
iveresov@2138:     InvocationCounter* ic = method->invocation_counter();
iveresov@2138:     InvocationCounter* bc = method->backedge_counter();
iveresov@2138:     int icval = ic->count();
iveresov@2138:     if (ic->carry()) icval += CompileThreshold;
iveresov@2138:     if (mileage < icval)  mileage = icval;
iveresov@2138:     int bcval = bc->count();
iveresov@2138:     if (bc->carry()) bcval += CompileThreshold;
iveresov@2138:     if (mileage < bcval)  mileage = bcval;
iveresov@2138:   }
duke@435:   return mileage;
duke@435: }
duke@435: 
coleenp@4037: bool MethodData::is_mature() const {
iveresov@2138:   return CompilationPolicy::policy()->is_mature(_method);
duke@435: }
duke@435: 
duke@435: // Translate a bci to its corresponding data index (di).
coleenp@4037: address MethodData::bci_to_dp(int bci) {
duke@435:   ResourceMark rm;
duke@435:   ProfileData* data = data_before(bci);
duke@435:   ProfileData* prev = NULL;
duke@435:   for ( ; is_valid(data); data = next_data(data)) {
duke@435:     if (data->bci() >= bci) {
duke@435:       if (data->bci() == bci)  set_hint_di(dp_to_di(data->dp()));
duke@435:       else if (prev != NULL)   set_hint_di(dp_to_di(prev->dp()));
duke@435:       return data->dp();
duke@435:     }
duke@435:     prev = data;
duke@435:   }
duke@435:   return (address)limit_data_position();
duke@435: }
duke@435: 
duke@435: // Translate a bci to its corresponding data, or NULL.
coleenp@4037: ProfileData* MethodData::bci_to_data(int bci) {
duke@435:   ProfileData* data = data_before(bci);
duke@435:   for ( ; is_valid(data); data = next_data(data)) {
duke@435:     if (data->bci() == bci) {
duke@435:       set_hint_di(dp_to_di(data->dp()));
duke@435:       return data;
duke@435:     } else if (data->bci() > bci) {
duke@435:       break;
duke@435:     }
duke@435:   }
duke@435:   return bci_to_extra_data(bci, false);
duke@435: }
duke@435: 
duke@435: // Translate a bci to its corresponding extra data, or NULL.
coleenp@4037: ProfileData* MethodData::bci_to_extra_data(int bci, bool create_if_missing) {
duke@435:   DataLayout* dp    = extra_data_base();
duke@435:   DataLayout* end   = extra_data_limit();
duke@435:   DataLayout* avail = NULL;
duke@435:   for (; dp < end; dp = next_extra(dp)) {
duke@435:     // No need for "OrderAccess::load_acquire" ops,
duke@435:     // since the data structure is monotonic.
duke@435:     if (dp->tag() == DataLayout::no_tag)  break;
kvn@480:     if (dp->tag() == DataLayout::arg_info_data_tag) {
kvn@480:       dp = end; // ArgInfoData is at the end of extra data section.
kvn@480:       break;
kvn@480:     }
duke@435:     if (dp->bci() == bci) {
duke@435:       assert(dp->tag() == DataLayout::bit_data_tag, "sane");
duke@435:       return new BitData(dp);
duke@435:     }
duke@435:   }
duke@435:   if (create_if_missing && dp < end) {
duke@435:     // Allocate this one.  There is no mutual exclusion,
duke@435:     // so two threads could allocate different BCIs to the
duke@435:     // same data layout.  This means these extra data
duke@435:     // records, like most other MDO contents, must not be
duke@435:     // trusted too much.
duke@435:     DataLayout temp;
duke@435:     temp.initialize(DataLayout::bit_data_tag, bci, 0);
duke@435:     dp->release_set_header(temp.header());
duke@435:     assert(dp->tag() == DataLayout::bit_data_tag, "sane");
duke@435:     //NO: assert(dp->bci() == bci, "no concurrent allocation");
duke@435:     return new BitData(dp);
duke@435:   }
duke@435:   return NULL;
duke@435: }
duke@435: 
coleenp@4037: ArgInfoData *MethodData::arg_info() {
kvn@480:   DataLayout* dp    = extra_data_base();
kvn@480:   DataLayout* end   = extra_data_limit();
kvn@480:   for (; dp < end; dp = next_extra(dp)) {
kvn@480:     if (dp->tag() == DataLayout::arg_info_data_tag)
kvn@480:       return new ArgInfoData(dp);
kvn@480:   }
kvn@480:   return NULL;
kvn@480: }
kvn@480: 
coleenp@4037: // Printing
coleenp@4037: 
duke@435: #ifndef PRODUCT
coleenp@4037: 
coleenp@4037: void MethodData::print_on(outputStream* st) const {
coleenp@4037:   assert(is_methodData(), "should be method data");
coleenp@4037:   st->print("method data for ");
coleenp@4037:   method()->print_value_on(st);
coleenp@4037:   st->cr();
coleenp@4037:   print_data_on(st);
coleenp@4037: }
coleenp@4037: 
coleenp@4037: #endif //PRODUCT
coleenp@4037: 
coleenp@4037: void MethodData::print_value_on(outputStream* st) const {
coleenp@4037:   assert(is_methodData(), "should be method data");
coleenp@4037:   st->print("method data for ");
coleenp@4037:   method()->print_value_on(st);
coleenp@4037: }
coleenp@4037: 
coleenp@4037: #ifndef PRODUCT
coleenp@4037: void MethodData::print_data_on(outputStream* st) const {
duke@435:   ResourceMark rm;
duke@435:   ProfileData* data = first_data();
duke@435:   for ( ; is_valid(data); data = next_data(data)) {
duke@435:     st->print("%d", dp_to_di(data->dp()));
duke@435:     st->fill_to(6);
duke@435:     data->print_data_on(st);
duke@435:   }
kvn@480:   st->print_cr("--- Extra data:");
duke@435:   DataLayout* dp    = extra_data_base();
duke@435:   DataLayout* end   = extra_data_limit();
duke@435:   for (; dp < end; dp = next_extra(dp)) {
duke@435:     // No need for "OrderAccess::load_acquire" ops,
duke@435:     // since the data structure is monotonic.
kvn@480:     if (dp->tag() == DataLayout::no_tag)  continue;
kvn@480:     if (dp->tag() == DataLayout::bit_data_tag) {
kvn@480:       data = new BitData(dp);
kvn@480:     } else {
kvn@480:       assert(dp->tag() == DataLayout::arg_info_data_tag, "must be BitData or ArgInfo");
kvn@480:       data = new ArgInfoData(dp);
kvn@480:       dp = end; // ArgInfoData is at the end of extra data section.
kvn@480:     }
duke@435:     st->print("%d", dp_to_di(data->dp()));
duke@435:     st->fill_to(6);
duke@435:     data->print_data_on(st);
duke@435:   }
duke@435: }
duke@435: #endif
duke@435: 
acorn@4497: #if INCLUDE_SERVICES
acorn@4497: // Size Statistics
acorn@4497: void MethodData::collect_statistics(KlassSizeStats *sz) const {
acorn@4497:   int n = sz->count(this);
acorn@4497:   sz->_method_data_bytes += n;
acorn@4497:   sz->_method_all_bytes += n;
acorn@4497:   sz->_rw_bytes += n;
acorn@4497: }
acorn@4497: #endif // INCLUDE_SERVICES
coleenp@4037: 
coleenp@4037: // Verification
coleenp@4037: 
coleenp@4037: void MethodData::verify_on(outputStream* st) {
coleenp@4037:   guarantee(is_methodData(), "object must be method data");
coleenp@4037:   // guarantee(m->is_perm(), "should be in permspace");
coleenp@4037:   this->verify_data_on(st);
coleenp@4037: }
coleenp@4037: 
coleenp@4037: void MethodData::verify_data_on(outputStream* st) {
duke@435:   NEEDS_CLEANUP;
duke@435:   // not yet implemented.
duke@435: }