/*

 * Copyright 2003-2007 Sun Microsystems, Inc.  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 Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,

 * CA 95054 USA or visit www.sun.com if you need additional information or

 * have any questions.

 *

 */

# include "incls/_precompiled.incl"

# include "incls/_jvmtiImpl.cpp.incl"

GrowableArray<JvmtiRawMonitor*> *JvmtiPendingMonitors::_monitors = new (ResourceObj::C_HEAP) GrowableArray<JvmtiRawMonitor*>(1,true);

void JvmtiPendingMonitors::transition_raw_monitors() {

  assert((Threads::number_of_threads()==1),

         "Java thread has not created yet or more than one java thread \

is running. Raw monitor transition will not work");

  JavaThread *current_java_thread = JavaThread::current();

  assert(current_java_thread->thread_state() == _thread_in_vm, "Must be in vm");

  {

    ThreadBlockInVM __tbivm(current_java_thread);

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

      JvmtiRawMonitor *rmonitor = monitors()->at(i);

      int r = rmonitor->raw_enter(current_java_thread);

      assert(r == ObjectMonitor::OM_OK, "raw_enter should have worked");

    }

  }

  // pending monitors are converted to real monitor so delete them all.

  dispose();

}

//

// class JvmtiAgentThread

//

// JavaThread used to wrap a thread started by an agent

// using the JVMTI method RunAgentThread.

//

JvmtiAgentThread::JvmtiAgentThread(JvmtiEnv* env, jvmtiStartFunction start_fn, const void *start_arg)

    : JavaThread(start_function_wrapper) {

    _env = env;

    _start_fn = start_fn;

    _start_arg = start_arg;

}

void

JvmtiAgentThread::start_function_wrapper(JavaThread *thread, TRAPS) {

    // It is expected that any Agent threads will be created as

    // Java Threads.  If this is the case, notification of the creation

    // of the thread is given in JavaThread::thread_main().

    assert(thread->is_Java_thread(), "debugger thread should be a Java Thread");

    assert(thread == JavaThread::current(), "sanity check");

    JvmtiAgentThread *dthread = (JvmtiAgentThread *)thread;

    dthread->call_start_function();

}

void

JvmtiAgentThread::call_start_function() {

    ThreadToNativeFromVM transition(this);

    _start_fn(_env->jvmti_external(), jni_environment(), (void*)_start_arg);

}

//

// class GrowableCache - private methods

//

void GrowableCache::recache() {

  int len = _elements->length();

  FREE_C_HEAP_ARRAY(address, _cache);

  _cache = NEW_C_HEAP_ARRAY(address,len+1);

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

    _cache[i] = _elements->at(i)->getCacheValue();

    //

    // The cache entry has gone bad. Without a valid frame pointer

    // value, the entry is useless so we simply delete it in product

    // mode. The call to remove() will rebuild the cache again

    // without the bad entry.

    //

    if (_cache[i] == NULL) {

      assert(false, "cannot recache NULL elements");

      remove(i);

      return;

    }

  }

  _cache[len] = NULL;

  _listener_fun(_this_obj,_cache);

}

bool GrowableCache::equals(void* v, GrowableElement *e2) {

  GrowableElement *e1 = (GrowableElement *) v;

  assert(e1 != NULL, "e1 != NULL");

  assert(e2 != NULL, "e2 != NULL");

  return e1->equals(e2);

}

//

// class GrowableCache - public methods

//

GrowableCache::GrowableCache() {

  _this_obj       = NULL;

  _listener_fun   = NULL;

  _elements       = NULL;

  _cache          = NULL;

}

GrowableCache::~GrowableCache() {

  clear();

  delete _elements;

  FREE_C_HEAP_ARRAY(address, _cache);

}

void GrowableCache::initialize(void *this_obj, void listener_fun(void *, address*) ) {

  _this_obj       = this_obj;

  _listener_fun   = listener_fun;

  _elements       = new (ResourceObj::C_HEAP) GrowableArray<GrowableElement*>(5,true);

  recache();

}

