* port statediff from https://github.com/jpmorganchase/quorum/blob/9b7fd9af8082795eeeb6863d9746f12b82dd5078/statediff/statediff.go; minor fixes * integrating state diff extracting, building, and persisting into geth processes * work towards persisting created statediffs in ipfs; based off github.com/vulcanize/eth-block-extractor * Add a state diff service * Remove diff extractor from blockchain * Update imports * Move statediff on/off check to geth cmd config * Update starting state diff service * Add debugging logs for creating diff * Add statediff extractor and builder tests and small refactoring * Start to write statediff to a CSV * Restructure statediff directory * Pull CSV publishing methods into their own file * Reformatting due to go fmt * Add gomega to vendor dir * Remove testing focuses * Update statediff tests to use golang test pkg instead of ginkgo - builder_test - extractor_test - publisher_test * Use hexutil.Encode instead of deprecated common.ToHex * Remove OldValue from DiffBigInt and DiffUint64 fields * Update builder test * Remove old storage value from updated accounts * Remove old values from created/deleted accounts * Update publisher to account for only storing current account values * Update service loop and fetching previous block * Update testing - remove statediff ginkgo test suite file - move mocks to their own dir * Updates per go fmt * Updates to tests * Pass statediff mode and path in through cli * Return filename from publisher * Remove some duplication in builder * Remove code field from state diff output this is the contract byte code, and it can still be obtained by querying the db by the codeHash * Consolidate acct diff structs for updated & updated/deleted accts * Include block number in csv filename * Clean up error logging * Cleanup formatting, spelling, etc * Address PR comments * Add contract address and storage value to csv * Refactor accumulating account row in csv publisher * Add DiffStorage struct * Add storage key to csv * Address PR comments * Fix publisher to include rows for accounts that don't have store updates * Update builder test after merging in release/1.8 * Update test contract to include storage on contract intialization - so that we're able to test that storage diffing works for created and deleted accounts (not just updated accounts). * Factor out a common trie iterator method in builder
105 lines
3.3 KiB
Go
105 lines
3.3 KiB
Go
// Copyright 2014 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 trie
|
|
|
|
import (
|
|
"bytes"
|
|
"testing"
|
|
)
|
|
|
|
func TestHexCompact(t *testing.T) {
|
|
tests := []struct{ hex, compact []byte }{
|
|
// empty keys, with and without terminator.
|
|
{hex: []byte{}, compact: []byte{0x00}},
|
|
{hex: []byte{16}, compact: []byte{0x20}},
|
|
// odd length, no terminator
|
|
{hex: []byte{1, 2, 3, 4, 5}, compact: []byte{0x11, 0x23, 0x45}},
|
|
// even length, no terminator
|
|
{hex: []byte{0, 1, 2, 3, 4, 5}, compact: []byte{0x00, 0x01, 0x23, 0x45}},
|
|
// odd length, terminator
|
|
{hex: []byte{15, 1, 12, 11, 8, 16 /*term*/}, compact: []byte{0x3f, 0x1c, 0xb8}},
|
|
// even length, terminator
|
|
{hex: []byte{0, 15, 1, 12, 11, 8, 16 /*term*/}, compact: []byte{0x20, 0x0f, 0x1c, 0xb8}},
|
|
}
|
|
for _, test := range tests {
|
|
if c := hexToCompact(test.hex); !bytes.Equal(c, test.compact) {
|
|
t.Errorf("hexToCompact(%x) -> %x, want %x", test.hex, c, test.compact)
|
|
}
|
|
if h := compactToHex(test.compact); !bytes.Equal(h, test.hex) {
|
|
t.Errorf("compactToHex(%x) -> %x, want %x", test.compact, h, test.hex)
|
|
}
|
|
}
|
|
}
|
|
|
|
func TestHexKeybytes(t *testing.T) {
|
|
tests := []struct{ key, hexIn, hexOut []byte }{
|
|
{key: []byte{}, hexIn: []byte{16}, hexOut: []byte{16}},
|
|
{key: []byte{}, hexIn: []byte{}, hexOut: []byte{16}},
|
|
{
|
|
key: []byte{0x12, 0x34, 0x56},
|
|
hexIn: []byte{1, 2, 3, 4, 5, 6, 16},
|
|
hexOut: []byte{1, 2, 3, 4, 5, 6, 16},
|
|
},
|
|
{
|
|
key: []byte{0x12, 0x34, 0x5},
|
|
hexIn: []byte{1, 2, 3, 4, 0, 5, 16},
|
|
hexOut: []byte{1, 2, 3, 4, 0, 5, 16},
|
|
},
|
|
{
|
|
key: []byte{0x12, 0x34, 0x56},
|
|
hexIn: []byte{1, 2, 3, 4, 5, 6},
|
|
hexOut: []byte{1, 2, 3, 4, 5, 6, 16},
|
|
},
|
|
}
|
|
for _, test := range tests {
|
|
if h := keybytesToHex(test.key); !bytes.Equal(h, test.hexOut) {
|
|
t.Errorf("keybytesToHex(%x) -> %x, want %x", test.key, h, test.hexOut)
|
|
}
|
|
if k := hexToKeyBytes(test.hexIn); !bytes.Equal(k, test.key) {
|
|
t.Errorf("hexToKeyBytes(%x) -> %x, want %x", test.hexIn, k, test.key)
|
|
}
|
|
}
|
|
}
|
|
|
|
func BenchmarkHexToCompact(b *testing.B) {
|
|
testBytes := []byte{0, 15, 1, 12, 11, 8, 16 /*term*/}
|
|
for i := 0; i < b.N; i++ {
|
|
hexToCompact(testBytes)
|
|
}
|
|
}
|
|
|
|
func BenchmarkCompactToHex(b *testing.B) {
|
|
testBytes := []byte{0, 15, 1, 12, 11, 8, 16 /*term*/}
|
|
for i := 0; i < b.N; i++ {
|
|
compactToHex(testBytes)
|
|
}
|
|
}
|
|
|
|
func BenchmarkKeybytesToHex(b *testing.B) {
|
|
testBytes := []byte{7, 6, 6, 5, 7, 2, 6, 2, 16}
|
|
for i := 0; i < b.N; i++ {
|
|
keybytesToHex(testBytes)
|
|
}
|
|
}
|
|
|
|
func BenchmarkHexToKeybytes(b *testing.B) {
|
|
testBytes := []byte{7, 6, 6, 5, 7, 2, 6, 2, 16}
|
|
for i := 0; i < b.N; i++ {
|
|
hexToKeyBytes(testBytes)
|
|
}
|
|
}
|