/*

 * Copyright (c) 1998, 2012, 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 "gc_implementation/shared/markSweep.inline.hpp"

#include "interpreter/interpreter.hpp"

#include "interpreter/rewriter.hpp"

#include "memory/universe.inline.hpp"

#include "oops/cpCacheOop.hpp"

#include "oops/objArrayOop.hpp"

#include "oops/oop.inline.hpp"

#include "prims/jvmtiRedefineClassesTrace.hpp"

#include "runtime/handles.inline.hpp"

// Implememtation of ConstantPoolCacheEntry

void ConstantPoolCacheEntry::initialize_entry(int index) {

  assert(0 < index && index < 0x10000, "sanity check");

  _indices = index;

  assert(constant_pool_index() == index, "");

}

void ConstantPoolCacheEntry::initialize_secondary_entry(int main_index) {

  assert(0 <= main_index && main_index < 0x10000, "sanity check");

  assert(main_entry_index() == main_index, "");

}

  // Preserve existing flag bit values

#ifdef ASSERT

         "inconsistent cpCache flags state");

#endif

  return (_flags | f) ;

}

void ConstantPoolCacheEntry::set_bytecode_1(Bytecodes::Code code) {

#ifdef ASSERT

  // Read once.

  volatile Bytecodes::Code c = bytecode_1();

  assert(c == 0 || c == code || code == 0, "update must be consistent");

#endif

  // Need to flush pending stores here before bytecode is written.

}

void ConstantPoolCacheEntry::set_bytecode_2(Bytecodes::Code code) {

#ifdef ASSERT

  // Read once.

  volatile Bytecodes::Code c = bytecode_2();

  assert(c == 0 || c == code || code == 0, "update must be consistent");

#endif

  // Need to flush pending stores here before bytecode is written.

}

  // Use barriers as in oop_store

  oop* f1_addr = (oop*) &_f1;

  update_barrier_set_pre(f1_addr, f1);

}

#ifdef ASSERT

// It is possible to have two different dummy methodOops created

// when the resolve code for invoke interface executes concurrently

// Hence the assertion below is weakened a bit for the invokeinterface

// case.

bool ConstantPoolCacheEntry::same_methodOop(oop cur_f1, oop f1) {

  return (cur_f1 == f1 || ((methodOop)cur_f1)->name() ==

         ((methodOop)f1)->name() || ((methodOop)cur_f1)->signature() ==

         ((methodOop)f1)->signature());

}

#endif

// Note that concurrent update of both bytecodes can leave one of them

// reset to zero.  This is harmless; the interpreter will simply re-resolve

// the damaged entry.  More seriously, the memory synchronization is needed

// to flush other fields (f1, f2) completely to memory before the bytecodes

// are updated, lest other processors see a non-zero bytecode but zero f1/f2.

void ConstantPoolCacheEntry::set_field(Bytecodes::Code get_code,

                                       Bytecodes::Code put_code,

                                       KlassHandle field_holder,

                                       int field_index,

                                       int field_offset,

                                       TosState field_type,

                                       bool is_final,

                                       bool is_volatile) {

  set_f1(field_holder()->java_mirror());

  set_f2(field_offset);

         "field index does not fit in low flag bits");

  set_bytecode_1(get_code);

  set_bytecode_2(put_code);

  NOT_PRODUCT(verify(tty));

}

}

void ConstantPoolCacheEntry::set_method(Bytecodes::Code invoke_code,

                                        methodHandle method,

                                        int vtable_index) {

  assert(!is_secondary_entry(), "");

  assert(method->interpreter_entry() != NULL, "should have been set at this point");

  assert(!method->is_obsolete(),  "attempt to write obsolete method to cpCache");

  int byte_no = -1;

  switch (invoke_code) {

    case Bytecodes::_invokevirtual:

        if (method->can_be_statically_bound()) {

        } else {

          assert(vtable_index >= 0, "valid index");

          set_f2(vtable_index);

        }

        byte_no = 2;

        break;

      }

    case Bytecodes::_invokespecial:

    case Bytecodes::_invokestatic:

      set_f1(method());

      byte_no = 1;

      break;

    default:

      ShouldNotReachHere();

      break;

  }

  // Note:  byte_no also appears in TemplateTable::resolve.

  if (byte_no == 1) {

    set_bytecode_1(invoke_code);

  } else if (byte_no == 2)  {

    if (change_to_virtual) {

      // NOTE: THIS IS A HACK - BE VERY CAREFUL!!!

      //

      // Workaround for the case where we encounter an invokeinterface, but we

      // should really have an _invokevirtual since the resolved method is a

      // virtual method in java.lang.Object. This is a corner case in the spec

      // but is presumably legal. javac does not generate this code.

      //

      // We set bytecode_1() to _invokeinterface, because that is the

      // bytecode # used by the interpreter to see if it is resolved.

      // We set bytecode_2() to _invokevirtual.

      // See also interpreterRuntime.cpp. (8/25/2000)

      // Only set resolved for the invokeinterface case if method is public.

      // Otherwise, the method needs to be reresolved with caller for each

      // interface call.

      if (method->is_public()) set_bytecode_1(invoke_code);

    } else {

    }

  } else {

    ShouldNotReachHere();

  }

  NOT_PRODUCT(verify(tty));

}

void ConstantPoolCacheEntry::set_interface_call(methodHandle method, int index) {

  assert(!is_secondary_entry(), "");

  klassOop interf = method->method_holder();

  assert(instanceKlass::cast(interf)->is_interface(), "must be an interface");

  set_f1(interf);

  set_f2(index);

  set_bytecode_1(Bytecodes::_invokeinterface);

}

}

}

}

  if (is_secondary_entry()) {

  }

  // Decode the action of set_method and set_interface_call

    oop f1 = _f1;

    if (f1 != NULL) {

      switch (invoke_code) {

      case Bytecodes::_invokeinterface:

        assert(f1->is_klass(), "");

      case Bytecodes::_invokestatic:

      case Bytecodes::_invokespecial:

        assert(f1->is_method(), "");

        return methodOop(f1);

      }

    }

  }

    switch (invoke_code) {

    case Bytecodes::_invokevirtual:

      if (is_vfinal()) {

        // invokevirtual

        assert(m->is_method(), "");

        return m;

      } else {

        int holder_index = cpool->uncached_klass_ref_index_at(constant_pool_index());

        if (cpool->tag_at(holder_index).is_klass()) {

          klassOop klass = cpool->resolved_klass_at(holder_index);

          if (!Klass::cast(klass)->oop_is_instance())

            klass = SystemDictionary::Object_klass();

        }

      }

    }

  }

  return NULL;

}

class LocalOopClosure: public OopClosure {

 private:

  void (*_f)(oop*);

 public:

  LocalOopClosure(void f(oop*))        { _f = f; }

  virtual void do_oop(oop* o)          { _f(o); }

  virtual void do_oop(narrowOop *o)    { ShouldNotReachHere(); }

};

void ConstantPoolCacheEntry::oops_do(void f(oop*)) {

  LocalOopClosure blk(f);

  oop_iterate(&blk);

}

void ConstantPoolCacheEntry::oop_iterate(OopClosure* blk) {

  assert(in_words(size()) == 4, "check code below - may need adjustment");

  // field[1] is always oop or NULL

  blk->do_oop((oop*)&_f1);

  if (is_vfinal()) {

    blk->do_oop((oop*)&_f2);

  }

}

void ConstantPoolCacheEntry::oop_iterate_m(OopClosure* blk, MemRegion mr) {

  assert(in_words(size()) == 4, "check code below - may need adjustment");

  // field[1] is always oop or NULL

  if (mr.contains((oop *)&_f1)) blk->do_oop((oop*)&_f1);

  if (is_vfinal()) {

    if (mr.contains((oop *)&_f2)) blk->do_oop((oop*)&_f2);

  }

}

void ConstantPoolCacheEntry::follow_contents() {

  assert(in_words(size()) == 4, "check code below - may need adjustment");

  // field[1] is always oop or NULL

  MarkSweep::mark_and_push((oop*)&_f1);

  if (is_vfinal()) {

    MarkSweep::mark_and_push((oop*)&_f2);

  }

}

#ifndef SERIALGC

void ConstantPoolCacheEntry::follow_contents(ParCompactionManager* cm) {

  assert(in_words(size()) == 4, "check code below - may need adjustment");

  // field[1] is always oop or NULL

  PSParallelCompact::mark_and_push(cm, (oop*)&_f1);

  if (is_vfinal()) {

    PSParallelCompact::mark_and_push(cm, (oop*)&_f2);

  }

}

#endif // SERIALGC

void ConstantPoolCacheEntry::adjust_pointers() {

  assert(in_words(size()) == 4, "check code below - may need adjustment");

  // field[1] is always oop or NULL

  MarkSweep::adjust_pointer((oop*)&_f1);

  if (is_vfinal()) {

    MarkSweep::adjust_pointer((oop*)&_f2);

  }

}

#ifndef SERIALGC

void ConstantPoolCacheEntry::update_pointers() {

  assert(in_words(size()) == 4, "check code below - may need adjustment");

  // field[1] is always oop or NULL

  PSParallelCompact::adjust_pointer((oop*)&_f1);

  if (is_vfinal()) {

    PSParallelCompact::adjust_pointer((oop*)&_f2);

  }

}

#endif // SERIALGC

// RedefineClasses() API support:

// If this constantPoolCacheEntry refers to old_method then update it

// to refer to new_method.

bool ConstantPoolCacheEntry::adjust_method_entry(methodOop old_method,

       methodOop new_method, bool * trace_name_printed) {

  if (is_vfinal()) {

      // match old_method so need an update

      _f2 = (intptr_t)new_method;

      if (RC_TRACE_IN_RANGE(0x00100000, 0x00400000)) {

        if (!(*trace_name_printed)) {

          // RC_TRACE_MESG macro has an embedded ResourceMark

          RC_TRACE_MESG(("adjust: name=%s",

            Klass::cast(old_method->method_holder())->external_name()));

          *trace_name_printed = true;

        }

        // RC_TRACE macro has an embedded ResourceMark

        RC_TRACE(0x00400000, ("cpc vf-entry update: %s(%s)",

          new_method->name()->as_C_string(),

          new_method->signature()->as_C_string()));

      }

      return true;