Uses of Class net.i2p.data.Hash

Packages that use Hash

Package

Description

net.i2p.addressbook

Address book application for fetching and maintaining I2P host databases from subscription sources.

net.i2p.client

Interfaces and factories for the base I2P SDK used to develop applications that communicate through I2P.

net.i2p.client.datagram

Provides a standard way for reading and writing messages transferred over I2P so that the recipient has an authenticated mechanism to reply to the sender.

net.i2p.client.impl

Internal implementation of the I2P client SDK - the client side of the Invisible Internet Client Protocol (I2CP), separating implementation from the interfaces in net.i2p.client.

net.i2p.client.naming

Naming service for resolving human-readable names (such as ident.i2p) into I2P destinations, providing a standard interface without JNDI complexity.

net.i2p.client.streaming.impl

Implementation of a TCP-like (reliable, authenticated, in order) set of sockets for communicating over the IP-like (unreliable, unauthenticated, unordered) I2P messages.

net.i2p.crypto

Core cryptographic primitives used throughout I2P: symmetric ciphers (AES, ChaCha20), hashes (SHA-1, SHA-256, SHA-384, SHA-512), HMAC and HKDF key derivation, the ElGamal and DSA/EdDSA/RedDSA engines, key and certificate utilities, and the entropy harvester.

net.i2p.data

Common data structures used by the I2P protocols: Destination, LeaseSet, PublicKey, Signature, Certificate and their friends.

net.i2p.data.i2cp

The Invisible Internet Client Protocol (I2CP) allows applications simplified access to I2P network without requiring them to deal with the issues involved with the Invisible Internet Network Protocol (I2NP).

net.i2p.data.i2np

Low-level messages sent between routers - the Invisible Internet Network Protocol (I2NP).

net.i2p.data.router

Router-specific data structures: RouterInfo and RouterIdentity with their transport addresses and capabilities, router key generation, and the optionally password-protected router private key file.

net.i2p.i2ptunnel

Implementation of preconfigured tunnels for clients and servers, including special-purpose tunnels for IRC, SOCKS, HTTP and streaming.

net.i2p.i2ptunnel.access

Definition-based incoming connection filter for server tunnels, with fine-grained access control by destination.

net.i2p.router

The I2P router application handles I2P network communication.

net.i2p.router.client

Router-side implementation of the Invisible Internet Client Protocol (I2CP): client sessions over plain or TLS sockets, message delivery, and lease and tunnel management on behalf of clients.

net.i2p.router.crypto

Router-specific cryptography: ElGamal+AES garlic encryption (ElGamalAESEngine), session key and tag caching for repeated peer communication (TransientSessionKeyManager), router-family shared keys (FamilyKeyCrypto), and the ratchet and pqc subpackages.

net.i2p.router.dummy

Simplified fake implementations of router interfaces (comm system and friends) for testing and embedded builds.

net.i2p.router.message

Garlic message creation, parsing and handling, and the outbound message jobs: one-shot sends, source routing and delivery status handling.

net.i2p.router.naming

The router's default naming service, BlockfileNamingService, backed by the Metanotion BlockFile database (net.metanotion) in hostsdb.dat.

net.i2p.router.networkdb

Network database message handling shared by all facades: database lookup jobs and local RouterInfo publication.

net.i2p.router.networkdb.kademlia

The Kademlia distributed hash table (DHT) network database: lookup, store and explore jobs, the data store, the floodfill variants, and lookup throttling.

net.i2p.router.networkdb.reseed

Reseeding: fetching router info lists from reseed servers, web indexes or local files, validating them (signed SU3 update files and unsigned ZIP archives) and processing them to bootstrap into the network.

net.i2p.router.peermanager

Peer profiles and capacity calculation, peer test jobs, peer selection for tunnel building, and the database and tunnel history used for peer selection.

net.i2p.router.sybil

Offline analysis tools for detecting Sybil attacks and malicious peer coordination by correlating peer relationships.

net.i2p.router.transport

Transport framework: the transport lifecycle and pool management, connection handling and bandwidth throttling for the transports (NTCP2 over TCP, SSU over UDP) that carry I2P messages between routers, plus NAT traversal via UPnP and GeoIP country lookups.

net.i2p.router.transport.ntcp

NTCP2, the TCP transport: framed, ratchet-encrypted and mutually authenticated connections between routers.

net.i2p.router.transport.udp

SSU2, the UDP transport: datagram sessions with Holepunch peer discovery, plus the older SSU compatibility code.

net.i2p.router.tunnel

Tunnel messages and the tunnel layer: the TunnelManagerFacade, tunnel build request and reply processing, and the inbound and outbound tunnel structures.

net.i2p.router.tunnel.pool

Tunnel pool management: pool lifecycle, peer selection, build scheduling and failure handling for client and exploratory tunnels.

net.i2p.router.util

Router utility classes: CoDel active queue management, time-decaying collections, a diagnostics ring buffer, CIDR matching, and password management.

net.i2p.router.web.helpers

Helpers and handlers for the router console user interface, packaged in routerconsole.war and accessible only from JSP files.

net.i2p.util

General utility classes shared across the core libraries and the router.

org.klomp.snark

I2P version of the Snark BitTorrent client, enhanced for I2P: peers are I2P destinations, torrents can be served anonymously as hidden services, and metadata carries I2P-specific comment fields.

org.klomp.snark.dht

BitTorrent distributed hash table (DHT) implementation following the Mainline protocol, for trackerless peer discovery.

