1 /*
2 * Copyright (c) 2005, 2019, Oracle and/or its affiliates. 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 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/systemDictionary.hpp"
27 #include "gc/parallel/objectStartArray.hpp"
28 #include "gc/parallel/parMarkBitMap.inline.hpp"
29 #include "gc/parallel/parallelScavengeHeap.hpp"
30 #include "gc/parallel/psCompactionManager.inline.hpp"
31 #include "gc/parallel/psOldGen.hpp"
32 #include "gc/parallel/psParallelCompact.inline.hpp"
33 #include "gc/shared/taskqueue.inline.hpp"
34 #include "logging/log.hpp"
35 #include "memory/iterator.inline.hpp"
36 #include "oops/access.inline.hpp"
37 #include "oops/compressedOops.inline.hpp"
38 #include "oops/instanceKlass.inline.hpp"
39 #include "oops/instanceMirrorKlass.inline.hpp"
40 #include "oops/objArrayKlass.inline.hpp"
41 #include "oops/oop.inline.hpp"
42 #include "runtime/atomic.hpp"
43
44 PSOldGen* ParCompactionManager::_old_gen = NULL;
45 ParCompactionManager** ParCompactionManager::_manager_array = NULL;
46
47 OopTaskQueueSet* ParCompactionManager::_stack_array = NULL;
48 ParCompactionManager::ObjArrayTaskQueueSet*
49 ParCompactionManager::_objarray_queues = NULL;
50 ObjectStartArray* ParCompactionManager::_start_array = NULL;
51 ParMarkBitMap* ParCompactionManager::_mark_bitmap = NULL;
52 RegionTaskQueueSet* ParCompactionManager::_region_array = NULL;
53
54 ParCompactionManager::ParCompactionManager() :
55 _action(CopyAndUpdate) {
56
57 ParallelScavengeHeap* heap = ParallelScavengeHeap::heap();
58
59 _old_gen = heap->old_gen();
60 _start_array = old_gen()->start_array();
61
62 marking_stack()->initialize();
63 _objarray_stack.initialize();
64 _region_stack.initialize();
65
66 reset_bitmap_query_cache();
67 }
68
69 void ParCompactionManager::initialize(ParMarkBitMap* mbm) {
70 assert(ParallelScavengeHeap::heap() != NULL,
71 "Needed for initialization");
72
73 _mark_bitmap = mbm;
74
75 uint parallel_gc_threads = ParallelScavengeHeap::heap()->workers().total_workers();
76
77 assert(_manager_array == NULL, "Attempt to initialize twice");
78 _manager_array = NEW_C_HEAP_ARRAY(ParCompactionManager*, parallel_gc_threads+1, mtGC);
79 guarantee(_manager_array != NULL, "Could not allocate manager_array");
80
81 _stack_array = new OopTaskQueueSet(parallel_gc_threads);
82 guarantee(_stack_array != NULL, "Could not allocate stack_array");
83 _objarray_queues = new ObjArrayTaskQueueSet(parallel_gc_threads);
84 guarantee(_objarray_queues != NULL, "Could not allocate objarray_queues");
85 _region_array = new RegionTaskQueueSet(parallel_gc_threads);
86 guarantee(_region_array != NULL, "Could not allocate region_array");
87
88 // Create and register the ParCompactionManager(s) for the worker threads.
89 for(uint i=0; i<parallel_gc_threads; i++) {
90 _manager_array[i] = new ParCompactionManager();
91 guarantee(_manager_array[i] != NULL, "Could not create ParCompactionManager");
92 stack_array()->register_queue(i, _manager_array[i]->marking_stack());
93 _objarray_queues->register_queue(i, &_manager_array[i]->_objarray_stack);
94 region_array()->register_queue(i, _manager_array[i]->region_stack());
95 }
96
97 // The VMThread gets its own ParCompactionManager, which is not available
98 // for work stealing.
99 _manager_array[parallel_gc_threads] = new ParCompactionManager();
100 guarantee(_manager_array[parallel_gc_threads] != NULL,
101 "Could not create ParCompactionManager");
102 assert(ParallelScavengeHeap::heap()->workers().total_workers() != 0,
103 "Not initialized?");
104 }
105
106 void ParCompactionManager::reset_all_bitmap_query_caches() {
107 uint parallel_gc_threads = ParallelScavengeHeap::heap()->workers().total_workers();
108 for (uint i=0; i<=parallel_gc_threads; i++) {
109 _manager_array[i]->reset_bitmap_query_cache();
110 }
111 }
112
113 bool ParCompactionManager::should_update() {
114 assert(action() != NotValid, "Action is not set");
115 return (action() == ParCompactionManager::Update) ||
116 (action() == ParCompactionManager::CopyAndUpdate) ||
117 (action() == ParCompactionManager::UpdateAndCopy);
118 }
119
120 bool ParCompactionManager::should_copy() {
121 assert(action() != NotValid, "Action is not set");
122 return (action() == ParCompactionManager::Copy) ||
123 (action() == ParCompactionManager::CopyAndUpdate) ||
124 (action() == ParCompactionManager::UpdateAndCopy);
125 }
126
127 ParCompactionManager*
128 ParCompactionManager::gc_thread_compaction_manager(uint index) {
129 assert(index < ParallelGCThreads, "index out of range");
130 assert(_manager_array != NULL, "Sanity");
131 return _manager_array[index];
132 }
133
134 void ParCompactionManager::follow_marking_stacks() {
135 do {
136 // Drain the overflow stack first, to allow stealing from the marking stack.
137 oop obj;
138 while (marking_stack()->pop_overflow(obj)) {
139 follow_contents(obj);
140 }
141 while (marking_stack()->pop_local(obj)) {
142 follow_contents(obj);
143 }
144
145 // Process ObjArrays one at a time to avoid marking stack bloat.
146 ObjArrayTask task;
147 if (_objarray_stack.pop_overflow(task) || _objarray_stack.pop_local(task)) {
148 follow_array((objArrayOop)task.obj(), task.index());
149 }
150 } while (!marking_stacks_empty());
151
152 assert(marking_stacks_empty(), "Sanity");
153 }
154
155 void ParCompactionManager::drain_region_stacks() {
156 do {
157 // Drain overflow stack first so other threads can steal.
158 size_t region_index;
159 while (region_stack()->pop_overflow(region_index)) {
160 PSParallelCompact::fill_and_update_region(this, region_index);
161 }
162
163 while (region_stack()->pop_local(region_index)) {
164 PSParallelCompact::fill_and_update_region(this, region_index);
165 }
166 } while (!region_stack()->is_empty());
167 }