aboutsummaryrefslogtreecommitdiffstats
path: root/core/state/sync.go
blob: 5a388886cf0701281603375e028daf296cbde968 (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
// Copyright 2015 The go-ethereum Authors
// This file is part of the go-ethereum library.
//
// The go-ethereum library is free software: you can redistribute it and/or modify
// it under the terms of the GNU Lesser General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// The go-ethereum library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU Lesser General Public License for more details.
//
// You should have received a copy of the GNU Lesser General Public License
// along with the go-ethereum library. If not, see <http://www.gnu.org/licenses/>.

package state

import (
    "bytes"
    "math/big"

    "github.com/ethereum/go-ethereum/common"
    "github.com/ethereum/go-ethereum/ethdb"
    "github.com/ethereum/go-ethereum/rlp"
    "github.com/ethereum/go-ethereum/trie"
)

// StateSync is the main state  synchronisation scheduler, which provides yet the
// unknown state hashes to retrieve, accepts node data associated with said hashes
// and reconstructs the state database step by step until all is done.
type StateSync trie.TrieSync

// NewStateSync create a new state trie download scheduler.
func NewStateSync(root common.Hash, database ethdb.Database) *StateSync {
    // Pre-declare the result syncer t
    var syncer *trie.TrieSync

    callback := func(leaf []byte, parent common.Hash) error {
        var obj struct {
            Nonce    uint64
            Balance  *big.Int
            Root     common.Hash
            CodeHash []byte
        }
        if err := rlp.Decode(bytes.NewReader(leaf), &obj); err != nil {
            return err
        }
        syncer.AddSubTrie(obj.Root, 64, parent, nil)
        syncer.AddRawEntry(common.BytesToHash(obj.CodeHash), 64, parent)

        return nil
    }
    syncer = trie.NewTrieSync(root, database, callback)
    return (*StateSync)(syncer)
}

// Missing retrieves the known missing nodes from the state trie for retrieval.
func (s *StateSync) Missing(max int) []common.Hash {
    return (*trie.TrieSync)(s).Missing(max)
}

// Process injects a batch of retrieved trie nodes data.
func (s *StateSync) Process(list []trie.SyncResult) (int, error) {
    return (*trie.TrieSync)(s).Process(list)
}

// Pending returns the number of state entries currently pending for download.
func (s *StateSync) Pending() int {
    return (*trie.TrieSync)(s).Pending()
}