Tue, 09 Aug 2011 10:16:01 -0700
6593758: RFE: Enhance GC ergonomics to dynamically choose ParallelGCThreads
Summary: Select number of GC threads dynamically based on heap usage and number of Java threads
Reviewed-by: johnc, ysr, jcoomes
1 /*
2 * Copyright (c) 2005, 2011, 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 */
25 #include "precompiled.hpp"
26 #include "classfile/systemDictionary.hpp"
27 #include "code/codeCache.hpp"
28 #include "gc_implementation/parallelScavenge/pcTasks.hpp"
29 #include "gc_implementation/parallelScavenge/psParallelCompact.hpp"
30 #include "gc_interface/collectedHeap.hpp"
31 #include "memory/universe.hpp"
32 #include "oops/objArrayKlass.inline.hpp"
33 #include "oops/oop.inline.hpp"
34 #include "oops/oop.pcgc.inline.hpp"
35 #include "prims/jvmtiExport.hpp"
36 #include "runtime/fprofiler.hpp"
37 #include "runtime/jniHandles.hpp"
38 #include "runtime/thread.hpp"
39 #include "runtime/vmThread.hpp"
40 #include "services/management.hpp"
42 //
43 // ThreadRootsMarkingTask
44 //
46 void ThreadRootsMarkingTask::do_it(GCTaskManager* manager, uint which) {
47 assert(Universe::heap()->is_gc_active(), "called outside gc");
49 ResourceMark rm;
51 NOT_PRODUCT(TraceTime tm("ThreadRootsMarkingTask",
52 PrintGCDetails && TraceParallelOldGCTasks, true, gclog_or_tty));
53 ParCompactionManager* cm =
54 ParCompactionManager::gc_thread_compaction_manager(which);
55 PSParallelCompact::MarkAndPushClosure mark_and_push_closure(cm);
56 CodeBlobToOopClosure mark_and_push_in_blobs(&mark_and_push_closure, /*do_marking=*/ true);
58 if (_java_thread != NULL)
59 _java_thread->oops_do(&mark_and_push_closure, &mark_and_push_in_blobs);
61 if (_vm_thread != NULL)
62 _vm_thread->oops_do(&mark_and_push_closure, &mark_and_push_in_blobs);
64 // Do the real work
65 cm->follow_marking_stacks();
66 }
69 void MarkFromRootsTask::do_it(GCTaskManager* manager, uint which) {
70 assert(Universe::heap()->is_gc_active(), "called outside gc");
72 NOT_PRODUCT(TraceTime tm("MarkFromRootsTask",
73 PrintGCDetails && TraceParallelOldGCTasks, true, gclog_or_tty));
74 ParCompactionManager* cm =
75 ParCompactionManager::gc_thread_compaction_manager(which);
76 PSParallelCompact::MarkAndPushClosure mark_and_push_closure(cm);
78 switch (_root_type) {
79 case universe:
80 Universe::oops_do(&mark_and_push_closure);
81 break;
83 case jni_handles:
84 JNIHandles::oops_do(&mark_and_push_closure);
85 break;
87 case threads:
88 {
89 ResourceMark rm;
90 CodeBlobToOopClosure each_active_code_blob(&mark_and_push_closure, /*do_marking=*/ true);
91 Threads::oops_do(&mark_and_push_closure, &each_active_code_blob);
92 }
93 break;
95 case object_synchronizer:
96 ObjectSynchronizer::oops_do(&mark_and_push_closure);
97 break;
99 case flat_profiler:
100 FlatProfiler::oops_do(&mark_and_push_closure);
101 break;
103 case management:
104 Management::oops_do(&mark_and_push_closure);
105 break;
107 case jvmti:
108 JvmtiExport::oops_do(&mark_and_push_closure);
109 break;
111 case system_dictionary:
112 SystemDictionary::always_strong_oops_do(&mark_and_push_closure);
113 break;
115 case code_cache:
116 // Do not treat nmethods as strong roots for mark/sweep, since we can unload them.
117 //CodeCache::scavenge_root_nmethods_do(CodeBlobToOopClosure(&mark_and_push_closure));
118 break;
120 default:
121 fatal("Unknown root type");
122 }
124 // Do the real work
125 cm->follow_marking_stacks();
126 }
129 //
130 // RefProcTaskProxy
131 //
133 void RefProcTaskProxy::do_it(GCTaskManager* manager, uint which)
134 {
135 assert(Universe::heap()->is_gc_active(), "called outside gc");
137 NOT_PRODUCT(TraceTime tm("RefProcTask",
138 PrintGCDetails && TraceParallelOldGCTasks, true, gclog_or_tty));
139 ParCompactionManager* cm =
140 ParCompactionManager::gc_thread_compaction_manager(which);
141 PSParallelCompact::MarkAndPushClosure mark_and_push_closure(cm);
142 PSParallelCompact::FollowStackClosure follow_stack_closure(cm);
143 _rp_task.work(_work_id, *PSParallelCompact::is_alive_closure(),
144 mark_and_push_closure, follow_stack_closure);
145 }
147 //
148 // RefProcTaskExecutor
149 //
151 void RefProcTaskExecutor::execute(ProcessTask& task)
152 {
153 ParallelScavengeHeap* heap = PSParallelCompact::gc_heap();
154 uint parallel_gc_threads = heap->gc_task_manager()->workers();
155 uint active_gc_threads = heap->gc_task_manager()->active_workers();
156 RegionTaskQueueSet* qset = ParCompactionManager::region_array();
157 ParallelTaskTerminator terminator(active_gc_threads, qset);
158 GCTaskQueue* q = GCTaskQueue::create();
159 for(uint i=0; i<parallel_gc_threads; i++) {
160 q->enqueue(new RefProcTaskProxy(task, i));
161 }
162 if (task.marks_oops_alive()) {
163 if (parallel_gc_threads>1) {
164 for (uint j=0; j<active_gc_threads; j++) {
165 q->enqueue(new StealMarkingTask(&terminator));
166 }
167 }
168 }
169 PSParallelCompact::gc_task_manager()->execute_and_wait(q);
170 }
172 void RefProcTaskExecutor::execute(EnqueueTask& task)
173 {
174 ParallelScavengeHeap* heap = PSParallelCompact::gc_heap();
175 uint parallel_gc_threads = heap->gc_task_manager()->workers();
176 GCTaskQueue* q = GCTaskQueue::create();
177 for(uint i=0; i<parallel_gc_threads; i++) {
178 q->enqueue(new RefEnqueueTaskProxy(task, i));
179 }
180 PSParallelCompact::gc_task_manager()->execute_and_wait(q);
181 }
183 //
184 // StealMarkingTask
185 //
187 StealMarkingTask::StealMarkingTask(ParallelTaskTerminator* t) :
188 _terminator(t) {}
190 void StealMarkingTask::do_it(GCTaskManager* manager, uint which) {
191 assert(Universe::heap()->is_gc_active(), "called outside gc");
193 NOT_PRODUCT(TraceTime tm("StealMarkingTask",
194 PrintGCDetails && TraceParallelOldGCTasks, true, gclog_or_tty));
196 ParCompactionManager* cm =
197 ParCompactionManager::gc_thread_compaction_manager(which);
198 PSParallelCompact::MarkAndPushClosure mark_and_push_closure(cm);
200 oop obj = NULL;
201 ObjArrayTask task;
202 int random_seed = 17;
203 do {
204 while (ParCompactionManager::steal_objarray(which, &random_seed, task)) {
205 objArrayKlass* const k = (objArrayKlass*)task.obj()->blueprint();
206 k->oop_follow_contents(cm, task.obj(), task.index());
207 cm->follow_marking_stacks();
208 }
209 while (ParCompactionManager::steal(which, &random_seed, obj)) {
210 obj->follow_contents(cm);
211 cm->follow_marking_stacks();
212 }
213 } while (!terminator()->offer_termination());
214 }
216 //
217 // StealRegionCompactionTask
218 //
220 StealRegionCompactionTask::StealRegionCompactionTask(ParallelTaskTerminator* t):
221 _terminator(t) {}
223 void StealRegionCompactionTask::do_it(GCTaskManager* manager, uint which) {
224 assert(Universe::heap()->is_gc_active(), "called outside gc");
226 NOT_PRODUCT(TraceTime tm("StealRegionCompactionTask",
227 PrintGCDetails && TraceParallelOldGCTasks, true, gclog_or_tty));
229 ParCompactionManager* cm =
230 ParCompactionManager::gc_thread_compaction_manager(which);
233 // If not all threads are active, get a draining stack
234 // from the list. Else, just use this threads draining stack.
235 uint which_stack_index;
236 bool use_all_workers = manager->all_workers_active();
237 if (use_all_workers) {
238 which_stack_index = which;
239 assert(manager->active_workers() == ParallelGCThreads,
240 err_msg("all_workers_active has been incorrectly set: "
241 " active %d ParallelGCThreads %d", manager->active_workers(),
242 ParallelGCThreads));
243 } else {
244 which_stack_index = ParCompactionManager::pop_recycled_stack_index();
245 }
247 cm->set_region_stack_index(which_stack_index);
248 cm->set_region_stack(ParCompactionManager::region_list(which_stack_index));
249 if (TraceDynamicGCThreads) {
250 gclog_or_tty->print_cr("StealRegionCompactionTask::do_it "
251 "region_stack_index %d region_stack = 0x%x "
252 " empty (%d) use all workers %d",
253 which_stack_index, ParCompactionManager::region_list(which_stack_index),
254 cm->region_stack()->is_empty(),
255 use_all_workers);
256 }
258 // Has to drain stacks first because there may be regions on
259 // preloaded onto the stack and this thread may never have
260 // done a draining task. Are the draining tasks needed?
262 cm->drain_region_stacks();
264 size_t region_index = 0;
265 int random_seed = 17;
267 // If we're the termination task, try 10 rounds of stealing before
268 // setting the termination flag
270 while(true) {
271 if (ParCompactionManager::steal(which, &random_seed, region_index)) {
272 PSParallelCompact::fill_and_update_region(cm, region_index);
273 cm->drain_region_stacks();
274 } else {
275 if (terminator()->offer_termination()) {
276 break;
277 }
278 // Go around again.
279 }
280 }
281 return;
282 }
284 UpdateDensePrefixTask::UpdateDensePrefixTask(
285 PSParallelCompact::SpaceId space_id,
286 size_t region_index_start,
287 size_t region_index_end) :
288 _space_id(space_id), _region_index_start(region_index_start),
289 _region_index_end(region_index_end) {}
291 void UpdateDensePrefixTask::do_it(GCTaskManager* manager, uint which) {
293 NOT_PRODUCT(TraceTime tm("UpdateDensePrefixTask",
294 PrintGCDetails && TraceParallelOldGCTasks, true, gclog_or_tty));
296 ParCompactionManager* cm =
297 ParCompactionManager::gc_thread_compaction_manager(which);
299 PSParallelCompact::update_and_deadwood_in_dense_prefix(cm,
300 _space_id,
301 _region_index_start,
302 _region_index_end);
303 }
305 void DrainStacksCompactionTask::do_it(GCTaskManager* manager, uint which) {
306 assert(Universe::heap()->is_gc_active(), "called outside gc");
308 NOT_PRODUCT(TraceTime tm("DrainStacksCompactionTask",
309 PrintGCDetails && TraceParallelOldGCTasks, true, gclog_or_tty));
311 ParCompactionManager* cm =
312 ParCompactionManager::gc_thread_compaction_manager(which);
314 uint which_stack_index;
315 bool use_all_workers = manager->all_workers_active();
316 if (use_all_workers) {
317 which_stack_index = which;
318 assert(manager->active_workers() == ParallelGCThreads,
319 err_msg("all_workers_active has been incorrectly set: "
320 " active %d ParallelGCThreads %d", manager->active_workers(),
321 ParallelGCThreads));
322 } else {
323 which_stack_index = stack_index();
324 }
326 cm->set_region_stack(ParCompactionManager::region_list(which_stack_index));
327 if (TraceDynamicGCThreads) {
328 gclog_or_tty->print_cr("DrainStacksCompactionTask::do_it which = %d "
329 "which_stack_index = %d/empty(%d) "
330 "use all workers %d",
331 which, which_stack_index,
332 cm->region_stack()->is_empty(),
333 use_all_workers);
334 }
336 cm->set_region_stack_index(which_stack_index);
338 // Process any regions already in the compaction managers stacks.
339 cm->drain_region_stacks();
341 assert(cm->region_stack()->is_empty(), "Not empty");
343 if (!use_all_workers) {
344 // Always give up the region stack.
345 assert(cm->region_stack() ==
346 ParCompactionManager::region_list(cm->region_stack_index()),
347 "region_stack and region_stack_index are inconsistent");
348 ParCompactionManager::push_recycled_stack_index(cm->region_stack_index());
350 if (TraceDynamicGCThreads) {
351 void* old_region_stack = (void*) cm->region_stack();
352 int old_region_stack_index = cm->region_stack_index();
353 gclog_or_tty->print_cr("Pushing region stack 0x%x/%d",
354 old_region_stack, old_region_stack_index);
355 }
357 cm->set_region_stack(NULL);
358 cm->set_region_stack_index((uint)max_uintx);
359 }
360 }