Export of internal Abseil changes
-- 972333fe1e43427849b8a634aa35061e81be3642 by Abseil Team <absl-team@google.com>: Replace deprecated thread annotations macros. PiperOrigin-RevId: 267332619 -- 7039c6dc499a31c372b4872eda0772455931c360 by Gennadiy Rozental <rogeeff@google.com>: Internal change PiperOrigin-RevId: 267220271 -- a3f524d2afc2535686f206a7ce06961016349d7a by Abseil Team <absl-team@google.com>: Factor kernel_timeout out of synchronization. PiperOrigin-RevId: 267217304 -- 90287de4114ef9a06cafe50256a2d03349772c21 by Abseil Team <absl-team@google.com>: Fixed comment typo. PiperOrigin-RevId: 267198532 -- d312c1a1e52aeca1871ff0deead416d09a7f237e by Gennadiy Rozental <rogeeff@google.com>: Internal change PiperOrigin-RevId: 267185804 GitOrigin-RevId: 972333fe1e43427849b8a634aa35061e81be3642 Change-Id: Ia8a2f877c57cef9854aad48f1753af872fc04dc8
This commit is contained in:
parent
eb6b7bd23b
commit
83c1d65c90
27 changed files with 282 additions and 377 deletions
|
@ -425,10 +425,10 @@ TEST(Mutex, CondVarWaitSignalsAwait) {
|
|||
// Use a struct so the lock annotations apply.
|
||||
struct {
|
||||
absl::Mutex barrier_mu;
|
||||
bool barrier GUARDED_BY(barrier_mu) = false;
|
||||
bool barrier ABSL_GUARDED_BY(barrier_mu) = false;
|
||||
|
||||
absl::Mutex release_mu;
|
||||
bool release GUARDED_BY(release_mu) = false;
|
||||
bool release ABSL_GUARDED_BY(release_mu) = false;
|
||||
absl::CondVar released_cv;
|
||||
} state;
|
||||
|
||||
|
@ -466,10 +466,10 @@ TEST(Mutex, CondVarWaitWithTimeoutSignalsAwait) {
|
|||
// Use a struct so the lock annotations apply.
|
||||
struct {
|
||||
absl::Mutex barrier_mu;
|
||||
bool barrier GUARDED_BY(barrier_mu) = false;
|
||||
bool barrier ABSL_GUARDED_BY(barrier_mu) = false;
|
||||
|
||||
absl::Mutex release_mu;
|
||||
bool release GUARDED_BY(release_mu) = false;
|
||||
bool release ABSL_GUARDED_BY(release_mu) = false;
|
||||
absl::CondVar released_cv;
|
||||
} state;
|
||||
|
||||
|
@ -770,7 +770,7 @@ static void GetReadLock(ReaderDecrementBugStruct *x) {
|
|||
|
||||
// Test for reader counter being decremented incorrectly by waiter
|
||||
// with false condition.
|
||||
TEST(Mutex, MutexReaderDecrementBug) NO_THREAD_SAFETY_ANALYSIS {
|
||||
TEST(Mutex, MutexReaderDecrementBug) ABSL_NO_THREAD_SAFETY_ANALYSIS {
|
||||
ReaderDecrementBugStruct x;
|
||||
x.cond = false;
|
||||
x.waiting_on_cond = false;
|
||||
|
@ -819,7 +819,7 @@ TEST(Mutex, MutexReaderDecrementBug) NO_THREAD_SAFETY_ANALYSIS {
|
|||
// TSAN reports errors when locked Mutexes are destroyed.
|
||||
TEST(Mutex, DISABLED_LockedMutexDestructionBug) NO_THREAD_SAFETY_ANALYSIS {
|
||||
#else
|
||||
TEST(Mutex, LockedMutexDestructionBug) NO_THREAD_SAFETY_ANALYSIS {
|
||||
TEST(Mutex, LockedMutexDestructionBug) ABSL_NO_THREAD_SAFETY_ANALYSIS {
|
||||
#endif
|
||||
for (int i = 0; i != 10; i++) {
|
||||
// Create, lock and destroy 10 locks.
|
||||
|
@ -1101,7 +1101,7 @@ TEST(Mutex, DeadlockDetectorBazelWarning) {
|
|||
// annotation-based static thread-safety analysis is not currently
|
||||
// predicate-aware and cannot tell if the two for-loops that acquire and
|
||||
// release the locks have the same predicates.
|
||||
TEST(Mutex, DeadlockDetectorStessTest) NO_THREAD_SAFETY_ANALYSIS {
|
||||
TEST(Mutex, DeadlockDetectorStessTest) ABSL_NO_THREAD_SAFETY_ANALYSIS {
|
||||
// Stress test: Here we create a large number of locks and use all of them.
|
||||
// If a deadlock detector keeps a full graph of lock acquisition order,
|
||||
// it will likely be too slow for this test to pass.
|
||||
|
@ -1123,7 +1123,7 @@ TEST(Mutex, DeadlockDetectorStessTest) NO_THREAD_SAFETY_ANALYSIS {
|
|||
// TSAN reports errors when locked Mutexes are destroyed.
|
||||
TEST(Mutex, DISABLED_DeadlockIdBug) NO_THREAD_SAFETY_ANALYSIS {
|
||||
#else
|
||||
TEST(Mutex, DeadlockIdBug) NO_THREAD_SAFETY_ANALYSIS {
|
||||
TEST(Mutex, DeadlockIdBug) ABSL_NO_THREAD_SAFETY_ANALYSIS {
|
||||
#endif
|
||||
// Test a scenario where a cached deadlock graph node id in the
|
||||
// list of held locks is not invalidated when the corresponding
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue