| Age | Commit message (Collapse) | Author |
|---|
|
|
|
|
|
|
|
representation, especially rules.
|
|
lookup point.
|
|
more rules with better space efficiency.
|
|
|
|
|
|
|
|
|
|
|
|
lookup.
|
|
|
|
explicitly check whether paths should be used. Check in with this callback (if present) when learning new paths or sending initial packets.
|
|
|
|
uPnP addresses?!?
|
|
|
|
|
|
|
|
|
|
|
|
via normal ZeroTier front plane -- more efficient and eliminates fragmentation issues.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
and upstream hop in graph traversal history.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
interface a full sockaddr_storage instead of an int identifier, which turns out to be better for multi-homing and other uses.
|
|
remote addresses.
|
|
|
|
|
|
(2) Go back to timestamp as certificate revision number. This is simpler
and more robust than using the network revision number for this and
forcing network revision fast-forward, which could cause some peers
to fall off the horizon when you don't want them to.
|
|
make best path choice aware of path rank.
|
|
pushing changes. Move path viability check to one place, and stop trying to use link-local addresses since they are not reliable.
|
|
|
|
full identity of peers instead of just address.
|
|
|
|
significantly simpler way to move all of this logic entirely into the containing service, liberating the core from any concern over the nature of its pipe to the outside world.
|
|
that later. Should be able to re-use FreeBSD port for OpenBSD, but we will see.
|
