Fri, 25 Sep 2009 12:17:06 -0700
Merge
1 /*
2 * Copyright 2000-2008 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 */
25 inline void MarkSweep::mark_object(oop obj) {
26 // some marks may contain information we need to preserve so we store them away
27 // and overwrite the mark. We'll restore it at the end of markSweep.
28 markOop mark = obj->mark();
29 obj->set_mark(markOopDesc::prototype()->set_marked());
31 if (mark->must_be_preserved(obj)) {
32 preserve_mark(obj, mark);
33 }
34 }
36 template <class T> inline void MarkSweep::follow_root(T* p) {
37 assert(!Universe::heap()->is_in_reserved(p),
38 "roots shouldn't be things within the heap");
39 #ifdef VALIDATE_MARK_SWEEP
40 if (ValidateMarkSweep) {
41 guarantee(!_root_refs_stack->contains(p), "should only be in here once");
42 _root_refs_stack->push(p);
43 }
44 #endif
45 T heap_oop = oopDesc::load_heap_oop(p);
46 if (!oopDesc::is_null(heap_oop)) {
47 oop obj = oopDesc::decode_heap_oop_not_null(heap_oop);
48 if (!obj->mark()->is_marked()) {
49 mark_object(obj);
50 obj->follow_contents();
51 }
52 }
53 follow_stack();
54 }
56 template <class T> inline void MarkSweep::mark_and_follow(T* p) {
57 // assert(Universe::heap()->is_in_reserved(p), "should be in object space");
58 T heap_oop = oopDesc::load_heap_oop(p);
59 if (!oopDesc::is_null(heap_oop)) {
60 oop obj = oopDesc::decode_heap_oop_not_null(heap_oop);
61 if (!obj->mark()->is_marked()) {
62 mark_object(obj);
63 obj->follow_contents();
64 }
65 }
66 }
68 template <class T> inline void MarkSweep::mark_and_push(T* p) {
69 // assert(Universe::heap()->is_in_reserved(p), "should be in object space");
70 T heap_oop = oopDesc::load_heap_oop(p);
71 if (!oopDesc::is_null(heap_oop)) {
72 oop obj = oopDesc::decode_heap_oop_not_null(heap_oop);
73 if (!obj->mark()->is_marked()) {
74 mark_object(obj);
75 _marking_stack->push(obj);
76 }
77 }
78 }
80 template <class T> inline void MarkSweep::adjust_pointer(T* p, bool isroot) {
81 T heap_oop = oopDesc::load_heap_oop(p);
82 if (!oopDesc::is_null(heap_oop)) {
83 oop obj = oopDesc::decode_heap_oop_not_null(heap_oop);
84 oop new_obj = oop(obj->mark()->decode_pointer());
85 assert(new_obj != NULL || // is forwarding ptr?
86 obj->mark() == markOopDesc::prototype() || // not gc marked?
87 (UseBiasedLocking && obj->mark()->has_bias_pattern()) ||
88 // not gc marked?
89 obj->is_shared(), // never forwarded?
90 "should be forwarded");
91 if (new_obj != NULL) {
92 assert(Universe::heap()->is_in_reserved(new_obj),
93 "should be in object space");
94 oopDesc::encode_store_heap_oop_not_null(p, new_obj);
95 }
96 }
97 VALIDATE_MARK_SWEEP_ONLY(track_adjusted_pointer(p, isroot));
98 }
100 template <class T> inline void MarkSweep::KeepAliveClosure::do_oop_work(T* p) {
101 #ifdef VALIDATE_MARK_SWEEP
102 if (ValidateMarkSweep) {
103 if (!Universe::heap()->is_in_reserved(p)) {
104 _root_refs_stack->push(p);
105 } else {
106 _other_refs_stack->push(p);
107 }
108 }
109 #endif
110 mark_and_push(p);
111 }