| Age | Commit message (Collapse) | Author |
|---|
|
(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
|
|
|
|
_networks is usually quite small, using binary search on a vector might be faster comapred to std::map.
This is especially true when using uClibc++, which uses a list.
|
|
full identity of peers instead of just address.
|
|
|
|
allow RENDEZVOUS from regular peers.
|
|
|
|
|
|
|
|
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.
|
|
|
