2015-04-14 21:59:41 +08:00
|
|
|
package torrent
|
|
|
|
|
2015-08-03 22:45:15 +08:00
|
|
|
import (
|
|
|
|
"strings"
|
|
|
|
|
2020-01-10 12:09:21 +08:00
|
|
|
"github.com/anacrolix/missinggo/v2/bitmap"
|
2019-11-26 08:54:26 +08:00
|
|
|
|
2015-08-03 22:45:15 +08:00
|
|
|
"github.com/anacrolix/torrent/metainfo"
|
|
|
|
)
|
2015-04-14 21:59:41 +08:00
|
|
|
|
|
|
|
// Provides access to regions of torrent data that correspond to its files.
|
|
|
|
type File struct {
|
2016-04-03 16:40:43 +08:00
|
|
|
t *Torrent
|
2015-04-14 21:59:41 +08:00
|
|
|
path string
|
|
|
|
offset int64
|
|
|
|
length int64
|
|
|
|
fi metainfo.FileInfo
|
2018-01-21 19:49:12 +08:00
|
|
|
prio piecePriority
|
2015-04-14 21:59:41 +08:00
|
|
|
}
|
|
|
|
|
2016-04-03 16:40:43 +08:00
|
|
|
func (f *File) Torrent() *Torrent {
|
2015-11-12 00:25:04 +08:00
|
|
|
return f.t
|
|
|
|
}
|
|
|
|
|
2018-01-07 08:57:02 +08:00
|
|
|
// Data for this file begins this many bytes into the Torrent.
|
2015-04-14 21:59:41 +08:00
|
|
|
func (f *File) Offset() int64 {
|
|
|
|
return f.offset
|
|
|
|
}
|
|
|
|
|
2018-01-07 08:57:02 +08:00
|
|
|
// The FileInfo from the metainfo.Info to which this file corresponds.
|
2016-04-19 15:20:31 +08:00
|
|
|
func (f File) FileInfo() metainfo.FileInfo {
|
2015-04-14 21:59:41 +08:00
|
|
|
return f.fi
|
|
|
|
}
|
|
|
|
|
2018-01-07 08:57:02 +08:00
|
|
|
// The file's path components joined by '/'.
|
2016-04-19 15:20:31 +08:00
|
|
|
func (f File) Path() string {
|
2015-04-14 21:59:41 +08:00
|
|
|
return f.path
|
|
|
|
}
|
|
|
|
|
2018-01-07 08:57:02 +08:00
|
|
|
// The file's length in bytes.
|
2015-04-14 21:59:41 +08:00
|
|
|
func (f *File) Length() int64 {
|
|
|
|
return f.length
|
|
|
|
}
|
|
|
|
|
2019-11-26 08:54:26 +08:00
|
|
|
// Number of bytes of the entire file we have completed. This is the sum of
|
|
|
|
// completed pieces, and dirtied chunks of incomplete pieces.
|
|
|
|
func (f *File) BytesCompleted() int64 {
|
|
|
|
f.t.cl.rLock()
|
|
|
|
defer f.t.cl.rUnlock()
|
|
|
|
return f.bytesCompleted()
|
|
|
|
}
|
|
|
|
|
|
|
|
func (f *File) bytesCompleted() int64 {
|
|
|
|
return f.length - f.bytesLeft()
|
|
|
|
}
|
|
|
|
|
2020-03-24 08:19:11 +08:00
|
|
|
func fileBytesLeft(pieceSize int64, firstPieceIndex int, endPieceIndex int, fileOffset int64, fileLength int64, completedPieces bitmap.Bitmap) (left int64) {
|
|
|
|
endPieceIndex--
|
|
|
|
bitmap.Flip(completedPieces, firstPieceIndex+1, endPieceIndex).IterTyped(func(piece int) bool {
|
2019-11-30 16:53:35 +08:00
|
|
|
if piece >= endPieceIndex {
|
|
|
|
return false
|
|
|
|
}
|
|
|
|
if piece > firstPieceIndex {
|
|
|
|
left += pieceSize
|
2019-11-26 08:54:26 +08:00
|
|
|
}
|
|
|
|
return true
|
|
|
|
})
|
2020-03-24 08:19:11 +08:00
|
|
|
if !completedPieces.Get(firstPieceIndex) {
|
|
|
|
left += pieceSize - (fileOffset % pieceSize)
|
2019-11-30 16:53:35 +08:00
|
|
|
}
|
2020-03-24 08:19:11 +08:00
|
|
|
if !completedPieces.Get(endPieceIndex) {
|
|
|
|
left += (fileOffset + fileLength) % pieceSize
|
2019-11-30 16:53:35 +08:00
|
|
|
}
|
2019-11-26 08:54:26 +08:00
|
|
|
return
|
|
|
|
}
|
|
|
|
|
2020-03-24 08:19:11 +08:00
|
|
|
func (f *File) bytesLeft() (left int64) {
|
|
|
|
return fileBytesLeft(int64(f.t.usualPieceSize()), f.firstPieceIndex(), f.endPieceIndex(), f.offset, f.length, f.t._completedPieces)
|
|
|
|
}
|
|
|
|
|
2015-08-03 22:45:15 +08:00
|
|
|
// The relative file path for a multi-file torrent, and the torrent name for a
|
|
|
|
// single-file torrent.
|
|
|
|
func (f *File) DisplayPath() string {
|
|
|
|
fip := f.FileInfo().Path
|
|
|
|
if len(fip) == 0 {
|
2018-01-25 13:58:49 +08:00
|
|
|
return f.t.info.Name
|
2015-08-03 22:45:15 +08:00
|
|
|
}
|
|
|
|
return strings.Join(fip, "/")
|
|
|
|
|
|
|
|
}
|
|
|
|
|
2018-01-07 08:57:02 +08:00
|
|
|
// The download status of a piece that comprises part of a File.
|
2015-04-14 21:59:41 +08:00
|
|
|
type FilePieceState struct {
|
2015-06-01 16:22:12 +08:00
|
|
|
Bytes int64 // Bytes within the piece that are part of this File.
|
|
|
|
PieceState
|
2015-04-14 21:59:41 +08:00
|
|
|
}
|
|
|
|
|
2015-06-01 16:22:12 +08:00
|
|
|
// Returns the state of pieces in this file.
|
|
|
|
func (f *File) State() (ret []FilePieceState) {
|
2018-07-25 11:41:50 +08:00
|
|
|
f.t.cl.rLock()
|
|
|
|
defer f.t.cl.rUnlock()
|
2016-04-03 16:40:43 +08:00
|
|
|
pieceSize := int64(f.t.usualPieceSize())
|
2015-04-14 21:59:41 +08:00
|
|
|
off := f.offset % pieceSize
|
|
|
|
remaining := f.length
|
2018-07-12 07:15:15 +08:00
|
|
|
for i := pieceIndex(f.offset / pieceSize); ; i++ {
|
2015-04-14 21:59:41 +08:00
|
|
|
if remaining == 0 {
|
|
|
|
break
|
|
|
|
}
|
|
|
|
len1 := pieceSize - off
|
|
|
|
if len1 > remaining {
|
|
|
|
len1 = remaining
|
|
|
|
}
|
2016-04-03 16:40:43 +08:00
|
|
|
ps := f.t.pieceState(i)
|
2015-07-17 18:58:25 +08:00
|
|
|
ret = append(ret, FilePieceState{len1, ps})
|
2015-04-14 21:59:41 +08:00
|
|
|
off = 0
|
|
|
|
remaining -= len1
|
|
|
|
}
|
|
|
|
return
|
|
|
|
}
|
|
|
|
|
2016-03-19 14:40:30 +08:00
|
|
|
// Requests that all pieces containing data in the file be downloaded.
|
2016-01-18 22:28:56 +08:00
|
|
|
func (f *File) Download() {
|
2018-01-21 19:49:12 +08:00
|
|
|
f.SetPriority(PiecePriorityNormal)
|
2016-02-07 14:15:06 +08:00
|
|
|
}
|
|
|
|
|
2016-02-04 22:18:54 +08: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 19:49:12 +08:00
|
|
|
// Deprecated: Use File.SetPriority.
|
2016-02-04 22:18:54 +08:00
|
|
|
func (f *File) Cancel() {
|
2018-01-21 19:49:12 +08:00
|
|
|
f.SetPriority(PiecePriorityNone)
|
2016-02-04 22:18:54 +08:00
|
|
|
}
|
2018-01-06 13:37:13 +08:00
|
|
|
|
|
|
|
func (f *File) NewReader() Reader {
|
2018-01-06 20:15:41 +08:00
|
|
|
tr := reader{
|
2018-07-25 11:41:50 +08:00
|
|
|
mu: f.t.cl.locker(),
|
2018-01-06 20:15:41 +08:00
|
|
|
t: f.t,
|
|
|
|
readahead: 5 * 1024 * 1024,
|
|
|
|
offset: f.Offset(),
|
|
|
|
length: f.Length(),
|
|
|
|
}
|
|
|
|
f.t.addReader(&tr)
|
|
|
|
return &tr
|
2018-01-06 13:37:13 +08:00
|
|
|
}
|
2018-01-21 19:49:12 +08:00
|
|
|
|
|
|
|
// Sets the minimum priority for pieces in the File.
|
|
|
|
func (f *File) SetPriority(prio piecePriority) {
|
2018-07-25 11:41:50 +08:00
|
|
|
f.t.cl.lock()
|
|
|
|
defer f.t.cl.unlock()
|
2018-01-21 19:49:12 +08:00
|
|
|
if prio == f.prio {
|
|
|
|
return
|
|
|
|
}
|
|
|
|
f.prio = prio
|
2018-07-12 07:15:15 +08:00
|
|
|
f.t.updatePiecePriorities(f.firstPieceIndex(), f.endPieceIndex())
|
2018-01-21 19:49:12 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
// Returns the priority per File.SetPriority.
|
|
|
|
func (f *File) Priority() piecePriority {
|
2018-07-25 11:41:50 +08:00
|
|
|
f.t.cl.lock()
|
|
|
|
defer f.t.cl.unlock()
|
2018-01-21 19:49:12 +08:00
|
|
|
return f.prio
|
|
|
|
}
|
|
|
|
|
2019-11-26 13:22:41 +08:00
|
|
|
// Returns the index of the first piece containing data for the file.
|
2018-07-17 19:28:01 +08:00
|
|
|
func (f *File) firstPieceIndex() pieceIndex {
|
2018-01-25 14:01:29 +08:00
|
|
|
if f.t.usualPieceSize() == 0 {
|
|
|
|
return 0
|
|
|
|
}
|
2018-07-17 19:28:01 +08:00
|
|
|
return pieceIndex(f.offset / int64(f.t.usualPieceSize()))
|
2018-01-21 19:49:12 +08:00
|
|
|
}
|
|
|
|
|
2019-11-26 13:22:41 +08:00
|
|
|
// Returns the index of the piece after the last one containing data for the file.
|
2018-07-17 19:28:01 +08:00
|
|
|
func (f *File) endPieceIndex() pieceIndex {
|
2018-01-25 14:01:29 +08:00
|
|
|
if f.t.usualPieceSize() == 0 {
|
|
|
|
return 0
|
|
|
|
}
|
2019-11-26 13:22:24 +08:00
|
|
|
return pieceIndex((f.offset + f.length + int64(f.t.usualPieceSize()) - 1) / int64(f.t.usualPieceSize()))
|
2018-01-21 19:49:12 +08:00
|
|
|
}
|