| Age | Commit message (Collapse) | Author |
|---|
|
|
|
|
|
|
|
config requests.
|
|
|
|
unknown networks to prevent forensics.
|
|
|
|
multicast on the network as would be expected.
|
|
do not handle OK packets we did not expect. This hardens up a few potential edge cases around security, since such messages might be used to e.g. pollute a cache and DOS under certain conditions.
|
|
|
|
elegant way.
|
|
|
|
|
|
lookup.
|
|
|
|
explicitly check whether paths should be used. Check in with this callback (if present) when learning new paths or sending initial packets.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
tightening up multicast lookup and other things.
|
|
interface a full sockaddr_storage instead of an int identifier, which turns out to be better for multi-homing and other uses.
|
|
remote addresses.
|
|
|
|
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.
|
|
|
|
|
|
|
|
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.
|
|
|
|
_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.
|
|
|
|
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.
|
|
Node, and test script for local testnets.
|
|
|
|
for consistency.
|
|
core, other bug fixes.
|
|
|
|
|
|
|
|
add a user pointer to the CAPI.
|
|
|
