2015-04-08 00:14:35 +08:00
|
|
|
package torrent
|
|
|
|
|
|
|
|
import (
|
2017-10-12 13:09:32 +08:00
|
|
|
"fmt"
|
2015-04-08 00:14:35 +08:00
|
|
|
"sync"
|
2015-05-16 08:51:48 +08:00
|
|
|
|
2016-02-05 12:45:32 +08:00
|
|
|
"github.com/anacrolix/missinggo/bitmap"
|
2016-01-13 14:11:59 +08:00
|
|
|
|
2016-03-28 17:38:30 +08:00
|
|
|
"github.com/anacrolix/torrent/metainfo"
|
2015-05-16 08:51:48 +08:00
|
|
|
pp "github.com/anacrolix/torrent/peer_protocol"
|
2016-03-28 17:38:30 +08:00
|
|
|
"github.com/anacrolix/torrent/storage"
|
2015-04-08 00:14:35 +08:00
|
|
|
)
|
|
|
|
|
2018-01-25 14:02:52 +08:00
|
|
|
// Describes the importance of obtaining a particular piece.
|
2015-04-08 00:14:35 +08:00
|
|
|
type piecePriority byte
|
|
|
|
|
2018-01-25 14:18:36 +08:00
|
|
|
func (pp *piecePriority) Raise(maybe piecePriority) bool {
|
2016-04-19 12:11:11 +08:00
|
|
|
if maybe > *pp {
|
|
|
|
*pp = maybe
|
2018-01-25 14:18:36 +08:00
|
|
|
return true
|
2016-02-01 19:06:13 +08:00
|
|
|
}
|
2018-01-25 14:18:36 +08:00
|
|
|
return false
|
2016-02-01 19:06:13 +08:00
|
|
|
}
|
|
|
|
|
2018-01-12 09:24:37 +08:00
|
|
|
// Priority for use in PriorityBitmap
|
|
|
|
func (me piecePriority) BitmapPriority() int {
|
|
|
|
return -int(me)
|
|
|
|
}
|
|
|
|
|
2015-04-08 00:14:35 +08:00
|
|
|
const (
|
2018-01-21 19:49:12 +08:00
|
|
|
PiecePriorityNone piecePriority = iota // Not wanted. Must be the zero value.
|
2015-06-01 16:22:12 +08:00
|
|
|
PiecePriorityNormal // Wanted.
|
2018-01-12 09:24:37 +08:00
|
|
|
PiecePriorityHigh // Wanted a lot.
|
2015-06-01 16:22:12 +08:00
|
|
|
PiecePriorityReadahead // May be required soon.
|
2018-01-12 09:24:37 +08:00
|
|
|
// Succeeds a piece where a read occurred. Currently the same as Now,
|
|
|
|
// apparently due to issues with caching.
|
2016-08-30 14:55:50 +08:00
|
|
|
PiecePriorityNext
|
2018-01-12 09:24:37 +08:00
|
|
|
PiecePriorityNow // A Reader is reading in this piece. Highest urgency.
|
2015-04-08 00:14:35 +08:00
|
|
|
)
|
|
|
|
|
2017-09-15 17:35:16 +08:00
|
|
|
type Piece struct {
|
2015-06-16 14:57:47 +08:00
|
|
|
// The completed piece SHA1 hash, from the metainfo "pieces" field.
|
2017-09-15 17:35:16 +08:00
|
|
|
hash metainfo.Hash
|
2016-04-03 16:40:43 +08:00
|
|
|
t *Torrent
|
2016-02-07 18:58:48 +08:00
|
|
|
index int
|
2018-01-21 19:49:12 +08:00
|
|
|
files []*File
|
2016-01-13 14:11:59 +08:00
|
|
|
// Chunks we've written to since the last check. The chunk offset and
|
|
|
|
// length can be determined by the request chunkSize in use.
|
2017-09-15 17:35:16 +08:00
|
|
|
dirtyChunks bitmap.Bitmap
|
2017-09-15 17:22:32 +08:00
|
|
|
|
2017-10-12 13:09:32 +08:00
|
|
|
hashing bool
|
|
|
|
everHashed bool
|
|
|
|
numVerifies int64
|
|
|
|
storageCompletionOk bool
|
2017-09-15 17:22:32 +08:00
|
|
|
|
2017-09-15 17:35:16 +08:00
|
|
|
publicPieceState PieceState
|
2016-02-01 18:11:41 +08:00
|
|
|
priority piecePriority
|
2015-08-05 00:40:46 +08:00
|
|
|
|
|
|
|
pendingWritesMutex sync.Mutex
|
|
|
|
pendingWrites int
|
|
|
|
noPendingWrites sync.Cond
|
2015-04-08 00:14:35 +08:00
|
|
|
}
|
|
|
|
|
2017-10-12 13:09:32 +08:00
|
|
|
func (p *Piece) String() string {
|
|
|
|
return fmt.Sprintf("%s/%d", p.t.infoHash.HexString(), p.index)
|
|
|
|
}
|
|
|
|
|
2017-09-15 17:35:16 +08:00
|
|
|
func (p *Piece) Info() metainfo.Piece {
|
2016-04-03 14:50:53 +08:00
|
|
|
return p.t.info.Piece(p.index)
|
2016-03-28 17:38:30 +08:00
|
|
|
}
|
|
|
|
|
2017-09-15 17:35:16 +08:00
|
|
|
func (p *Piece) Storage() storage.Piece {
|
2016-03-28 17:38:30 +08:00
|
|
|
return p.t.storage.Piece(p.Info())
|
|
|
|
}
|
|
|
|
|
2017-09-15 17:35:16 +08:00
|
|
|
func (p *Piece) pendingChunkIndex(chunkIndex int) bool {
|
|
|
|
return !p.dirtyChunks.Contains(chunkIndex)
|
2016-02-05 12:45:32 +08:00
|
|
|
}
|
|
|
|
|
2017-09-15 17:35:16 +08:00
|
|
|
func (p *Piece) pendingChunk(cs chunkSpec, chunkSize pp.Integer) bool {
|
2016-02-05 12:45:32 +08:00
|
|
|
return p.pendingChunkIndex(chunkIndex(cs, chunkSize))
|
2015-05-16 08:51:48 +08:00
|
|
|
}
|
|
|
|
|
2017-09-15 17:35:16 +08:00
|
|
|
func (p *Piece) hasDirtyChunks() bool {
|
|
|
|
return p.dirtyChunks.Len() != 0
|
2016-02-04 22:18:54 +08:00
|
|
|
}
|
|
|
|
|
2017-09-15 17:35:16 +08:00
|
|
|
func (p *Piece) numDirtyChunks() (ret int) {
|
|
|
|
return p.dirtyChunks.Len()
|
2015-05-16 08:51:48 +08:00
|
|
|
}
|
|
|
|
|
2017-09-15 17:35:16 +08:00
|
|
|
func (p *Piece) unpendChunkIndex(i int) {
|
|
|
|
p.dirtyChunks.Add(i)
|
2015-05-16 08:51:48 +08:00
|
|
|
}
|
|
|
|
|
2017-09-15 17:35:16 +08:00
|
|
|
func (p *Piece) pendChunkIndex(i int) {
|
|
|
|
p.dirtyChunks.Remove(i)
|
2016-01-28 02:54:48 +08:00
|
|
|
}
|
|
|
|
|
2017-09-15 17:35:16 +08:00
|
|
|
func (p *Piece) numChunks() int {
|
2016-02-07 18:58:48 +08:00
|
|
|
return p.t.pieceNumChunks(p.index)
|
|
|
|
}
|
|
|
|
|
2017-09-15 17:35:16 +08:00
|
|
|
func (p *Piece) undirtiedChunkIndices() (ret bitmap.Bitmap) {
|
|
|
|
ret = p.dirtyChunks.Copy()
|
2016-02-07 18:58:48 +08:00
|
|
|
ret.FlipRange(0, p.numChunks())
|
2015-04-08 00:14:35 +08:00
|
|
|
return
|
|
|
|
}
|
2016-01-25 04:22:33 +08:00
|
|
|
|
2017-09-15 17:35:16 +08:00
|
|
|
func (p *Piece) incrementPendingWrites() {
|
2016-01-25 04:22:33 +08:00
|
|
|
p.pendingWritesMutex.Lock()
|
|
|
|
p.pendingWrites++
|
|
|
|
p.pendingWritesMutex.Unlock()
|
|
|
|
}
|
|
|
|
|
2017-09-15 17:35:16 +08:00
|
|
|
func (p *Piece) decrementPendingWrites() {
|
2016-01-25 04:22:33 +08:00
|
|
|
p.pendingWritesMutex.Lock()
|
|
|
|
if p.pendingWrites == 0 {
|
|
|
|
panic("assertion")
|
|
|
|
}
|
|
|
|
p.pendingWrites--
|
|
|
|
if p.pendingWrites == 0 {
|
|
|
|
p.noPendingWrites.Broadcast()
|
|
|
|
}
|
|
|
|
p.pendingWritesMutex.Unlock()
|
|
|
|
}
|
|
|
|
|
2017-09-15 17:35:16 +08:00
|
|
|
func (p *Piece) waitNoPendingWrites() {
|
2016-01-25 04:22:33 +08:00
|
|
|
p.pendingWritesMutex.Lock()
|
|
|
|
for p.pendingWrites != 0 {
|
|
|
|
p.noPendingWrites.Wait()
|
|
|
|
}
|
|
|
|
p.pendingWritesMutex.Unlock()
|
|
|
|
}
|
2016-03-22 10:11:36 +08:00
|
|
|
|
2017-09-15 17:35:16 +08:00
|
|
|
func (p *Piece) chunkIndexDirty(chunk int) bool {
|
|
|
|
return p.dirtyChunks.Contains(chunk)
|
2016-03-22 10:11:36 +08:00
|
|
|
}
|
|
|
|
|
2017-09-15 17:35:16 +08:00
|
|
|
func (p *Piece) chunkIndexSpec(chunk int) chunkSpec {
|
2016-03-22 10:11:36 +08:00
|
|
|
return chunkIndexSpec(chunk, p.length(), p.chunkSize())
|
|
|
|
}
|
|
|
|
|
2017-09-15 17:35:16 +08:00
|
|
|
func (p *Piece) numDirtyBytes() (ret pp.Integer) {
|
2017-09-23 13:28:13 +08:00
|
|
|
// defer func() {
|
|
|
|
// if ret > p.length() {
|
|
|
|
// panic("too many dirty bytes")
|
|
|
|
// }
|
|
|
|
// }()
|
2016-03-22 10:11:36 +08:00
|
|
|
numRegularDirtyChunks := p.numDirtyChunks()
|
|
|
|
if p.chunkIndexDirty(p.numChunks() - 1) {
|
|
|
|
numRegularDirtyChunks--
|
|
|
|
ret += p.chunkIndexSpec(p.lastChunkIndex()).Length
|
|
|
|
}
|
|
|
|
ret += pp.Integer(numRegularDirtyChunks) * p.chunkSize()
|
|
|
|
return
|
|
|
|
}
|
|
|
|
|
2017-09-15 17:35:16 +08:00
|
|
|
func (p *Piece) length() pp.Integer {
|
2016-03-22 10:11:36 +08:00
|
|
|
return p.t.pieceLength(p.index)
|
|
|
|
}
|
|
|
|
|
2017-09-15 17:35:16 +08:00
|
|
|
func (p *Piece) chunkSize() pp.Integer {
|
2016-03-22 10:11:36 +08:00
|
|
|
return p.t.chunkSize
|
|
|
|
}
|
|
|
|
|
2017-09-15 17:35:16 +08:00
|
|
|
func (p *Piece) lastChunkIndex() int {
|
2016-03-22 10:11:36 +08:00
|
|
|
return p.numChunks() - 1
|
|
|
|
}
|
|
|
|
|
2017-09-15 17:35:16 +08:00
|
|
|
func (p *Piece) bytesLeft() (ret pp.Integer) {
|
2016-03-22 10:11:36 +08:00
|
|
|
if p.t.pieceComplete(p.index) {
|
|
|
|
return 0
|
|
|
|
}
|
|
|
|
return p.length() - p.numDirtyBytes()
|
|
|
|
}
|
2017-09-15 17:22:32 +08:00
|
|
|
|
2017-09-15 17:35:16 +08:00
|
|
|
func (p *Piece) VerifyData() {
|
2017-09-15 17:22:32 +08:00
|
|
|
p.t.cl.mu.Lock()
|
|
|
|
defer p.t.cl.mu.Unlock()
|
|
|
|
target := p.numVerifies + 1
|
2017-09-15 17:35:16 +08:00
|
|
|
if p.hashing {
|
2017-09-15 17:22:32 +08:00
|
|
|
target++
|
|
|
|
}
|
2017-11-07 13:00:08 +08:00
|
|
|
// log.Printf("target: %d", target)
|
2017-09-15 17:22:32 +08:00
|
|
|
p.t.queuePieceCheck(p.index)
|
|
|
|
for p.numVerifies < target {
|
2017-11-07 13:00:08 +08:00
|
|
|
// log.Printf("got %d verifies", p.numVerifies)
|
2017-09-15 17:22:32 +08:00
|
|
|
p.t.cl.event.Wait()
|
|
|
|
}
|
2017-11-07 13:00:08 +08:00
|
|
|
// log.Print("done")
|
2017-10-12 13:09:32 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
func (p *Piece) queuedForHash() bool {
|
|
|
|
return p.t.piecesQueuedForHash.Get(p.index)
|
2017-09-15 17:22:32 +08:00
|
|
|
}
|
2018-01-21 19:49:12 +08:00
|
|
|
|
|
|
|
func (p *Piece) torrentBeginOffset() int64 {
|
|
|
|
return int64(p.index) * p.t.info.PieceLength
|
|
|
|
}
|
|
|
|
|
|
|
|
func (p *Piece) torrentEndOffset() int64 {
|
|
|
|
return p.torrentBeginOffset() + int64(p.length())
|
|
|
|
}
|
2018-01-25 14:18:36 +08:00
|
|
|
|
|
|
|
func (p *Piece) SetPriority(prio piecePriority) {
|
|
|
|
p.t.cl.mu.Lock()
|
|
|
|
defer p.t.cl.mu.Unlock()
|
|
|
|
p.priority = prio
|
|
|
|
p.t.updatePiecePriority(p.index)
|
|
|
|
}
|
|
|
|
|
|
|
|
func (p *Piece) uncachedPriority() (ret piecePriority) {
|
|
|
|
if p.t.pieceComplete(p.index) {
|
|
|
|
return PiecePriorityNone
|
|
|
|
}
|
|
|
|
for _, f := range p.files {
|
|
|
|
ret.Raise(f.prio)
|
|
|
|
}
|
|
|
|
if p.t.readerNowPieces.Contains(p.index) {
|
|
|
|
ret.Raise(PiecePriorityNow)
|
|
|
|
}
|
|
|
|
// if t.readerNowPieces.Contains(piece - 1) {
|
|
|
|
// return PiecePriorityNext
|
|
|
|
// }
|
|
|
|
if p.t.readerReadaheadPieces.Contains(p.index) {
|
|
|
|
ret.Raise(PiecePriorityReadahead)
|
|
|
|
}
|
|
|
|
ret.Raise(p.priority)
|
|
|
|
return
|
|
|
|
}
|
2018-01-28 12:58:55 +08:00
|
|
|
|
|
|
|
func (p *Piece) completion() (ret storage.Completion) {
|
|
|
|
ret.Complete = p.t.pieceComplete(p.index)
|
|
|
|
ret.Ok = p.storageCompletionOk
|
|
|
|
return
|
|
|
|
}
|