1 /*
2 * Copyright (c) 2000, 2014, 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 #include "oops/markOop.inline.hpp"
31 #include "utilities/stack.inline.hpp"
32 #include "utilities/macros.hpp"
33 #if INCLUDE_ALL_GCS
34 #include "gc_implementation/g1/g1StringDedup.hpp"
35 #include "gc_implementation/parallelScavenge/psParallelCompact.hpp"
36 #endif // INCLUDE_ALL_GCS
37
38 inline void MarkSweep::mark_object(oop obj) {
39 #if INCLUDE_ALL_GCS
40 if (G1StringDedup::is_enabled()) {
41 // We must enqueue the object before it is marked
42 // as we otherwise can't read the object's age.
43 G1StringDedup::enqueue_from_mark(obj);
44 }
45 #endif
46 // some marks may contain information we need to preserve so we store them away
47 // and overwrite the mark. We'll restore it at the end of markSweep.
48 markOop mark = obj->mark();
49 obj->set_mark(markOopDesc::prototype()->set_marked());
50
51 if (mark->must_be_preserved(obj)) {
52 preserve_mark(obj, mark);
53 }
54 }
55
56 inline void MarkSweep::follow_klass(Klass* klass) {
57 oop op = klass->klass_holder();
58 MarkSweep::mark_and_push(&op);
59 }
60
61 template <class T> inline void MarkSweep::follow_root(T* p) {
62 assert(!Universe::heap()->is_in_reserved(p),
63 "roots shouldn't be things within the heap");
64 T heap_oop = oopDesc::load_heap_oop(p);
65 if (!oopDesc::is_null(heap_oop)) {
66 oop obj = oopDesc::decode_heap_oop_not_null(heap_oop);
67 if (!obj->mark()->is_marked()) {
68 mark_object(obj);
69 obj->follow_contents();
70 }
71 }
72 follow_stack();
73 }
74
75 template <class T> inline void MarkSweep::mark_and_push(T* p) {
76 // assert(Universe::heap()->is_in_reserved(p), "should be in object space");
77 T heap_oop = oopDesc::load_heap_oop(p);
78 if (!oopDesc::is_null(heap_oop)) {
79 oop obj = oopDesc::decode_heap_oop_not_null(heap_oop);
80 if (!obj->mark()->is_marked()) {
81 mark_object(obj);
82 _marking_stack.push(obj);
83 }
84 }
85 }
86
87 void MarkSweep::push_objarray(oop obj, size_t index) {
88 ObjArrayTask task(obj, index);
89 assert(task.is_valid(), "bad ObjArrayTask");
90 _objarray_stack.push(task);
91 }
92
93 template <class T> inline void MarkSweep::adjust_pointer(T* p) {
94 T heap_oop = oopDesc::load_heap_oop(p);
95 if (!oopDesc::is_null(heap_oop)) {
96 oop obj = oopDesc::decode_heap_oop_not_null(heap_oop);
97 oop new_obj = oop(obj->mark()->decode_pointer());
98 assert(new_obj != NULL || // is forwarding ptr?
99 obj->mark() == markOopDesc::prototype() || // not gc marked?
100 (UseBiasedLocking && obj->mark()->has_bias_pattern()),
101 // not gc marked?
102 "should be forwarded");
103 if (new_obj != NULL) {
104 assert(Universe::heap()->is_in_reserved(new_obj),
105 "should be in object space");
106 oopDesc::encode_store_heap_oop_not_null(p, new_obj);
107 }
108 }
109 }
110
111 template <class T> inline void MarkSweep::KeepAliveClosure::do_oop_work(T* p) {
112 mark_and_push(p);
113 }
114
115 #endif // SHARE_VM_GC_IMPLEMENTATION_SHARED_MARKSWEEP_INLINE_HPP