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

src/share/vm/gc_implementation/concurrentMarkSweep/cmsOopClosures.inline.hpp@c96030fff130 (annotated)

src/share/vm/gc_implementation/concurrentMarkSweep/cmsOopClosures.inline.hpp

Thu, 20 Nov 2008 16:56:09 -0800

author

ysr

date

Thu, 20 Nov 2008 16:56:09 -0800

changeset 888

c96030fff130

parent 435

a61af66fc99e

child 1370

05f89f00a864

permissions

-rw-r--r--

6684579: SoftReference processing can be made more efficient
Summary: For current soft-ref clearing policies, we can decide at marking time if a soft-reference will definitely not be cleared, postponing the decision of whether it will definitely be cleared to the final reference processing phase. This can be especially beneficial in the case of concurrent collectors where the marking is usually concurrent but reference processing is usually not.
Reviewed-by: jmasa

duke@435	1	/*
duke@435	2	* Copyright (c) 2007 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	// Trim our work_queue so its length is below max at return
duke@435	26	inline void Par_MarkRefsIntoAndScanClosure::trim_queue(uint max) {
duke@435	27	while (_work_queue->size() > max) {
duke@435	28	oop newOop;
duke@435	29	if (_work_queue->pop_local(newOop)) {
duke@435	30	assert(newOop->is_oop(), "Expected an oop");
duke@435	31	assert(_bit_map->isMarked((HeapWord*)newOop),
duke@435	32	"only grey objects on this stack");
duke@435	33	// iterate over the oops in this oop, marking and pushing
duke@435	34	// the ones in CMS heap (i.e. in _span).
duke@435	35	newOop->oop_iterate(&_par_pushAndMarkClosure);
duke@435	36	}
duke@435	37	}
duke@435	38	}
duke@435	39
duke@435	40	inline void PushOrMarkClosure::remember_klass(Klass* k) {
duke@435	41	if (!_revisitStack->push(oop(k))) {
duke@435	42	fatal("Revisit stack overflow in PushOrMarkClosure");
duke@435	43	}
duke@435	44	}
duke@435	45
duke@435	46	inline void Par_PushOrMarkClosure::remember_klass(Klass* k) {
duke@435	47	if (!_revisit_stack->par_push(oop(k))) {
duke@435	48	fatal("Revisit stack overflow in PushOrMarkClosure");
duke@435	49	}
duke@435	50	}
duke@435	51
duke@435	52	inline void PushOrMarkClosure::do_yield_check() {
duke@435	53	_parent->do_yield_check();
duke@435	54	}
duke@435	55
duke@435	56	inline void Par_PushOrMarkClosure::do_yield_check() {
duke@435	57	_parent->do_yield_check();
duke@435	58	}