< prev index next >

src/share/vm/memory/binaryTreeDictionary.hpp

Print this page

        

*** 322,343 **** void set_tree_hints(void); // Reset statistics for all the lists in the tree. void clear_tree_census(void); // Print the statistics for all the lists in the tree. Also may // print out summaries. ! void print_dict_census(void) const; void print_free_lists(outputStream* st) const; // For debugging. Returns the sum of the _returned_bytes for // all lists in the tree. size_t sum_dict_returned_bytes() PRODUCT_RETURN0; // Sets the _returned_bytes for all the lists in the tree to zero. void initialize_dict_returned_bytes() PRODUCT_RETURN; // For debugging. Return the total number of chunks in the dictionary. size_t total_count() PRODUCT_RETURN0; ! void report_statistics() const; void verify() const; }; #endif // SHARE_VM_MEMORY_BINARYTREEDICTIONARY_HPP --- 322,343 ---- void set_tree_hints(void); // Reset statistics for all the lists in the tree. void clear_tree_census(void); // Print the statistics for all the lists in the tree. Also may // print out summaries. ! void print_dict_census(outputStream* st) const; void print_free_lists(outputStream* st) const; // For debugging. Returns the sum of the _returned_bytes for // all lists in the tree. size_t sum_dict_returned_bytes() PRODUCT_RETURN0; // Sets the _returned_bytes for all the lists in the tree to zero. void initialize_dict_returned_bytes() PRODUCT_RETURN; // For debugging. Return the total number of chunks in the dictionary. size_t total_count() PRODUCT_RETURN0; ! void report_statistics(outputStream* st) const; void verify() const; }; #endif // SHARE_VM_MEMORY_BINARYTREEDICTIONARY_HPP
< prev index next >