7 "github.com/anacrolix/missinggo/bitmap"
9 "github.com/anacrolix/torrent/metainfo"
10 pp "github.com/anacrolix/torrent/peer_protocol"
11 "github.com/anacrolix/torrent/storage"
14 // Describes the importance of obtaining a particular piece.
15 type piecePriority byte
17 func (pp *piecePriority) Raise(maybe piecePriority) bool {
25 // Priority for use in PriorityBitmap
26 func (me piecePriority) BitmapPriority() int {
31 PiecePriorityNone piecePriority = iota // Not wanted. Must be the zero value.
32 PiecePriorityNormal // Wanted.
33 PiecePriorityHigh // Wanted a lot.
34 PiecePriorityReadahead // May be required soon.
35 // Succeeds a piece where a read occurred. Currently the same as Now,
36 // apparently due to issues with caching.
38 PiecePriorityNow // A Reader is reading in this piece. Highest urgency.
42 // The completed piece SHA1 hash, from the metainfo "pieces" field.
47 // Chunks we've written to since the last check. The chunk offset and
48 // length can be determined by the request chunkSize in use.
49 dirtyChunks bitmap.Bitmap
54 storageCompletionOk bool
56 publicPieceState PieceState
57 priority piecePriority
59 pendingWritesMutex sync.Mutex
61 noPendingWrites sync.Cond
63 // Connections that have written data to this piece since its last check.
64 // This can include connections that have closed.
65 dirtiers map[*connection]struct{}
68 func (p *Piece) String() string {
69 return fmt.Sprintf("%s/%d", p.t.infoHash.HexString(), p.index)
72 func (p *Piece) Info() metainfo.Piece {
73 return p.t.info.Piece(p.index)
76 func (p *Piece) Storage() storage.Piece {
77 return p.t.storage.Piece(p.Info())
80 func (p *Piece) pendingChunkIndex(chunkIndex int) bool {
81 return !p.dirtyChunks.Contains(chunkIndex)
84 func (p *Piece) pendingChunk(cs chunkSpec, chunkSize pp.Integer) bool {
85 return p.pendingChunkIndex(chunkIndex(cs, chunkSize))
88 func (p *Piece) hasDirtyChunks() bool {
89 return p.dirtyChunks.Len() != 0
92 func (p *Piece) numDirtyChunks() (ret int) {
93 return p.dirtyChunks.Len()
96 func (p *Piece) unpendChunkIndex(i int) {
100 func (p *Piece) pendChunkIndex(i int) {
101 p.dirtyChunks.Remove(i)
104 func (p *Piece) numChunks() int {
105 return p.t.pieceNumChunks(p.index)
108 func (p *Piece) undirtiedChunkIndices() (ret bitmap.Bitmap) {
109 ret = p.dirtyChunks.Copy()
110 ret.FlipRange(0, p.numChunks())
114 func (p *Piece) incrementPendingWrites() {
115 p.pendingWritesMutex.Lock()
117 p.pendingWritesMutex.Unlock()
120 func (p *Piece) decrementPendingWrites() {
121 p.pendingWritesMutex.Lock()
122 if p.pendingWrites == 0 {
126 if p.pendingWrites == 0 {
127 p.noPendingWrites.Broadcast()
129 p.pendingWritesMutex.Unlock()
132 func (p *Piece) waitNoPendingWrites() {
133 p.pendingWritesMutex.Lock()
134 for p.pendingWrites != 0 {
135 p.noPendingWrites.Wait()
137 p.pendingWritesMutex.Unlock()
140 func (p *Piece) chunkIndexDirty(chunk int) bool {
141 return p.dirtyChunks.Contains(chunk)
144 func (p *Piece) chunkIndexSpec(chunk int) chunkSpec {
145 return chunkIndexSpec(chunk, p.length(), p.chunkSize())
148 func (p *Piece) numDirtyBytes() (ret pp.Integer) {
150 // if ret > p.length() {
151 // panic("too many dirty bytes")
154 numRegularDirtyChunks := p.numDirtyChunks()
155 if p.chunkIndexDirty(p.numChunks() - 1) {
156 numRegularDirtyChunks--
157 ret += p.chunkIndexSpec(p.lastChunkIndex()).Length
159 ret += pp.Integer(numRegularDirtyChunks) * p.chunkSize()
163 func (p *Piece) length() pp.Integer {
164 return p.t.pieceLength(p.index)
167 func (p *Piece) chunkSize() pp.Integer {
171 func (p *Piece) lastChunkIndex() int {
172 return p.numChunks() - 1
175 func (p *Piece) bytesLeft() (ret pp.Integer) {
176 if p.t.pieceComplete(p.index) {
179 return p.length() - p.numDirtyBytes()
182 func (p *Piece) VerifyData() {
184 defer p.t.cl.mu.Unlock()
185 target := p.numVerifies + 1
189 // log.Printf("target: %d", target)
190 p.t.queuePieceCheck(p.index)
191 for p.numVerifies < target {
192 // log.Printf("got %d verifies", p.numVerifies)
198 func (p *Piece) queuedForHash() bool {
199 return p.t.piecesQueuedForHash.Get(p.index)
202 func (p *Piece) torrentBeginOffset() int64 {
203 return int64(p.index) * p.t.info.PieceLength
206 func (p *Piece) torrentEndOffset() int64 {
207 return p.torrentBeginOffset() + int64(p.length())
210 func (p *Piece) SetPriority(prio piecePriority) {
212 defer p.t.cl.mu.Unlock()
214 p.t.updatePiecePriority(p.index)
217 func (p *Piece) uncachedPriority() (ret piecePriority) {
218 if p.t.pieceComplete(p.index) {
219 return PiecePriorityNone
221 for _, f := range p.files {
224 if p.t.readerNowPieces.Contains(p.index) {
225 ret.Raise(PiecePriorityNow)
227 // if t.readerNowPieces.Contains(piece - 1) {
228 // return PiecePriorityNext
230 if p.t.readerReadaheadPieces.Contains(p.index) {
231 ret.Raise(PiecePriorityReadahead)
233 ret.Raise(p.priority)
237 func (p *Piece) completion() (ret storage.Completion) {
238 ret.Complete = p.t.pieceComplete(p.index)
239 ret.Ok = p.storageCompletionOk