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