34 lines
1.1 KiB
Go
34 lines
1.1 KiB
Go
|
package torrent
|
||
|
|
|
||
|
|
import (
|
||
|
|
"github.com/RoaringBitmap/roaring"
|
||
|
|
"github.com/anacrolix/torrent/metainfo"
|
||
|
|
)
|
||
|
|
|
||
|
|
// Contains implementation details that differ between peer types, like Webseeds and regular
|
||
|
|
// BitTorrent protocol connections. Some methods are underlined so as to avoid collisions with
|
||
|
|
// legacy PeerConn methods.
|
||
|
|
type peerImpl interface {
|
||
|
|
// Trigger the actual request state to get updated
|
||
|
|
handleUpdateRequests()
|
||
|
|
writeInterested(interested bool) bool
|
||
|
|
|
||
|
|
// _cancel initiates cancellation of a request and returns acked if it expects the cancel to be
|
||
|
|
// handled by a follow-up event.
|
||
|
|
_cancel(RequestIndex) (acked bool)
|
||
|
|
_request(Request) bool
|
||
|
|
connectionFlags() string
|
||
|
|
onClose()
|
||
|
|
onGotInfo(*metainfo.Info)
|
||
|
|
drop()
|
||
|
|
String() string
|
||
|
|
connStatusString() string
|
||
|
|
|
||
|
|
// All if the peer should have everything, known if we know that for a fact. For example, we can
|
||
|
|
// guess at how many pieces are in a torrent, and assume they have all pieces based on them
|
||
|
|
// having sent haves for everything, but we don't know for sure. But if they send a have-all
|
||
|
|
// message, then it's clear that they do.
|
||
|
|
peerHasAllPieces() (all, known bool)
|
||
|
|
peerPieces() *roaring.Bitmap
|
||
|
|
}
|