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

src/share/vm/memory/space.inline.hpp@d1605aabd0a1 (annotated)

src/share/vm/memory/space.inline.hpp

Wed, 02 Jul 2008 12:55:16 -0700

author

xdono

date

Wed, 02 Jul 2008 12:55:16 -0700

changeset 631

d1605aabd0a1

parent 435

a61af66fc99e

child 777

37f87013dfd8

permissions

-rw-r--r--

6719955: Update copyright year
Summary: Update copyright year for files that have been modified in 2008
Reviewed-by: ohair, tbell

duke@435	1	/*
duke@435	2	* Copyright 2000-2006 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	inline HeapWord* OffsetTableContigSpace::allocate(size_t size) {
duke@435	26	HeapWord* res = ContiguousSpace::allocate(size);
duke@435	27	if (res != NULL) {
duke@435	28	_offsets.alloc_block(res, size);
duke@435	29	}
duke@435	30	return res;
duke@435	31	}
duke@435	32
duke@435	33	// Because of the requirement of keeping "_offsets" up to date with the
duke@435	34	// allocations, we sequentialize these with a lock. Therefore, best if
duke@435	35	// this is used for larger LAB allocations only.
duke@435	36	inline HeapWord* OffsetTableContigSpace::par_allocate(size_t size) {
duke@435	37	MutexLocker x(&_par_alloc_lock);
duke@435	38	// This ought to be just "allocate", because of the lock above, but that
duke@435	39	// ContiguousSpace::allocate asserts that either the allocating thread
duke@435	40	// holds the heap lock or it is the VM thread and we're at a safepoint.
duke@435	41	// The best I (dld) could figure was to put a field in ContiguousSpace
duke@435	42	// meaning "locking at safepoint taken care of", and set/reset that
duke@435	43	// here. But this will do for now, especially in light of the comment
duke@435	44	// above. Perhaps in the future some lock-free manner of keeping the
duke@435	45	// coordination.
duke@435	46	HeapWord* res = ContiguousSpace::par_allocate(size);
duke@435	47	if (res != NULL) {
duke@435	48	_offsets.alloc_block(res, size);
duke@435	49	}
duke@435	50	return res;
duke@435	51	}
duke@435	52
duke@435	53	inline HeapWord* OffsetTableContigSpace::block_start(const void* p) const {
duke@435	54	return _offsets.block_start(p);
duke@435	55	}
duke@435	56
duke@435	57	inline HeapWord* ContiguousSpace::concurrent_iteration_safe_limit()
duke@435	58	{
duke@435	59	assert(_concurrent_iteration_safe_limit <= top(),
duke@435	60	"_concurrent_iteration_safe_limit update missed");
duke@435	61	return _concurrent_iteration_safe_limit;
duke@435	62	}
duke@435	63
duke@435	64	inline void ContiguousSpace::set_concurrent_iteration_safe_limit(HeapWord* new_limit)
duke@435	65	{
duke@435	66	assert(new_limit <= top(), "uninitialized objects in the safe range");
duke@435	67	_concurrent_iteration_safe_limit = new_limit;
duke@435	68	}