1 /*
2 * Copyright (c) 2001, 2023, Oracle and/or its affiliates. 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_G1_G1BARRIERSET_HPP
26 #define SHARE_GC_G1_G1BARRIERSET_HPP
27
28 #include "gc/g1/g1DirtyCardQueue.hpp"
29 #include "gc/g1/g1HeapRegion.hpp"
30 #include "gc/g1/g1SATBMarkQueueSet.hpp"
31 #include "gc/shared/cardTable.hpp"
32 #include "gc/shared/cardTableBarrierSet.hpp"
33 #include "gc/shared/bufferNode.hpp"
34
35 class G1CardTable;
36
37 // This barrier is specialized to use a logging barrier to support
38 // snapshot-at-the-beginning marking.
39
40 class G1BarrierSet: public CardTableBarrierSet {
41 friend class VMStructs;
42 private:
43 BufferNode::Allocator _satb_mark_queue_buffer_allocator;
44 BufferNode::Allocator _dirty_card_queue_buffer_allocator;
45 G1SATBMarkQueueSet _satb_mark_queue_set;
46 G1DirtyCardQueueSet _dirty_card_queue_set;
47
48 static G1BarrierSet* g1_barrier_set() {
49 return barrier_set_cast<G1BarrierSet>(BarrierSet::barrier_set());
50 }
51
52 public:
53 G1BarrierSet(G1CardTable* table);
54 ~G1BarrierSet() { }
55
56 virtual bool card_mark_must_follow_store() const {
57 return true;
58 }
59
60 // Add "pre_val" to a set of objects that may have been disconnected from the
61 // pre-marking object graph. Prefer the version that takes location, as it
62 // can avoid touching the heap unnecessarily.
63 template <class T> static void enqueue(T* dst);
64 static void enqueue_preloaded(oop pre_val);
65
66 static void enqueue_preloaded_if_weak(DecoratorSet decorators, oop value);
67
68 template <class T> void write_ref_array_pre_work(T* dst, size_t count);
69 virtual void write_ref_array_pre(oop* dst, size_t count, bool dest_uninitialized);
70 virtual void write_ref_array_pre(narrowOop* dst, size_t count, bool dest_uninitialized);
71
72 template <DecoratorSet decorators, typename T>
73 void write_ref_field_pre(T* field);
74
75 inline void write_region(MemRegion mr);
76 void write_region(JavaThread* thread, MemRegion mr);
77
78 template <DecoratorSet decorators, typename T>
79 void write_ref_field_post(T* field);
80 void write_ref_field_post_slow(volatile CardValue* byte);
81
82 virtual void on_thread_create(Thread* thread);
83 virtual void on_thread_destroy(Thread* thread);
84 virtual void on_thread_attach(Thread* thread);
85 virtual void on_thread_detach(Thread* thread);
86
87 static G1SATBMarkQueueSet& satb_mark_queue_set() {
88 return g1_barrier_set()->_satb_mark_queue_set;
89 }
90
91 static G1DirtyCardQueueSet& dirty_card_queue_set() {
92 return g1_barrier_set()->_dirty_card_queue_set;
93 }
94
95 virtual uint grain_shift() { return G1HeapRegion::LogOfHRGrainBytes; }
96
97 // Callbacks for runtime accesses.
98 template <DecoratorSet decorators, typename BarrierSetT = G1BarrierSet>
99 class AccessBarrier: public ModRefBarrierSet::AccessBarrier<decorators, BarrierSetT> {
100 typedef ModRefBarrierSet::AccessBarrier<decorators, BarrierSetT> ModRef;
101 typedef BarrierSet::AccessBarrier<decorators, BarrierSetT> Raw;
102
103 public:
104 // Needed for loads on non-heap weak references
105 template <typename T>
106 static oop oop_load_not_in_heap(T* addr);
107
108 // Needed for non-heap stores
109 template <typename T>
110 static void oop_store_not_in_heap(T* addr, oop new_value);
111
112 // Needed for weak references
113 static oop oop_load_in_heap_at(oop base, ptrdiff_t offset);
114
115 // Defensive: will catch weak oops at addresses in heap
116 template <typename T>
117 static oop oop_load_in_heap(T* addr);
118 };
119 };
120
121 template<>
122 struct BarrierSet::GetName<G1BarrierSet> {
123 static const BarrierSet::Name value = BarrierSet::G1BarrierSet;
124 };
125
126 template<>
127 struct BarrierSet::GetType<BarrierSet::G1BarrierSet> {
128 typedef ::G1BarrierSet type;
129 };
130
131 #endif // SHARE_GC_G1_G1BARRIERSET_HPP