-- 049ac45508e335c6f010f2d28d71016b9fa65b4e by Derek Mauro <dmauro@google.com>: Fix librt detection PiperOrigin-RevId: 280207723 -- 6382c3a9fb2643af9dc031f92ca846c4a78e249c by Andy Getzendanner <durandal@google.com>: Fix Conan builds Import of https://github.com/abseil/abseil-cpp/pull/400 PiperOrigin-RevId: 280025424 -- aebcd52b1686ac82663a8d0193b60d0122a43372 by Samuel Benzaquen <sbenza@google.com>: Enable the assertion in the iterator's operator== and operator!= PiperOrigin-RevId: 279998951 -- 5b61d909e2159ac6fd45e0e456818db1e725ecd1 by Derek Mauro <dmauro@google.com>: Add best effort support for compiling much of Abseil with MinGW. This involves disabling ABSL_ATTRIBUTE_WEAK and adding link flags. A change to CCTZ is still necessary. Tests were not run yet, but most of them now build. PiperOrigin-RevId: 279966541 -- 4336f8b10cff906e2defdd7d1d449cde4907da5d by Abseil Team <absl-team@google.com>: Add comments and relax memory orders in base_internal::CallOnceImpl. Add a comment to document the memory order guarantee if base_internal::SpinLockWait() is called and returns kOnceDone. Add a comment for the load/store sequence in base_internal::CallOnceImpl based on Mike Burrows' explanation. The atomic load of 'control' in the #ifndef NDEBUG block does not need std::memory_order_acquire. It can use std::memory_order_relaxed. The atomic compare_exchange_strong of 'control' does not need std::memory_order_acquire in the success case. It can use std::memory_order_relaxed. PiperOrigin-RevId: 279814155 -- 407de3a5e9af957cded54a136ca0468bde620d4d by Abseil Team <absl-team@google.com>: Added a script to generate abseil.podspec from all BUILD.bazel files automatically. PiperOrigin-RevId: 279811441 -- 26139497d4a363d6c7bc989c554da593e8819a07 by Derek Mauro <dmauro@google.com>: Add missing copyright and Apache License to //absl/functional/BUILD.bazel PiperOrigin-RevId: 279795227 -- 98ed625b02af6e5834edf52a920d8ca2dab4cd90 by Matt Kulukundis <kfm@google.com>: Switch the implementation of hashtablez to *only* work on platforms that have a PER_THREAD_TLS. The old case is very slow (global mutex) and nobody collects data from that configuration anyway. PiperOrigin-RevId: 279775149 -- 07225900ef672c005c38f467ad3f92f38d0922b3 by Derek Mauro <dmauro@google.com>: Remove the minumum glibc version check PiperOrigin-RevId: 279750412 -- ec09956a951b4f52228ecc81968b8db7ae19ed15 by Derek Mauro <dmauro@google.com>: CMake only: link with -lrt to support older glibc versions PiperOrigin-RevId: 279741661 -- 97b113fb2e8246f6152c36330ba13793b37154b6 by Xiaoyi Zhang <zhangxy@google.com>: Internal change. PiperOrigin-RevId: 279390188 -- ca8f72f2721546cc9b01bd01b2ea144962e6e0c5 by Andy Getzendanner <durandal@google.com>: Expose PutTwoDigits for internal use within Abseil. PiperOrigin-RevId: 279374239 -- 14c6384cc03bbdfdefd2e4b635f104af5dd7e026 by Derek Mauro <dmauro@google.com>: Remove log_severity sources from the base target. They are already compiled as part of a separate library. PiperOrigin-RevId: 279372619 -- 3c5d926c718f8bf394e3bee87b6ba8d94601e0d3 by Abseil Team <absl-team@google.com>: s/indepdent/independent/g in SimpleAtof's documentation. PiperOrigin-RevId: 279350836 -- de2c44be8a8edf9efa1fe2007cba3564f3e5b0b8 by Abseil Team <absl-team@google.com>: Internal change PiperOrigin-RevId: 279346990 -- 2ba078341423fcf6d0ba5ca1831f86570a26e615 by Samuel Benzaquen <sbenza@google.com>: Add hash support for std::wstring, std::u16string and std::u32string. PiperOrigin-RevId: 279320672 -- 3272d3ffcfa55283a04f90e5868701912da95ef7 by Andy Soffer <asoffer@google.com>: Removing a bunch of __restricts that amount to no performance differences. One of these is the cause of https://github.com/abseil/abseil-cpp/issues/396. In particular, in one of the Vector128Store functions, restricts on two pointers that were indeed aliased seems to be the root cause of the issues. Closes #396 PiperOrigin-RevId: 279318999 -- 342f338ab31cc24344d5de8f28cf455bbb629a17 by Jorg Brown <jorg@google.com>: Support uint128 in SimpleAtoi PiperOrigin-RevId: 279234038 -- 81cb0a04cf2dc4515d303679fc60968712191571 by Derek Mauro <dmauro@google.com>: Change the check for futex availability to support older Linux systems PiperOrigin-RevId: 279147079 -- cb4ca4aa4c8d2d710a5d483c56c4ce4f979e14b1 by Abseil Team <absl-team@google.com>: Add IWYU pragma: export for int128 .inc files. PiperOrigin-RevId: 279107098 -- b8df86ef610c366729f07326c726f3e34817b4dd by Abseil Team <absl-team@google.com>: An optimization for Waiter::Post() in the SEM waiter mode. Like the FUTEX waiter mode, Waiter::Post() only needs to call Poke() if it incremented the atomic variable from 0. PiperOrigin-RevId: 279086133 GitOrigin-RevId: 049ac45508e335c6f010f2d28d71016b9fa65b4e Change-Id: I4c1a4073fff62cb6a1fcb1c104aa7d62dad588c2
		
			
				
	
	
		
			484 lines
		
	
	
	
		
			14 KiB
		
	
	
	
		
			C++
		
	
	
	
	
	
			
		
		
	
	
			484 lines
		
	
	
	
		
			14 KiB
		
	
	
	
		
			C++
		
	
	
	
	
	
