Cross Reference: /openjdk7/hotspot/src/share/vm/memory/binaryTreeDictionary.cpp

Lines Matching defs:BinaryTreeDictionary
64   assert(tc->size() >= BinaryTreeDictionary<Chunk>::min_tree_chunk_size, "Chunk is too small for a TreeChunk");
85   assert(size >= BinaryTreeDictionary<Chunk>::min_tree_chunk_size, "Chunk is too small for a TreeChunk");
315 BinaryTreeDictionary<Chunk>::BinaryTreeDictionary(bool adaptive_freelists, bool splay) :
320 BinaryTreeDictionary<Chunk>::BinaryTreeDictionary(MemRegion mr,
325   assert(mr.word_size() >= BinaryTreeDictionary<Chunk>::min_tree_chunk_size, "minimum chunk size");
337 void BinaryTreeDictionary<Chunk>::inc_total_size(size_t inc) {
342 void BinaryTreeDictionary<Chunk>::dec_total_size(size_t dec) {
347 void BinaryTreeDictionary<Chunk>::reset(MemRegion mr) {
348   assert(mr.word_size() >= BinaryTreeDictionary<Chunk>::min_tree_chunk_size, "minimum chunk size");
355 void BinaryTreeDictionary<Chunk>::reset(HeapWord* addr, size_t byte_size) {
361 void BinaryTreeDictionary<Chunk>::reset() {
377 BinaryTreeDictionary<Chunk>::get_chunk_from_tree(size_t size, enum FreeBlockDictionary<Chunk>::Dither dither, bool splay)
381   assert(size >= BinaryTreeDictionary<Chunk>::min_tree_chunk_size, "minimum chunk size");
469 TreeList<Chunk>* BinaryTreeDictionary<Chunk>::find_list(size_t size) const {
488 bool BinaryTreeDictionary<Chunk>::verify_chunk_in_free_list(Chunk* tc) const {
499 Chunk* BinaryTreeDictionary<Chunk>::find_largest_dict() const {
515 BinaryTreeDictionary<Chunk>::remove_chunk_from_tree(TreeChunk<Chunk>* tc) {
654 TreeList<Chunk>* BinaryTreeDictionary<Chunk>::remove_tree_minimum(TreeList<Chunk>* tl) {
697 void BinaryTreeDictionary<Chunk>::semi_splay_step(TreeList<Chunk>* tc) {
708 void BinaryTreeDictionary<Chunk>::insert_chunk_in_tree(Chunk* fc) {
712   assert(size >= BinaryTreeDictionary<Chunk>::min_tree_chunk_size, "too small to be a TreeList<Chunk>");
772 size_t BinaryTreeDictionary<Chunk>::max_chunk_size() const {
781 size_t BinaryTreeDictionary<Chunk>::total_list_length(TreeList<Chunk>* tl) const {
794 size_t BinaryTreeDictionary<Chunk>::total_size_in_tree(TreeList<Chunk>* tl) const {
803 double BinaryTreeDictionary<Chunk>::sum_of_squared_block_sizes(TreeList<Chunk>* const tl) const {
815 size_t BinaryTreeDictionary<Chunk>::total_free_blocks_in_tree(TreeList<Chunk>* tl) const {
824 size_t BinaryTreeDictionary<Chunk>::num_free_blocks() const {
831 size_t BinaryTreeDictionary<Chunk>::tree_height_helper(TreeList<Chunk>* tl) const {
839 size_t BinaryTreeDictionary<Chunk>::treeHeight() const {
844 size_t BinaryTreeDictionary<Chunk>::total_nodes_helper(TreeList<Chunk>* tl) const {
853 size_t BinaryTreeDictionary<Chunk>::total_nodes_in_tree(TreeList<Chunk>* tl) const {
858 void BinaryTreeDictionary<Chunk>::dict_census_udpate(size_t size, bool split, bool birth){
887 bool BinaryTreeDictionary<Chunk>::coal_dict_over_populated(size_t size) {
1028 Chunk* BinaryTreeDictionary<Chunk>::find_chunk_ends_at(HeapWord* target) const {
1037 void BinaryTreeDictionary<Chunk>::begin_sweep_dict_census(double coalSurplusPercent,
1057 void BinaryTreeDictionary<Chunk>::initialize_dict_returned_bytes() {
1074 size_t BinaryTreeDictionary<Chunk>::sum_dict_returned_bytes() {
1093 size_t BinaryTreeDictionary<Chunk>::total_count() {
1114 void BinaryTreeDictionary<Chunk>::set_tree_surplus(double splitSurplusPercent) {
1136 void BinaryTreeDictionary<Chunk>::set_tree_hints(void) {
1154 void BinaryTreeDictionary<Chunk>::clear_tree_census(void) {
1161 void BinaryTreeDictionary<Chunk>::end_sweep_dict_census(double splitSurplusPercent) {
1173 void BinaryTreeDictionary<Chunk>::report_statistics() const {
1175   gclog_or_tty->print("Statistics for BinaryTreeDictionary:\n"
1225 void BinaryTreeDictionary<Chunk>::print_dict_census(void) const {
1273 void BinaryTreeDictionary<Chunk>::print_free_lists(outputStream* st) const {
1285 void BinaryTreeDictionary<Chunk>::verify_tree() const {
1293 size_t BinaryTreeDictionary<Chunk>::verify_prev_free_ptrs(TreeList<Chunk>* tl) {
1307 void BinaryTreeDictionary<Chunk>::verify_tree_helper(TreeList<Chunk>* tl) const {
1336 void BinaryTreeDictionary<Chunk>::verify() const {
1343 template class BinaryTreeDictionary<FreeChunk>;