 Caleb James DeLisle
|
86c885f05a
32 bit issue
|
9 년 전 |
|
Caleb James DeLisle
|
670b047d8a
Fixed bug in getPeers which caused it to return the same peers every time
|
9 년 전 |
|
Caleb James DeLisle
|
da108a24c9
removed some testing code which ended up in the commented out version
|
10 년 전 |
|
Caleb James DeLisle
|
e186963975
Merge branch 'nodestore-getbest-version' of git://github.com/Arceliar/cjdns into crashey
|
10 년 전 |
|
Caleb James DeLisle
|
185fe281e5
Nodes trying to ping themselves causing crashes
|
10 년 전 |
|
Caleb James DeLisle
|
f1842154f0
noisy log line
|
10 년 전 |
 Arceliar
|
7069ce7d3b
Disable code
|
10 년 전 |
|
Arceliar
|
4b428f4896
When getBest does a lookup of nodes in a bucket, skip old version nodes.
|
10 년 전 |
|
Arceliar
|
92e9164065
Try to make paths a little more stable. When a node is pinged into oblivion, break the link to it (to prevent it from being re-adopted).
|
10 년 전 |
|
Arceliar
|
f3ce288092
Go back to guessing instead of trying to try every bestParent change. Try to make guesses cause fewer flappy routes. Track the time each link was last tested, use either the least recently tested link or the node's test time when deciding how old our info about a node is. Move tryExistingNode out of the conditional chain in the janitor, to prevent it from being blocked during bootstrapping (when we're most vulnerable to blackholes anyway). Misc code cleanup.
|
10 년 전 |
|
Arceliar
|
c47ec81446
Fix a bug where we never reconnect. Probably possible to clean this up a little.
|
10 년 전 |
|
Arceliar
|
02ed10d489
Remove some commented out code
|
10 년 전 |
|
Arceliar
|
2e024c26db
Don't protect uncreachable nodes.
|
10 년 전 |
|
Arceliar
|
72948a4ffe
Try to fix some blackholes.
|
10 년 전 |
|
Caleb James DeLisle
|
a6898fc55b
attempt to fix assertion failure
|
10 년 전 |
|
Caleb James DeLisle
|
6c5599283e
Merge branch 'node-time' of https://github.com/Arceliar/cjdns into crashey
|
10 년 전 |
|
Caleb James DeLisle
|
14da687b45
if discoverNode tries to return crap, assert fail
|
10 년 전 |
|
Caleb James DeLisle
|
6e9995c2a7
If the newly discovered node is actually the worst in the table, it will return a dangling pointer
|
10 년 전 |
|
Arceliar
|
23cc805347
Move eventBase out of public part of nodeStore
|
10 년 전 |
|
Arceliar
|
e7a8dd6b5d
Store the time each node was last pinged successfully. Reset on path changes. Include it in dumptable. Added support for this in dumptable.js
|
10 년 전 |
|
Caleb James DeLisle
|
ec9172bbdf
re-pinging a bad node is not causing problems but it should not be done if the node is ffff
|
10 년 전 |
|
Arceliar
|
dccfd685a1
Change lookups to be more bucket-aware, necessairy for actually getting any improvement from the longer bucket prefixes.
|
10 년 전 |
|
Arceliar
|
7c8289273e
Less terrible way to calculate the bucket for a node or the bitmask for a bucket. TODO: Make lookup()s aware of bucket prefixes (best node in the right bucket, or if none, then best node that's closer than us). TODO: refactor the bucket stuff at the end of NodeStore.c into Address.c? (Since it depends only on constants and info in addresses.)
|
10 년 전 |
|
Arceliar
|
f2363e33ca
Some bugfixes. Still kills the API logger with spam when filling dht RumorMill.
|
10 년 전 |
|
Arceliar
|
b8e92c07a3
Use a 4-bit prefix per dht bucket instead of 1-bit. In a broken state at the moment.
|
10 년 전 |
|
Arceliar
|
9d0fdabe17
DHT maintenance without searches. Refactored the common bit-twiddling part of the DHT stuff, so it only has to appear once.
|
10 년 전 |
|
Caleb James DeLisle
|
e9bcb0f9f0
This assertion is abusable if a node seds a garbage error frame
|
10 년 전 |
|
Caleb James DeLisle
|
e7eef35b18
duh
|
10 년 전 |
|
Caleb James DeLisle
|
ceb4db2f06
improvements
|
10 년 전 |
|
Caleb James DeLisle
|
3a5c6dccb4
should be changing pathAtErrorHop, not thisPath
|
10 년 전 |
