src/share/vm/gc_implementation/g1/g1StringDedupQueue.cpp

Tue, 08 Aug 2017 15:57:29 +0800

author
aoqi
date
Tue, 08 Aug 2017 15:57:29 +0800
changeset 6876
710a3c8b516e
parent 6690
1772223a25a2
parent 0
f90c822e73f8
child 9448
73d689add964
permissions
-rw-r--r--

merge

aoqi@0 1 /*
aoqi@0 2 * Copyright (c) 2014, Oracle and/or its affiliates. All rights reserved.
aoqi@0 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
aoqi@0 4 *
aoqi@0 5 * This code is free software; you can redistribute it and/or modify it
aoqi@0 6 * under the terms of the GNU General Public License version 2 only, as
aoqi@0 7 * published by the Free Software Foundation.
aoqi@0 8 *
aoqi@0 9 * This code is distributed in the hope that it will be useful, but WITHOUT
aoqi@0 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
aoqi@0 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
aoqi@0 12 * version 2 for more details (a copy is included in the LICENSE file that
aoqi@0 13 * accompanied this code).
aoqi@0 14 *
aoqi@0 15 * You should have received a copy of the GNU General Public License version
aoqi@0 16 * 2 along with this work; if not, write to the Free Software Foundation,
aoqi@0 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
aoqi@0 18 *
aoqi@0 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
aoqi@0 20 * or visit www.oracle.com if you need additional information or have any
aoqi@0 21 * questions.
aoqi@0 22 *
aoqi@0 23 */
aoqi@0 24
aoqi@0 25 #include "precompiled.hpp"
aoqi@0 26 #include "classfile/javaClasses.hpp"
aoqi@0 27 #include "gc_implementation/g1/g1StringDedupQueue.hpp"
aoqi@0 28 #include "memory/gcLocker.hpp"
aoqi@0 29 #include "runtime/mutexLocker.hpp"
aoqi@0 30 #include "utilities/stack.inline.hpp"
aoqi@0 31
aoqi@0 32 G1StringDedupQueue* G1StringDedupQueue::_queue = NULL;
aoqi@0 33 const size_t G1StringDedupQueue::_max_size = 1000000; // Max number of elements per queue
aoqi@0 34 const size_t G1StringDedupQueue::_max_cache_size = 0; // Max cache size per queue
aoqi@0 35
aoqi@0 36 G1StringDedupQueue::G1StringDedupQueue() :
aoqi@0 37 _cursor(0),
aoqi@0 38 _cancel(false),
aoqi@0 39 _empty(true),
aoqi@0 40 _dropped(0) {
aoqi@0 41 _nqueues = MAX2(ParallelGCThreads, (size_t)1);
aoqi@0 42 _queues = NEW_C_HEAP_ARRAY(G1StringDedupWorkerQueue, _nqueues, mtGC);
aoqi@0 43 for (size_t i = 0; i < _nqueues; i++) {
aoqi@0 44 new (_queues + i) G1StringDedupWorkerQueue(G1StringDedupWorkerQueue::default_segment_size(), _max_cache_size, _max_size);
aoqi@0 45 }
aoqi@0 46 }
aoqi@0 47
aoqi@0 48 G1StringDedupQueue::~G1StringDedupQueue() {
aoqi@0 49 ShouldNotReachHere();
aoqi@0 50 }
aoqi@0 51
aoqi@0 52 void G1StringDedupQueue::create() {
aoqi@0 53 assert(_queue == NULL, "One string deduplication queue allowed");
aoqi@0 54 _queue = new G1StringDedupQueue();
aoqi@0 55 }
aoqi@0 56
aoqi@0 57 void G1StringDedupQueue::wait() {
aoqi@0 58 MonitorLockerEx ml(StringDedupQueue_lock, Mutex::_no_safepoint_check_flag);
aoqi@0 59 while (_queue->_empty && !_queue->_cancel) {
aoqi@0 60 ml.wait(Mutex::_no_safepoint_check_flag);
aoqi@0 61 }
aoqi@0 62 }
aoqi@0 63
aoqi@0 64 void G1StringDedupQueue::cancel_wait() {
aoqi@0 65 MonitorLockerEx ml(StringDedupQueue_lock, Mutex::_no_safepoint_check_flag);
aoqi@0 66 _queue->_cancel = true;
aoqi@0 67 ml.notify();
aoqi@0 68 }
aoqi@0 69
aoqi@0 70 void G1StringDedupQueue::push(uint worker_id, oop java_string) {
aoqi@0 71 assert(SafepointSynchronize::is_at_safepoint(), "Must be at safepoint");
aoqi@0 72 assert(worker_id < _queue->_nqueues, "Invalid queue");
aoqi@0 73
aoqi@0 74 // Push and notify waiter
aoqi@0 75 G1StringDedupWorkerQueue& worker_queue = _queue->_queues[worker_id];
aoqi@0 76 if (!worker_queue.is_full()) {
aoqi@0 77 worker_queue.push(java_string);
aoqi@0 78 if (_queue->_empty) {
aoqi@0 79 MonitorLockerEx ml(StringDedupQueue_lock, Mutex::_no_safepoint_check_flag);
aoqi@0 80 if (_queue->_empty) {
aoqi@0 81 // Mark non-empty and notify waiter
aoqi@0 82 _queue->_empty = false;
aoqi@0 83 ml.notify();
aoqi@0 84 }
aoqi@0 85 }
aoqi@0 86 } else {
aoqi@0 87 // Queue is full, drop the string and update the statistics
aoqi@0 88 Atomic::inc_ptr(&_queue->_dropped);
aoqi@0 89 }
aoqi@0 90 }
aoqi@0 91
aoqi@0 92 oop G1StringDedupQueue::pop() {
aoqi@0 93 assert(!SafepointSynchronize::is_at_safepoint(), "Must not be at safepoint");
aoqi@0 94 No_Safepoint_Verifier nsv;
aoqi@0 95
aoqi@0 96 // Try all queues before giving up
aoqi@0 97 for (size_t tries = 0; tries < _queue->_nqueues; tries++) {
aoqi@0 98 // The cursor indicates where we left of last time
aoqi@0 99 G1StringDedupWorkerQueue* queue = &_queue->_queues[_queue->_cursor];
aoqi@0 100 while (!queue->is_empty()) {
aoqi@0 101 oop obj = queue->pop();
aoqi@0 102 // The oop we pop can be NULL if it was marked
aoqi@0 103 // dead. Just ignore those and pop the next oop.
aoqi@0 104 if (obj != NULL) {
aoqi@0 105 return obj;
aoqi@0 106 }
aoqi@0 107 }
aoqi@0 108
aoqi@0 109 // Try next queue
aoqi@0 110 _queue->_cursor = (_queue->_cursor + 1) % _queue->_nqueues;
aoqi@0 111 }
aoqi@0 112
aoqi@0 113 // Mark empty
aoqi@0 114 _queue->_empty = true;
aoqi@0 115
aoqi@0 116 return NULL;
aoqi@0 117 }
aoqi@0 118
aoqi@0 119 void G1StringDedupQueue::unlink_or_oops_do(G1StringDedupUnlinkOrOopsDoClosure* cl) {
aoqi@0 120 // A worker thread first claims a queue, which ensures exclusive
aoqi@0 121 // access to that queue, then continues to process it.
aoqi@0 122 for (;;) {
aoqi@0 123 // Grab next queue to scan
aoqi@0 124 size_t queue = cl->claim_queue();
aoqi@0 125 if (queue >= _queue->_nqueues) {
aoqi@0 126 // End of queues
aoqi@0 127 break;
aoqi@0 128 }
aoqi@0 129
aoqi@0 130 // Scan the queue
aoqi@0 131 unlink_or_oops_do(cl, queue);
aoqi@0 132 }
aoqi@0 133 }
aoqi@0 134
aoqi@0 135 void G1StringDedupQueue::unlink_or_oops_do(G1StringDedupUnlinkOrOopsDoClosure* cl, size_t queue) {
aoqi@0 136 assert(queue < _queue->_nqueues, "Invalid queue");
aoqi@0 137 StackIterator<oop, mtGC> iter(_queue->_queues[queue]);
aoqi@0 138 while (!iter.is_empty()) {
aoqi@0 139 oop* p = iter.next_addr();
aoqi@0 140 if (*p != NULL) {
aoqi@0 141 if (cl->is_alive(*p)) {
aoqi@0 142 cl->keep_alive(p);
aoqi@0 143 } else {
aoqi@0 144 // Clear dead reference
aoqi@0 145 *p = NULL;
aoqi@0 146 }
aoqi@0 147 }
aoqi@0 148 }
aoqi@0 149 }
aoqi@0 150
aoqi@0 151 void G1StringDedupQueue::print_statistics(outputStream* st) {
aoqi@0 152 st->print_cr(
aoqi@0 153 " [Queue]\n"
aoqi@0 154 " [Dropped: "UINTX_FORMAT"]", _queue->_dropped);
aoqi@0 155 }
aoqi@0 156
aoqi@0 157 void G1StringDedupQueue::verify() {
aoqi@0 158 for (size_t i = 0; i < _queue->_nqueues; i++) {
aoqi@0 159 StackIterator<oop, mtGC> iter(_queue->_queues[i]);
aoqi@0 160 while (!iter.is_empty()) {
aoqi@0 161 oop obj = iter.next();
aoqi@0 162 if (obj != NULL) {
aoqi@0 163 guarantee(Universe::heap()->is_in_reserved(obj), "Object must be on the heap");
aoqi@0 164 guarantee(!obj->is_forwarded(), "Object must not be forwarded");
aoqi@0 165 guarantee(java_lang_String::is_instance(obj), "Object must be a String");
aoqi@0 166 }
aoqi@0 167 }
aoqi@0 168 }
aoqi@0 169 }

mercurial