-
Notifications
You must be signed in to change notification settings - Fork 0
/
scan.go
275 lines (259 loc) · 6.68 KB
/
scan.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
package store
import (
"bytes"
"encoding/binary"
"errors"
"log/slog"
"time"
"github.com/RoaringBitmap/roaring/roaring64"
"github.com/cespare/xxhash/v2"
"github.com/dgraph-io/badger/v4"
v1 "github.com/gernest/requiemdb/gen/go/rq/v1"
"github.com/gernest/requiemdb/internal/bitmaps"
"github.com/gernest/requiemdb/internal/data"
dataOps "github.com/gernest/requiemdb/internal/data"
"github.com/gernest/requiemdb/internal/keys"
"github.com/gernest/requiemdb/internal/labels"
"github.com/gernest/requiemdb/internal/visit"
"github.com/gernest/requiemdb/internal/x"
)
const (
DefaultTimeRange = 15 * time.Minute
)
func (s *Storage) Scan(scan *v1.Scan) (result *v1.Data, err error) {
resource := v1.RESOURCE(scan.Scope)
start, end := timeBounds(utc, scan)
// Instant scans have no time range.
isInstant := scan.TimeRange == nil
samples, err := s.tree.Scan(resource, start, end)
if err != nil {
return nil, err
}
defer samples.Release()
if samples.IsEmpty() {
return data.Zero(resource), nil
}
key := keys.New()
defer key.Release()
all := visit.New()
defer all.Release()
all.SetTimeRange(start, end)
err = s.db.View(func(txn *badger.Txn) error {
s.CompileFilters(txn, scan, samples, all)
if samples.IsEmpty() {
result = data.Zero(resource)
return nil
}
var it roaring64.IntIterable64 = samples.Iterator()
if isInstant || scan.Reverse {
// For instant vectors we are only interested in the latest matching sample,
// since samples are sorted we use reverse iterator to ensure the last sample
// observed is the first we choose to process.
it = samples.ReverseIterator()
}
noFilters := len(scan.Filters) == 0
if isInstant {
// We only choose the first sample matching the scan
next := it.Next()
result, err = s.read(txn,
key.WithResource(resource).
WithID(next).
Encode(), all, noFilters)
return err
}
rs := make([]*v1.Data, 0, samples.GetCardinality())
for it.HasNext() {
data, err := s.read(txn,
key.Reset().
WithResource(resource).
WithID(it.Next()).
Encode(), all, noFilters)
if err != nil {
return err
}
rs = append(rs, data)
}
result = dataOps.Collapse(rs)
return nil
})
return
}
func utc() time.Time {
return time.Now().UTC()
}
// finds time boundary for the scan
func timeBounds(now func() time.Time, scan *v1.Scan) (start, end uint64) {
var ts time.Time
if scan.Now != nil {
ts = scan.Now.AsTime()
} else {
ts = now()
}
if scan.Offset != nil {
ts = ts.Add(-scan.Offset.AsDuration())
}
if scan.TimeRange != nil {
start = uint64(scan.TimeRange.Start.AsTime().UnixNano())
end = uint64(scan.TimeRange.End.AsTime().UnixNano())
} else {
begin := ts.Add(-DefaultTimeRange)
start = uint64(begin.UnixNano())
end = uint64(ts.UnixNano())
}
return
}
func (s *Storage) read(txn *badger.Txn, key []byte, a *visit.All, noFilters bool) (*v1.Data, error) {
hash := xxhash.Sum64(key)
if d, ok := s.dataCache.Get(hash); ok {
data := d.(*v1.Data)
if noFilters {
return data, nil
}
return visit.VisitData(data, a), nil
}
it, err := txn.Get(key)
if err != nil {
return nil, err
}
data := &v1.Data{}
var cost int64
err = it.Value(x.Decompress(data, &cost))
if err != nil {
return nil, err
}
// cache data before returning it
s.dataCache.Set(hash, data, cost)
if noFilters {
return data, nil
}
return visit.VisitData(data, a), nil
}
func (s *Storage) CompileFilters(txn *badger.Txn, scan *v1.Scan, r *bitmaps.Bitmap, o *visit.All) {
lbl := labels.NewLabel()
defer lbl.Release()
resource := v1.RESOURCE(scan.Scope)
for _, f := range scan.Filters {
switch e := f.Value.(type) {
case *v1.Scan_Filter_Base:
if !s.apply(txn, lbl.Reset().
WithPrefix(v1.PREFIX(e.Base.Prop)).
WithKey(e.Base.Value).
WithResource(resource), r) {
return
}
switch e.Base.Prop {
case v1.Scan_RESOURCE_SCHEMA:
o.SetResourceSchema(e.Base.Value)
case v1.Scan_SCOPE_SCHEMA:
o.SetScopeSchema(e.Base.Value)
case v1.Scan_SCOPE_NAME:
o.SetScopeName(e.Base.Value)
case v1.Scan_SCOPE_VERSION:
o.SetScopVersion(e.Base.Value)
case v1.Scan_NAME:
o.SetName(e.Base.Value)
case v1.Scan_TRACE_ID:
o.SetTraceID(e.Base.Value)
case v1.Scan_SPAN_ID:
o.SetSpanID(e.Base.Value)
case v1.Scan_PARENT_SPAN_ID:
o.SetParentSpanID(e.Base.Value)
case v1.Scan_LOGS_LEVEL:
o.SetLogLevel(e.Base.Value)
}
case *v1.Scan_Filter_Attr:
if !s.apply(txn, lbl.Reset().
WithPrefix(v1.PREFIX(e.Attr.Prop)).
WithKey(e.Attr.Key).
WithValue(e.Attr.Value).
WithResource(resource), r) {
return
}
switch e.Attr.Prop {
case v1.Scan_RESOURCE_ATTRIBUTES:
o.SetResourceAttr(e.Attr.Key, e.Attr.Value)
case v1.Scan_SCOPE_ATTRIBUTES:
o.SetScopeAttr(e.Attr.Key, e.Attr.Value)
case v1.Scan_ATTRIBUTES:
o.SetScopeAttr(e.Attr.Key, e.Attr.Value)
}
}
}
}
func (s *Storage) apply(txn *badger.Txn, lbl *labels.Label, o *bitmaps.Bitmap) (ok bool) {
b := s.load(txn, lbl)
if b != nil {
b.RLock()
defer b.RUnlock()
o.And(&b.Bitmap)
} else {
// All labels must contain a sample , if a label is missing then no sample for
// the query should match.
//
// Clear any previous samples
o.Clear()
}
ok = !o.IsEmpty()
return
}
func listLabels(db *badger.DB, base *labels.Label, f func(lbl *labels.Label, sample *bitmaps.Bitmap)) error {
prefix := bytes.Clone(base.Encode()[:labels.ResourcePrefixSize])
txn := db.NewTransaction(false)
defer txn.Discard()
o := badger.DefaultIteratorOptions
o.Prefix = prefix
it := txn.NewIterator(o)
defer it.Close()
s := bitmaps.New()
defer s.Release()
var data [4]byte
binary.LittleEndian.PutUint32(data[:], uint32(v1.PREFIX_DATA))
for it.Rewind(); it.ValidForPrefix(prefix); it.Next() {
key := it.Item().Key()
if bytes.HasPrefix(key[labels.ResourcePrefixSize:], data[:]) {
// skip data prefix
continue
}
err := base.Decode(key)
if err != nil {
return err
}
err = it.Item().Value(s.UnmarshalBinary)
if err != nil {
return err
}
f(base, s)
}
return nil
}
func (s *Storage) load(txn *badger.Txn, lbl *labels.Label) *bitmaps.Bitmap {
key := lbl.Encode()
hash := xxhash.Sum64(key)
if r, ok := s.bitmapCache.Get(hash); ok {
return r.(*bitmaps.Bitmap)
}
it, err := txn.Get(key)
if err != nil {
if !errors.Is(err, badger.ErrKeyNotFound) {
slog.Error("failed loading label", "err", err,
"key", lbl.Key,
"value", lbl.Value,
"resource", lbl.Resource,
)
}
return nil
}
r := bitmaps.New()
err = it.Value(r.UnmarshalBinary)
if err != nil {
slog.Error("failed decoding label bitmap", "err", err,
"key", lbl.Key,
"value", lbl.Value,
"resource", lbl.Resource,
)
r.Release()
return nil
}
s.bitmapCache.Set(hash, r, int64(r.GetSizeInBytes()))
return r
}