137 lines
3.4 KiB
Go
137 lines
3.4 KiB
Go
package torrent
|
|
|
|
import (
|
|
"time"
|
|
"unsafe"
|
|
|
|
"github.com/anacrolix/missinggo/v2/bitmap"
|
|
|
|
"github.com/anacrolix/chansync"
|
|
request_strategy "github.com/anacrolix/torrent/request-strategy"
|
|
"github.com/anacrolix/torrent/types"
|
|
)
|
|
|
|
func (cl *Client) requester() {
|
|
for {
|
|
update := func() chansync.Signaled {
|
|
cl.lock()
|
|
defer cl.unlock()
|
|
cl.doRequests()
|
|
return cl.updateRequests.Signaled()
|
|
}()
|
|
// We can probably tune how often to heed this signal. TODO: Currently disabled to retain
|
|
// existing behaviour, while the signalling is worked out.
|
|
update = nil
|
|
select {
|
|
case <-cl.closed.LockedChan(cl.locker()):
|
|
return
|
|
case <-update:
|
|
case <-time.After(100 * time.Millisecond):
|
|
}
|
|
}
|
|
}
|
|
|
|
func (cl *Client) tickleRequester() {
|
|
cl.updateRequests.Broadcast()
|
|
}
|
|
|
|
func (cl *Client) doRequests() {
|
|
ts := make([]request_strategy.Torrent, 0, len(cl.torrents))
|
|
for _, t := range cl.torrents {
|
|
rst := request_strategy.Torrent{
|
|
StableId: uintptr(unsafe.Pointer(t)),
|
|
}
|
|
if t.storage != nil {
|
|
rst.Capacity = t.storage.Capacity
|
|
}
|
|
for i := range t.pieces {
|
|
p := &t.pieces[i]
|
|
rst.Pieces = append(rst.Pieces, request_strategy.Piece{
|
|
Request: !t.ignorePieceForRequests(i),
|
|
Priority: p.purePriority(),
|
|
Partial: t.piecePartiallyDownloaded(i),
|
|
Availability: p.availability,
|
|
Length: int64(p.length()),
|
|
NumPendingChunks: int(t.pieceNumPendingChunks(i)),
|
|
IterPendingChunks: func(f func(types.ChunkSpec)) {
|
|
p.iterUndirtiedChunks(func(cs ChunkSpec) bool {
|
|
f(cs)
|
|
return true
|
|
})
|
|
},
|
|
})
|
|
}
|
|
t.iterPeers(func(p *Peer) {
|
|
if p.closed.IsSet() {
|
|
return
|
|
}
|
|
if p.piecesReceivedSinceLastRequestUpdate > p.maxPiecesReceivedBetweenRequestUpdates {
|
|
p.maxPiecesReceivedBetweenRequestUpdates = p.piecesReceivedSinceLastRequestUpdate
|
|
}
|
|
p.piecesReceivedSinceLastRequestUpdate = 0
|
|
rst.Peers = append(rst.Peers, request_strategy.Peer{
|
|
HasPiece: p.peerHasPiece,
|
|
MaxRequests: p.nominalMaxRequests(),
|
|
HasExistingRequest: func(r request_strategy.Request) bool {
|
|
_, ok := p.actualRequestState.Requests[r]
|
|
return ok
|
|
},
|
|
Choking: p.peerChoking,
|
|
PieceAllowedFast: func(i pieceIndex) bool {
|
|
return p.peerAllowedFast.Contains(bitmap.BitIndex(i))
|
|
},
|
|
DownloadRate: p.downloadRate(),
|
|
Age: time.Since(p.completedHandshake),
|
|
Id: (*peerId)(p),
|
|
})
|
|
})
|
|
ts = append(ts, rst)
|
|
}
|
|
nextPeerStates := request_strategy.Run(request_strategy.Input{
|
|
Torrents: ts,
|
|
MaxUnverifiedBytes: cl.config.MaxUnverifiedBytes,
|
|
})
|
|
for p, state := range nextPeerStates {
|
|
setPeerNextRequestState(p, state)
|
|
}
|
|
}
|
|
|
|
type peerId Peer
|
|
|
|
func (p *peerId) Uintptr() uintptr {
|
|
return uintptr(unsafe.Pointer(p))
|
|
}
|
|
|
|
func setPeerNextRequestState(_p request_strategy.PeerId, rp request_strategy.PeerNextRequestState) {
|
|
p := (*Peer)(_p.(*peerId))
|
|
p.nextRequestState = rp
|
|
p.onNextRequestStateChanged()
|
|
}
|
|
|
|
func (p *Peer) applyNextRequestState() bool {
|
|
next := p.nextRequestState
|
|
current := p.actualRequestState
|
|
if !p.setInterested(next.Interested) {
|
|
return false
|
|
}
|
|
for req := range current.Requests {
|
|
if _, ok := next.Requests[req]; !ok {
|
|
if !p.cancel(req) {
|
|
return false
|
|
}
|
|
}
|
|
}
|
|
for req := range next.Requests {
|
|
more, err := p.request(req)
|
|
if err != nil {
|
|
panic(err)
|
|
} else {
|
|
//log.Print(req)
|
|
}
|
|
if !more {
|
|
return false
|
|
}
|
|
}
|
|
return true
|
|
}
|