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

src/share/vm/gc_implementation/parallelScavenge/prefetchQueue.hpp@98cb887364d3 (annotated)

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

Fri, 27 Feb 2009 13:27:09 -0800

author

twisti

date

Fri, 27 Feb 2009 13:27:09 -0800

changeset 1040

98cb887364d3

parent 631

d1605aabd0a1

child 1907

c18cbe5936b8

permissions

-rw-r--r--

6810672: Comment typos
Summary: I have collected some typos I have found while looking at the code.
Reviewed-by: kvn, never

duke@435	1	/*
xdono@631	2	* Copyright 2002-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	// PrefetchQueue is a FIFO queue of variable length (currently 8).
duke@435	27	//
duke@435	28	// We need to examine the performance penalty of variable lengths.
twisti@1040	29	// We may also want to split this into cpu dependent bits.
duke@435	30	//
duke@435	31
duke@435	32	const int PREFETCH_QUEUE_SIZE = 8;
duke@435	33
duke@435	34	class PrefetchQueue : public CHeapObj {
duke@435	35	private:
coleenp@548	36	void* _prefetch_queue[PREFETCH_QUEUE_SIZE];
coleenp@548	37	uint _prefetch_index;
duke@435	38
duke@435	39	public:
duke@435	40	int length() { return PREFETCH_QUEUE_SIZE; }
duke@435	41
duke@435	42	inline void clear() {
duke@435	43	for(int i=0; i<PREFETCH_QUEUE_SIZE; i++) {
duke@435	44	_prefetch_queue[i] = NULL;
duke@435	45	}
duke@435	46	_prefetch_index = 0;
duke@435	47	}
duke@435	48
coleenp@548	49	template <class T> inline void* push_and_pop(T* p) {
coleenp@548	50	oop o = oopDesc::load_decode_heap_oop_not_null(p);
coleenp@548	51	Prefetch::write(o->mark_addr(), 0);
duke@435	52	// This prefetch is intended to make sure the size field of array
duke@435	53	// oops is in cache. It assumes the the object layout is
duke@435	54	// mark -> klass -> size, and that mark and klass are heapword
duke@435	55	// sized. If this should change, this prefetch will need updating!
coleenp@548	56	Prefetch::write(o->mark_addr() + (HeapWordSize*2), 0);
duke@435	57	_prefetch_queue[_prefetch_index++] = p;
duke@435	58	_prefetch_index &= (PREFETCH_QUEUE_SIZE-1);
duke@435	59	return _prefetch_queue[_prefetch_index];
duke@435	60	}
duke@435	61
duke@435	62	// Stores a NULL pointer in the pop'd location.
coleenp@548	63	inline void* pop() {
duke@435	64	_prefetch_queue[_prefetch_index++] = NULL;
duke@435	65	_prefetch_index &= (PREFETCH_QUEUE_SIZE-1);
duke@435	66	return _prefetch_queue[_prefetch_index];
duke@435	67	}
duke@435	68	};