| // Copyright 2017 The Abseil Authors.
 | |
| //
 | |
| // Licensed under the Apache License, Version 2.0 (the "License");
 | |
| // you may not use this file except in compliance with the License.
 | |
| // You may obtain a copy of the License at
 | |
| //
 | |
| //      https://www.apache.org/licenses/LICENSE-2.0
 | |
| //
 | |
| // Unless required by applicable law or agreed to in writing, software
 | |
| // distributed under the License is distributed on an "AS IS" BASIS,
 | |
| // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 | |
| // See the License for the specific language governing permissions and
 | |
| // limitations under the License.
 | |
| 
 | |
| #include "absl/synchronization/internal/waiter.h"
 | |
| 
 | |
| #include "absl/base/config.h"
 | |
| 
 | |
| #ifdef _WIN32
 | |
| #include <windows.h>
 | |
| #else
 | |
| #include <pthread.h>
 | |
| #include <sys/time.h>
 | |
| #include <unistd.h>
 | |
| #endif
 | |
| 
 | |
| #ifdef __linux__
 | |
| #include <linux/futex.h>
 | |
| #include <sys/syscall.h>
 | |
| #endif
 | |
| 
 | |
| #ifdef ABSL_HAVE_SEMAPHORE_H
 | |
| #include <semaphore.h>
 | |
| #endif
 | |
| 
 | |
| #include <errno.h>
 | |
| #include <stdio.h>
 | |
| #include <time.h>
 | |
| 
 | |
| #include <atomic>
 | |
| #include <cassert>
 | |
| #include <cstdint>
 | |
| #include <new>
 | |
| #include <type_traits>
 | |
| 
 | |
| #include "absl/base/internal/raw_logging.h"
 | |
| #include "absl/base/internal/thread_identity.h"
 | |
| #include "absl/base/optimization.h"
 | |
| #include "absl/synchronization/internal/kernel_timeout.h"
 | |
| 
 | |
