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

log level tweaks

Browse Source
This commit is contained in:
zzz
2020-02-29 14:32:07 +00:00
parent 3eb573295b
commit d505a2fe76
1 changed files with 10 additions and 10 deletions
Download Patch File Download Diff File Expand all files Collapse all files

20
router/java/src/net/i2p/router/peermanager/ProfileOrganizer.java
View File

@ -378,8 +378,8 @@ public class ProfileOrganizer {
_log.info("selectFastPeers("+howMany+"), not enough fast (" + matches.size() + ") going on to highCap"); _log.info("selectFastPeers("+howMany+"), not enough fast (" + matches.size() + ") going on to highCap");
selectHighCapacityPeers(howMany, exclude, matches, mask); selectHighCapacityPeers(howMany, exclude, matches, mask);
} else { } else {
if (_log.shouldLog(Log.INFO)) if (_log.shouldDebug())
_log.info("selectFastPeers("+howMany+"), found enough fast (" + matches.size() + ")"); _log.debug("selectFastPeers("+howMany+"), found enough fast (" + matches.size() + ")");
} }
return; return;
} }
@ -446,8 +446,8 @@ public class ProfileOrganizer {
_log.info("selectFastPeers("+howMany+"), not enough fast (" + matches.size() + ") going on to highCap"); _log.info("selectFastPeers("+howMany+"), not enough fast (" + matches.size() + ") going on to highCap");
selectHighCapacityPeers(howMany, exclude, matches, 2); selectHighCapacityPeers(howMany, exclude, matches, 2);
} else { } else {
if (_log.shouldLog(Log.INFO)) if (_log.shouldDebug())
_log.info("selectFastPeers("+howMany+"), found enough fast (" + matches.size() + ")"); _log.debug("selectFastPeers("+howMany+"), found enough fast (" + matches.size() + ")");
} }
return; return;
} }
@ -483,8 +483,8 @@ public class ProfileOrganizer {
_log.info("selectHighCap("+howMany+"), not enough highcap (" + matches.size() + ") going on to ANFP2"); _log.info("selectHighCap("+howMany+"), not enough highcap (" + matches.size() + ") going on to ANFP2");
selectActiveNotFailingPeers2(howMany, exclude, matches, mask); selectActiveNotFailingPeers2(howMany, exclude, matches, mask);
} else { } else {
if (_log.shouldLog(Log.INFO)) if (_log.shouldDebug())
_log.info("selectHighCap("+howMany+"), found enough highCap (" + matches.size() + ")"); _log.debug("selectHighCap("+howMany+"), found enough highCap (" + matches.size() + ")");
} }
return; return;
} }
@ -517,8 +517,8 @@ public class ProfileOrganizer {
_log.info("selectWellIntegrated("+howMany+"), not enough integrated (" + matches.size() + ") going on to notFailing"); _log.info("selectWellIntegrated("+howMany+"), not enough integrated (" + matches.size() + ") going on to notFailing");
selectNotFailingPeers(howMany, exclude, matches, mask); selectNotFailingPeers(howMany, exclude, matches, mask);
} else { } else {
if (_log.shouldLog(Log.INFO)) if (_log.shouldDebug())
_log.info("selectWellIntegrated("+howMany+"), found enough well integrated (" + matches.size() + ")"); _log.debug("selectWellIntegrated("+howMany+"), found enough well integrated (" + matches.size() + ")");
} }
return; return;
@ -620,8 +620,8 @@ public class ProfileOrganizer {
_log.info("selectANFP2("+howMany+"), not enough ANFP (" + matches.size() + ") going on to notFailing"); _log.info("selectANFP2("+howMany+"), not enough ANFP (" + matches.size() + ") going on to notFailing");
selectNotFailingPeers(howMany, exclude, matches, mask); selectNotFailingPeers(howMany, exclude, matches, mask);
} else { } else {
if (_log.shouldLog(Log.INFO)) if (_log.shouldDebug())
_log.info("selectANFP2("+howMany+"), found enough ANFP (" + matches.size() + ")"); _log.debug("selectANFP2("+howMany+"), found enough ANFP (" + matches.size() + ")");
} }
} }