1 /*
2 * Copyright (c) 2007, 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_PARNEW_PAROOPCLOSURES_INLINE_HPP
26 #define SHARE_VM_GC_IMPLEMENTATION_PARNEW_PAROOPCLOSURES_INLINE_HPP
27
28 #include "gc_implementation/parNew/parNewGeneration.hpp"
29 #include "gc_implementation/parNew/parOopClosures.hpp"
30 #include "memory/cardTableRS.hpp"
31
32 template <class T> inline void ParScanWeakRefClosure::do_oop_work(T* p) {
33 assert (!oopDesc::is_null(*p), "null weak reference?");
34 oop obj = oopDesc::load_decode_heap_oop_not_null(p);
35 // weak references are sometimes scanned twice; must check
36 // that to-space doesn't already contain this object
37 if ((HeapWord*)obj < _boundary && !_g->to()->is_in_reserved(obj)) {
38 // we need to ensure that it is copied (see comment in
39 // ParScanClosure::do_oop_work).
40 klassOop objK = obj->klass();
41 markOop m = obj->mark();
42 oop new_obj;
43 if (m->is_marked()) { // Contains forwarding pointer.
44 new_obj = ParNewGeneration::real_forwardee(obj);
45 } else {
46 size_t obj_sz = obj->size_given_klass(objK->klass_part());
47 new_obj = ((ParNewGeneration*)_g)->copy_to_survivor_space(_par_scan_state,
48 obj, obj_sz, m);
49 }
50 oopDesc::encode_store_heap_oop_not_null(p, new_obj);
51 }
52 }
53
54 inline void ParScanWeakRefClosure::do_oop_nv(oop* p) { ParScanWeakRefClosure::do_oop_work(p); }
55 inline void ParScanWeakRefClosure::do_oop_nv(narrowOop* p) { ParScanWeakRefClosure::do_oop_work(p); }
56
57 template <class T> inline void ParScanClosure::par_do_barrier(T* p) {
58 assert(generation()->is_in_reserved(p), "expected ref in generation");
59 assert(!oopDesc::is_null(*p), "expected non-null object");
60 oop obj = oopDesc::load_decode_heap_oop_not_null(p);
61 // If p points to a younger generation, mark the card.
62 if ((HeapWord*)obj < gen_boundary()) {
63 rs()->write_ref_field_gc_par(p, obj);
64 }
65 }
66
67 template <class T>
68 inline void ParScanClosure::do_oop_work(T* p,
69 bool gc_barrier,
70 bool root_scan) {
71 assert((!Universe::heap()->is_in_reserved(p) ||
72 generation()->is_in_reserved(p))
73 && (generation()->level() == 0 || gc_barrier),
74 "The gen must be right, and we must be doing the barrier "
75 "in older generations.");
76 T heap_oop = oopDesc::load_heap_oop(p);
77 if (!oopDesc::is_null(heap_oop)) {
78 oop obj = oopDesc::decode_heap_oop_not_null(heap_oop);
79 if ((HeapWord*)obj < _boundary) {
80 assert(!_g->to()->is_in_reserved(obj), "Scanning field twice?");
81 // OK, we need to ensure that it is copied.
82 // We read the klass and mark in this order, so that we can reliably
83 // get the size of the object: if the mark we read is not a
84 // forwarding pointer, then the klass is valid: the klass is only
85 // overwritten with an overflow next pointer after the object is
86 // forwarded.
87 klassOop objK = obj->klass();
88 markOop m = obj->mark();
89 oop new_obj;
90 if (m->is_marked()) { // Contains forwarding pointer.
91 new_obj = ParNewGeneration::real_forwardee(obj);
92 oopDesc::encode_store_heap_oop_not_null(p, new_obj);
93 } else {
94 size_t obj_sz = obj->size_given_klass(objK->klass_part());
95 new_obj = _g->copy_to_survivor_space(_par_scan_state, obj, obj_sz, m);
96 oopDesc::encode_store_heap_oop_not_null(p, new_obj);
97 if (root_scan) {
98 // This may have pushed an object. If we have a root
99 // category with a lot of roots, can't let the queue get too
100 // full:
101 (void)_par_scan_state->trim_queues(10 * ParallelGCThreads);
102 }
103 }
104 if (gc_barrier) {
105 // Now call parent closure
106 par_do_barrier(p);
107 }
108 }
109 }
110 }
111
112 inline void ParScanWithBarrierClosure::do_oop_nv(oop* p) { ParScanClosure::do_oop_work(p, true, false); }
113 inline void ParScanWithBarrierClosure::do_oop_nv(narrowOop* p) { ParScanClosure::do_oop_work(p, true, false); }
114
115 inline void ParScanWithoutBarrierClosure::do_oop_nv(oop* p) { ParScanClosure::do_oop_work(p, false, false); }
116 inline void ParScanWithoutBarrierClosure::do_oop_nv(narrowOop* p) { ParScanClosure::do_oop_work(p, false, false); }
117
118 #endif // SHARE_VM_GC_IMPLEMENTATION_PARNEW_PAROOPCLOSURES_INLINE_HPP