20 "github.com/anacrolix/torrent/common"
21 "github.com/anacrolix/torrent/segments"
22 "github.com/anacrolix/torrent/webseed"
23 "github.com/davecgh/go-spew/spew"
24 "github.com/pion/datachannel"
26 "github.com/anacrolix/dht/v2"
27 "github.com/anacrolix/log"
28 "github.com/anacrolix/missinggo"
29 "github.com/anacrolix/missinggo/iter"
30 "github.com/anacrolix/missinggo/perf"
31 "github.com/anacrolix/missinggo/pubsub"
32 "github.com/anacrolix/missinggo/slices"
33 "github.com/anacrolix/missinggo/v2/bitmap"
34 "github.com/anacrolix/missinggo/v2/prioritybitmap"
36 "github.com/anacrolix/torrent/bencode"
37 "github.com/anacrolix/torrent/metainfo"
38 pp "github.com/anacrolix/torrent/peer_protocol"
39 "github.com/anacrolix/torrent/storage"
40 "github.com/anacrolix/torrent/tracker"
41 "github.com/anacrolix/torrent/webtorrent"
44 // Maintains state of torrent within a Client. Many methods should not be called before the info is
45 // available, see .Info and .GotInfo.
47 // Torrent-level aggregate statistics. First in struct to ensure 64-bit
48 // alignment. See #262.
53 networkingEnabled bool
54 dataDownloadDisallowed bool
55 dataUploadDisallowed bool
56 userOnWriteChunkErr func(error)
58 // Determines what chunks to request from peers.
59 requestStrategy requestStrategy
61 closed missinggo.Event
62 infoHash metainfo.Hash
64 // Values are the piece indices that changed.
65 pieceStateChanges *pubsub.PubSub
66 // The size of chunks to request from peers over the wire. This is
67 // normally 16KiB by convention these days.
70 // Total length of the torrent in bytes. Stored because it's not O(1) to
71 // get this from the info dict.
74 // The storage to open when the info dict becomes available.
75 storageOpener *storage.Client
76 // Storage for torrent data.
77 storage *storage.Torrent
78 // Read-locked for using storage, and write-locked for Closing.
79 storageLock sync.RWMutex
81 // TODO: Only announce stuff is used?
82 metainfo metainfo.MetaInfo
84 // The info dict. nil if we don't have it (yet).
86 fileIndex segments.Index
89 webSeeds map[string]*Peer
91 // Active peer connections, running message stream loops. TODO: Make this
92 // open (not-closed) connections only.
93 conns map[*PeerConn]struct{}
94 maxEstablishedConns int
95 // Set of addrs to which we're attempting to connect. Connections are
96 // half-open until all handshakes are completed.
97 halfOpen map[string]PeerInfo
100 // Reserve of peers to connect to. A peer can be both here and in the
101 // active connections if were told about the peer after connecting with
102 // them. That encourages us to reconnect to peers that are well known in
104 peers prioritizedPeers
105 // Whether we want to know to know more peers.
106 wantPeersEvent missinggo.Event
107 // An announcer for each tracker URL.
108 trackerAnnouncers map[string]torrentTrackerAnnouncer
109 // How many times we've initiated a DHT announce. TODO: Move into stats.
112 // Name used if the info name isn't available. Should be cleared when the
113 // Info does become available.
117 // The bencoded bytes of the info dict. This is actively manipulated if
118 // the info bytes aren't initially available, and we try to fetch them
121 // Each element corresponds to the 16KiB metadata pieces. If true, we have
122 // received that piece.
123 metadataCompletedChunks []bool
124 metadataChanged sync.Cond
126 // Set when .Info is obtained.
127 gotMetainfo missinggo.Event
129 readers map[*reader]struct{}
130 _readerNowPieces bitmap.Bitmap
131 _readerReadaheadPieces bitmap.Bitmap
133 // A cache of pieces we need to get. Calculated from various piece and
134 // file priorities and completion states elsewhere.
135 _pendingPieces prioritybitmap.PriorityBitmap
136 // A cache of completed piece indices.
137 _completedPieces bitmap.Bitmap
138 // Pieces that need to be hashed.
139 piecesQueuedForHash bitmap.Bitmap
140 activePieceHashes int
142 // A pool of piece priorities []int for assignment to new connections.
143 // These "inclinations" are used to give connections preference for
145 connPieceInclinationPool sync.Pool
147 // Count of each request across active connections.
148 pendingRequests map[Request]int
153 func (t *Torrent) numConns() int {
157 func (t *Torrent) numReaders() int {
158 return len(t.readers)
161 func (t *Torrent) readerNowPieces() bitmap.Bitmap {
162 return t._readerNowPieces
165 func (t *Torrent) readerReadaheadPieces() bitmap.Bitmap {
166 return t._readerReadaheadPieces
169 func (t *Torrent) ignorePieces() bitmap.Bitmap {
170 ret := t._completedPieces.Copy()
171 ret.Union(t.piecesQueuedForHash)
172 for i := 0; i < t.numPieces(); i++ {
173 if t.piece(i).hashing {
180 func (t *Torrent) pendingPieces() *prioritybitmap.PriorityBitmap {
181 return &t._pendingPieces
184 func (t *Torrent) tickleReaders() {
185 t.cl.event.Broadcast()
188 // Returns a channel that is closed when the Torrent is closed.
189 func (t *Torrent) Closed() <-chan struct{} {
190 return t.closed.LockedChan(t.cl.locker())
193 // KnownSwarm returns the known subset of the peers in the Torrent's swarm, including active,
194 // pending, and half-open peers.
195 func (t *Torrent) KnownSwarm() (ks []PeerInfo) {
196 // Add pending peers to the list
197 t.peers.Each(func(peer PeerInfo) {
198 ks = append(ks, peer)
201 // Add half-open peers to the list
202 for _, peer := range t.halfOpen {
203 ks = append(ks, peer)
206 // Add active peers to the list
207 for conn := range t.conns {
209 ks = append(ks, PeerInfo{
211 Addr: conn.RemoteAddr,
212 Source: conn.Discovery,
213 // > If the connection is encrypted, that's certainly enough to set SupportsEncryption.
214 // > But if we're not connected to them with an encrypted connection, I couldn't say
215 // > what's appropriate. We can carry forward the SupportsEncryption value as we
216 // > received it from trackers/DHT/PEX, or just use the encryption state for the
217 // > connection. It's probably easiest to do the latter for now.
218 // https://github.com/anacrolix/torrent/pull/188
219 SupportsEncryption: conn.headerEncrypted,
226 func (t *Torrent) setChunkSize(size pp.Integer) {
228 t.chunkPool = &sync.Pool{
229 New: func() interface{} {
230 b := make([]byte, size)
236 func (t *Torrent) pieceComplete(piece pieceIndex) bool {
237 return t._completedPieces.Get(bitmap.BitIndex(piece))
240 func (t *Torrent) pieceCompleteUncached(piece pieceIndex) storage.Completion {
241 return t.pieces[piece].Storage().Completion()
244 // There's a connection to that address already.
245 func (t *Torrent) addrActive(addr string) bool {
246 if _, ok := t.halfOpen[addr]; ok {
249 for c := range t.conns {
251 if ra.String() == addr {
258 func (t *Torrent) unclosedConnsAsSlice() (ret []*PeerConn) {
259 ret = make([]*PeerConn, 0, len(t.conns))
260 for c := range t.conns {
261 if !c.closed.IsSet() {
268 func (t *Torrent) addPeer(p PeerInfo) (added bool) {
270 torrent.Add(fmt.Sprintf("peers added by source %q", p.Source), 1)
271 if t.closed.IsSet() {
274 if ipAddr, ok := tryIpPortFromNetAddr(p.Addr); ok {
275 if cl.badPeerIPPort(ipAddr.IP, ipAddr.Port) {
276 torrent.Add("peers not added because of bad addr", 1)
277 // cl.logger.Printf("peers not added because of bad addr: %v", p)
281 if replaced, ok := t.peers.AddReturningReplacedPeer(p); ok {
282 torrent.Add("peers replaced", 1)
283 if !replaced.equal(p) {
284 t.logger.WithDefaultLevel(log.Debug).Printf("added %v replacing %v", p, replaced)
291 for t.peers.Len() > cl.config.TorrentPeersHighWater {
292 _, ok := t.peers.DeleteMin()
294 torrent.Add("excess reserve peers discarded", 1)
300 func (t *Torrent) invalidateMetadata() {
301 for i := range t.metadataCompletedChunks {
302 t.metadataCompletedChunks[i] = false
309 func (t *Torrent) saveMetadataPiece(index int, data []byte) {
313 if index >= len(t.metadataCompletedChunks) {
314 t.logger.Printf("%s: ignoring metadata piece %d", t, index)
317 copy(t.metadataBytes[(1<<14)*index:], data)
318 t.metadataCompletedChunks[index] = true
321 func (t *Torrent) metadataPieceCount() int {
322 return (len(t.metadataBytes) + (1 << 14) - 1) / (1 << 14)
325 func (t *Torrent) haveMetadataPiece(piece int) bool {
327 return (1<<14)*piece < len(t.metadataBytes)
329 return piece < len(t.metadataCompletedChunks) && t.metadataCompletedChunks[piece]
333 func (t *Torrent) metadataSize() int {
334 return len(t.metadataBytes)
337 func infoPieceHashes(info *metainfo.Info) (ret [][]byte) {
338 for i := 0; i < len(info.Pieces); i += sha1.Size {
339 ret = append(ret, info.Pieces[i:i+sha1.Size])
344 func (t *Torrent) makePieces() {
345 hashes := infoPieceHashes(t.info)
346 t.pieces = make([]Piece, len(hashes))
347 for i, hash := range hashes {
348 piece := &t.pieces[i]
350 piece.index = pieceIndex(i)
351 piece.noPendingWrites.L = &piece.pendingWritesMutex
352 piece.hash = (*metainfo.Hash)(unsafe.Pointer(&hash[0]))
354 beginFile := pieceFirstFileIndex(piece.torrentBeginOffset(), files)
355 endFile := pieceEndFileIndex(piece.torrentEndOffset(), files)
356 piece.files = files[beginFile:endFile]
360 // Returns the index of the first file containing the piece. files must be
361 // ordered by offset.
362 func pieceFirstFileIndex(pieceOffset int64, files []*File) int {
363 for i, f := range files {
364 if f.offset+f.length > pieceOffset {
371 // Returns the index after the last file containing the piece. files must be
372 // ordered by offset.
373 func pieceEndFileIndex(pieceEndOffset int64, files []*File) int {
374 for i, f := range files {
375 if f.offset+f.length >= pieceEndOffset {
382 func (t *Torrent) cacheLength() {
384 for _, f := range t.info.UpvertedFiles() {
390 func (t *Torrent) setInfo(info *metainfo.Info) error {
391 if err := validateInfo(info); err != nil {
392 return fmt.Errorf("bad info: %s", err)
394 if t.storageOpener != nil {
396 t.storage, err = t.storageOpener.OpenTorrent(info, t.infoHash)
398 return fmt.Errorf("error opening torrent storage: %s", err)
404 t.fileIndex = segments.NewIndex(common.LengthIterFromUpvertedFiles(info.UpvertedFiles()))
405 t.displayName = "" // Save a few bytes lol.
412 // This seems to be all the follow-up tasks after info is set, that can't fail.
413 func (t *Torrent) onSetInfo() {
414 t.iterPeers(func(p *Peer) {
417 for i := range t.pieces {
418 t.updatePieceCompletion(pieceIndex(i))
420 if !p.storageCompletionOk {
421 // t.logger.Printf("piece %s completion unknown, queueing check", p)
422 t.queuePieceCheck(pieceIndex(i))
425 t.cl.event.Broadcast()
427 t.updateWantPeersEvent()
428 t.pendingRequests = make(map[Request]int)
429 t.tryCreateMorePieceHashers()
432 // Called when metadata for a torrent becomes available.
433 func (t *Torrent) setInfoBytes(b []byte) error {
434 if metainfo.HashBytes(b) != t.infoHash {
435 return errors.New("info bytes have wrong hash")
437 var info metainfo.Info
438 if err := bencode.Unmarshal(b, &info); err != nil {
439 return fmt.Errorf("error unmarshalling info bytes: %s", err)
442 t.metadataCompletedChunks = nil
446 if err := t.setInfo(&info); err != nil {
453 func (t *Torrent) haveAllMetadataPieces() bool {
457 if t.metadataCompletedChunks == nil {
460 for _, have := range t.metadataCompletedChunks {
468 // TODO: Propagate errors to disconnect peer.
469 func (t *Torrent) setMetadataSize(bytes int) (err error) {
471 // We already know the correct metadata size.
474 if bytes <= 0 || bytes > 10000000 { // 10MB, pulled from my ass.
475 return errors.New("bad size")
477 if t.metadataBytes != nil && len(t.metadataBytes) == int(bytes) {
480 t.metadataBytes = make([]byte, bytes)
481 t.metadataCompletedChunks = make([]bool, (bytes+(1<<14)-1)/(1<<14))
482 t.metadataChanged.Broadcast()
483 for c := range t.conns {
484 c.requestPendingMetadata()
489 // The current working name for the torrent. Either the name in the info dict,
490 // or a display name given such as by the dn value in a magnet link, or "".
491 func (t *Torrent) name() string {
493 defer t.nameMu.RUnlock()
500 func (t *Torrent) pieceState(index pieceIndex) (ret PieceState) {
501 p := &t.pieces[index]
502 ret.Priority = t.piecePriority(index)
503 ret.Completion = p.completion()
504 ret.QueuedForHash = p.queuedForHash()
505 ret.Hashing = p.hashing
506 ret.Checking = ret.QueuedForHash || ret.Hashing
507 ret.Marking = p.marking
508 if !ret.Complete && t.piecePartiallyDownloaded(index) {
514 func (t *Torrent) metadataPieceSize(piece int) int {
515 return metadataPieceSize(len(t.metadataBytes), piece)
518 func (t *Torrent) newMetadataExtensionMessage(c *PeerConn, msgType int, piece int, data []byte) pp.Message {
524 d["total_size"] = len(t.metadataBytes)
526 p := bencode.MustMarshal(d)
529 ExtendedID: c.PeerExtensionIDs[pp.ExtensionNameMetadata],
530 ExtendedPayload: append(p, data...),
534 func (t *Torrent) pieceStateRuns() (ret PieceStateRuns) {
535 rle := missinggo.NewRunLengthEncoder(func(el interface{}, count uint64) {
536 ret = append(ret, PieceStateRun{
537 PieceState: el.(PieceState),
541 for index := range t.pieces {
542 rle.Append(t.pieceState(pieceIndex(index)), 1)
548 // Produces a small string representing a PieceStateRun.
549 func (psr PieceStateRun) String() (ret string) {
550 ret = fmt.Sprintf("%d", psr.Length)
551 ret += func() string {
552 switch psr.Priority {
553 case PiecePriorityNext:
555 case PiecePriorityNormal:
557 case PiecePriorityReadahead:
559 case PiecePriorityNow:
561 case PiecePriorityHigh:
570 if psr.QueuedForHash {
588 func (t *Torrent) writeStatus(w io.Writer) {
589 fmt.Fprintf(w, "Infohash: %s\n", t.infoHash.HexString())
590 fmt.Fprintf(w, "Metadata length: %d\n", t.metadataSize())
592 fmt.Fprintf(w, "Metadata have: ")
593 for _, h := range t.metadataCompletedChunks {
594 fmt.Fprintf(w, "%c", func() rune {
604 fmt.Fprintf(w, "Piece length: %s\n", func() string {
606 return fmt.Sprint(t.usualPieceSize())
612 fmt.Fprintf(w, "Num Pieces: %d (%d completed)\n", t.numPieces(), t.numPiecesCompleted())
613 fmt.Fprintf(w, "Piece States: %s", t.pieceStateRuns())
616 fmt.Fprintf(w, "Reader Pieces:")
617 t.forReaderOffsetPieces(func(begin, end pieceIndex) (again bool) {
618 fmt.Fprintf(w, " %d:%d", begin, end)
623 fmt.Fprintf(w, "Enabled trackers:\n")
625 tw := tabwriter.NewWriter(w, 0, 0, 2, ' ', 0)
626 fmt.Fprintf(tw, " URL\tExtra\n")
627 for _, ta := range slices.Sort(slices.FromMapElems(t.trackerAnnouncers), func(l, r torrentTrackerAnnouncer) bool {
630 var luns, runs url.URL = *lu, *ru
633 var ml missinggo.MultiLess
634 ml.StrictNext(luns.String() == runs.String(), luns.String() < runs.String())
635 ml.StrictNext(lu.String() == ru.String(), lu.String() < ru.String())
637 }).([]torrentTrackerAnnouncer) {
638 fmt.Fprintf(tw, " %q\t%v\n", ta.URL(), ta.statusLine())
643 fmt.Fprintf(w, "DHT Announces: %d\n", t.numDHTAnnounces)
645 spew.NewDefaultConfig()
646 spew.Fdump(w, t.statsLocked())
648 peers := t.peersAsSlice()
649 sort.Slice(peers, func(i, j int) bool {
650 return worseConn(peers[i], peers[j])
652 for i, c := range peers {
653 fmt.Fprintf(w, "%2d. ", i+1)
658 func (t *Torrent) haveInfo() bool {
662 // Returns a run-time generated MetaInfo that includes the info bytes and
663 // announce-list as currently known to the client.
664 func (t *Torrent) newMetaInfo() metainfo.MetaInfo {
665 return metainfo.MetaInfo{
666 CreationDate: time.Now().Unix(),
667 Comment: "dynamic metainfo from client",
668 CreatedBy: "go.torrent",
669 AnnounceList: t.metainfo.UpvertedAnnounceList().Clone(),
670 InfoBytes: func() []byte {
672 return t.metadataBytes
680 func (t *Torrent) BytesMissing() int64 {
683 return t.bytesMissingLocked()
686 func (t *Torrent) bytesMissingLocked() int64 {
690 func (t *Torrent) bytesLeft() (left int64) {
691 bitmap.Flip(t._completedPieces, 0, bitmap.BitIndex(t.numPieces())).IterTyped(func(piece int) bool {
692 p := &t.pieces[piece]
693 left += int64(p.length() - p.numDirtyBytes())
699 // Bytes left to give in tracker announces.
700 func (t *Torrent) bytesLeftAnnounce() int64 {
708 func (t *Torrent) piecePartiallyDownloaded(piece pieceIndex) bool {
709 if t.pieceComplete(piece) {
712 if t.pieceAllDirty(piece) {
715 return t.pieces[piece].hasDirtyChunks()
718 func (t *Torrent) usualPieceSize() int {
719 return int(t.info.PieceLength)
722 func (t *Torrent) numPieces() pieceIndex {
723 return pieceIndex(t.info.NumPieces())
726 func (t *Torrent) numPiecesCompleted() (num int) {
727 return t._completedPieces.Len()
730 func (t *Torrent) close() (err error) {
733 if t.storage != nil {
736 t.storageLock.Unlock()
738 for conn := range t.conns {
742 t.cl.event.Broadcast()
743 t.pieceStateChanges.Close()
744 t.updateWantPeersEvent()
748 func (t *Torrent) requestOffset(r Request) int64 {
749 return torrentRequestOffset(*t.length, int64(t.usualPieceSize()), r)
752 // Return the request that would include the given offset into the torrent data. Returns !ok if
753 // there is no such request.
754 func (t *Torrent) offsetRequest(off int64) (req Request, ok bool) {
755 return torrentOffsetRequest(*t.length, t.info.PieceLength, int64(t.chunkSize), off)
758 func (t *Torrent) writeChunk(piece int, begin int64, data []byte) (err error) {
759 defer perf.ScopeTimerErr(&err)()
760 n, err := t.pieces[piece].Storage().WriteAt(data, begin)
761 if err == nil && n != len(data) {
762 err = io.ErrShortWrite
767 func (t *Torrent) bitfield() (bf []bool) {
768 bf = make([]bool, t.numPieces())
769 t._completedPieces.IterTyped(func(piece int) (again bool) {
776 func (t *Torrent) pieceNumChunks(piece pieceIndex) pp.Integer {
777 return (t.pieceLength(piece) + t.chunkSize - 1) / t.chunkSize
780 func (t *Torrent) pendAllChunkSpecs(pieceIndex pieceIndex) {
781 t.pieces[pieceIndex]._dirtyChunks.Clear()
784 func (t *Torrent) pieceLength(piece pieceIndex) pp.Integer {
785 if t.info.PieceLength == 0 {
786 // There will be no variance amongst pieces. Only pain.
789 if piece == t.numPieces()-1 {
790 ret := pp.Integer(*t.length % t.info.PieceLength)
795 return pp.Integer(t.info.PieceLength)
798 func (t *Torrent) hashPiece(piece pieceIndex) (ret metainfo.Hash, err error) {
799 hash := pieceHash.New()
801 p.waitNoPendingWrites()
802 storagePiece := t.pieces[piece].Storage()
803 const logPieceContents = false
804 if logPieceContents {
805 var examineBuf bytes.Buffer
806 _, err = storagePiece.WriteTo(io.MultiWriter(hash, &examineBuf))
807 log.Printf("hashed %q with copy err %v", examineBuf.Bytes(), err)
809 _, err = storagePiece.WriteTo(hash)
811 missinggo.CopyExact(&ret, hash.Sum(nil))
815 func (t *Torrent) haveAnyPieces() bool {
816 return t._completedPieces.Len() != 0
819 func (t *Torrent) haveAllPieces() bool {
823 return t._completedPieces.Len() == bitmap.BitIndex(t.numPieces())
826 func (t *Torrent) havePiece(index pieceIndex) bool {
827 return t.haveInfo() && t.pieceComplete(index)
830 func (t *Torrent) maybeDropMutuallyCompletePeer(
831 // I'm not sure about taking peer here, not all peer implementations actually drop. Maybe that's okay?
834 if !t.cl.config.DropMutuallyCompletePeers {
837 if !t.haveAllPieces() {
840 if all, known := p.peerHasAllPieces(); !(known && all) {
846 t.logger.WithDefaultLevel(log.Debug).Printf("dropping %v, which is mutually complete", p)
850 func (t *Torrent) haveChunk(r Request) (ret bool) {
852 // log.Println("have chunk", r, ret)
857 if t.pieceComplete(pieceIndex(r.Index)) {
860 p := &t.pieces[r.Index]
861 return !p.pendingChunk(r.ChunkSpec, t.chunkSize)
864 func chunkIndex(cs ChunkSpec, chunkSize pp.Integer) int {
865 return int(cs.Begin / chunkSize)
868 func (t *Torrent) wantPieceIndex(index pieceIndex) bool {
872 if index < 0 || index >= t.numPieces() {
875 p := &t.pieces[index]
876 if p.queuedForHash() {
882 if t.pieceComplete(index) {
885 if t._pendingPieces.Contains(bitmap.BitIndex(index)) {
888 // t.logger.Printf("piece %d not pending", index)
889 return !t.forReaderOffsetPieces(func(begin, end pieceIndex) bool {
890 return index < begin || index >= end
894 // The worst connection is one that hasn't been sent, or sent anything useful for the longest. A bad
895 // connection is one that usually sends us unwanted pieces, or has been in worser half of the
896 // established connections for more than a minute.
897 func (t *Torrent) worstBadConn() *PeerConn {
898 wcs := worseConnSlice{t.unclosedConnsAsSlice()}
901 c := heap.Pop(&wcs).(*PeerConn)
902 if c._stats.ChunksReadWasted.Int64() >= 6 && c._stats.ChunksReadWasted.Int64() > c._stats.ChunksReadUseful.Int64() {
905 // If the connection is in the worst half of the established
906 // connection quota and is older than a minute.
907 if wcs.Len() >= (t.maxEstablishedConns+1)/2 {
908 // Give connections 1 minute to prove themselves.
909 if time.Since(c.completedHandshake) > time.Minute {
917 type PieceStateChange struct {
922 func (t *Torrent) publishPieceChange(piece pieceIndex) {
923 t.cl._mu.Defer(func() {
924 cur := t.pieceState(piece)
925 p := &t.pieces[piece]
926 if cur != p.publicPieceState {
927 p.publicPieceState = cur
928 t.pieceStateChanges.Publish(PieceStateChange{
936 func (t *Torrent) pieceNumPendingChunks(piece pieceIndex) pp.Integer {
937 if t.pieceComplete(piece) {
940 return t.pieceNumChunks(piece) - t.pieces[piece].numDirtyChunks()
943 func (t *Torrent) pieceAllDirty(piece pieceIndex) bool {
944 return t.pieces[piece]._dirtyChunks.Len() == int(t.pieceNumChunks(piece))
947 func (t *Torrent) readersChanged() {
948 t.updateReaderPieces()
949 t.updateAllPiecePriorities()
952 func (t *Torrent) updateReaderPieces() {
953 t._readerNowPieces, t._readerReadaheadPieces = t.readerPiecePriorities()
956 func (t *Torrent) readerPosChanged(from, to pieceRange) {
960 t.updateReaderPieces()
961 // Order the ranges, high and low.
963 if l.begin > h.begin {
967 // Two distinct ranges.
968 t.updatePiecePriorities(l.begin, l.end)
969 t.updatePiecePriorities(h.begin, h.end)
976 t.updatePiecePriorities(l.begin, end)
980 func (t *Torrent) maybeNewConns() {
981 // Tickle the accept routine.
982 t.cl.event.Broadcast()
986 func (t *Torrent) piecePriorityChanged(piece pieceIndex) {
987 // t.logger.Printf("piece %d priority changed", piece)
988 t.iterPeers(func(c *Peer) {
989 if c.updatePiecePriority(piece) {
990 // log.Print("conn piece priority changed")
995 t.publishPieceChange(piece)
998 func (t *Torrent) updatePiecePriority(piece pieceIndex) {
999 p := &t.pieces[piece]
1000 newPrio := p.uncachedPriority()
1001 // t.logger.Printf("torrent %p: piece %d: uncached priority: %v", t, piece, newPrio)
1002 if newPrio == PiecePriorityNone {
1003 if !t._pendingPieces.Remove(bitmap.BitIndex(piece)) {
1007 if !t._pendingPieces.Set(bitmap.BitIndex(piece), newPrio.BitmapPriority()) {
1011 t.piecePriorityChanged(piece)
1014 func (t *Torrent) updateAllPiecePriorities() {
1015 t.updatePiecePriorities(0, t.numPieces())
1018 // Update all piece priorities in one hit. This function should have the same
1019 // output as updatePiecePriority, but across all pieces.
1020 func (t *Torrent) updatePiecePriorities(begin, end pieceIndex) {
1021 for i := begin; i < end; i++ {
1022 t.updatePiecePriority(i)
1026 // Returns the range of pieces [begin, end) that contains the extent of bytes.
1027 func (t *Torrent) byteRegionPieces(off, size int64) (begin, end pieceIndex) {
1028 if off >= *t.length {
1038 begin = pieceIndex(off / t.info.PieceLength)
1039 end = pieceIndex((off + size + t.info.PieceLength - 1) / t.info.PieceLength)
1040 if end > pieceIndex(t.info.NumPieces()) {
1041 end = pieceIndex(t.info.NumPieces())
1046 // Returns true if all iterations complete without breaking. Returns the read
1047 // regions for all readers. The reader regions should not be merged as some
1048 // callers depend on this method to enumerate readers.
1049 func (t *Torrent) forReaderOffsetPieces(f func(begin, end pieceIndex) (more bool)) (all bool) {
1050 for r := range t.readers {
1052 if p.begin >= p.end {
1055 if !f(p.begin, p.end) {
1062 func (t *Torrent) piecePriority(piece pieceIndex) piecePriority {
1063 prio, ok := t._pendingPieces.GetPriority(bitmap.BitIndex(piece))
1065 return PiecePriorityNone
1070 ret := piecePriority(-prio)
1071 if ret == PiecePriorityNone {
1077 func (t *Torrent) pendRequest(req Request) {
1078 ci := chunkIndex(req.ChunkSpec, t.chunkSize)
1079 t.pieces[req.Index].pendChunkIndex(ci)
1082 func (t *Torrent) pieceCompletionChanged(piece pieceIndex) {
1084 t.cl.event.Broadcast()
1085 if t.pieceComplete(piece) {
1086 t.onPieceCompleted(piece)
1088 t.onIncompletePiece(piece)
1090 t.updatePiecePriority(piece)
1093 func (t *Torrent) numReceivedConns() (ret int) {
1094 for c := range t.conns {
1095 if c.Discovery == PeerSourceIncoming {
1102 func (t *Torrent) maxHalfOpen() int {
1103 // Note that if we somehow exceed the maximum established conns, we want
1104 // the negative value to have an effect.
1105 establishedHeadroom := int64(t.maxEstablishedConns - len(t.conns))
1106 extraIncoming := int64(t.numReceivedConns() - t.maxEstablishedConns/2)
1107 // We want to allow some experimentation with new peers, and to try to
1108 // upset an oversupply of received connections.
1109 return int(min(max(5, extraIncoming)+establishedHeadroom, int64(t.cl.config.HalfOpenConnsPerTorrent)))
1112 func (t *Torrent) openNewConns() (initiated int) {
1113 defer t.updateWantPeersEvent()
1114 for t.peers.Len() != 0 {
1118 if len(t.halfOpen) >= t.maxHalfOpen() {
1121 if len(t.cl.dialers) == 0 {
1124 if t.cl.numHalfOpen >= t.cl.config.TotalHalfOpenConns {
1127 p := t.peers.PopMax()
1134 func (t *Torrent) getConnPieceInclination() []int {
1135 _ret := t.connPieceInclinationPool.Get()
1137 pieceInclinationsNew.Add(1)
1138 return rand.Perm(int(t.numPieces()))
1140 pieceInclinationsReused.Add(1)
1141 return *_ret.(*[]int)
1144 func (t *Torrent) putPieceInclination(pi []int) {
1145 t.connPieceInclinationPool.Put(&pi)
1146 pieceInclinationsPut.Add(1)
1149 func (t *Torrent) updatePieceCompletion(piece pieceIndex) bool {
1151 uncached := t.pieceCompleteUncached(piece)
1152 cached := p.completion()
1153 changed := cached != uncached
1154 complete := uncached.Complete
1155 p.storageCompletionOk = uncached.Ok
1156 t._completedPieces.Set(bitmap.BitIndex(piece), complete)
1157 if complete && len(p.dirtiers) != 0 {
1158 t.logger.Printf("marked piece %v complete but still has dirtiers", piece)
1161 log.Fstr("piece %d completion changed: %+v -> %+v", piece, cached, uncached).SetLevel(log.Debug).Log(t.logger)
1162 t.pieceCompletionChanged(piece)
1167 // Non-blocking read. Client lock is not required.
1168 func (t *Torrent) readAt(b []byte, off int64) (n int, err error) {
1170 p := &t.pieces[off/t.info.PieceLength]
1171 p.waitNoPendingWrites()
1173 n1, err = p.Storage().ReadAt(b, off-p.Info().Offset())
1184 // Returns an error if the metadata was completed, but couldn't be set for
1185 // some reason. Blame it on the last peer to contribute.
1186 func (t *Torrent) maybeCompleteMetadata() error {
1191 if !t.haveAllMetadataPieces() {
1192 // Don't have enough metadata pieces.
1195 err := t.setInfoBytes(t.metadataBytes)
1197 t.invalidateMetadata()
1198 return fmt.Errorf("error setting info bytes: %s", err)
1200 if t.cl.config.Debug {
1201 t.logger.Printf("%s: got metadata from peers", t)
1206 func (t *Torrent) readerPiecePriorities() (now, readahead bitmap.Bitmap) {
1207 t.forReaderOffsetPieces(func(begin, end pieceIndex) bool {
1209 now.Add(bitmap.BitIndex(begin))
1210 readahead.AddRange(bitmap.BitIndex(begin)+1, bitmap.BitIndex(end))
1217 func (t *Torrent) needData() bool {
1218 if t.closed.IsSet() {
1224 return t._pendingPieces.Len() != 0
1227 func appendMissingStrings(old, new []string) (ret []string) {
1230 for _, n := range new {
1231 for _, o := range old {
1236 ret = append(ret, n)
1241 func appendMissingTrackerTiers(existing [][]string, minNumTiers int) (ret [][]string) {
1243 for minNumTiers > len(ret) {
1244 ret = append(ret, nil)
1249 func (t *Torrent) addTrackers(announceList [][]string) {
1250 fullAnnounceList := &t.metainfo.AnnounceList
1251 t.metainfo.AnnounceList = appendMissingTrackerTiers(*fullAnnounceList, len(announceList))
1252 for tierIndex, trackerURLs := range announceList {
1253 (*fullAnnounceList)[tierIndex] = appendMissingStrings((*fullAnnounceList)[tierIndex], trackerURLs)
1255 t.startMissingTrackerScrapers()
1256 t.updateWantPeersEvent()
1259 // Don't call this before the info is available.
1260 func (t *Torrent) bytesCompleted() int64 {
1264 return t.info.TotalLength() - t.bytesLeft()
1267 func (t *Torrent) SetInfoBytes(b []byte) (err error) {
1270 return t.setInfoBytes(b)
1273 // Returns true if connection is removed from torrent.Conns.
1274 func (t *Torrent) deleteConnection(c *PeerConn) (ret bool) {
1275 if !c.closed.IsSet() {
1276 panic("connection is not closed")
1277 // There are behaviours prevented by the closed state that will fail
1278 // if the connection has been deleted.
1282 // Avoid adding a drop event more than once. Probably we should track whether we've generated
1283 // the drop event against the PexConnState instead.
1285 if !t.cl.config.DisablePEX {
1289 torrent.Add("deleted connections", 1)
1290 c.deleteAllRequests()
1291 if t.numActivePeers() == 0 {
1292 t.assertNoPendingRequests()
1297 func (t *Torrent) numActivePeers() (num int) {
1298 t.iterPeers(func(*Peer) {
1304 func (t *Torrent) assertNoPendingRequests() {
1305 if len(t.pendingRequests) != 0 {
1306 panic(t.pendingRequests)
1308 //if len(t.lastRequested) != 0 {
1309 // panic(t.lastRequested)
1313 func (t *Torrent) dropConnection(c *PeerConn) {
1314 t.cl.event.Broadcast()
1316 if t.deleteConnection(c) {
1321 func (t *Torrent) wantPeers() bool {
1322 if t.closed.IsSet() {
1325 if t.peers.Len() > t.cl.config.TorrentPeersLowWater {
1328 return t.needData() || t.seeding()
1331 func (t *Torrent) updateWantPeersEvent() {
1333 t.wantPeersEvent.Set()
1335 t.wantPeersEvent.Clear()
1339 // Returns whether the client should make effort to seed the torrent.
1340 func (t *Torrent) seeding() bool {
1342 if t.closed.IsSet() {
1345 if t.dataUploadDisallowed {
1348 if cl.config.NoUpload {
1351 if !cl.config.Seed {
1354 if cl.config.DisableAggressiveUpload && t.needData() {
1360 func (t *Torrent) onWebRtcConn(
1361 c datachannel.ReadWriteCloser,
1362 dcc webtorrent.DataChannelContext,
1365 pc, err := t.cl.initiateProtocolHandshakes(
1366 context.Background(),
1367 webrtcNetConn{c, dcc},
1371 webrtcNetAddr{dcc.Remote},
1373 fmt.Sprintf("webrtc offer_id %x", dcc.OfferId),
1376 t.logger.WithDefaultLevel(log.Error).Printf("error in handshaking webrtc connection: %v", err)
1379 if dcc.LocalOffered {
1380 pc.Discovery = PeerSourceTracker
1382 pc.Discovery = PeerSourceIncoming
1386 err = t.cl.runHandshookConn(pc, t)
1388 t.logger.WithDefaultLevel(log.Critical).Printf("error running handshook webrtc conn: %v", err)
1392 func (t *Torrent) logRunHandshookConn(pc *PeerConn, logAll bool, level log.Level) {
1393 err := t.cl.runHandshookConn(pc, t)
1394 if err != nil || logAll {
1395 t.logger.WithDefaultLevel(level).Printf("error running handshook conn: %v", err)
1399 func (t *Torrent) runHandshookConnLoggingErr(pc *PeerConn) {
1400 t.logRunHandshookConn(pc, false, log.Debug)
1403 func (t *Torrent) startWebsocketAnnouncer(u url.URL) torrentTrackerAnnouncer {
1404 wtc, release := t.cl.websocketTrackers.Get(u.String())
1406 <-t.closed.LockedChan(t.cl.locker())
1409 wst := websocketTrackerStatus{u, wtc}
1411 err := wtc.Announce(tracker.Started, t.infoHash)
1413 t.logger.WithDefaultLevel(log.Warning).Printf(
1414 "error in initial announce to %q: %v",
1423 func (t *Torrent) startScrapingTracker(_url string) {
1427 u, err := url.Parse(_url)
1429 // URLs with a leading '*' appear to be a uTorrent convention to
1430 // disable trackers.
1432 log.Str("error parsing tracker url").AddValues("url", _url).Log(t.logger)
1436 if u.Scheme == "udp" {
1438 t.startScrapingTracker(u.String())
1440 t.startScrapingTracker(u.String())
1443 if _, ok := t.trackerAnnouncers[_url]; ok {
1446 sl := func() torrentTrackerAnnouncer {
1449 if t.cl.config.DisableWebtorrent {
1452 return t.startWebsocketAnnouncer(*u)
1454 if t.cl.config.DisableIPv4Peers || t.cl.config.DisableIPv4 {
1458 if t.cl.config.DisableIPv6 {
1462 newAnnouncer := &trackerScraper{
1466 go newAnnouncer.Run()
1472 if t.trackerAnnouncers == nil {
1473 t.trackerAnnouncers = make(map[string]torrentTrackerAnnouncer)
1475 t.trackerAnnouncers[_url] = sl
1478 // Adds and starts tracker scrapers for tracker URLs that aren't already
1480 func (t *Torrent) startMissingTrackerScrapers() {
1481 if t.cl.config.DisableTrackers {
1484 t.startScrapingTracker(t.metainfo.Announce)
1485 for _, tier := range t.metainfo.AnnounceList {
1486 for _, url := range tier {
1487 t.startScrapingTracker(url)
1492 // Returns an AnnounceRequest with fields filled out to defaults and current
1494 func (t *Torrent) announceRequest(event tracker.AnnounceEvent) tracker.AnnounceRequest {
1495 // Note that IPAddress is not set. It's set for UDP inside the tracker code, since it's
1496 // dependent on the network in use.
1497 return tracker.AnnounceRequest{
1499 NumWant: func() int32 {
1500 if t.wantPeers() && len(t.cl.dialers) > 0 {
1506 Port: uint16(t.cl.incomingPeerPort()),
1507 PeerId: t.cl.peerID,
1508 InfoHash: t.infoHash,
1509 Key: t.cl.announceKey(),
1511 // The following are vaguely described in BEP 3.
1513 Left: t.bytesLeftAnnounce(),
1514 Uploaded: t.stats.BytesWrittenData.Int64(),
1515 // There's no mention of wasted or unwanted download in the BEP.
1516 Downloaded: t.stats.BytesReadUsefulData.Int64(),
1520 // Adds peers revealed in an announce until the announce ends, or we have
1522 func (t *Torrent) consumeDhtAnnouncePeers(pvs <-chan dht.PeersValues) {
1524 for v := range pvs {
1526 for _, cp := range v.Peers {
1528 // Can't do anything with this.
1532 Addr: ipPortAddr{cp.IP, cp.Port},
1533 Source: PeerSourceDhtGetPeers,
1540 func (t *Torrent) announceToDht(impliedPort bool, s DhtServer) error {
1541 ps, err := s.Announce(t.infoHash, t.cl.incomingPeerPort(), impliedPort)
1545 go t.consumeDhtAnnouncePeers(ps.Peers())
1547 case <-t.closed.LockedChan(t.cl.locker()):
1548 case <-time.After(5 * time.Minute):
1554 func (t *Torrent) dhtAnnouncer(s DhtServer) {
1560 if t.closed.IsSet() {
1566 // TODO: Determine if there's a listener on the port we're announcing.
1567 if len(cl.dialers) == 0 && len(cl.listeners) == 0 {
1578 err := t.announceToDht(true, s)
1580 t.logger.WithDefaultLevel(log.Warning).Printf("error announcing %q to DHT: %s", t, err)
1586 func (t *Torrent) addPeers(peers []PeerInfo) (added int) {
1587 for _, p := range peers {
1595 // The returned TorrentStats may require alignment in memory. See
1596 // https://github.com/anacrolix/torrent/issues/383.
1597 func (t *Torrent) Stats() TorrentStats {
1599 defer t.cl.rUnlock()
1600 return t.statsLocked()
1603 func (t *Torrent) statsLocked() (ret TorrentStats) {
1604 ret.ActivePeers = len(t.conns)
1605 ret.HalfOpenPeers = len(t.halfOpen)
1606 ret.PendingPeers = t.peers.Len()
1607 ret.TotalPeers = t.numTotalPeers()
1608 ret.ConnectedSeeders = 0
1609 for c := range t.conns {
1610 if all, ok := c.peerHasAllPieces(); all && ok {
1611 ret.ConnectedSeeders++
1614 ret.ConnStats = t.stats.Copy()
1618 // The total number of peers in the torrent.
1619 func (t *Torrent) numTotalPeers() int {
1620 peers := make(map[string]struct{})
1621 for conn := range t.conns {
1622 ra := conn.conn.RemoteAddr()
1624 // It's been closed and doesn't support RemoteAddr.
1627 peers[ra.String()] = struct{}{}
1629 for addr := range t.halfOpen {
1630 peers[addr] = struct{}{}
1632 t.peers.Each(func(peer PeerInfo) {
1633 peers[peer.Addr.String()] = struct{}{}
1638 // Reconcile bytes transferred before connection was associated with a
1640 func (t *Torrent) reconcileHandshakeStats(c *PeerConn) {
1641 if c._stats != (ConnStats{
1642 // Handshakes should only increment these fields:
1643 BytesWritten: c._stats.BytesWritten,
1644 BytesRead: c._stats.BytesRead,
1648 c.postHandshakeStats(func(cs *ConnStats) {
1649 cs.BytesRead.Add(c._stats.BytesRead.Int64())
1650 cs.BytesWritten.Add(c._stats.BytesWritten.Int64())
1652 c.reconciledHandshakeStats = true
1655 // Returns true if the connection is added.
1656 func (t *Torrent) addConnection(c *PeerConn) (err error) {
1659 torrent.Add("added connections", 1)
1662 if t.closed.IsSet() {
1663 return errors.New("torrent closed")
1665 for c0 := range t.conns {
1666 if c.PeerID != c0.PeerID {
1669 if !t.cl.config.DropDuplicatePeerIds {
1672 if left, ok := c.hasPreferredNetworkOver(c0); ok && left {
1674 t.deleteConnection(c0)
1676 return errors.New("existing connection preferred")
1679 if len(t.conns) >= t.maxEstablishedConns {
1680 c := t.worstBadConn()
1682 return errors.New("don't want conns")
1685 t.deleteConnection(c)
1687 if len(t.conns) >= t.maxEstablishedConns {
1690 t.conns[c] = struct{}{}
1691 if !t.cl.config.DisablePEX && !c.PeerExtensionBytes.SupportsExtended() {
1692 t.pex.Add(c) // as no further extended handshake expected
1697 func (t *Torrent) wantConns() bool {
1698 if !t.networkingEnabled {
1701 if t.closed.IsSet() {
1704 if !t.seeding() && !t.needData() {
1707 if len(t.conns) < t.maxEstablishedConns {
1710 return t.worstBadConn() != nil
1713 func (t *Torrent) SetMaxEstablishedConns(max int) (oldMax int) {
1716 oldMax = t.maxEstablishedConns
1717 t.maxEstablishedConns = max
1718 wcs := slices.HeapInterface(slices.FromMapKeys(t.conns), func(l, r *PeerConn) bool {
1719 return worseConn(&l.Peer, &r.Peer)
1721 for len(t.conns) > t.maxEstablishedConns && wcs.Len() > 0 {
1722 t.dropConnection(wcs.Pop().(*PeerConn))
1728 func (t *Torrent) pieceHashed(piece pieceIndex, passed bool, hashIoErr error) {
1729 t.logger.Log(log.Fstr("hashed piece %d (passed=%t)", piece, passed).SetLevel(log.Debug))
1732 t.cl.event.Broadcast()
1733 if t.closed.IsSet() {
1737 // Don't score the first time a piece is hashed, it could be an initial check.
1738 if p.storageCompletionOk {
1740 pieceHashedCorrect.Add(1)
1742 log.Fmsg("piece %d failed hash: %d connections contributed", piece, len(p.dirtiers)).AddValues(t, p).Log(t.logger)
1743 pieceHashedNotCorrect.Add(1)
1748 t.publishPieceChange(piece)
1751 t.publishPieceChange(piece)
1755 if len(p.dirtiers) != 0 {
1756 // Don't increment stats above connection-level for every involved connection.
1757 t.allStats((*ConnStats).incrementPiecesDirtiedGood)
1759 for c := range p.dirtiers {
1760 c._stats.incrementPiecesDirtiedGood()
1762 t.clearPieceTouchers(piece)
1763 p.incrementPendingWrites()
1765 err := p.Storage().MarkComplete()
1767 t.logger.Printf("%T: error marking piece complete %d: %s", t.storage, piece, err)
1770 p.decrementPendingWrites()
1771 if t.closed.IsSet() {
1774 t.pendAllChunkSpecs(piece)
1776 if len(p.dirtiers) != 0 && p.allChunksDirty() && hashIoErr == nil {
1777 // Peers contributed to all the data for this piece hash failure, and the failure was
1778 // not due to errors in the storage (such as data being dropped in a cache).
1780 // Increment Torrent and above stats, and then specific connections.
1781 t.allStats((*ConnStats).incrementPiecesDirtiedBad)
1782 for c := range p.dirtiers {
1783 // Y u do dis peer?!
1784 c.stats().incrementPiecesDirtiedBad()
1787 bannableTouchers := make([]*Peer, 0, len(p.dirtiers))
1788 for c := range p.dirtiers {
1790 bannableTouchers = append(bannableTouchers, c)
1793 t.clearPieceTouchers(piece)
1794 slices.Sort(bannableTouchers, connLessTrusted)
1796 if t.cl.config.Debug {
1798 "bannable conns by trust for piece %d: %v",
1800 func() (ret []connectionTrust) {
1801 for _, c := range bannableTouchers {
1802 ret = append(ret, c.trust())
1809 if len(bannableTouchers) >= 1 {
1810 c := bannableTouchers[0]
1811 t.cl.banPeerIP(c.remoteIp())
1815 t.onIncompletePiece(piece)
1816 p.Storage().MarkNotComplete()
1818 t.updatePieceCompletion(piece)
1821 func (t *Torrent) cancelRequestsForPiece(piece pieceIndex) {
1822 // TODO: Make faster
1823 for cn := range t.conns {
1828 func (t *Torrent) onPieceCompleted(piece pieceIndex) {
1829 t.pendAllChunkSpecs(piece)
1830 t.cancelRequestsForPiece(piece)
1831 for conn := range t.conns {
1833 t.maybeDropMutuallyCompletePeer(&conn.Peer)
1837 // Called when a piece is found to be not complete.
1838 func (t *Torrent) onIncompletePiece(piece pieceIndex) {
1839 if t.pieceAllDirty(piece) {
1840 t.pendAllChunkSpecs(piece)
1842 if !t.wantPieceIndex(piece) {
1843 // t.logger.Printf("piece %d incomplete and unwanted", piece)
1846 // We could drop any connections that we told we have a piece that we
1847 // don't here. But there's a test failure, and it seems clients don't care
1848 // if you request pieces that you already claim to have. Pruning bad
1849 // connections might just remove any connections that aren't treating us
1850 // favourably anyway.
1852 // for c := range t.conns {
1853 // if c.sentHave(piece) {
1857 t.iterPeers(func(conn *Peer) {
1858 if conn.peerHasPiece(piece) {
1859 conn.updateRequests()
1864 func (t *Torrent) tryCreateMorePieceHashers() {
1865 for !t.closed.IsSet() && t.activePieceHashes < 2 && t.tryCreatePieceHasher() {
1869 func (t *Torrent) tryCreatePieceHasher() bool {
1870 if t.storage == nil {
1873 pi, ok := t.getPieceToHash()
1878 t.piecesQueuedForHash.Remove(pi)
1880 t.publishPieceChange(pi)
1881 t.updatePiecePriority(pi)
1882 t.storageLock.RLock()
1883 t.activePieceHashes++
1884 go t.pieceHasher(pi)
1888 func (t *Torrent) getPieceToHash() (ret pieceIndex, ok bool) {
1889 t.piecesQueuedForHash.IterTyped(func(i pieceIndex) bool {
1890 if t.piece(i).hashing {
1900 func (t *Torrent) pieceHasher(index pieceIndex) {
1902 sum, copyErr := t.hashPiece(index)
1903 correct := sum == *p.hash
1907 log.Fmsg("piece %v (%s) hash failure copy error: %v", p, p.hash.HexString(), copyErr).Log(t.logger)
1909 t.storageLock.RUnlock()
1913 t.updatePiecePriority(index)
1914 t.pieceHashed(index, correct, copyErr)
1915 t.publishPieceChange(index)
1916 t.activePieceHashes--
1917 t.tryCreateMorePieceHashers()
1920 // Return the connections that touched a piece, and clear the entries while doing it.
1921 func (t *Torrent) clearPieceTouchers(pi pieceIndex) {
1923 for c := range p.dirtiers {
1924 delete(c.peerTouchedPieces, pi)
1925 delete(p.dirtiers, c)
1929 func (t *Torrent) peersAsSlice() (ret []*Peer) {
1930 t.iterPeers(func(p *Peer) {
1931 ret = append(ret, p)
1936 func (t *Torrent) queuePieceCheck(pieceIndex pieceIndex) {
1937 piece := t.piece(pieceIndex)
1938 if piece.queuedForHash() {
1941 t.piecesQueuedForHash.Add(bitmap.BitIndex(pieceIndex))
1942 t.publishPieceChange(pieceIndex)
1943 t.updatePiecePriority(pieceIndex)
1944 t.tryCreateMorePieceHashers()
1947 // Forces all the pieces to be re-hashed. See also Piece.VerifyData. This should not be called
1948 // before the Info is available.
1949 func (t *Torrent) VerifyData() {
1950 for i := pieceIndex(0); i < t.NumPieces(); i++ {
1951 t.Piece(i).VerifyData()
1955 // Start the process of connecting to the given peer for the given torrent if appropriate.
1956 func (t *Torrent) initiateConn(peer PeerInfo) {
1957 if peer.Id == t.cl.peerID {
1960 if t.cl.badPeerAddr(peer.Addr) && !peer.Trusted {
1964 if t.addrActive(addr.String()) {
1968 t.halfOpen[addr.String()] = peer
1969 go t.cl.outgoingConnection(t, addr, peer.Source, peer.Trusted)
1972 // Adds a trusted, pending peer for each of the given Client's addresses. Typically used in tests to
1973 // quickly make one Client visible to the Torrent of another Client.
1974 func (t *Torrent) AddClientPeer(cl *Client) int {
1975 return t.AddPeers(func() (ps []PeerInfo) {
1976 for _, la := range cl.ListenAddrs() {
1977 ps = append(ps, PeerInfo{
1986 // All stats that include this Torrent. Useful when we want to increment ConnStats but not for every
1988 func (t *Torrent) allStats(f func(*ConnStats)) {
1993 func (t *Torrent) hashingPiece(i pieceIndex) bool {
1994 return t.pieces[i].hashing
1997 func (t *Torrent) pieceQueuedForHash(i pieceIndex) bool {
1998 return t.piecesQueuedForHash.Get(bitmap.BitIndex(i))
2001 func (t *Torrent) dialTimeout() time.Duration {
2002 return reducedDialTimeout(t.cl.config.MinDialTimeout, t.cl.config.NominalDialTimeout, t.cl.config.HalfOpenConnsPerTorrent, t.peers.Len())
2005 func (t *Torrent) piece(i int) *Piece {
2009 func (t *Torrent) requestStrategyTorrent() requestStrategyTorrent {
2013 type torrentRequestStrategyCallbacks struct {
2017 func (cb torrentRequestStrategyCallbacks) requestTimedOut(r Request) {
2018 torrent.Add("Request timeouts", 1)
2020 defer cb.t.cl.unlock()
2021 cb.t.iterPeers(func(cn *Peer) {
2022 if cn.peerHasPiece(pieceIndex(r.Index)) {
2029 func (t *Torrent) requestStrategyCallbacks() requestStrategyCallbacks {
2030 return torrentRequestStrategyCallbacks{t}
2033 func (t *Torrent) onWriteChunkErr(err error) {
2034 if t.userOnWriteChunkErr != nil {
2035 go t.userOnWriteChunkErr(err)
2038 t.logger.WithDefaultLevel(log.Critical).Printf("default chunk write error handler: disabling data download")
2039 t.disallowDataDownloadLocked()
2042 func (t *Torrent) DisallowDataDownload() {
2045 t.disallowDataDownloadLocked()
2048 func (t *Torrent) disallowDataDownloadLocked() {
2049 t.dataDownloadDisallowed = true
2050 t.iterPeers(func(c *Peer) {
2056 func (t *Torrent) AllowDataDownload() {
2059 t.dataDownloadDisallowed = false
2061 t.iterPeers(func(c *Peer) {
2066 // Enables uploading data, if it was disabled.
2067 func (t *Torrent) AllowDataUpload() {
2070 t.dataUploadDisallowed = false
2071 for c := range t.conns {
2076 // Disables uploading data, if it was enabled.
2077 func (t *Torrent) DisallowDataUpload() {
2080 t.dataUploadDisallowed = true
2081 for c := range t.conns {
2086 // Sets a handler that is called if there's an error writing a chunk to local storage. By default,
2087 // or if nil, a critical message is logged, and data download is disabled.
2088 func (t *Torrent) SetOnWriteChunkError(f func(error)) {
2091 t.userOnWriteChunkErr = f
2094 func (t *Torrent) iterPeers(f func(*Peer)) {
2095 for pc := range t.conns {
2098 for _, ws := range t.webSeeds {
2103 func (t *Torrent) callbacks() *Callbacks {
2104 return &t.cl.config.Callbacks
2107 func (t *Torrent) addWebSeed(url string) {
2108 if t.cl.config.DisableWebseeds {
2111 if _, ok := t.webSeeds[url]; ok {
2114 const maxRequests = 10
2120 reconciledHandshakeStats: true,
2121 peerSentHaveAll: true,
2122 // TODO: Raise this limit, and instead limit concurrent fetches.
2123 PeerMaxRequests: 32,
2124 RemoteAddr: remoteAddrFromUrl(url),
2125 callbacks: t.callbacks(),
2127 client: webseed.Client{
2128 // Consider a MaxConnsPerHost in the transport for this, possibly in a global Client.
2129 HttpClient: http.DefaultClient,
2132 activeRequests: make(map[Request]webseed.Request, maxRequests),
2134 ws.requesterCond.L = t.cl.locker()
2135 for range iter.N(maxRequests) {
2138 for _, f := range t.callbacks().NewPeer {
2141 ws.peer.logger = t.logger.WithContextValue(&ws)
2142 ws.peer.peerImpl = &ws
2144 ws.onGotInfo(t.info)
2146 t.webSeeds[url] = &ws.peer
2149 func (t *Torrent) peerIsActive(p *Peer) (active bool) {
2150 t.iterPeers(func(p1 *Peer) {