Uses of Hash in net.i2p.addressbook
Methods in net.i2p.addressbook with parameters of type Hash
Modifier and Type
Method
Description
private HostChecker.PingResult
HostChecker.lookupLeaseSetRemotely(String hostname, Hash destHash, long startTime, long existingResponseTime)
Perform remote LeaseSet lookup via floodfill network and record the result.
private void
HostChecker.removeFromClientTracking(Hash destHash)
Remove LeaseSet from client refresh tracking after HostChecker is done with it.
Uses of Hash in net.i2p.client
Methods in net.i2p.client with parameters of type Hash
Modifier and Type
Method
Description
Destination
I2PSession.lookupDest(Hash h)
Lookup a Destination by Hash.
Destination
I2PSession.lookupDest(Hash h, long maxWait)
Lookup a Destination by Hash.
LookupResult
I2PSession.lookupDest(Hash h, long maxWait, LookupCallback callback)
Lookup a Destination by hash.
Uses of Hash in net.i2p.client.datagram
Fields in net.i2p.client.datagram declared as Hash
Modifier and Type
Field
Description
private final Hash
Datagram3._from
The sender's hash.
Methods in net.i2p.client.datagram that return Hash
Modifier and Type
Method
Description
Hash
I2PDatagramDissector.extractHash()
Extract the hash of the payload of an I2P repliable datagram (previously loaded with the loadI2PDatagram() method), without verifying the datagram signature.
Hash
I2PDatagramDissector.getHash()
Extract the hash of the payload of an I2P repliable datagram (previously loaded with the loadI2PDatagram() method), verifying the datagram signature.
Hash
Datagram3.getSender()
The sender of an I2P repliable datagram (previously loaded with the load() method).
Methods in net.i2p.client.datagram with parameters of type Hash
Modifier and Type
Method
Description
static byte[]
Datagram2.make(I2PAppContext ctx, I2PSession session, byte[] payload, Hash tohash)
Make a repliable I2P datagram2 containing the specified payload.
static byte[]
Datagram2.make(I2PAppContext ctx, I2PSession session, byte[] payload, Hash tohash, Properties options)
Make a repliable I2P datagram2 containing the specified payload.
Constructors in net.i2p.client.datagram with parameters of type Hash
Modifier
Constructor
Description
private
Datagram3(Hash dest, byte[] data, Properties options)
As returned from Datagram3.load(I2PAppContext, I2PSession, byte[]).
Uses of Hash in net.i2p.client.impl
Fields in net.i2p.client.impl declared as Hash
Modifier and Type
Field
Description
final Hash
I2PSessionImpl.LookupWaiter.hash
The request (Hash mode).
Methods in net.i2p.client.impl with parameters of type Hash
Modifier and Type
Method
Description
(package private) void
I2PSessionImpl.destLookupFailed(Hash h)
Called by the message handler on reception of DestReplyMessage.
(package private) void
SubSession.destLookupFailed(Hash h)
Called by the message handler on reception of DestReplyMessage
Destination
I2PSessionImpl.lookupDest(Hash h)
Blocking.
Destination
I2PSessionImpl.lookupDest(Hash h, long maxWait)
Blocking.
LookupResult
I2PSessionImpl.lookupDest(Hash h, long maxWait, LookupCallback callback)
Lookup a Destination by hostname.
Destination
SubSession.lookupDest(Hash h)
Blocking.
Destination
SubSession.lookupDest(Hash h, long maxWait)
Looks up a Destination, blocking up to the given wait for the answer.
Constructors in net.i2p.client.impl with parameters of type Hash
Modifier
Constructor
Description
LookupWaiter(Hash h)
Waits for one destination lookup.
LookupWaiter(Hash h, long nonce)
Waits for a destination lookup by hash.
LookupWaiter(Hash h, long nonce, LookupCallback callback)
Waits for a destination lookup by hash, with a callback.
Uses of Hash in net.i2p.client.naming
Methods in net.i2p.client.naming with parameters of type Hash
Modifier and Type
Method
Description
Destination
NamingService.lookup(Hash hash, int timeout)
Same as NamingService.lookupBase32(String, int) but with the SHA256 Hash precalculated This implementation returns null.
String
NamingService.reverseLookup(Hash h)
Reverse lookup a hash.
List<String>
NamingService.reverseLookupAll(Hash h)
Reverse lookup a hash.
Uses of Hash in net.i2p.client.streaming.impl
Fields in net.i2p.client.streaming.impl with type parameters of type Hash
Modifier and Type
Field
Description
private Set<Hash>
ConnectionOptions._accessList
Access list.
private Set<Hash>
ConnectionOptions._blackList
Black list.
private final ConcurrentHashMap<Hash,Long>
ConnectionManager._cooldownWarned
When we last logged the "Delaying connect" cooldown WARN per destination.
private final ConcurrentHashMap<Hash,Long>
ConnectionManager._destFailures
Per-destination cooldown to avoid hammering unreachable peers.
private static final Set<Hash>
I2PSocketManagerFull._ecUnsupported
Does not support EC.
private static final Set<Hash>
I2PSocketManagerFull._edUnsupported
Does not support Ed.
private static final Set<Hash>
ConnectionManager._globalBlacklist
Destinations blacklisted across all managers.
private final ConcurrentHashMap<Hash,long[]>
ConnectionManager._recentSyns
Per-destination burst state for the sub-second SYN gate: value is a two-element array {burstStartMs, count}, updated at most once per validated SYN via compare-and-swap (replace).
private final ObjectCounter<Hash>
ConnectionManager._refusalCounter
Rolling refusals per destination, incremented each time the MAXIMUM streams gate refuses a SYN from that dest.
private final ConcurrentHashMap<Hash, ConcurrentLinkedDeque<ConnectionManager.PooledConnection>>
ConnectionManager._streamPools
Stream connection pool — reuses established streams to the same destination.
private final ConcurrentHashMap<Long,Hash>
ConnectionManager._streamReservations
Reservation tokens: receive stream ID → the dest whose budget the stream was admitted under.
private final ConcurrentHashMap<Hash, AtomicInteger>
ConnectionManager._streamsByDest
Live concurrent-stream count keyed by remote destination.
private final ConcurrentHashMap<Hash,Integer>
ConnectionManager._streamShrinkCandidates
Reconciliation memory: what ConnectionManager.BanExpiry last observed for a dest whose ledger count exceeded the live connection table.
private final ConcurrentHashMap<Hash, ConnectionManager.SynStrike>
ConnectionManager._synBurstStrikes
Each dest's most recent SYN-burst strikes: the start of the burst window that crossed the threshold, the time that strike was recorded, and how many distinct windows have tripped inside the current strike window.
private final ConcurrentHashMap<Hash,String>
ConnectionManager._tempBanReason
Trigger reason for an active temp-ban, kept alongside _tempBanUntil so the enforcement path can tell a client *why* it was banned (e.g.
private final ConcurrentHashMap<Hash,Long>
ConnectionManager._tempBanUntil
Temporary bans keyed by destination hash -> bannedUntil epoch ms.
private static final Set<Hash>
I2PSocketManagerFull._userDsaOnly
Destinations pinned to DSA by configuration.
private final ObjectCounter<Hash>
ConnThrottler.counter
Open connections counted per peer.
Methods in net.i2p.client.streaming.impl that return Hash
Modifier and Type
Method
Description
(package private) static Hash
ConnectionManager.consumeReservation(ConcurrentHashMap<Long,Hash> tokens, ConcurrentHashMap<Hash, AtomicInteger> ledger, long receiveStreamId)
Consume the reservation token bound to a receive stream ID, releasing the dest budget slot it owns.
private Hash
ConnectionManager.releaseConnectionReservation(Connection con)
Release whatever this connection still holds against a dest budget: first its reservation token, and only if no token was bound, its remote peer (a connection built outside the reservation protocol, so the slot must still be drained or the budget leaks forever).
private Hash
ConnectionManager.releaseReservation(long receiveStreamId)
Consume the reservation bound to a receive stream ID, releasing its slot.
Methods in net.i2p.client.streaming.impl that return types with arguments of type Hash
Modifier and Type
Method
Description
Set<Hash>
ConnectionOptions.getAccessList()
Access list.
Set<Hash>
ConnectionOptions.getBlacklist()
Destinations refused outright, consulted when blacklisting is enabled.
private Map<Hash,Integer>
ConnectionManager.observedStreamCounts()
Live connection count per dest, preferring the reservation token (the dest that was actually charged at admission) and falling back to the connection's remote peer for anything bound outside the protocol.
private Map<Hash,Integer>
ConnectionManager.tokenStreamCounts()
Bound reservation tokens per dest: the ABA floor for ConnectionManager.reconcileStreamCount(int, int, Integer, int).
Methods in net.i2p.client.streaming.impl with parameters of type Hash
Modifier and Type
Method
Description
(package private) static ConnectionManager.SynBurstAction
ConnectionManager.applySynBurstStrike(ConcurrentHashMap<Hash, ConnectionManager.SynStrike> strikes, Hash h, long windowStart, long now, long strikeWindowMs, int requiredStrikes)
Atomically evaluate and apply a burst-gate trip against h's recorded strike.
private void
ConnectionManager.assignReceiveStreamId(Connection con, Hash destHash)
Pick a new random stream ID for the con and assign it, taking care to avoid duplicates, and put it in the connection table.
(package private) boolean
ConnectionManager.banPeer(Hash h, String why, long now)
Ban a dest for the configured duration.
(package private) boolean
ConnectionManager.checkInboundSynFlood(Hash h, long now)
Package-visible flood gate for the retransmit-SYN path in ConnectionHandler.receiveNewSyn(Packet).
private long
ConnectionManager.checkSynBurst(Hash h, long now, boolean autoban)
Whether a SYN from a dest tripped the sub-second burst gate.
(package private) boolean
ConnThrottler.isOverBy(Hash h, int over)
Checks if individual count is over the limit by this much.
(package private) boolean
ConnectionManager.isTempBanned(Hash h, long now)
Whether the dest is currently temp-banned.
(package private) boolean
ConnThrottler.isThrottled(Hash h)
Check if throttled without incrementing.
private boolean
ConnectionManager.noteSynBurstStrike(Hash h, long windowStart, long now)
Record a SYN-burst strike for h and decide whether this trip autobans (see ConnectionManager.synBurstStrikeAction(ConnectionManager.SynStrike, long, long, long, int)).
private void
ConnectionManager.releaseStream(Hash h)
Return a stream slot taken outside the token protocol (a SYN rejected after admission, or a connection built before a token was bound).
(package private) static void
ConnectionManager.releaseStreamSlot(ConcurrentHashMap<Hash, AtomicInteger> ledger, Hash h)
Return one stream slot to a dest's budget.
(package private) static boolean
ConnectionManager.reserveStreamSlot(ConcurrentHashMap<Hash, AtomicInteger> ledger, Hash h, int max)
Atomically take one stream slot from a dest's budget: the ceiling check and the increment happen inside a single per-key compute(), so two SYNs racing the gate can no longer both observe "room left" and admit past the ceiling (the check-then-add this replaced).
private void
ConnectionManager.sendRejectResponse(Packet synPacket, Destination from, Hash fromHash, int retryAfter)
Send the configured response for a rejected SYN (RESET, HTTP-style Retry-After payload, or custom payload), subject to the peer's throttler status.
(package private) boolean
ConnThrottler.shouldThrottle(Hash h)
Checks both individual and total.
(package private) static int
ConnectionManager.streamSlotCount(ConcurrentHashMap<Hash, AtomicInteger> ledger, Hash h)
Read the stream count a dest is actually holding in the ledger, or 0 if it holds none.
(package private) static boolean
ConnectionManager.synNacksMatch(long[] nacks, Hash localHash)
Whether a SYN's 8 NACK words match the local destination hash.
private String
ConnectionManager.tempBanReason(Hash h)
The stored trigger description for an active temp-ban, if any.
private boolean
ConnectionManager.tryReserveStream(Hash h, int max)
Take a stream slot from this dest's budget.
Method parameters in net.i2p.client.streaming.impl with type arguments of type Hash
Modifier and Type
Method
Description
(package private) static ConnectionManager.SynBurstAction
ConnectionManager.applySynBurstStrike(ConcurrentHashMap<Hash, ConnectionManager.SynStrike> strikes, Hash h, long windowStart, long now, long strikeWindowMs, int requiredStrikes)
Atomically evaluate and apply a burst-gate trip against h's recorded strike.
(package private) static Hash
ConnectionManager.consumeReservation(ConcurrentHashMap<Long,Hash> tokens, ConcurrentHashMap<Hash, AtomicInteger> ledger, long receiveStreamId)
Consume the reservation token bound to a receive stream ID, releasing the dest budget slot it owns.
(package private) static int
ConnectionManager.pruneEmptyPoolBuckets(Map<Hash, ? extends Collection<?>> pools)
Remove destination buckets whose connection deque has gone empty, so a destination that is no longer contacted does not keep a (now-empty) pool entry alive forever.
(package private) static void
ConnectionManager.reconcileStreamSlots(ConcurrentHashMap<Hash, AtomicInteger> ledger, Map<Hash,Integer> observed, ConcurrentHashMap<Hash,Integer> candidates, Map<Hash,Integer> boundTokens)
Reconcile the per-dest stream ledger against the live connection table.
(package private) static void
ConnectionManager.reconcileStreamSlots(ConcurrentHashMap<Hash, AtomicInteger> ledger, Map<Hash,Integer> observed, ConcurrentHashMap<Hash,Integer> candidates, Map<Hash,Integer> boundTokens)
Reconcile the per-dest stream ledger against the live connection table.
(package private) static void
ConnectionManager.releaseStreamSlot(ConcurrentHashMap<Hash, AtomicInteger> ledger, Hash h)
Return one stream slot to a dest's budget.
(package private) static boolean
ConnectionManager.reserveStreamSlot(ConcurrentHashMap<Hash, AtomicInteger> ledger, Hash h, int max)
Atomically take one stream slot from a dest's budget: the ceiling check and the increment happen inside a single per-key compute(), so two SYNs racing the gate can no longer both observe "room left" and admit past the ceiling (the check-then-add this replaced).
(package private) static int
ConnectionManager.streamSlotCount(ConcurrentHashMap<Hash, AtomicInteger> ledger, Hash h)
Read the stream count a dest is actually holding in the ledger, or 0 if it holds none.
Uses of Hash in net.i2p.crypto
Methods in net.i2p.crypto that return Hash
Modifier and Type
Method
Description
final Hash
SHA256Generator.calculateHash(byte[] source)
Calculate the SHA-256 hash of the source and cache the result.
final Hash
SHA256Generator.calculateHash(byte[] source, int start, int len)
Calculate the hash and cache the result.
Methods in net.i2p.crypto with parameters of type Hash
Modifier and Type
Method
Description
Signature
DSAEngine.sign(Hash hash, SigningPrivateKey signingKey)
Nonstandard.
boolean
DSAEngine.verifySignature(Signature signature, Hash hash, SigningPublicKey verifyingKey)
Nonstandard.
Uses of Hash in net.i2p.data
Fields in net.i2p.data declared as Hash
Modifier and Type
Field
Description
private Hash
EncryptedLeaseSet.__calculatedHash
Cached calculated hash value.
private Hash
KeysAndCert.__calculatedHash
Cached calculated hash value.
private Hash
LeaseSet2._blindedHash
If this leaseset was formerly blinded, the blinded hash, so we can find it again.
private Hash
BlindData._blindHash
The hash of the blinded destination.
private Hash
DatabaseEntry._currentRoutingKey
Current routing key, cached.
protected Hash
Lease._gateway
Gateway router hash.
private Hash
DatabaseEntry._receivedBy
Hash of the client receiving the routerinfo, or null if it was sent directly.
static final Hash
Hash.FAKE_HASH
Placeholder all-zero hash, used as a stand-in when no real router hash is known.
Fields in net.i2p.data with type parameters of type Hash
Modifier and Type
Field
Description
private static final SDSCache<Hash>
Hash._cache
Shared cache of parsed hashes.
Methods in net.i2p.data that return Hash
Modifier and Type
Method
Description
Hash
DataStructure.calculateHash()
Calculate the SHA256 value of this object (useful for a few scenarios).
Hash
DataStructureImpl.calculateHash()

Hash
KeysAndCert.calculateHash()
Throws IllegalStateException if keys and cert are not initialized, as of 0.9.12.
Hash
SimpleDataStructure.calculateHash()
SHA256 hash of the byte array, or null if data is null.
static Hash
Hash.create(byte[] data)
Pull from cache or return new
static Hash
Hash.create(byte[] data, int off)
Pull from cache or return new.
static Hash
Hash.create(InputStream in)
Pull from cache or return new.
Hash
BlindData.getBlindedHash()
Gets the hash of the blinded key for the current day.
Hash
LeaseSet2.getBlindedHash()
The original blinded hash, where this came from.
Hash
BlindData.getDestHash()
Gets the destination hash if known.
Hash
Lease.getGateway()
Retrieve the router at which the destination can be contacted.
Hash
DatabaseEntry.getHash()
A common interface to the Hash of the two subclasses.
Hash
EncryptedLeaseSet.getHash()
This must be used instead of getDestination().EncryptedLeaseSet.getHash().
Hash
KeysAndCert.getHash()
Throws IllegalStateException if keys and cert are not initialized, as of 0.9.12.
Hash
DatabaseEntry.getReceivedBy()
The Hash of the local client that received this LS, null if the router or unknown.
Hash
DatabaseEntry.getRoutingKey()
Routing key for the structure using the current modifier in the RoutingKeyGenerator.
abstract Hash
RoutingKeyGenerator.getRoutingKey(Hash origKey)
Routing key for a key.
Methods in net.i2p.data with parameters of type Hash
Modifier and Type
Method
Description
abstract Hash
RoutingKeyGenerator.getRoutingKey(Hash origKey)
Routing key for a key.
void
LeaseSet2.setBlindedHash(Hash bh)
Blinded hash, if known at creation.
void
Lease.setGateway(Hash ident)
Configure the router at which the destination can be contacted.
void
DatabaseEntry.setReceivedBy(Hash receivedBy)
Local client that received this entry.
void
LeaseSet.setReceivedBy(Hash localClient)
Record the local client that received this leaseset.
Uses of Hash in net.i2p.data.i2cp
Fields in net.i2p.data.i2cp declared as Hash
Modifier and Type
Field
Description
private Hash
BlindingInfoMessage._hash
The hash of the blinded destination.
private Hash
DestLookupMessage._hash
The destination being looked up.
private Hash
DestReplyMessage._hash
Hash of the destination being reported.
private Hash
HostLookupMessage._hash
The hash to look up, for hash lookups.
private final Hash
RequestLeaseSetMessage.TunnelEndpoint._router
The gateway router's hash.
Methods in net.i2p.data.i2cp that return Hash
Modifier and Type
Method
Description
Hash
BlindingInfoMessage.getHash()
Gets the hash for hash-type endpoints.
Hash
DestLookupMessage.getHash()
Returns the destination hash the router is asked to resolve.
Hash
DestReplyMessage.getHash()
Gets the hash of the destination.
Hash
HostLookupMessage.getHash()
Gets the hash for hash-type lookups.
Hash
RequestLeaseSetMessage.getRouter(int endpoint)
Returns the router identity of one of the requested tunnels.
Hash
RequestLeaseSetMessage.TunnelEndpoint.getRouter()
Returns the router identity of this tunnel.
Methods in net.i2p.data.i2cp with parameters of type Hash
Modifier and Type
Method
Description
void
RequestLeaseSetMessage.addEndpoint(Hash router, TunnelId tunnel)
Add a router and tunnel endpoint.
Constructors in net.i2p.data.i2cp with parameters of type Hash
Modifier
Constructor
Description
DestLookupMessage(Hash h)
Creates a message asking the router to resolve a destination hash.
DestReplyMessage(Hash h)
Non-null with non-null data.
HostLookupMessage(SessionId id, Hash h, long reqID, long timeout)
Session id.
TunnelEndpoint(Hash router, TunnelId id)
One requested tunnel, pairing a router with one of its tunnel ids.
Uses of Hash in net.i2p.data.i2np
Fields in net.i2p.data.i2np declared as Hash
Modifier and Type
Field
Description
private Hash
DeliveryInstructions._destinationHash
Hash of the destination for DESTINATION mode.
private Hash
DatabaseSearchReplyMessage._from
The router sending the reply.
private Hash
DatabaseLookupMessage._fromHash
The hash of the requester.
private Hash
DatabaseLookupMessage._key
The hash being looked up.
private Hash
DatabaseSearchReplyMessage._key
The hash that was looked up.
private Hash
DatabaseStoreMessage._key
The key being stored.
private Hash
DatabaseStoreMessage._replyGateway
Gateway the reply should go back to.
private Hash
DeliveryInstructions._routerHash
Hash of the router for ROUTER or TUNNEL mode.
Fields in net.i2p.data.i2np with type parameters of type Hash
Modifier and Type
Field
Description
private List<Hash>
DatabaseLookupMessage._dontIncludePeers
This must be kept as a list to preserve the order and not break the checksum.
private final List<Hash>
DatabaseSearchReplyMessage._peerHashes
The peers found, closest first.
Methods in net.i2p.data.i2np that return Hash
Modifier and Type
Method
Description
Hash
DeliveryInstructions.getDestination()
Default null.
Hash
DatabaseLookupMessage.getFrom()
Contains the router who requested this lookup.
Hash
DatabaseSearchReplyMessage.getFromHash()
The router that sent this reply.
Hash
DatabaseStoreMessage.getKey()
Defines the key in the network database being stored.
Hash
DatabaseSearchReplyMessage.getReply(int index)
The peer hash at the given index.
Hash
DatabaseStoreMessage.getReplyGateway()
The gateway to send the reply to, or null if no reply is requested.
Hash
DeliveryInstructions.getRouter()
Default null.
Hash
DatabaseLookupMessage.getSearchKey()
Defines the key being searched for.
Hash
DatabaseSearchReplyMessage.getSearchKey()
Defines the key being searched for.
Hash
BuildRequestRecord.readNextIdentity()
Reads the next hop's identity hash.
Methods in net.i2p.data.i2np that return types with arguments of type Hash
Modifier and Type
Method
Description
Set<Hash>
DatabaseLookupMessage.getDontIncludePeers()
Collection of peers that a lookup reply should NOT include.
Methods in net.i2p.data.i2np with parameters of type Hash
Modifier and Type
Method
Description
void
DatabaseLookupMessage.addDontIncludePeer(Hash peer)
Add to the set.
void
DatabaseSearchReplyMessage.addReply(Hash peer)
Adds a peer hash to the reply.
EncryptedBuildRecord
BuildRequestRecord.encryptECIESRecord(RouterContext ctx, PublicKey toKey, Hash toPeer)
Encrypts the record using ECIES.
EncryptedBuildRecord
BuildRequestRecord.encryptRecord(I2PAppContext ctx, PublicKey toKey, Hash toPeer)
Encrypts the record using ElGamal.
void
DeliveryInstructions.LocalInstructions.setDestination(Hash dest)
Throws, as local delivery instructions are immutable.
void
DeliveryInstructions.setDestination(Hash dest)
Required for DESTINATION.
void
DatabaseLookupMessage.setFrom(Hash from)
Assigns the router who requested this lookup.
void
DatabaseSearchReplyMessage.setFromHash(Hash from)
Assigns the router that sent this reply.
void
DatabaseStoreMessage.setReplyGateway(Hash peer)
Assigns the gateway to send the reply to.
void
DeliveryInstructions.LocalInstructions.setRouter(Hash router)
Throws, as local delivery instructions are immutable.
void
DeliveryInstructions.setRouter(Hash router)
Required for ROUTER or TUNNEL.
void
DatabaseLookupMessage.setSearchKey(Hash key)
Assigns the key being searched for.
void
DatabaseSearchReplyMessage.setSearchKey(Hash key)
Assigns the key being searched for.
(package private) static String
DatabaseLookupMessage.shortKey(DatabaseLookupMessage.Type type, Hash key)
The search key as the house truncation - 8 base32 characters for a lease set, 6 base64 for anything else - bracketed so the console links it.
Method parameters in net.i2p.data.i2np with type arguments of type Hash
Modifier and Type
Method
Description
void
DatabaseLookupMessage.addDontIncludePeers(Collection<Hash> peers)
Add to the set.
void
DatabaseLookupMessage.setDontIncludePeers(Collection<Hash> peers)
Replace the dontInclude set with this set.
Constructors in net.i2p.data.i2np with parameters of type Hash
Modifier
Constructor
Description
BuildRequestRecord(I2PAppContext ctx, long receiveTunnelId, long nextTunnelId, Hash nextHop, long nextMsgId, boolean isInGateway, boolean isOutEndpoint, Properties options)
Creates a new ECIES short build request record.
BuildRequestRecord(I2PAppContext ctx, long receiveTunnelId, long nextTunnelId, Hash nextHop, long nextMsgId, SessionKey layerKey, SessionKey ivKey, SessionKey replyKey, byte[] iv, boolean isInGateway, boolean isOutEndpoint, Properties options)
Creates a new ECIES long build request record.
BuildRequestRecord(I2PAppContext ctx, long receiveTunnelId, Hash peer, long nextTunnelId, Hash nextHop, long nextMsgId, SessionKey layerKey, SessionKey ivKey, SessionKey replyKey, byte[] iv, boolean isInGateway, boolean isOutEndpoint)
Creates a new ElGamal build request record.
Uses of Hash in net.i2p.data.router
Fields in net.i2p.data.router with type parameters of type Hash
Modifier and Type
Field
Description
private Set<Hash>
RouterInfo._peers
May be null to save memory, no longer final.
Methods in net.i2p.data.router that return Hash
Modifier and Type
Method
Description
private static Hash
RouterKeyGenerator.getKey(Hash origKey, byte[] modData)
Generate a modified (yet consistent) hash from the origKey by generating the SHA256 of the targetKey with the specified modData appended to it.
Hash
RouterKeyGenerator.getNextRoutingKey(Hash origKey)
Routing key using tomorrow's modData, not today's.
Hash
RouterKeyGenerator.getRoutingKey(Hash origKey)
Generate a modified (yet consistent) hash from the origKey by generating the SHA256 of the targetKey with the current modData appended to it
Hash
RouterKeyGenerator.getRoutingKey(Hash origKey, long time)
Routing key for the specified date, not today's.
Methods in net.i2p.data.router that return types with arguments of type Hash
Modifier and Type
Method
Description
Set<Hash>
RouterInfo.getPeers()
Retrieve a set of SHA-256 hashes of RouterIdentities from routers this router can be reached through.
Methods in net.i2p.data.router with parameters of type Hash
Modifier and Type
Method
Description
private static Hash
RouterKeyGenerator.getKey(Hash origKey, byte[] modData)
Generate a modified (yet consistent) hash from the origKey by generating the SHA256 of the targetKey with the specified modData appended to it.
Hash
RouterKeyGenerator.getNextRoutingKey(Hash origKey)
Routing key using tomorrow's modData, not today's.
Hash
RouterKeyGenerator.getRoutingKey(Hash origKey)
Generate a modified (yet consistent) hash from the origKey by generating the SHA256 of the targetKey with the current modData appended to it
Hash
RouterKeyGenerator.getRoutingKey(Hash origKey, long time)
Routing key for the specified date, not today's.
Method parameters in net.i2p.data.router with type arguments of type Hash
Modifier and Type
Method
Description
void
RouterInfo.setPeers(Set<Hash> peers)
Specify a set of SHA-256 hashes of RouterIdentities from routers this router can be reached through.
Uses of Hash in net.i2p.i2ptunnel
Fields in net.i2p.i2ptunnel declared as Hash
Modifier and Type
Field
Description
private Hash
I2PTunnelHTTPClient.WarmSlot._dest
The destination being connected to.
private Hash
I2PTunnelHTTPClient.WarmSlot._permit
The destination holding our connection permit.
Fields in net.i2p.i2ptunnel with type parameters of type Hash
Modifier and Type
Field
Description
private static final ConcurrentHashMap<Hash, AtomicInteger>
I2PTunnelHTTPClient._activeConns
Active outbound I2P socket count per destination hash.
private final Map<Hash, ConnThrottler.Record>
ConnThrottler._peers
Connection records, by peer hash.
private static final ConcurrentHashMap<Hash,long[]>
I2PTunnelHTTPClient._raceBudget
Per-remote-dest race token bucket for empty-response dual-race opens.
private final java.util.function.Consumer<Hash>
I2PTunnelHTTPClient.WarmSlot._releaser
Callback releasing the destination's connection permit.
Methods in net.i2p.i2ptunnel with parameters of type Hash
Modifier and Type
Method
Description
private Socket
I2PTunnelServer.createUniqueLocalSocket(Hash from, InetAddress remoteHost, int remotePort, int timeout)
Create a socket with a unique local address derived from the peer hash.
protected Socket
I2PTunnelServer.getSocket(Hash from, int incomingPort)
Creates a TCP socket connection to the configured destination.
protected Socket
I2PTunnelServer.getSocket(Hash from, InetAddress remoteHost, int remotePort)
Creates a TCP socket connection to the specified destination.
private Socket
I2PTunnelServer.getSocket(Hash from, InetAddress remoteHost, int remotePort, boolean forceNonSSL)
Get a regular or SSL socket depending on config.
(package private) boolean
I2PTunnelHTTPServer.isPostThrottled(StringBuilder command, Hash peerHash, I2PSocket socket, String peerB32)
Check POST/PUT throttling for this peer.
(package private) long
I2PTunnelHTTPClient.WarmSlot.open(Hash destHash, int port, Hash permit)
Begin a warm-connect attempt, taking a lease on permit.
private static void
I2PTunnelHTTPClient.releaseConnPermit(Hash dest)
Release a concurrent-connection permit for dest.
boolean
ConnThrottler.shouldThrottle(Hash h)
Checks if a peer or the total connection rate exceeds configured limits.
(package private) I2PSocket
I2PTunnelHTTPClient.WarmSlot.take(Hash destHash, int port)
Take an installed socket for the request.
private static boolean
I2PTunnelHTTPClient.tryAcquireConnPermit(Hash dest)
Try to acquire a concurrent-connection permit for dest.
Constructor parameters in net.i2p.i2ptunnel with type arguments of type Hash
Modifier
Constructor
Description
(package private)
WarmSlot(java.util.function.Consumer<Hash> releaser)
At most once per permit the slot has held.
Uses of Hash in net.i2p.i2ptunnel.access
Fields in net.i2p.i2ptunnel.access declared as Hash
Modifier and Type
Field
Description
private final Hash
DestTracker.hash
The destination this rule tracks.
private final Hash
ExplicitFilterDefinitionElement.hash
The destination this rule matches, decoded from its address.
Fields in net.i2p.i2ptunnel.access with type parameters of type Hash
Modifier and Type
Field
Description
private final Map<Hash, DestTracker>
AccessFilter.knownDests
Trackers for known destinations defined in access lists.
private final Map<Hash, DestTracker>
FileFilterDefinitionElement.lastLoaded
When each destination was last seen in the file.
private final Map<Hash, DestTracker>
AccessFilter.unknownDests
Trackers for unknown destinations not defined in access lists.
Methods in net.i2p.i2ptunnel.access that return Hash
Modifier and Type
Method
Description
protected static Hash
FilterDefinitionElement.fromBase32(String b32)
Utility method to create a Hash object from a .b32 string.
(package private) Hash
DestTracker.getHash()
The destination this tracker counts attempts for.
Method parameters in net.i2p.i2ptunnel.access with type arguments of type Hash
Modifier and Type
Method
Description
void
ExplicitFilterDefinitionElement.update(Map<Hash, DestTracker> map)

void
FileFilterDefinitionElement.update(Map<Hash, DestTracker> map)

(package private) abstract void
FilterDefinitionElement.update(Map<Hash, DestTracker> map)
Updates the provided map with the hash(es) of remote destinations mentioned in this element.
Constructors in net.i2p.i2ptunnel.access with parameters of type Hash
Modifier
Constructor
Description
(package private)
DestTracker(Hash hash, Threshold threshold)
Create a tracker for one remote destination with an empty access history.
Uses of Hash in net.i2p.router
Fields in net.i2p.router declared as Hash
Modifier and Type
Field
Description
private Hash
TunnelPoolSettings._aliasOf
Destination this pool is an alias of, null if none.
private final Hash
TunnelPoolSettings._destination
The tunnel's destination hash.
private final Hash
ClientMessage._destinationHash
Hash of the destination.
private final Hash
Blocklist.BanlistJob._peer
The router to ban.
private Hash
Router._routerHash
Hash of our router identity.
(package private) final Hash
InNetMessagePool.QueuedMessage.from
The peer the message came from.
static final Hash
Banlist.HASH_ZERORI
Hash of 387 zeros.
(package private) final Hash
Blocklist.Entry.peer
The router hash, if this is a hash entry.
Fields in net.i2p.router with type parameters of type Hash
Modifier and Type
Field
Description
private final Set<Hash>
TunnelPoolSettings._aliases
Destination hashes aliasing this pool.
private final Map<Hash, Banlist.Entry>
Banlist._entries
Active bans by router hash.
private Set<Hash>
TunnelPoolSettings._firstPeerExclusions
Peers excluded as the first hop of a new tunnel, for diversity.
private final Set<Hash>
Blocklist._inProcess
Routers whose banlisting is already queued.
private Set<Hash>
TunnelPoolSettings._lastPeerExclusions
Peers excluded as the last hop of a new tunnel, for diversity.
private final Map<Hash, LeaseSetKeys>
KeyManager._leaseSetKeys
The lease set keys, by destination hash.
private final Map<Hash,String>
Blocklist._peerBlocklist
Temporarily banned routers by hash, with reasons.
Methods in net.i2p.router that return Hash
Modifier and Type
Method
Description
Hash
TunnelPoolSettings.getAliasOf()
Other destination that this is an alias of (or null).
Hash
TunnelInfo.getDestination()
If this is a client tunnel, what destination is it for?
Hash
TunnelPoolSettings.getDestination()
What destination is this a client tunnel for (or null if exploratory)?
Hash
ClientMessage.getDestinationHash()
Retrieve the destination to which this message is directed.
Hash
TunnelInfo.getEndpoint()
For convenience.
Hash
TunnelInfo.getFarEnd()
For convenience.
Hash
TunnelInfo.getGateway()
For convenience.
Hash
TunnelInfo.getPeer(int hop)
The peer at the given hop.
Hash
Router.getRouterHash()
Our current router hash.
Hash
RouterContext.routerHash()
Convenience method for getting the router hash.
Methods in net.i2p.router that return types with arguments of type Hash
Modifier and Type
Method
Description
abstract Set<Hash>
NetworkDatabaseFacade.findNearestRouters(Hash key, int maxNumRouters, Set<Hash> peersToIgnore)
Return the RouterInfo structures for the routers closest to the given key.
Set<Hash>
TunnelPoolSettings.getAliases()
Other destinations that use the same tunnel (or null if exploratory).
abstract Set<Hash>
NetworkDatabaseFacade.getAllRouters()
All known router hashes.
Map<Hash, Banlist.Entry>
Banlist.getEntries()
Get the banlist entries.
abstract List<Hash>
CommSystemFacade.getEstablished()
Get all the peers we are connected to.
Set<Hash>
TunnelPoolSettings.getFirstPeerExclusions()
First peer exclusions for diversity.
Map<Hash, TunnelPool>
TunnelManagerFacade.getInboundClientPools()
For TunnelRenderer in router console.
Set<Hash>
TunnelPoolSettings.getLastPeerExclusions()
Last peer exclusions for diversity.
Map<Hash, TunnelPool>
TunnelManagerFacade.getOutboundClientPools()
For TunnelRenderer in router console.
Set<Hash>
PeerManagerFacade.getPeersByCapability(char capability)
All peers with the given capability.
abstract Set<Hash>
ClientManagerFacade.getPrimaryHashes()
A set of all primary hashes.
Set<Hash>
TunnelManagerFacade.selectPeersInTooManyTunnels()
Peers that should not be allowed to be in another tunnel.
Methods in net.i2p.router with parameters of type Hash
Modifier and Type
Method
Description
abstract void
NetworkDatabaseFacade.accessLeaseSet(Hash key)
Record access to a LeaseSet for refresh tracking.
int
InNetMessagePool.add(I2NPMessage messageBody, RouterIdentity fromRouter, Hash fromRouterHash)
Adds a new inbound message to be processed.
int
InNetMessagePool.add(I2NPMessage messageBody, RouterIdentity fromRouter, Hash fromRouterHash, long msgIDBloomXor)
Adds a new inbound message with optional bloom filter XOR id.
void
Banlist.badPacket(Hash hash, String version)
Record a bad packet from a peer identified by its Router hash.
private void
Blocklist.banlist(Hash peer, byte[] ip)
We don't keep the comment field in-memory, so we have to go back out to the file to find it.
private void
Blocklist.banlist(Hash peer, byte[] ip, RouterInfo ri)
Queues a ban for a peer matching a blocklist entry.
void
MessageHistory.banlist(Hash peer, String reason)
We banlisted the peer.
boolean
Banlist.banlistRouter(String reasonCode, Hash peer, String reason)
Ban a router with default duration.
boolean
Banlist.banlistRouter(Hash peer)
Ban a router with default duration.
boolean
Banlist.banlistRouter(Hash peer, String reason)
Ban a router with default duration.
boolean
Banlist.banlistRouter(Hash peer, String reason, String transport)
Ban a router on a specific transport.
boolean
Banlist.banlistRouter(Hash peer, String reason, String transport, boolean forever)
Ban a router with configurable duration and transport.
private boolean
Banlist.banlistRouter(Hash peer, String reason, String reasonCode, String transport, boolean forever)
Ban a router with automatic duration calculation.
boolean
Banlist.banlistRouter(Hash peer, String reason, String reasonCode, String transport, long expireOn)
Ban a router with a specified expiration time.
private void
Blocklist.banlistRouter(Hash peer, String reason, String comment)
Queues a ban for a router by hash.
private void
Blocklist.banlistRouter(Hash peer, String reason, String reasonCode, long duration)
Look up the original record so we can record the reason in the banlist.
private void
Blocklist.banlistRouter(Hash peer, String reason, String comment, RouterInfo ri)
Queues a ban for a router given its info.
private void
Blocklist.banlistRouter(Hash peer, List<byte[]> ips, long duration)
Bans a router and its addresses for a duration.
boolean
Banlist.banlistRouterForever(Hash peer, String reason)
Permanently ban a router.
boolean
Banlist.banlistRouterForever(Hash peer, String reason, String reasonCode)
Permanently ban a router.
private void
Blocklist.banlistRouterWithRI(Hash peer, String reason, String comment, RouterInfo ri, String ip)
Queues a ban for a router with its info and address.
NetworkDatabaseFacade
RouterContext.clientNetDb(Hash id)
The client netDb for the given id.
void
ProfileManager.commErrorOccurred(Hash peer)
Note that there was some sort of communication error talking with the peer.
void
Banlist.corruptConnection(Hash hash, String version)
Record a corrupt connection from a peer identified by its Router hash.
Job
HandlerJobBuilder.createJob(I2NPMessage receivedMessage, RouterIdentity from, Hash fromHash)
Create a new job to handle the received message.
void
ProfileManager.dbLookupFailed(Hash peer)
Note that the peer was unable to reply to a db lookup - either with data or with a lookupReply redirecting the user elsewhere.
void
ProfileManager.dbLookupReceived(Hash peer)
Note that the local router received a db lookup from the given peer.
void
ProfileManager.dbLookupReply(Hash peer, int newPeers, int oldPeers, int invalid, int duplicate, long responseTimeMs)
The peer replied to a db lookup with a redirect to other routers.
void
ProfileManager.dbLookupSuccessful(Hash peer, long responseTimeMs)
Note that the peer was able to return the valid data for a db lookup.
void
ProfileManager.dbStoreFailed(Hash peer)
Note that we were unable to confirm a successful send of db data to the peer, at least not within our timeout period.
void
ProfileManager.dbStoreReceived(Hash peer, boolean wasNewKey)
Note that the local router received an unprompted db store from the given peer.
void
ProfileManager.dbStoreSent(Hash peer, long responseTimeMs)
Note that we've confirmed a successful send of db data to the peer (though we haven't necessarily requested it again from them, so they /might/ be lying).
void
ProfileManager.dbStoreSuccessful(Hash peer)
Note that we confirmed a successful send of db data to the peer.
private void
InNetMessagePool.doShortCircuitTunnelData(I2NPMessage messageBody, Hash from)
Actual direct dispatch of a tunnel data message.
void
MessageHistory.droppedInboundMessage(long messageId, Hash from, String info)
Note that an inbound message was dropped.
void
MessageHistory.droppedOtherMessage(I2NPMessage message, Hash from)
We received another message we weren't waiting for and don't know how to handle.
void
MessageHistory.droppedTunnelMessage(TunnelId id, long msgId, Date expiration, Hash from)
We don't know about the given tunnel, so we are dropping a message sent to us by the given router.
int
TunnelManagerFacade.ensurePoolsFor(Hash client)
Run both of a client's pools' ensure logic on demand instead of waiting for the next build-timer interval.
void
CommSystemFacade.exemptIncoming(Hash peer)
Exempt this router hash from any incoming throttles or rejections.
abstract void
NetworkDatabaseFacade.fail(Hash dbEntry)
Mark a database entry as failed.
void
TunnelManagerFacade.fail(Hash peer)
Fail every tunnel that depends on a peer we can no longer reach: outbound tunnels with it as first hop, inbound tunnels with it as last hop.
private void
BanLogger.fetchRouterInfo(Hash hash, String reason, long durationMs)
Schedule an async network lookup for a RouterInfo that was not locally cached when the ban was logged.
abstract Set<Hash>
NetworkDatabaseFacade.findNearestRouters(Hash key, int maxNumRouters, Set<Hash> peersToIgnore)
Return the RouterInfo structures for the routers closest to the given key.
void
CommSystemFacade.forceDisconnect(Hash peer)
Tell the comm system to disconnect from this peer.
void
CommSystemFacade.forceDisconnect(Hash peer, String reason)
Tell the comm system to disconnect from this peer with a reason.
private List<byte[]>
Blocklist.getAddresses(Hash peer)
Will not contain duplicates.
long
Banlist.getBanAge(Hash peer)
How long the banlist has been holding a peer, in milliseconds.
String
Banlist.getBanCause(Hash peer)
Reason recorded when the peer was banlisted.
private String
BanLogger.getCaps(Hash hash)
Capabilities string from RouterInfo for the given hash.
abstract FloodfillNetworkDatabaseFacade
ClientManagerFacade.getClientFloodfillNetworkDatabaseFacade(Hash destHash)
The FloodfillNetworkDatabaseFacade associated with a particular client destination.
abstract SessionKeyManager
ClientManagerFacade.getClientSessionKeyManager(Hash dest)
The session key manager for a given client.
String
CommSystemFacade.getCountry(Hash peer)
Get the two-letter country code for the given peer's IP address.
int
TunnelManagerFacade.getInboundClientTunnelCount(Hash destination)
How many inbound client tunnels in this pool?
TunnelPool
TunnelManagerFacade.getInboundPool(Hash client)
Inbound tunnel pool for the given client, or null if none.
TunnelPoolSettings
TunnelManagerFacade.getInboundSettings(Hash client)
The inbound settings for the given client.
byte[]
CommSystemFacade.getIP(Hash dest)
Get the IP address associated with the given destination.
private String
BanLogger.getIPFromContext(Hash hash, RouterContext context)
IP address from banlist for the given hash.
LeaseSetKeys
KeyManager.getKeys(Hash dest)
Client session lease set keys.
private static final String
MessageHistory.getName(Hash router)
Prettify the hash by doing a base64 and returning the first 6 characters.
int
TunnelManagerFacade.getOutboundClientTunnelCount(Hash destination)
How many outbound client tunnels in this pool?
TunnelPool
TunnelManagerFacade.getOutboundPool(Hash client)
Outbound tunnel pool for the given client, or null if none.
TunnelPoolSettings
TunnelManagerFacade.getOutboundSettings(Hash client)
The outbound settings for the given client.
private String
BanLogger.getVersion(Hash hash)
Version string from RouterInfo for the given hash.
private void
InNetMessagePool.handleDroppedUnmatchedMessage(I2NPMessage messageBody, RouterIdentity fromRouter, Hash fromRouterHash, boolean doHistory)
Handles dropping messages that are not matched or handled.
private void
InNetMessagePool.handleInvalidMessage(I2NPMessage messageBody, String invalidReason, RouterIdentity fromRouter, Hash fromRouterHash, boolean doHistory, long msgIDBloomXor)
Handles invalid or duplicate messages by logging, statistics updates, and history recording.
void
ProfileManager.heardAbout(Hash peer)
Note that the local router received a reference to the given peer, either through an explicit dbStore or in a dbLookupReply.
void
ProfileManager.heardAbout(Hash peer, long when)
Note that the local router received a reference to the given peer at a specific time.
boolean
CommSystemFacade.isBacklogged(Hash peer)
Check whether the given peer has excessive pending outbound messages.
boolean
Banlist.isBanlisted(Hash peer)
Check if a router is banlisted.
boolean
Banlist.isBanlisted(Hash peer, String transport)
Check if a router is banlisted on a specific transport.
boolean
Banlist.isBanlistedForever(Hash peer)
Check if a router is permanently banlisted.
boolean
Banlist.isBanlistedHostile(Hash peer)
Check if a router is banlisted with a hostile duration (at least 1 hour).
boolean
Blocklist.isBlocklisted(Hash peer)
Check if a peer is blocklisted by IP address.
boolean
CommSystemFacade.isConnecting(Hash peer)
Check if any transport has a connection attempt in progress for the given peer (handshake started but not yet complete).
abstract boolean
CommSystemFacade.isEstablished(Hash peer)
Check whether a transport connection exists with the given peer.
boolean
CommSystemFacade.isInStrictCountry(Hash peer)
Whether the given peer's country is blocked.
abstract boolean
ClientManagerFacade.isLocal(Hash destHash)
Determine if the destination hash specified is managed locally.
boolean
NetworkDatabaseFacade.isNegativeCachedForever(Hash key)
Is it permanently negative cached?
boolean
TunnelManagerFacade.isValidTunnel(Hash client, TunnelInfo tunnel)
Is a tunnel a valid member of the pool?
void
BanLogger.logBan(Hash hash, String ip, String reason, long durationMs)
Log a ban by hash with IP address.
void
BanLogger.logBan(Hash hash, String ip, String reason, long durationMs, RouterInfo ri)
Log a ban with RouterInfo for direct caps extraction.
void
BanLogger.logBan(Hash hash, RouterContext context, String reason, long durationMs)
Log a ban by hash with RouterContext (IP will be looked up from banlist).
void
BanLogger.logBanForever(Hash hash, String ip, String reason)
Log a permanent ban (forever).
void
BanLogger.logBanForever(Hash hash, String ip, String reason, RouterInfo ri)
Log a permanent ban with RouterInfo for direct caps extraction.
void
BanLogger.logBanForever(Hash hash, RouterContext context, String reason)
Log a permanent ban with RouterContext.
abstract void
NetworkDatabaseFacade.lookupDestination(Hash key, Job onFinishedJob, long timeoutMs, Hash fromLocalDest)
Lookup using the client's tunnels Succeeds even if LS validation fails due to unsupported sig type.
abstract Destination
NetworkDatabaseFacade.lookupDestinationLocally(Hash key)
Lookup locally in netDB and in badDest cache Succeeds even if LS validation failed due to unsupported sig type.
abstract void
NetworkDatabaseFacade.lookupLeaseSet(Hash key, Job onFindJob, Job onFailedLookupJob, long timeoutMs)
Lookup a LeaseSet in the network database.
abstract void
NetworkDatabaseFacade.lookupLeaseSet(Hash key, Job onFindJob, Job onFailedLookupJob, long timeoutMs, Hash fromLocalDest)
Lookup using the client's tunnels.
abstract LeaseSet
NetworkDatabaseFacade.lookupLeaseSetLocally(Hash key)
Look up a LeaseSet in the local network database.
abstract void
NetworkDatabaseFacade.lookupLeaseSetRemotely(Hash key, Hash fromLocalDest)
Unconditionally lookup using the client's tunnels.
abstract void
NetworkDatabaseFacade.lookupLeaseSetRemotely(Hash key, Job onFindJob, Job onFailedLookupJob, long timeoutMs, Hash fromLocalDest)
Unconditionally lookup using the client's tunnels.
abstract DatabaseEntry
NetworkDatabaseFacade.lookupLocally(Hash key)
Lookup a database entry locally.
abstract DatabaseEntry
NetworkDatabaseFacade.lookupLocallyWithoutValidation(Hash key)
Not for use without validation.
abstract void
NetworkDatabaseFacade.lookupRouterInfo(Hash key, Job onFindJob, Job onFailedLookupJob, long timeoutMs)
Look up a RouterInfo in the network database.
abstract RouterInfo
NetworkDatabaseFacade.lookupRouterInfoLocally(Hash key)
Look up a RouterInfo in the local network database.
void
CommSystemFacade.mayDisconnect(Hash peer)
Tell the comm system that we may disconnect from this peer.
void
ProfileManager.messageFailed(Hash peer)
Note that the router failed to send a message to the peer over any transport.
void
ProfileManager.messageFailed(Hash peer, String transport)
Note that the router failed to send a message to the peer over the transport specified.
void
ProfileManager.messageReceived(Hash peer, String style, long msToReceive, int bytesRead)
Note that the router received a message from the given peer on the specified transport.
void
ProfileManager.messageSent(Hash peer, String transport, long msToSend, long bytesSent)
Note that it took msToSend to send a message of size bytesSent to the peer over the transport.
void
ProfileManager.peerLossEvent(Hash peer, float ratio)
Record the packet-loss (retransmit) ratio measured by the transport for a peer.
void
Banlist.portHopping(Hash hash)
Record a port hopping attempt from a peer identified by its Router hash.
private boolean
InNetMessagePool.processDatabaseStoreMessage(I2NPMessage messageBody, RouterIdentity fromRouter, Hash fromRouterHash, boolean doHistory)
Processes DatabaseStoreMessage types by running or queueing corresponding jobs.
Properties
StatisticsManager.publishStatistics(Hash h)
Retrieve a snapshot of the statistics that should be published.
SessionKey
PersistentKeyRing.put(Hash h, SessionKey sk)
Store a session key, persisting it to the router config.
void
MessageHistory.receiveMessage(String messageType, long messageId, long expiration, Hash from, boolean isValid)
Note that we just received a message from the peer.
void
PeerManagerFacade.removeCapabilities(Hash peer)
Remove all capabilities from a peer.
abstract void
NetworkDatabaseFacade.removeLeaseSetFromTracking(Hash key)
Remove a LeaseSet from refresh tracking.
String
CommSystemFacade.renderPeerCaps(Hash peer, boolean inline)
Render the peer's capabilities as HTML, optionally inline.
String
CommSystemFacade.renderPeerFlag(Hash peer)
Render the country flag for the given peer as HTML.
String
CommSystemFacade.renderPeerHTML(Hash peer, boolean extended)
Render an HTML snippet identifying the given peer, optionally with extended details.
abstract void
ClientManagerFacade.requestLeaseSet(Hash dest, LeaseSet set)
Request that the client authorize the Leases contained in the LeaseSet, identified by destination hash.
TunnelInfo
TunnelManagerFacade.selectInboundExploratoryTunnel(Hash closestTo)
Pick the inbound exploratory tunnel with the gateway closest to the given hash.
TunnelInfo
TunnelManagerFacade.selectInboundTunnel(Hash destination)
Pick a random inbound tunnel from the given destination's pool.
TunnelInfo
TunnelManagerFacade.selectInboundTunnel(Hash destination, Hash closestTo)
Pick the inbound tunnel with the gateway closest to the given hash from the given destination's pool.
TunnelInfo
TunnelManagerFacade.selectOutboundExploratoryTunnel(Hash closestTo)
Pick the outbound exploratory tunnel with the endpoint closest to the given hash.
TunnelInfo
TunnelManagerFacade.selectOutboundTunnel(Hash destination)
Pick a random outbound tunnel from the given destination's pool.
TunnelInfo
TunnelManagerFacade.selectOutboundTunnel(Hash destination, Hash closestTo)
Pick the outbound tunnel with the endpoint closest to the given hash from the given destination's pool.
void
MessageHistory.sendMessage(String messageType, long messageId, long expiration, Hash peer, boolean sentOk, String info)
We just sent a message to the peer.
void
TunnelPoolSettings.setAliasOf(Hash h)
Other destination that this is an alias of (or null).
void
PeerManagerFacade.setCapabilities(Hash peer, String caps)
The capabilities for a peer.
void
TunnelManagerFacade.setInboundSettings(Hash client, TunnelPoolSettings settings)
The inbound settings for the given client.
void
TunnelManagerFacade.setOutboundSettings(Hash client, TunnelPoolSettings settings)
The outbound settings for the given client.
private void
InNetMessagePool.shortCircuitTunnelData(I2NPMessage messageBody, Hash from)
Shortcut dispatch tunnel data message either directly or queued.
boolean
ClientManagerFacade.shouldPublishLeaseSet(Hash destinationHash)
Does the client specified want their leaseSet published?
DatabaseEntry
NetworkDatabaseFacade.store(Hash key, DatabaseEntry entry)
Store a DatabaseEntry in the network database.
abstract LeaseSet
NetworkDatabaseFacade.store(Hash key, LeaseSet leaseSet)
Store a LeaseSet in the network database.
abstract RouterInfo
NetworkDatabaseFacade.store(Hash key, RouterInfo routerInfo)
Store a RouterInfo in the network database.
void
ProfileManager.tunnelDataPushed(Hash peer, long rtt, long size)
Note that we were able to push some data through a tunnel that the peer is participating in (detected after rtt).
void
ProfileManager.tunnelDataPushed1m(Hash peer, long size)
Note that the peer is participating in a tunnel that pushed the given amount of data over the last minute.
void
MessageHistory.tunnelDispatched(long messageId, long tunnelId, long toTunnel, Hash toPeer, String type)
Note that a message was dispatched to a tunnel.
void
ProfileManager.tunnelFailed(Hash peer, int pct)
Note that the peer participated in a tunnel that failed.
void
ProfileManager.tunnelJoined(Hash peer, long responseTimeMs)
Note that the router agreed to participate in a tunnel.
void
ProfileManager.tunnelLifetimePushed(Hash peer, long lifetime, long size)
Note that we were able to push the given amount of data through a tunnel that the peer is participating in.
void
MessageHistory.tunnelParticipantRejected(Hash peer, String msg)
Note that a router rejected our request to participate in a tunnel.
void
MessageHistory.tunnelRejected(Hash peer, TunnelId tunnel, Hash replyThrough, String reason)
The peer did not accept the tunnel join for the given reason.
void
ProfileManager.tunnelRejected(Hash peer, long responseTimeMs, int severity)
Note that a router explicitly rejected joining a tunnel.
void
MessageHistory.tunnelRequestTimedOut(Hash peer, TunnelId tunnel)
The peer did not accept the tunnel join for the given reason (this may be because of a timeout or an explicit refusal).
void
ProfileManager.tunnelTestSucceeded(Hash peer, long responseTimeMs)
Note that a tunnel that the router is participating in was successfully tested with the given round trip latency.
void
ProfileManager.tunnelTimedOut(Hash peer)
Note that a router timed out joining a tunnel.
void
MessageHistory.unbanlist(Hash peer)
We unbanlisted the peer.
void
Banlist.unbanlistRouter(Hash peer)
Remove a router from the banlist.
private void
Banlist.unbanlistRouter(Hash peer, boolean realUnbanlist)
Remove a peer from the banlist, optionally updating message history.
private void
Banlist.unbanlistRouter(Hash peer, boolean realUnbanlist, String transport)
Remove a router from the banlist.
void
Banlist.unbanlistRouter(Hash peer, String transport)
Remove a router from the banlist for a specific transport.
abstract boolean
CommSystemFacade.wasFailsafeClosed(Hash peer, long withinMs)
Whether any transport closed a session to the given peer for idleness within the given window.
boolean
CommSystemFacade.wasUnreachable(Hash peer)
Check whether the given peer was recently unreachable.
Method parameters in net.i2p.router with type arguments of type Hash
Modifier and Type
Method
Description
abstract Set<Hash>
NetworkDatabaseFacade.findNearestRouters(Hash key, int maxNumRouters, Set<Hash> peersToIgnore)
Return the RouterInfo structures for the routers closest to the given key.
void
TunnelPoolSettings.setFirstPeerExclusions(Set<Hash> exclusions)
First peer exclusions for diversity.
void
TunnelPoolSettings.setLastPeerExclusions(Set<Hash> exclusions)
Last peer exclusions for diversity.
Constructors in net.i2p.router with parameters of type Hash
Modifier
Constructor
Description
BanlistJob(Hash p, List<byte[]> ips)
Prepares to ban one router.
ClientMessage(Hash toDestHash, Payload payload)
For inbound (from remote dest).
ClientTunnelSettings(Hash dest)
Create tunnel settings for the given destination.
Entry(String c, Hash h, byte[] i1, byte[] i2)
Creates an entry from its fields.
(package private)
QueuedMessage(I2NPMessage m, Hash f)
Records one queued message.
TunnelPoolSettings(Hash dest, boolean isInbound)
A pool with the defaults, exploratory if dest is null and a client pool otherwise.
Uses of Hash in net.i2p.router.client
Fields in net.i2p.router.client declared as Hash
Modifier and Type
Field
Description
private Hash
ClientConnectionRunner._encryptedLSHash
Hash of the client's encrypted lease set.
private final Hash
LookupDestJob._fromLocalDest
The local destination to search from, null if none.
private final Hash
LookupDestJob._hash
The hash being looked up.
Fields in net.i2p.router.client with type parameters of type Hash
Modifier and Type
Field
Description
private final ConcurrentHashMap<Hash,Long>
ClientManagerFacadeImpl._lastExpiredLogTime
When each client's expiration was last logged.
private final Set<Hash>
ClientManager._metaHashes
Destination hashes of the metadata sessions.
private final Map<Hash, ClientConnectionRunner>
ClientManager._runnersByHash
The runners, by destination hash.
private final ConcurrentHashMap<Hash, ClientConnectionRunner.SessionParams>
ClientConnectionRunner._sessions
The client's sessions, by destination hash.
Methods in net.i2p.router.client that return Hash
Modifier and Type
Method
Description
Hash
ClientConnectionRunner.getDestHash()
Equivalent to ClientConnectionRunner.getConfig(Hash).getDestination().calculateHash(); will be null before session is established Not subsession aware.
Hash
ClientConnectionRunner.getDestHash(SessionId id)
Return the hash for the given ID.
Methods in net.i2p.router.client that return types with arguments of type Hash
Modifier and Type
Method
Description
Set<Hash>
ClientManager.getPrimaryHashes()
All the primary hashes for all the clients as a set.
Set<Hash>
ClientManagerFacadeImpl.getPrimaryHashes()
All the primary hashes for all the clients as a set.
Methods in net.i2p.router.client with parameters of type Hash
Modifier and Type
Method
Description
FloodfillNetworkDatabaseFacade
ClientManager.getClientFloodfillNetworkDatabaseFacade(Hash destHash)
The FloodfillNetworkDatabaseFacade associated with a particular client destination.
FloodfillNetworkDatabaseFacade
ClientManagerFacadeImpl.getClientFloodfillNetworkDatabaseFacade(Hash destHash)
The FloodfillNetworkDatabaseFacade associated with a particular client destination.
SessionKeyManager
ClientManager.getClientSessionKeyManager(Hash dest)
Return the client's SessionKeyManager Use this instead of the I2PAppContext.sessionKeyManager() to prevent correlation attacks across destinations.
SessionKeyManager
ClientManagerFacadeImpl.getClientSessionKeyManager(Hash dest)
Return the client's current manager or null if not connected.
SessionConfig
ClientConnectionRunner.getConfig(Hash h)
Current client's config, will be null if session not found IS subsession aware.
(package private) LeaseRequestState
ClientConnectionRunner.getLeaseRequest(Hash h)
Data for the current leaseRequest, or null if there is no active leaseSet request.
LeaseSet
ClientConnectionRunner.getLeaseSet(Hash h)
Currently allocated leaseSet.
private ClientConnectionRunner
ClientManager.getRunner(Hash destHash)
Looks up a client's runner by hash without holding the lock.
(package private) SessionId
ClientConnectionRunner.getSessionId(Hash h)
Subsession aware.
boolean
ClientManager.isLocal(Hash destHash)
Unsynchronized.
boolean
ClientManagerFacadeImpl.isLocal(Hash destHash)
Determine if the destination specified is managed locally.
(package private) boolean
ClientConnectionRunner.receiveMessage(Hash toHash, Destination fromDest, Payload payload)
Synchronously deliver the message to the current runner
boolean
ClientManager.registerEncryptedDestination(ClientConnectionRunner runner, Hash hash)
Call after ClientManager.destinationEstablished(ClientConnectionRunner, Destination), when an encrypted leaseset is created, so we know it's local.
boolean
ClientConnectionRunner.registerEncryptedLS(Hash hash)
Call after destinationEstablished(), when an encrypted leaseset is created, so we know it's local.
(package private) void
ClientConnectionRunner.requestLeaseSet(Hash h, LeaseSet set, long expirationTime, Job onCreateJob, Job onFailedJob)
Request that a particular client authorize the Leases contained in the LeaseSet, after which the onCreateJob is queued up.
void
ClientManager.requestLeaseSet(Hash dest, LeaseSet ls)
Request that a particular client authorize the Leases contained in the LeaseSet.
void
ClientManagerFacadeImpl.requestLeaseSet(Hash dest, LeaseSet set)
Request that a particular client authorize the Leases contained in the LeaseSet.
(package private) void
ClientConnectionRunner.setSessionId(Hash hash, SessionId id)
To be called only by ClientManager.
boolean
ClientManager.shouldPublishLeaseSet(Hash destHash)
Determine if we should publish a leaseSet for this hash.
boolean
ClientManagerFacadeImpl.shouldPublishLeaseSet(Hash destinationHash)
Whether the lease set for the destination should be published.
void
ClientManager.unregisterEncryptedDestination(ClientConnectionRunner runner, Hash hash)
Remove the hash for the encrypted LS.
Method parameters in net.i2p.router.client with type arguments of type Hash
Modifier and Type
Method
Description
(package private) static int
ClientManagerFacadeImpl.pruneStaleExpiredLogEntries(ConcurrentHashMap<Hash,Long> map, Set<Hash> active)
Remove lease-expiration log-throttle entries whose destination no longer has a live runner.
(package private) static int
ClientManagerFacadeImpl.pruneStaleExpiredLogEntries(ConcurrentHashMap<Hash,Long> map, Set<Hash> active)
Remove lease-expiration log-throttle entries whose destination no longer has a live runner.
Constructors in net.i2p.router.client with parameters of type Hash
Modifier
Constructor
Description
LookupDestJob(RouterContext context, ClientConnectionRunner runner, long reqID, long timeout, SessionId sessID, Hash h, String name, Hash fromLocalDest)
One of h or name non-null.
LookupDestJob(RouterContext context, ClientConnectionRunner runner, Hash h, Hash fromLocalDest)
Create a lookup job with the default timeout.
Uses of Hash in net.i2p.router.crypto
Fields in net.i2p.router.crypto with type parameters of type Hash
Modifier and Type
Field
Description
private final Map<Hash, FamilyKeyCrypto.Result>
FamilyKeyCrypto._negativeCache
The failed verifications, by hash.
private final Set<Hash>
FamilyKeyCrypto._ourFamily
The hashes of our own family members.
private final Map<Hash, FamilyKeyCrypto.Verified>
FamilyKeyCrypto._verified
The verified family members, by hash.
Methods in net.i2p.router.crypto that return types with arguments of type Hash
Modifier and Type
Method
Description
Set<Hash>
FamilyKeyCrypto.getOurFamily()
Get verified members of our family.
Methods in net.i2p.router.crypto with parameters of type Hash
Modifier and Type
Method
Description
Map<String,String>
FamilyKeyCrypto.sign(String family, Hash h)
Caller must add family to RI also.
Uses of Hash in net.i2p.router.dummy
Fields in net.i2p.router.dummy declared as Hash
Modifier and Type
Field
Description
private Hash
VMCommSystem.ReceiveJob._from
The sender's hash.
Fields in net.i2p.router.dummy with type parameters of type Hash
Modifier and Type
Field
Description
private static Map<Hash, VMCommSystem>
VMCommSystem._commSystemFacades
Mapping from Hash to VMCommSystem for all routers hooked together.
private final Map<Hash, RouterInfo>
DummyNetworkDatabaseFacade._routers
Routers this dummy database knows.
Methods in net.i2p.router.dummy that return types with arguments of type Hash
Modifier and Type
Method
Description
Set<Hash>
DummyNetworkDatabaseFacade.findNearestRouters(Hash key, int maxNumRouters, Set<Hash> peersToIgnore)

Set<Hash>
DummyNetworkDatabaseFacade.getAllRouters()

List<Hash>
VMCommSystem.getEstablished()
Return the established.
Map<Hash, TunnelPool>
DummyTunnelManagerFacade.getInboundClientPools()

Map<Hash, TunnelPool>
DummyTunnelManagerFacade.getOutboundClientPools()

Set<Hash>
DummyPeerManagerFacade.getPeersByCapability(char capability)

Set<Hash>
DummyClientManagerFacade.getPrimaryHashes()
Return the set of primary hashes.
Set<Hash>
DummyTunnelManagerFacade.selectPeersInTooManyTunnels()

Methods in net.i2p.router.dummy with parameters of type Hash
Modifier and Type
Method
Description
void
DummyNetworkDatabaseFacade.accessLeaseSet(Hash key)

NetworkDatabaseFacade
DummyNetworkDatabaseSegmentor.clientNetDB(Hash id)

int
DummyTunnelManagerFacade.ensurePoolsFor(Hash client)

void
DummyNetworkDatabaseFacade.fail(Hash dbEntry)
Record a lookup failure.
void
DummyTunnelManagerFacade.fail(Hash peer)

Set<Hash>
DummyNetworkDatabaseFacade.findNearestRouters(Hash key, int maxNumRouters, Set<Hash> peersToIgnore)

FloodfillNetworkDatabaseFacade
DummyClientManagerFacade.getClientFloodfillNetworkDatabaseFacade(Hash dbid)
Return the floodfill network database facade.
SessionKeyManager
DummyClientManagerFacade.getClientSessionKeyManager(Hash _dest)

int
DummyTunnelManagerFacade.getInboundClientTunnelCount(Hash destination)

TunnelPool
DummyTunnelManagerFacade.getInboundPool(Hash client)

TunnelPoolSettings
DummyTunnelManagerFacade.getInboundSettings(Hash client)

int
DummyTunnelManagerFacade.getOutboundClientTunnelCount(Hash destination)

TunnelPool
DummyTunnelManagerFacade.getOutboundPool(Hash client)

TunnelPoolSettings
DummyTunnelManagerFacade.getOutboundSettings(Hash client)

boolean
VMCommSystem.isEstablished(Hash peer)
Return whether established.
boolean
DummyClientManagerFacade.isLocal(Hash destHash)

boolean
DummyTunnelManagerFacade.isValidTunnel(Hash client, TunnelInfo tunnel)

void
DummyNetworkDatabaseFacade.lookupDestination(Hash key, Job onFinishedJob, long timeoutMs, Hash fromLocalDest)
Look up a destination using the client's tunnels.
Destination
DummyNetworkDatabaseFacade.lookupDestinationLocally(Hash key)
Look up a destination in the in-memory store.
void
DummyNetworkDatabaseFacade.lookupLeaseSet(Hash key, Job onFindJob, Job onFailedLookupJob, long timeoutMs)
Look up a lease set in the network database.
void
DummyNetworkDatabaseFacade.lookupLeaseSet(Hash key, Job onFindJob, Job onFailedLookupJob, long timeoutMs, Hash fromLocalDest)

LeaseSet
DummyNetworkDatabaseFacade.lookupLeaseSetLocally(Hash key)

void
DummyNetworkDatabaseFacade.lookupLeaseSetRemotely(Hash key, Hash fromLocalDest)

void
DummyNetworkDatabaseFacade.lookupLeaseSetRemotely(Hash key, Job onFindJob, Job onFailedLookupJob, long timeoutMs, Hash fromLocalDest)

DatabaseEntry
DummyNetworkDatabaseFacade.lookupLocally(Hash key)

DatabaseEntry
DummyNetworkDatabaseFacade.lookupLocallyWithoutValidation(Hash key)

void
DummyNetworkDatabaseFacade.lookupRouterInfo(Hash key, Job onFindJob, Job onFailedLookupJob, long timeoutMs)
Look up a router info in the network database.
RouterInfo
DummyNetworkDatabaseFacade.lookupRouterInfoLocally(Hash key)
Look up a router info in the in-memory store.
void
VMCommSystem.receive(byte[] message, Hash fromPeer)
We send messages between comms as bytes so that we strip any router-local info.
void
DummyPeerManagerFacade.removeCapabilities(Hash peer)

