jdk8-mips64-public/hotspot: src/share/vm/gc_implementation/parallelScavenge/parallelScavengeHeap.inline.hpp@4dfb2df418f2

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

     1 /*

     2  * Copyright (c) 2006, 2010, Oracle and/or its affiliates. All rights reserved.

     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  *

    19  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA

    20  * or visit www.oracle.com if you need additional information or have any

    21  * questions.

    22  *

    23  */

    25 #ifndef SHARE_VM_GC_IMPLEMENTATION_PARALLELSCAVENGE_PARALLELSCAVENGEHEAP_INLINE_HPP

    26 #define SHARE_VM_GC_IMPLEMENTATION_PARALLELSCAVENGE_PARALLELSCAVENGEHEAP_INLINE_HPP

    28 #include "gc_implementation/parallelScavenge/parallelScavengeHeap.hpp"

    29 #include "gc_implementation/parallelScavenge/psMarkSweep.hpp"

    30 #include "gc_implementation/parallelScavenge/psParallelCompact.hpp"

    31 #include "gc_implementation/parallelScavenge/psScavenge.hpp"

    33 inline size_t ParallelScavengeHeap::total_invocations()

    34 {

    35   return UseParallelOldGC ? PSParallelCompact::total_invocations() :

    36     PSMarkSweep::total_invocations();

    37 }

    39 inline void ParallelScavengeHeap::invoke_scavenge()

    40 {

    41   PSScavenge::invoke();

    42 }

    44 inline void ParallelScavengeHeap::invoke_full_gc(bool maximum_compaction)

    45 {

    46   if (UseParallelOldGC) {

    47     PSParallelCompact::invoke(maximum_compaction);

    48   } else {

    49     PSMarkSweep::invoke(maximum_compaction);

    50   }

    51 }

    53 inline bool ParallelScavengeHeap::is_in_young(oop p) {

    54   // Assumes the the old gen address range is lower than that of the young gen.

    55   const void* loc = (void*) p;

    56   bool result = ((HeapWord*)p) >= young_gen()->reserved().start();

    57   assert(result == young_gen()->is_in_reserved(p),

    58         err_msg("incorrect test - result=%d, p=" PTR_FORMAT, result, (void*)p));

    59   return result;

    60 }

    62 inline bool ParallelScavengeHeap::is_in_old_or_perm(oop p) {

    63   return old_gen()->is_in_reserved(p) || perm_gen()->is_in_reserved(p);

    64 }

    66 #endif // SHARE_VM_GC_IMPLEMENTATION_PARALLELSCAVENGE_PARALLELSCAVENGEHEAP_INLINE_HPP

Mercurial > jdk8-mips64-public > hotspot / file revision

src/share/vm/gc_implementation/parallelScavenge/parallelScavengeHeap.inline.hpp@4dfb2df418f2

src/share/vm/gc_implementation/parallelScavenge/parallelScavengeHeap.inline.hpp