-
Notifications
You must be signed in to change notification settings - Fork 12
/
Copy pathmap_metadata_slab_decode.go
291 lines (246 loc) · 7.98 KB
/
map_metadata_slab_decode.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
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
/*
* Atree - Scalable Arrays and Ordered Maps
*
* Copyright Flow Foundation
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package atree
import (
"encoding/binary"
"github.com/fxamacker/cbor/v2"
)
func newMapMetaDataSlabFromData(
id SlabID,
data []byte,
decMode cbor.DecMode,
decodeTypeInfo TypeInfoDecoder,
) (
*MapMetaDataSlab,
error,
) {
// Check minimum data length
if len(data) < versionAndFlagSize {
return nil, NewDecodingErrorf("data is too short for map metadata slab")
}
h, err := newHeadFromData(data[:versionAndFlagSize])
if err != nil {
return nil, NewDecodingError(err)
}
if h.getSlabMapType() != slabMapMeta {
return nil, NewDecodingErrorf(
"data has invalid head 0x%x, want map metadata slab flag",
h[:],
)
}
data = data[versionAndFlagSize:]
switch h.version() {
case 0:
return newMapMetaDataSlabFromDataV0(id, h, data, decMode, decodeTypeInfo)
case 1:
return newMapMetaDataSlabFromDataV1(id, h, data, decMode, decodeTypeInfo)
default:
return nil, NewDecodingErrorf("unexpected version %d for map metadata slab", h.version())
}
}
// newMapMetaDataSlabFromDataV0 decodes data in version 0:
//
// Root MetaDataSlab Header:
//
// +-------------------------------+------------+-------------------------------+------------------------------+
// | slab version + flag (2 bytes) | extra data | slab version + flag (2 bytes) | child header count (2 bytes) |
// +-------------------------------+------------+-------------------------------+------------------------------+
//
// Non-root MetaDataSlab Header (4 bytes):
//
// +-------------------------------+------------------------------+
// | slab version + flag (2 bytes) | child header count (2 bytes) |
// +-------------------------------+------------------------------+
//
// Content (n * 28 bytes):
//
// [ +[slab ID (16 bytes), first key (8 bytes), size (4 bytes)]]
//
// See MapExtraData.Encode() for extra data section format.
func newMapMetaDataSlabFromDataV0(
id SlabID,
h head,
data []byte,
decMode cbor.DecMode,
decodeTypeInfo TypeInfoDecoder,
) (*MapMetaDataSlab, error) {
const (
mapMetaDataArrayHeadSizeV0 = 2
mapSlabHeaderSizeV0 = SlabIDLength + 4 + digestSize
)
var err error
var extraData *MapExtraData
// Check flag for extra data
if h.isRoot() {
// Decode extra data
extraData, data, err = newMapExtraDataFromData(data, decMode, decodeTypeInfo)
if err != nil {
// Don't need to wrap error as external error because err is already categorized by newMapExtraDataFromData().
return nil, err
}
// Skip second head (version + flag) here because it is only present in root slab in version 0.
if len(data) < versionAndFlagSize {
return nil, NewDecodingErrorf("data is too short for array data slab")
}
data = data[versionAndFlagSize:]
}
// Check data length (after decoding extra data if present)
if len(data) < mapMetaDataArrayHeadSizeV0 {
return nil, NewDecodingErrorf("data is too short for map metadata slab")
}
// Decode number of child headers
childHeaderCount := binary.BigEndian.Uint16(data)
data = data[mapMetaDataArrayHeadSizeV0:]
expectedDataLength := mapSlabHeaderSizeV0 * int(childHeaderCount)
if len(data) != expectedDataLength {
return nil, NewDecodingErrorf(
"data has unexpected length %d, want %d",
len(data),
expectedDataLength,
)
}
// Decode child headers
childrenHeaders := make([]MapSlabHeader, childHeaderCount)
offset := 0
for i := 0; i < int(childHeaderCount); i++ {
slabID, err := NewSlabIDFromRawBytes(data[offset:])
if err != nil {
// Don't need to wrap error as external error because err is already categorized by NewSlabIDFromRawBytes().
return nil, err
}
firstKeyOffset := offset + SlabIDLength
firstKey := binary.BigEndian.Uint64(data[firstKeyOffset:])
sizeOffset := firstKeyOffset + digestSize
size := binary.BigEndian.Uint32(data[sizeOffset:])
childrenHeaders[i] = MapSlabHeader{
slabID: slabID,
size: size,
firstKey: Digest(firstKey),
}
offset += mapSlabHeaderSizeV0
}
var firstKey Digest
if len(childrenHeaders) > 0 {
firstKey = childrenHeaders[0].firstKey
}
// Compute slab size in version 1.
slabSize := mapMetaDataSlabPrefixSize + mapSlabHeaderSize*uint32(childHeaderCount)
header := MapSlabHeader{
slabID: id,
size: slabSize,
firstKey: firstKey,
}
return &MapMetaDataSlab{
header: header,
childrenHeaders: childrenHeaders,
extraData: extraData,
}, nil
}
// newMapMetaDataSlabFromDataV1 decodes data in version 1:
//
// Root MetaDataSlab Header:
//
// +------------------------------+------------+--------------------------------+------------------------------+
// | slab version + flag (2 byte) | extra data | child shared address (8 bytes) | child header count (2 bytes) |
// +------------------------------+------------+--------------------------------+------------------------------+
//
// Non-root MetaDataSlab Header (4 bytes):
//
// +------------------------------+--------------------------------+------------------------------+
// | slab version + flag (2 byte) | child shared address (8 bytes) | child header count (2 bytes) |
// +------------------------------+--------------------------------+------------------------------+
//
// Content (n * 18 bytes):
//
// [ +[slab index (8 bytes), first key (8 bytes), size (2 bytes)]]
//
// See MapExtraData.Encode() for extra data section format.
func newMapMetaDataSlabFromDataV1(
id SlabID,
h head,
data []byte,
decMode cbor.DecMode,
decodeTypeInfo TypeInfoDecoder,
) (*MapMetaDataSlab, error) {
var err error
var extraData *MapExtraData
if h.isRoot() {
// Decode extra data
extraData, data, err = newMapExtraDataFromData(data, decMode, decodeTypeInfo)
if err != nil {
// Don't need to wrap error as external error because err is already categorized by newMapExtraDataFromData().
return nil, err
}
}
// Check minimum data length after version, flag, and extra data are processed
minLength := mapMetaDataSlabPrefixSize - versionAndFlagSize
if len(data) < minLength {
return nil, NewDecodingErrorf("data is too short for map metadata slab")
}
offset := 0
// Decode shared address of headers
var address Address
copy(address[:], data[offset:])
offset += SlabAddressLength
// Decode number of child headers
const arrayHeaderSize = 2
childHeaderCount := binary.BigEndian.Uint16(data[offset:])
offset += arrayHeaderSize
expectedDataLength := mapSlabHeaderSize * int(childHeaderCount)
if len(data[offset:]) != expectedDataLength {
return nil, NewDecodingErrorf(
"data has unexpected length %d, want %d",
len(data),
expectedDataLength,
)
}
// Decode child headers
childrenHeaders := make([]MapSlabHeader, childHeaderCount)
for i := 0; i < int(childHeaderCount); i++ {
// Decode slab index
var index SlabIndex
copy(index[:], data[offset:])
offset += SlabIndexLength
// Decode first key
firstKey := binary.BigEndian.Uint64(data[offset:])
offset += digestSize
// Decode size
size := binary.BigEndian.Uint16(data[offset:])
offset += 2
childrenHeaders[i] = MapSlabHeader{
slabID: SlabID{address, index},
size: uint32(size),
firstKey: Digest(firstKey),
}
}
var firstKey Digest
if len(childrenHeaders) > 0 {
firstKey = childrenHeaders[0].firstKey
}
slabSize := mapMetaDataSlabPrefixSize + mapSlabHeaderSize*uint32(childHeaderCount)
header := MapSlabHeader{
slabID: id,
size: slabSize,
firstKey: firstKey,
}
return &MapMetaDataSlab{
header: header,
childrenHeaders: childrenHeaders,
extraData: extraData,
}, nil
}