From 1444f1239fda9b767a48f9570c64d6bbdec76608 Mon Sep 17 00:00:00 2001
From: zzz <zzz@mail.i2p>
Date: Fri, 21 Jun 2013 15:13:16 +0000
Subject: [PATCH] lookup stat tweak
---
.../networkdb/kademlia/FloodfillNetworkDatabaseFacade.java | 3 ++-
.../net/i2p/router/networkdb/kademlia/IterativeSearchJob.java | 4 ++--
2 files changed, 4 insertions(+), 3 deletions(-)
diff --git a/router/java/src/net/i2p/router/networkdb/kademlia/FloodfillNetworkDatabaseFacade.java b/router/java/src/net/i2p/router/networkdb/kademlia/FloodfillNetworkDatabaseFacade.java
index 26e8d7b4d3..909beb9149 100644
--- a/router/java/src/net/i2p/router/networkdb/kademlia/FloodfillNetworkDatabaseFacade.java
+++ b/router/java/src/net/i2p/router/networkdb/kademlia/FloodfillNetworkDatabaseFacade.java
@@ -50,7 +50,8 @@ public class FloodfillNetworkDatabaseFacade extends KademliaNetworkDatabaseFacad
_context.statManager().createRequiredRateStat("netDb.successTime", "Time for successful lookup (ms)", "NetworkDatabase", new long[] { 60*60*1000l, 24*60*60*1000l });
_context.statManager().createRateStat("netDb.failedTime", "How long a failed search takes", "NetworkDatabase", new long[] { 60*60*1000l, 24*60*60*1000l });
- _context.statManager().createRateStat("netDb.retries", "How many additional queries for an iterative search", "NetworkDatabase", new long[] { 60*60*1000l });
+ _context.statManager().createRateStat("netDb.failedRetries", "How many additional queries for an iterative search", "NetworkDatabase", new long[] { 60*60*1000l });
+ _context.statManager().createRateStat("netDb.successRetries", "How many additional queries for an iterative search", "NetworkDatabase", new long[] { 60*60*1000l });
_context.statManager().createRateStat("netDb.failedAttemptedPeers", "How many peers we sent a search to when the search fails", "NetworkDatabase", new long[] { 10*60*1000l });
_context.statManager().createRateStat("netDb.successPeers", "How many peers are contacted in a successful search", "NetworkDatabase", new long[] { 60*60*1000l, 24*60*60*1000l });
_context.statManager().createRateStat("netDb.failedPeers", "How many peers fail to respond to a lookup?", "NetworkDatabase", new long[] { 60*60*1000l, 24*60*60*1000l });
diff --git a/router/java/src/net/i2p/router/networkdb/kademlia/IterativeSearchJob.java b/router/java/src/net/i2p/router/networkdb/kademlia/IterativeSearchJob.java
index 6e9a5233cf..8b9bf927a6 100644
--- a/router/java/src/net/i2p/router/networkdb/kademlia/IterativeSearchJob.java
+++ b/router/java/src/net/i2p/router/networkdb/kademlia/IterativeSearchJob.java
@@ -380,7 +380,7 @@ class IterativeSearchJob extends FloodSearchJob {
", peers queried: " + tries);
}
getContext().statManager().addRateData("netDb.failedTime", time, 0);
- getContext().statManager().addRateData("netDb.retries", Math.max(0, tries - 1), 0);
+ getContext().statManager().addRateData("netDb.failedRetries", Math.max(0, tries - 1), 0);
for (Job j : _onFailed) {
getContext().jobQueue().addJob(j);
}
@@ -414,7 +414,7 @@ class IterativeSearchJob extends FloodSearchJob {
_log.info(getJobId() + ": Iterative search for " + _key + " successful after " + time +
", peers queried: " + tries);
getContext().statManager().addRateData("netDb.successTime", time, 0);
- getContext().statManager().addRateData("netDb.retries", tries - 1, 0);
+ getContext().statManager().addRateData("netDb.successRetries", tries - 1, 0);
for (Job j : _onFind) {
getContext().jobQueue().addJob(j);
}
--
GitLab