| namespace absl {
 | |
| namespace synchronization_internal {
 | |
| 
 | |
| static void MaybeBecomeIdle() {
 | |
|   base_internal::ThreadIdentity *identity =
 | |
|       base_internal::CurrentThreadIdentityIfPresent();
 | |
|   assert(identity != nullptr);
 | |
|   const bool is_idle = identity->is_idle.load(std::memory_order_relaxed);
 | |
|   const int ticker = identity->ticker.load(std::memory_order_relaxed);
 | |
|   const int wait_start = identity->wait_start.load(std::memory_order_relaxed);
 | |
|   if (!is_idle && ticker - wait_start > Waiter::kIdlePeriods) {
 | |
|     identity->is_idle.store(true, std::memory_order_relaxed);
 | |
|   }
 | |
| }
 | |
| 
 | |
| #if ABSL_WAITER_MODE == ABSL_WAITER_MODE_FUTEX
 | |
| 
 | |
| // Some Android headers are missing these definitions even though they
 | |
| // support these futex operations.
 | |
| #ifdef __BIONIC__
 | |
| #ifndef SYS_futex
 | |
| #define SYS_futex __NR_futex
 | |
| #endif
 | |
| #ifndef FUTEX_WAIT_BITSET
 | |
| #define FUTEX_WAIT_BITSET 9
 | |
| #endif
 | |
| #ifndef FUTEX_PRIVATE_FLAG
 | |
| #define FUTEX_PRIVATE_FLAG 128
 | |
| #endif
 | |
| #ifndef FUTEX_CLOCK_REALTIME
 | |
| #define FUTEX_CLOCK_REALTIME 256
 | |
| #endif
 | |
| #ifndef FUTEX_BITSET_MATCH_ANY
 | |
| #define FUTEX_BITSET_MATCH_ANY 0xFFFFFFFF
 | |
| #endif
 | |
| #endif
 | |
| 
 | |
| class Futex {
 | |
|  public:
 | |
|   static int WaitUntil(std::atomic<int32_t> *v, int32_t val,
 | |
|                        KernelTimeout t) {
 | |
|     int err = 0;
 | |
|     if (t.has_timeout()) {
 | |
|       // https://locklessinc.com/articles/futex_cheat_sheet/
 | |
|       // Unlike FUTEX_WAIT, FUTEX_WAIT_BITSET uses absolute time.
 | |
|       struct timespec abs_timeout = t.MakeAbsTimespec();
 | |
|       // Atomically check that the futex value is still 0, and if it
 | |
|       // is, sleep until abs_timeout or until woken by FUTEX_WAKE.
 | |
|       err = syscall(
 | |
|           SYS_futex, reinterpret_cast<int32_t *>(v),
 | |
|           FUTEX_WAIT_BITSET | FUTEX_PRIVATE_FLAG | FUTEX_CLOCK_REALTIME, val,
 | |
|           &abs_timeout, nullptr, FUTEX_BITSET_MATCH_ANY);
 | |
|     } else {
 | |
|       // Atomically check that the futex value is still 0, and if it
 | |
|       // is, sleep until woken by FUTEX_WAKE.
 | |
|       err = syscall(SYS_futex, reinterpret_cast<int32_t *>(v),
 | |
|                     FUTEX_WAIT | FUTEX_PRIVATE_FLAG, val, nullptr);
 | |
|     }
 | |
|     if (err != 0) {
 | |
|       err = -errno;
 | |
|     }
 | |
|     return err;
 | |
|   }
 | |
| 
 | |
|   static int Wake(std::atomic<int32_t> *v, int32_t count) {
 | |
|     int err = syscall(SYS_futex, reinterpret_cast<int32_t *>(v),
 | |
|                       FUTEX_WAKE | FUTEX_PRIVATE_FLAG, count);
 | |
|     if (ABSL_PREDICT_FALSE(err < 0)) {
 | |
|       err = -errno;
 | |
|     }
 | |
|     return err;
 | |
|   }
 | |
| };
 | |
| 
 | |
| Waiter::Waiter() {
 | |
|   futex_.store(0, std::memory_order_relaxed);
 | |
| }
 | |
| 
 | |
| Waiter::~Waiter() = default;
 | |
| 
 | |
| bool Waiter::Wait(KernelTimeout t) {
 | |
|   // Loop until we can atomically decrement futex from a positive
 | |
|   // value, waiting on a futex while we believe it is zero.
 | |
|   // Note that, since the thread ticker is just reset, we don't need to check
 | |
|   // whether the thread is idle on the very first pass of the loop.
 | |
|   bool first_pass = true;
 | |
|   while (true) {
 | |
|     int32_t x = futex_.load(std::memory_order_relaxed);
 | |
|     if (x != 0) {
 | |
|       if (!futex_.compare_exchange_weak(x, x - 1,
 | |
|                                         std::memory_order_acquire,
 | |
|                                         std::memory_order_relaxed)) {
 | |
|         continue;  // Raced with someone, retry.
 | |
|       }
 | |
|       return true;  // Consumed a wakeup, we are done.
 | |
|     }
 | |
| 
 | |
| 
 | |
|     if (!first_pass) MaybeBecomeIdle();
 | |
|     const int err = Futex::WaitUntil(&futex_, 0, t);
 | |
|     if (err != 0) {
 | |
|       if (err == -EINTR || err == -EWOULDBLOCK) {
 | |
|         // Do nothing, the loop will retry.
 | |
|       } else if (err == -ETIMEDOUT) {
 | |
|         return false;
 | |
|       } else {
 | |
|         ABSL_RAW_LOG(FATAL, "Futex operation failed with error %d\n", err);
 | |
|       }
 | |
|     }
 | |
|     first_pass = false;
 | |
|   }
 | |
| }
 | |
| 
 | |
| void Waiter::Post() {
 | |
|   if (futex_.fetch_add(1, std::memory_order_release) == 0) {
 | |
|     // We incremented from 0, need to wake a potential waiter.
 | |
|     Poke();
 | |
|   }
 | |
| }
 | |
| 
 | |
| void Waiter::Poke() {
 | |
|   // Wake one thread waiting on the futex.
 | |
|   const int err = Futex::Wake(&futex_, 1);
 | |
|   if (ABSL_PREDICT_FALSE(err < 0)) {
 | |
|     ABSL_RAW_LOG(FATAL, "Futex operation failed with error %d\n", err);
 | |
|   }
 | |
| }
 | |
| 
 | |
| #elif ABSL_WAITER_MODE == ABSL_WAITER_MODE_CONDVAR
 | |
| 
 | |
| class PthreadMutexHolder {
 | |
|  public:
 | |
|   explicit PthreadMutexHolder(pthread_mutex_t *mu) : mu_(mu) {
 | |
|     const int err = pthread_mutex_lock(mu_);
 | |
|     if (err != 0) {
 | |
|       ABSL_RAW_LOG(FATAL, "pthread_mutex_lock failed: %d", err);
 | |
|     }
 | |
|   }
 | |
| 
 | |
|   PthreadMutexHolder(const PthreadMutexHolder &rhs) = delete;
 | |
|   PthreadMutexHolder &operator=(const PthreadMutexHolder &rhs) = delete;
 | |
| 
 | |
|   ~PthreadMutexHolder() {
 | |
|     const int err = pthread_mutex_unlock(mu_);
 | |
|     if (err != 0) {
 | |
|       ABSL_RAW_LOG(FATAL, "pthread_mutex_unlock failed: %d", err);
 | |
|     }
 | |
|   }
 | |
| 
 | |
|  private:
 | |
|   pthread_mutex_t *mu_;
 | |
| };
 | |
| 
 | |
| Waiter::Waiter() {
 | |
|   const int err = pthread_mutex_init(&mu_, 0);
 | |
|   if (err != 0) {
 | |
|     ABSL_RAW_LOG(FATAL, "pthread_mutex_init failed: %d", err);
 | |
|   }
 | |
| 
 | |
|   const int err2 = pthread_cond_init(&cv_, 0);
 | |
|   if (err2 != 0) {
 | |
|     ABSL_RAW_LOG(FATAL, "pthread_cond_init failed: %d", err2);
 | |
|   }
 | |
| 
 | |
|   waiter_count_ = 0;
 | |
|   wakeup_count_ = 0;
 | |
| }
 | |
| 
 | |
| Waiter::~Waiter() {
 | |
|   const int err = pthread_mutex_destroy(&mu_);
 | |
|   if (err != 0) {
 | |
|     ABSL_RAW_LOG(FATAL, "pthread_mutex_destroy failed: %d", err);
 | |
|   }
 | |
| 
 | |
|   const int err2 = pthread_cond_destroy(&cv_);
 | |
|   if (err2 != 0) {
 | |
|     ABSL_RAW_LOG(FATAL, "pthread_cond_destroy failed: %d", err2);
 | |
|   }
 | |
| }
 | |
| 
 | |
| bool Waiter::Wait(KernelTimeout t) {
 | |
|   struct timespec abs_timeout;
 | |
|   if (t.has_timeout()) {
 | |
|     abs_timeout = t.MakeAbsTimespec();
 | |
|   }
 | |
| 
 | |
|   PthreadMutexHolder h(&mu_);
 | |
|   ++waiter_count_;
 | |
|   // Loop until we find a wakeup to consume or timeout.
 | |
|   // Note that, since the thread ticker is just reset, we don't need to check
 | |
|   // whether the thread is idle on the very first pass of the loop.
 | |
|   bool first_pass = true;
 | |
|   while (wakeup_count_ == 0) {
 | |
|     if (!first_pass) MaybeBecomeIdle();
 | |
|     // No wakeups available, time to wait.
 | |
|     if (!t.has_timeout()) {
 | |
|       const int err = pthread_cond_wait(&cv_, &mu_);
 | |
|       if (err != 0) {
 | |
|         ABSL_RAW_LOG(FATAL, "pthread_cond_wait failed: %d", err);
 | |
|       }
 | |
|     } else {
 | |
|       const int err = pthread_cond_timedwait(&cv_, &mu_, &abs_timeout);
 | |
|       if (err == ETIMEDOUT) {
 | |
|         --waiter_count_;
 | |
|         return false;
 | |
|       }
 | |
|       if (err != 0) {
 | |
|         ABSL_RAW_LOG(FATAL, "pthread_cond_timedwait failed: %d", err);
 | |
|       }
 | |
|     }
 | |
|     first_pass = false;
 | |
|   }
 | |
|   // Consume a wakeup and we're done.
 | |
|   --wakeup_count_;
 | |
|   --waiter_count_;
 | |
|   return true;
 | |
| }
 | |
| 
 | |
| void Waiter::Post() {
 | |
|   PthreadMutexHolder h(&mu_);
 | |
|   ++wakeup_count_;
 | |
|   InternalCondVarPoke();
 | |
| }
 | |
| 
 | |
| void Waiter::Poke() {
 | |
|   PthreadMutexHolder h(&mu_);
 | |
|   InternalCondVarPoke();
 | |
| }
 | |
| 
 | |
| void Waiter::InternalCondVarPoke() {
 | |
|   if (waiter_count_ != 0) {
 | |
|     const int err = pthread_cond_signal(&cv_);
 | |
|     if (ABSL_PREDICT_FALSE(err != 0)) {
 | |
|       ABSL_RAW_LOG(FATAL, "pthread_cond_signal failed: %d", err);
 | |
|     }
 | |
|   }
 | |
| }
 | |
| 
 | |
| #elif ABSL_WAITER_MODE == ABSL_WAITER_MODE_SEM
 | |
| 
 | |
| Waiter::Waiter() {
 | |
|   if (sem_init(&sem_, 0, 0) != 0) {
 | |
|     ABSL_RAW_LOG(FATAL, "sem_init failed with errno %d\n", errno);
 | |
|   }
 | |
|   wakeups_.store(0, std::memory_order_relaxed);
 | |
| }
 | |
| 
 | |
| Waiter::~Waiter() {
 | |
|   if (sem_destroy(&sem_) != 0) {
 | |
|     ABSL_RAW_LOG(FATAL, "sem_destroy failed with errno %d\n", errno);
 | |
|   }
 | |
| }
 | |
| 
 | |
| bool Waiter::Wait(KernelTimeout t) {
 | |
|   struct timespec abs_timeout;
 | |
|   if (t.has_timeout()) {
 | |
|     abs_timeout = t.MakeAbsTimespec();
 | |
|   }
 | |
| 
 | |
|   // Loop until we timeout or consume a wakeup.
 | |
|   // Note that, since the thread ticker is just reset, we don't need to check
 | |
|   // whether the thread is idle on the very first pass of the loop.
 | |
|   bool first_pass = true;
 | |
|   while (true) {
 | |
|     int x = wakeups_.load(std::memory_order_relaxed);
 | |
|     if (x != 0) {
 | |
|       if (!wakeups_.compare_exchange_weak(x, x - 1,
 | |
|                                           std::memory_order_acquire,
 | |
|                                           std::memory_order_relaxed)) {
 | |
|         continue;  // Raced with someone, retry.
 | |
|       }
 | |
|       // Successfully consumed a wakeup, we're done.
 | |
|       return true;
 | |
|     }
 | |
| 
 | |
|     if (!first_pass) MaybeBecomeIdle();
 | |
|     // Nothing to consume, wait (looping on EINTR).
 | |
|     while (true) {
 | |
|       if (!t.has_timeout()) {
 | |
|         if (sem_wait(&sem_) == 0) break;
 | |
|         if (errno == EINTR) continue;
 | |
|         ABSL_RAW_LOG(FATAL, "sem_wait failed: %d", errno);
 | |
|       } else {
 | |
|         if (sem_timedwait(&sem_, &abs_timeout) == 0) break;
 | |
|         if (errno == EINTR) continue;
 | |
|         if (errno == ETIMEDOUT) return false;
 | |
|         ABSL_RAW_LOG(FATAL, "sem_timedwait failed: %d", errno);
 | |
|       }
 | |
|     }
 | |
|     first_pass = false;
 | |
|   }
 | |
| }
 | |
| 
 | |
| void Waiter::Post() {
 | |
|   // Post a wakeup.
 | |
|   if (wakeups_.fetch_add(1, std::memory_order_release) == 0) {
 | |
|     // We incremented from 0, need to wake a potential waiter.
 | |
|     Poke();
 | |
|   }
 | |
| }
 | |
| 
 | |
| void Waiter::Poke() {
 | |
|   if (sem_post(&sem_) != 0) {  // Wake any semaphore waiter.
 | |
|     ABSL_RAW_LOG(FATAL, "sem_post failed with errno %d\n", errno);
 | |
|   }
 | |
| }
 | |
| 
 | |
| #elif ABSL_WAITER_MODE == ABSL_WAITER_MODE_WIN32
 | |
| 
 | |
| class Waiter::WinHelper {
 | |
|  public:
 | |
|   static SRWLOCK *GetLock(Waiter *w) {
 | |
|     return reinterpret_cast<SRWLOCK *>(&w->mu_storage_);
 | |
|   }
 | |
| 
 | |
|   static CONDITION_VARIABLE *GetCond(Waiter *w) {
 | |
|     return reinterpret_cast<CONDITION_VARIABLE *>(&w->cv_storage_);
 | |
|   }
 | |
| 
 | |
|   static_assert(sizeof(SRWLOCK) == sizeof(Waiter::SRWLockStorage),
 | |
|                 "SRWLockStorage does not have the same size as SRWLOCK");
 | |
|   static_assert(
 | |
|       alignof(SRWLOCK) == alignof(Waiter::SRWLockStorage),
 | |
|       "SRWLockStorage does not have the same alignment as SRWLOCK");
 | |
| 
 | |
|   static_assert(sizeof(CONDITION_VARIABLE) ==
 | |
|                     sizeof(Waiter::ConditionVariableStorage),
 | |
|                 "ABSL_CONDITION_VARIABLE_STORAGE does not have the same size "
 | |
|                 "as CONDITION_VARIABLE");
 | |
|   static_assert(alignof(CONDITION_VARIABLE) ==
 | |
|                     alignof(Waiter::ConditionVariableStorage),
 | |
|                 "ConditionVariableStorage does not have the same "
 | |
|                 "alignment as CONDITION_VARIABLE");
 | |
| 
 | |
|   // The SRWLOCK and CONDITION_VARIABLE types must be trivially constructible
 | |
|   // and destructible because we never call their constructors or destructors.
 | |
|   static_assert(std::is_trivially_constructible<SRWLOCK>::value,
 | |
|                 "The SRWLOCK type must be trivially constructible");
 | |
|   static_assert(std::is_trivially_constructible<CONDITION_VARIABLE>::value,
 | |
|                 "The CONDITION_VARIABLE type must be trivially constructible");
 | |
|   static_assert(std::is_trivially_destructible<SRWLOCK>::value,
 | |
|                 "The SRWLOCK type must be trivially destructible");
 | |
|   static_assert(std::is_trivially_destructible<CONDITION_VARIABLE>::value,
 | |
|                 "The CONDITION_VARIABLE type must be trivially destructible");
 | |
| };
 | |
| 
 | |
| class LockHolder {
 | |
|  public:
 | |
|   explicit LockHolder(SRWLOCK* mu) : mu_(mu) {
 | |
|     AcquireSRWLockExclusive(mu_);
 | |
|   }
 | |
| 
 | |
|   LockHolder(const LockHolder&) = delete;
 | |
|   LockHolder& operator=(const LockHolder&) = delete;
 | |
| 
 | |
|   ~LockHolder() {
 | |
|     ReleaseSRWLockExclusive(mu_);
 | |
|   }
 | |
| 
 | |
|  private:
 | |
|   SRWLOCK* mu_;
 | |
| };
 | |
| 
 | |
| Waiter::Waiter() {
 | |
|   auto *mu = ::new (static_cast<void *>(&mu_storage_)) SRWLOCK;
 | |
|   auto *cv = ::new (static_cast<void *>(&cv_storage_)) CONDITION_VARIABLE;
 | |
|   InitializeSRWLock(mu);
 | |
|   InitializeConditionVariable(cv);
 | |
|   waiter_count_ = 0;
 | |
|   wakeup_count_ = 0;
 | |
| }
 | |
| 
 | |
| // SRW locks and condition variables do not need to be explicitly destroyed.
 | |
| // https://docs.microsoft.com/en-us/windows/win32/api/synchapi/nf-synchapi-initializesrwlock
 | |
| // https://stackoverflow.com/questions/28975958/why-does-windows-have-no-deleteconditionvariable-function-to-go-together-with
 | |
| Waiter::~Waiter() = default;
 | |
| 
 | |
| bool Waiter::Wait(KernelTimeout t) {
 | |
|   SRWLOCK *mu = WinHelper::GetLock(this);
 | |
|   CONDITION_VARIABLE *cv = WinHelper::GetCond(this);
 | |
| 
 | |
|   LockHolder h(mu);
 | |
|   ++waiter_count_;
 | |
| 
 | |
|   // Loop until we find a wakeup to consume or timeout.
 | |
|   // Note that, since the thread ticker is just reset, we don't need to check
 | |
|   // whether the thread is idle on the very first pass of the loop.
 | |
|   bool first_pass = true;
 | |
|   while (wakeup_count_ == 0) {
 | |
|     if (!first_pass) MaybeBecomeIdle();
 | |
|     // No wakeups available, time to wait.
 | |
|     if (!SleepConditionVariableSRW(cv, mu, t.InMillisecondsFromNow(), 0)) {
 | |
|       // GetLastError() returns a Win32 DWORD, but we assign to
 | |
|       // unsigned long to simplify the ABSL_RAW_LOG case below.  The uniform
 | |
|       // initialization guarantees this is not a narrowing conversion.
 | |
|       const unsigned long err{GetLastError()};  // NOLINT(runtime/int)
 | |
|       if (err == ERROR_TIMEOUT) {
 | |
|         --waiter_count_;
 | |
|         return false;
 | |
|       } else {
 | |
|         ABSL_RAW_LOG(FATAL, "SleepConditionVariableSRW failed: %lu", err);
 | |
|       }
 | |
|     }
 | |
|     first_pass = false;
 | |
|   }
 | |
|   // Consume a wakeup and we're done.
 | |
|   --wakeup_count_;
 | |
|   --waiter_count_;
 | |
|   return true;
 | |
| }
 | |
| 
 | |
| void Waiter::Post() {
 | |
|   LockHolder h(WinHelper::GetLock(this));
 | |
|   ++wakeup_count_;
 | |
|   InternalCondVarPoke();
 | |
| }
 | |
| 
 | |
| void Waiter::Poke() {
 | |
|   LockHolder h(WinHelper::GetLock(this));
 | |
|   InternalCondVarPoke();
 | |
| }
 | |
| 
 | |
| void Waiter::InternalCondVarPoke() {
 | |
|   if (waiter_count_ != 0) {
 | |
|     WakeConditionVariable(WinHelper::GetCond(this));
 | |
|   }
 | |
| }
 | |
| 
 | |
| #else
 | |
| #error Unknown ABSL_WAITER_MODE
 | |
| #endif
 | |
| 
 | |
| }  // namespace synchronization_internal
 | |
| }  // namespace absl
 |