2014-04-03 20:16:59 +08:00
|
|
|
package torrent
|
|
|
|
|
|
|
|
import (
|
|
|
|
"errors"
|
2017-11-08 12:00:18 +08:00
|
|
|
"net"
|
2014-08-21 19:08:56 +08:00
|
|
|
|
2021-12-17 19:06:21 +08:00
|
|
|
"github.com/RoaringBitmap/roaring"
|
2019-12-18 10:52:00 +08:00
|
|
|
"github.com/anacrolix/missinggo/v2"
|
2019-08-21 18:58:40 +08:00
|
|
|
"golang.org/x/time/rate"
|
|
|
|
|
2015-06-02 22:17:58 +08:00
|
|
|
"github.com/anacrolix/torrent/metainfo"
|
2015-04-08 00:17:15 +08:00
|
|
|
pp "github.com/anacrolix/torrent/peer_protocol"
|
2022-11-15 20:22:10 +08:00
|
|
|
"github.com/anacrolix/torrent/types"
|
|
|
|
"github.com/anacrolix/torrent/types/infohash"
|
2014-04-03 20:16:59 +08:00
|
|
|
)
|
|
|
|
|
2021-05-13 07:56:58 +08:00
|
|
|
type (
|
|
|
|
Request = types.Request
|
|
|
|
ChunkSpec = types.ChunkSpec
|
|
|
|
piecePriority = types.PiecePriority
|
|
|
|
)
|
2014-04-03 20:16:59 +08:00
|
|
|
|
2021-05-13 07:56:58 +08:00
|
|
|
const (
|
|
|
|
PiecePriorityNormal = types.PiecePriorityNormal
|
|
|
|
PiecePriorityNone = types.PiecePriorityNone
|
|
|
|
PiecePriorityNow = types.PiecePriorityNow
|
|
|
|
PiecePriorityReadahead = types.PiecePriorityReadahead
|
|
|
|
PiecePriorityNext = types.PiecePriorityNext
|
|
|
|
PiecePriorityHigh = types.PiecePriorityHigh
|
|
|
|
)
|
2018-02-03 10:35:09 +08:00
|
|
|
|
2021-01-28 11:23:22 +08:00
|
|
|
func newRequest(index, begin, length pp.Integer) Request {
|
|
|
|
return Request{index, ChunkSpec{begin, length}}
|
2014-04-16 15:33:33 +08:00
|
|
|
}
|
|
|
|
|
2021-01-28 11:23:22 +08:00
|
|
|
func newRequestFromMessage(msg *pp.Message) Request {
|
2018-02-02 16:19:14 +08:00
|
|
|
switch msg.Type {
|
2018-02-02 20:56:06 +08:00
|
|
|
case pp.Request, pp.Cancel, pp.Reject:
|
2018-02-02 16:19:14 +08:00
|
|
|
return newRequest(msg.Index, msg.Begin, msg.Length)
|
|
|
|
case pp.Piece:
|
|
|
|
return newRequest(msg.Index, msg.Begin, pp.Integer(len(msg.Piece)))
|
|
|
|
default:
|
|
|
|
panic(msg.Type)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2014-11-19 11:53:00 +08:00
|
|
|
// The size in bytes of a metadata extension piece.
|
2021-12-18 05:58:56 +08:00
|
|
|
func metadataPieceSize(totalSize, piece int) int {
|
2014-06-26 22:57:07 +08:00
|
|
|
ret := totalSize - piece*(1<<14)
|
|
|
|
if ret > 1<<14 {
|
|
|
|
ret = 1 << 14
|
|
|
|
}
|
|
|
|
return ret
|
|
|
|
}
|
2015-03-10 23:41:21 +08:00
|
|
|
|
2015-04-08 00:20:01 +08:00
|
|
|
// Return the request that would include the given offset into the torrent data.
|
2021-09-02 18:53:49 +08:00
|
|
|
func torrentOffsetRequest(
|
|
|
|
torrentLength, pieceSize, chunkSize, offset int64,
|
|
|
|
) (
|
|
|
|
r Request, ok bool,
|
|
|
|
) {
|
2015-04-08 00:20:01 +08:00
|
|
|
if offset < 0 || offset >= torrentLength {
|
|
|
|
return
|
|
|
|
}
|
|
|
|
r.Index = pp.Integer(offset / pieceSize)
|
|
|
|
r.Begin = pp.Integer(offset % pieceSize / chunkSize * chunkSize)
|
|
|
|
r.Length = pp.Integer(chunkSize)
|
|
|
|
pieceLeft := pp.Integer(pieceSize - int64(r.Begin))
|
|
|
|
if r.Length > pieceLeft {
|
|
|
|
r.Length = pieceLeft
|
|
|
|
}
|
|
|
|
torrentLeft := torrentLength - int64(r.Index)*pieceSize - int64(r.Begin)
|
|
|
|
if int64(r.Length) > torrentLeft {
|
|
|
|
r.Length = pp.Integer(torrentLeft)
|
|
|
|
}
|
|
|
|
ok = true
|
|
|
|
return
|
|
|
|
}
|
|
|
|
|
2021-01-28 11:23:22 +08:00
|
|
|
func torrentRequestOffset(torrentLength, pieceSize int64, r Request) (off int64) {
|
2015-04-08 00:20:01 +08:00
|
|
|
off = int64(r.Index)*pieceSize + int64(r.Begin)
|
|
|
|
if off < 0 || off >= torrentLength {
|
2021-01-28 11:23:22 +08:00
|
|
|
panic("invalid Request")
|
2015-04-08 00:20:01 +08:00
|
|
|
}
|
|
|
|
return
|
|
|
|
}
|
2015-06-02 22:17:58 +08:00
|
|
|
|
|
|
|
func validateInfo(info *metainfo.Info) error {
|
|
|
|
if len(info.Pieces)%20 != 0 {
|
|
|
|
return errors.New("pieces has invalid length")
|
|
|
|
}
|
2016-09-12 14:54:43 +08:00
|
|
|
if info.PieceLength == 0 {
|
|
|
|
if info.TotalLength() != 0 {
|
|
|
|
return errors.New("zero piece length")
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
if int((info.TotalLength()+info.PieceLength-1)/info.PieceLength) != info.NumPieces() {
|
|
|
|
return errors.New("piece count and file lengths are at odds")
|
|
|
|
}
|
2015-06-02 22:17:58 +08:00
|
|
|
}
|
|
|
|
return nil
|
|
|
|
}
|
2016-03-22 10:11:36 +08:00
|
|
|
|
2021-12-18 05:58:56 +08:00
|
|
|
func chunkIndexSpec(index, pieceLength, chunkSize pp.Integer) ChunkSpec {
|
2021-01-28 11:23:22 +08:00
|
|
|
ret := ChunkSpec{pp.Integer(index) * chunkSize, chunkSize}
|
2016-03-22 10:11:36 +08:00
|
|
|
if ret.Begin+ret.Length > pieceLength {
|
|
|
|
ret.Length = pieceLength - ret.Begin
|
|
|
|
}
|
|
|
|
return ret
|
|
|
|
}
|
2016-11-23 09:59:23 +08:00
|
|
|
|
2021-01-20 10:10:32 +08:00
|
|
|
func connLessTrusted(l, r *Peer) bool {
|
2019-12-18 10:52:00 +08:00
|
|
|
return l.trust().Less(r.trust())
|
2016-11-23 09:59:23 +08:00
|
|
|
}
|
2017-11-08 12:00:18 +08:00
|
|
|
|
2018-04-12 09:41:07 +08:00
|
|
|
func connIsIpv6(nc interface {
|
|
|
|
LocalAddr() net.Addr
|
|
|
|
}) bool {
|
|
|
|
ra := nc.LocalAddr()
|
2020-02-20 13:47:37 +08:00
|
|
|
rip := addrIpOrNil(ra)
|
2018-02-12 21:48:21 +08:00
|
|
|
return rip.To4() == nil && rip.To16() != nil
|
|
|
|
}
|
2018-02-16 09:14:15 +08:00
|
|
|
|
|
|
|
func clamp(min, value, max int64) int64 {
|
|
|
|
if min > max {
|
|
|
|
panic("harumph")
|
|
|
|
}
|
|
|
|
if value < min {
|
|
|
|
value = min
|
|
|
|
}
|
|
|
|
if value > max {
|
|
|
|
value = max
|
|
|
|
}
|
|
|
|
return value
|
|
|
|
}
|
|
|
|
|
|
|
|
func max(as ...int64) int64 {
|
|
|
|
ret := as[0]
|
|
|
|
for _, a := range as[1:] {
|
|
|
|
if a > ret {
|
|
|
|
ret = a
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return ret
|
|
|
|
}
|
|
|
|
|
2021-12-24 05:55:57 +08:00
|
|
|
func maxInt(as ...int) int {
|
|
|
|
ret := as[0]
|
|
|
|
for _, a := range as[1:] {
|
|
|
|
if a > ret {
|
|
|
|
ret = a
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return ret
|
|
|
|
}
|
|
|
|
|
2018-02-16 09:14:15 +08:00
|
|
|
func min(as ...int64) int64 {
|
|
|
|
ret := as[0]
|
|
|
|
for _, a := range as[1:] {
|
|
|
|
if a < ret {
|
|
|
|
ret = a
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return ret
|
|
|
|
}
|
2018-06-11 10:20:51 +08:00
|
|
|
|
2021-05-12 15:45:36 +08:00
|
|
|
func minInt(as ...int) int {
|
|
|
|
ret := as[0]
|
|
|
|
for _, a := range as[1:] {
|
|
|
|
if a < ret {
|
|
|
|
ret = a
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return ret
|
|
|
|
}
|
|
|
|
|
2018-06-11 10:20:51 +08:00
|
|
|
var unlimited = rate.NewLimiter(rate.Inf, 0)
|
2018-06-26 11:04:15 +08:00
|
|
|
|
2018-07-07 09:32:52 +08:00
|
|
|
type (
|
2018-07-17 19:28:01 +08:00
|
|
|
pieceIndex = int
|
2022-11-02 20:03:25 +08:00
|
|
|
// Deprecated: Use infohash.T directly to avoid unnecessary imports.
|
|
|
|
InfoHash = infohash.T
|
|
|
|
IpPort = missinggo.IpPort
|
2018-07-07 09:32:52 +08:00
|
|
|
)
|
2021-12-17 19:06:21 +08:00
|
|
|
|
|
|
|
func boolSliceToBitmap(slice []bool) (rb roaring.Bitmap) {
|
|
|
|
for i, b := range slice {
|
|
|
|
if b {
|
|
|
|
rb.AddInt(i)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return
|
|
|
|
}
|