FedP2P/reader.go

200 lines
4.2 KiB
Go

package torrent
import (
"errors"
"io"
"log"
"os"
"sync"
)
// Accesses torrent data via a client.
type Reader struct {
t *Torrent
mu sync.Mutex
pos int64
responsive bool
readahead int64
}
var _ io.ReadCloser = &Reader{}
// Don't wait for pieces to complete and be verified. Read calls return as
// soon as they can when the underlying chunks become available.
func (r *Reader) SetResponsive() {
r.responsive = true
}
// Configure the number of bytes ahead of a read that should also be
// prioritized in preparation for further reads.
func (r *Reader) SetReadahead(readahead int64) {
r.mu.Lock()
defer r.mu.Unlock()
r.readahead = readahead
}
func (r *Reader) readable(off int64) (ret bool) {
if r.torrentClosed() {
return true
}
req, ok := r.t.torrent.offsetRequest(off)
if !ok {
panic(off)
}
if r.responsive {
return r.t.torrent.haveChunk(req)
}
return r.t.torrent.pieceComplete(int(req.Index))
}
// How many bytes are available to read. Max is the most we could require.
func (r *Reader) available(off, max int64) (ret int64) {
for max > 0 {
req, ok := r.t.torrent.offsetRequest(off)
if !ok {
break
}
if !r.t.torrent.haveChunk(req) {
break
}
len1 := int64(req.Length) - (off - r.t.torrent.requestOffset(req))
max -= len1
ret += len1
off += len1
}
// Ensure that ret hasn't exceeded our original max.
if max < 0 {
ret += max
}
return
}
func (r *Reader) tickleClient() {
r.t.torrent.readersChanged()
}
func (r *Reader) waitReadable(off int64) {
// We may have been sent back here because we were told we could read but
// it failed.
r.tickleClient()
r.t.cl.event.Wait()
}
func (r *Reader) Read(b []byte) (n int, err error) {
r.mu.Lock()
pos := r.pos
r.mu.Unlock()
n, err = r.readAt(b, pos)
r.mu.Lock()
r.pos += int64(n)
r.mu.Unlock()
r.posChanged()
return
}
// Safe to call with or without client lock.
func (r *Reader) torrentClosed() bool {
return r.t.torrent.isClosed()
}
// Wait until some data should be available to read. Tickles the client if it
// isn't. Returns how much should be readable without blocking.
func (r *Reader) waitAvailable(pos, wanted int64) (avail int64) {
r.t.cl.mu.Lock()
defer r.t.cl.mu.Unlock()
for !r.readable(pos) {
r.waitReadable(pos)
}
return r.available(pos, wanted)
}
// Performs at most one successful read to torrent storage.
func (r *Reader) readOnceAt(b []byte, pos int64) (n int, err error) {
if pos >= r.t.torrent.length {
err = io.EOF
return
}
for {
avail := r.waitAvailable(pos, int64(len(b)))
if avail == 0 {
if r.torrentClosed() {
err = errors.New("torrent closed")
return
}
}
b1 := b[:avail]
pi := int(pos / r.t.Info().PieceLength)
ip := r.t.Info().Piece(pi)
po := pos % ip.Length()
if int64(len(b1)) > ip.Length()-po {
b1 = b1[:ip.Length()-po]
}
n, err = r.t.torrent.readAt(b1, pos)
if n != 0 {
return
}
log.Printf("%s: error reading from torrent storage pos=%d: %s", r.t, pos, err)
r.t.cl.mu.Lock()
r.t.torrent.updatePieceCompletion(pi)
r.t.torrent.updatePiecePriority(pi)
r.t.cl.mu.Unlock()
}
}
// Must only return EOF at the end of the torrent. Fills b until error or
// valid EOF. Note that the Reader pos is not updated until the read
// completes, this may reduce piece priority recalculation, but also the
// effectiveness of readahead.
func (r *Reader) readAt(b []byte, pos int64) (n int, err error) {
for len(b) != 0 {
var n1 int
n1, err = r.readOnceAt(b, pos)
if n1 == 0 {
if err == nil {
panic("expected error")
}
break
}
b = b[n1:]
n += n1
pos += int64(n1)
}
if pos >= r.t.torrent.length {
err = io.EOF
} else if err == io.EOF {
err = io.ErrUnexpectedEOF
}
return
}
func (r *Reader) Close() error {
r.t.deleteReader(r)
r.t = nil
return nil
}
func (r *Reader) posChanged() {
r.t.cl.mu.Lock()
defer r.t.cl.mu.Unlock()
r.t.torrent.readersChanged()
}
func (r *Reader) Seek(off int64, whence int) (ret int64, err error) {
r.mu.Lock()
switch whence {
case os.SEEK_SET:
r.pos = off
case os.SEEK_CUR:
r.pos += off
case os.SEEK_END:
r.pos = r.t.torrent.Info.TotalLength() + off
default:
err = errors.New("bad whence")
}
ret = r.pos
r.mu.Unlock()
r.posChanged()
return
}