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

ProfileOrganizer: More efficient slice calculation,

Browse Source 
don't pollute Hash cache
This commit is contained in:
zzz
2014-11-08 17:57:17 +00:00
parent 5f1e5bc271
commit cb87f9f307
1 changed files with 5 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -1334,12 +1334,13 @@ public class ProfileOrganizer {
* others. * others.
* @return 0-3 * @return 0-3
*/ */
private static int getSubTier(Hash peer, Hash randomKey) { private int getSubTier(Hash peer, Hash randomKey) {
byte[] data = new byte[Hash.HASH_LENGTH + 4]; // input is first 36 bytes; output is last 32 bytes
byte[] data = new byte[Hash.HASH_LENGTH + 4 + Hash.HASH_LENGTH];
System.arraycopy(peer.getData(), 0, data, 0, Hash.HASH_LENGTH); System.arraycopy(peer.getData(), 0, data, 0, Hash.HASH_LENGTH);
System.arraycopy(randomKey.getData(), 0, data, Hash.HASH_LENGTH, 4); System.arraycopy(randomKey.getData(), 0, data, Hash.HASH_LENGTH, 4);
Hash rh = SHA256Generator.getInstance().calculateHash(data); _context.sha().calculateHash(data, 0, Hash.HASH_LENGTH + 4, data, Hash.HASH_LENGTH + 4);
return rh.getData()[0] & 0x03; return data[Hash.HASH_LENGTH + 4] & 0x03;
} }
public boolean isSelectable(Hash peer) { public boolean isSelectable(Hash peer) {