| /openjdk7/hotspot/src/share/vm/gc_implementation/concurrentMarkSweep/ |
| H A D | vmStructs_cms.hpp | 43 volatile_nonstatic_field(FreeChunk, _size, size_t) \
44 nonstatic_field(FreeChunk, _next, FreeChunk*) \
45 nonstatic_field(FreeChunk, _prev, FreeChunk*) \
47 nonstatic_field(FreeList<FreeChunk>, _size, size_t) \
48 nonstatic_field(FreeList<FreeChunk>, _count, ssize_t) \
49 nonstatic_field(BinaryTreeDictionary<FreeChunk>,_total_size, size_t) \
50 nonstatic_field(CompactibleFreeListSpace, _dictionary, FreeBlockDictionary<FreeChunk>*) \
51 nonstatic_field(CompactibleFreeListSpace, _indexedFreeList[0], FreeList<FreeChunk>) \
[all...] |
| H A D | freeChunk.hpp | 44 // No virtuals in FreeChunk (don't want any vtables).
46 // A FreeChunk is merely a chunk that can be in a doubly linked list
57 class FreeChunk VALUE_OBJ_CLASS_SPEC {
60 // indication that this is a FreeChunk and not an object.
62 FreeChunk* _prev;
63 FreeChunk* _next;
78 return ((volatile FreeChunk*)addr)->is_free();
92 _prev = (FreeChunk*)(((intptr_t)_prev) | 0x2);
94 FreeChunk* prev() const {
95 return (FreeChunk*)(((intptr_
[all...] |
| H A D | freeChunk.cpp | 35 size_t const FreeChunk::header_size() {
36 return sizeof(FreeChunk)/HeapWordSize;
39 void FreeChunk::mangleAllocated(size_t size) {
45 assert(sizeof(FreeChunk) % HeapWordSize == 0,
52 void FreeChunk::mangleFreed(size_t sz) {
63 void FreeChunk::verifyList() const {
64 FreeChunk* nextFC = next();
73 void FreeChunk::print_on(outputStream* st) {
|
| H A D | compactibleFreeListSpace.hpp | 132 FreeBlockDictionary<FreeChunk>::DictionaryChoice _dictionaryChoice;
133 FreeBlockDictionary<FreeChunk>* _dictionary; // ptr to dictionary for large size blocks
135 FreeList<FreeChunk> _indexedFreeList[IndexSetSize];
172 void par_get_chunk_of_blocks(size_t word_sz, size_t n, FreeList<FreeChunk>* fl);
198 FreeChunk* getChunkFromIndexedFreeListHelper(size_t size, bool replenish = true);
203 inline FreeChunk* getChunkFromIndexedFreeList(size_t size);
206 FreeChunk* getChunkFromDictionary(size_t size);
208 FreeChunk* getChunkFromDictionaryExact(size_t size);
212 FreeChunk* bestFitSmall(size_t numWords);
218 FreeChunk* getFromListGreate
[all...] |
| H A D | cmsPermGen.hpp | 48 CardTableRS* ct, FreeBlockDictionary<FreeChunk>::DictionaryChoice);
68 (FreeBlockDictionary<FreeChunk>::DictionaryChoice)CMSDictionaryChoice)
|
| H A D | promotionInfo.hpp | 46 // when we are using compressed oops; see FreeChunk::is_free().
68 assert(!((FreeChunk*)this)->is_free(), "Error");
88 assert(!((FreeChunk*)this)->is_free(), "Error");
92 assert(!((FreeChunk*)this)->is_free(), "Error");
95 assert(!((FreeChunk*)this)->is_free(), "Error");
100 assert(!((FreeChunk*)this)->is_free(), "Error");
103 assert(!((FreeChunk*)this)->is_free(), "Error");
108 assert(!((FreeChunk*)this)->is_free(), "Error");
113 class SpoolBlock: public FreeChunk {
|
| H A D | compactibleFreeListSpace.cpp | 63 // for chunks to contain a FreeChunk.
64 size_t min_chunk_size_in_bytes = align_size_up(sizeof(FreeChunk), MinObjAlignmentInBytes);
75 FreeBlockDictionary<FreeChunk>::DictionaryChoice dictionaryChoice) :
93 assert(sizeof(FreeChunk) / BytesPerWord <= MinChunkSize,
94 "FreeChunk is larger than expected");
104 case FreeBlockDictionary<FreeChunk>::dictionarySplayTree:
105 case FreeBlockDictionary<FreeChunk>::dictionarySkipList:
109 case FreeBlockDictionary<FreeChunk>::dictionaryBinaryTree:
110 _dictionary = new BinaryTreeDictionary<FreeChunk>(mr, use_adaptive_freelists);
125 FreeChunk* f
[all...] |
| H A D | cmsPermGen.cpp | 41 FreeBlockDictionary<FreeChunk>::DictionaryChoice dictionaryChoice) {
|
| H A D | concurrentMarkSweepGeneration.hpp | 64 class FreeChunk;
1133 FreeBlockDictionary<FreeChunk>::DictionaryChoice);
1298 FreeChunk* find_chunk_at_end();
1355 FreeBlockDictionary<FreeChunk>::DictionaryChoice
1769 FreeChunk* _last_fc;
1774 void do_post_free_or_garbage_chunk(FreeChunk *fc, size_t chunkSize);
1776 void do_already_free_chunk(FreeChunk *fc);
1780 void lookahead_and_flush(FreeChunk* fc, size_t chunkSize);
1782 size_t do_garbage_chunk(FreeChunk *fc);
1784 size_t do_live_chunk(FreeChunk* f
[all...] |
| H A D | concurrentMarkSweepGeneration.cpp | 196 FreeBlockDictionary<FreeChunk>::DictionaryChoice dictionaryChoice) :
224 // Verify the assumption that FreeChunk::_prev and OopDesc::_klass
228 FreeChunk* junk = NULL;
231 "Offset of FreeChunk::_prev within FreeChunk must match"
1029 assert(!((FreeChunk*)res)->is_free(), "Error, block will look free but show wrong size");
1394 assert(!((FreeChunk*)obj_ptr)->is_free(), "Error, block will look free but show wrong size");
1403 assert(!((FreeChunk*)obj_ptr)->is_free(), "Error, block will look free but show wrong size");
1424 assert(!((FreeChunk*)obj_ptr)->is_free(), "Error, block will look free but show wrong size");
6225 FreeChunk* ConcurrentMarkSweepGeneratio
[all...] |
| /openjdk7/hotspot/agent/src/share/classes/sun/jvm/hotspot/memory/ |
| H A D | FreeChunk.java | 33 public class FreeChunk extends VMObject { class in inherits:VMObject
43 Type type = db.lookupType("FreeChunk");
55 public FreeChunk next() {
56 return (FreeChunk) VMObjectFactory.newObject(FreeChunk.class, nextField.getValue(addr));
59 public FreeChunk prev() {
61 return (FreeChunk) VMObjectFactory.newObject(FreeChunk.class, prev);
75 public FreeChunk(Address addr) { method in class:FreeChunk
80 FreeChunk
[all...] |
| H A D | CompactibleFreeListSpace.java | 61 long sizeofFreeChunk = db.lookupType("FreeChunk").getSize();
172 if (FreeChunk.indicatesFreeChunk(cur)) {
176 FreeChunk fc = (FreeChunk) VMObjectFactory.newObject(FreeChunk.class, cur);
179 Assert.that(chunkSize > 0, "invalid FreeChunk size");
|
| /openjdk7/hotspot/src/share/vm/memory/ |
| H A D | freeBlockDictionary.cpp | 66 // Explicitly instantiate for FreeChunk
67 template class FreeBlockDictionary<FreeChunk>;
|
| H A D | generationSpec.cpp | 71 (FreeBlockDictionary<FreeChunk>::DictionaryChoice)CMSDictionaryChoice);
91 (FreeBlockDictionary<FreeChunk>::DictionaryChoice)CMSDictionaryChoice);
178 (FreeBlockDictionary<FreeChunk>::DictionaryChoice)CMSDictionaryChoice);
|
| H A D | freeList.cpp | 369 template class FreeList<FreeChunk>;
|
| H A D | binaryTreeDictionary.cpp | 1342 // Explicitly instantiate these types for FreeChunk.
1343 template class BinaryTreeDictionary<FreeChunk>;
1344 template class TreeChunk<FreeChunk>;
1345 template class TreeList<FreeChunk>;
|