Searched refs:splay (Results 1 - 2 of 2) sorted by relevance
/openjdk7/hotspot/src/share/vm/memory/ |
H A D | binaryTreeDictionary.hpp | 173 bool splay() const { return _splay; } function in class:BinaryTreeDictionary 194 TreeChunk<Chunk>* get_chunk_from_tree(size_t size, enum FreeBlockDictionary<Chunk>::Dither dither, bool splay); 237 BinaryTreeDictionary(bool adaptive_freelists, bool splay = false); 238 BinaryTreeDictionary(MemRegion mr, bool adaptive_freelists, bool splay = false); 252 // want a better dynamic splay strategy for the future. 255 Chunk* res = get_chunk_from_tree(size, dither, splay());
|
H A D | binaryTreeDictionary.cpp | 315 BinaryTreeDictionary<Chunk>::BinaryTreeDictionary(bool adaptive_freelists, bool splay) : argument 316 _splay(splay), _adaptive_freelists(adaptive_freelists), 322 bool splay): 323 _adaptive_freelists(adaptive_freelists), _splay(splay) 368 // If a splay step is requested, the removal algorithm (only) incorporates 369 // a splay step as follows: 371 // match. At the (closest) matching location, an appropriate splay step is applied 377 BinaryTreeDictionary<Chunk>::get_chunk_from_tree(size_t size, enum FreeBlockDictionary<Chunk>::Dither dither, bool splay) argument 450 if (splay && curTL->head()->next() != NULL) { 690 // . we splay onl 320 BinaryTreeDictionary(MemRegion mr, bool adaptive_freelists, bool splay) argument [all...] |
Completed in 79 milliseconds