src/share/vm/gc_implementation/parallelScavenge/adjoiningGenerations.hpp

Thu, 22 Sep 2011 10:57:37 -0700

author
johnc
date
Thu, 22 Sep 2011 10:57:37 -0700
changeset 3175
4dfb2df418f2
parent 2314
f95d63e2154a
child 3900
d2a62e0f25eb
permissions
-rw-r--r--

6484982: G1: process references during evacuation pauses
Summary: G1 now uses two reference processors - one is used by concurrent marking and the other is used by STW GCs (both full and incremental evacuation pauses). In an evacuation pause, the reference processor is embedded into the closures used to scan objects. Doing so causes causes reference objects to be 'discovered' by the reference processor. At the end of the evacuation pause, these discovered reference objects are processed - preserving (and copying) referent objects (and their reachable graphs) as appropriate.
Reviewed-by: ysr, jwilhelm, brutisso, stefank, tonyp

duke@435 1 /*
stefank@2314 2 * Copyright (c) 2003, 2010, Oracle and/or its affiliates. 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 *
trims@1907 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
trims@1907 20 * or visit www.oracle.com if you need additional information or have any
trims@1907 21 * questions.
duke@435 22 *
duke@435 23 */
duke@435 24
stefank@2314 25 #ifndef SHARE_VM_GC_IMPLEMENTATION_PARALLELSCAVENGE_ADJOININGGENERATIONS_HPP
stefank@2314 26 #define SHARE_VM_GC_IMPLEMENTATION_PARALLELSCAVENGE_ADJOININGGENERATIONS_HPP
stefank@2314 27
stefank@2314 28 #include "gc_implementation/parallelScavenge/adjoiningVirtualSpaces.hpp"
stefank@2314 29 #include "gc_implementation/parallelScavenge/asPSOldGen.hpp"
stefank@2314 30 #include "gc_implementation/parallelScavenge/asPSYoungGen.hpp"
stefank@2314 31 #include "gc_implementation/parallelScavenge/psPermGen.hpp"
stefank@2314 32
duke@435 33
duke@435 34 // Contains two generations that both use an AdjoiningVirtualSpaces.
duke@435 35 // The two generations are adjacent in the reserved space for the
duke@435 36 // heap. Each generation has a virtual space and shrinking and
duke@435 37 // expanding of the generations can still be down with that
duke@435 38 // virtual space as was previously done. If expanding of reserved
duke@435 39 // size of a generation is required, the adjacent generation
duke@435 40 // must be shrunk. Adjusting the boundary between the generations
duke@435 41 // is called for in this class.
duke@435 42
duke@435 43 class AdjoiningGenerations : public CHeapObj {
duke@435 44 friend class VMStructs;
duke@435 45 private:
duke@435 46 // The young generation and old generation, respectively
duke@435 47 PSYoungGen* _young_gen;
duke@435 48 PSOldGen* _old_gen;
duke@435 49
duke@435 50 // The spaces used by the two generations.
duke@435 51 AdjoiningVirtualSpaces _virtual_spaces;
duke@435 52
duke@435 53 // Move boundary up to expand old gen. Checks are made to
duke@435 54 // determine if the move can be done with specified limits.
duke@435 55 void request_old_gen_expansion(size_t desired_change_in_bytes);
duke@435 56 // Move boundary down to expand young gen.
duke@435 57 bool request_young_gen_expansion(size_t desired_change_in_bytes);
duke@435 58
duke@435 59 public:
duke@435 60 AdjoiningGenerations(ReservedSpace rs,
duke@435 61 size_t init_low_byte_size,
duke@435 62 size_t min_low_byte_size,
duke@435 63 size_t max_low_byte_size,
duke@435 64 size_t init_high_byte_size,
duke@435 65 size_t min_high_byte_size,
duke@435 66 size_t max_high_bytes_size,
duke@435 67 size_t alignment);
duke@435 68
duke@435 69 // Accessors
duke@435 70 PSYoungGen* young_gen() { return _young_gen; }
duke@435 71 PSOldGen* old_gen() { return _old_gen; }
duke@435 72
duke@435 73 AdjoiningVirtualSpaces* virtual_spaces() { return &_virtual_spaces; }
duke@435 74
duke@435 75 // Additional space is needed in the old generation. Check
duke@435 76 // the available space and attempt to move the boundary if more space
duke@435 77 // is needed. The growth is not guaranteed to occur.
duke@435 78 void adjust_boundary_for_old_gen_needs(size_t desired_change_in_bytes);
duke@435 79 // Similary for a growth of the young generation.
duke@435 80 void adjust_boundary_for_young_gen_needs(size_t eden_size, size_t survivor_size);
duke@435 81
duke@435 82 // Return the total byte size of the reserved space
duke@435 83 // for the adjoining generations.
duke@435 84 size_t reserved_byte_size();
duke@435 85 };
stefank@2314 86
stefank@2314 87 #endif // SHARE_VM_GC_IMPLEMENTATION_PARALLELSCAVENGE_ADJOININGGENERATIONS_HPP

mercurial