/*

 * Copyright (c) 2000, 2013, Oracle and/or its affiliates. All rights reserved.

 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.

 *

 * This code is free software; you can redistribute it and/or modify it

 * under the terms of the GNU General Public License version 2 only, as

 * published by the Free Software Foundation.

 *

 * This code is distributed in the hope that it will be useful, but WITHOUT

 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or

 * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License

 * version 2 for more details (a copy is included in the LICENSE file that

 * accompanied this code).

 *

 * You should have received a copy of the GNU General Public License version

 * 2 along with this work; if not, write to the Free Software Foundation,

 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.

 *

 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA

 * or visit www.oracle.com if you need additional information or have any

 * questions.

 *

 */

#include "precompiled.hpp"

#include "classfile/systemDictionary.hpp"

#include "interpreter/bytecode.hpp"

#include "interpreter/bytecodeStream.hpp"

#include "interpreter/linkResolver.hpp"

#include "memory/heapInspection.hpp"

#include "oops/methodData.hpp"

#include "prims/jvmtiRedefineClasses.hpp"

#include "runtime/compilationPolicy.hpp"

#include "runtime/deoptimization.hpp"

#include "runtime/handles.inline.hpp"

// ==================================================================

// DataLayout

//

// Overlay for generic profiling data.

// Some types of data layouts need a length field.

bool DataLayout::needs_array_len(u1 tag) {

  return (tag == multi_branch_data_tag) || (tag == arg_info_data_tag) || (tag == parameters_type_data_tag);

}

// Perform generic initialization of the data.  More specific

// initialization occurs in overrides of ProfileData::post_initialize.

void DataLayout::initialize(u1 tag, u2 bci, int cell_count) {

  _header._bits = (intptr_t)0;

  _header._struct._tag = tag;

  _header._struct._bci = bci;

  for (int i = 0; i < cell_count; i++) {

    set_cell_at(i, (intptr_t)0);

  }

  if (needs_array_len(tag)) {

    set_cell_at(ArrayData::array_len_off_set, cell_count - 1); // -1 for header.

  }

  if (tag == call_type_data_tag) {

    CallTypeData::initialize(this, cell_count);

  } else if (tag == virtual_call_type_data_tag) {

    VirtualCallTypeData::initialize(this, cell_count);

  }

}

void DataLayout::clean_weak_klass_links(BoolObjectClosure* cl) {

  ResourceMark m;

  data_in()->clean_weak_klass_links(cl);

}

// ==================================================================

// ProfileData

//

// A ProfileData object is created to refer to a section of profiling

// data in a structured way.

// Constructor for invalid ProfileData.

ProfileData::ProfileData() {

  _data = NULL;

}

#ifndef PRODUCT

void ProfileData::print_shared(outputStream* st, const char* name) const {

  st->print("bci: %d", bci());

  st->fill_to(tab_width_one);

  st->print("%s", name);

  tab(st);

  int trap = trap_state();

  if (trap != 0) {

    char buf[100];

    st->print("trap(%s) ", Deoptimization::format_trap_state(buf, sizeof(buf), trap));

  }

  int flags = data()->flags();

  if (flags != 0)

    st->print("flags(%d) ", flags);

}

void ProfileData::tab(outputStream* st, bool first) const {

  st->fill_to(first ? tab_width_one : tab_width_two);

}

#endif // !PRODUCT

// ==================================================================

// BitData

//

// A BitData corresponds to a one-bit flag.  This is used to indicate

// whether a checkcast bytecode has seen a null value.

#ifndef PRODUCT

void BitData::print_data_on(outputStream* st) const {

  print_shared(st, "BitData");

}

#endif // !PRODUCT

// ==================================================================

// CounterData

//

// A CounterData corresponds to a simple counter.

#ifndef PRODUCT

void CounterData::print_data_on(outputStream* st) const {

  print_shared(st, "CounterData");

  st->print_cr("count(%u)", count());

}

#endif // !PRODUCT

// ==================================================================

// JumpData

//

// A JumpData is used to access profiling information for a direct

// branch.  It is a counter, used for counting the number of branches,

// plus a data displacement, used for realigning the data pointer to