// number of elements in the collection

int GrowableCache::length() {

  return _elements->length();

}

// get the value of the index element in the collection

GrowableElement* GrowableCache::at(int index) {

  GrowableElement *e = (GrowableElement *) _elements->at(index);

  assert(e != NULL, "e != NULL");

  return e;

}

int GrowableCache::find(GrowableElement* e) {

  return _elements->find(e, GrowableCache::equals);

}

// append a copy of the element to the end of the collection

void GrowableCache::append(GrowableElement* e) {

  GrowableElement *new_e = e->clone();

  _elements->append(new_e);

  recache();

}

// insert a copy of the element using lessthan()

void GrowableCache::insert(GrowableElement* e) {

  GrowableElement *new_e = e->clone();

  _elements->append(new_e);

  int n = length()-2;

  for (int i=n; i>=0; i--) {

    GrowableElement *e1 = _elements->at(i);

    GrowableElement *e2 = _elements->at(i+1);

    if (e2->lessThan(e1)) {

      _elements->at_put(i+1, e1);

      _elements->at_put(i,   e2);

    }

  }

  recache();

}

// remove the element at index

void GrowableCache::remove (int index) {

  GrowableElement *e = _elements->at(index);

  assert(e != NULL, "e != NULL");

  _elements->remove(e);

  delete e;

  recache();

}

// clear out all elements, release all heap space and

// let our listener know that things have changed.

void GrowableCache::clear() {

  int len = _elements->length();

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

    delete _elements->at(i);

  }

  _elements->clear();

  recache();

}

void GrowableCache::oops_do(OopClosure* f) {

  int len = _elements->length();

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

    GrowableElement *e = _elements->at(i);

    e->oops_do(f);

  }

}

void GrowableCache::gc_epilogue() {

  int len = _elements->length();

  // recompute the new cache value after GC

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

    _cache[i] = _elements->at(i)->getCacheValue();

  }

}

//

// class JvmtiRawMonitor

//

JvmtiRawMonitor::JvmtiRawMonitor(const char *name) {

#ifdef ASSERT

  _name = strcpy(NEW_C_HEAP_ARRAY(char, strlen(name) + 1), name);

#else

  _name = NULL;

#endif

  _magic = JVMTI_RM_MAGIC;

}

JvmtiRawMonitor::~JvmtiRawMonitor() {

#ifdef ASSERT

  FreeHeap(_name);

#endif

  _magic = 0;

}

bool

JvmtiRawMonitor::is_valid() {

  int value = 0;

  // This object might not be a JvmtiRawMonitor so we can't assume

  // the _magic field is properly aligned. Get the value in a safe

  // way and then check against JVMTI_RM_MAGIC.

  switch (sizeof(_magic)) {

  case 2:

    value = Bytes::get_native_u2((address)&_magic);

    break;

  case 4:

    value = Bytes::get_native_u4((address)&_magic);

    break;

  case 8:

    value = Bytes::get_native_u8((address)&_magic);

    break;

  default:

    guarantee(false, "_magic field is an unexpected size");

  }

  return value == JVMTI_RM_MAGIC;

}

//

// class JvmtiBreakpoint

//

JvmtiBreakpoint::JvmtiBreakpoint() {

  _method = NULL;

  _bci    = 0;

#ifdef CHECK_UNHANDLED_OOPS

  // This one is always allocated with new, but check it just in case.

  Thread *thread = Thread::current();

  if (thread->is_in_stack((address)&_method)) {

    thread->allow_unhandled_oop((oop*)&_method);

  }

#endif // CHECK_UNHANDLED_OOPS

}

