< prev index next >

src/hotspot/share/gc/shenandoah/shenandoahMarkingContext.inline.hpp

Print this page

  1 /*
  2  * Copyright (c) 2018, 2019, Red Hat, Inc. 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_GC_SHENANDOAH_SHENANDOAHMARKINGCONTEXT_INLINE_HPP
 26 #define SHARE_GC_SHENANDOAH_SHENANDOAHMARKINGCONTEXT_INLINE_HPP
 27 
 28 #include "gc/shenandoah/shenandoahMarkingContext.hpp"
 29 
 30 #include "gc/shenandoah/shenandoahMarkBitMap.inline.hpp"

 31 
 32 inline bool ShenandoahMarkingContext::mark_strong(oop obj, bool& was_upgraded) {
 33   return !allocated_after_mark_start(obj) && _mark_bit_map.mark_strong(cast_from_oop<HeapWord*>(obj), was_upgraded);
 34 }
 35 
 36 inline bool ShenandoahMarkingContext::mark_weak(oop obj) {
 37   return !allocated_after_mark_start(obj) && _mark_bit_map.mark_weak(cast_from_oop<HeapWord *>(obj));
 38 }
 39 
 40 inline bool ShenandoahMarkingContext::is_marked(oop obj) const {
 41   return allocated_after_mark_start(obj) || _mark_bit_map.is_marked(cast_from_oop<HeapWord *>(obj));
 42 }
 43 
 44 inline bool ShenandoahMarkingContext::is_marked_strong(oop obj) const {
 45   return allocated_after_mark_start(obj) || _mark_bit_map.is_marked_strong(cast_from_oop<HeapWord*>(obj));
 46 }
 47 
 48 inline bool ShenandoahMarkingContext::is_marked_weak(oop obj) const {
 49   return allocated_after_mark_start(obj) || _mark_bit_map.is_marked_weak(cast_from_oop<HeapWord *>(obj));
 50 }
 51 
 52 inline HeapWord* ShenandoahMarkingContext::get_next_marked_addr(HeapWord* start, HeapWord* limit) const {








 53   return _mark_bit_map.get_next_marked_addr(start, limit);
 54 }
 55 
 56 inline bool ShenandoahMarkingContext::allocated_after_mark_start(oop obj) const {
 57   HeapWord* addr = cast_from_oop<HeapWord*>(obj);
 58   return allocated_after_mark_start(addr);
 59 }
 60 
 61 inline bool ShenandoahMarkingContext::allocated_after_mark_start(HeapWord* addr) const {
 62   uintx index = ((uintx) addr) >> ShenandoahHeapRegion::region_size_bytes_shift();
 63   HeapWord* top_at_mark_start = _top_at_mark_starts[index];
 64   bool alloc_after_mark_start = addr >= top_at_mark_start;
 65   return alloc_after_mark_start;
 66 }
 67 
 68 inline void ShenandoahMarkingContext::capture_top_at_mark_start(ShenandoahHeapRegion *r) {





 69   size_t idx = r->index();
 70   HeapWord* old_tams = _top_at_mark_starts_base[idx];
 71   HeapWord* new_tams = r->top();
 72 
 73   assert(new_tams >= old_tams,
 74          "Region " SIZE_FORMAT", TAMS updates should be monotonic: " PTR_FORMAT " -> " PTR_FORMAT,
 75          idx, p2i(old_tams), p2i(new_tams));
 76   assert(is_bitmap_clear_range(old_tams, new_tams),



 77          "Region " SIZE_FORMAT ", bitmap should be clear while adjusting TAMS: " PTR_FORMAT " -> " PTR_FORMAT,
 78          idx, p2i(old_tams), p2i(new_tams));
 79 











 80   _top_at_mark_starts_base[idx] = new_tams;
 81   _top_bitmaps[idx] = new_tams;



 82 }
 83 
 84 inline void ShenandoahMarkingContext::reset_top_at_mark_start(ShenandoahHeapRegion* r) {
 85   _top_at_mark_starts_base[r->index()] = r->bottom();
 86 }
 87 
 88 inline HeapWord* ShenandoahMarkingContext::top_at_mark_start(ShenandoahHeapRegion* r) const {
 89   return _top_at_mark_starts_base[r->index()];
 90 }
 91 
 92 inline void ShenandoahMarkingContext::reset_top_bitmap(ShenandoahHeapRegion* r) {
 93   assert(is_bitmap_clear_range(r->bottom(), r->end()),
 94          "Region " SIZE_FORMAT " should have no marks in bitmap", r->index());
 95   _top_bitmaps[r->index()] = r->bottom();
 96 }
 97 
 98 #endif // SHARE_GC_SHENANDOAH_SHENANDOAHMARKINGCONTEXT_INLINE_HPP

  1 /*
  2  * Copyright (c) 2018, 2019, Red Hat, Inc. All rights reserved.
  3  * Copyright Amazon.com Inc. or its affiliates. All Rights Reserved.
  4  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  5  *
  6  * This code is free software; you can redistribute it and/or modify it
  7  * under the terms of the GNU General Public License version 2 only, as
  8  * published by the Free Software Foundation.
  9  *
 10  * This code is distributed in the hope that it will be useful, but WITHOUT
 11  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
 12  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
 13  * version 2 for more details (a copy is included in the LICENSE file that
 14  * accompanied this code).
 15  *
 16  * You should have received a copy of the GNU General Public License version
 17  * 2 along with this work; if not, write to the Free Software Foundation,
 18  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
 19  *
 20  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
 21  * or visit www.oracle.com if you need additional information or have any
 22  * questions.
 23  *
 24  */
 25 
 26 #ifndef SHARE_GC_SHENANDOAH_SHENANDOAHMARKINGCONTEXT_INLINE_HPP
 27 #define SHARE_GC_SHENANDOAH_SHENANDOAHMARKINGCONTEXT_INLINE_HPP
 28 
 29 #include "gc/shenandoah/shenandoahMarkingContext.hpp"

 30 #include "gc/shenandoah/shenandoahMarkBitMap.inline.hpp"
 31 #include "logging/log.hpp"
 32 
 33 inline bool ShenandoahMarkingContext::mark_strong(oop obj, bool& was_upgraded) {
 34   return !allocated_after_mark_start(obj) && _mark_bit_map.mark_strong(cast_from_oop<HeapWord*>(obj), was_upgraded);
 35 }
 36 
 37 inline bool ShenandoahMarkingContext::mark_weak(oop obj) {
 38   return !allocated_after_mark_start(obj) && _mark_bit_map.mark_weak(cast_from_oop<HeapWord *>(obj));
 39 }
 40 
 41 inline bool ShenandoahMarkingContext::is_marked(const oop obj) const {
 42   return allocated_after_mark_start(obj) || _mark_bit_map.is_marked(cast_from_oop<HeapWord *>(obj));
 43 }
 44 
 45 inline bool ShenandoahMarkingContext::is_marked_strong(const oop obj) const {
 46   return allocated_after_mark_start(obj) || _mark_bit_map.is_marked_strong(cast_from_oop<HeapWord*>(obj));
 47 }
 48 
 49 inline bool ShenandoahMarkingContext::is_marked_weak(const oop obj) const {
 50   return allocated_after_mark_start(obj) || _mark_bit_map.is_marked_weak(cast_from_oop<HeapWord *>(obj));
 51 }
 52 
 53 inline bool ShenandoahMarkingContext::is_marked_or_old(const oop obj) const {
 54   return is_marked(obj) || ShenandoahHeap::heap()->is_old(obj);
 55 }
 56 
 57 inline bool ShenandoahMarkingContext::is_marked_strong_or_old(const oop obj) const {
 58   return is_marked_strong(obj) || ShenandoahHeap::heap()->is_old(obj);
 59 }
 60 
 61 inline HeapWord* ShenandoahMarkingContext::get_next_marked_addr(const HeapWord* start, const HeapWord* limit) const {
 62   return _mark_bit_map.get_next_marked_addr(start, limit);
 63 }
 64 
 65 inline bool ShenandoahMarkingContext::allocated_after_mark_start(const oop obj) const {
 66   const HeapWord* addr = cast_from_oop<HeapWord*>(obj);
 67   return allocated_after_mark_start(addr);
 68 }
 69 
 70 inline bool ShenandoahMarkingContext::allocated_after_mark_start(const HeapWord* addr) const {
 71   uintx index = ((uintx) addr) >> ShenandoahHeapRegion::region_size_bytes_shift();
 72   HeapWord* top_at_mark_start = _top_at_mark_starts[index];
 73   const bool alloc_after_mark_start = addr >= top_at_mark_start;
 74   return alloc_after_mark_start;
 75 }
 76 
 77 inline void ShenandoahMarkingContext::capture_top_at_mark_start(ShenandoahHeapRegion *r) {
 78   if (!r->is_affiliated()) {
 79     // Non-affiliated regions do not need their TAMS updated
 80     return;
 81   }
 82 
 83   size_t idx = r->index();
 84   HeapWord* old_tams = _top_at_mark_starts_base[idx];
 85   HeapWord* new_tams = r->top();
 86 
 87   assert(new_tams >= old_tams,
 88          "Region " SIZE_FORMAT", TAMS updates should be monotonic: " PTR_FORMAT " -> " PTR_FORMAT,
 89          idx, p2i(old_tams), p2i(new_tams));
 90   assert((new_tams == r->bottom()) || (old_tams == r->bottom()) || (new_tams >= _top_bitmaps[idx]),
 91          "Region " SIZE_FORMAT", top_bitmaps updates should be monotonic: " PTR_FORMAT " -> " PTR_FORMAT,
 92          idx, p2i(_top_bitmaps[idx]), p2i(new_tams));
 93   assert(old_tams == r->bottom() || is_bitmap_clear_range(old_tams, new_tams),
 94          "Region " SIZE_FORMAT ", bitmap should be clear while adjusting TAMS: " PTR_FORMAT " -> " PTR_FORMAT,
 95          idx, p2i(old_tams), p2i(new_tams));
 96 
 97   log_debug(gc)("Capturing TAMS for %s Region " SIZE_FORMAT ", was: " PTR_FORMAT ", now: " PTR_FORMAT,
 98                 r->affiliation_name(), idx, p2i(old_tams), p2i(new_tams));
 99 
100   if ((old_tams == r->bottom()) && (new_tams > old_tams)) {
101     log_debug(gc)("Clearing mark bitmap for %s Region " SIZE_FORMAT " while capturing TAMS",
102                   r->affiliation_name(), idx);
103     // TODO: Do we really need to do bitmap clears here?
104     // This could take a while, and we would instead like to clear bitmaps outside the pause.
105     clear_bitmap(r);
106   }
107 
108   _top_at_mark_starts_base[idx] = new_tams;
109   if (new_tams > r->bottom()) {
110     // In this case, new_tams is greater than old _top_bitmaps[idx]
111     _top_bitmaps[idx] = new_tams;
112   }
113 }
114 
115 inline void ShenandoahMarkingContext::reset_top_at_mark_start(ShenandoahHeapRegion* r) {
116   _top_at_mark_starts_base[r->index()] = r->bottom();
117 }
118 
119 inline HeapWord* ShenandoahMarkingContext::top_at_mark_start(const ShenandoahHeapRegion* r) const {
120   return _top_at_mark_starts_base[r->index()];
121 }
122 
123 inline void ShenandoahMarkingContext::reset_top_bitmap(ShenandoahHeapRegion* r) {
124   assert(is_bitmap_clear_range(r->bottom(), r->end()),
125          "Region " SIZE_FORMAT " should have no marks in bitmap", r->index());
126   _top_bitmaps[r->index()] = r->bottom();
127 }
128 
129 #endif // SHARE_GC_SHENANDOAH_SHENANDOAHMARKINGCONTEXT_INLINE_HPP
< prev index next >