/*

 * Copyright (c) 2012, 2017, 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 <new>

#include "classfile/classLoaderData.hpp"

#include "classfile/modules.hpp"

#include "classfile/stringTable.hpp"

#include "code/codeCache.hpp"

#include "compiler/methodMatcher.hpp"

#include "compiler/directivesParser.hpp"

#include "jvmtifiles/jvmtiEnv.hpp"

#include "memory/metadataFactory.hpp"

#include "memory/metaspaceShared.hpp"

#include "memory/iterator.hpp"

#include "memory/resourceArea.hpp"

#include "memory/universe.hpp"

#include "memory/oopFactory.hpp"

#include "oops/constantPool.hpp"

#include "oops/objArrayKlass.hpp"

#include "oops/objArrayOop.inline.hpp"

#include "oops/oop.inline.hpp"

#include "prims/wbtestmethods/parserTests.hpp"

#include "prims/whitebox.hpp"

#include "runtime/arguments.hpp"

#include "runtime/compilationPolicy.hpp"

#include "runtime/deoptimization.hpp"

#include "runtime/interfaceSupport.hpp"

#include "runtime/javaCalls.hpp"

#include "runtime/os.hpp"

#include "runtime/sweeper.hpp"

#include "runtime/thread.hpp"

#include "runtime/vm_version.hpp"

#include "utilities/array.hpp"

#include "utilities/debug.hpp"

#include "utilities/exceptions.hpp"

#include "utilities/macros.hpp"

#if INCLUDE_ALL_GCS

#include "gc/g1/concurrentMarkThread.hpp"

#include "gc/g1/g1CollectedHeap.inline.hpp"

#include "gc/g1/g1ConcurrentMark.hpp"

#include "gc/g1/heapRegionRemSet.hpp"

#include "gc/parallel/parallelScavengeHeap.inline.hpp"

#include "gc/parallel/adjoiningGenerations.hpp"

#endif // INCLUDE_ALL_GCS

#if INCLUDE_NMT

#include "services/mallocSiteTable.hpp"

#include "services/memTracker.hpp"

#include "utilities/nativeCallStack.hpp"

#endif // INCLUDE_NMT

#define SIZE_T_MAX_VALUE ((size_t) -1)

bool WhiteBox::_used = false;

volatile bool WhiteBox::compilation_locked = false;

class VM_WhiteBoxOperation : public VM_Operation {

 public:

  VM_WhiteBoxOperation()                         { }

  VMOp_Type type()                  const        { return VMOp_WhiteBoxOperation; }

  bool allow_nested_vm_operations() const        { return true; }

};

WB_ENTRY(jlong, WB_GetObjectAddress(JNIEnv* env, jobject o, jobject obj))

  return (jlong)(void*)JNIHandles::resolve(obj);

WB_END

WB_ENTRY(jint, WB_GetHeapOopSize(JNIEnv* env, jobject o))

  return heapOopSize;

WB_END

WB_ENTRY(jint, WB_GetVMPageSize(JNIEnv* env, jobject o))

  return os::vm_page_size();

WB_END

WB_ENTRY(jlong, WB_GetVMAllocationGranularity(JNIEnv* env, jobject o))

  return os::vm_allocation_granularity();

WB_END

WB_ENTRY(jlong, WB_GetVMLargePageSize(JNIEnv* env, jobject o))

  return os::large_page_size();

WB_END

class WBIsKlassAliveClosure : public KlassClosure {

    Symbol* _name;

    bool _found;

public:

    WBIsKlassAliveClosure(Symbol* name) : _name(name), _found(false) {}

    void do_klass(Klass* k) {

      if (_found) return;

      Symbol* ksym = k->name();

      if (ksym->fast_compare(_name) == 0) {

        _found = true;

      }

    }

    bool found() const {

        return _found;

    }

};

WB_ENTRY(jboolean, WB_IsClassAlive(JNIEnv* env, jobject target, jstring name))

  oop h_name = JNIHandles::resolve(name);

  if (h_name == NULL) return false;

  Symbol* sym = java_lang_String::as_symbol(h_name, CHECK_false);

  TempNewSymbol tsym(sym); // Make sure to decrement reference count on sym on return

  WBIsKlassAliveClosure closure(sym);

  ClassLoaderDataGraph::classes_do(&closure);

  return closure.found();

WB_END

WB_ENTRY(void, WB_AddToBootstrapClassLoaderSearch(JNIEnv* env, jobject o, jstring segment)) {

#if INCLUDE_JVMTI

  ResourceMark rm;

  const char* seg = java_lang_String::as_utf8_string(JNIHandles::resolve_non_null(segment));

  JvmtiEnv* jvmti_env = JvmtiEnv::create_a_jvmti(JVMTI_VERSION);

  jvmtiError err = jvmti_env->AddToBootstrapClassLoaderSearch(seg);

  assert(err == JVMTI_ERROR_NONE, "must not fail");

#endif

}

WB_END

WB_ENTRY(void, WB_AddToSystemClassLoaderSearch(JNIEnv* env, jobject o, jstring segment)) {

#if INCLUDE_JVMTI

  ResourceMark rm;

  const char* seg = java_lang_String::as_utf8_string(JNIHandles::resolve_non_null(segment));

  JvmtiEnv* jvmti_env = JvmtiEnv::create_a_jvmti(JVMTI_VERSION);

  jvmtiError err = jvmti_env->AddToSystemClassLoaderSearch(seg);

  assert(err == JVMTI_ERROR_NONE, "must not fail");

#endif

}

WB_END

WB_ENTRY(jlong, WB_GetCompressedOopsMaxHeapSize(JNIEnv* env, jobject o)) {

  return (jlong)Arguments::max_heap_for_compressed_oops();

}

WB_END

WB_ENTRY(void, WB_PrintHeapSizes(JNIEnv* env, jobject o)) {

  CollectorPolicy * p = Universe::heap()->collector_policy();

  tty->print_cr("Minimum heap " SIZE_FORMAT " Initial heap "

    SIZE_FORMAT " Maximum heap " SIZE_FORMAT " Space alignment " SIZE_FORMAT " Heap alignment " SIZE_FORMAT,

    p->min_heap_byte_size(), p->initial_heap_byte_size(), p->max_heap_byte_size(),

    p->space_alignment(), p->heap_alignment());

}

WB_END

#ifndef PRODUCT

// Forward declaration

void TestReservedSpace_test();

void TestReserveMemorySpecial_test();

void TestVirtualSpace_test();

void TestMetaspaceAux_test();

#endif

WB_ENTRY(void, WB_RunMemoryUnitTests(JNIEnv* env, jobject o))

#ifndef PRODUCT

  TestReservedSpace_test();

  TestReserveMemorySpecial_test();

  TestVirtualSpace_test();

  TestMetaspaceAux_test();

#endif

WB_END

WB_ENTRY(void, WB_ReadFromNoaccessArea(JNIEnv* env, jobject o))

  size_t granularity = os::vm_allocation_granularity();

  ReservedHeapSpace rhs(100 * granularity, granularity, false);

  VirtualSpace vs;

  vs.initialize(rhs, 50 * granularity);

  // Check if constraints are complied

  if (!( UseCompressedOops && rhs.base() != NULL &&

         Universe::narrow_oop_base() != NULL &&

         Universe::narrow_oop_use_implicit_null_checks() )) {

    tty->print_cr("WB_ReadFromNoaccessArea method is useless:\n "

                  "\tUseCompressedOops is %d\n"

                  "\trhs.base() is " PTR_FORMAT "\n"

                  "\tUniverse::narrow_oop_base() is " PTR_FORMAT "\n"

                  "\tUniverse::narrow_oop_use_implicit_null_checks() is %d",

                  UseCompressedOops,

                  p2i(rhs.base()),

                  p2i(Universe::narrow_oop_base()),

                  Universe::narrow_oop_use_implicit_null_checks());

    return;

  }

  tty->print_cr("Reading from no access area... ");

  tty->print_cr("*(vs.low_boundary() - rhs.noaccess_prefix() / 2 ) = %c",

                *(vs.low_boundary() - rhs.noaccess_prefix() / 2 ));

WB_END

static jint wb_stress_virtual_space_resize(size_t reserved_space_size,

                                           size_t magnitude, size_t iterations) {

  size_t granularity = os::vm_allocation_granularity();

  ReservedHeapSpace rhs(reserved_space_size * granularity, granularity, false);

  VirtualSpace vs;

  if (!vs.initialize(rhs, 0)) {

    tty->print_cr("Failed to initialize VirtualSpace. Can't proceed.");

    return 3;

  }

  long seed = os::random();

  tty->print_cr("Random seed is %ld", seed);

  os::init_random(seed);

  for (size_t i = 0; i < iterations; i++) {

    // Whether we will shrink or grow

    bool shrink = os::random() % 2L == 0;

    // Get random delta to resize virtual space

    size_t delta = (size_t)os::random() % magnitude;

    // If we are about to shrink virtual space below zero, then expand instead

    if (shrink && vs.committed_size() < delta) {

      shrink = false;

    }

    // Resizing by delta

    if (shrink) {

      vs.shrink_by(delta);

    } else {

      // If expanding fails expand_by will silently return false

      vs.expand_by(delta, true);

    }

  }

  return 0;

}

WB_ENTRY(jint, WB_StressVirtualSpaceResize(JNIEnv* env, jobject o,

        jlong reserved_space_size, jlong magnitude, jlong iterations))

  tty->print_cr("reservedSpaceSize=" JLONG_FORMAT ", magnitude=" JLONG_FORMAT ", "

                "iterations=" JLONG_FORMAT "\n", reserved_space_size, magnitude,

                iterations);

  if (reserved_space_size < 0 || magnitude < 0 || iterations < 0) {

    tty->print_cr("One of variables printed above is negative. Can't proceed.\n");

    return 1;

  }

  // sizeof(size_t) depends on whether OS is 32bit or 64bit. sizeof(jlong) is

  // always 8 byte. That's why we should avoid overflow in case of 32bit platform.

  if (sizeof(size_t) < sizeof(jlong)) {

    jlong size_t_max_value = (jlong) SIZE_T_MAX_VALUE;

    if (reserved_space_size > size_t_max_value || magnitude > size_t_max_value

        || iterations > size_t_max_value) {

      tty->print_cr("One of variables printed above overflows size_t. Can't proceed.\n");

      return 2;

    }

  }

  return wb_stress_virtual_space_resize((size_t) reserved_space_size,

                                        (size_t) magnitude, (size_t) iterations);

WB_END

static const jint serial_code   = 1;

static const jint parallel_code = 2;

static const jint cms_code      = 4;

static const jint g1_code       = 8;

WB_ENTRY(jint, WB_CurrentGC(JNIEnv* env, jobject o, jobject obj))

  if (UseSerialGC) {

    return serial_code;

  } else if (UseParallelGC || UseParallelOldGC) {

    return parallel_code;

  } if (UseConcMarkSweepGC) {

    return cms_code;

  } else if (UseG1GC) {

    return g1_code;

  }

  ShouldNotReachHere();

  return 0;

WB_END

WB_ENTRY(jint, WB_AllSupportedGC(JNIEnv* env, jobject o, jobject obj))

#if INCLUDE_ALL_GCS

  return serial_code | parallel_code | cms_code | g1_code;

#else

  return serial_code;

#endif // INCLUDE_ALL_GCS

WB_END

WB_ENTRY(jboolean, WB_GCSelectedByErgo(JNIEnv* env, jobject o, jobject obj))

  if (UseSerialGC) {

    return FLAG_IS_ERGO(UseSerialGC);

  } else if (UseParallelGC) {

    return FLAG_IS_ERGO(UseParallelGC);

  } else if (UseParallelOldGC) {

    return FLAG_IS_ERGO(UseParallelOldGC);

  } else if (UseConcMarkSweepGC) {

    return FLAG_IS_ERGO(UseConcMarkSweepGC);

  } else if (UseG1GC) {

    return FLAG_IS_ERGO(UseG1GC);

  }

  ShouldNotReachHere();

  return false;

WB_END

WB_ENTRY(jboolean, WB_isObjectInOldGen(JNIEnv* env, jobject o, jobject obj))

  oop p = JNIHandles::resolve(obj);

#if INCLUDE_ALL_GCS

  if (UseG1GC) {

    G1CollectedHeap* g1 = G1CollectedHeap::heap();

    const HeapRegion* hr = g1->heap_region_containing(p);

    if (hr == NULL) {

      return false;

    }

    return !(hr->is_young());

  } else if (UseParallelGC) {

    ParallelScavengeHeap* psh = ParallelScavengeHeap::heap();

    return !psh->is_in_young(p);

  }

#endif // INCLUDE_ALL_GCS

  GenCollectedHeap* gch = GenCollectedHeap::heap();

  return !gch->is_in_young(p);

WB_END

WB_ENTRY(jlong, WB_GetObjectSize(JNIEnv* env, jobject o, jobject obj))

  oop p = JNIHandles::resolve(obj);

  return p->size() * HeapWordSize;

WB_END

WB_ENTRY(jlong, WB_GetHeapSpaceAlignment(JNIEnv* env, jobject o))

  size_t alignment = Universe::heap()->collector_policy()->space_alignment();

  return (jlong)alignment;

WB_END

WB_ENTRY(jlong, WB_GetHeapAlignment(JNIEnv* env, jobject o))

  size_t alignment = Universe::heap()->collector_policy()->heap_alignment();

  return (jlong)alignment;

WB_END

#if INCLUDE_ALL_GCS

WB_ENTRY(jboolean, WB_G1IsHumongous(JNIEnv* env, jobject o, jobject obj))

WB_END

WB_ENTRY(jboolean, WB_G1BelongsToHumongousRegion(JNIEnv* env, jobject o, jlong addr))

WB_END

WB_ENTRY(jboolean, WB_G1BelongsToFreeRegion(JNIEnv* env, jobject o, jlong addr))

WB_END

WB_ENTRY(jlong, WB_G1NumMaxRegions(JNIEnv* env, jobject o))

WB_END

WB_ENTRY(jlong, WB_G1NumFreeRegions(JNIEnv* env, jobject o))

WB_END

WB_ENTRY(jboolean, WB_G1InConcurrentMark(JNIEnv* env, jobject o))

WB_END

WB_ENTRY(jboolean, WB_G1StartMarkCycle(JNIEnv* env, jobject o))

  }

WB_END

WB_ENTRY(jint, WB_G1RegionSize(JNIEnv* env, jobject o))

WB_END

WB_ENTRY(jlong, WB_PSVirtualSpaceAlignment(JNIEnv* env, jobject o))

#if INCLUDE_ALL_GCS

  if (UseParallelGC) {

    return ParallelScavengeHeap::heap()->gens()->virtual_spaces()->alignment();

  }

#endif // INCLUDE_ALL_GCS

WB_END

WB_ENTRY(jlong, WB_PSHeapGenerationAlignment(JNIEnv* env, jobject o))

#if INCLUDE_ALL_GCS

  if (UseParallelGC) {

    return ParallelScavengeHeap::heap()->generation_alignment();

  }

#endif // INCLUDE_ALL_GCS

WB_END

WB_ENTRY(jobject, WB_G1AuxiliaryMemoryUsage(JNIEnv* env))

WB_END

class OldRegionsLivenessClosure: public HeapRegionClosure {

 private:

  const int _liveness;

  size_t _total_count;

  size_t _total_memory;

  size_t _total_memory_to_free;

 public:

  OldRegionsLivenessClosure(int liveness) :

    _liveness(liveness),

    _total_count(0),

    _total_memory(0),

    _total_memory_to_free(0) { }

    size_t total_count() { return _total_count; }

    size_t total_memory() { return _total_memory; }

    size_t total_memory_to_free() { return _total_memory_to_free; }

  bool doHeapRegion(HeapRegion* r) {

    if (r->is_old()) {

      size_t prev_live = r->marked_bytes();

      size_t live = r->live_bytes();

      size_t size = r->used();

      size_t reg_size = HeapRegion::GrainBytes;

      if (size > 0 && ((int)(live * 100 / size) < _liveness)) {

        _total_memory += size;