0 /*
1 * Copyright (c) 2001, 2017, Oracle and/or its affiliates. All rights reserved.
2 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
3 *
4 * This code is free software; you can redistribute it and/or modify it
5 * under the terms of the GNU General Public License version 2 only, as
6 * published by the Free Software Foundation.
7 *
8 * This code is distributed in the hope that it will be useful, but WITHOUT
9 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
10 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
11 * version 2 for more details (a copy is included in the LICENSE file that
12 * accompanied this code).
13 *
14 * You should have received a copy of the GNU General Public License version
15 * 2 along with this work; if not, write to the Free Software Foundation,
16 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
17 *
18 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
19 * or visit www.oracle.com if you need additional information or have any
20 * questions.
|
0 /*
1 * Copyright (c) 2001, 2018, Oracle and/or its affiliates. All rights reserved.
2 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
3 *
4 * This code is free software; you can redistribute it and/or modify it
5 * under the terms of the GNU General Public License version 2 only, as
6 * published by the Free Software Foundation.
7 *
8 * This code is distributed in the hope that it will be useful, but WITHOUT
9 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
10 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
11 * version 2 for more details (a copy is included in the LICENSE file that
12 * accompanied this code).
13 *
14 * You should have received a copy of the GNU General Public License version
15 * 2 along with this work; if not, write to the Free Software Foundation,
16 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
17 *
18 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
19 * or visit www.oracle.com if you need additional information or have any
20 * questions.
|
90 // Adaptive size policy support
91 // Allows adjustment of the base and size of the covered regions
92 void resize_covered_region(MemRegion new_region);
93 // Finds the covered region to resize based on the start address
94 // of the covered regions.
95 void resize_covered_region_by_start(MemRegion new_region);
96 // Finds the covered region to resize based on the end address
97 // of the covered regions.
98 void resize_covered_region_by_end(int changed_region, MemRegion new_region);
99 // Finds the lowest start address of a covered region that is
100 // previous (i.e., lower index) to the covered region with index "ind".
101 HeapWord* lowest_prev_committed_start(int ind) const;
102
103 #ifdef ASSERT
104
105 bool is_valid_card_address(jbyte* addr) {
106 return (addr >= _byte_map) && (addr < _byte_map + _byte_map_size);
107 }
108
109 #endif // ASSERT
110 };
111
112 template<>
113 struct BarrierSet::GetName<CardTableExtension> {
114 static const BarrierSet::Name value = BarrierSet::CardTableExtension;
115 };
116
117 template<>
118 struct BarrierSet::GetType<BarrierSet::CardTableExtension> {
119 typedef ::CardTableExtension type;
120 };
121
122 #endif // SHARE_VM_GC_PARALLEL_CARDTABLEEXTENSION_HPP
|
90 // Adaptive size policy support
91 // Allows adjustment of the base and size of the covered regions
92 void resize_covered_region(MemRegion new_region);
93 // Finds the covered region to resize based on the start address
94 // of the covered regions.
95 void resize_covered_region_by_start(MemRegion new_region);
96 // Finds the covered region to resize based on the end address
97 // of the covered regions.
98 void resize_covered_region_by_end(int changed_region, MemRegion new_region);
99 // Finds the lowest start address of a covered region that is
100 // previous (i.e., lower index) to the covered region with index "ind".
101 HeapWord* lowest_prev_committed_start(int ind) const;
102
103 #ifdef ASSERT
104
105 bool is_valid_card_address(jbyte* addr) {
106 return (addr >= _byte_map) && (addr < _byte_map + _byte_map_size);
107 }
108
109 #endif // ASSERT
110
111 // ReduceInitialCardMarks support
112 virtual bool is_in_young(oop obj) const;
113
114 virtual bool card_mark_must_follow_store() const {
115 return false;
116 }
117 };
118
119 template<>
120 struct BarrierSet::GetName<CardTableExtension> {
121 static const BarrierSet::Name value = BarrierSet::CardTableExtension;
122 };
123
124 template<>
125 struct BarrierSet::GetType<BarrierSet::CardTableExtension> {
126 typedef ::CardTableExtension type;
127 };
128
129 #endif // SHARE_VM_GC_PARALLEL_CARDTABLEEXTENSION_HPP
|