2014-04-09 00:36:05 +08:00
|
|
|
/*
|
|
|
|
Package torrent implements a torrent client.
|
|
|
|
|
|
|
|
Simple example:
|
|
|
|
|
|
|
|
c := &Client{}
|
|
|
|
c.Start()
|
|
|
|
defer c.Stop()
|
|
|
|
if err := c.AddTorrent(externalMetaInfoPackageSux); err != nil {
|
|
|
|
return fmt.Errors("error adding torrent: %s", err)
|
|
|
|
}
|
|
|
|
c.WaitAll()
|
|
|
|
log.Print("erhmahgerd, torrent downloaded")
|
|
|
|
|
|
|
|
*/
|
2013-09-26 17:49:15 +08:00
|
|
|
package torrent
|
|
|
|
|
|
|
|
import (
|
2013-09-30 19:51:08 +08:00
|
|
|
"bufio"
|
2013-09-29 14:45:17 +08:00
|
|
|
"container/list"
|
2013-09-29 06:11:24 +08:00
|
|
|
"crypto/rand"
|
2014-06-26 22:57:07 +08:00
|
|
|
"crypto/sha1"
|
2013-09-26 17:49:15 +08:00
|
|
|
"errors"
|
2013-10-07 15:58:33 +08:00
|
|
|
"fmt"
|
2013-09-26 17:49:15 +08:00
|
|
|
"io"
|
2013-09-29 06:11:24 +08:00
|
|
|
"log"
|
2014-03-16 23:30:10 +08:00
|
|
|
mathRand "math/rand"
|
2013-09-29 06:11:24 +08:00
|
|
|
"net"
|
2013-09-26 17:49:15 +08:00
|
|
|
"os"
|
2013-10-20 22:07:01 +08:00
|
|
|
"sync"
|
2014-04-03 20:16:59 +08:00
|
|
|
"syscall"
|
2013-10-20 22:07:01 +08:00
|
|
|
"time"
|
2014-03-20 13:58:09 +08:00
|
|
|
|
2014-06-28 17:38:31 +08:00
|
|
|
"github.com/anacrolix/libtorgo/metainfo"
|
|
|
|
"github.com/nsf/libtorgo/bencode"
|
2014-03-20 13:58:09 +08:00
|
|
|
|
2014-05-21 16:01:58 +08:00
|
|
|
pp "bitbucket.org/anacrolix/go.torrent/peer_protocol"
|
2014-03-20 13:58:09 +08:00
|
|
|
"bitbucket.org/anacrolix/go.torrent/tracker"
|
|
|
|
_ "bitbucket.org/anacrolix/go.torrent/tracker/udp"
|
2013-09-26 17:49:15 +08:00
|
|
|
)
|
|
|
|
|
2014-03-16 23:30:10 +08:00
|
|
|
// Currently doesn't really queue, but should in the future.
|
2014-05-21 16:01:58 +08:00
|
|
|
func (cl *Client) queuePieceCheck(t *torrent, pieceIndex pp.Integer) {
|
2013-10-20 22:07:01 +08:00
|
|
|
piece := t.Pieces[pieceIndex]
|
2014-03-20 01:30:08 +08:00
|
|
|
if piece.QueuedForHash {
|
2013-10-20 22:07:01 +08:00
|
|
|
return
|
|
|
|
}
|
2014-03-20 01:30:08 +08:00
|
|
|
piece.QueuedForHash = true
|
2013-10-20 22:07:01 +08:00
|
|
|
go cl.verifyPiece(t, pieceIndex)
|
|
|
|
}
|
|
|
|
|
2014-04-09 00:36:05 +08:00
|
|
|
// Queues the torrent data for the given region for download. The beginning of
|
|
|
|
// the region is given highest priority to allow a subsequent read at the same
|
|
|
|
// offset to return data ASAP.
|
|
|
|
func (me *Client) PrioritizeDataRegion(ih InfoHash, off, len_ int64) error {
|
|
|
|
me.mu.Lock()
|
|
|
|
defer me.mu.Unlock()
|
|
|
|
t := me.torrent(ih)
|
2014-04-08 23:15:39 +08:00
|
|
|
if t == nil {
|
|
|
|
return errors.New("no such active torrent")
|
|
|
|
}
|
2014-06-28 17:38:31 +08:00
|
|
|
if !t.haveInfo() {
|
2014-06-26 22:57:07 +08:00
|
|
|
return errors.New("missing metadata")
|
|
|
|
}
|
2014-04-16 19:13:44 +08:00
|
|
|
newPriorities := make([]request, 0, (len_+chunkSize-1)/chunkSize)
|
2014-03-20 01:30:08 +08:00
|
|
|
for len_ > 0 {
|
2014-03-20 13:58:09 +08:00
|
|
|
req, ok := t.offsetRequest(off)
|
|
|
|
if !ok {
|
2014-04-08 23:15:39 +08:00
|
|
|
return errors.New("bad offset")
|
2014-03-17 22:44:22 +08:00
|
|
|
}
|
2014-04-08 23:15:39 +08:00
|
|
|
reqOff := t.requestOffset(req)
|
|
|
|
// Gain the alignment adjustment.
|
|
|
|
len_ += off - reqOff
|
|
|
|
// Lose the length of this block.
|
2014-03-20 13:58:09 +08:00
|
|
|
len_ -= int64(req.Length)
|
2014-04-08 23:15:39 +08:00
|
|
|
off = reqOff + int64(req.Length)
|
|
|
|
if !t.wantPiece(int(req.Index)) {
|
2013-10-20 22:07:01 +08:00
|
|
|
continue
|
2013-10-14 22:39:12 +08:00
|
|
|
}
|
2014-03-20 13:58:09 +08:00
|
|
|
newPriorities = append(newPriorities, req)
|
2013-10-14 22:39:12 +08:00
|
|
|
}
|
2014-03-20 01:30:08 +08:00
|
|
|
if len(newPriorities) == 0 {
|
2014-04-08 23:15:39 +08:00
|
|
|
return nil
|
2013-10-14 22:39:12 +08:00
|
|
|
}
|
|
|
|
t.Priorities.PushFront(newPriorities[0])
|
|
|
|
for _, req := range newPriorities[1:] {
|
|
|
|
t.Priorities.PushBack(req)
|
|
|
|
}
|
2013-10-20 22:07:01 +08:00
|
|
|
for _, cn := range t.Conns {
|
2014-04-09 00:36:05 +08:00
|
|
|
me.replenishConnRequests(t, cn)
|
2013-10-20 22:07:01 +08:00
|
|
|
}
|
2014-04-08 23:15:39 +08:00
|
|
|
return nil
|
2013-09-29 06:11:24 +08:00
|
|
|
}
|
|
|
|
|
2014-04-09 00:36:05 +08:00
|
|
|
type dataSpec struct {
|
2013-10-13 20:16:21 +08:00
|
|
|
InfoHash
|
2014-04-16 19:13:44 +08:00
|
|
|
request
|
2013-10-13 20:16:21 +08:00
|
|
|
}
|
|
|
|
|
2013-10-06 15:01:39 +08:00
|
|
|
type Client struct {
|
2014-05-21 15:40:54 +08:00
|
|
|
DataDir string
|
|
|
|
HalfOpenLimit int
|
|
|
|
PeerId [20]byte
|
|
|
|
Listener net.Listener
|
|
|
|
DisableTrackers bool
|
|
|
|
DownloadStrategy DownloadStrategy
|
2013-09-29 06:11:24 +08:00
|
|
|
|
2014-04-09 00:36:05 +08:00
|
|
|
mu sync.Mutex
|
2013-10-20 22:07:01 +08:00
|
|
|
event sync.Cond
|
2014-03-18 19:39:33 +08:00
|
|
|
quit chan struct{}
|
2013-10-20 22:07:01 +08:00
|
|
|
|
2014-03-20 01:30:08 +08:00
|
|
|
halfOpen int
|
2014-04-09 00:36:05 +08:00
|
|
|
torrents map[InfoHash]*torrent
|
2014-03-20 01:30:08 +08:00
|
|
|
dataWaiter chan struct{}
|
2013-09-26 17:49:15 +08:00
|
|
|
}
|
|
|
|
|
2014-06-26 15:29:12 +08:00
|
|
|
func (cl *Client) WriteStatus(w io.Writer) {
|
|
|
|
cl.mu.Lock()
|
|
|
|
defer cl.mu.Unlock()
|
|
|
|
for _, t := range cl.torrents {
|
2014-06-29 16:56:19 +08:00
|
|
|
fmt.Fprintf(w, "%s: %f%%\n", t.Name(), func() float32 {
|
|
|
|
if !t.haveInfo() {
|
|
|
|
return 0
|
|
|
|
} else {
|
|
|
|
return 100 * (1 - float32(t.BytesLeft())/float32(t.Length()))
|
|
|
|
}
|
|
|
|
}())
|
2014-06-26 15:29:12 +08:00
|
|
|
t.WriteStatus(w)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2014-04-09 00:36:05 +08:00
|
|
|
// Read torrent data at the given offset. Returns ErrDataNotReady if the data
|
|
|
|
// isn't available.
|
2013-10-13 20:16:21 +08:00
|
|
|
func (cl *Client) TorrentReadAt(ih InfoHash, off int64, p []byte) (n int, err error) {
|
2013-10-20 22:07:01 +08:00
|
|
|
cl.mu.Lock()
|
|
|
|
defer cl.mu.Unlock()
|
|
|
|
t := cl.torrent(ih)
|
|
|
|
if t == nil {
|
|
|
|
err = errors.New("unknown torrent")
|
|
|
|
return
|
|
|
|
}
|
2014-06-28 17:38:31 +08:00
|
|
|
index := pp.Integer(off / int64(t.UsualPieceSize()))
|
2014-03-17 22:44:22 +08:00
|
|
|
// Reading outside the bounds of a file is an error.
|
|
|
|
if index < 0 {
|
|
|
|
err = os.ErrInvalid
|
|
|
|
return
|
|
|
|
}
|
|
|
|
if int(index) >= len(t.Pieces) {
|
|
|
|
err = io.EOF
|
|
|
|
return
|
|
|
|
}
|
2014-05-22 22:33:07 +08:00
|
|
|
t.lastReadPiece = int(index)
|
2013-10-20 22:07:01 +08:00
|
|
|
piece := t.Pieces[index]
|
2014-05-21 16:01:58 +08:00
|
|
|
pieceOff := pp.Integer(off % int64(t.PieceLength(0)))
|
2013-10-20 22:07:01 +08:00
|
|
|
high := int(t.PieceLength(index) - pieceOff)
|
|
|
|
if high < len(p) {
|
|
|
|
p = p[:high]
|
|
|
|
}
|
|
|
|
for cs, _ := range piece.PendingChunkSpecs {
|
|
|
|
chunkOff := int64(pieceOff) - int64(cs.Begin)
|
|
|
|
if chunkOff >= int64(t.PieceLength(index)) {
|
|
|
|
panic(chunkOff)
|
2013-10-13 20:16:21 +08:00
|
|
|
}
|
2013-10-20 22:07:01 +08:00
|
|
|
if 0 <= chunkOff && chunkOff < int64(cs.Length) {
|
|
|
|
// read begins in a pending chunk
|
2013-10-13 20:16:21 +08:00
|
|
|
err = ErrDataNotReady
|
|
|
|
return
|
|
|
|
}
|
2013-10-20 22:07:01 +08:00
|
|
|
// pending chunk caps available data
|
|
|
|
if chunkOff < 0 && int64(len(p)) > -chunkOff {
|
|
|
|
p = p[:-chunkOff]
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return t.Data.ReadAt(p, off)
|
2013-10-13 20:16:21 +08:00
|
|
|
}
|
2013-09-26 17:49:15 +08:00
|
|
|
|
2014-05-21 15:42:06 +08:00
|
|
|
// Starts the client. Defaults are applied. The client will begin accepting
|
|
|
|
// connections and tracking.
|
2013-10-13 20:16:21 +08:00
|
|
|
func (c *Client) Start() {
|
2014-04-09 00:36:05 +08:00
|
|
|
c.event.L = &c.mu
|
|
|
|
c.torrents = make(map[InfoHash]*torrent)
|
2013-10-14 22:39:12 +08:00
|
|
|
if c.HalfOpenLimit == 0 {
|
|
|
|
c.HalfOpenLimit = 10
|
|
|
|
}
|
2013-10-02 18:12:05 +08:00
|
|
|
o := copy(c.PeerId[:], BEP20)
|
|
|
|
_, err := rand.Read(c.PeerId[o:])
|
2013-09-29 06:11:24 +08:00
|
|
|
if err != nil {
|
|
|
|
panic("error generating peer id")
|
|
|
|
}
|
2014-03-18 19:39:33 +08:00
|
|
|
c.quit = make(chan struct{})
|
2014-05-21 15:40:54 +08:00
|
|
|
if c.DownloadStrategy == nil {
|
2014-05-23 19:01:05 +08:00
|
|
|
c.DownloadStrategy = &DefaultDownloadStrategy{}
|
2014-05-21 15:40:54 +08:00
|
|
|
}
|
2014-03-17 22:44:22 +08:00
|
|
|
if c.Listener != nil {
|
|
|
|
go c.acceptConnections()
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2014-03-20 13:58:09 +08:00
|
|
|
func (cl *Client) stopped() bool {
|
|
|
|
select {
|
|
|
|
case <-cl.quit:
|
|
|
|
return true
|
|
|
|
default:
|
|
|
|
return false
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2014-04-09 00:36:05 +08:00
|
|
|
// Stops the client. All connections to peers are closed and all activity will
|
|
|
|
// come to a halt.
|
2014-03-18 19:39:33 +08:00
|
|
|
func (me *Client) Stop() {
|
2014-04-09 00:36:05 +08:00
|
|
|
me.mu.Lock()
|
2014-03-18 19:39:33 +08:00
|
|
|
close(me.quit)
|
|
|
|
me.event.Broadcast()
|
|
|
|
for _, t := range me.torrents {
|
|
|
|
for _, c := range t.Conns {
|
|
|
|
c.Close()
|
|
|
|
}
|
|
|
|
}
|
2014-04-09 00:36:05 +08:00
|
|
|
me.mu.Unlock()
|
2014-03-18 19:39:33 +08:00
|
|
|
}
|
|
|
|
|
2014-03-17 22:44:22 +08:00
|
|
|
func (cl *Client) acceptConnections() {
|
|
|
|
for {
|
|
|
|
conn, err := cl.Listener.Accept()
|
2014-03-18 19:39:33 +08:00
|
|
|
select {
|
|
|
|
case <-cl.quit:
|
|
|
|
return
|
|
|
|
default:
|
|
|
|
}
|
2014-03-17 22:44:22 +08:00
|
|
|
if err != nil {
|
|
|
|
log.Print(err)
|
|
|
|
return
|
|
|
|
}
|
|
|
|
go func() {
|
|
|
|
if err := cl.runConnection(conn, nil); err != nil {
|
|
|
|
log.Print(err)
|
|
|
|
}
|
|
|
|
}()
|
|
|
|
}
|
2013-09-26 17:49:15 +08:00
|
|
|
}
|
|
|
|
|
2014-04-09 00:36:05 +08:00
|
|
|
func (me *Client) torrent(ih InfoHash) *torrent {
|
2013-09-29 06:11:24 +08:00
|
|
|
for _, t := range me.torrents {
|
|
|
|
if t.InfoHash == ih {
|
|
|
|
return t
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return nil
|
|
|
|
}
|
|
|
|
|
2014-04-09 00:36:05 +08:00
|
|
|
func (me *Client) initiateConn(peer Peer, torrent *torrent) {
|
2013-09-29 06:11:24 +08:00
|
|
|
if peer.Id == me.PeerId {
|
|
|
|
return
|
|
|
|
}
|
|
|
|
me.halfOpen++
|
|
|
|
go func() {
|
2014-04-03 20:16:59 +08:00
|
|
|
addr := &net.TCPAddr{
|
2013-09-29 06:11:24 +08:00
|
|
|
IP: peer.IP,
|
|
|
|
Port: peer.Port,
|
2014-04-03 20:16:59 +08:00
|
|
|
}
|
|
|
|
conn, err := net.DialTimeout(addr.Network(), addr.String(), dialTimeout)
|
2013-10-20 22:07:01 +08:00
|
|
|
|
2014-04-03 20:16:59 +08:00
|
|
|
go func() {
|
|
|
|
me.mu.Lock()
|
|
|
|
defer me.mu.Unlock()
|
|
|
|
if me.halfOpen == 0 {
|
|
|
|
panic("assert")
|
|
|
|
}
|
|
|
|
me.halfOpen--
|
|
|
|
me.openNewConns()
|
|
|
|
}()
|
2013-10-20 22:07:01 +08:00
|
|
|
|
2014-04-03 20:16:59 +08:00
|
|
|
if netOpErr, ok := err.(*net.OpError); ok {
|
|
|
|
if netOpErr.Timeout() {
|
|
|
|
return
|
|
|
|
}
|
|
|
|
switch netOpErr.Err {
|
2014-04-08 17:40:10 +08:00
|
|
|
case syscall.ECONNREFUSED, syscall.EHOSTUNREACH:
|
2014-04-03 20:16:59 +08:00
|
|
|
return
|
|
|
|
}
|
|
|
|
}
|
2013-09-29 06:11:24 +08:00
|
|
|
if err != nil {
|
2014-04-03 20:16:59 +08:00
|
|
|
log.Printf("error connecting to peer: %s %#v", err, err)
|
2013-09-29 06:11:24 +08:00
|
|
|
return
|
|
|
|
}
|
2013-09-30 19:51:08 +08:00
|
|
|
log.Printf("connected to %s", conn.RemoteAddr())
|
2014-03-17 22:44:22 +08:00
|
|
|
err = me.runConnection(conn, torrent)
|
2013-10-15 16:42:30 +08:00
|
|
|
if err != nil {
|
|
|
|
log.Print(err)
|
|
|
|
}
|
2013-09-29 06:11:24 +08:00
|
|
|
}()
|
|
|
|
}
|
|
|
|
|
2014-06-29 16:57:49 +08:00
|
|
|
func (cl *Client) incomingPeerPort() int {
|
|
|
|
if cl.Listener == nil {
|
|
|
|
return 0
|
|
|
|
}
|
|
|
|
_, p, err := net.SplitHostPort(cl.Listener.Addr().String())
|
|
|
|
if err != nil {
|
|
|
|
panic(err)
|
|
|
|
}
|
|
|
|
var i int
|
|
|
|
_, err = fmt.Sscanf(p, "%d", &i)
|
|
|
|
if err != nil {
|
|
|
|
panic(err)
|
|
|
|
}
|
|
|
|
return i
|
|
|
|
}
|
|
|
|
|
2014-04-09 00:36:05 +08:00
|
|
|
func (me *Client) runConnection(sock net.Conn, torrent *torrent) (err error) {
|
|
|
|
conn := &connection{
|
2014-05-21 15:47:42 +08:00
|
|
|
Socket: sock,
|
|
|
|
Choked: true,
|
|
|
|
PeerChoked: true,
|
|
|
|
write: make(chan []byte),
|
2014-05-28 23:27:48 +08:00
|
|
|
post: make(chan pp.Message),
|
2014-06-26 22:57:07 +08:00
|
|
|
PeerMaxRequests: 64,
|
2013-09-29 14:45:17 +08:00
|
|
|
}
|
2014-03-20 19:01:56 +08:00
|
|
|
defer func() {
|
|
|
|
// There's a lock and deferred unlock later in this function. The
|
|
|
|
// client will not be locked when this deferred is invoked.
|
|
|
|
me.mu.Lock()
|
|
|
|
defer me.mu.Unlock()
|
|
|
|
conn.Close()
|
|
|
|
}()
|
2013-09-29 14:45:17 +08:00
|
|
|
go conn.writer()
|
2014-05-28 23:27:48 +08:00
|
|
|
// go conn.writeOptimizer()
|
|
|
|
conn.write <- pp.Bytes(pp.Protocol)
|
2014-06-26 22:57:07 +08:00
|
|
|
conn.write <- pp.Bytes("\x00\x00\x00\x00\x00\x10\x00\x00")
|
2013-09-29 14:45:17 +08:00
|
|
|
if torrent != nil {
|
2014-05-28 23:27:48 +08:00
|
|
|
conn.write <- pp.Bytes(torrent.InfoHash[:])
|
|
|
|
conn.write <- pp.Bytes(me.PeerId[:])
|
2013-09-29 14:45:17 +08:00
|
|
|
}
|
|
|
|
var b [28]byte
|
2013-10-15 16:42:30 +08:00
|
|
|
_, err = io.ReadFull(conn.Socket, b[:])
|
2014-03-20 21:14:17 +08:00
|
|
|
if err == io.EOF {
|
|
|
|
return nil
|
|
|
|
}
|
2013-10-20 22:07:01 +08:00
|
|
|
if err != nil {
|
2013-10-14 22:39:12 +08:00
|
|
|
err = fmt.Errorf("when reading protocol and extensions: %s", err)
|
|
|
|
return
|
2013-09-29 14:45:17 +08:00
|
|
|
}
|
2014-05-21 16:01:58 +08:00
|
|
|
if string(b[:20]) != pp.Protocol {
|
2013-10-14 22:39:12 +08:00
|
|
|
err = fmt.Errorf("wrong protocol: %#v", string(b[:20]))
|
2013-09-29 14:45:17 +08:00
|
|
|
return
|
|
|
|
}
|
|
|
|
if 8 != copy(conn.PeerExtensions[:], b[20:]) {
|
|
|
|
panic("wtf")
|
|
|
|
}
|
2014-03-20 21:14:17 +08:00
|
|
|
// log.Printf("peer extensions: %#v", string(conn.PeerExtensions[:]))
|
2013-09-29 14:45:17 +08:00
|
|
|
var infoHash [20]byte
|
|
|
|
_, err = io.ReadFull(conn.Socket, infoHash[:])
|
|
|
|
if err != nil {
|
2013-10-20 22:07:01 +08:00
|
|
|
return fmt.Errorf("reading peer info hash: %s", err)
|
2013-09-29 14:45:17 +08:00
|
|
|
}
|
|
|
|
_, err = io.ReadFull(conn.Socket, conn.PeerId[:])
|
|
|
|
if err != nil {
|
2013-10-20 22:07:01 +08:00
|
|
|
return fmt.Errorf("reading peer id: %s", err)
|
2013-09-29 14:45:17 +08:00
|
|
|
}
|
|
|
|
if torrent == nil {
|
|
|
|
torrent = me.torrent(infoHash)
|
|
|
|
if torrent == nil {
|
|
|
|
return
|
|
|
|
}
|
2014-05-28 23:27:48 +08:00
|
|
|
conn.write <- pp.Bytes(torrent.InfoHash[:])
|
|
|
|
conn.write <- pp.Bytes(me.PeerId[:])
|
2013-09-29 14:45:17 +08:00
|
|
|
}
|
2013-10-20 22:07:01 +08:00
|
|
|
me.mu.Lock()
|
2014-03-16 23:30:10 +08:00
|
|
|
defer me.mu.Unlock()
|
|
|
|
if !me.addConnection(torrent, conn) {
|
|
|
|
return
|
|
|
|
}
|
2014-05-28 23:27:48 +08:00
|
|
|
go conn.writeOptimizer(time.Minute)
|
2014-06-26 22:57:07 +08:00
|
|
|
if conn.PeerExtensions[5]&0x10 != 0 {
|
|
|
|
conn.Post(pp.Message{
|
|
|
|
Type: pp.Extended,
|
|
|
|
ExtendedID: pp.HandshakeExtendedID,
|
|
|
|
ExtendedPayload: func() []byte {
|
2014-06-28 17:38:31 +08:00
|
|
|
d := map[string]interface{}{
|
2014-06-26 22:57:07 +08:00
|
|
|
"m": map[string]int{
|
|
|
|
"ut_metadata": 1,
|
2014-06-29 17:07:43 +08:00
|
|
|
"ut_pex": 2,
|
2014-06-26 22:57:07 +08:00
|
|
|
},
|
2014-06-29 16:57:49 +08:00
|
|
|
"v": "go.torrent dev",
|
2014-06-28 17:38:31 +08:00
|
|
|
}
|
|
|
|
if torrent.metadataSizeKnown() {
|
|
|
|
d["metadata_size"] = torrent.metadataSize()
|
|
|
|
}
|
2014-06-29 16:57:49 +08:00
|
|
|
if p := me.incomingPeerPort(); p != 0 {
|
|
|
|
d["p"] = p
|
|
|
|
}
|
2014-06-28 17:38:31 +08:00
|
|
|
b, err := bencode.Marshal(d)
|
2014-06-26 22:57:07 +08:00
|
|
|
if err != nil {
|
|
|
|
panic(err)
|
|
|
|
}
|
|
|
|
return b
|
|
|
|
}(),
|
|
|
|
})
|
|
|
|
}
|
2013-10-20 22:07:01 +08:00
|
|
|
if torrent.haveAnyPieces() {
|
2014-05-21 16:01:58 +08:00
|
|
|
conn.Post(pp.Message{
|
|
|
|
Type: pp.Bitfield,
|
2013-10-20 22:07:01 +08:00
|
|
|
Bitfield: torrent.bitfield(),
|
|
|
|
})
|
|
|
|
}
|
|
|
|
err = me.connectionLoop(torrent, conn)
|
|
|
|
if err != nil {
|
2013-10-22 15:00:35 +08:00
|
|
|
err = fmt.Errorf("during Connection loop: %s", err)
|
2013-10-20 22:07:01 +08:00
|
|
|
}
|
|
|
|
me.dropConnection(torrent, conn)
|
2013-10-15 16:42:30 +08:00
|
|
|
return
|
2013-09-30 19:51:08 +08:00
|
|
|
}
|
|
|
|
|
2014-06-26 22:57:07 +08:00
|
|
|
func (me *Client) peerGotPiece(t *torrent, c *connection, piece int) {
|
|
|
|
for piece >= len(c.PeerPieces) {
|
|
|
|
c.PeerPieces = append(c.PeerPieces, false)
|
2013-10-01 16:43:18 +08:00
|
|
|
}
|
2014-06-26 22:57:07 +08:00
|
|
|
c.PeerPieces[piece] = true
|
|
|
|
if t.wantPiece(piece) {
|
|
|
|
me.replenishConnRequests(t, c)
|
2013-09-30 19:51:08 +08:00
|
|
|
}
|
2013-10-01 16:43:18 +08:00
|
|
|
}
|
|
|
|
|
2014-04-09 00:36:05 +08:00
|
|
|
func (me *Client) peerUnchoked(torrent *torrent, conn *connection) {
|
2013-10-01 16:43:18 +08:00
|
|
|
me.replenishConnRequests(torrent, conn)
|
2013-09-30 19:51:08 +08:00
|
|
|
}
|
|
|
|
|
2014-05-23 19:01:05 +08:00
|
|
|
func (cl *Client) connCancel(t *torrent, cn *connection, r request) (ok bool) {
|
|
|
|
ok = cn.Cancel(r)
|
|
|
|
if ok {
|
|
|
|
cl.DownloadStrategy.DeleteRequest(t, r)
|
|
|
|
}
|
|
|
|
return
|
|
|
|
}
|
|
|
|
|
|
|
|
func (cl *Client) connDeleteRequest(t *torrent, cn *connection, r request) {
|
|
|
|
if !cn.RequestPending(r) {
|
|
|
|
return
|
|
|
|
}
|
|
|
|
cl.DownloadStrategy.DeleteRequest(t, r)
|
|
|
|
delete(cn.Requests, r)
|
|
|
|
}
|
|
|
|
|
2014-06-26 22:57:07 +08:00
|
|
|
func (cl *Client) requestPendingMetadata(t *torrent, c *connection) {
|
2014-06-27 16:57:35 +08:00
|
|
|
if t.haveInfo() {
|
|
|
|
return
|
|
|
|
}
|
2014-06-26 22:57:07 +08:00
|
|
|
var pending []int
|
2014-06-28 17:38:31 +08:00
|
|
|
for index := 0; index < t.MetadataPieceCount(); index++ {
|
|
|
|
if !t.HaveMetadataPiece(index) {
|
2014-06-26 22:57:07 +08:00
|
|
|
pending = append(pending, index)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
for _, i := range mathRand.Perm(len(pending)) {
|
|
|
|
c.Post(pp.Message{
|
|
|
|
Type: pp.Extended,
|
|
|
|
ExtendedID: byte(c.PeerExtensionIDs["ut_metadata"]),
|
|
|
|
ExtendedPayload: func() []byte {
|
|
|
|
b, err := bencode.Marshal(map[string]int{
|
|
|
|
"msg_type": 0,
|
|
|
|
"piece": pending[i],
|
|
|
|
})
|
|
|
|
if err != nil {
|
|
|
|
panic(err)
|
|
|
|
}
|
|
|
|
return b
|
|
|
|
}(),
|
|
|
|
})
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2014-06-28 17:38:31 +08:00
|
|
|
func (cl *Client) completedMetadata(t *torrent) {
|
|
|
|
h := sha1.New()
|
|
|
|
h.Write(t.MetaData)
|
|
|
|
var ih InfoHash
|
|
|
|
copy(ih[:], h.Sum(nil)[:])
|
|
|
|
if ih != t.InfoHash {
|
|
|
|
log.Print("bad metadata")
|
|
|
|
t.InvalidateMetadata()
|
|
|
|
return
|
|
|
|
}
|
|
|
|
var info metainfo.Info
|
|
|
|
err := bencode.Unmarshal(t.MetaData, &info)
|
|
|
|
if err != nil {
|
|
|
|
log.Printf("error unmarshalling metadata: %s", err)
|
|
|
|
t.InvalidateMetadata()
|
|
|
|
return
|
|
|
|
}
|
2014-06-29 13:45:21 +08:00
|
|
|
err = cl.setMetaData(t, info, t.MetaData)
|
|
|
|
if err != nil {
|
|
|
|
log.Printf("error setting metadata: %s", err)
|
|
|
|
t.InvalidateMetadata()
|
|
|
|
return
|
|
|
|
}
|
|
|
|
log.Printf("%s: got metadata from peers", t)
|
2014-06-28 17:38:31 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
func (cl *Client) gotMetadataExtensionMsg(payload []byte, t *torrent, c *connection) (err error) {
|
|
|
|
var d map[string]int
|
|
|
|
err = bencode.Unmarshal(payload, &d)
|
|
|
|
if err != nil {
|
|
|
|
err = fmt.Errorf("error unmarshalling payload: %s", err)
|
|
|
|
return
|
|
|
|
}
|
|
|
|
msgType, ok := d["msg_type"]
|
|
|
|
if !ok {
|
|
|
|
err = errors.New("missing msg_type field")
|
|
|
|
return
|
|
|
|
}
|
|
|
|
piece := d["piece"]
|
|
|
|
switch msgType {
|
|
|
|
case pp.DataMetadataExtensionMsgType:
|
|
|
|
if t.haveInfo() {
|
|
|
|
break
|
|
|
|
}
|
|
|
|
t.SaveMetadataPiece(piece, payload[len(payload)-metadataPieceSize(d["total_size"], piece):])
|
|
|
|
if !t.HaveAllMetadataPieces() {
|
|
|
|
break
|
|
|
|
}
|
|
|
|
cl.completedMetadata(t)
|
|
|
|
case pp.RequestMetadataExtensionMsgType:
|
|
|
|
if !t.HaveMetadataPiece(piece) {
|
|
|
|
c.Post(t.NewMetadataExtensionMessage(c, pp.RejectMetadataExtensionMsgType, d["piece"], nil))
|
|
|
|
break
|
|
|
|
}
|
|
|
|
c.Post(t.NewMetadataExtensionMessage(c, pp.DataMetadataExtensionMsgType, piece, t.MetaData[(1<<14)*piece:(1<<14)*piece+t.metadataPieceSize(piece)]))
|
|
|
|
case pp.RejectMetadataExtensionMsgType:
|
|
|
|
default:
|
|
|
|
err = errors.New("unknown msg_type value")
|
|
|
|
}
|
|
|
|
return
|
|
|
|
}
|
|
|
|
|
2014-06-29 17:07:43 +08:00
|
|
|
type peerExchangeMessage struct {
|
|
|
|
Added compactPeers `bencode:"added"`
|
|
|
|
AddedFlags []byte `bencode:"added.f"`
|
|
|
|
Dropped []tracker.Peer `bencode:"dropped"`
|
|
|
|
}
|
|
|
|
|
|
|
|
type compactPeers []tracker.CompactPeer
|
|
|
|
|
|
|
|
func (me *compactPeers) UnmarshalBencode(bb []byte) (err error) {
|
|
|
|
var b []byte
|
|
|
|
err = bencode.Unmarshal(bb, &b)
|
|
|
|
if err != nil {
|
|
|
|
return
|
|
|
|
}
|
|
|
|
for i := 0; i < len(b); i += 6 {
|
|
|
|
var p tracker.CompactPeer
|
|
|
|
err = p.UnmarshalBinary([]byte(b[i : i+6]))
|
|
|
|
if err != nil {
|
|
|
|
return
|
|
|
|
}
|
|
|
|
*me = append(*me, p)
|
|
|
|
}
|
|
|
|
return
|
|
|
|
}
|
|
|
|
|
2014-05-21 15:55:50 +08:00
|
|
|
func (me *Client) connectionLoop(t *torrent, c *connection) error {
|
2014-05-21 16:01:58 +08:00
|
|
|
decoder := pp.Decoder{
|
2014-05-21 15:55:50 +08:00
|
|
|
R: bufio.NewReader(c.Socket),
|
2013-09-30 19:51:08 +08:00
|
|
|
MaxLength: 256 * 1024,
|
|
|
|
}
|
|
|
|
for {
|
2013-10-20 22:07:01 +08:00
|
|
|
me.mu.Unlock()
|
2014-05-21 16:01:58 +08:00
|
|
|
var msg pp.Message
|
2014-05-21 15:48:44 +08:00
|
|
|
err := decoder.Decode(&msg)
|
2013-10-20 22:07:01 +08:00
|
|
|
me.mu.Lock()
|
2014-06-26 16:06:33 +08:00
|
|
|
if c.closed {
|
|
|
|
return nil
|
|
|
|
}
|
2013-09-30 19:51:08 +08:00
|
|
|
if err != nil {
|
2014-03-20 21:14:17 +08:00
|
|
|
if me.stopped() || err == io.EOF {
|
2014-03-20 13:58:09 +08:00
|
|
|
return nil
|
|
|
|
}
|
2013-09-30 19:51:08 +08:00
|
|
|
return err
|
|
|
|
}
|
|
|
|
if msg.Keepalive {
|
|
|
|
continue
|
|
|
|
}
|
2013-10-20 22:07:01 +08:00
|
|
|
switch msg.Type {
|
2014-05-21 16:01:58 +08:00
|
|
|
case pp.Choke:
|
2014-05-21 15:55:50 +08:00
|
|
|
c.PeerChoked = true
|
2014-05-23 19:01:05 +08:00
|
|
|
for r := range c.Requests {
|
|
|
|
me.connDeleteRequest(t, c, r)
|
|
|
|
}
|
2014-05-21 16:01:58 +08:00
|
|
|
case pp.Unchoke:
|
2014-05-21 15:55:50 +08:00
|
|
|
c.PeerChoked = false
|
|
|
|
me.peerUnchoked(t, c)
|
2014-05-21 16:01:58 +08:00
|
|
|
case pp.Interested:
|
2014-05-21 15:55:50 +08:00
|
|
|
c.PeerInterested = true
|
2014-03-17 22:44:22 +08:00
|
|
|
// TODO: This should be done from a dedicated unchoking routine.
|
2014-05-21 15:55:50 +08:00
|
|
|
c.Unchoke()
|
2014-05-21 16:01:58 +08:00
|
|
|
case pp.NotInterested:
|
2014-05-21 15:55:50 +08:00
|
|
|
c.PeerInterested = false
|
|
|
|
c.Choke()
|
2014-05-21 16:01:58 +08:00
|
|
|
case pp.Have:
|
2014-05-21 15:55:50 +08:00
|
|
|
me.peerGotPiece(t, c, int(msg.Index))
|
2014-05-21 16:01:58 +08:00
|
|
|
case pp.Request:
|
2014-05-21 15:55:50 +08:00
|
|
|
if c.PeerRequests == nil {
|
|
|
|
c.PeerRequests = make(map[request]struct{}, maxRequests)
|
2014-03-17 22:44:22 +08:00
|
|
|
}
|
2014-05-21 15:42:06 +08:00
|
|
|
request := newRequest(msg.Index, msg.Begin, msg.Length)
|
2014-05-21 15:55:50 +08:00
|
|
|
c.PeerRequests[request] = struct{}{}
|
2014-03-17 22:44:22 +08:00
|
|
|
// TODO: Requests should be satisfied from a dedicated upload routine.
|
|
|
|
p := make([]byte, msg.Length)
|
2014-05-21 15:55:50 +08:00
|
|
|
n, err := t.Data.ReadAt(p, int64(t.PieceLength(0))*int64(msg.Index)+int64(msg.Begin))
|
2014-03-17 22:44:22 +08:00
|
|
|
if err != nil {
|
2014-06-26 15:30:16 +08:00
|
|
|
return fmt.Errorf("reading t data to serve request %q: %s", request, err)
|
2014-03-17 22:44:22 +08:00
|
|
|
}
|
|
|
|
if n != int(msg.Length) {
|
2014-06-26 15:30:16 +08:00
|
|
|
return fmt.Errorf("bad request: %v", msg)
|
2014-03-17 22:44:22 +08:00
|
|
|
}
|
2014-05-21 16:01:58 +08:00
|
|
|
c.Post(pp.Message{
|
|
|
|
Type: pp.Piece,
|
2014-03-17 22:44:22 +08:00
|
|
|
Index: msg.Index,
|
|
|
|
Begin: msg.Begin,
|
|
|
|
Piece: p,
|
|
|
|
})
|
2014-05-21 16:01:58 +08:00
|
|
|
case pp.Cancel:
|
2014-04-16 15:33:33 +08:00
|
|
|
req := newRequest(msg.Index, msg.Begin, msg.Length)
|
2014-05-21 15:55:50 +08:00
|
|
|
if !c.PeerCancel(req) {
|
2014-04-16 15:33:33 +08:00
|
|
|
log.Printf("received unexpected cancel: %v", req)
|
|
|
|
}
|
2014-05-21 16:01:58 +08:00
|
|
|
case pp.Bitfield:
|
2014-05-21 15:55:50 +08:00
|
|
|
if c.PeerPieces != nil {
|
2013-10-20 22:07:01 +08:00
|
|
|
err = errors.New("received unexpected bitfield")
|
|
|
|
break
|
|
|
|
}
|
2014-06-26 22:57:07 +08:00
|
|
|
if t.haveInfo() {
|
|
|
|
if len(msg.Bitfield) < t.NumPieces() {
|
|
|
|
err = errors.New("received invalid bitfield")
|
|
|
|
break
|
|
|
|
}
|
|
|
|
msg.Bitfield = msg.Bitfield[:t.NumPieces()]
|
|
|
|
}
|
|
|
|
c.PeerPieces = msg.Bitfield
|
2014-05-21 15:55:50 +08:00
|
|
|
for index, has := range c.PeerPieces {
|
2013-10-20 22:07:01 +08:00
|
|
|
if has {
|
2014-05-21 15:55:50 +08:00
|
|
|
me.peerGotPiece(t, c, index)
|
2013-10-02 15:57:59 +08:00
|
|
|
}
|
2013-09-30 19:51:08 +08:00
|
|
|
}
|
2014-05-21 16:01:58 +08:00
|
|
|
case pp.Piece:
|
2014-05-21 15:55:50 +08:00
|
|
|
err = me.downloadedChunk(t, c, &msg)
|
2014-06-26 22:57:07 +08:00
|
|
|
case pp.Extended:
|
|
|
|
switch msg.ExtendedID {
|
|
|
|
case pp.HandshakeExtendedID:
|
2014-06-29 16:57:49 +08:00
|
|
|
// TODO: Create a bencode struct for this.
|
2014-06-26 22:57:07 +08:00
|
|
|
var d map[string]interface{}
|
|
|
|
err = bencode.Unmarshal(msg.ExtendedPayload, &d)
|
|
|
|
if err != nil {
|
|
|
|
err = fmt.Errorf("error decoding extended message payload: %s", err)
|
|
|
|
break
|
|
|
|
}
|
2014-06-29 16:57:49 +08:00
|
|
|
if reqq, ok := d["reqq"]; ok {
|
|
|
|
if i, ok := reqq.(int64); ok {
|
|
|
|
c.PeerMaxRequests = int(i)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if v, ok := d["v"]; ok {
|
|
|
|
c.PeerClientName = v.(string)
|
|
|
|
}
|
2014-06-26 22:57:07 +08:00
|
|
|
m, ok := d["m"]
|
|
|
|
if !ok {
|
|
|
|
err = errors.New("handshake missing m item")
|
|
|
|
break
|
|
|
|
}
|
|
|
|
mTyped, ok := m.(map[string]interface{})
|
|
|
|
if !ok {
|
|
|
|
err = errors.New("handshake m value is not dict")
|
|
|
|
break
|
|
|
|
}
|
|
|
|
if c.PeerExtensionIDs == nil {
|
|
|
|
c.PeerExtensionIDs = make(map[string]int64, len(mTyped))
|
|
|
|
}
|
|
|
|
for name, v := range mTyped {
|
|
|
|
id, ok := v.(int64)
|
|
|
|
if !ok {
|
|
|
|
log.Printf("bad handshake m item extension ID type: %T", v)
|
|
|
|
continue
|
|
|
|
}
|
|
|
|
if id == 0 {
|
|
|
|
delete(c.PeerExtensionIDs, name)
|
|
|
|
} else {
|
|
|
|
c.PeerExtensionIDs[name] = id
|
|
|
|
}
|
|
|
|
}
|
|
|
|
metadata_sizeUntyped, ok := d["metadata_size"]
|
|
|
|
if ok {
|
|
|
|
metadata_size, ok := metadata_sizeUntyped.(int64)
|
|
|
|
if !ok {
|
|
|
|
log.Printf("bad metadata_size type: %T", metadata_sizeUntyped)
|
|
|
|
} else {
|
2014-06-28 17:38:31 +08:00
|
|
|
t.SetMetadataSize(metadata_size)
|
2014-06-26 22:57:07 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
if _, ok := c.PeerExtensionIDs["ut_metadata"]; ok {
|
|
|
|
me.requestPendingMetadata(t, c)
|
|
|
|
}
|
|
|
|
case 1:
|
2014-06-28 17:38:31 +08:00
|
|
|
err = me.gotMetadataExtensionMsg(msg.ExtendedPayload, t, c)
|
2014-06-29 17:07:43 +08:00
|
|
|
case 2:
|
|
|
|
var pexMsg peerExchangeMessage
|
|
|
|
err := bencode.Unmarshal(msg.ExtendedPayload, &pexMsg)
|
|
|
|
if err != nil {
|
|
|
|
err = fmt.Errorf("error unmarshalling PEX message: %s", err)
|
|
|
|
break
|
|
|
|
}
|
|
|
|
go func() {
|
|
|
|
err := me.AddPeers(t.InfoHash, func() (ret []Peer) {
|
|
|
|
for _, cp := range pexMsg.Added {
|
|
|
|
p := Peer{
|
|
|
|
IP: make([]byte, 4),
|
|
|
|
Port: int(cp.Port),
|
|
|
|
}
|
|
|
|
if n := copy(p.IP, cp.IP[:]); n != 4 {
|
|
|
|
panic(n)
|
|
|
|
}
|
|
|
|
ret = append(ret, p)
|
|
|
|
}
|
|
|
|
return
|
|
|
|
}())
|
|
|
|
if err != nil {
|
|
|
|
log.Printf("error adding PEX peers: %s", err)
|
|
|
|
return
|
|
|
|
}
|
|
|
|
log.Printf("added %d peers from PEX", len(pexMsg.Added))
|
|
|
|
}()
|
2014-06-28 17:38:31 +08:00
|
|
|
default:
|
|
|
|
err = fmt.Errorf("unexpected extended message ID: %s", msg.ExtendedID)
|
2014-06-26 22:57:07 +08:00
|
|
|
}
|
2013-10-20 22:07:01 +08:00
|
|
|
default:
|
2014-05-21 15:42:06 +08:00
|
|
|
err = fmt.Errorf("received unknown message type: %#v", msg.Type)
|
2013-10-20 22:07:01 +08:00
|
|
|
}
|
|
|
|
if err != nil {
|
|
|
|
return err
|
|
|
|
}
|
2013-09-30 19:51:08 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2014-04-09 00:36:05 +08:00
|
|
|
func (me *Client) dropConnection(torrent *torrent, conn *connection) {
|
2013-09-30 19:51:08 +08:00
|
|
|
conn.Socket.Close()
|
2014-05-23 19:01:05 +08:00
|
|
|
for r := range conn.Requests {
|
|
|
|
me.connDeleteRequest(torrent, conn, r)
|
|
|
|
}
|
2013-09-30 19:51:08 +08:00
|
|
|
for i0, c := range torrent.Conns {
|
|
|
|
if c != conn {
|
|
|
|
continue
|
|
|
|
}
|
|
|
|
i1 := len(torrent.Conns) - 1
|
|
|
|
if i0 != i1 {
|
|
|
|
torrent.Conns[i0] = torrent.Conns[i1]
|
|
|
|
}
|
|
|
|
torrent.Conns = torrent.Conns[:i1]
|
|
|
|
return
|
|
|
|
}
|
2014-05-23 19:02:11 +08:00
|
|
|
panic("connection not found")
|
2013-09-30 19:51:08 +08:00
|
|
|
}
|
|
|
|
|
2014-04-09 00:36:05 +08:00
|
|
|
func (me *Client) addConnection(t *torrent, c *connection) bool {
|
2014-06-26 16:06:33 +08:00
|
|
|
if me.stopped() {
|
|
|
|
return false
|
|
|
|
}
|
2014-03-16 23:30:10 +08:00
|
|
|
for _, c0 := range t.Conns {
|
|
|
|
if c.PeerId == c0.PeerId {
|
2014-05-21 15:42:06 +08:00
|
|
|
// Already connected to a client with that ID.
|
2013-09-30 19:51:08 +08:00
|
|
|
return false
|
|
|
|
}
|
|
|
|
}
|
|
|
|
t.Conns = append(t.Conns, c)
|
|
|
|
return true
|
2013-09-29 06:11:24 +08:00
|
|
|
}
|
|
|
|
|
2013-10-06 15:01:39 +08:00
|
|
|
func (me *Client) openNewConns() {
|
2013-09-29 06:11:24 +08:00
|
|
|
for _, t := range me.torrents {
|
|
|
|
for len(t.Peers) != 0 {
|
|
|
|
if me.halfOpen >= me.HalfOpenLimit {
|
|
|
|
return
|
|
|
|
}
|
|
|
|
p := t.Peers[0]
|
|
|
|
t.Peers = t.Peers[1:]
|
|
|
|
me.initiateConn(p, t)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2014-04-09 00:36:05 +08:00
|
|
|
// Adds peers to the swarm for the torrent corresponding to infoHash.
|
2013-10-20 22:07:01 +08:00
|
|
|
func (me *Client) AddPeers(infoHash InfoHash, peers []Peer) error {
|
|
|
|
me.mu.Lock()
|
|
|
|
t := me.torrent(infoHash)
|
|
|
|
if t == nil {
|
|
|
|
return errors.New("no such torrent")
|
|
|
|
}
|
|
|
|
t.Peers = append(t.Peers, peers...)
|
|
|
|
me.openNewConns()
|
|
|
|
me.mu.Unlock()
|
|
|
|
return nil
|
2013-09-29 06:11:24 +08:00
|
|
|
}
|
|
|
|
|
2014-06-28 17:38:31 +08:00
|
|
|
func (cl *Client) setMetaData(t *torrent, md metainfo.Info, bytes []byte) (err error) {
|
|
|
|
err = t.setMetadata(md, cl.DataDir, bytes)
|
2014-03-20 13:58:09 +08:00
|
|
|
if err != nil {
|
|
|
|
return
|
|
|
|
}
|
2014-06-26 22:57:07 +08:00
|
|
|
// Queue all pieces for hashing. This is done sequentially to avoid
|
|
|
|
// spamming goroutines.
|
|
|
|
for _, p := range t.Pieces {
|
|
|
|
p.QueuedForHash = true
|
|
|
|
}
|
|
|
|
go func() {
|
|
|
|
for i := range t.Pieces {
|
|
|
|
cl.verifyPiece(t, pp.Integer(i))
|
|
|
|
}
|
|
|
|
}()
|
|
|
|
|
|
|
|
cl.DownloadStrategy.TorrentStarted(t)
|
|
|
|
return
|
|
|
|
}
|
|
|
|
|
|
|
|
// Prepare a Torrent without any attachment to a Client. That means we can
|
|
|
|
// initialize fields all fields that don't require the Client without locking
|
|
|
|
// it.
|
|
|
|
func newTorrent(ih InfoHash, announceList [][]string) (t *torrent, err error) {
|
|
|
|
t = &torrent{
|
|
|
|
InfoHash: ih,
|
|
|
|
}
|
|
|
|
t.Trackers = make([][]tracker.Client, len(announceList))
|
|
|
|
for tierIndex := range announceList {
|
2014-04-09 00:36:05 +08:00
|
|
|
tier := t.Trackers[tierIndex]
|
2014-06-26 22:57:07 +08:00
|
|
|
for _, url := range announceList[tierIndex] {
|
2014-03-16 23:30:10 +08:00
|
|
|
tr, err := tracker.New(url)
|
|
|
|
if err != nil {
|
|
|
|
log.Print(err)
|
|
|
|
continue
|
|
|
|
}
|
|
|
|
tier = append(tier, tr)
|
|
|
|
}
|
|
|
|
// The trackers within each tier must be shuffled before use.
|
|
|
|
// http://stackoverflow.com/a/12267471/149482
|
|
|
|
// http://www.bittorrent.org/beps/bep_0012.html#order-of-processing
|
|
|
|
for i := range tier {
|
|
|
|
j := mathRand.Intn(i + 1)
|
|
|
|
tier[i], tier[j] = tier[j], tier[i]
|
|
|
|
}
|
2014-04-09 00:36:05 +08:00
|
|
|
t.Trackers[tierIndex] = tier
|
2014-03-16 23:30:10 +08:00
|
|
|
}
|
|
|
|
return
|
|
|
|
}
|
|
|
|
|
2014-06-26 22:57:07 +08:00
|
|
|
func (cl *Client) AddMagnet(uri string) (err error) {
|
|
|
|
m, err := ParseMagnetURI(uri)
|
2013-09-26 17:49:15 +08:00
|
|
|
if err != nil {
|
2014-06-26 22:57:07 +08:00
|
|
|
return
|
2013-09-26 17:49:15 +08:00
|
|
|
}
|
2014-06-26 22:57:07 +08:00
|
|
|
t, err := newTorrent(m.InfoHash, [][]string{m.Trackers})
|
|
|
|
if err != nil {
|
|
|
|
return
|
2013-10-20 22:07:01 +08:00
|
|
|
}
|
2014-06-26 22:57:07 +08:00
|
|
|
t.DisplayName = m.DisplayName
|
|
|
|
cl.mu.Lock()
|
|
|
|
defer cl.mu.Unlock()
|
|
|
|
err = cl.addTorrent(t)
|
|
|
|
if err != nil {
|
|
|
|
t.Close()
|
2014-03-20 01:30:08 +08:00
|
|
|
}
|
2014-06-26 22:57:07 +08:00
|
|
|
return
|
|
|
|
}
|
2014-05-21 15:37:31 +08:00
|
|
|
|
2014-06-26 22:57:07 +08:00
|
|
|
func (me *Client) addTorrent(t *torrent) (err error) {
|
|
|
|
if _, ok := me.torrents[t.InfoHash]; ok {
|
|
|
|
err = fmt.Errorf("torrent infohash collision")
|
|
|
|
return
|
2014-03-17 22:44:22 +08:00
|
|
|
}
|
2014-06-26 22:57:07 +08:00
|
|
|
me.torrents[t.InfoHash] = t
|
|
|
|
if !me.DisableTrackers {
|
|
|
|
go me.announceTorrent(t)
|
|
|
|
}
|
|
|
|
return
|
|
|
|
}
|
2014-05-21 15:37:31 +08:00
|
|
|
|
2014-06-26 22:57:07 +08:00
|
|
|
// Adds the torrent to the client.
|
|
|
|
func (me *Client) AddTorrent(metaInfo *metainfo.MetaInfo) (err error) {
|
|
|
|
t, err := newTorrent(BytesInfoHash(metaInfo.InfoHash), metaInfo.AnnounceList)
|
|
|
|
if err != nil {
|
|
|
|
return
|
|
|
|
}
|
2014-06-27 16:57:35 +08:00
|
|
|
me.mu.Lock()
|
|
|
|
defer me.mu.Unlock()
|
2014-06-26 22:57:07 +08:00
|
|
|
err = me.addTorrent(t)
|
|
|
|
if err != nil {
|
|
|
|
return
|
|
|
|
}
|
2014-06-28 17:38:31 +08:00
|
|
|
err = me.setMetaData(t, metaInfo.Info, metaInfo.InfoBytes)
|
2014-06-26 22:57:07 +08:00
|
|
|
if err != nil {
|
|
|
|
return
|
|
|
|
}
|
|
|
|
return
|
2013-09-26 17:49:15 +08:00
|
|
|
}
|
|
|
|
|
2014-03-20 21:12:53 +08:00
|
|
|
func (cl *Client) listenerAnnouncePort() (port int16) {
|
|
|
|
l := cl.Listener
|
|
|
|
if l == nil {
|
|
|
|
return
|
|
|
|
}
|
|
|
|
addr := l.Addr()
|
|
|
|
switch data := addr.(type) {
|
|
|
|
case *net.TCPAddr:
|
|
|
|
return int16(data.Port)
|
|
|
|
case *net.UDPAddr:
|
|
|
|
return int16(data.Port)
|
|
|
|
default:
|
|
|
|
log.Printf("unknown listener addr type: %T", addr)
|
|
|
|
}
|
|
|
|
return
|
|
|
|
}
|
|
|
|
|
2014-04-09 00:36:05 +08:00
|
|
|
func (cl *Client) announceTorrent(t *torrent) {
|
2014-03-16 23:30:10 +08:00
|
|
|
req := tracker.AnnounceRequest{
|
2014-05-22 22:35:24 +08:00
|
|
|
Event: tracker.Started,
|
|
|
|
NumWant: -1,
|
|
|
|
Port: cl.listenerAnnouncePort(),
|
|
|
|
PeerId: cl.PeerId,
|
|
|
|
InfoHash: t.InfoHash,
|
2014-03-16 23:30:10 +08:00
|
|
|
}
|
|
|
|
newAnnounce:
|
|
|
|
for {
|
2014-05-23 19:01:35 +08:00
|
|
|
cl.mu.Lock()
|
2014-05-22 22:35:24 +08:00
|
|
|
req.Left = t.BytesLeft()
|
2014-05-23 19:01:35 +08:00
|
|
|
cl.mu.Unlock()
|
2014-03-16 23:30:10 +08:00
|
|
|
for _, tier := range t.Trackers {
|
|
|
|
for trIndex, tr := range tier {
|
|
|
|
if err := tr.Connect(); err != nil {
|
|
|
|
log.Print(err)
|
|
|
|
continue
|
|
|
|
}
|
|
|
|
resp, err := tr.Announce(&req)
|
|
|
|
if err != nil {
|
|
|
|
log.Print(err)
|
|
|
|
continue
|
|
|
|
}
|
|
|
|
var peers []Peer
|
|
|
|
for _, peer := range resp.Peers {
|
|
|
|
peers = append(peers, Peer{
|
2014-03-17 22:44:22 +08:00
|
|
|
IP: peer.IP,
|
|
|
|
Port: peer.Port,
|
2014-03-16 23:30:10 +08:00
|
|
|
})
|
|
|
|
}
|
2014-05-22 22:35:24 +08:00
|
|
|
err = cl.AddPeers(t.InfoHash, peers)
|
|
|
|
if err != nil {
|
2014-03-16 23:30:10 +08:00
|
|
|
log.Print(err)
|
2014-05-22 22:35:24 +08:00
|
|
|
} else {
|
|
|
|
log.Printf("%s: %d new peers from %s", t, len(peers), tr)
|
2014-03-16 23:30:10 +08:00
|
|
|
}
|
|
|
|
tier[0], tier[trIndex] = tier[trIndex], tier[0]
|
|
|
|
time.Sleep(time.Second * time.Duration(resp.Interval))
|
2014-05-22 22:35:24 +08:00
|
|
|
req.Event = tracker.None
|
2014-03-16 23:30:10 +08:00
|
|
|
continue newAnnounce
|
|
|
|
}
|
|
|
|
}
|
2014-05-22 22:35:24 +08:00
|
|
|
time.Sleep(5 * time.Second)
|
2014-03-16 23:30:10 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
func (cl *Client) allTorrentsCompleted() bool {
|
|
|
|
for _, t := range cl.torrents {
|
|
|
|
if !t.haveAllPieces() {
|
|
|
|
return false
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return true
|
|
|
|
}
|
|
|
|
|
2014-04-09 00:36:05 +08:00
|
|
|
// Returns true when all torrents are completely downloaded and false if the
|
|
|
|
// client is stopped.
|
|
|
|
func (me *Client) WaitAll() bool {
|
2013-10-20 22:07:01 +08:00
|
|
|
me.mu.Lock()
|
2014-04-09 00:36:05 +08:00
|
|
|
defer me.mu.Unlock()
|
2014-03-16 23:30:10 +08:00
|
|
|
for !me.allTorrentsCompleted() {
|
2014-04-09 00:36:05 +08:00
|
|
|
if me.stopped() {
|
|
|
|
return false
|
|
|
|
}
|
2013-10-20 22:07:01 +08:00
|
|
|
me.event.Wait()
|
|
|
|
}
|
2014-04-09 00:36:05 +08:00
|
|
|
return true
|
2013-09-26 17:49:15 +08:00
|
|
|
}
|
|
|
|
|
2014-05-21 15:40:54 +08:00
|
|
|
type DownloadStrategy interface {
|
|
|
|
FillRequests(t *torrent, c *connection)
|
2014-05-23 19:01:05 +08:00
|
|
|
TorrentStarted(t *torrent)
|
|
|
|
TorrentStopped(t *torrent)
|
|
|
|
DeleteRequest(t *torrent, r request)
|
2014-05-21 15:40:54 +08:00
|
|
|
}
|
|
|
|
|
2014-05-23 19:01:05 +08:00
|
|
|
type DefaultDownloadStrategy struct {
|
|
|
|
heat map[*torrent]map[request]int
|
|
|
|
}
|
2014-05-21 15:40:54 +08:00
|
|
|
|
2014-05-23 19:01:05 +08:00
|
|
|
func (cl *Client) assertRequestHeat() {
|
|
|
|
dds, ok := cl.DownloadStrategy.(*DefaultDownloadStrategy)
|
|
|
|
if !ok {
|
|
|
|
return
|
|
|
|
}
|
|
|
|
for _, t := range cl.torrents {
|
|
|
|
m := make(map[request]int, 3000)
|
|
|
|
for _, cn := range t.Conns {
|
|
|
|
for r := range cn.Requests {
|
|
|
|
m[r]++
|
|
|
|
}
|
|
|
|
}
|
|
|
|
for r, h := range dds.heat[t] {
|
|
|
|
if m[r] != h {
|
|
|
|
panic(fmt.Sprintln(m[r], h))
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
func (s *DefaultDownloadStrategy) FillRequests(t *torrent, c *connection) {
|
|
|
|
th := s.heat[t]
|
2014-04-16 19:13:44 +08:00
|
|
|
addRequest := func(req request) (again bool) {
|
2014-05-23 19:01:05 +08:00
|
|
|
piece := t.Pieces[req.Index]
|
2014-06-29 17:08:16 +08:00
|
|
|
if piece.Hashing || piece.QueuedForHash {
|
2014-03-20 01:30:08 +08:00
|
|
|
// We can't be sure we want this.
|
2013-10-15 16:42:30 +08:00
|
|
|
return true
|
2013-10-01 16:43:18 +08:00
|
|
|
}
|
2013-10-20 22:07:01 +08:00
|
|
|
if piece.Complete() {
|
2014-03-20 01:30:08 +08:00
|
|
|
// We already have this.
|
2013-10-15 16:42:30 +08:00
|
|
|
return true
|
2013-10-14 22:39:12 +08:00
|
|
|
}
|
2014-05-23 19:01:05 +08:00
|
|
|
if c.RequestPending(req) {
|
2013-10-15 16:42:30 +08:00
|
|
|
return true
|
|
|
|
}
|
2014-05-23 19:01:05 +08:00
|
|
|
again = c.Request(req)
|
|
|
|
if c.RequestPending(req) {
|
|
|
|
th[req]++
|
|
|
|
}
|
|
|
|
return
|
2013-10-15 16:42:30 +08:00
|
|
|
}
|
2014-03-20 01:30:08 +08:00
|
|
|
// First request prioritized chunks.
|
2014-05-23 19:01:05 +08:00
|
|
|
for e := t.Priorities.Front(); e != nil; e = e.Next() {
|
2014-05-21 15:37:31 +08:00
|
|
|
if !addRequest(e.Value.(request)) {
|
|
|
|
return
|
2013-10-15 16:42:30 +08:00
|
|
|
}
|
|
|
|
}
|
2014-05-23 19:01:05 +08:00
|
|
|
ppbs := t.piecesByPendingBytes()
|
2014-04-03 20:16:59 +08:00
|
|
|
// Then finish off incomplete pieces in order of bytes remaining.
|
2014-06-28 17:38:31 +08:00
|
|
|
for _, heatThreshold := range []int{0, 1, 4, 100} {
|
2014-05-23 19:01:05 +08:00
|
|
|
for _, pieceIndex := range ppbs {
|
2014-06-26 16:06:33 +08:00
|
|
|
for _, chunkSpec := range t.Pieces[pieceIndex].shuffledPendingChunkSpecs() {
|
2014-05-23 19:01:05 +08:00
|
|
|
r := request{pieceIndex, chunkSpec}
|
|
|
|
if th[r] > heatThreshold {
|
|
|
|
continue
|
|
|
|
}
|
|
|
|
if !addRequest(request{pieceIndex, chunkSpec}) {
|
|
|
|
return
|
|
|
|
}
|
2013-10-15 16:42:30 +08:00
|
|
|
}
|
2013-10-01 16:43:18 +08:00
|
|
|
}
|
|
|
|
}
|
2014-05-21 15:40:54 +08:00
|
|
|
}
|
|
|
|
|
2014-05-23 19:01:05 +08:00
|
|
|
func (s *DefaultDownloadStrategy) TorrentStarted(t *torrent) {
|
|
|
|
if s.heat[t] != nil {
|
|
|
|
panic("torrent already started")
|
|
|
|
}
|
|
|
|
if s.heat == nil {
|
|
|
|
s.heat = make(map[*torrent]map[request]int, 10)
|
|
|
|
}
|
|
|
|
s.heat[t] = make(map[request]int, t.ChunkCount())
|
|
|
|
}
|
|
|
|
|
|
|
|
func (s *DefaultDownloadStrategy) TorrentStopped(t *torrent) {
|
|
|
|
if _, ok := s.heat[t]; !ok {
|
|
|
|
panic("torrent not yet started")
|
|
|
|
}
|
|
|
|
delete(s.heat, t)
|
|
|
|
}
|
|
|
|
|
|
|
|
func (s *DefaultDownloadStrategy) DeleteRequest(t *torrent, r request) {
|
|
|
|
m := s.heat[t]
|
|
|
|
if m[r] <= 0 {
|
|
|
|
panic("no pending requests")
|
|
|
|
}
|
|
|
|
m[r]--
|
|
|
|
}
|
|
|
|
|
2014-05-28 23:30:59 +08:00
|
|
|
type ResponsiveDownloadStrategy struct {
|
|
|
|
// How many bytes to preemptively download starting at the beginning of
|
|
|
|
// the last piece read for a given torrent.
|
|
|
|
Readahead int
|
|
|
|
}
|
2014-05-21 15:40:54 +08:00
|
|
|
|
2014-05-23 19:01:05 +08:00
|
|
|
func (ResponsiveDownloadStrategy) TorrentStarted(*torrent) {}
|
|
|
|
func (ResponsiveDownloadStrategy) TorrentStopped(*torrent) {}
|
|
|
|
func (ResponsiveDownloadStrategy) DeleteRequest(*torrent, request) {}
|
|
|
|
|
2014-05-28 23:30:59 +08:00
|
|
|
func (me *ResponsiveDownloadStrategy) FillRequests(t *torrent, c *connection) {
|
2014-05-21 15:40:54 +08:00
|
|
|
for e := t.Priorities.Front(); e != nil; e = e.Next() {
|
2014-06-28 17:38:31 +08:00
|
|
|
req := e.Value.(request)
|
|
|
|
if _, ok := t.Pieces[req.Index].PendingChunkSpecs[req.chunkSpec]; !ok {
|
|
|
|
panic(req)
|
|
|
|
}
|
2014-05-21 15:40:54 +08:00
|
|
|
if !c.Request(e.Value.(request)) {
|
2014-05-22 22:33:07 +08:00
|
|
|
return
|
|
|
|
}
|
|
|
|
}
|
2014-05-28 23:30:59 +08:00
|
|
|
readaheadPieces := (me.Readahead + t.UsualPieceSize() - 1) / t.UsualPieceSize()
|
|
|
|
for i := t.lastReadPiece; i < t.lastReadPiece+readaheadPieces && i < t.NumPieces(); i++ {
|
2014-06-26 16:06:33 +08:00
|
|
|
for _, cs := range t.Pieces[i].shuffledPendingChunkSpecs() {
|
2014-05-22 22:33:07 +08:00
|
|
|
if !c.Request(request{pp.Integer(i), cs}) {
|
|
|
|
return
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
// Then finish off incomplete pieces in order of bytes remaining.
|
|
|
|
for _, index := range t.piecesByPendingBytes() {
|
2014-05-28 23:30:59 +08:00
|
|
|
// Stop when we're onto untouched pieces.
|
2014-06-26 16:06:33 +08:00
|
|
|
if !t.PiecePartiallyDownloaded(int(index)) {
|
2014-05-21 15:40:54 +08:00
|
|
|
break
|
|
|
|
}
|
2014-05-28 23:32:34 +08:00
|
|
|
// Request chunks in random order to reduce overlap with other
|
|
|
|
// connections.
|
|
|
|
for _, cs := range t.Pieces[index].shuffledPendingChunkSpecs() {
|
|
|
|
if !c.Request(request{index, cs}) {
|
2014-05-22 22:33:07 +08:00
|
|
|
return
|
|
|
|
}
|
|
|
|
}
|
2014-03-20 13:58:09 +08:00
|
|
|
}
|
2013-10-13 20:16:21 +08:00
|
|
|
}
|
2013-10-01 16:43:18 +08:00
|
|
|
|
2014-05-21 15:40:54 +08:00
|
|
|
func (me *Client) replenishConnRequests(t *torrent, c *connection) {
|
|
|
|
me.DownloadStrategy.FillRequests(t, c)
|
2014-06-26 16:06:33 +08:00
|
|
|
me.assertRequestHeat()
|
2014-06-28 17:38:31 +08:00
|
|
|
if len(c.Requests) == 0 && !c.PeerChoked {
|
2014-05-21 15:40:54 +08:00
|
|
|
c.SetInterested(false)
|
2013-10-14 22:39:12 +08:00
|
|
|
}
|
2014-05-21 15:40:54 +08:00
|
|
|
}
|
|
|
|
|
2014-05-21 16:01:58 +08:00
|
|
|
func (me *Client) downloadedChunk(t *torrent, c *connection, msg *pp.Message) error {
|
|
|
|
req := newRequest(msg.Index, msg.Begin, pp.Integer(len(msg.Piece)))
|
2014-05-21 15:40:54 +08:00
|
|
|
|
|
|
|
// Request has been satisfied.
|
2014-05-23 19:01:05 +08:00
|
|
|
me.connDeleteRequest(t, c, req)
|
2014-05-21 15:40:54 +08:00
|
|
|
|
|
|
|
defer me.replenishConnRequests(t, c)
|
|
|
|
|
|
|
|
// Do we actually want this chunk?
|
|
|
|
if _, ok := t.Pieces[req.Index].PendingChunkSpecs[req.chunkSpec]; !ok {
|
2014-06-26 22:57:07 +08:00
|
|
|
log.Printf("got unnecessary chunk from %v: %q", req, string(c.PeerId[:]))
|
2014-05-21 15:40:54 +08:00
|
|
|
return nil
|
|
|
|
}
|
|
|
|
|
|
|
|
// Write the chunk out.
|
|
|
|
err := t.WriteChunk(int(msg.Index), int64(msg.Begin), msg.Piece)
|
2013-10-14 22:39:12 +08:00
|
|
|
if err != nil {
|
2014-05-21 15:40:54 +08:00
|
|
|
return err
|
|
|
|
}
|
|
|
|
|
|
|
|
// Record that we have the chunk.
|
|
|
|
delete(t.Pieces[req.Index].PendingChunkSpecs, req.chunkSpec)
|
|
|
|
if len(t.Pieces[req.Index].PendingChunkSpecs) == 0 {
|
|
|
|
me.queuePieceCheck(t, req.Index)
|
2013-10-14 22:39:12 +08:00
|
|
|
}
|
2014-05-21 15:40:54 +08:00
|
|
|
|
|
|
|
// Unprioritize the chunk.
|
2013-10-14 22:39:12 +08:00
|
|
|
var next *list.Element
|
2014-05-21 15:40:54 +08:00
|
|
|
for e := t.Priorities.Front(); e != nil; e = next {
|
2013-10-14 22:39:12 +08:00
|
|
|
next = e.Next()
|
2014-04-16 19:13:44 +08:00
|
|
|
if e.Value.(request) == req {
|
2014-05-21 15:40:54 +08:00
|
|
|
t.Priorities.Remove(e)
|
2013-10-14 22:39:12 +08:00
|
|
|
}
|
|
|
|
}
|
2014-05-21 15:40:54 +08:00
|
|
|
|
2014-05-29 00:44:27 +08:00
|
|
|
// Cancel pending requests for this chunk.
|
|
|
|
for _, c := range t.Conns {
|
|
|
|
if me.connCancel(t, c, req) {
|
2014-06-26 15:30:16 +08:00
|
|
|
log.Print("cancelled concurrent request for %v", req)
|
2014-05-29 00:44:27 +08:00
|
|
|
me.replenishConnRequests(t, c)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2014-06-28 17:38:31 +08:00
|
|
|
me.dataReady(dataSpec{t.InfoHash, req})
|
2014-05-21 15:40:54 +08:00
|
|
|
return nil
|
2013-10-13 20:16:21 +08:00
|
|
|
}
|
|
|
|
|
2014-04-09 00:36:05 +08:00
|
|
|
func (cl *Client) dataReady(ds dataSpec) {
|
2014-03-20 01:30:08 +08:00
|
|
|
if cl.dataWaiter != nil {
|
|
|
|
close(cl.dataWaiter)
|
2013-10-13 20:16:21 +08:00
|
|
|
}
|
2014-03-20 01:30:08 +08:00
|
|
|
cl.dataWaiter = nil
|
|
|
|
}
|
|
|
|
|
2014-04-09 00:36:05 +08:00
|
|
|
// Returns a channel that is closed when new data has become available in the
|
|
|
|
// client.
|
|
|
|
func (me *Client) DataWaiter() <-chan struct{} {
|
|
|
|
me.mu.Lock()
|
|
|
|
defer me.mu.Unlock()
|
|
|
|
if me.dataWaiter == nil {
|
|
|
|
me.dataWaiter = make(chan struct{})
|
2014-03-20 01:30:08 +08:00
|
|
|
}
|
2014-04-09 00:36:05 +08:00
|
|
|
return me.dataWaiter
|
2013-10-01 16:43:18 +08:00
|
|
|
}
|
|
|
|
|
2014-05-21 16:01:58 +08:00
|
|
|
func (me *Client) pieceHashed(t *torrent, piece pp.Integer, correct bool) {
|
2013-10-20 22:07:01 +08:00
|
|
|
p := t.Pieces[piece]
|
|
|
|
p.EverHashed = true
|
|
|
|
if correct {
|
|
|
|
p.PendingChunkSpecs = nil
|
2014-06-26 16:06:33 +08:00
|
|
|
// log.Printf("%s: got piece %d, (%d/%d)", t, piece, t.NumPiecesCompleted(), t.NumPieces())
|
2013-10-14 22:39:12 +08:00
|
|
|
var next *list.Element
|
2014-05-21 15:37:31 +08:00
|
|
|
for e := t.Priorities.Front(); e != nil; e = next {
|
|
|
|
next = e.Next()
|
|
|
|
if e.Value.(request).Index == piece {
|
|
|
|
t.Priorities.Remove(e)
|
2013-10-14 22:39:12 +08:00
|
|
|
}
|
|
|
|
}
|
2014-04-09 00:36:05 +08:00
|
|
|
me.dataReady(dataSpec{
|
2013-10-20 22:07:01 +08:00
|
|
|
t.InfoHash,
|
2014-04-16 19:13:44 +08:00
|
|
|
request{
|
2014-05-21 16:01:58 +08:00
|
|
|
pp.Integer(piece),
|
|
|
|
chunkSpec{0, pp.Integer(t.PieceLength(piece))},
|
2013-10-13 20:16:21 +08:00
|
|
|
},
|
|
|
|
})
|
2013-10-20 22:07:01 +08:00
|
|
|
} else {
|
|
|
|
if len(p.PendingChunkSpecs) == 0 {
|
2014-03-20 13:58:09 +08:00
|
|
|
t.pendAllChunkSpecs(piece)
|
2013-10-20 22:07:01 +08:00
|
|
|
}
|
2013-09-30 19:51:08 +08:00
|
|
|
}
|
2013-10-20 22:07:01 +08:00
|
|
|
for _, conn := range t.Conns {
|
2013-09-30 19:51:08 +08:00
|
|
|
if correct {
|
2014-05-21 16:01:58 +08:00
|
|
|
conn.Post(pp.Message{
|
|
|
|
Type: pp.Have,
|
|
|
|
Index: pp.Integer(piece),
|
2013-09-30 19:51:08 +08:00
|
|
|
})
|
2014-03-20 21:40:54 +08:00
|
|
|
// TODO: Cancel requests for this piece.
|
2013-09-30 19:51:08 +08:00
|
|
|
} else {
|
|
|
|
if conn.PeerHasPiece(piece) {
|
2013-10-20 22:07:01 +08:00
|
|
|
me.replenishConnRequests(t, conn)
|
2013-09-30 19:51:08 +08:00
|
|
|
}
|
2013-09-26 17:49:15 +08:00
|
|
|
}
|
|
|
|
}
|
2014-03-16 23:30:10 +08:00
|
|
|
me.event.Broadcast()
|
2013-10-02 15:57:59 +08:00
|
|
|
}
|
2013-09-30 19:51:08 +08:00
|
|
|
|
2014-05-21 16:01:58 +08:00
|
|
|
func (cl *Client) verifyPiece(t *torrent, index pp.Integer) {
|
2014-03-20 01:30:08 +08:00
|
|
|
cl.mu.Lock()
|
|
|
|
p := t.Pieces[index]
|
|
|
|
for p.Hashing {
|
|
|
|
cl.event.Wait()
|
|
|
|
}
|
|
|
|
p.Hashing = true
|
|
|
|
p.QueuedForHash = false
|
|
|
|
cl.mu.Unlock()
|
2013-10-20 22:07:01 +08:00
|
|
|
sum := t.HashPiece(index)
|
|
|
|
cl.mu.Lock()
|
2014-03-20 01:30:08 +08:00
|
|
|
p.Hashing = false
|
|
|
|
cl.pieceHashed(t, index, sum == p.Hash)
|
2013-10-20 22:07:01 +08:00
|
|
|
cl.mu.Unlock()
|
2013-09-26 17:49:15 +08:00
|
|
|
}
|
2013-10-06 15:01:39 +08:00
|
|
|
|
2014-04-09 00:36:05 +08:00
|
|
|
func (me *Client) Torrents() (ret []*torrent) {
|
2013-10-20 22:07:01 +08:00
|
|
|
me.mu.Lock()
|
|
|
|
for _, t := range me.torrents {
|
|
|
|
ret = append(ret, t)
|
|
|
|
}
|
|
|
|
me.mu.Unlock()
|
2013-10-06 15:01:39 +08:00
|
|
|
return
|
|
|
|
}
|