forked from ferranbt/fastssz
-
Notifications
You must be signed in to change notification settings - Fork 3
/
case1_encoding.go
204 lines (167 loc) · 3.98 KB
/
case1_encoding.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
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
// Code generated by fastssz. DO NOT EDIT.
// Hash: 663bf5f44a061a5323c14ee77b0fdaa2eac9c717999dc83d0a3cbd1453853ab7
// Version: 0.1.2
package testcases
import (
ssz "github.com/ferranbt/fastssz"
)
// MarshalSSZ ssz marshals the Case1A object
func (c *Case1A) MarshalSSZ() ([]byte, error) {
return ssz.MarshalSSZ(c)
}
// MarshalSSZTo ssz marshals the Case1A object to a target array
func (c *Case1A) MarshalSSZTo(buf []byte) (dst []byte, err error) {
dst = buf
offset := int(4)
// Offset (0) 'Foo'
dst = ssz.WriteOffset(dst, offset)
offset += len(c.Foo)
// Field (0) 'Foo'
if size := len(c.Foo); size > 2048 {
err = ssz.ErrBytesLengthFn("Case1A.Foo", size, 2048)
return
}
dst = append(dst, c.Foo...)
return
}
// UnmarshalSSZ ssz unmarshals the Case1A object
func (c *Case1A) UnmarshalSSZ(buf []byte) error {
var err error
size := uint64(len(buf))
if size < 4 {
return ssz.ErrSize
}
tail := buf
var o0 uint64
// Offset (0) 'Foo'
if o0 = ssz.ReadOffset(buf[0:4]); o0 > size {
return ssz.ErrOffset
}
if o0 < 4 {
return ssz.ErrInvalidVariableOffset
}
// Field (0) 'Foo'
{
buf = tail[o0:]
if len(buf) > 2048 {
return ssz.ErrBytesLength
}
if cap(c.Foo) == 0 {
c.Foo = make([]byte, 0, len(buf))
}
c.Foo = append(c.Foo, buf...)
}
return err
}
// SizeSSZ returns the ssz encoded size in bytes for the Case1A object
func (c *Case1A) SizeSSZ() (size int) {
size = 4
// Field (0) 'Foo'
size += len(c.Foo)
return
}
// HashTreeRoot ssz hashes the Case1A object
func (c *Case1A) HashTreeRoot() ([32]byte, error) {
return ssz.HashWithDefaultHasher(c)
}
// HashTreeRootWith ssz hashes the Case1A object with a hasher
func (c *Case1A) HashTreeRootWith(hh ssz.HashWalker) (err error) {
indx := hh.Index()
// Field (0) 'Foo'
{
elemIndx := hh.Index()
byteLen := uint64(len(c.Foo))
if byteLen > 2048 {
err = ssz.ErrIncorrectListSize
return
}
hh.PutBytes(c.Foo)
hh.MerkleizeWithMixin(elemIndx, byteLen, (2048+31)/32)
}
hh.Merkleize(indx)
return
}
// GetTree ssz hashes the Case1A object
func (c *Case1A) GetTree() (*ssz.Node, error) {
return ssz.ProofTree(c)
}
// MarshalSSZ ssz marshals the Case1B object
func (c *Case1B) MarshalSSZ() ([]byte, error) {
return ssz.MarshalSSZ(c)
}
// MarshalSSZTo ssz marshals the Case1B object to a target array
func (c *Case1B) MarshalSSZTo(buf []byte) (dst []byte, err error) {
dst = buf
offset := int(4)
// Offset (0) 'Bar'
dst = ssz.WriteOffset(dst, offset)
offset += len(c.Bar)
// Field (0) 'Bar'
if size := len(c.Bar); size > 32 {
err = ssz.ErrBytesLengthFn("Case1B.Bar", size, 32)
return
}
dst = append(dst, c.Bar...)
return
}
// UnmarshalSSZ ssz unmarshals the Case1B object
func (c *Case1B) UnmarshalSSZ(buf []byte) error {
var err error
size := uint64(len(buf))
if size < 4 {
return ssz.ErrSize
}
tail := buf
var o0 uint64
// Offset (0) 'Bar'
if o0 = ssz.ReadOffset(buf[0:4]); o0 > size {
return ssz.ErrOffset
}
if o0 < 4 {
return ssz.ErrInvalidVariableOffset
}
// Field (0) 'Bar'
{
buf = tail[o0:]
if len(buf) > 32 {
return ssz.ErrBytesLength
}
if cap(c.Bar) == 0 {
c.Bar = make([]byte, 0, len(buf))
}
c.Bar = append(c.Bar, buf...)
}
return err
}
// SizeSSZ returns the ssz encoded size in bytes for the Case1B object
func (c *Case1B) SizeSSZ() (size int) {
size = 4
// Field (0) 'Bar'
size += len(c.Bar)
return
}
// HashTreeRoot ssz hashes the Case1B object
func (c *Case1B) HashTreeRoot() ([32]byte, error) {
return ssz.HashWithDefaultHasher(c)
}
// HashTreeRootWith ssz hashes the Case1B object with a hasher
func (c *Case1B) HashTreeRootWith(hh ssz.HashWalker) (err error) {
indx := hh.Index()
// Field (0) 'Bar'
{
elemIndx := hh.Index()
byteLen := uint64(len(c.Bar))
if byteLen > 32 {
err = ssz.ErrIncorrectListSize
return
}
hh.PutBytes(c.Bar)
hh.MerkleizeWithMixin(elemIndx, byteLen, (32+31)/32)
}
hh.Merkleize(indx)
return
}
// GetTree ssz hashes the Case1B object
func (c *Case1B) GetTree() (*ssz.Node, error) {
return ssz.ProofTree(c)
}