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

src/share/vm/utilities/array.cpp@a5d6f0c3585f (annotated)

src/share/vm/utilities/array.cpp

Sat, 18 May 2013 20:41:01 -0700

author

iklam

date

Sat, 18 May 2013 20:41:01 -0700

changeset 5144

a5d6f0c3585f

parent 4299

f34d701e952e

child 6876

710a3c8b516e

permissions

-rw-r--r--

8014262: PrintStringTableStatistics should include more footprint info
Summary: Added info for the string/symbol objects and the hash entries
Reviewed-by: coleenp, rbackman

duke@435	1	/*
mikael@4153	2	* Copyright (c) 2000, 2012, 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 "memory/resourceArea.hpp"
stefank@4299	27	#include "runtime/thread.inline.hpp"
stefank@2314	28	#include "utilities/array.hpp"
duke@435	29
duke@435	30
duke@435	31	#ifdef ASSERT
duke@435	32	void ResourceArray::init_nesting() {
duke@435	33	_nesting = Thread::current()->resource_area()->nesting();
duke@435	34	}
duke@435	35	#endif
duke@435	36
duke@435	37
duke@435	38	void ResourceArray::sort(size_t esize, ftype f) {
duke@435	39	if (!is_empty()) qsort(_data, length(), esize, f);
duke@435	40	}
zgu@3900	41	template <MEMFLAGS F> void CHeapArray<F>::sort(size_t esize, ftype f) {
duke@435	42	if (!is_empty()) qsort(_data, length(), esize, f);
duke@435	43	}
duke@435	44
duke@435	45
duke@435	46	void ResourceArray::expand(size_t esize, int i, int& size) {
duke@435	47	// make sure we are expanding within the original resource mark
duke@435	48	assert(
duke@435	49	_nesting == Thread::current()->resource_area()->nesting(),
duke@435	50	"allocating outside original resource mark"
duke@435	51	);
duke@435	52	// determine new size
duke@435	53	if (size == 0) size = 4; // prevent endless loop
duke@435	54	while (i >= size) size *= 2;
duke@435	55	// allocate and initialize new data section
duke@435	56	void* data = resource_allocate_bytes(esize * size);
duke@435	57	memcpy(data, _data, esize * length());
duke@435	58	_data = data;
duke@435	59	}
duke@435	60
duke@435	61
zgu@3900	62	template <MEMFLAGS F> void CHeapArray<F>::expand(size_t esize, int i, int& size) {
duke@435	63	// determine new size
duke@435	64	if (size == 0) size = 4; // prevent endless loop
duke@435	65	while (i >= size) size *= 2;
duke@435	66	// allocate and initialize new data section
zgu@3900	67	void* data = NEW_C_HEAP_ARRAY(char*, esize * size, F);
duke@435	68	memcpy(data, _data, esize * length());
zgu@3900	69	FREE_C_HEAP_ARRAY(char*, _data, F);
duke@435	70	_data = data;
duke@435	71	}
duke@435	72
duke@435	73
duke@435	74	void ResourceArray::remove_at(size_t esize, int i) {
duke@435	75	assert(0 <= i && i < length(), "index out of bounds");
duke@435	76	_length--;
duke@435	77	void* dst = (char*)_data + i*esize;
duke@435	78	void* src = (char*)dst + esize;
duke@435	79	size_t cnt = (length() - i)*esize;
duke@435	80	memmove(dst, src, cnt);
duke@435	81	}
duke@435	82
zgu@3900	83	template <MEMFLAGS F> void CHeapArray<F>::remove_at(size_t esize, int i) {
duke@435	84	assert(0 <= i && i < length(), "index out of bounds");
duke@435	85	_length--;
duke@435	86	void* dst = (char*)_data + i*esize;
duke@435	87	void* src = (char*)dst + esize;
duke@435	88	size_t cnt = (length() - i)*esize;
duke@435	89	memmove(dst, src, cnt);
duke@435	90	}