|
|
|
// Copyright 2018 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.
|
|
|
|
//
|
|
|
|
// -----------------------------------------------------------------------------
|
|
|
|
// mocking_bit_gen.h
|
|
|
|
// -----------------------------------------------------------------------------
|
|
|
|
//
|
|
|
|
// This file includes an `absl::MockingBitGen` class to use as a mock within the
|
|
|
|
// Googletest testing framework. Such a mock is useful to provide deterministic
|
|
|
|
// values as return values within (otherwise random) Abseil distribution
|
|
|
|
// functions. Such determinism within a mock is useful within testing frameworks
|
|
|
|
// to test otherwise indeterminate APIs.
|
|
|
|
//
|
|
|
|
// More information about the Googletest testing framework is available at
|
|
|
|
// https://github.com/google/googletest
|
|
|
|
|
|
|
|
#ifndef ABSL_RANDOM_MOCKING_BIT_GEN_H_
|
|
|
|
#define ABSL_RANDOM_MOCKING_BIT_GEN_H_
|
|
|
|
|
|
|
|
#include <iterator>
|
|
|
|
#include <limits>
|
|
|
|
#include <memory>
|
|
|
|
#include <tuple>
|
|
|
|
#include <type_traits>
|
|
|
|
#include <utility>
|
|
|
|
|
|
|
|
#include "gmock/gmock.h"
|
|
|
|
#include "gtest/gtest.h"
|
|
|
|
#include "absl/base/internal/fast_type_id.h"
|
|
|
|
#include "absl/container/flat_hash_map.h"
|
|
|
|
#include "absl/meta/type_traits.h"
|
|
|
|
#include "absl/random/distributions.h"
|
|
|
|
#include "absl/random/internal/distribution_caller.h"
|
|
|
|
#include "absl/random/random.h"
|
|
|
|
#include "absl/strings/str_cat.h"
|
|
|
|
#include "absl/strings/str_join.h"
|
|
|
|
#include "absl/types/span.h"
|
|
|
|
#include "absl/types/variant.h"
|
|
|
|
#include "absl/utility/utility.h"
|
|
|
|
|
|
|
|
namespace absl {
|
|
|
|
ABSL_NAMESPACE_BEGIN
|
|
|
|
|
|
|
|
namespace random_internal {
|
|
|
|
template <typename>
|
|
|
|
struct DistributionCaller;
|
|
|
|
class MockHelpers;
|
|
|
|
|
|
|
|
} // namespace random_internal
|
|
|
|
class BitGenRef;
|
|
|
|
|
|
|
|
// MockingBitGen
|
|
|
|
//
|
|
|
|
// `absl::MockingBitGen` is a mock Uniform Random Bit Generator (URBG) class
|
|
|
|
// which can act in place of an `absl::BitGen` URBG within tests using the
|
|
|
|
// Googletest testing framework.
|
|
|
|
//
|
|
|
|
// Usage:
|
|
|
|
//
|
|
|
|
// Use an `absl::MockingBitGen` along with a mock distribution object (within
|
|
|
|
// mock_distributions.h) inside Googletest constructs such as ON_CALL(),
|
|
|
|
// EXPECT_TRUE(), etc. to produce deterministic results conforming to the
|
|
|
|
// distribution's API contract.
|
|
|
|
//
|
|
|
|
// Example:
|
|
|
|
//
|
|
|
|
// // Mock a call to an `absl::Bernoulli` distribution using Googletest
|
|
|
|
// absl::MockingBitGen bitgen;
|
|
|
|
//
|
|
|
|
// ON_CALL(absl::MockBernoulli(), Call(bitgen, 0.5))
|
|
|
|
// .WillByDefault(testing::Return(true));
|
|
|
|
// EXPECT_TRUE(absl::Bernoulli(bitgen, 0.5));
|
|
|
|
//
|
|
|
|
// // Mock a call to an `absl::Uniform` distribution within Googletest
|
|
|
|
// absl::MockingBitGen bitgen;
|
|
|
|
//
|
|
|
|
// ON_CALL(absl::MockUniform<int>(), Call(bitgen, testing::_, testing::_))
|
|
|
|
// .WillByDefault([] (int low, int high) {
|
|
|
|
// return low + (high - low) / 2;
|
|
|
|
// });
|
|
|
|
//
|
|
|
|
// EXPECT_EQ(absl::Uniform<int>(gen, 0, 10), 5);
|
|
|
|
// EXPECT_EQ(absl::Uniform<int>(gen, 30, 40), 35);
|
|
|
|
//
|
|
|
|
// At this time, only mock distributions supplied within the Abseil random
|
|
|
|
// library are officially supported.
|
|
|
|
//
|
|
|
|
// EXPECT_CALL and ON_CALL need to be made within the same DLL component as
|
|
|
|
// the call to absl::Uniform and related methods, otherwise mocking will fail
|
|
|
|
// since the underlying implementation creates a type-specific pointer which
|
|
|
|
// will be distinct across different DLL boundaries.
|
|
|
|
//
|
|
|
|
class MockingBitGen {
|
|
|
|
public:
|
|
|
|
MockingBitGen() = default;
|
|
|
|
~MockingBitGen() = default;
|
|
|
|
|
|
|
|
// URBG interface
|
|
|
|
using result_type = absl::BitGen::result_type;
|
|
|
|
|
|
|
|
static constexpr result_type(min)() { return (absl::BitGen::min)(); }
|
|
|
|
static constexpr result_type(max)() { return (absl::BitGen::max)(); }
|
|
|
|
result_type operator()() { return gen_(); }
|
|
|
|
|
|
|
|
private:
|
|
|
|
// GetMockFnType returns the testing::MockFunction for a result and tuple.
|
|
|
|
// This method only exists for type deduction and is otherwise unimplemented.
|
|
|
|
template <typename ResultT, typename... Args>
|
|
|
|
static auto GetMockFnType(ResultT, std::tuple<Args...>)
|
|
|
|
-> ::testing::MockFunction<ResultT(Args...)>;
|
|
|
|
|
|
|
|
// MockFnCaller is a helper method for use with absl::apply to
|
|
|
|
// apply an ArgTupleT to a compatible MockFunction.
|
|
|
|
// NOTE: MockFnCaller is essentially equivalent to the lambda:
|
|
|
|
// [fn](auto... args) { return fn->Call(std::move(args)...)}
|
|
|
|
// however that fails to build on some supported platforms.
|
|
|
|
template <typename MockFnType, typename ResultT, typename Tuple>
|
|
|
|
struct MockFnCaller;
|
|
|
|
|
|
|
|
// specialization for std::tuple.
|
|
|
|
template <typename MockFnType, typename ResultT, typename... Args>
|
|
|
|
struct MockFnCaller<MockFnType, ResultT, std::tuple<Args...>> {
|
|
|
|
MockFnType* fn;
|
|
|
|
inline ResultT operator()(Args... args) {
|
|
|
|
return fn->Call(std::move(args)...);
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
// FunctionHolder owns a particular ::testing::MockFunction associated with
|
|
|
|
// a mocked type signature, and implement the type-erased Apply call, which
|
|
|
|
// applies type-erased arguments to the mock.
|
|
|
|
class FunctionHolder {
|
|
|
|
public:
|
|
|
|
virtual ~FunctionHolder() = default;
|
|
|
|
|
|
|
|
// Call is a dispatch function which converts the
|
|
|
|
// generic type-erased parameters into a specific mock invocation call.
|
|
|
|
virtual void Apply(/*ArgTupleT*/ void* args_tuple,
|
|
|
|
/*ResultT*/ void* result) = 0;
|
|
|
|
};
|
|
|
|
|
|
|
|
template <typename MockFnType, typename ResultT, typename ArgTupleT>
|
|
|
|
class FunctionHolderImpl final : public FunctionHolder {
|
|
|
|
public:
|
|
|
|
void Apply(void* args_tuple, void* result) override {
|
|
|
|
// Requires tuple_args to point to a ArgTupleT, which is a
|
|
|
|
// std::tuple<Args...> used to invoke the mock function. Requires result
|
|
|
|
// to point to a ResultT, which is the result of the call.
|
|
|
|
*static_cast<ResultT*>(result) =
|
|
|
|
absl::apply(MockFnCaller<MockFnType, ResultT, ArgTupleT>{&mock_fn_},
|
|
|
|
*static_cast<ArgTupleT*>(args_tuple));
|
|
|
|
}
|
|
|
|
|
|
|
|
MockFnType mock_fn_;
|
|
|
|
};
|
|
|
|
|
|
|
|
// MockingBitGen::RegisterMock
|
|
|
|
//
|
|
|
|
// RegisterMock<ResultT, ArgTupleT>(FastTypeIdType) is the main extension
|
|
|
|
// point for extending the MockingBitGen framework. It provides a mechanism to
|
|
|
|
// install a mock expectation for a function like ResultT(Args...) keyed by
|
|
|
|
// type_idex onto the MockingBitGen context. The key is that the type_index
|
|
|
|
// used to register must match the type index used to call the mock.
|
|
|
|
//
|
|
|
|
// The returned MockFunction<...> type can be used to setup additional
|
|
|
|
// distribution parameters of the expectation.
|
Export of internal Abseil changes
--
5ed5dc9e17c66c298ee31cefc941a46348d8ad34 by Abseil Team <absl-team@google.com>:
Fix typo.
PiperOrigin-RevId: 362040582
--
ac704b53a49becc42f77e4529d3952f8e7d18ce4 by Abseil Team <absl-team@google.com>:
Fix a typo in a comment.
PiperOrigin-RevId: 361576641
--
d20ccb27b7e9b53481e9192c1aae5202c06bfcb1 by Derek Mauro <dmauro@google.com>:
Remove the inline keyword from functions that aren't defined
in the header.
This may fix #910.
PiperOrigin-RevId: 361551300
--
aed9ae1dffa7b228dcb6ffbeb2fe06a13970c72b by Laramie Leavitt <lar@google.com>:
Propagate nice/strict/naggy state on absl::MockingBitGen.
Allowing NiceMocks reduces the log spam for un-mocked calls, and it enables nicer setup with ON_CALL, so it is desirable to support it in absl::MockingBitGen. Internally, gmock tracks object "strictness" levels using an internal API; in order to achieve the same results we detect when the MockingBitGen is wrapped in a Nice/Naggy/Strict and wrap the internal implementation MockFunction in the same type.
This is achieved by providing overloads to the Call() function, and passing the mock object type down into it's own RegisterMock call, where a compile-time check verifies the state and creates the appropriate mock function.
PiperOrigin-RevId: 361233484
--
96186023fabd13d01d32d60d9c7ac4ead1aeb989 by Abseil Team <absl-team@google.com>:
Ensure that trivial types are passed by value rather than reference
PiperOrigin-RevId: 361217450
--
e1135944835d27f77e8119b8166d8fb6aa25f906 by Evan Brown <ezb@google.com>:
Internal change.
PiperOrigin-RevId: 361215882
--
583fe6c94c1c2ef757ef6e78292a15fbe4030e35 by Evan Brown <ezb@google.com>:
Increase the minimum number of slots per node from 3 to 4. We also rename kNodeValues (and related names) to kNodeSlots to make it clear that they are about the number of slots per node rather than the number of values per node - kMinNodeValues keeps the same name because it's actually about the number of values rather than the number of slots.
Motivation: I think the expected number of values per node, assuming random insertion order, is the average of the maximum and minimum numbers of values per node (kNodeSlots and kMinNodeValues). For large and/or even kNodeSlots, this is ~75% of kNodeSlots, but for kNodeSlots=3, this is ~67% of kNodeSlots. kMinNodeValues (which corresponds to worst-case occupancy) is ~33% of kNodeSlots, when kNodeSlots=3, compared to 50% for even kNodeSlots. This results in higher memory overhead per value, and since this case (kNodeSlots=3) is used when values are large, it seems worth fixing.
PiperOrigin-RevId: 361171495
GitOrigin-RevId: 5ed5dc9e17c66c298ee31cefc941a46348d8ad34
Change-Id: I8e33b5df1f987a77112093821085c410185ab51a
4 years ago
|
|
|
template <typename ResultT, typename ArgTupleT, typename SelfT>
|
|
|
|
auto RegisterMock(SelfT&, base_internal::FastTypeIdType type)
|
|
|
|
-> decltype(GetMockFnType(std::declval<ResultT>(),
|
|
|
|
std::declval<ArgTupleT>()))& {
|
|
|
|
using MockFnType = decltype(GetMockFnType(std::declval<ResultT>(),
|
|
|
|
std::declval<ArgTupleT>()));
|
Export of internal Abseil changes
--
5ed5dc9e17c66c298ee31cefc941a46348d8ad34 by Abseil Team <absl-team@google.com>:
Fix typo.
PiperOrigin-RevId: 362040582
--
ac704b53a49becc42f77e4529d3952f8e7d18ce4 by Abseil Team <absl-team@google.com>:
Fix a typo in a comment.
PiperOrigin-RevId: 361576641
--
d20ccb27b7e9b53481e9192c1aae5202c06bfcb1 by Derek Mauro <dmauro@google.com>:
Remove the inline keyword from functions that aren't defined
in the header.
This may fix #910.
PiperOrigin-RevId: 361551300
--
aed9ae1dffa7b228dcb6ffbeb2fe06a13970c72b by Laramie Leavitt <lar@google.com>:
Propagate nice/strict/naggy state on absl::MockingBitGen.
Allowing NiceMocks reduces the log spam for un-mocked calls, and it enables nicer setup with ON_CALL, so it is desirable to support it in absl::MockingBitGen. Internally, gmock tracks object "strictness" levels using an internal API; in order to achieve the same results we detect when the MockingBitGen is wrapped in a Nice/Naggy/Strict and wrap the internal implementation MockFunction in the same type.
This is achieved by providing overloads to the Call() function, and passing the mock object type down into it's own RegisterMock call, where a compile-time check verifies the state and creates the appropriate mock function.
PiperOrigin-RevId: 361233484
--
96186023fabd13d01d32d60d9c7ac4ead1aeb989 by Abseil Team <absl-team@google.com>:
Ensure that trivial types are passed by value rather than reference
PiperOrigin-RevId: 361217450
--
e1135944835d27f77e8119b8166d8fb6aa25f906 by Evan Brown <ezb@google.com>:
Internal change.
PiperOrigin-RevId: 361215882
--
583fe6c94c1c2ef757ef6e78292a15fbe4030e35 by Evan Brown <ezb@google.com>:
Increase the minimum number of slots per node from 3 to 4. We also rename kNodeValues (and related names) to kNodeSlots to make it clear that they are about the number of slots per node rather than the number of values per node - kMinNodeValues keeps the same name because it's actually about the number of values rather than the number of slots.
Motivation: I think the expected number of values per node, assuming random insertion order, is the average of the maximum and minimum numbers of values per node (kNodeSlots and kMinNodeValues). For large and/or even kNodeSlots, this is ~75% of kNodeSlots, but for kNodeSlots=3, this is ~67% of kNodeSlots. kMinNodeValues (which corresponds to worst-case occupancy) is ~33% of kNodeSlots, when kNodeSlots=3, compared to 50% for even kNodeSlots. This results in higher memory overhead per value, and since this case (kNodeSlots=3) is used when values are large, it seems worth fixing.
PiperOrigin-RevId: 361171495
GitOrigin-RevId: 5ed5dc9e17c66c298ee31cefc941a46348d8ad34
Change-Id: I8e33b5df1f987a77112093821085c410185ab51a
4 years ago
|
|
|
|
|
|
|
using WrappedFnType = absl::conditional_t<
|
|
|
|
std::is_same<SelfT, ::testing::NiceMock<absl::MockingBitGen>>::value,
|
|
|
|
::testing::NiceMock<MockFnType>,
|
|
|
|
absl::conditional_t<
|
|
|
|
std::is_same<SelfT,
|
|
|
|
::testing::NaggyMock<absl::MockingBitGen>>::value,
|
|
|
|
::testing::NaggyMock<MockFnType>,
|
|
|
|
absl::conditional_t<
|
|
|
|
std::is_same<SelfT,
|
|
|
|
::testing::StrictMock<absl::MockingBitGen>>::value,
|
|
|
|
::testing::StrictMock<MockFnType>, MockFnType>>>;
|
|
|
|
|
|
|
|
using ImplT = FunctionHolderImpl<WrappedFnType, ResultT, ArgTupleT>;
|
|
|
|
auto& mock = mocks_[type];
|
|
|
|
if (!mock) {
|
|
|
|
mock = absl::make_unique<ImplT>();
|
|
|
|
}
|
|
|
|
return static_cast<ImplT*>(mock.get())->mock_fn_;
|
|
|
|
}
|
|
|
|
|
|
|
|
// MockingBitGen::InvokeMock
|
|
|
|
//
|
|
|
|
// InvokeMock(FastTypeIdType, args, result) is the entrypoint for invoking
|
|
|
|
// mocks registered on MockingBitGen.
|
|
|
|
//
|
|
|
|
// When no mocks are registered on the provided FastTypeIdType, returns false.
|
|
|
|
// Otherwise attempts to invoke the mock function ResultT(Args...) that
|
|
|
|
// was previously registered via the type_index.
|
|
|
|
// Requires tuple_args to point to a ArgTupleT, which is a std::tuple<Args...>
|
|
|
|
// used to invoke the mock function.
|
|
|
|
// Requires result to point to a ResultT, which is the result of the call.
|
|
|
|
inline bool InvokeMock(base_internal::FastTypeIdType type, void* args_tuple,
|
|
|
|
void* result) {
|
|
|
|
// Trigger a mock, if there exists one that matches `param`.
|
|
|
|
auto it = mocks_.find(type);
|
|
|
|
if (it == mocks_.end()) return false;
|
|
|
|
it->second->Apply(args_tuple, result);
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
absl::flat_hash_map<base_internal::FastTypeIdType,
|
|
|
|
std::unique_ptr<FunctionHolder>>
|
|
|
|
mocks_;
|
|
|
|
absl::BitGen gen_;
|
|
|
|
|
|
|
|
template <typename>
|
|
|
|
friend struct ::absl::random_internal::DistributionCaller; // for InvokeMock
|
|
|
|
friend class ::absl::BitGenRef; // for InvokeMock
|
|
|
|
friend class ::absl::random_internal::MockHelpers; // for RegisterMock,
|
|
|
|
// InvokeMock
|
|
|
|
};
|
|
|
|
|
|
|
|
ABSL_NAMESPACE_END
|
|
|
|
} // namespace absl
|
|
|
|
|
|
|
|
#endif // ABSL_RANDOM_MOCKING_BIT_GEN_H_
|