Fri, 20 Nov 2009 14:47:01 -0500
6815790: G1: Missing MemoryPoolMXBeans with -XX:+UseG1GC
Summary: It introduces the necessary memory pools for G1.
Reviewed-by: mchung, ysr
tonyp@1524 | 1 | /* |
tonyp@1524 | 2 | * Copyright (c) 2007 Sun Microsystems, Inc. All Rights Reserved. |
tonyp@1524 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
tonyp@1524 | 4 | * |
tonyp@1524 | 5 | * This code is free software; you can redistribute it and/or modify it |
tonyp@1524 | 6 | * under the terms of the GNU General Public License version 2 only, as |
tonyp@1524 | 7 | * published by the Free Software Foundation. |
tonyp@1524 | 8 | * |
tonyp@1524 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
tonyp@1524 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
tonyp@1524 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
tonyp@1524 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
tonyp@1524 | 13 | * accompanied this code). |
tonyp@1524 | 14 | * |
tonyp@1524 | 15 | * You should have received a copy of the GNU General Public License version |
tonyp@1524 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
tonyp@1524 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
tonyp@1524 | 18 | * |
tonyp@1524 | 19 | * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, |
tonyp@1524 | 20 | * CA 95054 USA or visit www.sun.com if you need additional information or |
tonyp@1524 | 21 | * have any questions. |
tonyp@1524 | 22 | * |
tonyp@1524 | 23 | */ |
tonyp@1524 | 24 | |
tonyp@1524 | 25 | class G1CollectedHeap; |
tonyp@1524 | 26 | |
tonyp@1524 | 27 | // This file contains the three classes that represent the memory |
tonyp@1524 | 28 | // pools of the G1 spaces: G1EdenPool, G1SurvivorPool, and |
tonyp@1524 | 29 | // G1OldGenPool. In G1, unlike our other GCs, we do not have a |
tonyp@1524 | 30 | // physical space for each of those spaces. Instead, we allocate |
tonyp@1524 | 31 | // regions for all three spaces out of a single pool of regions (that |
tonyp@1524 | 32 | // pool basically covers the entire heap). As a result, the eden, |
tonyp@1524 | 33 | // survivor, and old gen are considered logical spaces in G1, as each |
tonyp@1524 | 34 | // is a set of non-contiguous regions. This is also reflected in the |
tonyp@1524 | 35 | // way we map them to memory pools here. The easiest way to have done |
tonyp@1524 | 36 | // this would have been to map the entire G1 heap to a single memory |
tonyp@1524 | 37 | // pool. However, it's helpful to show how large the eden and survivor |
tonyp@1524 | 38 | // get, as this does affect the performance and behavior of G1. Which |
tonyp@1524 | 39 | // is why we introduce the three memory pools implemented here. |
tonyp@1524 | 40 | // |
tonyp@1524 | 41 | // The above approach inroduces a couple of challenging issues in the |
tonyp@1524 | 42 | // implementation of the three memory pools: |
tonyp@1524 | 43 | // |
tonyp@1524 | 44 | // 1) The used space calculation for a pool is not necessarily |
tonyp@1524 | 45 | // independent of the others. We can easily get from G1 the overall |
tonyp@1524 | 46 | // used space in the entire heap, the number of regions in the young |
tonyp@1524 | 47 | // generation (includes both eden and survivors), and the number of |
tonyp@1524 | 48 | // survivor regions. So, from that we calculate: |
tonyp@1524 | 49 | // |
tonyp@1524 | 50 | // survivor_used = survivor_num * region_size |
tonyp@1524 | 51 | // eden_used = young_region_num * region_size - survivor_used |
tonyp@1524 | 52 | // old_gen_used = overall_used - eden_used - survivor_used |
tonyp@1524 | 53 | // |
tonyp@1524 | 54 | // Note that survivor_used and eden_used are upper bounds. To get the |
tonyp@1524 | 55 | // actual value we would have to iterate over the regions and add up |
tonyp@1524 | 56 | // ->used(). But that'd be expensive. So, we'll accept some lack of |
tonyp@1524 | 57 | // accuracy for those two. But, we have to be careful when calculating |
tonyp@1524 | 58 | // old_gen_used, in case we subtract from overall_used more then the |
tonyp@1524 | 59 | // actual number and our result goes negative. |
tonyp@1524 | 60 | // |
tonyp@1524 | 61 | // 2) Calculating the used space is straightforward, as described |
tonyp@1524 | 62 | // above. However, how do we calculate the committed space, given that |
tonyp@1524 | 63 | // we allocate space for the eden, survivor, and old gen out of the |
tonyp@1524 | 64 | // same pool of regions? One way to do this is to use the used value |
tonyp@1524 | 65 | // as also the committed value for the eden and survivor spaces and |
tonyp@1524 | 66 | // then calculate the old gen committed space as follows: |
tonyp@1524 | 67 | // |
tonyp@1524 | 68 | // old_gen_committed = overall_committed - eden_committed - survivor_committed |
tonyp@1524 | 69 | // |
tonyp@1524 | 70 | // Maybe a better way to do that would be to calculate used for eden |
tonyp@1524 | 71 | // and survivor as a sum of ->used() over their regions and then |
tonyp@1524 | 72 | // calculate committed as region_num * region_size (i.e., what we use |
tonyp@1524 | 73 | // to calculate the used space now). This is something to consider |
tonyp@1524 | 74 | // in the future. |
tonyp@1524 | 75 | // |
tonyp@1524 | 76 | // 3) Another decision that is again not straightforward is what is |
tonyp@1524 | 77 | // the max size that each memory pool can grow to. Right now, we set |
tonyp@1524 | 78 | // that the committed size for the eden and the survivors and |
tonyp@1524 | 79 | // calculate the old gen max as follows (basically, it's a similar |
tonyp@1524 | 80 | // pattern to what we use for the committed space, as described |
tonyp@1524 | 81 | // above): |
tonyp@1524 | 82 | // |
tonyp@1524 | 83 | // old_gen_max = overall_max - eden_max - survivor_max |
tonyp@1524 | 84 | // |
tonyp@1524 | 85 | // 4) Now, there is a very subtle issue with all the above. The |
tonyp@1524 | 86 | // framework will call get_memory_usage() on the three pools |
tonyp@1524 | 87 | // asynchronously. As a result, each call might get a different value |
tonyp@1524 | 88 | // for, say, survivor_num which will yield inconsistent values for |
tonyp@1524 | 89 | // eden_used, survivor_used, and old_gen_used (as survivor_num is used |
tonyp@1524 | 90 | // in the calculation of all three). This would normally be |
tonyp@1524 | 91 | // ok. However, it's possible that this might cause the sum of |
tonyp@1524 | 92 | // eden_used, survivor_used, and old_gen_used to go over the max heap |
tonyp@1524 | 93 | // size and this seems to sometimes cause JConsole (and maybe other |
tonyp@1524 | 94 | // clients) to get confused. There's not a really an easy / clean |
tonyp@1524 | 95 | // solution to this problem, due to the asynchrounous nature of the |
tonyp@1524 | 96 | // framework. |
tonyp@1524 | 97 | |
tonyp@1524 | 98 | |
tonyp@1524 | 99 | // This class is shared by the three G1 memory pool classes |
tonyp@1524 | 100 | // (G1EdenPool, G1SurvivorPool, G1OldGenPool). Given that the way we |
tonyp@1524 | 101 | // calculate used / committed bytes for these three pools is related |
tonyp@1524 | 102 | // (see comment above), we put the calculations in this class so that |
tonyp@1524 | 103 | // we can easily share them among the subclasses. |
tonyp@1524 | 104 | class G1MemoryPoolSuper : public CollectedMemoryPool { |
tonyp@1524 | 105 | private: |
tonyp@1524 | 106 | G1CollectedHeap* _g1h; |
tonyp@1524 | 107 | |
tonyp@1524 | 108 | // It returns x - y if x > y, 0 otherwise. |
tonyp@1524 | 109 | // As described in the comment above, some of the inputs to the |
tonyp@1524 | 110 | // calculations we have to do are obtained concurrently and hence |
tonyp@1524 | 111 | // may be inconsistent with each other. So, this provides a |
tonyp@1524 | 112 | // defensive way of performing the subtraction and avoids the value |
tonyp@1524 | 113 | // going negative (which would mean a very large result, given that |
tonyp@1524 | 114 | // the parameter are size_t). |
tonyp@1524 | 115 | static size_t subtract_up_to_zero(size_t x, size_t y) { |
tonyp@1524 | 116 | if (x > y) { |
tonyp@1524 | 117 | return x - y; |
tonyp@1524 | 118 | } else { |
tonyp@1524 | 119 | return 0; |
tonyp@1524 | 120 | } |
tonyp@1524 | 121 | } |
tonyp@1524 | 122 | |
tonyp@1524 | 123 | protected: |
tonyp@1524 | 124 | // Would only be called from subclasses. |
tonyp@1524 | 125 | G1MemoryPoolSuper(G1CollectedHeap* g1h, |
tonyp@1524 | 126 | const char* name, |
tonyp@1524 | 127 | size_t init_size, |
tonyp@1524 | 128 | size_t max_size, |
tonyp@1524 | 129 | bool support_usage_threshold); |
tonyp@1524 | 130 | |
tonyp@1524 | 131 | // The reason why all the code is in static methods is so that it |
tonyp@1524 | 132 | // can be safely called from the constructors of the subclasses. |
tonyp@1524 | 133 | |
tonyp@1524 | 134 | static size_t overall_committed(G1CollectedHeap* g1h) { |
tonyp@1524 | 135 | return g1h->capacity(); |
tonyp@1524 | 136 | } |
tonyp@1524 | 137 | static size_t overall_used(G1CollectedHeap* g1h) { |
tonyp@1524 | 138 | return g1h->used_unlocked(); |
tonyp@1524 | 139 | } |
tonyp@1524 | 140 | |
tonyp@1524 | 141 | static size_t eden_space_committed(G1CollectedHeap* g1h); |
tonyp@1524 | 142 | static size_t eden_space_used(G1CollectedHeap* g1h); |
tonyp@1524 | 143 | static size_t eden_space_max(G1CollectedHeap* g1h); |
tonyp@1524 | 144 | |
tonyp@1524 | 145 | static size_t survivor_space_committed(G1CollectedHeap* g1h); |
tonyp@1524 | 146 | static size_t survivor_space_used(G1CollectedHeap* g1h); |
tonyp@1524 | 147 | static size_t survivor_space_max(G1CollectedHeap* g1h); |
tonyp@1524 | 148 | |
tonyp@1524 | 149 | static size_t old_space_committed(G1CollectedHeap* g1h); |
tonyp@1524 | 150 | static size_t old_space_used(G1CollectedHeap* g1h); |
tonyp@1524 | 151 | static size_t old_space_max(G1CollectedHeap* g1h); |
tonyp@1524 | 152 | |
tonyp@1524 | 153 | // The non-static versions are included for convenience. |
tonyp@1524 | 154 | |
tonyp@1524 | 155 | size_t eden_space_committed() { |
tonyp@1524 | 156 | return eden_space_committed(_g1h); |
tonyp@1524 | 157 | } |
tonyp@1524 | 158 | size_t eden_space_used() { |
tonyp@1524 | 159 | return eden_space_used(_g1h); |
tonyp@1524 | 160 | } |
tonyp@1524 | 161 | size_t eden_space_max() { |
tonyp@1524 | 162 | return eden_space_max(_g1h); |
tonyp@1524 | 163 | } |
tonyp@1524 | 164 | |
tonyp@1524 | 165 | size_t survivor_space_committed() { |
tonyp@1524 | 166 | return survivor_space_committed(_g1h); |
tonyp@1524 | 167 | } |
tonyp@1524 | 168 | size_t survivor_space_used() { |
tonyp@1524 | 169 | return survivor_space_used(_g1h); |
tonyp@1524 | 170 | } |
tonyp@1524 | 171 | size_t survivor_space_max() { |
tonyp@1524 | 172 | return survivor_space_max(_g1h); |
tonyp@1524 | 173 | } |
tonyp@1524 | 174 | |
tonyp@1524 | 175 | size_t old_space_committed() { |
tonyp@1524 | 176 | return old_space_committed(_g1h); |
tonyp@1524 | 177 | } |
tonyp@1524 | 178 | size_t old_space_used() { |
tonyp@1524 | 179 | return old_space_used(_g1h); |
tonyp@1524 | 180 | } |
tonyp@1524 | 181 | size_t old_space_max() { |
tonyp@1524 | 182 | return old_space_max(_g1h); |
tonyp@1524 | 183 | } |
tonyp@1524 | 184 | }; |
tonyp@1524 | 185 | |
tonyp@1524 | 186 | // Memory pool that represents the G1 eden. |
tonyp@1524 | 187 | class G1EdenPool : public G1MemoryPoolSuper { |
tonyp@1524 | 188 | public: |
tonyp@1524 | 189 | G1EdenPool(G1CollectedHeap* g1h); |
tonyp@1524 | 190 | |
tonyp@1524 | 191 | size_t used_in_bytes() { |
tonyp@1524 | 192 | return eden_space_used(); |
tonyp@1524 | 193 | } |
tonyp@1524 | 194 | size_t max_size() { |
tonyp@1524 | 195 | return eden_space_max(); |
tonyp@1524 | 196 | } |
tonyp@1524 | 197 | MemoryUsage get_memory_usage(); |
tonyp@1524 | 198 | }; |
tonyp@1524 | 199 | |
tonyp@1524 | 200 | // Memory pool that represents the G1 survivor. |
tonyp@1524 | 201 | class G1SurvivorPool : public G1MemoryPoolSuper { |
tonyp@1524 | 202 | public: |
tonyp@1524 | 203 | G1SurvivorPool(G1CollectedHeap* g1h); |
tonyp@1524 | 204 | |
tonyp@1524 | 205 | size_t used_in_bytes() { |
tonyp@1524 | 206 | return survivor_space_used(); |
tonyp@1524 | 207 | } |
tonyp@1524 | 208 | size_t max_size() { |
tonyp@1524 | 209 | return survivor_space_max(); |
tonyp@1524 | 210 | } |
tonyp@1524 | 211 | MemoryUsage get_memory_usage(); |
tonyp@1524 | 212 | }; |
tonyp@1524 | 213 | |
tonyp@1524 | 214 | // Memory pool that represents the G1 old gen. |
tonyp@1524 | 215 | class G1OldGenPool : public G1MemoryPoolSuper { |
tonyp@1524 | 216 | public: |
tonyp@1524 | 217 | G1OldGenPool(G1CollectedHeap* g1h); |
tonyp@1524 | 218 | |
tonyp@1524 | 219 | size_t used_in_bytes() { |
tonyp@1524 | 220 | return old_space_used(); |
tonyp@1524 | 221 | } |
tonyp@1524 | 222 | size_t max_size() { |
tonyp@1524 | 223 | return old_space_max(); |
tonyp@1524 | 224 | } |
tonyp@1524 | 225 | MemoryUsage get_memory_usage(); |
tonyp@1524 | 226 | }; |