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

src/share/vm/gc_implementation/parallelScavenge/psMarkSweepDecorator.hpp@0fbdb4381b99 (annotated)

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

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

author

xdono

date

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

changeset 1014

0fbdb4381b99

parent 905

ad8c8ca4ab0f

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	/*
xdono@905	2	* Copyright 2001-2008 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	//
duke@435	26	// A PSMarkSweepDecorator is used to add "ParallelScavenge" style mark sweep operations
duke@435	27	// to a MutableSpace.
duke@435	28	//
duke@435	29
duke@435	30	class ObjectStartArray;
duke@435	31
duke@435	32	class PSMarkSweepDecorator: public CHeapObj {
duke@435	33	private:
duke@435	34	static PSMarkSweepDecorator* _destination_decorator;
duke@435	35
duke@435	36	protected:
duke@435	37	MutableSpace* _space;
duke@435	38	ObjectStartArray* _start_array;
duke@435	39	HeapWord* _first_dead;
duke@435	40	HeapWord* _end_of_live;
duke@435	41	HeapWord* _compaction_top;
jcoomes@873	42	size_t _allowed_dead_ratio;
duke@435	43
jcoomes@873	44	bool insert_deadspace(size_t& allowed_deadspace_words, HeapWord* q,
jcoomes@873	45	size_t word_len);
duke@435	46
duke@435	47	public:
duke@435	48	PSMarkSweepDecorator(MutableSpace* space, ObjectStartArray* start_array,
jcoomes@873	49	size_t allowed_dead_ratio) :
jcoomes@873	50	_space(space), _start_array(start_array),
jcoomes@873	51	_allowed_dead_ratio(allowed_dead_ratio) { }
duke@435	52
duke@435	53	// During a compacting collection, we need to collapse objects into
duke@435	54	// spaces in a given order. We want to fill space A, space B, and so
duke@435	55	// on. The code that controls that order is in the following methods.
duke@435	56	static void set_destination_decorator_tenured();
duke@435	57	static void set_destination_decorator_perm_gen();
duke@435	58	static void advance_destination_decorator();
duke@435	59	static PSMarkSweepDecorator* destination_decorator();
duke@435	60
duke@435	61	// Accessors
jcoomes@873	62	MutableSpace* space() { return _space; }
jcoomes@873	63	ObjectStartArray* start_array() { return _start_array; }
duke@435	64
jcoomes@873	65	HeapWord* compaction_top() { return _compaction_top; }
jcoomes@873	66	void set_compaction_top(HeapWord* value) { _compaction_top = value; }
duke@435	67
jcoomes@873	68	size_t allowed_dead_ratio() { return _allowed_dead_ratio; }
jcoomes@873	69	void set_allowed_dead_ratio(size_t value) { _allowed_dead_ratio = value; }
duke@435	70
duke@435	71	// Work methods
duke@435	72	void adjust_pointers();
duke@435	73	void precompact();
duke@435	74	void compact(bool mangle_free_space);
duke@435	75	};