summaryrefslogblamecommitdiff
path: root/bpf/main.go
blob: 47fdc4151a343396c95a68903b8127be48c37d20 (plain) (tree) 
e2f6799




























































































































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




























































































































                                                                                            
package bpf

import (
	"errors"
	"fmt"
	"log"
	"net"
	"time"

	"github.com/cilium/ebpf"
	"github.com/cilium/ebpf/link"
)

type UsageStat struct {
	lastSeen time.Time
	lastDbPush time.Time
	ingress uint64
	egress uint64
}
type UsageMap map[uint32]UsageStat

func Run(iface *net.Interface) {
	usageMap := make(UsageMap)

	objs := bpfObjects{}
	if err := loadBpfObjects(&objs, nil); err != nil {
		log.Fatalf("loading objects: %s", err)
	}
	defer objs.Close()

	ingressLink, err := link.AttachTCX(link.TCXOptions{
		Interface: iface.Index,
		Program:   objs.IngressFunc,
		Attach:    ebpf.AttachTCXIngress,
	})
	if err != nil {
		log.Fatalf("could not attach TCx program: %s", err)
	}
	defer ingressLink.Close()

	egressLink, err := link.AttachTCX(link.TCXOptions{
		Interface: iface.Index,
		Program:   objs.EgressFunc,
		Attach:    ebpf.AttachTCXEgress,
	})
	if err != nil {
		log.Fatalf("could not attach TCx program: %s", err)
	}
	defer egressLink.Close()

	bpfTicker := time.NewTicker(1 * time.Second)
	defer bpfTicker.Stop()
	dbTicker := time.NewTicker(60 * time.Second)
	defer dbTicker.Stop()
	for {
		select {
		case <-bpfTicker.C:
			usageMap.update(objs.IngressIp4UsageMap, objs.EgressIp4UsageMap)
		case <-dbTicker.C:
			continue;
		}
	}
}

func (usageMap UsageMap) update(ingress *ebpf.Map, egress *ebpf.Map) {
	timeStart := time.Now()
	batchKeys := make([]uint32, 4096)
	batchValues := make([]uint64, 4096)
	var key uint32

	cursor := ebpf.MapBatchCursor{}
	for {
		_, err := ingress.BatchLookupAndDelete(&cursor, batchKeys, batchValues, nil)
		for i := range batchKeys {
			key = batchKeys[i]
			usage, ok := usageMap[key]
			if ok {
				usage.ingress += batchValues[i]
				usage.lastSeen = timeStart
				usageMap[key] = usage;
			} else {
				usageMap[key] = UsageStat {
					ingress: batchValues[i],
					lastDbPush: timeStart,
					lastSeen: timeStart,
				}
			}
		}

		if (errors.Is(err, ebpf.ErrKeyNotExist)) {
			break;
		} else if err != nil{
			fmt.Println(err)
			break
		}
	}

	cursor = ebpf.MapBatchCursor{}
	for {
		_, err := egress.BatchLookupAndDelete(&cursor, batchKeys, batchValues, nil)
		for i := range batchKeys {
			key = batchKeys[i]
			usage, ok := usageMap[key]
			if ok {
				usage.egress += batchValues[i]
				usage.lastSeen = timeStart
				usageMap[key] = usage;
			} else {
				usageMap[key] = UsageStat {
					egress: batchValues[i],
					lastDbPush: timeStart,
					lastSeen: timeStart,
				}
			}
		}

		if (errors.Is(err, ebpf.ErrKeyNotExist)) {
			break;
		} else if err != nil{
			fmt.Println(err)
			break
		}
	}
}