/
schema.go
260 lines (238 loc) · 6.08 KB
/
schema.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
package wiredtiger
import (
"fmt"
"github.com/FavorLabs/favorX/pkg/shed/driver"
)
const (
schemaMetadataTableName = "schema_metadata"
fieldTableName = "fields_collection"
fieldMetadataKeyPrefix = "field_"
fieldKeyPrefix byte = 1
indexMetadataKeyPrefix = "index_"
indexTablePrefix = "ind_col_"
stateTableName = "state_collection"
)
var (
// Every index has its own key prefix and this value defines the first one.
defaultIndexKeyPrefix = []byte{'0'}
)
func indexKeyPrefixIncr(prefix []byte) error {
carry := 0
carryFn := func(b *byte) int {
carry := 0
switch *b {
case '9':
*b = 'a'
case 'z':
carry = 1
*b = '0'
default:
*b++
}
return carry
}
for i := len(prefix) - 1; i >= 0; i-- {
if carry == 1 {
carry = carryFn(&prefix[i])
}
carry = carryFn(&prefix[i])
if carry == 0 {
break
}
}
if carry == 1 {
return fmt.Errorf("reach maximum table number")
}
return nil
}
var schema driver.SchemaSpec
func (db *DB) InitSchema() error {
s, err := newSession(db.conn)
if err != nil {
return err
}
tableOption := &createOption{
SourceType: "file",
MemoryPageMax: 10485760, // 10M
SplitPct: 90,
LeafPageMax: 64 * 1024,
LeafValueMax: 67108864, // 64MB
Checksum: "on",
PrefixCompression: true,
BlockCompressor: NoneCompressor,
AccessPatternHint: "random",
AllocationSize: 4 * 1024,
KeyFormat: "u",
ValueFormat: "u",
}
// create metadata
err = s.create(dataSource{dataType: tableSource, sourceName: schemaMetadataTableName}, tableOption)
if err != nil {
return err
}
// all fields should store at fieldTable
err = s.create(dataSource{dataType: tableSource, sourceName: fieldTableName}, tableOption)
if err != nil {
return err
}
// no prefix key should store at stateTable
err = s.create(dataSource{dataType: tableSource, sourceName: stateTableName}, tableOption)
if err != nil {
return err
}
schema.Fields = make([]driver.FieldSpec, 0)
schema.Indexes = make([]driver.IndexSpec, 0)
return s.close()
}
func (db *DB) DefaultFieldKey() []byte {
return []byte{fieldKeyPrefix}
}
func (db *DB) DefaultIndexKey() []byte {
return defaultIndexKeyPrefix
}
func (db *DB) CreateField(spec driver.FieldSpec) ([]byte, error) {
var found bool
for _, f := range schema.Fields {
if f.Name == spec.Name {
if f.Type != spec.Type {
return nil, fmt.Errorf("field %q of type %q stored as %q in db", spec.Name, spec.Type, f.Type)
}
break
}
}
if !found {
obj := dataSource{dataType: tableSource, sourceName: schemaMetadataTableName}
s := db.pool.Get(obj.String())
if s == nil {
return nil, ErrSessionHasClosed
}
defer db.pool.Put(s)
c, err := s.openCursor(obj, &cursorOption{Overwrite: false})
if err != nil {
return nil, err
}
defer s.closeCursor(c)
key := append([]byte(fieldMetadataKeyPrefix), []byte(spec.Name)...)
err = c.insert(key, []byte(spec.Type))
switch {
case IsDuplicateKey(err):
// nothing
case err == nil:
case err != nil:
return nil, err
}
schema.Fields = append(schema.Fields, spec)
}
return append([]byte{fieldKeyPrefix}, []byte(spec.Name)...), nil
}
func (db *DB) CreateIndex(spec driver.IndexSpec) ([]byte, error) {
currentPrefix := defaultIndexKeyPrefix
for _, i := range schema.Indexes {
if i.Name == spec.Name {
return i.Prefix, nil
}
currentPrefix = i.Prefix
}
obj := dataSource{dataType: tableSource, sourceName: schemaMetadataTableName}
s := db.pool.Get(obj.String())
if s == nil {
return nil, ErrSessionHasClosed
}
defer db.pool.Put(s)
c, err := s.openCursor(dataSource{dataType: tableSource, sourceName: schemaMetadataTableName}, &cursorOption{Overwrite: false})
if err != nil {
return nil, err
}
defer s.closeCursor(c)
key := append([]byte(indexMetadataKeyPrefix), []byte(spec.Name)...)
prefix := make([]byte, len(currentPrefix))
copy(prefix, currentPrefix)
err = c.insert(key, prefix)
switch {
case IsDuplicateKey(err):
r, _ := c.find(key)
value := r.Value()
_ = r.Close()
copy(prefix, value)
case err == nil:
err = indexKeyPrefixIncr(prefix)
if err != nil {
return nil, err
}
// create index table
err = s.create(dataSource{dataType: tableSource, sourceName: string(append([]byte(indexTablePrefix), prefix...))}, &createOption{
SourceType: "file",
MemoryPageMax: 10485760, // 10M
SplitPct: 90,
LeafPageMax: 64 * 1024,
LeafValueMax: 67108864, // 64MB
Checksum: "on",
PrefixCompression: true,
BlockCompressor: SnappyCompressor,
AccessPatternHint: "random",
AllocationSize: 4 * 1024,
KeyFormat: "u",
ValueFormat: "u",
})
if err != nil {
return nil, err
}
err = c.update(key, prefix)
if err != nil {
return nil, err
}
case err != nil:
return nil, err
}
spec.Prefix = make([]byte, len(prefix))
copy(spec.Prefix, prefix)
schema.Indexes = append(schema.Indexes, spec)
return spec.Prefix, nil
}
func (db *DB) RenameIndex(oldName, newName string) (bool, error) {
obj := dataSource{dataType: tableSource, sourceName: schemaMetadataTableName}
s := db.pool.Get(obj.String())
if s == nil {
return false, ErrSessionHasClosed
}
defer db.pool.Put(s)
c, err := s.openCursor(dataSource{dataType: tableSource, sourceName: schemaMetadataTableName}, &cursorOption{Overwrite: false})
if err != nil {
return false, err
}
defer s.closeCursor(c)
key := append([]byte(indexMetadataKeyPrefix), []byte(oldName)...)
r, err := c.find(key)
switch {
case err == nil:
case IsNotFound(err):
return false, nil
case err != nil:
return false, err
}
defer r.Close()
value := r.Value()
err = c.remove(key)
if err != nil {
return false, err
}
newKey := append([]byte(indexMetadataKeyPrefix), []byte(newName)...)
err = c.insert(newKey, value)
switch {
case err == nil:
for d, i := range schema.Indexes {
if i.Name == oldName {
i.Name = newName
schema.Indexes[d] = i
break
}
}
return true, nil
case IsDuplicateKey(err):
return false, nil
}
return false, err
}
func (db *DB) GetSchemaSpec() (driver.SchemaSpec, error) {
return schema, nil
}