github.com/arieschain/arieschain@v0.0.0-20191023063405-37c074544356/core/state/state_test.go (about) 1 package state 2 3 import ( 4 "bytes" 5 "math/big" 6 "testing" 7 8 "github.com/quickchainproject/quickchain/common" 9 "github.com/quickchainproject/quickchain/crypto" 10 "github.com/quickchainproject/quickchain/qctdb" 11 checker "gopkg.in/check.v1" 12 ) 13 14 type StateSuite struct { 15 db *qctdb.MemDatabase 16 state *StateDB 17 } 18 19 var _ = checker.Suite(&StateSuite{}) 20 21 var toAddr = common.BytesToAddress 22 23 func (s *StateSuite) TestDump(c *checker.C) { 24 // generate a few entries 25 obj1 := s.state.GetOrNewStateObject(toAddr([]byte{0x01})) 26 obj1.AddBalance(big.NewInt(22)) 27 obj2 := s.state.GetOrNewStateObject(toAddr([]byte{0x01, 0x02})) 28 obj2.SetCode(crypto.Keccak256Hash([]byte{3, 3, 3, 3, 3, 3, 3}), []byte{3, 3, 3, 3, 3, 3, 3}) 29 obj3 := s.state.GetOrNewStateObject(toAddr([]byte{0x02})) 30 obj3.SetBalance(big.NewInt(44)) 31 32 // write some of them to the trie 33 s.state.updateStateObject(obj1) 34 s.state.updateStateObject(obj2) 35 s.state.Commit(false) 36 37 // check that dump contains the state objects that are in trie 38 got := string(s.state.Dump()) 39 want := `{ 40 "root": "71edff0130dd2385947095001c73d9e28d862fc286fca2b922ca6f6f3cddfdd2", 41 "accounts": { 42 "0000000000000000000000000000000000000001": { 43 "balance": "22", 44 "nonce": 0, 45 "root": "56e81f171bcc55a6ff8345e692c0f86e5b48e01b996cadc001622fb5e363b421", 46 "codeHash": "c5d2460186f7233c927e7db2dcc703c0e500b653ca82273b7bfad8045d85a470", 47 "code": "", 48 "storage": {} 49 }, 50 "0000000000000000000000000000000000000002": { 51 "balance": "44", 52 "nonce": 0, 53 "root": "56e81f171bcc55a6ff8345e692c0f86e5b48e01b996cadc001622fb5e363b421", 54 "codeHash": "c5d2460186f7233c927e7db2dcc703c0e500b653ca82273b7bfad8045d85a470", 55 "code": "", 56 "storage": {} 57 }, 58 "0000000000000000000000000000000000000102": { 59 "balance": "0", 60 "nonce": 0, 61 "root": "56e81f171bcc55a6ff8345e692c0f86e5b48e01b996cadc001622fb5e363b421", 62 "codeHash": "87874902497a5bb968da31a2998d8f22e949d1ef6214bcdedd8bae24cca4b9e3", 63 "code": "03030303030303", 64 "storage": {} 65 } 66 } 67 }` 68 if got != want { 69 c.Errorf("dump mismatch:\ngot: %s\nwant: %s\n", got, want) 70 } 71 } 72 73 func (s *StateSuite) SetUpTest(c *checker.C) { 74 s.db, _ = qctdb.NewMemDatabase() 75 s.state, _ = New(common.Hash{}, NewDatabase(s.db)) 76 } 77 78 func (s *StateSuite) TestNull(c *checker.C) { 79 address := common.HexToAddress("0x823140710bf13990e4500136726d8b55") 80 s.state.CreateAccount(address) 81 //value := common.FromHex("0x823140710bf13990e4500136726d8b55") 82 var value common.Hash 83 s.state.SetState(address, common.Hash{}, value) 84 s.state.Commit(false) 85 value = s.state.GetState(address, common.Hash{}) 86 if !common.EmptyHash(value) { 87 c.Errorf("expected empty hash. got %x", value) 88 } 89 } 90 91 func (s *StateSuite) TestSnapshot(c *checker.C) { 92 stateobjaddr := toAddr([]byte("aa")) 93 var storageaddr common.Hash 94 data1 := common.BytesToHash([]byte{42}) 95 data2 := common.BytesToHash([]byte{43}) 96 97 // set initial state object value 98 s.state.SetState(stateobjaddr, storageaddr, data1) 99 // get snapshot of current state 100 snapshot := s.state.Snapshot() 101 102 // set new state object value 103 s.state.SetState(stateobjaddr, storageaddr, data2) 104 // restore snapshot 105 s.state.RevertToSnapshot(snapshot) 106 107 // get state storage value 108 res := s.state.GetState(stateobjaddr, storageaddr) 109 110 c.Assert(data1, checker.DeepEquals, res) 111 } 112 113 func (s *StateSuite) TestSnapshotEmpty(c *checker.C) { 114 s.state.RevertToSnapshot(s.state.Snapshot()) 115 } 116 117 // use testing instead of checker because checker does not support 118 // printing/logging in tests (-check.vv does not work) 119 func TestSnapshot2(t *testing.T) { 120 db, _ := qctdb.NewMemDatabase() 121 state, _ := New(common.Hash{}, NewDatabase(db)) 122 123 stateobjaddr0 := toAddr([]byte("so0")) 124 stateobjaddr1 := toAddr([]byte("so1")) 125 var storageaddr common.Hash 126 127 data0 := common.BytesToHash([]byte{17}) 128 data1 := common.BytesToHash([]byte{18}) 129 130 state.SetState(stateobjaddr0, storageaddr, data0) 131 state.SetState(stateobjaddr1, storageaddr, data1) 132 133 // db, trie are already non-empty values 134 so0 := state.getStateObject(stateobjaddr0) 135 so0.SetBalance(big.NewInt(42)) 136 so0.SetNonce(43) 137 so0.SetCode(crypto.Keccak256Hash([]byte{'c', 'a', 'f', 'e'}), []byte{'c', 'a', 'f', 'e'}) 138 so0.suicided = false 139 so0.deleted = false 140 state.setStateObject(so0) 141 142 root, _ := state.Commit(false) 143 state.Reset(root) 144 145 // and one with deleted == true 146 so1 := state.getStateObject(stateobjaddr1) 147 so1.SetBalance(big.NewInt(52)) 148 so1.SetNonce(53) 149 so1.SetCode(crypto.Keccak256Hash([]byte{'c', 'a', 'f', 'e', '2'}), []byte{'c', 'a', 'f', 'e', '2'}) 150 so1.suicided = true 151 so1.deleted = true 152 state.setStateObject(so1) 153 154 so1 = state.getStateObject(stateobjaddr1) 155 if so1 != nil { 156 t.Fatalf("deleted object not nil when getting") 157 } 158 159 snapshot := state.Snapshot() 160 state.RevertToSnapshot(snapshot) 161 162 so0Restored := state.getStateObject(stateobjaddr0) 163 // Update lazily-loaded values before comparing. 164 so0Restored.GetState(state.db, storageaddr) 165 so0Restored.Code(state.db) 166 // non-deleted is equal (restored) 167 compareStateObjects(so0Restored, so0, t) 168 169 // deleted should be nil, both before and after restore of state copy 170 so1Restored := state.getStateObject(stateobjaddr1) 171 if so1Restored != nil { 172 t.Fatalf("deleted object not nil after restoring snapshot: %+v", so1Restored) 173 } 174 } 175 176 func compareStateObjects(so0, so1 *stateObject, t *testing.T) { 177 if so0.Address() != so1.Address() { 178 t.Fatalf("Address mismatch: have %v, want %v", so0.address, so1.address) 179 } 180 if so0.Balance().Cmp(so1.Balance()) != 0 { 181 t.Fatalf("Balance mismatch: have %v, want %v", so0.Balance(), so1.Balance()) 182 } 183 if so0.Nonce() != so1.Nonce() { 184 t.Fatalf("Nonce mismatch: have %v, want %v", so0.Nonce(), so1.Nonce()) 185 } 186 if so0.data.Root != so1.data.Root { 187 t.Errorf("Root mismatch: have %x, want %x", so0.data.Root[:], so1.data.Root[:]) 188 } 189 if !bytes.Equal(so0.CodeHash(), so1.CodeHash()) { 190 t.Fatalf("CodeHash mismatch: have %v, want %v", so0.CodeHash(), so1.CodeHash()) 191 } 192 if !bytes.Equal(so0.code, so1.code) { 193 t.Fatalf("Code mismatch: have %v, want %v", so0.code, so1.code) 194 } 195 196 if len(so1.cachedStorage) != len(so0.cachedStorage) { 197 t.Errorf("Storage size mismatch: have %d, want %d", len(so1.cachedStorage), len(so0.cachedStorage)) 198 } 199 for k, v := range so1.cachedStorage { 200 if so0.cachedStorage[k] != v { 201 t.Errorf("Storage key %x mismatch: have %v, want %v", k, so0.cachedStorage[k], v) 202 } 203 } 204 for k, v := range so0.cachedStorage { 205 if so1.cachedStorage[k] != v { 206 t.Errorf("Storage key %x mismatch: have %v, want none.", k, v) 207 } 208 } 209 210 if so0.suicided != so1.suicided { 211 t.Fatalf("suicided mismatch: have %v, want %v", so0.suicided, so1.suicided) 212 } 213 if so0.deleted != so1.deleted { 214 t.Fatalf("Deleted mismatch: have %v, want %v", so0.deleted, so1.deleted) 215 } 216 }