1 /*
2 * Copyright (c) 2001, 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_G1_G1OOPCLOSURES_INLINE_HPP
26 #define SHARE_VM_GC_IMPLEMENTATION_G1_G1OOPCLOSURES_INLINE_HPP
27
28 #include "gc_implementation/g1/concurrentMark.inline.hpp"
29 #include "gc_implementation/g1/g1CollectedHeap.hpp"
30 #include "gc_implementation/g1/g1OopClosures.hpp"
31 #include "gc_implementation/g1/g1ParScanThreadState.inline.hpp"
32 #include "gc_implementation/g1/g1RemSet.hpp"
33 #include "gc_implementation/g1/g1RemSet.inline.hpp"
34 #include "gc_implementation/g1/heapRegionRemSet.hpp"
35 #include "runtime/prefetch.inline.hpp"
36
37 /*
38 * This really ought to be an inline function, but apparently the C++
39 * compiler sometimes sees fit to ignore inline declarations. Sigh.
40 */
41
42 template <class T>
43 inline void FilterIntoCSClosure::do_oop_nv(T* p) {
44 T heap_oop = oopDesc::load_heap_oop(p);
45 if (!oopDesc::is_null(heap_oop) &&
46 _g1->obj_in_cs(oopDesc::decode_heap_oop_not_null(heap_oop))) {
47 _oc->do_oop(p);
48 }
49 }
50
51 template <class T>
52 inline void FilterOutOfRegionClosure::do_oop_nv(T* p) {
53 T heap_oop = oopDesc::load_heap_oop(p);
54 if (!oopDesc::is_null(heap_oop)) {
55 HeapWord* obj_hw = (HeapWord*)oopDesc::decode_heap_oop_not_null(heap_oop);
56 if (obj_hw < _r_bottom || obj_hw >= _r_end) {
57 _oc->do_oop(p);
58 }
59 }
60 }
61
62 // This closure is applied to the fields of the objects that have just been copied.
63 template <class T>
64 inline void G1ParScanClosure::do_oop_nv(T* p) {
65 T heap_oop = oopDesc::load_heap_oop(p);
66
67 if (!oopDesc::is_null(heap_oop)) {
68 oop obj = oopDesc::decode_heap_oop_not_null(heap_oop);
69 if (_g1->in_cset_fast_test(obj)) {
70 // We're not going to even bother checking whether the object is
71 // already forwarded or not, as this usually causes an immediate
72 // stall. We'll try to prefetch the object (for write, given that
73 // we might need to install the forwarding reference) and we'll
74 // get back to it when pop it from the queue
75 Prefetch::write(obj->mark_addr(), 0);
76 Prefetch::read(obj->mark_addr(), (HeapWordSize*2));
77
78 // slightly paranoid test; I'm trying to catch potential
79 // problems before we go into push_on_queue to know where the
80 // problem is coming from
81 assert((obj == oopDesc::load_decode_heap_oop(p)) ||
82 (obj->is_forwarded() &&
83 obj->forwardee() == oopDesc::load_decode_heap_oop(p)),
84 "p should still be pointing to obj or to its forwardee");
85
86 _par_scan_state->push_on_queue(p);
87 } else {
88 _par_scan_state->update_rs(_from, p, _worker_id);
89 }
90 }
91 }
92
93 template <class T>
94 inline void G1ParPushHeapRSClosure::do_oop_nv(T* p) {
95 T heap_oop = oopDesc::load_heap_oop(p);
96
97 if (!oopDesc::is_null(heap_oop)) {
98 oop obj = oopDesc::decode_heap_oop_not_null(heap_oop);
99 if (_g1->in_cset_fast_test(obj)) {
100 Prefetch::write(obj->mark_addr(), 0);
101 Prefetch::read(obj->mark_addr(), (HeapWordSize*2));
102
103 // Place on the references queue
104 _par_scan_state->push_on_queue(p);
105 }
106 }
107 }
108
109 template <class T>
110 inline void G1CMOopClosure::do_oop_nv(T* p) {
111 assert(_g1h->is_in_g1_reserved((HeapWord*) p), "invariant");
112 assert(!_g1h->is_on_master_free_list(
113 _g1h->heap_region_containing((HeapWord*) p)), "invariant");
114
115 oop obj = oopDesc::load_decode_heap_oop(p);
116 if (_cm->verbose_high()) {
117 gclog_or_tty->print_cr("[%u] we're looking at location "
118 "*"PTR_FORMAT" = "PTR_FORMAT,
119 _task->worker_id(), p2i(p), p2i((void*) obj));
120 }
121 _task->deal_with_reference(obj);
122 }
123
124 template <class T>
125 inline void G1RootRegionScanClosure::do_oop_nv(T* p) {
126 T heap_oop = oopDesc::load_heap_oop(p);
127 if (!oopDesc::is_null(heap_oop)) {
128 oop obj = oopDesc::decode_heap_oop_not_null(heap_oop);
129 HeapRegion* hr = _g1h->heap_region_containing((HeapWord*) obj);
130 if (hr != NULL) {
131 _cm->grayRoot(obj, obj->size(), _worker_id, hr);
132 }
133 }
134 }
135
136 template <class T>
137 inline void G1Mux2Closure::do_oop_nv(T* p) {
138 // Apply first closure; then apply the second.
139 _c1->do_oop(p);
140 _c2->do_oop(p);
141 }
142
143 template <class T>
144 inline void G1TriggerClosure::do_oop_nv(T* p) {
145 // Record that this closure was actually applied (triggered).
146 _triggered = true;
147 }
148
149 template <class T>
150 inline void G1InvokeIfNotTriggeredClosure::do_oop_nv(T* p) {
151 if (!_trigger_cl->triggered()) {
152 _oop_cl->do_oop(p);
153 }
154 }
155
156 template <class T>
157 inline void G1UpdateRSOrPushRefOopClosure::do_oop_nv(T* p) {
158 oop obj = oopDesc::load_decode_heap_oop(p);
159 #ifdef ASSERT
160 // can't do because of races
161 // assert(obj == NULL || obj->is_oop(), "expected an oop");
162
163 // Do the safe subset of is_oop
164 if (obj != NULL) {
165 #ifdef CHECK_UNHANDLED_OOPS
166 oopDesc* o = obj.obj();
167 #else
168 oopDesc* o = obj;
169 #endif // CHECK_UNHANDLED_OOPS
170 assert((intptr_t)o % MinObjAlignmentInBytes == 0, "not oop aligned");
171 assert(Universe::heap()->is_in_reserved(obj), "must be in heap");
172 }
173 #endif // ASSERT
174
175 assert(_from != NULL, "from region must be non-NULL");
176 assert(_from->is_in_reserved(p), "p is not in from");
177
178 HeapRegion* to = _g1->heap_region_containing(obj);
179 if (to != NULL && _from != to) {
180 // The _record_refs_into_cset flag is true during the RSet
181 // updating part of an evacuation pause. It is false at all
182 // other times:
183 // * rebuilding the rembered sets after a full GC
184 // * during concurrent refinement.
185 // * updating the remembered sets of regions in the collection
186 // set in the event of an evacuation failure (when deferred
187 // updates are enabled).
188
189 if (_record_refs_into_cset && to->in_collection_set()) {
190 // We are recording references that point into the collection
191 // set and this particular reference does exactly that...
192 // If the referenced object has already been forwarded
193 // to itself, we are handling an evacuation failure and
194 // we have already visited/tried to copy this object
195 // there is no need to retry.
196 if (!self_forwarded(obj)) {
197 assert(_push_ref_cl != NULL, "should not be null");
198 // Push the reference in the refs queue of the G1ParScanThreadState
199 // instance for this worker thread.
200 _push_ref_cl->do_oop(p);
201 }
202
203 // Deferred updates to the CSet are either discarded (in the normal case),
204 // or processed (if an evacuation failure occurs) at the end
205 // of the collection.
206 // See G1RemSet::cleanup_after_oops_into_collection_set_do().
207 return;
208 }
209
210 // We either don't care about pushing references that point into the
211 // collection set (i.e. we're not during an evacuation pause) _or_
212 // the reference doesn't point into the collection set. Either way
213 // we add the reference directly to the RSet of the region containing
214 // the referenced object.
215 assert(to->rem_set() != NULL, "Need per-region 'into' remsets.");
216 to->rem_set()->add_reference(p, _worker_i);
217 }
218 }
219
220 #endif // SHARE_VM_GC_IMPLEMENTATION_G1_G1OOPCLOSURES_INLINE_HPP