Sat, 07 Nov 2020 10:30:02 +0800
Added tag mips-jdk8u275-b01 for changeset d3b4d62f391f
aoqi@0 | 1 | /* |
aoqi@0 | 2 | * Copyright (c) 2001, 2012, Oracle and/or its affiliates. All rights reserved. |
aoqi@0 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
aoqi@0 | 4 | * |
aoqi@0 | 5 | * This code is free software; you can redistribute it and/or modify it |
aoqi@0 | 6 | * under the terms of the GNU General Public License version 2 only, as |
aoqi@0 | 7 | * published by the Free Software Foundation. |
aoqi@0 | 8 | * |
aoqi@0 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
aoqi@0 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
aoqi@0 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
aoqi@0 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
aoqi@0 | 13 | * accompanied this code). |
aoqi@0 | 14 | * |
aoqi@0 | 15 | * You should have received a copy of the GNU General Public License version |
aoqi@0 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
aoqi@0 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
aoqi@0 | 18 | * |
aoqi@0 | 19 | * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
aoqi@0 | 20 | * or visit www.oracle.com if you need additional information or have any |
aoqi@0 | 21 | * questions. |
aoqi@0 | 22 | * |
aoqi@0 | 23 | */ |
aoqi@0 | 24 | |
aoqi@0 | 25 | #ifndef SHARE_VM_MEMORY_FREEBLOCKDICTIONARY_HPP |
aoqi@0 | 26 | #define SHARE_VM_MEMORY_FREEBLOCKDICTIONARY_HPP |
aoqi@0 | 27 | |
aoqi@0 | 28 | #include "memory/allocation.hpp" |
aoqi@0 | 29 | #include "runtime/mutex.hpp" |
aoqi@0 | 30 | #include "utilities/debug.hpp" |
aoqi@0 | 31 | #include "utilities/globalDefinitions.hpp" |
aoqi@0 | 32 | #include "utilities/ostream.hpp" |
aoqi@0 | 33 | |
aoqi@0 | 34 | // A FreeBlockDictionary is an abstract superclass that will allow |
aoqi@0 | 35 | // a number of alternative implementations in the future. |
aoqi@0 | 36 | template <class Chunk> |
aoqi@0 | 37 | class FreeBlockDictionary: public CHeapObj<mtGC> { |
aoqi@0 | 38 | public: |
aoqi@0 | 39 | enum Dither { |
aoqi@0 | 40 | atLeast, |
aoqi@0 | 41 | exactly, |
aoqi@0 | 42 | roughly |
aoqi@0 | 43 | }; |
aoqi@0 | 44 | enum DictionaryChoice { |
aoqi@0 | 45 | dictionaryBinaryTree = 0, |
aoqi@0 | 46 | dictionarySplayTree = 1, |
aoqi@0 | 47 | dictionarySkipList = 2 |
aoqi@0 | 48 | }; |
aoqi@0 | 49 | |
aoqi@0 | 50 | private: |
aoqi@0 | 51 | // This field is added and can be set to point to the |
aoqi@0 | 52 | // the Mutex used to synchronize access to the |
aoqi@0 | 53 | // dictionary so that assertion checking can be done. |
aoqi@0 | 54 | // For example it is set to point to _parDictionaryAllocLock. |
aoqi@0 | 55 | NOT_PRODUCT(Mutex* _lock;) |
aoqi@0 | 56 | |
aoqi@0 | 57 | public: |
aoqi@0 | 58 | virtual void remove_chunk(Chunk* fc) = 0; |
aoqi@0 | 59 | virtual Chunk* get_chunk(size_t size, Dither dither = atLeast) = 0; |
aoqi@0 | 60 | virtual void return_chunk(Chunk* chunk) = 0; |
aoqi@0 | 61 | virtual size_t total_chunk_size(debug_only(const Mutex* lock)) const = 0; |
aoqi@0 | 62 | virtual size_t max_chunk_size() const = 0; |
aoqi@0 | 63 | virtual size_t min_size() const = 0; |
aoqi@0 | 64 | // Reset the dictionary to the initial conditions for a single |
aoqi@0 | 65 | // block. |
aoqi@0 | 66 | virtual void reset(HeapWord* addr, size_t size) = 0; |
aoqi@0 | 67 | virtual void reset() = 0; |
aoqi@0 | 68 | |
aoqi@0 | 69 | virtual void dict_census_update(size_t size, bool split, bool birth) = 0; |
aoqi@0 | 70 | virtual bool coal_dict_over_populated(size_t size) = 0; |
aoqi@0 | 71 | virtual void begin_sweep_dict_census(double coalSurplusPercent, |
aoqi@0 | 72 | float inter_sweep_current, float inter_sweep_estimate, |
aoqi@0 | 73 | float intra__sweep_current) = 0; |
aoqi@0 | 74 | virtual void end_sweep_dict_census(double splitSurplusPercent) = 0; |
aoqi@0 | 75 | virtual Chunk* find_largest_dict() const = 0; |
aoqi@0 | 76 | // verify that the given chunk is in the dictionary. |
aoqi@0 | 77 | virtual bool verify_chunk_in_free_list(Chunk* tc) const = 0; |
aoqi@0 | 78 | |
aoqi@0 | 79 | // Sigma_{all_free_blocks} (block_size^2) |
aoqi@0 | 80 | virtual double sum_of_squared_block_sizes() const = 0; |
aoqi@0 | 81 | |
aoqi@0 | 82 | virtual Chunk* find_chunk_ends_at(HeapWord* target) const = 0; |
aoqi@0 | 83 | virtual void inc_total_size(size_t v) = 0; |
aoqi@0 | 84 | virtual void dec_total_size(size_t v) = 0; |
aoqi@0 | 85 | |
aoqi@0 | 86 | NOT_PRODUCT ( |
aoqi@0 | 87 | virtual size_t sum_dict_returned_bytes() = 0; |
aoqi@0 | 88 | virtual void initialize_dict_returned_bytes() = 0; |
aoqi@0 | 89 | virtual size_t total_count() = 0; |
aoqi@0 | 90 | ) |
aoqi@0 | 91 | |
aoqi@0 | 92 | virtual void report_statistics() const { |
aoqi@0 | 93 | gclog_or_tty->print("No statistics available"); |
aoqi@0 | 94 | } |
aoqi@0 | 95 | |
aoqi@0 | 96 | virtual void print_dict_census() const = 0; |
aoqi@0 | 97 | virtual void print_free_lists(outputStream* st) const = 0; |
aoqi@0 | 98 | |
aoqi@0 | 99 | virtual void verify() const = 0; |
aoqi@0 | 100 | |
aoqi@0 | 101 | Mutex* par_lock() const PRODUCT_RETURN0; |
aoqi@0 | 102 | void set_par_lock(Mutex* lock) PRODUCT_RETURN; |
aoqi@0 | 103 | void verify_par_locked() const PRODUCT_RETURN; |
aoqi@0 | 104 | }; |
aoqi@0 | 105 | |
aoqi@0 | 106 | #endif // SHARE_VM_MEMORY_FREEBLOCKDICTIONARY_HPP |