1 /*
2  * Copyright (c) 2015, 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_SHENANDOAHHEAPREGION_INLINE_HPP
26 #define SHARE_GC_SHENANDOAH_SHENANDOAHHEAPREGION_INLINE_HPP
27 
28 #include "gc/shenandoah/shenandoahHeapRegion.hpp"
29 
30 #include "gc/shenandoah/shenandoahHeap.inline.hpp"
31 #include "gc/shenandoah/shenandoahPacer.inline.hpp"
32 #include "runtime/atomic.hpp"
33 
allocate(size_t size,ShenandoahAllocRequest::Type type)34 HeapWord* ShenandoahHeapRegion::allocate(size_t size, ShenandoahAllocRequest::Type type) {
35   shenandoah_assert_heaplocked_or_safepoint();
36   assert(is_object_aligned(size), "alloc size breaks alignment: " SIZE_FORMAT, size);
37 
38   HeapWord* obj = top();
39   if (pointer_delta(end(), obj) >= size) {
40     make_regular_allocation();
41     adjust_alloc_metadata(type, size);
42 
43     HeapWord* new_top = obj + size;
44     set_top(new_top);
45 
46     assert(is_object_aligned(new_top), "new top breaks alignment: " PTR_FORMAT, p2i(new_top));
47     assert(is_object_aligned(obj),     "obj is not aligned: "       PTR_FORMAT, p2i(obj));
48 
49     return obj;
50   } else {
51     return NULL;
52   }
53 }
54 
adjust_alloc_metadata(ShenandoahAllocRequest::Type type,size_t size)55 inline void ShenandoahHeapRegion::adjust_alloc_metadata(ShenandoahAllocRequest::Type type, size_t size) {
56   switch (type) {
57     case ShenandoahAllocRequest::_alloc_shared:
58     case ShenandoahAllocRequest::_alloc_shared_gc:
59       // Counted implicitly by tlab/gclab allocs
60       break;
61     case ShenandoahAllocRequest::_alloc_tlab:
62       _tlab_allocs += size;
63       break;
64     case ShenandoahAllocRequest::_alloc_gclab:
65       _gclab_allocs += size;
66       break;
67     default:
68       ShouldNotReachHere();
69   }
70 }
71 
increase_live_data_alloc_words(size_t s)72 inline void ShenandoahHeapRegion::increase_live_data_alloc_words(size_t s) {
73   internal_increase_live_data(s);
74 }
75 
increase_live_data_gc_words(size_t s)76 inline void ShenandoahHeapRegion::increase_live_data_gc_words(size_t s) {
77   internal_increase_live_data(s);
78   if (ShenandoahPacing) {
79     ShenandoahHeap::heap()->pacer()->report_mark(s);
80   }
81 }
82 
internal_increase_live_data(size_t s)83 inline void ShenandoahHeapRegion::internal_increase_live_data(size_t s) {
84   size_t new_live_data = Atomic::add(&_live_data, s, memory_order_relaxed);
85 #ifdef ASSERT
86   size_t live_bytes = new_live_data * HeapWordSize;
87   size_t used_bytes = used();
88   assert(live_bytes <= used_bytes,
89          "can't have more live data than used: " SIZE_FORMAT ", " SIZE_FORMAT, live_bytes, used_bytes);
90 #endif
91 }
92 
clear_live_data()93 inline void ShenandoahHeapRegion::clear_live_data() {
94   Atomic::store(&_live_data, (size_t)0);
95 }
96 
get_live_data_words() const97 inline size_t ShenandoahHeapRegion::get_live_data_words() const {
98   return Atomic::load(&_live_data);
99 }
100 
get_live_data_bytes() const101 inline size_t ShenandoahHeapRegion::get_live_data_bytes() const {
102   return get_live_data_words() * HeapWordSize;
103 }
104 
has_live() const105 inline bool ShenandoahHeapRegion::has_live() const {
106   return get_live_data_words() != 0;
107 }
108 
garbage() const109 inline size_t ShenandoahHeapRegion::garbage() const {
110   assert(used() >= get_live_data_bytes(),
111          "Live Data must be a subset of used() live: " SIZE_FORMAT " used: " SIZE_FORMAT,
112          get_live_data_bytes(), used());
113 
114   size_t result = used() - get_live_data_bytes();
115   return result;
116 }
117 
get_update_watermark() const118 inline HeapWord* ShenandoahHeapRegion::get_update_watermark() const {
119   HeapWord* watermark = Atomic::load_acquire(&_update_watermark);
120   assert(bottom() <= watermark && watermark <= top(), "within bounds");
121   return watermark;
122 }
123 
set_update_watermark(HeapWord * w)124 inline void ShenandoahHeapRegion::set_update_watermark(HeapWord* w) {
125   assert(bottom() <= w && w <= top(), "within bounds");
126   Atomic::release_store(&_update_watermark, w);
127 }
128 
129 // Fast version that avoids synchronization, only to be used at safepoints.
set_update_watermark_at_safepoint(HeapWord * w)130 inline void ShenandoahHeapRegion::set_update_watermark_at_safepoint(HeapWord* w) {
131   assert(bottom() <= w && w <= top(), "within bounds");
132   assert(SafepointSynchronize::is_at_safepoint(), "Should be at Shenandoah safepoint");
133   _update_watermark = w;
134 }
135 
136 #endif // SHARE_GC_SHENANDOAH_SHENANDOAHHEAPREGION_INLINE_HPP
137