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

src/share/vm/utilities/array.hpp@246d977b51f2 (annotated)

src/share/vm/utilities/array.hpp

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

author

coleenp

date

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

changeset 3875

246d977b51f2

parent 2314

f95d63e2154a

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	/*
stefank@2314	2	* Copyright (c) 2000, 2010, 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	#ifndef SHARE_VM_UTILITIES_ARRAY_HPP
stefank@2314	26	#define SHARE_VM_UTILITIES_ARRAY_HPP
stefank@2314	27
stefank@2314	28	#include "memory/allocation.hpp"
stefank@2314	29	#include "memory/allocation.inline.hpp"
stefank@2314	30
duke@435	31	// correct linkage required to compile w/o warnings
duke@435	32	// (must be on file level - cannot be local)
duke@435	33	extern "C" { typedef int (*ftype)(const void*, const void*); }
duke@435	34
duke@435	35
duke@435	36	class ResourceArray: public ResourceObj {
duke@435	37	protected:
duke@435	38	int _length; // the number of array elements
duke@435	39	void* _data; // the array memory
duke@435	40	#ifdef ASSERT
duke@435	41	int _nesting; // the resource area nesting level
duke@435	42	#endif
duke@435	43
duke@435	44	// creation
duke@435	45	ResourceArray() {
duke@435	46	_length = 0;
duke@435	47	_data = NULL;
duke@435	48	DEBUG_ONLY(init_nesting();)
jrose@867	49	// client may call initialize, at most once
duke@435	50	}
duke@435	51
duke@435	52
duke@435	53	ResourceArray(size_t esize, int length) {
jrose@867	54	DEBUG_ONLY(_data = NULL);
jrose@867	55	initialize(esize, length);
jrose@867	56	}
jrose@867	57
jrose@867	58	void initialize(size_t esize, int length) {
duke@435	59	assert(length >= 0, "illegal length");
jrose@867	60	assert(_data == NULL, "must be new object");
duke@435	61	_length = length;
duke@435	62	_data = resource_allocate_bytes(esize * length);
duke@435	63	DEBUG_ONLY(init_nesting();)
duke@435	64	}
duke@435	65
duke@435	66	#ifdef ASSERT
duke@435	67	void init_nesting();
duke@435	68	#endif
duke@435	69
duke@435	70	// helper functions
duke@435	71	void sort (size_t esize, ftype f); // sort the array
duke@435	72	void expand (size_t esize, int i, int& size);// expand the array to include slot i
duke@435	73	void remove_at(size_t esize, int i); // remove the element in slot i
duke@435	74
duke@435	75	public:
duke@435	76	// standard operations
duke@435	77	int length() const { return _length; }
duke@435	78	bool is_empty() const { return length() == 0; }
duke@435	79	};
duke@435	80
duke@435	81
duke@435	82	class CHeapArray: public CHeapObj {
duke@435	83	protected:
duke@435	84	int _length; // the number of array elements
duke@435	85	void* _data; // the array memory
duke@435	86
duke@435	87	// creation
duke@435	88	CHeapArray() {
duke@435	89	_length = 0;
duke@435	90	_data = NULL;
duke@435	91	}
duke@435	92
duke@435	93
duke@435	94	CHeapArray(size_t esize, int length) {
duke@435	95	assert(length >= 0, "illegal length");
duke@435	96	_length = length;
duke@435	97	_data = (void*) NEW_C_HEAP_ARRAY(char *, esize * length);
duke@435	98	}
duke@435	99
duke@435	100	#ifdef ASSERT
duke@435	101	void init_nesting();
duke@435	102	#endif
duke@435	103
duke@435	104	// helper functions
duke@435	105	void sort (size_t esize, ftype f); // sort the array
duke@435	106	void expand (size_t esize, int i, int& size);// expand the array to include slot i
duke@435	107	void remove_at(size_t esize, int i); // remove the element in slot i
duke@435	108
duke@435	109	public:
duke@435	110	// standard operations
duke@435	111	int length() const { return _length; }
duke@435	112	bool is_empty() const { return length() == 0; }
duke@435	113	};
duke@435	114
duke@435	115	#define define_generic_array(array_name,element_type, base_class) \
duke@435	116	class array_name: public base_class { \
duke@435	117	protected: \
duke@435	118	typedef element_type etype; \
duke@435	119	enum { esize = sizeof(etype) }; \
duke@435	120	\
duke@435	121	void base_remove_at(size_t size, int i) { base_class::remove_at(size, i); } \
duke@435	122	\
duke@435	123	public: \
duke@435	124	/* creation */ \
duke@435	125	array_name() : base_class() {} \
duke@435	126	array_name(const int length) : base_class(esize, length) {} \
jrose@867	127	array_name(const int length, const etype fx) { initialize(length, fx); } \
jrose@867	128	void initialize(const int length) { base_class::initialize(esize, length); } \
jrose@867	129	void initialize(const int length, const etype fx) { \
jrose@867	130	initialize(length); \
duke@435	131	for (int i = 0; i < length; i++) ((etype*)_data)[i] = fx; \
duke@435	132	} \
duke@435	133	\
duke@435	134	/* standard operations */ \
duke@435	135	etype& operator [] (const int i) const { \
duke@435	136	assert(0 <= i && i < length(), "index out of bounds"); \
duke@435	137	return ((etype*)_data)[i]; \
duke@435	138	} \
duke@435	139	\
duke@435	140	int index_of(const etype x) const { \
duke@435	141	int i = length(); \
duke@435	142	while (i-- > 0 && ((etype*)_data)[i] != x) ; \
duke@435	143	/* i < 0 || ((etype*)_data)_data[i] == x */ \
duke@435	144	return i; \
duke@435	145	} \
duke@435	146	\
duke@435	147	void sort(int f(etype*, etype*)) { base_class::sort(esize, (ftype)f); } \
duke@435	148	bool contains(const etype x) const { return index_of(x) >= 0; } \
duke@435	149	\
duke@435	150	/* deprecated operations - for compatibility with GrowableArray only */ \
duke@435	151	etype at(const int i) const { return (*this)[i]; } \
duke@435	152	void at_put(const int i, const etype x) { (*this)[i] = x; } \
duke@435	153	etype* adr_at(const int i) { return &(*this)[i]; } \
duke@435	154	int find(const etype x) { return index_of(x); } \
duke@435	155	}; \
duke@435	156
duke@435	157
duke@435	158	#define define_array(array_name,element_type) \
duke@435	159	define_generic_array(array_name, element_type, ResourceArray)
duke@435	160
duke@435	161
duke@435	162	#define define_stack(stack_name,array_name) \
duke@435	163	class stack_name: public array_name { \
duke@435	164	protected: \
duke@435	165	int _size; \
duke@435	166	\
duke@435	167	void grow(const int i, const etype fx) { \
duke@435	168	assert(i >= length(), "index too small"); \
duke@435	169	if (i >= size()) expand(esize, i, _size); \
duke@435	170	for (int j = length(); j <= i; j++) ((etype*)_data)[j] = fx; \
duke@435	171	_length = i+1; \
duke@435	172	} \
duke@435	173	\
duke@435	174	public: \
duke@435	175	/* creation */ \
jrose@867	176	stack_name() : array_name() { _size = 0; } \
jrose@867	177	stack_name(const int size) { initialize(size); } \
jrose@867	178	stack_name(const int size, const etype fx) { initialize(size, fx); } \
jrose@867	179	void initialize(const int size, const etype fx) { \
jrose@867	180	_size = size; \
jrose@867	181	array_name::initialize(size, fx); \
jrose@867	182	/* _length == size, allocation and size are the same */ \
jrose@867	183	} \
jrose@867	184	void initialize(const int size) { \
jrose@867	185	_size = size; \
jrose@867	186	array_name::initialize(size); \
jrose@867	187	_length = 0; /* reset length to zero; _size records the allocation */ \
jrose@867	188	} \
duke@435	189	\
duke@435	190	/* standard operations */ \
duke@435	191	int size() const { return _size; } \
duke@435	192	\
jrose@867	193	int push(const etype x) { \
jrose@867	194	int len = length(); \
jrose@867	195	if (len >= size()) expand(esize, len, _size); \
jrose@867	196	((etype*)_data)[len] = x; \
jrose@867	197	_length = len+1; \
jrose@867	198	return len; \
duke@435	199	} \
duke@435	200	\
duke@435	201	etype pop() { \
duke@435	202	assert(!is_empty(), "stack is empty"); \
duke@435	203	return ((etype*)_data)[--_length]; \
duke@435	204	} \
duke@435	205	\
duke@435	206	etype top() const { \
duke@435	207	assert(!is_empty(), "stack is empty"); \
duke@435	208	return ((etype*)_data)[length() - 1]; \
duke@435	209	} \
duke@435	210	\
duke@435	211	void push_all(const stack_name* stack) { \
duke@435	212	const int l = stack->length(); \
duke@435	213	for (int i = 0; i < l; i++) push(((etype*)(stack->_data))[i]); \
duke@435	214	} \
duke@435	215	\
duke@435	216	etype at_grow(const int i, const etype fx) { \
duke@435	217	if (i >= length()) grow(i, fx); \
duke@435	218	return ((etype*)_data)[i]; \
duke@435	219	} \
duke@435	220	\
duke@435	221	void at_put_grow(const int i, const etype x, const etype fx) { \
duke@435	222	if (i >= length()) grow(i, fx); \
duke@435	223	((etype*)_data)[i] = x; \
duke@435	224	} \
duke@435	225	\
duke@435	226	void truncate(const int length) { \
duke@435	227	assert(0 <= length && length <= this->length(), "illegal length"); \
duke@435	228	_length = length; \
duke@435	229	} \
duke@435	230	\
duke@435	231	void remove_at(int i) { base_remove_at(esize, i); } \
duke@435	232	void remove(etype x) { remove_at(index_of(x)); } \
duke@435	233	\
duke@435	234	/* inserts the given element before the element at index i */ \
duke@435	235	void insert_before(const int i, const etype el) { \
duke@435	236	int len = length(); \
duke@435	237	int new_length = len + 1; \
duke@435	238	if (new_length >= size()) expand(esize, new_length, _size); \
duke@435	239	for (int j = len - 1; j >= i; j--) { \
duke@435	240	((etype*)_data)[j + 1] = ((etype*)_data)[j]; \
duke@435	241	} \
duke@435	242	_length = new_length; \
duke@435	243	at_put(i, el); \
duke@435	244	} \
duke@435	245	\
duke@435	246	/* inserts contents of the given stack before the element at index i */ \
duke@435	247	void insert_before(const int i, const stack_name *st) { \
duke@435	248	if (st->length() == 0) return; \
duke@435	249	int len = length(); \
duke@435	250	int st_len = st->length(); \
duke@435	251	int new_length = len + st_len; \
duke@435	252	if (new_length >= size()) expand(esize, new_length, _size); \
duke@435	253	int j; \
duke@435	254	for (j = len - 1; j >= i; j--) { \
duke@435	255	((etype*)_data)[j + st_len] = ((etype*)_data)[j]; \
duke@435	256	} \
duke@435	257	for (j = 0; j < st_len; j++) { \
duke@435	258	((etype*)_data)[i + j] = ((etype*)st->_data)[j]; \
duke@435	259	} \
duke@435	260	_length = new_length; \
duke@435	261	} \
duke@435	262	\
duke@435	263	/* deprecated operations - for compatibility with GrowableArray only */ \
duke@435	264	int capacity() const { return size(); } \
duke@435	265	void clear() { truncate(0); } \
duke@435	266	void trunc_to(const int length) { truncate(length); } \
jrose@867	267	int append(const etype x) { return push(x); } \
duke@435	268	void appendAll(const stack_name* stack) { push_all(stack); } \
duke@435	269	etype last() const { return top(); } \
duke@435	270	}; \
duke@435	271
duke@435	272
duke@435	273	#define define_resource_list(element_type) \
duke@435	274	define_generic_array(element_type##Array, element_type, ResourceArray) \
duke@435	275	define_stack(element_type##List, element_type##Array)
duke@435	276
duke@435	277	#define define_resource_pointer_list(element_type) \
duke@435	278	define_generic_array(element_type##Array, element_type *, ResourceArray) \
duke@435	279	define_stack(element_type##List, element_type##Array)
duke@435	280
duke@435	281	#define define_c_heap_list(element_type) \
duke@435	282	define_generic_array(element_type##Array, element_type, CHeapArray) \
duke@435	283	define_stack(element_type##List, element_type##Array)
duke@435	284
duke@435	285	#define define_c_heap_pointer_list(element_type) \
duke@435	286	define_generic_array(element_type##Array, element_type *, CHeapArray) \
duke@435	287	define_stack(element_type##List, element_type##Array)
duke@435	288
duke@435	289
duke@435	290	// Arrays for basic types
duke@435	291
duke@435	292	define_array(boolArray, bool) define_stack(boolStack, boolArray)
duke@435	293	define_array(intArray , int ) define_stack(intStack , intArray )
stefank@2314	294
stefank@2314	295	#endif // SHARE_VM_UTILITIES_ARRAY_HPP