1374
|
1 |
/*
|
|
2 |
* Copyright 2001-2007 Sun Microsystems, 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 Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
|
|
20 |
* CA 95054 USA or visit www.sun.com if you need additional information or
|
|
21 |
* have any questions.
|
|
22 |
*
|
|
23 |
*/
|
|
24 |
|
|
25 |
# include "incls/_precompiled.incl"
|
|
26 |
# include "incls/_dirtyCardQueue.cpp.incl"
|
|
27 |
|
|
28 |
bool DirtyCardQueue::apply_closure(CardTableEntryClosure* cl,
|
|
29 |
bool consume,
|
|
30 |
size_t worker_i) {
|
|
31 |
bool res = true;
|
|
32 |
if (_buf != NULL) {
|
|
33 |
res = apply_closure_to_buffer(cl, _buf, _index, _sz,
|
|
34 |
consume,
|
|
35 |
(int) worker_i);
|
|
36 |
if (res && consume) _index = _sz;
|
|
37 |
}
|
|
38 |
return res;
|
|
39 |
}
|
|
40 |
|
|
41 |
bool DirtyCardQueue::apply_closure_to_buffer(CardTableEntryClosure* cl,
|
|
42 |
void** buf,
|
|
43 |
size_t index, size_t sz,
|
|
44 |
bool consume,
|
|
45 |
int worker_i) {
|
|
46 |
if (cl == NULL) return true;
|
|
47 |
for (size_t i = index; i < sz; i += oopSize) {
|
|
48 |
int ind = byte_index_to_index((int)i);
|
|
49 |
jbyte* card_ptr = (jbyte*)buf[ind];
|
|
50 |
if (card_ptr != NULL) {
|
|
51 |
// Set the entry to null, so we don't do it again (via the test
|
|
52 |
// above) if we reconsider this buffer.
|
|
53 |
if (consume) buf[ind] = NULL;
|
|
54 |
if (!cl->do_card_ptr(card_ptr, worker_i)) return false;
|
|
55 |
}
|
|
56 |
}
|
|
57 |
return true;
|
|
58 |
}
|
|
59 |
|
|
60 |
#ifdef _MSC_VER // the use of 'this' below gets a warning, make it go away
|
|
61 |
#pragma warning( disable:4355 ) // 'this' : used in base member initializer list
|
|
62 |
#endif // _MSC_VER
|
|
63 |
|
|
64 |
DirtyCardQueueSet::DirtyCardQueueSet() :
|
|
65 |
PtrQueueSet(true /*notify_when_complete*/),
|
|
66 |
_closure(NULL),
|
|
67 |
_shared_dirty_card_queue(this, true /*perm*/),
|
|
68 |
_free_ids(NULL),
|
|
69 |
_processed_buffers_mut(0), _processed_buffers_rs_thread(0)
|
|
70 |
{
|
|
71 |
_all_active = true;
|
|
72 |
}
|
|
73 |
|
|
74 |
size_t DirtyCardQueueSet::num_par_ids() {
|
|
75 |
return MAX2(ParallelGCThreads, (size_t)2);
|
|
76 |
}
|
|
77 |
|
|
78 |
|
|
79 |
void DirtyCardQueueSet::initialize(Monitor* cbl_mon, Mutex* fl_lock,
|
|
80 |
int max_completed_queue,
|
|
81 |
Mutex* lock) {
|
|
82 |
PtrQueueSet::initialize(cbl_mon, fl_lock, max_completed_queue);
|
|
83 |
set_buffer_size(DCQBarrierQueueBufferSize);
|
|
84 |
set_process_completed_threshold(DCQBarrierProcessCompletedThreshold);
|
|
85 |
|
|
86 |
_shared_dirty_card_queue.set_lock(lock);
|
|
87 |
_free_ids = new FreeIdSet((int) num_par_ids(), _cbl_mon);
|
|
88 |
bool b = _free_ids->claim_perm_id(0);
|
|
89 |
guarantee(b, "Must reserve id zero for concurrent refinement thread.");
|
|
90 |
}
|
|
91 |
|
|
92 |
void DirtyCardQueueSet::handle_zero_index_for_thread(JavaThread* t) {
|
|
93 |
t->dirty_card_queue().handle_zero_index();
|
|
94 |
}
|
|
95 |
|
|
96 |
void DirtyCardQueueSet::set_closure(CardTableEntryClosure* closure) {
|
|
97 |
_closure = closure;
|
|
98 |
}
|
|
99 |
|
|
100 |
void DirtyCardQueueSet::iterate_closure_all_threads(bool consume,
|
|
101 |
size_t worker_i) {
|
|
102 |
assert(SafepointSynchronize::is_at_safepoint(), "Must be at safepoint.");
|
|
103 |
for(JavaThread* t = Threads::first(); t; t = t->next()) {
|
|
104 |
bool b = t->dirty_card_queue().apply_closure(_closure, consume);
|
|
105 |
guarantee(b, "Should not be interrupted.");
|
|
106 |
}
|
|
107 |
bool b = shared_dirty_card_queue()->apply_closure(_closure,
|
|
108 |
consume,
|
|
109 |
worker_i);
|
|
110 |
guarantee(b, "Should not be interrupted.");
|
|
111 |
}
|
|
112 |
|
|
113 |
bool DirtyCardQueueSet::mut_process_buffer(void** buf) {
|
|
114 |
|
|
115 |
// Used to determine if we had already claimed a par_id
|
|
116 |
// before entering this method.
|
|
117 |
bool already_claimed = false;
|
|
118 |
|
|
119 |
// We grab the current JavaThread.
|
|
120 |
JavaThread* thread = JavaThread::current();
|
|
121 |
|
|
122 |
// We get the the number of any par_id that this thread
|
|
123 |
// might have already claimed.
|
|
124 |
int worker_i = thread->get_claimed_par_id();
|
|
125 |
|
|
126 |
// If worker_i is not -1 then the thread has already claimed
|
|
127 |
// a par_id. We make note of it using the already_claimed value
|
|
128 |
if (worker_i != -1) {
|
|
129 |
already_claimed = true;
|
|
130 |
} else {
|
|
131 |
|
|
132 |
// Otherwise we need to claim a par id
|
|
133 |
worker_i = _free_ids->claim_par_id();
|
|
134 |
|
|
135 |
// And store the par_id value in the thread
|
|
136 |
thread->set_claimed_par_id(worker_i);
|
|
137 |
}
|
|
138 |
|
|
139 |
bool b = false;
|
|
140 |
if (worker_i != -1) {
|
|
141 |
b = DirtyCardQueue::apply_closure_to_buffer(_closure, buf, 0,
|
|
142 |
_sz, true, worker_i);
|
|
143 |
if (b) Atomic::inc(&_processed_buffers_mut);
|
|
144 |
|
|
145 |
// If we had not claimed an id before entering the method
|
|
146 |
// then we must release the id.
|
|
147 |
if (!already_claimed) {
|
|
148 |
|
|
149 |
// we release the id
|
|
150 |
_free_ids->release_par_id(worker_i);
|
|
151 |
|
|
152 |
// and set the claimed_id in the thread to -1
|
|
153 |
thread->set_claimed_par_id(-1);
|
|
154 |
}
|
|
155 |
}
|
|
156 |
return b;
|
|
157 |
}
|
|
158 |
|
|
159 |
DirtyCardQueueSet::CompletedBufferNode*
|
|
160 |
DirtyCardQueueSet::get_completed_buffer_lock(int stop_at) {
|
|
161 |
CompletedBufferNode* nd = NULL;
|
|
162 |
MutexLockerEx x(_cbl_mon, Mutex::_no_safepoint_check_flag);
|
|
163 |
|
|
164 |
if ((int)_n_completed_buffers <= stop_at) {
|
|
165 |
_process_completed = false;
|
|
166 |
return NULL;
|
|
167 |
}
|
|
168 |
|
|
169 |
if (_completed_buffers_head != NULL) {
|
|
170 |
nd = _completed_buffers_head;
|
|
171 |
_completed_buffers_head = nd->next;
|
|
172 |
if (_completed_buffers_head == NULL)
|
|
173 |
_completed_buffers_tail = NULL;
|
|
174 |
_n_completed_buffers--;
|
|
175 |
}
|
|
176 |
debug_only(assert_completed_buffer_list_len_correct_locked());
|
|
177 |
return nd;
|
|
178 |
}
|
|
179 |
|
|
180 |
// We only do this in contexts where there is no concurrent enqueueing.
|
|
181 |
DirtyCardQueueSet::CompletedBufferNode*
|
|
182 |
DirtyCardQueueSet::get_completed_buffer_CAS() {
|
|
183 |
CompletedBufferNode* nd = _completed_buffers_head;
|
|
184 |
|
|
185 |
while (nd != NULL) {
|
|
186 |
CompletedBufferNode* next = nd->next;
|
|
187 |
CompletedBufferNode* result =
|
|
188 |
(CompletedBufferNode*)Atomic::cmpxchg_ptr(next,
|
|
189 |
&_completed_buffers_head,
|
|
190 |
nd);
|
|
191 |
if (result == nd) {
|
|
192 |
return result;
|
|
193 |
} else {
|
|
194 |
nd = _completed_buffers_head;
|
|
195 |
}
|
|
196 |
}
|
|
197 |
assert(_completed_buffers_head == NULL, "Loop post");
|
|
198 |
_completed_buffers_tail = NULL;
|
|
199 |
return NULL;
|
|
200 |
}
|
|
201 |
|
|
202 |
bool DirtyCardQueueSet::
|
|
203 |
apply_closure_to_completed_buffer_helper(int worker_i,
|
|
204 |
CompletedBufferNode* nd) {
|
|
205 |
if (nd != NULL) {
|
|
206 |
bool b =
|
|
207 |
DirtyCardQueue::apply_closure_to_buffer(_closure, nd->buf,
|
|
208 |
nd->index, _sz,
|
|
209 |
true, worker_i);
|
|
210 |
void** buf = nd->buf;
|
|
211 |
delete nd;
|
|
212 |
if (b) {
|
|
213 |
deallocate_buffer(buf);
|
|
214 |
return true; // In normal case, go on to next buffer.
|
|
215 |
} else {
|
|
216 |
enqueue_complete_buffer(buf, nd->index, true);
|
|
217 |
return false;
|
|
218 |
}
|
|
219 |
} else {
|
|
220 |
return false;
|
|
221 |
}
|
|
222 |
}
|
|
223 |
|
|
224 |
bool DirtyCardQueueSet::apply_closure_to_completed_buffer(int worker_i,
|
|
225 |
int stop_at,
|
|
226 |
bool with_CAS)
|
|
227 |
{
|
|
228 |
CompletedBufferNode* nd = NULL;
|
|
229 |
if (with_CAS) {
|
|
230 |
guarantee(stop_at == 0, "Precondition");
|
|
231 |
nd = get_completed_buffer_CAS();
|
|
232 |
} else {
|
|
233 |
nd = get_completed_buffer_lock(stop_at);
|
|
234 |
}
|
|
235 |
bool res = apply_closure_to_completed_buffer_helper(worker_i, nd);
|
|
236 |
if (res) _processed_buffers_rs_thread++;
|
|
237 |
return res;
|
|
238 |
}
|
|
239 |
|
|
240 |
void DirtyCardQueueSet::apply_closure_to_all_completed_buffers() {
|
|
241 |
CompletedBufferNode* nd = _completed_buffers_head;
|
|
242 |
while (nd != NULL) {
|
|
243 |
bool b =
|
|
244 |
DirtyCardQueue::apply_closure_to_buffer(_closure, nd->buf, 0, _sz,
|
|
245 |
false);
|
|
246 |
guarantee(b, "Should not stop early.");
|
|
247 |
nd = nd->next;
|
|
248 |
}
|
|
249 |
}
|
|
250 |
|
|
251 |
void DirtyCardQueueSet::abandon_logs() {
|
|
252 |
assert(SafepointSynchronize::is_at_safepoint(), "Must be at safepoint.");
|
|
253 |
CompletedBufferNode* buffers_to_delete = NULL;
|
|
254 |
{
|
|
255 |
MutexLockerEx x(_cbl_mon, Mutex::_no_safepoint_check_flag);
|
|
256 |
while (_completed_buffers_head != NULL) {
|
|
257 |
CompletedBufferNode* nd = _completed_buffers_head;
|
|
258 |
_completed_buffers_head = nd->next;
|
|
259 |
nd->next = buffers_to_delete;
|
|
260 |
buffers_to_delete = nd;
|
|
261 |
}
|
|
262 |
_n_completed_buffers = 0;
|
|
263 |
_completed_buffers_tail = NULL;
|
|
264 |
debug_only(assert_completed_buffer_list_len_correct_locked());
|
|
265 |
}
|
|
266 |
while (buffers_to_delete != NULL) {
|
|
267 |
CompletedBufferNode* nd = buffers_to_delete;
|
|
268 |
buffers_to_delete = nd->next;
|
|
269 |
deallocate_buffer(nd->buf);
|
|
270 |
delete nd;
|
|
271 |
}
|
|
272 |
// Since abandon is done only at safepoints, we can safely manipulate
|
|
273 |
// these queues.
|
|
274 |
for (JavaThread* t = Threads::first(); t; t = t->next()) {
|
|
275 |
t->dirty_card_queue().reset();
|
|
276 |
}
|
|
277 |
shared_dirty_card_queue()->reset();
|
|
278 |
}
|
|
279 |
|
|
280 |
|
|
281 |
void DirtyCardQueueSet::concatenate_logs() {
|
|
282 |
// Iterate over all the threads, if we find a partial log add it to
|
|
283 |
// the global list of logs. Temporarily turn off the limit on the number
|
|
284 |
// of outstanding buffers.
|
|
285 |
int save_max_completed_queue = _max_completed_queue;
|
|
286 |
_max_completed_queue = max_jint;
|
|
287 |
assert(SafepointSynchronize::is_at_safepoint(), "Must be at safepoint.");
|
|
288 |
for (JavaThread* t = Threads::first(); t; t = t->next()) {
|
|
289 |
DirtyCardQueue& dcq = t->dirty_card_queue();
|
|
290 |
if (dcq.size() != 0) {
|
|
291 |
void **buf = t->dirty_card_queue().get_buf();
|
|
292 |
// We must NULL out the unused entries, then enqueue.
|
|
293 |
for (size_t i = 0; i < t->dirty_card_queue().get_index(); i += oopSize) {
|
|
294 |
buf[PtrQueue::byte_index_to_index((int)i)] = NULL;
|
|
295 |
}
|
|
296 |
enqueue_complete_buffer(dcq.get_buf(), dcq.get_index());
|
|
297 |
dcq.reinitialize();
|
|
298 |
}
|
|
299 |
}
|
|
300 |
if (_shared_dirty_card_queue.size() != 0) {
|
|
301 |
enqueue_complete_buffer(_shared_dirty_card_queue.get_buf(),
|
|
302 |
_shared_dirty_card_queue.get_index());
|
|
303 |
_shared_dirty_card_queue.reinitialize();
|
|
304 |
}
|
|
305 |
// Restore the completed buffer queue limit.
|
|
306 |
_max_completed_queue = save_max_completed_queue;
|
|
307 |
}
|