echelon/i2p.i2p
1
0
Fork 0
forked from I2P_Developers/i2p.i2p
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

NetDB: Comment out unused FloodOnlySearchJob code

Browse Source
This commit is contained in:
zzz
2020-02-25 14:38:31 +00:00
parent f938090d6a
commit bc791f91ab
1 changed files with 4 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
router/java/src/net/i2p/router/networkdb/kademlia/FloodOnlySearchJob.java
View File

@ -65,6 +65,8 @@ abstract class FloodOnlySearchJob extends FloodSearchJob {
@Override @Override
public void runJob() { public void runJob() {
throw new UnsupportedOperationException("use override");
/****
// pick some floodfill peers and send out the searches // pick some floodfill peers and send out the searches
// old // old
//List<Hash> floodfillPeers = _facade.getFloodfillPeers(); //List<Hash> floodfillPeers = _facade.getFloodfillPeers();
@ -105,7 +107,6 @@ abstract class FloodOnlySearchJob extends FloodSearchJob {
// so we can register a reply selector. // so we can register a reply selector.
_out = getContext().messageRegistry().registerPending(_replySelector, _onReply, _onTimeout); _out = getContext().messageRegistry().registerPending(_replySelector, _onReply, _onTimeout);
/********
// We need to randomize our ff selection, else we stay with the same ones since // We need to randomize our ff selection, else we stay with the same ones since
// getFloodfillPeers() is sorted by closest distance. Always using the same // getFloodfillPeers() is sorted by closest distance. Always using the same
// ones didn't help reliability. // ones didn't help reliability.
@ -140,7 +141,6 @@ abstract class FloodOnlySearchJob extends FloodSearchJob {
} else { } else {
_shouldProcessDSRM = true; _shouldProcessDSRM = true;
} }
********/
int count = 0; // keep a separate count since _lookupsRemaining could be decremented elsewhere int count = 0; // keep a separate count since _lookupsRemaining could be decremented elsewhere
for (int i = 0; _lookupsRemaining.get() < CONCURRENT_SEARCHES && i < floodfillPeers.size(); i++) { for (int i = 0; _lookupsRemaining.get() < CONCURRENT_SEARCHES && i < floodfillPeers.size(); i++) {
@ -172,6 +172,7 @@ abstract class FloodOnlySearchJob extends FloodSearchJob {
dlm.setMessageExpiration(getContext().clock().now() + SINGLE_SEARCH_MSG_TIME); dlm.setMessageExpiration(getContext().clock().now() + SINGLE_SEARCH_MSG_TIME);
dlm.setReplyTunnel(replyTunnel.getReceiveTunnelId(0)); dlm.setReplyTunnel(replyTunnel.getReceiveTunnelId(0));
dlm.setSearchKey(_key); dlm.setSearchKey(_key);
dlm.setSearchType(_isLease ? DatabaseLookupMessage.Type.LS : DatabaseLookupMessage.Type.RI);
if (_log.shouldLog(Log.INFO)) if (_log.shouldLog(Log.INFO))
_log.info(getJobId() + ": Floodfill search for " + _key + " to " + peer); _log.info(getJobId() + ": Floodfill search for " + _key + " to " + peer);
@ -186,6 +187,7 @@ abstract class FloodOnlySearchJob extends FloodSearchJob {
// no floodfill peers, fail // no floodfill peers, fail
failed(); failed();
} }
****/
} }
@Override @Override