1/*
2 * Copyright (c) 2001, 2019, 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#include "precompiled.hpp"
26#include "gc/g1/g1BarrierSet.inline.hpp"
27#include "gc/g1/g1BarrierSetAssembler.hpp"
28#include "gc/g1/g1CardTable.inline.hpp"
29#include "gc/g1/g1CollectedHeap.inline.hpp"
30#include "gc/g1/g1SATBMarkQueueSet.hpp"
31#include "gc/g1/g1ThreadLocalData.hpp"
32#include "gc/g1/heapRegion.hpp"
33#include "gc/shared/satbMarkQueue.hpp"
34#include "logging/log.hpp"
35#include "oops/access.inline.hpp"
36#include "oops/compressedOops.inline.hpp"
37#include "oops/oop.inline.hpp"
38#include "runtime/interfaceSupport.inline.hpp"
39#include "runtime/mutexLocker.hpp"
40#include "runtime/thread.inline.hpp"
41#include "utilities/macros.hpp"
42#ifdef COMPILER1
43#include "gc/g1/c1/g1BarrierSetC1.hpp"
44#endif
45#ifdef COMPILER2
46#include "gc/g1/c2/g1BarrierSetC2.hpp"
47#endif
48
49class G1BarrierSetC1;
50class G1BarrierSetC2;
51
52G1BarrierSet::G1BarrierSet(G1CardTable* card_table) :
53 CardTableBarrierSet(make_barrier_set_assembler<G1BarrierSetAssembler>(),
54 make_barrier_set_c1<G1BarrierSetC1>(),
55 make_barrier_set_c2<G1BarrierSetC2>(),
56 card_table,
57 BarrierSet::FakeRtti(BarrierSet::G1BarrierSet)),
58 _satb_mark_queue_buffer_allocator("SATB Buffer Allocator", G1SATBBufferSize),
59 _dirty_card_queue_buffer_allocator("DC Buffer Allocator", G1UpdateBufferSize),
60 _satb_mark_queue_set(),
61 _dirty_card_queue_set(),
62 _shared_dirty_card_queue(&_dirty_card_queue_set)
63{}
64
65void G1BarrierSet::enqueue(oop pre_val) {
66 // Nulls should have been already filtered.
67 assert(oopDesc::is_oop(pre_val, true), "Error");
68 G1ThreadLocalData::satb_mark_queue(Thread::current()).enqueue(pre_val);
69}
70
71template <class T> void
72G1BarrierSet::write_ref_array_pre_work(T* dst, size_t count) {
73 if (!_satb_mark_queue_set.is_active()) return;
74 T* elem_ptr = dst;
75 for (size_t i = 0; i < count; i++, elem_ptr++) {
76 T heap_oop = RawAccess<>::oop_load(elem_ptr);
77 if (!CompressedOops::is_null(heap_oop)) {
78 enqueue(CompressedOops::decode_not_null(heap_oop));
79 }
80 }
81}
82
83void G1BarrierSet::write_ref_array_pre(oop* dst, size_t count, bool dest_uninitialized) {
84 if (!dest_uninitialized) {
85 write_ref_array_pre_work(dst, count);
86 }
87}
88
89void G1BarrierSet::write_ref_array_pre(narrowOop* dst, size_t count, bool dest_uninitialized) {
90 if (!dest_uninitialized) {
91 write_ref_array_pre_work(dst, count);
92 }
93}
94
95void G1BarrierSet::write_ref_field_post_slow(volatile CardValue* byte) {
96 // In the slow path, we know a card is not young
97 assert(*byte != G1CardTable::g1_young_card_val(), "slow path invoked without filtering");
98 OrderAccess::storeload();
99 if (*byte != G1CardTable::dirty_card_val()) {
100 *byte = G1CardTable::dirty_card_val();
101 Thread* thr = Thread::current();
102 G1ThreadLocalData::dirty_card_queue(thr).enqueue(byte);
103 }
104}
105
106void G1BarrierSet::invalidate(MemRegion mr) {
107 if (mr.is_empty()) {
108 return;
109 }
110 volatile CardValue* byte = _card_table->byte_for(mr.start());
111 CardValue* last_byte = _card_table->byte_for(mr.last());
112 // skip initial young cards
113 for (; byte <= last_byte && *byte == G1CardTable::g1_young_card_val(); byte++);
114
115 if (byte <= last_byte) {
116 OrderAccess::storeload();
117 // Enqueue if necessary.
118 Thread* thr = Thread::current();
119 G1DirtyCardQueue& queue = G1ThreadLocalData::dirty_card_queue(thr);
120 for (; byte <= last_byte; byte++) {
121 CardValue bv = *byte;
122 if ((bv != G1CardTable::g1_young_card_val()) &&
123 (bv != G1CardTable::dirty_card_val())) {
124 *byte = G1CardTable::dirty_card_val();
125 queue.enqueue(byte);
126 }
127 }
128 }
129}
130
131void G1BarrierSet::on_thread_create(Thread* thread) {
132 // Create thread local data
133 G1ThreadLocalData::create(thread);
134}
135
136void G1BarrierSet::on_thread_destroy(Thread* thread) {
137 // Destroy thread local data
138 G1ThreadLocalData::destroy(thread);
139}
140
141void G1BarrierSet::on_thread_attach(Thread* thread) {
142 assert(!G1ThreadLocalData::satb_mark_queue(thread).is_active(), "SATB queue should not be active");
143 assert(G1ThreadLocalData::satb_mark_queue(thread).is_empty(), "SATB queue should be empty");
144 assert(G1ThreadLocalData::dirty_card_queue(thread).is_active(), "Dirty card queue should be active");
145 // Can't assert that the DCQ is empty. There is early execution on
146 // the main thread, before it gets added to the threads list, which
147 // is where this is called. That execution may enqueue dirty cards.
148
149 // If we are creating the thread during a marking cycle, we should
150 // set the active field of the SATB queue to true. That involves
151 // copying the global is_active value to this thread's queue.
152 bool is_satb_active = _satb_mark_queue_set.is_active();
153 G1ThreadLocalData::satb_mark_queue(thread).set_active(is_satb_active);
154}
155
156void G1BarrierSet::on_thread_detach(Thread* thread) {
157 // Flush any deferred card marks.
158 CardTableBarrierSet::on_thread_detach(thread);
159 G1ThreadLocalData::satb_mark_queue(thread).flush();
160 G1ThreadLocalData::dirty_card_queue(thread).flush();
161}
162
163BufferNode::Allocator& G1BarrierSet::satb_mark_queue_buffer_allocator() {
164 return _satb_mark_queue_buffer_allocator;
165}
166
167BufferNode::Allocator& G1BarrierSet::dirty_card_queue_buffer_allocator() {
168 return _dirty_card_queue_buffer_allocator;
169}
170