2019-08-06 10:40:28 +00:00
|
|
|
// Copyright 2019 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 snapshot
|
2019-10-17 15:30:31 +00:00
|
|
|
|
|
|
|
import (
|
|
|
|
"fmt"
|
|
|
|
"testing"
|
|
|
|
|
2019-11-25 14:30:29 +00:00
|
|
|
"github.com/VictoriaMetrics/fastcache"
|
2019-10-17 15:30:31 +00:00
|
|
|
"github.com/ethereum/go-ethereum/common"
|
|
|
|
"github.com/ethereum/go-ethereum/core/rawdb"
|
|
|
|
)
|
|
|
|
|
|
|
|
// Tests that if a disk layer becomes stale, no active external references will
|
|
|
|
// be returned with junk data. This version of the test flattens every diff layer
|
|
|
|
// to check internal corner case around the bottom-most memory accumulator.
|
|
|
|
func TestDiskLayerExternalInvalidationFullFlatten(t *testing.T) {
|
|
|
|
// Create an empty base layer and a snapshot tree out of it
|
|
|
|
base := &diskLayer{
|
2019-11-26 07:48:29 +00:00
|
|
|
diskdb: rawdb.NewMemoryDatabase(),
|
|
|
|
root: common.HexToHash("0x01"),
|
|
|
|
cache: fastcache.New(1024 * 500),
|
2019-10-17 15:30:31 +00:00
|
|
|
}
|
2019-11-22 11:23:49 +00:00
|
|
|
snaps := &Tree{
|
2019-10-17 15:30:31 +00:00
|
|
|
layers: map[common.Hash]snapshot{
|
|
|
|
base.root: base,
|
|
|
|
},
|
|
|
|
}
|
|
|
|
// Retrieve a reference to the base and commit a diff on top
|
|
|
|
ref := snaps.Snapshot(base.root)
|
|
|
|
|
|
|
|
accounts := map[common.Hash][]byte{
|
|
|
|
common.HexToHash("0xa1"): randomAccount(),
|
|
|
|
}
|
|
|
|
storage := make(map[common.Hash]map[common.Hash][]byte)
|
|
|
|
if err := snaps.Update(common.HexToHash("0x02"), common.HexToHash("0x01"), accounts, storage); err != nil {
|
|
|
|
t.Fatalf("failed to create a diff layer: %v", err)
|
|
|
|
}
|
|
|
|
if n := len(snaps.layers); n != 2 {
|
|
|
|
t.Errorf("pre-cap layer count mismatch: have %d, want %d", n, 2)
|
|
|
|
}
|
|
|
|
// Commit the diff layer onto the disk and ensure it's persisted
|
2019-11-26 07:48:29 +00:00
|
|
|
if err := snaps.Cap(common.HexToHash("0x02"), 0); err != nil {
|
2019-10-17 15:30:31 +00:00
|
|
|
t.Fatalf("failed to merge diff layer onto disk: %v", err)
|
|
|
|
}
|
|
|
|
// Since the base layer was modified, ensure that data retrievald on the external reference fail
|
|
|
|
if acc, err := ref.Account(common.HexToHash("0x01")); err != ErrSnapshotStale {
|
|
|
|
t.Errorf("stale reference returned account: %#x (err: %v)", acc, err)
|
|
|
|
}
|
|
|
|
if slot, err := ref.Storage(common.HexToHash("0xa1"), common.HexToHash("0xb1")); err != ErrSnapshotStale {
|
|
|
|
t.Errorf("stale reference returned storage slot: %#x (err: %v)", slot, err)
|
|
|
|
}
|
|
|
|
if n := len(snaps.layers); n != 1 {
|
|
|
|
t.Errorf("post-cap layer count mismatch: have %d, want %d", n, 1)
|
|
|
|
fmt.Println(snaps.layers)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// Tests that if a disk layer becomes stale, no active external references will
|
|
|
|
// be returned with junk data. This version of the test retains the bottom diff
|
|
|
|
// layer to check the usual mode of operation where the accumulator is retained.
|
|
|
|
func TestDiskLayerExternalInvalidationPartialFlatten(t *testing.T) {
|
|
|
|
// Create an empty base layer and a snapshot tree out of it
|
|
|
|
base := &diskLayer{
|
2019-11-26 07:48:29 +00:00
|
|
|
diskdb: rawdb.NewMemoryDatabase(),
|
|
|
|
root: common.HexToHash("0x01"),
|
|
|
|
cache: fastcache.New(1024 * 500),
|
2019-10-17 15:30:31 +00:00
|
|
|
}
|
2019-11-22 11:23:49 +00:00
|
|
|
snaps := &Tree{
|
2019-10-17 15:30:31 +00:00
|
|
|
layers: map[common.Hash]snapshot{
|
|
|
|
base.root: base,
|
|
|
|
},
|
|
|
|
}
|
|
|
|
// Retrieve a reference to the base and commit two diffs on top
|
|
|
|
ref := snaps.Snapshot(base.root)
|
|
|
|
|
|
|
|
accounts := map[common.Hash][]byte{
|
|
|
|
common.HexToHash("0xa1"): randomAccount(),
|
|
|
|
}
|
|
|
|
storage := make(map[common.Hash]map[common.Hash][]byte)
|
|
|
|
if err := snaps.Update(common.HexToHash("0x02"), common.HexToHash("0x01"), accounts, storage); err != nil {
|
|
|
|
t.Fatalf("failed to create a diff layer: %v", err)
|
|
|
|
}
|
|
|
|
if err := snaps.Update(common.HexToHash("0x03"), common.HexToHash("0x02"), accounts, storage); err != nil {
|
|
|
|
t.Fatalf("failed to create a diff layer: %v", err)
|
|
|
|
}
|
|
|
|
if n := len(snaps.layers); n != 3 {
|
|
|
|
t.Errorf("pre-cap layer count mismatch: have %d, want %d", n, 3)
|
|
|
|
}
|
|
|
|
// Commit the diff layer onto the disk and ensure it's persisted
|
2019-11-26 07:48:29 +00:00
|
|
|
defer func(memcap uint64) { aggregatorMemoryLimit = memcap }(aggregatorMemoryLimit)
|
|
|
|
aggregatorMemoryLimit = 0
|
|
|
|
|
|
|
|
if err := snaps.Cap(common.HexToHash("0x03"), 2); err != nil {
|
2019-10-17 15:30:31 +00:00
|
|
|
t.Fatalf("failed to merge diff layer onto disk: %v", err)
|
|
|
|
}
|
|
|
|
// Since the base layer was modified, ensure that data retrievald on the external reference fail
|
|
|
|
if acc, err := ref.Account(common.HexToHash("0x01")); err != ErrSnapshotStale {
|
|
|
|
t.Errorf("stale reference returned account: %#x (err: %v)", acc, err)
|
|
|
|
}
|
|
|
|
if slot, err := ref.Storage(common.HexToHash("0xa1"), common.HexToHash("0xb1")); err != ErrSnapshotStale {
|
|
|
|
t.Errorf("stale reference returned storage slot: %#x (err: %v)", slot, err)
|
|
|
|
}
|
|
|
|
if n := len(snaps.layers); n != 2 {
|
|
|
|
t.Errorf("post-cap layer count mismatch: have %d, want %d", n, 2)
|
|
|
|
fmt.Println(snaps.layers)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// Tests that if a diff layer becomes stale, no active external references will
|
|
|
|
// be returned with junk data. This version of the test flattens every diff layer
|
|
|
|
// to check internal corner case around the bottom-most memory accumulator.
|
|
|
|
func TestDiffLayerExternalInvalidationFullFlatten(t *testing.T) {
|
|
|
|
// Create an empty base layer and a snapshot tree out of it
|
|
|
|
base := &diskLayer{
|
2019-11-26 07:48:29 +00:00
|
|
|
diskdb: rawdb.NewMemoryDatabase(),
|
|
|
|
root: common.HexToHash("0x01"),
|
|
|
|
cache: fastcache.New(1024 * 500),
|
2019-10-17 15:30:31 +00:00
|
|
|
}
|
2019-11-22 11:23:49 +00:00
|
|
|
snaps := &Tree{
|
2019-10-17 15:30:31 +00:00
|
|
|
layers: map[common.Hash]snapshot{
|
|
|
|
base.root: base,
|
|
|
|
},
|
|
|
|
}
|
|
|
|
// Commit two diffs on top and retrieve a reference to the bottommost
|
|
|
|
accounts := map[common.Hash][]byte{
|
|
|
|
common.HexToHash("0xa1"): randomAccount(),
|
|
|
|
}
|
|
|
|
storage := make(map[common.Hash]map[common.Hash][]byte)
|
|
|
|
if err := snaps.Update(common.HexToHash("0x02"), common.HexToHash("0x01"), accounts, storage); err != nil {
|
|
|
|
t.Fatalf("failed to create a diff layer: %v", err)
|
|
|
|
}
|
|
|
|
if err := snaps.Update(common.HexToHash("0x03"), common.HexToHash("0x02"), accounts, storage); err != nil {
|
|
|
|
t.Fatalf("failed to create a diff layer: %v", err)
|
|
|
|
}
|
|
|
|
if n := len(snaps.layers); n != 3 {
|
|
|
|
t.Errorf("pre-cap layer count mismatch: have %d, want %d", n, 3)
|
|
|
|
}
|
|
|
|
ref := snaps.Snapshot(common.HexToHash("0x02"))
|
|
|
|
|
|
|
|
// Flatten the diff layer into the bottom accumulator
|
2019-11-26 07:48:29 +00:00
|
|
|
if err := snaps.Cap(common.HexToHash("0x03"), 1); err != nil {
|
2019-10-17 15:30:31 +00:00
|
|
|
t.Fatalf("failed to flatten diff layer into accumulator: %v", err)
|
|
|
|
}
|
|
|
|
// Since the accumulator diff layer was modified, ensure that data retrievald on the external reference fail
|
|
|
|
if acc, err := ref.Account(common.HexToHash("0x01")); err != ErrSnapshotStale {
|
|
|
|
t.Errorf("stale reference returned account: %#x (err: %v)", acc, err)
|
|
|
|
}
|
|
|
|
if slot, err := ref.Storage(common.HexToHash("0xa1"), common.HexToHash("0xb1")); err != ErrSnapshotStale {
|
|
|
|
t.Errorf("stale reference returned storage slot: %#x (err: %v)", slot, err)
|
|
|
|
}
|
|
|
|
if n := len(snaps.layers); n != 2 {
|
|
|
|
t.Errorf("post-cap layer count mismatch: have %d, want %d", n, 2)
|
|
|
|
fmt.Println(snaps.layers)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// Tests that if a diff layer becomes stale, no active external references will
|
|
|
|
// be returned with junk data. This version of the test retains the bottom diff
|
|
|
|
// layer to check the usual mode of operation where the accumulator is retained.
|
|
|
|
func TestDiffLayerExternalInvalidationPartialFlatten(t *testing.T) {
|
|
|
|
// Create an empty base layer and a snapshot tree out of it
|
|
|
|
base := &diskLayer{
|
2019-11-26 07:48:29 +00:00
|
|
|
diskdb: rawdb.NewMemoryDatabase(),
|
|
|
|
root: common.HexToHash("0x01"),
|
|
|
|
cache: fastcache.New(1024 * 500),
|
2019-10-17 15:30:31 +00:00
|
|
|
}
|
2019-11-22 11:23:49 +00:00
|
|
|
snaps := &Tree{
|
2019-10-17 15:30:31 +00:00
|
|
|
layers: map[common.Hash]snapshot{
|
|
|
|
base.root: base,
|
|
|
|
},
|
|
|
|
}
|
|
|
|
// Commit three diffs on top and retrieve a reference to the bottommost
|
|
|
|
accounts := map[common.Hash][]byte{
|
|
|
|
common.HexToHash("0xa1"): randomAccount(),
|
|
|
|
}
|
|
|
|
storage := make(map[common.Hash]map[common.Hash][]byte)
|
|
|
|
if err := snaps.Update(common.HexToHash("0x02"), common.HexToHash("0x01"), accounts, storage); err != nil {
|
|
|
|
t.Fatalf("failed to create a diff layer: %v", err)
|
|
|
|
}
|
|
|
|
if err := snaps.Update(common.HexToHash("0x03"), common.HexToHash("0x02"), accounts, storage); err != nil {
|
|
|
|
t.Fatalf("failed to create a diff layer: %v", err)
|
|
|
|
}
|
|
|
|
if err := snaps.Update(common.HexToHash("0x04"), common.HexToHash("0x03"), accounts, storage); err != nil {
|
|
|
|
t.Fatalf("failed to create a diff layer: %v", err)
|
|
|
|
}
|
|
|
|
if n := len(snaps.layers); n != 4 {
|
|
|
|
t.Errorf("pre-cap layer count mismatch: have %d, want %d", n, 4)
|
|
|
|
}
|
|
|
|
ref := snaps.Snapshot(common.HexToHash("0x02"))
|
|
|
|
|
2019-10-23 13:19:02 +00:00
|
|
|
// Doing a Cap operation with many allowed layers should be a no-op
|
|
|
|
exp := len(snaps.layers)
|
2019-11-26 07:48:29 +00:00
|
|
|
if err := snaps.Cap(common.HexToHash("0x04"), 2000); err != nil {
|
2019-10-23 13:19:02 +00:00
|
|
|
t.Fatalf("failed to flatten diff layer into accumulator: %v", err)
|
|
|
|
}
|
|
|
|
if got := len(snaps.layers); got != exp {
|
|
|
|
t.Errorf("layers modified, got %d exp %d", got, exp)
|
|
|
|
}
|
2019-10-17 15:30:31 +00:00
|
|
|
// Flatten the diff layer into the bottom accumulator
|
2019-11-26 07:48:29 +00:00
|
|
|
if err := snaps.Cap(common.HexToHash("0x04"), 2); err != nil {
|
2019-10-17 15:30:31 +00:00
|
|
|
t.Fatalf("failed to flatten diff layer into accumulator: %v", err)
|
|
|
|
}
|
|
|
|
// Since the accumulator diff layer was modified, ensure that data retrievald on the external reference fail
|
|
|
|
if acc, err := ref.Account(common.HexToHash("0x01")); err != ErrSnapshotStale {
|
|
|
|
t.Errorf("stale reference returned account: %#x (err: %v)", acc, err)
|
|
|
|
}
|
|
|
|
if slot, err := ref.Storage(common.HexToHash("0xa1"), common.HexToHash("0xb1")); err != ErrSnapshotStale {
|
|
|
|
t.Errorf("stale reference returned storage slot: %#x (err: %v)", slot, err)
|
|
|
|
}
|
|
|
|
if n := len(snaps.layers); n != 3 {
|
|
|
|
t.Errorf("post-cap layer count mismatch: have %d, want %d", n, 3)
|
|
|
|
fmt.Println(snaps.layers)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// TestPostCapBasicDataAccess tests some functionality regarding capping/flattening.
|
|
|
|
func TestPostCapBasicDataAccess(t *testing.T) {
|
|
|
|
// setAccount is a helper to construct a random account entry and assign it to
|
|
|
|
// an account slot in a snapshot
|
|
|
|
setAccount := func(accKey string) map[common.Hash][]byte {
|
|
|
|
return map[common.Hash][]byte{
|
|
|
|
common.HexToHash(accKey): randomAccount(),
|
|
|
|
}
|
|
|
|
}
|
|
|
|
// Create a starting base layer and a snapshot tree out of it
|
|
|
|
base := &diskLayer{
|
2019-11-26 07:48:29 +00:00
|
|
|
diskdb: rawdb.NewMemoryDatabase(),
|
|
|
|
root: common.HexToHash("0x01"),
|
|
|
|
cache: fastcache.New(1024 * 500),
|
2019-10-17 15:30:31 +00:00
|
|
|
}
|
2019-11-22 11:23:49 +00:00
|
|
|
snaps := &Tree{
|
2019-10-17 15:30:31 +00:00
|
|
|
layers: map[common.Hash]snapshot{
|
|
|
|
base.root: base,
|
|
|
|
},
|
|
|
|
}
|
|
|
|
// The lowest difflayer
|
|
|
|
snaps.Update(common.HexToHash("0xa1"), common.HexToHash("0x01"), setAccount("0xa1"), nil)
|
|
|
|
snaps.Update(common.HexToHash("0xa2"), common.HexToHash("0xa1"), setAccount("0xa2"), nil)
|
|
|
|
snaps.Update(common.HexToHash("0xb2"), common.HexToHash("0xa1"), setAccount("0xb2"), nil)
|
|
|
|
|
|
|
|
snaps.Update(common.HexToHash("0xa3"), common.HexToHash("0xa2"), setAccount("0xa3"), nil)
|
|
|
|
snaps.Update(common.HexToHash("0xb3"), common.HexToHash("0xb2"), setAccount("0xb3"), nil)
|
|
|
|
|
|
|
|
// checkExist verifies if an account exiss in a snapshot
|
|
|
|
checkExist := func(layer *diffLayer, key string) error {
|
|
|
|
if data, _ := layer.Account(common.HexToHash(key)); data == nil {
|
|
|
|
return fmt.Errorf("expected %x to exist, got nil", common.HexToHash(key))
|
|
|
|
}
|
|
|
|
return nil
|
|
|
|
}
|
|
|
|
// shouldErr checks that an account access errors as expected
|
|
|
|
shouldErr := func(layer *diffLayer, key string) error {
|
|
|
|
if data, err := layer.Account(common.HexToHash(key)); err == nil {
|
|
|
|
return fmt.Errorf("expected error, got data %x", data)
|
|
|
|
}
|
|
|
|
return nil
|
|
|
|
}
|
|
|
|
// check basics
|
|
|
|
snap := snaps.Snapshot(common.HexToHash("0xb3")).(*diffLayer)
|
|
|
|
|
|
|
|
if err := checkExist(snap, "0xa1"); err != nil {
|
|
|
|
t.Error(err)
|
|
|
|
}
|
|
|
|
if err := checkExist(snap, "0xb2"); err != nil {
|
|
|
|
t.Error(err)
|
|
|
|
}
|
|
|
|
if err := checkExist(snap, "0xb3"); err != nil {
|
|
|
|
t.Error(err)
|
|
|
|
}
|
2019-10-23 13:19:02 +00:00
|
|
|
// Cap to a bad root should fail
|
2019-11-26 07:48:29 +00:00
|
|
|
if err := snaps.Cap(common.HexToHash("0x1337"), 0); err == nil {
|
2019-10-23 13:19:02 +00:00
|
|
|
t.Errorf("expected error, got none")
|
|
|
|
}
|
2019-10-17 15:30:31 +00:00
|
|
|
// Now, merge the a-chain
|
2019-11-26 07:48:29 +00:00
|
|
|
snaps.Cap(common.HexToHash("0xa3"), 0)
|
2019-10-17 15:30:31 +00:00
|
|
|
|
|
|
|
// At this point, a2 got merged into a1. Thus, a1 is now modified, and as a1 is
|
|
|
|
// the parent of b2, b2 should no longer be able to iterate into parent.
|
|
|
|
|
|
|
|
// These should still be accessible
|
|
|
|
if err := checkExist(snap, "0xb2"); err != nil {
|
|
|
|
t.Error(err)
|
|
|
|
}
|
|
|
|
if err := checkExist(snap, "0xb3"); err != nil {
|
|
|
|
t.Error(err)
|
|
|
|
}
|
|
|
|
// But these would need iteration into the modified parent
|
|
|
|
if err := shouldErr(snap, "0xa1"); err != nil {
|
|
|
|
t.Error(err)
|
|
|
|
}
|
|
|
|
if err := shouldErr(snap, "0xa2"); err != nil {
|
|
|
|
t.Error(err)
|
|
|
|
}
|
|
|
|
if err := shouldErr(snap, "0xa3"); err != nil {
|
|
|
|
t.Error(err)
|
|
|
|
}
|
2019-10-23 13:19:02 +00:00
|
|
|
// Now, merge it again, just for fun. It should now error, since a3
|
|
|
|
// is a disk layer
|
2019-11-26 07:48:29 +00:00
|
|
|
if err := snaps.Cap(common.HexToHash("0xa3"), 0); err == nil {
|
2019-10-23 13:19:02 +00:00
|
|
|
t.Error("expected error capping the disk layer, got none")
|
|
|
|
}
|
2019-10-17 15:30:31 +00:00
|
|
|
}
|