0N/A/*
2273N/A * Copyright (c) 2003, 2011, Oracle and/or its affiliates. All rights reserved.
0N/A * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
0N/A *
0N/A * This code is free software; you can redistribute it and/or modify it
0N/A * under the terms of the GNU General Public License version 2 only, as
0N/A * published by the Free Software Foundation.
0N/A *
0N/A * This code is distributed in the hope that it will be useful, but WITHOUT
0N/A * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
0N/A * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
0N/A * version 2 for more details (a copy is included in the LICENSE file that
0N/A * accompanied this code).
0N/A *
0N/A * You should have received a copy of the GNU General Public License version
0N/A * 2 along with this work; if not, write to the Free Software Foundation,
0N/A * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
0N/A *
1472N/A * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
1472N/A * or visit www.oracle.com if you need additional information or have any
1472N/A * questions.
0N/A *
0N/A */
0N/A
1879N/A#include "precompiled.hpp"
1879N/A#include "classfile/loaderConstraints.hpp"
1879N/A#include "memory/resourceArea.hpp"
1879N/A#include "oops/oop.inline.hpp"
1879N/A#include "runtime/handles.inline.hpp"
1879N/A#include "runtime/safepoint.hpp"
1879N/A#include "utilities/hashtable.inline.hpp"
0N/A
0N/ALoaderConstraintTable::LoaderConstraintTable(int nof_buckets)
3863N/A : Hashtable<klassOop, mtClass>(nof_buckets, sizeof(LoaderConstraintEntry)) {};
0N/A
0N/A
0N/ALoaderConstraintEntry* LoaderConstraintTable::new_entry(
2062N/A unsigned int hash, Symbol* name,
0N/A klassOop klass, int num_loaders,
0N/A int max_loaders) {
0N/A LoaderConstraintEntry* entry;
3863N/A entry = (LoaderConstraintEntry*)Hashtable<klassOop, mtClass>::new_entry(hash, klass);
0N/A entry->set_name(name);
0N/A entry->set_num_loaders(num_loaders);
0N/A entry->set_max_loaders(max_loaders);
0N/A return entry;
0N/A}
0N/A
2062N/Avoid LoaderConstraintTable::free_entry(LoaderConstraintEntry *entry) {
2062N/A // decrement name refcount before freeing
2062N/A entry->name()->decrement_refcount();
3863N/A Hashtable<klassOop, mtClass>::free_entry(entry);
2062N/A}
2062N/A
0N/A
0N/Avoid LoaderConstraintTable::oops_do(OopClosure* f) {
0N/A for (int index = 0; index < table_size(); index++) {
0N/A for (LoaderConstraintEntry* probe = bucket(index);
0N/A probe != NULL;
0N/A probe = probe->next()) {
0N/A if (probe->klass() != NULL) {
0N/A f->do_oop((oop*)probe->klass_addr());
0N/A }
0N/A for (int n = 0; n < probe->num_loaders(); n++) {
0N/A if (probe->loader(n) != NULL) {
0N/A f->do_oop(probe->loader_addr(n));
0N/A }
0N/A }
0N/A }
0N/A }
0N/A}
0N/A
0N/A
0N/A// The loaderConstraintTable must always be accessed with the
0N/A// SystemDictionary lock held. This is true even for readers as
0N/A// entries in the table could be being dynamically resized.
0N/A
0N/ALoaderConstraintEntry** LoaderConstraintTable::find_loader_constraint(
2062N/A Symbol* name, Handle loader) {
0N/A
0N/A unsigned int hash = compute_hash(name);
0N/A int index = hash_to_index(hash);
0N/A LoaderConstraintEntry** pp = bucket_addr(index);
0N/A while (*pp) {
0N/A LoaderConstraintEntry* p = *pp;
0N/A if (p->hash() == hash) {
2062N/A if (p->name() == name) {
0N/A for (int i = p->num_loaders() - 1; i >= 0; i--) {
0N/A if (p->loader(i) == loader()) {
0N/A return pp;
0N/A }
0N/A }
0N/A }
0N/A }
0N/A pp = p->next_addr();
0N/A }
0N/A return pp;
0N/A}
0N/A
0N/A
0N/Avoid LoaderConstraintTable::purge_loader_constraints(BoolObjectClosure* is_alive) {
1409N/A assert(SafepointSynchronize::is_at_safepoint(), "must be at safepoint");
0N/A // Remove unloaded entries from constraint table
0N/A for (int index = 0; index < table_size(); index++) {
0N/A LoaderConstraintEntry** p = bucket_addr(index);
0N/A while(*p) {
0N/A LoaderConstraintEntry* probe = *p;
0N/A klassOop klass = probe->klass();
0N/A // Remove klass that is no longer alive
0N/A if (klass != NULL && !is_alive->do_object_b(klass)) {
0N/A probe->set_klass(NULL);
0N/A if (TraceLoaderConstraints) {
0N/A ResourceMark rm;
0N/A tty->print_cr("[Purging class object from constraint for name %s,"
0N/A " loader list:",
0N/A probe->name()->as_C_string());
0N/A for (int i = 0; i < probe->num_loaders(); i++) {
0N/A tty->print_cr("[ [%d]: %s", i,
0N/A SystemDictionary::loader_name(probe->loader(i)));
0N/A }
0N/A }
0N/A }
0N/A // Remove entries no longer alive from loader array
0N/A int n = 0;
0N/A while (n < probe->num_loaders()) {
0N/A if (probe->loader(n) != NULL) {
0N/A if (!is_alive->do_object_b(probe->loader(n))) {
0N/A if (TraceLoaderConstraints) {
0N/A ResourceMark rm;
0N/A tty->print_cr("[Purging loader %s from constraint for name %s",
0N/A SystemDictionary::loader_name(probe->loader(n)),
0N/A probe->name()->as_C_string()
0N/A );
0N/A }
0N/A
0N/A // Compact array
0N/A int num = probe->num_loaders() - 1;
0N/A probe->set_num_loaders(num);
0N/A probe->set_loader(n, probe->loader(num));
0N/A probe->set_loader(num, NULL);
0N/A
0N/A if (TraceLoaderConstraints) {
0N/A ResourceMark rm;
0N/A tty->print_cr("[New loader list:");
0N/A for (int i = 0; i < probe->num_loaders(); i++) {
0N/A tty->print_cr("[ [%d]: %s", i,
0N/A SystemDictionary::loader_name(probe->loader(i)));
0N/A }
0N/A }
0N/A
0N/A continue; // current element replaced, so restart without
0N/A // incrementing n
0N/A }
0N/A }
0N/A n++;
0N/A }
0N/A // Check whether entry should be purged
0N/A if (probe->num_loaders() < 2) {
0N/A if (TraceLoaderConstraints) {
0N/A ResourceMark rm;
0N/A tty->print("[Purging complete constraint for name %s\n",
0N/A probe->name()->as_C_string());
0N/A }
0N/A
0N/A // Purge entry
0N/A *p = probe->next();
3863N/A FREE_C_HEAP_ARRAY(oop, probe->loaders(), mtClass);
0N/A free_entry(probe);
0N/A } else {
0N/A#ifdef ASSERT
0N/A if (probe->klass() != NULL) {
0N/A assert(is_alive->do_object_b(probe->klass()), "klass should be live");
0N/A }
0N/A for (n = 0; n < probe->num_loaders(); n++) {
0N/A if (probe->loader(n) != NULL) {
0N/A assert(is_alive->do_object_b(probe->loader(n)), "loader should be live");
0N/A }
0N/A }
0N/A#endif
0N/A // Go to next entry
0N/A p = probe->next_addr();
0N/A }
0N/A }
0N/A }
0N/A}
0N/A
2062N/Abool LoaderConstraintTable::add_entry(Symbol* class_name,
0N/A klassOop klass1, Handle class_loader1,
0N/A klassOop klass2, Handle class_loader2) {
0N/A int failure_code = 0; // encode different reasons for failing
0N/A
0N/A if (klass1 != NULL && klass2 != NULL && klass1 != klass2) {
0N/A failure_code = 1;
0N/A } else {
0N/A klassOop klass = klass1 != NULL ? klass1 : klass2;
0N/A
0N/A LoaderConstraintEntry** pp1 = find_loader_constraint(class_name,
0N/A class_loader1);
0N/A if (*pp1 != NULL && (*pp1)->klass() != NULL) {
0N/A if (klass != NULL) {
0N/A if (klass != (*pp1)->klass()) {
0N/A failure_code = 2;
0N/A }
0N/A } else {
0N/A klass = (*pp1)->klass();
0N/A }
0N/A }
0N/A
0N/A LoaderConstraintEntry** pp2 = find_loader_constraint(class_name,
0N/A class_loader2);
0N/A if (*pp2 != NULL && (*pp2)->klass() != NULL) {
0N/A if (klass != NULL) {
0N/A if (klass != (*pp2)->klass()) {
0N/A failure_code = 3;
0N/A }
0N/A } else {
0N/A klass = (*pp2)->klass();
0N/A }
0N/A }
0N/A
0N/A if (failure_code == 0) {
0N/A if (*pp1 == NULL && *pp2 == NULL) {
0N/A unsigned int hash = compute_hash(class_name);
0N/A int index = hash_to_index(hash);
0N/A LoaderConstraintEntry* p;
2062N/A p = new_entry(hash, class_name, klass, 2, 2);
3863N/A p->set_loaders(NEW_C_HEAP_ARRAY(oop, 2, mtClass));
0N/A p->set_loader(0, class_loader1());
0N/A p->set_loader(1, class_loader2());
0N/A p->set_klass(klass);
0N/A p->set_next(bucket(index));
0N/A set_entry(index, p);
0N/A if (TraceLoaderConstraints) {
0N/A ResourceMark rm;
0N/A tty->print("[Adding new constraint for name: %s, loader[0]: %s,"
0N/A " loader[1]: %s ]\n",
2062N/A class_name->as_C_string(),
0N/A SystemDictionary::loader_name(class_loader1()),
0N/A SystemDictionary::loader_name(class_loader2())
0N/A );
0N/A }
0N/A } else if (*pp1 == *pp2) {
0N/A /* constraint already imposed */
0N/A if ((*pp1)->klass() == NULL) {
0N/A (*pp1)->set_klass(klass);
0N/A if (TraceLoaderConstraints) {
0N/A ResourceMark rm;
0N/A tty->print("[Setting class object in existing constraint for"
0N/A " name: %s and loader %s ]\n",
2062N/A class_name->as_C_string(),
0N/A SystemDictionary::loader_name(class_loader1())
0N/A );
0N/A }
0N/A } else {
0N/A assert((*pp1)->klass() == klass, "loader constraints corrupted");
0N/A }
0N/A } else if (*pp1 == NULL) {
0N/A extend_loader_constraint(*pp2, class_loader1, klass);
0N/A } else if (*pp2 == NULL) {
0N/A extend_loader_constraint(*pp1, class_loader2, klass);
0N/A } else {
0N/A merge_loader_constraints(pp1, pp2, klass);
0N/A }
0N/A }
0N/A }
0N/A
0N/A if (failure_code != 0 && TraceLoaderConstraints) {
0N/A ResourceMark rm;
0N/A const char* reason = "";
0N/A switch(failure_code) {
0N/A case 1: reason = "the class objects presented by loader[0] and loader[1]"
0N/A " are different"; break;
0N/A case 2: reason = "the class object presented by loader[0] does not match"
0N/A " the stored class object in the constraint"; break;
0N/A case 3: reason = "the class object presented by loader[1] does not match"
0N/A " the stored class object in the constraint"; break;
0N/A default: reason = "unknown reason code";
0N/A }
0N/A tty->print("[Failed to add constraint for name: %s, loader[0]: %s,"
0N/A " loader[1]: %s, Reason: %s ]\n",
2062N/A class_name->as_C_string(),
0N/A SystemDictionary::loader_name(class_loader1()),
0N/A SystemDictionary::loader_name(class_loader2()),
0N/A reason
0N/A );
0N/A }
0N/A
0N/A return failure_code == 0;
0N/A}
0N/A
0N/A
0N/A// return true if the constraint was updated, false if the constraint is
0N/A// violated
0N/Abool LoaderConstraintTable::check_or_update(instanceKlassHandle k,
0N/A Handle loader,
2062N/A Symbol* name) {
0N/A LoaderConstraintEntry* p = *(find_loader_constraint(name, loader));
0N/A if (p && p->klass() != NULL && p->klass() != k()) {
0N/A if (TraceLoaderConstraints) {
0N/A ResourceMark rm;
0N/A tty->print("[Constraint check failed for name %s, loader %s: "
0N/A "the presented class object differs from that stored ]\n",
2062N/A name->as_C_string(),
0N/A SystemDictionary::loader_name(loader()));
0N/A }
0N/A return false;
0N/A } else {
0N/A if (p && p->klass() == NULL) {
0N/A p->set_klass(k());
0N/A if (TraceLoaderConstraints) {
0N/A ResourceMark rm;
0N/A tty->print("[Updating constraint for name %s, loader %s, "
0N/A "by setting class object ]\n",
2062N/A name->as_C_string(),
0N/A SystemDictionary::loader_name(loader()));
0N/A }
0N/A }
0N/A return true;
0N/A }
0N/A}
0N/A
2062N/AklassOop LoaderConstraintTable::find_constrained_klass(Symbol* name,
0N/A Handle loader) {
0N/A LoaderConstraintEntry *p = *(find_loader_constraint(name, loader));
2116N/A if (p != NULL && p->klass() != NULL) {
2116N/A if (Klass::cast(p->klass())->oop_is_instance() && !instanceKlass::cast(p->klass())->is_loaded()) {
2116N/A // Only return fully loaded classes. Classes found through the
2116N/A // constraints might still be in the process of loading.
2116N/A return NULL;
2116N/A }
0N/A return p->klass();
2116N/A }
0N/A
0N/A // No constraints, or else no klass loaded yet.
0N/A return NULL;
0N/A}
0N/A
0N/Avoid LoaderConstraintTable::ensure_loader_constraint_capacity(
0N/A LoaderConstraintEntry *p,
0N/A int nfree) {
0N/A if (p->max_loaders() - p->num_loaders() < nfree) {
0N/A int n = nfree + p->num_loaders();
3863N/A oop* new_loaders = NEW_C_HEAP_ARRAY(oop, n, mtClass);
0N/A memcpy(new_loaders, p->loaders(), sizeof(oop) * p->num_loaders());
0N/A p->set_max_loaders(n);
3863N/A FREE_C_HEAP_ARRAY(oop, p->loaders(), mtClass);
0N/A p->set_loaders(new_loaders);
0N/A }
0N/A}
0N/A
0N/A
0N/Avoid LoaderConstraintTable::extend_loader_constraint(LoaderConstraintEntry* p,
0N/A Handle loader,
0N/A klassOop klass) {
0N/A ensure_loader_constraint_capacity(p, 1);
0N/A int num = p->num_loaders();
0N/A p->set_loader(num, loader());
0N/A p->set_num_loaders(num + 1);
0N/A if (TraceLoaderConstraints) {
0N/A ResourceMark rm;
0N/A tty->print("[Extending constraint for name %s by adding loader[%d]: %s %s",
0N/A p->name()->as_C_string(),
0N/A num,
0N/A SystemDictionary::loader_name(loader()),
0N/A (p->klass() == NULL ? " and setting class object ]\n" : " ]\n")
0N/A );
0N/A }
0N/A if (p->klass() == NULL) {
0N/A p->set_klass(klass);
0N/A } else {
0N/A assert(klass == NULL || p->klass() == klass, "constraints corrupted");
0N/A }
0N/A}
0N/A
0N/A
0N/Avoid LoaderConstraintTable::merge_loader_constraints(
0N/A LoaderConstraintEntry** pp1,
0N/A LoaderConstraintEntry** pp2,
0N/A klassOop klass) {
0N/A // make sure *pp1 has higher capacity
0N/A if ((*pp1)->max_loaders() < (*pp2)->max_loaders()) {
0N/A LoaderConstraintEntry** tmp = pp2;
0N/A pp2 = pp1;
0N/A pp1 = tmp;
0N/A }
0N/A
0N/A LoaderConstraintEntry* p1 = *pp1;
0N/A LoaderConstraintEntry* p2 = *pp2;
0N/A
0N/A ensure_loader_constraint_capacity(p1, p2->num_loaders());
0N/A
0N/A for (int i = 0; i < p2->num_loaders(); i++) {
0N/A int num = p1->num_loaders();
0N/A p1->set_loader(num, p2->loader(i));
0N/A p1->set_num_loaders(num + 1);
0N/A }
0N/A
0N/A if (TraceLoaderConstraints) {
0N/A ResourceMark rm;
0N/A tty->print_cr("[Merged constraints for name %s, new loader list:",
0N/A p1->name()->as_C_string()
0N/A );
0N/A
0N/A for (int i = 0; i < p1->num_loaders(); i++) {
0N/A tty->print_cr("[ [%d]: %s", i,
0N/A SystemDictionary::loader_name(p1->loader(i)));
0N/A }
0N/A if (p1->klass() == NULL) {
0N/A tty->print_cr("[... and setting class object]");
0N/A }
0N/A }
0N/A
0N/A // p1->klass() will hold NULL if klass, p2->klass(), and old
0N/A // p1->klass() are all NULL. In addition, all three must have
0N/A // matching non-NULL values, otherwise either the constraints would
0N/A // have been violated, or the constraints had been corrupted (and an
0N/A // assertion would fail).
0N/A if (p2->klass() != NULL) {
0N/A assert(p2->klass() == klass, "constraints corrupted");
0N/A }
0N/A if (p1->klass() == NULL) {
0N/A p1->set_klass(klass);
0N/A } else {
0N/A assert(p1->klass() == klass, "constraints corrupted");
0N/A }
0N/A
0N/A *pp2 = p2->next();
3863N/A FREE_C_HEAP_ARRAY(oop, p2->loaders(), mtClass);
0N/A free_entry(p2);
0N/A return;
0N/A}
0N/A
0N/A
1258N/Avoid LoaderConstraintTable::verify(Dictionary* dictionary,
1258N/A PlaceholderTable* placeholders) {
0N/A Thread *thread = Thread::current();
0N/A for (int cindex = 0; cindex < _loader_constraint_size; cindex++) {
0N/A for (LoaderConstraintEntry* probe = bucket(cindex);
0N/A probe != NULL;
0N/A probe = probe->next()) {
0N/A if (probe->klass() != NULL) {
0N/A instanceKlass* ik = instanceKlass::cast(probe->klass());
0N/A guarantee(ik->name() == probe->name(), "name should match");
2062N/A Symbol* name = ik->name();
0N/A Handle loader(thread, ik->class_loader());
0N/A unsigned int d_hash = dictionary->compute_hash(name, loader);
0N/A int d_index = dictionary->hash_to_index(d_hash);
0N/A klassOop k = dictionary->find_class(d_index, d_hash, name, loader);
1258N/A if (k != NULL) {
1258N/A // We found the class in the system dictionary, so we should
1258N/A // make sure that the klassOop matches what we already have.
1258N/A guarantee(k == probe->klass(), "klass should be in dictionary");
1258N/A } else {
1258N/A // If we don't find the class in the system dictionary, it
1258N/A // has to be in the placeholders table.
1258N/A unsigned int p_hash = placeholders->compute_hash(name, loader);
1258N/A int p_index = placeholders->hash_to_index(p_hash);
1258N/A PlaceholderEntry* entry = placeholders->get_entry(p_index, p_hash,
1258N/A name, loader);
1258N/A
1258N/A // The instanceKlass might not be on the entry, so the only
1258N/A // thing we can check here is whether we were successful in
1258N/A // finding the class in the placeholders table.
1258N/A guarantee(entry != NULL, "klass should be in the placeholders");
1258N/A }
0N/A }
0N/A for (int n = 0; n< probe->num_loaders(); n++) {
0N/A guarantee(probe->loader(n)->is_oop_or_null(), "should be oop");
0N/A }
0N/A }
0N/A }
0N/A}
0N/A
0N/A#ifndef PRODUCT
0N/A
0N/A// Called with the system dictionary lock held
0N/Avoid LoaderConstraintTable::print() {
0N/A ResourceMark rm;
0N/A
0N/A assert_locked_or_safepoint(SystemDictionary_lock);
0N/A tty->print_cr("Java loader constraints (entries=%d)", _loader_constraint_size);
0N/A for (int cindex = 0; cindex < _loader_constraint_size; cindex++) {
0N/A for (LoaderConstraintEntry* probe = bucket(cindex);
0N/A probe != NULL;
0N/A probe = probe->next()) {
0N/A tty->print("%4d: ", cindex);
0N/A probe->name()->print();
0N/A tty->print(" , loaders:");
0N/A for (int n = 0; n < probe->num_loaders(); n++) {
0N/A probe->loader(n)->print_value();
0N/A tty->print(", ");
0N/A }
0N/A tty->cr();
0N/A }
0N/A }
0N/A}
0N/A#endif