86 lines
3.4 KiB
C++
86 lines
3.4 KiB
C++
/*
|
|
* Copyright (c) 2018, 2019, Red Hat, Inc. 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.
|
|
*
|
|
* This code is distributed in the hope that it will be useful, but WITHOUT
|
|
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
|
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
|
* version 2 for more details (a copy is included in the LICENSE file that
|
|
* accompanied this code).
|
|
*
|
|
* You should have received a copy of the GNU General Public License version
|
|
* 2 along with this work; if not, write to the Free Software Foundation,
|
|
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
|
|
*
|
|
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
|
|
* or visit www.oracle.com if you need additional information or have any
|
|
* questions.
|
|
*
|
|
*/
|
|
|
|
#ifndef SHARE_GC_SHENANDOAH_SHENANDOAHMARKINGCONTEXT_INLINE_HPP
|
|
#define SHARE_GC_SHENANDOAH_SHENANDOAHMARKINGCONTEXT_INLINE_HPP
|
|
|
|
#include "gc/shenandoah/shenandoahMarkingContext.hpp"
|
|
|
|
inline MarkBitMap* ShenandoahMarkingContext::mark_bit_map() {
|
|
return &_mark_bit_map;
|
|
}
|
|
|
|
inline bool ShenandoahMarkingContext::mark(oop obj) {
|
|
shenandoah_assert_not_forwarded(NULL, obj);
|
|
return (! allocated_after_mark_start(obj)) && _mark_bit_map.par_mark(obj);
|
|
}
|
|
|
|
inline bool ShenandoahMarkingContext::is_marked(oop obj) const {
|
|
return allocated_after_mark_start(obj) || _mark_bit_map.is_marked(obj);
|
|
}
|
|
|
|
inline bool ShenandoahMarkingContext::allocated_after_mark_start(oop obj) const {
|
|
HeapWord* addr = cast_from_oop<HeapWord*>(obj);
|
|
return allocated_after_mark_start(addr);
|
|
}
|
|
|
|
inline bool ShenandoahMarkingContext::allocated_after_mark_start(HeapWord* addr) const {
|
|
uintx index = ((uintx) addr) >> ShenandoahHeapRegion::region_size_bytes_shift();
|
|
HeapWord* top_at_mark_start = _top_at_mark_starts[index];
|
|
bool alloc_after_mark_start = addr >= top_at_mark_start;
|
|
return alloc_after_mark_start;
|
|
}
|
|
|
|
inline void ShenandoahMarkingContext::capture_top_at_mark_start(ShenandoahHeapRegion *r) {
|
|
size_t idx = r->index();
|
|
HeapWord* old_tams = _top_at_mark_starts_base[idx];
|
|
HeapWord* new_tams = r->top();
|
|
|
|
assert(new_tams >= old_tams,
|
|
"Region " SIZE_FORMAT", TAMS updates should be monotonic: " PTR_FORMAT " -> " PTR_FORMAT,
|
|
idx, p2i(old_tams), p2i(new_tams));
|
|
assert(is_bitmap_clear_range(old_tams, new_tams),
|
|
"Region " SIZE_FORMAT ", bitmap should be clear while adjusting TAMS: " PTR_FORMAT " -> " PTR_FORMAT,
|
|
idx, p2i(old_tams), p2i(new_tams));
|
|
|
|
_top_at_mark_starts_base[idx] = new_tams;
|
|
_top_bitmaps[idx] = new_tams;
|
|
}
|
|
|
|
inline void ShenandoahMarkingContext::reset_top_at_mark_start(ShenandoahHeapRegion* r) {
|
|
_top_at_mark_starts_base[r->index()] = r->bottom();
|
|
}
|
|
|
|
inline HeapWord* ShenandoahMarkingContext::top_at_mark_start(ShenandoahHeapRegion* r) const {
|
|
return _top_at_mark_starts_base[r->index()];
|
|
}
|
|
|
|
inline void ShenandoahMarkingContext::reset_top_bitmap(ShenandoahHeapRegion* r) {
|
|
assert(is_bitmap_clear_range(r->bottom(), r->end()),
|
|
"Region " SIZE_FORMAT " should have no marks in bitmap", r->index());
|
|
_top_bitmaps[r->index()] = r->bottom();
|
|
}
|
|
|
|
#endif // SHARE_GC_SHENANDOAH_SHENANDOAHMARKINGCONTEXT_INLINE_HPP
|