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

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

src/share/vm/utilities/array.hpp

Tue, 29 Apr 2014 15:17:27 +0200

author

goetz

date

Tue, 29 Apr 2014 15:17:27 +0200

changeset 6911

ce8f6bb717c9

parent 6680

78bbf4d43a14

child 6992

2c6ef90f030a

permissions

-rw-r--r--

8042195: Introduce umbrella header orderAccess.inline.hpp.
Reviewed-by: dholmes, kvn, stefank, twisti

duke@435	1	/*
coleenp@6307	2	* Copyright (c) 2000, 2014, 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"
coleenp@4037	30	#include "memory/metaspace.hpp"
goetz@6911	31	#include "runtime/orderAccess.hpp"
stefank@2314	32
duke@435	33	// correct linkage required to compile w/o warnings
duke@435	34	// (must be on file level - cannot be local)
duke@435	35	extern "C" { typedef int (*ftype)(const void*, const void*); }
duke@435	36
duke@435	37
duke@435	38	class ResourceArray: public ResourceObj {
duke@435	39	protected:
duke@435	40	int _length; // the number of array elements
duke@435	41	void* _data; // the array memory
duke@435	42	#ifdef ASSERT
duke@435	43	int _nesting; // the resource area nesting level
duke@435	44	#endif
duke@435	45
duke@435	46	// creation
duke@435	47	ResourceArray() {
duke@435	48	_length = 0;
duke@435	49	_data = NULL;
duke@435	50	DEBUG_ONLY(init_nesting();)
jrose@867	51	// client may call initialize, at most once
duke@435	52	}
duke@435	53
duke@435	54
duke@435	55	ResourceArray(size_t esize, int length) {
jrose@867	56	DEBUG_ONLY(_data = NULL);
jrose@867	57	initialize(esize, length);
jrose@867	58	}
jrose@867	59
jrose@867	60	void initialize(size_t esize, int length) {
duke@435	61	assert(length >= 0, "illegal length");
coleenp@6307	62	assert(StressRewriter || _data == NULL, "must be new object");
duke@435	63	_length = length;
duke@435	64	_data = resource_allocate_bytes(esize * length);
duke@435	65	DEBUG_ONLY(init_nesting();)
duke@435	66	}
duke@435	67
duke@435	68	#ifdef ASSERT
duke@435	69	void init_nesting();
duke@435	70	#endif
duke@435	71
duke@435	72	// helper functions
duke@435	73	void sort (size_t esize, ftype f); // sort the array
duke@435	74	void expand (size_t esize, int i, int& size);// expand the array to include slot i
duke@435	75	void remove_at(size_t esize, int i); // remove the element in slot i
duke@435	76
duke@435	77	public:
duke@435	78	// standard operations
duke@435	79	int length() const { return _length; }
duke@435	80	bool is_empty() const { return length() == 0; }
duke@435	81	};
duke@435	82
duke@435	83
zgu@3900	84	template <MEMFLAGS F>class CHeapArray: public CHeapObj<F> {
duke@435	85	protected:
duke@435	86	int _length; // the number of array elements
duke@435	87	void* _data; // the array memory
duke@435	88
duke@435	89	// creation
duke@435	90	CHeapArray() {
duke@435	91	_length = 0;
duke@435	92	_data = NULL;
duke@435	93	}
duke@435	94
duke@435	95
duke@435	96	CHeapArray(size_t esize, int length) {
duke@435	97	assert(length >= 0, "illegal length");
duke@435	98	_length = length;
zgu@3900	99	_data = (void*) NEW_C_HEAP_ARRAY(char *, esize * length, F);
duke@435	100	}
duke@435	101
coleenp@4037	102	void initialize(size_t esize, int length) {
coleenp@4037	103	// In debug set array to 0?
coleenp@4037	104	}
coleenp@4037	105
duke@435	106	#ifdef ASSERT
duke@435	107	void init_nesting();
duke@435	108	#endif
duke@435	109
duke@435	110	// helper functions
duke@435	111	void sort (size_t esize, ftype f); // sort the array
duke@435	112	void expand (size_t esize, int i, int& size);// expand the array to include slot i
duke@435	113	void remove_at(size_t esize, int i); // remove the element in slot i
duke@435	114
duke@435	115	public:
duke@435	116	// standard operations
duke@435	117	int length() const { return _length; }
duke@435	118	bool is_empty() const { return length() == 0; }
duke@435	119	};
duke@435	120
duke@435	121	#define define_generic_array(array_name,element_type, base_class) \
duke@435	122	class array_name: public base_class { \
duke@435	123	protected: \
duke@435	124	typedef element_type etype; \
duke@435	125	enum { esize = sizeof(etype) }; \
duke@435	126	\
duke@435	127	void base_remove_at(size_t size, int i) { base_class::remove_at(size, i); } \
duke@435	128	\
duke@435	129	public: \
duke@435	130	/* creation */ \
duke@435	131	array_name() : base_class() {} \
coleenp@4037	132	explicit array_name(const int length) : base_class(esize, length) {} \
jrose@867	133	array_name(const int length, const etype fx) { initialize(length, fx); } \
jrose@867	134	void initialize(const int length) { base_class::initialize(esize, length); } \
jrose@867	135	void initialize(const int length, const etype fx) { \
jrose@867	136	initialize(length); \
duke@435	137	for (int i = 0; i < length; i++) ((etype*)_data)[i] = fx; \
duke@435	138	} \
duke@435	139	\
duke@435	140	/* standard operations */ \
duke@435	141	etype& operator [] (const int i) const { \
duke@435	142	assert(0 <= i && i < length(), "index out of bounds"); \
duke@435	143	return ((etype*)_data)[i]; \
duke@435	144	} \
duke@435	145	\
duke@435	146	int index_of(const etype x) const { \
duke@435	147	int i = length(); \
duke@435	148	while (i-- > 0 && ((etype*)_data)[i] != x) ; \
duke@435	149	/* i < 0 || ((etype*)_data)_data[i] == x */ \
duke@435	150	return i; \
duke@435	151	} \
duke@435	152	\
duke@435	153	void sort(int f(etype*, etype*)) { base_class::sort(esize, (ftype)f); } \
duke@435	154	bool contains(const etype x) const { return index_of(x) >= 0; } \
duke@435	155	\
duke@435	156	/* deprecated operations - for compatibility with GrowableArray only */ \
duke@435	157	etype at(const int i) const { return (*this)[i]; } \
duke@435	158	void at_put(const int i, const etype x) { (*this)[i] = x; } \
duke@435	159	etype* adr_at(const int i) { return &(*this)[i]; } \
duke@435	160	int find(const etype x) { return index_of(x); } \
duke@435	161	}; \
duke@435	162
duke@435	163
duke@435	164	#define define_array(array_name,element_type) \
duke@435	165	define_generic_array(array_name, element_type, ResourceArray)
duke@435	166
duke@435	167
duke@435	168	#define define_stack(stack_name,array_name) \
duke@435	169	class stack_name: public array_name { \
duke@435	170	protected: \
duke@435	171	int _size; \
duke@435	172	\
duke@435	173	void grow(const int i, const etype fx) { \
duke@435	174	assert(i >= length(), "index too small"); \
duke@435	175	if (i >= size()) expand(esize, i, _size); \
duke@435	176	for (int j = length(); j <= i; j++) ((etype*)_data)[j] = fx; \
duke@435	177	_length = i+1; \
duke@435	178	} \
duke@435	179	\
duke@435	180	public: \
duke@435	181	/* creation */ \
jrose@867	182	stack_name() : array_name() { _size = 0; } \
jrose@867	183	stack_name(const int size) { initialize(size); } \
jrose@867	184	stack_name(const int size, const etype fx) { initialize(size, fx); } \
jrose@867	185	void initialize(const int size, const etype fx) { \
jrose@867	186	_size = size; \
jrose@867	187	array_name::initialize(size, fx); \
jrose@867	188	/* _length == size, allocation and size are the same */ \
jrose@867	189	} \
jrose@867	190	void initialize(const int size) { \
jrose@867	191	_size = size; \
jrose@867	192	array_name::initialize(size); \
jrose@867	193	_length = 0; /* reset length to zero; _size records the allocation */ \
jrose@867	194	} \
duke@435	195	\
duke@435	196	/* standard operations */ \
duke@435	197	int size() const { return _size; } \
duke@435	198	\
jrose@867	199	int push(const etype x) { \
jrose@867	200	int len = length(); \
jrose@867	201	if (len >= size()) expand(esize, len, _size); \
jrose@867	202	((etype*)_data)[len] = x; \
jrose@867	203	_length = len+1; \
jrose@867	204	return len; \
duke@435	205	} \
duke@435	206	\
duke@435	207	etype pop() { \
duke@435	208	assert(!is_empty(), "stack is empty"); \
duke@435	209	return ((etype*)_data)[--_length]; \
duke@435	210	} \
duke@435	211	\
duke@435	212	etype top() const { \
duke@435	213	assert(!is_empty(), "stack is empty"); \
duke@435	214	return ((etype*)_data)[length() - 1]; \
duke@435	215	} \
duke@435	216	\
duke@435	217	void push_all(const stack_name* stack) { \
duke@435	218	const int l = stack->length(); \
duke@435	219	for (int i = 0; i < l; i++) push(((etype*)(stack->_data))[i]); \
duke@435	220	} \
duke@435	221	\
duke@435	222	etype at_grow(const int i, const etype fx) { \
duke@435	223	if (i >= length()) grow(i, fx); \
duke@435	224	return ((etype*)_data)[i]; \
duke@435	225	} \
duke@435	226	\
duke@435	227	void at_put_grow(const int i, const etype x, const etype fx) { \
duke@435	228	if (i >= length()) grow(i, fx); \
duke@435	229	((etype*)_data)[i] = x; \
duke@435	230	} \
duke@435	231	\
duke@435	232	void truncate(const int length) { \
duke@435	233	assert(0 <= length && length <= this->length(), "illegal length"); \
duke@435	234	_length = length; \
duke@435	235	} \
duke@435	236	\
duke@435	237	void remove_at(int i) { base_remove_at(esize, i); } \
duke@435	238	void remove(etype x) { remove_at(index_of(x)); } \
duke@435	239	\
duke@435	240	/* inserts the given element before the element at index i */ \
duke@435	241	void insert_before(const int i, const etype el) { \
duke@435	242	int len = length(); \
duke@435	243	int new_length = len + 1; \
duke@435	244	if (new_length >= size()) expand(esize, new_length, _size); \
duke@435	245	for (int j = len - 1; j >= i; j--) { \
duke@435	246	((etype*)_data)[j + 1] = ((etype*)_data)[j]; \
duke@435	247	} \
duke@435	248	_length = new_length; \
duke@435	249	at_put(i, el); \
duke@435	250	} \
duke@435	251	\
duke@435	252	/* inserts contents of the given stack before the element at index i */ \
duke@435	253	void insert_before(const int i, const stack_name *st) { \
duke@435	254	if (st->length() == 0) return; \
duke@435	255	int len = length(); \
duke@435	256	int st_len = st->length(); \
duke@435	257	int new_length = len + st_len; \
duke@435	258	if (new_length >= size()) expand(esize, new_length, _size); \
duke@435	259	int j; \
duke@435	260	for (j = len - 1; j >= i; j--) { \
duke@435	261	((etype*)_data)[j + st_len] = ((etype*)_data)[j]; \
duke@435	262	} \
duke@435	263	for (j = 0; j < st_len; j++) { \
duke@435	264	((etype*)_data)[i + j] = ((etype*)st->_data)[j]; \
duke@435	265	} \
duke@435	266	_length = new_length; \
duke@435	267	} \
duke@435	268	\
duke@435	269	/* deprecated operations - for compatibility with GrowableArray only */ \
duke@435	270	int capacity() const { return size(); } \
duke@435	271	void clear() { truncate(0); } \
duke@435	272	void trunc_to(const int length) { truncate(length); } \
jrose@867	273	int append(const etype x) { return push(x); } \
duke@435	274	void appendAll(const stack_name* stack) { push_all(stack); } \
duke@435	275	etype last() const { return top(); } \
duke@435	276	}; \
duke@435	277
duke@435	278
duke@435	279	#define define_resource_list(element_type) \
duke@435	280	define_generic_array(element_type##Array, element_type, ResourceArray) \
duke@435	281	define_stack(element_type##List, element_type##Array)
duke@435	282
duke@435	283	#define define_resource_pointer_list(element_type) \
duke@435	284	define_generic_array(element_type##Array, element_type *, ResourceArray) \
duke@435	285	define_stack(element_type##List, element_type##Array)
duke@435	286
duke@435	287	#define define_c_heap_list(element_type) \
duke@435	288	define_generic_array(element_type##Array, element_type, CHeapArray) \
duke@435	289	define_stack(element_type##List, element_type##Array)
duke@435	290
duke@435	291	#define define_c_heap_pointer_list(element_type) \
duke@435	292	define_generic_array(element_type##Array, element_type *, CHeapArray) \
duke@435	293	define_stack(element_type##List, element_type##Array)
duke@435	294
duke@435	295
duke@435	296	// Arrays for basic types
duke@435	297
duke@435	298	define_array(boolArray, bool) define_stack(boolStack, boolArray)
duke@435	299	define_array(intArray , int ) define_stack(intStack , intArray )
stefank@2314	300
coleenp@4037	301	// Array for metadata allocation
coleenp@4037	302
coleenp@4037	303	template <typename T>
coleenp@4037	304	class Array: public MetaspaceObj {
coleenp@4037	305	friend class MetadataFactory;
coleenp@4037	306	friend class VMStructs;
coleenp@4037	307	friend class MethodHandleCompiler; // special case
coleenp@4037	308	protected:
coleenp@4037	309	int _length; // the number of array elements
coleenp@4037	310	T _data[1]; // the array memory
coleenp@4037	311
coleenp@4037	312	void initialize(int length) {
coleenp@4037	313	_length = length;
coleenp@4037	314	}
coleenp@4037	315
coleenp@4037	316	private:
coleenp@4037	317	// Turn off copy constructor and assignment operator.
coleenp@4037	318	Array(const Array<T>&);
coleenp@4037	319	void operator=(const Array<T>&);
coleenp@4037	320
coleenp@5614	321	void* operator new(size_t size, ClassLoaderData* loader_data, int length, bool read_only, TRAPS) throw() {
coleenp@4037	322	size_t word_size = Array::size(length);
coleenp@4037	323	return (void*) Metaspace::allocate(loader_data, word_size, read_only,
iklam@5208	324	MetaspaceObj::array_type(sizeof(T)), CHECK_NULL);
coleenp@4037	325	}
coleenp@4037	326
coleenp@4037	327	static size_t byte_sizeof(int length) { return sizeof(Array<T>) + MAX2(length - 1, 0) * sizeof(T); }
coleenp@4037	328
coleenp@4037	329	explicit Array(int length) : _length(length) {
coleenp@4037	330	assert(length >= 0, "illegal length");
coleenp@4037	331	}
coleenp@4037	332
coleenp@4037	333	Array(int length, T init) : _length(length) {
coleenp@4037	334	assert(length >= 0, "illegal length");
coleenp@4037	335	for (int i = 0; i < length; i++) {
coleenp@4037	336	_data[i] = init;
coleenp@4037	337	}
coleenp@4037	338	}
coleenp@4037	339
coleenp@4037	340	public:
coleenp@4037	341
coleenp@4037	342	// standard operations
coleenp@4037	343	int length() const { return _length; }
coleenp@4037	344	T* data() { return _data; }
coleenp@4037	345	bool is_empty() const { return length() == 0; }
coleenp@4037	346
coleenp@4037	347	int index_of(const T& x) const {
coleenp@4037	348	int i = length();
coleenp@4037	349	while (i-- > 0 && _data[i] != x) ;
coleenp@4037	350
coleenp@4037	351	return i;
coleenp@4037	352	}
coleenp@4037	353
coleenp@4037	354	// sort the array.
coleenp@4037	355	bool contains(const T& x) const { return index_of(x) >= 0; }
coleenp@4037	356
zgu@5787	357	T at(int i) const { assert(i >= 0 && i< _length, err_msg("oob: 0 <= %d < %d", i, _length)); return _data[i]; }
zgu@5787	358	void at_put(const int i, const T& x) { assert(i >= 0 && i< _length, err_msg("oob: 0 <= %d < %d", i, _length)); _data[i] = x; }
zgu@5787	359	T* adr_at(const int i) { assert(i >= 0 && i< _length, err_msg("oob: 0 <= %d < %d", i, _length)); return &_data[i]; }
coleenp@4037	360	int find(const T& x) { return index_of(x); }
coleenp@4037	361
coleenp@4037	362	T at_acquire(const int which) { return OrderAccess::load_acquire(adr_at(which)); }
coleenp@4037	363	void release_at_put(int which, T contents) { OrderAccess::release_store(adr_at(which), contents); }
coleenp@4037	364
coleenp@4037	365	static int size(int length) {
coleenp@4037	366	return align_size_up(byte_sizeof(length), BytesPerWord) / BytesPerWord;
coleenp@4037	367	}
coleenp@4037	368
coleenp@4037	369	int size() {
coleenp@4037	370	return size(_length);
coleenp@4037	371	}
coleenp@4037	372
coleenp@4037	373	static int length_offset_in_bytes() { return (int) (offset_of(Array<T>, _length)); }
coleenp@4037	374	// Note, this offset don't have to be wordSize aligned.
coleenp@4037	375	static int base_offset_in_bytes() { return (int) (offset_of(Array<T>, _data)); };
coleenp@4037	376
coleenp@4037	377	// FIXME: How to handle this?
coleenp@4037	378	void print_value_on(outputStream* st) const {
drchase@6680	379	st->print("Array<T>(" INTPTR_FORMAT ")", p2i(this));
coleenp@4037	380	}
coleenp@4037	381
coleenp@4037	382	#ifndef PRODUCT
coleenp@4037	383	void print(outputStream* st) {
coleenp@4037	384	for (int i = 0; i< _length; i++) {
coleenp@4037	385	st->print_cr("%d: " INTPTR_FORMAT, i, (intptr_t)at(i));
coleenp@4037	386	}
coleenp@4037	387	}
coleenp@4037	388	void print() { print(tty); }
coleenp@4037	389	#endif // PRODUCT
coleenp@4037	390	};
coleenp@4037	391
coleenp@4037	392
stefank@2314	393	#endif // SHARE_VM_UTILITIES_ARRAY_HPP