package com.aelitis.azureus.core.peermanager.messaging.bittorrent;
import org.gudy.azureus2.core3.util.DirectByteBuffer;
import org.gudy.azureus2.core3.util.DirectByteBufferPool;
import com.aelitis.azureus.core.peermanager.messaging.Message;
import com.aelitis.azureus.core.peermanager.messaging.MessageException;
public class BTOptimisticHave implements BTMessage {
private DirectByteBuffer buffer = null;
private String description = null;
private final int piece_number;
private final int piece_offset;
private final int length;
private final int hashcode;
public BTOptimisticHave( int piece_number, int piece_offset, int length) {
this.piece_number = piece_number;
this.piece_offset = piece_offset;
this.length = length;
this.hashcode = piece_number + piece_offset + length;
}
public int getPieceNumber() { return piece_number; }
public int getPieceOffset() { return piece_offset; }
public int getLength() { return length; }
public String getID() { return BTMessage.ID_BT_OPTIMISTIC_HAVE; }
public byte[] getIDBytes() { return BTMessage.ID_BT_OPTIMISTIC_HAVE_BYTES; }
public String getFeatureID() { return BTMessage.BT_FEATURE_ID; }
public int getFeatureSubID() { return BTMessage.SUBID_BT_OPTIMISTIC_HAVE; }
public int getType() { return Message.TYPE_PROTOCOL_PAYLOAD; }
public byte getVersion() { return 0; };
public String getDescription() {
if( description == null ) {
description = BTMessage.ID_BT_OPTIMISTIC_HAVE + " piece #" + piece_number + ":" + piece_offset + "->" + (piece_offset + length -1);
}
return description;
}
public DirectByteBuffer[] getData() {
if( buffer == null ) {
buffer = DirectByteBufferPool.getBuffer( DirectByteBuffer.AL_MSG_BT_OPTIMISTIC_HAVE, 12 );
buffer.putInt( DirectByteBuffer.SS_MSG, piece_number );
buffer.putInt( DirectByteBuffer.SS_MSG, piece_offset );
buffer.putInt( DirectByteBuffer.SS_MSG, length );
buffer.flip( DirectByteBuffer.SS_MSG );
}
return new DirectByteBuffer[]{ buffer };
}
public Message deserialize( DirectByteBuffer data, byte version ) throws MessageException {
if( data == null ) {
throw new MessageException( "[" +getID() + "] decode error: data == null" );
}
if( data.remaining( DirectByteBuffer.SS_MSG ) != 12 ) {
throw new MessageException( "[" +getID() + "] decode error: payload.remaining[" +data.remaining( DirectByteBuffer.SS_MSG )+ "] != 12" );
}
int num = data.getInt( DirectByteBuffer.SS_MSG );
if( num < 0 ) {
throw new MessageException( "[" +getID() + "] decode error: num < 0" );
}
int offset = data.getInt( DirectByteBuffer.SS_MSG );
if( offset < 0 ) {
throw new MessageException( "[" +getID() + "] decode error: offset < 0" );
}
int length = data.getInt( DirectByteBuffer.SS_MSG );
if( length < 0 ) {
throw new MessageException( "[" +getID() + "] decode error: length < 0" );
}
data.returnToPool();
return new BTOptimisticHave( num, offset, length );
}
public void destroy() {
if( buffer != null ) buffer.returnToPool();
}
//used for removing individual requests from the message queue
public boolean equals( Object obj ) {
if( this == obj ) return true;
if( obj != null && obj instanceof BTOptimisticHave ) {
BTOptimisticHave other = (BTOptimisticHave)obj;
if( other.piece_number == this.piece_number &&
other.piece_offset == this.piece_offset &&
other.length == this.length ) return true;
}
return false;
}
public int hashCode() { return hashcode; }
}