Mercurial > hg > truffle
annotate src/share/vm/gc_implementation/shared/markSweep.cpp @ 1311:2a1472c30599
4396719: Mark Sweep stack overflow on deeply nested Object arrays
Summary: Use an explicit stack for object arrays and process them in chunks.
Reviewed-by: iveresov, apetrusenko
| author | jcoomes |
|---|---|
| date | Wed, 03 Mar 2010 14:48:26 -0800 |
| parents | a1423fe86a18 |
| children | c385bf94cfb8 |
| rev | line source |
|---|---|
| 0 | 1 /* |
| 948 | 2 * Copyright 1997-2009 Sun Microsystems, Inc. All Rights Reserved. |
| 0 | 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/_markSweep.cpp.incl" | |
| 27 | |
|
1311
2a1472c30599
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
1000
diff
changeset
|
28 GrowableArray<oop>* MarkSweep::_marking_stack = NULL; |
|
2a1472c30599
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
1000
diff
changeset
|
29 GrowableArray<ObjArrayTask>* MarkSweep::_objarray_stack = NULL; |
|
2a1472c30599
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
1000
diff
changeset
|
30 GrowableArray<Klass*>* MarkSweep::_revisit_klass_stack = NULL; |
| 941 | 31 GrowableArray<DataLayout*>* MarkSweep::_revisit_mdo_stack = NULL; |
| 0 | 32 |
| 33 GrowableArray<oop>* MarkSweep::_preserved_oop_stack = NULL; | |
| 34 GrowableArray<markOop>* MarkSweep::_preserved_mark_stack= NULL; | |
| 35 size_t MarkSweep::_preserved_count = 0; | |
| 36 size_t MarkSweep::_preserved_count_max = 0; | |
| 37 PreservedMark* MarkSweep::_preserved_marks = NULL; | |
| 38 ReferenceProcessor* MarkSweep::_ref_processor = NULL; | |
| 39 | |
| 40 #ifdef VALIDATE_MARK_SWEEP | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
41 GrowableArray<void*>* MarkSweep::_root_refs_stack = NULL; |
| 0 | 42 GrowableArray<oop> * MarkSweep::_live_oops = NULL; |
| 43 GrowableArray<oop> * MarkSweep::_live_oops_moved_to = NULL; | |
| 44 GrowableArray<size_t>* MarkSweep::_live_oops_size = NULL; | |
| 45 size_t MarkSweep::_live_oops_index = 0; | |
| 46 size_t MarkSweep::_live_oops_index_at_perm = 0; | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
47 GrowableArray<void*>* MarkSweep::_other_refs_stack = NULL; |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
48 GrowableArray<void*>* MarkSweep::_adjusted_pointers = NULL; |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
49 bool MarkSweep::_pointer_tracking = false; |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
50 bool MarkSweep::_root_tracking = true; |
| 0 | 51 |
| 52 GrowableArray<HeapWord*>* MarkSweep::_cur_gc_live_oops = NULL; | |
| 53 GrowableArray<HeapWord*>* MarkSweep::_cur_gc_live_oops_moved_to = NULL; | |
| 54 GrowableArray<size_t> * MarkSweep::_cur_gc_live_oops_size = NULL; | |
| 55 GrowableArray<HeapWord*>* MarkSweep::_last_gc_live_oops = NULL; | |
| 56 GrowableArray<HeapWord*>* MarkSweep::_last_gc_live_oops_moved_to = NULL; | |
| 57 GrowableArray<size_t> * MarkSweep::_last_gc_live_oops_size = NULL; | |
| 58 #endif | |
| 59 | |
| 60 void MarkSweep::revisit_weak_klass_link(Klass* k) { | |
| 61 _revisit_klass_stack->push(k); | |
| 62 } | |
| 63 | |
| 64 void MarkSweep::follow_weak_klass_links() { | |
| 65 // All klasses on the revisit stack are marked at this point. | |
| 66 // Update and follow all subklass, sibling and implementor links. | |
| 941 | 67 if (PrintRevisitStats) { |
| 68 gclog_or_tty->print_cr("#classes in system dictionary = %d", SystemDictionary::number_of_classes()); | |
| 69 gclog_or_tty->print_cr("Revisit klass stack length = %d", _revisit_klass_stack->length()); | |
| 70 } | |
| 0 | 71 for (int i = 0; i < _revisit_klass_stack->length(); i++) { |
| 72 _revisit_klass_stack->at(i)->follow_weak_klass_links(&is_alive,&keep_alive); | |
| 73 } | |
| 74 follow_stack(); | |
| 75 } | |
| 76 | |
| 941 | 77 void MarkSweep::revisit_mdo(DataLayout* p) { |
| 78 _revisit_mdo_stack->push(p); | |
| 79 } | |
| 80 | |
| 81 void MarkSweep::follow_mdo_weak_refs() { | |
| 82 // All strongly reachable oops have been marked at this point; | |
| 83 // we can visit and clear any weak references from MDO's which | |
| 84 // we memoized during the strong marking phase. | |
| 85 assert(_marking_stack->is_empty(), "Marking stack should be empty"); | |
| 86 if (PrintRevisitStats) { | |
| 87 gclog_or_tty->print_cr("#classes in system dictionary = %d", SystemDictionary::number_of_classes()); | |
| 88 gclog_or_tty->print_cr("Revisit MDO stack length = %d", _revisit_mdo_stack->length()); | |
| 89 } | |
| 90 for (int i = 0; i < _revisit_mdo_stack->length(); i++) { | |
| 91 _revisit_mdo_stack->at(i)->follow_weak_refs(&is_alive); | |
| 92 } | |
| 93 follow_stack(); | |
| 94 } | |
| 95 | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
96 MarkSweep::FollowRootClosure MarkSweep::follow_root_closure; |
|
989
148e5441d916
6863023: need non-perm oops in code cache for JSR 292
jrose
parents:
196
diff
changeset
|
97 CodeBlobToOopClosure MarkSweep::follow_code_root_closure(&MarkSweep::follow_root_closure, /*do_marking=*/ true); |
| 0 | 98 |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
99 void MarkSweep::FollowRootClosure::do_oop(oop* p) { follow_root(p); } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
100 void MarkSweep::FollowRootClosure::do_oop(narrowOop* p) { follow_root(p); } |
| 0 | 101 |
| 102 MarkSweep::MarkAndPushClosure MarkSweep::mark_and_push_closure; | |
| 103 | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
104 void MarkSweep::MarkAndPushClosure::do_oop(oop* p) { mark_and_push(p); } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
105 void MarkSweep::MarkAndPushClosure::do_oop(narrowOop* p) { mark_and_push(p); } |
| 0 | 106 |
| 107 void MarkSweep::follow_stack() { | |
|
1311
2a1472c30599
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
1000
diff
changeset
|
108 do { |
|
2a1472c30599
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
1000
diff
changeset
|
109 while (!_marking_stack->is_empty()) { |
|
2a1472c30599
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
1000
diff
changeset
|
110 oop obj = _marking_stack->pop(); |
|
2a1472c30599
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
1000
diff
changeset
|
111 assert (obj->is_gc_marked(), "p must be marked"); |
|
2a1472c30599
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
1000
diff
changeset
|
112 obj->follow_contents(); |
|
2a1472c30599
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
1000
diff
changeset
|
113 } |
|
2a1472c30599
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
1000
diff
changeset
|
114 while (!_objarray_stack->is_empty()) { |
|
2a1472c30599
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
1000
diff
changeset
|
115 ObjArrayTask task = _objarray_stack->pop(); |
|
2a1472c30599
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
1000
diff
changeset
|
116 objArrayKlass* const k = (objArrayKlass*)task.obj()->blueprint(); |
|
2a1472c30599
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
1000
diff
changeset
|
117 k->oop_follow_contents(task.obj(), task.index()); |
|
2a1472c30599
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
1000
diff
changeset
|
118 } |
|
2a1472c30599
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
1000
diff
changeset
|
119 } while (!_marking_stack->is_empty() || !_objarray_stack->is_empty()); |
| 0 | 120 } |
| 121 | |
| 122 MarkSweep::FollowStackClosure MarkSweep::follow_stack_closure; | |
| 123 | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
124 void MarkSweep::FollowStackClosure::do_void() { follow_stack(); } |
| 0 | 125 |
| 126 // We preserve the mark which should be replaced at the end and the location that it | |
| 127 // will go. Note that the object that this markOop belongs to isn't currently at that | |
| 128 // address but it will be after phase4 | |
| 129 void MarkSweep::preserve_mark(oop obj, markOop mark) { | |
| 130 // we try to store preserved marks in the to space of the new generation since this | |
| 131 // is storage which should be available. Most of the time this should be sufficient | |
| 132 // space for the marks we need to preserve but if it isn't we fall back in using | |
| 133 // GrowableArrays to keep track of the overflow. | |
| 134 if (_preserved_count < _preserved_count_max) { | |
| 135 _preserved_marks[_preserved_count++].init(obj, mark); | |
| 136 } else { | |
| 137 if (_preserved_mark_stack == NULL) { | |
| 138 _preserved_mark_stack = new (ResourceObj::C_HEAP) GrowableArray<markOop>(40, true); | |
| 139 _preserved_oop_stack = new (ResourceObj::C_HEAP) GrowableArray<oop>(40, true); | |
| 140 } | |
| 141 _preserved_mark_stack->push(mark); | |
| 142 _preserved_oop_stack->push(obj); | |
| 143 } | |
| 144 } | |
| 145 | |
| 146 MarkSweep::AdjustPointerClosure MarkSweep::adjust_root_pointer_closure(true); | |
| 147 MarkSweep::AdjustPointerClosure MarkSweep::adjust_pointer_closure(false); | |
| 148 | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
149 void MarkSweep::AdjustPointerClosure::do_oop(oop* p) { adjust_pointer(p, _is_root); } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
150 void MarkSweep::AdjustPointerClosure::do_oop(narrowOop* p) { adjust_pointer(p, _is_root); } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
151 |
| 0 | 152 void MarkSweep::adjust_marks() { |
| 153 assert(_preserved_oop_stack == NULL || | |
| 154 _preserved_oop_stack->length() == _preserved_mark_stack->length(), | |
| 155 "inconsistent preserved oop stacks"); | |
| 156 | |
| 157 // adjust the oops we saved earlier | |
| 158 for (size_t i = 0; i < _preserved_count; i++) { | |
| 159 _preserved_marks[i].adjust_pointer(); | |
| 160 } | |
| 161 | |
| 162 // deal with the overflow stack | |
| 163 if (_preserved_oop_stack) { | |
| 164 for (int i = 0; i < _preserved_oop_stack->length(); i++) { | |
| 165 oop* p = _preserved_oop_stack->adr_at(i); | |
| 166 adjust_pointer(p); | |
| 167 } | |
| 168 } | |
| 169 } | |
| 170 | |
| 171 void MarkSweep::restore_marks() { | |
| 172 assert(_preserved_oop_stack == NULL || | |
| 173 _preserved_oop_stack->length() == _preserved_mark_stack->length(), | |
| 174 "inconsistent preserved oop stacks"); | |
| 175 if (PrintGC && Verbose) { | |
| 176 gclog_or_tty->print_cr("Restoring %d marks", _preserved_count + | |
| 177 (_preserved_oop_stack ? _preserved_oop_stack->length() : 0)); | |
| 178 } | |
| 179 | |
| 180 // restore the marks we saved earlier | |
| 181 for (size_t i = 0; i < _preserved_count; i++) { | |
| 182 _preserved_marks[i].restore(); | |
| 183 } | |
| 184 | |
| 185 // deal with the overflow | |
| 186 if (_preserved_oop_stack) { | |
| 187 for (int i = 0; i < _preserved_oop_stack->length(); i++) { | |
| 188 oop obj = _preserved_oop_stack->at(i); | |
| 189 markOop mark = _preserved_mark_stack->at(i); | |
| 190 obj->set_mark(mark); | |
| 191 } | |
| 192 } | |
| 193 } | |
| 194 | |
| 195 #ifdef VALIDATE_MARK_SWEEP | |
| 196 | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
197 void MarkSweep::track_adjusted_pointer(void* p, bool isroot) { |
| 0 | 198 if (!ValidateMarkSweep) |
| 199 return; | |
| 200 | |
| 201 if (!isroot) { | |
| 202 if (_pointer_tracking) { | |
| 203 guarantee(_adjusted_pointers->contains(p), "should have seen this pointer"); | |
| 204 _adjusted_pointers->remove(p); | |
| 205 } | |
| 206 } else { | |
| 207 ptrdiff_t index = _root_refs_stack->find(p); | |
| 208 if (index != -1) { | |
| 209 int l = _root_refs_stack->length(); | |
| 210 if (l > 0 && l - 1 != index) { | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
211 void* last = _root_refs_stack->pop(); |
| 0 | 212 assert(last != p, "should be different"); |
| 213 _root_refs_stack->at_put(index, last); | |
| 214 } else { | |
| 215 _root_refs_stack->remove(p); | |
| 216 } | |
| 217 } | |
| 218 } | |
| 219 } | |
| 220 | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
221 void MarkSweep::check_adjust_pointer(void* p) { |
| 0 | 222 _adjusted_pointers->push(p); |
| 223 } | |
| 224 | |
| 225 class AdjusterTracker: public OopClosure { | |
| 226 public: | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
227 AdjusterTracker() {} |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
228 void do_oop(oop* o) { MarkSweep::check_adjust_pointer(o); } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
229 void do_oop(narrowOop* o) { MarkSweep::check_adjust_pointer(o); } |
| 0 | 230 }; |
| 231 | |
| 232 void MarkSweep::track_interior_pointers(oop obj) { | |
| 233 if (ValidateMarkSweep) { | |
| 234 _adjusted_pointers->clear(); | |
| 235 _pointer_tracking = true; | |
| 236 | |
| 237 AdjusterTracker checker; | |
| 238 obj->oop_iterate(&checker); | |
| 239 } | |
| 240 } | |
| 241 | |
| 242 void MarkSweep::check_interior_pointers() { | |
| 243 if (ValidateMarkSweep) { | |
| 244 _pointer_tracking = false; | |
| 245 guarantee(_adjusted_pointers->length() == 0, "should have processed the same pointers"); | |
| 246 } | |
| 247 } | |
| 248 | |
| 249 void MarkSweep::reset_live_oop_tracking(bool at_perm) { | |
| 250 if (ValidateMarkSweep) { | |
| 251 guarantee((size_t)_live_oops->length() == _live_oops_index, "should be at end of live oops"); | |
| 252 _live_oops_index = at_perm ? _live_oops_index_at_perm : 0; | |
| 253 } | |
| 254 } | |
| 255 | |
| 256 void MarkSweep::register_live_oop(oop p, size_t size) { | |
| 257 if (ValidateMarkSweep) { | |
| 258 _live_oops->push(p); | |
| 259 _live_oops_size->push(size); | |
| 260 _live_oops_index++; | |
| 261 } | |
| 262 } | |
| 263 | |
| 264 void MarkSweep::validate_live_oop(oop p, size_t size) { | |
| 265 if (ValidateMarkSweep) { | |
| 266 oop obj = _live_oops->at((int)_live_oops_index); | |
| 267 guarantee(obj == p, "should be the same object"); | |
| 268 guarantee(_live_oops_size->at((int)_live_oops_index) == size, "should be the same size"); | |
| 269 _live_oops_index++; | |
| 270 } | |
| 271 } | |
| 272 | |
| 273 void MarkSweep::live_oop_moved_to(HeapWord* q, size_t size, | |
| 274 HeapWord* compaction_top) { | |
| 275 assert(oop(q)->forwardee() == NULL || oop(q)->forwardee() == oop(compaction_top), | |
| 276 "should be moved to forwarded location"); | |
| 277 if (ValidateMarkSweep) { | |
| 278 MarkSweep::validate_live_oop(oop(q), size); | |
| 279 _live_oops_moved_to->push(oop(compaction_top)); | |
| 280 } | |
| 281 if (RecordMarkSweepCompaction) { | |
| 282 _cur_gc_live_oops->push(q); | |
| 283 _cur_gc_live_oops_moved_to->push(compaction_top); | |
| 284 _cur_gc_live_oops_size->push(size); | |
| 285 } | |
| 286 } | |
| 287 | |
| 288 void MarkSweep::compaction_complete() { | |
| 289 if (RecordMarkSweepCompaction) { | |
| 290 GrowableArray<HeapWord*>* _tmp_live_oops = _cur_gc_live_oops; | |
| 291 GrowableArray<HeapWord*>* _tmp_live_oops_moved_to = _cur_gc_live_oops_moved_to; | |
| 292 GrowableArray<size_t> * _tmp_live_oops_size = _cur_gc_live_oops_size; | |
| 293 | |
| 294 _cur_gc_live_oops = _last_gc_live_oops; | |
| 295 _cur_gc_live_oops_moved_to = _last_gc_live_oops_moved_to; | |
| 296 _cur_gc_live_oops_size = _last_gc_live_oops_size; | |
| 297 _last_gc_live_oops = _tmp_live_oops; | |
| 298 _last_gc_live_oops_moved_to = _tmp_live_oops_moved_to; | |
| 299 _last_gc_live_oops_size = _tmp_live_oops_size; | |
| 300 } | |
| 301 } | |
| 302 | |
| 303 void MarkSweep::print_new_location_of_heap_address(HeapWord* q) { | |
| 304 if (!RecordMarkSweepCompaction) { | |
| 305 tty->print_cr("Requires RecordMarkSweepCompaction to be enabled"); | |
| 306 return; | |
| 307 } | |
| 308 | |
| 309 if (_last_gc_live_oops == NULL) { | |
| 310 tty->print_cr("No compaction information gathered yet"); | |
| 311 return; | |
| 312 } | |
| 313 | |
| 314 for (int i = 0; i < _last_gc_live_oops->length(); i++) { | |
| 315 HeapWord* old_oop = _last_gc_live_oops->at(i); | |
| 316 size_t sz = _last_gc_live_oops_size->at(i); | |
| 317 if (old_oop <= q && q < (old_oop + sz)) { | |
| 318 HeapWord* new_oop = _last_gc_live_oops_moved_to->at(i); | |
| 319 size_t offset = (q - old_oop); | |
| 320 tty->print_cr("Address " PTR_FORMAT, q); | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
321 tty->print_cr(" Was in oop " PTR_FORMAT ", size " SIZE_FORMAT ", at offset " SIZE_FORMAT, old_oop, sz, offset); |
| 0 | 322 tty->print_cr(" Now in oop " PTR_FORMAT ", actual address " PTR_FORMAT, new_oop, new_oop + offset); |
| 323 return; | |
| 324 } | |
| 325 } | |
| 326 | |
| 327 tty->print_cr("Address " PTR_FORMAT " not found in live oop information from last GC", q); | |
| 328 } | |
| 329 #endif //VALIDATE_MARK_SWEEP | |
| 330 | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
331 MarkSweep::IsAliveClosure MarkSweep::is_alive; |
| 0 | 332 |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
333 void MarkSweep::IsAliveClosure::do_object(oop p) { ShouldNotReachHere(); } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
334 bool MarkSweep::IsAliveClosure::do_object_b(oop p) { return p->is_gc_marked(); } |
| 0 | 335 |
| 336 MarkSweep::KeepAliveClosure MarkSweep::keep_alive; | |
| 337 | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
338 void MarkSweep::KeepAliveClosure::do_oop(oop* p) { MarkSweep::KeepAliveClosure::do_oop_work(p); } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
339 void MarkSweep::KeepAliveClosure::do_oop(narrowOop* p) { MarkSweep::KeepAliveClosure::do_oop_work(p); } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
340 |
| 0 | 341 void marksweep_init() { /* empty */ } |
| 342 | |
| 343 #ifndef PRODUCT | |
| 344 | |
| 345 void MarkSweep::trace(const char* msg) { | |
| 346 if (TraceMarkSweep) | |
| 347 gclog_or_tty->print("%s", msg); | |
| 348 } | |
| 349 | |
| 350 #endif |