author | stefank |
Mon, 25 Nov 2019 12:33:15 +0100 | |
changeset 59252 | 623722a6aeb9 |
parent 59250 | a6deb69743d4 |
child 59290 | 97d13893ec3c |
permissions | -rw-r--r-- |
1374 | 1 |
/* |
53404 | 2 |
* Copyright (c) 2001, 2019, Oracle and/or its affiliates. All rights reserved. |
1374 | 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 |
* |
|
5547
f4b087cbb361
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
5082
diff
changeset
|
19 |
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
f4b087cbb361
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
5082
diff
changeset
|
20 |
* or visit www.oracle.com if you need additional information or have any |
f4b087cbb361
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
5082
diff
changeset
|
21 |
* questions. |
1374 | 22 |
* |
23 |
*/ |
|
24 |
||
7397 | 25 |
#include "precompiled.hpp" |
51441
2e91d927e00c
8154343: Make SATB related code available to other GCs
kbarrett
parents:
51332
diff
changeset
|
26 |
#include "gc/shared/ptrQueue.hpp" |
53404 | 27 |
#include "logging/log.hpp" |
7397 | 28 |
#include "memory/allocation.hpp" |
29 |
#include "memory/allocation.inline.hpp" |
|
52582
6df094be7f58
8213352: Separate BufferNode allocation from PtrQueueSet
kbarrett
parents:
51441
diff
changeset
|
30 |
#include "runtime/atomic.hpp" |
7397 | 31 |
#include "runtime/mutex.hpp" |
32 |
#include "runtime/mutexLocker.hpp" |
|
53404 | 33 |
#include "runtime/orderAccess.hpp" |
14583
d70ee55535f4
8003935: Simplify the needed includes for using Thread::current()
stefank
parents:
13963
diff
changeset
|
34 |
#include "runtime/thread.inline.hpp" |
53404 | 35 |
#include "utilities/globalCounter.inline.hpp" |
1374 | 36 |
|
36354 | 37 |
#include <new> |
38 |
||
54255 | 39 |
PtrQueue::PtrQueue(PtrQueueSet* qset, bool active) : |
46443 | 40 |
_qset(qset), |
41 |
_active(active), |
|
42 |
_index(0), |
|
58059
baa4dd528de0
8221361: Eliminate two-phase initialization for PtrQueueSet classes
kbarrett
parents:
55498
diff
changeset
|
43 |
_capacity_in_bytes(index_to_byte_index(qset->buffer_size())), |
54255 | 44 |
_buf(NULL) |
1374 | 45 |
{} |
46 |
||
28507 | 47 |
PtrQueue::~PtrQueue() { |
54255 | 48 |
assert(_buf == NULL, "queue must be flushed before delete"); |
28507 | 49 |
} |
50 |
||
51 |
void PtrQueue::flush_impl() { |
|
46305
bff6d23aa1e3
8175221: Cleanup DirtyCardQueueSet::concatenate_log
kbarrett
parents:
37065
diff
changeset
|
52 |
if (_buf != NULL) { |
46443 | 53 |
BufferNode* node = BufferNode::make_node_from_buffer(_buf, index()); |
37065 | 54 |
if (is_empty()) { |
1374 | 55 |
// No work to do. |
37065 | 56 |
qset()->deallocate_buffer(node); |
1374 | 57 |
} else { |
53102
35530ca3e0b2
8214201: Make PtrQueueSet completed buffer list private
kbarrett
parents:
52726
diff
changeset
|
58 |
qset()->enqueue_completed_buffer(node); |
1374 | 59 |
} |
1560
1b328492b7f8
6770608: G1: Mutator thread can flush barrier and satb queues during safepoint
iveresov
parents:
1374
diff
changeset
|
60 |
_buf = NULL; |
46443 | 61 |
set_index(0); |
1374 | 62 |
} |
63 |
} |
|
64 |
||
65 |
void PtrQueue::enqueue_known_active(void* ptr) { |
|
66 |
while (_index == 0) { |
|
67 |
handle_zero_index(); |
|
68 |
} |
|
4481 | 69 |
|
46443 | 70 |
assert(_buf != NULL, "postcondition"); |
71 |
assert(index() > 0, "postcondition"); |
|
72 |
assert(index() <= capacity(), "invariant"); |
|
73 |
_index -= _element_size; |
|
74 |
_buf[index()] = ptr; |
|
1374 | 75 |
} |
76 |
||
54970
76d3d96a8bc2
8224167: Refactor PtrQueue completed buffer processing
kbarrett
parents:
54810
diff
changeset
|
77 |
void PtrQueue::handle_zero_index() { |
76d3d96a8bc2
8224167: Refactor PtrQueue completed buffer processing
kbarrett
parents:
54810
diff
changeset
|
78 |
assert(index() == 0, "precondition"); |
76d3d96a8bc2
8224167: Refactor PtrQueue completed buffer processing
kbarrett
parents:
54810
diff
changeset
|
79 |
|
76d3d96a8bc2
8224167: Refactor PtrQueue completed buffer processing
kbarrett
parents:
54810
diff
changeset
|
80 |
if (_buf != NULL) { |
76d3d96a8bc2
8224167: Refactor PtrQueue completed buffer processing
kbarrett
parents:
54810
diff
changeset
|
81 |
handle_completed_buffer(); |
76d3d96a8bc2
8224167: Refactor PtrQueue completed buffer processing
kbarrett
parents:
54810
diff
changeset
|
82 |
} else { |
76d3d96a8bc2
8224167: Refactor PtrQueue completed buffer processing
kbarrett
parents:
54810
diff
changeset
|
83 |
allocate_buffer(); |
76d3d96a8bc2
8224167: Refactor PtrQueue completed buffer processing
kbarrett
parents:
54810
diff
changeset
|
84 |
} |
76d3d96a8bc2
8224167: Refactor PtrQueue completed buffer processing
kbarrett
parents:
54810
diff
changeset
|
85 |
} |
76d3d96a8bc2
8224167: Refactor PtrQueue completed buffer processing
kbarrett
parents:
54810
diff
changeset
|
86 |
|
76d3d96a8bc2
8224167: Refactor PtrQueue completed buffer processing
kbarrett
parents:
54810
diff
changeset
|
87 |
void PtrQueue::allocate_buffer() { |
76d3d96a8bc2
8224167: Refactor PtrQueue completed buffer processing
kbarrett
parents:
54810
diff
changeset
|
88 |
_buf = qset()->allocate_buffer(); |
76d3d96a8bc2
8224167: Refactor PtrQueue completed buffer processing
kbarrett
parents:
54810
diff
changeset
|
89 |
reset(); |
76d3d96a8bc2
8224167: Refactor PtrQueue completed buffer processing
kbarrett
parents:
54810
diff
changeset
|
90 |
} |
76d3d96a8bc2
8224167: Refactor PtrQueue completed buffer processing
kbarrett
parents:
54810
diff
changeset
|
91 |
|
76d3d96a8bc2
8224167: Refactor PtrQueue completed buffer processing
kbarrett
parents:
54810
diff
changeset
|
92 |
void PtrQueue::enqueue_completed_buffer() { |
76d3d96a8bc2
8224167: Refactor PtrQueue completed buffer processing
kbarrett
parents:
54810
diff
changeset
|
93 |
assert(_buf != NULL, "precondition"); |
76d3d96a8bc2
8224167: Refactor PtrQueue completed buffer processing
kbarrett
parents:
54810
diff
changeset
|
94 |
BufferNode* node = BufferNode::make_node_from_buffer(_buf, index()); |
76d3d96a8bc2
8224167: Refactor PtrQueue completed buffer processing
kbarrett
parents:
54810
diff
changeset
|
95 |
qset()->enqueue_completed_buffer(node); |
76d3d96a8bc2
8224167: Refactor PtrQueue completed buffer processing
kbarrett
parents:
54810
diff
changeset
|
96 |
allocate_buffer(); |
76d3d96a8bc2
8224167: Refactor PtrQueue completed buffer processing
kbarrett
parents:
54810
diff
changeset
|
97 |
} |
76d3d96a8bc2
8224167: Refactor PtrQueue completed buffer processing
kbarrett
parents:
54810
diff
changeset
|
98 |
|
46443 | 99 |
BufferNode* BufferNode::allocate(size_t size) { |
100 |
size_t byte_size = size * sizeof(void*); |
|
36354 | 101 |
void* data = NEW_C_HEAP_ARRAY(char, buffer_offset() + byte_size, mtGC); |
102 |
return new (data) BufferNode; |
|
103 |
} |
|
104 |
||
105 |
void BufferNode::deallocate(BufferNode* node) { |
|
106 |
node->~BufferNode(); |
|
107 |
FREE_C_HEAP_ARRAY(char, node); |
|
108 |
} |
|
109 |
||
53404 | 110 |
BufferNode::Allocator::Allocator(const char* name, size_t buffer_size) : |
52582
6df094be7f58
8213352: Separate BufferNode allocation from PtrQueueSet
kbarrett
parents:
51441
diff
changeset
|
111 |
_buffer_size(buffer_size), |
53404 | 112 |
_pending_list(), |
113 |
_free_list(), |
|
114 |
_pending_count(0), |
|
115 |
_free_count(0), |
|
116 |
_transfer_lock(false) |
|
52582
6df094be7f58
8213352: Separate BufferNode allocation from PtrQueueSet
kbarrett
parents:
51441
diff
changeset
|
117 |
{ |
54810 | 118 |
strncpy(_name, name, sizeof(_name) - 1); |
53404 | 119 |
_name[sizeof(_name) - 1] = '\0'; |
52582
6df094be7f58
8213352: Separate BufferNode allocation from PtrQueueSet
kbarrett
parents:
51441
diff
changeset
|
120 |
} |
6df094be7f58
8213352: Separate BufferNode allocation from PtrQueueSet
kbarrett
parents:
51441
diff
changeset
|
121 |
|
6df094be7f58
8213352: Separate BufferNode allocation from PtrQueueSet
kbarrett
parents:
51441
diff
changeset
|
122 |
BufferNode::Allocator::~Allocator() { |
53404 | 123 |
delete_list(_free_list.pop_all()); |
124 |
delete_list(_pending_list.pop_all()); |
|
125 |
} |
|
126 |
||
127 |
void BufferNode::Allocator::delete_list(BufferNode* list) { |
|
128 |
while (list != NULL) { |
|
129 |
BufferNode* next = list->next(); |
|
130 |
DEBUG_ONLY(list->set_next(NULL);) |
|
131 |
BufferNode::deallocate(list); |
|
132 |
list = next; |
|
52582
6df094be7f58
8213352: Separate BufferNode allocation from PtrQueueSet
kbarrett
parents:
51441
diff
changeset
|
133 |
} |
6df094be7f58
8213352: Separate BufferNode allocation from PtrQueueSet
kbarrett
parents:
51441
diff
changeset
|
134 |
} |
6df094be7f58
8213352: Separate BufferNode allocation from PtrQueueSet
kbarrett
parents:
51441
diff
changeset
|
135 |
|
6df094be7f58
8213352: Separate BufferNode allocation from PtrQueueSet
kbarrett
parents:
51441
diff
changeset
|
136 |
size_t BufferNode::Allocator::free_count() const { |
6df094be7f58
8213352: Separate BufferNode allocation from PtrQueueSet
kbarrett
parents:
51441
diff
changeset
|
137 |
return Atomic::load(&_free_count); |
6df094be7f58
8213352: Separate BufferNode allocation from PtrQueueSet
kbarrett
parents:
51441
diff
changeset
|
138 |
} |
6df094be7f58
8213352: Separate BufferNode allocation from PtrQueueSet
kbarrett
parents:
51441
diff
changeset
|
139 |
|
6df094be7f58
8213352: Separate BufferNode allocation from PtrQueueSet
kbarrett
parents:
51441
diff
changeset
|
140 |
BufferNode* BufferNode::Allocator::allocate() { |
53404 | 141 |
BufferNode* node; |
52582
6df094be7f58
8213352: Separate BufferNode allocation from PtrQueueSet
kbarrett
parents:
51441
diff
changeset
|
142 |
{ |
53404 | 143 |
// Protect against ABA; see release(). |
144 |
GlobalCounter::CriticalSection cs(Thread::current()); |
|
145 |
node = _free_list.pop(); |
|
52582
6df094be7f58
8213352: Separate BufferNode allocation from PtrQueueSet
kbarrett
parents:
51441
diff
changeset
|
146 |
} |
53404 | 147 |
if (node == NULL) { |
148 |
node = BufferNode::allocate(_buffer_size); |
|
149 |
} else { |
|
150 |
// Decrement count after getting buffer from free list. This, along |
|
151 |
// with incrementing count before adding to free list, ensures count |
|
152 |
// never underflows. |
|
59250
a6deb69743d4
8234738: Harmonize parameter order in Atomic - sub
stefank
parents:
59249
diff
changeset
|
153 |
size_t count = Atomic::sub(&_free_count, 1u); |
53404 | 154 |
assert((count + 1) != 0, "_free_count underflow"); |
155 |
} |
|
156 |
return node; |
|
52582
6df094be7f58
8213352: Separate BufferNode allocation from PtrQueueSet
kbarrett
parents:
51441
diff
changeset
|
157 |
} |
6df094be7f58
8213352: Separate BufferNode allocation from PtrQueueSet
kbarrett
parents:
51441
diff
changeset
|
158 |
|
53404 | 159 |
// To solve the ABA problem for lock-free stack pop, allocate does the |
160 |
// pop inside a critical section, and release synchronizes on the |
|
161 |
// critical sections before adding to the _free_list. But we don't |
|
162 |
// want to make every release have to do a synchronize. Instead, we |
|
163 |
// initially place released nodes on the _pending_list, and transfer |
|
164 |
// them to the _free_list in batches. Only one transfer at a time is |
|
165 |
// permitted, with a lock bit to control access to that phase. A |
|
166 |
// transfer takes all the nodes from the _pending_list, synchronizes on |
|
167 |
// the _free_list pops, and then adds the former pending nodes to the |
|
168 |
// _free_list. While that's happening, other threads might be adding |
|
169 |
// other nodes to the _pending_list, to be dealt with by some later |
|
170 |
// transfer. |
|
52582
6df094be7f58
8213352: Separate BufferNode allocation from PtrQueueSet
kbarrett
parents:
51441
diff
changeset
|
171 |
void BufferNode::Allocator::release(BufferNode* node) { |
53404 | 172 |
assert(node != NULL, "precondition"); |
173 |
assert(node->next() == NULL, "precondition"); |
|
174 |
||
175 |
// Desired minimum transfer batch size. There is relatively little |
|
176 |
// importance to the specific number. It shouldn't be too big, else |
|
177 |
// we're wasting space when the release rate is low. If the release |
|
178 |
// rate is high, we might accumulate more than this before being |
|
179 |
// able to start a new transfer, but that's okay. Also note that |
|
180 |
// the allocation rate and the release rate are going to be fairly |
|
181 |
// similar, due to how the buffers are used. |
|
182 |
const size_t trigger_transfer = 10; |
|
183 |
||
184 |
// Add to pending list. Update count first so no underflow in transfer. |
|
59249
29b0d0b61615
8234737: Harmonize parameter order in Atomic - add
stefank
parents:
59247
diff
changeset
|
185 |
size_t pending_count = Atomic::add(&_pending_count, 1u); |
53404 | 186 |
_pending_list.push(*node); |
187 |
if (pending_count > trigger_transfer) { |
|
188 |
try_transfer_pending(); |
|
189 |
} |
|
52582
6df094be7f58
8213352: Separate BufferNode allocation from PtrQueueSet
kbarrett
parents:
51441
diff
changeset
|
190 |
} |
6df094be7f58
8213352: Separate BufferNode allocation from PtrQueueSet
kbarrett
parents:
51441
diff
changeset
|
191 |
|
53404 | 192 |
// Try to transfer nodes from _pending_list to _free_list, with a |
193 |
// synchronization delay for any in-progress pops from the _free_list, |
|
194 |
// to solve ABA there. Return true if performed a (possibly empty) |
|
195 |
// transfer, false if blocked from doing so by some other thread's |
|
196 |
// in-progress transfer. |
|
197 |
bool BufferNode::Allocator::try_transfer_pending() { |
|
198 |
// Attempt to claim the lock. |
|
199 |
if (Atomic::load(&_transfer_lock) || // Skip CAS if likely to fail. |
|
59252
623722a6aeb9
8234740: Harmonize parameter order in Atomic - cmpxchg
stefank
parents:
59250
diff
changeset
|
200 |
Atomic::cmpxchg(&_transfer_lock, false, true)) { |
53404 | 201 |
return false; |
202 |
} |
|
203 |
// Have the lock; perform the transfer. |
|
204 |
||
205 |
// Claim all the pending nodes. |
|
206 |
BufferNode* first = _pending_list.pop_all(); |
|
207 |
if (first != NULL) { |
|
208 |
// Prepare to add the claimed nodes, and update _pending_count. |
|
209 |
BufferNode* last = first; |
|
210 |
size_t count = 1; |
|
211 |
for (BufferNode* next = first->next(); next != NULL; next = next->next()) { |
|
212 |
last = next; |
|
213 |
++count; |
|
52582
6df094be7f58
8213352: Separate BufferNode allocation from PtrQueueSet
kbarrett
parents:
51441
diff
changeset
|
214 |
} |
59250
a6deb69743d4
8234738: Harmonize parameter order in Atomic - sub
stefank
parents:
59249
diff
changeset
|
215 |
Atomic::sub(&_pending_count, count); |
53404 | 216 |
|
217 |
// Wait for any in-progress pops, to avoid ABA for them. |
|
218 |
GlobalCounter::write_synchronize(); |
|
219 |
||
220 |
// Add synchronized nodes to _free_list. |
|
221 |
// Update count first so no underflow in allocate(). |
|
59249
29b0d0b61615
8234737: Harmonize parameter order in Atomic - add
stefank
parents:
59247
diff
changeset
|
222 |
Atomic::add(&_free_count, count); |
53404 | 223 |
_free_list.prepend(*first, *last); |
224 |
log_trace(gc, ptrqueue, freelist) |
|
225 |
("Transferred %s pending to free: " SIZE_FORMAT, name(), count); |
|
52582
6df094be7f58
8213352: Separate BufferNode allocation from PtrQueueSet
kbarrett
parents:
51441
diff
changeset
|
226 |
} |
59247
56bf71d64d51
8234562: Move OrderAccess::release_store*/load_acquire to Atomic
stefank
parents:
58059
diff
changeset
|
227 |
Atomic::release_store(&_transfer_lock, false); |
53404 | 228 |
return true; |
229 |
} |
|
230 |
||
231 |
size_t BufferNode::Allocator::reduce_free_list(size_t remove_goal) { |
|
232 |
try_transfer_pending(); |
|
233 |
size_t removed = 0; |
|
234 |
for ( ; removed < remove_goal; ++removed) { |
|
235 |
BufferNode* node = _free_list.pop(); |
|
236 |
if (node == NULL) break; |
|
237 |
BufferNode::deallocate(node); |
|
52582
6df094be7f58
8213352: Separate BufferNode allocation from PtrQueueSet
kbarrett
parents:
51441
diff
changeset
|
238 |
} |
59250
a6deb69743d4
8234738: Harmonize parameter order in Atomic - sub
stefank
parents:
59249
diff
changeset
|
239 |
size_t new_count = Atomic::sub(&_free_count, removed); |
53404 | 240 |
log_debug(gc, ptrqueue, freelist) |
241 |
("Reduced %s free list by " SIZE_FORMAT " to " SIZE_FORMAT, |
|
242 |
name(), removed, new_count); |
|
243 |
return removed; |
|
52582
6df094be7f58
8213352: Separate BufferNode allocation from PtrQueueSet
kbarrett
parents:
51441
diff
changeset
|
244 |
} |
6df094be7f58
8213352: Separate BufferNode allocation from PtrQueueSet
kbarrett
parents:
51441
diff
changeset
|
245 |
|
58059
baa4dd528de0
8221361: Eliminate two-phase initialization for PtrQueueSet classes
kbarrett
parents:
55498
diff
changeset
|
246 |
PtrQueueSet::PtrQueueSet(BufferNode::Allocator* allocator) : |
baa4dd528de0
8221361: Eliminate two-phase initialization for PtrQueueSet classes
kbarrett
parents:
55498
diff
changeset
|
247 |
_allocator(allocator), |
53102
35530ca3e0b2
8214201: Make PtrQueueSet completed buffer list private
kbarrett
parents:
52726
diff
changeset
|
248 |
_all_active(false) |
52582
6df094be7f58
8213352: Separate BufferNode allocation from PtrQueueSet
kbarrett
parents:
51441
diff
changeset
|
249 |
{} |
1374 | 250 |
|
55498 | 251 |
PtrQueueSet::~PtrQueueSet() {} |
33761
329db4b51480
6899049: G1: Clean up code in ptrQueue.[ch]pp and ptrQueue.inline.hpp
kbarrett
parents:
30764
diff
changeset
|
252 |
|
1374 | 253 |
void** PtrQueueSet::allocate_buffer() { |
52582
6df094be7f58
8213352: Separate BufferNode allocation from PtrQueueSet
kbarrett
parents:
51441
diff
changeset
|
254 |
BufferNode* node = _allocator->allocate(); |
36354 | 255 |
return BufferNode::make_buffer_from_node(node); |
1374 | 256 |
} |
257 |
||
37065 | 258 |
void PtrQueueSet::deallocate_buffer(BufferNode* node) { |
52582
6df094be7f58
8213352: Separate BufferNode allocation from PtrQueueSet
kbarrett
parents:
51441
diff
changeset
|
259 |
_allocator->release(node); |
1374 | 260 |
} |