20 "github.com/RoaringBitmap/roaring"
21 "github.com/anacrolix/chansync"
22 "github.com/anacrolix/chansync/events"
23 "github.com/anacrolix/dht/v2"
24 "github.com/anacrolix/log"
25 "github.com/anacrolix/missinggo/perf"
26 "github.com/anacrolix/missinggo/pubsub"
27 "github.com/anacrolix/missinggo/slices"
28 "github.com/anacrolix/missinggo/v2"
29 "github.com/anacrolix/missinggo/v2/bitmap"
30 "github.com/anacrolix/missinggo/v2/prioritybitmap"
31 "github.com/anacrolix/multiless"
32 "github.com/anacrolix/sync"
33 "github.com/davecgh/go-spew/spew"
34 "github.com/pion/datachannel"
36 "github.com/anacrolix/torrent/bencode"
37 "github.com/anacrolix/torrent/common"
38 "github.com/anacrolix/torrent/metainfo"
39 pp "github.com/anacrolix/torrent/peer_protocol"
40 "github.com/anacrolix/torrent/segments"
41 "github.com/anacrolix/torrent/storage"
42 "github.com/anacrolix/torrent/tracker"
43 "github.com/anacrolix/torrent/webseed"
44 "github.com/anacrolix/torrent/webtorrent"
47 // Maintains state of torrent within a Client. Many methods should not be called before the info is
48 // available, see .Info and .GotInfo.
50 // Torrent-level aggregate statistics. First in struct to ensure 64-bit
51 // alignment. See #262.
56 networkingEnabled chansync.Flag
57 dataDownloadDisallowed chansync.Flag
58 dataUploadDisallowed bool
59 userOnWriteChunkErr func(error)
61 closed chansync.SetOnce
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
99 // Reserve of peers to connect to. A peer can be both here and in the
100 // active connections if were told about the peer after connecting with
101 // them. That encourages us to reconnect to peers that are well known in
103 peers prioritizedPeers
104 // Whether we want to know to know more peers.
105 wantPeersEvent missinggo.Event
106 // An announcer for each tracker URL.
107 trackerAnnouncers map[string]torrentTrackerAnnouncer
108 // How many times we've initiated a DHT announce. TODO: Move into stats.
111 // Name used if the info name isn't available. Should be cleared when the
112 // Info does become available.
116 // The bencoded bytes of the info dict. This is actively manipulated if
117 // the info bytes aren't initially available, and we try to fetch them
120 // Each element corresponds to the 16KiB metadata pieces. If true, we have
121 // received that piece.
122 metadataCompletedChunks []bool
123 metadataChanged sync.Cond
125 // Closed when .Info is obtained.
126 gotMetainfoC chan struct{}
128 readers map[*reader]struct{}
129 _readerNowPieces bitmap.Bitmap
130 _readerReadaheadPieces bitmap.Bitmap
132 // A cache of pieces we need to get. Calculated from various piece and
133 // file priorities and completion states elsewhere.
134 _pendingPieces prioritybitmap.PriorityBitmap
135 // A cache of completed piece indices.
136 _completedPieces roaring.Bitmap
137 // Pieces that need to be hashed.
138 piecesQueuedForHash bitmap.Bitmap
139 activePieceHashes int
140 initialPieceCheckDisabled bool
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 pendingRequests
149 // Chunks we've written to since the corresponding piece was last checked.
150 dirtyChunks roaring.Bitmap
154 // Is On when all pieces are complete.
155 Complete chansync.Flag
158 func (t *Torrent) pieceAvailabilityFromPeers(i pieceIndex) (count int) {
159 t.iterPeers(func(peer *Peer) {
160 if peer.peerHasPiece(i) {
167 func (t *Torrent) decPieceAvailability(i pieceIndex) {
172 if p.availability <= 0 {
173 panic(p.availability)
178 func (t *Torrent) incPieceAvailability(i pieceIndex) {
179 // If we don't the info, this should be reconciled when we do.
186 func (t *Torrent) readerNowPieces() bitmap.Bitmap {
187 return t._readerNowPieces
190 func (t *Torrent) readerReadaheadPieces() bitmap.Bitmap {
191 return t._readerReadaheadPieces
194 func (t *Torrent) ignorePieceForRequests(i pieceIndex) bool {
195 return !t.wantPieceIndex(i)
198 func (t *Torrent) pendingPieces() *prioritybitmap.PriorityBitmap {
199 return &t._pendingPieces
202 // Returns a channel that is closed when the Torrent is closed.
203 func (t *Torrent) Closed() events.Done {
204 return t.closed.Done()
207 // KnownSwarm returns the known subset of the peers in the Torrent's swarm, including active,
208 // pending, and half-open peers.
209 func (t *Torrent) KnownSwarm() (ks []PeerInfo) {
210 // Add pending peers to the list
211 t.peers.Each(func(peer PeerInfo) {
212 ks = append(ks, peer)
215 // Add half-open peers to the list
216 for _, peer := range t.halfOpen {
217 ks = append(ks, peer)
220 // Add active peers to the list
221 for conn := range t.conns {
223 ks = append(ks, PeerInfo{
225 Addr: conn.RemoteAddr,
226 Source: conn.Discovery,
227 // > If the connection is encrypted, that's certainly enough to set SupportsEncryption.
228 // > But if we're not connected to them with an encrypted connection, I couldn't say
229 // > what's appropriate. We can carry forward the SupportsEncryption value as we
230 // > received it from trackers/DHT/PEX, or just use the encryption state for the
231 // > connection. It's probably easiest to do the latter for now.
232 // https://github.com/anacrolix/torrent/pull/188
233 SupportsEncryption: conn.headerEncrypted,
240 func (t *Torrent) setChunkSize(size pp.Integer) {
242 t.chunkPool = sync.Pool{
243 New: func() interface{} {
244 b := make([]byte, size)
250 func (t *Torrent) pieceComplete(piece pieceIndex) bool {
251 return t._completedPieces.Contains(bitmap.BitIndex(piece))
254 func (t *Torrent) pieceCompleteUncached(piece pieceIndex) storage.Completion {
255 return t.pieces[piece].Storage().Completion()
258 // There's a connection to that address already.
259 func (t *Torrent) addrActive(addr string) bool {
260 if _, ok := t.halfOpen[addr]; ok {
263 for c := range t.conns {
265 if ra.String() == addr {
272 func (t *Torrent) appendUnclosedConns(ret []*PeerConn) []*PeerConn {
273 for c := range t.conns {
274 if !c.closed.IsSet() {
281 func (t *Torrent) addPeer(p PeerInfo) (added bool) {
283 torrent.Add(fmt.Sprintf("peers added by source %q", p.Source), 1)
284 if t.closed.IsSet() {
287 if ipAddr, ok := tryIpPortFromNetAddr(p.Addr); ok {
288 if cl.badPeerIPPort(ipAddr.IP, ipAddr.Port) {
289 torrent.Add("peers not added because of bad addr", 1)
290 // cl.logger.Printf("peers not added because of bad addr: %v", p)
294 if replaced, ok := t.peers.AddReturningReplacedPeer(p); ok {
295 torrent.Add("peers replaced", 1)
296 if !replaced.equal(p) {
297 t.logger.WithDefaultLevel(log.Debug).Printf("added %v replacing %v", p, replaced)
304 for t.peers.Len() > cl.config.TorrentPeersHighWater {
305 _, ok := t.peers.DeleteMin()
307 torrent.Add("excess reserve peers discarded", 1)
313 func (t *Torrent) invalidateMetadata() {
314 for i := 0; i < len(t.metadataCompletedChunks); i++ {
315 t.metadataCompletedChunks[i] = false
318 t.gotMetainfoC = make(chan struct{})
323 func (t *Torrent) saveMetadataPiece(index int, data []byte) {
327 if index >= len(t.metadataCompletedChunks) {
328 t.logger.Printf("%s: ignoring metadata piece %d", t, index)
331 copy(t.metadataBytes[(1<<14)*index:], data)
332 t.metadataCompletedChunks[index] = true
335 func (t *Torrent) metadataPieceCount() int {
336 return (len(t.metadataBytes) + (1 << 14) - 1) / (1 << 14)
339 func (t *Torrent) haveMetadataPiece(piece int) bool {
341 return (1<<14)*piece < len(t.metadataBytes)
343 return piece < len(t.metadataCompletedChunks) && t.metadataCompletedChunks[piece]
347 func (t *Torrent) metadataSize() int {
348 return len(t.metadataBytes)
351 func infoPieceHashes(info *metainfo.Info) (ret [][]byte) {
352 for i := 0; i < len(info.Pieces); i += sha1.Size {
353 ret = append(ret, info.Pieces[i:i+sha1.Size])
358 func (t *Torrent) makePieces() {
359 hashes := infoPieceHashes(t.info)
360 t.pieces = make([]Piece, len(hashes))
361 for i, hash := range hashes {
362 piece := &t.pieces[i]
364 piece.index = pieceIndex(i)
365 piece.noPendingWrites.L = &piece.pendingWritesMutex
366 piece.hash = (*metainfo.Hash)(unsafe.Pointer(&hash[0]))
368 beginFile := pieceFirstFileIndex(piece.torrentBeginOffset(), files)
369 endFile := pieceEndFileIndex(piece.torrentEndOffset(), files)
370 piece.files = files[beginFile:endFile]
374 // Returns the index of the first file containing the piece. files must be
375 // ordered by offset.
376 func pieceFirstFileIndex(pieceOffset int64, files []*File) int {
377 for i, f := range files {
378 if f.offset+f.length > pieceOffset {
385 // Returns the index after the last file containing the piece. files must be
386 // ordered by offset.
387 func pieceEndFileIndex(pieceEndOffset int64, files []*File) int {
388 for i, f := range files {
389 if f.offset+f.length >= pieceEndOffset {
396 func (t *Torrent) cacheLength() {
398 for _, f := range t.info.UpvertedFiles() {
404 // TODO: This shouldn't fail for storage reasons. Instead we should handle storage failure
406 func (t *Torrent) setInfo(info *metainfo.Info) error {
407 if err := validateInfo(info); err != nil {
408 return fmt.Errorf("bad info: %s", err)
410 if t.storageOpener != nil {
412 t.storage, err = t.storageOpener.OpenTorrent(info, t.infoHash)
414 return fmt.Errorf("error opening torrent storage: %s", err)
421 t.fileIndex = segments.NewIndex(common.LengthIterFromUpvertedFiles(info.UpvertedFiles()))
422 t.displayName = "" // Save a few bytes lol.
429 // This seems to be all the follow-up tasks after info is set, that can't fail.
430 func (t *Torrent) onSetInfo() {
431 for i := range t.pieces {
433 // Need to add availability before updating piece completion, as that may result in conns
435 if p.availability != 0 {
436 panic(p.availability)
438 p.availability = int64(t.pieceAvailabilityFromPeers(i))
439 t.updatePieceCompletion(pieceIndex(i))
440 if !t.initialPieceCheckDisabled && !p.storageCompletionOk {
441 // t.logger.Printf("piece %s completion unknown, queueing check", p)
442 t.queuePieceCheck(pieceIndex(i))
445 t.cl.event.Broadcast()
446 close(t.gotMetainfoC)
447 t.updateWantPeersEvent()
448 t.pendingRequests.Init()
449 t.tryCreateMorePieceHashers()
450 t.iterPeers(func(p *Peer) {
452 p.updateRequests("onSetInfo")
456 // Called when metadata for a torrent becomes available.
457 func (t *Torrent) setInfoBytesLocked(b []byte) error {
458 if metainfo.HashBytes(b) != t.infoHash {
459 return errors.New("info bytes have wrong hash")
461 var info metainfo.Info
462 if err := bencode.Unmarshal(b, &info); err != nil {
463 return fmt.Errorf("error unmarshalling info bytes: %s", err)
466 t.metadataCompletedChunks = nil
470 if err := t.setInfo(&info); err != nil {
477 func (t *Torrent) haveAllMetadataPieces() bool {
481 if t.metadataCompletedChunks == nil {
484 for _, have := range t.metadataCompletedChunks {
492 // TODO: Propagate errors to disconnect peer.
493 func (t *Torrent) setMetadataSize(size int) (err error) {
495 // We already know the correct metadata size.
498 if uint32(size) > maxMetadataSize {
499 return errors.New("bad size")
501 if len(t.metadataBytes) == size {
504 t.metadataBytes = make([]byte, size)
505 t.metadataCompletedChunks = make([]bool, (size+(1<<14)-1)/(1<<14))
506 t.metadataChanged.Broadcast()
507 for c := range t.conns {
508 c.requestPendingMetadata()
513 // The current working name for the torrent. Either the name in the info dict,
514 // or a display name given such as by the dn value in a magnet link, or "".
515 func (t *Torrent) name() string {
517 defer t.nameMu.RUnlock()
521 if t.displayName != "" {
524 return "infohash:" + t.infoHash.HexString()
527 func (t *Torrent) pieceState(index pieceIndex) (ret PieceState) {
528 p := &t.pieces[index]
529 ret.Priority = t.piecePriority(index)
530 ret.Completion = p.completion()
531 ret.QueuedForHash = p.queuedForHash()
532 ret.Hashing = p.hashing
533 ret.Checking = ret.QueuedForHash || ret.Hashing
534 ret.Marking = p.marking
535 if !ret.Complete && t.piecePartiallyDownloaded(index) {
541 func (t *Torrent) metadataPieceSize(piece int) int {
542 return metadataPieceSize(len(t.metadataBytes), piece)
545 func (t *Torrent) newMetadataExtensionMessage(c *PeerConn, msgType pp.ExtendedMetadataRequestMsgType, piece int, data []byte) pp.Message {
548 ExtendedID: c.PeerExtensionIDs[pp.ExtensionNameMetadata],
549 ExtendedPayload: append(bencode.MustMarshal(pp.ExtendedMetadataRequestMsg{
551 TotalSize: len(t.metadataBytes),
557 type pieceAvailabilityRun struct {
562 func (me pieceAvailabilityRun) String() string {
563 return fmt.Sprintf("%v(%v)", me.count, me.availability)
566 func (t *Torrent) pieceAvailabilityRuns() (ret []pieceAvailabilityRun) {
567 rle := missinggo.NewRunLengthEncoder(func(el interface{}, count uint64) {
568 ret = append(ret, pieceAvailabilityRun{availability: el.(int64), count: int(count)})
570 for i := range t.pieces {
571 rle.Append(t.pieces[i].availability, 1)
577 func (t *Torrent) pieceStateRuns() (ret PieceStateRuns) {
578 rle := missinggo.NewRunLengthEncoder(func(el interface{}, count uint64) {
579 ret = append(ret, PieceStateRun{
580 PieceState: el.(PieceState),
584 for index := range t.pieces {
585 rle.Append(t.pieceState(pieceIndex(index)), 1)
591 // Produces a small string representing a PieceStateRun.
592 func (psr PieceStateRun) String() (ret string) {
593 ret = fmt.Sprintf("%d", psr.Length)
594 ret += func() string {
595 switch psr.Priority {
596 case PiecePriorityNext:
598 case PiecePriorityNormal:
600 case PiecePriorityReadahead:
602 case PiecePriorityNow:
604 case PiecePriorityHigh:
613 if psr.QueuedForHash {
631 func (t *Torrent) writeStatus(w io.Writer) {
632 fmt.Fprintf(w, "Infohash: %s\n", t.infoHash.HexString())
633 fmt.Fprintf(w, "Metadata length: %d\n", t.metadataSize())
635 fmt.Fprintf(w, "Metadata have: ")
636 for _, h := range t.metadataCompletedChunks {
637 fmt.Fprintf(w, "%c", func() rune {
647 fmt.Fprintf(w, "Piece length: %s\n",
650 return fmt.Sprintf("%v (%v chunks)",
652 float64(t.usualPieceSize())/float64(t.chunkSize))
659 fmt.Fprintf(w, "Num Pieces: %d (%d completed)\n", t.numPieces(), t.numPiecesCompleted())
660 fmt.Fprintf(w, "Piece States: %s\n", t.pieceStateRuns())
661 fmt.Fprintf(w, "Piece availability: %v\n", strings.Join(func() (ret []string) {
662 for _, run := range t.pieceAvailabilityRuns() {
663 ret = append(ret, run.String())
668 fmt.Fprintf(w, "Reader Pieces:")
669 t.forReaderOffsetPieces(func(begin, end pieceIndex) (again bool) {
670 fmt.Fprintf(w, " %d:%d", begin, end)
675 fmt.Fprintf(w, "Enabled trackers:\n")
677 tw := tabwriter.NewWriter(w, 0, 0, 2, ' ', 0)
678 fmt.Fprintf(tw, " URL\tExtra\n")
679 for _, ta := range slices.Sort(slices.FromMapElems(t.trackerAnnouncers), func(l, r torrentTrackerAnnouncer) bool {
682 var luns, runs url.URL = *lu, *ru
685 var ml missinggo.MultiLess
686 ml.StrictNext(luns.String() == runs.String(), luns.String() < runs.String())
687 ml.StrictNext(lu.String() == ru.String(), lu.String() < ru.String())
689 }).([]torrentTrackerAnnouncer) {
690 fmt.Fprintf(tw, " %q\t%v\n", ta.URL(), ta.statusLine())
695 fmt.Fprintf(w, "DHT Announces: %d\n", t.numDHTAnnounces)
697 spew.NewDefaultConfig()
698 spew.Fdump(w, t.statsLocked())
700 peers := t.peersAsSlice()
701 sort.Slice(peers, func(_i, _j int) bool {
704 if less, ok := multiless.New().EagerSameLess(
705 i.downloadRate() == j.downloadRate(), i.downloadRate() < j.downloadRate(),
709 return worseConn(i, j)
711 for i, c := range peers {
712 fmt.Fprintf(w, "%2d. ", i+1)
717 func (t *Torrent) haveInfo() bool {
721 // Returns a run-time generated MetaInfo that includes the info bytes and
722 // announce-list as currently known to the client.
723 func (t *Torrent) newMetaInfo() metainfo.MetaInfo {
724 return metainfo.MetaInfo{
725 CreationDate: time.Now().Unix(),
726 Comment: "dynamic metainfo from client",
727 CreatedBy: "go.torrent",
728 AnnounceList: t.metainfo.UpvertedAnnounceList().Clone(),
729 InfoBytes: func() []byte {
731 return t.metadataBytes
736 UrlList: func() []string {
737 ret := make([]string, 0, len(t.webSeeds))
738 for url := range t.webSeeds {
739 ret = append(ret, url)
747 func (t *Torrent) BytesMissing() (n int64) {
749 n = t.bytesMissingLocked()
754 func (t *Torrent) bytesMissingLocked() int64 {
758 func iterFlipped(b *roaring.Bitmap, end uint64, cb func(uint32) bool) {
759 roaring.Flip(b, 0, end).Iterate(cb)
762 func (t *Torrent) bytesLeft() (left int64) {
763 iterFlipped(&t._completedPieces, uint64(t.numPieces()), func(x uint32) bool {
764 p := t.piece(pieceIndex(x))
765 left += int64(p.length() - p.numDirtyBytes())
771 // Bytes left to give in tracker announces.
772 func (t *Torrent) bytesLeftAnnounce() int64 {
780 func (t *Torrent) piecePartiallyDownloaded(piece pieceIndex) bool {
781 if t.pieceComplete(piece) {
784 if t.pieceAllDirty(piece) {
787 return t.pieces[piece].hasDirtyChunks()
790 func (t *Torrent) usualPieceSize() int {
791 return int(t.info.PieceLength)
794 func (t *Torrent) numPieces() pieceIndex {
795 return pieceIndex(t.info.NumPieces())
798 func (t *Torrent) numPiecesCompleted() (num pieceIndex) {
799 return pieceIndex(t._completedPieces.GetCardinality())
802 func (t *Torrent) close(wg *sync.WaitGroup) (err error) {
804 if t.storage != nil {
809 defer t.storageLock.Unlock()
810 if f := t.storage.Close; f != nil {
813 t.logger.WithDefaultLevel(log.Warning).Printf("error closing storage: %v", err1)
818 t.iterPeers(func(p *Peer) {
822 t.cl.event.Broadcast()
823 t.pieceStateChanges.Close()
824 t.updateWantPeersEvent()
828 func (t *Torrent) requestOffset(r Request) int64 {
829 return torrentRequestOffset(*t.length, int64(t.usualPieceSize()), r)
832 // Return the request that would include the given offset into the torrent data. Returns !ok if
833 // there is no such request.
834 func (t *Torrent) offsetRequest(off int64) (req Request, ok bool) {
835 return torrentOffsetRequest(*t.length, t.info.PieceLength, int64(t.chunkSize), off)
838 func (t *Torrent) writeChunk(piece int, begin int64, data []byte) (err error) {
839 defer perf.ScopeTimerErr(&err)()
840 n, err := t.pieces[piece].Storage().WriteAt(data, begin)
841 if err == nil && n != len(data) {
842 err = io.ErrShortWrite
847 func (t *Torrent) bitfield() (bf []bool) {
848 bf = make([]bool, t.numPieces())
849 t._completedPieces.Iterate(func(piece uint32) (again bool) {
856 func (t *Torrent) pieceNumChunks(piece pieceIndex) chunkIndexType {
857 return chunkIndexType((t.pieceLength(piece) + t.chunkSize - 1) / t.chunkSize)
860 func (t *Torrent) chunksPerRegularPiece() uint32 {
861 return uint32((pp.Integer(t.usualPieceSize()) + t.chunkSize - 1) / t.chunkSize)
864 func (t *Torrent) pendAllChunkSpecs(pieceIndex pieceIndex) {
865 t.dirtyChunks.RemoveRange(
866 uint64(t.pieceRequestIndexOffset(pieceIndex)),
867 uint64(t.pieceRequestIndexOffset(pieceIndex+1)))
870 func (t *Torrent) pieceLength(piece pieceIndex) pp.Integer {
871 if t.info.PieceLength == 0 {
872 // There will be no variance amongst pieces. Only pain.
875 if piece == t.numPieces()-1 {
876 ret := pp.Integer(*t.length % t.info.PieceLength)
881 return pp.Integer(t.info.PieceLength)
884 func (t *Torrent) hashPiece(piece pieceIndex) (ret metainfo.Hash, err error) {
886 p.waitNoPendingWrites()
887 storagePiece := t.pieces[piece].Storage()
889 //Does the backend want to do its own hashing?
890 if i, ok := storagePiece.PieceImpl.(storage.SelfHashing); ok {
891 var sum metainfo.Hash
892 //log.Printf("A piece decided to self-hash: %d", piece)
893 sum, err = i.SelfHash()
894 missinggo.CopyExact(&ret, sum)
898 hash := pieceHash.New()
899 const logPieceContents = false
900 if logPieceContents {
901 var examineBuf bytes.Buffer
902 _, err = storagePiece.WriteTo(io.MultiWriter(hash, &examineBuf))
903 log.Printf("hashed %q with copy err %v", examineBuf.Bytes(), err)
905 _, err = storagePiece.WriteTo(hash)
907 missinggo.CopyExact(&ret, hash.Sum(nil))
911 func (t *Torrent) haveAnyPieces() bool {
912 return t._completedPieces.GetCardinality() != 0
915 func (t *Torrent) haveAllPieces() bool {
919 return t._completedPieces.GetCardinality() == bitmap.BitRange(t.numPieces())
922 func (t *Torrent) havePiece(index pieceIndex) bool {
923 return t.haveInfo() && t.pieceComplete(index)
926 func (t *Torrent) maybeDropMutuallyCompletePeer(
927 // I'm not sure about taking peer here, not all peer implementations actually drop. Maybe that's
931 if !t.cl.config.DropMutuallyCompletePeers {
934 if !t.haveAllPieces() {
937 if all, known := p.peerHasAllPieces(); !(known && all) {
943 t.logger.WithDefaultLevel(log.Debug).Printf("dropping %v, which is mutually complete", p)
947 func (t *Torrent) haveChunk(r Request) (ret bool) {
949 // log.Println("have chunk", r, ret)
954 if t.pieceComplete(pieceIndex(r.Index)) {
957 p := &t.pieces[r.Index]
958 return !p.pendingChunk(r.ChunkSpec, t.chunkSize)
961 func chunkIndexFromChunkSpec(cs ChunkSpec, chunkSize pp.Integer) chunkIndexType {
962 return chunkIndexType(cs.Begin / chunkSize)
965 func (t *Torrent) wantPieceIndex(index pieceIndex) bool {
966 // TODO: Are these overly conservative, should we be guarding this here?
971 if index < 0 || index >= t.numPieces() {
975 p := &t.pieces[index]
976 if p.queuedForHash() {
982 if t.pieceComplete(index) {
985 if t._pendingPieces.Contains(int(index)) {
988 // t.logger.Printf("piece %d not pending", index)
989 return !t.forReaderOffsetPieces(func(begin, end pieceIndex) bool {
990 return index < begin || index >= end
994 // A pool of []*PeerConn, to reduce allocations in functions that need to index or sort Torrent
995 // conns (which is a map).
996 var peerConnSlices sync.Pool
998 // The worst connection is one that hasn't been sent, or sent anything useful for the longest. A bad
999 // connection is one that usually sends us unwanted pieces, or has been in the worse half of the
1000 // established connections for more than a minute. This is O(n log n). If there was a way to not
1001 // consider the position of a conn relative to the total number, it could be reduced to O(n).
1002 func (t *Torrent) worstBadConn() (ret *PeerConn) {
1004 getInterface := peerConnSlices.Get()
1005 if getInterface == nil {
1006 sl = make([]*PeerConn, 0, len(t.conns))
1008 sl = getInterface.([]*PeerConn)[:0]
1010 sl = t.appendUnclosedConns(sl)
1011 defer peerConnSlices.Put(sl)
1012 wcs := worseConnSlice{sl}
1014 for wcs.Len() != 0 {
1015 c := heap.Pop(&wcs).(*PeerConn)
1016 if c._stats.ChunksReadWasted.Int64() >= 6 && c._stats.ChunksReadWasted.Int64() > c._stats.ChunksReadUseful.Int64() {
1019 // If the connection is in the worst half of the established
1020 // connection quota and is older than a minute.
1021 if wcs.Len() >= (t.maxEstablishedConns+1)/2 {
1022 // Give connections 1 minute to prove themselves.
1023 if time.Since(c.completedHandshake) > time.Minute {
1031 type PieceStateChange struct {
1036 func (t *Torrent) publishPieceChange(piece pieceIndex) {
1037 t.cl._mu.Defer(func() {
1038 cur := t.pieceState(piece)
1039 p := &t.pieces[piece]
1040 if cur != p.publicPieceState {
1041 p.publicPieceState = cur
1042 t.pieceStateChanges.Publish(PieceStateChange{
1050 func (t *Torrent) pieceNumPendingChunks(piece pieceIndex) pp.Integer {
1051 if t.pieceComplete(piece) {
1054 return pp.Integer(t.pieceNumChunks(piece) - t.pieces[piece].numDirtyChunks())
1057 func (t *Torrent) pieceAllDirty(piece pieceIndex) bool {
1058 return t.pieces[piece].allChunksDirty()
1061 func (t *Torrent) readersChanged() {
1062 t.updateReaderPieces()
1063 t.updateAllPiecePriorities("Torrent.readersChanged")
1066 func (t *Torrent) updateReaderPieces() {
1067 t._readerNowPieces, t._readerReadaheadPieces = t.readerPiecePriorities()
1070 func (t *Torrent) readerPosChanged(from, to pieceRange) {
1074 t.updateReaderPieces()
1075 // Order the ranges, high and low.
1077 if l.begin > h.begin {
1080 if l.end < h.begin {
1081 // Two distinct ranges.
1082 t.updatePiecePriorities(l.begin, l.end, "Torrent.readerPosChanged")
1083 t.updatePiecePriorities(h.begin, h.end, "Torrent.readerPosChanged")
1090 t.updatePiecePriorities(l.begin, end, "Torrent.readerPosChanged")
1094 func (t *Torrent) maybeNewConns() {
1095 // Tickle the accept routine.
1096 t.cl.event.Broadcast()
1100 func (t *Torrent) piecePriorityChanged(piece pieceIndex, reason string) {
1101 if t._pendingPieces.Contains(piece) {
1102 t.iterPeers(func(c *Peer) {
1103 c.updateRequests(reason)
1107 t.publishPieceChange(piece)
1110 func (t *Torrent) updatePiecePriority(piece pieceIndex, reason string) {
1111 p := &t.pieces[piece]
1112 newPrio := p.uncachedPriority()
1113 // t.logger.Printf("torrent %p: piece %d: uncached priority: %v", t, piece, newPrio)
1114 if newPrio == PiecePriorityNone {
1115 if !t._pendingPieces.Remove(int(piece)) {
1119 if !t._pendingPieces.Set(int(piece), newPrio.BitmapPriority()) {
1123 t.piecePriorityChanged(piece, reason)
1126 func (t *Torrent) updateAllPiecePriorities(reason string) {
1127 t.updatePiecePriorities(0, t.numPieces(), reason)
1130 // Update all piece priorities in one hit. This function should have the same
1131 // output as updatePiecePriority, but across all pieces.
1132 func (t *Torrent) updatePiecePriorities(begin, end pieceIndex, reason string) {
1133 for i := begin; i < end; i++ {
1134 t.updatePiecePriority(i, reason)
1138 // Returns the range of pieces [begin, end) that contains the extent of bytes.
1139 func (t *Torrent) byteRegionPieces(off, size int64) (begin, end pieceIndex) {
1140 if off >= *t.length {
1150 begin = pieceIndex(off / t.info.PieceLength)
1151 end = pieceIndex((off + size + t.info.PieceLength - 1) / t.info.PieceLength)
1152 if end > pieceIndex(t.info.NumPieces()) {
1153 end = pieceIndex(t.info.NumPieces())
1158 // Returns true if all iterations complete without breaking. Returns the read regions for all
1159 // readers. The reader regions should not be merged as some callers depend on this method to
1160 // enumerate readers.
1161 func (t *Torrent) forReaderOffsetPieces(f func(begin, end pieceIndex) (more bool)) (all bool) {
1162 for r := range t.readers {
1164 if p.begin >= p.end {
1167 if !f(p.begin, p.end) {
1174 func (t *Torrent) piecePriority(piece pieceIndex) piecePriority {
1175 prio, ok := t._pendingPieces.GetPriority(piece)
1177 return PiecePriorityNone
1182 ret := piecePriority(-prio)
1183 if ret == PiecePriorityNone {
1189 func (t *Torrent) pendRequest(req RequestIndex) {
1190 t.piece(int(req / t.chunksPerRegularPiece())).pendChunkIndex(req % t.chunksPerRegularPiece())
1193 func (t *Torrent) pieceCompletionChanged(piece pieceIndex, reason string) {
1194 t.cl.event.Broadcast()
1195 if t.pieceComplete(piece) {
1196 t.onPieceCompleted(piece)
1198 t.onIncompletePiece(piece)
1200 t.updatePiecePriority(piece, reason)
1203 func (t *Torrent) numReceivedConns() (ret int) {
1204 for c := range t.conns {
1205 if c.Discovery == PeerSourceIncoming {
1212 func (t *Torrent) maxHalfOpen() int {
1213 // Note that if we somehow exceed the maximum established conns, we want
1214 // the negative value to have an effect.
1215 establishedHeadroom := int64(t.maxEstablishedConns - len(t.conns))
1216 extraIncoming := int64(t.numReceivedConns() - t.maxEstablishedConns/2)
1217 // We want to allow some experimentation with new peers, and to try to
1218 // upset an oversupply of received connections.
1219 return int(min(max(5, extraIncoming)+establishedHeadroom, int64(t.cl.config.HalfOpenConnsPerTorrent)))
1222 func (t *Torrent) openNewConns() (initiated int) {
1223 defer t.updateWantPeersEvent()
1224 for t.peers.Len() != 0 {
1228 if len(t.halfOpen) >= t.maxHalfOpen() {
1231 if len(t.cl.dialers) == 0 {
1234 if t.cl.numHalfOpen >= t.cl.config.TotalHalfOpenConns {
1237 p := t.peers.PopMax()
1244 func (t *Torrent) getConnPieceInclination() []int {
1245 _ret := t.connPieceInclinationPool.Get()
1247 pieceInclinationsNew.Add(1)
1248 return rand.Perm(int(t.numPieces()))
1250 pieceInclinationsReused.Add(1)
1251 return *_ret.(*[]int)
1254 func (t *Torrent) putPieceInclination(pi []int) {
1255 t.connPieceInclinationPool.Put(&pi)
1256 pieceInclinationsPut.Add(1)
1259 func (t *Torrent) updatePieceCompletion(piece pieceIndex) bool {
1261 uncached := t.pieceCompleteUncached(piece)
1262 cached := p.completion()
1263 changed := cached != uncached
1264 complete := uncached.Complete
1265 p.storageCompletionOk = uncached.Ok
1268 t._completedPieces.Add(x)
1270 t._completedPieces.Remove(x)
1273 if complete && len(p.dirtiers) != 0 {
1274 t.logger.Printf("marked piece %v complete but still has dirtiers", piece)
1277 log.Fstr("piece %d completion changed: %+v -> %+v", piece, cached, uncached).SetLevel(log.Debug).Log(t.logger)
1278 t.pieceCompletionChanged(piece, "Torrent.updatePieceCompletion")
1283 // Non-blocking read. Client lock is not required.
1284 func (t *Torrent) readAt(b []byte, off int64) (n int, err error) {
1286 p := &t.pieces[off/t.info.PieceLength]
1287 p.waitNoPendingWrites()
1289 n1, err = p.Storage().ReadAt(b, off-p.Info().Offset())
1300 // Returns an error if the metadata was completed, but couldn't be set for some reason. Blame it on
1301 // the last peer to contribute. TODO: Actually we shouldn't blame peers for failure to open storage
1302 // etc. Also we should probably cached metadata pieces per-Peer, to isolate failure appropriately.
1303 func (t *Torrent) maybeCompleteMetadata() error {
1308 if !t.haveAllMetadataPieces() {
1309 // Don't have enough metadata pieces.
1312 err := t.setInfoBytesLocked(t.metadataBytes)
1314 t.invalidateMetadata()
1315 return fmt.Errorf("error setting info bytes: %s", err)
1317 if t.cl.config.Debug {
1318 t.logger.Printf("%s: got metadata from peers", t)
1323 func (t *Torrent) readerPiecePriorities() (now, readahead bitmap.Bitmap) {
1324 t.forReaderOffsetPieces(func(begin, end pieceIndex) bool {
1326 now.Add(bitmap.BitIndex(begin))
1327 readahead.AddRange(bitmap.BitRange(begin)+1, bitmap.BitRange(end))
1334 func (t *Torrent) needData() bool {
1335 if t.closed.IsSet() {
1341 return t._pendingPieces.Len() != 0
1344 func appendMissingStrings(old, new []string) (ret []string) {
1347 for _, n := range new {
1348 for _, o := range old {
1353 ret = append(ret, n)
1358 func appendMissingTrackerTiers(existing [][]string, minNumTiers int) (ret [][]string) {
1360 for minNumTiers > len(ret) {
1361 ret = append(ret, nil)
1366 func (t *Torrent) addTrackers(announceList [][]string) {
1367 fullAnnounceList := &t.metainfo.AnnounceList
1368 t.metainfo.AnnounceList = appendMissingTrackerTiers(*fullAnnounceList, len(announceList))
1369 for tierIndex, trackerURLs := range announceList {
1370 (*fullAnnounceList)[tierIndex] = appendMissingStrings((*fullAnnounceList)[tierIndex], trackerURLs)
1372 t.startMissingTrackerScrapers()
1373 t.updateWantPeersEvent()
1376 // Don't call this before the info is available.
1377 func (t *Torrent) bytesCompleted() int64 {
1381 return *t.length - t.bytesLeft()
1384 func (t *Torrent) SetInfoBytes(b []byte) (err error) {
1387 return t.setInfoBytesLocked(b)
1390 // Returns true if connection is removed from torrent.Conns.
1391 func (t *Torrent) deletePeerConn(c *PeerConn) (ret bool) {
1392 if !c.closed.IsSet() {
1393 panic("connection is not closed")
1394 // There are behaviours prevented by the closed state that will fail
1395 // if the connection has been deleted.
1399 // Avoid adding a drop event more than once. Probably we should track whether we've generated
1400 // the drop event against the PexConnState instead.
1402 if !t.cl.config.DisablePEX {
1406 torrent.Add("deleted connections", 1)
1407 c.deleteAllRequests()
1408 if t.numActivePeers() == 0 {
1409 t.assertNoPendingRequests()
1414 func (t *Torrent) decPeerPieceAvailability(p *Peer) {
1418 p.newPeerPieces().Iterate(func(i uint32) bool {
1419 p.t.decPieceAvailability(pieceIndex(i))
1424 func (t *Torrent) numActivePeers() (num int) {
1425 t.iterPeers(func(*Peer) {
1431 func (t *Torrent) assertNoPendingRequests() {
1432 t.pendingRequests.AssertEmpty()
1435 func (t *Torrent) dropConnection(c *PeerConn) {
1436 t.cl.event.Broadcast()
1438 if t.deletePeerConn(c) {
1443 func (t *Torrent) wantPeers() bool {
1444 if t.closed.IsSet() {
1447 if t.peers.Len() > t.cl.config.TorrentPeersLowWater {
1450 return t.needData() || t.seeding()
1453 func (t *Torrent) updateWantPeersEvent() {
1455 t.wantPeersEvent.Set()
1457 t.wantPeersEvent.Clear()
1461 // Returns whether the client should make effort to seed the torrent.
1462 func (t *Torrent) seeding() bool {
1464 if t.closed.IsSet() {
1467 if t.dataUploadDisallowed {
1470 if cl.config.NoUpload {
1473 if !cl.config.Seed {
1476 if cl.config.DisableAggressiveUpload && t.needData() {
1482 func (t *Torrent) onWebRtcConn(
1483 c datachannel.ReadWriteCloser,
1484 dcc webtorrent.DataChannelContext,
1487 pc, err := t.cl.initiateProtocolHandshakes(
1488 context.Background(),
1489 webrtcNetConn{c, dcc},
1493 webrtcNetAddr{dcc.Remote},
1495 fmt.Sprintf("webrtc offer_id %x", dcc.OfferId),
1498 t.logger.WithDefaultLevel(log.Error).Printf("error in handshaking webrtc connection: %v", err)
1501 if dcc.LocalOffered {
1502 pc.Discovery = PeerSourceTracker
1504 pc.Discovery = PeerSourceIncoming
1508 err = t.cl.runHandshookConn(pc, t)
1510 t.logger.WithDefaultLevel(log.Critical).Printf("error running handshook webrtc conn: %v", err)
1514 func (t *Torrent) logRunHandshookConn(pc *PeerConn, logAll bool, level log.Level) {
1515 err := t.cl.runHandshookConn(pc, t)
1516 if err != nil || logAll {
1517 t.logger.WithDefaultLevel(level).Printf("error running handshook conn: %v", err)
1521 func (t *Torrent) runHandshookConnLoggingErr(pc *PeerConn) {
1522 t.logRunHandshookConn(pc, false, log.Warning)
1525 func (t *Torrent) startWebsocketAnnouncer(u url.URL) torrentTrackerAnnouncer {
1526 wtc, release := t.cl.websocketTrackers.Get(u.String())
1531 wst := websocketTrackerStatus{u, wtc}
1533 err := wtc.Announce(tracker.Started, t.infoHash)
1535 t.logger.WithDefaultLevel(log.Warning).Printf(
1536 "error in initial announce to %q: %v",
1545 func (t *Torrent) startScrapingTracker(_url string) {
1549 u, err := url.Parse(_url)
1551 // URLs with a leading '*' appear to be a uTorrent convention to
1552 // disable trackers.
1554 log.Str("error parsing tracker url").AddValues("url", _url).Log(t.logger)
1558 if u.Scheme == "udp" {
1560 t.startScrapingTracker(u.String())
1562 t.startScrapingTracker(u.String())
1565 if _, ok := t.trackerAnnouncers[_url]; ok {
1568 sl := func() torrentTrackerAnnouncer {
1571 if t.cl.config.DisableWebtorrent {
1574 return t.startWebsocketAnnouncer(*u)
1576 if t.cl.config.DisableIPv4Peers || t.cl.config.DisableIPv4 {
1580 if t.cl.config.DisableIPv6 {
1584 newAnnouncer := &trackerScraper{
1588 go newAnnouncer.Run()
1594 if t.trackerAnnouncers == nil {
1595 t.trackerAnnouncers = make(map[string]torrentTrackerAnnouncer)
1597 t.trackerAnnouncers[_url] = sl
1600 // Adds and starts tracker scrapers for tracker URLs that aren't already
1602 func (t *Torrent) startMissingTrackerScrapers() {
1603 if t.cl.config.DisableTrackers {
1606 t.startScrapingTracker(t.metainfo.Announce)
1607 for _, tier := range t.metainfo.AnnounceList {
1608 for _, url := range tier {
1609 t.startScrapingTracker(url)
1614 // Returns an AnnounceRequest with fields filled out to defaults and current
1616 func (t *Torrent) announceRequest(event tracker.AnnounceEvent) tracker.AnnounceRequest {
1617 // Note that IPAddress is not set. It's set for UDP inside the tracker code, since it's
1618 // dependent on the network in use.
1619 return tracker.AnnounceRequest{
1621 NumWant: func() int32 {
1622 if t.wantPeers() && len(t.cl.dialers) > 0 {
1628 Port: uint16(t.cl.incomingPeerPort()),
1629 PeerId: t.cl.peerID,
1630 InfoHash: t.infoHash,
1631 Key: t.cl.announceKey(),
1633 // The following are vaguely described in BEP 3.
1635 Left: t.bytesLeftAnnounce(),
1636 Uploaded: t.stats.BytesWrittenData.Int64(),
1637 // There's no mention of wasted or unwanted download in the BEP.
1638 Downloaded: t.stats.BytesReadUsefulData.Int64(),
1642 // Adds peers revealed in an announce until the announce ends, or we have
1644 func (t *Torrent) consumeDhtAnnouncePeers(pvs <-chan dht.PeersValues) {
1646 for v := range pvs {
1649 for _, cp := range v.Peers {
1651 // Can't do anything with this.
1654 if t.addPeer(PeerInfo{
1655 Addr: ipPortAddr{cp.IP, cp.Port},
1656 Source: PeerSourceDhtGetPeers,
1663 // log.Printf("added %v peers from dht for %v", added, t.InfoHash().HexString())
1668 // Announce using the provided DHT server. Peers are consumed automatically. done is closed when the
1669 // announce ends. stop will force the announce to end.
1670 func (t *Torrent) AnnounceToDht(s DhtServer) (done <-chan struct{}, stop func(), err error) {
1671 ps, err := s.Announce(t.infoHash, t.cl.incomingPeerPort(), true)
1675 _done := make(chan struct{})
1679 t.consumeDhtAnnouncePeers(ps.Peers())
1685 func (t *Torrent) timeboxedAnnounceToDht(s DhtServer) error {
1686 _, stop, err := t.AnnounceToDht(s)
1691 case <-t.closed.Done():
1692 case <-time.After(5 * time.Minute):
1698 func (t *Torrent) dhtAnnouncer(s DhtServer) {
1704 if t.closed.IsSet() {
1710 // TODO: Determine if there's a listener on the port we're announcing.
1711 if len(cl.dialers) == 0 && len(cl.listeners) == 0 {
1722 err := t.timeboxedAnnounceToDht(s)
1724 t.logger.WithDefaultLevel(log.Warning).Printf("error announcing %q to DHT: %s", t, err)
1730 func (t *Torrent) addPeers(peers []PeerInfo) (added int) {
1731 for _, p := range peers {
1739 // The returned TorrentStats may require alignment in memory. See
1740 // https://github.com/anacrolix/torrent/issues/383.
1741 func (t *Torrent) Stats() TorrentStats {
1743 defer t.cl.rUnlock()
1744 return t.statsLocked()
1747 func (t *Torrent) statsLocked() (ret TorrentStats) {
1748 ret.ActivePeers = len(t.conns)
1749 ret.HalfOpenPeers = len(t.halfOpen)
1750 ret.PendingPeers = t.peers.Len()
1751 ret.TotalPeers = t.numTotalPeers()
1752 ret.ConnectedSeeders = 0
1753 for c := range t.conns {
1754 if all, ok := c.peerHasAllPieces(); all && ok {
1755 ret.ConnectedSeeders++
1758 ret.ConnStats = t.stats.Copy()
1759 ret.PiecesComplete = t.numPiecesCompleted()
1763 // The total number of peers in the torrent.
1764 func (t *Torrent) numTotalPeers() int {
1765 peers := make(map[string]struct{})
1766 for conn := range t.conns {
1767 ra := conn.conn.RemoteAddr()
1769 // It's been closed and doesn't support RemoteAddr.
1772 peers[ra.String()] = struct{}{}
1774 for addr := range t.halfOpen {
1775 peers[addr] = struct{}{}
1777 t.peers.Each(func(peer PeerInfo) {
1778 peers[peer.Addr.String()] = struct{}{}
1783 // Reconcile bytes transferred before connection was associated with a
1785 func (t *Torrent) reconcileHandshakeStats(c *PeerConn) {
1786 if c._stats != (ConnStats{
1787 // Handshakes should only increment these fields:
1788 BytesWritten: c._stats.BytesWritten,
1789 BytesRead: c._stats.BytesRead,
1793 c.postHandshakeStats(func(cs *ConnStats) {
1794 cs.BytesRead.Add(c._stats.BytesRead.Int64())
1795 cs.BytesWritten.Add(c._stats.BytesWritten.Int64())
1797 c.reconciledHandshakeStats = true
1800 // Returns true if the connection is added.
1801 func (t *Torrent) addPeerConn(c *PeerConn) (err error) {
1804 torrent.Add("added connections", 1)
1807 if t.closed.IsSet() {
1808 return errors.New("torrent closed")
1810 for c0 := range t.conns {
1811 if c.PeerID != c0.PeerID {
1814 if !t.cl.config.DropDuplicatePeerIds {
1817 if left, ok := c.hasPreferredNetworkOver(c0); ok && left {
1819 t.deletePeerConn(c0)
1821 return errors.New("existing connection preferred")
1824 if len(t.conns) >= t.maxEstablishedConns {
1825 c := t.worstBadConn()
1827 return errors.New("don't want conns")
1832 if len(t.conns) >= t.maxEstablishedConns {
1835 t.conns[c] = struct{}{}
1836 if !t.cl.config.DisablePEX && !c.PeerExtensionBytes.SupportsExtended() {
1837 t.pex.Add(c) // as no further extended handshake expected
1842 func (t *Torrent) wantConns() bool {
1843 if !t.networkingEnabled.Bool() {
1846 if t.closed.IsSet() {
1849 if !t.seeding() && !t.needData() {
1852 if len(t.conns) < t.maxEstablishedConns {
1855 return t.worstBadConn() != nil
1858 func (t *Torrent) SetMaxEstablishedConns(max int) (oldMax int) {
1861 oldMax = t.maxEstablishedConns
1862 t.maxEstablishedConns = max
1863 wcs := slices.HeapInterface(slices.FromMapKeys(t.conns), func(l, r *PeerConn) bool {
1864 return worseConn(&l.Peer, &r.Peer)
1866 for len(t.conns) > t.maxEstablishedConns && wcs.Len() > 0 {
1867 t.dropConnection(wcs.Pop().(*PeerConn))
1873 func (t *Torrent) pieceHashed(piece pieceIndex, passed bool, hashIoErr error) {
1874 t.logger.Log(log.Fstr("hashed piece %d (passed=%t)", piece, passed).SetLevel(log.Debug))
1877 t.cl.event.Broadcast()
1878 if t.closed.IsSet() {
1882 // Don't score the first time a piece is hashed, it could be an initial check.
1883 if p.storageCompletionOk {
1885 pieceHashedCorrect.Add(1)
1888 "piece %d failed hash: %d connections contributed", piece, len(p.dirtiers),
1889 ).AddValues(t, p).SetLevel(log.Debug).Log(t.logger)
1890 pieceHashedNotCorrect.Add(1)
1895 t.publishPieceChange(piece)
1898 t.publishPieceChange(piece)
1902 if len(p.dirtiers) != 0 {
1903 // Don't increment stats above connection-level for every involved connection.
1904 t.allStats((*ConnStats).incrementPiecesDirtiedGood)
1906 for c := range p.dirtiers {
1907 c._stats.incrementPiecesDirtiedGood()
1909 t.clearPieceTouchers(piece)
1911 err := p.Storage().MarkComplete()
1913 t.logger.Printf("%T: error marking piece complete %d: %s", t.storage, piece, err)
1917 if t.closed.IsSet() {
1920 t.pendAllChunkSpecs(piece)
1922 if len(p.dirtiers) != 0 && p.allChunksDirty() && hashIoErr == nil {
1923 // Peers contributed to all the data for this piece hash failure, and the failure was
1924 // not due to errors in the storage (such as data being dropped in a cache).
1926 // Increment Torrent and above stats, and then specific connections.
1927 t.allStats((*ConnStats).incrementPiecesDirtiedBad)
1928 for c := range p.dirtiers {
1929 // Y u do dis peer?!
1930 c.stats().incrementPiecesDirtiedBad()
1933 bannableTouchers := make([]*Peer, 0, len(p.dirtiers))
1934 for c := range p.dirtiers {
1936 bannableTouchers = append(bannableTouchers, c)
1939 t.clearPieceTouchers(piece)
1940 slices.Sort(bannableTouchers, connLessTrusted)
1942 if t.cl.config.Debug {
1944 "bannable conns by trust for piece %d: %v",
1946 func() (ret []connectionTrust) {
1947 for _, c := range bannableTouchers {
1948 ret = append(ret, c.trust())
1955 if len(bannableTouchers) >= 1 {
1956 c := bannableTouchers[0]
1957 t.cl.banPeerIP(c.remoteIp())
1961 t.onIncompletePiece(piece)
1962 p.Storage().MarkNotComplete()
1964 t.updatePieceCompletion(piece)
1967 func (t *Torrent) cancelRequestsForPiece(piece pieceIndex) {
1968 // TODO: Make faster
1969 for cn := range t.conns {
1974 func (t *Torrent) onPieceCompleted(piece pieceIndex) {
1975 t.pendAllChunkSpecs(piece)
1976 t.cancelRequestsForPiece(piece)
1977 t.piece(piece).readerCond.Broadcast()
1978 for conn := range t.conns {
1980 t.maybeDropMutuallyCompletePeer(&conn.Peer)
1984 // Called when a piece is found to be not complete.
1985 func (t *Torrent) onIncompletePiece(piece pieceIndex) {
1986 if t.pieceAllDirty(piece) {
1987 t.pendAllChunkSpecs(piece)
1989 if !t.wantPieceIndex(piece) {
1990 // t.logger.Printf("piece %d incomplete and unwanted", piece)
1993 // We could drop any connections that we told we have a piece that we
1994 // don't here. But there's a test failure, and it seems clients don't care
1995 // if you request pieces that you already claim to have. Pruning bad
1996 // connections might just remove any connections that aren't treating us
1997 // favourably anyway.
1999 // for c := range t.conns {
2000 // if c.sentHave(piece) {
2004 t.iterPeers(func(conn *Peer) {
2005 if conn.peerHasPiece(piece) {
2006 conn.updateRequests("piece incomplete")
2011 func (t *Torrent) tryCreateMorePieceHashers() {
2012 for !t.closed.IsSet() && t.activePieceHashes < 2 && t.tryCreatePieceHasher() {
2016 func (t *Torrent) tryCreatePieceHasher() bool {
2017 if t.storage == nil {
2020 pi, ok := t.getPieceToHash()
2025 t.piecesQueuedForHash.Remove(bitmap.BitIndex(pi))
2027 t.publishPieceChange(pi)
2028 t.updatePiecePriority(pi, "Torrent.tryCreatePieceHasher")
2029 t.storageLock.RLock()
2030 t.activePieceHashes++
2031 go t.pieceHasher(pi)
2035 func (t *Torrent) getPieceToHash() (ret pieceIndex, ok bool) {
2036 t.piecesQueuedForHash.IterTyped(func(i pieceIndex) bool {
2037 if t.piece(i).hashing {
2047 func (t *Torrent) pieceHasher(index pieceIndex) {
2049 sum, copyErr := t.hashPiece(index)
2050 correct := sum == *p.hash
2054 log.Fmsg("piece %v (%s) hash failure copy error: %v", p, p.hash.HexString(), copyErr).Log(t.logger)
2056 t.storageLock.RUnlock()
2060 t.pieceHashed(index, correct, copyErr)
2061 t.updatePiecePriority(index, "Torrent.pieceHasher")
2062 t.activePieceHashes--
2063 t.tryCreateMorePieceHashers()
2066 // Return the connections that touched a piece, and clear the entries while doing it.
2067 func (t *Torrent) clearPieceTouchers(pi pieceIndex) {
2069 for c := range p.dirtiers {
2070 delete(c.peerTouchedPieces, pi)
2071 delete(p.dirtiers, c)
2075 func (t *Torrent) peersAsSlice() (ret []*Peer) {
2076 t.iterPeers(func(p *Peer) {
2077 ret = append(ret, p)
2082 func (t *Torrent) queuePieceCheck(pieceIndex pieceIndex) {
2083 piece := t.piece(pieceIndex)
2084 if piece.queuedForHash() {
2087 t.piecesQueuedForHash.Add(bitmap.BitIndex(pieceIndex))
2088 t.publishPieceChange(pieceIndex)
2089 t.updatePiecePriority(pieceIndex, "Torrent.queuePieceCheck")
2090 t.tryCreateMorePieceHashers()
2093 // Forces all the pieces to be re-hashed. See also Piece.VerifyData. This should not be called
2094 // before the Info is available.
2095 func (t *Torrent) VerifyData() {
2096 for i := pieceIndex(0); i < t.NumPieces(); i++ {
2097 t.Piece(i).VerifyData()
2101 // Start the process of connecting to the given peer for the given torrent if appropriate.
2102 func (t *Torrent) initiateConn(peer PeerInfo) {
2103 if peer.Id == t.cl.peerID {
2106 if t.cl.badPeerAddr(peer.Addr) && !peer.Trusted {
2110 if t.addrActive(addr.String()) {
2114 t.halfOpen[addr.String()] = peer
2115 go t.cl.outgoingConnection(t, addr, peer.Source, peer.Trusted)
2118 // Adds a trusted, pending peer for each of the given Client's addresses. Typically used in tests to
2119 // quickly make one Client visible to the Torrent of another Client.
2120 func (t *Torrent) AddClientPeer(cl *Client) int {
2121 return t.AddPeers(func() (ps []PeerInfo) {
2122 for _, la := range cl.ListenAddrs() {
2123 ps = append(ps, PeerInfo{
2132 // All stats that include this Torrent. Useful when we want to increment ConnStats but not for every
2134 func (t *Torrent) allStats(f func(*ConnStats)) {
2139 func (t *Torrent) hashingPiece(i pieceIndex) bool {
2140 return t.pieces[i].hashing
2143 func (t *Torrent) pieceQueuedForHash(i pieceIndex) bool {
2144 return t.piecesQueuedForHash.Get(bitmap.BitIndex(i))
2147 func (t *Torrent) dialTimeout() time.Duration {
2148 return reducedDialTimeout(t.cl.config.MinDialTimeout, t.cl.config.NominalDialTimeout, t.cl.config.HalfOpenConnsPerTorrent, t.peers.Len())
2151 func (t *Torrent) piece(i int) *Piece {
2155 func (t *Torrent) onWriteChunkErr(err error) {
2156 if t.userOnWriteChunkErr != nil {
2157 go t.userOnWriteChunkErr(err)
2160 t.logger.WithDefaultLevel(log.Critical).Printf("default chunk write error handler: disabling data download")
2161 t.disallowDataDownloadLocked()
2164 func (t *Torrent) DisallowDataDownload() {
2165 t.disallowDataDownloadLocked()
2168 func (t *Torrent) disallowDataDownloadLocked() {
2169 t.dataDownloadDisallowed.Set()
2172 func (t *Torrent) AllowDataDownload() {
2173 t.dataDownloadDisallowed.Clear()
2176 // Enables uploading data, if it was disabled.
2177 func (t *Torrent) AllowDataUpload() {
2180 t.dataUploadDisallowed = false
2181 for c := range t.conns {
2182 c.updateRequests("allow data upload")
2186 // Disables uploading data, if it was enabled.
2187 func (t *Torrent) DisallowDataUpload() {
2190 t.dataUploadDisallowed = true
2191 for c := range t.conns {
2192 c.updateRequests("disallow data upload")
2196 // Sets a handler that is called if there's an error writing a chunk to local storage. By default,
2197 // or if nil, a critical message is logged, and data download is disabled.
2198 func (t *Torrent) SetOnWriteChunkError(f func(error)) {
2201 t.userOnWriteChunkErr = f
2204 func (t *Torrent) iterPeers(f func(p *Peer)) {
2205 for pc := range t.conns {
2208 for _, ws := range t.webSeeds {
2213 func (t *Torrent) callbacks() *Callbacks {
2214 return &t.cl.config.Callbacks
2217 var WebseedHttpClient = &http.Client{
2218 Transport: &http.Transport{
2219 MaxConnsPerHost: 10,
2223 func (t *Torrent) addWebSeed(url string) {
2224 if t.cl.config.DisableWebseeds {
2227 if _, ok := t.webSeeds[url]; ok {
2230 const maxRequests = 10
2236 reconciledHandshakeStats: true,
2237 // TODO: Raise this limit, and instead limit concurrent fetches.
2238 PeerMaxRequests: 32,
2239 RemoteAddr: remoteAddrFromUrl(url),
2240 callbacks: t.callbacks(),
2242 client: webseed.Client{
2243 // Consider a MaxConnsPerHost in the transport for this, possibly in a global Client.
2244 HttpClient: WebseedHttpClient,
2247 activeRequests: make(map[Request]webseed.Request, maxRequests),
2249 ws.requesterCond.L = t.cl.locker()
2250 for i := 0; i < maxRequests; i += 1 {
2253 for _, f := range t.callbacks().NewPeer {
2256 ws.peer.logger = t.logger.WithContextValue(&ws)
2257 ws.peer.peerImpl = &ws
2259 ws.onGotInfo(t.info)
2261 t.webSeeds[url] = &ws.peer
2262 ws.peer.onPeerHasAllPieces()
2265 func (t *Torrent) peerIsActive(p *Peer) (active bool) {
2266 t.iterPeers(func(p1 *Peer) {
2274 func (t *Torrent) requestIndexToRequest(ri RequestIndex) Request {
2275 index := ri / t.chunksPerRegularPiece()
2278 t.piece(int(index)).chunkIndexSpec(ri % t.chunksPerRegularPiece()),
2282 func (t *Torrent) requestIndexFromRequest(r Request) RequestIndex {
2283 return t.pieceRequestIndexOffset(pieceIndex(r.Index)) + uint32(r.Begin/t.chunkSize)
2286 func (t *Torrent) numChunks() RequestIndex {
2287 return RequestIndex((t.Length() + int64(t.chunkSize) - 1) / int64(t.chunkSize))
2290 func (t *Torrent) pieceRequestIndexOffset(piece pieceIndex) RequestIndex {
2291 return RequestIndex(piece) * t.chunksPerRegularPiece()
2294 func (t *Torrent) updateComplete() {
2295 t.Complete.SetBool(t.haveAllPieces())