1 /*
2 * Copyright (c) 2001, 2014, 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 */
24
25 #ifndef SHARE_VM_GC_IMPLEMENTATION_G1_HEAPREGIONREMSET_HPP
26 #define SHARE_VM_GC_IMPLEMENTATION_G1_HEAPREGIONREMSET_HPP
27
28 #include "gc_implementation/g1/g1CodeCacheRemSet.hpp"
29 #include "gc_implementation/g1/sparsePRT.hpp"
30
31 // Remembered set for a heap region. Represent a set of "cards" that
32 // contain pointers into the owner heap region. Cards are defined somewhat
33 // abstractly, in terms of what the "BlockOffsetTable" in use can parse.
34
35 class G1CollectedHeap;
36 class G1BlockOffsetSharedArray;
37 class HeapRegion;
38 class HeapRegionRemSetIterator;
39 class PerRegionTable;
40 class SparsePRT;
41 class nmethod;
42
43 // Essentially a wrapper around SparsePRTCleanupTask. See
44 // sparsePRT.hpp for more details.
45 class HRRSCleanupTask : public SparsePRTCleanupTask {
46 };
47
48 // The FromCardCache remembers the most recently processed card on the heap on
49 // a per-region and per-thread basis.
470 // The Sparse remembered set iterator.
471 SparsePRTIter _sparse_iter;
472
473 public:
474 HeapRegionRemSetIterator(HeapRegionRemSet* hrrs);
475
476 // If there remains one or more cards to be yielded, returns true and
477 // sets "card_index" to one of those cards (which is then considered
478 // yielded.) Otherwise, returns false (and leaves "card_index"
479 // undefined.)
480 bool has_next(size_t& card_index);
481
482 size_t n_yielded_fine() { return _n_yielded_fine; }
483 size_t n_yielded_coarse() { return _n_yielded_coarse; }
484 size_t n_yielded_sparse() { return _n_yielded_sparse; }
485 size_t n_yielded() {
486 return n_yielded_fine() + n_yielded_coarse() + n_yielded_sparse();
487 }
488 };
489
490 #endif // SHARE_VM_GC_IMPLEMENTATION_G1_HEAPREGIONREMSET_HPP
|
1 /*
2 * Copyright (c) 2001, 2015, 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 */
24
25 #ifndef SHARE_VM_GC_G1_HEAPREGIONREMSET_HPP
26 #define SHARE_VM_GC_G1_HEAPREGIONREMSET_HPP
27
28 #include "gc/g1/g1CodeCacheRemSet.hpp"
29 #include "gc/g1/sparsePRT.hpp"
30
31 // Remembered set for a heap region. Represent a set of "cards" that
32 // contain pointers into the owner heap region. Cards are defined somewhat
33 // abstractly, in terms of what the "BlockOffsetTable" in use can parse.
34
35 class G1CollectedHeap;
36 class G1BlockOffsetSharedArray;
37 class HeapRegion;
38 class HeapRegionRemSetIterator;
39 class PerRegionTable;
40 class SparsePRT;
41 class nmethod;
42
43 // Essentially a wrapper around SparsePRTCleanupTask. See
44 // sparsePRT.hpp for more details.
45 class HRRSCleanupTask : public SparsePRTCleanupTask {
46 };
47
48 // The FromCardCache remembers the most recently processed card on the heap on
49 // a per-region and per-thread basis.
470 // The Sparse remembered set iterator.
471 SparsePRTIter _sparse_iter;
472
473 public:
474 HeapRegionRemSetIterator(HeapRegionRemSet* hrrs);
475
476 // If there remains one or more cards to be yielded, returns true and
477 // sets "card_index" to one of those cards (which is then considered
478 // yielded.) Otherwise, returns false (and leaves "card_index"
479 // undefined.)
480 bool has_next(size_t& card_index);
481
482 size_t n_yielded_fine() { return _n_yielded_fine; }
483 size_t n_yielded_coarse() { return _n_yielded_coarse; }
484 size_t n_yielded_sparse() { return _n_yielded_sparse; }
485 size_t n_yielded() {
486 return n_yielded_fine() + n_yielded_coarse() + n_yielded_sparse();
487 }
488 };
489
490 #endif // SHARE_VM_GC_G1_HEAPREGIONREMSET_HPP
|