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 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_implementation/g1/g1StringDedup.hpp"
28 #include "gc_implementation/g1/g1StringDedupQueue.hpp"
29 #include "memory/gcLocker.hpp"
30 #include "oops/oop.inline.hpp"
31 #include "runtime/atomic.inline.hpp"
32 #include "runtime/mutexLocker.hpp"
33 #include "utilities/stack.inline.hpp"
34
35 G1StringDedupQueue* G1StringDedupQueue::_queue = NULL;
36 const size_t G1StringDedupQueue::_max_size = 1000000; // Max number of elements per queue
37 const size_t G1StringDedupQueue::_max_cache_size = 0; // Max cache size per queue
38
39 G1StringDedupQueue::G1StringDedupQueue() :
40 _cursor(0),
41 _cancel(false),
42 _empty(true),
43 _dropped(0) {
44 _nqueues = MAX2(ParallelGCThreads, (size_t)1);
45 _queues = NEW_C_HEAP_ARRAY(G1StringDedupWorkerQueue, _nqueues, mtGC);
46 for (size_t i = 0; i < _nqueues; i++) {
146 } else {
147 // Clear dead reference
148 *p = NULL;
149 }
150 }
151 }
152 }
153
154 void G1StringDedupQueue::print_statistics(outputStream* st) {
155 st->print_cr(
156 " [Queue]\n"
157 " [Dropped: "UINTX_FORMAT"]", _queue->_dropped);
158 }
159
160 void G1StringDedupQueue::verify() {
161 for (size_t i = 0; i < _queue->_nqueues; i++) {
162 StackIterator<oop, mtGC> iter(_queue->_queues[i]);
163 while (!iter.is_empty()) {
164 oop obj = iter.next();
165 if (obj != NULL) {
166 guarantee(Universe::heap()->is_in_reserved(obj), "Object must be on the heap");
167 guarantee(!obj->is_forwarded(), "Object must not be forwarded");
168 guarantee(java_lang_String::is_instance(obj), "Object must be a String");
169 }
170 }
171 }
172 }
|
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 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_implementation/g1/g1CollectedHeap.hpp"
28 #include "gc_implementation/g1/g1StringDedup.hpp"
29 #include "gc_implementation/g1/g1StringDedupQueue.hpp"
30 #include "memory/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 = MAX2(ParallelGCThreads, (size_t)1);
46 _queues = NEW_C_HEAP_ARRAY(G1StringDedupWorkerQueue, _nqueues, mtGC);
47 for (size_t i = 0; i < _nqueues; i++) {
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 }
|