1 /*
2 * Copyright (c) 2000, 2010, 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 #ifndef SHARE_VM_GC_IMPLEMENTATION_SHARED_MARKSWEEP_INLINE_HPP
26 #define SHARE_VM_GC_IMPLEMENTATION_SHARED_MARKSWEEP_INLINE_HPP
27
28 #include "gc_implementation/shared/markSweep.hpp"
29 #include "gc_interface/collectedHeap.hpp"
30 #ifndef SERIALGC
31 #include "gc_implementation/parallelScavenge/psParallelCompact.hpp"
32 #endif
33
34 inline void MarkSweep::mark_object(oop obj) {
35 // some marks may contain information we need to preserve so we store them away
36 // and overwrite the mark. We'll restore it at the end of markSweep.
37 markOop mark = obj->mark();
38 obj->set_mark(markOopDesc::prototype()->set_marked());
39
40 if (mark->must_be_preserved(obj)) {
41 preserve_mark(obj, mark);
42 }
43 }
44
45 template <class T> inline void MarkSweep::follow_root(T* p) {
46 assert(!Universe::heap()->is_in_reserved(p),
47 "roots shouldn't be things within the heap");
48 #ifdef VALIDATE_MARK_SWEEP
49 if (ValidateMarkSweep) {
50 guarantee(!_root_refs_stack->contains(p), "should only be in here once");
51 _root_refs_stack->push(p);
52 }
53 #endif
54 T heap_oop = oopDesc::load_heap_oop(p);
55 if (!oopDesc::is_null(heap_oop)) {
56 oop obj = oopDesc::decode_heap_oop_not_null(heap_oop);
57 if (!obj->mark()->is_marked()) {
58 mark_object(obj);
59 obj->follow_contents();
60 }
61 }
62 follow_stack();
63 }
64
65 template <class T> inline void MarkSweep::mark_and_follow(T* p) {
66 // assert(Universe::heap()->is_in_reserved(p), "should be in object space");
67 T heap_oop = oopDesc::load_heap_oop(p);
68 if (!oopDesc::is_null(heap_oop)) {
69 oop obj = oopDesc::decode_heap_oop_not_null(heap_oop);
70 if (!obj->mark()->is_marked()) {
71 mark_object(obj);
72 obj->follow_contents();
73 }
74 }
75 }
76
77 template <class T> inline void MarkSweep::mark_and_push(T* p) {
78 // assert(Universe::heap()->is_in_reserved(p), "should be in object space");
79 T heap_oop = oopDesc::load_heap_oop(p);
80 if (!oopDesc::is_null(heap_oop)) {
81 oop obj = oopDesc::decode_heap_oop_not_null(heap_oop);
82 if (!obj->mark()->is_marked()) {
83 mark_object(obj);
84 _marking_stack->push(obj);
85 }
86 }
87 }
88
89 void MarkSweep::push_objarray(oop obj, size_t index) {
90 ObjArrayTask task(obj, index);
91 assert(task.is_valid(), "bad ObjArrayTask");
92 _objarray_stack->push(task);
93 }
94
95 template <class T> inline void MarkSweep::adjust_pointer(T* p, bool isroot) {
96 T heap_oop = oopDesc::load_heap_oop(p);
97 if (!oopDesc::is_null(heap_oop)) {
98 oop obj = oopDesc::decode_heap_oop_not_null(heap_oop);
99 oop new_obj = oop(obj->mark()->decode_pointer());
100 assert(new_obj != NULL || // is forwarding ptr?
101 obj->mark() == markOopDesc::prototype() || // not gc marked?
102 (UseBiasedLocking && obj->mark()->has_bias_pattern()) ||
103 // not gc marked?
104 obj->is_shared(), // never forwarded?
105 "should be forwarded");
106 if (new_obj != NULL) {
107 assert(Universe::heap()->is_in_reserved(new_obj),
108 "should be in object space");
109 oopDesc::encode_store_heap_oop_not_null(p, new_obj);
110 }
111 }
112 VALIDATE_MARK_SWEEP_ONLY(track_adjusted_pointer(p, isroot));
113 }
114
115 template <class T> inline void MarkSweep::KeepAliveClosure::do_oop_work(T* p) {
116 #ifdef VALIDATE_MARK_SWEEP
117 if (ValidateMarkSweep) {
118 if (!Universe::heap()->is_in_reserved(p)) {
119 _root_refs_stack->push(p);
120 } else {
121 _other_refs_stack->push(p);
122 }
123 }
124 #endif
125 mark_and_push(p);
126 }
127
128 #endif // SHARE_VM_GC_IMPLEMENTATION_SHARED_MARKSWEEP_INLINE_HPP