2015-04-12 03:38:25 -07:00
|
|
|
package downloader
|
|
|
|
|
|
|
|
import (
|
2015-04-17 16:10:32 -07:00
|
|
|
"errors"
|
2015-04-18 08:35:03 -07:00
|
|
|
"fmt"
|
2015-04-12 03:38:25 -07:00
|
|
|
"sync"
|
|
|
|
"sync/atomic"
|
|
|
|
"time"
|
|
|
|
|
|
|
|
"github.com/ethereum/go-ethereum/common"
|
|
|
|
"github.com/ethereum/go-ethereum/core/types"
|
|
|
|
"github.com/ethereum/go-ethereum/logger"
|
|
|
|
"github.com/ethereum/go-ethereum/logger/glog"
|
|
|
|
"gopkg.in/fatih/set.v0"
|
|
|
|
)
|
|
|
|
|
2015-04-13 07:38:32 -07:00
|
|
|
const (
|
2015-04-19 04:30:34 -07:00
|
|
|
maxBlockFetch = 256 // Amount of max blocks to be fetched per chunk
|
|
|
|
peerCountTimeout = 12 * time.Second // Amount of time it takes for the peer handler to ignore minDesiredPeerCount
|
|
|
|
hashTtl = 20 * time.Second // The amount of time it takes for a hash request to time out
|
2015-04-13 07:38:32 -07:00
|
|
|
)
|
2015-04-12 03:38:25 -07:00
|
|
|
|
2015-04-17 16:10:32 -07:00
|
|
|
var (
|
2015-04-19 08:34:32 -07:00
|
|
|
minDesiredPeerCount = 5 // Amount of peers desired to start syncing
|
|
|
|
blockTtl = 20 * time.Second // The amount of time it takes for a block request to time out
|
2015-04-19 04:30:34 -07:00
|
|
|
|
2015-04-30 15:23:51 -07:00
|
|
|
errLowTd = errors.New("peer's TD is too low")
|
|
|
|
errBusy = errors.New("busy")
|
|
|
|
errUnknownPeer = errors.New("peer's unknown or unhealthy")
|
|
|
|
ErrBadPeer = errors.New("action from bad peer ignored")
|
|
|
|
errNoPeers = errors.New("no peers to keep download active")
|
|
|
|
errPendingQueue = errors.New("pending items in queue")
|
|
|
|
errTimeout = errors.New("timeout")
|
|
|
|
errEmptyHashSet = errors.New("empty hash set by peer")
|
|
|
|
errPeersUnavailable = errors.New("no peers available or all peers tried for block download process")
|
|
|
|
errAlreadyInPool = errors.New("hash already in pool")
|
|
|
|
errBlockNumberOverflow = errors.New("received block which overflows")
|
2015-04-17 16:10:32 -07:00
|
|
|
)
|
|
|
|
|
2015-04-12 03:38:25 -07:00
|
|
|
type hashCheckFn func(common.Hash) bool
|
2015-04-30 15:23:51 -07:00
|
|
|
type getBlockFn func(common.Hash) *types.Block
|
2015-04-29 05:00:24 -07:00
|
|
|
type chainInsertFn func(types.Blocks) (int, error)
|
2015-04-12 03:38:25 -07:00
|
|
|
type hashIterFn func() (common.Hash, error)
|
|
|
|
|
2015-04-19 12:45:58 -07:00
|
|
|
type blockPack struct {
|
|
|
|
peerId string
|
|
|
|
blocks []*types.Block
|
|
|
|
}
|
|
|
|
|
|
|
|
type syncPack struct {
|
|
|
|
peer *peer
|
|
|
|
hash common.Hash
|
|
|
|
ignoreInitial bool
|
|
|
|
}
|
|
|
|
|
2015-04-12 03:38:25 -07:00
|
|
|
type Downloader struct {
|
2015-04-18 08:35:03 -07:00
|
|
|
mu sync.RWMutex
|
|
|
|
queue *queue
|
|
|
|
peers peers
|
|
|
|
activePeer string
|
2015-04-12 03:38:25 -07:00
|
|
|
|
2015-04-13 07:38:32 -07:00
|
|
|
// Callbacks
|
2015-04-30 15:23:51 -07:00
|
|
|
hasBlock hashCheckFn
|
|
|
|
getBlock getBlockFn
|
2015-04-12 03:38:25 -07:00
|
|
|
|
2015-04-13 07:38:32 -07:00
|
|
|
// Status
|
2015-04-12 03:38:25 -07:00
|
|
|
fetchingHashes int32
|
|
|
|
downloadingBlocks int32
|
2015-04-13 07:38:32 -07:00
|
|
|
|
|
|
|
// Channels
|
|
|
|
newPeerCh chan *peer
|
2015-04-18 08:35:03 -07:00
|
|
|
hashCh chan []common.Hash
|
2015-04-13 07:38:32 -07:00
|
|
|
blockCh chan blockPack
|
2015-04-12 03:38:25 -07:00
|
|
|
}
|
|
|
|
|
2015-04-30 15:23:51 -07:00
|
|
|
func New(hasBlock hashCheckFn, getBlock getBlockFn) *Downloader {
|
2015-04-12 03:38:25 -07:00
|
|
|
downloader := &Downloader{
|
2015-04-30 15:23:51 -07:00
|
|
|
queue: newqueue(),
|
|
|
|
peers: make(peers),
|
|
|
|
hasBlock: hasBlock,
|
|
|
|
getBlock: getBlock,
|
|
|
|
newPeerCh: make(chan *peer, 1),
|
|
|
|
hashCh: make(chan []common.Hash, 1),
|
|
|
|
blockCh: make(chan blockPack, 1),
|
2015-04-12 03:38:25 -07:00
|
|
|
}
|
|
|
|
|
|
|
|
return downloader
|
|
|
|
}
|
|
|
|
|
2015-04-19 12:45:58 -07:00
|
|
|
func (d *Downloader) Stats() (current int, max int) {
|
|
|
|
return d.queue.blockHashes.Size(), d.queue.fetchPool.Size() + d.queue.hashPool.Size()
|
|
|
|
}
|
|
|
|
|
2015-04-24 06:37:32 -07:00
|
|
|
func (d *Downloader) RegisterPeer(id string, hash common.Hash, getHashes hashFetcherFn, getBlocks blockFetcherFn) error {
|
2015-04-12 03:38:25 -07:00
|
|
|
d.mu.Lock()
|
|
|
|
defer d.mu.Unlock()
|
|
|
|
|
2015-04-24 06:37:32 -07:00
|
|
|
glog.V(logger.Detail).Infoln("Register peer", id)
|
2015-04-12 03:38:25 -07:00
|
|
|
|
|
|
|
// Create a new peer and add it to the list of known peers
|
2015-04-24 06:37:32 -07:00
|
|
|
peer := newPeer(id, hash, getHashes, getBlocks)
|
2015-04-12 03:38:25 -07:00
|
|
|
// add peer to our peer set
|
|
|
|
d.peers[id] = peer
|
|
|
|
// broadcast new peer
|
|
|
|
|
|
|
|
return nil
|
|
|
|
}
|
|
|
|
|
2015-04-17 16:10:32 -07:00
|
|
|
// UnregisterPeer unregister's a peer. This will prevent any action from the specified peer.
|
2015-04-12 03:38:25 -07:00
|
|
|
func (d *Downloader) UnregisterPeer(id string) {
|
|
|
|
d.mu.Lock()
|
|
|
|
defer d.mu.Unlock()
|
|
|
|
|
|
|
|
glog.V(logger.Detail).Infoln("Unregister peer", id)
|
|
|
|
|
|
|
|
delete(d.peers, id)
|
|
|
|
}
|
|
|
|
|
2015-04-24 05:40:32 -07:00
|
|
|
// SynchroniseWithPeer will select the peer and use it for synchronising. If an empty string is given
|
|
|
|
// it will use the best peer possible and synchronise if it's TD is higher than our own. If any of the
|
|
|
|
// checks fail an error will be returned. This method is synchronous
|
2015-04-24 06:37:32 -07:00
|
|
|
func (d *Downloader) Synchronise(id string, hash common.Hash) error {
|
2015-04-13 07:38:32 -07:00
|
|
|
// Make sure it's doing neither. Once done we can restart the
|
|
|
|
// downloading process if the TD is higher. For now just get on
|
|
|
|
// with whatever is going on. This prevents unecessary switching.
|
2015-04-19 04:30:34 -07:00
|
|
|
if d.isBusy() {
|
2015-04-24 06:37:32 -07:00
|
|
|
return errBusy
|
2015-04-19 04:30:34 -07:00
|
|
|
}
|
2015-04-24 05:40:32 -07:00
|
|
|
|
2015-04-30 15:23:51 -07:00
|
|
|
// When a synchronisation attempt is made while the queue stil
|
|
|
|
// contains items we abort the sync attempt
|
|
|
|
if d.queue.size() > 0 {
|
|
|
|
return errPendingQueue
|
|
|
|
}
|
|
|
|
|
2015-04-24 05:40:32 -07:00
|
|
|
// Fetch the peer using the id or throw an error if the peer couldn't be found
|
|
|
|
p := d.peers[id]
|
|
|
|
if p == nil {
|
2015-04-24 06:37:32 -07:00
|
|
|
return errUnknownPeer
|
2015-04-13 07:38:32 -07:00
|
|
|
}
|
2015-04-17 16:10:32 -07:00
|
|
|
|
2015-04-24 05:40:32 -07:00
|
|
|
// Get the hash from the peer and initiate the downloading progress.
|
|
|
|
err := d.getFromPeer(p, hash, false)
|
|
|
|
if err != nil {
|
2015-04-24 06:37:32 -07:00
|
|
|
return err
|
2015-04-24 05:40:32 -07:00
|
|
|
}
|
2015-04-19 04:30:34 -07:00
|
|
|
|
2015-04-30 15:23:51 -07:00
|
|
|
return nil
|
|
|
|
}
|
|
|
|
|
|
|
|
// Done lets the downloader know that whatever previous hashes were taken
|
|
|
|
// are processed. If the block count reaches zero and done is called
|
|
|
|
// we reset the queue for the next batch of incoming hashes and blocks.
|
|
|
|
func (d *Downloader) Done() {
|
|
|
|
d.queue.mu.Lock()
|
|
|
|
defer d.queue.mu.Unlock()
|
|
|
|
|
|
|
|
if len(d.queue.blocks) == 0 {
|
|
|
|
d.queue.resetNoTS()
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// TakeBlocks takes blocks from the queue and yields them to the blockTaker handler
|
|
|
|
// it's possible it yields no blocks
|
|
|
|
func (d *Downloader) TakeBlocks() types.Blocks {
|
|
|
|
d.queue.mu.Lock()
|
|
|
|
defer d.queue.mu.Unlock()
|
|
|
|
|
|
|
|
var blocks types.Blocks
|
|
|
|
if len(d.queue.blocks) > 0 {
|
|
|
|
// Make sure the parent hash is known
|
|
|
|
if d.queue.blocks[0] != nil && !d.hasBlock(d.queue.blocks[0].ParentHash()) {
|
|
|
|
return nil
|
|
|
|
}
|
|
|
|
|
|
|
|
for _, block := range d.queue.blocks {
|
|
|
|
if block == nil {
|
|
|
|
break
|
|
|
|
}
|
|
|
|
|
|
|
|
blocks = append(blocks, block)
|
|
|
|
}
|
|
|
|
d.queue.blockOffset += len(blocks)
|
|
|
|
// delete the blocks from the slice and let them be garbage collected
|
|
|
|
// without this slice trick the blocks would stay in memory until nil
|
|
|
|
// would be assigned to d.queue.blocks
|
|
|
|
copy(d.queue.blocks, d.queue.blocks[len(blocks):])
|
|
|
|
for k, n := len(d.queue.blocks)-len(blocks), len(d.queue.blocks); k < n; k++ {
|
|
|
|
d.queue.blocks[k] = nil
|
|
|
|
}
|
|
|
|
d.queue.blocks = d.queue.blocks[:len(d.queue.blocks)-len(blocks)]
|
|
|
|
|
|
|
|
//d.queue.blocks = d.queue.blocks[len(blocks):]
|
|
|
|
if len(d.queue.blocks) == 0 {
|
|
|
|
d.queue.blocks = nil
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
return blocks
|
2015-04-13 07:38:32 -07:00
|
|
|
}
|
|
|
|
|
2015-04-30 15:23:51 -07:00
|
|
|
func (d *Downloader) Has(hash common.Hash) bool {
|
|
|
|
return d.queue.has(hash)
|
|
|
|
}
|
|
|
|
|
|
|
|
func (d *Downloader) getFromPeer(p *peer, hash common.Hash, ignoreInitial bool) (err error) {
|
2015-04-24 05:40:32 -07:00
|
|
|
d.activePeer = p.id
|
2015-04-30 15:23:51 -07:00
|
|
|
defer func() {
|
|
|
|
// reset on error
|
|
|
|
if err != nil {
|
|
|
|
d.queue.reset()
|
|
|
|
}
|
|
|
|
}()
|
2015-04-24 05:40:32 -07:00
|
|
|
|
|
|
|
glog.V(logger.Detail).Infoln("Synchronising with the network using:", p.id)
|
|
|
|
// Start the fetcher. This will block the update entirely
|
|
|
|
// interupts need to be send to the appropriate channels
|
|
|
|
// respectively.
|
2015-04-30 15:23:51 -07:00
|
|
|
if err = d.startFetchingHashes(p, hash, ignoreInitial); err != nil {
|
2015-04-24 05:40:32 -07:00
|
|
|
return err
|
|
|
|
}
|
2015-04-13 07:38:32 -07:00
|
|
|
|
2015-04-24 05:40:32 -07:00
|
|
|
// Start fetching blocks in paralel. The strategy is simple
|
|
|
|
// take any available peers, seserve a chunk for each peer available,
|
|
|
|
// let the peer deliver the chunkn and periodically check if a peer
|
2015-04-30 15:23:51 -07:00
|
|
|
// has timedout.
|
|
|
|
if err = d.startFetchingBlocks(p); err != nil {
|
2015-04-24 05:40:32 -07:00
|
|
|
return err
|
2015-04-12 03:38:25 -07:00
|
|
|
}
|
2015-04-24 05:40:32 -07:00
|
|
|
|
|
|
|
glog.V(logger.Detail).Infoln("Sync completed")
|
|
|
|
|
|
|
|
return nil
|
2015-04-12 03:38:25 -07:00
|
|
|
}
|
|
|
|
|
2015-04-13 07:38:32 -07:00
|
|
|
// XXX Make synchronous
|
2015-04-15 15:14:31 -07:00
|
|
|
func (d *Downloader) startFetchingHashes(p *peer, hash common.Hash, ignoreInitial bool) error {
|
2015-04-18 06:14:12 -07:00
|
|
|
atomic.StoreInt32(&d.fetchingHashes, 1)
|
|
|
|
defer atomic.StoreInt32(&d.fetchingHashes, 0)
|
|
|
|
|
2015-04-30 15:23:51 -07:00
|
|
|
if d.queue.has(hash) {
|
|
|
|
return errAlreadyInPool
|
|
|
|
}
|
|
|
|
|
2015-04-15 15:14:31 -07:00
|
|
|
glog.V(logger.Debug).Infof("Downloading hashes (%x) from %s", hash.Bytes()[:4], p.id)
|
2015-04-12 03:38:25 -07:00
|
|
|
|
|
|
|
start := time.Now()
|
|
|
|
|
2015-04-15 15:14:31 -07:00
|
|
|
// We ignore the initial hash in some cases (e.g. we received a block without it's parent)
|
|
|
|
// In such circumstances we don't need to download the block so don't add it to the queue.
|
|
|
|
if !ignoreInitial {
|
|
|
|
// Add the hash to the queue first
|
|
|
|
d.queue.hashPool.Add(hash)
|
|
|
|
}
|
2015-04-12 03:38:25 -07:00
|
|
|
// Get the first batch of hashes
|
2015-04-13 07:38:32 -07:00
|
|
|
p.getHashes(hash)
|
2015-04-12 03:38:25 -07:00
|
|
|
|
2015-04-18 16:39:37 -07:00
|
|
|
failureResponseTimer := time.NewTimer(hashTtl)
|
2015-04-18 08:35:03 -07:00
|
|
|
|
2015-04-12 03:38:25 -07:00
|
|
|
out:
|
|
|
|
for {
|
|
|
|
select {
|
2015-04-18 08:35:03 -07:00
|
|
|
case hashes := <-d.hashCh:
|
2015-04-18 16:39:37 -07:00
|
|
|
failureResponseTimer.Reset(hashTtl)
|
2015-04-18 15:15:05 -07:00
|
|
|
|
2015-04-30 15:23:51 -07:00
|
|
|
var (
|
|
|
|
done bool // determines whether we're done fetching hashes (i.e. common hash found)
|
|
|
|
hash common.Hash // current and common hash
|
|
|
|
)
|
2015-04-12 03:38:25 -07:00
|
|
|
hashSet := set.New()
|
2015-04-30 15:23:51 -07:00
|
|
|
for _, hash = range hashes {
|
|
|
|
if d.hasBlock(hash) || d.queue.has(hash) {
|
2015-04-15 15:14:31 -07:00
|
|
|
glog.V(logger.Debug).Infof("Found common hash %x\n", hash[:4])
|
2015-04-12 03:38:25 -07:00
|
|
|
|
|
|
|
done = true
|
|
|
|
break
|
|
|
|
}
|
|
|
|
|
|
|
|
hashSet.Add(hash)
|
|
|
|
}
|
|
|
|
d.queue.put(hashSet)
|
|
|
|
|
|
|
|
// Add hashes to the chunk set
|
2015-04-18 06:14:12 -07:00
|
|
|
if len(hashes) == 0 { // Make sure the peer actually gave you something valid
|
|
|
|
glog.V(logger.Debug).Infof("Peer (%s) responded with empty hash set\n", p.id)
|
|
|
|
d.queue.reset()
|
|
|
|
|
2015-04-18 09:54:57 -07:00
|
|
|
return errEmptyHashSet
|
2015-04-18 06:14:12 -07:00
|
|
|
} else if !done { // Check if we're done fetching
|
2015-04-12 03:38:25 -07:00
|
|
|
// Get the next set of hashes
|
|
|
|
p.getHashes(hashes[len(hashes)-1])
|
2015-04-18 06:14:12 -07:00
|
|
|
} else { // we're done
|
2015-04-30 15:23:51 -07:00
|
|
|
// The offset of the queue is determined by the highest known block
|
|
|
|
var offset int
|
|
|
|
if block := d.getBlock(hash); block != nil {
|
|
|
|
offset = int(block.NumberU64() + 1)
|
|
|
|
}
|
|
|
|
// allocate proper size for the queueue
|
|
|
|
d.queue.alloc(offset, d.queue.hashPool.Size())
|
|
|
|
|
2015-04-12 03:38:25 -07:00
|
|
|
break out
|
|
|
|
}
|
2015-04-18 16:39:37 -07:00
|
|
|
case <-failureResponseTimer.C:
|
2015-04-18 08:35:03 -07:00
|
|
|
glog.V(logger.Debug).Infof("Peer (%s) didn't respond in time for hash request\n", p.id)
|
2015-04-18 09:54:57 -07:00
|
|
|
// TODO instead of reseting the queue select a new peer from which we can start downloading hashes.
|
|
|
|
// 1. check for peer's best hash to be included in the current hash set;
|
|
|
|
// 2. resume from last point (hashes[len(hashes)-1]) using the newly selected peer.
|
2015-04-18 08:35:03 -07:00
|
|
|
d.queue.reset()
|
|
|
|
|
2015-04-18 09:54:57 -07:00
|
|
|
return errTimeout
|
2015-04-12 03:38:25 -07:00
|
|
|
}
|
|
|
|
}
|
2015-04-18 08:35:03 -07:00
|
|
|
glog.V(logger.Detail).Infof("Downloaded hashes (%d) in %v\n", d.queue.hashPool.Size(), time.Since(start))
|
2015-04-12 03:38:25 -07:00
|
|
|
|
|
|
|
return nil
|
|
|
|
}
|
|
|
|
|
|
|
|
func (d *Downloader) startFetchingBlocks(p *peer) error {
|
2015-04-18 08:35:03 -07:00
|
|
|
glog.V(logger.Detail).Infoln("Downloading", d.queue.hashPool.Size(), "block(s)")
|
2015-04-12 03:38:25 -07:00
|
|
|
atomic.StoreInt32(&d.downloadingBlocks, 1)
|
2015-04-18 06:14:12 -07:00
|
|
|
defer atomic.StoreInt32(&d.downloadingBlocks, 0)
|
2015-04-18 16:39:37 -07:00
|
|
|
// Defer the peer reset. This will empty the peer requested set
|
|
|
|
// and makes sure there are no lingering peers with an incorrect
|
|
|
|
// state
|
|
|
|
defer d.peers.reset()
|
2015-04-12 03:38:25 -07:00
|
|
|
|
|
|
|
start := time.Now()
|
|
|
|
|
|
|
|
// default ticker for re-fetching blocks everynow and then
|
|
|
|
ticker := time.NewTicker(20 * time.Millisecond)
|
|
|
|
out:
|
|
|
|
for {
|
|
|
|
select {
|
|
|
|
case blockPack := <-d.blockCh:
|
2015-04-17 16:10:32 -07:00
|
|
|
// If the peer was previously banned and failed to deliver it's pack
|
|
|
|
// in a reasonable time frame, ignore it's message.
|
|
|
|
if d.peers[blockPack.peerId] != nil {
|
2015-04-30 15:23:51 -07:00
|
|
|
err := d.queue.deliver(blockPack.peerId, blockPack.blocks)
|
|
|
|
if err != nil {
|
|
|
|
glog.V(logger.Debug).Infof("deliver failed for peer %s: %v\n", blockPack.peerId, err)
|
|
|
|
// FIXME d.UnregisterPeer(blockPack.peerId)
|
|
|
|
break
|
|
|
|
}
|
|
|
|
|
|
|
|
if glog.V(logger.Debug) {
|
|
|
|
glog.Infof("adding %d blocks from: %s\n", len(blockPack.blocks), blockPack.peerId)
|
|
|
|
}
|
2015-04-17 16:10:32 -07:00
|
|
|
d.peers[blockPack.peerId].promote()
|
|
|
|
d.peers.setState(blockPack.peerId, idleState)
|
|
|
|
}
|
2015-04-12 03:38:25 -07:00
|
|
|
case <-ticker.C:
|
2015-04-30 15:23:51 -07:00
|
|
|
// after removing bad peers make sure we actually have suffucient peer left to keep downlading
|
|
|
|
if len(d.peers) == 0 {
|
|
|
|
d.queue.reset()
|
|
|
|
|
|
|
|
return errNoPeers
|
|
|
|
}
|
|
|
|
|
2015-04-12 03:38:25 -07:00
|
|
|
// If there are unrequested hashes left start fetching
|
|
|
|
// from the available peers.
|
|
|
|
if d.queue.hashPool.Size() > 0 {
|
|
|
|
availablePeers := d.peers.get(idleState)
|
|
|
|
for _, peer := range availablePeers {
|
|
|
|
// Get a possible chunk. If nil is returned no chunk
|
|
|
|
// could be returned due to no hashes available.
|
|
|
|
chunk := d.queue.get(peer, maxBlockFetch)
|
2015-04-13 07:38:32 -07:00
|
|
|
if chunk == nil {
|
|
|
|
continue
|
|
|
|
}
|
|
|
|
|
|
|
|
// XXX make fetch blocking.
|
|
|
|
// Fetch the chunk and check for error. If the peer was somehow
|
|
|
|
// already fetching a chunk due to a bug, it will be returned to
|
|
|
|
// the queue
|
|
|
|
if err := peer.fetch(chunk); err != nil {
|
|
|
|
// log for tracing
|
|
|
|
glog.V(logger.Debug).Infof("peer %s received double work (state = %v)\n", peer.id, peer.state)
|
|
|
|
d.queue.put(chunk.hashes)
|
2015-04-12 03:38:25 -07:00
|
|
|
}
|
|
|
|
}
|
2015-04-18 10:29:30 -07:00
|
|
|
|
|
|
|
// make sure that we have peers available for fetching. If all peers have been tried
|
|
|
|
// and all failed throw an error
|
2015-04-18 11:25:55 -07:00
|
|
|
if len(d.queue.fetching) == 0 {
|
2015-04-18 10:29:30 -07:00
|
|
|
d.queue.reset()
|
|
|
|
|
2015-04-19 04:30:34 -07:00
|
|
|
return fmt.Errorf("%v peers avaialable = %d. total peers = %d. hashes needed = %d", errPeersUnavailable, len(availablePeers), len(d.peers), d.queue.hashPool.Size())
|
2015-04-18 10:29:30 -07:00
|
|
|
}
|
|
|
|
|
2015-04-12 03:38:25 -07:00
|
|
|
} else if len(d.queue.fetching) == 0 {
|
2015-04-13 07:38:32 -07:00
|
|
|
// When there are no more queue and no more `fetching`. We can
|
2015-04-12 03:38:25 -07:00
|
|
|
// safely assume we're done. Another part of the process will check
|
|
|
|
// for parent errors and will re-request anything that's missing
|
|
|
|
break out
|
|
|
|
} else {
|
|
|
|
// Check for bad peers. Bad peers may indicate a peer not responding
|
|
|
|
// to a `getBlocks` message. A timeout of 5 seconds is set. Peers
|
|
|
|
// that badly or poorly behave are removed from the peer set (not banned).
|
|
|
|
// Bad peers are excluded from the available peer set and therefor won't be
|
|
|
|
// reused. XXX We could re-introduce peers after X time.
|
|
|
|
d.queue.mu.Lock()
|
|
|
|
var badPeers []string
|
|
|
|
for pid, chunk := range d.queue.fetching {
|
2015-04-18 06:14:12 -07:00
|
|
|
if time.Since(chunk.itime) > blockTtl {
|
2015-04-12 03:38:25 -07:00
|
|
|
badPeers = append(badPeers, pid)
|
|
|
|
// remove peer as good peer from peer list
|
2015-04-30 15:23:51 -07:00
|
|
|
// FIXME d.UnregisterPeer(pid)
|
2015-04-12 03:38:25 -07:00
|
|
|
}
|
|
|
|
}
|
|
|
|
d.queue.mu.Unlock()
|
|
|
|
|
|
|
|
for _, pid := range badPeers {
|
|
|
|
// A nil chunk is delivered so that the chunk's hashes are given
|
|
|
|
// back to the queue objects. When hashes are put back in the queue
|
|
|
|
// other (decent) peers can pick them up.
|
|
|
|
// XXX We could make use of a reputation system here ranking peers
|
|
|
|
// in their performance
|
|
|
|
// 1) Time for them to respond;
|
|
|
|
// 2) Measure their speed;
|
|
|
|
// 3) Amount and availability.
|
|
|
|
d.queue.deliver(pid, nil)
|
2015-04-16 15:11:41 -07:00
|
|
|
if peer := d.peers[pid]; peer != nil {
|
2015-04-15 17:16:33 -07:00
|
|
|
peer.demote()
|
2015-04-18 11:25:55 -07:00
|
|
|
peer.reset()
|
2015-04-15 17:16:33 -07:00
|
|
|
}
|
2015-04-12 03:38:25 -07:00
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2015-04-18 08:35:03 -07:00
|
|
|
glog.V(logger.Detail).Infoln("Downloaded block(s) in", time.Since(start))
|
|
|
|
|
|
|
|
return nil
|
|
|
|
}
|
|
|
|
|
2015-04-19 08:14:15 -07:00
|
|
|
// Deliver a chunk to the downloader. This is usually done through the BlocksMsg by
|
|
|
|
// the protocol handler.
|
|
|
|
func (d *Downloader) DeliverChunk(id string, blocks []*types.Block) {
|
|
|
|
d.blockCh <- blockPack{id, blocks}
|
|
|
|
}
|
|
|
|
|
2015-04-18 08:35:03 -07:00
|
|
|
func (d *Downloader) AddHashes(id string, hashes []common.Hash) error {
|
|
|
|
// make sure that the hashes that are being added are actually from the peer
|
|
|
|
// that's the current active peer. hashes that have been received from other
|
|
|
|
// peers are dropped and ignored.
|
|
|
|
if d.activePeer != id {
|
|
|
|
return fmt.Errorf("received hashes from %s while active peer is %s", id, d.activePeer)
|
|
|
|
}
|
|
|
|
|
2015-04-30 08:51:47 -07:00
|
|
|
if glog.V(logger.Detail) && len(hashes) != 0 {
|
|
|
|
from, to := hashes[0], hashes[len(hashes)-1]
|
|
|
|
glog.Infof("adding %d (T=%d) hashes [ %x / %x ] from: %s\n", len(hashes), d.queue.hashPool.Size(), from[:4], to[:4], id)
|
|
|
|
}
|
|
|
|
|
2015-04-18 08:35:03 -07:00
|
|
|
d.hashCh <- hashes
|
2015-04-12 03:38:25 -07:00
|
|
|
|
|
|
|
return nil
|
|
|
|
}
|
|
|
|
|
|
|
|
func (d *Downloader) isFetchingHashes() bool {
|
|
|
|
return atomic.LoadInt32(&d.fetchingHashes) == 1
|
|
|
|
}
|
|
|
|
|
|
|
|
func (d *Downloader) isDownloadingBlocks() bool {
|
|
|
|
return atomic.LoadInt32(&d.downloadingBlocks) == 1
|
|
|
|
}
|
2015-04-13 07:38:32 -07:00
|
|
|
|
2015-04-17 18:15:26 -07:00
|
|
|
func (d *Downloader) isBusy() bool {
|
2015-04-30 15:23:51 -07:00
|
|
|
return d.isFetchingHashes() || d.isDownloadingBlocks()
|
2015-04-17 18:15:26 -07:00
|
|
|
}
|
2015-04-28 12:18:08 -07:00
|
|
|
|
|
|
|
func (d *Downloader) IsBusy() bool {
|
|
|
|
return d.isBusy()
|
|
|
|
}
|