Mercurial > hg > graal-compiler
annotate src/share/vm/gc_implementation/parallelScavenge/adjoiningGenerations.hpp @ 6197:d2a62e0f25eb
6995781: Native Memory Tracking (Phase 1)
7151532: DCmd for hotspot native memory tracking
Summary: Implementation of native memory tracking phase 1, which tracks VM native memory usage, and related DCmd
Reviewed-by: acorn, coleenp, fparain
| author | zgu |
|---|---|
| date | Thu, 28 Jun 2012 17:03:16 -0400 |
| parents | f95d63e2154a |
| children | da91efe96a93 |
| rev | line source |
|---|---|
| 0 | 1 /* |
| 1972 | 2 * Copyright (c) 2003, 2010, Oracle and/or its affiliates. All rights reserved. |
| 0 | 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
| 4 * | |
| 5 * This code is free software; you can redistribute it and/or modify it | |
| 6 * under the terms of the GNU General Public License version 2 only, as | |
| 7 * published by the Free Software Foundation. | |
| 8 * | |
| 9 * This code is distributed in the hope that it will be useful, but WITHOUT | |
| 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
| 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
| 12 * version 2 for more details (a copy is included in the LICENSE file that | |
| 13 * accompanied this code). | |
| 14 * | |
| 15 * You should have received a copy of the GNU General Public License version | |
| 16 * 2 along with this work; if not, write to the Free Software Foundation, | |
| 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. | |
| 18 * | |
|
1552
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
0
diff
changeset
|
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
|
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
0
diff
changeset
|
20 * or visit www.oracle.com if you need additional information or have any |
|
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
0
diff
changeset
|
21 * questions. |
| 0 | 22 * |
| 23 */ | |
| 24 | |
| 1972 | 25 #ifndef SHARE_VM_GC_IMPLEMENTATION_PARALLELSCAVENGE_ADJOININGGENERATIONS_HPP |
| 26 #define SHARE_VM_GC_IMPLEMENTATION_PARALLELSCAVENGE_ADJOININGGENERATIONS_HPP | |
| 27 | |
| 28 #include "gc_implementation/parallelScavenge/adjoiningVirtualSpaces.hpp" | |
| 29 #include "gc_implementation/parallelScavenge/asPSOldGen.hpp" | |
| 30 #include "gc_implementation/parallelScavenge/asPSYoungGen.hpp" | |
| 31 #include "gc_implementation/parallelScavenge/psPermGen.hpp" | |
| 32 | |
| 0 | 33 |
| 34 // Contains two generations that both use an AdjoiningVirtualSpaces. | |
| 35 // The two generations are adjacent in the reserved space for the | |
| 36 // heap. Each generation has a virtual space and shrinking and | |
| 37 // expanding of the generations can still be down with that | |
| 38 // virtual space as was previously done. If expanding of reserved | |
| 39 // size of a generation is required, the adjacent generation | |
| 40 // must be shrunk. Adjusting the boundary between the generations | |
| 41 // is called for in this class. | |
| 42 | |
| 6197 | 43 class AdjoiningGenerations : public CHeapObj<mtGC> { |
| 0 | 44 friend class VMStructs; |
| 45 private: | |
| 46 // The young generation and old generation, respectively | |
| 47 PSYoungGen* _young_gen; | |
| 48 PSOldGen* _old_gen; | |
| 49 | |
| 50 // The spaces used by the two generations. | |
| 51 AdjoiningVirtualSpaces _virtual_spaces; | |
| 52 | |
| 53 // Move boundary up to expand old gen. Checks are made to | |
| 54 // determine if the move can be done with specified limits. | |
| 55 void request_old_gen_expansion(size_t desired_change_in_bytes); | |
| 56 // Move boundary down to expand young gen. | |
| 57 bool request_young_gen_expansion(size_t desired_change_in_bytes); | |
| 58 | |
| 59 public: | |
| 60 AdjoiningGenerations(ReservedSpace rs, | |
| 61 size_t init_low_byte_size, | |
| 62 size_t min_low_byte_size, | |
| 63 size_t max_low_byte_size, | |
| 64 size_t init_high_byte_size, | |
| 65 size_t min_high_byte_size, | |
| 66 size_t max_high_bytes_size, | |
| 67 size_t alignment); | |
| 68 | |
| 69 // Accessors | |
| 70 PSYoungGen* young_gen() { return _young_gen; } | |
| 71 PSOldGen* old_gen() { return _old_gen; } | |
| 72 | |
| 73 AdjoiningVirtualSpaces* virtual_spaces() { return &_virtual_spaces; } | |
| 74 | |
| 75 // Additional space is needed in the old generation. Check | |
| 76 // the available space and attempt to move the boundary if more space | |
| 77 // is needed. The growth is not guaranteed to occur. | |
| 78 void adjust_boundary_for_old_gen_needs(size_t desired_change_in_bytes); | |
| 79 // Similary for a growth of the young generation. | |
| 80 void adjust_boundary_for_young_gen_needs(size_t eden_size, size_t survivor_size); | |
| 81 | |
| 82 // Return the total byte size of the reserved space | |
| 83 // for the adjoining generations. | |
| 84 size_t reserved_byte_size(); | |
| 85 }; | |
| 1972 | 86 |
| 87 #endif // SHARE_VM_GC_IMPLEMENTATION_PARALLELSCAVENGE_ADJOININGGENERATIONS_HPP |