Mathieu Chartier | 78f7b4c | 2014-05-06 10:57:27 -0700 | [diff] [blame] | 1 | /* |
| 2 | * Copyright (C) 2014 The Android Open Source Project |
| 3 | * |
| 4 | * Licensed under the Apache License, Version 2.0 (the "License"); |
| 5 | * you may not use this file except in compliance with the License. |
| 6 | * You may obtain a copy of the License at |
| 7 | * |
| 8 | * http://www.apache.org/licenses/LICENSE-2.0 |
| 9 | * |
| 10 | * Unless required by applicable law or agreed to in writing, software |
| 11 | * distributed under the License is distributed on an "AS IS" BASIS, |
| 12 | * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. |
| 13 | * See the License for the specific language governing permissions and |
| 14 | * limitations under the License. |
| 15 | */ |
| 16 | |
| 17 | #include "reference_processor.h" |
| 18 | |
Vladimir Marko | 80afd02 | 2015-05-19 18:08:00 +0100 | [diff] [blame] | 19 | #include "base/time_utils.h" |
David Sehr | c431b9d | 2018-03-02 12:01:51 -0800 | [diff] [blame^] | 20 | #include "base/utils.h" |
Mathieu Chartier | 9750995 | 2015-07-13 14:35:43 -0700 | [diff] [blame] | 21 | #include "collector/garbage_collector.h" |
Andreas Gampe | c15a2f4 | 2017-04-21 12:09:39 -0700 | [diff] [blame] | 22 | #include "java_vm_ext.h" |
Mathieu Chartier | e401d14 | 2015-04-22 13:56:20 -0700 | [diff] [blame] | 23 | #include "mirror/class-inl.h" |
Mathieu Chartier | 78f7b4c | 2014-05-06 10:57:27 -0700 | [diff] [blame] | 24 | #include "mirror/object-inl.h" |
| 25 | #include "mirror/reference-inl.h" |
Andreas Gampe | 373a9b5 | 2017-10-18 09:01:57 -0700 | [diff] [blame] | 26 | #include "nativehelper/scoped_local_ref.h" |
Andreas Gampe | 5d08fcc | 2017-06-05 17:56:46 -0700 | [diff] [blame] | 27 | #include "object_callbacks.h" |
Fred Shih | 4ee7a66 | 2014-07-11 09:59:27 -0700 | [diff] [blame] | 28 | #include "reference_processor-inl.h" |
Mathieu Chartier | 78f7b4c | 2014-05-06 10:57:27 -0700 | [diff] [blame] | 29 | #include "reflection.h" |
Mathieu Chartier | 0795f23 | 2016-09-27 18:43:30 -0700 | [diff] [blame] | 30 | #include "scoped_thread_state_change-inl.h" |
Mathieu Chartier | a5eae69 | 2014-12-17 17:56:03 -0800 | [diff] [blame] | 31 | #include "task_processor.h" |
Mathieu Chartier | 78f7b4c | 2014-05-06 10:57:27 -0700 | [diff] [blame] | 32 | #include "well_known_classes.h" |
| 33 | |
| 34 | namespace art { |
| 35 | namespace gc { |
| 36 | |
Mathieu Chartier | a5eae69 | 2014-12-17 17:56:03 -0800 | [diff] [blame] | 37 | static constexpr bool kAsyncReferenceQueueAdd = false; |
| 38 | |
Mathieu Chartier | 78f7b4c | 2014-05-06 10:57:27 -0700 | [diff] [blame] | 39 | ReferenceProcessor::ReferenceProcessor() |
Mathieu Chartier | 9750995 | 2015-07-13 14:35:43 -0700 | [diff] [blame] | 40 | : collector_(nullptr), |
Mathieu Chartier | a5a53ef | 2014-09-12 12:58:05 -0700 | [diff] [blame] | 41 | preserving_references_(false), |
| 42 | condition_("reference processor condition", *Locks::reference_processor_lock_) , |
| 43 | soft_reference_queue_(Locks::reference_queue_soft_references_lock_), |
| 44 | weak_reference_queue_(Locks::reference_queue_weak_references_lock_), |
| 45 | finalizer_reference_queue_(Locks::reference_queue_finalizer_references_lock_), |
| 46 | phantom_reference_queue_(Locks::reference_queue_phantom_references_lock_), |
| 47 | cleared_references_(Locks::reference_queue_cleared_references_lock_) { |
Mathieu Chartier | 78f7b4c | 2014-05-06 10:57:27 -0700 | [diff] [blame] | 48 | } |
| 49 | |
| 50 | void ReferenceProcessor::EnableSlowPath() { |
Fred Shih | 4ee7a66 | 2014-07-11 09:59:27 -0700 | [diff] [blame] | 51 | mirror::Reference::GetJavaLangRefReference()->SetSlowPath(true); |
Mathieu Chartier | 78f7b4c | 2014-05-06 10:57:27 -0700 | [diff] [blame] | 52 | } |
| 53 | |
| 54 | void ReferenceProcessor::DisableSlowPath(Thread* self) { |
Fred Shih | 4ee7a66 | 2014-07-11 09:59:27 -0700 | [diff] [blame] | 55 | mirror::Reference::GetJavaLangRefReference()->SetSlowPath(false); |
Mathieu Chartier | 78f7b4c | 2014-05-06 10:57:27 -0700 | [diff] [blame] | 56 | condition_.Broadcast(self); |
| 57 | } |
| 58 | |
Hiroshi Yamauchi | 0b71357 | 2015-06-16 18:29:23 -0700 | [diff] [blame] | 59 | void ReferenceProcessor::BroadcastForSlowPath(Thread* self) { |
Hiroshi Yamauchi | 0b71357 | 2015-06-16 18:29:23 -0700 | [diff] [blame] | 60 | MutexLock mu(self, *Locks::reference_processor_lock_); |
| 61 | condition_.Broadcast(self); |
| 62 | } |
| 63 | |
Mathieu Chartier | 5d3f73a | 2016-10-14 14:28:47 -0700 | [diff] [blame] | 64 | ObjPtr<mirror::Object> ReferenceProcessor::GetReferent(Thread* self, |
| 65 | ObjPtr<mirror::Reference> reference) { |
Hiroshi Yamauchi | 0b71357 | 2015-06-16 18:29:23 -0700 | [diff] [blame] | 66 | if (!kUseReadBarrier || self->GetWeakRefAccessEnabled()) { |
| 67 | // Under read barrier / concurrent copying collector, it's not safe to call GetReferent() when |
| 68 | // weak ref access is disabled as the call includes a read barrier which may push a ref onto the |
| 69 | // mark stack and interfere with termination of marking. |
Mathieu Chartier | 5d3f73a | 2016-10-14 14:28:47 -0700 | [diff] [blame] | 70 | ObjPtr<mirror::Object> const referent = reference->GetReferent(); |
Hiroshi Yamauchi | 0b71357 | 2015-06-16 18:29:23 -0700 | [diff] [blame] | 71 | // If the referent is null then it is already cleared, we can just return null since there is no |
| 72 | // scenario where it becomes non-null during the reference processing phase. |
| 73 | if (UNLIKELY(!SlowPathEnabled()) || referent == nullptr) { |
| 74 | return referent; |
| 75 | } |
Mathieu Chartier | 78f7b4c | 2014-05-06 10:57:27 -0700 | [diff] [blame] | 76 | } |
Mathieu Chartier | a5a53ef | 2014-09-12 12:58:05 -0700 | [diff] [blame] | 77 | MutexLock mu(self, *Locks::reference_processor_lock_); |
Hiroshi Yamauchi | 0b71357 | 2015-06-16 18:29:23 -0700 | [diff] [blame] | 78 | while ((!kUseReadBarrier && SlowPathEnabled()) || |
| 79 | (kUseReadBarrier && !self->GetWeakRefAccessEnabled())) { |
Mathieu Chartier | 36994ba | 2016-12-13 11:46:28 -0800 | [diff] [blame] | 80 | ObjPtr<mirror::Object> referent = reference->GetReferent<kWithoutReadBarrier>(); |
Mathieu Chartier | 308351a | 2014-06-15 12:39:02 -0700 | [diff] [blame] | 81 | // If the referent became cleared, return it. Don't need barrier since thread roots can't get |
| 82 | // updated until after we leave the function due to holding the mutator lock. |
Mathieu Chartier | 36994ba | 2016-12-13 11:46:28 -0800 | [diff] [blame] | 83 | if (referent == nullptr) { |
Mathieu Chartier | 2175f52 | 2014-05-09 11:01:06 -0700 | [diff] [blame] | 84 | return nullptr; |
| 85 | } |
Mathieu Chartier | 78f7b4c | 2014-05-06 10:57:27 -0700 | [diff] [blame] | 86 | // Try to see if the referent is already marked by using the is_marked_callback. We can return |
Mathieu Chartier | 308351a | 2014-06-15 12:39:02 -0700 | [diff] [blame] | 87 | // it to the mutator as long as the GC is not preserving references. |
Mathieu Chartier | 9750995 | 2015-07-13 14:35:43 -0700 | [diff] [blame] | 88 | if (LIKELY(collector_ != nullptr)) { |
Mathieu Chartier | 78f7b4c | 2014-05-06 10:57:27 -0700 | [diff] [blame] | 89 | // If it's null it means not marked, but it could become marked if the referent is reachable |
Roland Levillain | 91d65e0 | 2016-01-19 15:59:16 +0000 | [diff] [blame] | 90 | // by finalizer referents. So we cannot return in this case and must block. Otherwise, we |
Fred Shih | 530e1b5 | 2014-06-09 15:19:54 -0700 | [diff] [blame] | 91 | // can return it to the mutator as long as the GC is not preserving references, in which |
| 92 | // case only black nodes can be safely returned. If the GC is preserving references, the |
| 93 | // mutator could take a white field from a grey or white node and move it somewhere else |
| 94 | // in the heap causing corruption since this field would get swept. |
Mathieu Chartier | 36994ba | 2016-12-13 11:46:28 -0800 | [diff] [blame] | 95 | // Use the cached referent instead of calling GetReferent since other threads could call |
| 96 | // Reference.clear() after we did the null check resulting in a null pointer being |
| 97 | // incorrectly passed to IsMarked. b/33569625 |
| 98 | ObjPtr<mirror::Object> forwarded_ref = collector_->IsMarked(referent.Ptr()); |
| 99 | if (forwarded_ref != nullptr) { |
| 100 | // Non null means that it is marked. |
Fred Shih | 530e1b5 | 2014-06-09 15:19:54 -0700 | [diff] [blame] | 101 | if (!preserving_references_ || |
Richard Uhler | c4695df | 2016-01-15 14:08:05 -0800 | [diff] [blame] | 102 | (LIKELY(!reference->IsFinalizerReferenceInstance()) && reference->IsUnprocessed())) { |
Mathieu Chartier | 36994ba | 2016-12-13 11:46:28 -0800 | [diff] [blame] | 103 | return forwarded_ref; |
Fred Shih | 530e1b5 | 2014-06-09 15:19:54 -0700 | [diff] [blame] | 104 | } |
Mathieu Chartier | 78f7b4c | 2014-05-06 10:57:27 -0700 | [diff] [blame] | 105 | } |
| 106 | } |
Hiroshi Yamauchi | 3049324 | 2016-11-03 13:06:52 -0700 | [diff] [blame] | 107 | // Check and run the empty checkpoint before blocking so the empty checkpoint will work in the |
| 108 | // presence of threads blocking for weak ref access. |
Hiroshi Yamauchi | a222404 | 2017-02-08 16:35:45 -0800 | [diff] [blame] | 109 | self->CheckEmptyCheckpointFromWeakRefAccess(Locks::reference_processor_lock_); |
Mathieu Chartier | 2d1ab0a | 2014-05-08 15:27:31 -0700 | [diff] [blame] | 110 | condition_.WaitHoldingLocks(self); |
Mathieu Chartier | 78f7b4c | 2014-05-06 10:57:27 -0700 | [diff] [blame] | 111 | } |
| 112 | return reference->GetReferent(); |
| 113 | } |
| 114 | |
Mathieu Chartier | 78f7b4c | 2014-05-06 10:57:27 -0700 | [diff] [blame] | 115 | void ReferenceProcessor::StartPreservingReferences(Thread* self) { |
Mathieu Chartier | a5a53ef | 2014-09-12 12:58:05 -0700 | [diff] [blame] | 116 | MutexLock mu(self, *Locks::reference_processor_lock_); |
Mathieu Chartier | 78f7b4c | 2014-05-06 10:57:27 -0700 | [diff] [blame] | 117 | preserving_references_ = true; |
| 118 | } |
| 119 | |
| 120 | void ReferenceProcessor::StopPreservingReferences(Thread* self) { |
Mathieu Chartier | a5a53ef | 2014-09-12 12:58:05 -0700 | [diff] [blame] | 121 | MutexLock mu(self, *Locks::reference_processor_lock_); |
Mathieu Chartier | 78f7b4c | 2014-05-06 10:57:27 -0700 | [diff] [blame] | 122 | preserving_references_ = false; |
| 123 | // We are done preserving references, some people who are blocked may see a marked referent. |
| 124 | condition_.Broadcast(self); |
| 125 | } |
| 126 | |
| 127 | // Process reference class instances and schedule finalizations. |
Mathieu Chartier | 5d3f73a | 2016-10-14 14:28:47 -0700 | [diff] [blame] | 128 | void ReferenceProcessor::ProcessReferences(bool concurrent, |
| 129 | TimingLogger* timings, |
Mathieu Chartier | 78f7b4c | 2014-05-06 10:57:27 -0700 | [diff] [blame] | 130 | bool clear_soft_references, |
Mathieu Chartier | 9750995 | 2015-07-13 14:35:43 -0700 | [diff] [blame] | 131 | collector::GarbageCollector* collector) { |
Mathieu Chartier | f5997b4 | 2014-06-20 10:37:54 -0700 | [diff] [blame] | 132 | TimingLogger::ScopedTiming t(concurrent ? __FUNCTION__ : "(Paused)ProcessReferences", timings); |
Mathieu Chartier | 78f7b4c | 2014-05-06 10:57:27 -0700 | [diff] [blame] | 133 | Thread* self = Thread::Current(); |
| 134 | { |
Mathieu Chartier | a5a53ef | 2014-09-12 12:58:05 -0700 | [diff] [blame] | 135 | MutexLock mu(self, *Locks::reference_processor_lock_); |
Mathieu Chartier | 9750995 | 2015-07-13 14:35:43 -0700 | [diff] [blame] | 136 | collector_ = collector; |
Hiroshi Yamauchi | 0b71357 | 2015-06-16 18:29:23 -0700 | [diff] [blame] | 137 | if (!kUseReadBarrier) { |
| 138 | CHECK_EQ(SlowPathEnabled(), concurrent) << "Slow path must be enabled iff concurrent"; |
| 139 | } else { |
| 140 | // Weak ref access is enabled at Zygote compaction by SemiSpace (concurrent == false). |
| 141 | CHECK_EQ(!self->GetWeakRefAccessEnabled(), concurrent); |
| 142 | } |
Mathieu Chartier | 78f7b4c | 2014-05-06 10:57:27 -0700 | [diff] [blame] | 143 | } |
Hiroshi Yamauchi | 057d977 | 2017-02-17 15:33:23 -0800 | [diff] [blame] | 144 | if (kIsDebugBuild && collector->IsTransactionActive()) { |
| 145 | // In transaction mode, we shouldn't enqueue any Reference to the queues. |
| 146 | // See DelayReferenceReferent(). |
| 147 | DCHECK(soft_reference_queue_.IsEmpty()); |
| 148 | DCHECK(weak_reference_queue_.IsEmpty()); |
| 149 | DCHECK(finalizer_reference_queue_.IsEmpty()); |
| 150 | DCHECK(phantom_reference_queue_.IsEmpty()); |
| 151 | } |
Mathieu Chartier | 78f7b4c | 2014-05-06 10:57:27 -0700 | [diff] [blame] | 152 | // Unless required to clear soft references with white references, preserve some white referents. |
| 153 | if (!clear_soft_references) { |
Mathieu Chartier | f5997b4 | 2014-06-20 10:37:54 -0700 | [diff] [blame] | 154 | TimingLogger::ScopedTiming split(concurrent ? "ForwardSoftReferences" : |
Fred Shih | 530e1b5 | 2014-06-09 15:19:54 -0700 | [diff] [blame] | 155 | "(Paused)ForwardSoftReferences", timings); |
Mathieu Chartier | 78f7b4c | 2014-05-06 10:57:27 -0700 | [diff] [blame] | 156 | if (concurrent) { |
| 157 | StartPreservingReferences(self); |
| 158 | } |
Mathieu Chartier | 8118781 | 2015-07-15 14:24:07 -0700 | [diff] [blame] | 159 | // TODO: Add smarter logic for preserving soft references. The behavior should be a conditional |
| 160 | // mark if the SoftReference is supposed to be preserved. |
Mathieu Chartier | 9750995 | 2015-07-13 14:35:43 -0700 | [diff] [blame] | 161 | soft_reference_queue_.ForwardSoftReferences(collector); |
| 162 | collector->ProcessMarkStack(); |
Mathieu Chartier | 78f7b4c | 2014-05-06 10:57:27 -0700 | [diff] [blame] | 163 | if (concurrent) { |
| 164 | StopPreservingReferences(self); |
| 165 | } |
| 166 | } |
| 167 | // Clear all remaining soft and weak references with white referents. |
Mathieu Chartier | 9750995 | 2015-07-13 14:35:43 -0700 | [diff] [blame] | 168 | soft_reference_queue_.ClearWhiteReferences(&cleared_references_, collector); |
| 169 | weak_reference_queue_.ClearWhiteReferences(&cleared_references_, collector); |
Mathieu Chartier | 78f7b4c | 2014-05-06 10:57:27 -0700 | [diff] [blame] | 170 | { |
Andreas Gampe | 277ccbd | 2014-11-03 21:36:10 -0800 | [diff] [blame] | 171 | TimingLogger::ScopedTiming t2(concurrent ? "EnqueueFinalizerReferences" : |
Mathieu Chartier | 78f7b4c | 2014-05-06 10:57:27 -0700 | [diff] [blame] | 172 | "(Paused)EnqueueFinalizerReferences", timings); |
| 173 | if (concurrent) { |
| 174 | StartPreservingReferences(self); |
| 175 | } |
| 176 | // Preserve all white objects with finalize methods and schedule them for finalization. |
Mathieu Chartier | 9750995 | 2015-07-13 14:35:43 -0700 | [diff] [blame] | 177 | finalizer_reference_queue_.EnqueueFinalizerReferences(&cleared_references_, collector); |
| 178 | collector->ProcessMarkStack(); |
Mathieu Chartier | 78f7b4c | 2014-05-06 10:57:27 -0700 | [diff] [blame] | 179 | if (concurrent) { |
| 180 | StopPreservingReferences(self); |
| 181 | } |
| 182 | } |
| 183 | // Clear all finalizer referent reachable soft and weak references with white referents. |
Mathieu Chartier | 9750995 | 2015-07-13 14:35:43 -0700 | [diff] [blame] | 184 | soft_reference_queue_.ClearWhiteReferences(&cleared_references_, collector); |
| 185 | weak_reference_queue_.ClearWhiteReferences(&cleared_references_, collector); |
Mathieu Chartier | 78f7b4c | 2014-05-06 10:57:27 -0700 | [diff] [blame] | 186 | // Clear all phantom references with white referents. |
Mathieu Chartier | 9750995 | 2015-07-13 14:35:43 -0700 | [diff] [blame] | 187 | phantom_reference_queue_.ClearWhiteReferences(&cleared_references_, collector); |
Mathieu Chartier | 78f7b4c | 2014-05-06 10:57:27 -0700 | [diff] [blame] | 188 | // At this point all reference queues other than the cleared references should be empty. |
| 189 | DCHECK(soft_reference_queue_.IsEmpty()); |
| 190 | DCHECK(weak_reference_queue_.IsEmpty()); |
| 191 | DCHECK(finalizer_reference_queue_.IsEmpty()); |
| 192 | DCHECK(phantom_reference_queue_.IsEmpty()); |
Mathieu Chartier | 2175f52 | 2014-05-09 11:01:06 -0700 | [diff] [blame] | 193 | { |
Mathieu Chartier | a5a53ef | 2014-09-12 12:58:05 -0700 | [diff] [blame] | 194 | MutexLock mu(self, *Locks::reference_processor_lock_); |
Mathieu Chartier | 2175f52 | 2014-05-09 11:01:06 -0700 | [diff] [blame] | 195 | // Need to always do this since the next GC may be concurrent. Doing this for only concurrent |
| 196 | // could result in a stale is_marked_callback_ being called before the reference processing |
| 197 | // starts since there is a small window of time where slow_path_enabled_ is enabled but the |
| 198 | // callback isn't yet set. |
Mathieu Chartier | 9750995 | 2015-07-13 14:35:43 -0700 | [diff] [blame] | 199 | collector_ = nullptr; |
| 200 | if (!kUseReadBarrier && concurrent) { |
| 201 | // Done processing, disable the slow path and broadcast to the waiters. |
| 202 | DisableSlowPath(self); |
Mathieu Chartier | 2175f52 | 2014-05-09 11:01:06 -0700 | [diff] [blame] | 203 | } |
Mathieu Chartier | 78f7b4c | 2014-05-06 10:57:27 -0700 | [diff] [blame] | 204 | } |
Mathieu Chartier | 78f7b4c | 2014-05-06 10:57:27 -0700 | [diff] [blame] | 205 | } |
| 206 | |
| 207 | // Process the "referent" field in a java.lang.ref.Reference. If the referent has not yet been |
| 208 | // marked, put it on the appropriate list in the heap for later processing. |
Mathieu Chartier | 5d3f73a | 2016-10-14 14:28:47 -0700 | [diff] [blame] | 209 | void ReferenceProcessor::DelayReferenceReferent(ObjPtr<mirror::Class> klass, |
| 210 | ObjPtr<mirror::Reference> ref, |
Mathieu Chartier | 9750995 | 2015-07-13 14:35:43 -0700 | [diff] [blame] | 211 | collector::GarbageCollector* collector) { |
Mathieu Chartier | 78f7b4c | 2014-05-06 10:57:27 -0700 | [diff] [blame] | 212 | // klass can be the class of the old object if the visitor already updated the class of ref. |
Mathieu Chartier | 308351a | 2014-06-15 12:39:02 -0700 | [diff] [blame] | 213 | DCHECK(klass != nullptr); |
Fred Shih | 4ee7a66 | 2014-07-11 09:59:27 -0700 | [diff] [blame] | 214 | DCHECK(klass->IsTypeOfReferenceClass()); |
Mathieu Chartier | 308351a | 2014-06-15 12:39:02 -0700 | [diff] [blame] | 215 | mirror::HeapReference<mirror::Object>* referent = ref->GetReferentReferenceAddr(); |
Hiroshi Yamauchi | 65f5f24 | 2016-12-19 11:44:47 -0800 | [diff] [blame] | 216 | // do_atomic_update needs to be true because this happens outside of the reference processing |
| 217 | // phase. |
| 218 | if (!collector->IsNullOrMarkedHeapReference(referent, /*do_atomic_update*/true)) { |
Hiroshi Yamauchi | 057d977 | 2017-02-17 15:33:23 -0800 | [diff] [blame] | 219 | if (UNLIKELY(collector->IsTransactionActive())) { |
| 220 | // In transaction mode, keep the referent alive and avoid any reference processing to avoid the |
| 221 | // issue of rolling back reference processing. do_atomic_update needs to be true because this |
| 222 | // happens outside of the reference processing phase. |
| 223 | if (!referent->IsNull()) { |
| 224 | collector->MarkHeapReference(referent, /*do_atomic_update*/ true); |
| 225 | } |
| 226 | return; |
| 227 | } |
Mathieu Chartier | 308351a | 2014-06-15 12:39:02 -0700 | [diff] [blame] | 228 | Thread* self = Thread::Current(); |
| 229 | // TODO: Remove these locks, and use atomic stacks for storing references? |
| 230 | // We need to check that the references haven't already been enqueued since we can end up |
| 231 | // scanning the same reference multiple times due to dirty cards. |
| 232 | if (klass->IsSoftReferenceClass()) { |
| 233 | soft_reference_queue_.AtomicEnqueueIfNotEnqueued(self, ref); |
| 234 | } else if (klass->IsWeakReferenceClass()) { |
| 235 | weak_reference_queue_.AtomicEnqueueIfNotEnqueued(self, ref); |
| 236 | } else if (klass->IsFinalizerReferenceClass()) { |
| 237 | finalizer_reference_queue_.AtomicEnqueueIfNotEnqueued(self, ref); |
| 238 | } else if (klass->IsPhantomReferenceClass()) { |
| 239 | phantom_reference_queue_.AtomicEnqueueIfNotEnqueued(self, ref); |
| 240 | } else { |
David Sehr | 709b070 | 2016-10-13 09:12:37 -0700 | [diff] [blame] | 241 | LOG(FATAL) << "Invalid reference type " << klass->PrettyClass() << " " << std::hex |
Mathieu Chartier | 308351a | 2014-06-15 12:39:02 -0700 | [diff] [blame] | 242 | << klass->GetAccessFlags(); |
Mathieu Chartier | 78f7b4c | 2014-05-06 10:57:27 -0700 | [diff] [blame] | 243 | } |
| 244 | } |
| 245 | } |
| 246 | |
Mathieu Chartier | 9750995 | 2015-07-13 14:35:43 -0700 | [diff] [blame] | 247 | void ReferenceProcessor::UpdateRoots(IsMarkedVisitor* visitor) { |
| 248 | cleared_references_.UpdateRoots(visitor); |
Mathieu Chartier | 52e4b43 | 2014-06-10 11:22:31 -0700 | [diff] [blame] | 249 | } |
| 250 | |
Mathieu Chartier | a5eae69 | 2014-12-17 17:56:03 -0800 | [diff] [blame] | 251 | class ClearedReferenceTask : public HeapTask { |
| 252 | public: |
| 253 | explicit ClearedReferenceTask(jobject cleared_references) |
| 254 | : HeapTask(NanoTime()), cleared_references_(cleared_references) { |
| 255 | } |
| 256 | virtual void Run(Thread* thread) { |
| 257 | ScopedObjectAccess soa(thread); |
| 258 | jvalue args[1]; |
| 259 | args[0].l = cleared_references_; |
| 260 | InvokeWithJValues(soa, nullptr, WellKnownClasses::java_lang_ref_ReferenceQueue_add, args); |
| 261 | soa.Env()->DeleteGlobalRef(cleared_references_); |
| 262 | } |
| 263 | |
| 264 | private: |
| 265 | const jobject cleared_references_; |
| 266 | }; |
| 267 | |
Mathieu Chartier | 308351a | 2014-06-15 12:39:02 -0700 | [diff] [blame] | 268 | void ReferenceProcessor::EnqueueClearedReferences(Thread* self) { |
Mathieu Chartier | 78f7b4c | 2014-05-06 10:57:27 -0700 | [diff] [blame] | 269 | Locks::mutator_lock_->AssertNotHeld(self); |
Mathieu Chartier | a5eae69 | 2014-12-17 17:56:03 -0800 | [diff] [blame] | 270 | // When a runtime isn't started there are no reference queues to care about so ignore. |
Mathieu Chartier | 78f7b4c | 2014-05-06 10:57:27 -0700 | [diff] [blame] | 271 | if (!cleared_references_.IsEmpty()) { |
Mathieu Chartier | 78f7b4c | 2014-05-06 10:57:27 -0700 | [diff] [blame] | 272 | if (LIKELY(Runtime::Current()->IsStarted())) { |
Mathieu Chartier | a5eae69 | 2014-12-17 17:56:03 -0800 | [diff] [blame] | 273 | jobject cleared_references; |
| 274 | { |
| 275 | ReaderMutexLock mu(self, *Locks::mutator_lock_); |
Ian Rogers | 55256cb | 2017-12-21 17:07:11 -0800 | [diff] [blame] | 276 | cleared_references = self->GetJniEnv()->GetVm()->AddGlobalRef( |
Mathieu Chartier | a5eae69 | 2014-12-17 17:56:03 -0800 | [diff] [blame] | 277 | self, cleared_references_.GetList()); |
| 278 | } |
| 279 | if (kAsyncReferenceQueueAdd) { |
| 280 | // TODO: This can cause RunFinalization to terminate before newly freed objects are |
| 281 | // finalized since they may not be enqueued by the time RunFinalization starts. |
| 282 | Runtime::Current()->GetHeap()->GetTaskProcessor()->AddTask( |
| 283 | self, new ClearedReferenceTask(cleared_references)); |
| 284 | } else { |
| 285 | ClearedReferenceTask task(cleared_references); |
| 286 | task.Run(self); |
| 287 | } |
Mathieu Chartier | 78f7b4c | 2014-05-06 10:57:27 -0700 | [diff] [blame] | 288 | } |
| 289 | cleared_references_.Clear(); |
| 290 | } |
| 291 | } |
| 292 | |
Mathieu Chartier | c9a7028 | 2016-12-13 14:44:33 -0800 | [diff] [blame] | 293 | void ReferenceProcessor::ClearReferent(ObjPtr<mirror::Reference> ref) { |
Mathieu Chartier | a5a53ef | 2014-09-12 12:58:05 -0700 | [diff] [blame] | 294 | Thread* self = Thread::Current(); |
| 295 | MutexLock mu(self, *Locks::reference_processor_lock_); |
Mathieu Chartier | c9a7028 | 2016-12-13 14:44:33 -0800 | [diff] [blame] | 296 | // Need to wait until reference processing is done since IsMarkedHeapReference does not have a |
| 297 | // CAS. If we do not wait, it can result in the GC un-clearing references due to race conditions. |
| 298 | // This also handles the race where the referent gets cleared after a null check but before |
| 299 | // IsMarkedHeapReference is called. |
| 300 | WaitUntilDoneProcessingReferences(self); |
| 301 | if (Runtime::Current()->IsActiveTransaction()) { |
| 302 | ref->ClearReferent<true>(); |
| 303 | } else { |
| 304 | ref->ClearReferent<false>(); |
| 305 | } |
| 306 | } |
| 307 | |
| 308 | void ReferenceProcessor::WaitUntilDoneProcessingReferences(Thread* self) { |
| 309 | // Wait until we are done processing reference. |
Hiroshi Yamauchi | 0b71357 | 2015-06-16 18:29:23 -0700 | [diff] [blame] | 310 | while ((!kUseReadBarrier && SlowPathEnabled()) || |
| 311 | (kUseReadBarrier && !self->GetWeakRefAccessEnabled())) { |
Hiroshi Yamauchi | 3049324 | 2016-11-03 13:06:52 -0700 | [diff] [blame] | 312 | // Check and run the empty checkpoint before blocking so the empty checkpoint will work in the |
| 313 | // presence of threads blocking for weak ref access. |
Hiroshi Yamauchi | a222404 | 2017-02-08 16:35:45 -0800 | [diff] [blame] | 314 | self->CheckEmptyCheckpointFromWeakRefAccess(Locks::reference_processor_lock_); |
Pavel Vyssotski | d64ba38 | 2014-12-15 18:00:17 +0600 | [diff] [blame] | 315 | condition_.WaitHoldingLocks(self); |
Mathieu Chartier | a5a53ef | 2014-09-12 12:58:05 -0700 | [diff] [blame] | 316 | } |
Mathieu Chartier | c9a7028 | 2016-12-13 14:44:33 -0800 | [diff] [blame] | 317 | } |
| 318 | |
| 319 | bool ReferenceProcessor::MakeCircularListIfUnenqueued( |
| 320 | ObjPtr<mirror::FinalizerReference> reference) { |
| 321 | Thread* self = Thread::Current(); |
| 322 | MutexLock mu(self, *Locks::reference_processor_lock_); |
| 323 | WaitUntilDoneProcessingReferences(self); |
Mathieu Chartier | a5a53ef | 2014-09-12 12:58:05 -0700 | [diff] [blame] | 324 | // At this point, since the sentinel of the reference is live, it is guaranteed to not be |
| 325 | // enqueued if we just finished processing references. Otherwise, we may be doing the main GC |
| 326 | // phase. Since we are holding the reference processor lock, it guarantees that reference |
| 327 | // processing can't begin. The GC could have just enqueued the reference one one of the internal |
| 328 | // GC queues, but since we hold the lock finalizer_reference_queue_ lock it also prevents this |
| 329 | // race. |
| 330 | MutexLock mu2(self, *Locks::reference_queue_finalizer_references_lock_); |
Richard Uhler | c4695df | 2016-01-15 14:08:05 -0800 | [diff] [blame] | 331 | if (reference->IsUnprocessed()) { |
Mathieu Chartier | a5a53ef | 2014-09-12 12:58:05 -0700 | [diff] [blame] | 332 | CHECK(reference->IsFinalizerReferenceInstance()); |
Richard Uhler | 522d51b | 2016-01-22 14:18:57 -0800 | [diff] [blame] | 333 | reference->SetPendingNext(reference); |
Mathieu Chartier | a5a53ef | 2014-09-12 12:58:05 -0700 | [diff] [blame] | 334 | return true; |
| 335 | } |
| 336 | return false; |
| 337 | } |
| 338 | |
Mathieu Chartier | 78f7b4c | 2014-05-06 10:57:27 -0700 | [diff] [blame] | 339 | } // namespace gc |
| 340 | } // namespace art |