fullnode.go 2.1 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394
  1. // Copyright 2014 The go-ethereum Authors
  2. // This file is part of go-ethereum.
  3. //
  4. // go-ethereum 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. // go-ethereum 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 go-ethereum. If not, see <http://www.gnu.org/licenses/>.
  16. package trie
  17. type FullNode struct {
  18. trie *Trie
  19. nodes [17]Node
  20. dirty bool
  21. }
  22. func NewFullNode(t *Trie) *FullNode {
  23. return &FullNode{trie: t}
  24. }
  25. func (self *FullNode) Dirty() bool { return self.dirty }
  26. func (self *FullNode) Value() Node {
  27. self.nodes[16] = self.trie.trans(self.nodes[16])
  28. return self.nodes[16]
  29. }
  30. func (self *FullNode) Branches() []Node {
  31. return self.nodes[:16]
  32. }
  33. func (self *FullNode) Copy(t *Trie) Node {
  34. nnode := NewFullNode(t)
  35. for i, node := range self.nodes {
  36. if node != nil {
  37. nnode.nodes[i] = node
  38. }
  39. }
  40. nnode.dirty = true
  41. return nnode
  42. }
  43. // Returns the length of non-nil nodes
  44. func (self *FullNode) Len() (amount int) {
  45. for _, node := range self.nodes {
  46. if node != nil {
  47. amount++
  48. }
  49. }
  50. return
  51. }
  52. func (self *FullNode) Hash() interface{} {
  53. return self.trie.store(self)
  54. }
  55. func (self *FullNode) RlpData() interface{} {
  56. t := make([]interface{}, 17)
  57. for i, node := range self.nodes {
  58. if node != nil {
  59. t[i] = node.Hash()
  60. } else {
  61. t[i] = ""
  62. }
  63. }
  64. return t
  65. }
  66. func (self *FullNode) set(k byte, value Node) {
  67. self.nodes[int(k)] = value
  68. self.dirty = true
  69. }
  70. func (self *FullNode) branch(i byte) Node {
  71. if self.nodes[int(i)] != nil {
  72. self.nodes[int(i)] = self.trie.trans(self.nodes[int(i)])
  73. return self.nodes[int(i)]
  74. }
  75. return nil
  76. }
  77. func (self *FullNode) setDirty(dirty bool) {
  78. self.dirty = dirty
  79. }