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/ptrQueue.hpp"
27 #include "memory/allocation.hpp"
28 #include "memory/allocation.inline.hpp"
29 #include "runtime/mutex.hpp"
30 #include "runtime/mutexLocker.hpp"
31 #include "runtime/thread.inline.hpp"
32
33 PtrQueue::PtrQueue(PtrQueueSet* qset, bool perm, bool active) :
34 _qset(qset), _buf(NULL), _index(0), _sz(0), _active(active),
35 _perm(perm), _lock(NULL)
36 {}
37
38 PtrQueue::~PtrQueue() {
39 assert(_perm || (_buf == NULL), "queue must be flushed before delete");
40 }
41
42 void PtrQueue::flush_impl() {
43 if (!_perm && _buf != NULL) {
44 if (_index == _sz) {
45 // No work to do.
46 qset()->deallocate_buffer(_buf);
47 } else {
48 // We must NULL out the unused entries, then enqueue.
49 for (size_t i = 0; i < _index; i += oopSize) {
50 _buf[byte_index_to_index((int)i)] = NULL;
51 }
52 qset()->enqueue_complete_buffer(_buf);
53 }
54 _buf = NULL;
55 _index = 0;
56 }
57 }
58
59
60 void PtrQueue::enqueue_known_active(void* ptr) {
61 assert(_index <= _sz, "Invariant.");
62 assert(_index == 0 || _buf != NULL, "invariant");
63
64 while (_index == 0) {
65 handle_zero_index();
66 }
67
68 assert(_index > 0, "postcondition");
69 _index -= oopSize;
70 _buf[byte_index_to_index((int)_index)] = ptr;
71 assert(_index <= _sz, "Invariant.");
72 }
73
74 void PtrQueue::locking_enqueue_completed_buffer(void** buf) {
75 assert(_lock->owned_by_self(), "Required.");
76
77 // We have to unlock _lock (which may be Shared_DirtyCardQ_lock) before
78 // we acquire DirtyCardQ_CBL_mon inside enqueue_complete_buffer as they
79 // have the same rank and we may get the "possible deadlock" message
80 _lock->unlock();
81
82 qset()->enqueue_complete_buffer(buf);
83 // We must relock only because the caller will unlock, for the normal
84 // case.
85 _lock->lock_without_safepoint_check();
86 }
87
88
89 PtrQueueSet::PtrQueueSet(bool notify_when_complete) :
90 _max_completed_queue(0),
91 _cbl_mon(NULL), _fl_lock(NULL),
92 _notify_when_complete(notify_when_complete),
93 _sz(0),
94 _completed_buffers_head(NULL),
95 _completed_buffers_tail(NULL),
96 _n_completed_buffers(0),
97 _process_completed_threshold(0), _process_completed(false),
98 _buf_free_list(NULL), _buf_free_list_sz(0)
99 {
100 _fl_owner = this;
101 }
102
103 void** PtrQueueSet::allocate_buffer() {
104 assert(_sz > 0, "Didn't set a buffer size.");
105 MutexLockerEx x(_fl_owner->_fl_lock, Mutex::_no_safepoint_check_flag);
106 if (_fl_owner->_buf_free_list != NULL) {
107 void** res = BufferNode::make_buffer_from_node(_fl_owner->_buf_free_list);
108 _fl_owner->_buf_free_list = _fl_owner->_buf_free_list->next();
109 _fl_owner->_buf_free_list_sz--;
110 return res;
111 } else {
112 // Allocate space for the BufferNode in front of the buffer.
113 char *b = NEW_C_HEAP_ARRAY(char, _sz + BufferNode::aligned_size(), mtGC);
114 return BufferNode::make_buffer_from_block(b);
115 }
116 }
117
118 void PtrQueueSet::deallocate_buffer(void** buf) {
119 assert(_sz > 0, "Didn't set a buffer size.");
120 MutexLockerEx x(_fl_owner->_fl_lock, Mutex::_no_safepoint_check_flag);
121 BufferNode *node = BufferNode::make_node_from_buffer(buf);
122 node->set_next(_fl_owner->_buf_free_list);
216 void PtrQueueSet::enqueue_complete_buffer(void** buf, size_t index) {
217 MutexLockerEx x(_cbl_mon, Mutex::_no_safepoint_check_flag);
218 BufferNode* cbn = BufferNode::new_from_buffer(buf);
219 cbn->set_index(index);
220 if (_completed_buffers_tail == NULL) {
221 assert(_completed_buffers_head == NULL, "Well-formedness");
222 _completed_buffers_head = cbn;
223 _completed_buffers_tail = cbn;
224 } else {
225 _completed_buffers_tail->set_next(cbn);
226 _completed_buffers_tail = cbn;
227 }
228 _n_completed_buffers++;
229
230 if (!_process_completed && _process_completed_threshold >= 0 &&
231 _n_completed_buffers >= _process_completed_threshold) {
232 _process_completed = true;
233 if (_notify_when_complete)
234 _cbl_mon->notify();
235 }
236 debug_only(assert_completed_buffer_list_len_correct_locked());
237 }
238
239 int PtrQueueSet::completed_buffers_list_length() {
240 int n = 0;
241 BufferNode* cbn = _completed_buffers_head;
242 while (cbn != NULL) {
243 n++;
244 cbn = cbn->next();
245 }
246 return n;
247 }
248
249 void PtrQueueSet::assert_completed_buffer_list_len_correct() {
250 MutexLockerEx x(_cbl_mon, Mutex::_no_safepoint_check_flag);
251 assert_completed_buffer_list_len_correct_locked();
252 }
253
254 void PtrQueueSet::assert_completed_buffer_list_len_correct_locked() {
255 guarantee(completed_buffers_list_length() == _n_completed_buffers,
256 "Completed buffer length is wrong.");
257 }
258
259 void PtrQueueSet::set_buffer_size(size_t sz) {
260 assert(_sz == 0 && sz > 0, "Should be called only once.");
261 _sz = sz * oopSize;
262 }
263
264 // Merge lists of buffers. Notify the processing threads.
265 // The source queue is emptied as a result. The queues
266 // must share the monitor.
267 void PtrQueueSet::merge_bufferlists(PtrQueueSet *src) {
268 assert(_cbl_mon == src->_cbl_mon, "Should share the same lock");
269 MutexLockerEx x(_cbl_mon, Mutex::_no_safepoint_check_flag);
270 if (_completed_buffers_tail == NULL) {
271 assert(_completed_buffers_head == NULL, "Well-formedness");
272 _completed_buffers_head = src->_completed_buffers_head;
273 _completed_buffers_tail = src->_completed_buffers_tail;
274 } else {
275 assert(_completed_buffers_head != NULL, "Well formedness");
276 if (src->_completed_buffers_head != NULL) {
277 _completed_buffers_tail->set_next(src->_completed_buffers_head);
278 _completed_buffers_tail = src->_completed_buffers_tail;
279 }
280 }
281 _n_completed_buffers += src->_n_completed_buffers;
|
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/ptrQueue.hpp"
27 #include "memory/allocation.hpp"
28 #include "memory/allocation.inline.hpp"
29 #include "runtime/mutex.hpp"
30 #include "runtime/mutexLocker.hpp"
31 #include "runtime/thread.inline.hpp"
32
33 PtrQueue::PtrQueue(PtrQueueSet* qset, bool permanent, bool active) :
34 _qset(qset), _buf(NULL), _index(0), _sz(0), _active(active),
35 _permanent(permanent), _lock(NULL)
36 {}
37
38 PtrQueue::~PtrQueue() {
39 assert(_permanent || (_buf == NULL), "queue must be flushed before delete");
40 }
41
42 void PtrQueue::flush_impl() {
43 if (!_permanent && _buf != NULL) {
44 if (_index == _sz) {
45 // No work to do.
46 qset()->deallocate_buffer(_buf);
47 } else {
48 // We must NULL out the unused entries, then enqueue.
49 size_t limit = byte_index_to_index(_index);
50 for (size_t i = 0; i < limit; ++i) {
51 _buf[i] = NULL;
52 }
53 qset()->enqueue_complete_buffer(_buf);
54 }
55 _buf = NULL;
56 _index = 0;
57 }
58 }
59
60
61 void PtrQueue::enqueue_known_active(void* ptr) {
62 assert(_index <= _sz, "Invariant.");
63 assert(_index == 0 || _buf != NULL, "invariant");
64
65 while (_index == 0) {
66 handle_zero_index();
67 }
68
69 assert(_index > 0, "postcondition");
70 _index -= sizeof(void*);
71 _buf[byte_index_to_index(_index)] = ptr;
72 assert(_index <= _sz, "Invariant.");
73 }
74
75 void PtrQueue::locking_enqueue_completed_buffer(void** buf) {
76 assert(_lock->owned_by_self(), "Required.");
77
78 // We have to unlock _lock (which may be Shared_DirtyCardQ_lock) before
79 // we acquire DirtyCardQ_CBL_mon inside enqueue_complete_buffer as they
80 // have the same rank and we may get the "possible deadlock" message
81 _lock->unlock();
82
83 qset()->enqueue_complete_buffer(buf);
84 // We must relock only because the caller will unlock, for the normal
85 // case.
86 _lock->lock_without_safepoint_check();
87 }
88
89
90 PtrQueueSet::PtrQueueSet(bool notify_when_complete) :
91 _max_completed_queue(0),
92 _cbl_mon(NULL), _fl_lock(NULL),
93 _notify_when_complete(notify_when_complete),
94 _sz(0),
95 _completed_buffers_head(NULL),
96 _completed_buffers_tail(NULL),
97 _n_completed_buffers(0),
98 _process_completed_threshold(0), _process_completed(false),
99 _buf_free_list(NULL), _buf_free_list_sz(0)
100 {
101 _fl_owner = this;
102 }
103
104 PtrQueueSet::~PtrQueueSet() {
105 // There are presently only a couple (derived) instances ever
106 // created, and they are permanent, so no harm currently done by
107 // doing nothing here.
108 }
109
110 void PtrQueueSet::initialize(Monitor* cbl_mon,
111 Mutex* fl_lock,
112 int process_completed_threshold,
113 int max_completed_queue,
114 PtrQueueSet *fl_owner) {
115 _max_completed_queue = max_completed_queue;
116 _process_completed_threshold = process_completed_threshold;
117 _completed_queue_padding = 0;
118 assert(cbl_mon != NULL && fl_lock != NULL, "Init order issue?");
119 _cbl_mon = cbl_mon;
120 _fl_lock = fl_lock;
121 _fl_owner = (fl_owner != NULL) ? fl_owner : this;
122 }
123
124 void** PtrQueueSet::allocate_buffer() {
125 assert(_sz > 0, "Didn't set a buffer size.");
126 MutexLockerEx x(_fl_owner->_fl_lock, Mutex::_no_safepoint_check_flag);
127 if (_fl_owner->_buf_free_list != NULL) {
128 void** res = BufferNode::make_buffer_from_node(_fl_owner->_buf_free_list);
129 _fl_owner->_buf_free_list = _fl_owner->_buf_free_list->next();
130 _fl_owner->_buf_free_list_sz--;
131 return res;
132 } else {
133 // Allocate space for the BufferNode in front of the buffer.
134 char *b = NEW_C_HEAP_ARRAY(char, _sz + BufferNode::aligned_size(), mtGC);
135 return BufferNode::make_buffer_from_block(b);
136 }
137 }
138
139 void PtrQueueSet::deallocate_buffer(void** buf) {
140 assert(_sz > 0, "Didn't set a buffer size.");
141 MutexLockerEx x(_fl_owner->_fl_lock, Mutex::_no_safepoint_check_flag);
142 BufferNode *node = BufferNode::make_node_from_buffer(buf);
143 node->set_next(_fl_owner->_buf_free_list);
237 void PtrQueueSet::enqueue_complete_buffer(void** buf, size_t index) {
238 MutexLockerEx x(_cbl_mon, Mutex::_no_safepoint_check_flag);
239 BufferNode* cbn = BufferNode::new_from_buffer(buf);
240 cbn->set_index(index);
241 if (_completed_buffers_tail == NULL) {
242 assert(_completed_buffers_head == NULL, "Well-formedness");
243 _completed_buffers_head = cbn;
244 _completed_buffers_tail = cbn;
245 } else {
246 _completed_buffers_tail->set_next(cbn);
247 _completed_buffers_tail = cbn;
248 }
249 _n_completed_buffers++;
250
251 if (!_process_completed && _process_completed_threshold >= 0 &&
252 _n_completed_buffers >= _process_completed_threshold) {
253 _process_completed = true;
254 if (_notify_when_complete)
255 _cbl_mon->notify();
256 }
257 DEBUG_ONLY(assert_completed_buffer_list_len_correct_locked());
258 }
259
260 int PtrQueueSet::completed_buffers_list_length() {
261 int n = 0;
262 BufferNode* cbn = _completed_buffers_head;
263 while (cbn != NULL) {
264 n++;
265 cbn = cbn->next();
266 }
267 return n;
268 }
269
270 void PtrQueueSet::assert_completed_buffer_list_len_correct() {
271 MutexLockerEx x(_cbl_mon, Mutex::_no_safepoint_check_flag);
272 assert_completed_buffer_list_len_correct_locked();
273 }
274
275 void PtrQueueSet::assert_completed_buffer_list_len_correct_locked() {
276 guarantee(completed_buffers_list_length() == _n_completed_buffers,
277 "Completed buffer length is wrong.");
278 }
279
280 void PtrQueueSet::set_buffer_size(size_t sz) {
281 assert(_sz == 0 && sz > 0, "Should be called only once.");
282 _sz = sz * sizeof(void*);
283 }
284
285 // Merge lists of buffers. Notify the processing threads.
286 // The source queue is emptied as a result. The queues
287 // must share the monitor.
288 void PtrQueueSet::merge_bufferlists(PtrQueueSet *src) {
289 assert(_cbl_mon == src->_cbl_mon, "Should share the same lock");
290 MutexLockerEx x(_cbl_mon, Mutex::_no_safepoint_check_flag);
291 if (_completed_buffers_tail == NULL) {
292 assert(_completed_buffers_head == NULL, "Well-formedness");
293 _completed_buffers_head = src->_completed_buffers_head;
294 _completed_buffers_tail = src->_completed_buffers_tail;
295 } else {
296 assert(_completed_buffers_head != NULL, "Well formedness");
297 if (src->_completed_buffers_head != NULL) {
298 _completed_buffers_tail->set_next(src->_completed_buffers_head);
299 _completed_buffers_tail = src->_completed_buffers_tail;
300 }
301 }
302 _n_completed_buffers += src->_n_completed_buffers;
|