Mercurial > hg > truffle

comparison src/share/vm/gc_implementation/g1/satbQueue.cpp @ 342:37f87013dfd8

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
6711316: Open source the Garbage-First garbage collector Summary: First mercurial integration of the code for the Garbage-First garbage collector. Reviewed-by: apetrusenko, iveresov, jmasa, sgoldman, tonyp, ysr
author ysr
date Thu, 05 Jun 2008 15:57:56 -0700
parents
children df6caf649ff7
comparison
equal deleted inserted replaced
189:0b27f3512f9e 342:37f87013dfd8
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/_satbQueue.cpp.incl"
27
28 void ObjPtrQueue::apply_closure(ObjectClosure* cl) {
29 if (_buf != NULL) {
30 apply_closure_to_buffer(cl, _buf, _index, _sz);
31 _index = _sz;
32 }
33 }
34
35 void ObjPtrQueue::apply_closure_to_buffer(ObjectClosure* cl,
36 void** buf, size_t index, size_t sz) {
37 if (cl == NULL) return;
38 for (size_t i = index; i < sz; i += oopSize) {
39 oop obj = (oop)buf[byte_index_to_index((int)i)];
40 // There can be NULL entries because of destructors.
41 if (obj != NULL) {
42 cl->do_object(obj);
43 }
44 }
45 }
46 #ifdef _MSC_VER // the use of 'this' below gets a warning, make it go away
47 #pragma warning( disable:4355 ) // 'this' : used in base member initializer list
48 #endif // _MSC_VER
49
50
51 SATBMarkQueueSet::SATBMarkQueueSet() :
52 PtrQueueSet(),
53 _closure(NULL), _par_closures(NULL),
54 _shared_satb_queue(this, true /*perm*/)
55 {}
56
57 void SATBMarkQueueSet::initialize(Monitor* cbl_mon, Mutex* fl_lock,
58 int max_completed_queue,
59 Mutex* lock) {
60 PtrQueueSet::initialize(cbl_mon, fl_lock, max_completed_queue);
61 _shared_satb_queue.set_lock(lock);
62 if (ParallelGCThreads > 0) {
63 _par_closures = NEW_C_HEAP_ARRAY(ObjectClosure*, ParallelGCThreads);
64 }
65 }
66
67
68 void SATBMarkQueueSet::handle_zero_index_for_thread(JavaThread* t) {
69 t->satb_mark_queue().handle_zero_index();
70 }
71
72 void SATBMarkQueueSet::set_active_all_threads(bool b) {
73 _all_active = b;
74 for(JavaThread* t = Threads::first(); t; t = t->next()) {
75 t->satb_mark_queue().set_active(b);
76 }
77 }
78
79 void SATBMarkQueueSet::set_closure(ObjectClosure* closure) {
80 _closure = closure;
81 }
82
83 void SATBMarkQueueSet::set_par_closure(int i, ObjectClosure* par_closure) {
84 assert(ParallelGCThreads > 0 && _par_closures != NULL, "Precondition");
85 _par_closures[i] = par_closure;
86 }
87
88 void SATBMarkQueueSet::iterate_closure_all_threads() {
89 for(JavaThread* t = Threads::first(); t; t = t->next()) {
90 t->satb_mark_queue().apply_closure(_closure);
91 }
92 shared_satb_queue()->apply_closure(_closure);
93 }
94
95 void SATBMarkQueueSet::par_iterate_closure_all_threads(int worker) {
96 SharedHeap* sh = SharedHeap::heap();
97 int parity = sh->strong_roots_parity();
98
99 for(JavaThread* t = Threads::first(); t; t = t->next()) {
100 if (t->claim_oops_do(true, parity)) {
101 t->satb_mark_queue().apply_closure(_par_closures[worker]);
102 }
103 }
104 // We'll have worker 0 do this one.
105 if (worker == 0) {
106 shared_satb_queue()->apply_closure(_par_closures[0]);
107 }
108 }
109
110 bool SATBMarkQueueSet::apply_closure_to_completed_buffer_work(bool par,
111 int worker) {
112 CompletedBufferNode* nd = NULL;
113 {
114 MutexLockerEx x(_cbl_mon, Mutex::_no_safepoint_check_flag);
115 if (_completed_buffers_head != NULL) {
116 nd = _completed_buffers_head;
117 _completed_buffers_head = nd->next;
118 if (_completed_buffers_head == NULL) _completed_buffers_tail = NULL;
119 _n_completed_buffers--;
120 if (_n_completed_buffers == 0) _process_completed = false;
121 }
122 }
123 ObjectClosure* cl = (par ? _par_closures[worker] : _closure);
124 if (nd != NULL) {
125 ObjPtrQueue::apply_closure_to_buffer(cl, nd->buf, 0, _sz);
126 deallocate_buffer(nd->buf);
127 delete nd;
128 return true;
129 } else {
130 return false;
131 }
132 }
133
134 void SATBMarkQueueSet::abandon_partial_marking() {
135 CompletedBufferNode* buffers_to_delete = NULL;
136 {
137 MutexLockerEx x(_cbl_mon, Mutex::_no_safepoint_check_flag);
138 while (_completed_buffers_head != NULL) {
139 CompletedBufferNode* nd = _completed_buffers_head;
140 _completed_buffers_head = nd->next;
141 nd->next = buffers_to_delete;
142 buffers_to_delete = nd;
143 }
144 _completed_buffers_tail = NULL;
145 _n_completed_buffers = 0;
146 debug_only(assert_completed_buffer_list_len_correct_locked());
147 }
148 while (buffers_to_delete != NULL) {
149 CompletedBufferNode* nd = buffers_to_delete;
150 buffers_to_delete = nd->next;
151 deallocate_buffer(nd->buf);
152 delete nd;
153 }
154 assert(SafepointSynchronize::is_at_safepoint(), "Must be at safepoint.");
155 // So we can safely manipulate these queues.
156 for (JavaThread* t = Threads::first(); t; t = t->next()) {
157 t->satb_mark_queue().reset();
158 }
159 shared_satb_queue()->reset();
160 }