src/share/vm/gc_implementation/g1/sparsePRT.hpp

Print this page

        

*** 1,7 **** /* ! * Copyright (c) 2001, 2009, Oracle and/or its affiliates. All rights reserved. * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. * * This code is free software; you can redistribute it and/or modify it * under the terms of the GNU General Public License version 2 only, as * published by the Free Software Foundation. --- 1,7 ---- /* ! * Copyright (c) 2001, 2010, Oracle and/or its affiliates. All rights reserved. * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. * * This code is free software; you can redistribute it and/or modify it * under the terms of the GNU General Public License version 2 only, as * published by the Free Software Foundation.
*** 20,29 **** --- 20,39 ---- * or visit www.oracle.com if you need additional information or have any * questions. * */ + #ifndef SHARE_VM_GC_IMPLEMENTATION_G1_SPARSEPRT_HPP + #define SHARE_VM_GC_IMPLEMENTATION_G1_SPARSEPRT_HPP + + #include "gc_implementation/g1/g1CollectedHeap.inline.hpp" + #include "gc_implementation/g1/heapRegion.hpp" + #include "memory/allocation.hpp" + #include "memory/cardTableModRefBS.hpp" + #include "runtime/mutex.hpp" + #include "utilities/globalDefinitions.hpp" + // Sparse remembered set for a heap region (the "owning" region). Maps // indices of other regions to short sequences of cards in the other region // that might contain pointers into the owner region. // These tables only expand while they are accessed in parallel --
*** 299,303 **** --- 309,315 ---- } bool has_next(size_t& card_index) { return RSHashTableIter::has_next(card_index); } }; + + #endif // SHARE_VM_GC_IMPLEMENTATION_G1_SPARSEPRT_HPP