Wed, 23 Jan 2013 13:02:39 -0500
8005915: Unify SERIALGC and INCLUDE_ALTERNATE_GCS
Summary: Rename INCLUDE_ALTERNATE_GCS to INCLUDE_ALL_GCS and replace SERIALGC with INCLUDE_ALL_GCS.
Reviewed-by: coleenp, stefank
1 /*
2 * Copyright (c) 2000, 2012, 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 */
25 #ifndef SHARE_VM_GC_IMPLEMENTATION_SHARED_MARKSWEEP_INLINE_HPP
26 #define SHARE_VM_GC_IMPLEMENTATION_SHARED_MARKSWEEP_INLINE_HPP
28 #include "gc_implementation/shared/markSweep.hpp"
29 #include "gc_interface/collectedHeap.hpp"
30 #include "utilities/stack.inline.hpp"
31 #include "utilities/macros.hpp"
32 #if INCLUDE_ALL_GCS
33 #include "gc_implementation/parallelScavenge/psParallelCompact.hpp"
34 #endif // INCLUDE_ALL_GCS
36 inline void MarkSweep::mark_object(oop obj) {
37 // some marks may contain information we need to preserve so we store them away
38 // and overwrite the mark. We'll restore it at the end of markSweep.
39 markOop mark = obj->mark();
40 obj->set_mark(markOopDesc::prototype()->set_marked());
42 if (mark->must_be_preserved(obj)) {
43 preserve_mark(obj, mark);
44 }
45 }
47 template <class T> inline void MarkSweep::follow_root(T* p) {
48 assert(!Universe::heap()->is_in_reserved(p),
49 "roots shouldn't be things within the heap");
50 T heap_oop = oopDesc::load_heap_oop(p);
51 if (!oopDesc::is_null(heap_oop)) {
52 oop obj = oopDesc::decode_heap_oop_not_null(heap_oop);
53 if (!obj->mark()->is_marked()) {
54 mark_object(obj);
55 obj->follow_contents();
56 }
57 }
58 follow_stack();
59 }
61 template <class T> inline void MarkSweep::mark_and_push(T* p) {
62 // assert(Universe::heap()->is_in_reserved(p), "should be in object space");
63 T heap_oop = oopDesc::load_heap_oop(p);
64 if (!oopDesc::is_null(heap_oop)) {
65 oop obj = oopDesc::decode_heap_oop_not_null(heap_oop);
66 if (!obj->mark()->is_marked()) {
67 mark_object(obj);
68 _marking_stack.push(obj);
69 }
70 }
71 }
73 void MarkSweep::push_objarray(oop obj, size_t index) {
74 ObjArrayTask task(obj, index);
75 assert(task.is_valid(), "bad ObjArrayTask");
76 _objarray_stack.push(task);
77 }
79 template <class T> inline void MarkSweep::adjust_pointer(T* p, bool isroot) {
80 T heap_oop = oopDesc::load_heap_oop(p);
81 if (!oopDesc::is_null(heap_oop)) {
82 oop obj = oopDesc::decode_heap_oop_not_null(heap_oop);
83 oop new_obj = oop(obj->mark()->decode_pointer());
84 assert(new_obj != NULL || // is forwarding ptr?
85 obj->mark() == markOopDesc::prototype() || // not gc marked?
86 (UseBiasedLocking && obj->mark()->has_bias_pattern()),
87 // not gc marked?
88 "should be forwarded");
89 if (new_obj != NULL) {
90 assert(Universe::heap()->is_in_reserved(new_obj),
91 "should be in object space");
92 oopDesc::encode_store_heap_oop_not_null(p, new_obj);
93 }
94 }
95 }
97 template <class T> inline void MarkSweep::KeepAliveClosure::do_oop_work(T* p) {
98 mark_and_push(p);
99 }
101 #endif // SHARE_VM_GC_IMPLEMENTATION_SHARED_MARKSWEEP_INLINE_HPP