Mercurial > hg > truffle
annotate src/share/vm/gc_implementation/parallelScavenge/psTasks.cpp @ 210:05712c37c828
6676016: ParallelOldGC leaks memory
Summary: ensure that GCTask threads release resource and handle memory
Reviewed-by: jmasa, chrisphi
| author | jcoomes |
|---|---|
| date | Wed, 18 Jun 2008 18:36:47 -0700 |
| parents | ba764ed4b6f2 |
| children | d1605aabd0a1 |
| rev | line source |
|---|---|
| 0 | 1 /* |
| 2 * Copyright 2002-2006 Sun Microsystems, Inc. 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 Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, | |
| 20 * CA 95054 USA or visit www.sun.com if you need additional information or | |
| 21 * have any questions. | |
| 22 * | |
| 23 */ | |
| 24 | |
| 25 #include "incls/_precompiled.incl" | |
| 26 #include "incls/_psTasks.cpp.incl" | |
| 27 | |
| 28 // | |
| 29 // ScavengeRootsTask | |
| 30 // | |
| 31 | |
| 32 // Define before use | |
| 33 class PSScavengeRootsClosure: public OopClosure { | |
| 34 private: | |
| 35 PSPromotionManager* _promotion_manager; | |
| 36 | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
37 protected: |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
38 template <class T> void do_oop_work(T *p) { |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
39 if (PSScavenge::should_scavenge(p)) { |
| 0 | 40 // We never card mark roots, maybe call a func without test? |
| 41 PSScavenge::copy_and_push_safe_barrier(_promotion_manager, p); | |
| 42 } | |
| 43 } | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
44 public: |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
45 PSScavengeRootsClosure(PSPromotionManager* pm) : _promotion_manager(pm) { } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
46 void do_oop(oop* p) { PSScavengeRootsClosure::do_oop_work(p); } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
47 void do_oop(narrowOop* p) { PSScavengeRootsClosure::do_oop_work(p); } |
| 0 | 48 }; |
| 49 | |
| 50 void ScavengeRootsTask::do_it(GCTaskManager* manager, uint which) { | |
| 51 assert(Universe::heap()->is_gc_active(), "called outside gc"); | |
| 52 | |
| 53 PSPromotionManager* pm = PSPromotionManager::gc_thread_promotion_manager(which); | |
| 54 PSScavengeRootsClosure roots_closure(pm); | |
| 55 | |
| 56 switch (_root_type) { | |
| 57 case universe: | |
| 58 Universe::oops_do(&roots_closure); | |
| 59 ReferenceProcessor::oops_do(&roots_closure); | |
| 60 break; | |
| 61 | |
| 62 case jni_handles: | |
| 63 JNIHandles::oops_do(&roots_closure); | |
| 64 break; | |
| 65 | |
| 66 case threads: | |
| 67 { | |
| 68 ResourceMark rm; | |
| 69 Threads::oops_do(&roots_closure); | |
| 70 } | |
| 71 break; | |
| 72 | |
| 73 case object_synchronizer: | |
| 74 ObjectSynchronizer::oops_do(&roots_closure); | |
| 75 break; | |
| 76 | |
| 77 case flat_profiler: | |
| 78 FlatProfiler::oops_do(&roots_closure); | |
| 79 break; | |
| 80 | |
| 81 case system_dictionary: | |
| 82 SystemDictionary::oops_do(&roots_closure); | |
| 83 break; | |
| 84 | |
| 85 case management: | |
| 86 Management::oops_do(&roots_closure); | |
| 87 break; | |
| 88 | |
| 89 case jvmti: | |
| 90 JvmtiExport::oops_do(&roots_closure); | |
| 91 break; | |
| 92 | |
| 93 default: | |
| 94 fatal("Unknown root type"); | |
| 95 } | |
| 96 | |
| 97 // Do the real work | |
| 98 pm->drain_stacks(false); | |
| 99 } | |
| 100 | |
| 101 // | |
| 102 // ThreadRootsTask | |
| 103 // | |
| 104 | |
| 105 void ThreadRootsTask::do_it(GCTaskManager* manager, uint which) { | |
| 106 assert(Universe::heap()->is_gc_active(), "called outside gc"); | |
| 107 | |
| 108 PSPromotionManager* pm = PSPromotionManager::gc_thread_promotion_manager(which); | |
| 109 PSScavengeRootsClosure roots_closure(pm); | |
| 110 | |
| 111 if (_java_thread != NULL) | |
| 112 _java_thread->oops_do(&roots_closure); | |
| 113 | |
| 114 if (_vm_thread != NULL) | |
| 115 _vm_thread->oops_do(&roots_closure); | |
| 116 | |
| 117 // Do the real work | |
| 118 pm->drain_stacks(false); | |
| 119 } | |
| 120 | |
| 121 // | |
| 122 // StealTask | |
| 123 // | |
| 124 | |
| 125 StealTask::StealTask(ParallelTaskTerminator* t) : | |
| 126 _terminator(t) {} | |
| 127 | |
| 128 void StealTask::do_it(GCTaskManager* manager, uint which) { | |
| 129 assert(Universe::heap()->is_gc_active(), "called outside gc"); | |
| 130 | |
| 131 PSPromotionManager* pm = | |
| 132 PSPromotionManager::gc_thread_promotion_manager(which); | |
| 133 pm->drain_stacks(true); | |
| 134 guarantee(pm->stacks_empty(), | |
| 135 "stacks should be empty at this point"); | |
| 136 | |
| 137 int random_seed = 17; | |
| 138 if (pm->depth_first()) { | |
| 139 while(true) { | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
140 StarTask p; |
| 0 | 141 if (PSPromotionManager::steal_depth(which, &random_seed, p)) { |
| 142 #if PS_PM_STATS | |
| 143 pm->increment_steals(p); | |
| 144 #endif // PS_PM_STATS | |
| 145 pm->process_popped_location_depth(p); | |
| 146 pm->drain_stacks_depth(true); | |
| 147 } else { | |
| 148 if (terminator()->offer_termination()) { | |
| 149 break; | |
| 150 } | |
| 151 } | |
| 152 } | |
| 153 } else { | |
| 154 while(true) { | |
| 155 oop obj; | |
| 156 if (PSPromotionManager::steal_breadth(which, &random_seed, obj)) { | |
| 157 #if PS_PM_STATS | |
| 158 pm->increment_steals(); | |
| 159 #endif // PS_PM_STATS | |
| 160 obj->copy_contents(pm); | |
| 161 pm->drain_stacks_breadth(true); | |
| 162 } else { | |
| 163 if (terminator()->offer_termination()) { | |
| 164 break; | |
| 165 } | |
| 166 } | |
| 167 } | |
| 168 } | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
169 guarantee(pm->stacks_empty(), "stacks should be empty at this point"); |
| 0 | 170 } |
| 171 | |
| 172 // | |
| 173 // SerialOldToYoungRootsTask | |
| 174 // | |
| 175 | |
| 176 void SerialOldToYoungRootsTask::do_it(GCTaskManager* manager, uint which) { | |
| 177 assert(_gen != NULL, "Sanity"); | |
| 178 assert(_gen->object_space()->contains(_gen_top) || _gen_top == _gen->object_space()->top(), "Sanity"); | |
| 179 | |
| 180 { | |
| 181 PSPromotionManager* pm = PSPromotionManager::gc_thread_promotion_manager(which); | |
| 182 | |
| 183 assert(Universe::heap()->kind() == CollectedHeap::ParallelScavengeHeap, "Sanity"); | |
| 184 CardTableExtension* card_table = (CardTableExtension *)Universe::heap()->barrier_set(); | |
| 185 // FIX ME! Assert that card_table is the type we believe it to be. | |
| 186 | |
| 187 card_table->scavenge_contents(_gen->start_array(), | |
| 188 _gen->object_space(), | |
| 189 _gen_top, | |
| 190 pm); | |
| 191 | |
| 192 // Do the real work | |
| 193 pm->drain_stacks(false); | |
| 194 } | |
| 195 } | |
| 196 | |
| 197 // | |
| 198 // OldToYoungRootsTask | |
| 199 // | |
| 200 | |
| 201 void OldToYoungRootsTask::do_it(GCTaskManager* manager, uint which) { | |
| 202 assert(_gen != NULL, "Sanity"); | |
| 203 assert(_gen->object_space()->contains(_gen_top) || _gen_top == _gen->object_space()->top(), "Sanity"); | |
| 204 assert(_stripe_number < ParallelGCThreads, "Sanity"); | |
| 205 | |
| 206 { | |
| 207 PSPromotionManager* pm = PSPromotionManager::gc_thread_promotion_manager(which); | |
| 208 | |
| 209 assert(Universe::heap()->kind() == CollectedHeap::ParallelScavengeHeap, "Sanity"); | |
| 210 CardTableExtension* card_table = (CardTableExtension *)Universe::heap()->barrier_set(); | |
| 211 // FIX ME! Assert that card_table is the type we believe it to be. | |
| 212 | |
| 213 card_table->scavenge_contents_parallel(_gen->start_array(), | |
| 214 _gen->object_space(), | |
| 215 _gen_top, | |
| 216 pm, | |
| 217 _stripe_number); | |
| 218 | |
| 219 // Do the real work | |
| 220 pm->drain_stacks(false); | |
| 221 } | |
| 222 } |