/
oltree.go
306 lines (287 loc) · 7.16 KB
/
oltree.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
292
293
294
295
296
297
298
299
300
301
302
303
304
305
/*
Copyright (c) 2018 Simon Schmidt
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.
*/
package groupdb3
import avl "github.com/emirpasic/gods/trees/avltree"
//import "github.com/emirpasic/gods/utils"
import "github.com/vmihailenco/msgpack"
import "bytes"
import "bufio"
import "sync"
import "os"
import "errors"
func bytesComparator(a, b interface{}) int {
return bytes.Compare(a.([]byte),b.([]byte))
}
type TableKey struct{
_msgpack struct{} `msgpack:",asArray"`
Group []byte
Number uint64
}
func (t *TableKey) decode(a interface{}) {
switch v := a.(type){
case TableKey: *t = v
case *TableKey: *t = *v
default: panic("invalid key")
}
}
func TKComparator(a, b interface{}) int {
var A,B TableKey
A.decode(a)
B.decode(b)
cmp := bytes.Compare(A.Group,B.Group)
if cmp!=0 { return cmp }
if A.Number<B.Number { return -1 }
if A.Number>B.Number { return 1 }
return 0
}
func tkCompare(A,B TableKey) int {
cmp := bytes.Compare(A.Group,B.Group)
if cmp!=0 { return cmp }
if A.Number<B.Number { return -1 }
if A.Number>B.Number { return 1 }
return 0
}
type TableRow struct{
_msgpack struct{} `msgpack:",asArray"`
TableKey
Expires uint64
MessageId []byte
}
type GroupStats struct{
Count,Low,High int64
}
type ListGroupStats []GroupStats
func (l ListGroupStats) Cuts(begin,end int64) bool {
for _,gs := range l{
if end<=gs.Low { continue }
if gs.High<begin { continue }
return true
}
return false
}
func treeLookup(t *avl.Tree,key interface{}) *avl.Node {
n := t.Root
for n != nil {
cmp := t.Comparator(key, n.Key)
switch {
case cmp == 0:
return n
case cmp < 0:
n = n.Children[0]
case cmp > 0:
n = n.Children[1]
}
}
return nil
}
type slog struct{
WB sync.Mutex
Lock sync.RWMutex
Enc *msgpack.Encoder
Buf *bufio.Writer
Tree *avl.Tree
Gsix *avl.Tree
File *os.File
Path string
}
func mkslog(f *os.File,p string) *slog {
buf := bufio.NewWriter(f)
return &slog{
Enc: msgpack.NewEncoder(buf),
Buf: buf,
Tree: avl.NewWith(TKComparator),
Gsix: avl.NewWith(bytesComparator),
File: f,
Path: p,
}
}
func mkslog2() *slog {
return &slog{
Tree: avl.NewWith(TKComparator),
Gsix: avl.NewWith(bytesComparator),
}
}
func (s *slog) dedupeString(b *[]byte) bool {
s.Lock.RLock(); defer s.Lock.RUnlock()
n := treeLookup(s.Gsix,*b)
if n!=nil {
*b = n.Key.([]byte)
return true
}
return false
}
func (s *slog) getStats(group []byte) *GroupStats {
if v,ok := s.Gsix.Get(group); ok { return v.(*GroupStats) }
return nil
}
func (s *slog) mark(group []byte,i int64) {
if v,ok := s.Gsix.Get(group); ok {
vv := v.(*GroupStats)
vv.Count++
if vv.Low>i { vv.Low = i }
if vv.High<i { vv.High = i }
} else {
if i==0 { i = 1 }
s.Gsix.Put(group,&GroupStats{1,i,i})
}
}
func (s *slog) insertMem(row *TableRow) {
s.Lock.Lock(); defer s.Lock.Unlock()
s.mark(row.Group,int64(row.Number))
s.Tree.Put(&row.TableKey,row)
}
func (s *slog) insert(row *TableRow) error {
s.WB.Lock(); defer s.WB.Unlock()
if s.Enc==nil { return errors.New("No encoder.") }
err := s.Enc.Encode(row)
if err!=nil { return err }
err = s.Buf.Flush()
if err!=nil { return err }
s.insertMem(row)
return nil
}
func (s *slog) deleteIt() {
s.File.Close()
os.Remove(s.Path)
s.Lock.Lock(); defer s.Lock.Unlock()
s.Tree.Clear()
s.Gsix.Clear()
}
func (s *slog) lookup(k interface{}) *TableRow {
s.Lock.RLock(); defer s.Lock.RUnlock()
v,ok := s.Tree.Get(k)
if ok { return v.(*TableRow) }
return nil
}
func (s *slog) floor(k interface{}) *TableRow {
s.Lock.RLock(); defer s.Lock.RUnlock()
n,_ := s.Tree.Floor(k)
if n==nil { return nil }
return n.Value.(*TableRow)
}
func (s *slog) ceiling(k interface{}) *TableRow {
s.Lock.RLock(); defer s.Lock.RUnlock()
n,_ := s.Tree.Ceiling(k)
if n==nil { return nil }
return n.Value.(*TableRow)
}
type slogs struct{
WB sync.Mutex
Lock sync.RWMutex
Stack []*slog
}
func (s *slogs) dedupeString(b *[]byte) bool {
s.Lock.RLock(); defer s.Lock.RUnlock()
for _,slog := range s.Stack {
if slog.dedupeString(b) { return true }
}
*b = append([]byte(nil),(*b)...)
return true
}
func (s *slogs) insert(row *TableRow) error {
s.Lock.RLock(); defer s.Lock.RUnlock()
if len(s.Stack)==0 { return errors.New("stack empty") }
s.dedupeString(&row.Group)
return s.Stack[len(s.Stack)-1].insert(row)
}
func (s *slogs) lookup(k interface{}) (v *TableRow) {
s.Lock.RLock(); defer s.Lock.RUnlock()
for _,slog := range s.Stack {
v = slog.lookup(k)
if v!=nil { break }
}
return
}
func (s *slogs) floor(k interface{}) (v *TableRow) {
var nv *TableRow
s.Lock.RLock(); defer s.Lock.RUnlock()
for _,slog := range s.Stack {
nv = slog.floor(k)
if v==nil {
v = nv
} else if tkCompare(v.TableKey,nv.TableKey)<0 {
v = nv
}
}
return
}
func (s *slogs) ceiling(k interface{}) (v *TableRow) {
var nv *TableRow
s.Lock.RLock(); defer s.Lock.RUnlock()
for _,slog := range s.Stack {
nv = slog.ceiling(k)
if v==nil {
v = nv
} else if tkCompare(nv.TableKey,v.TableKey)<0 {
v = nv
}
}
return
}
func (s *slogs) move(group []byte,i uint64,backward bool) *TableRow {
if backward {
if i==0 { return nil }
return s.floor(TableKey{Group:group,Number:i-1})
} else {
if i== (^uint64(0)) { return nil }
return s.ceiling(TableKey{Group:group,Number:i+1})
}
}
func (s *slogs) shift() {
s.Lock.Lock(); defer s.Lock.Unlock()
if len(s.Stack)==0 { return }
s.Stack = s.Stack[1:]
}
func (s *slogs) push(sl *slog) {
s.Lock.Lock(); defer s.Lock.Unlock()
s.Stack = append(s.Stack,sl)
}
func (s *slogs) getStats(group []byte) (gs ListGroupStats) {
s.Lock.RLock(); defer s.Lock.RUnlock()
gs = make(ListGroupStats,0,len(s.Stack))
for _,slog := range s.Stack {
obj := slog.getStats(group)
if obj!=nil { gs = append(gs,*obj) }
}
return
}
func (s *slogs) wrap(group []byte, first, last int64, targ func(int64, []byte)) (func(int64, []byte),func()) {
stats := s.getStats(group)
kb := &TableKey{Group:group}
next := first
iterate := func(i int64) {
if next >= i { return }
if !stats.Cuts(next,i) { return }
kb.Number = uint64(next)
row := s.ceiling(kb)
if row==nil { return }
for row.Number<uint64(i) {
targ(int64(row.Number),row.MessageId)
kb.Number = row.Number+1
row = s.ceiling(kb)
}
}
return func(i int64, id []byte){
iterate(i)
targ(i,id)
next = i+1
},func(){
iterate(last+1)
}
}