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

src/share/vm/gc_implementation/parallelScavenge/psCompactionManager.cpp@f90c822e73f8 (annotated)

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

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) 2005, 2013, 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	#include "precompiled.hpp"
aoqi@0	26	#include "classfile/systemDictionary.hpp"
aoqi@0	27	#include "gc_implementation/parallelScavenge/gcTaskManager.hpp"
aoqi@0	28	#include "gc_implementation/parallelScavenge/objectStartArray.hpp"
aoqi@0	29	#include "gc_implementation/parallelScavenge/parMarkBitMap.hpp"
aoqi@0	30	#include "gc_implementation/parallelScavenge/parallelScavengeHeap.hpp"
aoqi@0	31	#include "gc_implementation/parallelScavenge/psCompactionManager.hpp"
aoqi@0	32	#include "gc_implementation/parallelScavenge/psOldGen.hpp"
aoqi@0	33	#include "gc_implementation/parallelScavenge/psParallelCompact.hpp"
aoqi@0	34	#include "oops/objArrayKlass.inline.hpp"
aoqi@0	35	#include "oops/oop.inline.hpp"
aoqi@0	36	#include "oops/oop.pcgc.inline.hpp"
aoqi@0	37	#include "utilities/stack.inline.hpp"
aoqi@0	38
aoqi@0	39	PSOldGen* ParCompactionManager::_old_gen = NULL;
aoqi@0	40	ParCompactionManager** ParCompactionManager::_manager_array = NULL;
aoqi@0	41
aoqi@0	42	RegionTaskQueue** ParCompactionManager::_region_list = NULL;
aoqi@0	43
aoqi@0	44	OopTaskQueueSet* ParCompactionManager::_stack_array = NULL;
aoqi@0	45	ParCompactionManager::ObjArrayTaskQueueSet*
aoqi@0	46	ParCompactionManager::_objarray_queues = NULL;
aoqi@0	47	ObjectStartArray* ParCompactionManager::_start_array = NULL;
aoqi@0	48	ParMarkBitMap* ParCompactionManager::_mark_bitmap = NULL;
aoqi@0	49	RegionTaskQueueSet* ParCompactionManager::_region_array = NULL;
aoqi@0	50
aoqi@0	51	uint* ParCompactionManager::_recycled_stack_index = NULL;
aoqi@0	52	int ParCompactionManager::_recycled_top = -1;
aoqi@0	53	int ParCompactionManager::_recycled_bottom = -1;
aoqi@0	54
aoqi@0	55	ParCompactionManager::ParCompactionManager() :
aoqi@0	56	_action(CopyAndUpdate),
aoqi@0	57	_region_stack(NULL),
aoqi@0	58	_region_stack_index((uint)max_uintx) {
aoqi@0	59
aoqi@0	60	ParallelScavengeHeap* heap = (ParallelScavengeHeap*)Universe::heap();
aoqi@0	61	assert(heap->kind() == CollectedHeap::ParallelScavengeHeap, "Sanity");
aoqi@0	62
aoqi@0	63	_old_gen = heap->old_gen();
aoqi@0	64	_start_array = old_gen()->start_array();
aoqi@0	65
aoqi@0	66	marking_stack()->initialize();
aoqi@0	67	_objarray_stack.initialize();
aoqi@0	68	}
aoqi@0	69
aoqi@0	70	ParCompactionManager::~ParCompactionManager() {
aoqi@0	71	delete _recycled_stack_index;
aoqi@0	72	}
aoqi@0	73
aoqi@0	74	void ParCompactionManager::initialize(ParMarkBitMap* mbm) {
aoqi@0	75	assert(PSParallelCompact::gc_task_manager() != NULL,
aoqi@0	76	"Needed for initialization");
aoqi@0	77
aoqi@0	78	_mark_bitmap = mbm;
aoqi@0	79
aoqi@0	80	uint parallel_gc_threads = PSParallelCompact::gc_task_manager()->workers();
aoqi@0	81
aoqi@0	82	assert(_manager_array == NULL, "Attempt to initialize twice");
aoqi@0	83	_manager_array = NEW_C_HEAP_ARRAY(ParCompactionManager*, parallel_gc_threads+1, mtGC);
aoqi@0	84	guarantee(_manager_array != NULL, "Could not allocate manager_array");
aoqi@0	85
aoqi@0	86	_region_list = NEW_C_HEAP_ARRAY(RegionTaskQueue*,
aoqi@0	87	parallel_gc_threads+1, mtGC);
aoqi@0	88	guarantee(_region_list != NULL, "Could not initialize promotion manager");
aoqi@0	89
aoqi@0	90	_recycled_stack_index = NEW_C_HEAP_ARRAY(uint, parallel_gc_threads, mtGC);
aoqi@0	91
aoqi@0	92	// parallel_gc-threads + 1 to be consistent with the number of
aoqi@0	93	// compaction managers.
aoqi@0	94	for(uint i=0; i<parallel_gc_threads + 1; i++) {
aoqi@0	95	_region_list[i] = new RegionTaskQueue();
aoqi@0	96	region_list(i)->initialize();
aoqi@0	97	}
aoqi@0	98
aoqi@0	99	_stack_array = new OopTaskQueueSet(parallel_gc_threads);
aoqi@0	100	guarantee(_stack_array != NULL, "Could not allocate stack_array");
aoqi@0	101	_objarray_queues = new ObjArrayTaskQueueSet(parallel_gc_threads);
aoqi@0	102	guarantee(_objarray_queues != NULL, "Could not allocate objarray_queues");
aoqi@0	103	_region_array = new RegionTaskQueueSet(parallel_gc_threads);
aoqi@0	104	guarantee(_region_array != NULL, "Could not allocate region_array");
aoqi@0	105
aoqi@0	106	// Create and register the ParCompactionManager(s) for the worker threads.
aoqi@0	107	for(uint i=0; i<parallel_gc_threads; i++) {
aoqi@0	108	_manager_array[i] = new ParCompactionManager();
aoqi@0	109	guarantee(_manager_array[i] != NULL, "Could not create ParCompactionManager");
aoqi@0	110	stack_array()->register_queue(i, _manager_array[i]->marking_stack());
aoqi@0	111	_objarray_queues->register_queue(i, &_manager_array[i]->_objarray_stack);
aoqi@0	112	region_array()->register_queue(i, region_list(i));
aoqi@0	113	}
aoqi@0	114
aoqi@0	115	// The VMThread gets its own ParCompactionManager, which is not available
aoqi@0	116	// for work stealing.
aoqi@0	117	_manager_array[parallel_gc_threads] = new ParCompactionManager();
aoqi@0	118	guarantee(_manager_array[parallel_gc_threads] != NULL,
aoqi@0	119	"Could not create ParCompactionManager");
aoqi@0	120	assert(PSParallelCompact::gc_task_manager()->workers() != 0,
aoqi@0	121	"Not initialized?");
aoqi@0	122	}
aoqi@0	123
aoqi@0	124	int ParCompactionManager::pop_recycled_stack_index() {
aoqi@0	125	assert(_recycled_bottom <= _recycled_top, "list is empty");
aoqi@0	126	// Get the next available index
aoqi@0	127	if (_recycled_bottom < _recycled_top) {
aoqi@0	128	uint cur, next, last;
aoqi@0	129	do {
aoqi@0	130	cur = _recycled_bottom;
aoqi@0	131	next = cur + 1;
aoqi@0	132	last = Atomic::cmpxchg(next, &_recycled_bottom, cur);
aoqi@0	133	} while (cur != last);
aoqi@0	134	return _recycled_stack_index[next];
aoqi@0	135	} else {
aoqi@0	136	return -1;
aoqi@0	137	}
aoqi@0	138	}
aoqi@0	139
aoqi@0	140	void ParCompactionManager::push_recycled_stack_index(uint v) {
aoqi@0	141	// Get the next available index
aoqi@0	142	int cur = Atomic::add(1, &_recycled_top);
aoqi@0	143	_recycled_stack_index[cur] = v;
aoqi@0	144	assert(_recycled_bottom <= _recycled_top, "list top and bottom are wrong");
aoqi@0	145	}
aoqi@0	146
aoqi@0	147	bool ParCompactionManager::should_update() {
aoqi@0	148	assert(action() != NotValid, "Action is not set");
aoqi@0	149	return (action() == ParCompactionManager::Update) ||
aoqi@0	150	(action() == ParCompactionManager::CopyAndUpdate) ||
aoqi@0	151	(action() == ParCompactionManager::UpdateAndCopy);
aoqi@0	152	}
aoqi@0	153
aoqi@0	154	bool ParCompactionManager::should_copy() {
aoqi@0	155	assert(action() != NotValid, "Action is not set");
aoqi@0	156	return (action() == ParCompactionManager::Copy) ||
aoqi@0	157	(action() == ParCompactionManager::CopyAndUpdate) ||
aoqi@0	158	(action() == ParCompactionManager::UpdateAndCopy);
aoqi@0	159	}
aoqi@0	160
aoqi@0	161	void ParCompactionManager::region_list_push(uint list_index,
aoqi@0	162	size_t region_index) {
aoqi@0	163	region_list(list_index)->push(region_index);
aoqi@0	164	}
aoqi@0	165
aoqi@0	166	void ParCompactionManager::verify_region_list_empty(uint list_index) {
aoqi@0	167	assert(region_list(list_index)->is_empty(), "Not empty");
aoqi@0	168	}
aoqi@0	169
aoqi@0	170	ParCompactionManager*
aoqi@0	171	ParCompactionManager::gc_thread_compaction_manager(int index) {
aoqi@0	172	assert(index >= 0 && index < (int)ParallelGCThreads, "index out of range");
aoqi@0	173	assert(_manager_array != NULL, "Sanity");
aoqi@0	174	return _manager_array[index];
aoqi@0	175	}
aoqi@0	176
aoqi@0	177	void ParCompactionManager::follow_marking_stacks() {
aoqi@0	178	do {
aoqi@0	179	// Drain the overflow stack first, to allow stealing from the marking stack.
aoqi@0	180	oop obj;
aoqi@0	181	while (marking_stack()->pop_overflow(obj)) {
aoqi@0	182	obj->follow_contents(this);
aoqi@0	183	}
aoqi@0	184	while (marking_stack()->pop_local(obj)) {
aoqi@0	185	obj->follow_contents(this);
aoqi@0	186	}
aoqi@0	187
aoqi@0	188	// Process ObjArrays one at a time to avoid marking stack bloat.
aoqi@0	189	ObjArrayTask task;
aoqi@0	190	if (_objarray_stack.pop_overflow(task) || _objarray_stack.pop_local(task)) {
aoqi@0	191	ObjArrayKlass* k = (ObjArrayKlass*)task.obj()->klass();
aoqi@0	192	k->oop_follow_contents(this, task.obj(), task.index());
aoqi@0	193	}
aoqi@0	194	} while (!marking_stacks_empty());
aoqi@0	195
aoqi@0	196	assert(marking_stacks_empty(), "Sanity");
aoqi@0	197	}
aoqi@0	198
aoqi@0	199	void ParCompactionManager::drain_region_stacks() {
aoqi@0	200	do {
aoqi@0	201	// Drain overflow stack first so other threads can steal.
aoqi@0	202	size_t region_index;
aoqi@0	203	while (region_stack()->pop_overflow(region_index)) {
aoqi@0	204	PSParallelCompact::fill_and_update_region(this, region_index);
aoqi@0	205	}
aoqi@0	206
aoqi@0	207	while (region_stack()->pop_local(region_index)) {
aoqi@0	208	PSParallelCompact::fill_and_update_region(this, region_index);
aoqi@0	209	}
aoqi@0	210	} while (!region_stack()->is_empty());
aoqi@0	211	}