| Age | Commit message (Collapse) | Author |
|---|
|
and fix a "how was that working" latent bug causing some control traffic to take the scenic route.
|
|
|
|
this is a priority.
|
|
|
|
|
|
|
|
explicitly check whether paths should be used. Check in with this callback (if present) when learning new paths or sending initial packets.
|
|
more explicit methods.
|
|
1.1.3 (dev)
|
|
(2) clean up some other stuff seen during debugging and reduce the sizes of some buffers due to Windows small stack size, (3) remove a redundant try/catch.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
relays or roots)
|
|
|
|
|
|
|
|
with valgrind.
|
|
|
|
|
|
|
|
|
|
|
|
interface a full sockaddr_storage instead of an int identifier, which turns out to be better for multi-homing and other uses.
|
|
|
|
remote addresses.
|
|
(ongoing std::map-ectomy)
|
|
possibly elsewhere.
|
|
|
|
make best path choice aware of path rank.
|
|
and replacing it with a simple non-crypto PRNG that just uses Salsa20.
|
|
pushing changes. Move path viability check to one place, and stop trying to use link-local addresses since they are not reliable.
|
|
|
|
|
|
|
|
leak?)
|
|
and put the nwid in a pair with the pointer so linear search can be done without pointer chasing. This should be the fastest option for anything less than dozens of networks, and should save memory over the old map.
|
|
into adamierymenko-dev
|
|
|
