-
Notifications
You must be signed in to change notification settings - Fork 12
/
Copy pathslab_id.go
147 lines (121 loc) · 3.36 KB
/
slab_id.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
/*
* 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 (
"bytes"
"encoding/binary"
"fmt"
)
const (
SlabAddressLength = 8
SlabIndexLength = 8
SlabIDLength = SlabAddressLength + SlabIndexLength
)
// WARNING: Any changes to SlabID or its components (Address and SlabIndex)
// require updates to ValueID definition and functions.
type (
Address [SlabAddressLength]byte
SlabIndex [SlabIndexLength]byte
// SlabID identifies slab in storage.
// SlabID should only be used to retrieve,
// store, and remove slab in storage.
SlabID struct {
address Address
index SlabIndex
}
)
var (
AddressUndefined = Address{}
SlabIndexUndefined = SlabIndex{}
SlabIDUndefined = SlabID{}
)
// SlabIndex
// Next returns new SlabIndex with index+1 value.
// The caller is responsible for preventing overflow
// by checking if the index value is valid before
// calling this function.
func (index SlabIndex) Next() SlabIndex {
i := binary.BigEndian.Uint64(index[:])
var next SlabIndex
binary.BigEndian.PutUint64(next[:], i+1)
return next
}
func SlabIndexToLedgerKey(ind SlabIndex) []byte {
return []byte(LedgerBaseStorageSlabPrefix + string(ind[:]))
}
// SlabID
func NewSlabID(address Address, index SlabIndex) SlabID {
return SlabID{address, index}
}
func NewSlabIDFromRawBytes(b []byte) (SlabID, error) {
if len(b) < SlabIDLength {
return SlabID{}, NewSlabIDErrorf("incorrect slab ID buffer length %d", len(b))
}
var address Address
copy(address[:], b)
var index SlabIndex
copy(index[:], b[SlabAddressLength:])
return SlabID{address, index}, nil
}
func (id SlabID) ToRawBytes(b []byte) (int, error) {
if len(b) < SlabIDLength {
return 0, NewSlabIDErrorf("incorrect slab ID buffer length %d", len(b))
}
copy(b, id.address[:])
copy(b[SlabAddressLength:], id.index[:])
return SlabIDLength, nil
}
func (id SlabID) String() string {
return fmt.Sprintf(
"0x%x.%d",
binary.BigEndian.Uint64(id.address[:]),
binary.BigEndian.Uint64(id.index[:]),
)
}
func (id SlabID) AddressAsUint64() uint64 {
return binary.BigEndian.Uint64(id.address[:])
}
// Address returns the address of SlabID.
func (id SlabID) Address() Address {
return id.address
}
func (id SlabID) IndexAsUint64() uint64 {
return binary.BigEndian.Uint64(id.index[:])
}
func (id SlabID) HasTempAddress() bool {
return id.address == AddressUndefined
}
func (id SlabID) Index() SlabIndex {
return id.index
}
func (id SlabID) Valid() error {
if id == SlabIDUndefined {
return NewSlabIDError("undefined slab ID")
}
if id.index == SlabIndexUndefined {
return NewSlabIDError("undefined slab index")
}
return nil
}
func (id SlabID) Compare(other SlabID) int {
result := bytes.Compare(id.address[:], other.address[:])
if result == 0 {
return bytes.Compare(id.index[:], other.index[:])
}
return result
}