I2P_Developers/i2p.itoopie
3
0
Fork 0
Code Issues Pull Requests Actions 1 Packages Projects Releases Wiki Activity

3rd time...

Browse Source
This commit is contained in:
zzz
2009-11-10 21:27:01 +00:00
parent 4533a86712
commit 8bc2fd7e42
1 changed files with 12 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

16
router/java/src/net/i2p/router/networkdb/kademlia/FloodfillPeerSelector.java
View File

@ -129,20 +129,28 @@ class FloodfillPeerSelector extends PeerSelector {
} else { } else {
PeerProfile prof = _context.profileOrganizer().getProfile(entry); PeerProfile prof = _context.profileOrganizer().getProfile(entry);
if (prof != null && prof.getDBHistory() != null if (prof != null && prof.getDBHistory() != null
&& now - prof.getDBHistory().getLastStoreFailed() < now - NO_FAIL_STORE_GOOD && prof.getDBHistory().getLastStoreFailed() < now - NO_FAIL_STORE_GOOD
&& now - prof.getDBHistory().getLastLookupFailed() < now - NO_FAIL_LOOKUP_GOOD) { && prof.getDBHistory().getLastLookupFailed() < now - NO_FAIL_LOOKUP_GOOD) {
// good // good
if (_log.shouldLog(Log.DEBUG))
_log.debug("Good: " + entry);
rv.add(entry); rv.add(entry);
found++; found++;
} else if (prof != null && prof.getDBHistory() != null } else if (prof != null && prof.getDBHistory() != null
&& now - prof.getDBHistory().getLastStoreFailed() < now - NO_FAIL_STORE_OK && prof.getDBHistory().getLastStoreFailed() < now - NO_FAIL_STORE_OK
&& now - prof.getDBHistory().getLastLookupFailed() < now - NO_FAIL_LOOKUP_OK) { && prof.getDBHistory().getLastLookupFailed() < now - NO_FAIL_LOOKUP_OK) {
if (_log.shouldLog(Log.DEBUG))
_log.debug("OK: " + entry);
okff.add(entry); okff.add(entry);
} else { } else {
if (_log.shouldLog(Log.DEBUG))
_log.debug("Bad: " + entry);
badff.add(entry); badff.add(entry);
} }
} }
} }
if (_log.shouldLog(Log.DEBUG))
_log.debug("Good: " + rv + " OK: " + okff + " Bad: " + badff);
// Put the ok floodfills after the good floodfills // Put the ok floodfills after the good floodfills
for (int i = 0; found < howMany && i < okff.size(); i++) { for (int i = 0; found < howMany && i < okff.size(); i++) {