void
DummyNetworkDatabaseFacade.removeLeaseSetFromTracking(Hash key)
Remove a lease set from tracking.
void
DummyClientManagerFacade.requestLeaseSet(Hash dest, LeaseSet set)

TunnelInfo
DummyTunnelManagerFacade.selectInboundExploratoryTunnel(Hash closestTo)

TunnelInfo
DummyTunnelManagerFacade.selectInboundTunnel(Hash destination)

TunnelInfo
DummyTunnelManagerFacade.selectInboundTunnel(Hash destination, Hash closestTo)

TunnelInfo
DummyTunnelManagerFacade.selectOutboundExploratoryTunnel(Hash closestTo)

TunnelInfo
DummyTunnelManagerFacade.selectOutboundTunnel(Hash destination)

TunnelInfo
DummyTunnelManagerFacade.selectOutboundTunnel(Hash destination, Hash closestTo)

void
DummyPeerManagerFacade.setCapabilities(Hash peer, String caps)

void
DummyTunnelManagerFacade.setInboundSettings(Hash client, TunnelPoolSettings settings)

void
DummyTunnelManagerFacade.setOutboundSettings(Hash client, TunnelPoolSettings settings)

LeaseSet
DummyNetworkDatabaseFacade.store(Hash key, LeaseSet leaseSet)
Store a key locally.
RouterInfo
DummyNetworkDatabaseFacade.store(Hash key, RouterInfo routerInfo)
Store a key locally.
boolean
VMCommSystem.wasFailsafeClosed(Hash peer, long withinMs)
Always false, the VM transport never disconnects.
Method parameters in net.i2p.router.dummy with type arguments of type Hash
Modifier and Type
Method
Description
Set<Hash>
DummyNetworkDatabaseFacade.findNearestRouters(Hash key, int maxNumRouters, Set<Hash> peersToIgnore)

