hotspot/src/share/vm/gc_implementation/parallelScavenge/prefetchQueue.hpp
Print this page
rev 611 : Merge
@@ -1,10 +1,10 @@
#ifdef USE_PRAGMA_IDENT_HDR
#pragma ident "@(#)prefetchQueue.hpp 1.13 07/05/05 17:05:28 JVM"
#endif
/*
- * Copyright 2002-2003 Sun Microsystems, Inc. All Rights Reserved.
+ * Copyright 2002-2008 Sun Microsystems, Inc. All Rights Reserved.
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* This code is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License version 2 only, as
* published by the Free Software Foundation.
@@ -34,12 +34,12 @@
const int PREFETCH_QUEUE_SIZE = 8;
class PrefetchQueue : public CHeapObj {
private:
- oop* _prefetch_queue[PREFETCH_QUEUE_SIZE];
- unsigned int _prefetch_index;
+ void* _prefetch_queue[PREFETCH_QUEUE_SIZE];
+ uint _prefetch_index;
public:
int length() { return PREFETCH_QUEUE_SIZE; }
inline void clear() {
@@ -47,24 +47,25 @@
_prefetch_queue[i] = NULL;
}
_prefetch_index = 0;
}
- inline oop* push_and_pop(oop* p) {
- Prefetch::write((*p)->mark_addr(), 0);
+ template <class T> inline void* push_and_pop(T* p) {
+ oop o = oopDesc::load_decode_heap_oop_not_null(p);
+ Prefetch::write(o->mark_addr(), 0);
// This prefetch is intended to make sure the size field of array
// oops is in cache. It assumes the the object layout is
// mark -> klass -> size, and that mark and klass are heapword
// sized. If this should change, this prefetch will need updating!
- Prefetch::write((*p)->mark_addr() + (HeapWordSize*2), 0);
+ Prefetch::write(o->mark_addr() + (HeapWordSize*2), 0);
_prefetch_queue[_prefetch_index++] = p;
_prefetch_index &= (PREFETCH_QUEUE_SIZE-1);
return _prefetch_queue[_prefetch_index];
}
// Stores a NULL pointer in the pop'd location.
- inline oop* pop() {
+ inline void* pop() {
_prefetch_queue[_prefetch_index++] = NULL;
_prefetch_index &= (PREFETCH_QUEUE_SIZE-1);
return _prefetch_queue[_prefetch_index];
}
};