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 "classfile/javaClasses.inline.hpp"
27 #include "gc/g1/g1CollectedHeap.hpp"
28 #include "gc/g1/g1StringDedup.hpp"
29 #include "gc/g1/g1StringDedupQueue.hpp"
30 #include "gc/shared/gcLocker.hpp"
31 #include "oops/oop.inline.hpp"
32 #include "runtime/atomic.inline.hpp"
33 #include "runtime/mutexLocker.hpp"
34 #include "utilities/stack.inline.hpp"
35
36 G1StringDedupQueue* G1StringDedupQueue::_queue = NULL;
37 const size_t G1StringDedupQueue::_max_size = 1000000; // Max number of elements per queue
38 const size_t G1StringDedupQueue::_max_cache_size = 0; // Max cache size per queue
39
40 G1StringDedupQueue::G1StringDedupQueue() :
41 _cursor(0),
42 _cancel(false),
43 _empty(true),
44 _dropped(0) {
45 _nqueues = ParallelGCThreads;
46 _queues = NEW_C_HEAP_ARRAY(G1StringDedupWorkerQueue, _nqueues, mtGC);
47 for (size_t i = 0; i < _nqueues; i++) {
48 new (_queues + i) G1StringDedupWorkerQueue(G1StringDedupWorkerQueue::default_segment_size(), _max_cache_size, _max_size);
49 }
50 }
135 unlink_or_oops_do(cl, queue);
136 }
137 }
138
139 void G1StringDedupQueue::unlink_or_oops_do(G1StringDedupUnlinkOrOopsDoClosure* cl, size_t queue) {
140 assert(queue < _queue->_nqueues, "Invalid queue");
141 StackIterator<oop, mtGC> iter(_queue->_queues[queue]);
142 while (!iter.is_empty()) {
143 oop* p = iter.next_addr();
144 if (*p != NULL) {
145 if (cl->is_alive(*p)) {
146 cl->keep_alive(p);
147 } else {
148 // Clear dead reference
149 *p = NULL;
150 }
151 }
152 }
153 }
154
155 void G1StringDedupQueue::print_statistics(outputStream* st) {
156 st->print_cr(
157 " [Queue]\n"
158 " [Dropped: " UINTX_FORMAT "]", _queue->_dropped);
159 }
160
161 void G1StringDedupQueue::verify() {
162 for (size_t i = 0; i < _queue->_nqueues; i++) {
163 StackIterator<oop, mtGC> iter(_queue->_queues[i]);
164 while (!iter.is_empty()) {
165 oop obj = iter.next();
166 if (obj != NULL) {
167 guarantee(G1CollectedHeap::heap()->is_in_reserved(obj), "Object must be on the heap");
168 guarantee(!obj->is_forwarded(), "Object must not be forwarded");
169 guarantee(java_lang_String::is_instance(obj), "Object must be a String");
170 }
171 }
172 }
173 }
|
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 "classfile/javaClasses.inline.hpp"
27 #include "gc/g1/g1CollectedHeap.hpp"
28 #include "gc/g1/g1StringDedup.hpp"
29 #include "gc/g1/g1StringDedupQueue.hpp"
30 #include "gc/shared/gcLocker.hpp"
31 #include "logging/log.hpp"
32 #include "oops/oop.inline.hpp"
33 #include "runtime/atomic.inline.hpp"
34 #include "runtime/mutexLocker.hpp"
35 #include "utilities/stack.inline.hpp"
36
37 G1StringDedupQueue* G1StringDedupQueue::_queue = NULL;
38 const size_t G1StringDedupQueue::_max_size = 1000000; // Max number of elements per queue
39 const size_t G1StringDedupQueue::_max_cache_size = 0; // Max cache size per queue
40
41 G1StringDedupQueue::G1StringDedupQueue() :
42 _cursor(0),
43 _cancel(false),
44 _empty(true),
45 _dropped(0) {
46 _nqueues = ParallelGCThreads;
47 _queues = NEW_C_HEAP_ARRAY(G1StringDedupWorkerQueue, _nqueues, mtGC);
48 for (size_t i = 0; i < _nqueues; i++) {
49 new (_queues + i) G1StringDedupWorkerQueue(G1StringDedupWorkerQueue::default_segment_size(), _max_cache_size, _max_size);
50 }
51 }
136 unlink_or_oops_do(cl, queue);
137 }
138 }
139
140 void G1StringDedupQueue::unlink_or_oops_do(G1StringDedupUnlinkOrOopsDoClosure* cl, size_t queue) {
141 assert(queue < _queue->_nqueues, "Invalid queue");
142 StackIterator<oop, mtGC> iter(_queue->_queues[queue]);
143 while (!iter.is_empty()) {
144 oop* p = iter.next_addr();
145 if (*p != NULL) {
146 if (cl->is_alive(*p)) {
147 cl->keep_alive(p);
148 } else {
149 // Clear dead reference
150 *p = NULL;
151 }
152 }
153 }
154 }
155
156 void G1StringDedupQueue::print_statistics() {
157 log_trace(gc, stringdedup)(
158 " [Queue]\n"
159 " [Dropped: " UINTX_FORMAT "]", _queue->_dropped);
160 }
161
162 void G1StringDedupQueue::verify() {
163 for (size_t i = 0; i < _queue->_nqueues; i++) {
164 StackIterator<oop, mtGC> iter(_queue->_queues[i]);
165 while (!iter.is_empty()) {
166 oop obj = iter.next();
167 if (obj != NULL) {
168 guarantee(G1CollectedHeap::heap()->is_in_reserved(obj), "Object must be on the heap");
169 guarantee(!obj->is_forwarded(), "Object must not be forwarded");
170 guarantee(java_lang_String::is_instance(obj), "Object must be a String");
171 }
172 }
173 }
174 }
|