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

src/share/vm/gc_implementation/parallelScavenge/adjoiningVirtualSpaces.cpp@0fbdb4381b99 (annotated)

src/share/vm/gc_implementation/parallelScavenge/adjoiningVirtualSpaces.cpp

Mon, 09 Mar 2009 13:28:46 -0700

author

xdono

date

Mon, 09 Mar 2009 13:28:46 -0700

changeset 1014

0fbdb4381b99

parent 435

a61af66fc99e

child 1907

c18cbe5936b8

permissions

-rw-r--r--

6814575: Update copyright year
Summary: Update copyright for files that have been modified in 2009, up to 03/09
Reviewed-by: katleman, tbell, ohair

duke@435	1	/*
duke@435	2	* Copyright 2003-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	# include "incls/_precompiled.incl"
duke@435	26	# include "incls/_adjoiningVirtualSpaces.cpp.incl"
duke@435	27
duke@435	28	AdjoiningVirtualSpaces::AdjoiningVirtualSpaces(ReservedSpace rs,
duke@435	29	size_t min_low_byte_size,
duke@435	30	size_t min_high_byte_size,
duke@435	31	size_t alignment) :
duke@435	32	_reserved_space(rs), _min_low_byte_size(min_low_byte_size),
duke@435	33	_min_high_byte_size(min_high_byte_size), _low(0), _high(0),
duke@435	34	_alignment(alignment) {}
duke@435	35
duke@435	36	// The maximum byte sizes are for the initial layout of the
duke@435	37	// virtual spaces and are not the limit on the maximum bytes sizes.
duke@435	38	void AdjoiningVirtualSpaces::initialize(size_t max_low_byte_size,
duke@435	39	size_t init_low_byte_size,
duke@435	40	size_t init_high_byte_size) {
duke@435	41
duke@435	42	// The reserved spaces for the two parts of the virtual space.
duke@435	43	ReservedSpace old_rs = _reserved_space.first_part(max_low_byte_size);
duke@435	44	ReservedSpace young_rs = _reserved_space.last_part(max_low_byte_size);
duke@435	45
duke@435	46	_low = new PSVirtualSpace(old_rs, alignment());
duke@435	47	if (!_low->expand_by(init_low_byte_size)) {
duke@435	48	vm_exit_during_initialization("Could not reserve enough space for "
duke@435	49	"object heap");
duke@435	50	}
duke@435	51
duke@435	52	_high = new PSVirtualSpaceHighToLow(young_rs, alignment());
duke@435	53	if (!_high->expand_by(init_high_byte_size)) {
duke@435	54	vm_exit_during_initialization("Could not reserve enough space for "
duke@435	55	"object heap");
duke@435	56	}
duke@435	57	}
duke@435	58
duke@435	59	bool AdjoiningVirtualSpaces::adjust_boundary_up(size_t change_in_bytes) {
duke@435	60	assert(UseAdaptiveSizePolicy && UseAdaptiveGCBoundary, "runtime check");
duke@435	61	size_t actual_change = low()->expand_into(high(), change_in_bytes);
duke@435	62	return actual_change != 0;
duke@435	63	}
duke@435	64
duke@435	65	bool AdjoiningVirtualSpaces::adjust_boundary_down(size_t change_in_bytes) {
duke@435	66	assert(UseAdaptiveSizePolicy && UseAdaptiveGCBoundary, "runtime check");
duke@435	67	size_t actual_change = high()->expand_into(low(), change_in_bytes);
duke@435	68	return actual_change != 0;
duke@435	69	}