21 "github.com/RoaringBitmap/roaring"
22 "github.com/anacrolix/chansync"
23 "github.com/anacrolix/chansync/events"
24 "github.com/anacrolix/dht/v2"
25 . "github.com/anacrolix/generics"
26 g "github.com/anacrolix/generics"
27 "github.com/anacrolix/log"
28 "github.com/anacrolix/missinggo/slices"
29 "github.com/anacrolix/missinggo/v2"
30 "github.com/anacrolix/missinggo/v2/bitmap"
31 "github.com/anacrolix/missinggo/v2/pubsub"
32 "github.com/anacrolix/multiless"
33 "github.com/anacrolix/sync"
34 "github.com/pion/datachannel"
35 "golang.org/x/exp/maps"
36 "golang.org/x/sync/errgroup"
38 "github.com/anacrolix/torrent/bencode"
39 "github.com/anacrolix/torrent/internal/check"
40 "github.com/anacrolix/torrent/internal/nestedmaps"
41 "github.com/anacrolix/torrent/merkle"
42 "github.com/anacrolix/torrent/metainfo"
43 pp "github.com/anacrolix/torrent/peer_protocol"
44 utHolepunch "github.com/anacrolix/torrent/peer_protocol/ut-holepunch"
45 request_strategy "github.com/anacrolix/torrent/request-strategy"
46 "github.com/anacrolix/torrent/storage"
47 "github.com/anacrolix/torrent/tracker"
48 typedRoaring "github.com/anacrolix/torrent/typed-roaring"
49 "github.com/anacrolix/torrent/types/infohash"
50 infohash_v2 "github.com/anacrolix/torrent/types/infohash-v2"
51 "github.com/anacrolix/torrent/webseed"
52 "github.com/anacrolix/torrent/webtorrent"
55 // Maintains state of torrent within a Client. Many methods should not be called before the info is
56 // available, see .Info and .GotInfo.
58 // Torrent-level aggregate statistics. First in struct to ensure 64-bit
59 // alignment. See #262.
64 networkingEnabled chansync.Flag
65 dataDownloadDisallowed chansync.Flag
66 dataUploadDisallowed bool
67 userOnWriteChunkErr func(error)
69 closed chansync.SetOnce
72 infoHash g.Option[metainfo.Hash]
73 infoHashV2 g.Option[infohash_v2.T]
77 // The order pieces are requested if there's no stronger reason like availability or priority.
78 pieceRequestOrder []int
79 // Values are the piece indices that changed.
80 pieceStateChanges pubsub.PubSub[PieceStateChange]
81 // The size of chunks to request from peers over the wire. This is
82 // normally 16KiB by convention these days.
85 // Total length of the torrent in bytes. Stored because it's not O(1) to
86 // get this from the info dict.
89 // The storage to open when the info dict becomes available.
90 storageOpener *storage.Client
91 // Storage for torrent data.
92 storage *storage.Torrent
93 // Read-locked for using storage, and write-locked for Closing.
94 storageLock sync.RWMutex
96 // TODO: Only announce stuff is used?
97 metainfo metainfo.MetaInfo
99 // The info dict. nil if we don't have it (yet).
103 _chunksPerRegularPiece chunkIndexType
105 webSeeds map[string]*Peer
106 // Active peer connections, running message stream loops. TODO: Make this
107 // open (not-closed) connections only.
108 conns map[*PeerConn]struct{}
109 maxEstablishedConns int
110 // Set of addrs to which we're attempting to connect. Connections are
111 // half-open until all handshakes are completed.
112 halfOpen map[string]map[outgoingConnAttemptKey]*PeerInfo
114 // Reserve of peers to connect to. A peer can be both here and in the
115 // active connections if were told about the peer after connecting with
116 // them. That encourages us to reconnect to peers that are well known in
118 peers prioritizedPeers
119 // Whether we want to know more peers.
120 wantPeersEvent missinggo.Event
121 // An announcer for each tracker URL.
122 trackerAnnouncers map[torrentTrackerAnnouncerKey]torrentTrackerAnnouncer
123 // How many times we've initiated a DHT announce. TODO: Move into stats.
126 // Name used if the info name isn't available. Should be cleared when the
127 // Info does become available.
131 // The bencoded bytes of the info dict. This is actively manipulated if
132 // the info bytes aren't initially available, and we try to fetch them
135 // Each element corresponds to the 16KiB metadata pieces. If true, we have
136 // received that piece.
137 metadataCompletedChunks []bool
138 metadataChanged sync.Cond
140 // Closed when .Info is obtained.
141 gotMetainfoC chan struct{}
143 readers map[*reader]struct{}
144 _readerNowPieces bitmap.Bitmap
145 _readerReadaheadPieces bitmap.Bitmap
147 // A cache of pieces we need to get. Calculated from various piece and
148 // file priorities and completion states elsewhere.
149 _pendingPieces roaring.Bitmap
150 // A cache of completed piece indices.
151 _completedPieces roaring.Bitmap
152 // Pieces that need to be hashed.
153 piecesQueuedForHash bitmap.Bitmap
154 activePieceHashes int
155 initialPieceCheckDisabled bool
157 connsWithAllPieces map[*Peer]struct{}
159 requestState map[RequestIndex]requestState
160 // Chunks we've written to since the corresponding piece was last checked.
161 dirtyChunks typedRoaring.Bitmap[RequestIndex]
165 // Is On when all pieces are complete.
166 Complete chansync.Flag
168 // Torrent sources in use keyed by the source string.
169 activeSources sync.Map
170 sourcesLogger log.Logger
172 smartBanCache smartBanCache
174 // Large allocations reused between request state updates.
175 requestPieceStates []request_strategy.PieceRequestOrderState
176 requestIndexes []RequestIndex
181 type torrentTrackerAnnouncerKey struct {
182 shortInfohash [20]byte
186 type outgoingConnAttemptKey = *PeerInfo
188 func (t *Torrent) length() int64 {
189 return t._length.Value
192 func (t *Torrent) selectivePieceAvailabilityFromPeers(i pieceIndex) (count int) {
193 // This could be done with roaring.BitSliceIndexing.
194 t.iterPeers(func(peer *Peer) {
195 if _, ok := t.connsWithAllPieces[peer]; ok {
198 if peer.peerHasPiece(i) {
205 func (t *Torrent) decPieceAvailability(i pieceIndex) {
210 if p.relativeAvailability <= 0 {
211 panic(p.relativeAvailability)
213 p.relativeAvailability--
214 t.updatePieceRequestOrderPiece(i)
217 func (t *Torrent) incPieceAvailability(i pieceIndex) {
218 // If we don't the info, this should be reconciled when we do.
221 p.relativeAvailability++
222 t.updatePieceRequestOrderPiece(i)
226 func (t *Torrent) readerNowPieces() bitmap.Bitmap {
227 return t._readerNowPieces
230 func (t *Torrent) readerReadaheadPieces() bitmap.Bitmap {
231 return t._readerReadaheadPieces
234 func (t *Torrent) ignorePieceForRequests(i pieceIndex) bool {
235 return !t.wantPieceIndex(i)
238 // Returns a channel that is closed when the Torrent is closed.
239 func (t *Torrent) Closed() events.Done {
240 return t.closed.Done()
243 // KnownSwarm returns the known subset of the peers in the Torrent's swarm, including active,
244 // pending, and half-open peers.
245 func (t *Torrent) KnownSwarm() (ks []PeerInfo) {
246 // Add pending peers to the list
247 t.peers.Each(func(peer PeerInfo) {
248 ks = append(ks, peer)
251 // Add half-open peers to the list
252 for _, attempts := range t.halfOpen {
253 for _, peer := range attempts {
254 ks = append(ks, *peer)
258 // Add active peers to the list
261 for conn := range t.conns {
262 ks = append(ks, PeerInfo{
264 Addr: conn.RemoteAddr,
265 Source: conn.Discovery,
266 // > If the connection is encrypted, that's certainly enough to set SupportsEncryption.
267 // > But if we're not connected to them with an encrypted connection, I couldn't say
268 // > what's appropriate. We can carry forward the SupportsEncryption value as we
269 // > received it from trackers/DHT/PEX, or just use the encryption state for the
270 // > connection. It's probably easiest to do the latter for now.
271 // https://github.com/anacrolix/torrent/pull/188
272 SupportsEncryption: conn.headerEncrypted,
279 func (t *Torrent) setChunkSize(size pp.Integer) {
281 t.chunkPool = sync.Pool{
282 New: func() interface{} {
283 b := make([]byte, size)
289 func (t *Torrent) pieceComplete(piece pieceIndex) bool {
290 return t._completedPieces.Contains(bitmap.BitIndex(piece))
293 func (t *Torrent) pieceCompleteUncached(piece pieceIndex) storage.Completion {
294 if t.storage == nil {
295 return storage.Completion{Complete: false, Ok: true}
297 return t.pieces[piece].Storage().Completion()
300 // There's a connection to that address already.
301 func (t *Torrent) addrActive(addr string) bool {
302 if _, ok := t.halfOpen[addr]; ok {
305 for c := range t.conns {
307 if ra.String() == addr {
314 func (t *Torrent) appendUnclosedConns(ret []*PeerConn) []*PeerConn {
315 return t.appendConns(ret, func(conn *PeerConn) bool {
316 return !conn.closed.IsSet()
320 func (t *Torrent) appendConns(ret []*PeerConn, f func(*PeerConn) bool) []*PeerConn {
321 for c := range t.conns {
329 func (t *Torrent) addPeer(p PeerInfo) (added bool) {
331 torrent.Add(fmt.Sprintf("peers added by source %q", p.Source), 1)
332 if t.closed.IsSet() {
335 if ipAddr, ok := tryIpPortFromNetAddr(p.Addr); ok {
336 if cl.badPeerIPPort(ipAddr.IP, ipAddr.Port) {
337 torrent.Add("peers not added because of bad addr", 1)
338 // cl.logger.Printf("peers not added because of bad addr: %v", p)
342 if replaced, ok := t.peers.AddReturningReplacedPeer(p); ok {
343 torrent.Add("peers replaced", 1)
344 if !replaced.equal(p) {
345 t.logger.WithDefaultLevel(log.Debug).Printf("added %v replacing %v", p, replaced)
352 for t.peers.Len() > cl.config.TorrentPeersHighWater {
353 _, ok := t.peers.DeleteMin()
355 torrent.Add("excess reserve peers discarded", 1)
361 func (t *Torrent) invalidateMetadata() {
362 for i := 0; i < len(t.metadataCompletedChunks); i++ {
363 t.metadataCompletedChunks[i] = false
366 t.gotMetainfoC = make(chan struct{})
371 func (t *Torrent) saveMetadataPiece(index int, data []byte) {
375 if index >= len(t.metadataCompletedChunks) {
376 t.logger.Printf("%s: ignoring metadata piece %d", t, index)
379 copy(t.metadataBytes[(1<<14)*index:], data)
380 t.metadataCompletedChunks[index] = true
383 func (t *Torrent) metadataPieceCount() int {
384 return (len(t.metadataBytes) + (1 << 14) - 1) / (1 << 14)
387 func (t *Torrent) haveMetadataPiece(piece int) bool {
389 return (1<<14)*piece < len(t.metadataBytes)
391 return piece < len(t.metadataCompletedChunks) && t.metadataCompletedChunks[piece]
395 func (t *Torrent) metadataSize() int {
396 return len(t.metadataBytes)
399 func (t *Torrent) makePieces() {
400 t.pieces = make([]Piece, t.info.NumPieces())
401 for i := range t.pieces {
402 piece := &t.pieces[i]
405 piece.noPendingWrites.L = &piece.pendingWritesMutex
407 piece.hash = (*metainfo.Hash)(unsafe.Pointer(
408 unsafe.SliceData(t.info.Pieces[i*sha1.Size : (i+1)*sha1.Size])))
411 beginFile := pieceFirstFileIndex(piece.torrentBeginOffset(), files)
412 endFile := pieceEndFileIndex(piece.torrentEndOffset(), files)
413 piece.files = files[beginFile:endFile]
414 if t.info.FilesArePieceAligned() {
415 numFiles := len(piece.files)
417 panic(fmt.Sprintf("%v:%v", beginFile, endFile))
423 func (t *Torrent) AddPieceLayers(layers map[string]string) (err error) {
427 for _, f := range *t.files {
428 if !f.piecesRoot.Ok {
429 err = fmt.Errorf("no piece root set for file %v", f)
432 compactLayer, ok := layers[string(f.piecesRoot.Value[:])]
433 var hashes [][32]byte
435 hashes, err = merkle.CompactLayerToSliceHashes(compactLayer)
437 err = fmt.Errorf("bad piece layers for file %q: %w", f, err)
440 } else if f.length > t.info.PieceLength {
441 // BEP 52 is pretty strongly worded about this, even though we should be able to
442 // recover: If a v2 torrent is added by magnet link or infohash, we need to fetch piece
443 // layers ourselves anyway, and that's how we can recover from this.
444 t.logger.Levelf(log.Warning, "no piece layers for file %q", f)
447 hashes = [][32]byte{f.piecesRoot.Value}
449 if len(hashes) != f.numPieces() {
450 err = fmt.Errorf("file %q: got %v hashes expected %v", f, len(hashes), f.numPieces())
453 for i := range f.numPieces() {
454 pi := f.BeginPieceIndex() + i
456 // See Torrent.onSetInfo. We want to trigger an initial check if appropriate, if we
457 // didn't yet have a piece hash (can occur with v2 when we don't start with piece
459 if !p.hashV2.Set(hashes[i]).Ok && p.hash == nil {
460 t.queueInitialPieceCheck(pi)
467 // Returns the index of the first file containing the piece. files must be
468 // ordered by offset.
469 func pieceFirstFileIndex(pieceOffset int64, files []*File) int {
470 for i, f := range files {
471 if f.offset+f.length > pieceOffset {
478 // Returns the index after the last file containing the piece. files must be
479 // ordered by offset.
480 func pieceEndFileIndex(pieceEndOffset int64, files []*File) int {
481 for i, f := range files {
482 if f.offset >= pieceEndOffset {
489 func (t *Torrent) cacheLength() {
491 for _, f := range t.info.UpvertedFiles() {
497 // TODO: This shouldn't fail for storage reasons. Instead we should handle storage failure
499 func (t *Torrent) setInfo(info *metainfo.Info) error {
500 if err := validateInfo(info); err != nil {
501 return fmt.Errorf("bad info: %s", err)
503 if t.storageOpener != nil {
505 t.storage, err = t.storageOpener.OpenTorrent(info, *t.canonicalShortInfohash())
507 return fmt.Errorf("error opening torrent storage: %s", err)
513 t._chunksPerRegularPiece = chunkIndexType((pp.Integer(t.usualPieceSize()) + t.chunkSize - 1) / t.chunkSize)
515 t.displayName = "" // Save a few bytes lol.
522 func (t *Torrent) pieceRequestOrderKey(i int) request_strategy.PieceRequestOrderKey {
523 return request_strategy.PieceRequestOrderKey{
524 InfoHash: *t.canonicalShortInfohash(),
529 // This seems to be all the follow-up tasks after info is set, that can't fail.
530 func (t *Torrent) onSetInfo() {
531 t.pieceRequestOrder = rand.Perm(t.numPieces())
532 t.initPieceRequestOrder()
533 MakeSliceWithLength(&t.requestPieceStates, t.numPieces())
534 for i := range t.pieces {
536 // Need to add relativeAvailability before updating piece completion, as that may result in conns
538 if p.relativeAvailability != 0 {
539 panic(p.relativeAvailability)
541 p.relativeAvailability = t.selectivePieceAvailabilityFromPeers(i)
542 t.addRequestOrderPiece(i)
543 t.updatePieceCompletion(i)
544 t.queueInitialPieceCheck(i)
546 t.cl.event.Broadcast()
547 close(t.gotMetainfoC)
548 t.updateWantPeersEvent()
549 t.requestState = make(map[RequestIndex]requestState)
550 t.tryCreateMorePieceHashers()
551 t.iterPeers(func(p *Peer) {
553 p.updateRequests("onSetInfo")
557 // Called when metadata for a torrent becomes available.
558 func (t *Torrent) setInfoBytesLocked(b []byte) error {
559 if t.infoHash.Ok && infohash.HashBytes(b) != t.infoHash.Value {
560 return errors.New("info bytes have wrong v1 hash")
562 var v2Hash g.Option[infohash_v2.T]
564 v2Hash.Set(infohash_v2.HashBytes(b))
565 if v2Hash.Value != t.infoHashV2.Value {
566 return errors.New("info bytes have wrong v2 hash")
569 var info metainfo.Info
570 if err := bencode.Unmarshal(b, &info); err != nil {
571 return fmt.Errorf("error unmarshalling info bytes: %s", err)
573 if !t.infoHashV2.Ok && info.HasV2() {
574 v2Hash.Set(infohash_v2.HashBytes(b))
575 t.infoHashV2.Set(v2Hash.Unwrap())
578 t.metadataCompletedChunks = nil
582 if err := t.setInfo(&info); err != nil {
589 func (t *Torrent) haveAllMetadataPieces() bool {
593 if t.metadataCompletedChunks == nil {
596 for _, have := range t.metadataCompletedChunks {
604 // TODO: Propagate errors to disconnect peer.
605 func (t *Torrent) setMetadataSize(size int) (err error) {
607 // We already know the correct metadata size.
610 if uint32(size) > maxMetadataSize {
611 return log.WithLevel(log.Warning, errors.New("bad size"))
613 if len(t.metadataBytes) == size {
616 t.metadataBytes = make([]byte, size)
617 t.metadataCompletedChunks = make([]bool, (size+(1<<14)-1)/(1<<14))
618 t.metadataChanged.Broadcast()
619 for c := range t.conns {
620 c.requestPendingMetadata()
625 // The current working name for the torrent. Either the name in the info dict,
626 // or a display name given such as by the dn value in a magnet link, or "".
627 func (t *Torrent) name() string {
629 defer t.nameMu.RUnlock()
631 return t.info.BestName()
633 if t.displayName != "" {
636 return "infohash:" + t.canonicalShortInfohash().HexString()
639 func (t *Torrent) pieceState(index pieceIndex) (ret PieceState) {
640 p := &t.pieces[index]
641 ret.Priority = t.piecePriority(index)
642 ret.Completion = p.completion()
643 ret.QueuedForHash = p.queuedForHash()
644 ret.Hashing = p.hashing
645 ret.Checking = ret.QueuedForHash || ret.Hashing
646 ret.Marking = p.marking
647 if !ret.Complete && t.piecePartiallyDownloaded(index) {
653 func (t *Torrent) metadataPieceSize(piece int) int {
654 return metadataPieceSize(len(t.metadataBytes), piece)
657 func (t *Torrent) newMetadataExtensionMessage(c *PeerConn, msgType pp.ExtendedMetadataRequestMsgType, piece int, data []byte) pp.Message {
660 ExtendedID: c.PeerExtensionIDs[pp.ExtensionNameMetadata],
661 ExtendedPayload: append(bencode.MustMarshal(pp.ExtendedMetadataRequestMsg{
663 TotalSize: len(t.metadataBytes),
669 type pieceAvailabilityRun struct {
674 func (me pieceAvailabilityRun) String() string {
675 return fmt.Sprintf("%v(%v)", me.Count, me.Availability)
678 func (t *Torrent) pieceAvailabilityRuns() (ret []pieceAvailabilityRun) {
679 rle := missinggo.NewRunLengthEncoder(func(el interface{}, count uint64) {
680 ret = append(ret, pieceAvailabilityRun{Availability: el.(int), Count: int(count)})
682 for i := range t.pieces {
683 rle.Append(t.pieces[i].availability(), 1)
689 func (t *Torrent) pieceAvailabilityFrequencies() (freqs []int) {
690 freqs = make([]int, t.numActivePeers()+1)
691 for i := range t.pieces {
692 freqs[t.piece(i).availability()]++
697 func (t *Torrent) pieceStateRuns() (ret PieceStateRuns) {
698 rle := missinggo.NewRunLengthEncoder(func(el interface{}, count uint64) {
699 ret = append(ret, PieceStateRun{
700 PieceState: el.(PieceState),
704 for index := range t.pieces {
705 rle.Append(t.pieceState(pieceIndex(index)), 1)
711 // Produces a small string representing a PieceStateRun.
712 func (psr PieceStateRun) String() (ret string) {
713 ret = fmt.Sprintf("%d", psr.Length)
714 ret += func() string {
715 switch psr.Priority {
716 case PiecePriorityNext:
718 case PiecePriorityNormal:
720 case PiecePriorityReadahead:
722 case PiecePriorityNow:
724 case PiecePriorityHigh:
733 if psr.QueuedForHash {
751 func (t *Torrent) writeStatus(w io.Writer) {
753 fmt.Fprintf(w, "Infohash: %s\n", t.infoHash.Value.HexString())
756 fmt.Fprintf(w, "Infohash v2: %s\n", t.infoHashV2.Value.HexString())
758 fmt.Fprintf(w, "Metadata length: %d\n", t.metadataSize())
760 fmt.Fprintf(w, "Metadata have: ")
761 for _, h := range t.metadataCompletedChunks {
762 fmt.Fprintf(w, "%c", func() rune {
772 fmt.Fprintf(w, "Piece length: %s\n",
775 return fmt.Sprintf("%v (%v chunks)",
777 float64(t.usualPieceSize())/float64(t.chunkSize))
784 fmt.Fprintf(w, "Num Pieces: %d (%d completed)\n", t.numPieces(), t.numPiecesCompleted())
785 fmt.Fprintf(w, "Piece States: %s\n", t.pieceStateRuns())
786 // Generates a huge, unhelpful listing when piece availability is very scattered. Prefer
787 // availability frequencies instead.
789 fmt.Fprintf(w, "Piece availability: %v\n", strings.Join(func() (ret []string) {
790 for _, run := range t.pieceAvailabilityRuns() {
791 ret = append(ret, run.String())
796 fmt.Fprintf(w, "Piece availability frequency: %v\n", strings.Join(
797 func() (ret []string) {
798 for avail, freq := range t.pieceAvailabilityFrequencies() {
802 ret = append(ret, fmt.Sprintf("%v: %v", avail, freq))
808 fmt.Fprintf(w, "Reader Pieces:")
809 t.forReaderOffsetPieces(func(begin, end pieceIndex) (again bool) {
810 fmt.Fprintf(w, " %d:%d", begin, end)
815 fmt.Fprintf(w, "Enabled trackers:\n")
817 tw := tabwriter.NewWriter(w, 0, 0, 2, ' ', 0)
818 fmt.Fprintf(tw, " URL\tExtra\n")
819 for _, ta := range slices.Sort(slices.FromMapElems(t.trackerAnnouncers), func(l, r torrentTrackerAnnouncer) bool {
822 var luns, runs url.URL = *lu, *ru
825 var ml missinggo.MultiLess
826 ml.StrictNext(luns.String() == runs.String(), luns.String() < runs.String())
827 ml.StrictNext(lu.String() == ru.String(), lu.String() < ru.String())
829 }).([]torrentTrackerAnnouncer) {
830 fmt.Fprintf(tw, " %q\t%v\n", ta.URL(), ta.statusLine())
835 fmt.Fprintf(w, "DHT Announces: %d\n", t.numDHTAnnounces)
837 dumpStats(w, t.statsLocked())
839 fmt.Fprintf(w, "webseeds:\n")
840 t.writePeerStatuses(w, maps.Values(t.webSeeds))
842 peerConns := maps.Keys(t.conns)
843 // Peers without priorities first, then those with. I'm undecided about how to order peers
844 // without priorities.
845 sort.Slice(peerConns, func(li, ri int) bool {
848 ml := multiless.New()
849 lpp := g.ResultFromTuple(l.peerPriority()).ToOption()
850 rpp := g.ResultFromTuple(r.peerPriority()).ToOption()
851 ml = ml.Bool(lpp.Ok, rpp.Ok)
852 ml = ml.Uint32(rpp.Value, lpp.Value)
856 fmt.Fprintf(w, "%v peer conns:\n", len(peerConns))
857 t.writePeerStatuses(w, g.SliceMap(peerConns, func(pc *PeerConn) *Peer {
862 func (t *Torrent) writePeerStatuses(w io.Writer, peers []*Peer) {
864 for _, c := range peers {
868 w.Write(bytes.TrimRight(
869 bytes.ReplaceAll(buf.Bytes(), []byte("\n"), []byte("\n ")),
874 func (t *Torrent) haveInfo() bool {
878 // Returns a run-time generated MetaInfo that includes the info bytes and
879 // announce-list as currently known to the client.
880 func (t *Torrent) newMetaInfo() metainfo.MetaInfo {
881 return metainfo.MetaInfo{
882 CreationDate: time.Now().Unix(),
883 Comment: "dynamic metainfo from client",
884 CreatedBy: "go.torrent",
885 AnnounceList: t.metainfo.UpvertedAnnounceList().Clone(),
886 InfoBytes: func() []byte {
888 return t.metadataBytes
893 UrlList: func() []string {
894 ret := make([]string, 0, len(t.webSeeds))
895 for url := range t.webSeeds {
896 ret = append(ret, url)
903 // Returns a count of bytes that are not complete in storage, and not pending being written to
904 // storage. This value is from the perspective of the download manager, and may not agree with the
905 // actual state in storage. If you want read data synchronously you should use a Reader. See
906 // https://github.com/anacrolix/torrent/issues/828.
907 func (t *Torrent) BytesMissing() (n int64) {
909 n = t.bytesMissingLocked()
914 func (t *Torrent) bytesMissingLocked() int64 {
918 func iterFlipped(b *roaring.Bitmap, end uint64, cb func(uint32) bool) {
919 roaring.Flip(b, 0, end).Iterate(cb)
922 func (t *Torrent) bytesLeft() (left int64) {
923 iterFlipped(&t._completedPieces, uint64(t.numPieces()), func(x uint32) bool {
924 p := t.piece(pieceIndex(x))
925 left += int64(p.length() - p.numDirtyBytes())
931 // Bytes left to give in tracker announces.
932 func (t *Torrent) bytesLeftAnnounce() int64 {
940 func (t *Torrent) piecePartiallyDownloaded(piece pieceIndex) bool {
941 if t.pieceComplete(piece) {
944 if t.pieceAllDirty(piece) {
947 return t.pieces[piece].hasDirtyChunks()
950 func (t *Torrent) usualPieceSize() int {
951 return int(t.info.PieceLength)
954 func (t *Torrent) numPieces() pieceIndex {
955 return t.info.NumPieces()
958 func (t *Torrent) numPiecesCompleted() (num pieceIndex) {
959 return pieceIndex(t._completedPieces.GetCardinality())
962 func (t *Torrent) close(wg *sync.WaitGroup) (err error) {
964 err = errors.New("already closed")
967 for _, f := range t.onClose {
970 if t.storage != nil {
975 defer t.storageLock.Unlock()
976 if f := t.storage.Close; f != nil {
979 t.logger.WithDefaultLevel(log.Warning).Printf("error closing storage: %v", err1)
984 t.iterPeers(func(p *Peer) {
987 if t.storage != nil {
988 t.deletePieceRequestOrder()
990 t.assertAllPiecesRelativeAvailabilityZero()
992 t.cl.event.Broadcast()
993 t.pieceStateChanges.Close()
994 t.updateWantPeersEvent()
998 func (t *Torrent) assertAllPiecesRelativeAvailabilityZero() {
999 for i := range t.pieces {
1001 if p.relativeAvailability != 0 {
1002 panic(fmt.Sprintf("piece %v has relative availability %v", i, p.relativeAvailability))
1007 func (t *Torrent) requestOffset(r Request) int64 {
1008 return torrentRequestOffset(t.length(), int64(t.usualPieceSize()), r)
1011 // Return the request that would include the given offset into the torrent data. Returns !ok if
1012 // there is no such request.
1013 func (t *Torrent) offsetRequest(off int64) (req Request, ok bool) {
1014 return torrentOffsetRequest(t.length(), t.info.PieceLength, int64(t.chunkSize), off)
1017 func (t *Torrent) writeChunk(piece int, begin int64, data []byte) (err error) {
1018 //defer perf.ScopeTimerErr(&err)()
1019 n, err := t.pieces[piece].Storage().WriteAt(data, begin)
1020 if err == nil && n != len(data) {
1021 err = io.ErrShortWrite
1026 func (t *Torrent) bitfield() (bf []bool) {
1027 bf = make([]bool, t.numPieces())
1028 t._completedPieces.Iterate(func(piece uint32) (again bool) {
1035 func (t *Torrent) pieceNumChunks(piece pieceIndex) chunkIndexType {
1036 return chunkIndexType((t.pieceLength(piece) + t.chunkSize - 1) / t.chunkSize)
1039 func (t *Torrent) chunksPerRegularPiece() chunkIndexType {
1040 return t._chunksPerRegularPiece
1043 func (t *Torrent) numChunks() RequestIndex {
1044 if t.numPieces() == 0 {
1047 return RequestIndex(t.numPieces()-1)*t.chunksPerRegularPiece() + t.pieceNumChunks(t.numPieces()-1)
1050 func (t *Torrent) pendAllChunkSpecs(pieceIndex pieceIndex) {
1051 t.dirtyChunks.RemoveRange(
1052 uint64(t.pieceRequestIndexOffset(pieceIndex)),
1053 uint64(t.pieceRequestIndexOffset(pieceIndex+1)))
1056 func (t *Torrent) pieceLength(piece pieceIndex) pp.Integer {
1057 if t.info.PieceLength == 0 {
1058 // There will be no variance amongst pieces. Only pain.
1061 if t.info.FilesArePieceAligned() {
1063 file := p.mustGetOnlyFile()
1064 if piece == file.EndPieceIndex()-1 {
1065 return pp.Integer(file.length - (p.torrentBeginOffset() - file.offset))
1067 return pp.Integer(t.usualPieceSize())
1069 if piece == t.numPieces()-1 {
1070 ret := pp.Integer(t.length() % t.info.PieceLength)
1075 return pp.Integer(t.info.PieceLength)
1078 func (t *Torrent) smartBanBlockCheckingWriter(piece pieceIndex) *blockCheckingWriter {
1079 return &blockCheckingWriter{
1080 cache: &t.smartBanCache,
1081 requestIndex: t.pieceRequestIndexOffset(piece),
1082 chunkSize: t.chunkSize.Int(),
1086 func (t *Torrent) hashPiece(piece pieceIndex) (
1088 // These are peers that sent us blocks that differ from what we hash here.
1089 differingPeers map[bannableAddr]struct{},
1093 p.waitNoPendingWrites()
1094 storagePiece := p.Storage()
1100 // Does the backend want to do its own hashing?
1101 if i, ok := storagePiece.PieceImpl.(storage.SelfHashing); ok {
1102 var sum metainfo.Hash
1103 // log.Printf("A piece decided to self-hash: %d", piece)
1104 sum, err = i.SelfHash()
1105 correct = sum == *p.hash
1106 // Can't do smart banning without reading the piece. The smartBanCache is still cleared
1107 // in pieceHasher regardless.
1111 } else if p.hashV2.Ok {
1112 h = merkle.NewHash()
1117 const logPieceContents = false
1118 smartBanWriter := t.smartBanBlockCheckingWriter(piece)
1119 writers := []io.Writer{h, smartBanWriter}
1120 var examineBuf bytes.Buffer
1121 if logPieceContents {
1122 writers = append(writers, &examineBuf)
1124 _, err = storagePiece.WriteTo(io.MultiWriter(writers...))
1125 if logPieceContents {
1126 t.logger.WithDefaultLevel(log.Debug).Printf("hashed %q with copy err %v", examineBuf.Bytes(), err)
1128 smartBanWriter.Flush()
1129 differingPeers = smartBanWriter.badPeers
1132 n := len(h.Sum(sum[:0]))
1136 correct = sum == *p.hash
1137 } else if p.hashV2.Ok {
1139 n := len(h.Sum(sum[:0]))
1143 correct = sum == p.hashV2.Value
1150 func (t *Torrent) haveAnyPieces() bool {
1151 return !t._completedPieces.IsEmpty()
1154 func (t *Torrent) haveAllPieces() bool {
1158 return t._completedPieces.GetCardinality() == bitmap.BitRange(t.numPieces())
1161 func (t *Torrent) havePiece(index pieceIndex) bool {
1162 return t.haveInfo() && t.pieceComplete(index)
1165 func (t *Torrent) maybeDropMutuallyCompletePeer(
1166 // I'm not sure about taking peer here, not all peer implementations actually drop. Maybe that's
1170 if !t.cl.config.DropMutuallyCompletePeers {
1173 if !t.haveAllPieces() {
1176 if all, known := p.peerHasAllPieces(); !(known && all) {
1182 p.logger.Levelf(log.Debug, "is mutually complete; dropping")
1186 func (t *Torrent) haveChunk(r Request) (ret bool) {
1188 // log.Println("have chunk", r, ret)
1193 if t.pieceComplete(pieceIndex(r.Index)) {
1196 p := &t.pieces[r.Index]
1197 return !p.pendingChunk(r.ChunkSpec, t.chunkSize)
1200 func chunkIndexFromChunkSpec(cs ChunkSpec, chunkSize pp.Integer) chunkIndexType {
1201 return chunkIndexType(cs.Begin / chunkSize)
1204 func (t *Torrent) wantPieceIndex(index pieceIndex) bool {
1205 return !t._pendingPieces.IsEmpty() && t._pendingPieces.Contains(uint32(index))
1208 // A pool of []*PeerConn, to reduce allocations in functions that need to index or sort Torrent
1209 // conns (which is a map).
1210 var peerConnSlices sync.Pool
1212 func getPeerConnSlice(cap int) []*PeerConn {
1213 getInterface := peerConnSlices.Get()
1214 if getInterface == nil {
1215 return make([]*PeerConn, 0, cap)
1217 return getInterface.([]*PeerConn)[:0]
1221 // Calls the given function with a slice of unclosed conns. It uses a pool to reduce allocations as
1222 // this is a frequent occurrence.
1223 func (t *Torrent) withUnclosedConns(f func([]*PeerConn)) {
1224 sl := t.appendUnclosedConns(getPeerConnSlice(len(t.conns)))
1226 peerConnSlices.Put(sl)
1229 func (t *Torrent) worstBadConnFromSlice(opts worseConnLensOpts, sl []*PeerConn) *PeerConn {
1230 wcs := worseConnSlice{conns: sl}
1233 for wcs.Len() != 0 {
1234 c := heap.Pop(&wcs).(*PeerConn)
1235 if opts.incomingIsBad && !c.outgoing {
1238 if opts.outgoingIsBad && c.outgoing {
1241 if c._stats.ChunksReadWasted.Int64() >= 6 && c._stats.ChunksReadWasted.Int64() > c._stats.ChunksReadUseful.Int64() {
1244 // If the connection is in the worst half of the established
1245 // connection quota and is older than a minute.
1246 if wcs.Len() >= (t.maxEstablishedConns+1)/2 {
1247 // Give connections 1 minute to prove themselves.
1248 if time.Since(c.completedHandshake) > time.Minute {
1256 // The worst connection is one that hasn't been sent, or sent anything useful for the longest. A bad
1257 // connection is one that usually sends us unwanted pieces, or has been in the worse half of the
1258 // established connections for more than a minute. This is O(n log n). If there was a way to not
1259 // consider the position of a conn relative to the total number, it could be reduced to O(n).
1260 func (t *Torrent) worstBadConn(opts worseConnLensOpts) (ret *PeerConn) {
1261 t.withUnclosedConns(func(ucs []*PeerConn) {
1262 ret = t.worstBadConnFromSlice(opts, ucs)
1267 type PieceStateChange struct {
1272 func (t *Torrent) publishPieceStateChange(piece pieceIndex) {
1273 t.cl._mu.Defer(func() {
1274 cur := t.pieceState(piece)
1275 p := &t.pieces[piece]
1276 if cur != p.publicPieceState {
1277 p.publicPieceState = cur
1278 t.pieceStateChanges.Publish(PieceStateChange{
1286 func (t *Torrent) pieceNumPendingChunks(piece pieceIndex) pp.Integer {
1287 if t.pieceComplete(piece) {
1290 return pp.Integer(t.pieceNumChunks(piece) - t.pieces[piece].numDirtyChunks())
1293 func (t *Torrent) pieceAllDirty(piece pieceIndex) bool {
1294 return t.pieces[piece].allChunksDirty()
1297 func (t *Torrent) readersChanged() {
1298 t.updateReaderPieces()
1299 t.updateAllPiecePriorities("Torrent.readersChanged")
1302 func (t *Torrent) updateReaderPieces() {
1303 t._readerNowPieces, t._readerReadaheadPieces = t.readerPiecePriorities()
1306 func (t *Torrent) readerPosChanged(from, to pieceRange) {
1310 t.updateReaderPieces()
1311 // Order the ranges, high and low.
1313 if l.begin > h.begin {
1316 if l.end < h.begin {
1317 // Two distinct ranges.
1318 t.updatePiecePriorities(l.begin, l.end, "Torrent.readerPosChanged")
1319 t.updatePiecePriorities(h.begin, h.end, "Torrent.readerPosChanged")
1326 t.updatePiecePriorities(l.begin, end, "Torrent.readerPosChanged")
1330 func (t *Torrent) maybeNewConns() {
1331 // Tickle the accept routine.
1332 t.cl.event.Broadcast()
1336 func (t *Torrent) onPiecePendingTriggers(piece pieceIndex, reason string) {
1337 if t._pendingPieces.Contains(uint32(piece)) {
1338 t.iterPeers(func(c *Peer) {
1339 // if c.requestState.Interested {
1342 if !c.isLowOnRequests() {
1345 if !c.peerHasPiece(piece) {
1348 if c.requestState.Interested && c.peerChoking && !c.peerAllowedFast.Contains(piece) {
1351 c.updateRequests(reason)
1355 t.publishPieceStateChange(piece)
1358 func (t *Torrent) updatePiecePriorityNoTriggers(piece pieceIndex) (pendingChanged bool) {
1359 if !t.closed.IsSet() {
1360 // It would be possible to filter on pure-priority changes here to avoid churning the piece
1362 t.updatePieceRequestOrderPiece(piece)
1364 p := &t.pieces[piece]
1365 newPrio := p.uncachedPriority()
1366 // t.logger.Printf("torrent %p: piece %d: uncached priority: %v", t, piece, newPrio)
1367 if newPrio == PiecePriorityNone {
1368 return t._pendingPieces.CheckedRemove(uint32(piece))
1370 return t._pendingPieces.CheckedAdd(uint32(piece))
1374 func (t *Torrent) updatePiecePriority(piece pieceIndex, reason string) {
1375 if t.updatePiecePriorityNoTriggers(piece) && !t.disableTriggers {
1376 t.onPiecePendingTriggers(piece, reason)
1378 t.updatePieceRequestOrderPiece(piece)
1381 func (t *Torrent) updateAllPiecePriorities(reason string) {
1382 t.updatePiecePriorities(0, t.numPieces(), reason)
1385 // Update all piece priorities in one hit. This function should have the same
1386 // output as updatePiecePriority, but across all pieces.
1387 func (t *Torrent) updatePiecePriorities(begin, end pieceIndex, reason string) {
1388 for i := begin; i < end; i++ {
1389 t.updatePiecePriority(i, reason)
1393 // Returns the range of pieces [begin, end) that contains the extent of bytes.
1394 func (t *Torrent) byteRegionPieces(off, size int64) (begin, end pieceIndex) {
1395 if off >= t.length() {
1405 begin = pieceIndex(off / t.info.PieceLength)
1406 end = pieceIndex((off + size + t.info.PieceLength - 1) / t.info.PieceLength)
1407 if end > pieceIndex(t.info.NumPieces()) {
1408 end = pieceIndex(t.info.NumPieces())
1413 // Returns true if all iterations complete without breaking. Returns the read regions for all
1414 // readers. The reader regions should not be merged as some callers depend on this method to
1415 // enumerate readers.
1416 func (t *Torrent) forReaderOffsetPieces(f func(begin, end pieceIndex) (more bool)) (all bool) {
1417 for r := range t.readers {
1419 if p.begin >= p.end {
1422 if !f(p.begin, p.end) {
1429 func (t *Torrent) piecePriority(piece pieceIndex) piecePriority {
1430 return t.piece(piece).uncachedPriority()
1433 func (t *Torrent) pendRequest(req RequestIndex) {
1434 t.piece(t.pieceIndexOfRequestIndex(req)).pendChunkIndex(req % t.chunksPerRegularPiece())
1437 func (t *Torrent) pieceCompletionChanged(piece pieceIndex, reason string) {
1438 t.cl.event.Broadcast()
1439 if t.pieceComplete(piece) {
1440 t.onPieceCompleted(piece)
1442 t.onIncompletePiece(piece)
1444 t.updatePiecePriority(piece, reason)
1447 func (t *Torrent) numReceivedConns() (ret int) {
1448 for c := range t.conns {
1449 if c.Discovery == PeerSourceIncoming {
1456 func (t *Torrent) numOutgoingConns() (ret int) {
1457 for c := range t.conns {
1465 func (t *Torrent) maxHalfOpen() int {
1466 // Note that if we somehow exceed the maximum established conns, we want
1467 // the negative value to have an effect.
1468 establishedHeadroom := int64(t.maxEstablishedConns - len(t.conns))
1469 extraIncoming := int64(t.numReceivedConns() - t.maxEstablishedConns/2)
1470 // We want to allow some experimentation with new peers, and to try to
1471 // upset an oversupply of received connections.
1473 max(5, extraIncoming)+establishedHeadroom,
1474 int64(t.cl.config.HalfOpenConnsPerTorrent),
1478 func (t *Torrent) openNewConns() (initiated int) {
1479 defer t.updateWantPeersEvent()
1480 for t.peers.Len() != 0 {
1481 if !t.wantOutgoingConns() {
1484 if len(t.halfOpen) >= t.maxHalfOpen() {
1487 if len(t.cl.dialers) == 0 {
1490 if t.cl.numHalfOpen >= t.cl.config.TotalHalfOpenConns {
1493 p := t.peers.PopMax()
1494 opts := outgoingConnOpts{
1497 requireRendezvous: false,
1498 skipHolepunchRendezvous: false,
1499 receivedHolepunchConnect: false,
1500 HeaderObfuscationPolicy: t.cl.config.HeaderObfuscationPolicy,
1502 initiateConn(opts, false)
1508 func (t *Torrent) updatePieceCompletion(piece pieceIndex) bool {
1510 uncached := t.pieceCompleteUncached(piece)
1511 cached := p.completion()
1512 changed := cached != uncached
1513 complete := uncached.Complete
1514 p.storageCompletionOk = uncached.Ok
1517 t._completedPieces.Add(x)
1520 t._completedPieces.Remove(x)
1522 p.t.updatePieceRequestOrderPiece(piece)
1524 if complete && len(p.dirtiers) != 0 {
1525 t.logger.Printf("marked piece %v complete but still has dirtiers", piece)
1529 // "piece completion changed",
1530 // slog.Int("piece", piece),
1531 // slog.Any("from", cached),
1532 // slog.Any("to", uncached))
1533 t.pieceCompletionChanged(piece, "Torrent.updatePieceCompletion")
1538 // Non-blocking read. Client lock is not required.
1539 func (t *Torrent) readAt(b []byte, off int64) (n int, err error) {
1541 p := &t.pieces[off/t.info.PieceLength]
1542 p.waitNoPendingWrites()
1544 n1, err = p.Storage().ReadAt(b, off-p.Info().Offset())
1555 // Returns an error if the metadata was completed, but couldn't be set for some reason. Blame it on
1556 // the last peer to contribute. TODO: Actually we shouldn't blame peers for failure to open storage
1557 // etc. Also we should probably cached metadata pieces per-Peer, to isolate failure appropriately.
1558 func (t *Torrent) maybeCompleteMetadata() error {
1563 if !t.haveAllMetadataPieces() {
1564 // Don't have enough metadata pieces.
1567 err := t.setInfoBytesLocked(t.metadataBytes)
1569 t.invalidateMetadata()
1570 return fmt.Errorf("error setting info bytes: %s", err)
1572 if t.cl.config.Debug {
1573 t.logger.Printf("%s: got metadata from peers", t)
1578 func (t *Torrent) readerPiecePriorities() (now, readahead bitmap.Bitmap) {
1579 t.forReaderOffsetPieces(func(begin, end pieceIndex) bool {
1581 now.Add(bitmap.BitIndex(begin))
1582 readahead.AddRange(bitmap.BitRange(begin)+1, bitmap.BitRange(end))
1589 func (t *Torrent) needData() bool {
1590 if t.closed.IsSet() {
1596 return !t._pendingPieces.IsEmpty()
1599 func appendMissingStrings(old, new []string) (ret []string) {
1602 for _, n := range new {
1603 for _, o := range old {
1608 ret = append(ret, n)
1613 func appendMissingTrackerTiers(existing [][]string, minNumTiers int) (ret [][]string) {
1615 for minNumTiers > len(ret) {
1616 ret = append(ret, nil)
1621 func (t *Torrent) addTrackers(announceList [][]string) {
1622 fullAnnounceList := &t.metainfo.AnnounceList
1623 t.metainfo.AnnounceList = appendMissingTrackerTiers(*fullAnnounceList, len(announceList))
1624 for tierIndex, trackerURLs := range announceList {
1625 (*fullAnnounceList)[tierIndex] = appendMissingStrings((*fullAnnounceList)[tierIndex], trackerURLs)
1627 t.startMissingTrackerScrapers()
1628 t.updateWantPeersEvent()
1631 // Don't call this before the info is available.
1632 func (t *Torrent) bytesCompleted() int64 {
1636 return t.length() - t.bytesLeft()
1639 func (t *Torrent) SetInfoBytes(b []byte) (err error) {
1642 return t.setInfoBytesLocked(b)
1645 // Returns true if connection is removed from torrent.Conns.
1646 func (t *Torrent) deletePeerConn(c *PeerConn) (ret bool) {
1647 if !c.closed.IsSet() {
1648 panic("connection is not closed")
1649 // There are behaviours prevented by the closed state that will fail
1650 // if the connection has been deleted.
1654 // Avoid adding a drop event more than once. Probably we should track whether we've generated
1655 // the drop event against the PexConnState instead.
1657 if !t.cl.config.DisablePEX {
1661 torrent.Add("deleted connections", 1)
1662 c.deleteAllRequests("Torrent.deletePeerConn")
1663 t.assertPendingRequests()
1664 if t.numActivePeers() == 0 && len(t.connsWithAllPieces) != 0 {
1665 panic(t.connsWithAllPieces)
1670 func (t *Torrent) decPeerPieceAvailability(p *Peer) {
1671 if t.deleteConnWithAllPieces(p) {
1677 p.peerPieces().Iterate(func(i uint32) bool {
1678 p.t.decPieceAvailability(pieceIndex(i))
1683 func (t *Torrent) assertPendingRequests() {
1687 // var actual pendingRequests
1688 // if t.haveInfo() {
1689 // actual.m = make([]int, t.numChunks())
1691 // t.iterPeers(func(p *Peer) {
1692 // p.requestState.Requests.Iterate(func(x uint32) bool {
1697 // diff := cmp.Diff(actual.m, t.pendingRequests.m)
1703 func (t *Torrent) dropConnection(c *PeerConn) {
1704 t.cl.event.Broadcast()
1706 if t.deletePeerConn(c) {
1711 // Peers as in contact information for dialing out.
1712 func (t *Torrent) wantPeers() bool {
1713 if t.closed.IsSet() {
1716 if t.peers.Len() > t.cl.config.TorrentPeersLowWater {
1719 return t.wantOutgoingConns()
1722 func (t *Torrent) updateWantPeersEvent() {
1724 t.wantPeersEvent.Set()
1726 t.wantPeersEvent.Clear()
1730 // Returns whether the client should make effort to seed the torrent.
1731 func (t *Torrent) seeding() bool {
1733 if t.closed.IsSet() {
1736 if t.dataUploadDisallowed {
1739 if cl.config.NoUpload {
1742 if !cl.config.Seed {
1745 if cl.config.DisableAggressiveUpload && t.needData() {
1751 func (t *Torrent) onWebRtcConn(
1752 c datachannel.ReadWriteCloser,
1753 dcc webtorrent.DataChannelContext,
1756 netConn := webrtcNetConn{
1758 DataChannelContext: dcc,
1760 peerRemoteAddr := netConn.RemoteAddr()
1761 //t.logger.Levelf(log.Critical, "onWebRtcConn remote addr: %v", peerRemoteAddr)
1762 if t.cl.badPeerAddr(peerRemoteAddr) {
1765 localAddrIpPort := missinggo.IpPortFromNetAddr(netConn.LocalAddr())
1766 pc, err := t.cl.initiateProtocolHandshakes(
1767 context.Background(),
1772 outgoing: dcc.LocalOffered,
1773 remoteAddr: peerRemoteAddr,
1774 localPublicAddr: localAddrIpPort,
1775 network: webrtcNetwork,
1776 connString: fmt.Sprintf("webrtc offer_id %x: %v", dcc.OfferId, regularNetConnPeerConnConnString(netConn)),
1780 t.logger.WithDefaultLevel(log.Error).Printf("error in handshaking webrtc connection: %v", err)
1783 if dcc.LocalOffered {
1784 pc.Discovery = PeerSourceTracker
1786 pc.Discovery = PeerSourceIncoming
1788 pc.conn.SetWriteDeadline(time.Time{})
1791 err = t.runHandshookConn(pc)
1793 t.logger.WithDefaultLevel(log.Debug).Printf("error running handshook webrtc conn: %v", err)
1797 func (t *Torrent) logRunHandshookConn(pc *PeerConn, logAll bool, level log.Level) {
1798 err := t.runHandshookConn(pc)
1799 if err != nil || logAll {
1800 t.logger.WithDefaultLevel(level).Levelf(log.ErrorLevel(err), "error running handshook conn: %v", err)
1804 func (t *Torrent) runHandshookConnLoggingErr(pc *PeerConn) {
1805 t.logRunHandshookConn(pc, false, log.Debug)
1808 func (t *Torrent) startWebsocketAnnouncer(u url.URL, shortInfohash [20]byte) torrentTrackerAnnouncer {
1809 wtc, release := t.cl.websocketTrackers.Get(u.String(), shortInfohash)
1810 // This needs to run before the Torrent is dropped from the Client, to prevent a new
1811 // webtorrent.TrackerClient for the same info hash before the old one is cleaned up.
1812 t.onClose = append(t.onClose, release)
1813 wst := websocketTrackerStatus{u, wtc}
1815 err := wtc.Announce(tracker.Started, shortInfohash)
1817 t.logger.WithDefaultLevel(log.Warning).Printf(
1818 "error in initial announce to %q: %v",
1826 func (t *Torrent) startScrapingTracker(_url string) {
1830 u, err := url.Parse(_url)
1832 // URLs with a leading '*' appear to be a uTorrent convention to disable trackers.
1834 t.logger.Levelf(log.Warning, "error parsing tracker url: %v", err)
1838 if u.Scheme == "udp" {
1840 t.startScrapingTracker(u.String())
1842 t.startScrapingTracker(u.String())
1846 t.startScrapingTrackerWithInfohash(u, _url, t.infoHash.Value)
1848 if t.infoHashV2.Ok {
1849 t.startScrapingTrackerWithInfohash(u, _url, *t.infoHashV2.Value.ToShort())
1853 func (t *Torrent) startScrapingTrackerWithInfohash(u *url.URL, urlStr string, shortInfohash [20]byte) {
1854 announcerKey := torrentTrackerAnnouncerKey{
1855 shortInfohash: shortInfohash,
1858 if _, ok := t.trackerAnnouncers[announcerKey]; ok {
1861 sl := func() torrentTrackerAnnouncer {
1864 if t.cl.config.DisableWebtorrent {
1867 return t.startWebsocketAnnouncer(*u, shortInfohash)
1869 if t.cl.config.DisableIPv4Peers || t.cl.config.DisableIPv4 {
1873 if t.cl.config.DisableIPv6 {
1877 newAnnouncer := &trackerScraper{
1878 shortInfohash: shortInfohash,
1881 lookupTrackerIp: t.cl.config.LookupTrackerIp,
1883 go newAnnouncer.Run()
1889 g.MakeMapIfNil(&t.trackerAnnouncers)
1890 if g.MapInsert(t.trackerAnnouncers, announcerKey, sl).Ok {
1891 panic("tracker announcer already exists")
1895 // Adds and starts tracker scrapers for tracker URLs that aren't already
1897 func (t *Torrent) startMissingTrackerScrapers() {
1898 if t.cl.config.DisableTrackers {
1901 t.startScrapingTracker(t.metainfo.Announce)
1902 for _, tier := range t.metainfo.AnnounceList {
1903 for _, url := range tier {
1904 t.startScrapingTracker(url)
1909 // Returns an AnnounceRequest with fields filled out to defaults and current
1911 func (t *Torrent) announceRequest(
1912 event tracker.AnnounceEvent,
1913 shortInfohash [20]byte,
1914 ) tracker.AnnounceRequest {
1915 // Note that IPAddress is not set. It's set for UDP inside the tracker code, since it's
1916 // dependent on the network in use.
1917 return tracker.AnnounceRequest{
1919 NumWant: func() int32 {
1920 if t.wantPeers() && len(t.cl.dialers) > 0 {
1921 // Windozer has UDP packet limit. See:
1922 // https://github.com/anacrolix/torrent/issues/764
1928 Port: uint16(t.cl.incomingPeerPort()),
1929 PeerId: t.cl.peerID,
1930 InfoHash: shortInfohash,
1931 Key: t.cl.announceKey(),
1933 // The following are vaguely described in BEP 3.
1935 Left: t.bytesLeftAnnounce(),
1936 Uploaded: t.stats.BytesWrittenData.Int64(),
1937 // There's no mention of wasted or unwanted download in the BEP.
1938 Downloaded: t.stats.BytesReadUsefulData.Int64(),
1942 // Adds peers revealed in an announce until the announce ends, or we have
1944 func (t *Torrent) consumeDhtAnnouncePeers(pvs <-chan dht.PeersValues) {
1946 for v := range pvs {
1949 for _, cp := range v.Peers {
1951 // Can't do anything with this.
1954 if t.addPeer(PeerInfo{
1955 Addr: ipPortAddr{cp.IP, cp.Port},
1956 Source: PeerSourceDhtGetPeers,
1963 // log.Printf("added %v peers from dht for %v", added, t.InfoHash().HexString())
1968 // Announce using the provided DHT server. Peers are consumed automatically. done is closed when the
1969 // announce ends. stop will force the announce to end. This interface is really old-school, and
1970 // calls a private one that is much more modern. Both v1 and v2 info hashes are announced if they
1972 func (t *Torrent) AnnounceToDht(s DhtServer) (done <-chan struct{}, stop func(), err error) {
1975 t.eachShortInfohash(func(short [20]byte) {
1976 ihs = append(ihs, short)
1979 ctx, stop := context.WithCancel(context.Background())
1980 eg, ctx := errgroup.WithContext(ctx)
1981 for _, ih := range ihs {
1983 ann, err = s.Announce(ih, t.cl.incomingPeerPort(), true)
1988 eg.Go(func() error {
1989 return t.dhtAnnounceConsumer(ctx, ann)
1992 _done := make(chan struct{})
2003 // Announce using the provided DHT server. Peers are consumed automatically. done is closed when the
2004 // announce ends. stop will force the announce to end.
2005 func (t *Torrent) dhtAnnounceConsumer(
2006 ctx context.Context,
2012 done := make(chan struct{})
2015 t.consumeDhtAnnouncePeers(ps.Peers())
2019 return context.Cause(ctx)
2025 func (t *Torrent) timeboxedAnnounceToDht(s DhtServer) error {
2026 _, stop, err := t.AnnounceToDht(s)
2031 case <-t.closed.Done():
2032 case <-time.After(5 * time.Minute):
2038 func (t *Torrent) dhtAnnouncer(s DhtServer) {
2044 if t.closed.IsSet() {
2047 // We're also announcing ourselves as a listener, so we don't just want peer addresses.
2048 // TODO: We can include the announce_peer step depending on whether we can receive
2049 // inbound connections. We should probably only announce once every 15 mins too.
2050 if !t.wantAnyConns() {
2053 // TODO: Determine if there's a listener on the port we're announcing.
2054 if len(cl.dialers) == 0 && len(cl.listeners) == 0 {
2065 err := t.timeboxedAnnounceToDht(s)
2067 t.logger.WithDefaultLevel(log.Warning).Printf("error announcing %q to DHT: %s", t, err)
2073 func (t *Torrent) addPeers(peers []PeerInfo) (added int) {
2074 for _, p := range peers {
2082 // The returned TorrentStats may require alignment in memory. See
2083 // https://github.com/anacrolix/torrent/issues/383.
2084 func (t *Torrent) Stats() TorrentStats {
2086 defer t.cl.rUnlock()
2087 return t.statsLocked()
2090 func (t *Torrent) statsLocked() (ret TorrentStats) {
2091 ret.ActivePeers = len(t.conns)
2092 ret.HalfOpenPeers = len(t.halfOpen)
2093 ret.PendingPeers = t.peers.Len()
2094 ret.TotalPeers = t.numTotalPeers()
2095 ret.ConnectedSeeders = 0
2096 for c := range t.conns {
2097 if all, ok := c.peerHasAllPieces(); all && ok {
2098 ret.ConnectedSeeders++
2101 ret.ConnStats = t.stats.Copy()
2102 ret.PiecesComplete = t.numPiecesCompleted()
2106 // The total number of peers in the torrent.
2107 func (t *Torrent) numTotalPeers() int {
2108 peers := make(map[string]struct{})
2109 for conn := range t.conns {
2110 ra := conn.conn.RemoteAddr()
2112 // It's been closed and doesn't support RemoteAddr.
2115 peers[ra.String()] = struct{}{}
2117 for addr := range t.halfOpen {
2118 peers[addr] = struct{}{}
2120 t.peers.Each(func(peer PeerInfo) {
2121 peers[peer.Addr.String()] = struct{}{}
2126 // Reconcile bytes transferred before connection was associated with a
2128 func (t *Torrent) reconcileHandshakeStats(c *Peer) {
2129 if c._stats != (ConnStats{
2130 // Handshakes should only increment these fields:
2131 BytesWritten: c._stats.BytesWritten,
2132 BytesRead: c._stats.BytesRead,
2136 c.postHandshakeStats(func(cs *ConnStats) {
2137 cs.BytesRead.Add(c._stats.BytesRead.Int64())
2138 cs.BytesWritten.Add(c._stats.BytesWritten.Int64())
2140 c.reconciledHandshakeStats = true
2143 // Returns true if the connection is added.
2144 func (t *Torrent) addPeerConn(c *PeerConn) (err error) {
2147 torrent.Add("added connections", 1)
2150 if t.closed.IsSet() {
2151 return errors.New("torrent closed")
2153 for c0 := range t.conns {
2154 if c.PeerID != c0.PeerID {
2157 if !t.cl.config.DropDuplicatePeerIds {
2160 if c.hasPreferredNetworkOver(c0) {
2162 t.deletePeerConn(c0)
2164 return errors.New("existing connection preferred")
2167 if len(t.conns) >= t.maxEstablishedConns {
2168 numOutgoing := t.numOutgoingConns()
2169 numIncoming := len(t.conns) - numOutgoing
2170 c := t.worstBadConn(worseConnLensOpts{
2171 // We've already established that we have too many connections at this point, so we just
2172 // need to match what kind we have too many of vs. what we're trying to add now.
2173 incomingIsBad: (numIncoming-numOutgoing > 1) && c.outgoing,
2174 outgoingIsBad: (numOutgoing-numIncoming > 1) && !c.outgoing,
2177 return errors.New("don't want conn")
2182 if len(t.conns) >= t.maxEstablishedConns {
2185 t.conns[c] = struct{}{}
2186 t.cl.event.Broadcast()
2187 // We'll never receive the "p" extended handshake parameter.
2188 if !t.cl.config.DisablePEX && !c.PeerExtensionBytes.SupportsExtended() {
2194 func (t *Torrent) newConnsAllowed() bool {
2195 if !t.networkingEnabled.Bool() {
2198 if t.closed.IsSet() {
2201 if !t.needData() && (!t.seeding() || !t.haveAnyPieces()) {
2207 func (t *Torrent) wantAnyConns() bool {
2208 if !t.networkingEnabled.Bool() {
2211 if t.closed.IsSet() {
2214 if !t.needData() && (!t.seeding() || !t.haveAnyPieces()) {
2217 return len(t.conns) < t.maxEstablishedConns
2220 func (t *Torrent) wantOutgoingConns() bool {
2221 if !t.newConnsAllowed() {
2224 if len(t.conns) < t.maxEstablishedConns {
2227 numIncomingConns := len(t.conns) - t.numOutgoingConns()
2228 return t.worstBadConn(worseConnLensOpts{
2229 incomingIsBad: numIncomingConns-t.numOutgoingConns() > 1,
2230 outgoingIsBad: false,
2234 func (t *Torrent) wantIncomingConns() bool {
2235 if !t.newConnsAllowed() {
2238 if len(t.conns) < t.maxEstablishedConns {
2241 numIncomingConns := len(t.conns) - t.numOutgoingConns()
2242 return t.worstBadConn(worseConnLensOpts{
2243 incomingIsBad: false,
2244 outgoingIsBad: t.numOutgoingConns()-numIncomingConns > 1,
2248 func (t *Torrent) SetMaxEstablishedConns(max int) (oldMax int) {
2251 oldMax = t.maxEstablishedConns
2252 t.maxEstablishedConns = max
2253 wcs := worseConnSlice{
2254 conns: t.appendConns(nil, func(*PeerConn) bool {
2258 wcs.initKeys(worseConnLensOpts{})
2260 for len(t.conns) > t.maxEstablishedConns && wcs.Len() > 0 {
2261 t.dropConnection(heap.Pop(&wcs).(*PeerConn))
2267 func (t *Torrent) pieceHashed(piece pieceIndex, passed bool, hashIoErr error) {
2268 t.logger.LazyLog(log.Debug, func() log.Msg {
2269 return log.Fstr("hashed piece %d (passed=%t)", piece, passed)
2273 t.cl.event.Broadcast()
2274 if t.closed.IsSet() {
2278 // Don't score the first time a piece is hashed, it could be an initial check.
2279 if p.storageCompletionOk {
2281 pieceHashedCorrect.Add(1)
2284 "piece %d failed hash: %d connections contributed", piece, len(p.dirtiers),
2285 ).AddValues(t, p).LogLevel(log.Info, t.logger)
2286 pieceHashedNotCorrect.Add(1)
2291 t.publishPieceStateChange(piece)
2294 t.publishPieceStateChange(piece)
2298 if len(p.dirtiers) != 0 {
2299 // Don't increment stats above connection-level for every involved connection.
2300 t.allStats((*ConnStats).incrementPiecesDirtiedGood)
2302 for c := range p.dirtiers {
2303 c._stats.incrementPiecesDirtiedGood()
2305 t.clearPieceTouchers(piece)
2306 hasDirty := p.hasDirtyChunks()
2309 p.Flush() // You can be synchronous here!
2311 err := p.Storage().MarkComplete()
2313 t.logger.Levelf(log.Warning, "%T: error marking piece complete %d: %s", t.storage, piece, err)
2317 if t.closed.IsSet() {
2320 t.pendAllChunkSpecs(piece)
2322 if len(p.dirtiers) != 0 && p.allChunksDirty() && hashIoErr == nil {
2323 // Peers contributed to all the data for this piece hash failure, and the failure was
2324 // not due to errors in the storage (such as data being dropped in a cache).
2326 // Increment Torrent and above stats, and then specific connections.
2327 t.allStats((*ConnStats).incrementPiecesDirtiedBad)
2328 for c := range p.dirtiers {
2329 // Y u do dis peer?!
2330 c.stats().incrementPiecesDirtiedBad()
2333 bannableTouchers := make([]*Peer, 0, len(p.dirtiers))
2334 for c := range p.dirtiers {
2336 bannableTouchers = append(bannableTouchers, c)
2339 t.clearPieceTouchers(piece)
2340 slices.Sort(bannableTouchers, connLessTrusted)
2342 if t.cl.config.Debug {
2344 "bannable conns by trust for piece %d: %v",
2346 func() (ret []connectionTrust) {
2347 for _, c := range bannableTouchers {
2348 ret = append(ret, c.trust())
2355 if len(bannableTouchers) >= 1 {
2356 c := bannableTouchers[0]
2357 if len(bannableTouchers) != 1 {
2358 t.logger.Levelf(log.Debug, "would have banned %v for touching piece %v after failed piece check", c.remoteIp(), piece)
2360 // Turns out it's still useful to ban peers like this because if there's only a
2361 // single peer for a piece, and we never progress that piece to completion, we
2362 // will never smart-ban them. Discovered in
2363 // https://github.com/anacrolix/torrent/issues/715.
2364 t.logger.Levelf(log.Warning, "banning %v for being sole dirtier of piece %v after failed piece check", c, piece)
2369 t.onIncompletePiece(piece)
2370 p.Storage().MarkNotComplete()
2372 t.updatePieceCompletion(piece)
2375 func (t *Torrent) cancelRequestsForPiece(piece pieceIndex) {
2376 start := t.pieceRequestIndexOffset(piece)
2377 end := start + t.pieceNumChunks(piece)
2378 for ri := start; ri < end; ri++ {
2383 func (t *Torrent) onPieceCompleted(piece pieceIndex) {
2384 t.pendAllChunkSpecs(piece)
2385 t.cancelRequestsForPiece(piece)
2386 t.piece(piece).readerCond.Broadcast()
2387 for conn := range t.conns {
2389 t.maybeDropMutuallyCompletePeer(conn)
2393 // Called when a piece is found to be not complete.
2394 func (t *Torrent) onIncompletePiece(piece pieceIndex) {
2395 if t.pieceAllDirty(piece) {
2396 t.pendAllChunkSpecs(piece)
2398 if !t.wantPieceIndex(piece) {
2399 // t.logger.Printf("piece %d incomplete and unwanted", piece)
2402 // We could drop any connections that we told we have a piece that we
2403 // don't here. But there's a test failure, and it seems clients don't care
2404 // if you request pieces that you already claim to have. Pruning bad
2405 // connections might just remove any connections that aren't treating us
2406 // favourably anyway.
2408 // for c := range t.conns {
2409 // if c.sentHave(piece) {
2413 t.iterPeers(func(conn *Peer) {
2414 if conn.peerHasPiece(piece) {
2415 conn.updateRequests("piece incomplete")
2420 func (t *Torrent) tryCreateMorePieceHashers() {
2421 for !t.closed.IsSet() && t.activePieceHashes < t.cl.config.PieceHashersPerTorrent && t.tryCreatePieceHasher() {
2425 func (t *Torrent) tryCreatePieceHasher() bool {
2426 if t.storage == nil {
2429 pi, ok := t.getPieceToHash()
2434 t.piecesQueuedForHash.Remove(bitmap.BitIndex(pi))
2436 t.publishPieceStateChange(pi)
2437 t.updatePiecePriority(pi, "Torrent.tryCreatePieceHasher")
2438 t.storageLock.RLock()
2439 t.activePieceHashes++
2440 go t.pieceHasher(pi)
2444 func (t *Torrent) getPieceToHash() (ret pieceIndex, ok bool) {
2445 t.piecesQueuedForHash.IterTyped(func(i pieceIndex) bool {
2446 if t.piece(i).hashing {
2456 func (t *Torrent) dropBannedPeers() {
2457 t.iterPeers(func(p *Peer) {
2458 remoteIp := p.remoteIp()
2459 if remoteIp == nil {
2460 if p.bannableAddr.Ok {
2461 t.logger.WithDefaultLevel(log.Debug).Printf("can't get remote ip for peer %v", p)
2465 netipAddr := netip.MustParseAddr(remoteIp.String())
2466 if Some(netipAddr) != p.bannableAddr {
2467 t.logger.WithDefaultLevel(log.Debug).Printf(
2468 "peer remote ip does not match its bannable addr [peer=%v, remote ip=%v, bannable addr=%v]",
2469 p, remoteIp, p.bannableAddr)
2471 if _, ok := t.cl.badPeerIPs[netipAddr]; ok {
2472 // Should this be a close?
2474 t.logger.WithDefaultLevel(log.Debug).Printf("dropped %v for banned remote IP %v", p, netipAddr)
2479 func (t *Torrent) pieceHasher(index pieceIndex) {
2481 correct, failedPeers, copyErr := t.hashPiece(index)
2485 log.Fmsg("piece %v (%s) hash failure copy error: %v", p, p.hash.HexString(), copyErr).Log(t.logger)
2487 t.storageLock.RUnlock()
2491 for peer := range failedPeers {
2492 t.cl.banPeerIP(peer.AsSlice())
2493 t.logger.WithDefaultLevel(log.Debug).Printf("smart banned %v for piece %v", peer, index)
2496 for ri := t.pieceRequestIndexOffset(index); ri < t.pieceRequestIndexOffset(index+1); ri++ {
2497 t.smartBanCache.ForgetBlock(ri)
2501 t.pieceHashed(index, correct, copyErr)
2502 t.updatePiecePriority(index, "Torrent.pieceHasher")
2503 t.activePieceHashes--
2504 t.tryCreateMorePieceHashers()
2507 // Return the connections that touched a piece, and clear the entries while doing it.
2508 func (t *Torrent) clearPieceTouchers(pi pieceIndex) {
2510 for c := range p.dirtiers {
2511 delete(c.peerTouchedPieces, pi)
2512 delete(p.dirtiers, c)
2516 func (t *Torrent) peersAsSlice() (ret []*Peer) {
2517 t.iterPeers(func(p *Peer) {
2518 ret = append(ret, p)
2523 func (t *Torrent) queueInitialPieceCheck(i pieceIndex) {
2524 if !t.initialPieceCheckDisabled && !t.piece(i).storageCompletionOk {
2525 t.queuePieceCheck(i)
2529 func (t *Torrent) queuePieceCheck(pieceIndex pieceIndex) {
2530 piece := t.piece(pieceIndex)
2531 if piece.hash == nil && !piece.hashV2.Ok {
2534 if piece.queuedForHash() {
2537 t.piecesQueuedForHash.Add(bitmap.BitIndex(pieceIndex))
2538 t.publishPieceStateChange(pieceIndex)
2539 t.updatePiecePriority(pieceIndex, "Torrent.queuePieceCheck")
2540 t.tryCreateMorePieceHashers()
2543 // Forces all the pieces to be re-hashed. See also Piece.VerifyData. This should not be called
2544 // before the Info is available.
2545 func (t *Torrent) VerifyData() {
2546 for i := pieceIndex(0); i < t.NumPieces(); i++ {
2547 t.Piece(i).VerifyData()
2551 func (t *Torrent) connectingToPeerAddr(addrStr string) bool {
2552 return len(t.halfOpen[addrStr]) != 0
2555 func (t *Torrent) hasPeerConnForAddr(x PeerRemoteAddr) bool {
2556 addrStr := x.String()
2557 for c := range t.conns {
2559 if ra.String() == addrStr {
2566 func (t *Torrent) getHalfOpenPath(
2568 attemptKey outgoingConnAttemptKey,
2569 ) nestedmaps.Path[*PeerInfo] {
2570 return nestedmaps.Next(nestedmaps.Next(nestedmaps.Begin(&t.halfOpen), addrStr), attemptKey)
2573 func (t *Torrent) addHalfOpen(addrStr string, attemptKey *PeerInfo) {
2574 path := t.getHalfOpenPath(addrStr, attemptKey)
2576 panic("should be unique")
2578 path.Set(attemptKey)
2582 // Start the process of connecting to the given peer for the given torrent if appropriate. I'm not
2583 // sure all the PeerInfo fields are being used.
2585 opts outgoingConnOpts,
2589 peer := opts.peerInfo
2590 if peer.Id == t.cl.peerID {
2593 if t.cl.badPeerAddr(peer.Addr) && !peer.Trusted {
2597 addrStr := addr.String()
2599 if t.connectingToPeerAddr(addrStr) {
2603 if t.hasPeerConnForAddr(addr) {
2607 t.addHalfOpen(addrStr, attemptKey)
2608 go t.cl.outgoingConnection(
2614 // Adds a trusted, pending peer for each of the given Client's addresses. Typically used in tests to
2615 // quickly make one Client visible to the Torrent of another Client.
2616 func (t *Torrent) AddClientPeer(cl *Client) int {
2617 return t.AddPeers(func() (ps []PeerInfo) {
2618 for _, la := range cl.ListenAddrs() {
2619 ps = append(ps, PeerInfo{
2628 // All stats that include this Torrent. Useful when we want to increment ConnStats but not for every
2630 func (t *Torrent) allStats(f func(*ConnStats)) {
2635 func (t *Torrent) hashingPiece(i pieceIndex) bool {
2636 return t.pieces[i].hashing
2639 func (t *Torrent) pieceQueuedForHash(i pieceIndex) bool {
2640 return t.piecesQueuedForHash.Get(bitmap.BitIndex(i))
2643 func (t *Torrent) dialTimeout() time.Duration {
2644 return reducedDialTimeout(t.cl.config.MinDialTimeout, t.cl.config.NominalDialTimeout, t.cl.config.HalfOpenConnsPerTorrent, t.peers.Len())
2647 func (t *Torrent) piece(i int) *Piece {
2651 func (t *Torrent) onWriteChunkErr(err error) {
2652 if t.userOnWriteChunkErr != nil {
2653 go t.userOnWriteChunkErr(err)
2656 t.logger.WithDefaultLevel(log.Critical).Printf("default chunk write error handler: disabling data download")
2657 t.disallowDataDownloadLocked()
2660 func (t *Torrent) DisallowDataDownload() {
2663 t.disallowDataDownloadLocked()
2666 func (t *Torrent) disallowDataDownloadLocked() {
2667 t.dataDownloadDisallowed.Set()
2668 t.iterPeers(func(p *Peer) {
2669 // Could check if peer request state is empty/not interested?
2670 p.updateRequests("disallow data download")
2671 p.cancelAllRequests()
2675 func (t *Torrent) AllowDataDownload() {
2678 t.dataDownloadDisallowed.Clear()
2679 t.iterPeers(func(p *Peer) {
2680 p.updateRequests("allow data download")
2684 // Enables uploading data, if it was disabled.
2685 func (t *Torrent) AllowDataUpload() {
2688 t.dataUploadDisallowed = false
2689 t.iterPeers(func(p *Peer) {
2690 p.updateRequests("allow data upload")
2694 // Disables uploading data, if it was enabled.
2695 func (t *Torrent) DisallowDataUpload() {
2698 t.dataUploadDisallowed = true
2699 for c := range t.conns {
2700 // TODO: This doesn't look right. Shouldn't we tickle writers to choke peers or something instead?
2701 c.updateRequests("disallow data upload")
2705 // Sets a handler that is called if there's an error writing a chunk to local storage. By default,
2706 // or if nil, a critical message is logged, and data download is disabled.
2707 func (t *Torrent) SetOnWriteChunkError(f func(error)) {
2710 t.userOnWriteChunkErr = f
2713 func (t *Torrent) iterPeers(f func(p *Peer)) {
2714 for pc := range t.conns {
2717 for _, ws := range t.webSeeds {
2722 func (t *Torrent) callbacks() *Callbacks {
2723 return &t.cl.config.Callbacks
2726 type AddWebSeedsOpt func(*webseed.Client)
2728 // Sets the WebSeed trailing path escaper for a webseed.Client.
2729 func WebSeedPathEscaper(custom webseed.PathEscaper) AddWebSeedsOpt {
2730 return func(c *webseed.Client) {
2731 c.PathEscaper = custom
2735 func (t *Torrent) AddWebSeeds(urls []string, opts ...AddWebSeedsOpt) {
2738 for _, u := range urls {
2739 t.addWebSeed(u, opts...)
2743 func (t *Torrent) addWebSeed(url string, opts ...AddWebSeedsOpt) {
2744 if t.cl.config.DisableWebseeds {
2747 if _, ok := t.webSeeds[url]; ok {
2750 // I don't think Go http supports pipelining requests. However, we can have more ready to go
2751 // right away. This value should be some multiple of the number of connections to a host. I
2752 // would expect that double maxRequests plus a bit would be appropriate. This value is based on
2753 // downloading Sintel (08ada5a7a6183aae1e09d831df6748d566095a10) from
2754 // "https://webtorrent.io/torrents/".
2755 const maxRequests = 16
2761 reconciledHandshakeStats: true,
2762 // This should affect how often we have to recompute requests for this peer. Note that
2763 // because we can request more than 1 thing at a time over HTTP, we will hit the low
2764 // requests mark more often, so recomputation is probably sooner than with regular peer
2765 // conns. ~4x maxRequests would be about right.
2766 PeerMaxRequests: 128,
2767 // TODO: Set ban prefix?
2768 RemoteAddr: remoteAddrFromUrl(url),
2769 callbacks: t.callbacks(),
2771 client: webseed.Client{
2772 HttpClient: t.cl.httpClient,
2774 ResponseBodyWrapper: func(r io.Reader) io.Reader {
2775 return &rateLimitedReader{
2776 l: t.cl.config.DownloadRateLimiter,
2781 activeRequests: make(map[Request]webseed.Request, maxRequests),
2783 ws.peer.initRequestState()
2784 for _, opt := range opts {
2787 ws.peer.initUpdateRequestsTimer()
2788 ws.requesterCond.L = t.cl.locker()
2789 for i := 0; i < maxRequests; i += 1 {
2792 for _, f := range t.callbacks().NewPeer {
2795 ws.peer.logger = t.logger.WithContextValue(&ws)
2796 ws.peer.peerImpl = &ws
2798 ws.onGotInfo(t.info)
2800 t.webSeeds[url] = &ws.peer
2803 func (t *Torrent) peerIsActive(p *Peer) (active bool) {
2804 t.iterPeers(func(p1 *Peer) {
2812 func (t *Torrent) requestIndexToRequest(ri RequestIndex) Request {
2813 index := t.pieceIndexOfRequestIndex(ri)
2816 t.piece(index).chunkIndexSpec(ri % t.chunksPerRegularPiece()),
2820 func (t *Torrent) requestIndexFromRequest(r Request) RequestIndex {
2821 return t.pieceRequestIndexOffset(pieceIndex(r.Index)) + RequestIndex(r.Begin/t.chunkSize)
2824 func (t *Torrent) pieceRequestIndexOffset(piece pieceIndex) RequestIndex {
2825 return RequestIndex(piece) * t.chunksPerRegularPiece()
2828 func (t *Torrent) updateComplete() {
2829 t.Complete.SetBool(t.haveAllPieces())
2832 func (t *Torrent) cancelRequest(r RequestIndex) *Peer {
2833 p := t.requestingPeer(r)
2837 // TODO: This is a check that an old invariant holds. It can be removed after some testing.
2838 //delete(t.pendingRequests, r)
2839 if _, ok := t.requestState[r]; ok {
2840 panic("expected request state to be gone")
2845 func (t *Torrent) requestingPeer(r RequestIndex) *Peer {
2846 return t.requestState[r].peer
2849 func (t *Torrent) addConnWithAllPieces(p *Peer) {
2850 if t.connsWithAllPieces == nil {
2851 t.connsWithAllPieces = make(map[*Peer]struct{}, t.maxEstablishedConns)
2853 t.connsWithAllPieces[p] = struct{}{}
2856 func (t *Torrent) deleteConnWithAllPieces(p *Peer) bool {
2857 _, ok := t.connsWithAllPieces[p]
2858 delete(t.connsWithAllPieces, p)
2862 func (t *Torrent) numActivePeers() int {
2863 return len(t.conns) + len(t.webSeeds)
2866 func (t *Torrent) hasStorageCap() bool {
2867 f := t.storage.Capacity
2875 func (t *Torrent) pieceIndexOfRequestIndex(ri RequestIndex) pieceIndex {
2876 return pieceIndex(ri / t.chunksPerRegularPiece())
2879 func (t *Torrent) iterUndirtiedRequestIndexesInPiece(
2880 reuseIter *typedRoaring.Iterator[RequestIndex],
2882 f func(RequestIndex),
2884 reuseIter.Initialize(&t.dirtyChunks)
2885 pieceRequestIndexOffset := t.pieceRequestIndexOffset(piece)
2886 iterBitmapUnsetInRange(
2888 pieceRequestIndexOffset, pieceRequestIndexOffset+t.pieceNumChunks(piece),
2893 type requestState struct {
2898 // Returns an error if a received chunk is out of bounds in someway.
2899 func (t *Torrent) checkValidReceiveChunk(r Request) error {
2901 return errors.New("torrent missing info")
2903 if int(r.Index) >= t.numPieces() {
2904 return fmt.Errorf("chunk index %v, torrent num pieces %v", r.Index, t.numPieces())
2906 pieceLength := t.pieceLength(pieceIndex(r.Index))
2907 if r.Begin >= pieceLength {
2908 return fmt.Errorf("chunk begins beyond end of piece (%v >= %v)", r.Begin, pieceLength)
2910 // We could check chunk lengths here, but chunk request size is not changed often, and tricky
2911 // for peers to manipulate as they need to send potentially large buffers to begin with. There
2912 // should be considerable checks elsewhere for this case due to the network overhead. We should
2913 // catch most of the overflow manipulation stuff by checking index and begin above.
2917 func (t *Torrent) peerConnsWithDialAddrPort(target netip.AddrPort) (ret []*PeerConn) {
2918 for pc := range t.conns {
2919 dialAddr, err := pc.remoteDialAddrPort()
2923 if dialAddr != target {
2926 ret = append(ret, pc)
2931 func wrapUtHolepunchMsgForPeerConn(
2932 recipient *PeerConn,
2933 msg utHolepunch.Msg,
2935 extendedPayload, err := msg.MarshalBinary()
2941 ExtendedID: MapMustGet(recipient.PeerExtensionIDs, utHolepunch.ExtensionName),
2942 ExtendedPayload: extendedPayload,
2946 func sendUtHolepunchMsg(
2948 msgType utHolepunch.MsgType,
2949 addrPort netip.AddrPort,
2950 errCode utHolepunch.ErrCode,
2952 holepunchMsg := utHolepunch.Msg{
2957 incHolepunchMessagesSent(holepunchMsg)
2958 ppMsg := wrapUtHolepunchMsgForPeerConn(pc, holepunchMsg)
2962 func incHolepunchMessages(msg utHolepunch.Msg, verb string) {
2965 "holepunch %v %v messages %v",
2967 addrPortProtocolStr(msg.AddrPort),
2974 func incHolepunchMessagesReceived(msg utHolepunch.Msg) {
2975 incHolepunchMessages(msg, "received")
2978 func incHolepunchMessagesSent(msg utHolepunch.Msg) {
2979 incHolepunchMessages(msg, "sent")
2982 func (t *Torrent) handleReceivedUtHolepunchMsg(msg utHolepunch.Msg, sender *PeerConn) error {
2983 incHolepunchMessagesReceived(msg)
2984 switch msg.MsgType {
2985 case utHolepunch.Rendezvous:
2986 t.logger.Printf("got holepunch rendezvous request for %v from %p", msg.AddrPort, sender)
2987 sendMsg := sendUtHolepunchMsg
2988 senderAddrPort, err := sender.remoteDialAddrPort()
2990 sender.logger.Levelf(
2992 "error getting ut_holepunch rendezvous sender's dial address: %v",
2995 // There's no better error code. The sender's address itself is invalid. I don't see
2996 // this error message being appropriate anywhere else anyway.
2997 sendMsg(sender, utHolepunch.Error, msg.AddrPort, utHolepunch.NoSuchPeer)
2999 targets := t.peerConnsWithDialAddrPort(msg.AddrPort)
3000 if len(targets) == 0 {
3001 sendMsg(sender, utHolepunch.Error, msg.AddrPort, utHolepunch.NotConnected)
3004 for _, pc := range targets {
3005 if !pc.supportsExtension(utHolepunch.ExtensionName) {
3006 sendMsg(sender, utHolepunch.Error, msg.AddrPort, utHolepunch.NoSupport)
3009 sendMsg(sender, utHolepunch.Connect, msg.AddrPort, 0)
3010 sendMsg(pc, utHolepunch.Connect, senderAddrPort, 0)
3013 case utHolepunch.Connect:
3014 holepunchAddr := msg.AddrPort
3015 t.logger.Printf("got holepunch connect request for %v from %p", holepunchAddr, sender)
3016 if g.MapContains(t.cl.undialableWithoutHolepunch, holepunchAddr) {
3017 setAdd(&t.cl.undialableWithoutHolepunchDialedAfterHolepunchConnect, holepunchAddr)
3018 if g.MapContains(t.cl.accepted, holepunchAddr) {
3019 setAdd(&t.cl.probablyOnlyConnectedDueToHolepunch, holepunchAddr)
3022 opts := outgoingConnOpts{
3025 Source: PeerSourceUtHolepunch,
3026 PexPeerFlags: sender.pex.remoteLiveConns[msg.AddrPort].UnwrapOrZeroValue(),
3029 // Don't attempt to start our own rendezvous if we fail to connect.
3030 skipHolepunchRendezvous: true,
3031 receivedHolepunchConnect: true,
3032 // Assume that the other end initiated the rendezvous, and will use our preferred
3033 // encryption. So we will act normally.
3034 HeaderObfuscationPolicy: t.cl.config.HeaderObfuscationPolicy,
3036 initiateConn(opts, true)
3038 case utHolepunch.Error:
3039 torrent.Add("holepunch error messages received", 1)
3040 t.logger.Levelf(log.Debug, "received ut_holepunch error message from %v: %v", sender, msg.ErrCode)
3043 return fmt.Errorf("unhandled msg type %v", msg.MsgType)
3047 func addrPortProtocolStr(addrPort netip.AddrPort) string {
3048 addr := addrPort.Addr()
3059 func (t *Torrent) trySendHolepunchRendezvous(addrPort netip.AddrPort) error {
3061 for pc := range t.conns {
3062 if !pc.supportsExtension(utHolepunch.ExtensionName) {
3065 if pc.supportsExtension(pp.ExtensionNamePex) {
3066 if !g.MapContains(pc.pex.remoteLiveConns, addrPort) {
3070 t.logger.Levelf(log.Debug, "sent ut_holepunch rendezvous message to %v for %v", pc, addrPort)
3071 sendUtHolepunchMsg(pc, utHolepunch.Rendezvous, addrPort, 0)
3075 return errors.New("no eligible relays")
3080 func (t *Torrent) numHalfOpenAttempts() (num int) {
3081 for _, attempts := range t.halfOpen {
3082 num += len(attempts)
3087 func (t *Torrent) getDialTimeoutUnlocked() time.Duration {
3091 return t.dialTimeout()
3094 func (t *Torrent) canonicalShortInfohash() *infohash.T {
3096 return &t.infoHash.Value
3098 return t.infoHashV2.UnwrapPtr().ToShort()
3101 func (t *Torrent) eachShortInfohash(each func(short [20]byte)) {
3103 each(t.infoHash.Value)
3105 if t.infoHashV2.Ok {
3106 each(*t.infoHashV2.Value.ToShort())