infernap12/jdk
1
0
Fork 0
mirror of https://github.com/openjdk/jdk.git synced 2026-02-26 18:20:28 +00:00
Code Issues Packages Projects Releases Wiki Activity

8333035: Parallel: Remove ParMarkBitMap::IterationStatus

Browse Source 
Reviewed-by: tschatzl
This commit is contained in:
Albert Mingkun Yang 2024-05-28 14:47:04 +00:00
parent 87a06b6ce4
commit 4754f059f9
3 changed files with 3 additions and 11 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
src/hotspot/share/gc/parallel/parMarkBitMap.hpp
View File

@ -35,9 +35,6 @@ class ParMarkBitMap: public CHeapObj<mtGC> {
public:
typedef BitMap::idx_t idx_t;
// Values returned by the iterate() methods.
enum IterationStatus { incomplete, complete, full };
inline ParMarkBitMap();
bool initialize(MemRegion covered_region);

4
src/hotspot/share/gc/parallel/psParallelCompact.cpp
View File

@ -2624,8 +2624,7 @@ void MoveAndUpdateClosure::complete_region(ParCompactionManager *cm, HeapWord *d
region_ptr->set_completed();
}
MoveAndUpdateClosure::IterationStatus
MoveAndUpdateClosure::do_addr(HeapWord* addr, size_t words) {
void MoveAndUpdateClosure::do_addr(HeapWord* addr, size_t words) {
assert(destination() != nullptr, "sanity");
_source = addr;
@ -2648,7 +2647,6 @@ MoveAndUpdateClosure::do_addr(HeapWord* addr, size_t words) {
}
update_state(words);
return is_full() ? ParMarkBitMap::full : ParMarkBitMap::incomplete;
}
void MoveAndUpdateShadowClosure::complete_region(ParCompactionManager *cm, HeapWord *dest_addr,

7
src/hotspot/share/gc/parallel/psParallelCompact.hpp
View File

@ -904,7 +904,6 @@ class MoveAndUpdateClosure: public StackObj {
public:
typedef ParMarkBitMap::idx_t idx_t;
typedef ParMarkBitMap::IterationStatus IterationStatus;
ParMarkBitMap* bitmap() const { return _bitmap; }
@ -914,10 +913,8 @@ class MoveAndUpdateClosure: public StackObj {
void set_source(HeapWord* addr) { _source = addr; }
// If the object will fit (size <= words_remaining()), copy it to the current
// destination, update the interior oops and the start array and return either
// full (if the closure is full) or incomplete. If the object will not fit,
// return would_overflow.
virtual IterationStatus do_addr(HeapWord* addr, size_t words);
// destination, update the interior oops and the start array.
void do_addr(HeapWord* addr, size_t words);
inline MoveAndUpdateClosure(ParMarkBitMap* bitmap, size_t region);