• file
• revisions
• annotate
• diff
• comparison
• raw

src/share/vm/classfile/resolutionErrors.cpp@246d977b51f2 (annotated)

src/share/vm/classfile/resolutionErrors.cpp

Mon, 25 Jun 2012 21:33:35 -0400

author

coleenp

date

Mon, 25 Jun 2012 21:33:35 -0400

changeset 3875

246d977b51f2

parent 2708

1d1603768966

child 3900

d2a62e0f25eb

permissions

-rw-r--r--

7178670: runtime/7158800/BadUtf8.java fails in SymbolTable::rehash_table
Summary: Cannot delete _buckets and HashtableEntries in shared space (CDS)
Reviewed-by: acorn, kvn, dlong, dcubed, kamg

duke@435	1	/*
trims@2708	2	* Copyright (c) 2005, 2011, Oracle and/or its affiliates. All rights reserved.
duke@435	3	* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
duke@435	4	*
duke@435	5	* This code is free software; you can redistribute it and/or modify it
duke@435	6	* under the terms of the GNU General Public License version 2 only, as
duke@435	7	* published by the Free Software Foundation.
duke@435	8	*
duke@435	9	* This code is distributed in the hope that it will be useful, but WITHOUT
duke@435	10	* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
duke@435	11	* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
duke@435	12	* version 2 for more details (a copy is included in the LICENSE file that
duke@435	13	* accompanied this code).
duke@435	14	*
duke@435	15	* You should have received a copy of the GNU General Public License version
duke@435	16	* 2 along with this work; if not, write to the Free Software Foundation,
duke@435	17	* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
duke@435	18	*
trims@1907	19	* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
trims@1907	20	* or visit www.oracle.com if you need additional information or have any
trims@1907	21	* questions.
duke@435	22	*
duke@435	23	*/
duke@435	24
stefank@2314	25	#include "precompiled.hpp"
stefank@2314	26	#include "classfile/resolutionErrors.hpp"
stefank@2314	27	#include "memory/resourceArea.hpp"
stefank@2314	28	#include "oops/oop.inline.hpp"
stefank@2314	29	#include "runtime/handles.inline.hpp"
stefank@2314	30	#include "runtime/safepoint.hpp"
stefank@2314	31	#include "utilities/hashtable.inline.hpp"
duke@435	32
duke@435	33	// add new entry to the table
duke@435	34	void ResolutionErrorTable::add_entry(int index, unsigned int hash,
coleenp@2497	35	constantPoolHandle pool, int cp_index, Symbol* error)
duke@435	36	{
duke@435	37	assert_locked_or_safepoint(SystemDictionary_lock);
coleenp@2497	38	assert(!pool.is_null() && error != NULL, "adding NULL obj");
duke@435	39
coleenp@2497	40	ResolutionErrorEntry* entry = new_entry(hash, pool(), cp_index, error);
duke@435	41	add_entry(index, entry);
duke@435	42	}
duke@435	43
duke@435	44	// find entry in the table
duke@435	45	ResolutionErrorEntry* ResolutionErrorTable::find_entry(int index, unsigned int hash,
duke@435	46	constantPoolHandle pool, int cp_index)
duke@435	47	{
duke@435	48	assert_locked_or_safepoint(SystemDictionary_lock);
duke@435	49
duke@435	50	for (ResolutionErrorEntry *error_probe = bucket(index);
duke@435	51	error_probe != NULL;
duke@435	52	error_probe = error_probe->next()) {
duke@435	53	if (error_probe->hash() == hash && error_probe->pool() == pool()) {
duke@435	54	return error_probe;;
duke@435	55	}
duke@435	56	}
duke@435	57	return NULL;
duke@435	58	}
duke@435	59
coleenp@2497	60	void ResolutionErrorEntry::set_error(Symbol* e) {
coleenp@2497	61	assert(e == NULL || _error == NULL, "cannot reset error");
coleenp@2497	62	_error = e;
coleenp@2497	63	if (_error != NULL) _error->increment_refcount();
coleenp@2497	64	}
coleenp@2497	65
duke@435	66	// create new error entry
duke@435	67	ResolutionErrorEntry* ResolutionErrorTable::new_entry(int hash, constantPoolOop pool,
coleenp@2497	68	int cp_index, Symbol* error)
duke@435	69	{
coleenp@2497	70	ResolutionErrorEntry* entry = (ResolutionErrorEntry*)Hashtable<constantPoolOop>::new_entry(hash, pool);
duke@435	71	entry->set_cp_index(cp_index);
coleenp@2497	72	NOT_PRODUCT(entry->set_error(NULL);)
duke@435	73	entry->set_error(error);
duke@435	74
duke@435	75	return entry;
duke@435	76	}
duke@435	77
coleenp@2497	78	void ResolutionErrorTable::free_entry(ResolutionErrorEntry *entry) {
coleenp@2497	79	// decrement error refcount
coleenp@2497	80	assert(entry->error() != NULL, "error should be set");
coleenp@2497	81	entry->error()->decrement_refcount();
coleenp@2497	82	Hashtable<constantPoolOop>::free_entry(entry);
coleenp@2497	83	}
coleenp@2497	84
coleenp@2497	85
duke@435	86	// create resolution error table
duke@435	87	ResolutionErrorTable::ResolutionErrorTable(int table_size)
coleenp@2497	88	: Hashtable<constantPoolOop>(table_size, sizeof(ResolutionErrorEntry)) {
duke@435	89	}
duke@435	90
duke@435	91	// GC support
duke@435	92	void ResolutionErrorTable::oops_do(OopClosure* f) {
duke@435	93	for (int i = 0; i < table_size(); i++) {
duke@435	94	for (ResolutionErrorEntry* probe = bucket(i);
duke@435	95	probe != NULL;
duke@435	96	probe = probe->next()) {
duke@435	97	assert(probe->pool() != (constantPoolOop)NULL, "resolution error table is corrupt");
coleenp@2497	98	assert(probe->error() != (Symbol*)NULL, "resolution error table is corrupt");
duke@435	99	probe->oops_do(f);
duke@435	100	}
duke@435	101	}
duke@435	102	}
duke@435	103
duke@435	104	// GC support
duke@435	105	void ResolutionErrorEntry::oops_do(OopClosure* blk) {
duke@435	106	blk->do_oop((oop*)pool_addr());
duke@435	107	}
duke@435	108
duke@435	109	// Remove unloaded entries from the table
duke@435	110	void ResolutionErrorTable::purge_resolution_errors(BoolObjectClosure* is_alive) {
jcoomes@1844	111	assert(SafepointSynchronize::is_at_safepoint(), "must be at safepoint");
duke@435	112	for (int i = 0; i < table_size(); i++) {
duke@435	113	for (ResolutionErrorEntry** p = bucket_addr(i); *p != NULL; ) {
duke@435	114	ResolutionErrorEntry* entry = *p;
duke@435	115	assert(entry->pool() != (constantPoolOop)NULL, "resolution error table is corrupt");
duke@435	116	constantPoolOop pool = entry->pool();
duke@435	117	if (is_alive->do_object_b(pool)) {
duke@435	118	p = entry->next_addr();
duke@435	119	} else {
duke@435	120	*p = entry->next();
duke@435	121	free_entry(entry);
duke@435	122	}
duke@435	123	}
duke@435	124	}
duke@435	125	}