return
}
piece.QueuedForHash = true
- t.publishPieceChange(int(pieceIndex))
- go cl.verifyPiece(t, int(pieceIndex))
+ t.publishPieceChange(pieceIndex)
+ go cl.verifyPiece(t, pieceIndex)
}
// Queue a piece check if one isn't already queued, and the piece has never
for i, cp := range pexMsg.Added {
p := Peer{
IP: make([]byte, 4),
- Port: int(cp.Port),
+ Port: cp.Port,
Source: peerSourcePEX,
}
if i < len(pexMsg.AddedFlags) && pexMsg.AddedFlags[i]&0x01 != 0 {
}
addPeers = append(addPeers, Peer{
IP: cp.IP[:],
- Port: int(cp.Port),
+ Port: cp.Port,
Source: peerSourceDHT,
})
key := (&net.UDPAddr{
IP: cp.IP[:],
- Port: int(cp.Port),
+ Port: cp.Port,
}).String()
allAddrs[key] = struct{}{}
}
}
}
p.EverHashed = true
- touchers := me.reapPieceTouches(t, int(piece))
+ touchers := me.reapPieceTouches(t, piece)
if correct {
err := p.Storage().MarkComplete()
if err != nil {
me.dropConnection(t, c)
}
}
- me.pieceChanged(t, int(piece))
+ me.pieceChanged(t, piece)
}
func (me *Client) onCompletedPiece(t *Torrent, piece int) {
}
return pp.Message{
Type: pp.Extended,
- ExtendedID: byte(c.PeerExtensionIDs["ut_metadata"]),
+ ExtendedID: c.PeerExtensionIDs["ut_metadata"],
ExtendedPayload: append(p, data...),
}
}
if piece < 0 || piece >= t.info.NumPieces() {
return
}
- if int(piece) == t.numPieces()-1 {
+ if piece == t.numPieces()-1 {
len_ = pp.Integer(t.length % t.info.PieceLength)
}
if len_ == 0 {