149 void set_returned_bytes(size_t v) {}
150 void increment_returned_bytes_by(size_t v) {}
151
152 // Unlink head of list and return it. Returns NULL if
153 // the list is empty.
154 Chunk_t* get_chunk_at_head();
155
156 // Remove the first "n" or "count", whichever is smaller, chunks from the
157 // list, setting "fl", which is required to be empty, to point to them.
158 void getFirstNChunksFromList(size_t n, FreeList<Chunk_t>* fl);
159
160 // Unlink this chunk from it's free list
161 void remove_chunk(Chunk_t* fc);
162
163 // Add this chunk to this free list.
164 void return_chunk_at_head(Chunk_t* fc);
165 void return_chunk_at_tail(Chunk_t* fc);
166
167 // Similar to returnChunk* but also records some diagnostic
168 // information.
169 void return_chunk_at_head(Chunk_t* fc, bool record_return);
170 void return_chunk_at_tail(Chunk_t* fc, bool record_return);
171
172 // Prepend "fl" (whose size is required to be the same as that of "this")
173 // to the front of "this" list.
174 void prepend(FreeList<Chunk_t>* fl);
175
176 // Verify that the chunk is in the list.
177 // found. Return NULL if "fc" is not found.
178 bool verify_chunk_in_free_list(Chunk_t* fc) const;
179
180 // Stats verification
181 // void verify_stats() const { ShouldNotReachHere(); };
182
183 // Printing support
184 static void print_labels_on(outputStream* st, const char* c);
185 void print_on(outputStream* st, const char* c = NULL) const;
186 };
187
188 #endif // SHARE_VM_MEMORY_FREELIST_HPP
|
149 void set_returned_bytes(size_t v) {}
150 void increment_returned_bytes_by(size_t v) {}
151
152 // Unlink head of list and return it. Returns NULL if
153 // the list is empty.
154 Chunk_t* get_chunk_at_head();
155
156 // Remove the first "n" or "count", whichever is smaller, chunks from the
157 // list, setting "fl", which is required to be empty, to point to them.
158 void getFirstNChunksFromList(size_t n, FreeList<Chunk_t>* fl);
159
160 // Unlink this chunk from it's free list
161 void remove_chunk(Chunk_t* fc);
162
163 // Add this chunk to this free list.
164 void return_chunk_at_head(Chunk_t* fc);
165 void return_chunk_at_tail(Chunk_t* fc);
166
167 // Similar to returnChunk* but also records some diagnostic
168 // information.
169 void return_chunk_at_head(Chunk_t* fc, bool record_return, bool deallocate_pages);
170 void return_chunk_at_tail(Chunk_t* fc, bool record_return, bool deallocate_pages);
171
172 // Prepend "fl" (whose size is required to be the same as that of "this")
173 // to the front of "this" list.
174 void prepend(FreeList<Chunk_t>* fl);
175
176 // Verify that the chunk is in the list.
177 // found. Return NULL if "fc" is not found.
178 bool verify_chunk_in_free_list(Chunk_t* fc) const;
179
180 // Stats verification
181 // void verify_stats() const { ShouldNotReachHere(); };
182
183 // Printing support
184 static void print_labels_on(outputStream* st, const char* c);
185 void print_on(outputStream* st, const char* c = NULL) const;
186 };
187
188 #endif // SHARE_VM_MEMORY_FREELIST_HPP
|