Disable TwoNotifiersTwoThreads1000Signals as it trips off the TSAN bot.

media/audio/cross_process_notification_unittest.cc

 // Copyright (c) 2012 The Chromium Authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #include "base/compiler_specific.h"
 #include "base/logging.h"
 #include "base/shared_memory.h"
 #include "base/stl_util.h"
 #include "base/test/multiprocess_test.h"
 #include "base/threading/platform_thread.h"
@@ skipping 264 matching lines @@
     // that all notifiers had the same quality of service.
     EXPECT_EQ(expected_total / pairs.size(), data[i]);
     total += data[i];
   }
   EXPECT_EQ(expected_total, total);
 }
 
 // Functionally equivalent (as far as the shared data goes) to the
 // ThousandNotifiersTwoThreads test but uses a single pair of notifiers +
 // FlagArray for the 1000 signals. This approach is significantly faster.
-TEST(CrossProcessNotification, TwoNotifiersTwoThreads1000Signals) {
+// Disabled as it trips of the TSAN bot - "Possible data race during write of
+// size 4" (the flag array).
+TEST(CrossProcessNotification, DISABLED_TwoNotifiersTwoThreads1000Signals) {
   CrossProcessNotification a, b;
   ASSERT_TRUE(CrossProcessNotification::InitializePair(&a, &b));
 
   const size_t kCount = 1000;
   FlagArray signals;
   ASSERT_GE(signals.size(), kCount);
   size_t data[kCount] = {0};
 
   // Since this algorithm checks all events each time the notifier is
   // signaled, |repeat| doesn't mean the same thing here as it does in
@@ skipping 155 matching lines @@
 
   ipc->ready = true;
 
   a.Signal();
   a.Wait();
 
   int exit_code = -1;
   base::WaitForExitCode(process, &exit_code);
   EXPECT_EQ(0, exit_code);
 }