blocking_counter.cc 1.7 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253
  1. // Copyright 2017 The Abseil Authors.
  2. //
  3. // Licensed under the Apache License, Version 2.0 (the "License");
  4. // you may not use this file except in compliance with the License.
  5. // You may obtain a copy of the License at
  6. //
  7. // http://www.apache.org/licenses/LICENSE-2.0
  8. //
  9. // Unless required by applicable law or agreed to in writing, software
  10. // distributed under the License is distributed on an "AS IS" BASIS,
  11. // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  12. // See the License for the specific language governing permissions and
  13. // limitations under the License.
  14. #include "absl/synchronization/blocking_counter.h"
  15. namespace absl {
  16. // Return whether int *arg is zero.
  17. static bool IsZero(void *arg) {
  18. return 0 == *reinterpret_cast<int *>(arg);
  19. }
  20. bool BlockingCounter::DecrementCount() {
  21. MutexLock l(&lock_);
  22. count_--;
  23. if (count_ < 0) {
  24. ABSL_RAW_LOG(
  25. FATAL,
  26. "BlockingCounter::DecrementCount() called too many times. count=%d",
  27. count_);
  28. }
  29. return count_ == 0;
  30. }
  31. void BlockingCounter::Wait() {
  32. MutexLock l(&this->lock_);
  33. ABSL_RAW_CHECK(count_ >= 0, "BlockingCounter underflow");
  34. // only one thread may call Wait(). To support more than one thread,
  35. // implement a counter num_to_exit, like in the Barrier class.
  36. ABSL_RAW_CHECK(num_waiting_ == 0, "multiple threads called Wait()");
  37. num_waiting_++;
  38. this->lock_.Await(Condition(IsZero, &this->count_));
  39. // At this point, We know that all threads executing DecrementCount have
  40. // released the lock, and so will not touch this object again.
  41. // Therefore, the thread calling this method is free to delete the object
  42. // after we return from this method.
  43. }
  44. } // namespace absl