/openjdk7/hotspot/src/share/vm/runtime/ |
H A D | park.cpp | 34 // We manage concurrency on the FreeList with a CAS-based 54 ParkEvent * volatile ParkEvent::FreeList = NULL ; member in class:ParkEvent 63 ev = FreeList ; 66 // Tantamount to ev = Swap (&FreeList, NULL) 67 if (Atomic::cmpxchg_ptr (NULL, &FreeList, ev) != ev) { 80 ParkEvent * Arv = (ParkEvent *) Atomic::cmpxchg_ptr (List, &FreeList, NULL) ; 84 if (Atomic::cmpxchg_ptr (NULL, &FreeList, Arv) != Arv) { 101 // installing null into FreeList -- and then stall or be obstructed. 102 // A 2nd thread calling Allocate() would see FreeList == null. 128 // Push ev onto FreeList 159 Parker * volatile Parker::FreeList = NULL ; member in class:Parker [all...] |
H A D | park.hpp | 72 static Parker * volatile FreeList ; member in class:Parker 142 static ParkEvent * volatile FreeList ; member in class:ParkEvent
|
/openjdk7/hotspot/src/share/vm/memory/ |
H A D | freeList.cpp | 37 // Free list. A FreeList is used to access a linked list of chunks 44 FreeList<Chunk>::FreeList() : function in class:FreeList 57 FreeList<Chunk>::FreeList(Chunk* fc) : function in class:FreeList 73 void FreeList<Chunk>::reset(size_t hint) { 81 void FreeList<Chunk>::init_statistics(bool split_birth) { 86 Chunk* FreeList<Chunk>::get_chunk_at_head() { 110 void FreeList<Chunk>::getFirstNChunksFromList(size_t n, FreeList<Chun [all...] |
H A D | binaryTreeDictionary.hpp | 37 // A TreeList is a FreeList which can be used to maintain a 47 class TreeList: public FreeList<Chunk> { 64 using FreeList<Chunk>::head; 65 using FreeList<Chunk>::set_head; 67 using FreeList<Chunk>::tail; 68 using FreeList<Chunk>::set_tail; 69 using FreeList<Chunk>::link_tail; 71 using FreeList<Chunk>::increment_count; 72 NOT_PRODUCT(using FreeList<Chunk>::increment_returned_bytes_by;) 73 using FreeList<Chun [all...] |
H A D | freeList.hpp | 32 // A class for maintaining a free list of Chunk's. The FreeList 35 // are not part of FreeList. The statistics are 47 class FreeList VALUE_OBJ_CLASS_SPEC { 90 FreeList(); 92 FreeList(Chunk* fc); 299 void getFirstNChunksFromList(size_t n, FreeList<Chunk>* fl); 315 void prepend(FreeList<Chunk>* fl);
|
H A D | binaryTreeDictionary.cpp | 905 virtual void do_list(FreeList<Chunk>* fl) = 0; 954 void do_list(FreeList<Chunk>* fl) { 970 virtual bool do_list(FreeList<Chunk>* fl) = 0; 1013 bool do_list(FreeList<Chunk>* fl) { 1051 void do_list(FreeList<Chunk>* fl) { 1067 void do_list(FreeList<Chunk>* fl) { 1087 void do_list(FreeList<Chunk>* fl) { 1106 void do_list(FreeList<Chunk>* fl) { 1125 void do_list(FreeList<Chunk>* fl) { 1144 void do_list(FreeList<Chun [all...] |
/openjdk7/hotspot/src/share/vm/gc_implementation/concurrentMarkSweep/ |
H A D | vmStructs_cms.hpp | 47 nonstatic_field(FreeList<FreeChunk>, _size, size_t) \ 48 nonstatic_field(FreeList<FreeChunk>, _count, ssize_t) \ 51 nonstatic_field(CompactibleFreeListSpace, _indexedFreeList[0], FreeList<FreeChunk>) \ 75 declare_toplevel_type(FreeList<FreeChunk>*) \ 76 declare_toplevel_type(FreeList<FreeChunk>) \
|
H A D | compactibleFreeListSpace.hpp | 135 FreeList<FreeChunk> _indexedFreeList[IndexSetSize]; 172 void par_get_chunk_of_blocks(size_t word_sz, size_t n, FreeList<FreeChunk>* fl); 218 FreeChunk* getFromListGreater(FreeList<FreeChunk>* fl, size_t numWords); 625 FreeList<FreeChunk> _indexedFreeList[CompactibleFreeListSpace::IndexSetSize]; 638 void get_from_global_pool(size_t word_sz, FreeList<FreeChunk>* fl);
|
H A D | compactibleFreeListSpace.cpp | 422 assert(_indexedFreeList[i].count() != 0, "Inconsistent FreeList"); 457 FreeList<FreeChunk>::print_labels_on(st, "size"); 597 assert(_indexedFreeList[i].count() != 0, "Inconsistent FreeList"); 1340 FreeList<FreeChunk>* fl = &_indexedFreeList[i]; 1871 FreeList<FreeChunk>* it = _indexedFreeList; 1875 FreeList<FreeChunk> *fl = &_indexedFreeList[hint]; 1894 FreeChunk* CompactibleFreeListSpace::getFromListGreater(FreeList<FreeChunk>* fl, 2176 FreeList<FreeChunk>* fl = &_indexedFreeList[i]; 2195 FreeList<FreeChunk> *fl = &_indexedFreeList[i]; 2206 FreeList<FreeChun [all...] |
/openjdk7/hotspot/agent/src/share/classes/sun/jvm/hotspot/memory/ |
H A D | FreeList.java | 2 * @(#)FreeList.java 34 public class FreeList extends VMObject { class in inherits:VMObject 44 Type type = db.lookupType("FreeList"); 56 public FreeList(Address address) { method in class:FreeList
|
H A D | CompactibleFreeListSpace.java | 40 // FreeList _indexedFreeList[IndexSetSize]; // indexed array for small size blocks 112 cur = cur.addOffsetTo(IndexSetStart*FreeList.sizeOf()); 114 FreeList freeList = (FreeList) VMObjectFactory.newObject(FreeList.class, cur); 116 cur= cur.addOffsetTo(IndexSetStride*FreeList.sizeOf());
|