| Age | Commit message (Collapse) | Author |
|---|
|
|
|
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.
|
|
|
|
|
|
|
|
link, porting over core loop code from old Node.cpp to new CAPI version, etc.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Switch.
|
|
|
|
simplifies a ton of stuff. Loads of spaghetti logic can die since we no longer have to make these decisions down in the core.
|
|
out, redo COM serialization, etc.
|
|
|
|
reducing indirect function calls also increased memcpy()s which are more expensive. This is simpler and faster.
|
|
|
|
|
|
|
|
mobile (language bindings again), etc.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
simulation.
|
|
|
|
|
