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

more error handling (thanks frosk)

Browse Source
This commit is contained in:
jrandom
2005-08-30 02:39:37 +00:00
committed by zzz
parent 5f18cec97d
commit b6ea55f7ef
1 changed files with 11 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

14
router/java/src/net/i2p/router/transport/udp/UDPTransport.java
View File

@ -386,7 +386,9 @@ public class UDPTransport extends TransportImpl implements TimedWeightedPriority
public PeerState getPeerState(char capacity) { public PeerState getPeerState(char capacity) {
long now = _context.clock().now(); long now = _context.clock().now();
int index = _context.random().nextInt(1024); int index = _context.random().nextInt(1024);
List peers = _peersByCapacity[capacity-'A']; int cap = capacity - 'A';
if ( (cap < 0) || (cap >= _peersByCapacity.length) ) return null;
List peers = _peersByCapacity[cap];
int size = 0; int size = 0;
int off = 0; int off = 0;
PeerState rv = null; PeerState rv = null;
@ -447,7 +449,10 @@ public class UDPTransport extends TransportImpl implements TimedWeightedPriority
PeerState peer = getPeerState(from); PeerState peer = getPeerState(from);
for (int i = 0; i < capacities.length(); i++) { for (int i = 0; i < capacities.length(); i++) {
char capacity = capacities.charAt(i); char capacity = capacities.charAt(i);
List peers = _peersByCapacity[capacity-'A']; int cap = capacity - 'A';
if ( (cap < 0) || (cap >= _peersByCapacity.length) )
continue;
List peers = _peersByCapacity[cap];
synchronized (peers) { synchronized (peers) {
if ( (peers.size() < MAX_PEERS_PER_CAPACITY) && (!peers.contains(peer)) ) if ( (peers.size() < MAX_PEERS_PER_CAPACITY) && (!peers.contains(peer)) )
peers.add(peer); peers.add(peer);
@ -605,7 +610,10 @@ public class UDPTransport extends TransportImpl implements TimedWeightedPriority
if (capacities != null) { if (capacities != null) {
for (int i = 0; i < capacities.length(); i++) { for (int i = 0; i < capacities.length(); i++) {
char capacity = capacities.charAt(i); char capacity = capacities.charAt(i);
List peers = _peersByCapacity[capacity-'A']; int cap = capacity - 'A';
if ( (cap < 0) || (cap >= _peersByCapacity.length) )
continue;
List peers = _peersByCapacity[cap];
synchronized (peers) { synchronized (peers) {
peers.remove(peer); peers.remove(peer);
} }