|
|
|
// 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/blocking_counter.h"
|
|
|
|
|
|
|
|
#include <thread> // NOLINT(build/c++11)
|
|
|
|
#include <vector>
|
|
|
|
|
|
|
|
#include "gtest/gtest.h"
|
|
|
|
#include "absl/time/clock.h"
|
|
|
|
#include "absl/time/time.h"
|
|
|
|
|
|
|
|
namespace absl {
|
|
|
|
ABSL_NAMESPACE_BEGIN
|
|
|
|
namespace {
|
|
|
|
|
|
|
|
void PauseAndDecreaseCounter(BlockingCounter* counter, int* done) {
|
|
|
|
absl::SleepFor(absl::Seconds(1));
|
|
|
|
*done = 1;
|
|
|
|
counter->DecrementCount();
|
|
|
|
}
|
|
|
|
|
|
|
|
TEST(BlockingCounterTest, BasicFunctionality) {
|
|
|
|
// This test verifies that BlockingCounter functions correctly. Starts a
|
|
|
|
// number of threads that just sleep for a second and decrement a counter.
|
|
|
|
|
|
|
|
// Initialize the counter.
|
|
|
|
const int num_workers = 10;
|
|
|
|
BlockingCounter counter(num_workers);
|
|
|
|
|
|
|
|
std::vector<std::thread> workers;
|
|
|
|
std::vector<int> done(num_workers, 0);
|
|
|
|
|
|
|
|
// Start a number of parallel tasks that will just wait for a seconds and
|
|
|
|
// then decrement the count.
|
|
|
|
workers.reserve(num_workers);
|
|
|
|
for (int k = 0; k < num_workers; k++) {
|
|
|
|
workers.emplace_back(
|
|
|
|
[&counter, &done, k] { PauseAndDecreaseCounter(&counter, &done[k]); });
|
|
|
|
}
|
|
|
|
|
|
|
|
// Wait for the threads to have all finished.
|
|
|
|
counter.Wait();
|
|
|
|
|
|
|
|
// Check that all the workers have completed.
|
|
|
|
for (int k = 0; k < num_workers; k++) {
|
|
|
|
EXPECT_EQ(1, done[k]);
|
|
|
|
}
|
|
|
|
|
|
|
|
for (std::thread& w : workers) {
|
|
|
|
w.join();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
Export of internal Abseil changes
--
9fc37c11b9e46287acef00ee06ed9adcba54dd13 by Greg Falcon <gfalcon@google.com>:
Rename absl::hash_internal::HashState to absl::hash_internal::MixingHashState.
Before this change, we had two classes named HashState: absl::HashState, the public API used for type erasure, and absl::hash_internal::HashState, the internal concrete implementation ordinarily used.
The internal class used to be named `CityHashState`, but we renamed it to `HashState` it when we changed underlying hash implementation to wyhash. This inadvertent naming conflict made the code much harder to read, and this change intends to undo that.
PiperOrigin-RevId: 373481959
--
4aec55ffddebd085c239352a2e20721091f719a1 by Greg Falcon <gfalcon@google.com>:
Introduce absl::HashOf(), a convenience wrapper around absl::Hash that calculates hashes from the values of its arguments.
PiperOrigin-RevId: 373461406
--
86b5fd8db50bbc8bd0aa9258523527381fe0445d by Abseil Team <absl-team@google.com>:
Improve speed of BlockingCounter by making its most common path lock free.
With the new implementation, the fast path of BlockingCounter::DecrementCount()
is only a fetch_sub operation. This is most times much more efficient than the
previous implementation (full mutex lock/unlock). As a matter of fact, in most
actual usecases in practice, the waiter thread is already waiting on the
Wait() call when DecrementCount() is called, which makes Mutex::Unlock() take
the slow path as there's a waiter thread that it might need to wake up.
PiperOrigin-RevId: 373394164
--
65c876be5eac0cd32583ff8535ede4109d39cf3f by Martijn Vels <mvels@google.com>:
Move the 'sample copied cord' logic into MaybeTrackCord(),
This changes move the logic for selecting if a cord should remain being sampled from Cord to CordzInfo::MaybeTrackCord, and updates the documentation for the latter method.
PiperOrigin-RevId: 373363168
--
e84410bd0aada293a81dfb82656c952e209e21fb by Martijn Vels <mvels@google.com>:
Add check for the first call to cordz_should_profile() for each thread.
This prevents the first cord of a newly created thread to be always sampled, which is a 'bad' kind of determinism for sampling.
PiperOrigin-RevId: 373229768
--
bf09c589dc099ac8f4af780bf7e609c53c27574c by Samuel Benzaquen <sbenza@google.com>:
Refactor the Flags structure into an enum.
This gives us more control over the representation and allows for easier
merging during parsing.
PiperOrigin-RevId: 373163038
--
b947b0c51083b7b6508284b5d31819596c91729e by Derek Mauro <dmauro@google.com>:
Fixes warnings about shadowed variables
Fixes #956
PiperOrigin-RevId: 373158133
GitOrigin-RevId: 9fc37c11b9e46287acef00ee06ed9adcba54dd13
Change-Id: I91f35699f9bf439d1a870c6493946a310afe088c
4 years ago
|
|
|
TEST(BlockingCounterTest, WaitZeroInitialCount) {
|
|
|
|
BlockingCounter counter(0);
|
|
|
|
counter.Wait();
|
|
|
|
}
|
|
|
|
|
|
|
|
#if GTEST_HAS_DEATH_TEST
|
|
|
|
TEST(BlockingCounterTest, WaitNegativeInitialCount) {
|
|
|
|
EXPECT_DEATH(BlockingCounter counter(-1),
|
|
|
|
"BlockingCounter initial_count negative");
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
} // namespace
|
|
|
|
ABSL_NAMESPACE_END
|
|
|
|
} // namespace absl
|