Constructors in net.i2p.router.dummy with parameters of type Hash
Modifier
Constructor
Description
ReceiveJob(Hash from, byte[] msg, RouterContext us)
Holds a message to deliver to a job.
Uses of Hash in net.i2p.router.message
Fields in net.i2p.router.message declared as Hash
Modifier and Type
Field
Description
private final Hash
GarlicMessageReceiver._clientDestination
The client the message is for.
private final Hash
SendMessageDirectJob._targetHash
The hash of the target router.
private final Hash
OutboundCache.HashPair.dh
The session's local hash.
private final Hash
OutboundCache.HashPair.sh
The session's remote hash.
Fields in net.i2p.router.message with type parameters of type Hash
Modifier and Type
Field
Description
(package private) final ConcurrentHashMap<Hash,Long>
OutboundCache.lsFailCooldown
Per-destination cooldown timestamps (epoch ms) after a failed LeaseSet lookup.
(package private) final ConcurrentHashMap<Hash,Long>
OutboundCache.lsLastLookup
Timestamp (epoch ms) when the most recent real LeaseSet lookup for the destination started.
(package private) final ConcurrentHashMap<Hash,Long>
OutboundCache.lsLastValid
Timestamp (epoch ms) when a valid LeaseSet for the destination was last observed locally (set on local find and on successful send).
final ConcurrentHashMap<Hash,LeaseSet>
OutboundCache.multihomedCache
Cache for LeaseSets associated with multihomed routers or hosted destinations.
Methods in net.i2p.router.message that return Hash
Modifier and Type
Method
Description
(package private) static Hash
OutboundClientMessageOneShotJob.starvationNudgeKey(Hash sourceHash, Hash destHash)
Which hash a pool-starvation nudge must be addressed to.
Methods in net.i2p.router.message with parameters of type Hash
Modifier and Type
Method
Description
private static PayloadGarlicConfig
OutboundClientMessageJobHelper.buildAckClove(RouterContext ctx, Hash from, TunnelInfo replyToTunnel, long replyToken, long expiration, SessionKeyManager skm)
Build a clove that sends a DeliveryStatusMessage to us.
(package private) static GarlicMessage
GarlicMessageBuilder.buildECIESMessage(RouterContext ctx, GarlicConfig config, Hash from, Destination to, SessionKeyManager skm, ReplyCallback callback)
ECIES_X25519 and PQ only.
private static GarlicConfig
OutboundClientMessageJobHelper.createGarlicConfig(RouterContext ctx, long replyToken, long expiration, PublicKey recipientPK, PayloadGarlicConfig dataClove, Hash from, Destination dest, TunnelInfo replyTunnel, boolean requireAck, LeaseSet bundledReplyLeaseSet, SessionKeyManager skm)
Make the top-level config, with a data clove, an optional ack clove, and an optional leaseset clove.
(package private) static GarlicMessage
OutboundClientMessageJobHelper.createGarlicMessage(RouterContext ctx, long replyToken, long expiration, PublicKey recipientPK, PayloadGarlicConfig dataClove, Hash from, Destination dest, TunnelInfo replyTunnel, int tagsToSendOverride, int lowTagsOverride, SessionKey wrappedKey, Set<SessionTag> wrappedTags, boolean requireAck, LeaseSet bundledReplyLeaseSet, ReplyCallback callback)
Build a garlic message that will be delivered to the router on which the target is located.
Job
GarlicMessageHandler.createJob(I2NPMessage receivedMessage, RouterIdentity from, Hash fromHash)
Create and return a job to handle this message.
private String
OutboundClientMessageOneShotJob.getDestNickname(Hash dest)
Resolve a human-readable nickname for a destination, if available.
(package private) static boolean
GarlicMessageBuilder.needsTags(RouterContext ctx, PublicKey key, Hash local, int minTagOverride)
ELGAMAL_2048 only; returns false for others.
(package private) static Hash
OutboundClientMessageOneShotJob.starvationNudgeKey(Hash sourceHash, Hash destHash)
Which hash a pool-starvation nudge must be addressed to.
Method parameters in net.i2p.router.message with type arguments of type Hash
Modifier and Type
Method
Description
private static void
OutboundCache.cleanLsFailCooldown(RouterContext ctx, Map<Hash,Long> cc)
Removes expired LS fail cooldown entries.
private static void
OutboundCache.cleanLsLastLookup(RouterContext ctx, Map<Hash,Long> mc)
Prunes last-lookup timestamps older than two probe intervals.
private static void
OutboundCache.cleanLsLastValid(RouterContext ctx, Map<Hash,Long> mc)
Prunes last-valid timestamps older than the transient-gap grace window plus one cleanup interval (so a two-minute slack is kept).
private static void
OutboundCache.cleanMultihomedCache(RouterContext ctx, Map<Hash,LeaseSet> mc)
Removes expired LeaseSets from the multihomed cache.
Constructors in net.i2p.router.message with parameters of type Hash
Modifier
Constructor
Description
GarlicMessageReceiver(RouterContext context, GarlicMessageReceiver.CloveReceiver receiver, Hash clientDestination)
Garlic message receiver targeting a specific client destination.
HandleGarlicMessageJob(RouterContext context, GarlicMessage msg, RouterIdentity from, Hash fromHash, long msgIDBloomXorLocal, long msgIDBloomXorRouter, long msgIDBloomXorTunnel)
Job to handle an inbound garlic message received outside of a tunnel.
(package private)
HashPair(Hash s, Hash d)
Hash pair.
SendMessageDirectJob(RouterContext ctx, I2NPMessage message, Hash toPeer, int timeoutMs, int priority)
Send a message directly to a peer.
SendMessageDirectJob(RouterContext ctx, I2NPMessage message, Hash toPeer, int timeoutMs, int priority, long msgIDBloomXor)
Send a message directly to a peer with an XOR mask.
SendMessageDirectJob(RouterContext ctx, I2NPMessage message, Hash toPeer, Job onSend, ReplyJob onSuccess, Job onFail, MessageSelector selector, int timeoutMs, int priority, long msgIDBloomXor)
Send a message directly to a peer with full options.
SendMessageDirectJob(RouterContext ctx, I2NPMessage message, Hash toPeer, ReplyJob onSuccess, Job onFail, MessageSelector selector, int timeoutMs, int priority)
Send a message directly to a peer with reply handling.
SendMessageDirectJob(RouterContext ctx, I2NPMessage message, Hash toPeer, ReplyJob onSuccess, Job onFail, MessageSelector selector, int timeoutMs, int priority, long msgIDBloomXor)
Send a message directly to a peer with reply handling and XOR mask.
Uses of Hash in net.i2p.router.naming
Methods in net.i2p.router.naming with parameters of type Hash
Modifier and Type
Method
Description
private List<String>
BlockfileNamingService.getReverseEntries(Hash hash)
Caller must synchronize.
private static Integer
BlockfileNamingService.getReverseKey(Hash hash)
Reverse lookup key for the hash.
String
BlockfileNamingService.reverseLookup(Hash h)
Look up a hostname from a hash.
List<String>
BlockfileNamingService.reverseLookupAll(Hash h)
Return all hostnames registered for this hash.
Uses of Hash in net.i2p.router.networkdb
Fields in net.i2p.router.networkdb declared as Hash
Modifier and Type
Field
Description
private final Hash
HandleDatabaseLookupMessageJob._us
Our own router hash.
Methods in net.i2p.router.networkdb that return types with arguments of type Hash
Modifier and Type
Method
Description
private Set<Hash>
HandleDatabaseLookupMessageJob.getNearestRouters(DatabaseLookupMessage.Type lookupType)
Closest to the message's search key, honoring the message's dontInclude set.
Methods in net.i2p.router.networkdb with parameters of type Hash
Modifier and Type
Method
Description
protected void
HandleDatabaseLookupMessageJob.sendClosest(Hash key, Set<Hash> routerHashes, Hash toPeer, TunnelId replyTunnel)
Send the closest routers to the requesting peer.
private void
HandleDatabaseLookupMessageJob.sendData(Hash key, DatabaseEntry data, Hash toPeer, TunnelId replyTunnel)
Sends the data that was found.
protected void
HandleDatabaseLookupMessageJob.sendMessage(I2NPMessage message, Hash toPeer, TunnelId replyTunnel)
Send an I2NP message to the specified peer.
private void
HandleDatabaseLookupMessageJob.sendThroughTunnel(I2NPMessage message, Hash toPeer, TunnelId replyTunnel)
Sends the message through the reply tunnel.
Method parameters in net.i2p.router.networkdb with type arguments of type Hash
Modifier and Type
Method
Description
protected void
HandleDatabaseLookupMessageJob.sendClosest(Hash key, Set<Hash> routerHashes, Hash toPeer, TunnelId replyTunnel)
Send the closest routers to the requesting peer.
Constructors in net.i2p.router.networkdb with parameters of type Hash
Modifier
Constructor
Description
HandleDatabaseLookupMessageJob(RouterContext ctx, DatabaseLookupMessage receivedMessage, RouterIdentity _from, Hash _fromHash, long msgIDBloomXor)
Creates a new HandleDatabaseLookupMessageJob.
Uses of Hash in net.i2p.router.networkdb.kademlia
Subclasses of Hash in net.i2p.router.networkdb.kademlia
Modifier and Type
Class
Description
(package private) class
LocalHash
Pull the caching used only by KBucketImpl out of Hash and put it here.
Classes in net.i2p.router.networkdb.kademlia that implement interfaces with type arguments of type Hash
Modifier and Type
Class
Description
private class
FloodfillPeerSelector.FloodfillSelectionCollector
Collector picking the closest floodfills.
(package private) class
StaleContactTrimmer
Evicts the least-recently-attested peer from a full routing bucket so the netdb routing table rotates toward live peers instead of filling with dead-but-unexpired routers.
Fields in net.i2p.router.networkdb.kademlia declared as Hash
Modifier and Type
Field
Description
private static Hash
IterativeSearchJob._alwaysQueryHash
Hash to always query first, set from a router property for testing.
private final Hash
FloodfillVerifyStoreJob._client
The client that published the data.
private final Hash
KademliaNetworkDatabaseFacade._dbid
DB ID.
private final Hash
RepublishLeaseSetJob._dest
Destination hash.
private Hash
HandleFloodfillDatabaseStoreMessageJob._fromHash
The sender's hash, computed when needed.
private final Hash
IterativeSearchJob._fromLocalDest
The local destination to search from, null if none.
private final Hash
FloodfillPeerSelector.FloodfillSelectionCollector._key
The hash being searched for.
private final Hash
FloodfillVerifyStoreJob._key
The key being verified.
protected final Hash
FloodSearchJob._key
Target database entry hash being searched.
private final Hash
PersistentDataStore.ReadRouterJob._key
Hash key of the router.
private final Hash
StoreState._key
The key being stored.
private Hash
ExploreJob._lastReplyFrom
The peer that answered the last explore.
private final Hash
FloodfillNetworkDatabaseFacade.DropLookupFailedJob._peer
The peer being searched for.
private final Hash
FloodfillNetworkDatabaseFacade.DropLookupFoundJob._peer
The peer the reply goes to.
private final Hash
FloodfillNetworkDatabaseFacade.FloodFailedJob._peer
The peer whose reply is awaited.
private final Hash
FloodfillNetworkDatabaseFacade.FloodSuccessJob._peer
The peer being processed.
private final Hash
IterativeTimeoutJob._peer
The peer that did not answer.
private Hash
SearchJob.FailedJob._peer
Peer hash.
private final Hash
SearchMessageSelector._peer
The peer being searched for.
private final Hash
SearchReplyJob._peer
The peer that sent the reply.
private final Hash
SearchUpdateReplyFoundJob._peer
The hash of the searched peer.
private final Hash
StoreMessageSelector._peer
The peer whose reply we are waiting for.
private final Hash
IterativeSearchJob._rkey
The routing key.
private final Hash
SearchState._searchKey
The hash being searched for.
private final Hash
FloodfillVerifyStoreJob._sentTo
The floodfill the query was sent to.
private Hash
FloodfillVerifyStoreJob._target
The floodfill currently holding the data.
private final Hash
SingleSearchJob._to
The hash being looked up.
final Hash
LookupBanHammer.ReplyTunnel.h
The hash of the peer that replied.
private final Hash
PersistentDataStore.Disconnector.h
Router hash to disconnect.
private final Hash
RefreshRoutersJob.Disconnector.h
The router to disconnect.
static final Hash
FloodfillNetworkDatabaseSegmentor.MAIN_DBID
Database id of the special main netDb, deliberately null so it is never confused with a client's hash-keyed id.
(package private) final Hash
FloodfillNetworkDatabaseFacade.TimeoutEntry.peer
The peer being searched for.
Fields in net.i2p.router.networkdb.kademlia with type parameters of type Hash
Modifier and Type
Field
Description
private final ConcurrentHashMap<Hash, AtomicInteger>
KademliaNetworkDatabaseFacade._activeFloodfillQueries
Count of active outbound iterative-search queries per floodfill peer; incremented when a query is dispatched, decremented when it completes or fails.
private final ConcurrentHashMap<Hash, FloodSearchJob>
FloodfillNetworkDatabaseFacade._activeFloodQueries
Active flood queries keyed by search hash.
private final Set<Hash>
SearchState._attemptedPeers
Peers asked at any point in the search.
private final Set<Hash>
StoreState._attemptedPeers
The peers contacted so far.
private final Map<Hash,long[]>
IntroducerLookupJob._attempts
Introducer hash -> {last attempt time, consecutive failures}.
private final Set<Hash>
KademliaNetworkDatabaseFacade._batchRepublishPending
Pending set for batch deduplication — a hash is in this set iff it is in the batch queue or being processed.
private final ConcurrentLinkedQueue<Hash>
KademliaNetworkDatabaseFacade._batchRepublishQueue
Queue for batching LeaseSet republishes within a 15-second window.
private final ConcurrentHashMap<Hash,Long>
KademliaNetworkDatabaseFacade._clientLeaseSetAccessTime
Map of remote destination Hash to last access time for LeaseSets we're using as a client.
private final ConcurrentHashMap<Hash, DatabaseEntry>
TransientDataStore._data
Entries held only for this router's uptime.
private final Set<Hash>
KademliaNetworkDatabaseFacade._exploreKeys
Hash objects that we should search on (to fill up a bucket, not to get data).
private final Set<Hash>
IterativeSearchJob._failedPeers
Query sent, failed, timed out, or got DSRM.
private final Set<Hash>
SearchState._failedPeers
Peers that failed to reply.
private static final ConcurrentHashMap<Hash,Long>
RepublishLeaseSetJob._firstDeferredAt
When the first publish was deferred, per destination, cleared on success or on the first publish timeout.
private final List<Hash>
FloodfillPeerSelector.FloodfillSelectionCollector._floodfillMatches
Floodfill hashes matching the search.
private static final ConcurrentHashMap<Hash, AtomicInteger>
RepublishLeaseSetJob._globalFailCount
Persistent per-destination store failure count, never reset, surviving job instances, used to decide when to do the expensive floodfill verification.
private final ConcurrentHashMap<Hash, BlindData>
BlindCache._hashCache
The blind data, by destination hash.
private final Set<Hash>
FloodfillVerifyStoreJob._ignore
Floodfills not to query again.
private final Map<Hash, RouterInfo>
FloodfillPeerSelector.FloodfillSelectionCollector._infoCache
Router infos cached during the search.
private final Iterator<Hash>
KademliaNetworkDatabaseFacade.PurgeMatchingRoutersJob._iter
Iterator over peer hashes during search.
private KBucketSet<Hash>
KademliaNetworkDatabaseFacade._kb
Kbucket set.
private final Map<Hash, DatabaseEntry>
PersistentDataStore.Writer._keys
Queue of entries pending disk write.
private final Set<Hash>
PersistentDataStore.Writer._keysToRemove
Keys to remove from disk on next write cycle.
private static final ConcurrentHashMap<Hash,Long>
RepublishLeaseSetJob._lastIneffectiveRemint
When this destination last ran a re-mint that could not improve anything.
private static final ConcurrentHashMap<Hash,Long>
RepublishLeaseSetJob._lastMissingLogTime
Last log timestamp per destination to throttle missing-LeaseSet log messages.
private static final ConcurrentHashMap<Hash,Long>
RepublishLeaseSetJob._lastNotRequeueLogTime
Last log timestamp per destination to throttle no-requeue log messages.
private final Map<Hash,Long>
ProbeStalePeerJob._lastProbed
When each peer was last probed.
private static final ConcurrentHashMap<Hash,Long>
RepublishLeaseSetJob._lastPublishLogTime
Last publish attempt per destination.
private final Map<Hash,Long>
ContactDrivenRefreshJob._lastRefresh
Cooldown tracker: peer hash -> last refresh time (ms).
private static final ConcurrentHashMap<Hash,Long>
RepublishLeaseSetJob._lastShortExpiryLog
Last short-expiry warning per destination, for rate limiting.
private static final ConcurrentHashMap<Hash,Long>
RepublishLeaseSetJob._lastVerifyLogTime
Last log timestamp per destination to throttle verification log messages.
private final Map<Hash,LeaseSet>
SearchState._leaseSetResponses
Lease sets found, by hash.
private final ConcurrentLinkedQueue<Hash>
ContactDrivenRefreshJob._pending
Peers we've heard from recently that may need a RI refresh.
private final Map<Hash, MessageWrapper.WrappedMessage>
StoreState._pendingMessages
The sent messages awaiting a reply.
private final Set<Hash>
SearchState._pendingPeers
Peers asked, waiting for a reply.
private final HashSet<Hash>
StoreState._pendingPeers
The peers not yet replied.
private final Map<Hash,Long>
SearchState._pendingPeerTimes
When each pending peer was asked.
private final Map<Hash,Long>
StoreState._pendingPeerTimes
When each pending peer was contacted.
private static final Set<Hash>
RepublishLeaseSetJob._publishedOnce
Destinations that have published successfully at least once — never defer these again.
private final ConcurrentMap<Hash, Set<RepublishLeaseSetJob>>
KademliaNetworkDatabaseFacade._publishingLeaseSets
Map of Hash to RepublishLeaseSetJob for leases we're already managing.
private final Set<Hash>
IterativeSearchJob._queriedFloodfills
Floodfill peers we've sent queries to in this search — for active-query tracking.
private static final ConcurrentHashMap<Hash,Long>
IterativeSearchJob._recentlyCompleted
Static cache of recently completed searches: peer hash -> expiration timestamp.
private final ConcurrentHashMap<Hash,Long>
KademliaNetworkDatabaseFacade._recentlyQueriedFloodfills
Tracks recently-queried floodfill peers across all concurrent searches to avoid hammering the same floodfill.
private static final ConcurrentHashMap<Hash, AtomicInteger>
RepublishLeaseSetJob._remintDefers
Consecutive re-mint deferral count per destination, to bound fresh-build waiting.
private final Set<Hash>
SearchState._repliedPeers
Peers that replied at all.
private static final ConcurrentHashMap<Hash,Boolean>
RepublishLeaseSetJob._retryInProgress
Tracks destinations currently being retried to prevent duplicate retries.
private Deque<Hash>
RefreshRoutersJob._routers
The routers still to visit this cycle, highest-value first.
private final Map<Hash,Integer>
ProbeStalePeerJob._scores
Probe scores for the current cycle's candidates, keyed by hash.
private final Map<Hash,Long>
IterativeSearchJob._sentTime
The time the query was sent to a peer, which we need to update profiles correctly.
private final Set<Hash>
IterativeSearchJob._skippedPeers
The peers left out of the search.
private final TreeSet<Hash>
FloodfillPeerSelector.FloodfillSelectionCollector._sorted
Candidate hashes, sorted by distance.
private final Set<Hash>
SearchState._successfulPeers
Peers that replied with results.
private final Set<Hash>
StoreState._successfulPeers
The peers that stored the entry.
private static final ConcurrentHashMap<Hash,Integer>
RepublishLeaseSetJob._supplyDeferrals
Consecutive supply-check deferrals per destination, bounded so a pool that never reaches the freshness threshold cannot defer its LeaseSet forever.
private final Set<Hash>
KademliaNetworkDatabaseFacade.PurgeMatchingRoutersJob._toCheck
To check set.
private final Set<Hash>
FloodfillPeerSelector.FloodfillSelectionCollector._toIgnore
Hashes to skip in the search.
private final SortedSet<Hash>
IterativeSearchJob._toTry
Peers not sent to yet, sorted closest-to-the-routing-key.
private final HashSet<Hash>
FloodOnlySearchJob._unheardFrom
Peers that did not answer this search.
private final Set<Hash>
IterativeSearchJob._unheardFrom
Query sent, no reply yet.
private final Map<Hash,Long>
KademliaNetworkDatabaseFacade._unverifiedPeers
Peers stored in the netdb but not yet in the routing buckets, awaiting direct-contact evidence before insertion (verify-before-add).
private final Set<Hash>
FloodfillNetworkDatabaseFacade._verifiesInProgress
Hashes whose verification is in progress.
private Map<Hash,byte[]>
LocalHash._xorCache
Distances already computed, by peer hash.
private final Map<Hash, Destination>
NegativeLookupCache.badDests
The destinations known to be bad.
private final Map<Hash, ConcurrentHashMap<TunnelId, Deque<Long>>>
LookupThrottler.burstTimestamps
Map of peer hashes to sets of reply tunnel IDs for throttling.
private final Map<Hash,Long>
NegativeLookupCache.cachedUntil
Epoch ms until which a tripped key remains negatively cached.
private final ObjectCounter<Hash>
FloodThrottler.counter
Lookup floods counted per peer.
private final ConcurrentHashMap<Hash, ConcurrentHashMap<TunnelId, AtomicInteger>>
LookupThrottler.counter
Concurrent hash map.
private final ObjectCounter<Hash>
NegativeLookupCache.counter
Failed lookups per hash.
private final Map<Hash,Long>
NegativeLookupCache.lastFailAt
Last time a fail was recorded for the key (streak / age tracking).
private final ObjectCounter<Hash>
NegativeLookupCache.timeoutCounter
Timed out lookups per hash.
private final Map<Hash,Integer>
NegativeLookupCache.tripCount
How many times the key has tripped the threshold (TTL backoff).
Methods in net.i2p.router.networkdb.kademlia that return Hash
Modifier and Type
Method
Description
Hash
BlindCache.getBlindedHash(Destination dest)
The hash to lookup for a dest.
Hash
BlindCache.getBlindedHash(SigningPublicKey spk)
The hash to lookup for a SPK known to be blinded.
private Hash
FloodfillStoreJob.getClientHash(DatabaseEntry data, Hash key)
The client hash from the data, or the key if not available.
(package private) Hash
RepublishLeaseSetJob.getDestHash()
The destination hash this job publishes for.
Hash
IterativeSearchJob.getFromHash()
Hash of the dest this query is from.
Hash
BlindCache.getHash(Destination dest)
The hash to lookup for a dest.
Hash
BlindCache.getHash(Hash h)
The hash to lookup for a dest hash.
private static Hash
PersistentDataStore.getHash(String filename, String prefix, String suffix)
Extract hash from a prefixed+suffixed filename.
Hash
FloodSearchJob.getKey()
The database entry hash being searched.
(package private) static Hash
PersistentDataStore.getRouterInfoHash(String filename)
Package private for installer BundleRouterInfos.
Hash
StoreState.getSuccessful()
Return a successful peer (a random one if more than one was successful) or null.
Hash
SearchState.getTarget()
The search target.
Hash
StoreState.getTarget()
The DatabaseEntry hash target.
(package private) static Hash
IntroducerLookupJob.parseIntroducerHash(String b64)
Decode an "ih{i}" option value into a Hash: Base64 of exactly 32 bytes, else null.
private Hash
FloodfillVerifyStoreJob.pickTarget()
Pick a responsive floodfill close to the key, but not the one we sent to.
Methods in net.i2p.router.networkdb.kademlia that return types with arguments of type Hash
Modifier and Type
Method
Description
private List<Hash>
FloodfillPeerSelector.buildFloodfillCandidates(Set<Hash> toIgnore)
Build the floodfill candidate list with only the cheap per-peer checks: the exclusion set, the two banlist tiers, and the unreachable capability flag.
private List<Map.Entry<Hash, DatabaseEntry>>
PersistentDataStore.Writer.drainPending()
Drain up to WRITE_LIMIT pending entries from the write queue.
Set<Hash>
KademliaNetworkDatabaseFacade.findNearestRouters(Hash key, int maxNumRouters, Set<Hash> peersToIgnore)
The routers closest to that key in response to a remote lookup.
List<Hash>
FloodfillPeerSelector.FloodfillSelectionCollector.get(int howMany)
The first howMany matching entries, floodfills with the 'f' mark in their NetDb except for banlisted ones; non-floodfills only if there aren't enough floodfills.
Set<Hash>
KademliaNetworkDatabaseFacade.getAllRouters()
Hashes for all known routers.
Set<Hash>
SearchState.getAttempted()
Copy of the attempted peers.
Set<Hash>
StoreState.getAttempted()
The peers attempted OR skipped.
Set<Hash>
SearchState.getClosestAttempted(int max)
Up to max attempted peers closest to the target.
private List<Hash>
StoreJob.getClosestFloodfillRouters(Hash key, int numClosest, Set<Hash> alreadyChecked)
Find the closest floodfill routers to a given key.
private List<Hash>
SearchJob.getClosestRouters(Hash key, int numClosest, Set<Hash> alreadyChecked)
Hash structures for routers we want to check next.
Set<Hash>
KademliaNetworkDatabaseFacade.getExploreKeys()
Keys to explore.
Set<Hash>
SearchState.getFailed()
Copy of the failed peers.
List<Hash>
FloodfillNetworkDatabaseFacade.getFloodfillPeers()
List of the hashes of currently known floodfill peers.
(package private) static List<Hash>
IntroducerLookupJob.getIntroducerHashes(Collection<RouterAddress> addresses)
Extract SSU2 introducer router hashes ("ih0".."ih4") from the given addresses.
(package private) KBucketSet<Hash>
KademliaNetworkDatabaseFacade.getKBuckets()
KBucketSet for the main DB.
Set<Hash>
DataStore.getKeys()
All keys stored in the data store.
Set<Hash>
TransientDataStore.getKeys()
Keys of all stored entries.
Set<Map.Entry<Hash, DatabaseEntry>>
DataStore.getMapEntries()
All map entries in the data store.
Set<Map.Entry<Hash, DatabaseEntry>>
TransientDataStore.getMapEntries()
All stored entries as key-value pairs.
Set<Hash>
SearchState.getPending()
Copy of the pending peers.
Set<Hash>
SearchState.getRepliedPeers()
Copy of the peers that replied.
Set<Hash>
SearchState.getSuccessful()
Copy of the successful peers.
(package private) Set<Hash>
KademliaNetworkDatabaseFacade.getUnverifiedPeersSnapshot()
Snapshot of the pending-verification queue, for the probe cycle to target.
private Set<Hash>
SearchState.locked_getClosest(Set<Hash> peers, int max, Hash target)
Picks the peers closest to the target.
private Set<Hash>
FloodfillNetworkDatabaseFacade.selectFloodfillParticipants(Set<Hash> toIgnore, int concurrent)
Selects a set of floodfill participant peers to which data should be sent: random selection among the filtered floodfill participants, preferring peers not queried in the last 60s to spread load, with a fallback top-up so store operations never starve.
(package private) List<Hash>
FloodfillPeerSelector.selectFloodfillParticipants(Set<Hash> toIgnore, KBucketSet<Hash> _kbuckets)
List MAY INCLUDE our own hash.
(package private) List<Hash>
FloodfillPeerSelector.selectFloodfillParticipants(Hash key, int howMany, Set<Hash> toIgnore, KBucketSet<Hash> kbuckets)
See above for description List will not include our own hash Returns new list, may be modified.
(package private) List<Hash>
FloodfillPeerSelector.selectFloodfillParticipants(Hash key, int maxNumRouters, KBucketSet<Hash> kbuckets)
Sort the floodfills.
(package private) List<Hash>
FloodfillPeerSelector.selectFloodfillParticipants(KBucketSet<Hash> kbuckets)
List will not include our own hash.
private List<Hash>
FloodfillPeerSelector.selectFloodfillParticipantsIncludingUs(Hash key, int howMany, Set<Hash> toIgnore, KBucketSet<Hash> kbuckets)
See above for description List MAY CONTAIN our own hash unless included in toIgnore Returns new list, may be modified.
private List<Hash>
ExpireLeasesJob.selectKeysToExpire()
Run through the entire data store, finding all expired leaseSets (ones that don't have any leases that haven't yet passed, even with the CLOCK_FUDGE_FACTOR).
private Set<Hash>
StartExplorersJob.selectKeysToExplore(int num)
Selects a set of keys from the exploration pool, supplementing with bucket-targeted keys (classic Kademlia bucket refresh) and then random keys if needed.
(package private) List<Hash>
FloodfillPeerSelector.selectNearest(Hash key, int maxNumRouters, Set<Hash> peersToIgnore, KBucketSet<Hash> kbuckets)
Floodfill peers only.
(package private) abstract List<Hash>
PeerSelector.selectNearest(Hash key, int maxNumRouters, Set<Hash> peersToIgnore, KBucketSet<Hash> kbuckets)
Peers nearest to the key in routing space.
(package private) List<Hash>
FloodfillPeerSelector.selectNearestExplicit(Hash key, int maxNumRouters, Set<Hash> peersToIgnore, KBucketSet<Hash> kbuckets)
Pick out peers with the floodfill capacity set, returning them first, but then after they're complete, sort via kademlia.
(package private) abstract List<Hash>
PeerSelector.selectNearestExplicit(Hash key, int maxNumRouters, Set<Hash> peersToIgnore, KBucketSet<Hash> kbuckets)
Peers nearest to the key, floodfills first, then sorted by Kademlia distance.
(package private) static Set<Hash>
FloodfillNetworkDatabaseFacade.selectStoreParticipants(List<Hash> shuffled, int concurrent, Set<Hash> recentlyQueried)
Select up to concurrent store participants, preferring peers not queried in the last 60s to spread load, with a fallback top-up so store operations never starve.
Methods in net.i2p.router.networkdb.kademlia with parameters of type Hash
Modifier and Type
Method
Description
void
KademliaNetworkDatabaseFacade.accessLeaseSet(Hash key)
Record access to a LeaseSet for refresh tracking.
(package private) boolean
ExploreJob.add(Hash peer)
This is called from SearchReplyJob.
void
FloodfillPeerSelector.FloodfillSelectionCollector.add(Hash entry)
Add an entry to the selection, skipping ignored, banlisted, or non-floodfill entries once enough matches have been collected.
(package private) boolean
SearchJob.add(Hash peer)
Adds a peer to the search.
(package private) static void
IterativeSearchJob.addClosest(Collection<Hash> candidates, Collection<Hash> allRouters, Hash rkey, Hash us, Hash key, int cap)
Add the closest cap peers of allRouters, by XOR distance from rkey, excluding us and key.
(package private) boolean
KademliaNetworkDatabaseFacade.addContact(Hash key)
Policy entry point for peers learned from search replies, where no RouterInfo is in hand yet: direct-contact gate only.
private void
KademliaNetworkDatabaseFacade.addContact(Hash key, RouterInfo routerInfo)
Insert a newly-stored peer into the routing buckets, gated on two local-only checks (no wire-format change): verify-before-add — a peer merely named in someone else's DatabaseSearchReply has never answered us, so it waits in KademliaNetworkDatabaseFacade._unverifiedPeers until direct-contact evidence arrives (a reply, a successful send, or an established session).
void
SearchState.addInitialLeaseSetResponse(Hash peer, LeaseSet ls)
Record the peer's LeaseSet response from the initial phase.
void
SearchState.addLeaseSetResponse(Hash peer, LeaseSet ls)
Record the peer's LeaseSet response.
void
SearchState.addPending(Hash peer)
Add the peer to the pending and attempted sets.
void
StoreState.addPending(Hash peer)
Increments attempted count.
void
StoreState.addPending(Hash peer, MessageWrapper.WrappedMessage msg)
Adds a pending message for tracking.
(package private) static boolean
FloodfillPeerSelector.addSameIPFingerprint(Set<Long> maskedIPs, Set<Integer> ports, Set<String> families, RouterContext ctx, Hash peer, RouterInfo pinfo, int mask)
Fingerprint a candidate peer into the exclusion accumulators, adding compact masked-IP keys, ports, and the claimed family option.
void
StoreState.addSkipped(Hash peer)
We aren't even going to try to contact this peer.
private boolean
KademliaNetworkDatabaseFacade.allowPolicyBan(Hash key)
Whether policy bans (country/XG/LU/capability) may be applied to this router during resolution.
private void
FloodfillPeerSelector.banAndDisconnect(Hash entry, RouterInfo info, String banReason, String logReason, String disconnectReason, long banDuration, long logDuration, long now)
Ban, log, and disconnect from a floodfill peer, with separate texts for the banlist, the ban log, and the disconnect reason.
protected I2NPMessage
ExploreJob.buildMessage(TunnelId replyTunnelId, Hash replyGateway, long expiration, RouterInfo peer)
Builds the database lookup message to send to a peer.
protected I2NPMessage
SearchJob.buildMessage(TunnelId replyTunnelId, Hash replyGateway, long expiration, RouterInfo peer)
Build the database search message.
void
NegativeLookupCache.cache(Hash h)
Negative cache the hash for one entry-TTL generation.
private RouterInfo
FloodfillPeerSelector.FloodfillSelectionCollector.cachedInfo(Hash entry)
Look up the RouterInfo for an entry, caching the result.
byte[]
LocalHash.cachedXor(Hash key)
Calculate the xor with the current object and the specified hash, caching values where possible.
private boolean
KademliaNetworkDatabaseFacade.cancelActiveRepublishJob(Hash hash)
Cancel any queued RepublishLeaseSetJob for the given hash.
private boolean
KademliaNetworkDatabaseFacade.checkCountryBlocking(RouterInfo routerInfo, String caps, String routerId, Hash h)
Checks if the given router should be blocked due to country restrictions.
private String
KademliaNetworkDatabaseFacade.checkExpiredLeaseSet(Hash key, LeaseSet leaseSet, long earliest, long latest, long now, String idShort)
Reject a LeaseSet whose timestamps are outdated (stale).
private String
KademliaNetworkDatabaseFacade.checkFutureRouterInfo(RouterInfo routerInfo, long now, String caps, String routerId, Hash h, boolean isUs)
Checks if the given router info was published in the future and bans it if so.
private void
KademliaNetworkDatabaseFacade.checkLeaseSetSigType(Hash h, LeaseSet ls)
Reject LeaseSets with unsupported signature types; negative-cache the destination permanently.
private boolean
KademliaNetworkDatabaseFacade.checkLU(RouterInfo routerInfo, String caps, String routerId, Hash h)
Ban LU (low bandwidth) routers unconditionally for 1 hour.
private void
KademliaNetworkDatabaseFacade.checkRouterInfoSigType(Hash h, RouterInfo ri)
Reject RouterInfos with unsupported signature types; ban until restart.
private String
KademliaNetworkDatabaseFacade.checkRouterVersion(RouterInfo routerInfo, String caps, String routerId, Hash h)
Checks if the given router is running a version older than the minimum allowed.
private boolean
PersistentDataStore.checkSpoofAndBan(Hash key, RouterInfo ri, PersistentDataStore.RiFlags f)
Detect IP spoofing and apply ban decisions for non-storeable peers.
private boolean
KademliaNetworkDatabaseFacade.checkXG(RouterInfo routerInfo, String caps, String routerId, Hash h)
Whether the router should be XG-banned: an X-tier (unlimited bandwidth) router advertising the G (no tunnels) capability.
private FloodfillPeerSelector.PeerClass
FloodfillPeerSelector.classifyFloodfillPeer(Hash entry, RouterInfo info, boolean sameIP, long now, boolean enforceHeard, double maxFailRate)
Classify a single floodfill peer as GOOD, OK, or BAD for selection.
FloodfillPeerSelector.PeerClass
FloodfillPeerSelector.classifyFloodfillPeerForDisplay(Hash entry, RouterInfo info, long now)
Classify a floodfill peer for display purposes.
void
NegativeLookupCache.clear(Hash h)
Clears the transient failure count for the given hash only, including its trip generation (next trip starts at base TTL).
void
KademliaNetworkDatabaseFacade.clearNegativeCache(Hash key)
Clear any transient (non-permanent) negative-cache entry for the given key so the next KademliaNetworkDatabaseFacade.lookupLeaseSet(Hash, Job, Job, long) performs a real search instead of aborting instantly.
static void
IterativeSearchJob.clearRecentlyQueried(Hash peer)
Clear peer from grace period cache (received their response).
NetworkDatabaseFacade
FloodfillNetworkDatabaseSegmentor.clientNetDB(Hash id)
The client netDb for the given id.
abstract NetworkDatabaseFacade
SegmentedNetworkDatabaseFacade.clientNetDB(Hash dbid)
A client netDb for a given client Hash identifier.
private void
IterativeSearchJob.collectFingerprint(RouterContext ctx, Hash peer, int mask)
Collect one candidate's fingerprint keys into the reusable scratch buffers, without claiming them.
(package private) void
FloodfillNetworkDatabaseFacade.complete(Hash key)
Must be called by the search job queued by search() on success or failure.
long
StoreState.confirmed(Hash peer)
Mark the peer as confirmed and return the response time.
void
FloodfillNetworkDatabaseFacade.contactHeardFrom(Hash peer)
Notify that we heard from or about a peer (e.g.
Job
FloodfillDatabaseLookupMessageHandler.createJob(I2NPMessage receivedMessage, RouterIdentity from, Hash fromHash)
Creates a job to handle an incoming DatabaseLookupMessage, or returns null if the lookup should be dropped.
Job
FloodfillDatabaseStoreMessageHandler.createJob(I2NPMessage receivedMessage, RouterIdentity from, Hash fromHash)

long
SearchState.dataFound(Hash peer)
How long it took to get the reply, or -1 if we don't know.
(package private) void
KademliaNetworkDatabaseFacade.decrementActiveFloodfillQuery(Hash floodfill)
Decrement the active outbound query count for a floodfill peer.
(package private) int
FloodOnlySearchJob.decrementRemaining(Hash peer)
Note that we heard from the peer.
(package private) boolean
KademliaNetworkDatabaseFacade.dropAfterLookupFailed(Hash peer)
Final remove for a router info.
private void
NegativeLookupCache.expireDue(Hash h, long now)
If the key already has a per-entry TTL, drop counts when due (lazy expire).
private PersistentDataStore.RiFlags
PersistentDataStore.extractRiFlags(Hash key, RouterInfo ri)
Extract classification flags from raw RouterInfo data.
void
KademliaNetworkDatabaseFacade.fail(Hash dbEntry)
Final remove for a leaseset.
(package private) void
IterativeSearchJob.failed(Hash peer, boolean timedOut)
Note that the peer did not respond with a DSM (either a DSRM, timeout, or failure).
Set<Hash>
KademliaNetworkDatabaseFacade.findNearestRouters(Hash key, int maxNumRouters, Set<Hash> peersToIgnore)
The routers closest to that key in response to a remote lookup.
boolean
DataStore.forcePut(Hash key, DatabaseEntry data)
Unconditionally store, bypass all newer/older checks.
boolean
PersistentDataStore.forcePut(Hash key, DatabaseEntry data)
Unconditionally store, bypassing all newer/older checks.
boolean
TransientDataStore.forcePut(Hash key, DatabaseEntry data)
Unconditionally store, bypass all newer/older checks.
static MessageWrapper.OneTimeSession
MessageWrapper.generateSession(RouterContext ctx, Hash localDest, long expiration, boolean forceElG)
Create a single key and tag, for receiving a single encrypted message, and register it with the client's session key manager, to expire in the time specified.
DatabaseEntry
DataStore.get(Hash key)
Retrieve the database entry for the given key.
DatabaseEntry
DataStore.get(Hash key, boolean persist)
Retrieve the database entry for the given key with optional persistence control.
DatabaseEntry
PersistentDataStore.get(Hash key)
The entry stored for the key, or null if not found.
DatabaseEntry
PersistentDataStore.get(Hash key, boolean persist)
Prepare for having only a partial set in memory and the rest on disk.
DatabaseEntry
TransientDataStore.get(Hash key)
The entry for the key, or null if not found.
DatabaseEntry
TransientDataStore.get(Hash key, boolean persist)
For PersistentDataStore only - don't use here.
Destination
NegativeLookupCache.getBadDest(Hash h)
Cached bad destination for the given hash.
private Hash
FloodfillStoreJob.getClientHash(DatabaseEntry data, Hash key)
The client hash from the data, or the key if not available.
private List<Hash>
StoreJob.getClosestFloodfillRouters(Hash key, int numClosest, Set<Hash> alreadyChecked)
Find the closest floodfill routers to a given key.
private List<Hash>
SearchJob.getClosestRouters(Hash key, int numClosest, Set<Hash> alreadyChecked)
Hash structures for routers we want to check next.
Hash
BlindCache.getHash(Hash h)
The hash to lookup for a dest hash.
private String
FloodfillDatabaseLookupMessageHandler.getIPFromHash(Hash h)
Extract IP:port from RouterInfo for a peer hash.
private LeaseSet
KademliaNetworkDatabaseFacade.getLocalLeaseSet(Hash key)
Read a current LeaseSet from this facade's store only.
int
KademliaNetworkDatabaseFacade.getPeerTimeout(Hash peer)
How long to wait for one peer's reply, scaled from its profile.
MessageWrapper.WrappedMessage
StoreState.getPendingMessage(Hash peer)
Returns the pending message for the specified peer.
protected int
SearchJob.getPerPeerTimeoutMs(Hash peer)
Per-peer timeout adjusted for floodfill and remaining time.
static File
PersistentDataStore.getRouterInfoFile(RouterContext ctx, Hash hash)
The persistent RI file for a hash.
private String
PersistentDataStore.getRouterInfoName(Hash hash)
Builds the router info file name for a hash.
private NetworkDatabaseFacade
FloodfillNetworkDatabaseSegmentor.getSubNetDB(Hash id)
Retrieves the FloodfillNetworkDatabaseFacade object for the specified ID.
private void
KademliaNetworkDatabaseFacade.handleBanlistAndRemove(RouterInfo ri, Hash key, Job onFailedLookupJob)
Banlist a router for one hour as an unreachable low-bandwidth peer older than KademliaNetworkDatabaseFacade.MIN_VERSION, then drop it from the data store, the routing buckets and the unverified queue.
private void
KademliaNetworkDatabaseFacade.handleCustomCapabilityBan(RouterInfo ri, Hash key, Job onFailedLookupJob)
Handle banning a router that matches custom capability ban patterns, for four hours.
private void
KademliaNetworkDatabaseFacade.handleHostileBlocklist(RouterInfo _ri, Hash key, Job onFailedLookupJob)
Drop the RouterInfo of a router tagged hostile on the Banlist, without extending or adding a ban.
private void
KademliaNetworkDatabaseFacade.handleIntroducerBan(RouterInfo ri, Hash key, Job onFailedLookupJob)
Handle banning a router that advertises more introducers on one address than the SSU2 spec allows.
private void
KademliaNetworkDatabaseFacade.handleInvalidRouterInfoBan(RouterInfo ri, Hash key, String reason, Job onFailedLookupJob)
Handle banning a RouterInfo that breaks one of the RouterInfo validation rules - fabricated version, impossible publication date, or contradictory reachability flags.
private void
KademliaNetworkDatabaseFacade.handleNonPublishedLeaseSet(Hash hash)
A local client whose LS is not published to the network (i2cp.dontPublishLeaseSet, e.g.
private void
KademliaNetworkDatabaseFacade.handlePermanentBlocklist(RouterInfo _ri, Hash key, Job onFailedLookupJob)
Drop the RouterInfo of a router already on the permanent blocklist; no new ban entry is written, the existing one stands.
(package private) boolean
KademliaNetworkDatabaseFacade.hasActiveRepublishJob(Hash hash)
Check if an active republish job exists for the given destination.
(package private) boolean
KademliaNetworkDatabaseFacade.hasDirectContact(Hash peer)
Have we ever heard from this peer directly, as opposed to merely being told about it? An established session or a profile with a received message or successful send counts.
(package private) void
ContactDrivenRefreshJob.heardFrom(Hash peer)
Called when we hear from or about a peer.
(package private) int
KademliaNetworkDatabaseFacade.incrementActiveFloodfillQuery(Hash floodfill)
Increment the active outbound query count for a floodfill peer.
(package private) boolean
KademliaNetworkDatabaseFacade.ipDiversityAllows(Hash key, RouterInfo routerInfo)
Would adding this peer to its bucket exceed the per-bucket or global IP-group caps? Peers with no literal-IP address are unconstrained.
boolean
NegativeLookupCache.isCached(Hash h)
Check if the hash is in the negative cache.
(package private) boolean
KademliaNetworkDatabaseFacade.isFloodfillOverloaded(Hash floodfill)
Check if a floodfill peer already has too many active outbound queries from this router.
private boolean
KademliaNetworkDatabaseFacade.isHostileBlocklisted(Hash key)
Whether the router is on the hostile blocklist.
boolean
DataStore.isKnown(Hash key)
Check if the given key exists in the data store.
boolean
TransientDataStore.isKnown(Hash key)
Whether the data store contains the key.
private boolean
KademliaNetworkDatabaseFacade.isLocalDestination(Hash key)
Whether the key is one of our own destinations.
(package private) boolean
KademliaNetworkDatabaseFacade.isNegativeCached(Hash key)
Is the key in the negative lookup cache?
boolean
KademliaNetworkDatabaseFacade.isNegativeCachedForever(Hash key)
Is it permanently negative cached?
private boolean
KademliaNetworkDatabaseFacade.isPermanentlyBlocklisted(Hash key)
Whether the router is on the permanent blocklist.
(package private) boolean
KademliaNetworkDatabaseFacade.isRecentlyQueried(Hash peer)
Check if a floodfill peer was queried recently (within cooldown period).
private boolean
NegativeLookupCache.isTripped(Hash h)
Whether the cache is full enough to stop storing.
(package private) boolean
FloodfillNetworkDatabaseFacade.isVerifyInProgress(Hash h)
Checks if verification is in progress for the specified hash.
(package private) static long
StaleContactTrimmer.lastSeen(RouterContext context, Hash peer)
The newest contact evidence for a peer, 0 when there is none.
private Set<Hash>
SearchState.locked_getClosest(Set<Hash> peers, int max, Hash target)
Picks the peers closest to the target.
private static String
KademliaNetworkDatabaseFacade.logName(NamingService ns, Hash key)
Best-effort display name for a tracked LeaseSet in logs: the registered hostname when available, otherwise a truncated base32.
protected void
FloodfillNetworkDatabaseFacade.lookupBeforeDropping(Hash peer, RouterInfo info)
Search for a newer router info, drop it from the db if the search fails, unless just started up or have bigger problems.
protected void
KademliaNetworkDatabaseFacade.lookupBeforeDropping(Hash peer, RouterInfo info)
Don't use directly - see F.N.D.F.
void
KademliaNetworkDatabaseFacade.lookupDestination(Hash key, Job onFinishedJob, long timeoutMs, Hash fromLocalDest)
Lookup using the client's tunnels Succeeds even if LS validation and store fails due to unsupported sig type, expired, etc.
Destination
KademliaNetworkDatabaseFacade.lookupDestinationLocally(Hash key)
Destination stored locally, or null.
(package private) void
KademliaNetworkDatabaseFacade.lookupFailed(Hash key)
Increment in the negative lookup cache.
void
NegativeLookupCache.lookupFailed(Hash h)
Record a failed lookup for the given hash.
void
KademliaNetworkDatabaseFacade.lookupLeaseSet(Hash key, Job onFindJob, Job onFailedLookupJob, long timeoutMs)
Look up a LeaseSet, locally first.
void
KademliaNetworkDatabaseFacade.lookupLeaseSet(Hash key, Job onFindJob, Job onFailedLookupJob, long timeoutMs, Hash fromLocalDest)
Lookup using the client's tunnels Use KademliaNetworkDatabaseFacade.lookupDestination(Hash, Job, long, Hash) if you don't need the LS or don't need it validated.
LeaseSet
KademliaNetworkDatabaseFacade.lookupLeaseSetLocally(Hash key)
LeaseSet stored locally.
void
KademliaNetworkDatabaseFacade.lookupLeaseSetRemotely(Hash key, Hash fromLocalDest)
Unconditionally lookup using the client's tunnels, with no jobs.
void
KademliaNetworkDatabaseFacade.lookupLeaseSetRemotely(Hash key, Job onFindJob, Job onFailedLookupJob, long timeoutMs, Hash fromLocalDest)
Unconditionally lookup using the client's tunnels.
DatabaseEntry
KademliaNetworkDatabaseFacade.lookupLocally(Hash key)
Validated entry stored locally.
DatabaseEntry
KademliaNetworkDatabaseFacade.lookupLocallyWithoutValidation(Hash key)
Not for use without validation.
private static RouterInfo
IterativeSearchJob.lookupRIUnvalidated(RouterContext ctx, Hash peer)
Look up a peer's RouterInfo in the router's main NetDb, skipping the full validation performed by NetworkDatabaseFacade.lookupRouterInfoLocally(Hash).
(package private) RouterInfo
KademliaNetworkDatabaseFacade.lookupRIUnvalidated(Hash key)
Look up a peer's RouterInfo without running the full KademliaNetworkDatabaseFacade.validate(RouterInfo) ban cascade.
void
KademliaNetworkDatabaseFacade.lookupRouterInfo(Hash key, Job onFindJob, Job onFailedLookupJob, long timeoutMs)
Look up a RouterInfo, resolving over the network when not cached locally.
RouterInfo
KademliaNetworkDatabaseFacade.lookupRouterInfoLocally(Hash key)
This will return immediately with the result or null.
void
KademliaNetworkDatabaseFacade.lookupRouterInfoRemote(Hash key, Job onFindJob, Job onFailedLookupJob, long timeoutMs)
Look up a RouterInfo by hash, performing a network search if not locally cached.
(package private) void
KademliaNetworkDatabaseFacade.lookupTimeout(Hash key)
Pure-timeout search failure (no peer replied).
void
NegativeLookupCache.lookupTimeout(Hash h)
Record a pure-timeout search failure (no peer ever replied).
(package private) void
KademliaNetworkDatabaseFacade.markQueried(Hash peer)
Mark a floodfill peer as recently queried.
private void
NegativeLookupCache.maybeTrip(Hash h, long now, boolean wasTripped)
On the transition into the cached state, set a per-entry TTL with backoff from how many times this key has tripped before.
(package private) void
IterativeSearchJob.newPeerToTry(Hash peer)
A new (floodfill) peer was discovered that may have the answer.
boolean
KademliaNetworkDatabaseFacade.peekNegativeCached(Hash key)
Negative-cache check without recording an abort stat.
private void
RefreshRoutersJob.performRouterRefresh(Hash routerHash, RouterInfo ri)
Performs the router refresh operation by calling the facade search with proper timeout.
private Lease
StoreJob.pickReplyTunnel(LeaseSet ls, int attempts, Hash to)
Pick a reply tunnel from a LeaseSet for the store response.
private DatabaseLookupMessage
FloodfillDatabaseLookupMessageHandler.preProcessDatabaseLookup(DatabaseLookupMessage dlm, Hash fromHash)
Handle special cases: - Fix loopback DLM bug (pre-0.9.67) where from was set to self - Reject direct floodfill-to-floodfill lookups of type EXPL or ANY.
private boolean
KademliaNetworkDatabaseFacade.proactivelyRefreshIfExpiring(Hash key, long now, NamingService ns)
Refresh a tracked LeaseSet early when it is about to expire.
(package private) void
FloodfillNetworkDatabaseFacade.probeStalePeer(Hash peer, RouterInfo ri)
Fire a DirectLookupJob for a stale peer, deduplicated via _activeFloodQueries.
private void
KademliaNetworkDatabaseFacade.processStoreFailure(Hash h, DatabaseEntry entry)
If the validate fails, call this to determine if it was because of unsupported crypto.
boolean
DataStore.put(Hash key, DatabaseEntry data)
Store a database entry with the given key.
boolean
DataStore.put(Hash key, DatabaseEntry data, boolean persist)
Store a database entry with the given key and persistence control.
boolean
PersistentDataStore.put(Hash key, DatabaseEntry data)
Store the entry and persist it to disk.
boolean
PersistentDataStore.put(Hash key, DatabaseEntry data, boolean persist)
Store the entry and optionally persist it to disk.
boolean
TransientDataStore.put(Hash key, DatabaseEntry data)
Store an entry, replacing any previous one for the key.
boolean
TransientDataStore.put(Hash key, DatabaseEntry data, boolean persist)
For PersistentDataStore only - don't use here.
void
PersistentDataStore.Writer.queue(Hash key, DatabaseEntry data)
Add entry to the disk write queue.
private void
KademliaNetworkDatabaseFacade.queueUnverified(Hash key)
Queue a peer for later bucket promotion once it proves itself, sweeping expired entries when the queue is full.
(package private) static boolean
RepublishLeaseSetJob.recordPublishAttempt(ConcurrentHashMap<Hash,Long> times, Hash dest, Long previous, long now)
Record that we tried to publish for this destination, and report whether the event is worth logging.
private void
KademliaNetworkDatabaseFacade.refreshLocalLeaseSetIfExpiring(Hash key, long now)
Nudge the inbound pool to re-publish our own LeaseSet when a client is actively using it and the earliest lease is inside the proactive window.
private void
NegativeLookupCache.refreshStreak(Hash h, long now)
Discard a below-threshold fail streak that has outlived cleanTime so "N fails within the window" still holds without a global wipe.
void
FloodfillNetworkDatabaseFacade.registerSearchTimeout(Hash peer, IterativeSearchJob search, long timeoutMs)
Register a search timeout to be processed in batches.
DatabaseEntry
DataStore.remove(Hash key)
Remove the entry for the given key.
DatabaseEntry
DataStore.remove(Hash key, boolean persist)
Remove the entry for the given key with optional persistence control.
DatabaseEntry
PersistentDataStore.remove(Hash key)
Remove from memory and queue the file for disk deletion.
DatabaseEntry
PersistentDataStore.remove(Hash key, boolean persist)
Remove from memory and optionally queue disk deletion.
void
PersistentDataStore.Writer.remove(Hash key)
Mark a key for removal from disk on next cycle.
DatabaseEntry
TransientDataStore.remove(Hash key)
Remove and return the entry for the key.
DatabaseEntry
TransientDataStore.remove(Hash key, boolean persist)
For PersistentDataStore only - don't use here.
private void
PersistentDataStore.removeFile(Hash key, File dir)
Delete the RouterInfo file for a hash, if it is present.
private void
KademliaNetworkDatabaseFacade.removeFromNetDb(Hash key)
Remove a router from the NetDb without banning it.
void
KademliaNetworkDatabaseFacade.removeLeaseSetFromTracking(Hash key)
Remove a LeaseSet from refresh tracking.
void
SearchState.removePending(Hash peer)
We didn't actually want to add this peer as part of the pending list...
(package private) void
KademliaNetworkDatabaseFacade.removePublishingJob(Hash hash, RepublishLeaseSetJob job)
Remove a specific job from the tracking set.
void
KademliaNetworkDatabaseFacade.removeRouterInfo(Hash key)
Remove a RouterInfo from the local netdb.
(package private) void
ExploreJob.replyFound(DatabaseSearchReplyMessage message, Hash peer)
Process a reply listing routers that hold the key.
(package private) void
SearchJob.replyFound(DatabaseSearchReplyMessage message, Hash peer)
Found a reply.
long
SearchState.replyFound(Hash peer)
How long it took to get the reply, or -1 if we don't know.
void
SearchState.replyTimeout(Hash peer)
Move the peer from pending to failed on timeout.
void
StoreState.replyTimeout(Hash peer)
Remove the peer from pending on timeout.
private void
IntroducerLookupJob.requestLookup(RouterContext ctx, Hash h, long now, int timeoutMs)
Record the attempt and issue one non-blocking remote RI lookup with the given deadline (never past this cycle's query budget, never above the standard adaptive RouterInfo lookup cap).
private void
KademliaNetworkDatabaseFacade.scheduleRepublish(Hash hash)
Queues the LeaseSet for future republishing.
private int
RefreshRoutersJob.scorePeer(Hash peer)
Score a peer for refresh priority.
(package private) SearchJob
FloodfillNetworkDatabaseFacade.search(Hash key, Job onFindJob, Job onFailedLookupJob, long timeoutMs, boolean isLease)
Lookup using exploratory tunnels.
(package private) SearchJob
FloodfillNetworkDatabaseFacade.search(Hash key, Job onFindJob, Job onFailedLookupJob, long timeoutMs, boolean isLease, Hash fromLocalDest)
Lookup using the client's tunnels.
(package private) abstract SearchJob
KademliaNetworkDatabaseFacade.search(Hash key, Job onFindJob, Job onFailedLookupJob, long timeoutMs, boolean isLease)
Begin a kademlia-style iterative search for the key, which can take up to timeoutMs and will fire the appropriate jobs on success or timeout (or if the search completes without any match).
(package private) abstract SearchJob
KademliaNetworkDatabaseFacade.search(Hash key, Job onFindJob, Job onFailedLookupJob, long timeoutMs, boolean isLease, Hash fromLocalDest)
Search using the client's tunnels; see KademliaNetworkDatabaseFacade.search(Hash, Job, Job, long, boolean).
(package private) void
KademliaNetworkDatabaseFacade.searchComplete(Hash key)
The search for the given key is no longer active.
(package private) List<Hash>
FloodfillPeerSelector.selectFloodfillParticipants(Hash key, int howMany, Set<Hash> toIgnore, KBucketSet<Hash> kbuckets)
See above for description List will not include our own hash Returns new list, may be modified.
(package private) List<Hash>
FloodfillPeerSelector.selectFloodfillParticipants(Hash key, int maxNumRouters, KBucketSet<Hash> kbuckets)
Sort the floodfills.
private List<Hash>
FloodfillPeerSelector.selectFloodfillParticipantsIncludingUs(Hash key, int howMany, Set<Hash> toIgnore, KBucketSet<Hash> kbuckets)
See above for description List MAY CONTAIN our own hash unless included in toIgnore Returns new list, may be modified.
(package private) List<Hash>
FloodfillPeerSelector.selectNearest(Hash key, int maxNumRouters, Set<Hash> peersToIgnore, KBucketSet<Hash> kbuckets)
Floodfill peers only.
(package private) abstract List<Hash>
PeerSelector.selectNearest(Hash key, int maxNumRouters, Set<Hash> peersToIgnore, KBucketSet<Hash> kbuckets)
Peers nearest to the key in routing space.
(package private) List<Hash>
FloodfillPeerSelector.selectNearestExplicit(Hash key, int maxNumRouters, Set<Hash> peersToIgnore, KBucketSet<Hash> kbuckets)
Pick out peers with the floodfill capacity set, returning them first, but then after they're complete, sort via kademlia.
(package private) abstract List<Hash>
PeerSelector.selectNearestExplicit(Hash key, int maxNumRouters, Set<Hash> peersToIgnore, KBucketSet<Hash> kbuckets)
Peers nearest to the key, floodfills first, then sorted by Kademlia distance.
private void
HandleFloodfillDatabaseStoreMessageJob.sendAck(Hash storedKey)
Sends the store reply to the sender.
protected void
HandleFloodfillDatabaseLookupMessageJob.sendClosest(Hash key, Set<Hash> routerInfoSet, Hash toPeer, TunnelId replyTunnel)
We extend this here to send our routerInfo back as well, if we are not floodfill.
private void
IterativeSearchJob.sendQuery(Hash peer, int previouslyTried)
Send a DLM to the peer.
(package private) void
FloodfillNetworkDatabaseFacade.sendStore(Hash key, DatabaseEntry ds, Job onSuccess, Job onFailure, long sendTimeout, Set<Hash> toIgnore)
Send out a store.
(package private) abstract void
KademliaNetworkDatabaseFacade.sendStore(Hash key, DatabaseEntry ds, Job onSuccess, Job onFailure, long sendTimeout, Set<Hash> toIgnore)
See implementation in FNDF.
private boolean
KademliaNetworkDatabaseFacade.sharesIPGroup(Set<Long> groups, Hash peer)
Does this bucket entry share an IP group with any of the given groups?
(package private) boolean
LookupBanHammer.shouldBan(Hash key, TunnelId id)
Record a lookup and check if the requester should be banned.
private boolean
KademliaNetworkDatabaseFacade.shouldBanlistBasedOnCountry(RouterInfo _ri, Hash key)
Should we banlist this router based on country restrictions? Checks if: - we are in strict country mode and router is in same country - blockMyCountry is enabled - router is in our country (strict country mode).
(package private) boolean
FloodfillNetworkDatabaseFacade.shouldBanLookup(Hash from, TunnelId id)
Check if lookup from a peer should be banned.
private boolean
FloodfillNetworkDatabaseFacade.shouldFloodTo(Hash key, int type, SigType lsSigType, Hash peer, RouterInfo target)
Determines if we should flood the database store to a peer.
private boolean
RefreshRoutersJob.shouldRefreshRouter(RouterInfo ri, Hash _routerHash)
Determines whether to refresh the given router info.
private boolean
FloodfillStoreJob.shouldSkipVerify(Hash key, String keyB64, boolean shouldLog)
Check if verify should be skipped due to existing verify or shutdown.
(package private) boolean
FloodThrottler.shouldThrottle(Hash h)
Increments the counter and checks if the hash should be throttled.
(package private) boolean
LookupThrottler.shouldThrottle(Hash key, TunnelId id)
Increment and check throttling for the given peer and tunnel.
(package private) boolean
FloodfillNetworkDatabaseFacade.shouldThrottleFlood(Hash key)
Increments and tests.
(package private) boolean
FloodfillNetworkDatabaseFacade.shouldThrottleLookup(Hash from, TunnelId id)
Increments and tests.
(package private) void
KademliaNetworkDatabaseFacade.stopPublishing(Hash target)
Stops publishing the given LeaseSet.
LeaseSet
KademliaNetworkDatabaseFacade.store(Hash key, LeaseSet leaseSet)
Store the LeaseSet without persisting it to disk.
LeaseSet
KademliaNetworkDatabaseFacade.store(Hash key, LeaseSet leaseSet, boolean force)
Store the leaseSet.
RouterInfo
KademliaNetworkDatabaseFacade.store(Hash key, RouterInfo routerInfo)
Store the routerInfo.
(package private) RouterInfo
KademliaNetworkDatabaseFacade.store(Hash key, RouterInfo routerInfo, boolean persist)
Store the routerInfo.
(package private) long
IterativeSearchJob.timeSent(Hash peer)
When did we send the query to the peer?
boolean
StaleContactTrimmer.trim(KBucket<Hash> kbucket, Hash toAdd)

String
KademliaNetworkDatabaseFacade.validate(Hash key, LeaseSet leaseSet)
Validates whether the given LeaseSet is acceptable as valid and current based on current known parameters.
private String
KademliaNetworkDatabaseFacade.validate(Hash key, RouterInfo routerInfo)
Determine whether this routerInfo will be accepted as valid and current given what we know now.
private String
KademliaNetworkDatabaseFacade.validateKeyMatch(Hash key, LeaseSet leaseSet)
Check that the key matches the LeaseSet hash.
private String
KademliaNetworkDatabaseFacade.validateSignature(Hash key, LeaseSet leaseSet, String leaseBase32)
Verify the LeaseSet's cryptographic signature validity.
(package private) void
FloodfillNetworkDatabaseFacade.verifyFinished(Hash h)
Marks verification as finished for the specified hash.
(package private) void
FloodfillNetworkDatabaseFacade.verifyStarted(Hash h)
Marks verification as started for the specified hash.
(package private) boolean
SearchJob.wasAttempted(Hash peer)
Whether the peer was already queried.
boolean
SearchState.wasAttempted(Hash peer)
Whether the peer was attempted.
boolean
IterativeSearchJob.wasQueried(Hash peer)
Did we send a request to this peer?
static boolean
IterativeSearchJob.wasRecentlyQueried(Hash peer)
Was this peer recently queried (within grace period)? Used to avoid false positive bans for late but legitimate replies.
(package private) static MessageWrapper.WrappedMessage
MessageWrapper.wrap(RouterContext ctx, I2NPMessage m, Hash from, RouterInfo to)
Garlic wrap a message from a client or this router, destined for a router, to hide the contents from the OBEP.
private void
PersistentDataStore.write(Hash key, DatabaseEntry data)
Persist a single RouterInfo to disk, applying spoof/ban checks.
private boolean
PersistentDataStore.writeRiFile(Hash key, DatabaseEntry data, File dbFile)
Write a single RouterInfo to disk.
Method parameters in net.i2p.router.networkdb.kademlia with type arguments of type Hash
Modifier and Type
Method
Description
(package private) static void
IterativeSearchJob.addClosest(Collection<Hash> candidates, Collection<Hash> allRouters, Hash rkey, Hash us, Hash key, int cap)
Add the closest cap peers of allRouters, by XOR distance from rkey, excluding us and key.
void
SearchState.addPending(Collection<Hash> pending)
Add the peers to the pending and attempted sets.
private List<Hash>
FloodfillPeerSelector.buildFloodfillCandidates(Set<Hash> toIgnore)
Build the floodfill candidate list with only the cheap per-peer checks: the exclusion set, the two banlist tiers, and the unreachable capability flag.
private static void
RepublishLeaseSetJob.cleanupMap(ConcurrentHashMap<Hash,Long> map, long now)
Cleanup map: drop the entries whose timestamp is older than the cleanup threshold.
Set<Hash>
KademliaNetworkDatabaseFacade.findNearestRouters(Hash key, int maxNumRouters, Set<Hash> peersToIgnore)
The routers closest to that key in response to a remote lookup.
private List<Hash>
StoreJob.getClosestFloodfillRouters(Hash key, int numClosest, Set<Hash> alreadyChecked)
Find the closest floodfill routers to a given key.
private List<Hash>
SearchJob.getClosestRouters(Hash key, int numClosest, Set<Hash> alreadyChecked)
Hash structures for routers we want to check next.
private Set<Hash>
SearchState.locked_getClosest(Set<Hash> peers, int max, Hash target)
Picks the peers closest to the target.
private void
FloodfillPeerSelector.logSelectionResults(List<Hash> good, List<Hash> ok, List<Hash> bad)
Log the classification results at debug level.
void
KademliaNetworkDatabaseFacade.queueForExploration(Collection<Hash> keys)
Queue keys for exploration.
(package private) static boolean
RepublishLeaseSetJob.recordPublishAttempt(ConcurrentHashMap<Hash,Long> times, Hash dest, Long previous, long now)
Record that we tried to publish for this destination, and report whether the event is worth logging.
void
KademliaNetworkDatabaseFacade.removeFromExploreKeys(Collection<Hash> toRemove)
Remove keys from the exploration set.
private Set<Hash>
FloodfillNetworkDatabaseFacade.selectFloodfillParticipants(Set<Hash> toIgnore, int concurrent)
Selects a set of floodfill participant peers to which data should be sent: random selection among the filtered floodfill participants, preferring peers not queried in the last 60s to spread load, with a fallback top-up so store operations never starve.
(package private) List<Hash>
FloodfillPeerSelector.selectFloodfillParticipants(Set<Hash> toIgnore, KBucketSet<Hash> _kbuckets)
List MAY INCLUDE our own hash.
(package private) List<Hash>
FloodfillPeerSelector.selectFloodfillParticipants(Set<Hash> toIgnore, KBucketSet<Hash> _kbuckets)
List MAY INCLUDE our own hash.
(package private) List<Hash>
FloodfillPeerSelector.selectFloodfillParticipants(Hash key, int howMany, Set<Hash> toIgnore, KBucketSet<Hash> kbuckets)
See above for description List will not include our own hash Returns new list, may be modified.
(package private) List<Hash>
FloodfillPeerSelector.selectFloodfillParticipants(Hash key, int howMany, Set<Hash> toIgnore, KBucketSet<Hash> kbuckets)
See above for description List will not include our own hash Returns new list, may be modified.
(package private) List<Hash>
FloodfillPeerSelector.selectFloodfillParticipants(Hash key, int maxNumRouters, KBucketSet<Hash> kbuckets)
Sort the floodfills.
(package private) List<Hash>
FloodfillPeerSelector.selectFloodfillParticipants(KBucketSet<Hash> kbuckets)
List will not include our own hash.
private List<Hash>
FloodfillPeerSelector.selectFloodfillParticipantsIncludingUs(Hash key, int howMany, Set<Hash> toIgnore, KBucketSet<Hash> kbuckets)
See above for description List MAY CONTAIN our own hash unless included in toIgnore Returns new list, may be modified.
private List<Hash>
FloodfillPeerSelector.selectFloodfillParticipantsIncludingUs(Hash key, int howMany, Set<Hash> toIgnore, KBucketSet<Hash> kbuckets)
See above for description List MAY CONTAIN our own hash unless included in toIgnore Returns new list, may be modified.
(package private) List<Hash>
FloodfillPeerSelector.selectNearest(Hash key, int maxNumRouters, Set<Hash> peersToIgnore, KBucketSet<Hash> kbuckets)
Floodfill peers only.
(package private) List<Hash>
FloodfillPeerSelector.selectNearest(Hash key, int maxNumRouters, Set<Hash> peersToIgnore, KBucketSet<Hash> kbuckets)
Floodfill peers only.
(package private) abstract List<Hash>
PeerSelector.selectNearest(Hash key, int maxNumRouters, Set<Hash> peersToIgnore, KBucketSet<Hash> kbuckets)
Peers nearest to the key in routing space.
(package private) abstract List<Hash>
PeerSelector.selectNearest(Hash key, int maxNumRouters, Set<Hash> peersToIgnore, KBucketSet<Hash> kbuckets)
Peers nearest to the key in routing space.
(package private) List<Hash>
FloodfillPeerSelector.selectNearestExplicit(Hash key, int maxNumRouters, Set<Hash> peersToIgnore, KBucketSet<Hash> kbuckets)
Pick out peers with the floodfill capacity set, returning them first, but then after they're complete, sort via kademlia.
(package private) List<Hash>
FloodfillPeerSelector.selectNearestExplicit(Hash key, int maxNumRouters, Set<Hash> peersToIgnore, KBucketSet<Hash> kbuckets)
Pick out peers with the floodfill capacity set, returning them first, but then after they're complete, sort via kademlia.
(package private) abstract List<Hash>
PeerSelector.selectNearestExplicit(Hash key, int maxNumRouters, Set<Hash> peersToIgnore, KBucketSet<Hash> kbuckets)
Peers nearest to the key, floodfills first, then sorted by Kademlia distance.
(package private) abstract List<Hash>
PeerSelector.selectNearestExplicit(Hash key, int maxNumRouters, Set<Hash> peersToIgnore, KBucketSet<Hash> kbuckets)
Peers nearest to the key, floodfills first, then sorted by Kademlia distance.
(package private) static Set<Hash>
FloodfillNetworkDatabaseFacade.selectStoreParticipants(List<Hash> shuffled, int concurrent, Set<Hash> recentlyQueried)
Select up to concurrent store participants, preferring peers not queried in the last 60s to spread load, with a fallback top-up so store operations never starve.
(package private) static Set<Hash>
FloodfillNetworkDatabaseFacade.selectStoreParticipants(List<Hash> shuffled, int concurrent, Set<Hash> recentlyQueried)
Select up to concurrent store participants, preferring peers not queried in the last 60s to spread load, with a fallback top-up so store operations never starve.
protected void
HandleFloodfillDatabaseLookupMessageJob.sendClosest(Hash key, Set<Hash> routerInfoSet, Hash toPeer, TunnelId replyTunnel)
We extend this here to send our routerInfo back as well, if we are not floodfill.
(package private) void
FloodfillNetworkDatabaseFacade.sendStore(Hash key, DatabaseEntry ds, Job onSuccess, Job onFailure, long sendTimeout, Set<Hash> toIgnore)
Send out a store.
(package private) abstract void
KademliaNetworkDatabaseFacade.sendStore(Hash key, DatabaseEntry ds, Job onSuccess, Job onFailure, long sendTimeout, Set<Hash> toIgnore)
See implementation in FNDF.
boolean
StaleContactTrimmer.trim(KBucket<Hash> kbucket, Hash toAdd)

private void
PersistentDataStore.Writer.writeBatch(List<Map.Entry<Hash, DatabaseEntry>> entries)
Write a batch of RouterInfo entries to disk under the _dbDir lock.
Constructors in net.i2p.router.networkdb.kademlia with parameters of type Hash
Modifier
Constructor
Description
DirectLookupJob(RouterContext ctx, FloodfillNetworkDatabaseFacade facade, Hash peer, RouterInfo oldRI, Job onFind, Job onFail)
Request is sent to; if null the job fails without sending anything.
Disconnector(Hash h, String reason)
Job disconnecting a peer after a delay.
Disconnector(Hash h)
Force a disconnect for the peer on refresh timeout.
DropLookupFailedJob(RouterContext ctx, Hash peer, RouterInfo _info)
Job to drop the peer after a lookup timeout.
DropLookupFoundJob(RouterContext ctx, Hash peer, RouterInfo info)
Job to verify a failing peer after a successful lookup.
ExploreJob(RouterContext context, KademliaNetworkDatabaseFacade facade, Hash key, boolean isRealExplore, long msgIDBloomXor)
New exploratory search with the given parameters and calculated concurrency level.
FloodFailedJob(RouterContext ctx, Hash peer)
Record a failed store for the given peer.
FloodfillNetworkDatabaseFacade(RouterContext context, Hash dbid)
Sub DBs.
FloodfillSelectionCollector(Hash key, Set<Hash> toIgnore, int wanted)
Warning - may return our router hash - add to toIgnore if necessary.
FloodfillStoreJob(RouterContext context, FloodfillNetworkDatabaseFacade facade, Hash key, DatabaseEntry data, Job onSuccess, Job onFailure, long timeoutMs)
Create a new FloodfillStoreJob to send data to floodfills.
FloodfillStoreJob(RouterContext context, FloodfillNetworkDatabaseFacade facade, Hash key, DatabaseEntry data, Job onSuccess, Job onFailure, long timeoutMs, Set<Hash> toSkip)
Create a new FloodfillStoreJob to send data to floodfills.
FloodfillVerifyStoreJob(RouterContext ctx, Hash key, Hash client, long published, int type, Hash sentTo, Set<Hash> toSkip, FloodfillNetworkDatabaseFacade facade)
Delay, then confirm the store peer still holds the entry; after a longer delay, confirm a different floodfill got the flood.
protected
FloodOnlySearchJob(RouterContext ctx, FloodfillNetworkDatabaseFacade facade, Hash key, Job onFind, Job onFailed, int timeoutMs)
For DirectLookupJob extension, RI only, different match job.
FloodOnlySearchJob(RouterContext ctx, FloodfillNetworkDatabaseFacade facade, Hash key, Job onFind, Job onFailed, int timeoutMs, boolean isLease)
Flood-only search for the given key against the floodfill network database.
FloodSearchJob(RouterContext ctx, FloodfillNetworkDatabaseFacade facade, Hash key, Job onFind, Job onFailed, int timeoutMs, boolean isLease)
Prepares a flood search for one key: records the target, the callbacks and the lease-set flag, then derives the deadline from the requested timeout, applied in full.
FloodSuccessJob(RouterContext ctx, Hash peer)
Record a successful store for the given peer.
HandleFloodfillDatabaseLookupMessageJob(RouterContext ctx, DatabaseLookupMessage receivedMessage, RouterIdentity from, Hash fromHash, long msgIDBloomXor)
Creates a new job to handle a floodfill database lookup message.
HandleFloodfillDatabaseStoreMessageJob(RouterContext ctx, DatabaseStoreMessage receivedMessage, RouterIdentity from, Hash fromHash, FloodfillNetworkDatabaseFacade facade, long msgIDBloomXor)
Handle an incoming floodfill DatabaseStoreMessage.
IterativeFollowupJob(RouterContext ctx, Hash key, Hash to, IterativeSearchJob search)
Queries one peer for a single key on behalf of an iterative search.
IterativeSearchJob(RouterContext ctx, FloodfillNetworkDatabaseFacade facade, Hash key, Job onFind, Job onFailed, int timeoutMs, boolean isLease)
Lookup using exploratory tunnels.
IterativeSearchJob(RouterContext ctx, FloodfillNetworkDatabaseFacade facade, Hash key, Job onFind, Job onFailed, int timeoutMs, boolean isLease, Hash fromLocalDest)
Lookup using the client's tunnels.
IterativeTimeoutJob(RouterContext ctx, Hash peer, IterativeSearchJob job)
Create a timeout job for an iterative search.
KademliaNetworkDatabaseFacade(RouterContext context, Hash dbid)
Initializes the Kademlia-based network database facade.
LeaseComparator(Hash target)
Create a comparator for a target hash.
LocalHash(Hash h)
Builds a local hash from the data of an existing hash.
ReadRouterJob(File routerFile, Hash key)
Creates a job to read a RouterInfo from disk.
(package private)
ReplyTunnel(Hash h, TunnelId id)
Identifies one reply tunnel.
RepublishLeaseSetJob(RouterContext ctx, KademliaNetworkDatabaseFacade facade, Hash destHash)
Creates a new job to republish a LeaseSet for the given destination.
SearchJob(RouterContext context, KademliaNetworkDatabaseFacade facade, Hash key, Job onSuccess, Job onFailure, long timeoutMs, boolean keepStats, boolean isLease, long msgIDBloomXor)
Create a new search for the routingKey specified.
SearchReplyJob(RouterContext enclosingContext, SearchJob job, DatabaseSearchReplyMessage message, Hash peer, long duration)
Opens a log and clamps a non-positive duration to zero.
SearchState(RouterContext context, Hash key)
Opens the search's log, records the start time and initializes the peer-tracking sets.
SingleSearchJob(RouterContext ctx, Hash key, Hash to)
Send one DatabaseLookupMessage straight to a chosen peer over exploratory tunnels, instead of flooding the networkDb with it.
StoreJob(RouterContext context, KademliaNetworkDatabaseFacade facade, Hash key, DatabaseEntry data, Job onSuccess, Job onFailure, long timeoutMs)
Send a data structure to the floodfills.
StoreJob(RouterContext context, KademliaNetworkDatabaseFacade facade, Hash key, DatabaseEntry data, Job onSuccess, Job onFailure, long timeoutMs, Set<Hash> toSkip)
Send a data structure to the floodfills, skipping certain peers.
StoreState(RouterContext ctx, Hash key, DatabaseEntry data)
Starts a store tracking no skipped peers.
StoreState(RouterContext ctx, Hash key, DatabaseEntry data, Set<Hash> toSkip)
New store state tracking pending, attempted, and successful peers.
(package private)
TimeoutEntry(Hash peer, IterativeSearchJob search)
Entry for a peer that failed to respond.
Constructor parameters in net.i2p.router.networkdb.kademlia with type arguments of type Hash
Modifier
Constructor
Description
FloodfillSelectionCollector(Hash key, Set<Hash> toIgnore, int wanted)
Warning - may return our router hash - add to toIgnore if necessary.
FloodfillStoreJob(RouterContext context, FloodfillNetworkDatabaseFacade facade, Hash key, DatabaseEntry data, Job onSuccess, Job onFailure, long timeoutMs, Set<Hash> toSkip)
Create a new FloodfillStoreJob to send data to floodfills.
FloodfillVerifyStoreJob(RouterContext ctx, Hash key, Hash client, long published, int type, Hash sentTo, Set<Hash> toSkip, FloodfillNetworkDatabaseFacade facade)
Delay, then confirm the store peer still holds the entry; after a longer delay, confirm a different floodfill got the flood.
StoreJob(RouterContext context, KademliaNetworkDatabaseFacade facade, Hash key, DatabaseEntry data, Job onSuccess, Job onFailure, long timeoutMs, Set<Hash> toSkip)
Send a data structure to the floodfills, skipping certain peers.
StoreState(RouterContext ctx, Hash key, DatabaseEntry data, Set<Hash> toSkip)
New store state tracking pending, attempted, and successful peers.
Uses of Hash in net.i2p.router.networkdb.reseed
Methods in net.i2p.router.networkdb.reseed with parameters of type Hash
Modifier and Type
Method
Description
private static String
ReseedBundler.getRouterInfoName(Hash hash)
Copied/modded from PersistentDataStore.
Uses of Hash in net.i2p.router.peermanager
Fields in net.i2p.router.peermanager declared as Hash
Modifier and Type
Field
Description
private final Hash
PeerProfile._peer
The peer this profile describes.
private final Hash
PeerTestJob.ReplySelector._peer
The peer being tested.
private Hash
ProfileOrganizer._us
Hash of this router.
private Hash
ProfilePersistenceHelper._us
Our router hash.
Fields in net.i2p.router.peermanager with type parameters of type Hash
Modifier and Type
Field
Description
private final ArrayDeque<Hash>
RouterInfoRefresher._addressRefreshQueue
Peers whose promotion was held for want of a usable address, awaiting a lookup.
private final List<Map<Hash, PeerProfile>>
ProfileOrganizer._allTiers
Every tier this object retains, in a fixed order, so a pass that must read the whole retained population walks one collection instead of repeating itself per map.
private final Map<Hash,String>
PeerManager._capabilitiesByPeer
Value strings are lower case.
private final ConcurrentHashMap<Hash,Long>
ProfileOrganizer._demotedPeers
Peers demoted via demoteIfUnreachable — excluded from promotion for TUNNEL_DEMOTION_COOLDOWN_MS.
private final ConcurrentHashMap<Hash,Integer>
ProfileOrganizer._demoteStrikes
Strike count per peer for demoteIfUnreachable — only demote after DEMOTE_STRIKE_THRESHOLD strikes within the decay window.
private final ConcurrentHashMap<Hash,Long>
ProfileOrganizer._demoteStrikeTimes
Last strike time per peer, so strikes expire after DEMOTE_STRIKE_DECAY_MS.
private final Map<Hash, PeerProfile>
ProfileOrganizer._fastPeers
Profiles of peers fast enough for tunnels.
private final Map<Hash, PeerProfile>
ProfileOrganizer._highCapacityPeers
Profiles of peers with high capacity.
private Set<Hash>
ProfilePersistenceHelper._missingRouterInfo
Peers whose profile was loaded while the netdb held no RouterInfo, collected during ProfilePersistenceHelper.readProfiles().
private final Set<Hash>
RouterInfoRefresher._missingRouterInfo
Peers whose stored profile was loaded while the netdb held no RouterInfo for them.
private final Map<Hash, PeerProfile>
ProfileOrganizer._notFailingPeers
Profiles of peers not currently failing.
private final List<Hash>
ProfileOrganizer._notFailingPeersList
Cached keys of the not-failing peers map.
private final Map<Character, Set<Hash>>
PeerManager._peersByCapability
Peer hashes, by capability flag.
private final List<Hash>
PeerTestJob._priorityPeers
Peers tested before the random ones.
private final Map<Hash, PeerProfile>
ProfileOrganizer._wellIntegratedPeers
Profiles of peers well integrated into the netdb.
Methods in net.i2p.router.peermanager that return Hash
Modifier and Type
Method
Description
private Hash
ProfilePersistenceHelper.getHash(String name)
Extracts the router hash from a profile file name.
Hash
PeerProfile.getPeer()
What peer is being profiled.
Hash
ProfileOrganizer.getUs()
Self-exclusion hash for this router instance.
Methods in net.i2p.router.peermanager that return types with arguments of type Hash
Modifier and Type
Method
Description
Set<Hash>
PeerManager.getPeersByCapability(char capability)
Every tracked peer advertising a capability.
Set<Hash>
PeerManagerFacadeImpl.getPeersByCapability(char capability)
Peers advertising the given capability.
private Set<Hash>
PeerManager.locked_getPeers(char c)
Locking no longer required.
Set<Hash>
ProfileOrganizer.selectAllPeers()
Gather the union of all peers from fast, high-capacity, and not-failing tiers.
Set<Hash>
ProfileOrganizer.selectFastPeers()
Return the current fast tier membership directly.
Set<Hash>
ProfileOrganizer.selectHighCapacityPeers()
Return the current high-capacity tier membership directly.
(package private) Set<Hash>
PeerManager.selectPeers()
All tracked peers from the organizer.
(package private) List<Hash>
PeerManager.selectPeers(PeerSelectionCriteria criteria)
Find some peers that meet the criteria and we have the netDb info for locally.
(package private) List<Hash>
PeerManager.selectTestPeersNonBlocking(int needed)
Non-blocking test peer selection.
Set<Hash>
ProfileOrganizer.selectWellIntegratedPeers()
Return the current well-integrated tier membership directly.
(package private) List<Hash>
RouterInfoRefresher.takeAddressRefreshBatch(long now)
Hand over the queued peers, oldest first, clearing the queue.
(package private) List<Hash>
ProfileOrganizer.takeMissingRouterInfoBatch(long now)
Hand over the next batch of peers whose RouterInfo should be requested.
(package private) List<Hash>
RouterInfoRefresher.takeMissingRouterInfoBatch(long now)
Hand over up to one batch of peers to look up, removing them from the set.
Methods in net.i2p.router.peermanager with parameters of type Hash
Modifier and Type
Method
Description
private DatabaseStoreMessage
PeerTestJob.buildMessage(RouterInfo peer, TunnelId replyTunnel, Hash replyGateway, long nonce, long expiration)
Build a message to test the peer with.
void
ProfileManagerImpl.dbLookupFailed(Hash peer)
Note that the peer was unable to reply to a db lookup - either with data or with a lookupReply redirecting the user elsewhere
void
ProfileManagerImpl.dbLookupReceived(Hash peer)
Note that the local router received a db lookup from the given peer
void
ProfileManagerImpl.dbLookupReply(Hash peer, int newPeers, int oldPeers, int invalid, int duplicate, long responseTimeMs)
The peer replied to a db lookup with a redirect to other routers.
void
ProfileManagerImpl.dbLookupSuccessful(Hash peer, long responseTimeMs)
Note that the peer was able to return the valid data for a db lookup
void
ProfileManagerImpl.dbStoreFailed(Hash peer)
Note that we were unable to confirm a successful send of db data to the peer, at least not within our timeout period
void
ProfileManagerImpl.dbStoreReceived(Hash peer, boolean wasNewKey)
Note that the local router received an unprompted db store from the given peer
void
ProfileManagerImpl.dbStoreSent(Hash peer, long responseTimeMs)
Note that we've confirmed a successful send of db data to the peer (though we haven't necessarily requested it again from them, so they /might/ be lying)
void
ProfileManagerImpl.dbStoreSuccessful(Hash peer)
Note that we've verified a successful send of db data to the floodfill peer by querying another floodfill.
void
ProfileOrganizer.demoteIfBanned(Hash peer)
Immediately demote a peer from fast/high-cap tiers.
void
ProfileOrganizer.demoteIfCongested(Hash peer)
Immediately demote a peer from fast/high-cap tiers.
void
ProfileOrganizer.demoteIfHighLatency(Hash peer)
Immediately demote a peer from fast/high-cap tiers.
(package private) void
ProfileOrganizer.demoteIfHighRTT(Hash peer, long responseTimeMs)
Demote a peer from fast/high-cap tiers when its direct-link latency is poor.
void
ProfileOrganizer.demoteIfLossy(Hash peer)
Instantly remove a peer from the fast/high-capacity tiers when its decayed loss score exceeds the threshold, and mark it for loss probation.
void
ProfileOrganizer.demoteIfNotLowLatency(Hash peer)
Immediately demote a peer from the fast tier when a peer test shows it is no longer low-latency.
void
ProfileOrganizer.demoteIfNoTunnel(Hash peer)
Immediately demote a peer from fast/high-cap tiers.
(package private) void
ProfileOrganizer.demoteIfSlowFirstHop(Hash peer, int firstHopRttMs)
Remove a peer from the fast/high-cap tiers if its measured direct-link RTT reaches the low-latency threshold.
void
ProfileOrganizer.demoteIfStale(Hash peer)
Immediately demote a peer from fast/high-cap tiers if its RouterInfo is stale and it has no recent proof of life (fails isSelectable).
void
ProfileOrganizer.demoteIfUnreachable(Hash peer)
Immediately demote a peer from fast/high-cap tiers when our transport connection to it failed as a tunnel first hop (unreachable).
void
ProfileOrganizer.demoteIfUnreachableNow(Hash peer)
Immediately demote a peer from fast/high-cap tiers on a single unreachable first hop, skipping the ProfileOrganizer.DEMOTE_STRIKE_THRESHOLD strikes and the cooldown that ProfileOrganizer.demoteIfUnreachable(Hash) requires.
boolean
ProfileOrganizer.exportProfile(Hash profile, OutputStream out)
Write a peer profile to the given output stream for persistence.
(package private) static Set<String>
ProfileOrganizer.fingerprints(RouterContext ctx, Hash peer, int mask)
One peer's fingerprints: the masked IP the comm system recorded, the masked IP and port of every published address, and the family option.
(package private) long
ProfileOrganizer.getCalibratedLatencyFloorMs(Hash peer)
The calibrated latency floor for a peer, choosing the style of the transport that measured it.
(package private) long
ProfileOrganizer.getCalibratedLatencyThresholdMs(Hash peer)
The qualifying latency threshold for a peer, from the calibrated baseline of the transport that measured it.
(package private) static double
ProfileOrganizer.getExcessiveFailurePenalty(Hash peer, PeerProfile prof)
Selection penalty multiplier for peers between the soft and hard failure thresholds.
PeerProfile
ProfileOrganizer.getOrCreateProfileNonblocking(Hash peer)
Retrieve an existing profile or create a new one, without blocking on contention.
private PeerProfile
ProfileManagerImpl.getProfile(Hash peer)
Blocking.
PeerProfile
ProfileOrganizer.getProfile(Hash peer)
Retrieve the profile for a peer, or null if unknown.
private PeerProfile
ProfileManagerImpl.getProfileNonblocking(Hash peer)
Non-blocking.
PeerProfile
ProfileOrganizer.getProfileNonblocking(Hash peer)
Retrieve the profile for a peer without blocking.
private int
ProfileOrganizer.getSubTier(Hash peer, long k0, long k1)
Sub-tier slice index for a peer, keyed off the session key so the same key always yields the same slice.
private boolean
ProfileOrganizer.hasNoUsableTransport(Hash peer)
Does this peer's RouterInfo carry no address we could still send to?
private boolean
ProfileOrganizer.hasValidRouterInfo(Hash peer, RouterInfo info, double buildSuccess, PeerProfile prof)
Checks the RouterInfo for hidden flag, stale proof of life, usable transport address, bandwidth tier, and tunnel exclusion.
void
ProfileManagerImpl.heardAbout(Hash peer)
Note that the local router received a reference to the given peer, either through an explicit dbStore or in a dbLookupReply Non-blocking.
void
ProfileManagerImpl.heardAbout(Hash peer, long when)
Note that the local router received a reference to the given peer at a certain time.
private boolean
ProfileOrganizer.holdPromotionForRefresh(Hash peer, boolean staleRouterInfo, int tierSize, int safeFloor)
Apply the hold to one tier insert: leave the peer out of the tier, or let it in.
private boolean
ProfileOrganizer.isCongestedPeer(Hash peer)
Check if a peer has a congestion capability cap (D or E).
(package private) boolean
ProfileOrganizer.isExcludedFromProfiling(Hash peer)
Check if a peer should be excluded from profiling.
boolean
ProfileOrganizer.isFast(Hash peer)
Check whether a peer is classified in the fast tier.
private boolean
ProfileOrganizer.isFastTierCapable(Hash peer)
Whether the peer qualifies for the fast tier based on advertised bandwidth tier and capabilities.
private boolean
ProfileOrganizer.isHighBandwidthCapable(Hash peer)
Whether the peer qualifies for the high-capacity tier based on advertised bandwidth tier and capabilities.
boolean
ProfileOrganizer.isHighCapacity(Hash peer)
Check whether a peer is classified in the high-capacity tier.
private boolean
PeerManager.isLowBandwidthPeer(Hash peer)
Is this peer in a bandwidth tier too low to be worth remembering across a restart?
private boolean
ProfileOrganizer.isLowLatency(Hash peer)
Check whether the peer's profile has low-latency status.
private boolean
ProfileOrganizer.isRestorableTierPeer(Hash peer, PeerProfile profile, Map<Hash, PeerProfile> tier, double buildSuccess, long now, boolean highCap)
Whether a preserved pre-reorganize tier entry may be re-added: not already present in the tier, selectable, no recent tunnel failures, not in loss probation (fast tier) or below the loss demotion threshold (high-cap tier), and acceptable tunnel acceptance.
boolean
ProfileOrganizer.isSelectable(Hash peer)
Whether the given peer is eligible for selection.
private boolean
ProfileOrganizer.isSelectable(Hash peer, double buildSuccess)
Whether the given peer is eligible for selection.
boolean
ProfileOrganizer.isWellIntegrated(Hash peer)
Check whether a peer is classified in the well-integrated tier.
private boolean
ProfileOrganizer.isX(Map<Hash, PeerProfile> m, Hash peer)
Checks whether a peer is in one pool map.
private PeerProfile
ProfileOrganizer.lockedGetProfile(Hash peer)
Returns a peer's profile with the read lock held.
private RouterInfo
ProfileOrganizer.lookupRouterInfoUnvalidated(Hash peer)
Fetch a peer's local RouterInfo without re-running the network database's validate().
(package private) static RouterInfo
ProfileOrganizer.lookupRouterInfoUnvalidated(RouterContext ctx, Hash peer)
ProfileOrganizer.lookupRouterInfoUnvalidated(Hash) with the context passed in, so the fingerprint builder below is reachable from tests.
void
ProfileManagerImpl.messageFailed(Hash peer)
Note that the router failed to send a message to the peer over any transport.
void
ProfileManagerImpl.messageFailed(Hash peer, String transport)
Note that the router failed to send a message to the peer over the transport specified.
void
ProfileManagerImpl.messageReceived(Hash peer, String style, long msToReceive, int bytesRead)
Note that the router received a message from the given peer on the specified transport.
void
ProfileManagerImpl.messageSent(Hash peer, String transport, long msToSend, long bytesSent)
Note that it took msToSend to send a message of size bytesSent to the peer over the transport.
void
ProfileOrganizer.noteFirstHopRtt(Hash peer, int rtt, long when)
Record a measured direct-link RTT against a peer, by hash.
(package private) boolean
ProfileOrganizer.noteMissingRouterInfo(Hash peer)
Record that a stored profile was loaded for a peer the netdb cannot resolve.
(package private) boolean
RouterInfoRefresher.noteMissingRouterInfo(Hash peer)
Note that a stored profile was loaded for a peer the netdb cannot resolve.
private boolean
ProfileOrganizer.notRestricted(Hash peer, MaskedIPSet ipSet, int mask)
Subnet-diversity gate for the running router.
(package private) static boolean
ProfileOrganizer.notRestricted(RouterContext ctx, Hash peer, MaskedIPSet ipSet, int mask)
Subnet-diversity gate: does this peer pass the masked-subnet, port and family check, and if it does, claim its fingerprints so that no later peer sharing any one of them passes as well.
private boolean
ProfileOrganizer.passesBasicGates(Hash peer)
Returns false when the peer is us, banlisted, or recently failed as first hop.
void
ProfileManagerImpl.peerLossEvent(Hash peer, float ratio)
Record the packet-loss (retransmit) ratio measured by the transport for a peer.
boolean
ProfileOrganizer.peerSendsBadReplies(Hash peer)
Check whether a peer sends an excessive rate of invalid or failed netDb lookup replies (potential misbehavior indicator).
(package private) String
ProfileOrganizer.promotionSkipReason(PeerProfile profile, Hash peer, double buildSuccess, long now)
Why ProfileOrganizer.skipsPromotion(PeerProfile, Hash, double) would skip this profile, or null when it would not.
private void
ProfileOrganizer.putFastPeer(Hash peer, PeerProfile profile)
Add a peer to the fast tier, maintaining the quality counter.
void
PeerManager.removeCapabilities(Hash peer)
Remove all capabilities for the peer from the index.
void
PeerManagerFacadeImpl.removeCapabilities(Hash peer)
Remove all capabilities for the peer from the index.
private PeerProfile
ProfileOrganizer.removeFastPeer(Hash peer)
Remove a peer from the fast tier, maintaining the quality counter.
(package private) boolean
RouterInfoRefresher.requestAddressRefresh(Hash peer)
Ask for a RouterInfo lookup for a peer held out of the tiers for want of a usable address.
void
PeerManager.setCapabilities(Hash peer, String caps)
Records the capability string a peer advertised and reindexes it in the per-capability lookup, dropping any capability it no longer holds.
void
PeerManagerFacadeImpl.setCapabilities(Hash peer, String caps)
Record a peer's capability flags.
void
ProfileOrganizer.setUs(Hash us)
Store the local router hash for self-exclusion from peer selection.
void
ProfilePersistenceHelper.setUs(Hash routerIdentHash)
Store the local router identity hash for filtering out the router's own profile.
(package private) boolean
ProfileOrganizer.skipsPromotion(PeerProfile profile, Hash peer, double buildSuccess)
Whether the peer should be skipped for tier promotion: not selectable, in a strict country, low tunnel acceptance, high-latency penalty, congested, or in loss probation.
private boolean
PeerManager.storeProfile(Hash peer, long cutoff)
Save a peer's profile to disk if it is still usable.
private static int
PeerTestJob.tierRank(ProfileOrganizer organizer, Hash peer)
Selection priority for a test candidate: tier first (fast 0, high-cap 1, other 2), then staleness of the persisted tunnel-test EWMA so never-tested peers go first.
void
ProfileManagerImpl.tunnelDataPushed(Hash peer, long rtt, long size)
Non-blocking.
void
ProfileManagerImpl.tunnelDataPushed1m(Hash peer, long size)
Non-blocking.
void
ProfileManagerImpl.tunnelFailed(Hash peer, int pct)
Note that the peer participated in a tunnel that failed.
void
ProfileManagerImpl.tunnelJoined(Hash peer, long responseTimeMs)
Note that the router agreed to participate in a tunnel.
void
ProfileManagerImpl.tunnelLifetimePushed(Hash peer, long lifetime, long size)
Non-blocking.
void
ProfileManagerImpl.tunnelRejected(Hash peer, long responseTimeMs, int severity)
Note that a router explicitly rejected joining a tunnel.
void
ProfileManagerImpl.tunnelTestSucceeded(Hash peer, long responseTimeMs)
Note that a tunnel that the router is participating in was successfully tested with the given round trip latency
void
ProfileManagerImpl.tunnelTimedOut(Hash peer)
Note that a router did not respond to a tunnel join.
Method parameters in net.i2p.router.peermanager with type arguments of type Hash
Modifier and Type
Method
Description
private int
ProfileOrganizer.count(Map<Hash, PeerProfile> m)
Counts the profiles in one pool map.
void
ProfileOrganizer.demoteBatch(Set<Hash> peers)
Batch-demote peers from fast/high-cap tiers under a single write lock.
void
ProfileOrganizer.demoteFastOnlyBatch(Set<Hash> peers)
Batch-remove peers from fast tier only, keeping them in high-cap.
(package private) static boolean
ProfileOrganizer.isEvictable(PeerProfile profile, Map<Hash, PeerProfile> fastPeers, Map<Hash, PeerProfile> highCapPeers, long activeThreshold, int fastPeerLimit, int highCapacityLimit)
Whether a profile is eligible for eviction under the profile cap: not protected by a fast/high-cap tier slot that still has room below its limit, and no send or heard-from activity within the active window.
private static boolean
ProfileOrganizer.isQualityFastPeer(PeerProfile profile, Map<Hash, PeerProfile> highCap)
True when a peer in the fast tier has proven throughput or is in the high-cap tier.
private boolean
ProfileOrganizer.isRestorableTierPeer(Hash peer, PeerProfile profile, Map<Hash, PeerProfile> tier, double buildSuccess, long now, boolean highCap)
Whether a preserved pre-reorganize tier entry may be re-added: not already present in the tier, selectable, no recent tunnel failures, not in loss probation (fast tier) or below the loss demotion threshold (high-cap tier), and acceptable tunnel acceptance.
private boolean
ProfileOrganizer.isX(Map<Hash, PeerProfile> m, Hash peer)
Checks whether a peer is in one pool map.
private void
ProfileOrganizer.lockedPickLowestPriority(List<Map.Entry<Hash, PeerProfile>> candidates, int howMany, Set<Hash> matches)
Selects the lowest-priority candidates, penalizing moderately-lossy peers.
private void
ProfileOrganizer.lockedPickLowestPriority(List<Map.Entry<Hash, PeerProfile>> candidates, int howMany, Set<Hash> matches)
Selects the lowest-priority candidates, penalizing moderately-lossy peers.
private void
ProfileOrganizer.lockedSelectActive(List<Hash> connected, int howMany, Set<Hash> toExclude, Set<Hash> matches, int mask, MaskedIPSet ipSet, double buildSuccess)
Scan up to ProfileOrganizer.maxCandidateSample(int, int) established peers for the active tier, in RandomIterator order so the peers examined differ from call to call.
private void
ProfileOrganizer.lockedSelectActive(List<Hash> connected, int howMany, Set<Hash> toExclude, Set<Hash> matches, int mask, MaskedIPSet ipSet, double buildSuccess)
Scan up to ProfileOrganizer.maxCandidateSample(int, int) established peers for the active tier, in RandomIterator order so the peers examined differ from call to call.
private void
ProfileOrganizer.lockedSelectPeers(Map<Hash, PeerProfile> peers, int howMany, Set<Hash> toExclude, Set<Hash> matches, int mask, MaskedIPSet ipSet, double buildSuccess, long rttCeiling)
Selects peers while holding the lock.
private void
ProfileOrganizer.lockedSelectPeers(Map<Hash, PeerProfile> peers, int howMany, Set<Hash> toExclude, Set<Hash> matches, int mask, MaskedIPSet ipSet, double buildSuccess, long rttCeiling)
Selects peers while holding the lock.
private void
ProfileOrganizer.lockedSelectPeers(Map<Hash, PeerProfile> peers, int howMany, Set<Hash> toExclude, Set<Hash> matches, SessionKey randomKey, ProfileOrganizer.Slice subTierMode, int mask, MaskedIPSet ipSet, double buildSuccess, long rttCeiling)
Collects up to ProfileOrganizer.maxCandidateSample(int, int) candidates from a tier and hands them to ProfileOrganizer.lockedPickLowestPriority(List, int, Set).
private void
ProfileOrganizer.lockedSelectPeers(Map<Hash, PeerProfile> peers, int howMany, Set<Hash> toExclude, Set<Hash> matches, SessionKey randomKey, ProfileOrganizer.Slice subTierMode, int mask, MaskedIPSet ipSet, double buildSuccess, long rttCeiling)
Collects up to ProfileOrganizer.maxCandidateSample(int, int) candidates from a tier and hands them to ProfileOrganizer.lockedPickLowestPriority(List, int, Set).
static int
ProfileOrganizer.pickLowestPriority(List<Hash> candidates, float[] priority, int howMany, Set<Hash> matches)
Choose up to howMany candidates in ascending priority order.
static int
ProfileOrganizer.pickLowestPriority(List<Hash> candidates, float[] priority, int howMany, Set<Hash> matches)
Choose up to howMany candidates in ascending priority order.
void
ProfilePersistenceHelper.purgeExcessProfiles(Set<Hash> keepPeers, int retentionFloor)
Delete profile files that are no longer worth keeping.
private void
ProfileOrganizer.purgeUnusableFromMap(Map<Hash, PeerProfile> tier, String tierName, long now, double buildSuccess, boolean allowSoftEviction, Map<ProfileOrganizer.PurgeReason, Integer> reasons)
Evicts every peer in one tier map that ProfileOrganizer.purgeReasonFor(boolean, boolean, boolean, boolean, boolean, boolean, boolean) rejects.
(package private) static int
ProfileOrganizer.remainingToSelect(int howMany, Set<Hash> matches)
How many slots are still free in a cascade's destination set.
private void
ProfileOrganizer.restorePreservedPeers(long now, Set<Hash> oldFastPeers, Set<Hash> oldHighCapPeers, double buildSuccess)
Re-adds preserved pre-reorganize tier entries when the rebuild shrank the tiers too much.
void
PeerTestJob.schedulePriorityTests(List<Hash> peers)
Schedule peers for priority testing (e.g., from slow tunnels).
void
ProfileOrganizer.selectActiveNotFailingPeers(int howMany, Set<Hash> exclude, Set<Hash> matches)
Select from currently connected (established) not-failing peers.
void
ProfileOrganizer.selectActiveNotFailingPeers(int howMany, Set<Hash> exclude, Set<Hash> matches, int mask, MaskedIPSet ipSet)
Select from currently connected peers with IP-subnet diversity.
void
ProfileOrganizer.selectAllNotFailingPeers(int howMany, Set<Hash> exclude, Set<Hash> matches, boolean onlyNotFailing)
Select from all not-failing peers randomly, falling through to general peers if the not-failing set is insufficient.
void
ProfileOrganizer.selectAllNotFailingPeers(int howMany, Set<Hash> exclude, Set<Hash> matches, boolean onlyNotFailing, int mask, MaskedIPSet ipSet)
Select from all not-failing peers randomly, honouring a /n subnet diversity restriction.
private void
ProfileOrganizer.selectAllNotFailingPeers(int howMany, Set<Hash> exclude, Set<Hash> matches, boolean onlyNotFailing, int mask, MaskedIPSet ipSet, double buildSuccess, boolean preferUnproven)
Random iterator over not-failing list with optional tier exclusion.
void
ProfileOrganizer.selectFastPeers(int howMany, Set<Hash> exclude, Set<Hash> matches)
Select up to howMany fast-tier peers, filling shortfalls from high-capacity.
void
ProfileOrganizer.selectFastPeers(int howMany, Set<Hash> exclude, Set<Hash> matches, int mask, MaskedIPSet ipSet)
Select fast-tier peers with IP-subnet diversity constraints.
void
ProfileOrganizer.selectFastPeers(int howMany, Set<Hash> exclude, Set<Hash> matches, SessionKey randomKey, ProfileOrganizer.Slice subTierMode, int mask, MaskedIPSet ipSet)
Select fast-tier peers deterministically sliced by a random key.
void
ProfileOrganizer.selectHighBandwidthPeers(int howMany, Set<Hash> exclude, Set<Hash> matches)
Select up to howMany peers from O/P/X bandwidth tiers (high shared bandwidth) that are not failing.
void
ProfileOrganizer.selectHighBandwidthPeers(int howMany, Set<Hash> exclude, Set<Hash> matches, boolean onlyNotFailing, int mask, MaskedIPSet ipSet)
Select high-bandwidth peers with tier-exclusion and IP-subnet diversity.
private void
ProfileOrganizer.selectHighBandwidthPeers(int howMany, Set<Hash> exclude, Set<Hash> matches, boolean onlyNotFailing, int mask, MaskedIPSet ipSet, double buildSuccess)
Iterates not-failing peers randomly, filtering for O/P/X bandwidth tiers with reliability checks (acceptance ratio, recent activity, peer tests).
void
ProfileOrganizer.selectHighCapacityPeers(int howMany, Set<Hash> exclude, Set<Hash> matches)
Select high-capacity peers, filling shortfalls from not-failing peers.
void
ProfileOrganizer.selectHighCapacityPeers(int howMany, Set<Hash> exclude, Set<Hash> matches, int mask, MaskedIPSet ipSet)
Select high-capacity peers with IP-subnet diversity.
void
ProfileOrganizer.selectNotFailingPeers(int howMany, Set<Hash> exclude, Set<Hash> matches)
Select from not-failing peers, excluding high-capacity tier if requested.
void
ProfileOrganizer.selectNotFailingPeers(int howMany, Set<Hash> exclude, Set<Hash> matches, boolean onlyNotFailing)
Select from not-failing peers, optionally excluding the high-capacity tier.
void
ProfileOrganizer.selectNotFailingPeers(int howMany, Set<Hash> exclude, Set<Hash> matches, boolean onlyNotFailing, int mask, MaskedIPSet ipSet)
Full-parameter select from not-failing peers.
void
ProfileOrganizer.selectNotFailingPeers(int howMany, Set<Hash> exclude, Set<Hash> matches, boolean onlyNotFailing, int mask, MaskedIPSet ipSet, boolean preferUnproven)
Full-parameter select from not-failing peers.
void
ProfileOrganizer.selectNotFailingPeers(int howMany, Set<Hash> exclude, Set<Hash> matches, int mask, MaskedIPSet ipSet)
Select from not-failing peers with IP-subnet diversity.
private void
ProfileOrganizer.selectRemainderFromAllPeers(int howMany, Set<Hash> exclude, Set<Hash> matches, double buildSuccess)
Fallback selection: fill the remaining slots from the union of all peers (fast + high-capacity + not-failing).
boolean
ProfileOrganizer.selectTestPeersNonBlocking(int howMany, Set<Hash> exclude, Set<Hash> matches)
Non-blocking test peer selection: tries the full fast → high-cap → active chain under a single ProfileOrganizer.tryReadLock().
(package private) void
ProfilePersistenceHelper.setMissingRouterInfoSink(Set<Hash> missingRouterInfo)
Supply the set to collect peers-without-RouterInfo into.
(package private) static boolean
ProfileOrganizer.stillSelecting(int howMany, Set<Hash> matches)
Whether a cascade still has slots left to fill.
private void
ProfileOrganizer.warnTierStarved(Map<Hash, PeerProfile> peers, int examined, int skipExcluded, int skipGated, int skipSliced, int skipIp, int skipRtt)
Rate-limited warning naming the gate that emptied a tier scan.
Constructors in net.i2p.router.peermanager with parameters of type Hash
Modifier
Constructor
Description
(package private)
PeerData(RouterContext ctx, Hash peerHash)
Creates a new PeerData instance by looking up all necessary information.
PeerProfile(RouterContext context, Hash peer)
Caller should call PeerProfile.setLastHeardAbout(long) and PeerProfile.setFirstHeardAbout(long).
private
PeerProfile(RouterContext context, Hash peer, boolean expand)
Caller should call PeerProfile.setLastHeardAbout(long) and PeerProfile.setFirstHeardAbout(long).
ReplySelector(Hash peer, long nonce, long expiration)
Records the peer, nonce and expiry this outstanding test expects.
Uses of Hash in net.i2p.router.sybil
Fields in net.i2p.router.sybil declared as Hash
Modifier and Type
Field
Description
private final Hash
Analysis.RouterInfoRoutingKeyComparator._us
Our hash, the distance reference.
Methods in net.i2p.router.sybil that return types with arguments of type Hash
Modifier and Type
Method
Description
Map<Hash,Points>
Analysis.backgroundAnalysis(boolean includeAll)
Analyze threats.
Map<Hash,Points>
PersistSybil.load(long date)
Load the analysis for a certain date.
Methods in net.i2p.router.sybil with parameters of type Hash
Modifier and Type
Method
Description
private void
Analysis.addPoints(Map<Hash,Points> points, Hash h, double d, String reason)
Adds scored points for one router.
void
Analysis.calculateRouterInfo(Hash us, String usName, List<RouterInfo> ris, Map<Hash,Points> points)
Build the version comparison report.
private static double
Analysis.closestDistance(Hash h, List<RouterInfo> ris)
Finds the keyspace distance to the nearest listed router.
List<RouterInfo>
Analysis.getAllRouters(Hash us)
Returns all routers in the network DB, excluding our own router.
List<RouterInfo>
Analysis.getFloodfills(Hash us)
Returns all floodfill routers, excluding our own router.
Map<Long,Points>
PersistSybil.load(Hash h)
Load all the analysis for a certain hash.
Method parameters in net.i2p.router.sybil with type arguments of type Hash
Modifier and Type
Method
Description
private void
Analysis.addPoints(Map<Hash,Points> points, Hash h, double d, String reason)
Adds scored points for one router.
void
Analysis.addProfilePoints(List<RouterInfo> ris, Map<Hash,Points> points)
Analyzes router profiles and adds Sybil points for banlisted, newly observed, or poorly performing routers.
void
Analysis.addVersionPoints(List<RouterInfo> ris, Map<Hash,Points> points)
Analyzes router versions and adds Sybil points for old, unreachable, or non-floodfill routers.
Map<Integer, List<RouterInfo>>
Analysis.calculateIPGroups16(List<RouterInfo> ris, Map<Hash,Points> points)
Categorize routers by their /16 subnet to identify routers in the same /16 network.
Map<Integer, List<RouterInfo>>
Analysis.calculateIPGroups24(List<RouterInfo> ris, Map<Hash,Points> points)
Categorize routers by their /24 subnet to identify routers in the same /24 network.
Map<Integer, List<RouterInfo>>
Analysis.calculateIPGroups32(List<RouterInfo> ris, Map<Hash,Points> points)
Categorize routers by their IP address to identify routers sharing the same IP.
Map<Long, List<RouterInfo>>
Analysis.calculateIPGroups48(List<RouterInfo> ris, Map<Hash,Points> points)
Categorize routers by their IPv6 /48 subnet to identify routers in the same /48 network.
Map<Long, List<RouterInfo>>
Analysis.calculateIPGroups64(List<RouterInfo> ris, Map<Hash,Points> points)
Categorize routers by their IPv6 /64 subnet to identify routers in the same /64 network.
Map<String, List<RouterInfo>>
Analysis.calculateIPGroupsFamily(List<RouterInfo> ris, Map<Hash,Points> points)
Categorize routers by their router family to identify routers in the same family.
void
Analysis.calculateIPGroupsUs(List<RouterInfo> ris, Map<Hash,Points> points, List<RouterInfo> ri32, List<RouterInfo> ri24, List<RouterInfo> ri16, List<RouterInfo> ri64, List<RouterInfo> ri48)
Categorize routers by their proximity to our IP address, grouping them by /32, /24, /16 for IPv4 and /64, /48 for IPv6.
double
Analysis.calculatePairDistance(List<RouterInfo> ris, Map<Hash,Points> points, List<Pair> pairs)
Calculate average pairwise distance between floodfills and identifies routers that are unusually close to each other.
void
Analysis.calculateRouterInfo(Hash us, String usName, List<RouterInfo> ris, Map<Hash,Points> points)
Build the version comparison report.
private void
Analysis.doBlocking(Map<Hash,Points> points)
Blocklist and Banlist if configured.
void
PersistSybil.store(long date, Map<Hash,Points> entries)
Store each entry.
Constructors in net.i2p.router.sybil with parameters of type Hash
Modifier
Constructor
Description
RouterInfoRoutingKeyComparator(Hash us)
Comparator using the routing key.
Uses of Hash in net.i2p.router.transport
Fields in net.i2p.router.transport declared as Hash
Modifier and Type
Field
Description
private Hash
TransportImpl._lastReachablePeer
The last peer checked for reachability, a one-entry cache.
Fields in net.i2p.router.transport with type parameters of type Hash
Modifier and Type
Field
Description
private static final Map<Hash,byte[]>
TransportImpl._IPMap
Global router ident -> IP map.
private final Map<Hash,Long>
TransportImpl._unreachableEntries
Map from routerIdentHash to timestamp (Long) when the peer was last unreachable.
private final Map<Hash,Long>
TransportImpl._wasUnreachableEntries
Peers recently marked unreachable, by hash.
private final Map<Hash,String>
PeerHTMLRenderer.capacityCache
The cached capacity strings, by peer.
private final ConcurrentHashMap<Hash,String>
CountryLookup.countryCache
The cached countries, by router hash.
private final ConcurrentHashMap<Hash,Long>
CountryLookup.countryCacheTimestamps
When each cached country was stored.
private final List<Hash>
TransportManager.EstablishedSnapshot.peers
Peers in the summary.
private final Map<Hash, RouterInfo>
PeerHTMLRenderer.routerInfoCache
The cached router infos, by peer, to speed repeated lookups.
Methods in net.i2p.router.transport that return types with arguments of type Hash
Modifier and Type
Method
Description
List<Hash>
CommSystemFacadeImpl.getEstablished()
Established peers.
List<Hash>
Transport.getEstablished()
The list of peers this transport has established connections with.
List<Hash>
TransportManager.getEstablished()
The list of peer hashes with established connections, may be empty.
Methods in net.i2p.router.transport with parameters of type Hash
Modifier and Type
Method
Description
private void
TransportManager.establishTo(Hash peer)
Trigger transport connection establishment to a peer.
void
CommSystemFacadeImpl.exemptIncoming(Hash peer)
Exempt this router hash from any incoming throttles or rejections.
void
CommSystemFacadeImpl.forceDisconnect(Hash peer)
Tell the comm system to disconnect from this peer.
void
CommSystemFacadeImpl.forceDisconnect(Hash peer, String reason)
Force an immediate disconnect from the given peer with the given reason.
void
Transport.forceDisconnect(Hash peer)
Force immediate disconnection from specified peer.
void
Transport.forceDisconnect(Hash peer, String reason)
Forcefully disconnect from a peer with a reason for logging.
(package private) void
TransportManager.forceDisconnect(Hash peer)
Tell the transports to disconnect from this peer.
(package private) void
TransportManager.forceDisconnect(Hash peer, String reason)
Tell the transports to disconnect from this peer with a reason for logging.
private String
PeerHTMLRenderer.getCapacityCached(Hash peer)
Gets the capacity text from the cache.
String
CommSystemFacadeImpl.getCountry(Hash peer)
Uses the transport IP first because that lookup is fast, then the IP from the netDb.
String
CountryLookup.getCountry(Hash peer)
Uses the transport IP first because that lookup is fast, then the IP from the netDb.
default int
Transport.getEstimatedRTT(Hash peer)
The transport's own measured round trip time to a peer.
default long
Transport.getEstimatedRTTTime(Hash peer)
When Transport.getEstimatedRTT(Hash) last measured this peer, on the router clock.
byte[]
CommSystemFacadeImpl.getIP(Hash peer)
The known IP address of the given peer.
static byte[]
TransportImpl.getIP(Hash peer)
IP of the peer from the last connection (in or out, any transport).
(package private) byte[]
TransportManager.getIP(Hash peer)
IP of the peer from the last connection (in or out, any transport).
private RouterInfo
PeerHTMLRenderer.getRouterInfoCached(Hash peer)
Gets the router info from the cache.
boolean
CommSystemFacadeImpl.isBacklogged(Hash peer)
Whether the given peer is backlogged.
boolean
Transport.isBacklogged(Hash peer)
Whether the given peer is backlogged.
boolean
TransportImpl.isBacklogged(Hash peer)
Whether the given peer is backlogged.
(package private) boolean
TransportManager.isBacklogged(Hash peer)
Whether any transport is backlogged to the given peer.
boolean
CommSystemFacadeImpl.isConnecting(Hash peer)
Whether we are currently connecting to the given peer.
boolean
Transport.isConnecting(Hash peer)
Check if a connection attempt is in progress for the given peer.
boolean
TransportImpl.isConnecting(Hash peer)
Check if a connection attempt is in progress for the given peer.
(package private) boolean
TransportManager.isConnecting(Hash peer)
Check if any transport has a connection attempt in progress for the peer.
boolean
CommSystemFacadeImpl.isEstablished(Hash peer)
Whether the given peer is established.
boolean
Transport.isEstablished(Hash peer)
Whether the given peer is established.
boolean
TransportImpl.isEstablished(Hash peer)
Whether the given peer is established.
(package private) boolean
TransportManager.isEstablished(Hash peer)
Whether any transport has an established connection to the given peer.
boolean
CommSystemFacadeImpl.isInStrictCountry(Hash peer)
Are they in a strict country.
boolean
CountryLookup.isInStrictCountry(Hash peer)
Are they in a strict country.
boolean
Transport.isUnreachable(Hash peer)
Whether the given peer is unreachable.
boolean
TransportImpl.isUnreachable(Hash peer)
Whether the given peer is unreachable.
void
TransportImpl.markReachable(Hash peer, boolean isInbound)
Called when we establish a peer connection (outbound or inbound).
void
TransportImpl.markUnreachable(Hash peer)
Called when we can't reach a peer.
private void
TransportImpl.markWasUnreachable(Hash peer, boolean yes)
Maintain the WasUnreachable list.
void
CommSystemFacadeImpl.mayDisconnect(Hash peer)
Tell the comm system that we may disconnect from this peer.
void
Transport.mayDisconnect(Hash peer)
Suggest that transport may disconnect from specified peer.
void
TransportImpl.mayDisconnect(Hash peer)
Tell the transport that we may disconnect from this peer.
(package private) void
TransportManager.mayDisconnect(Hash peer)
Tell the transports that we may disconnect from this peer.
void
TransportEventListener.messageReceived(I2NPMessage message, RouterIdentity fromRouter, Hash fromRouterHash)
Message received.
void
TransportImpl.messageReceived(I2NPMessage inMsg, RouterIdentity remoteIdent, Hash remoteIdentHash, long msToReceive, int bytesReceived)
Message received from the I2NPMessageReader - send it to the listener.
void
TransportManager.messageReceived(I2NPMessage message, RouterIdentity fromRouter, Hash fromRouterHash)
Handle incoming I2NP message from a peer.
String
CommSystemFacadeImpl.renderPeerCaps(Hash peer, boolean inline)
Renders the peer's capability HTML block.
String
PeerHTMLRenderer.renderPeerCaps(Hash peer, boolean inline)
Renders the peer's capability HTML block.
String
CommSystemFacadeImpl.renderPeerFlag(Hash peer)
Render the HTML flag image for the given peer.
String
PeerHTMLRenderer.renderPeerFlag(Hash peer)
Render the HTML flag image for the given peer.
String
CommSystemFacadeImpl.renderPeerHTML(Hash peer, boolean extended)
Renders HTML for a peer with optional extended info.
String
PeerHTMLRenderer.renderPeerHTML(Hash peer, boolean extended)
Renders HTML for a peer with optional extended info.
void
TransportImpl.setIP(Hash peer, byte[] ip)
IP of the peer from the last connection (in or out, any transport).
boolean
CommSystemFacadeImpl.wasFailsafeClosed(Hash peer, long withinMs)
Whether the peer's most recent connection was closed by the failsafe.
boolean
Transport.wasFailsafeClosed(Hash peer, long withinMs)
Whether this transport closed a session to the given peer for idleness within the given window.
boolean
TransportImpl.wasFailsafeClosed(Hash peer, long withinMs)
Whether this transport closed a session to the peer for idleness recently.
(package private) boolean
TransportManager.wasFailsafeClosed(Hash peer, long withinMs)
Whether any transport closed a session to this peer for idleness recently.
boolean
CommSystemFacadeImpl.wasUnreachable(Hash peer)
Whether the given peer was recently unreachable.
boolean
Transport.wasUnreachable(Hash peer)
Check if peer was unreachable on last outbound attempt.
boolean
TransportImpl.wasUnreachable(Hash peer)
Was the peer unreachable (outbound only) the last time we tried it? This is NOT reset if the peer contacts us.
(package private) boolean
TransportManager.wasUnreachable(Hash peer)
Was the peer unreachable (outbound only) on every transport, based on the last time we tried it for each transport? This is NOT reset if the peer contacts us.
Method parameters in net.i2p.router.transport with type arguments of type Hash
Modifier and Type
Method
Description
(package private) static int
CountryLookup.evictExpired(Map<Hash,String> cache, Map<Hash,Long> timestamps, long now, long expiryMs)
Remove stale and unresolved ("xx") entries from the country cache.
(package private) static void
CountryLookup.trimToCapacity(Map<Hash,String> cache, Map<Hash,Long> timestamps, long now, long expiryMs, int maxSize)
Bring an over-capacity country cache back under its size bound.
Constructor parameters in net.i2p.router.transport with type arguments of type Hash
Modifier
Constructor
Description
(package private)
EstablishedSnapshot(List<Hash> peers, long expiresAt)
Creates a snapshot of established peers valid until the given time.
Uses of Hash in net.i2p.router.transport.ntcp
Fields in net.i2p.router.transport.ntcp with type parameters of type Hash
Modifier and Type
Field
Description
private final ConcurrentHashMap<Hash, NTCPConnection>
NTCPTransport._conByIdent
Open connections, by peer hash.
private final Map<Hash,Long>
EventPumper._failedOutboundAttempts
When an outbound connection to a peer was last attempted.
private final Map<Hash,Integer>
EventPumper._failedOutboundCount
Failed outbound attempts per peer, for backoff.
private final Map<Hash,Long>
NTCPTransport._failsafeClosesAt
Peers this transport closed an idle session to, and when.
Methods in net.i2p.router.transport.ntcp that return types with arguments of type Hash
Modifier and Type
Method
Description
List<Hash>
NTCPTransport.getEstablished()
Connected peers.
Methods in net.i2p.router.transport.ntcp with parameters of type Hash
Modifier and Type
Method
Description
void
NTCPTransport.forceDisconnect(Hash peer)
Tell the transport to disconnect from this peer.
void
NTCPTransport.forceDisconnect(Hash peer, String reason)
Tell the transport to disconnect from this peer with a reason for logging.
private NTCPConnection
NTCPTransport.getConnectionOrCreateNew(Hash ih, RouterInfo target)
Retrieves an existing NTCPConnection for the given peer hash or creates a new one.
int
NTCPTransport.getEstimatedRTT(Hash peer)
Round trip time measured for this peer during the NTCP2 handshake.
long
NTCPTransport.getEstimatedRTTTime(Hash peer)
When NTCPTransport.getEstimatedRTT(Hash) was measured for this peer.
boolean
NTCPTransport.isBacklogged(Hash dest)
Whether the connection to the given peer is backlogged.
boolean
NTCPTransport.isConnecting(Hash dest)
Whether a connection attempt is in progress to the given peer.
boolean
NTCPTransport.isEstablished(Hash dest)

(package private) static boolean
NTCPConnection.isOwnRouterInfo(Hash h, Hash ourHash)
Whether a received RouterInfo's hash identifies us.
(package private) static boolean
NTCPTransport.isOwnRouterInfoStore(I2NPMessage m, Hash ourHash)
Whether a DatabaseStoreMessage stored our own RouterInfo under our own key.
(package private) static boolean
NTCPConnection.isSamePeer(Hash h, Hash peerHash)
Whether a received RouterInfo's hash identifies the peer we are talking to.
void
NTCPTransport.mayDisconnect(Hash peer)
Tell the transport that we may disconnect from this peer.
(package private) void
NTCPTransport.noteFailsafeClose(Hash peer, long now)
Record that an idle session to this peer was just closed.
void
EventPumper.trackFailedInboundHandshake(byte[] ip, Hash hash)
Track failed inbound handshake for diagnostic stats.
void
EventPumper.trackInvalidEncryption(byte[] ip, Hash hash)
Track failed inbound handshake with invalid encryption and ban if too many failures.
private boolean
InboundEstablishState.verifyInbound(Hash aliceHash)
Validates an inbound peer's identity and eligibility for connection.
boolean
NTCPTransport.wasFailsafeClosed(Hash peer, long withinMs)
Whether the peer's most recent connection was closed by the failsafe.
Uses of Hash in net.i2p.router.transport.udp
Fields in net.i2p.router.transport.udp declared as Hash
Modifier and Type
Field
Description
private Hash
PeerTestState._aliceHash
Alice's router hash, for SSU2 tests.
private Hash
PeerTestState._charlieHash
Charlie's router hash, for SSU2 tests.
private final Hash
InboundMessageState._from
The peer the message came from.
private final Hash[]
UDPAddress._introHashes
The introducer hashes.
private Hash
UDPTransport._lastFromv4
Last report from a peer of our IP.
private Hash
UDPTransport._lastFromv6
Hash of the last peer reached over IPv6.
private final Hash
RemoteHostId._peerHash
The peer's hash, if known.
protected final Hash
PeerState._remotePeer
The peer are we talking to.
private final Hash
IntroductionManager.DelayIntro.alice
Alice's router hash.
private final Hash
SSU2Payload.PeerTestBlock.h
The hash echoed in the test.
private final Hash
PeerTestManager.DelayTest.hash
The target peer's hash.
private final Hash
PeerTestManager.RIMiss.hash
The router whose router info went missing.
Fields in net.i2p.router.transport.udp with type parameters of type Hash
Modifier and Type
Field
Description
private final Map<Hash, OutboundEstablishState2.IntroState>
OutboundEstablishState2._introducers
Introduction states, by introducer hash.
private final ConcurrentHashMap<Hash, OutboundEstablishState>
EstablishmentManager._outboundByHash
Map of router hash to OutboundEstablishState.
private final Map<Hash, PeerState>
UDPTransport._peersByIdent
Map of known peers, keyed by their identity hash.
private final List<Hash>
PeerTestState._previousCharlies
Previous Charlies to avoid reusing, for SSU2 Bob.
Methods in net.i2p.router.transport.udp that return Hash
Modifier and Type
Method
Description
Hash
PeerTestState.getCharlieHash()
Return Charlie's Hash (SSU2 only).
Hash
InboundMessageState.getFrom()
The Hash of the sender.
(package private) Hash
UDPAddress.getIntroducerHash(int i)
Introducer hash for the given introducer.
Hash
RemoteHostId.getPeerHash()
The peer hash, or null if direct.
Hash
PeerState.getRemotePeer()
Remote peer hash.
Methods in net.i2p.router.transport.udp that return types with arguments of type Hash
Modifier and Type
Method
Description
List<Hash>
UDPTransport.getEstablished()
Identities of all currently established peers.
List<Hash>
PeerTestState.getPreviousCharlies()
Return previous Charlie hashes (SSU2 only, Bob only).
Methods in net.i2p.router.transport.udp with parameters of type Hash
Modifier and Type
Method
Description
private void
EstablishmentManager.banAndFail(OutNetMessage msg, Hash toHash, String failReason, String banReason, String noHashWarn, String ipAddress, int port, String truncHash, long banDuration, long now, boolean isBanned)
Mark the peer unreachable and fail the message.
UDPPacket
PacketBuilder2.buildPeerTestToAlice(int code, Hash charlieHash, byte[] signedData, PeerState2 alice)
Build a packet as Bob to Alice, with the response from Charlie, or a rejection by Bob.
UDPPacket
PacketBuilder2.buildPeerTestToAlice(int code, Hash charlieHash, byte[] signedData, SSU2Payload.Block riBlock, PeerState2 alice)
Build a packet as Bob to Alice, with the response from Charlie, or a rejection by Bob.
UDPPacket
PacketBuilder2.buildPeerTestToCharlie(Hash aliceHash, byte[] signedData, SSU2Payload.Block riBlock, PeerState2 charlie)
Build a packet as Bob to Charlie to help test Alice.
private OutboundEstablishState
EstablishmentManager.createOutboundState(OutNetMessage msg, RemoteHostId to, RemoteHostId maybeTo, RouterIdentity toIdentity, boolean isIndirect, UDPAddress addr, RouterAddress ra, Hash toHash, String truncHash, String ipAddress, int maybePort, long now, boolean isBanned)
Create a new outbound establish state for the peer, after verifying that its introducers, MTU, and introduction key are usable.
static byte[]
SSU2Util.createPeerTestData(I2PAppContext ctx, Hash h, Hash h2, PeerTestState.Role role, long nonce, byte[] ip, int port, SigningPrivateKey spk)
Make the data for the peer test block.
static byte[]
SSU2Util.createRelayRequestData(I2PAppContext ctx, Hash h, Hash h2, long nonce, long tag, byte[] ip, int port, SigningPrivateKey spk)
Make the data for the relay request block.
static byte[]
SSU2Util.createRelayResponseData(I2PAppContext ctx, Hash h, int code, long nonce, byte[] ip, int port, SigningPrivateKey spk, long token)
Make the data for the relay response block.
(package private) void
UDPTransport.dropPeer(Hash peer, boolean shouldBanlist, String why)
This does not send a session destroy, caller must do that if desired.
private void
PacketBuilder2.encryptSessionRequest(UDPPacket packet, HandshakeState state, boolean isIPv6, int mtu, byte[] hdrKey1, byte[] hdrKey2, boolean needIntro, int version, Hash bob)
Encrypt and write out message 1 of the handshake, the SessionRequest.
(package private) void
UDPTransport.externalAddressReceived(Hash from, byte[] hisIP, byte[] ourIP, int ourPort)
Someone we tried to contact gave us what they think our IP address is.
void
UDPTransport.forceDisconnect(Hash peer)
Force disconnect a peer.
void
UDPTransport.forceDisconnect(Hash peer, String reason)
Force disconnect with reason.
int
UDPTransport.getEstimatedRTT(Hash peer)
Measured round trip time to a peer over SSU.
long
UDPTransport.getEstimatedRTTTime(Hash peer)
When UDPTransport.getEstimatedRTT(Hash) was measured, on the router clock.
OutboundEstablishState2.IntroState
OutboundEstablishState2.getIntroState(Hash h)
The current state for the SSU2 introducer specified.
(package private) PeerState
UDPTransport.getPeerState(Hash remotePeer)
The peer state for the peer with the given ident, or null if no state exists.
void
EstablishmentManager.HPCallback.gotPeerTest(int msg, int status, Hash h, byte[] data)
Got a PeerTest block.
void
InboundEstablishState2.gotPeerTest(int msg, int status, Hash h, byte[] data)
Got a PeerTest block.
void
OutboundEstablishState2.gotPeerTest(int msg, int status, Hash h, byte[] data)

void
PeerState2.gotPeerTest(int msg, int status, Hash h, byte[] data)
Process a received PeerTest block.
void
PeerStateDestroyed.gotPeerTest(int msg, int status, Hash h, byte[] data)
Process a received PeerTest block.
void
PeerTestManager.PTCallback.gotPeerTest(int msg, int status, Hash h, byte[] data)

void
SSU2Payload.PayloadCallback.gotPeerTest(int msg, int status, Hash h, byte[] data)
Receive a peer test block.
void
EstablishmentManager.HPCallback.gotRelayIntro(Hash aliceHash, byte[] data)
Got a RelayIntro block.
void
InboundEstablishState2.gotRelayIntro(Hash aliceHash, byte[] data)
Got a RelayIntro block.
void
OutboundEstablishState2.gotRelayIntro(Hash aliceHash, byte[] data)

void
PeerState2.gotRelayIntro(Hash aliceHash, byte[] data)
Process a received RelayIntro block.
void
PeerStateDestroyed.gotRelayIntro(Hash aliceHash, byte[] data)
Process a received RelayIntro block.
void
PeerTestManager.PTCallback.gotRelayIntro(Hash aliceHash, byte[] data)

void
SSU2Payload.PayloadCallback.gotRelayIntro(Hash aliceHash, byte[] data)
Receive a relay introduction.
void
OutboundEstablishState2.introSent(Hash h)
A relay request was sent to the SSU2 introducer specified.
boolean
UDPTransport.isBacklogged(Hash dest)
Whether the peer for the given destination is backlogged.
(package private) static boolean
EstablishmentManager.isBanlisted(Banlist banlist, Hash h)
Is the router with the given hash banlisted under any active ban? Null-safe.
boolean
EstablishmentManager.isConnecting(Hash dest)
Check if an outbound SSU handshake is in progress for the given peer.
boolean
UDPTransport.isConnecting(Hash dest)

boolean
UDPTransport.isEstablished(Hash dest)

private OutboundEstablishState
EstablishmentManager.lookupOutboundState(RemoteHostId to, Hash toHash)
Look up an existing outbound establish state for the peer, first by address, then by hash (for indirect connections).
private RouterInfo
PeerTestManager.lookupRIForTest(Hash h)
Look up the RouterInfo a Peer Test message refers to, with a short negative cache.
void
UDPTransport.mayDisconnect(Hash peer)
Tell the transport that we may disconnect from this peer.
void
UDPTransport.messageReceived(I2NPMessage inMsg, RouterIdentity remoteIdent, Hash remoteIdentHash, long msToReceive, int bytesReceived)
Handle incoming message from transport layer.
(package private) void
IntroductionManager.receiveRelayIntro(PeerState2 bob, Hash alice, byte[] data)
Processes a relay introduction message received from another peer.
private boolean
IntroductionManager.receiveRelayIntro(PeerState2 bob, Hash alice, byte[] data, int retryCount)
We are Charlie and we got this from Bob.
private boolean
IntroductionManager.receiveRelayIntro(PeerState2 bob, Hash alice, byte[] data, RouterInfo aliceRI)
We are Charlie and we got this from Bob.
void
PeerTestManager.receiveTest(RemoteHostId from, PeerState2 fromPeer, int msg, int status, Hash h, byte[] data)
Entry point for all in-session incoming packets.
private void
PeerTestManager.receiveTest(RemoteHostId from, PeerState2 fromPeer, int msg, int status, Hash h, byte[] data, byte[] addrBlockIP, int addrBlockPort)
Called from above for in-session 1-4 or the PTCallback via processPayload() for out-of-session 5-7
private boolean
PeerTestManager.receiveTest(RemoteHostId from, PeerState2 fromPeer, int msg, Hash h, byte[] data, int retryCount)
Status 0 only, Msg 2 and 4 only, SSU 2 only.
private boolean
UDPTransport.rejectFloodfill(Hash to, RouterInfo toAddress)
Reject a floodfill router that we have no history with, or that has rejected tunnel creation far more often than it has agreed.
private void
PeerTestManager.sendRIandPT(RouterInfo ri, int status, Hash hash, byte[] data, PeerState2 to, long now)
Send RI and Peer Test.
void
PeerTestState.setAlice(InetAddress ip, int port, Hash hash)
Alice's IP, port, and hash.
void
PeerTestState.setCharlie(InetAddress ip, int port, Hash hash)
Charlie's IP, port, and hash.
void
OutboundEstablishState2.setIntroState(Hash h, OutboundEstablishState2.IntroState state)
The current state for the SSU2 introducer specified.
static Signature
SSU2Util.sign(I2PAppContext ctx, byte[] prologue, Hash h, Hash h2, byte[] data, int datalen, SigningPrivateKey spk)
Sign the relay or peer test data, using the prologue and hash as the initial data, and then the provided data.
static boolean
SSU2Util.validateSig(I2PAppContext ctx, byte[] prologue, Hash h, Hash h2, byte[] data, SigningPublicKey spk)
Validate the signed relay or peer test data, using the prologue and hash as the initial data, and then the provided data which ends with a signature of the specified type.
Constructors in net.i2p.router.transport.udp with parameters of type Hash
Modifier
Constructor
Description
DelayIntro(PeerState2 b, Hash a, byte[] d)
Schedules a delayed introduction relay.
DelayTest(RemoteHostId f, PeerState2 fp, int m, Hash h, byte[] d)
Schedules itself.
InboundMessageState(RouterContext ctx, long messageId, Hash from)
Creates a new InboundMessageState with no fragments.
InboundMessageState(RouterContext ctx, long messageId, Hash from, byte[] data, int off, int len, int fragmentNum, boolean isLast)
Creates an InboundMessageState and stores the first received fragment.
Introducer(Hash h, long tag, String exp)
SSU 2.
protected
PeerState(RouterContext ctx, UDPTransport transport, InetSocketAddress addr, Hash remotePeer, boolean isInbound, int rtt)
For SSU2.
PeerState2(RouterContext ctx, UDPTransport transport, InetSocketAddress remoteAddress, Hash remotePeer, boolean isInbound, int rtt, CipherState sendCha, CipherState rcvCha, long sendID, long rcvID, byte[] sendHdrKey1, byte[] sendHdrKey2, byte[] rcvHdrKey2)
A session with a remote peer over SSU2: the connection ids, the four cipher states and the header encryption keys are all fixed here, so the transport can build one without a separate handshake step.
PeerTestBlock(int msgNum, int code, Hash hash, byte[] data)
Wrap a peer test as a block.
private
RemoteHostId(byte[] ip, int port, Hash peerHash)
Combines an address, port and hash into one key.
RemoteHostId(Hash peerHash)
Indirect (hash only).
(package private)
RIMiss(Hash hash, long when)
Records a missing router info.
Uses of Hash in net.i2p.router.tunnel
Fields in net.i2p.router.tunnel declared as Hash
Modifier and Type
Field
Description
private Hash
TunnelCreatorConfig._blankHash
Blank hash used for the reply keys.
private final Hash
InboundMessageDistributor._client
The client at the end of the tunnel.
private final Hash
TunnelCreatorConfig._destination
Only necessary for client tunnels.
private final Hash
PumpedTunnelGateway._nextHop
The hash of the next hop.
private final Hash[]
TunnelCreatorConfig._peers
Gateway first.
private Hash
HopConfig._receiveFrom
The router we receive from.
private Hash
HopConfig._sendTo
The router we send to.
private final Hash
OutboundMessageDistributor.DistributeJob._target
The hash the message searches for.
private Hash
FragmentedMessage._toRouter
The router the message goes to.
protected final Hash
PendingGatewayMessage._toRouter
The destination router.
Fields in net.i2p.router.tunnel with type parameters of type Hash
Modifier and Type
Field
Description
private final Set<Hash>
OutboundMessageDistributor._toRouters
The routers the message was already sent to.
Methods in net.i2p.router.tunnel that return Hash
Modifier and Type
Method
Description
Hash
TunnelCreatorConfig.getBlankHash()
Checksum for blank record.
Hash
InboundEndpointProcessor.getDestination()
The destination this inbound tunnel was created for.
Hash
TunnelCreatorConfig.getDestination()
If this is a client tunnel, what destination is it for?
Hash
TunnelCreatorConfig.getEndpoint()
For convenience.
Hash
TunnelCreatorConfig.getFarEnd()
For convenience.
Hash
TunnelCreatorConfig.getGateway()
For convenience.
Hash
TunnelCreatorConfig.getPeer(int hop)
Retrieve the peer at the given hop (the gateway is hop 0).
Hash
HopConfig.getReceiveFrom()
What is the previous peer in the tunnel (null if gateway)?
Hash
HopConfig.getSendTo()
What is the next peer in the tunnel (null if endpoint)?
Hash
InboundGatewayReceiver.getSendTo()
The next hop.
Hash
OutboundReceiver.getSendTo()
The next hop.
Hash
TunnelGateway.Receiver.getSendTo()
Tunnel the message should be sent through.
Hash
TunnelGatewayPumper.PoisonPTG.NoOpReceiver.getSendTo()

Hash
FragmentedMessage.getTargetRouter()
The router this message is being sent to.
Hash
PendingGatewayMessage.getToRouter()
The destination router.
Methods in net.i2p.router.tunnel with parameters of type Hash
Modifier and Type
Method
Description
boolean
PumpedTunnelGateway.add(I2NPMessage msg, Hash toRouter, TunnelId toTunnel)
Adds a message to be sent down the tunnel.
boolean
ThrottledPumpedTunnelGateway.add(I2NPMessage msg, Hash toRouter, TunnelId toTunnel)
Adds a message to the inbound gateway after a bandwidth-based drop check.
boolean
TunnelGateway.add(I2NPMessage msg, Hash toRouter, TunnelId toTunnel)
Add a message to be sent down the tunnel, either sending it now (perhaps coalesced with other pending messages) or after a brief pause (_flushFrequency).
boolean
TunnelGatewayZeroHop.add(I2NPMessage msg, Hash toRouter, TunnelId toTunnel)
Add a message to be sent down the tunnel (immediately forwarding it to the InboundMessageDistributor or OutboundMessageDistributor, as necessary).
void
OutboundTunnelEndpoint.dispatch(TunnelDataMessage msg, Hash recvFrom)
Decrypt and honor the instructions of an incoming tunnel data message.
void
TunnelDispatcher.dispatch(TunnelDataMessage msg, Hash recvFrom)
Dispatch a TunnelDataMessage to the appropriate participant or endpoint.
void
TunnelParticipant.dispatch(TunnelDataMessage msg, Hash recvFrom)
Process an incoming tunnel data message.
boolean
TunnelDispatcher.dispatchOutbound(I2NPMessage msg, TunnelId outboundTunnel, Hash targetPeer)
Dispatch an outbound message through a tunnel.
boolean
TunnelDispatcher.dispatchOutbound(I2NPMessage msg, TunnelId outboundTunnel, TunnelId targetTunnel, Hash targetPeer)
Dispatch an outbound message through a tunnel.
void
InboundMessageDistributor.distribute(I2NPMessage msg, Hash target)
Distribute the message to the target, with no tunnel ID.
void
InboundMessageDistributor.distribute(I2NPMessage msg, Hash target, TunnelId tunnel)
Distribute the message to the target, giving the tunnel ID for remote delivery.
void
OutboundMessageDistributor.distribute(I2NPMessage msg, Hash target)
Warning - as of 0.9.63, msg will be an UnknownI2NPMessage, and must be converted before handling locally.
void
OutboundMessageDistributor.distribute(I2NPMessage msg, Hash target, TunnelId tunnel)
Warning - as of 0.9.63, msg will be an UnknownI2NPMessage, and must be converted before handling locally.
boolean
HopProcessor.process(byte[] orig, int offset, int length, Hash prev)
Process the data for the current hop, overwriting the original data with what should be sent to the next peer.
boolean
FragmentedMessage.receive(byte[] payload, int offset, int length, boolean isLast, Hash toRouter, TunnelId toTunnel)
Receive the first fragment (#0) and related metadata.
void
FragmentHandler.DefragmentedReceiver.receiveComplete(I2NPMessage msg, Hash toRouter, TunnelId toTunnel)
Receive a fully formed I2NPMessage out of the tunnel.
private void
FragmentHandler.receiveComplete(byte[] data, int offset, int len, Hash router, TunnelId tunnelId)
Zero-copy reception of an unfragmented message.
void
OutboundTunnelEndpoint.DefragmentedHandler.receiveComplete(I2NPMessage msg, Hash toRouter, TunnelId toTunnel)
Warning - as of 0.9.63, msg will be an UnknownI2NPMessage, and must be converted before handling locally.
void
TunnelParticipant.DefragmentedHandler.receiveComplete(I2NPMessage msg, Hash toRouter, TunnelId toTunnel)
Distribute the complete message to its target.
boolean
InboundEndpointProcessor.retrievePreprocessedData(byte[] orig, int offset, int length, Hash prev)
Undo all of the encryption done by the peers in the tunnel, recovering the preprocessed data sent by the gateway.
void
TunnelCreatorConfig.setBlankHash(Hash h)
Checksum for blank record.
void
TunnelCreatorConfig.setPeer(int hop, Hash peer)
The peer at the given hop.
void
HopConfig.setReceiveFrom(Hash from)
Do not set for gateway.
void
HopConfig.setSendTo(Hash to)
Do not set for endpoint.
private boolean
OutboundMessageDistributor.shouldDrop(Hash target)
Throttle msgs to unconnected routers after we hit the limit of new routers in a given time period.
Constructors in net.i2p.router.tunnel with parameters of type Hash
Modifier
Constructor
Description
DistributeJob(RouterContext ctx, I2NPMessage msg, Hash target, TunnelId id)
Builds the distribution job.
InboundMessageDistributor(RouterContext ctx, Hash client)
Create a new inbound message distributor.
OutboundGatewayMessage(I2NPMessage message, Hash toRouter, TunnelId toTunnel)
Caches the message priority, which the fragmenter queue orders by.
PendingGatewayMessage(I2NPMessage message, Hash toRouter, TunnelId toTunnel)
Stores the message data, destination, and expiration for a pending send.
TunnelCreatorConfig(RouterContext ctx, int length, boolean isInbound, Hash destination)
Allocates the hop configs and peer arrays for the given length.
Uses of Hash in net.i2p.router.tunnel.pool
Classes in net.i2p.router.tunnel.pool that implement interfaces with type arguments of type Hash
Modifier and Type
Class
Description
(package private) class
ExcluderBase
A Set of Hashes that automatically adds to the Set in the ExcluderBase.contains(Object) check.
private static class
TunnelPeerSelector.HashComparator
Implement a deterministic comparison that cannot be predicted by others.
Fields in net.i2p.router.tunnel.pool declared as Hash
Modifier and Type
Field
Description
private final Hash
TunnelPoolManager.ConditionalOutboundStartup._dest
The client's destination.
private final Hash
TunnelPoolManager.DelayedPoolCleanup._destination
The client whose pools are being cleaned up.
private final Hash
BuildHandler.HandleReq._nextPeer
The next hop the lookup found.
private final Hash
BuildHandler.TimeoutReq._nextPeer
The next hop that never answered.
private final Hash
TunnelPeerSelector.PreConnectFailJob._peer
The peer to retry a session with.
(package private) Hash
ClientPeerSelector.SelectionExclusions.firstHop
The vetted first hop already in rv, or null when the slot is empty.
(package private) final Hash
BuildHandler.BuildMessageState.fromHash
The sender's hash.
private final Hash
ParticipatingThrottler.Disconnector.h
The router's hash.
private final Hash
RequestThrottler.Disconnector.h
The router to disconnect.
(package private) final Hash
BuildHandler.PendingLookup.nextPeer
The next hop found for it.
Fields in net.i2p.router.tunnel.pool with type parameters of type Hash
Modifier and Type
Field
Description
private final Set<Hash>
ClientPeerSelector.IBGWExcluder._allowed
Local cache of peers that passed the IBGW check.
private final Set<Hash>
ClientPeerSelector.OBEPExcluder._allowed
Local cache of peers that passed the OBEP check — same lifecycle and rationale as ClientPeerSelector.IBGWExcluder._allowed.
private final Map<Hash, RequestThrottler.BurstOffenseRecord>
RequestThrottler._burstOffenses
Burst offenses recorded per peer.
private final Map<Hash, TunnelPool>
TunnelPoolManager._clientInboundPools
Hash (destination) to TunnelPool.
private final Map<Hash, TunnelPool>
TunnelPoolManager._clientOutboundPools
Hash (destination) to TunnelPool.
private final Map<Hash,Long>
ExploratoryPeerSelector._exploratoryCooldowns
Cooldown entries for exploratory selections, recorded when checkTunnel fails.
protected static final Map<Hash,Long>
TunnelPeerSelector._firstHopFails
Tracks when a peer last failed as first hop.
private final ConcurrentHashMap<Hash,long[]>
BuildExecutor._firstHopFailureHistory
First-hop failure history: tracks recent first-hop failures to avoid repeatedly selecting peers that have recently failed as first hops.
private final ConcurrentHashMap<Hash, GhostPeerManager.GhostMark>
GhostPeerManager._ghostMarks
The marked peers, by hash.
private static final ConcurrentHashMap<Hash, TunnelPeerSelector.EndpointCacheEntry>
TunnelPeerSelector._ibgwCache
The cached inbound gateway endpoints.
private static final Map<Hash,long[]>
TestJob._inboundReplyPartnerTally
Reply partner router hash to the time it was last blamed for a failed round, per direction.
private final ThreadLocal<Set<Hash>>
ExploratoryPeerSelector._lastAllGhostSelection
Peers from the last selection that were all ghosts, handed to the redraw in ExploratoryPeerSelector.selectPeers(TunnelPoolSettings).
private final ConcurrentHashMap<Hash,Long>
BuildExecutor._lastDispatchTime
Last dispatch time per first-hop peer, for staggering builds.
private static final ConcurrentHashMap<Hash,Long>
TunnelPeerSelector._lastKeepAlive
Tracks last keepalive send time per peer.
private static final ConcurrentHashMap<Hash,Long>
ClientPeerSelector._lastPreConnect
Tracks the last time preConnectTo was successfully called per peer.
private final ConcurrentHashMap<Hash, AtomicInteger>
BuildHandler._lookupKeys
Distinct next-hop keys currently being resolved, each carrying the refcount of build requests waiting on it.
private final LHMCache<Hash,long[]>
ParticipatingThrottler._noVersionOffenses
No-version offense state per hash: {count, lastOffenseMs}.
private static final ConcurrentHashMap<Hash, TunnelPeerSelector.EndpointCacheEntry>
TunnelPeerSelector._obepCache
The cached outbound endpoint entries.
private static final Map<Hash,long[]>
TestJob._outboundReplyPartnerTally
Outbound test results tallied per reply partner peer.
protected static final Map<Hash,Long>
TunnelPeerSelector._peerCooldowns
Shared cooldown map across all peer selectors.
private final Map<Hash, TunnelPoolManager.DelayedPoolCleanup>
TunnelPoolManager._pendingCleanups
Pending delayed cleanups for pool removal.
private final Map<Hash, TunnelPoolManager.ConditionalOutboundStartup>
TunnelPoolManager._pendingOutboundStartups
Pending delayed outbound pool startups, keyed by destination hash.
protected static final Map<Hash,Long>
TunnelPeerSelector._provenResponders
Peers whose most recent tunnel participation succeeded, mapped to the time of that success.
protected final Map<Hash,String>
ExcluderBase._reasons
Maps peer hash to the reason it was excluded, for diagnostic logging.
private final LHMCache<Hash,Long>
ParticipatingThrottler._recentLookups
Router hashes looked up recently, with the time.
private static final Comparator<Map.Entry<Hash, GhostPeerManager.GhostMark>>
GhostPeerManager.BY_EXPIRY
Eviction order by expiry ascending: expired marks sort first (oldest expiry first, so they go in the order they lapsed), followed by active marks nearest to lapsing.
private final ObjectCounter<Hash>
ParticipatingThrottler.counter
How many tunnels each router participates in.
private final ObjectCounter<Hash>
RequestThrottler.counter
Build requests counted per peer.
(package private) Set<Hash>
ClientPeerSelector.SelectionExclusions.exclude
Peers explicitly excluded from the selection.
(package private) final Set<Hash>
ClientPeerSelector.SelectionExclusions.firstHopCooldowns
Fresh shared-cooldown peers, first-hop-only filter (null when cooldowns are in the base exclude set).
(package private) final Set<Hash>
ClientPeerSelector.SelectionExclusions.firstPeerExclusions
Peers to skip at the first hop.
private static final Comparator<Hash>
TunnelPeerSelector.HASH_BASE64_COMPARATOR
Orders peers by base64 hash for stable selection.
private final Map<Hash, AtomicIntegerArray>
RequestThrottler.BurstWindowCounter.peerBuckets
Per-peer request counts by bucket.
protected final Set<Hash>
ExcluderBase.s
The underlying set of excluded hashes.
Methods in net.i2p.router.tunnel.pool that return Hash
Modifier and Type
Method
Description
static Hash
BuildRequestor.getBuildRequestPeer(PooledTunnelCreatorConfig cfg)
The peer that will receive the tunnel build request (TBM): the gateway (peer 0) for inbound tunnels, or the next hop (peer 1) for outbound tunnels.
private Hash
IdleTunnelMonitor.getPeerHash(HopConfig tunnel)
The peer hash for a tunnel - this is the "entry point" peer who first introduced this tunnel to us (IBGW or closest hop to IBGW).
private Hash
TunnelPool.localHop(TunnelInfo t)
The peer whose transport session this tunnel sends through, or null when there is none.
Methods in net.i2p.router.tunnel.pool that return types with arguments of type Hash
Modifier and Type
Method
Description
private List<Hash>
ClientPeerSelector.applyShortfallFallbacks(TunnelPoolSettings settings, List<Hash> rv, int length, ClientPeerSelector.SelectionParams params, ClientPeerSelector.SelectionExclusions ex)
Progressive fallbacks when the selected peers are short of the requested length.
private Set<Hash>
ClientPeerSelector.buildLastHopExclude(ClientPeerSelector.SelectionParams params, Set<Hash> exclude)
Build the last-hop exclusion set: closest-hop wrapped for inbound, OBEP wrapped for outbound.
private Set<Hash>
ClientPeerSelector.buildSoftFallbackExclude(Set<Hash> exclude, ClientPeerSelector.SelectionExclusions ex)
Builds the soft-fallback exclusion set: a copy of the first-hop exclusion set without no-signal-excluded peers that have proven track records (tunnel acceptance > 50% and at least one successful test), giving them a chance when all standard tiers fail.
(package private) static Map<Hash,int[]>
BuildExecutor.collectPairTargets(List<TunnelPool> pools)
Collect per-direction build quantity targets for paired destinations, used by the proportional per-direction cap in calculatePairedBuilds().
private List<Hash>
TunnelPool.collectPeerForPriorityTest(List<Hash> peersToTest, Hash peer, int peersInTunnel, long startupTime)
Collect a peer for priority testing, capped at 3 distinct peers.
private Set<Hash>
TunnelPool.collectPublishedGateways(LeaseSet publishedLS)
Gateway hashes already used by the published lease set.
(package private) List<Hash>
ClientPeerSelector.filterBannedPeers(List<Hash> peers)
Drop banlisted peers from a selection so builds do not dispatch requests that BuildHandler will reject with "Next peer is banned".
(package private) List<Hash>
ClientPeerSelector.filterByReliability(Set<Hash> candidates, Set<Hash> exclude)
Filter candidates through the reliability gate: a peer must have an adequate acceptance ratio and at least one recent activity or connection signal to remain.
(package private) List<Hash>
ClientPeerSelector.filterGhostPeers(List<Hash> peers)
Filter out ghost peers from the selected peer list.
(package private) List<Hash>
ClientPeerSelector.finalizeSelection(TunnelPoolSettings settings, List<Hash> rv, boolean isInbound)
Insert self, ghost-filter, strategy post-processing, duplicate re-check, and cooldowns.
private List<Hash>
TunnelPool.findReusableTunnel(int len, long now, long cooldownCutoff)
Try to reuse an existing tunnel of the right length that is expiring soon, so its peers carry into the new build.
private Set<Hash>
ClientPeerSelector.findUnreliable(List<Hash> hops, long now)
The selected hops that fail the reliability gate.
protected Set<Hash>
TunnelPeerSelector.getClosestHopExclude(boolean isInbound, Set<Hash> toAdd)
Pick peers that we want to avoid for the first OB hop or last IB hop.
protected Set<Hash>
TunnelPeerSelector.getExclude(boolean isInbound, boolean isExploratory)
Create the exclusion set for this pool, for passing to ProfileOrganizer.
Map<Hash, TunnelPool>
TunnelPoolManager.getInboundClientPools()
For TunnelRenderer in router console.
Map<Hash, TunnelPool>
TunnelPoolManager.getOutboundClientPools()
For TunnelRenderer in router console.
protected static Set<Hash>
TunnelPeerSelector.getPeersInAllPools(RouterContext ctx)
All non-self peers in active tunnels across ALL pools (client IB/OB + exploratory IB/OB).
protected static Set<Hash>
TunnelPeerSelector.getPeersInPool(RouterContext ctx, TunnelPool pool)
All non-self peers in active tunnels of the given pool.
Iterator<Hash>
ExcluderBase.iterator()
An iterator over the underlying set.
private static List<Hash>
TunnelPool.peersEndpointFirst(TunnelInfo ti)
The tunnel's peers, endpoint first, the order selectPeers() returns them in.
private Set<Hash>
ClientPeerSelector.positionalConflicts(List<Hash> nonSelf, boolean isInbound, Hash dest, long now)
Selected hops whose placement would give a single peer concurrent entry and exit visibility across this destination's pools — the pairing that enables traffic correlation.
private List<Hash>
ClientPeerSelector.provenCandidates(Set<Hash> excludePeers)
Fresh proven responders, freshest first, filtered for basic eligibility: not us, not banlisted, not on selection cooldown, with a locally cached RouterInfo so a build can reach them, and not already active in the destination's pools (a swap must never introduce a per-pool duplicate).
protected List<Hash>
TunnelPeerSelector.regeneratePeers(TunnelPoolSettings settings, List<Hash> peers, int attempt)
Regenerate tunnel peers to avoid duplicate sequence.
(package private) static Map<Hash,long[]>
TestJob.replyPartnerMemory(boolean inbound)
The per-context tally of reply partners, holding for each one the number of rounds it carried and the time it was last blamed.
protected List<Hash>
TunnelPeerSelector.selectExplicit(TunnelPoolSettings settings, int length)
For debugging, also possibly for restricted routes.
private List<Hash>
ClientPeerSelector.selectHops(TunnelPoolSettings settings, int length, ClientPeerSelector.SelectionParams params, ClientPeerSelector.SelectionExclusions ex)
Single-hop or multi-hop selection for one tunnel length.
private List<Hash>
ClientPeerSelector.selectHopsWithRetry(TunnelPoolSettings settings, int length, ClientPeerSelector.SelectionParams params, ClientPeerSelector.SelectionExclusions ex)
Draws every hop, drops unsuitable peers (ghost and banlisted), and redraws once from a fresh exclusion set when filtering emptied the selection.
private List<Hash>
ClientPeerSelector.selectMultiHop(TunnelPoolSettings settings, int length, ClientPeerSelector.SelectionParams params, ClientPeerSelector.SelectionExclusions ex, ArraySet<Hash> matches)
Select all hops of a multi-hop tunnel: last hop, middle hops, then first hop.
List<Hash>
ClientPeerSelector.selectPeers(TunnelPoolSettings settings)
Returns ENDPOINT FIRST, GATEWAY LAST!!!! In: us ..
List<Hash>
ClientPeerSelector.selectPeers(TunnelPoolSettings settings, Set<Hash> excludeFirstHops)
Select peers for a new tunnel, excluding given peers from first-hop selection.
List<Hash>
ExploratoryPeerSelector.selectPeers(TunnelPoolSettings settings)
Returns ENDPOINT FIRST, GATEWAY LAST!!!! In: us ..
abstract List<Hash>
TunnelPeerSelector.selectPeers(TunnelPoolSettings settings)
Which peers should go into the next tunnel for the given settings?
List<Hash>
TunnelPeerSelector.selectPeers(TunnelPoolSettings settings, Set<Hash> excludeFirstHops)
Select peers for a new tunnel, with an optional set of first-hop peers to exclude from selection.
private List<Hash>
ClientPeerSelector.selectPeersBase(TunnelPoolSettings settings)
Select peers for a new tunnel.
private List<Hash>
ExploratoryPeerSelector.selectPeersInternal(TunnelPoolSettings settings, int length, boolean includeCooldowns)
The actual peer selection, shared between the normal path and the cooldown-bypass retry in ExploratoryPeerSelector.selectPeers(TunnelPoolSettings).
private List<Hash>
ExploratoryPeerSelector.selectPeersInternal(TunnelPoolSettings settings, int length, boolean includeCooldowns, Set<Hash> alsoExclude)
Select peers, additionally excluding a set the caller has decided on.
Set<Hash>
TunnelPoolManager.selectPeersInTooManyTunnels()
For reliability reasons, don't allow a peer in more than x% of client and exploratory tunnels.
private List<Hash>
ClientPeerSelector.selectSingleHop(TunnelPoolSettings settings, int length, ClientPeerSelector.SelectionParams params, ClientPeerSelector.SelectionExclusions ex, ArraySet<Hash> matches)
Select the single hop of a 1-hop tunnel (with hidden-inbound special case).
Methods in net.i2p.router.tunnel.pool with parameters of type Hash
Modifier and Type
Method
Description
private void
ParticipatingThrottler._logHighRequestCount(Hash h, String caps, int count, int limit)
Logs warnings for high count tunnel request rejections.
boolean
ExcluderBase.add(Hash h)
Add the hash to the underlying set.
protected boolean
TunnelPeerSelector.allowAsIBGW(Hash h)
Should we allow as IBGW? This just checks for the "R" capability and IPv4 support.
protected boolean
TunnelPeerSelector.allowAsOBEP(Hash h)
Should we allow as OBEP? This just checks for IPv4 support.
(package private) static void
TunnelPeerSelector.applyProbeFailure(RouterContext ctx, Hash peer)
Act on a pre-connect probe that could not be delivered.
(package private) static boolean
BuildHandler.attachLookupKey(ConcurrentHashMap<Hash, AtomicInteger> inFlight, Hash key, int limit)
Attach a build request's next hop to the in-flight lookup set.
private void
TunnelPool.blameSinglePeer(TunnelInfo cfg, Hash blamePeer)
Apply the whole failure penalty to one peer: profile failure, the selection cooldown, tier demotion, and a priority retest so a persistently failing hop is not re-selected on the next generation.
private void
TunnelPoolManager.cancelPendingOutboundStartup(Hash destination)
Cancel any pending outbound startup event for the destination.
boolean
ConnectChecker.canConnect(Hash from, Hash to)
Can "from" connect to "to" based on published addresses?
private boolean
ParticipatingThrottler.checkLowShareAndVersion(String version, boolean isLU, boolean shouldBlockOldRouters, Hash h, boolean shouldDisconnect, boolean isBanned, String caps, int bantime, RouterInfo ri)
Checks if a low-share, old-version router should be banned and disconnected.
private boolean
ParticipatingThrottler.checkUnreachableAndOld(String version, boolean isUnreachable, boolean isFast, boolean shouldBlockOldRouters, Hash h, boolean shouldDisconnect, boolean isBanned, String caps)
Checks if an unreachable and old router should be banned or ignored.
private boolean
ParticipatingThrottler.checkVersionAndCompressibility(String version, boolean isCompressible, boolean shouldDisconnect, Hash h, boolean isBanned, String caps, RouterInfo ri)
Checks router version and compressibility of RouterInfo to decide on banning.
void
GhostPeerManager.clearGhost(Hash peer)
Clear ghost status for a peer (manual intervention).
private List<Hash>
TunnelPool.collectPeerForPriorityTest(List<Hash> peersToTest, Hash peer, int peersInTunnel, long startupTime)
Collect a peer for priority testing, capped at 3 distinct peers.
int
TunnelPeerSelector.HashComparator.compare(Hash l, Hash r)
Compare the two hashes by SipHash distance.
(package private) static int
ClientPeerSelector.compareExcluded(Hash p1, Hash p2, Set<Hash> exclude)
Excluded peers sort last; two excluded peers compare equal.
(package private) static int
ClientPeerSelector.compareQuality(Hash p1, Hash p2, Set<Hash> exclude, PeerProfile prof1, PeerProfile prof2, Map<Hash,Long> proven, long now, long thirtyMinutes)
Full quality comparison cascade.
private void
TunnelPool.countSessionLossCause(Hash hop)
Attribute one zombie exclusion to this router or to the peer, and count it.
Job
BuildHandler.TunnelBuildMessageHandlerJobBuilder.createJob(I2NPMessage receivedMessage, RouterIdentity from, Hash fromHash)
Either from or fromHash may be null, but both should be null only if we're to be a IBGW and it came from us as a OBEP.
Job
BuildHandler.TunnelBuildReplyMessageHandlerJobBuilder.createJob(I2NPMessage receivedMessage, RouterIdentity from, Hash fromHash)

static void
BuildMessageGenerator.createRecord(int recordNum, int hop, TunnelBuildMessage msg, TunnelCreatorConfig cfg, Hash replyRouter, long replyTunnel, RouterContext ctx, PublicKey peerKey, Properties props)
Place the asymmetrically encrypted record in the specified record slot, containing the hop's configuration (as well as the reply info, if it is an outbound endpoint).
private static BuildRequestRecord
BuildMessageGenerator.createUnencryptedRecord(I2PAppContext ctx, TunnelCreatorConfig cfg, int hop, Hash replyRouter, long replyTunnel, boolean isEC, boolean isShort, Properties props)
Create an unencrypted build request record for a tunnel hop.
BuildRequestRecord
BuildMessageProcessor.decrypt(TunnelBuildMessage msg, Hash ourHash, PrivateKey privKey)
Decrypt the record targeting us, encrypting all of the other records with the included reply key and IV.
private void
BuildExecutor.didNotReply(long tunnel, Hash peer)
Log that a peer did not reply to a tunnel build request.
private void
TunnelPoolManager.doRemoveTunnels(Hash destination)
Actually perform pool removal.
int
TunnelPoolManager.ensurePoolsFor(Hash client)
Nudge both of a local client's pools to run their ensure logic.
private ParticipatingThrottler.Result
ParticipatingThrottler.evaluateThrottleConditions(int count, int limit, boolean shouldThrottle, boolean isFast, boolean isLowShare, boolean isUnreachable, Hash h, String caps, boolean isBanned, int bantime, RouterInfo ri, boolean countRequest)
Evaluates whether to accept, reject, or drop tunnel requests based on probabilistic rejection curve modulated by system load.
void
TunnelPoolManager.fail(Hash peer)
Fail all outbound tunnels with this peer as first hop, and all inbound tunnels with this peer as the last hop, because we can't contact it any more.
private void
TunnelPoolManager.failTunnelsWithFirstHop(TunnelPool pool, Hash peer)
Fail all (outbound) tunnels with this peer as first hop (not counting us).
private void
TunnelPoolManager.failTunnelsWithLastHop(TunnelPool pool, Hash peer)
Fail all (inbound) tunnels with this peer as last hop (not counting us).
private TunnelInfo
TunnelPool.findClosestTunnel(Hash closestTo, boolean avoidZeroHop, long now)
Find the non-failed tunnel XOR-closest to the target, so OBEP-IBGW connections keep some locality network-wide.
private static int
ClientPeerSelector.firstHopIndex(List<Hash> rv, Hash firstHop)
Index at which a missing middle hop must be inserted: just before the vetted first hop, or at the end when there is none yet.
void
TunnelPoolManager.forceRemoveTunnels(Hash destination)
Force immediate removal of a pool - used for router shutdown.
(package private) int
RequestThrottler.BurstWindowCounter.getCount(Hash h)
Window total for the peer without recording a request.
(package private) int
RequestThrottler.BurstWindowCounter.getCurrentBucketCount(Hash h)
Count in the current bucket only, not the whole window.
private String
TunnelPeerSelector.getExclusionReason(Hash peerHash, boolean isInbound, boolean isExploratory, double buildSuccess, long activityWindow)
Check if a peer should be excluded from closest hop selection.
private int
BuildExecutor.getFirstHopFailureCount(Hash hash)
Get the recent first-hop failure count for a peer (for logging).
private String
TunnelPeerSelector.getHardExclusionReason(Hash peerHash, boolean isInbound, boolean isExploratory, double buildSuccess)
Hard exclusion reasons only — skips the no-signal (pre-qualification) check.
int
TunnelPoolManager.getInboundClientTunnelCount(Hash destination)
Use to verify a tunnel pool is alive.
TunnelPool
TunnelPoolManager.getInboundPool(Hash client)
The client's inbound pool, creating it if needed.
TunnelPoolSettings
TunnelPoolManager.getInboundSettings(Hash client)
Get settings for a client's inbound tunnel pool.
private String
BuildHandler.getIPPortFromHash(Hash h)
Extract IP:port from RouterInfo for a peer hash.
int
TunnelPoolManager.getOutboundClientTunnelCount(Hash destination)
Use to verify a tunnel pool is alive.
TunnelPool
TunnelPoolManager.getOutboundPool(Hash client)
The client's outbound pool, creating it if needed.
TunnelPoolSettings
TunnelPoolManager.getOutboundSettings(Hash client)
Get settings for a client's outbound tunnel pool.
int
TunnelPoolManager.getUsableInboundClientTunnelCount(Hash destination)
Get USABLE inbound client tunnel count for a specific destination.
int
TunnelPoolManager.getUsableOutboundClientTunnelCount(Hash destination)
Get USABLE outbound client tunnel count for a specific destination.
private void
ParticipatingThrottler.handleExcessiveRequests(Hash h, String caps, int count, int limit, int bantime, RouterInfo ri)
Handles excessive tunnel request counts by banning and scheduling disconnect.
private void
ParticipatingThrottler.handleNoVersion(boolean shouldDisconnect, Hash h, boolean isBanned, String caps, RouterInfo ri, String version)
Handles joins from routers whose held RouterInfo carries no version.
private void
BuildHandler.handleReq(RouterInfo nextPeerInfo, BuildHandler.BuildMessageState state, BuildRequestRecord req, Hash nextPeer)
Actually process the request and send the reply.
private boolean
BuildExecutor.hasRecentlyFailedAsFirstHop(Hash hash)
Check whether a peer has recently failed as a first hop more than BuildExecutor._firstHopFailureThreshold times within the cooldown window.
protected static boolean
TunnelPeerSelector.hasRecoveredFromFailure(RouterContext ctx, Hash peer)
Check if a peer has recovered from failure and can be reconsidered.
protected static boolean
TunnelPeerSelector.hasValidTransportAddress(RouterContext ctx, Hash peer)
Check if a peer's RouterInfo has at least one reachable SSU or NTCP address.
(package private) int
RequestThrottler.BurstWindowCounter.increment(Hash h)
Record one request from the peer and return the fresh window total.
private static int
BuildExecutor.indexOfPeer(PooledTunnelCreatorConfig cfg, Hash peer)
Zero-based position of peer in the build path, or -1 when absent.
(package private) boolean
RequestThrottler.BurstWindowCounter.isBursting(Hash h, int normalLimit)
Whether the peer's window total exceeds a burst limit derived from its normal limit (clamped between the min and max).
static boolean
TunnelPeerSelector.isFirstHopFailing(RouterContext ctx, Hash peer)
Check if a peer recently failed as first hop and should be excluded.
boolean
GhostPeerManager.isGhost(Hash peer)
Check if a peer should be excluded from tunnel selection.
protected static boolean
TunnelPeerSelector.isLowAcceptanceRatio(RouterContext ctx, Hash peer)
Check if a peer has a history of rejecting tunnel build requests.
(package private) static boolean
TunnelPoolManager.FastTierProbeJob.isRecentlyActive(RouterContext ctx, Hash peer, long now)
Whether this peer has traffic recent enough that probing adds nothing.
(package private) static boolean
TunnelPeerSelector.isStalePeer(RouterContext ctx, Hash peer)
Check whether a peer is stale — no contact (heard from or heard about) within the dynamic activity window.
(package private) static boolean
TunnelPeerSelector.isStalePeer(RouterContext ctx, Hash peer, double buildSuccess)
Check whether a peer is stale — no contact (heard from or heard about) within the dynamic activity window.
boolean
TunnelPoolManager.isValidTunnel(Hash client, TunnelInfo tunnel)
Check if a tunnel is valid and belongs to the client's pool.
private void
ClientPeerSelector.logAcceptedFirstHopTier(RouterContext ctx, Hash firstHop, int tier, int attempt, int attempts, int remaining, double buildSuccess)
Log the quality tier that actually produced this build's first hop.
private void
GhostPeerManager.logGhostMarkLocked(Hash peer, boolean underAttack, long cooldownMs, int offenses, long now)
Debug detail plus the once-per-minute warn summary.
private void
TunnelPool.logPeerBlame(Hash peer, int pct, long uptime, long startupTime, int consecutiveFailures)
Log the blame assignment for a peer, gated on startup being complete, warn logging being enabled and an active failure streak.
private static RouterInfo
TunnelPeerSelector.lookupRouterInfoUnvalidated(RouterContext ctx, Hash peer)
Fetch a peer RouterInfo for a message we address to it, preferring the unvalidated store lookup.
(package private) static String
TunnelPoolManager.noPoolLine(boolean inbound, Hash destination)
The entry for a destination with no client pool of the given direction, so a null return from the selector carries a reason in the log.
(package private) static void
TunnelPeerSelector.noteFirstHopRtt(RouterContext ctx, Hash peer, Transport transport)
Extract the transport's measured direct-link RTT and record it on the peer.
private Set<Hash>
ClientPeerSelector.positionalConflicts(List<Hash> nonSelf, boolean isInbound, Hash dest, long now)
Selected hops whose placement would give a single peer concurrent entry and exit visibility across this destination's pools — the pairing that enables traffic correlation.
(package private) static boolean
BuildRequestor.preConnectFallback(RouterContext ctx, Hash peer, PooledTunnelCreatorConfig cfg, BuildExecutor exec)
Approach 2: Fire-and-forget fallback — attempt to establish the transport session and retry the build once.
protected static TunnelPeerSelector.PreConnectOutcome
TunnelPeerSelector.preConnectTo(RouterContext ctx, Hash peer)
Send a DatabaseLookupMessage to a peer so it answers with our RouterInfo, which forces a full session handshake rather than the empty DataMessage that would leave the peer with nothing to reply to.
protected void
ExcluderBase.recordExclusion(Hash h, String reason)
Record why a peer was excluded, for diagnostic logging.
protected static void
TunnelPeerSelector.recordFirstHopFail(RouterContext ctx, Hash peer)
Record that a peer failed as first hop (first hop unreachable).
private void
BuildExecutor.recordFirstHopFailure(Hash hash)
Record a first-hop failure for a given peer hash.
(package private) static void
ClientPeerSelector.recordPreConnect(Hash peer, long time)
Records that preConnectTo was called for the peer at the given time.
void
GhostPeerManager.recordSuccess(Hash peer)
Record successful tunnel participation by a peer.
void
GhostPeerManager.recordTimeout(Hash peer)
Record that a peer timed out during tunnel build.
(package private) static void
BuildHandler.releaseLookupKey(ConcurrentHashMap<Hash, AtomicInteger> inFlight, Hash key)
Release one build request's attachment to an in-flight lookup key, dropping the key entry once its last waiting request completes so released slots become visible to new arrivals.
void
TunnelPoolManager.removeTunnels(Hash destination)
This will be called twice, once by the inbound and once by the outbound pool.
private void
BuildHandler.scheduleLookupDeadline(BuildHandler.BuildMessageState state, Hash nextPeer, AtomicBoolean decremented, int attempts)
Schedule an independent deadline that releases this request's lookup attachment if neither callback has done so by then.
private void
ParticipatingThrottler.scheduleRouterLookup(Hash h)
Rate-limited background resolution for transit peers missing from our local netDb, so throttler decisions graduate from count-only to full classification without blocking or hammering the netdb.
TunnelInfo
TunnelPoolManager.selectInboundExploratoryTunnel(Hash closestTo)
Pick the inbound exploratory tunnel with the gateway closest to the given hash.
TunnelInfo
TunnelPoolManager.selectInboundTunnel(Hash destination)
Pick a random inbound tunnel from the given destination's pool.
TunnelInfo
TunnelPoolManager.selectInboundTunnel(Hash destination, Hash closestTo)
Pick the inbound tunnel with the gateway closest to the given hash from the given destination's pool.
TunnelInfo
TunnelPoolManager.selectInboundTunnelForTest(Hash destination)
Pick a tunnel from a destination's inbound pool to carry a test round's reply, preferring partners that have demonstrated they work.
TunnelInfo
TunnelPoolManager.selectOutboundExploratoryTunnel(Hash closestTo)
Pick the outbound exploratory tunnel with the endpoint closest to the given hash.
TunnelInfo
TunnelPoolManager.selectOutboundTunnel(Hash destination)
Pick a random outbound tunnel from the given destination's pool.
TunnelInfo
TunnelPoolManager.selectOutboundTunnel(Hash destination, Hash closestTo)
Pick the outbound tunnel with the endpoint closest to the given hash from the given destination's pool.
TunnelInfo
TunnelPoolManager.selectOutboundTunnelForTest(Hash destination)
Pick a tunnel from a destination's outbound pool to carry a test round's outbound leg, preferring partners that have demonstrated they work.
(package private) TunnelInfo
AliasedTunnelPool.selectTunnel(Hash closestTo)

(package private) TunnelInfo
TunnelPool.selectTunnel(Hash closestTo)
Return the tunnel from the pool that is XOR-closest to the target.
void
TunnelPoolManager.setInboundSettings(Hash client, TunnelPoolSettings settings)
Set settings for a client's inbound tunnel pool.
void
TunnelPoolManager.setOutboundSettings(Hash client, TunnelPoolSettings settings)
Set settings for a client's outbound tunnel pool.
private static void
TunnelPoolManager.setSettings(Map<Hash, TunnelPool> pools, Hash client, TunnelPoolSettings settings)
Applies settings to one client's pools.
(package private) boolean
BuildExecutor.shouldChargeGhostMark(PooledTunnelCreatorConfig cfg, Hash contacted)
Whether an expired build's contacted hop should be charged a ghost mark.
(package private) static boolean
ClientPeerSelector.shouldPreConnect(RouterContext ctx, Hash peer)
Determines whether preConnectTo() should be called for a first-hop candidate.
(package private) ParticipatingThrottler.Result
ParticipatingThrottler.shouldThrottle(Hash h)
Determines whether to throttle tunnel participation for the given router, counting the request against the peer's limit.
(package private) ParticipatingThrottler.Result
ParticipatingThrottler.shouldThrottle(Hash h, boolean countRequest)
Determines whether to throttle tunnel participation for the given router.
(package private) boolean
RequestThrottler.shouldThrottle(Hash h)
Checks if the given router's tunnel requests should be throttled.
protected static boolean
TunnelPeerSelector.supportsNTCP2(RouterContext ctx, Hash peer)
Check if a peer supports NTCP2 transport.
(package private) static void
ClientPeerSelector.trimToAcceptedFirstHop(ArraySet<Hash> matches, Hash accepted)
Reduce a first-hop candidate batch to the single peer the quality loop accepted.
(package private) void
AliasedTunnelPool.tunnelFailed(TunnelInfo cfg, Hash blamePeer)

(package private) void
TunnelPool.tunnelFailed(TunnelInfo cfg, Hash blamePeer)
Remove the tunnel and blame only one peer.
private static boolean
ClientPeerSelector.wasRecentlyConnected(RouterContext ctx, Hash peer)
Check whether the peer was connected within the cooldown window.
Method parameters in net.i2p.router.tunnel.pool with type arguments of type Hash
Modifier and Type
Method
Description
boolean
ExcluderBase.addAll(Collection<? extends Hash> c)
Add all of the hashes to the underlying set.
protected static int
TunnelPeerSelector.addFreshCooldownExclusions(Map<Hash,Long> cooldowns, long cutoff, Set<Hash> exclude)
Add cooldown entries still inside their window (value > cutoff) to the exclusion set without mutating the map.
protected static int
TunnelPeerSelector.addFreshCooldownExclusions(Map<Hash,Long> cooldowns, long cutoff, Set<Hash> exclude)
Add cooldown entries still inside their window (value > cutoff) to the exclusion set without mutating the map.
private List<Hash>
ClientPeerSelector.applyShortfallFallbacks(TunnelPoolSettings settings, List<Hash> rv, int length, ClientPeerSelector.SelectionParams params, ClientPeerSelector.SelectionExclusions ex)
Progressive fallbacks when the selected peers are short of the requested length.
(package private) static boolean
BuildHandler.attachLookupKey(ConcurrentHashMap<Hash, AtomicInteger> inFlight, Hash key, int limit)
Attach a build request's next hop to the in-flight lookup set.
private Set<Hash>
ClientPeerSelector.buildLastHopExclude(ClientPeerSelector.SelectionParams params, Set<Hash> exclude)
Build the last-hop exclusion set: closest-hop wrapped for inbound, OBEP wrapped for outbound.
private Set<Hash>
ClientPeerSelector.buildSoftFallbackExclude(Set<Hash> exclude, ClientPeerSelector.SelectionExclusions ex)
Builds the soft-fallback exclusion set: a copy of the first-hop exclusion set without no-signal-excluded peers that have proven track records (tunnel acceptance > 50% and at least one successful test), giving them a chance when all standard tiers fail.
protected boolean
TunnelPeerSelector.checkTunnel(boolean isInbound, boolean isExploratory, List<Hash> tunnel)
Connectivity check.
private boolean
TunnelPeerSelector.checkTunnel(List<Hash> tunnel)
Connectivity check.
private int
ClientPeerSelector.collectActive(List<Hash> rv, int min, ClientPeerSelector.SelectionExclusions ex)
Pulls connected peers, which are not reachable through the profile tier cascade at all: a peer with an established transport session but no usable profile still builds fast.
private int
ClientPeerSelector.collectFromTier(List<Hash> rv, int min, ClientPeerSelector.SelectionParams params, ClientPeerSelector.SelectionExclusions ex)
One cascading tier selection.
private List<TunnelInfo>
TunnelPool.collectNonPublishedTunnels(Set<Hash> publishedGateways, int latencyThreshold, long now)
Scan for GOOD tunnels not included in the published LeaseSet.
private List<Hash>
TunnelPool.collectPeerForPriorityTest(List<Hash> peersToTest, Hash peer, int peersInTunnel, long startupTime)
Collect a peer for priority testing, capped at 3 distinct peers.
(package private) static int
ClientPeerSelector.compareExcluded(Hash p1, Hash p2, Set<Hash> exclude)
Excluded peers sort last; two excluded peers compare equal.
(package private) static int
ClientPeerSelector.compareQuality(Hash p1, Hash p2, Set<Hash> exclude, PeerProfile prof1, PeerProfile prof2, Map<Hash,Long> proven, long now, long thirtyMinutes)
Full quality comparison cascade.
(package private) static int
ClientPeerSelector.compareQuality(Hash p1, Hash p2, Set<Hash> exclude, PeerProfile prof1, PeerProfile prof2, Map<Hash,Long> proven, long now, long thirtyMinutes)
Full quality comparison cascade.
(package private) PooledTunnelCreatorConfig
TunnelPool.configureNewTunnel(boolean forceZeroHop, Set<Hash> excludeFirstHops)
Configure a new tunnel, optionally excluding peers from first-hop selection.
private int
TunnelPoolManager.countTunnelsPerPeer(ObjectCounterUnsafe<Hash> lc, boolean exploratory)
Count tunnels and peers separately for exploratory or client pools.
private PooledTunnelCreatorConfig
TunnelPool.createConfig(TunnelPoolSettings settings, List<Hash> peers, long now, long expiration)
Build the config with the given peers, endpoint first.
(package private) static boolean
TunnelPeerSelector.dropUnreliable(List<Hash> hops, Set<Hash> unreliable, int minKeep)
Remove unreliable hops while at least minKeep remain.
(package private) static boolean
TunnelPeerSelector.dropUnreliable(List<Hash> hops, Set<Hash> unreliable, int minKeep)
Remove unreliable hops while at least minKeep remain.
private int
ClientPeerSelector.fillRemainingHops(List<Hash> rv, int min, ClientPeerSelector.SelectionParams params, ClientPeerSelector.SelectionExclusions ex)
Tops rv up to min hops from the tier ladder, inserting new middle hops before the vetted first hop so rv keeps its [endpoint ..
(package private) List<Hash>
ClientPeerSelector.filterBannedPeers(List<Hash> peers)
Drop banlisted peers from a selection so builds do not dispatch requests that BuildHandler will reject with "Next peer is banned".
(package private) List<Hash>
ClientPeerSelector.filterByReliability(Set<Hash> candidates, Set<Hash> exclude)
Filter candidates through the reliability gate: a peer must have an adequate acceptance ratio and at least one recent activity or connection signal to remain.
(package private) List<Hash>
ClientPeerSelector.filterGhostPeers(List<Hash> peers)
Filter out ghost peers from the selected peer list.
(package private) List<Hash>
ClientPeerSelector.finalizeSelection(TunnelPoolSettings settings, List<Hash> rv, boolean isInbound)
Insert self, ghost-filter, strategy post-processing, duplicate re-check, and cooldowns.
private Set<Hash>
ClientPeerSelector.findUnreliable(List<Hash> hops, long now)
The selected hops that fail the reliability gate.
private static int
ClientPeerSelector.firstHopIndex(List<Hash> rv, Hash firstHop)
Index at which a missing middle hop must be inserted: just before the vetted first hop, or at the end when there is none yet.
protected static String
TunnelPeerSelector.formatExcludedPeers(Set<Hash> peers)
Format a set of excluded peers for logging, with exclusion reasons when the set is an TunnelPeerSelector.Excluder or ExcluderBase.
private static String
ClientPeerSelector.formatPeerList(List<Hash> peers)
Formats a peer list for the log.
protected Set<Hash>
TunnelPeerSelector.getClosestHopExclude(boolean isInbound, Set<Hash> toAdd)
Pick peers that we want to avoid for the first OB hop or last IB hop.
private boolean
TunnelPool.hasAllPeerRIs(List<Hash> peers)
Whether every non-self peer in the list still has a RouterInfo cached locally.
private boolean
TunnelPool.hasPeerOnCooldown(List<Hash> peers, long cooldownCutoff)
Whether any non-self peer in the list is on cooldown.
(package private) static int
ClientPeerSelector.insertNewPeers(List<Hash> rv, int index, Collection<Hash> picked, int need)
Adds up to need peers from picked that are not already in rv, inserting them at index so the surrounding order is untouched.
(package private) static int
ClientPeerSelector.insertNewPeers(List<Hash> rv, int index, Collection<Hash> picked, int need)
Adds up to need peers from picked that are not already in rv, inserting them at index so the surrounding order is untouched.
protected boolean
TunnelPeerSelector.isDuplicateSequence(TunnelPoolSettings settings, List<Hash> newPeers)
Check if the selected peer sequence matches an existing tunnel in the pool.
private boolean
TunnelPool.isPruneCandidate(TunnelInfo t, Set<Hash> publishedGateways, long now, int latencyThreshold)
Whether the tunnel should be pruned: near expiry or slower than the latency threshold, not fresh, not UNTESTED, and not published in the current LeaseSet.
private void
TunnelPool.logConfigDebug(PooledTunnelCreatorConfig cfg, List<Hash> peers)
Logs a new tunnel's config and peers at debug level.
(package private) static boolean
TunnelPeerSelector.matchesExistingTunnel(TunnelInfo existing, List<Hash> newPeers, boolean isInbound)
Compare a newly selected peer sequence (excluding self) against one existing tunnel.
(package private) static void
TestJob.noteReplyPartnerRound(Map<Hash,long[]> tally, TunnelInfo replyPartner, boolean failed)
Record one round against its reply partner: the use always, the failure only when the round failed.
protected void
TunnelPeerSelector.orderPeers(List<Hash> rv, SessionKey key)
Order peers using the given key.
private Set<Hash>
ClientPeerSelector.positionalConflicts(List<Hash> nonSelf, boolean isInbound, Hash dest, long now)
Selected hops whose placement would give a single peer concurrent entry and exit visibility across this destination's pools — the pairing that enables traffic correlation.
(package private) static int
TunnelPeerSelector.preferProven(List<Hash> hops, int from, int to, Map<Hash,Long> proof, long now, long window, Iterator<Hash> replacements)
Replace hops lacking fresh proof with proven replacements, in order.
(package private) static int
TunnelPeerSelector.preferProven(List<Hash> hops, int from, int to, Map<Hash,Long> proof, long now, long window, Iterator<Hash> replacements)
Replace hops lacking fresh proof with proven replacements, in order.
(package private) static int
TunnelPeerSelector.preferProven(List<Hash> hops, int from, int to, Map<Hash,Long> proof, long now, long window, Iterator<Hash> replacements)
Replace hops lacking fresh proof with proven replacements, in order.
private List<Hash>
ClientPeerSelector.provenCandidates(Set<Hash> excludePeers)
Fresh proven responders, freshest first, filtered for basic eligibility: not us, not banlisted, not on selection cooldown, with a locally cached RouterInfo so a build can reach them, and not already active in the destination's pools (a swap must never introduce a per-pool duplicate).
private static void
TunnelPeerSelector.pruneEndpointCache(ConcurrentHashMap<Hash, TunnelPeerSelector.EndpointCacheEntry> cache, long now)
Prune expired entries when the cache grows too large.
(package private) static int
BuildExecutor.pruneFirstHopFailures(Map<Hash,long[]> history, long now, long cooldown, int cap)
Prune the first-hop failure history once it has outgrown its cap.
(package private) static void
TestJob.pruneReplyPartnerTally(Map<Hash,long[]> tally)
Keep the tally bounded.
(package private) static int
ClientPeerSelector.pruneStalePreConnect(ConcurrentHashMap<Hash,Long> map, long now)
Drop pre-connect records older than the cooldown window.
private void
TunnelPool.recordPeerCooldowns(List<Hash> peers, long now)
Record a diversity cooldown for every reused peer so selectPeers respects them on the next selection.
private void
ClientPeerSelector.refillFirstHop(ClientPeerSelector.SelectionParams params, SessionKey randomKey, ClientPeerSelector.SelectionExclusions ex, ArraySet<Hash> matches, boolean inStartup)
Refill the first-hop candidate batch after a quality-loop ejection.
protected List<Hash>
TunnelPeerSelector.regeneratePeers(TunnelPoolSettings settings, List<Hash> peers, int attempt)
Regenerate tunnel peers to avoid duplicate sequence.
(package private) static void
BuildHandler.releaseLookupKey(ConcurrentHashMap<Hash, AtomicInteger> inFlight, Hash key)
Release one build request's attachment to an in-flight lookup key, dropping the key entry once its last waiting request completes so released slots become visible to new arrivals.
(package private) static double
TestJob.replyPartnerFailureRate(Map<Hash,long[]> tally, TunnelInfo replyPartner)
Failure rate of a reply partner: failures divided by rounds it carried.
private void
TunnelPoolManager.schedulePeerTests(List<Hash> peers)
Schedule peers for priority testing.
private void
TunnelPool.schedulePriorityPeerTests(List<Hash> peersToTest)
Schedule the collected peers for priority testing if the peer test job is available.
private void
ClientPeerSelector.selectFirstHop(int length, ClientPeerSelector.SelectionParams params, SessionKey randomKey, ClientPeerSelector.SelectionExclusions ex, ArraySet<Hash> matches)
Select the first hop, IBGW for inbound and the closest outbound peer otherwise, with a quality loop and pre-connect.
private boolean
ClientPeerSelector.selectLastHop(TunnelPoolSettings settings, int length, ClientPeerSelector.SelectionParams params, SessionKey randomKey, Set<Hash> lastHopExclude, Set<Hash> rawExclude, ArraySet<Hash> matches)
Select the last hop (hidden-inbound closest hop, hidden-outbound OBEP, or normal OBEP).
private boolean
ClientPeerSelector.selectLastHop(TunnelPoolSettings settings, int length, ClientPeerSelector.SelectionParams params, SessionKey randomKey, Set<Hash> lastHopExclude, Set<Hash> rawExclude, ArraySet<Hash> matches)
Select the last hop (hidden-inbound closest hop, hidden-outbound OBEP, or normal OBEP).
private void
ClientPeerSelector.selectMiddleHops(int length, ClientPeerSelector.SelectionParams params, SessionKey randomKey, ClientPeerSelector.SelectionExclusions ex, ArraySet<Hash> matches, List<Hash> rv)
Select the middle hop(s) of a tunnel longer than 2 hops, subtiers 2-3, quality-ordered.
private void
ClientPeerSelector.selectMiddleHops(int length, ClientPeerSelector.SelectionParams params, SessionKey randomKey, ClientPeerSelector.SelectionExclusions ex, ArraySet<Hash> matches, List<Hash> rv)
Select the middle hop(s) of a tunnel longer than 2 hops, subtiers 2-3, quality-ordered.
private List<Hash>
ClientPeerSelector.selectMultiHop(TunnelPoolSettings settings, int length, ClientPeerSelector.SelectionParams params, ClientPeerSelector.SelectionExclusions ex, ArraySet<Hash> matches)
Select all hops of a multi-hop tunnel: last hop, middle hops, then first hop.
List<Hash>
ClientPeerSelector.selectPeers(TunnelPoolSettings settings, Set<Hash> excludeFirstHops)
Select peers for a new tunnel, excluding given peers from first-hop selection.
List<Hash>
TunnelPeerSelector.selectPeers(TunnelPoolSettings settings, Set<Hash> excludeFirstHops)
Select peers for a new tunnel, with an optional set of first-hop peers to exclude from selection.
private List<Hash>
ExploratoryPeerSelector.selectPeersInternal(TunnelPoolSettings settings, int length, boolean includeCooldowns, Set<Hash> alsoExclude)
Select peers, additionally excluding a set the caller has decided on.
private List<Hash>
ClientPeerSelector.selectSingleHop(TunnelPoolSettings settings, int length, ClientPeerSelector.SelectionParams params, ClientPeerSelector.SelectionExclusions ex, ArraySet<Hash> matches)
Select the single hop of a 1-hop tunnel (with hidden-inbound special case).
private static void
TunnelPoolManager.setSettings(Map<Hash, TunnelPool> pools, Hash client, TunnelPoolSettings settings)
Applies settings to one client's pools.
private void
ClientPeerSelector.sortByPeerQuality(List<Hash> peers, Set<Hash> exclude)
Sort peers by quality for tunnel building preference.
private void
ClientPeerSelector.sortByPeerQuality(List<Hash> peers, Set<Hash> exclude)
Sort peers by quality for tunnel building preference.
private void
ClientPeerSelector.topUpFromFastTier(ClientPeerSelector.SelectionParams params, Set<Hash> exclude, ArraySet<Hash> matches)
Add Fast-tier candidates until the batch is full, used when the first hop is widening past the HighCapacity tier it started from.
private void
ClientPeerSelector.topUpFromFastTier(ClientPeerSelector.SelectionParams params, Set<Hash> exclude, ArraySet<Hash> matches)
Add Fast-tier candidates until the batch is full, used when the first hop is widening past the HighCapacity tier it started from.
private void
ClientPeerSelector.topUpFromHighCapacityTier(ClientPeerSelector.SelectionParams params, Set<Hash> exclude, ArraySet<Hash> matches)
Add HighCapacity-tier candidates until the batch is full.
private void
ClientPeerSelector.topUpFromHighCapacityTier(ClientPeerSelector.SelectionParams params, Set<Hash> exclude, ArraySet<Hash> matches)
Add HighCapacity-tier candidates until the batch is full.
(package private) static void
ClientPeerSelector.trimToAcceptedFirstHop(ArraySet<Hash> matches, Hash accepted)
Reduce a first-hop candidate batch to the single peer the quality loop accepted.
Constructors in net.i2p.router.tunnel.pool with parameters of type Hash
Modifier
Constructor
Description
BuildMessageState(RouterContext ctx, I2NPMessage m, RouterIdentity f, Hash h)
Either f or h may be null, but both should be null only if we're to be a IBGW and it came from us as a OBEP.
ConditionalOutboundStartup(TunnelPool out, TunnelPool in, TunnelPoolManager mgr, RouterContext context, Hash dest)
Schedule a startup that is abandoned unless the pools are ready in time.
DelayedPoolCleanup(Hash dest)
Remove an unused client pool after the re-registration window expires.
Disconnector(Hash h, String version)
Force disconnect the peer on timer expiry.
Disconnector(Hash h, String version)
Prepares to disconnect one router.
(package private)
HandleReq(RouterContext ctx, BuildHandler.BuildMessageState state, BuildRequestRecord req, Hash nextPeer, AtomicBoolean decremented)
Prepares to forward one build request.
(package private)
PendingLookup(BuildHandler.BuildMessageState state, BuildRequestRecord req, Hash nextPeer)
Records a request waiting on a next-hop lookup.
PooledTunnelCreatorConfig(RouterContext ctx, int length, boolean isInbound, Hash destination, TunnelPool pool)
Creates a new instance of PooledTunnelCreatorConfig.
(package private)
PreConnectFailJob(RouterContext ctx, Hash peer)
Prepares to retry a failed pre-connect session.
(package private)
TimeoutReq(RouterContext ctx, BuildHandler.BuildMessageState state, BuildRequestRecord req, Hash nextPeer, AtomicBoolean decremented, int retriesLeft)
Prepares to time out one build request.
TunnelInfoComparator(Hash target, boolean avoidZeroHop)
The sort key and zero-hop handling for this comparator.
Constructor parameters in net.i2p.router.tunnel.pool with type arguments of type Hash
Modifier
Constructor
Description
ClosestHopExcluder(boolean isInbound, Set<Hash> set)
Automatically check if peer can connect to us (for inbound) or we can connect to it (for outbound) and add the Hash to the set if not.
Excluder(boolean isInbound, boolean isExploratory, Set<Hash> toAdd)
Does not add selectPeersInTooManyTunnels().
Excluder(boolean isInbound, boolean isExploratory, Set<Hash> toAdd, double buildSuccess)
Does not add selectPeersInTooManyTunnels().
protected
ExcluderBase(Set<Hash> set)
Automatically check if peer is connected and add the Hash to the set if not.
IBGWExcluder(Set<Hash> set)
Automatically check if peer is connected and add the Hash to the set if not.
OBEPExcluder(Set<Hash> set)
Automatically check if peer is connected and add the Hash to the set if not.
(package private)
SelectionExclusions(TunnelPeerSelector.Excluder excluder, Set<Hash> exclude, int peerCooldownExcluded, int firstHopFailCount, Set<Hash> firstPeerExclusions, Set<Hash> firstHopCooldowns)
Records what must not be selected in one pass.
Uses of Hash in net.i2p.router.util
Methods in net.i2p.router.util with parameters of type Hash
Modifier and Type
Method
Description
static int
HashDistance.compare(Hash a, Hash b, Hash c, Hash d)
Compare two XOR distances without allocating BigInteger.
static BigInteger
HashDistance.getDistance(Hash targetKey, Hash routerInQuestion)
Compute XOR distance between two hashes.
private static RouterInfo
MaskedIPSet.lookupRILocally(RouterContext ctx, Hash peer)
This gets the peer from the netdb without validation, for efficiency and to avoid deadlocks.
Constructors in net.i2p.router.util with parameters of type Hash
Modifier
Constructor
Description
MaskedIPSet(RouterContext ctx, Hash peer, int mask)
The Set of IPs for this peer, with a given mask.
MaskedIPSet(RouterContext ctx, Hash peer, RouterInfo pinfo, int mask)
The Set of IPs for this peer, with a given mask.
Uses of Hash in net.i2p.router.web.helpers
Classes in net.i2p.router.web.helpers that implement interfaces with type arguments of type Hash
Modifier and Type
Class
Description
(package private) class
HashComparator
Sorts in true binary order, not Base64 string order.
private static class
SybilRenderer.PointsComparator
Orders router hashes by sybil points.
private static class
TunnelRenderer.CountryComparator
Sorts peers by country then name.
Fields in net.i2p.router.web.helpers declared as Hash
Modifier and Type
Field
Description
private final Hash
NetDbComparators.LeaseSetRoutingKeyComparator._us
The destination whose routing key entries are being ordered.
Fields in net.i2p.router.web.helpers with type parameters of type Hash
Modifier and Type
Field
Description
private final Set<Hash>
ProfileOrganizerRenderer.ProfileComparator._fastSet
The hashes of the fast peers.
private final Set<Hash>
ProfileOrganizerRenderer.ProfileComparator._highCapSet
The hashes of the high capacity peers.
private final Map<Hash,Points>
SybilRenderer.PointsComparator._points
The points, by router hash.
private final Set<Hash>
NetDbRenderer._renderedLeaseSetKeys
LeaseSet keys already rendered for this request, so a LeaseSet stored in more than one facade is shown only once.
(package private) final Set<Hash>
ProfileOrganizerRenderer.ProfileSelection.fastSet
Snapshot of fast-tier hashes, taken once under organizer read lock.
(package private) final Set<Hash>
ProfileOrganizerRenderer.ProfileSelection.highCapSet
Snapshot of high-capacity-tier hashes, taken once under organizer read lock.
(package private) final Set<Hash>
ProfileOrganizerRenderer.ProfileSelection.integratedSet
Snapshot of well-integrated hashes, taken once under organizer read lock.
(package private) final ObjectCounter<Hash>
TunnelRenderer.PeerRows.localCount
Times each peer appears in our local tunnels.
private final TunnelRenderer.BoundedCache<Hash,String>
TunnelRenderer.peerToIP
Cached peer to IP mappings for the tunnel graph.
private final TunnelRenderer.BoundedCache<Hash, TunnelRenderer.ReverseLookupResult>
TunnelRenderer.reverseLookupResults
Cached reverse lookups for the tunnel graph.
private final TunnelRenderer.BoundedCache<Hash, RouterInfo>
TunnelRenderer.routerInfoCache
Cached router infos for the tunnel graph.
(package private) final ObjectCounter<Hash>
TunnelRenderer.PeerRows.transitCount
Times each peer appears in our transit tunnels.
(package private) final List<Hash>
TunnelRenderer.PeerRows.validPeerList
Peers included in the graph.
Methods in net.i2p.router.web.helpers that return Hash
Modifier and Type
Method
Description
private Hash
ConfigPeerHandler.getHash()
Parses the peer's hash from the form.
Methods in net.i2p.router.web.helpers with parameters of type Hash
Modifier and Type
Method
Description
private void
TunnelRenderer.appendPeerIdentity(StringBuilder sb, Hash h, String hB64, String truncHash, String version, RouterInfo info, String ip, TunnelRenderer.ReverseLookupResult rl, String versionTip, String banlistedTip, String unknownLabel, boolean isBanned)
Append the identity cells shared by the peer tables: country flag, router hash link, version with netdb link, tier caps, IP address, and reverse-lookup domain.
private void
TunnelRenderer.appendPeerRow(StringBuilder chunkSb, Hash h, RouterInfo info, int tunnelCount, int partCount, int localTunnelCount, int transitTunnelCount, String versionTip, String unknownLabel, String configurePeerTip, String editLabel)
Append one tunnel peer count row: identity cells plus local and transit tunnel bars and the edit link.
private static String
ClientSKMDebugHelper.clientTitle(RouterContext ctx, Destination dest, Hash h)
The client's nickname when its inbound tunnel has one, otherwise the base32 destination.
static int
HashComparator.comp(Hash l, Hash r)
Orders two hashes by their raw data bytes, statically.
int
HashComparator.compare(Hash l, Hash r)
Orders two hashes by their raw data bytes.
int
SybilRenderer.PointsComparator.compare(Hash l, Hash r)
Orders two hashes by their points, highest score first.
int
TunnelRenderer.CountryComparator.compare(Hash l, Hash r)
Compare the two countries as plain strings, substituting "zzzz" for an unknown one so it sorts after every real code.
private String
StatHelper.dumpProfile(Hash peer)
Dump the profile.
private String
NetDbRenderer.getLocalClientNickname(Hash key)
Local client nickname for a destination hash.
String
NetDbRenderer.getPeerProfileTier(Hash peer, boolean fullname)
Peer profile tier name or CSS class.
private TunnelRenderer.ReverseLookupResult
TunnelRenderer.getReverseLookupInfo(Hash h, RouterInfo info, long uptime)
Performs a cached reverse lookup for the given router hash and its RouterInfo, returning canonical hostname, domain, and cleaned WHOIS data if available.
private String
BanlistRenderer.getRouterCaps(Hash hash)
Get router capabilities string from NetDB.
private String
BanlistRenderer.getRouterVersion(Hash hash, String reason)
Router version for a banned hash, from NetDB or parsed out of the ban reason.
boolean
ConfigPeerHelper.isBanned(Hash h)
Determine whether the given peer hash is banned.
private static boolean
ProfileOrganizerRenderer.isValid(PeerProfile prof, Hash peer, Hash us, boolean requireTunnelHistory)
Exclude ourself and profiles never heard from.
private RouterInfo
NetDbRenderer.lookupRouterInfoWithWait(NetworkDatabaseFacade networkDatabase, Hash hash, long timeout)
Looks up a RouterInfo by its hash with a timeout.
private String
TunnelRenderer.netDbLink(Hash peer)
Builds the netdb link for one peer.
private String
TunnelRenderer.peerFlag(Hash peer)
Builds the country flag image for one peer.
private void
SybilRenderer.renderCloseTmrwSummary(Writer out, StringBuilder buf, Analysis analysis, Hash us, double avgMinDist, List<RouterInfo> ris, Map<Hash,Points> points)
Render the closest floodfills to tomorrow's routing key.
private void
SybilRenderer.renderDHTSummary(Writer out, StringBuilder buf, Analysis analysis, Hash us, double avgMinDist, List<RouterInfo> ris, Map<Hash,Points> points)
Render the closest floodfills to our router hash.
void
NetDbRenderer.renderLeaseSetHTML(Writer out, boolean debug, Hash client)
Renders all leasesets.
private void
TunnelRenderer.renderPoolSummary(Writer out, TunnelPool in, TunnelPool outPool, Hash client)
Render a summary table for a tunnel pool.
private double
SybilRenderer.renderRouterInfo(StringBuilder buf, RouterInfo info, Hash us, boolean isUs, boolean full)
Be careful to use stripHTML for any displayed routerInfo data to prevent vulnerabilities.
private void
SybilRenderer.renderRouterInfoHTML(Writer out, StringBuilder buf, Hash us, double avgMinDist, List<RouterInfo> ris)
Render routers closer than MIN_CLOSE up to MAX routers.
Method parameters in net.i2p.router.web.helpers with type arguments of type Hash
Modifier and Type
Method
Description
private int
TunnelRenderer.countParticipatingPerPeer(ObjectCounter<Hash> pc)
Tally the transit tunnels this router participates in, counting the receive-from and send-to peer of each into pc.
private int
TunnelRenderer.countTunnelsPerPeer(ObjectCounter<Hash> lc)
Tally the exploratory and client tunnels longer than one hop, counting each of their peers into lc.
private void
SybilRenderer.renderCloseSummary(Writer out, StringBuilder buf, Analysis analysis, double avgMinDist, List<RouterInfo> ris, Map<Hash,Points> points)
Render the closest floodfills to our routing key.
private void
SybilRenderer.renderCloseTmrwSummary(Writer out, StringBuilder buf, Analysis analysis, Hash us, double avgMinDist, List<RouterInfo> ris, Map<Hash,Points> points)
Render the closest floodfills to tomorrow's routing key.
private void
SybilRenderer.renderDestSummary(Writer out, StringBuilder buf, Analysis analysis, double avgMinDist, List<RouterInfo> ris, Map<Hash,Points> points)
Render the closest floodfills to our published destinations.
private void
SybilRenderer.renderDHTSummary(Writer out, StringBuilder buf, Analysis analysis, Hash us, double avgMinDist, List<RouterInfo> ris, Map<Hash,Points> points)
Render the closest floodfills to our router hash.
private void
SybilRenderer.renderFamilySummary(Writer out, StringBuilder buf, Analysis analysis, List<RouterInfo> ris, Map<Hash,Points> points)
Render the family group summary section.
private void
SybilRenderer.renderIP16Summary(Writer out, StringBuilder buf, Analysis analysis, List<RouterInfo> ris, Map<Hash,Points> points)
Render the /16 IP group summary.
private void
SybilRenderer.renderIP24Summary(Writer out, StringBuilder buf, Analysis analysis, List<RouterInfo> ris, Map<Hash,Points> points)
Render the /24 IP group summary.
private void
SybilRenderer.renderIP32Summary(Writer out, StringBuilder buf, Analysis analysis, List<RouterInfo> ris, Map<Hash,Points> points)
Render the /32 IP group summary.
private void
SybilRenderer.renderIP48Summary(Writer out, StringBuilder buf, Analysis analysis, List<RouterInfo> ris, Map<Hash,Points> points)
Render the /48 IPv6 group summary.
private void
SybilRenderer.renderIP64Summary(Writer out, StringBuilder buf, Analysis analysis, List<RouterInfo> ris, Map<Hash,Points> points)
Render the /64 IPv6 group summary.
private void
SybilRenderer.renderIPUsSummary(Writer out, StringBuilder buf, Analysis analysis, List<RouterInfo> ris, Map<Hash,Points> points)
Render the IP group summary for our own IP address.
private void
SybilRenderer.renderPairSummary(Writer out, StringBuilder buf, Analysis analysis, List<RouterInfo> ris, Map<Hash,Points> points)
Render the pairwise distance summary.
static void
SybilRenderer.renderSybilHTML(Writer out, RouterContext ctx, List<Hash> sybils, String victim)
Called from NetDbRenderer.
private void
SybilRenderer.renderThreatsHTML(Writer out, StringBuilder buf, long date, Map<Hash,Points> points)
Render the threats analysis HTML section.
Constructors in net.i2p.router.web.helpers with parameters of type Hash
Modifier
Constructor
Description
LeaseSetRoutingKeyComparator(Hash us)
Create a comparator ordering leases by their routing key entry.
Constructor parameters in net.i2p.router.web.helpers with type arguments of type Hash
Modifier
Constructor
Description
PointsComparator(Map<Hash,Points> points)
Orders hashes by sybil score, most points first.
(package private)
ProfileComparator(Set<Hash> fastSet, Set<Hash> highCapSet)
Orders the profiles for the page.
Uses of Hash in net.i2p.util
Subclasses with type arguments of type Hash in net.i2p.util
Modifier and Type
Class
Description
class
KeyRing
Thread-safe mapping from router hashes to session keys.
Fields in net.i2p.util with type parameters of type Hash
Modifier and Type
Field
Description
private static final Map<Hash,Long>
StallRegistry._stalls
Last stall time for each peer
Methods in net.i2p.util that return Hash
Modifier and Type
Method
Description
static Hash
ConvertToHash.getHash(String peer)
Convert any kind of destination String to a hash.
Methods in net.i2p.util with parameters of type Hash
Modifier and Type
Method
Description
static void
StallRegistry.markStalled(Hash remote, long now)
Note that a stream to this destination stopped making progress.
static boolean
StallRegistry.recentlyStalled(Hash remote, long now, long cooldownMs)
Whether this destination was marked within the cooldown, meaning a caller may prefer a different outbound tunnel.
static long
StallRegistry.stallAge(Hash remote, long now, long cooldownMs)
How long ago this destination was marked, clamped to the cooldown.
Uses of Hash in org.klomp.snark
Fields in org.klomp.snark declared as Hash
Modifier and Type
Field
Description
private Hash
I2PSnarkUtil.Unbanlist._dest
The peer to unban.
private final Hash
UDPTrackerClient._myHash
Hash of this client's destination.
Fields in org.klomp.snark with type parameters of type Hash
Modifier and Type
Field
Description
private final ObjectCounter<Hash>
ConnectionAcceptor._badCounter
Bad handshakes counted per peer hash.
private final Map<Hash,String>
ConnectionAcceptor._badReasons
Bad handshake reasons, by peer hash.
private final Set<Hash>
I2PSnarkUtil._banlist
Peers banned for bad data.
private final Set<Hash>
UDPTrackerClient.TrackerResponse.peers
Peers returned by the reply.
private final Map<Hash,Long>
PeerCoordinator.swarmSeen
Distinct swarm peers, keyed by destination hash, value is the last-seen wall time.
Methods in org.klomp.snark that return Hash
Modifier and Type
Method
Description
private Hash
TrackerClient.getHostHash(String ann)
This also validates the URL.
Methods in org.klomp.snark that return types with arguments of type Hash
Modifier and Type
Method
Description
Set<Hash>
UDPTrackerClient.TrackerResponse.getPeers()
The peers.
Methods in org.klomp.snark with parameters of type Hash
Modifier and Type
Method
Description
void
ConnectionAcceptor.ban(Hash h)
Ban the given hash.
void
CoordinatorListener.ban(Hash h)
Ban the given hash.
void
PeerCoordinator.ban(Hash h)
Ban the given hash.
void
PeerListener.ban(Hash h)
Ban the given hash.
void
Snark.ban(Hash h)
Ban the given hash.
void
I2PSnarkUtil.banPeer(Hash h, long period)
Ban the given destination hash for the given period.
boolean
ConnectionAcceptor.isBanned(Hash h)
Is the given hash banned?
boolean
CoordinatorListener.isBanned(Hash h)
Is the given hash banned?
boolean
I2PSnarkUtil.isBanned(Hash h)
Is the given destination hash banned?
boolean
PeerCoordinator.isBanned(Hash h)
Is the given hash banned?
boolean
PeerListener.isBanned(Hash h)
Is the given hash banned?
boolean
Snark.isBanned(Hash h)
Is the given hash banned?
Method parameters in org.klomp.snark with type arguments of type Hash
Modifier and Type
Method
Description
(package private) static int
TrackerInfo.getPeerCount(Set<Hash> peers, int complete, int incomplete)
Compute peer count from tracker response data.
private static Set<Peer>
TrackerInfo.getPeers(Set<Hash> hashes, byte[] my_id, byte[] infohash, MetaInfo metainfo, I2PSnarkUtil util)
From Hash to Peer.
private boolean
TrackerClient.isNewValidTracker(Set<Hash> existing, String ann)
Whether the announce URL already exists in the list.
Constructors in org.klomp.snark with parameters of type Hash
Modifier
Constructor
Description
Unbanlist(Hash dest)
Prepares to unban a peer later.
Constructor parameters in org.klomp.snark with type arguments of type Hash
Modifier
Constructor
Description
TrackerInfo(Set<Hash> hashes, int interval, int complete, int incomplete, int downloaders, String error, byte[] my_id, byte[] infohash, MetaInfo metainfo, I2PSnarkUtil util)
To convert returned UDPTracker data to the standard structure.
TrackerResponse(int interval, int seeds, int leeches, Set<Hash> peers)
Builds a successful response from the tracker's swarm statistics.
Uses of Hash in org.klomp.snark.dht
Subclasses of Hash in org.klomp.snark.dht
Modifier and Type
Class
Description
(package private) class
Peer
Represents a single peer participating in a specific torrent within the DHT tracker.
Subclasses with type arguments of type Hash in org.klomp.snark.dht
Modifier and Type
Class
Description
(package private) class
Peers
Thread-safe collection of all peers participating in a single torrent.
Fields in org.klomp.snark.dht declared as Hash
Modifier and Type
Field
Description
private final Hash
NodeInfo.hash
The node's router hash.
Methods in org.klomp.snark.dht that return Hash
Modifier and Type
Method
Description
Hash
NodeInfo.calculateHash()
Calculate the hash.
Hash
NodeInfo.getHash()
The hash.
Methods in org.klomp.snark.dht that return types with arguments of type Hash
Modifier and Type
Method
Description
(package private) List<Hash>
DHTTracker.getPeers(InfoHash ih, int max, boolean noSeeds)
Fetch peers for a torrent.
Collection<Hash>
DHT.getPeersAndAnnounce(byte[] ih, int max, long maxWait, int annMax, long annMaxWait, boolean isSeed, boolean noSeeds)
Fetch peers for a torrent, and announce to the closest annMax nodes we find.
Collection<Hash>
KRPC.getPeersAndAnnounce(byte[] ih, int max, long maxWait, int annMax, long annMaxWait, boolean isSeed, boolean noSeeds)
Find peers for a torrent, announcing to the closest annMax nodes found.
private List<Hash>
KRPC.receivePeers(NodeInfo nInfo, List<BEValue> peers)
Receive 32-byte hashes as peer list.
Methods in org.klomp.snark.dht with parameters of type Hash
Modifier and Type
Method
Description
(package private) void
DHTTracker.announce(InfoHash ih, Hash hash, boolean isSeed)
Announce a peer for a torrent.
static NID
NodeInfo.generateNID(Hash h, int p, RandomSource random)
Generate a secure NID that matches the Hash and port.
(package private) void
DHTTracker.unannounce(InfoHash ih, Hash hash)
Remove a peer from a torrent's peer list.
Constructors in org.klomp.snark.dht with parameters of type Hash
Modifier
Constructor
Description
NodeInfo(NID nID, Hash hash, int port)
No Destination yet available.

Uses of Hash in net.i2p.addressbook

Uses of Hash in net.i2p.client

Uses of Hash in net.i2p.client.datagram

Uses of Hash in net.i2p.client.impl

Uses of Hash in net.i2p.client.naming

Uses of Hash in net.i2p.client.streaming.impl

Uses of Hash in net.i2p.crypto

Uses of Hash in net.i2p.data

Uses of Hash in net.i2p.data.i2cp

Uses of Hash in net.i2p.data.i2np

Uses of Hash in net.i2p.data.router

Uses of Hash in net.i2p.i2ptunnel

Uses of Hash in net.i2p.i2ptunnel.access

Uses of Hash in net.i2p.router

Uses of Hash in net.i2p.router.client

Uses of Hash in net.i2p.router.crypto

Uses of Hash in net.i2p.router.dummy

Uses of Hash in net.i2p.router.message

Uses of Hash in net.i2p.router.naming

Uses of Hash in net.i2p.router.networkdb

Uses of Hash in net.i2p.router.networkdb.kademlia

Uses of Hash in net.i2p.router.networkdb.reseed

Uses of Hash in net.i2p.router.peermanager

Uses of Hash in net.i2p.router.sybil

Uses of Hash in net.i2p.router.transport

Uses of Hash in net.i2p.router.transport.ntcp

Uses of Hash in net.i2p.router.transport.udp

Uses of Hash in net.i2p.router.tunnel

Uses of Hash in net.i2p.router.tunnel.pool

Uses of Hash in net.i2p.router.util

Uses of Hash in net.i2p.router.web.helpers

Uses of Hash in net.i2p.util

Uses of Hash in org.klomp.snark

Uses of Hash in org.klomp.snark.dht