diff options
| author | Péter Szilágyi <peterke@gmail.com> | 2018-06-21 17:28:05 +0800 |
|---|---|---|
| committer | Felix Lange <fjl@users.noreply.github.com> | 2018-06-21 17:28:05 +0800 |
| commit | d926bf2c7e3182d694c15829a37a0ca7331cd03c (patch) | |
| tree | c2d3ddd85941a231fb05de46c36703273d11814a /core/blockchain_test.go | |
| parent | 8db8d074e2fff547e9d85169018e03f89b5975a1 (diff) | |
| download | dexon-d926bf2c7e3182d694c15829a37a0ca7331cd03c.tar dexon-d926bf2c7e3182d694c15829a37a0ca7331cd03c.tar.gz dexon-d926bf2c7e3182d694c15829a37a0ca7331cd03c.tar.bz2 dexon-d926bf2c7e3182d694c15829a37a0ca7331cd03c.tar.lz dexon-d926bf2c7e3182d694c15829a37a0ca7331cd03c.tar.xz dexon-d926bf2c7e3182d694c15829a37a0ca7331cd03c.tar.zst dexon-d926bf2c7e3182d694c15829a37a0ca7331cd03c.zip | |
trie: cache collapsed tries node, not rlp blobs (#16876)
The current trie memory database/cache that we do pruning on stores
trie nodes as binary rlp encoded blobs, and also stores the node
relationships/references for GC purposes. However, most of the trie
nodes (everything apart from a value node) is in essence just a
collection of references.
This PR switches out the RLP encoded trie blobs with the
collapsed-but-not-serialized trie nodes. This permits most of the
references to be recovered from within the node data structure,
avoiding the need to track them a second time (expensive memory wise).
Diffstat (limited to 'core/blockchain_test.go')
| -rw-r--r-- | core/blockchain_test.go | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/core/blockchain_test.go b/core/blockchain_test.go index f409bb7b0..687209bfa 100644 --- a/core/blockchain_test.go +++ b/core/blockchain_test.go @@ -1313,8 +1313,8 @@ func TestTrieForkGC(t *testing.T) { } // Dereference all the recent tries and ensure no past trie is left in for i := 0; i < triesInMemory; i++ { - chain.stateCache.TrieDB().Dereference(blocks[len(blocks)-1-i].Root(), common.Hash{}) - chain.stateCache.TrieDB().Dereference(forks[len(blocks)-1-i].Root(), common.Hash{}) + chain.stateCache.TrieDB().Dereference(blocks[len(blocks)-1-i].Root()) + chain.stateCache.TrieDB().Dereference(forks[len(blocks)-1-i].Root()) } if len(chain.stateCache.TrieDB().Nodes()) > 0 { t.Fatalf("stale tries still alive after garbase collection") |