karyon_p2p::discovery::lookup

Struct LookupService

Source
pub struct LookupService {
    id: PeerID,
    table: Arc<RoutingTable>,
    listener: Arc<Listener>,
    connector: Arc<Connector>,
    outbound_slots: Arc<ConnectionSlots>,
    listen_endpoint: RwLock<Option<Endpoint>>,
    discovery_endpoint: RwLock<Option<Endpoint>>,
    config: Arc<Config>,
    monitor: Arc<Monitor>,
}

Fields§

§id: PeerID

Peer’s ID

§table: Arc<RoutingTable>

Routing Table

§listener: Arc<Listener>

Listener

§connector: Arc<Connector>

Connector

§outbound_slots: Arc<ConnectionSlots>

Outbound slots.

§listen_endpoint: RwLock<Option<Endpoint>>

Resolved listen endpoint

§discovery_endpoint: RwLock<Option<Endpoint>>

Resolved discovery endpoint

§config: Arc<Config>

Holds the configuration for the P2P network.

§monitor: Arc<Monitor>

Responsible for network and system monitoring.

Implementations§

Source§

impl LookupService

Source

pub fn new( key_pair: &KeyPair, table: Arc<RoutingTable>, config: Arc<Config>, monitor: Arc<Monitor>, ex: Executor, ) -> Self

Creates a new lookup service

Source

pub async fn start(self: &Arc<Self>) -> Result<()>

Start the lookup service.

Source

pub fn set_listen_endpoint(&self, resolved_endpoint: &Endpoint) -> Result<()>

Set the resolved listen endpoint.

Source

pub fn listen_endpoint(&self) -> Option<Endpoint>

Source

pub fn discovery_endpoint(&self) -> Option<Endpoint>

Source

pub async fn shutdown(&self)

Shuts down the lookup service.

Source

pub async fn start_lookup( &self, endpoint: &Endpoint, peer_id: Option<PeerID>, ) -> Result<()>

Starts iterative lookup and populate the routing table.

This method begins by generating a random peer ID and connecting to the provided endpoint. It then sends a FindPeer message containing the randomly generated peer ID. Upon receiving peers from the initial lookup, it starts connecting to these received peers and sends them a FindPeer message that contains our own peer ID.

Source

async fn random_lookup( &self, endpoint: &Endpoint, peer_id: Option<PeerID>, random_peers: &mut Vec<PeerMsg>, ) -> Result<()>

Starts a random lookup

This will perfom lookup on a random generated PeerID

Source

async fn self_lookup( &self, random_peers: &[PeerMsg], peer_buffer: &mut Vec<PeerMsg>, ) -> Result<()>

Starts a self lookup

Source

async fn connect( &self, endpoint: Endpoint, peer_id: Option<PeerID>, target_peer_id: &PeerID, ) -> Result<Vec<PeerMsg>>

Connects to the given endpoint and initiates a lookup process for the provided peer ID.

Source

async fn handle_outbound( &self, conn: Conn<NetMsg, Error>, target_peer_id: &PeerID, ) -> Result<Vec<PeerMsg>>

Handles outbound connection

Source

async fn start_listener(self: &Arc<Self>) -> Result<()>

Start a listener.

Source

async fn handle_inbound( self: &Arc<Self>, conn: Conn<NetMsg, Error>, ) -> Result<()>

Handles inbound connection

Source

async fn send_ping_msg(&self, conn: &Conn<NetMsg, Error>) -> Result<PingMsg>

Sends a Ping msg.

Source

async fn send_pong_msg( &self, nonce: [u8; 32], conn: &Conn<NetMsg, Error>, ) -> Result<()>

Sends a Pong msg

Source

async fn send_findpeer_msg( &self, conn: &Conn<NetMsg, Error>, peer_id: &PeerID, ) -> Result<()>

Sends a FindPeer msg

Source

async fn send_peers_msg( &self, peer_id: &PeerID, conn: &Conn<NetMsg, Error>, ) -> Result<()>

Sends a Peers msg.

Source

async fn send_peer_msg( &self, conn: &Conn<NetMsg, Error>, endpoint: Endpoint, ) -> Result<()>

Sends a Peer msg.

Source

async fn send_shutdown_msg(&self, conn: &Conn<NetMsg, Error>) -> Result<()>

Sends a Shutdown msg.

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
§

impl<'a, T, E> AsTaggedExplicit<'a, E> for T
where T: 'a,

§

fn explicit(self, class: Class, tag: u32) -> TaggedParser<'a, Explicit, Self, E>

§

impl<'a, T, E> AsTaggedImplicit<'a, E> for T
where T: 'a,

§

fn implicit( self, class: Class, constructed: bool, tag: u32, ) -> TaggedParser<'a, Implicit, Self, E>

Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

§

impl<T> Instrument for T

§

fn instrument(self, span: Span) -> Instrumented<Self>

Instruments this type with the provided [Span], returning an Instrumented wrapper. Read more
§

fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current Span, returning an Instrumented wrapper. Read more
Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

§

fn vzip(self) -> V

§

impl<T> WithSubscriber for T

§

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
where S: Into<Dispatch>,

Attaches the provided Subscriber to this type, returning a [WithDispatch] wrapper. Read more
§

fn with_current_subscriber(self) -> WithDispatch<Self>

Attaches the current default Subscriber to this type, returning a [WithDispatch] wrapper. Read more