lokinet/llarp/dht/dht.cpp

55 lines
1.2 KiB
C++
Raw Normal View History

2018-12-12 00:48:54 +00:00
#include <dht/context.hpp>
#include <dht/dht.h>
#include <router_contact.hpp>
2018-06-01 14:08:54 +00:00
llarp_dht_context::llarp_dht_context(llarp::AbstractRouter *router)
2018-06-01 21:35:17 +00:00
{
parent = router;
2019-02-22 19:04:47 +00:00
impl = llarp::dht::makeContext();
2018-06-01 21:35:17 +00:00
}
2018-07-09 12:30:01 +00:00
struct llarp_dht_context *
llarp_dht_context_new(llarp::AbstractRouter *router)
2018-06-01 14:08:54 +00:00
{
2018-07-09 12:30:01 +00:00
return new llarp_dht_context(router);
}
2018-06-01 14:08:54 +00:00
2018-07-09 12:30:01 +00:00
void
llarp_dht_context_free(struct llarp_dht_context *ctx)
{
delete ctx;
}
2018-06-01 14:08:54 +00:00
2018-07-09 12:30:01 +00:00
void
__llarp_dht_remove_peer(struct llarp_dht_context *ctx, const byte_t *id)
2018-07-09 12:30:01 +00:00
{
ctx->impl->Nodes()->DelNode(llarp::dht::Key_t(id));
2018-07-09 12:30:01 +00:00
}
2018-06-01 21:35:17 +00:00
2018-07-09 12:30:01 +00:00
void
llarp_dht_allow_transit(llarp_dht_context *ctx)
{
ctx->impl->AllowTransit() = true;
2018-07-09 12:30:01 +00:00
}
2018-06-13 16:32:34 +00:00
2018-07-09 12:30:01 +00:00
void
llarp_dht_context_start(struct llarp_dht_context *ctx, const byte_t *key)
{
2020-01-09 11:14:04 +00:00
ctx->impl->Init(llarp::dht::Key_t(key), ctx->parent, 2000);
2018-07-09 12:30:01 +00:00
}
2018-06-01 21:35:17 +00:00
2018-07-09 12:30:01 +00:00
void
llarp_dht_lookup_router(struct llarp_dht_context *ctx,
struct llarp_router_lookup_job *job)
{
job->dht = ctx;
job->found = false;
job->result.Clear();
2018-09-21 14:36:06 +00:00
// llarp_rc_clear(&job->result);
llarp::LogError("implement me llarp_dht_lookup_router");
/*
2018-12-10 14:14:55 +00:00
ctx->parent->logic->queue_job(
2018-07-09 12:30:01 +00:00
{job, &llarp::dht::Context::queue_router_lookup});
*/
2018-07-09 12:30:01 +00:00
}