|
|
|
//
|
|
|
|
// Copyright 2019 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.
|
|
|
|
|
|
|
|
#ifndef ABSL_RANDOM_INTERNAL_MOCK_HELPERS_H_
|
|
|
|
#define ABSL_RANDOM_INTERNAL_MOCK_HELPERS_H_
|
|
|
|
|
|
|
|
#include <tuple>
|
|
|
|
#include <type_traits>
|
|
|
|
#include <utility>
|
|
|
|
|
|
|
|
#include "absl/base/internal/fast_type_id.h"
|
|
|
|
#include "absl/types/optional.h"
|
|
|
|
|
|
|
|
namespace absl {
|
|
|
|
ABSL_NAMESPACE_BEGIN
|
|
|
|
namespace random_internal {
|
|
|
|
|
|
|
|
// MockHelpers works in conjunction with MockOverloadSet, MockingBitGen, and
|
|
|
|
// BitGenRef to enable the mocking capability for absl distribution functions.
|
|
|
|
//
|
|
|
|
// MockingBitGen registers mocks based on the typeid of a mock signature, KeyT,
|
|
|
|
// which is used to generate a unique id.
|
|
|
|
//
|
|
|
|
// KeyT is a signature of the form:
|
|
|
|
// result_type(discriminator_type, std::tuple<args...>)
|
|
|
|
// The mocked function signature will be composed from KeyT as:
|
|
|
|
// result_type(args...)
|
|
|
|
//
|
|
|
|
class MockHelpers {
|
|
|
|
using IdType = ::absl::base_internal::FastTypeIdType;
|
|
|
|
|
|
|
|
// Given a key signature type used to index the mock, extract the components.
|
|
|
|
// KeyT is expected to have the form:
|
|
|
|
// result_type(discriminator_type, arg_tuple_type)
|
|
|
|
template <typename KeyT>
|
|
|
|
struct KeySignature;
|
|
|
|
|
|
|
|
template <typename ResultT, typename DiscriminatorT, typename ArgTupleT>
|
|
|
|
struct KeySignature<ResultT(DiscriminatorT, ArgTupleT)> {
|
|
|
|
using result_type = ResultT;
|
|
|
|
using discriminator_type = DiscriminatorT;
|
|
|
|
using arg_tuple_type = ArgTupleT;
|
|
|
|
};
|
|
|
|
|
|
|
|
// Detector for InvokeMock.
|
|
|
|
template <class T>
|
|
|
|
using invoke_mock_t = decltype(std::declval<T*>()->InvokeMock(
|
|
|
|
std::declval<IdType>(), std::declval<void*>(), std::declval<void*>()));
|
|
|
|
|
|
|
|
// Empty implementation of InvokeMock.
|
|
|
|
template <typename KeyT, typename ReturnT, typename ArgTupleT, typename URBG,
|
|
|
|
typename... Args>
|
|
|
|
static absl::optional<ReturnT> InvokeMockImpl(char, URBG*, Args&&...) {
|
|
|
|
return absl::nullopt;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Non-empty implementation of InvokeMock.
|
|
|
|
template <typename KeyT, typename ReturnT, typename ArgTupleT, typename URBG,
|
|
|
|
typename = invoke_mock_t<URBG>, typename... Args>
|
|
|
|
static absl::optional<ReturnT> InvokeMockImpl(int, URBG* urbg,
|
|
|
|
Args&&... args) {
|
|
|
|
ArgTupleT arg_tuple(std::forward<Args>(args)...);
|
|
|
|
ReturnT result;
|
|
|
|
if (urbg->InvokeMock(::absl::base_internal::FastTypeId<KeyT>(), &arg_tuple,
|
|
|
|
&result)) {
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
return absl::nullopt;
|
|
|
|
}
|
|
|
|
|
|
|
|
public:
|
|
|
|
// InvokeMock is private; this provides access for some specialized use cases.
|
|
|
|
template <typename URBG>
|
|
|
|
static inline bool PrivateInvokeMock(URBG* urbg, IdType type,
|
|
|
|
void* args_tuple, void* result) {
|
|
|
|
return urbg->InvokeMock(type, args_tuple, result);
|
|
|
|
}
|
|
|
|
|
|
|
|
// Invoke a mock for the KeyT (may or may not be a signature).
|
|
|
|
//
|
|
|
|
// KeyT is used to generate a typeid-based lookup key for the mock.
|
|
|
|
// KeyT is a signature of the form:
|
|
|
|
// result_type(discriminator_type, std::tuple<args...>)
|
|
|
|
// The mocked function signature will be composed from KeyT as:
|
|
|
|
// result_type(args...)
|
|
|
|
//
|
|
|
|
// An instance of arg_tuple_type must be constructable from Args..., since
|
|
|
|
// the underlying mechanism requires a pointer to an argument tuple.
|
|
|
|
template <typename KeyT, typename URBG, typename... Args>
|
|
|
|
static auto MaybeInvokeMock(URBG* urbg, Args&&... args)
|
|
|
|
-> absl::optional<typename KeySignature<KeyT>::result_type> {
|
|
|
|
// Use function overloading to dispatch to the implemenation since
|
|
|
|
// more modern patterns (e.g. require + constexpr) are not supported in all
|
|
|
|
// compiler configurations.
|
|
|
|
return InvokeMockImpl<KeyT, typename KeySignature<KeyT>::result_type,
|
|
|
|
typename KeySignature<KeyT>::arg_tuple_type, URBG>(
|
|
|
|
0, urbg, std::forward<Args>(args)...);
|
|
|
|
}
|
|
|
|
|
|
|
|
// Acquire a mock for the KeyT (may or may not be a signature).
|
|
|
|
//
|
|
|
|
// KeyT is used to generate a typeid-based lookup for the mock.
|
|
|
|
// KeyT is a signature of the form:
|
|
|
|
// result_type(discriminator_type, std::tuple<args...>)
|
|
|
|
// The mocked function signature will be composed from KeyT as:
|
|
|
|
// result_type(args...)
|
|
|
|
template <typename KeyT, typename MockURBG>
|
|
|
|
static auto MockFor(MockURBG& m)
|
|
|
|
-> decltype(m.template RegisterMock<
|
|
|
|
typename KeySignature<KeyT>::result_type,
|
|
|
|
typename KeySignature<KeyT>::arg_tuple_type>(
|
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
|
|
|
m, std::declval<IdType>())) {
|
|
|
|
return m.template RegisterMock<typename KeySignature<KeyT>::result_type,
|
|
|
|
typename KeySignature<KeyT>::arg_tuple_type>(
|
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
|
|
|
m, ::absl::base_internal::FastTypeId<KeyT>());
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
} // namespace random_internal
|
|
|
|
ABSL_NAMESPACE_END
|
|
|
|
} // namespace absl
|
|
|
|
|
|
|
|
#endif // ABSL_RANDOM_INTERNAL_MOCK_HELPERS_H_
|