Tue, 07 Jul 2009 14:23:00 -0400
6855834: G1: minimize the output when -XX:+PrintHeapAtGC is set
Summary: Changing the behavior of -XX:+PrintHeapAtGC for G1 from printing lengthy, per-region information to instead printing a concise summary.
Reviewed-by: ysr, apetrusenko, jcoomes
duke@435 | 1 | /* |
xdono@772 | 2 | * Copyright 1997-2008 Sun Microsystems, Inc. All Rights Reserved. |
duke@435 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
duke@435 | 4 | * |
duke@435 | 5 | * This code is free software; you can redistribute it and/or modify it |
duke@435 | 6 | * under the terms of the GNU General Public License version 2 only, as |
duke@435 | 7 | * published by the Free Software Foundation. |
duke@435 | 8 | * |
duke@435 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
duke@435 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
duke@435 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
duke@435 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
duke@435 | 13 | * accompanied this code). |
duke@435 | 14 | * |
duke@435 | 15 | * You should have received a copy of the GNU General Public License version |
duke@435 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
duke@435 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
duke@435 | 18 | * |
duke@435 | 19 | * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, |
duke@435 | 20 | * CA 95054 USA or visit www.sun.com if you need additional information or |
duke@435 | 21 | * have any questions. |
duke@435 | 22 | * |
duke@435 | 23 | */ |
duke@435 | 24 | |
duke@435 | 25 | // ReservedSpace is a data structure for reserving a contiguous address range. |
duke@435 | 26 | |
duke@435 | 27 | class ReservedSpace VALUE_OBJ_CLASS_SPEC { |
duke@435 | 28 | friend class VMStructs; |
duke@435 | 29 | private: |
duke@435 | 30 | char* _base; |
duke@435 | 31 | size_t _size; |
coleenp@672 | 32 | size_t _noaccess_prefix; |
duke@435 | 33 | size_t _alignment; |
duke@435 | 34 | bool _special; |
coleenp@1091 | 35 | bool _executable; |
duke@435 | 36 | |
duke@435 | 37 | // ReservedSpace |
coleenp@1091 | 38 | ReservedSpace(char* base, size_t size, size_t alignment, bool special, |
coleenp@1091 | 39 | bool executable); |
duke@435 | 40 | void initialize(size_t size, size_t alignment, bool large, |
coleenp@672 | 41 | char* requested_address, |
coleenp@1091 | 42 | const size_t noaccess_prefix, |
coleenp@1091 | 43 | bool executable); |
duke@435 | 44 | |
duke@435 | 45 | // Release parts of an already-reserved memory region [addr, addr + len) to |
duke@435 | 46 | // get a new region that has "compound alignment." Return the start of the |
duke@435 | 47 | // resulting region, or NULL on failure. |
duke@435 | 48 | // |
duke@435 | 49 | // The region is logically divided into a prefix and a suffix. The prefix |
duke@435 | 50 | // starts at the result address, which is aligned to prefix_align. The suffix |
duke@435 | 51 | // starts at result address + prefix_size, which is aligned to suffix_align. |
duke@435 | 52 | // The total size of the result region is size prefix_size + suffix_size. |
duke@435 | 53 | char* align_reserved_region(char* addr, const size_t len, |
duke@435 | 54 | const size_t prefix_size, |
duke@435 | 55 | const size_t prefix_align, |
duke@435 | 56 | const size_t suffix_size, |
duke@435 | 57 | const size_t suffix_align); |
duke@435 | 58 | |
duke@435 | 59 | // Reserve memory, call align_reserved_region() to alignment it and return the |
duke@435 | 60 | // result. |
duke@435 | 61 | char* reserve_and_align(const size_t reserve_size, |
duke@435 | 62 | const size_t prefix_size, |
duke@435 | 63 | const size_t prefix_align, |
duke@435 | 64 | const size_t suffix_size, |
duke@435 | 65 | const size_t suffix_align); |
duke@435 | 66 | |
coleenp@672 | 67 | protected: |
coleenp@672 | 68 | // Create protection page at the beginning of the space. |
coleenp@672 | 69 | void protect_noaccess_prefix(const size_t size); |
coleenp@672 | 70 | |
duke@435 | 71 | public: |
duke@435 | 72 | // Constructor |
duke@435 | 73 | ReservedSpace(size_t size); |
duke@435 | 74 | ReservedSpace(size_t size, size_t alignment, bool large, |
coleenp@672 | 75 | char* requested_address = NULL, |
coleenp@672 | 76 | const size_t noaccess_prefix = 0); |
duke@435 | 77 | ReservedSpace(const size_t prefix_size, const size_t prefix_align, |
coleenp@672 | 78 | const size_t suffix_size, const size_t suffix_align, |
kvn@1077 | 79 | char* requested_address, |
kvn@1077 | 80 | const size_t noaccess_prefix = 0); |
coleenp@1091 | 81 | ReservedSpace(size_t size, size_t alignment, bool large, bool executable); |
duke@435 | 82 | |
duke@435 | 83 | // Accessors |
coleenp@1091 | 84 | char* base() const { return _base; } |
coleenp@1091 | 85 | size_t size() const { return _size; } |
coleenp@1091 | 86 | size_t alignment() const { return _alignment; } |
coleenp@1091 | 87 | bool special() const { return _special; } |
coleenp@1091 | 88 | bool executable() const { return _executable; } |
coleenp@1091 | 89 | size_t noaccess_prefix() const { return _noaccess_prefix; } |
coleenp@1091 | 90 | bool is_reserved() const { return _base != NULL; } |
duke@435 | 91 | void release(); |
duke@435 | 92 | |
duke@435 | 93 | // Splitting |
duke@435 | 94 | ReservedSpace first_part(size_t partition_size, size_t alignment, |
duke@435 | 95 | bool split = false, bool realloc = true); |
duke@435 | 96 | ReservedSpace last_part (size_t partition_size, size_t alignment); |
duke@435 | 97 | |
duke@435 | 98 | // These simply call the above using the default alignment. |
duke@435 | 99 | inline ReservedSpace first_part(size_t partition_size, |
duke@435 | 100 | bool split = false, bool realloc = true); |
duke@435 | 101 | inline ReservedSpace last_part (size_t partition_size); |
duke@435 | 102 | |
duke@435 | 103 | // Alignment |
duke@435 | 104 | static size_t page_align_size_up(size_t size); |
duke@435 | 105 | static size_t page_align_size_down(size_t size); |
duke@435 | 106 | static size_t allocation_align_size_up(size_t size); |
duke@435 | 107 | static size_t allocation_align_size_down(size_t size); |
duke@435 | 108 | }; |
duke@435 | 109 | |
duke@435 | 110 | ReservedSpace |
duke@435 | 111 | ReservedSpace::first_part(size_t partition_size, bool split, bool realloc) |
duke@435 | 112 | { |
duke@435 | 113 | return first_part(partition_size, alignment(), split, realloc); |
duke@435 | 114 | } |
duke@435 | 115 | |
duke@435 | 116 | ReservedSpace ReservedSpace::last_part(size_t partition_size) |
duke@435 | 117 | { |
duke@435 | 118 | return last_part(partition_size, alignment()); |
duke@435 | 119 | } |
duke@435 | 120 | |
coleenp@672 | 121 | // Class encapsulating behavior specific of memory space reserved for Java heap |
coleenp@672 | 122 | class ReservedHeapSpace : public ReservedSpace { |
coleenp@672 | 123 | public: |
coleenp@672 | 124 | // Constructor |
coleenp@672 | 125 | ReservedHeapSpace(size_t size, size_t forced_base_alignment, |
coleenp@672 | 126 | bool large, char* requested_address); |
coleenp@672 | 127 | ReservedHeapSpace(const size_t prefix_size, const size_t prefix_align, |
kvn@1077 | 128 | const size_t suffix_size, const size_t suffix_align, |
kvn@1077 | 129 | char* requested_address); |
coleenp@672 | 130 | }; |
coleenp@672 | 131 | |
coleenp@1091 | 132 | // Class encapsulating behavior specific memory space for Code |
coleenp@1091 | 133 | class ReservedCodeSpace : public ReservedSpace { |
coleenp@1091 | 134 | public: |
coleenp@1091 | 135 | // Constructor |
coleenp@1091 | 136 | ReservedCodeSpace(size_t r_size, size_t rs_align, bool large); |
coleenp@1091 | 137 | }; |
coleenp@1091 | 138 | |
duke@435 | 139 | // VirtualSpace is data structure for committing a previously reserved address range in smaller chunks. |
duke@435 | 140 | |
duke@435 | 141 | class VirtualSpace VALUE_OBJ_CLASS_SPEC { |
duke@435 | 142 | friend class VMStructs; |
duke@435 | 143 | private: |
duke@435 | 144 | // Reserved area |
duke@435 | 145 | char* _low_boundary; |
duke@435 | 146 | char* _high_boundary; |
duke@435 | 147 | |
duke@435 | 148 | // Committed area |
duke@435 | 149 | char* _low; |
duke@435 | 150 | char* _high; |
duke@435 | 151 | |
duke@435 | 152 | // The entire space has been committed and pinned in memory, no |
duke@435 | 153 | // os::commit_memory() or os::uncommit_memory(). |
duke@435 | 154 | bool _special; |
duke@435 | 155 | |
coleenp@1091 | 156 | // Need to know if commit should be executable. |
coleenp@1091 | 157 | bool _executable; |
coleenp@1091 | 158 | |
duke@435 | 159 | // MPSS Support |
duke@435 | 160 | // Each virtualspace region has a lower, middle, and upper region. |
duke@435 | 161 | // Each region has an end boundary and a high pointer which is the |
duke@435 | 162 | // high water mark for the last allocated byte. |
duke@435 | 163 | // The lower and upper unaligned to LargePageSizeInBytes uses default page. |
duke@435 | 164 | // size. The middle region uses large page size. |
duke@435 | 165 | char* _lower_high; |
duke@435 | 166 | char* _middle_high; |
duke@435 | 167 | char* _upper_high; |
duke@435 | 168 | |
duke@435 | 169 | char* _lower_high_boundary; |
duke@435 | 170 | char* _middle_high_boundary; |
duke@435 | 171 | char* _upper_high_boundary; |
duke@435 | 172 | |
duke@435 | 173 | size_t _lower_alignment; |
duke@435 | 174 | size_t _middle_alignment; |
duke@435 | 175 | size_t _upper_alignment; |
duke@435 | 176 | |
duke@435 | 177 | // MPSS Accessors |
duke@435 | 178 | char* lower_high() const { return _lower_high; } |
duke@435 | 179 | char* middle_high() const { return _middle_high; } |
duke@435 | 180 | char* upper_high() const { return _upper_high; } |
duke@435 | 181 | |
duke@435 | 182 | char* lower_high_boundary() const { return _lower_high_boundary; } |
duke@435 | 183 | char* middle_high_boundary() const { return _middle_high_boundary; } |
duke@435 | 184 | char* upper_high_boundary() const { return _upper_high_boundary; } |
duke@435 | 185 | |
duke@435 | 186 | size_t lower_alignment() const { return _lower_alignment; } |
duke@435 | 187 | size_t middle_alignment() const { return _middle_alignment; } |
duke@435 | 188 | size_t upper_alignment() const { return _upper_alignment; } |
duke@435 | 189 | |
duke@435 | 190 | public: |
duke@435 | 191 | // Committed area |
duke@435 | 192 | char* low() const { return _low; } |
duke@435 | 193 | char* high() const { return _high; } |
duke@435 | 194 | |
duke@435 | 195 | // Reserved area |
duke@435 | 196 | char* low_boundary() const { return _low_boundary; } |
duke@435 | 197 | char* high_boundary() const { return _high_boundary; } |
duke@435 | 198 | |
duke@435 | 199 | bool special() const { return _special; } |
duke@435 | 200 | |
duke@435 | 201 | public: |
duke@435 | 202 | // Initialization |
duke@435 | 203 | VirtualSpace(); |
duke@435 | 204 | bool initialize(ReservedSpace rs, size_t committed_byte_size); |
duke@435 | 205 | |
duke@435 | 206 | // Destruction |
duke@435 | 207 | ~VirtualSpace(); |
duke@435 | 208 | |
duke@435 | 209 | // Testers (all sizes are byte sizes) |
duke@435 | 210 | size_t committed_size() const; |
duke@435 | 211 | size_t reserved_size() const; |
duke@435 | 212 | size_t uncommitted_size() const; |
duke@435 | 213 | bool contains(const void* p) const; |
duke@435 | 214 | |
duke@435 | 215 | // Operations |
duke@435 | 216 | // returns true on success, false otherwise |
duke@435 | 217 | bool expand_by(size_t bytes, bool pre_touch = false); |
duke@435 | 218 | void shrink_by(size_t bytes); |
duke@435 | 219 | void release(); |
duke@435 | 220 | |
duke@435 | 221 | void check_for_contiguity() PRODUCT_RETURN; |
duke@435 | 222 | |
duke@435 | 223 | // Debugging |
duke@435 | 224 | void print() PRODUCT_RETURN; |
duke@435 | 225 | }; |