aboutsummaryrefslogtreecommitdiffstats
path: root/eth/sync.go
blob: b259c1d475a11ecdbd9e8b493c9bf5fd04de6640 (plain) (blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
package eth

import (
    "math"
    "time"

    "github.com/ethereum/go-ethereum/eth/downloader"
    "github.com/ethereum/go-ethereum/logger"
    "github.com/ethereum/go-ethereum/logger/glog"
)

// Sync contains all synchronisation code for the eth protocol

func (pm *ProtocolManager) update() {
    // itimer is used to determine when to start ignoring `minDesiredPeerCount`
    itimer := time.NewTimer(peerCountTimeout)
    // btimer is used for picking of blocks from the downloader
    btimer := time.Tick(blockProcTimer)

    for {
        select {
        case <-pm.newPeerCh:
            // Meet the `minDesiredPeerCount` before we select our best peer
            if len(pm.peers) < minDesiredPeerCount {
                break
            }

            // Find the best peer
            peer := getBestPeer(pm.peers)
            if peer == nil {
                glog.V(logger.Debug).Infoln("Sync attempt cancelled. No peers available")
            }

            itimer.Stop()
            go pm.synchronize(peer)
        case <-itimer.C:
            // The timer will make sure that the downloader keeps an active state
            // in which it attempts to always check the network for highest td peers
            // Either select the peer or restart the timer if no peers could
            // be selected.
            if peer := getBestPeer(pm.peers); peer != nil {
                go pm.synchronize(peer)
            } else {
                itimer.Reset(5 * time.Second)
            }
        case <-btimer:
            go pm.processBlocks()
        case <-pm.quitSync:
            return
        }
    }
}

// processBlocks will attempt to reconstruct a chain by checking the first item and check if it's
// a known parent. The first block in the chain may be unknown during downloading. When the
// downloader isn't downloading blocks will be dropped with an unknown parent until either it
// has depleted the list or found a known parent.
func (pm *ProtocolManager) processBlocks() error {
    pm.wg.Add(1)
    defer pm.wg.Done()

    blocks := pm.downloader.TakeBlocks()
    if len(blocks) == 0 {
        return nil
    }

    glog.V(logger.Debug).Infof("Inserting chain with %d blocks (#%v - #%v)\n", len(blocks), blocks[0].Number(), blocks[len(blocks)-1].Number())

    for len(blocks) != 0 && !pm.quit {
        max := int(math.Min(float64(len(blocks)), float64(blockProcAmount)))
        _, err := pm.chainman.InsertChain(blocks[:max])
        if err != nil {
            return err
        }
        blocks = blocks[max:]
    }
    return nil
}

func (pm *ProtocolManager) synchronize(peer *peer) {
    // Make sure the peer's TD is higher than our own. If not drop.
    if peer.td.Cmp(pm.chainman.Td()) <= 0 {
        return
    }
    // FIXME if we have the hash in our chain and the TD of the peer is
    // much higher than ours, something is wrong with us or the peer.
    // Check if the hash is on our own chain
    if pm.chainman.HasBlock(peer.recentHash) {
        return
    }
    // Get the hashes from the peer (synchronously)
    err := pm.downloader.Synchronize(peer.id, peer.recentHash)
    if err != nil && err == downloader.ErrBadPeer {
        glog.V(logger.Debug).Infoln("removed peer from peer set due to bad action")
        pm.removePeer(peer)
    } else if err != nil {
        // handle error
        glog.V(logger.Detail).Infoln("error downloading:", err)
    }
}