forked from google/tflow2
-
Notifications
You must be signed in to change notification settings - Fork 7
/
database_query.go
430 lines (380 loc) · 9.93 KB
/
database_query.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
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
// Copyright 2017 Google Inc. All Rights Reserved.
// 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 database
import (
"compress/gzip"
"fmt"
"io/ioutil"
"net"
"os"
"sync"
"time"
"github.com/bio-routing/tflow2/avltree"
"github.com/bio-routing/tflow2/convert"
"github.com/bio-routing/tflow2/intfmapper"
"github.com/bio-routing/tflow2/netflow"
"github.com/bio-routing/tflow2/stats"
"github.com/golang/protobuf/proto"
"github.com/pkg/errors"
log "github.com/sirupsen/logrus"
)
// These constants are used in communication with the frontend
const (
OpEqual = 0
OpUnequal = 1
OpSmaller = 2
OpGreater = 3
)
// These constants are only used internally
const (
FieldTimestamp = iota
FieldAgent
FieldFamily
FieldSrcAddr
FieldDstAddr
FieldProtocol
FieldIntIn
FieldIntOut
FieldNextHop
FieldSrcAs
FieldDstAs
FieldNextHopAs
FieldSrcPfx
FieldDstPfx
FieldSrcPort
FieldDstPort
FieldIntInName
FieldIntOutName
FieldMax
)
var fieldNames = map[string]int{
"Timestamp": FieldTimestamp,
"Agent": FieldAgent,
"Family": FieldFamily,
"SrcAddr": FieldSrcAddr,
"DstAddr": FieldDstAddr,
"Protocol": FieldProtocol,
"IntIn": FieldIntIn,
"IntOut": FieldIntOut,
"NextHop": FieldNextHop,
"SrcAs": FieldSrcAs,
"DstAs": FieldDstAs,
"NextHopAs": FieldNextHopAs,
"SrcPfx": FieldSrcPfx,
"DstPfx": FieldDstPfx,
"SrcPort": FieldSrcPort,
"DstPort": FieldDstPort,
"IntInName": FieldIntInName,
"IntOutName": FieldIntOutName,
}
type void struct{}
// Condition represents a query condition
type Condition struct {
Field int
Operator int
Operand []byte
}
// Conditions represents a set of conditions of a query
type Conditions []Condition
// Query is the internal representation of a query
type Query struct {
Cond Conditions
Breakdown BreakdownFlags
TopN int
}
type concurrentResSum struct {
Values BreakdownMap
Lock sync.Mutex
}
// GetFieldByName returns the internal number of a field
func GetFieldByName(name string) int {
if i, found := fieldNames[name]; found {
return i
}
return -1
}
// Includes checks if the given field and operator is included in the list
func (conditions Conditions) Includes(field int, operator int) bool {
for _, cond := range conditions {
if cond.Field == field && cond.Operator == operator {
return true
}
}
return false
}
// loadFromDisc loads netflow data from disk into in memory data structure
func (fdb *FlowDatabase) loadFromDisc(ts int64, agent string, query Query, resSum *concurrentResSum) (BreakdownMap, error) {
if fdb.storage == "" {
return nil, errors.Errorf("Disk storage is disabled")
}
res := avltree.New()
ymd := fmt.Sprintf("%04d-%02d-%02d", time.Unix(ts, 0).Year(), time.Unix(ts, 0).Month(), time.Unix(ts, 0).Day())
filename := fmt.Sprintf("%s/%s/nf-%d-%s.tflow2.pb.gzip", fdb.storage, ymd, ts, agent)
fh, err := os.Open(filename)
if err != nil {
if fdb.debug > 0 {
log.Errorf("unable to open file: %v", err)
}
return nil, err
}
if fdb.debug > 1 {
log.Infof("successfully opened file: %s", filename)
}
defer fh.Close()
gz, err := gzip.NewReader(fh)
if err != nil {
log.Errorf("unable to create gzip reader: %v", err)
return nil, err
}
defer gz.Close()
buffer, err := ioutil.ReadAll(gz)
if err != nil {
log.Errorf("unable to gunzip: %v", err)
return nil, err
}
// Unmarshal protobuf
flows := netflow.Flows{}
err = proto.Unmarshal(buffer, &flows)
if err != nil {
log.Errorf("unable to unmarshal protobuf: %v", err)
return nil, err
}
// Create interface mapping
interfaceIDByName := make(intfmapper.InterfaceIDByName)
for _, m := range flows.InterfaceMapping {
interfaceIDByName[m.Name] = uint16(m.Id)
}
if fdb.debug > 1 {
log.Infof("file %s contains %d flows", filename, len(flows.Flows))
}
// Validate flows and add them to res tree
for _, fl := range flows.Flows {
if validateFlow(fl, query, interfaceIDByName) {
res.Insert(fl, fl, ptrIsSmaller)
}
}
// Breakdown
resTime := make(BreakdownMap)
res.Each(breakdown, fdb.intfMapper.GetInterfaceNameByID(agent), fdb.iana, query.Breakdown, resSum, resTime)
return resTime, err
}
func validateFlow(fl *netflow.Flow, query Query, interfaceIDByName intfmapper.InterfaceIDByName) bool {
for _, c := range query.Cond {
switch c.Field {
case FieldTimestamp:
continue
case FieldAgent:
continue
case FieldFamily:
if fl.Family != uint32(convert.Uint16b(c.Operand)) {
return false
}
continue
case FieldProtocol:
if fl.Protocol != uint32(convert.Uint16b(c.Operand)) {
return false
}
continue
case FieldSrcAddr:
if !net.IP(fl.SrcAddr).Equal(net.IP(c.Operand)) {
return false
}
continue
case FieldDstAddr:
if !net.IP(fl.DstAddr).Equal(net.IP(c.Operand)) {
return false
}
continue
case FieldIntIn:
if fl.IntIn != uint32(convert.Uint16b(c.Operand)) {
return false
}
continue
case FieldIntOut:
if fl.IntOut != uint32(convert.Uint16b(c.Operand)) {
return false
}
continue
case FieldNextHop:
if !net.IP(fl.NextHop).Equal(net.IP(c.Operand)) {
return false
}
continue
case FieldSrcAs:
if fl.SrcAs != convert.Uint32b(c.Operand) {
return false
}
continue
case FieldDstAs:
if fl.DstAs != convert.Uint32b(c.Operand) {
return false
}
continue
case FieldNextHopAs:
if fl.NextHopAs != convert.Uint32b(c.Operand) {
return false
}
case FieldSrcPort:
if fl.SrcPort != uint32(convert.Uint16b(c.Operand)) {
return false
}
continue
case FieldDstPort:
if fl.DstPort != uint32(convert.Uint16b(c.Operand)) {
return false
}
continue
case FieldSrcPfx:
if fl.SrcPfx.String() != string(c.Operand) {
return false
}
continue
case FieldDstPfx:
if fl.DstPfx.String() != string(c.Operand) {
return false
}
continue
case FieldIntInName:
id := interfaceIDByName[string(c.Operand)]
if uint16(fl.IntIn) != id {
return false
}
continue
case FieldIntOutName:
id := interfaceIDByName[string(c.Operand)]
if uint16(fl.IntOut) != id {
return false
}
continue
}
}
return true
}
func (fdb *FlowDatabase) getAgent(q *Query) (string, error) {
rtr := ""
for _, c := range q.Cond {
if c.Field == FieldAgent {
rtr = string(c.Operand)
}
}
if rtr == "" {
log.Warningf("Agent is mandatory cirteria")
return "", errors.Errorf("Agent criteria not found")
}
return rtr, nil
}
func (fdb *FlowDatabase) getStartEndTimes(q *Query) (start int64, end int64, err error) {
end = time.Now().Unix()
for _, c := range q.Cond {
if c.Field != FieldTimestamp {
continue
}
switch c.Operator {
case OpGreater:
start = int64(convert.Uint64b(c.Operand))
case OpSmaller:
end = int64(convert.Uint64b(c.Operand))
case OpEqual:
start = int64(convert.Uint64b(c.Operand))
end = start
}
}
// Align start point to `aggregation` raster
start = start - (start % fdb.aggregation)
return
}
func (fdb *FlowDatabase) getResultByTS(resSum *concurrentResSum, ts int64, q *Query, rtr string) BreakdownMap {
// timeslot in memory?
fdb.lock.RLock()
timeGroups, ok := fdb.flows[ts]
fdb.lock.RUnlock()
if !ok {
// not in memory, try to load from disk
result, _ := fdb.loadFromDisc(ts, rtr, *q, resSum)
return result
}
if timeGroups[rtr] == nil {
log.Infof("TG of %s is nil", rtr)
return map[BreakdownKey]uint64{}
}
return timeGroups[rtr].filterAndBreakdown(resSum, q, fdb.iana, fdb.intfMapper.GetInterfaceNameByID(rtr))
}
func (fdb *FlowDatabase) getTopKeys(resSum *concurrentResSum, topN int) map[BreakdownKey]void {
// Build Tree Bytes -> Key to allow efficient finding of top n flows
var btree = avltree.New()
for k, b := range resSum.Values {
btree.Insert(b, k, uint64IsSmaller)
}
// Find top n keys
topKeysList := btree.TopN(topN)
topKeys := make(map[BreakdownKey]void)
for _, v := range topKeysList {
topKeys[v.(BreakdownKey)] = void{}
}
return topKeys
}
// RunQuery executes a query and returns the result
func (fdb *FlowDatabase) RunQuery(q *Query) (*Result, error) {
queryStart := time.Now()
stats.GlobalStats.Queries++
start, end, err := fdb.getStartEndTimes(q)
if err != nil {
return nil, errors.Wrap(err, "Failed to Start/End times")
}
rtr, err := fdb.getAgent(q)
if err != nil {
return nil, errors.Wrap(err, "Failed to get router")
}
// resSum holds a sum per breakdown key over all timestamps
resSum := &concurrentResSum{
Values: make(BreakdownMap),
}
// resTime holds individual sums per breakdown key and ts
resTime := make(map[int64]BreakdownMap)
resMtx := sync.Mutex{}
resWg := sync.WaitGroup{}
for ts := start; ts <= end; ts += fdb.aggregation {
log.Infof("RunQuery: start timeslot %d", ts)
resWg.Add(1)
go func(ts int64) {
result := fdb.getResultByTS(resSum, ts, q, rtr)
if result != nil {
log.Infof("RunQuery: data in timeslot %d", ts)
resMtx.Lock()
resTime[ts] = result
resMtx.Unlock()
}
resWg.Done()
}(ts)
}
resWg.Wait()
// Find all timestamps we have and get them sorted
tsTree := avltree.New()
for ts := range resTime {
tsTree.Insert(ts, ts, int64IsSmaller)
}
// Generate topKeys if required
var topKeys map[BreakdownKey]void
if q.TopN > 0 {
topKeys = fdb.getTopKeys(resSum, q.TopN)
}
timestamps := make([]int64, 0)
for _, ts := range tsTree.Dump() {
timestamps = append(timestamps, ts.(int64))
}
log.Infof("Query %v took %d ns\n", q, time.Since(queryStart))
return &Result{
TopKeys: topKeys,
Timestamps: timestamps,
Data: resTime,
Aggregation: fdb.aggregation,
}, nil
}