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

src/share/vm/gc_implementation/parallelScavenge/adjoiningVirtualSpaces.hpp@f90c822e73f8 (annotated)

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

Wed, 27 Apr 2016 01:25:04 +0800

author

aoqi

date

Wed, 27 Apr 2016 01:25:04 +0800

changeset 0

f90c822e73f8

child 6876

710a3c8b516e

permissions

-rw-r--r--

Initial load
http://hg.openjdk.java.net/jdk8u/jdk8u/hotspot/
changeset: 6782:28b50d07f6f8
tag: jdk8u25-b17

aoqi@0	1	/*
aoqi@0	2	* Copyright (c) 2003, 2010, Oracle and/or its affiliates. All rights reserved.
aoqi@0	3	* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
aoqi@0	4	*
aoqi@0	5	* This code is free software; you can redistribute it and/or modify it
aoqi@0	6	* under the terms of the GNU General Public License version 2 only, as
aoqi@0	7	* published by the Free Software Foundation.
aoqi@0	8	*
aoqi@0	9	* This code is distributed in the hope that it will be useful, but WITHOUT
aoqi@0	10	* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
aoqi@0	11	* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
aoqi@0	12	* version 2 for more details (a copy is included in the LICENSE file that
aoqi@0	13	* accompanied this code).
aoqi@0	14	*
aoqi@0	15	* You should have received a copy of the GNU General Public License version
aoqi@0	16	* 2 along with this work; if not, write to the Free Software Foundation,
aoqi@0	17	* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
aoqi@0	18	*
aoqi@0	19	* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
aoqi@0	20	* or visit www.oracle.com if you need additional information or have any
aoqi@0	21	* questions.
aoqi@0	22	*
aoqi@0	23	*/
aoqi@0	24
aoqi@0	25	#ifndef SHARE_VM_GC_IMPLEMENTATION_PARALLELSCAVENGE_ADJOININGVIRTUALSPACES_HPP
aoqi@0	26	#define SHARE_VM_GC_IMPLEMENTATION_PARALLELSCAVENGE_ADJOININGVIRTUALSPACES_HPP
aoqi@0	27
aoqi@0	28	#include "gc_implementation/parallelScavenge/psVirtualspace.hpp"
aoqi@0	29
aoqi@0	30
aoqi@0	31	// Contains two virtual spaces that each can individually span
aoqi@0	32	// most of the reserved region but committed parts of which
aoqi@0	33	// cannot overlap.
aoqi@0	34	//
aoqi@0	35	// +-------+ <--- high_boundary for H
aoqi@0	36	// | |
aoqi@0	37	// | H |
aoqi@0	38	// | |
aoqi@0	39	// | |
aoqi@0	40	// | |
aoqi@0	41	// --------- <--- low for H
aoqi@0	42	// | |
aoqi@0	43	// ========= <--- low_boundary for H, high_boundary for L
aoqi@0	44	// | |
aoqi@0	45	// | |
aoqi@0	46	// | |
aoqi@0	47	// --------- <--- high for L
aoqi@0	48	// | |
aoqi@0	49	// | L |
aoqi@0	50	// | |
aoqi@0	51	// | |
aoqi@0	52	// | |
aoqi@0	53	// +-------+ <--- low_boundary for L
aoqi@0	54	//
aoqi@0	55	// Each virtual space in the AdjoiningVirtualSpaces grows and shrink
aoqi@0	56	// within its reserved region (between the low_boundary and the
aoqi@0	57	// boundary) independently. If L want to grow above its high_boundary,
aoqi@0	58	// then the high_boundary of L and the low_boundary of H must be
aoqi@0	59	// moved up consistently. AdjoiningVirtualSpaces provide the
aoqi@0	60	// interfaces for moving the this boundary.
aoqi@0	61
aoqi@0	62	class AdjoiningVirtualSpaces {
aoqi@0	63	// space at the high end and the low end, respectively
aoqi@0	64	PSVirtualSpace* _high;
aoqi@0	65	PSVirtualSpace* _low;
aoqi@0	66
aoqi@0	67	// The reserved space spanned by the two spaces.
aoqi@0	68	ReservedSpace _reserved_space;
aoqi@0	69
aoqi@0	70	// The minimum byte size for the low space. It will not
aoqi@0	71	// be shrunk below this value.
aoqi@0	72	size_t _min_low_byte_size;
aoqi@0	73	// Same for the high space
aoqi@0	74	size_t _min_high_byte_size;
aoqi@0	75
aoqi@0	76	const size_t _alignment;
aoqi@0	77
aoqi@0	78	public:
aoqi@0	79	// Allocates two virtual spaces that will be located at the
aoqi@0	80	// high and low ends. Does no initialization.
aoqi@0	81	AdjoiningVirtualSpaces(ReservedSpace rs,
aoqi@0	82	size_t min_low_byte_size,
aoqi@0	83	size_t min_high_byte_size,
aoqi@0	84	size_t alignment);
aoqi@0	85
aoqi@0	86	// accessors
aoqi@0	87	PSVirtualSpace* high() { return _high; }
aoqi@0	88	PSVirtualSpace* low() { return _low; }
aoqi@0	89	ReservedSpace reserved_space() { return _reserved_space; }
aoqi@0	90	size_t min_low_byte_size() { return _min_low_byte_size; }
aoqi@0	91	size_t min_high_byte_size() { return _min_high_byte_size; }
aoqi@0	92	size_t alignment() const { return _alignment; }
aoqi@0	93
aoqi@0	94	// move boundary between the two spaces up
aoqi@0	95	bool adjust_boundary_up(size_t size_in_bytes);
aoqi@0	96	// and down
aoqi@0	97	bool adjust_boundary_down(size_t size_in_bytes);
aoqi@0	98
aoqi@0	99	// Maximum byte size for the high space.
aoqi@0	100	size_t high_byte_size_limit() {
aoqi@0	101	return _reserved_space.size() - _min_low_byte_size;
aoqi@0	102	}
aoqi@0	103	// Maximum byte size for the low space.
aoqi@0	104	size_t low_byte_size_limit() {
aoqi@0	105	return _reserved_space.size() - _min_high_byte_size;
aoqi@0	106	}
aoqi@0	107
aoqi@0	108	// Sets the boundaries for the virtual spaces and commits and
aoqi@0	109	// initial size;
aoqi@0	110	void initialize(size_t max_low_byte_size,
aoqi@0	111	size_t init_low_byte_size,
aoqi@0	112	size_t init_high_byte_size);
aoqi@0	113	};
aoqi@0	114
aoqi@0	115	#endif // SHARE_VM_GC_IMPLEMENTATION_PARALLELSCAVENGE_ADJOININGVIRTUALSPACES_HPP