2015-04-14 13:59:41 +00:00
|
|
|
package torrent
|
|
|
|
|
2015-08-03 14:45:15 +00:00
|
|
|
import (
|
2021-08-16 01:07:10 +00:00
|
|
|
"github.com/RoaringBitmap/roaring"
|
2020-01-10 04:09:21 +00:00
|
|
|
"github.com/anacrolix/missinggo/v2/bitmap"
|
2019-11-26 00:54:26 +00:00
|
|
|
|
2015-08-03 14:45:15 +00:00
|
|
|
"github.com/anacrolix/torrent/metainfo"
|
|
|
|
)
|
2015-04-14 13:59:41 +00:00
|
|
|
|
|
|
|
// Provides access to regions of torrent data that correspond to its files.
|
|
|
|
type File struct {
|
2021-08-01 12:01:24 +00:00
|
|
|
t *Torrent
|
|
|
|
path string
|
|
|
|
offset int64
|
|
|
|
length int64
|
|
|
|
fi metainfo.FileInfo
|
|
|
|
displayPath string
|
|
|
|
prio piecePriority
|
2015-04-14 13:59:41 +00:00
|
|
|
}
|
|
|
|
|
2016-04-03 08:40:43 +00:00
|
|
|
func (f *File) Torrent() *Torrent {
|
2015-11-11 16:25:04 +00:00
|
|
|
return f.t
|
|
|
|
}
|
|
|
|
|
2018-01-07 00:57:02 +00:00
|
|
|
// Data for this file begins this many bytes into the Torrent.
|
2015-04-14 13:59:41 +00:00
|
|
|
func (f *File) Offset() int64 {
|
|
|
|
return f.offset
|
|
|
|
}
|
|
|
|
|
2018-01-07 00:57:02 +00:00
|
|
|
// The FileInfo from the metainfo.Info to which this file corresponds.
|
2016-04-19 07:20:31 +00:00
|
|
|
func (f File) FileInfo() metainfo.FileInfo {
|
2015-04-14 13:59:41 +00:00
|
|
|
return f.fi
|
|
|
|
}
|
|
|
|
|
2018-01-07 00:57:02 +00:00
|
|
|
// The file's path components joined by '/'.
|
2016-04-19 07:20:31 +00:00
|
|
|
func (f File) Path() string {
|
2015-04-14 13:59:41 +00:00
|
|
|
return f.path
|
|
|
|
}
|
|
|
|
|
2018-01-07 00:57:02 +00:00
|
|
|
// The file's length in bytes.
|
2015-04-14 13:59:41 +00:00
|
|
|
func (f *File) Length() int64 {
|
|
|
|
return f.length
|
|
|
|
}
|
|
|
|
|
2019-11-26 00:54:26 +00:00
|
|
|
// Number of bytes of the entire file we have completed. This is the sum of
|
|
|
|
// completed pieces, and dirtied chunks of incomplete pieces.
|
2021-09-14 12:11:35 +00:00
|
|
|
func (f *File) BytesCompleted() (n int64) {
|
2019-11-26 00:54:26 +00:00
|
|
|
f.t.cl.rLock()
|
2021-09-14 12:11:35 +00:00
|
|
|
n = f.bytesCompletedLocked()
|
|
|
|
f.t.cl.rUnlock()
|
|
|
|
return
|
2019-11-26 00:54:26 +00:00
|
|
|
}
|
|
|
|
|
2021-09-14 12:11:35 +00:00
|
|
|
func (f *File) bytesCompletedLocked() int64 {
|
2019-11-26 00:54:26 +00:00
|
|
|
return f.length - f.bytesLeft()
|
|
|
|
}
|
|
|
|
|
2020-03-24 00:21:42 +00:00
|
|
|
func fileBytesLeft(
|
|
|
|
torrentUsualPieceSize int64,
|
|
|
|
fileFirstPieceIndex int,
|
|
|
|
fileEndPieceIndex int,
|
|
|
|
fileTorrentOffset int64,
|
|
|
|
fileLength int64,
|
2021-08-16 01:07:10 +00:00
|
|
|
torrentCompletedPieces *roaring.Bitmap,
|
2023-07-22 16:30:45 +00:00
|
|
|
pieceSizeCompletedFn func(pieceIndex int) int64,
|
2020-03-24 00:21:42 +00:00
|
|
|
) (left int64) {
|
2023-07-22 16:30:45 +00:00
|
|
|
if fileLength == 0 {
|
|
|
|
return
|
|
|
|
}
|
|
|
|
|
|
|
|
noCompletedMiddlePieces := roaring.New()
|
|
|
|
noCompletedMiddlePieces.AddRange(bitmap.BitRange(fileFirstPieceIndex), bitmap.BitRange(fileEndPieceIndex))
|
|
|
|
noCompletedMiddlePieces.AndNot(torrentCompletedPieces)
|
|
|
|
noCompletedMiddlePieces.Iterate(func(pieceIndex uint32) bool {
|
|
|
|
i := int(pieceIndex)
|
|
|
|
pieceSizeCompleted := pieceSizeCompletedFn(i)
|
|
|
|
if i == fileFirstPieceIndex {
|
|
|
|
beginOffset := fileTorrentOffset % torrentUsualPieceSize
|
|
|
|
beginSize := torrentUsualPieceSize - beginOffset
|
|
|
|
beginDownLoaded := pieceSizeCompleted - beginOffset
|
|
|
|
if beginDownLoaded < 0 {
|
|
|
|
beginDownLoaded = 0
|
|
|
|
}
|
|
|
|
left += beginSize - beginDownLoaded
|
|
|
|
} else if i == fileEndPieceIndex-1 {
|
|
|
|
endSize := (fileTorrentOffset + fileLength) % torrentUsualPieceSize
|
|
|
|
if endSize == 0 {
|
|
|
|
endSize = torrentUsualPieceSize
|
|
|
|
}
|
|
|
|
endDownloaded := pieceSizeCompleted
|
|
|
|
if endDownloaded > endSize {
|
|
|
|
endDownloaded = endSize
|
|
|
|
}
|
|
|
|
left += endSize - endDownloaded
|
|
|
|
} else {
|
|
|
|
left += torrentUsualPieceSize - pieceSizeCompleted
|
2020-03-24 01:15:35 +00:00
|
|
|
}
|
2023-07-22 16:30:45 +00:00
|
|
|
return true
|
|
|
|
})
|
|
|
|
|
|
|
|
if left > fileLength {
|
|
|
|
left = fileLength
|
2019-11-30 08:53:35 +00:00
|
|
|
}
|
2023-07-22 16:30:45 +00:00
|
|
|
//
|
|
|
|
//numPiecesSpanned := f.EndPieceIndex() - f.BeginPieceIndex()
|
|
|
|
//completedMiddlePieces := f.t._completedPieces.Clone()
|
|
|
|
//completedMiddlePieces.RemoveRange(0, bitmap.BitRange(f.BeginPieceIndex()+1))
|
|
|
|
//completedMiddlePieces.RemoveRange(bitmap.BitRange(f.EndPieceIndex()-1), bitmap.ToEnd)
|
|
|
|
//left += int64(numPiecesSpanned-2-pieceIndex(completedMiddlePieces.GetCardinality())) * torrentUsualPieceSize
|
2019-11-26 00:54:26 +00:00
|
|
|
return
|
|
|
|
}
|
|
|
|
|
2020-03-24 00:19:11 +00:00
|
|
|
func (f *File) bytesLeft() (left int64) {
|
2023-07-22 16:30:45 +00:00
|
|
|
return fileBytesLeft(int64(f.t.usualPieceSize()), f.BeginPieceIndex(), f.EndPieceIndex(), f.offset, f.length, &f.t._completedPieces, func(pieceIndex int) int64 {
|
|
|
|
return int64(f.t.piece(pieceIndex).numDirtyBytes())
|
|
|
|
})
|
2020-03-24 00:19:11 +00:00
|
|
|
}
|
|
|
|
|
2015-08-03 14:45:15 +00:00
|
|
|
// The relative file path for a multi-file torrent, and the torrent name for a
|
2021-08-01 12:01:24 +00:00
|
|
|
// single-file torrent. Dir separators are '/'.
|
2015-08-03 14:45:15 +00:00
|
|
|
func (f *File) DisplayPath() string {
|
2021-08-01 12:01:24 +00:00
|
|
|
return f.displayPath
|
2015-08-03 14:45:15 +00:00
|
|
|
}
|
|
|
|
|
2018-01-07 00:57:02 +00:00
|
|
|
// The download status of a piece that comprises part of a File.
|
2015-04-14 13:59:41 +00:00
|
|
|
type FilePieceState struct {
|
2015-06-01 08:22:12 +00:00
|
|
|
Bytes int64 // Bytes within the piece that are part of this File.
|
|
|
|
PieceState
|
2015-04-14 13:59:41 +00:00
|
|
|
}
|
|
|
|
|
2015-06-01 08:22:12 +00:00
|
|
|
// Returns the state of pieces in this file.
|
|
|
|
func (f *File) State() (ret []FilePieceState) {
|
2018-07-25 03:41:50 +00:00
|
|
|
f.t.cl.rLock()
|
|
|
|
defer f.t.cl.rUnlock()
|
2016-04-03 08:40:43 +00:00
|
|
|
pieceSize := int64(f.t.usualPieceSize())
|
2015-04-14 13:59:41 +00:00
|
|
|
off := f.offset % pieceSize
|
|
|
|
remaining := f.length
|
2018-07-11 23:15:15 +00:00
|
|
|
for i := pieceIndex(f.offset / pieceSize); ; i++ {
|
2015-04-14 13:59:41 +00:00
|
|
|
if remaining == 0 {
|
|
|
|
break
|
|
|
|
}
|
|
|
|
len1 := pieceSize - off
|
|
|
|
if len1 > remaining {
|
|
|
|
len1 = remaining
|
|
|
|
}
|
2016-04-03 08:40:43 +00:00
|
|
|
ps := f.t.pieceState(i)
|
2015-07-17 10:58:25 +00:00
|
|
|
ret = append(ret, FilePieceState{len1, ps})
|
2015-04-14 13:59:41 +00:00
|
|
|
off = 0
|
|
|
|
remaining -= len1
|
|
|
|
}
|
|
|
|
return
|
|
|
|
}
|
|
|
|
|
2016-03-19 06:40:30 +00:00
|
|
|
// Requests that all pieces containing data in the file be downloaded.
|
2016-01-18 14:28:56 +00:00
|
|
|
func (f *File) Download() {
|
2018-01-21 11:49:12 +00:00
|
|
|
f.SetPriority(PiecePriorityNormal)
|
2016-02-07 06:15:06 +00:00
|
|
|
}
|
|
|
|
|
2016-02-04 14:18:54 +00:00
|
|
|
func byteRegionExclusivePieces(off, size, pieceSize int64) (begin, end int) {
|
|
|
|
begin = int((off + pieceSize - 1) / pieceSize)
|
|
|
|
end = int((off + size) / pieceSize)
|
|
|
|
return
|
|
|
|
}
|
|
|
|
|
2018-01-21 11:49:12 +00:00
|
|
|
// Deprecated: Use File.SetPriority.
|
2016-02-04 14:18:54 +00:00
|
|
|
func (f *File) Cancel() {
|
2018-01-21 11:49:12 +00:00
|
|
|
f.SetPriority(PiecePriorityNone)
|
2016-02-04 14:18:54 +00:00
|
|
|
}
|
2018-01-06 05:37:13 +00:00
|
|
|
|
|
|
|
func (f *File) NewReader() Reader {
|
2021-09-09 07:41:12 +00:00
|
|
|
return f.t.newReader(f.Offset(), f.Length())
|
2018-01-06 05:37:13 +00:00
|
|
|
}
|
2018-01-21 11:49:12 +00:00
|
|
|
|
|
|
|
// Sets the minimum priority for pieces in the File.
|
|
|
|
func (f *File) SetPriority(prio piecePriority) {
|
2018-07-25 03:41:50 +00:00
|
|
|
f.t.cl.lock()
|
2021-09-13 11:17:54 +00:00
|
|
|
if prio != f.prio {
|
|
|
|
f.prio = prio
|
2022-03-17 03:59:02 +00:00
|
|
|
f.t.updatePiecePriorities(f.BeginPieceIndex(), f.EndPieceIndex(), "File.SetPriority")
|
2018-01-21 11:49:12 +00:00
|
|
|
}
|
2021-09-13 11:17:54 +00:00
|
|
|
f.t.cl.unlock()
|
2018-01-21 11:49:12 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// Returns the priority per File.SetPriority.
|
2021-09-13 11:17:54 +00:00
|
|
|
func (f *File) Priority() (prio piecePriority) {
|
2022-07-13 10:04:03 +00:00
|
|
|
f.t.cl.rLock()
|
2021-09-13 11:17:54 +00:00
|
|
|
prio = f.prio
|
2022-07-13 10:04:03 +00:00
|
|
|
f.t.cl.rUnlock()
|
2021-09-13 11:17:54 +00:00
|
|
|
return
|
2018-01-21 11:49:12 +00:00
|
|
|
}
|
|
|
|
|
2019-11-26 05:22:41 +00:00
|
|
|
// Returns the index of the first piece containing data for the file.
|
2022-03-17 03:59:02 +00:00
|
|
|
func (f *File) BeginPieceIndex() int {
|
2018-01-25 06:01:29 +00:00
|
|
|
if f.t.usualPieceSize() == 0 {
|
|
|
|
return 0
|
|
|
|
}
|
2018-07-17 11:28:01 +00:00
|
|
|
return pieceIndex(f.offset / int64(f.t.usualPieceSize()))
|
2018-01-21 11:49:12 +00:00
|
|
|
}
|
|
|
|
|
2019-11-26 05:22:41 +00:00
|
|
|
// Returns the index of the piece after the last one containing data for the file.
|
2022-03-17 03:59:02 +00:00
|
|
|
func (f *File) EndPieceIndex() int {
|
2018-01-25 06:01:29 +00:00
|
|
|
if f.t.usualPieceSize() == 0 {
|
|
|
|
return 0
|
|
|
|
}
|
2019-11-26 05:22:24 +00:00
|
|
|
return pieceIndex((f.offset + f.length + int64(f.t.usualPieceSize()) - 1) / int64(f.t.usualPieceSize()))
|
2018-01-21 11:49:12 +00:00
|
|
|
}
|