forked from cosmos/iavl
-
Notifications
You must be signed in to change notification settings - Fork 0
/
node_test.go
179 lines (166 loc) · 5.73 KB
/
node_test.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
package iavl
import (
"bytes"
"encoding/hex"
"math/rand"
"testing"
"github.com/stretchr/testify/assert"
"github.com/stretchr/testify/require"
iavlrand "github.com/cosmos/iavl/internal/rand"
)
func TestNode_encodedSize(t *testing.T) {
node := &Node{
key: iavlrand.RandBytes(10),
value: iavlrand.RandBytes(10),
version: 1,
subtreeHeight: 0,
size: 100,
hash: iavlrand.RandBytes(20),
leftHash: iavlrand.RandBytes(20),
leftNode: nil,
rightHash: iavlrand.RandBytes(20),
rightNode: nil,
persisted: false,
}
// leaf node
require.Equal(t, 26, node.encodedSize())
// non-leaf node
node.subtreeHeight = 1
require.Equal(t, 57, node.encodedSize())
}
func TestNode_encode_decode(t *testing.T) {
testcases := map[string]struct {
node *Node
expectHex string
expectError bool
}{
"nil": {nil, "", true},
"empty": {&Node{}, "0000000000", false},
"inner": {&Node{
subtreeHeight: 3,
version: 2,
size: 7,
key: []byte("key"),
leftHash: []byte{0x70, 0x80, 0x90, 0xa0},
rightHash: []byte{0x10, 0x20, 0x30, 0x40},
}, "060e04036b657904708090a00410203040", false},
"leaf": {&Node{
subtreeHeight: 0,
version: 3,
size: 1,
key: []byte("key"),
value: []byte("value"),
}, "000206036b65790576616c7565", false},
}
for name, tc := range testcases {
tc := tc
t.Run(name, func(t *testing.T) {
var buf bytes.Buffer
err := tc.node.writeBytes(&buf)
if tc.expectError {
require.Error(t, err)
return
}
require.NoError(t, err)
require.Equal(t, tc.expectHex, hex.EncodeToString(buf.Bytes()))
node, err := MakeNode(buf.Bytes())
require.NoError(t, err)
// since key and value is always decoded to []byte{} we augment the expected struct here
if tc.node.key == nil {
tc.node.key = []byte{}
}
if tc.node.value == nil && tc.node.subtreeHeight == 0 {
tc.node.value = []byte{}
}
require.Equal(t, tc.node, node)
})
}
}
func TestNode_validate(t *testing.T) {
k := []byte("key")
v := []byte("value")
h := []byte{1, 2, 3}
c := &Node{key: []byte("child"), value: []byte("x"), version: 1, size: 1}
testcases := map[string]struct {
node *Node
valid bool
}{
"nil node": {nil, false},
"leaf": {&Node{key: k, value: v, version: 1, size: 1}, true},
"leaf with nil key": {&Node{key: nil, value: v, version: 1, size: 1}, false},
"leaf with empty key": {&Node{key: []byte{}, value: v, version: 1, size: 1}, true},
"leaf with nil value": {&Node{key: k, value: nil, version: 1, size: 1}, false},
"leaf with empty value": {&Node{key: k, value: []byte{}, version: 1, size: 1}, true},
"leaf with version 0": {&Node{key: k, value: v, version: 0, size: 1}, false},
"leaf with version -1": {&Node{key: k, value: v, version: -1, size: 1}, false},
"leaf with size 0": {&Node{key: k, value: v, version: 1, size: 0}, false},
"leaf with size 2": {&Node{key: k, value: v, version: 1, size: 2}, false},
"leaf with size -1": {&Node{key: k, value: v, version: 1, size: -1}, false},
"leaf with left hash": {&Node{key: k, value: v, version: 1, size: 1, leftHash: h}, false},
"leaf with left child": {&Node{key: k, value: v, version: 1, size: 1, leftNode: c}, false},
"leaf with right hash": {&Node{key: k, value: v, version: 1, size: 1, rightNode: c}, false},
"leaf with right child": {&Node{key: k, value: v, version: 1, size: 1, rightNode: c}, false},
"inner": {&Node{key: k, version: 1, size: 1, subtreeHeight: 1, leftHash: h, rightHash: h}, true},
"inner with nil key": {&Node{key: nil, value: v, version: 1, size: 1, subtreeHeight: 1, leftHash: h, rightHash: h}, false},
"inner with value": {&Node{key: k, value: v, version: 1, size: 1, subtreeHeight: 1, leftHash: h, rightHash: h}, false},
"inner with empty value": {&Node{key: k, value: []byte{}, version: 1, size: 1, subtreeHeight: 1, leftHash: h, rightHash: h}, false},
"inner with left child": {&Node{key: k, version: 1, size: 1, subtreeHeight: 1, leftHash: h}, true},
"inner with right child": {&Node{key: k, version: 1, size: 1, subtreeHeight: 1, rightHash: h}, true},
"inner with no child": {&Node{key: k, version: 1, size: 1, subtreeHeight: 1}, false},
"inner with height 0": {&Node{key: k, version: 1, size: 1, subtreeHeight: 0, leftHash: h, rightHash: h}, false},
}
for desc, tc := range testcases {
tc := tc // appease scopelint
t.Run(desc, func(t *testing.T) {
err := tc.node.validate()
if tc.valid {
assert.NoError(t, err)
} else {
assert.Error(t, err)
}
})
}
}
func BenchmarkNode_encodedSize(b *testing.B) {
node := &Node{
key: iavlrand.RandBytes(25),
value: iavlrand.RandBytes(100),
version: rand.Int63n(10000000),
subtreeHeight: 1,
size: rand.Int63n(10000000),
leftHash: iavlrand.RandBytes(20),
rightHash: iavlrand.RandBytes(20),
}
b.ReportAllocs()
b.ResetTimer()
for i := 0; i < b.N; i++ {
node.encodedSize()
}
}
func BenchmarkNode_WriteBytes(b *testing.B) {
node := &Node{
key: iavlrand.RandBytes(25),
value: iavlrand.RandBytes(100),
version: rand.Int63n(10000000),
subtreeHeight: 1,
size: rand.Int63n(10000000),
leftHash: iavlrand.RandBytes(20),
rightHash: iavlrand.RandBytes(20),
}
b.ResetTimer()
b.Run("NoPreAllocate", func(sub *testing.B) {
sub.ReportAllocs()
for i := 0; i < sub.N; i++ {
var buf bytes.Buffer
_ = node.writeBytes(&buf)
}
})
b.Run("PreAllocate", func(sub *testing.B) {
sub.ReportAllocs()
for i := 0; i < sub.N; i++ {
var buf bytes.Buffer
buf.Grow(node.encodedSize())
_ = node.writeBytes(&buf)
}
})
}