-
Notifications
You must be signed in to change notification settings - Fork 95
/
map-low.go
561 lines (473 loc) · 14.4 KB
/
map-low.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
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
package libbpfgo
/*
#cgo LDFLAGS: -lelf -lz
#include "libbpfgo.h"
*/
import "C"
import (
"errors"
"fmt"
"syscall"
"unsafe"
)
//
// BPFMapLow (low-level API)
//
// BPFMapLow provides a low-level interface to BPF maps.
// Its methods follow the BPFMap naming convention.
type BPFMapLow struct {
fd int
info *BPFMapInfo
}
// BPFMapCreateOpts mirrors the C structure bpf_map_create_opts.
type BPFMapCreateOpts struct {
BTFFD uint32
BTFKeyTypeID uint32
BTFValueTypeID uint32
BTFVmlinuxValueTypeID uint32
InnerMapFD uint32
MapFlags uint32
MapExtra uint64
NumaNode uint32
MapIfIndex uint32
}
// CreateMap creates a new BPF map with the given parameters.
func CreateMap(mapType MapType, mapName string, keySize, valueSize, maxEntries int, opts *BPFMapCreateOpts) (*BPFMapLow, error) {
mapNameC := C.CString(mapName)
defer C.free(unsafe.Pointer(mapNameC))
var optsC *C.struct_bpf_map_create_opts
var errno error
if opts != nil {
optsC, errno = C.cgo_bpf_map_create_opts_new(
C.uint(opts.BTFFD),
C.uint(opts.BTFKeyTypeID),
C.uint(opts.BTFValueTypeID),
C.uint(opts.BTFVmlinuxValueTypeID),
C.uint(opts.InnerMapFD),
C.uint(opts.MapFlags),
C.ulonglong(opts.MapExtra),
C.uint(opts.NumaNode),
C.uint(opts.MapIfIndex),
)
if optsC == nil {
return nil, fmt.Errorf("failed to create bpf_map_create_opts: %w", errno)
}
defer C.cgo_bpf_map_create_opts_free(optsC)
}
fdC := C.bpf_map_create(uint32(mapType), mapNameC, C.uint(keySize), C.uint(valueSize), C.uint(maxEntries), optsC)
if fdC < 0 {
return nil, fmt.Errorf("could not create map %s: %w", mapName, syscall.Errno(-fdC))
}
info, errInfo := GetMapInfoByFD(int(fdC))
if errInfo != nil {
if errClose := syscall.Close(int(fdC)); errClose != nil {
return nil, fmt.Errorf("could not create map %s: %w, %v", mapName, errInfo, errClose)
}
return nil, fmt.Errorf("could not create map %s: %w", mapName, errInfo)
}
return &BPFMapLow{
fd: int(fdC),
info: info,
}, nil
}
// GetMapByID returns a BPFMapLow instance for the map with the given ID.
func GetMapByID(id uint32) (*BPFMapLow, error) {
fd, err := GetMapFDByID(id)
if err != nil {
return nil, err
}
info, err := GetMapInfoByFD(fd)
if err != nil {
return nil, err
}
return &BPFMapLow{
fd: fd,
info: info,
}, nil
}
// GetMapNextID retrieves the next available map ID after the given startID.
// It returns the next map ID and an error if one occurs during the operation.
func GetMapNextID(startId uint32) (uint32, error) {
startIDC := C.uint(startId)
retC := C.bpf_map_get_next_id(startIDC, &startIDC)
if retC == 0 {
return uint32(startIDC), nil
}
return uint32(startIDC), fmt.Errorf("failed to get next map id: %w", syscall.Errno(-retC))
}
// GetMapsIDsByName searches for maps with a specified name and collects their IDs.
// It starts the search from the given 'startId' and continues until no more matching maps are found.
// The function returns a slice of unsigned 32-bit integers representing the IDs of matching maps.
// If no maps with the provided 'name' are found, it returns an empty slice and no error.
// The 'startId' is modified and returned as the last processed map ID.
//
// Example Usage:
//
// name := "myMap" // The name of the map you want to find.
// startId := uint32(0) // The map ID to start the search from.
//
// var mapIDs []uint32 // Initialize an empty slice to collect map IDs.
// var err error // Initialize an error variable.
//
// // Retry mechanism in case of errors using the last processed 'startId'.
// for {
// mapIDs, err = GetMapsIDsByName(name, startId)
// if err != nil {
// // Handle other errors, possibly with a retry mechanism.
// // You can use the 'startId' who contains the last processed map ID to continue the search.
// } else {
// // Successful search, use the 'mapIDs' slice containing the IDs of matching maps.
// // Update 'startId' to the last processed map ID to continue the search.
// }
// }
func GetMapsIDsByName(name string, startId *uint32) ([]uint32, error) {
var (
bpfMapsIds []uint32
err error
)
for {
*startId, err = GetMapNextID(*startId)
if err != nil {
if errors.Is(err, syscall.ENOENT) {
return bpfMapsIds, nil
}
return bpfMapsIds, err
}
bpfMapLow, err := GetMapByID(*startId)
if err != nil {
return bpfMapsIds, err
}
if err := syscall.Close(bpfMapLow.FileDescriptor()); err != nil {
return bpfMapsIds, err
}
if bpfMapLow.Name() != name {
continue
}
bpfMapsIds = append(bpfMapsIds, bpfMapLow.info.ID)
}
}
//
// BPFMapLow Specs
//
func (m *BPFMapLow) FileDescriptor() int {
return m.fd
}
func (m *BPFMapLow) ReuseFD(fd int) error {
info, err := GetMapInfoByFD(fd)
if err != nil {
return fmt.Errorf("failed to reuse fd %d: %w", fd, err)
}
newFD, err := syscall.Open("/", syscall.O_RDONLY|syscall.O_CLOEXEC, 0)
if err != nil {
return fmt.Errorf("failed to reuse fd %d: %w", fd, err)
}
err = syscall.Dup3(fd, newFD, syscall.O_CLOEXEC)
if err != nil {
_ = syscall.Close(newFD)
return fmt.Errorf("failed to reuse fd %d: %w", fd, err)
}
err = syscall.Close(m.FileDescriptor())
if err != nil {
_ = syscall.Close(newFD)
return fmt.Errorf("failed to reuse fd %d: %w", fd, err)
}
m.fd = newFD
m.info = info
return nil
}
func (m *BPFMapLow) Name() string {
return m.info.Name
}
func (m *BPFMapLow) Type() MapType {
return MapType(m.info.Type)
}
func (m *BPFMapLow) MaxEntries() uint32 {
return m.info.MaxEntries
}
// TODO: implement `bpf_map__map_flags`
// func (m *BPFMapLow) MapFlags() MapFlag {
// }
// TODO: implement `bpf_map__numa_node`
// func (m *BPFMapLow) NUMANode() uint32 {
// }
func (m *BPFMapLow) KeySize() int {
return int(m.info.KeySize)
}
func (m *BPFMapLow) ValueSize() int {
return int(m.info.ValueSize)
}
// TODO: implement `bpf_map__btf_key_type_id`
// func (m *BPFMapLow) BTFKeyTypeID() uint32 {
// }
// TODO: implement `bpf_map__btf_value_type_id`
// func (m *BPFMapLow) BTFValueTypeID() uint32 {
// }
// TODO: implement `bpf_map__ifindex`
// func (m *BPFMapLow) IfIndex() uint32 {
// }
// TODO: implement `bpf_map__map_extra`
// func (m *BPFMapLow) MapExtra() uint64 {
// }
//
// BPFMapLow Operations
//
func (m *BPFMapLow) GetValue(key unsafe.Pointer) ([]byte, error) {
return m.GetValueFlags(key, MapFlagUpdateAny)
}
func (m *BPFMapLow) GetValueFlags(key unsafe.Pointer, flags MapFlag) ([]byte, error) {
valueSize, err := CalcMapValueSize(m.ValueSize(), m.Type())
if err != nil {
return nil, fmt.Errorf("map %s %w", m.Name(), err)
}
value := make([]byte, valueSize)
retC := C.bpf_map_lookup_elem_flags(
C.int(m.FileDescriptor()),
key,
unsafe.Pointer(&value[0]),
C.ulonglong(flags),
)
if retC < 0 {
return nil, fmt.Errorf("failed to lookup value %v in map %s: %w", key, m.Name(), syscall.Errno(-retC))
}
return value, nil
}
func (m *BPFMapLow) LookupAndDeleteElem(
key unsafe.Pointer,
value unsafe.Pointer,
) error {
retC := C.bpf_map_lookup_and_delete_elem(
C.int(m.FileDescriptor()),
key,
value,
)
if retC < 0 {
return fmt.Errorf("failed to lookup and delete value %v in map %s: %w", key, m.Name(), syscall.Errno(-retC))
}
return nil
}
func (m *BPFMapLow) LookupAndDeleteElemFlags(
key unsafe.Pointer,
value unsafe.Pointer,
flags MapFlag,
) error {
retC := C.bpf_map_lookup_and_delete_elem_flags(
C.int(m.FileDescriptor()),
key,
value,
C.ulonglong(flags),
)
if retC < 0 {
return fmt.Errorf("failed to lookup and delete value %v in map %s: %w", key, m.Name(), syscall.Errno(-retC))
}
return nil
}
func (m *BPFMapLow) GetValueAndDeleteKey(key unsafe.Pointer) ([]byte, error) {
valueSize, err := CalcMapValueSize(m.ValueSize(), m.Type())
if err != nil {
return nil, fmt.Errorf("map %s %w", m.Name(), err)
}
value := make([]byte, valueSize)
err = m.LookupAndDeleteElem(
key,
unsafe.Pointer(&value[0]),
)
if err != nil {
return nil, err
}
return value, nil
}
func (m *BPFMapLow) GetValueAndDeleteKeyFlags(key unsafe.Pointer, flags MapFlag) ([]byte, error) {
valueSize, err := CalcMapValueSize(m.ValueSize(), m.Type())
if err != nil {
return nil, fmt.Errorf("map %s %w", m.Name(), err)
}
value := make([]byte, valueSize)
err = m.LookupAndDeleteElemFlags(
key,
unsafe.Pointer(&value[0]),
flags,
)
if err != nil {
return nil, err
}
return value, nil
}
func (m *BPFMapLow) Update(key, value unsafe.Pointer) error {
return m.UpdateValueFlags(key, value, MapFlagUpdateAny)
}
func (m *BPFMapLow) UpdateValueFlags(key, value unsafe.Pointer, flags MapFlag) error {
retC := C.bpf_map_update_elem(
C.int(m.FileDescriptor()),
key,
value,
C.ulonglong(flags),
)
if retC < 0 {
return fmt.Errorf("failed to update map %s: %w", m.Name(), syscall.Errno(-retC))
}
return nil
}
func (m *BPFMapLow) DeleteKey(key unsafe.Pointer) error {
retC := C.bpf_map_delete_elem(C.int(m.FileDescriptor()), key)
if retC < 0 {
return fmt.Errorf("failed to delete key %d in map %s: %w", key, m.Name(), syscall.Errno(-retC))
}
return nil
}
func (m *BPFMapLow) GetNextKey(key unsafe.Pointer, nextKey unsafe.Pointer) error {
retC := C.bpf_map_get_next_key(
C.int(m.FileDescriptor()),
key,
nextKey,
)
if retC < 0 {
return fmt.Errorf("failed to get next key in map %s: %w", m.Name(), syscall.Errno(-retC))
}
return nil
}
//
// BPFMapLow Batch Operations
//
// GetValueBatch gets the values with the given keys from the map.
// It returns the values and the number of read elements.
func (m *BPFMapLow) GetValueBatch(keys, startKey, nextKey unsafe.Pointer, count uint32) ([][]byte, uint32, error) {
valueSize, err := CalcMapValueSize(m.ValueSize(), m.Type())
if err != nil {
return nil, 0, fmt.Errorf("map %s %w", m.Name(), err)
}
var (
values = make([]byte, valueSize*int(count))
valuesPtr = unsafe.Pointer(&values[0])
countC = C.uint(count)
)
optsC, errno := C.cgo_bpf_map_batch_opts_new(C.BPF_ANY, C.BPF_ANY)
if optsC == nil {
return nil, 0, fmt.Errorf("failed to create bpf_map_batch_opts: %w", errno)
}
defer C.cgo_bpf_map_batch_opts_free(optsC)
// The batch APIs are a bit different in which they can return an error, but
// depending on the errno code, it might mean a complete error (nothing was
// done) or a partial success (some elements were processed).
//
// - On complete sucess, it will return 0, and errno won't be set.
// - On partial sucess, it will return -1, and errno will be set to ENOENT.
// - On error, it will return -1, and an errno different to ENOENT.
retC := C.bpf_map_lookup_batch(
C.int(m.FileDescriptor()),
startKey,
nextKey,
keys,
valuesPtr,
&countC,
optsC,
)
errno = syscall.Errno(-retC)
// retC < 0 && errno == syscall.ENOENT indicates a partial read.
if retC < 0 && (errno != syscall.ENOENT || countC == 0) {
return nil, 0, fmt.Errorf("failed to batch get value %v in map %s: %w", keys, m.Name(), errno)
}
// Either some or all elements were read.
return collectBatchValues(values, uint32(countC), valueSize), uint32(countC), nil
}
// GetValueAndDeleteBatch gets the values with the given keys from the map and
// deletes them.
// It returns the values and the number of deleted elements.
func (m *BPFMapLow) GetValueAndDeleteBatch(keys, startKey, nextKey unsafe.Pointer, count uint32) ([][]byte, uint32, error) {
valueSize, err := CalcMapValueSize(m.ValueSize(), m.Type())
if err != nil {
return nil, 0, fmt.Errorf("map %s %w", m.Name(), err)
}
var (
values = make([]byte, valueSize*int(count))
valuesPtr = unsafe.Pointer(&values[0])
countC = C.uint(count)
)
optsC, errno := C.cgo_bpf_map_batch_opts_new(C.BPF_ANY, C.BPF_ANY)
if optsC == nil {
return nil, 0, fmt.Errorf("failed to create bpf_map_batch_opts: %w", errno)
}
defer C.cgo_bpf_map_batch_opts_free(optsC)
retC := C.bpf_map_lookup_and_delete_batch(
C.int(m.FileDescriptor()),
startKey,
nextKey,
keys,
valuesPtr,
&countC,
optsC,
)
errno = syscall.Errno(-retC)
// retC < 0 && errno == syscall.ENOENT indicates a partial read and delete.
if retC < 0 && (errno != syscall.ENOENT || countC == 0) {
return nil, 0, fmt.Errorf("failed to batch lookup and delete values %v in map %s: %w", keys, m.Name(), errno)
}
// Either some or all elements were read and deleted.
return collectBatchValues(values, uint32(countC), valueSize), uint32(countC), nil
}
// UpdateBatch updates the elements with the given keys and values in the map.
// It returns the number of updated elements.
func (m *BPFMapLow) UpdateBatch(keys, values unsafe.Pointer, count uint32) (uint32, error) {
countC := C.uint(count)
optsC, errno := C.cgo_bpf_map_batch_opts_new(C.BPF_ANY, C.BPF_ANY)
if optsC == nil {
return 0, fmt.Errorf("failed to create bpf_map_batch_opts: %w", errno)
}
defer C.cgo_bpf_map_batch_opts_free(optsC)
retC := C.bpf_map_update_batch(
C.int(m.FileDescriptor()),
keys,
values,
&countC,
optsC,
)
errno = syscall.Errno(-retC)
// retC < 0 && errno == syscall.E2BIG indicates a partial update.
if retC < 0 && (errno != syscall.E2BIG || countC == 0) {
return 0, fmt.Errorf("failed to batch update values %v in map %s: %w", keys, m.Name(), errno)
}
// Either some or all elements were updated.
return uint32(countC), nil
}
// DeleteKeyBatch deletes the elements with the given keys from the map.
// It returns the number of deleted elements.
func (m *BPFMapLow) DeleteKeyBatch(keys unsafe.Pointer, count uint32) (uint32, error) {
countC := C.uint(count)
optsC, errno := C.cgo_bpf_map_batch_opts_new(C.BPF_ANY, C.BPF_ANY)
if optsC == nil {
return 0, fmt.Errorf("failed to create bpf_map_batch_opts: %w", errno)
}
defer C.cgo_bpf_map_batch_opts_free(optsC)
retC := C.bpf_map_delete_batch(
C.int(m.FileDescriptor()),
keys,
&countC,
optsC,
)
errno = syscall.Errno(-retC)
// retC < 0 && errno == syscall.ENOENT indicates a partial deletion.
if retC < 0 && (errno != syscall.ENOENT || countC == 0) {
return 0, fmt.Errorf("failed to batch delete keys %v in map %s: %w", keys, m.Name(), errno)
}
// Either some or all elements were deleted.
return uint32(countC), nil
}
func collectBatchValues(values []byte, count uint32, valueSize int) [][]byte {
var value []byte
var collected [][]byte
for i := 0; i < int(count*uint32(valueSize)); i += valueSize {
value = values[i : i+valueSize]
collected = append(collected, value)
}
return collected
}
//
// BPFMapLow Iterator
//
func (m *BPFMapLow) Iterator() *BPFMapIterator {
return &BPFMapIterator{
mapFD: m.FileDescriptor(),
keySize: m.KeySize(),
prev: nil,
next: nil,
}
}