JvmtiBreakpoint::JvmtiBreakpoint(methodOop m_method, jlocation location) {

  _method        = m_method;

  assert(_method != NULL, "_method != NULL");

  _bci           = (int) location;

#ifdef CHECK_UNHANDLED_OOPS

  // Could be allocated with new and wouldn't be on the unhandled oop list.

  Thread *thread = Thread::current();

  if (thread->is_in_stack((address)&_method)) {

    thread->allow_unhandled_oop(&_method);

  }

#endif // CHECK_UNHANDLED_OOPS

  assert(_bci >= 0, "_bci >= 0");

}

void JvmtiBreakpoint::copy(JvmtiBreakpoint& bp) {

  _method   = bp._method;

  _bci      = bp._bci;

}

bool JvmtiBreakpoint::lessThan(JvmtiBreakpoint& bp) {

  Unimplemented();

  return false;

}

bool JvmtiBreakpoint::equals(JvmtiBreakpoint& bp) {

  return _method   == bp._method

    &&   _bci      == bp._bci;

}

bool JvmtiBreakpoint::is_valid() {

  return _method != NULL &&

         _bci >= 0;

}

address JvmtiBreakpoint::getBcp() {

  return _method->bcp_from(_bci);

}

void JvmtiBreakpoint::each_method_version_do(method_action meth_act) {

  ((methodOopDesc*)_method->*meth_act)(_bci);

  // add/remove breakpoint to/from versions of the method that

  // are EMCP. Directly or transitively obsolete methods are

  // not saved in the PreviousVersionInfo.

  Thread *thread = Thread::current();

  instanceKlassHandle ikh = instanceKlassHandle(thread, _method->method_holder());

  symbolOop m_name = _method->name();

  symbolOop m_signature = _method->signature();

  {

    ResourceMark rm(thread);

    // PreviousVersionInfo objects returned via PreviousVersionWalker

    // contain a GrowableArray of handles. We have to clean up the

    // GrowableArray _after_ the PreviousVersionWalker destructor

    // has destroyed the handles.

    {

      // search previous versions if they exist

      PreviousVersionWalker pvw((instanceKlass *)ikh()->klass_part());

      for (PreviousVersionInfo * pv_info = pvw.next_previous_version();

           pv_info != NULL; pv_info = pvw.next_previous_version()) {

        GrowableArray<methodHandle>* methods =

          pv_info->prev_EMCP_method_handles();

        if (methods == NULL) {

          // We have run into a PreviousVersion generation where

          // all methods were made obsolete during that generation's

          // RedefineClasses() operation. At the time of that

          // operation, all EMCP methods were flushed so we don't

          // have to go back any further.

          //

          // A NULL methods array is different than an empty methods

          // array. We cannot infer any optimizations about older

          // generations from an empty methods array for the current

          // generation.

          break;

        }

        for (int i = methods->length() - 1; i >= 0; i--) {

          methodHandle method = methods->at(i);

          if (method->name() == m_name && method->signature() == m_signature) {

            RC_TRACE(0x00000800, ("%sing breakpoint in %s(%s)",

              meth_act == &methodOopDesc::set_breakpoint ? "sett" : "clear",

              method->name()->as_C_string(),

              method->signature()->as_C_string()));

            assert(!method->is_obsolete(), "only EMCP methods here");

            ((methodOopDesc*)method()->*meth_act)(_bci);

            break;

          }

        }

      }

    } // pvw is cleaned up

  } // rm is cleaned up

}

void JvmtiBreakpoint::set() {

  each_method_version_do(&methodOopDesc::set_breakpoint);

}

void JvmtiBreakpoint::clear() {

  each_method_version_do(&methodOopDesc::clear_breakpoint);

}

void JvmtiBreakpoint::print() {

#ifndef PRODUCT

  const char *class_name  = (_method == NULL) ? "NULL" : _method->klass_name()->as_C_string();

  const char *method_name = (_method == NULL) ? "NULL" : _method->name()->as_C_string();

  tty->print("Breakpoint(%s,%s,%d,%p)",class_name, method_name, _bci, getBcp());

#endif

}

//

// class VM_ChangeBreakpoints