// the corresponding target bci.

void JumpData::post_initialize(BytecodeStream* stream, MethodData* mdo) {

  assert(stream->bci() == bci(), "wrong pos");

  int target;

  Bytecodes::Code c = stream->code();

  if (c == Bytecodes::_goto_w || c == Bytecodes::_jsr_w) {

    target = stream->dest_w();

  } else {

    target = stream->dest();

  }

  int my_di = mdo->dp_to_di(dp());

  int target_di = mdo->bci_to_di(target);

  int offset = target_di - my_di;

  set_displacement(offset);

}

#ifndef PRODUCT

void JumpData::print_data_on(outputStream* st) const {

  print_shared(st, "JumpData");

  st->print_cr("taken(%u) displacement(%d)", taken(), displacement());

}

#endif // !PRODUCT

int TypeStackSlotEntries::compute_cell_count(Symbol* signature, bool include_receiver, int max) {

  // Parameter profiling include the receiver

  int args_count = include_receiver ? 1 : 0;

  ResourceMark rm;

  SignatureStream ss(signature);

  args_count += ss.reference_parameter_count();

  args_count = MIN2(args_count, max);

  return args_count * per_arg_cell_count;

}

int TypeEntriesAtCall::compute_cell_count(BytecodeStream* stream) {

  assert(Bytecodes::is_invoke(stream->code()), "should be invoke");

  assert(TypeStackSlotEntries::per_arg_count() > ReturnTypeEntry::static_cell_count(), "code to test for arguments/results broken");

  Bytecode_invoke inv(stream->method(), stream->bci());

  int args_cell = 0;

  if (arguments_profiling_enabled()) {

    args_cell = TypeStackSlotEntries::compute_cell_count(inv.signature(), false, TypeProfileArgsLimit);

  }

  int ret_cell = 0;

  if (return_profiling_enabled() && (inv.result_type() == T_OBJECT || inv.result_type() == T_ARRAY)) {

    ret_cell = ReturnTypeEntry::static_cell_count();

  }

  int header_cell = 0;

  if (args_cell + ret_cell > 0) {

    header_cell = header_cell_count();

  }

  return header_cell + args_cell + ret_cell;

}

class ArgumentOffsetComputer : public SignatureInfo {

private:

  int _max;

  GrowableArray<int> _offsets;

  void set(int size, BasicType type) { _size += size; }

  void do_object(int begin, int end) {

    if (_offsets.length() < _max) {

      _offsets.push(_size);

    }

    SignatureInfo::do_object(begin, end);

  }

  void do_array (int begin, int end) {

    if (_offsets.length() < _max) {

      _offsets.push(_size);

    }

    SignatureInfo::do_array(begin, end);

  }

public:

  ArgumentOffsetComputer(Symbol* signature, int max)

    : SignatureInfo(signature), _max(max), _offsets(Thread::current(), max) {

  }

  int total() { lazy_iterate_parameters(); return _size; }

  int off_at(int i) const { return _offsets.at(i); }

};

void TypeStackSlotEntries::post_initialize(Symbol* signature, bool has_receiver, bool include_receiver) {

  ResourceMark rm;

  int start = 0;

  // Parameter profiling include the receiver

  if (include_receiver && has_receiver) {

    set_stack_slot(0, 0);

    set_type(0, type_none());

    start += 1;

  }

  ArgumentOffsetComputer aos(signature, _number_of_entries-start);

  aos.total();

  for (int i = start; i < _number_of_entries; i++) {

    set_stack_slot(i, aos.off_at(i-start) + (has_receiver ? 1 : 0));

    set_type(i, type_none());

  }

}

void CallTypeData::post_initialize(BytecodeStream* stream, MethodData* mdo) {

  assert(Bytecodes::is_invoke(stream->code()), "should be invoke");

  Bytecode_invoke inv(stream->method(), stream->bci());

  SignatureStream ss(inv.signature());

  if (has_arguments()) {

#ifdef ASSERT

    ResourceMark rm;

    int count = MIN2(ss.reference_parameter_count(), (int)TypeProfileArgsLimit);

    assert(count > 0, "room for args type but none found?");

    check_number_of_arguments(count);

#endif

    _args.post_initialize(inv.signature(), inv.has_receiver(), false);

  }

  if (has_return()) {

    assert(inv.result_type() == T_OBJECT || inv.result_type() == T_ARRAY, "room for a ret type but doesn't return obj?");

    _ret.post_initialize();

  }

}

