sync.go 2.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172
  1. // Copyright 2015 The go-ethereum Authors
  2. // This file is part of the go-ethereum library.
  3. //
  4. // The go-ethereum library is free software: you can redistribute it and/or modify
  5. // it under the terms of the GNU Lesser General Public License as published by
  6. // the Free Software Foundation, either version 3 of the License, or
  7. // (at your option) any later version.
  8. //
  9. // The go-ethereum library is distributed in the hope that it will be useful,
  10. // but WITHOUT ANY WARRANTY; without even the implied warranty of
  11. // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  12. // GNU Lesser General Public License for more details.
  13. //
  14. // You should have received a copy of the GNU Lesser General Public License
  15. // along with the go-ethereum library. If not, see <http://www.gnu.org/licenses/>.
  16. package state
  17. import (
  18. "bytes"
  19. "math/big"
  20. "github.com/ethereum/go-ethereum/common"
  21. "github.com/ethereum/go-ethereum/ethdb"
  22. "github.com/ethereum/go-ethereum/rlp"
  23. "github.com/ethereum/go-ethereum/trie"
  24. )
  25. // StateSync is the main state synchronisation scheduler, which provides yet the
  26. // unknown state hashes to retrieve, accepts node data associated with said hashes
  27. // and reconstructs the state database step by step until all is done.
  28. type StateSync trie.TrieSync
  29. // NewStateSync create a new state trie download scheduler.
  30. func NewStateSync(root common.Hash, database ethdb.Database) *StateSync {
  31. var syncer *trie.TrieSync
  32. callback := func(leaf []byte, parent common.Hash) error {
  33. var obj struct {
  34. Nonce uint64
  35. Balance *big.Int
  36. Root common.Hash
  37. CodeHash []byte
  38. }
  39. if err := rlp.Decode(bytes.NewReader(leaf), &obj); err != nil {
  40. return err
  41. }
  42. syncer.AddSubTrie(obj.Root, 64, parent, nil)
  43. syncer.AddRawEntry(common.BytesToHash(obj.CodeHash), 64, parent)
  44. return nil
  45. }
  46. syncer = trie.NewTrieSync(root, database, callback)
  47. return (*StateSync)(syncer)
  48. }
  49. // Missing retrieves the known missing nodes from the state trie for retrieval.
  50. func (s *StateSync) Missing(max int) []common.Hash {
  51. return (*trie.TrieSync)(s).Missing(max)
  52. }
  53. // Process injects a batch of retrieved trie nodes data, returning if something
  54. // was committed to the database and also the index of an entry if processing of
  55. // it failed.
  56. func (s *StateSync) Process(list []trie.SyncResult) (bool, int, error) {
  57. return (*trie.TrieSync)(s).Process(list)
  58. }
  59. // Pending returns the number of state entries currently pending for download.
  60. func (s *StateSync) Pending() int {
  61. return (*trie.TrieSync)(s).Pending()
  62. }