OLD | NEW |
1 /* | 1 /* |
2 * Copyright (c) 2016 The WebRTC project authors. All Rights Reserved. | 2 * Copyright (c) 2016 The WebRTC project authors. All Rights Reserved. |
3 * | 3 * |
4 * Use of this source code is governed by a BSD-style license | 4 * Use of this source code is governed by a BSD-style license |
5 * that can be found in the LICENSE file in the root of the source | 5 * that can be found in the LICENSE file in the root of the source |
6 * tree. An additional intellectual property rights grant can be found | 6 * tree. An additional intellectual property rights grant can be found |
7 * in the file PATENTS. All contributing project authors may | 7 * in the file PATENTS. All contributing project authors may |
8 * be found in the AUTHORS file in the root of the source tree. | 8 * be found in the AUTHORS file in the root of the source tree. |
9 */ | 9 */ |
10 | 10 |
11 #include "webrtc/base/race_checker.h" | 11 #include "webrtc/base/race_checker.h" |
12 | 12 |
13 namespace rtc { | 13 namespace rtc { |
14 | 14 |
15 RaceChecker::RaceChecker() {} | 15 RaceChecker::RaceChecker() {} |
16 | 16 |
| 17 // Note that the implementation here is in itself racy, but we pretend it does |
| 18 // not matter because we want this useful in release builds without having to |
| 19 // pay the cost of using atomics. A race hitting the race checker is likely to |
| 20 // cause access_count_ to diverge from zero and therefore cause the ThreadRef |
| 21 // comparison to fail, signaling a race, although it may not be in the exact |
| 22 // spot where a race *first* appeared in the code we're trying to protect. There |
| 23 // is also a chance that an actual race is missed, however the probability of |
| 24 // that has been considered small enough to be an acceptable trade off. |
17 bool RaceChecker::Acquire() const { | 25 bool RaceChecker::Acquire() const { |
18 const PlatformThreadRef current_thread = CurrentThreadRef(); | 26 const PlatformThreadRef current_thread = CurrentThreadRef(); |
19 // Set new accessing thread if this is a new use. | 27 // Set new accessing thread if this is a new use. |
20 if (access_count_++ == 0) | 28 if (access_count_++ == 0) |
21 accessing_thread_ = current_thread; | 29 accessing_thread_ = current_thread; |
22 // If this is being used concurrently this check will fail for the second | 30 // If this is being used concurrently this check will fail for the second |
23 // thread entering since it won't set the thread. Recursive use of checked | 31 // thread entering since it won't set the thread. Recursive use of checked |
24 // methods are OK since the accessing thread remains the same. | 32 // methods are OK since the accessing thread remains the same. |
25 const PlatformThreadRef accessing_thread = accessing_thread_; | 33 const PlatformThreadRef accessing_thread = accessing_thread_; |
26 return IsThreadRefEqual(accessing_thread, current_thread); | 34 return IsThreadRefEqual(accessing_thread, current_thread); |
(...skipping 10 matching lines...) Expand all Loading... |
37 bool RaceCheckerScope::RaceDetected() const { | 45 bool RaceCheckerScope::RaceDetected() const { |
38 return !race_check_ok_; | 46 return !race_check_ok_; |
39 } | 47 } |
40 | 48 |
41 RaceCheckerScope::~RaceCheckerScope() { | 49 RaceCheckerScope::~RaceCheckerScope() { |
42 race_checker_->Release(); | 50 race_checker_->Release(); |
43 } | 51 } |
44 | 52 |
45 } // namespace internal | 53 } // namespace internal |
46 } // namespace rtc | 54 } // namespace rtc |
OLD | NEW |