void VirtualCallTypeData::post_initialize(BytecodeStream* stream, MethodData* mdo) {

  assert(Bytecodes::is_invoke(stream->code()), "should be invoke");

  Bytecode_invoke inv(stream->method(), stream->bci());

  if (has_arguments()) {

#ifdef ASSERT

    ResourceMark rm;

    SignatureStream ss(inv.signature());

    int count = MIN2(ss.reference_parameter_count(), (int)TypeProfileArgsLimit);

    assert(count > 0, "room for args type but none found?");

    check_number_of_arguments(count);

#endif

    _args.post_initialize(inv.signature(), inv.has_receiver(), false);

  }

  if (has_return()) {

    assert(inv.result_type() == T_OBJECT || inv.result_type() == T_ARRAY, "room for a ret type but doesn't return obj?");

    _ret.post_initialize();

  }

}

bool TypeEntries::is_loader_alive(BoolObjectClosure* is_alive_cl, intptr_t p) {

}

void TypeStackSlotEntries::clean_weak_klass_links(BoolObjectClosure* is_alive_cl) {

  for (int i = 0; i < _number_of_entries; i++) {

    intptr_t p = type(i);

    }

  }

}

void ReturnTypeEntry::clean_weak_klass_links(BoolObjectClosure* is_alive_cl) {

  intptr_t p = type();

  }

}

bool TypeEntriesAtCall::return_profiling_enabled() {

  return MethodData::profile_return();

}

bool TypeEntriesAtCall::arguments_profiling_enabled() {

  return MethodData::profile_arguments();

}

#ifndef PRODUCT

void TypeEntries::print_klass(outputStream* st, intptr_t k) {

  if (is_type_none(k)) {

    st->print("none");

  } else if (is_type_unknown(k)) {

    st->print("unknown");

  } else {

    valid_klass(k)->print_value_on(st);

  }

  if (was_null_seen(k)) {

    st->print(" (null seen)");

  }

}

void TypeStackSlotEntries::print_data_on(outputStream* st) const {

  for (int i = 0; i < _number_of_entries; i++) {

    _pd->tab(st);

    st->print("%d: stack(%u) ", i, stack_slot(i));

    print_klass(st, type(i));

    st->cr();

  }

}

void ReturnTypeEntry::print_data_on(outputStream* st) const {

  _pd->tab(st);

  print_klass(st, type());

  st->cr();

}

void CallTypeData::print_data_on(outputStream* st) const {

  CounterData::print_data_on(st);

  if (has_arguments()) {

    tab(st, true);

    st->print("argument types");

    _args.print_data_on(st);

  }

  if (has_return()) {

    tab(st, true);

    st->print("return type");

    _ret.print_data_on(st);

  }

}

void VirtualCallTypeData::print_data_on(outputStream* st) const {

  VirtualCallData::print_data_on(st);

  if (has_arguments()) {

    tab(st, true);

    st->print("argument types");

    _args.print_data_on(st);

  }

  if (has_return()) {

    tab(st, true);

    st->print("return type");

    _ret.print_data_on(st);

  }

}

#endif

// ==================================================================

// ReceiverTypeData

//

// A ReceiverTypeData is used to access profiling information about a

// dynamic type check.  It consists of a counter which counts the total times

// that the check is reached, and a series of (Klass*, count) pairs

// which are used to store a type profile for the receiver of the check.

void ReceiverTypeData::clean_weak_klass_links(BoolObjectClosure* is_alive_cl) {

    for (uint row = 0; row < row_limit(); row++) {

    Klass* p = receiver(row);

    if (p != NULL && !p->is_loader_alive(is_alive_cl)) {

      clear_row(row);

    }

  }

}

#ifndef PRODUCT