//

// Modify the Breakpoints data structure at a safepoint

//

void VM_ChangeBreakpoints::doit() {

  switch (_operation) {

  case SET_BREAKPOINT:

    _breakpoints->set_at_safepoint(*_bp);

    break;

  case CLEAR_BREAKPOINT:

    _breakpoints->clear_at_safepoint(*_bp);

    break;

  case CLEAR_ALL_BREAKPOINT:

    _breakpoints->clearall_at_safepoint();

    break;

  default:

    assert(false, "Unknown operation");

  }

}

void VM_ChangeBreakpoints::oops_do(OopClosure* f) {

  // This operation keeps breakpoints alive

  if (_breakpoints != NULL) {

    _breakpoints->oops_do(f);

  }

  if (_bp != NULL) {

    _bp->oops_do(f);

  }

}

//

// class JvmtiBreakpoints

//

// a JVMTI internal collection of JvmtiBreakpoint

//

JvmtiBreakpoints::JvmtiBreakpoints(void listener_fun(void *,address *)) {

  _bps.initialize(this,listener_fun);

}

JvmtiBreakpoints:: ~JvmtiBreakpoints() {}

void  JvmtiBreakpoints::oops_do(OopClosure* f) {

  _bps.oops_do(f);

}

void  JvmtiBreakpoints::gc_epilogue() {

  _bps.gc_epilogue();

}

void  JvmtiBreakpoints::print() {

#ifndef PRODUCT

  ResourceMark rm;

  int n = _bps.length();

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

    JvmtiBreakpoint& bp = _bps.at(i);

    tty->print("%d: ", i);

    bp.print();

    tty->print_cr("");

  }

#endif

}

void JvmtiBreakpoints::set_at_safepoint(JvmtiBreakpoint& bp) {

  assert(SafepointSynchronize::is_at_safepoint(), "must be at safepoint");

  int i = _bps.find(bp);

  if (i == -1) {

    _bps.append(bp);

    bp.set();

  }

}

void JvmtiBreakpoints::clear_at_safepoint(JvmtiBreakpoint& bp) {

  assert(SafepointSynchronize::is_at_safepoint(), "must be at safepoint");

  int i = _bps.find(bp);

  if (i != -1) {

    _bps.remove(i);

    bp.clear();

  }

}

void JvmtiBreakpoints::clearall_at_safepoint() {

  assert(SafepointSynchronize::is_at_safepoint(), "must be at safepoint");

  int len = _bps.length();

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

    _bps.at(i).clear();

  }

  _bps.clear();

}

int JvmtiBreakpoints::length() { return _bps.length(); }

int JvmtiBreakpoints::set(JvmtiBreakpoint& bp) {

  if ( _bps.find(bp) != -1) {

     return JVMTI_ERROR_DUPLICATE;

  }

  VM_ChangeBreakpoints set_breakpoint(this,VM_ChangeBreakpoints::SET_BREAKPOINT, &bp);

  VMThread::execute(&set_breakpoint);

  return JVMTI_ERROR_NONE;

}

int JvmtiBreakpoints::clear(JvmtiBreakpoint& bp) {

  if ( _bps.find(bp) == -1) {

     return JVMTI_ERROR_NOT_FOUND;

  }

  VM_ChangeBreakpoints clear_breakpoint(this,VM_ChangeBreakpoints::CLEAR_BREAKPOINT, &bp);

  VMThread::execute(&clear_breakpoint);

  return JVMTI_ERROR_NONE;

}

void JvmtiBreakpoints::clearall_in_class_at_safepoint(klassOop klass) {

  bool changed = true;

  // We are going to run thru the list of bkpts

  // and delete some.  This deletion probably alters

  // the list in some implementation defined way such

  // that when we delete entry i, the next entry might

  // no longer be at i+1.  To be safe, each time we delete

  // an entry, we'll just start again from the beginning.

  // We'll stop when we make a pass thru the whole list without