mirror of
https://gitlab.com/pulsechaincom/erigon-pulse.git
synced 2024-12-22 19:50:36 +00:00
ce96cf75b2
* #remove debug prints * remove storage-mode="i" * minnet re-execute hack with checkpoints * minnet re-execute hack with checkpoints * rollback to master setup * mainnet re-exec hack * rollback some changes * v0 of "push down" functionality * move all logic to own functions * handle case when re-created account already has some storage * clear path for storage * try to rely on tree structure (but maybe need to rely on DB because can be intra-block re-creations of account) * fix some bugs with indexes, moving to tests * tests added * make linter happy * make linter happy * simplify logic * adjust comparison of keys with and without incarnation * test for keyIsBefore * test for keyIsBefore * better nibbles alignment * better nibbles alignment * cleanup * continue work on tests * simplify test * check tombstone existence before pushing it down. * put tombstone only when account deleted, not created * put tombstone only when account has storage * make linter happy * test for storage resolver * make fixedbytes work without incarnation * fix panic on short keys * use special comparison only when working with keys from cache * add blockNr for better tracing * fix: incorrect tombstone check * fix: incorrect tombstone check * trigger ci * hack for problem block * more test-cases * add test case for too long keys * speedup cached resolver by removing bucket creation transaction * remove parent type check in pruning, remove unused copy from mutation.put * dump resolving info on fail * dump resolving info on fail * set tombstone everytime for now to check if it will help * on unload: check parent type, not type of node * fix wrong order of checking node type * fix wrong order of checking node type * rebase to new master * make linter happy * rebase to new master * place tombstone only if acc has storage * rebase master * rebase master * rebase master * rebase master Co-authored-by: alex.sharov <alex.sharov@lazada.com>
62 lines
2.0 KiB
Go
62 lines
2.0 KiB
Go
// 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 off
|
|
// 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/>.
|
|
|
|
// Pruning of the Merkle Patricia trees
|
|
|
|
package trie
|
|
|
|
import (
|
|
"encoding/binary"
|
|
"fmt"
|
|
"testing"
|
|
|
|
"github.com/ledgerwatch/turbo-geth/common"
|
|
)
|
|
|
|
func TestOnePerTimestamp(t *testing.T) {
|
|
tp := NewTriePruning(0)
|
|
tr := New(common.Hash{})
|
|
tr.SetTouchFunc(tp.Touch)
|
|
var key [4]byte
|
|
value := []byte("V")
|
|
var timestamp uint64 = 0
|
|
for n := uint32(0); n < uint32(100); n++ {
|
|
tp.SetBlockNr(timestamp)
|
|
binary.BigEndian.PutUint32(key[:], n)
|
|
tr.Update(key[:], value) // Each key is added within a new generation
|
|
timestamp++
|
|
}
|
|
for n := uint32(50); n < uint32(60); n++ {
|
|
tp.SetBlockNr(timestamp)
|
|
binary.BigEndian.PutUint32(key[:], n)
|
|
tr.Delete(key[:]) // Each key is added within a new generation
|
|
timestamp++
|
|
}
|
|
for n := uint32(30); n < uint32(59); n++ {
|
|
tp.SetBlockNr(timestamp)
|
|
binary.BigEndian.PutUint32(key[:], n)
|
|
tr.Get(key[:]) // Each key is added within a new generation
|
|
timestamp++
|
|
}
|
|
prunableNodes := tr.CountPrunableNodes()
|
|
fmt.Printf("Actual prunable nodes: %d, accounted: %d\n", prunableNodes, tp.NodeCount())
|
|
if b := tp.PruneTo(tr, 4); !b {
|
|
t.Fatal("Not pruned")
|
|
}
|
|
prunableNodes = tr.CountPrunableNodes()
|
|
fmt.Printf("Actual prunable nodes: %d, accounted: %d\n", prunableNodes, tp.NodeCount())
|
|
}
|