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/multiless"
31 "github.com/anacrolix/sync"
32 "github.com/davecgh/go-spew/spew"
33 "github.com/pion/datachannel"
35 "github.com/anacrolix/torrent/bencode"
36 "github.com/anacrolix/torrent/common"
37 "github.com/anacrolix/torrent/metainfo"
38 pp "github.com/anacrolix/torrent/peer_protocol"
39 "github.com/anacrolix/torrent/segments"
40 "github.com/anacrolix/torrent/storage"
41 "github.com/anacrolix/torrent/tracker"
42 "github.com/anacrolix/torrent/webseed"
43 "github.com/anacrolix/torrent/webtorrent"
46 // Maintains state of torrent within a Client. Many methods should not be called before the info is
47 // available, see .Info and .GotInfo.
49 // Torrent-level aggregate statistics. First in struct to ensure 64-bit
50 // alignment. See #262.
55 networkingEnabled chansync.Flag
56 dataDownloadDisallowed chansync.Flag
57 dataUploadDisallowed bool
58 userOnWriteChunkErr func(error)
60 closed chansync.SetOnce
61 infoHash metainfo.Hash
63 // Values are the piece indices that changed.
64 pieceStateChanges *pubsub.PubSub
65 // The size of chunks to request from peers over the wire. This is
66 // normally 16KiB by convention these days.
69 // Total length of the torrent in bytes. Stored because it's not O(1) to
70 // get this from the info dict.
73 // The storage to open when the info dict becomes available.
74 storageOpener *storage.Client
75 // Storage for torrent data.
76 storage *storage.Torrent
77 // Read-locked for using storage, and write-locked for Closing.
78 storageLock sync.RWMutex
80 // TODO: Only announce stuff is used?
81 metainfo metainfo.MetaInfo
83 // The info dict. nil if we don't have it (yet).
85 fileIndex segments.Index
88 webSeeds map[string]*Peer
90 // Active peer connections, running message stream loops. TODO: Make this
91 // open (not-closed) connections only.
92 conns map[*PeerConn]struct{}
93 maxEstablishedConns int
94 // Set of addrs to which we're attempting to connect. Connections are
95 // half-open until all handshakes are completed.
96 halfOpen map[string]PeerInfo
98 // Reserve of peers to connect to. A peer can be both here and in the
99 // active connections if were told about the peer after connecting with
100 // them. That encourages us to reconnect to peers that are well known in
102 peers prioritizedPeers
103 // Whether we want to know to know more peers.
104 wantPeersEvent missinggo.Event
105 // An announcer for each tracker URL.
106 trackerAnnouncers map[string]torrentTrackerAnnouncer
107 // How many times we've initiated a DHT announce. TODO: Move into stats.
110 // Name used if the info name isn't available. Should be cleared when the
111 // Info does become available.
115 // The bencoded bytes of the info dict. This is actively manipulated if
116 // the info bytes aren't initially available, and we try to fetch them
119 // Each element corresponds to the 16KiB metadata pieces. If true, we have
120 // received that piece.
121 metadataCompletedChunks []bool
122 metadataChanged sync.Cond
124 // Closed when .Info is obtained.
125 gotMetainfoC chan struct{}
127 readers map[*reader]struct{}
128 _readerNowPieces bitmap.Bitmap
129 _readerReadaheadPieces bitmap.Bitmap
131 // A cache of pieces we need to get. Calculated from various piece and
132 // file priorities and completion states elsewhere.
133 _pendingPieces roaring.Bitmap
134 // A cache of completed piece indices.
135 _completedPieces roaring.Bitmap
136 // Pieces that need to be hashed.
137 piecesQueuedForHash bitmap.Bitmap
138 activePieceHashes int
139 initialPieceCheckDisabled bool
141 // A pool of piece priorities []int for assignment to new connections.
142 // These "inclinations" are used to give connections preference for
144 connPieceInclinationPool sync.Pool
146 // Count of each request across active connections.
147 pendingRequests pendingRequests
148 // Chunks we've written to since the corresponding piece was last checked.
149 dirtyChunks roaring.Bitmap
153 // Is On when all pieces are complete.
154 Complete chansync.Flag
157 func (t *Torrent) pieceAvailabilityFromPeers(i pieceIndex) (count int) {
158 t.iterPeers(func(peer *Peer) {
159 if peer.peerHasPiece(i) {
166 func (t *Torrent) decPieceAvailability(i pieceIndex) {
171 if p.availability <= 0 {
172 panic(p.availability)
177 func (t *Torrent) incPieceAvailability(i pieceIndex) {
178 // If we don't the info, this should be reconciled when we do.
185 func (t *Torrent) readerNowPieces() bitmap.Bitmap {
186 return t._readerNowPieces
189 func (t *Torrent) readerReadaheadPieces() bitmap.Bitmap {
190 return t._readerReadaheadPieces
193 func (t *Torrent) ignorePieceForRequests(i pieceIndex) bool {
194 return !t.wantPieceIndex(i)
197 // Returns a channel that is closed when the Torrent is closed.
198 func (t *Torrent) Closed() events.Done {
199 return t.closed.Done()
202 // KnownSwarm returns the known subset of the peers in the Torrent's swarm, including active,
203 // pending, and half-open peers.
204 func (t *Torrent) KnownSwarm() (ks []PeerInfo) {
205 // Add pending peers to the list
206 t.peers.Each(func(peer PeerInfo) {
207 ks = append(ks, peer)
210 // Add half-open peers to the list
211 for _, peer := range t.halfOpen {
212 ks = append(ks, peer)
215 // Add active peers to the list
216 for conn := range t.conns {
218 ks = append(ks, PeerInfo{
220 Addr: conn.RemoteAddr,
221 Source: conn.Discovery,
222 // > If the connection is encrypted, that's certainly enough to set SupportsEncryption.
223 // > But if we're not connected to them with an encrypted connection, I couldn't say
224 // > what's appropriate. We can carry forward the SupportsEncryption value as we
225 // > received it from trackers/DHT/PEX, or just use the encryption state for the
226 // > connection. It's probably easiest to do the latter for now.
227 // https://github.com/anacrolix/torrent/pull/188
228 SupportsEncryption: conn.headerEncrypted,
235 func (t *Torrent) setChunkSize(size pp.Integer) {
237 t.chunkPool = sync.Pool{
238 New: func() interface{} {
239 b := make([]byte, size)
245 func (t *Torrent) pieceComplete(piece pieceIndex) bool {
246 return t._completedPieces.Contains(bitmap.BitIndex(piece))
249 func (t *Torrent) pieceCompleteUncached(piece pieceIndex) storage.Completion {
250 return t.pieces[piece].Storage().Completion()
253 // There's a connection to that address already.
254 func (t *Torrent) addrActive(addr string) bool {
255 if _, ok := t.halfOpen[addr]; ok {
258 for c := range t.conns {
260 if ra.String() == addr {
267 func (t *Torrent) appendUnclosedConns(ret []*PeerConn) []*PeerConn {
268 for c := range t.conns {
269 if !c.closed.IsSet() {
276 func (t *Torrent) addPeer(p PeerInfo) (added bool) {
278 torrent.Add(fmt.Sprintf("peers added by source %q", p.Source), 1)
279 if t.closed.IsSet() {
282 if ipAddr, ok := tryIpPortFromNetAddr(p.Addr); ok {
283 if cl.badPeerIPPort(ipAddr.IP, ipAddr.Port) {
284 torrent.Add("peers not added because of bad addr", 1)
285 // cl.logger.Printf("peers not added because of bad addr: %v", p)
289 if replaced, ok := t.peers.AddReturningReplacedPeer(p); ok {
290 torrent.Add("peers replaced", 1)
291 if !replaced.equal(p) {
292 t.logger.WithDefaultLevel(log.Debug).Printf("added %v replacing %v", p, replaced)
299 for t.peers.Len() > cl.config.TorrentPeersHighWater {
300 _, ok := t.peers.DeleteMin()
302 torrent.Add("excess reserve peers discarded", 1)
308 func (t *Torrent) invalidateMetadata() {
309 for i := 0; i < len(t.metadataCompletedChunks); i++ {
310 t.metadataCompletedChunks[i] = false
313 t.gotMetainfoC = make(chan struct{})
318 func (t *Torrent) saveMetadataPiece(index int, data []byte) {
322 if index >= len(t.metadataCompletedChunks) {
323 t.logger.Printf("%s: ignoring metadata piece %d", t, index)
326 copy(t.metadataBytes[(1<<14)*index:], data)
327 t.metadataCompletedChunks[index] = true
330 func (t *Torrent) metadataPieceCount() int {
331 return (len(t.metadataBytes) + (1 << 14) - 1) / (1 << 14)
334 func (t *Torrent) haveMetadataPiece(piece int) bool {
336 return (1<<14)*piece < len(t.metadataBytes)
338 return piece < len(t.metadataCompletedChunks) && t.metadataCompletedChunks[piece]
342 func (t *Torrent) metadataSize() int {
343 return len(t.metadataBytes)
346 func infoPieceHashes(info *metainfo.Info) (ret [][]byte) {
347 for i := 0; i < len(info.Pieces); i += sha1.Size {
348 ret = append(ret, info.Pieces[i:i+sha1.Size])
353 func (t *Torrent) makePieces() {
354 hashes := infoPieceHashes(t.info)
355 t.pieces = make([]Piece, len(hashes))
356 for i, hash := range hashes {
357 piece := &t.pieces[i]
359 piece.index = pieceIndex(i)
360 piece.noPendingWrites.L = &piece.pendingWritesMutex
361 piece.hash = (*metainfo.Hash)(unsafe.Pointer(&hash[0]))
363 beginFile := pieceFirstFileIndex(piece.torrentBeginOffset(), files)
364 endFile := pieceEndFileIndex(piece.torrentEndOffset(), files)
365 piece.files = files[beginFile:endFile]
366 piece.undirtiedChunksIter = undirtiedChunksIter{
367 TorrentDirtyChunks: &t.dirtyChunks,
368 StartRequestIndex: piece.requestIndexOffset(),
369 EndRequestIndex: piece.requestIndexOffset() + piece.numChunks(),
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(t.numRequests())
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) numRequests() RequestIndex {
865 if t.numPieces() == 0 {
868 return uint32(t.numPieces()-1)*t.chunksPerRegularPiece() + t.pieceNumChunks(t.numPieces()-1)
871 func (t *Torrent) pendAllChunkSpecs(pieceIndex pieceIndex) {
872 t.dirtyChunks.RemoveRange(
873 uint64(t.pieceRequestIndexOffset(pieceIndex)),
874 uint64(t.pieceRequestIndexOffset(pieceIndex+1)))
877 func (t *Torrent) pieceLength(piece pieceIndex) pp.Integer {
878 if t.info.PieceLength == 0 {
879 // There will be no variance amongst pieces. Only pain.
882 if piece == t.numPieces()-1 {
883 ret := pp.Integer(*t.length % t.info.PieceLength)
888 return pp.Integer(t.info.PieceLength)
891 func (t *Torrent) hashPiece(piece pieceIndex) (ret metainfo.Hash, err error) {
893 p.waitNoPendingWrites()
894 storagePiece := t.pieces[piece].Storage()
896 //Does the backend want to do its own hashing?
897 if i, ok := storagePiece.PieceImpl.(storage.SelfHashing); ok {
898 var sum metainfo.Hash
899 //log.Printf("A piece decided to self-hash: %d", piece)
900 sum, err = i.SelfHash()
901 missinggo.CopyExact(&ret, sum)
905 hash := pieceHash.New()
906 const logPieceContents = false
907 if logPieceContents {
908 var examineBuf bytes.Buffer
909 _, err = storagePiece.WriteTo(io.MultiWriter(hash, &examineBuf))
910 log.Printf("hashed %q with copy err %v", examineBuf.Bytes(), err)
912 _, err = storagePiece.WriteTo(hash)
914 missinggo.CopyExact(&ret, hash.Sum(nil))
918 func (t *Torrent) haveAnyPieces() bool {
919 return t._completedPieces.GetCardinality() != 0
922 func (t *Torrent) haveAllPieces() bool {
926 return t._completedPieces.GetCardinality() == bitmap.BitRange(t.numPieces())
929 func (t *Torrent) havePiece(index pieceIndex) bool {
930 return t.haveInfo() && t.pieceComplete(index)
933 func (t *Torrent) maybeDropMutuallyCompletePeer(
934 // I'm not sure about taking peer here, not all peer implementations actually drop. Maybe that's
938 if !t.cl.config.DropMutuallyCompletePeers {
941 if !t.haveAllPieces() {
944 if all, known := p.peerHasAllPieces(); !(known && all) {
950 t.logger.WithDefaultLevel(log.Debug).Printf("dropping %v, which is mutually complete", p)
954 func (t *Torrent) haveChunk(r Request) (ret bool) {
956 // log.Println("have chunk", r, ret)
961 if t.pieceComplete(pieceIndex(r.Index)) {
964 p := &t.pieces[r.Index]
965 return !p.pendingChunk(r.ChunkSpec, t.chunkSize)
968 func chunkIndexFromChunkSpec(cs ChunkSpec, chunkSize pp.Integer) chunkIndexType {
969 return chunkIndexType(cs.Begin / chunkSize)
972 func (t *Torrent) wantPieceIndex(index pieceIndex) bool {
973 return t._pendingPieces.Contains(uint32(index))
976 // A pool of []*PeerConn, to reduce allocations in functions that need to index or sort Torrent
977 // conns (which is a map).
978 var peerConnSlices sync.Pool
980 // The worst connection is one that hasn't been sent, or sent anything useful for the longest. A bad
981 // connection is one that usually sends us unwanted pieces, or has been in the worse half of the
982 // established connections for more than a minute. This is O(n log n). If there was a way to not
983 // consider the position of a conn relative to the total number, it could be reduced to O(n).
984 func (t *Torrent) worstBadConn() (ret *PeerConn) {
986 getInterface := peerConnSlices.Get()
987 if getInterface == nil {
988 sl = make([]*PeerConn, 0, len(t.conns))
990 sl = getInterface.([]*PeerConn)[:0]
992 sl = t.appendUnclosedConns(sl)
993 defer peerConnSlices.Put(sl)
994 wcs := worseConnSlice{sl}
997 c := heap.Pop(&wcs).(*PeerConn)
998 if c._stats.ChunksReadWasted.Int64() >= 6 && c._stats.ChunksReadWasted.Int64() > c._stats.ChunksReadUseful.Int64() {
1001 // If the connection is in the worst half of the established
1002 // connection quota and is older than a minute.
1003 if wcs.Len() >= (t.maxEstablishedConns+1)/2 {
1004 // Give connections 1 minute to prove themselves.
1005 if time.Since(c.completedHandshake) > time.Minute {
1013 type PieceStateChange struct {
1018 func (t *Torrent) publishPieceChange(piece pieceIndex) {
1019 t.cl._mu.Defer(func() {
1020 cur := t.pieceState(piece)
1021 p := &t.pieces[piece]
1022 if cur != p.publicPieceState {
1023 p.publicPieceState = cur
1024 t.pieceStateChanges.Publish(PieceStateChange{
1032 func (t *Torrent) pieceNumPendingChunks(piece pieceIndex) pp.Integer {
1033 if t.pieceComplete(piece) {
1036 return pp.Integer(t.pieceNumChunks(piece) - t.pieces[piece].numDirtyChunks())
1039 func (t *Torrent) pieceAllDirty(piece pieceIndex) bool {
1040 return t.pieces[piece].allChunksDirty()
1043 func (t *Torrent) readersChanged() {
1044 t.updateReaderPieces()
1045 t.updateAllPiecePriorities("Torrent.readersChanged")
1048 func (t *Torrent) updateReaderPieces() {
1049 t._readerNowPieces, t._readerReadaheadPieces = t.readerPiecePriorities()
1052 func (t *Torrent) readerPosChanged(from, to pieceRange) {
1056 t.updateReaderPieces()
1057 // Order the ranges, high and low.
1059 if l.begin > h.begin {
1062 if l.end < h.begin {
1063 // Two distinct ranges.
1064 t.updatePiecePriorities(l.begin, l.end, "Torrent.readerPosChanged")
1065 t.updatePiecePriorities(h.begin, h.end, "Torrent.readerPosChanged")
1072 t.updatePiecePriorities(l.begin, end, "Torrent.readerPosChanged")
1076 func (t *Torrent) maybeNewConns() {
1077 // Tickle the accept routine.
1078 t.cl.event.Broadcast()
1082 func (t *Torrent) piecePriorityChanged(piece pieceIndex, reason string) {
1083 if t._pendingPieces.Contains(uint32(piece)) {
1084 t.iterPeers(func(c *Peer) {
1085 if c.actualRequestState.Interested {
1088 if !c.isLowOnRequests() {
1091 if !c.peerHasPiece(piece) {
1094 c.updateRequests(reason)
1098 t.publishPieceChange(piece)
1101 func (t *Torrent) updatePiecePriority(piece pieceIndex, reason string) {
1102 p := &t.pieces[piece]
1103 newPrio := p.uncachedPriority()
1104 // t.logger.Printf("torrent %p: piece %d: uncached priority: %v", t, piece, newPrio)
1105 if newPrio == PiecePriorityNone {
1106 if !t._pendingPieces.CheckedRemove(uint32(piece)) {
1110 if !t._pendingPieces.CheckedAdd(uint32(piece)) {
1114 t.piecePriorityChanged(piece, reason)
1117 func (t *Torrent) updateAllPiecePriorities(reason string) {
1118 t.updatePiecePriorities(0, t.numPieces(), reason)
1121 // Update all piece priorities in one hit. This function should have the same
1122 // output as updatePiecePriority, but across all pieces.
1123 func (t *Torrent) updatePiecePriorities(begin, end pieceIndex, reason string) {
1124 for i := begin; i < end; i++ {
1125 t.updatePiecePriority(i, reason)
1129 // Returns the range of pieces [begin, end) that contains the extent of bytes.
1130 func (t *Torrent) byteRegionPieces(off, size int64) (begin, end pieceIndex) {
1131 if off >= *t.length {
1141 begin = pieceIndex(off / t.info.PieceLength)
1142 end = pieceIndex((off + size + t.info.PieceLength - 1) / t.info.PieceLength)
1143 if end > pieceIndex(t.info.NumPieces()) {
1144 end = pieceIndex(t.info.NumPieces())
1149 // Returns true if all iterations complete without breaking. Returns the read regions for all
1150 // readers. The reader regions should not be merged as some callers depend on this method to
1151 // enumerate readers.
1152 func (t *Torrent) forReaderOffsetPieces(f func(begin, end pieceIndex) (more bool)) (all bool) {
1153 for r := range t.readers {
1155 if p.begin >= p.end {
1158 if !f(p.begin, p.end) {
1165 func (t *Torrent) piecePriority(piece pieceIndex) piecePriority {
1166 return t.piece(piece).uncachedPriority()
1169 func (t *Torrent) pendRequest(req RequestIndex) {
1170 t.piece(int(req / t.chunksPerRegularPiece())).pendChunkIndex(req % t.chunksPerRegularPiece())
1173 func (t *Torrent) pieceCompletionChanged(piece pieceIndex, reason string) {
1174 t.cl.event.Broadcast()
1175 if t.pieceComplete(piece) {
1176 t.onPieceCompleted(piece)
1178 t.onIncompletePiece(piece)
1180 t.updatePiecePriority(piece, reason)
1183 func (t *Torrent) numReceivedConns() (ret int) {
1184 for c := range t.conns {
1185 if c.Discovery == PeerSourceIncoming {
1192 func (t *Torrent) maxHalfOpen() int {
1193 // Note that if we somehow exceed the maximum established conns, we want
1194 // the negative value to have an effect.
1195 establishedHeadroom := int64(t.maxEstablishedConns - len(t.conns))
1196 extraIncoming := int64(t.numReceivedConns() - t.maxEstablishedConns/2)
1197 // We want to allow some experimentation with new peers, and to try to
1198 // upset an oversupply of received connections.
1199 return int(min(max(5, extraIncoming)+establishedHeadroom, int64(t.cl.config.HalfOpenConnsPerTorrent)))
1202 func (t *Torrent) openNewConns() (initiated int) {
1203 defer t.updateWantPeersEvent()
1204 for t.peers.Len() != 0 {
1208 if len(t.halfOpen) >= t.maxHalfOpen() {
1211 if len(t.cl.dialers) == 0 {
1214 if t.cl.numHalfOpen >= t.cl.config.TotalHalfOpenConns {
1217 p := t.peers.PopMax()
1224 func (t *Torrent) getConnPieceInclination() []int {
1225 _ret := t.connPieceInclinationPool.Get()
1227 pieceInclinationsNew.Add(1)
1228 return rand.Perm(int(t.numPieces()))
1230 pieceInclinationsReused.Add(1)
1231 return *_ret.(*[]int)
1234 func (t *Torrent) putPieceInclination(pi []int) {
1235 t.connPieceInclinationPool.Put(&pi)
1236 pieceInclinationsPut.Add(1)
1239 func (t *Torrent) updatePieceCompletion(piece pieceIndex) bool {
1241 uncached := t.pieceCompleteUncached(piece)
1242 cached := p.completion()
1243 changed := cached != uncached
1244 complete := uncached.Complete
1245 p.storageCompletionOk = uncached.Ok
1248 t._completedPieces.Add(x)
1250 t._completedPieces.Remove(x)
1253 if complete && len(p.dirtiers) != 0 {
1254 t.logger.Printf("marked piece %v complete but still has dirtiers", piece)
1257 log.Fstr("piece %d completion changed: %+v -> %+v", piece, cached, uncached).SetLevel(log.Debug).Log(t.logger)
1258 t.pieceCompletionChanged(piece, "Torrent.updatePieceCompletion")
1263 // Non-blocking read. Client lock is not required.
1264 func (t *Torrent) readAt(b []byte, off int64) (n int, err error) {
1266 p := &t.pieces[off/t.info.PieceLength]
1267 p.waitNoPendingWrites()
1269 n1, err = p.Storage().ReadAt(b, off-p.Info().Offset())
1280 // Returns an error if the metadata was completed, but couldn't be set for some reason. Blame it on
1281 // the last peer to contribute. TODO: Actually we shouldn't blame peers for failure to open storage
1282 // etc. Also we should probably cached metadata pieces per-Peer, to isolate failure appropriately.
1283 func (t *Torrent) maybeCompleteMetadata() error {
1288 if !t.haveAllMetadataPieces() {
1289 // Don't have enough metadata pieces.
1292 err := t.setInfoBytesLocked(t.metadataBytes)
1294 t.invalidateMetadata()
1295 return fmt.Errorf("error setting info bytes: %s", err)
1297 if t.cl.config.Debug {
1298 t.logger.Printf("%s: got metadata from peers", t)
1303 func (t *Torrent) readerPiecePriorities() (now, readahead bitmap.Bitmap) {
1304 t.forReaderOffsetPieces(func(begin, end pieceIndex) bool {
1306 now.Add(bitmap.BitIndex(begin))
1307 readahead.AddRange(bitmap.BitRange(begin)+1, bitmap.BitRange(end))
1314 func (t *Torrent) needData() bool {
1315 if t.closed.IsSet() {
1321 return !t._pendingPieces.IsEmpty()
1324 func appendMissingStrings(old, new []string) (ret []string) {
1327 for _, n := range new {
1328 for _, o := range old {
1333 ret = append(ret, n)
1338 func appendMissingTrackerTiers(existing [][]string, minNumTiers int) (ret [][]string) {
1340 for minNumTiers > len(ret) {
1341 ret = append(ret, nil)
1346 func (t *Torrent) addTrackers(announceList [][]string) {
1347 fullAnnounceList := &t.metainfo.AnnounceList
1348 t.metainfo.AnnounceList = appendMissingTrackerTiers(*fullAnnounceList, len(announceList))
1349 for tierIndex, trackerURLs := range announceList {
1350 (*fullAnnounceList)[tierIndex] = appendMissingStrings((*fullAnnounceList)[tierIndex], trackerURLs)
1352 t.startMissingTrackerScrapers()
1353 t.updateWantPeersEvent()
1356 // Don't call this before the info is available.
1357 func (t *Torrent) bytesCompleted() int64 {
1361 return *t.length - t.bytesLeft()
1364 func (t *Torrent) SetInfoBytes(b []byte) (err error) {
1367 return t.setInfoBytesLocked(b)
1370 // Returns true if connection is removed from torrent.Conns.
1371 func (t *Torrent) deletePeerConn(c *PeerConn) (ret bool) {
1372 if !c.closed.IsSet() {
1373 panic("connection is not closed")
1374 // There are behaviours prevented by the closed state that will fail
1375 // if the connection has been deleted.
1379 // Avoid adding a drop event more than once. Probably we should track whether we've generated
1380 // the drop event against the PexConnState instead.
1382 if !t.cl.config.DisablePEX {
1386 torrent.Add("deleted connections", 1)
1387 c.deleteAllRequests()
1388 if t.numActivePeers() == 0 && t.haveInfo() {
1389 t.assertNoPendingRequests()
1394 func (t *Torrent) decPeerPieceAvailability(p *Peer) {
1398 p.newPeerPieces().Iterate(func(i uint32) bool {
1399 p.t.decPieceAvailability(pieceIndex(i))
1404 func (t *Torrent) numActivePeers() (num int) {
1405 t.iterPeers(func(*Peer) {
1411 func (t *Torrent) assertNoPendingRequests() {
1412 t.pendingRequests.AssertEmpty()
1415 func (t *Torrent) dropConnection(c *PeerConn) {
1416 t.cl.event.Broadcast()
1418 if t.deletePeerConn(c) {
1423 func (t *Torrent) wantPeers() bool {
1424 if t.closed.IsSet() {
1427 if t.peers.Len() > t.cl.config.TorrentPeersLowWater {
1430 return t.needData() || t.seeding()
1433 func (t *Torrent) updateWantPeersEvent() {
1435 t.wantPeersEvent.Set()
1437 t.wantPeersEvent.Clear()
1441 // Returns whether the client should make effort to seed the torrent.
1442 func (t *Torrent) seeding() bool {
1444 if t.closed.IsSet() {
1447 if t.dataUploadDisallowed {
1450 if cl.config.NoUpload {
1453 if !cl.config.Seed {
1456 if cl.config.DisableAggressiveUpload && t.needData() {
1462 func (t *Torrent) onWebRtcConn(
1463 c datachannel.ReadWriteCloser,
1464 dcc webtorrent.DataChannelContext,
1467 pc, err := t.cl.initiateProtocolHandshakes(
1468 context.Background(),
1469 webrtcNetConn{c, dcc},
1473 webrtcNetAddr{dcc.Remote},
1475 fmt.Sprintf("webrtc offer_id %x", dcc.OfferId),
1478 t.logger.WithDefaultLevel(log.Error).Printf("error in handshaking webrtc connection: %v", err)
1481 if dcc.LocalOffered {
1482 pc.Discovery = PeerSourceTracker
1484 pc.Discovery = PeerSourceIncoming
1488 err = t.cl.runHandshookConn(pc, t)
1490 t.logger.WithDefaultLevel(log.Critical).Printf("error running handshook webrtc conn: %v", err)
1494 func (t *Torrent) logRunHandshookConn(pc *PeerConn, logAll bool, level log.Level) {
1495 err := t.cl.runHandshookConn(pc, t)
1496 if err != nil || logAll {
1497 t.logger.WithDefaultLevel(level).Printf("error running handshook conn: %v", err)
1501 func (t *Torrent) runHandshookConnLoggingErr(pc *PeerConn) {
1502 t.logRunHandshookConn(pc, false, log.Debug)
1505 func (t *Torrent) startWebsocketAnnouncer(u url.URL) torrentTrackerAnnouncer {
1506 wtc, release := t.cl.websocketTrackers.Get(u.String())
1511 wst := websocketTrackerStatus{u, wtc}
1513 err := wtc.Announce(tracker.Started, t.infoHash)
1515 t.logger.WithDefaultLevel(log.Warning).Printf(
1516 "error in initial announce to %q: %v",
1525 func (t *Torrent) startScrapingTracker(_url string) {
1529 u, err := url.Parse(_url)
1531 // URLs with a leading '*' appear to be a uTorrent convention to
1532 // disable trackers.
1534 log.Str("error parsing tracker url").AddValues("url", _url).Log(t.logger)
1538 if u.Scheme == "udp" {
1540 t.startScrapingTracker(u.String())
1542 t.startScrapingTracker(u.String())
1545 if _, ok := t.trackerAnnouncers[_url]; ok {
1548 sl := func() torrentTrackerAnnouncer {
1551 if t.cl.config.DisableWebtorrent {
1554 return t.startWebsocketAnnouncer(*u)
1556 if t.cl.config.DisableIPv4Peers || t.cl.config.DisableIPv4 {
1560 if t.cl.config.DisableIPv6 {
1564 newAnnouncer := &trackerScraper{
1568 go newAnnouncer.Run()
1574 if t.trackerAnnouncers == nil {
1575 t.trackerAnnouncers = make(map[string]torrentTrackerAnnouncer)
1577 t.trackerAnnouncers[_url] = sl
1580 // Adds and starts tracker scrapers for tracker URLs that aren't already
1582 func (t *Torrent) startMissingTrackerScrapers() {
1583 if t.cl.config.DisableTrackers {
1586 t.startScrapingTracker(t.metainfo.Announce)
1587 for _, tier := range t.metainfo.AnnounceList {
1588 for _, url := range tier {
1589 t.startScrapingTracker(url)
1594 // Returns an AnnounceRequest with fields filled out to defaults and current
1596 func (t *Torrent) announceRequest(event tracker.AnnounceEvent) tracker.AnnounceRequest {
1597 // Note that IPAddress is not set. It's set for UDP inside the tracker code, since it's
1598 // dependent on the network in use.
1599 return tracker.AnnounceRequest{
1601 NumWant: func() int32 {
1602 if t.wantPeers() && len(t.cl.dialers) > 0 {
1608 Port: uint16(t.cl.incomingPeerPort()),
1609 PeerId: t.cl.peerID,
1610 InfoHash: t.infoHash,
1611 Key: t.cl.announceKey(),
1613 // The following are vaguely described in BEP 3.
1615 Left: t.bytesLeftAnnounce(),
1616 Uploaded: t.stats.BytesWrittenData.Int64(),
1617 // There's no mention of wasted or unwanted download in the BEP.
1618 Downloaded: t.stats.BytesReadUsefulData.Int64(),
1622 // Adds peers revealed in an announce until the announce ends, or we have
1624 func (t *Torrent) consumeDhtAnnouncePeers(pvs <-chan dht.PeersValues) {
1626 for v := range pvs {
1629 for _, cp := range v.Peers {
1631 // Can't do anything with this.
1634 if t.addPeer(PeerInfo{
1635 Addr: ipPortAddr{cp.IP, cp.Port},
1636 Source: PeerSourceDhtGetPeers,
1643 // log.Printf("added %v peers from dht for %v", added, t.InfoHash().HexString())
1648 // Announce using the provided DHT server. Peers are consumed automatically. done is closed when the
1649 // announce ends. stop will force the announce to end.
1650 func (t *Torrent) AnnounceToDht(s DhtServer) (done <-chan struct{}, stop func(), err error) {
1651 ps, err := s.Announce(t.infoHash, t.cl.incomingPeerPort(), true)
1655 _done := make(chan struct{})
1659 t.consumeDhtAnnouncePeers(ps.Peers())
1665 func (t *Torrent) timeboxedAnnounceToDht(s DhtServer) error {
1666 _, stop, err := t.AnnounceToDht(s)
1671 case <-t.closed.Done():
1672 case <-time.After(5 * time.Minute):
1678 func (t *Torrent) dhtAnnouncer(s DhtServer) {
1684 if t.closed.IsSet() {
1690 // TODO: Determine if there's a listener on the port we're announcing.
1691 if len(cl.dialers) == 0 && len(cl.listeners) == 0 {
1702 err := t.timeboxedAnnounceToDht(s)
1704 t.logger.WithDefaultLevel(log.Warning).Printf("error announcing %q to DHT: %s", t, err)
1710 func (t *Torrent) addPeers(peers []PeerInfo) (added int) {
1711 for _, p := range peers {
1719 // The returned TorrentStats may require alignment in memory. See
1720 // https://github.com/anacrolix/torrent/issues/383.
1721 func (t *Torrent) Stats() TorrentStats {
1723 defer t.cl.rUnlock()
1724 return t.statsLocked()
1727 func (t *Torrent) statsLocked() (ret TorrentStats) {
1728 ret.ActivePeers = len(t.conns)
1729 ret.HalfOpenPeers = len(t.halfOpen)
1730 ret.PendingPeers = t.peers.Len()
1731 ret.TotalPeers = t.numTotalPeers()
1732 ret.ConnectedSeeders = 0
1733 for c := range t.conns {
1734 if all, ok := c.peerHasAllPieces(); all && ok {
1735 ret.ConnectedSeeders++
1738 ret.ConnStats = t.stats.Copy()
1739 ret.PiecesComplete = t.numPiecesCompleted()
1743 // The total number of peers in the torrent.
1744 func (t *Torrent) numTotalPeers() int {
1745 peers := make(map[string]struct{})
1746 for conn := range t.conns {
1747 ra := conn.conn.RemoteAddr()
1749 // It's been closed and doesn't support RemoteAddr.
1752 peers[ra.String()] = struct{}{}
1754 for addr := range t.halfOpen {
1755 peers[addr] = struct{}{}
1757 t.peers.Each(func(peer PeerInfo) {
1758 peers[peer.Addr.String()] = struct{}{}
1763 // Reconcile bytes transferred before connection was associated with a
1765 func (t *Torrent) reconcileHandshakeStats(c *PeerConn) {
1766 if c._stats != (ConnStats{
1767 // Handshakes should only increment these fields:
1768 BytesWritten: c._stats.BytesWritten,
1769 BytesRead: c._stats.BytesRead,
1773 c.postHandshakeStats(func(cs *ConnStats) {
1774 cs.BytesRead.Add(c._stats.BytesRead.Int64())
1775 cs.BytesWritten.Add(c._stats.BytesWritten.Int64())
1777 c.reconciledHandshakeStats = true
1780 // Returns true if the connection is added.
1781 func (t *Torrent) addPeerConn(c *PeerConn) (err error) {
1784 torrent.Add("added connections", 1)
1787 if t.closed.IsSet() {
1788 return errors.New("torrent closed")
1790 for c0 := range t.conns {
1791 if c.PeerID != c0.PeerID {
1794 if !t.cl.config.DropDuplicatePeerIds {
1797 if left, ok := c.hasPreferredNetworkOver(c0); ok && left {
1799 t.deletePeerConn(c0)
1801 return errors.New("existing connection preferred")
1804 if len(t.conns) >= t.maxEstablishedConns {
1805 c := t.worstBadConn()
1807 return errors.New("don't want conns")
1812 if len(t.conns) >= t.maxEstablishedConns {
1815 t.conns[c] = struct{}{}
1816 if !t.cl.config.DisablePEX && !c.PeerExtensionBytes.SupportsExtended() {
1817 t.pex.Add(c) // as no further extended handshake expected
1822 func (t *Torrent) wantConns() bool {
1823 if !t.networkingEnabled.Bool() {
1826 if t.closed.IsSet() {
1829 if !t.seeding() && !t.needData() {
1832 if len(t.conns) < t.maxEstablishedConns {
1835 return t.worstBadConn() != nil
1838 func (t *Torrent) SetMaxEstablishedConns(max int) (oldMax int) {
1841 oldMax = t.maxEstablishedConns
1842 t.maxEstablishedConns = max
1843 wcs := slices.HeapInterface(slices.FromMapKeys(t.conns), func(l, r *PeerConn) bool {
1844 return worseConn(&l.Peer, &r.Peer)
1846 for len(t.conns) > t.maxEstablishedConns && wcs.Len() > 0 {
1847 t.dropConnection(wcs.Pop().(*PeerConn))
1853 func (t *Torrent) pieceHashed(piece pieceIndex, passed bool, hashIoErr error) {
1854 t.logger.Log(log.Fstr("hashed piece %d (passed=%t)", piece, passed).SetLevel(log.Debug))
1857 t.cl.event.Broadcast()
1858 if t.closed.IsSet() {
1862 // Don't score the first time a piece is hashed, it could be an initial check.
1863 if p.storageCompletionOk {
1865 pieceHashedCorrect.Add(1)
1868 "piece %d failed hash: %d connections contributed", piece, len(p.dirtiers),
1869 ).AddValues(t, p).SetLevel(log.Debug).Log(t.logger)
1870 pieceHashedNotCorrect.Add(1)
1875 t.publishPieceChange(piece)
1878 t.publishPieceChange(piece)
1882 if len(p.dirtiers) != 0 {
1883 // Don't increment stats above connection-level for every involved connection.
1884 t.allStats((*ConnStats).incrementPiecesDirtiedGood)
1886 for c := range p.dirtiers {
1887 c._stats.incrementPiecesDirtiedGood()
1889 t.clearPieceTouchers(piece)
1891 err := p.Storage().MarkComplete()
1893 t.logger.Printf("%T: error marking piece complete %d: %s", t.storage, piece, err)
1897 if t.closed.IsSet() {
1900 t.pendAllChunkSpecs(piece)
1902 if len(p.dirtiers) != 0 && p.allChunksDirty() && hashIoErr == nil {
1903 // Peers contributed to all the data for this piece hash failure, and the failure was
1904 // not due to errors in the storage (such as data being dropped in a cache).
1906 // Increment Torrent and above stats, and then specific connections.
1907 t.allStats((*ConnStats).incrementPiecesDirtiedBad)
1908 for c := range p.dirtiers {
1909 // Y u do dis peer?!
1910 c.stats().incrementPiecesDirtiedBad()
1913 bannableTouchers := make([]*Peer, 0, len(p.dirtiers))
1914 for c := range p.dirtiers {
1916 bannableTouchers = append(bannableTouchers, c)
1919 t.clearPieceTouchers(piece)
1920 slices.Sort(bannableTouchers, connLessTrusted)
1922 if t.cl.config.Debug {
1924 "bannable conns by trust for piece %d: %v",
1926 func() (ret []connectionTrust) {
1927 for _, c := range bannableTouchers {
1928 ret = append(ret, c.trust())
1935 if len(bannableTouchers) >= 1 {
1936 c := bannableTouchers[0]
1937 t.cl.banPeerIP(c.remoteIp())
1941 t.onIncompletePiece(piece)
1942 p.Storage().MarkNotComplete()
1944 t.updatePieceCompletion(piece)
1947 func (t *Torrent) cancelRequestsForPiece(piece pieceIndex) {
1948 // TODO: Make faster
1949 for cn := range t.conns {
1954 func (t *Torrent) onPieceCompleted(piece pieceIndex) {
1955 t.pendAllChunkSpecs(piece)
1956 t.cancelRequestsForPiece(piece)
1957 t.piece(piece).readerCond.Broadcast()
1958 for conn := range t.conns {
1960 t.maybeDropMutuallyCompletePeer(&conn.Peer)
1964 // Called when a piece is found to be not complete.
1965 func (t *Torrent) onIncompletePiece(piece pieceIndex) {
1966 if t.pieceAllDirty(piece) {
1967 t.pendAllChunkSpecs(piece)
1969 if !t.wantPieceIndex(piece) {
1970 // t.logger.Printf("piece %d incomplete and unwanted", piece)
1973 // We could drop any connections that we told we have a piece that we
1974 // don't here. But there's a test failure, and it seems clients don't care
1975 // if you request pieces that you already claim to have. Pruning bad
1976 // connections might just remove any connections that aren't treating us
1977 // favourably anyway.
1979 // for c := range t.conns {
1980 // if c.sentHave(piece) {
1984 t.iterPeers(func(conn *Peer) {
1985 if conn.peerHasPiece(piece) {
1986 conn.updateRequests("piece incomplete")
1991 func (t *Torrent) tryCreateMorePieceHashers() {
1992 for !t.closed.IsSet() && t.activePieceHashes < 2 && t.tryCreatePieceHasher() {
1996 func (t *Torrent) tryCreatePieceHasher() bool {
1997 if t.storage == nil {
2000 pi, ok := t.getPieceToHash()
2005 t.piecesQueuedForHash.Remove(bitmap.BitIndex(pi))
2007 t.publishPieceChange(pi)
2008 t.updatePiecePriority(pi, "Torrent.tryCreatePieceHasher")
2009 t.storageLock.RLock()
2010 t.activePieceHashes++
2011 go t.pieceHasher(pi)
2015 func (t *Torrent) getPieceToHash() (ret pieceIndex, ok bool) {
2016 t.piecesQueuedForHash.IterTyped(func(i pieceIndex) bool {
2017 if t.piece(i).hashing {
2027 func (t *Torrent) pieceHasher(index pieceIndex) {
2029 sum, copyErr := t.hashPiece(index)
2030 correct := sum == *p.hash
2034 log.Fmsg("piece %v (%s) hash failure copy error: %v", p, p.hash.HexString(), copyErr).Log(t.logger)
2036 t.storageLock.RUnlock()
2040 t.pieceHashed(index, correct, copyErr)
2041 t.updatePiecePriority(index, "Torrent.pieceHasher")
2042 t.activePieceHashes--
2043 t.tryCreateMorePieceHashers()
2046 // Return the connections that touched a piece, and clear the entries while doing it.
2047 func (t *Torrent) clearPieceTouchers(pi pieceIndex) {
2049 for c := range p.dirtiers {
2050 delete(c.peerTouchedPieces, pi)
2051 delete(p.dirtiers, c)
2055 func (t *Torrent) peersAsSlice() (ret []*Peer) {
2056 t.iterPeers(func(p *Peer) {
2057 ret = append(ret, p)
2062 func (t *Torrent) queuePieceCheck(pieceIndex pieceIndex) {
2063 piece := t.piece(pieceIndex)
2064 if piece.queuedForHash() {
2067 t.piecesQueuedForHash.Add(bitmap.BitIndex(pieceIndex))
2068 t.publishPieceChange(pieceIndex)
2069 t.updatePiecePriority(pieceIndex, "Torrent.queuePieceCheck")
2070 t.tryCreateMorePieceHashers()
2073 // Forces all the pieces to be re-hashed. See also Piece.VerifyData. This should not be called
2074 // before the Info is available.
2075 func (t *Torrent) VerifyData() {
2076 for i := pieceIndex(0); i < t.NumPieces(); i++ {
2077 t.Piece(i).VerifyData()
2081 // Start the process of connecting to the given peer for the given torrent if appropriate.
2082 func (t *Torrent) initiateConn(peer PeerInfo) {
2083 if peer.Id == t.cl.peerID {
2086 if t.cl.badPeerAddr(peer.Addr) && !peer.Trusted {
2090 if t.addrActive(addr.String()) {
2094 t.halfOpen[addr.String()] = peer
2095 go t.cl.outgoingConnection(t, addr, peer.Source, peer.Trusted)
2098 // Adds a trusted, pending peer for each of the given Client's addresses. Typically used in tests to
2099 // quickly make one Client visible to the Torrent of another Client.
2100 func (t *Torrent) AddClientPeer(cl *Client) int {
2101 return t.AddPeers(func() (ps []PeerInfo) {
2102 for _, la := range cl.ListenAddrs() {
2103 ps = append(ps, PeerInfo{
2112 // All stats that include this Torrent. Useful when we want to increment ConnStats but not for every
2114 func (t *Torrent) allStats(f func(*ConnStats)) {
2119 func (t *Torrent) hashingPiece(i pieceIndex) bool {
2120 return t.pieces[i].hashing
2123 func (t *Torrent) pieceQueuedForHash(i pieceIndex) bool {
2124 return t.piecesQueuedForHash.Get(bitmap.BitIndex(i))
2127 func (t *Torrent) dialTimeout() time.Duration {
2128 return reducedDialTimeout(t.cl.config.MinDialTimeout, t.cl.config.NominalDialTimeout, t.cl.config.HalfOpenConnsPerTorrent, t.peers.Len())
2131 func (t *Torrent) piece(i int) *Piece {
2135 func (t *Torrent) onWriteChunkErr(err error) {
2136 if t.userOnWriteChunkErr != nil {
2137 go t.userOnWriteChunkErr(err)
2140 t.logger.WithDefaultLevel(log.Critical).Printf("default chunk write error handler: disabling data download")
2141 t.disallowDataDownloadLocked()
2144 func (t *Torrent) DisallowDataDownload() {
2145 t.disallowDataDownloadLocked()
2148 func (t *Torrent) disallowDataDownloadLocked() {
2149 t.dataDownloadDisallowed.Set()
2152 func (t *Torrent) AllowDataDownload() {
2153 t.dataDownloadDisallowed.Clear()
2156 // Enables uploading data, if it was disabled.
2157 func (t *Torrent) AllowDataUpload() {
2160 t.dataUploadDisallowed = false
2161 for c := range t.conns {
2162 c.updateRequests("allow data upload")
2166 // Disables uploading data, if it was enabled.
2167 func (t *Torrent) DisallowDataUpload() {
2170 t.dataUploadDisallowed = true
2171 for c := range t.conns {
2172 c.updateRequests("disallow data upload")
2176 // Sets a handler that is called if there's an error writing a chunk to local storage. By default,
2177 // or if nil, a critical message is logged, and data download is disabled.
2178 func (t *Torrent) SetOnWriteChunkError(f func(error)) {
2181 t.userOnWriteChunkErr = f
2184 func (t *Torrent) iterPeers(f func(p *Peer)) {
2185 for pc := range t.conns {
2188 for _, ws := range t.webSeeds {
2193 func (t *Torrent) callbacks() *Callbacks {
2194 return &t.cl.config.Callbacks
2197 var WebseedHttpClient = &http.Client{
2198 Transport: &http.Transport{
2199 MaxConnsPerHost: 10,
2203 func (t *Torrent) addWebSeed(url string) {
2204 if t.cl.config.DisableWebseeds {
2207 if _, ok := t.webSeeds[url]; ok {
2210 const maxRequests = 10
2216 reconciledHandshakeStats: true,
2217 // TODO: Raise this limit, and instead limit concurrent fetches.
2218 PeerMaxRequests: 32,
2219 RemoteAddr: remoteAddrFromUrl(url),
2220 callbacks: t.callbacks(),
2222 client: webseed.Client{
2223 // Consider a MaxConnsPerHost in the transport for this, possibly in a global Client.
2224 HttpClient: WebseedHttpClient,
2227 activeRequests: make(map[Request]webseed.Request, maxRequests),
2228 maxRequests: maxRequests,
2230 ws.peer.initUpdateRequestsTimer()
2231 ws.requesterCond.L = t.cl.locker()
2232 for i := 0; i < maxRequests; i += 1 {
2235 for _, f := range t.callbacks().NewPeer {
2238 ws.peer.logger = t.logger.WithContextValue(&ws)
2239 ws.peer.peerImpl = &ws
2241 ws.onGotInfo(t.info)
2243 t.webSeeds[url] = &ws.peer
2244 ws.peer.onPeerHasAllPieces()
2247 func (t *Torrent) peerIsActive(p *Peer) (active bool) {
2248 t.iterPeers(func(p1 *Peer) {
2256 func (t *Torrent) requestIndexToRequest(ri RequestIndex) Request {
2257 index := ri / t.chunksPerRegularPiece()
2260 t.piece(int(index)).chunkIndexSpec(ri % t.chunksPerRegularPiece()),
2264 func (t *Torrent) requestIndexFromRequest(r Request) RequestIndex {
2265 return t.pieceRequestIndexOffset(pieceIndex(r.Index)) + uint32(r.Begin/t.chunkSize)
2268 func (t *Torrent) pieceRequestIndexOffset(piece pieceIndex) RequestIndex {
2269 return RequestIndex(piece) * t.chunksPerRegularPiece()
2272 func (t *Torrent) updateComplete() {
2273 t.Complete.SetBool(t.haveAllPieces())