mirror of https://github.com/oxen-io/lokinet
You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
121 lines
4.2 KiB
C++
121 lines
4.2 KiB
C++
#ifndef TEST_LLARP_DHT_MOCK_CONTEXT
|
|
#define TEST_LLARP_DHT_MOCK_CONTEXT
|
|
|
|
#include <dht/context.hpp>
|
|
|
|
#include <gmock/gmock.h>
|
|
|
|
namespace llarp
|
|
{
|
|
namespace test
|
|
{
|
|
struct MockContext final : public dht::AbstractContext
|
|
{
|
|
MOCK_METHOD2(LookupRouter, bool(const RouterID&, RouterLookupHandler));
|
|
|
|
MOCK_METHOD6(LookupIntroSetRecursive,
|
|
void(const service::Address&, const dht::Key_t&, uint64_t,
|
|
const dht::Key_t&, uint64_t,
|
|
service::IntroSetLookupHandler));
|
|
|
|
MOCK_METHOD5(LookupIntroSetIterative,
|
|
void(const service::Address&, const dht::Key_t&, uint64_t,
|
|
const dht::Key_t&, service::IntroSetLookupHandler));
|
|
|
|
MOCK_METHOD3(
|
|
FindRandomIntroSetsWithTagExcluding,
|
|
std::set< service::IntroSet >(const service::Tag&, size_t,
|
|
const std::set< service::IntroSet >&));
|
|
|
|
MOCK_CONST_METHOD1(HasRouterLookup, bool(const RouterID& target));
|
|
|
|
MOCK_METHOD5(LookupTagRecursive,
|
|
void(const service::Tag&, const dht::Key_t&, uint64_t,
|
|
const dht::Key_t&, uint64_t));
|
|
|
|
MOCK_METHOD4(LookupTagForPath,
|
|
void(const service::Tag&, uint64_t, const PathID_t&,
|
|
const dht::Key_t&));
|
|
|
|
MOCK_METHOD4(LookupRouterForPath,
|
|
void(const RouterID& target, uint64_t txid,
|
|
const PathID_t& path, const dht::Key_t& askpeer));
|
|
|
|
MOCK_METHOD4(LookupIntroSetForPath,
|
|
void(const service::Address&, uint64_t, const PathID_t&,
|
|
const dht::Key_t&));
|
|
|
|
MOCK_METHOD3(DHTSendTo, void(const RouterID&, dht::IMessage*, bool));
|
|
|
|
MOCK_METHOD4(
|
|
HandleExploritoryRouterLookup,
|
|
bool(const dht::Key_t& requester, uint64_t txid,
|
|
const RouterID& target,
|
|
std::vector< std::unique_ptr< dht::IMessage > >& reply));
|
|
|
|
MOCK_METHOD5(
|
|
LookupRouterRelayed,
|
|
void(const dht::Key_t& requester, uint64_t txid,
|
|
const dht::Key_t& target, bool recursive,
|
|
std::vector< std::unique_ptr< dht::IMessage > >& replies));
|
|
|
|
MOCK_METHOD2(RelayRequestForPath,
|
|
bool(const PathID_t& localPath, const dht::IMessage* msg));
|
|
|
|
MOCK_CONST_METHOD2(GetRCFromNodeDB,
|
|
bool(const dht::Key_t& k, RouterContact& rc));
|
|
|
|
MOCK_METHOD6(PropagateIntroSetTo,
|
|
void(const dht::Key_t& source, uint64_t sourceTX,
|
|
const service::IntroSet& introset,
|
|
const dht::Key_t& peer, uint64_t S,
|
|
const std::set< dht::Key_t >& exclude));
|
|
|
|
MOCK_METHOD3(Init,
|
|
void(const dht::Key_t&, AbstractRouter*, llarp_time_t));
|
|
|
|
MOCK_CONST_METHOD1(
|
|
GetIntroSetByServiceAddress,
|
|
const llarp::service::IntroSet*(const llarp::service::Address&));
|
|
|
|
MOCK_CONST_METHOD0(ExtractStatus, util::StatusObject());
|
|
|
|
MOCK_CONST_METHOD0(Now, llarp_time_t());
|
|
|
|
MOCK_METHOD1(ExploreNetworkVia, void(const dht::Key_t& peer));
|
|
|
|
MOCK_CONST_METHOD0(Crypto, llarp::Crypto*());
|
|
|
|
MOCK_CONST_METHOD0(GetRouter, llarp::AbstractRouter*());
|
|
|
|
MOCK_CONST_METHOD0(OurKey, const dht::Key_t&());
|
|
|
|
MOCK_CONST_METHOD0(pendingIntrosetLookups,
|
|
const PendingIntrosetLookups&());
|
|
MOCK_METHOD0(pendingIntrosetLookups, PendingIntrosetLookups&());
|
|
|
|
MOCK_METHOD0(pendingTagLookups, PendingTagLookups&());
|
|
|
|
MOCK_CONST_METHOD0(pendingTagLookups, const PendingTagLookups&());
|
|
|
|
MOCK_METHOD0(pendingRouterLookups, PendingRouterLookups&());
|
|
|
|
MOCK_CONST_METHOD0(pendingRouterLookups, const PendingRouterLookups&());
|
|
|
|
MOCK_METHOD0(pendingExploreLookups, PendingExploreLookups&());
|
|
|
|
MOCK_CONST_METHOD0(pendingExploreLookups, const PendingExploreLookups&());
|
|
|
|
MOCK_METHOD0(services, dht::Bucket< dht::ISNode >*());
|
|
|
|
MOCK_CONST_METHOD0(AllowTransit, const bool&());
|
|
MOCK_METHOD0(AllowTransit, bool&());
|
|
|
|
MOCK_CONST_METHOD0(Nodes, dht::Bucket< dht::RCNode >*());
|
|
};
|
|
|
|
} // namespace test
|
|
} // namespace llarp
|
|
|
|
#endif
|