-
Notifications
You must be signed in to change notification settings - Fork 0
/
table64.go
167 lines (144 loc) · 3.96 KB
/
table64.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
package table64
import (
"fmt"
"github.com/henderiw/idxtable/pkg/idxtable"
"github.com/henderiw/idxtable/pkg/table"
"github.com/henderiw/idxtable/pkg/tree"
"github.com/henderiw/idxtable/pkg/tree/id64"
"k8s.io/apimachinery/pkg/labels"
)
func New(start, end uint64) table.Table {
return &table64{
table: idxtable.NewTable[tree.Entry](
uint64(end - start + 1),
),
start: start,
end: end,
}
}
type table64 struct {
table idxtable.Table[tree.Entry]
start uint64
end uint64
}
func (r *table64) Get(id uint64) (tree.Entry, error) {
var entry tree.Entry
// Validate input
if err := r.validateID(id); err != nil {
return entry, err
}
newid := calculateIndex(id, r.start)
e, err := r.table.Get(newid)
if err != nil {
return entry, err
}
return e.Data(), nil
}
func (r *table64) Claim(id uint64, labels labels.Set) error {
// Validate input
if err := r.validateID(id); err != nil {
return err
}
newid := calculateIndex(id, r.start)
if !r.table.IsFree(newid) {
return fmt.Errorf("claim failed id %d already claimed", calculateIDFromIndex(r.start, newid))
}
treeId := id64.NewID(uint64(newid), id64.IDBitSize)
treeEntry := tree.NewEntry(treeId.Copy(), labels)
return r.table.Claim(newid, treeEntry)
}
func (r *table64) ClaimFree(labels labels.Set) (tree.Entry, error) {
// Validate input
id, err := r.FindFree()
if err != nil {
return nil, err
}
if err := r.Claim(id, labels); err != nil {
return nil, err
}
treeId := id64.NewID(uint64(id), id64.IDBitSize)
treeEntry := tree.NewEntry(treeId.Copy(), labels)
return treeEntry, nil
}
func (r *table64) Release(id uint64) error {
// Validate input
if err := r.validateID(id); err != nil {
return err
}
newid := calculateIndex(id, r.start)
return r.table.Release(newid)
}
func (r *table64) Update(id uint64, labels labels.Set) error {
// Validate input
if err := r.validateID(id); err != nil {
return err
}
newid := calculateIndex(id, r.start)
treeId := id64.NewID(uint64(newid), id64.IDBitSize)
treeEntry := tree.NewEntry(treeId.Copy(), labels)
return r.table.Update(newid, treeEntry)
}
func (r *table64) Size() int {
return r.table.Size()
}
func (r *table64) Has(id uint64) bool {
// Validate IP address
if err := r.validateID(id); err != nil {
return false
}
newid := calculateIndex(id, r.start)
return r.table.Has(newid)
}
func (r *table64) IsFree(id uint64) bool {
// Validate IP address
if err := r.validateID(id); err != nil {
return false
}
newid := calculateIndex(id, r.start)
return r.table.IsFree(newid)
}
func (r *table64) FindFree() (uint64, error) {
id, err := r.table.FindFree()
if err != nil {
return 0, err
}
return calculateIDFromIndex(r.start, id), nil
}
func (r *table64) GetAll() tree.Entries {
entries := make(tree.Entries, 0, r.table.Size())
for _, entry := range r.table.GetAll() {
// need to remap the id for the outside world
entry := tree.NewEntry(id64.NewID(uint64(calculateIDFromIndex(r.start, entry.ID())), id64.IDBitSize), entry.Data().Labels())
entries = append(entries, entry)
}
return entries
}
func (r *table64) GetByLabel(selector labels.Selector) tree.Entries {
entries := make(tree.Entries, 0, r.table.Size())
iter := r.table.Iterate()
for iter.Next() {
entry := iter.Value().Data()
if selector.Matches(entry.Labels()) {
// need to remap the id for the outside world
entry := tree.NewEntry(id64.NewID(uint64(calculateIDFromIndex(r.start, uint64(entry.ID().ID()))), id64.IDBitSize), entry.Labels())
entries = append(entries, entry)
}
}
return entries
}
func (r *table64) validateID(id uint64) error {
if id < r.start {
return fmt.Errorf("id %d, does not fit in the range from %d to %d", id, r.start, r.end)
}
if id > r.end {
return fmt.Errorf("id %d, does not fit in the range from %d to %d", id, r.start, r.end)
}
return nil
}
func calculateIndex(id, start uint64) uint64 {
// Calculate the index in the bitmap
return uint64(id - start)
}
func calculateIDFromIndex(start uint64, id uint64) uint64 {
return start + id
}