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

src/share/vm/utilities/array.hpp@9f4457a14b58 (annotated)

src/share/vm/utilities/array.hpp

Wed, 09 Apr 2008 15:10:22 -0700

author

rasbold

date

Wed, 09 Apr 2008 15:10:22 -0700

changeset 544

9f4457a14b58

parent 435

a61af66fc99e

child 867

275a3b7ff0d6

permissions

-rw-r--r--

Merge

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