0N/A/*
3203N/A * Copyright (c) 2006, 2012, Oracle and/or its affiliates. All rights reserved.
0N/A * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
0N/A *
0N/A * This code is free software; you can redistribute it and/or modify it
0N/A * under the terms of the GNU General Public License version 2 only, as
0N/A * published by the Free Software Foundation.
0N/A *
0N/A * This code is distributed in the hope that it will be useful, but WITHOUT
0N/A * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
0N/A * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
0N/A * version 2 for more details (a copy is included in the LICENSE file that
0N/A * accompanied this code).
0N/A *
0N/A * You should have received a copy of the GNU General Public License version
0N/A * 2 along with this work; if not, write to the Free Software Foundation,
0N/A * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
0N/A *
1472N/A * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
1472N/A * or visit www.oracle.com if you need additional information or have any
1472N/A * questions.
0N/A *
0N/A */
0N/A
1879N/A#ifndef SHARE_VM_GC_IMPLEMENTATION_PARALLELSCAVENGE_PARALLELSCAVENGEHEAP_INLINE_HPP
1879N/A#define SHARE_VM_GC_IMPLEMENTATION_PARALLELSCAVENGE_PARALLELSCAVENGEHEAP_INLINE_HPP
1879N/A
1879N/A#include "gc_implementation/parallelScavenge/parallelScavengeHeap.hpp"
1879N/A#include "gc_implementation/parallelScavenge/psMarkSweep.hpp"
1879N/A#include "gc_implementation/parallelScavenge/psParallelCompact.hpp"
1879N/A#include "gc_implementation/parallelScavenge/psScavenge.hpp"
1879N/A
0N/Ainline size_t ParallelScavengeHeap::total_invocations()
0N/A{
0N/A return UseParallelOldGC ? PSParallelCompact::total_invocations() :
0N/A PSMarkSweep::total_invocations();
0N/A}
0N/A
3203N/Ainline bool ParallelScavengeHeap::should_alloc_in_eden(const size_t size) const
3203N/A{
3203N/A const size_t eden_size = young_gen()->eden_space()->capacity_in_words();
3203N/A return size < eden_size / 2;
3203N/A}
3203N/A
0N/Ainline void ParallelScavengeHeap::invoke_scavenge()
0N/A{
0N/A PSScavenge::invoke();
0N/A}
0N/A
0N/Ainline void ParallelScavengeHeap::invoke_full_gc(bool maximum_compaction)
0N/A{
0N/A if (UseParallelOldGC) {
0N/A PSParallelCompact::invoke(maximum_compaction);
0N/A } else {
0N/A PSMarkSweep::invoke(maximum_compaction);
0N/A }
0N/A}
1027N/A
1027N/Ainline bool ParallelScavengeHeap::is_in_young(oop p) {
2474N/A // Assumes the the old gen address range is lower than that of the young gen.
2474N/A const void* loc = (void*) p;
2474N/A bool result = ((HeapWord*)p) >= young_gen()->reserved().start();
2474N/A assert(result == young_gen()->is_in_reserved(p),
2474N/A err_msg("incorrect test - result=%d, p=" PTR_FORMAT, result, (void*)p));
2474N/A return result;
1027N/A}
1027N/A
1027N/Ainline bool ParallelScavengeHeap::is_in_old_or_perm(oop p) {
1027N/A return old_gen()->is_in_reserved(p) || perm_gen()->is_in_reserved(p);
1027N/A}
1879N/A
1879N/A#endif // SHARE_VM_GC_IMPLEMENTATION_PARALLELSCAVENGE_PARALLELSCAVENGEHEAP_INLINE_HPP