requesting.go

   1 package torrent
   2
   3 import (
   4         "container/heap"
   5         "context"
   6         "encoding/gob"
   7         "reflect"
   8         "runtime/pprof"
   9         "time"
  10         "unsafe"
  11
  12         "github.com/RoaringBitmap/roaring"
  13         "github.com/anacrolix/log"
  14         "github.com/anacrolix/missinggo/v2/bitmap"
  15         "github.com/anacrolix/multiless"
  16
  17         request_strategy "github.com/anacrolix/torrent/request-strategy"
  18 )
  19
  20 func (cl *Client) tickleRequester() {
  21         cl.updateRequests.Broadcast()
  22 }
  23
  24 func (cl *Client) getRequestStrategyInput() request_strategy.Input {
  25         ts := make([]request_strategy.Torrent, 0, len(cl.torrents))
  26         for _, t := range cl.torrents {
  27                 if !t.haveInfo() {
  28                         // This would be removed if metadata is handled here. We have to guard against not
  29                         // knowing the piece size. If we have no info, we have no pieces too, so the end result
  30                         // is the same.
  31                         continue
  32                 }
  33                 rst := request_strategy.Torrent{
  34                         InfoHash:       t.infoHash,
  35                         ChunksPerPiece: t.chunksPerRegularPiece(),
  36                 }
  37                 if t.storage != nil {
  38                         rst.Capacity = t.storage.Capacity
  39                 }
  40                 rst.Pieces = make([]request_strategy.Piece, 0, len(t.pieces))
  41                 for i := range t.pieces {
  42                         p := &t.pieces[i]
  43                         rst.Pieces = append(rst.Pieces, request_strategy.Piece{
  44                                 Request:           !t.ignorePieceForRequests(i),
  45                                 Priority:          p.purePriority(),
  46                                 Partial:           t.piecePartiallyDownloaded(i),
  47                                 Availability:      p.availability,
  48                                 Length:            int64(p.length()),
  49                                 NumPendingChunks:  int(t.pieceNumPendingChunks(i)),
  50                                 IterPendingChunks: p.undirtiedChunksIter(),
  51                         })
  52                 }
  53                 t.iterPeers(func(p *Peer) {
  54                         if p.closed.IsSet() {
  55                                 return
  56                         }
  57                         if p.piecesReceivedSinceLastRequestUpdate > p.maxPiecesReceivedBetweenRequestUpdates {
  58                                 p.maxPiecesReceivedBetweenRequestUpdates = p.piecesReceivedSinceLastRequestUpdate
  59                         }
  60                         p.piecesReceivedSinceLastRequestUpdate = 0
  61                         rst.Peers = append(rst.Peers, request_strategy.Peer{
  62                                 Pieces:           *p.newPeerPieces(),
  63                                 MaxRequests:      p.nominalMaxRequests(),
  64                                 ExistingRequests: p.actualRequestState.Requests,
  65                                 Choking:          p.peerChoking,
  66                                 PieceAllowedFast: p.peerAllowedFast,
  67                                 DownloadRate:     p.downloadRate(),
  68                                 Age:              time.Since(p.completedHandshake),
  69                                 Id: peerId{
  70                                         Peer: p,
  71                                         ptr:  uintptr(unsafe.Pointer(p)),
  72                                 },
  73                         })
  74                 })
  75                 ts = append(ts, rst)
  76         }
  77         return request_strategy.Input{
  78                 Torrents:           ts,
  79                 MaxUnverifiedBytes: cl.config.MaxUnverifiedBytes,
  80         }
  81 }
  82
  83 func init() {
  84         gob.Register(peerId{})
  85 }
  86
  87 type peerId struct {
  88         *Peer
  89         ptr uintptr
  90 }
  91
  92 func (p peerId) Uintptr() uintptr {
  93         return p.ptr
  94 }
  95
  96 func (p peerId) GobEncode() (b []byte, _ error) {
  97         *(*reflect.SliceHeader)(unsafe.Pointer(&b)) = reflect.SliceHeader{
  98                 Data: uintptr(unsafe.Pointer(&p.ptr)),
  99                 Len:  int(unsafe.Sizeof(p.ptr)),
 100                 Cap:  int(unsafe.Sizeof(p.ptr)),
 101         }
 102         return
 103 }
 104
 105 func (p *peerId) GobDecode(b []byte) error {
 106         if uintptr(len(b)) != unsafe.Sizeof(p.ptr) {
 107                 panic(len(b))
 108         }
 109         ptr := unsafe.Pointer(&b[0])
 110         p.ptr = *(*uintptr)(ptr)
 111         log.Printf("%p", ptr)
 112         dst := reflect.SliceHeader{
 113                 Data: uintptr(unsafe.Pointer(&p.Peer)),
 114                 Len:  int(unsafe.Sizeof(p.Peer)),
 115                 Cap:  int(unsafe.Sizeof(p.Peer)),
 116         }
 117         copy(*(*[]byte)(unsafe.Pointer(&dst)), b)
 118         return nil
 119 }
 120
 121 type RequestIndex = request_strategy.RequestIndex
 122 type chunkIndexType = request_strategy.ChunkIndex
 123
 124 type peerRequests struct {
 125         requestIndexes       []RequestIndex
 126         peer                 *Peer
 127         torrentStrategyInput request_strategy.Torrent
 128 }
 129
 130 func (p peerRequests) Len() int {
 131         return len(p.requestIndexes)
 132 }
 133
 134 func (p peerRequests) Less(i, j int) bool {
 135         leftRequest := p.requestIndexes[i]
 136         rightRequest := p.requestIndexes[j]
 137         t := p.peer.t
 138         leftPieceIndex := leftRequest / p.torrentStrategyInput.ChunksPerPiece
 139         rightPieceIndex := rightRequest / p.torrentStrategyInput.ChunksPerPiece
 140         leftCurrent := p.peer.actualRequestState.Requests.Contains(leftRequest)
 141         rightCurrent := p.peer.actualRequestState.Requests.Contains(rightRequest)
 142         pending := func(index RequestIndex, current bool) int {
 143                 ret := t.pendingRequests.Get(index)
 144                 if current {
 145                         ret--
 146                 }
 147                 return ret
 148         }
 149         ml := multiless.New()
 150         // Push requests that can't be served right now to the end. But we don't throw them away unless
 151         // there's a better alternative. This is for when we're using the fast extension and get choked
 152         // but our requests could still be good when we get unchoked.
 153         if p.peer.peerChoking {
 154                 ml = ml.Bool(
 155                         !p.peer.peerAllowedFast.Contains(leftPieceIndex),
 156                         !p.peer.peerAllowedFast.Contains(rightPieceIndex),
 157                 )
 158         }
 159         ml = ml.Int(
 160                 pending(leftRequest, leftCurrent),
 161                 pending(rightRequest, rightCurrent))
 162         ml = ml.Bool(!leftCurrent, !rightCurrent)
 163         ml = ml.Int(
 164                 -int(p.torrentStrategyInput.Pieces[leftPieceIndex].Priority),
 165                 -int(p.torrentStrategyInput.Pieces[rightPieceIndex].Priority),
 166         )
 167         ml = ml.Int(
 168                 int(p.torrentStrategyInput.Pieces[leftPieceIndex].Availability),
 169                 int(p.torrentStrategyInput.Pieces[rightPieceIndex].Availability))
 170         ml = ml.Uint32(leftPieceIndex, rightPieceIndex)
 171         ml = ml.Uint32(leftRequest, rightRequest)
 172         return ml.MustLess()
 173 }
 174
 175 func (p *peerRequests) Swap(i, j int) {
 176         p.requestIndexes[i], p.requestIndexes[j] = p.requestIndexes[j], p.requestIndexes[i]
 177 }
 178
 179 func (p *peerRequests) Push(x interface{}) {
 180         p.requestIndexes = append(p.requestIndexes, x.(RequestIndex))
 181 }
 182
 183 func (p *peerRequests) Pop() interface{} {
 184         last := len(p.requestIndexes) - 1
 185         x := p.requestIndexes[last]
 186         p.requestIndexes = p.requestIndexes[:last]
 187         return x
 188 }
 189
 190 func (p *Peer) getDesiredRequestState() (desired requestState) {
 191         input := p.t.cl.getRequestStrategyInput()
 192         requestHeap := peerRequests{
 193                 peer: p,
 194         }
 195         for _, t := range input.Torrents {
 196                 if t.InfoHash == p.t.infoHash {
 197                         requestHeap.torrentStrategyInput = t
 198                         break
 199                 }
 200         }
 201         request_strategy.GetRequestablePieces(
 202                 input,
 203                 func(t *request_strategy.Torrent, rsp *request_strategy.Piece, pieceIndex int) {
 204                         if t.InfoHash != p.t.infoHash {
 205                                 return
 206                         }
 207                         if !p.peerHasPiece(pieceIndex) {
 208                                 return
 209                         }
 210                         allowedFast := p.peerAllowedFast.ContainsInt(pieceIndex)
 211                         rsp.IterPendingChunks.Iter(func(ci request_strategy.ChunkIndex) {
 212                                 if !allowedFast {
 213                                         // We must signal interest to request this..
 214                                         desired.Interested = true
 215                                         if p.peerChoking && !p.actualRequestState.Requests.Contains(ci) {
 216                                                 // We can't request this right now.
 217                                                 return
 218                                         }
 219                                 }
 220                                 requestHeap.requestIndexes = append(
 221                                         requestHeap.requestIndexes,
 222                                         p.t.pieceRequestIndexOffset(pieceIndex)+ci)
 223                         })
 224                 },
 225         )
 226         heap.Init(&requestHeap)
 227         for requestHeap.Len() != 0 && desired.Requests.GetCardinality() < uint64(p.nominalMaxRequests()) {
 228                 requestIndex := heap.Pop(&requestHeap).(RequestIndex)
 229                 desired.Requests.Add(requestIndex)
 230         }
 231         return
 232 }
 233
 234 func (p *Peer) applyNextRequestState() bool {
 235         if p.needRequestUpdate == "" {
 236                 return true
 237         }
 238         var more bool
 239         pprof.Do(
 240                 context.Background(),
 241                 pprof.Labels("update request", p.needRequestUpdate),
 242                 func(_ context.Context) {
 243                         next := p.getDesiredRequestState()
 244                         more = p.applyRequestState(next)
 245                 },
 246         )
 247         return more
 248 }
 249
 250 func (p *Peer) applyRequestState(next requestState) bool {
 251         current := p.actualRequestState
 252         if !p.setInterested(next.Interested) {
 253                 return false
 254         }
 255         more := true
 256         cancel := roaring.AndNot(&current.Requests, &next.Requests)
 257         cancel.Iterate(func(req uint32) bool {
 258                 more = p.cancel(req)
 259                 return more
 260         })
 261         if !more {
 262                 return false
 263         }
 264         next.Requests.Iterate(func(req uint32) bool {
 265                 // This could happen if the peer chokes us between the next state being generated, and us
 266                 // trying to transmit the state.
 267                 if p.peerChoking && !p.peerAllowedFast.Contains(bitmap.BitIndex(req/p.t.chunksPerRegularPiece())) {
 268                         return true
 269                 }
 270                 var err error
 271                 more, err = p.request(req)
 272                 if err != nil {
 273                         panic(err)
 274                 } /* else {
 275                         log.Print(req)
 276                 } */
 277                 return more
 278         })
 279         if more {
 280                 p.needRequestUpdate = ""
 281         }
 282         return more
 283 }