status-im/torrent
2
0
Fork 0
mirror of synced 2025-02-24 06:38:14 +00:00
Code Issues Packages Projects Releases Wiki Activity

Remove unused code

Browse Source
This commit is contained in:
Matt Joiner 2021-08-19 16:06:46 +10:00
parent 5cfe54251a
commit 72c74f7800
5 changed files with 0 additions and 59 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

20
client.go
View File

@ -444,18 +444,6 @@ func (cl *Client) wantConns() bool {
return false return false
} }
func (cl *Client) waitAccept() {
for {
if cl.closed.IsSet() {
return
}
if cl.wantConns() {
return
}
cl.event.Wait()
}
}
// TODO: Apply filters for non-standard networks, particularly rate-limiting. // TODO: Apply filters for non-standard networks, particularly rate-limiting.
func (cl *Client) rejectAccepted(conn net.Conn) error { func (cl *Client) rejectAccepted(conn net.Conn) error {
if !cl.wantConns() { if !cl.wantConns() {
@ -1427,14 +1415,6 @@ func firstNotNil(ips ...net.IP) net.IP {
return nil return nil
} }
func (cl *Client) eachDialer(f func(Dialer) bool) {
for _, s := range cl.dialers {
if !f(s) {
break
}
}
}
func (cl *Client) eachListener(f func(Listener) bool) { func (cl *Client) eachListener(f func(Listener) bool) {
for _, s := range cl.listeners { for _, s := range cl.listeners {
if !f(s) { if !f(s) {

12
closewrapper.go
View File

@ -1,12 +0,0 @@
package torrent
import "net"
type closeWrapper struct {
net.Conn
closer func() error
}
func (me closeWrapper) Close() error {
return me.closer()
}

8
peerconn.go
View File

@ -1583,10 +1583,6 @@ func (l connectionTrust) Less(r connectionTrust) bool {
return multiless.New().Bool(l.Implicit, r.Implicit).Int64(l.NetGoodPiecesDirted, r.NetGoodPiecesDirted).Less() return multiless.New().Bool(l.Implicit, r.Implicit).Int64(l.NetGoodPiecesDirted, r.NetGoodPiecesDirted).Less()
} }
func (cn *Peer) peerMaxRequests() int {
return cn.PeerMaxRequests
}
// Returns the pieces the peer could have based on their claims. If we don't know how many pieces // Returns the pieces the peer could have based on their claims. If we don't know how many pieces
// are in the torrent, it could be a very large range the peer has sent HaveAll. // are in the torrent, it could be a very large range the peer has sent HaveAll.
func (cn *PeerConn) PeerPieces() bitmap.Bitmap { func (cn *PeerConn) PeerPieces() bitmap.Bitmap {
@ -1608,10 +1604,6 @@ func (cn *Peer) newPeerPieces() bitmap.Bitmap {
return ret return ret
} }
func (cn *Peer) pieceRequestOrder() *prioritybitmap.PriorityBitmap {
return &cn._pieceRequestOrder
}
func (cn *Peer) stats() *ConnStats { func (cn *Peer) stats() *ConnStats {
return &cn._stats return &cn._stats
} }

11
piece.go
View File

@ -115,13 +115,6 @@ func (p *Piece) chunkIndexSpec(chunk pp.Integer) ChunkSpec {
return chunkIndexSpec(chunk, p.length(), p.chunkSize()) return chunkIndexSpec(chunk, p.length(), p.chunkSize())
} }
func (p *Piece) chunkIndexRequest(chunkIndex pp.Integer) Request {
return Request{
pp.Integer(p.index),
p.chunkIndexSpec(chunkIndex),
}
}
func (p *Piece) numDirtyBytes() (ret pp.Integer) { func (p *Piece) numDirtyBytes() (ret pp.Integer) {
// defer func() { // defer func() {
// if ret > p.length() { // if ret > p.length() {
@ -237,10 +230,6 @@ func (p *Piece) allChunksDirty() bool {
return p._dirtyChunks.Len() == bitmap.BitRange(p.numChunks()) return p._dirtyChunks.Len() == bitmap.BitRange(p.numChunks())
} }
func (p *Piece) dirtyChunks() bitmap.Bitmap {
return p._dirtyChunks
}
func (p *Piece) State() PieceState { func (p *Piece) State() PieceState {
return p.t.PieceState(p.index) return p.t.PieceState(p.index)
} }

8
torrent.go
View File

@ -176,14 +176,6 @@ func (t *Torrent) incPieceAvailability(i pieceIndex) {
} }
} }
func (t *Torrent) numConns() int {
return len(t.conns)
}
func (t *Torrent) numReaders() int {
return len(t.readers)
}
func (t *Torrent) readerNowPieces() bitmap.Bitmap { func (t *Torrent) readerNowPieces() bitmap.Bitmap {
return t._readerNowPieces return t._readerNowPieces
} }