forks/go-ethereum
1
0
Fork 1
mirror of https://github.com/ethereum/go-ethereum.git synced 2026-08-20 10:52:25 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions

add node_test.go file license and rollback trie_test.go

Browse source
This commit is contained in:
shuaibc1 2019-11-11 16:25:35 +08:00
parent 40ca6ae267
commit 3bc0336323
2 changed files with 35 additions and 6 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

28
trie/node_test.go
View file

@ -1,3 +1,19 @@
// 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 package trie
import ( import (
@ -7,7 +23,7 @@ import (
"github.com/ethereum/go-ethereum/rlp" "github.com/ethereum/go-ethereum/rlp"
) )
func newFullNode(v []byte) []interface{} { func newTestFullNode(v []byte) []interface{} {
fullNodeData := []interface{}{} fullNodeData := []interface{}{}
for i := 0; i < 16; i++ { for i := 0; i < 16; i++ {
k := bytes.Repeat([]byte{byte(i + 1)}, 32) k := bytes.Repeat([]byte{byte(i + 1)}, 32)
@ -18,7 +34,7 @@ func newFullNode(v []byte) []interface{} {
} }
func TestDecodeNestedNode(t *testing.T) { func TestDecodeNestedNode(t *testing.T) {
fullNodeData := newFullNode([]byte("fullnode")) fullNodeData := newTestFullNode([]byte("fullnode"))
data := [][]byte{} data := [][]byte{}
for i := 0; i < 16; i++ { for i := 0; i < 16; i++ {
@ -36,7 +52,7 @@ func TestDecodeNestedNode(t *testing.T) {
} }
func TestDecodeFullNodeWrongSizeChild(t *testing.T) { func TestDecodeFullNodeWrongSizeChild(t *testing.T) {
fullNodeData := newFullNode([]byte("wrongsizechild")) fullNodeData := newTestFullNode([]byte("wrongsizechild"))
fullNodeData[0] = []byte("00") fullNodeData[0] = []byte("00")
buf := bytes.NewBuffer([]byte{}) buf := bytes.NewBuffer([]byte{})
rlp.Encode(buf, fullNodeData) rlp.Encode(buf, fullNodeData)
@ -48,7 +64,7 @@ func TestDecodeFullNodeWrongSizeChild(t *testing.T) {
} }
func TestDecodeFullNodeWrongNestedFullNode(t *testing.T) { func TestDecodeFullNodeWrongNestedFullNode(t *testing.T) {
fullNodeData := newFullNode([]byte("fullnode")) fullNodeData := newTestFullNode([]byte("fullnode"))
data := [][]byte{} data := [][]byte{}
for i := 0; i < 16; i++ { for i := 0; i < 16; i++ {
@ -66,8 +82,8 @@ func TestDecodeFullNodeWrongNestedFullNode(t *testing.T) {
} }
} }
func TestDecodeNode(t *testing.T) { func TestDecodeFullNode(t *testing.T) {
fullNodeData := newFullNode([]byte("decodefullnode")) fullNodeData := newTestFullNode([]byte("decodefullnode"))
buf := bytes.NewBuffer([]byte{}) buf := bytes.NewBuffer([]byte{})
rlp.Encode(buf, fullNodeData) rlp.Encode(buf, fullNodeData)

13
trie/trie_test.go
View file

@ -546,3 +546,16 @@ func updateString(trie *Trie, k, v string) {
func deleteString(trie *Trie, k string) { func deleteString(trie *Trie, k string) {
trie.Delete([]byte(k)) trie.Delete([]byte(k))
} }
func TestDecodeNode(t *testing.T) {
t.Parallel()
var (
hash = make([]byte, 20)
elems = make([]byte, 20)
)
for i := 0; i < 5000000; i++ {
rand.Read(hash)
rand.Read(elems)
decodeNode(hash, elems)
}
}