forked from I2P_Developers/i2p.i2p
* (Merged the 0.5-pre branch back into CVS HEAD)
* Replaced the old tunnel routing crypto with the one specified in
router/doc/tunnel-alt.html, including updates to the web console to view
and tweak it.
* Provide the means for routers to reject tunnel requests with a wider
range of responses:
probabalistic rejection, due to approaching overload
transient rejection, due to temporary overload
bandwidth rejection, due to persistent bandwidth overload
critical rejection, due to general router fault (or imminent shutdown)
The different responses are factored into the profiles accordingly.
* Replaced the old I2CP tunnel related options (tunnels.depthInbound, etc)
with a series of new properties, relevent to the new tunnel routing code:
inbound.nickname (used on the console)
inbound.quantity (# of tunnels to use in any leaseSets)
inbound.backupQuantity (# of tunnels to keep in the ready)
inbound.length (# of remote peers in the tunnel)
inbound.lengthVariance (if > 0, permute the length by adding a random #
up to the variance. if < 0, permute the length
by adding or subtracting a random # up to the
variance)
outbound.* (same as the inbound, except for the, uh, outbound tunnels
in that client's pool)
There are other options, and more will be added later, but the above are
the most relevent ones.
* Replaced Jetty 4.2.21 with Jetty 5.1.2
* Compress all profile data on disk.
* Adjust the reseeding functionality to work even when the JVM's http proxy
is set.
* Enable a poor-man's interactive-flow in the streaming lib by choking the
max window size.
* Reduced the default streaming lib max message size to 16KB (though still
configurable by the user), also doubling the default maximum window
size.
* Replaced the RouterIdentity in a Lease with its SHA256 hash.
* Reduced the overall I2NP message checksum from a full 32 byte SHA256 to
the first byte of the SHA256.
* Added a new "netId" flag to let routers drop references to other routers
who we won't be able to talk to.
* Extended the timestamper to get a second (or third) opinion whenever it
wants to actually adjust the clock offset.
* Replaced that kludge of a timestamp I2NP message with a full blown
DateMessage.
* Substantial memory optimizations within the router and the SDK to reduce
GC churn. Client apps and the streaming libs have not been tuned,
however.
* More bugfixes thank you can shake a stick at.
2005-02-13 jrandom
* Updated jbigi source to handle 64bit CPUs. The bundled jbigi.jar still
only contains 32bit versions, so build your own, placing libjbigi.so in
your install dir if necessary. (thanks mule!)
* Added support for libjbigi-$os-athlon64 to NativeBigInteger and CPUID
(thanks spaetz!)
253 lines
11 KiB
Java
253 lines
11 KiB
Java
package net.i2p.data.i2np;
|
|
/*
|
|
* free (adj.): unencumbered; not under the control of others
|
|
* Written by jrandom in 2003 and released into the public domain
|
|
* with no warranty of any kind, either expressed or implied.
|
|
* It probably won't make your computer catch on fire, or eat
|
|
* your children, but it might. Use at your own risk.
|
|
*
|
|
*/
|
|
|
|
import java.io.ByteArrayInputStream;
|
|
import java.io.IOException;
|
|
import java.io.InputStream;
|
|
import java.io.OutputStream;
|
|
|
|
import net.i2p.I2PAppContext;
|
|
import net.i2p.crypto.SHA256EntryCache;
|
|
import net.i2p.data.DataFormatException;
|
|
import net.i2p.data.DataHelper;
|
|
import net.i2p.data.DataStructureImpl;
|
|
import net.i2p.data.Hash;
|
|
import net.i2p.util.Log;
|
|
|
|
/**
|
|
* Defines the base message implementation.
|
|
*
|
|
* @author jrandom
|
|
*/
|
|
public abstract class I2NPMessageImpl extends DataStructureImpl implements I2NPMessage {
|
|
private Log _log;
|
|
protected I2PAppContext _context;
|
|
private long _expiration;
|
|
private long _uniqueId;
|
|
private byte _data[];
|
|
|
|
public final static long DEFAULT_EXPIRATION_MS = 1*60*1000; // 1 minute by default
|
|
public final static int CHECKSUM_LENGTH = 1; //Hash.HASH_LENGTH;
|
|
|
|
public I2NPMessageImpl(I2PAppContext context) {
|
|
_context = context;
|
|
_log = context.logManager().getLog(I2NPMessageImpl.class);
|
|
_expiration = _context.clock().now() + DEFAULT_EXPIRATION_MS;
|
|
_uniqueId = _context.random().nextLong(MAX_ID_VALUE);
|
|
//_context.statManager().createRateStat("i2np.writeTime", "How long it takes to write an I2NP message", "I2NP", new long[] { 10*60*1000, 60*60*1000 });
|
|
//_context.statManager().createRateStat("i2np.readTime", "How long it takes to read an I2NP message", "I2NP", new long[] { 10*60*1000, 60*60*1000 });
|
|
}
|
|
|
|
public void readBytes(InputStream in) throws DataFormatException, IOException {
|
|
try {
|
|
readBytes(in, -1, new byte[1024]);
|
|
} catch (I2NPMessageException ime) {
|
|
throw new DataFormatException("Bad bytes", ime);
|
|
}
|
|
}
|
|
public int readBytes(InputStream in, int type, byte buffer[]) throws I2NPMessageException, IOException {
|
|
try {
|
|
if (type < 0)
|
|
type = (int)DataHelper.readLong(in, 1);
|
|
_uniqueId = DataHelper.readLong(in, 4);
|
|
_expiration = DataHelper.readLong(in, DataHelper.DATE_LENGTH);
|
|
int size = (int)DataHelper.readLong(in, 2);
|
|
byte checksum[] = new byte[CHECKSUM_LENGTH];
|
|
int read = DataHelper.read(in, checksum);
|
|
if (read != CHECKSUM_LENGTH)
|
|
throw new I2NPMessageException("checksum is too small [" + read + "]");
|
|
//Hash h = new Hash();
|
|
//h.readBytes(in);
|
|
if (buffer.length < size) {
|
|
if (size > 64*1024) throw new I2NPMessageException("size=" + size);
|
|
buffer = new byte[size];
|
|
}
|
|
|
|
int cur = 0;
|
|
while (cur < size) {
|
|
int numRead = in.read(buffer, cur, size- cur);
|
|
if (numRead == -1) {
|
|
throw new I2NPMessageException("Payload is too short [" + numRead + ", wanted " + size + "]");
|
|
}
|
|
cur += numRead;
|
|
}
|
|
|
|
SHA256EntryCache.CacheEntry cache = _context.sha().cache().acquire(size);
|
|
Hash calc = _context.sha().calculateHash(buffer, 0, size, cache);
|
|
//boolean eq = calc.equals(h);
|
|
boolean eq = DataHelper.eq(checksum, 0, calc.getData(), 0, CHECKSUM_LENGTH);
|
|
_context.sha().cache().release(cache);
|
|
if (!eq)
|
|
throw new I2NPMessageException("Hash does not match for " + getClass().getName());
|
|
|
|
long start = _context.clock().now();
|
|
if (_log.shouldLog(Log.DEBUG))
|
|
_log.debug("Reading bytes: type = " + type + " / uniqueId : " + _uniqueId + " / expiration : " + _expiration);
|
|
readMessage(buffer, 0, size, type);
|
|
long time = _context.clock().now() - start;
|
|
//if (time > 50)
|
|
// _context.statManager().addRateData("i2np.readTime", time, time);
|
|
return size + Hash.HASH_LENGTH + 1 + 4 + DataHelper.DATE_LENGTH;
|
|
} catch (DataFormatException dfe) {
|
|
throw new I2NPMessageException("Error reading the message header", dfe);
|
|
}
|
|
}
|
|
public int readBytes(byte data[], int type, int offset) throws I2NPMessageException, IOException {
|
|
int cur = offset;
|
|
if (type < 0) {
|
|
type = (int)DataHelper.fromLong(data, cur, 1);
|
|
cur++;
|
|
}
|
|
_uniqueId = DataHelper.fromLong(data, cur, 4);
|
|
cur += 4;
|
|
_expiration = DataHelper.fromLong(data, cur, DataHelper.DATE_LENGTH);
|
|
cur += DataHelper.DATE_LENGTH;
|
|
int size = (int)DataHelper.fromLong(data, cur, 2);
|
|
cur += 2;
|
|
//Hash h = new Hash();
|
|
byte hdata[] = new byte[CHECKSUM_LENGTH];
|
|
System.arraycopy(data, cur, hdata, 0, CHECKSUM_LENGTH);
|
|
cur += CHECKSUM_LENGTH;
|
|
//h.setData(hdata);
|
|
|
|
if (cur + size > data.length)
|
|
throw new I2NPMessageException("Payload is too short ["
|
|
+ "data.len=" + data.length
|
|
+ " offset=" + offset
|
|
+ " cur=" + cur
|
|
+ " wanted=" + size + "]");
|
|
|
|
SHA256EntryCache.CacheEntry cache = _context.sha().cache().acquire(size);
|
|
Hash calc = _context.sha().calculateHash(data, cur, size, cache);
|
|
//boolean eq = calc.equals(h);
|
|
boolean eq = DataHelper.eq(hdata, 0, calc.getData(), 0, CHECKSUM_LENGTH);
|
|
_context.sha().cache().release(cache);
|
|
if (!eq)
|
|
throw new I2NPMessageException("Hash does not match for " + getClass().getName());
|
|
|
|
long start = _context.clock().now();
|
|
if (_log.shouldLog(Log.DEBUG))
|
|
_log.debug("Reading bytes: type = " + type + " / uniqueId : " + _uniqueId + " / expiration : " + _expiration);
|
|
readMessage(data, cur, size, type);
|
|
cur += size;
|
|
long time = _context.clock().now() - start;
|
|
//if (time > 50)
|
|
// _context.statManager().addRateData("i2np.readTime", time, time);
|
|
return cur - offset;
|
|
}
|
|
|
|
public void writeBytes(OutputStream out) throws DataFormatException, IOException {
|
|
int size = getMessageSize();
|
|
if (size < 15 + CHECKSUM_LENGTH) throw new DataFormatException("Unable to build the message");
|
|
byte buf[] = new byte[size];
|
|
int read = toByteArray(buf);
|
|
if (read < 0)
|
|
out.write(buf, 0, read);
|
|
}
|
|
|
|
/**
|
|
* Replay resistent message Id
|
|
*/
|
|
public long getUniqueId() { return _uniqueId; }
|
|
public void setUniqueId(long id) { _uniqueId = id; }
|
|
|
|
/**
|
|
* Date after which the message should be dropped (and the associated uniqueId forgotten)
|
|
*
|
|
*/
|
|
public long getMessageExpiration() { return _expiration; }
|
|
public void setMessageExpiration(long exp) { _expiration = exp; }
|
|
|
|
public synchronized int getMessageSize() {
|
|
return calculateWrittenLength()+15 + CHECKSUM_LENGTH; // 47 bytes in the header
|
|
}
|
|
|
|
public byte[] toByteArray() {
|
|
byte data[] = new byte[getMessageSize()];
|
|
int written = toByteArray(data);
|
|
if (written != data.length) {
|
|
_log.log(Log.CRIT, "Error writing out " + data.length + " (written: " + written + ", msgSize: " + getMessageSize() +
|
|
", writtenLen: " + calculateWrittenLength() + ") for " + getClass().getName());
|
|
return null;
|
|
}
|
|
return data;
|
|
}
|
|
|
|
public int toByteArray(byte buffer[]) {
|
|
long start = _context.clock().now();
|
|
|
|
int prefixLen = 1 // type
|
|
+ 4 // uniqueId
|
|
+ DataHelper.DATE_LENGTH // expiration
|
|
+ 2 // payload length
|
|
+ CHECKSUM_LENGTH; // walnuts
|
|
//byte prefix[][] = new byte[][] { DataHelper.toLong(1, getType()),
|
|
// DataHelper.toLong(4, _uniqueId),
|
|
// DataHelper.toLong(DataHelper.DATE_LENGTH, _expiration),
|
|
// new byte[2],
|
|
// new byte[CHECKSUM_LENGTH]};
|
|
//byte suffix[][] = new byte[][] { };
|
|
try {
|
|
int writtenLen = writeMessageBody(buffer, prefixLen);
|
|
int payloadLen = writtenLen - prefixLen;
|
|
SHA256EntryCache.CacheEntry cache = _context.sha().cache().acquire(payloadLen);
|
|
Hash h = _context.sha().calculateHash(buffer, prefixLen, payloadLen, cache);
|
|
|
|
int off = 0;
|
|
DataHelper.toLong(buffer, off, 1, getType());
|
|
off += 1;
|
|
DataHelper.toLong(buffer, off, 4, _uniqueId);
|
|
off += 4;
|
|
DataHelper.toLong(buffer, off, DataHelper.DATE_LENGTH, _expiration);
|
|
off += DataHelper.DATE_LENGTH;
|
|
DataHelper.toLong(buffer, off, 2, payloadLen);
|
|
off += 2;
|
|
System.arraycopy(h.getData(), 0, buffer, off, CHECKSUM_LENGTH);
|
|
_context.sha().cache().release(cache);
|
|
|
|
long time = _context.clock().now() - start;
|
|
//if (time > 50)
|
|
// _context.statManager().addRateData("i2np.writeTime", time, time);
|
|
|
|
return writtenLen;
|
|
} catch (I2NPMessageException ime) {
|
|
_context.logManager().getLog(getClass()).log(Log.CRIT, "Error writing", ime);
|
|
throw new IllegalStateException("Unable to serialize the message (" + getClass().getName()
|
|
+ "): " + ime.getMessage());
|
|
}
|
|
}
|
|
|
|
/** calculate the message body's length (not including the header and footer */
|
|
protected abstract int calculateWrittenLength();
|
|
/**
|
|
* write the message body to the output array, starting at the given index.
|
|
* @return the index into the array after the last byte written
|
|
*/
|
|
protected abstract int writeMessageBody(byte out[], int curIndex) throws I2NPMessageException;
|
|
/*
|
|
protected int toByteArray(byte out[], byte[][] prefix, byte[][] suffix) throws I2NPMessageException {
|
|
int curIndex = 0;
|
|
for (int i = 0; i < prefix.length; i++) {
|
|
System.arraycopy(prefix[i], 0, out, curIndex, prefix[i].length);
|
|
curIndex += prefix[i].length;
|
|
}
|
|
|
|
curIndex = writeMessageBody(out, curIndex);
|
|
|
|
for (int i = 0; i < suffix.length; i++) {
|
|
System.arraycopy(suffix[i], 0, out, curIndex, suffix[i].length);
|
|
curIndex += suffix[i].length;
|
|
}
|
|
|
|
return curIndex;
|
|
}
|
|
*/
|
|
}
|