void ReceiverTypeData::print_receiver_data_on(outputStream* st) const {

  uint row;

  int entries = 0;

  for (row = 0; row < row_limit(); row++) {

    if (receiver(row) != NULL)  entries++;

  }

  st->print_cr("count(%u) entries(%u)", count(), entries);

  int total = count();

  for (row = 0; row < row_limit(); row++) {

    if (receiver(row) != NULL) {

      total += receiver_count(row);

    }

  }

  for (row = 0; row < row_limit(); row++) {

    if (receiver(row) != NULL) {

      tab(st);

      receiver(row)->print_value_on(st);

      st->print_cr("(%u %4.2f)", receiver_count(row), (float) receiver_count(row) / (float) total);

    }

  }

}

void ReceiverTypeData::print_data_on(outputStream* st) const {

  print_shared(st, "ReceiverTypeData");

  print_receiver_data_on(st);

}

void VirtualCallData::print_data_on(outputStream* st) const {

  print_shared(st, "VirtualCallData");

  print_receiver_data_on(st);

}

#endif // !PRODUCT

// ==================================================================

// RetData

//

// A RetData is used to access profiling information for a ret bytecode.

// It is composed of a count of the number of times that the ret has

// been executed, followed by a series of triples of the form

// (bci, count, di) which count the number of times that some bci was the

// target of the ret and cache a corresponding displacement.

void RetData::post_initialize(BytecodeStream* stream, MethodData* mdo) {

  for (uint row = 0; row < row_limit(); row++) {

    set_bci_displacement(row, -1);

    set_bci(row, no_bci);

  }

  // release so other threads see a consistent state.  bci is used as

  // a valid flag for bci_displacement.

  OrderAccess::release();

}

// This routine needs to atomically update the RetData structure, so the

// caller needs to hold the RetData_lock before it gets here.  Since taking

// the lock can block (and allow GC) and since RetData is a ProfileData is a

// wrapper around a derived oop, taking the lock in _this_ method will

// basically cause the 'this' pointer's _data field to contain junk after the

// lock.  We require the caller to take the lock before making the ProfileData

// structure.  Currently the only caller is InterpreterRuntime::update_mdp_for_ret

address RetData::fixup_ret(int return_bci, MethodData* h_mdo) {

  // First find the mdp which corresponds to the return bci.

  address mdp = h_mdo->bci_to_dp(return_bci);

  // Now check to see if any of the cache slots are open.

  for (uint row = 0; row < row_limit(); row++) {

    if (bci(row) == no_bci) {

      set_bci_displacement(row, mdp - dp());

      set_bci_count(row, DataLayout::counter_increment);

      // Barrier to ensure displacement is written before the bci; allows

      // the interpreter to read displacement without fear of race condition.

      release_set_bci(row, return_bci);

      break;

    }

  }

  return mdp;

}

#ifndef PRODUCT

void RetData::print_data_on(outputStream* st) const {

  print_shared(st, "RetData");

  uint row;

  int entries = 0;

  for (row = 0; row < row_limit(); row++) {

    if (bci(row) != no_bci)  entries++;

  }

  st->print_cr("count(%u) entries(%u)", count(), entries);

  for (row = 0; row < row_limit(); row++) {

    if (bci(row) != no_bci) {

      tab(st);

      st->print_cr("bci(%d: count(%u) displacement(%d))",

                   bci(row), bci_count(row), bci_displacement(row));

    }

  }

}

#endif // !PRODUCT

// ==================================================================

// BranchData

//

// A BranchData is used to access profiling data for a two-way branch.

// It consists of taken and not_taken counts as well as a data displacement

// for the taken case.

void BranchData::post_initialize(BytecodeStream* stream, MethodData* mdo) {

  assert(stream->bci() == bci(), "wrong pos");

  int target = stream->dest();

  int my_di = mdo->dp_to_di(dp());

  int target_di = mdo->bci_to_di(target);

  int offset = target_di - my_di;

  set_displacement(offset);

}

#ifndef PRODUCT

void BranchData::print_data_on(outputStream* st) const {

  print_shared(st, "BranchData");

  st->print_cr("taken(%u) displacement(%d)",

               taken(), displacement());

  tab(st);

  st->print_cr("not taken(%u)", not_taken());

}

#endif

// ==================================================================

// MultiBranchData