summaryrefslogtreecommitdiff
path: root/internal/eventloop.go
diff options
context:
space:
mode:
authorPaul Buetow <paul@buetow.org>2025-03-26 22:27:22 +0200
committerPaul Buetow <paul@buetow.org>2025-03-26 22:27:22 +0200
commit88da5c1bae242e7796e8f4ed8ae13473515c8b37 (patch)
tree22577d51677fb20e700fac765f2ad88c781e81e7 /internal/eventloop.go
parent55276cd2a2ea3e918d2c625a384c7fa99fee9295 (diff)
implement sync
Diffstat (limited to 'internal/eventloop.go')
-rw-r--r--internal/eventloop.go4
1 files changed, 2 insertions, 2 deletions
diff --git a/internal/eventloop.go b/internal/eventloop.go
index 938b9b5..4f2ee31 100644
--- a/internal/eventloop.go
+++ b/internal/eventloop.go
@@ -125,7 +125,7 @@ func (e *eventLoop) events(ctx context.Context, rawCh <-chan []byte) <-chan *eve
func (e *eventLoop) processRawEvent(raw []byte, ch chan<- *event.Pair) {
e.numTracepoints++
- // TODO: Would a map be faster than a big switch-case statement?
+ // TODO: Would a map be faster than a big switch-case statement? Write a benchmark.
switch EventType(raw[0]) {
case ENTER_OPEN_EVENT:
if ev, ok := e.filter.openEvent(NewOpenEvent(raw)); ok {
@@ -295,7 +295,6 @@ func (e *eventLoop) syscallExit(exitEv event.Event, ch chan<- *event.Pair) {
default:
panic(fmt.Sprintf("unknown type: %v", v))
}
- // TODO: implement sync(2)
// TODO: implement dup syscall
// TODO: implement dup2 syscall
// TODO: implement dup3 syscall
@@ -311,6 +310,7 @@ func (e *eventLoop) syscallExit(exitEv event.Event, ch chan<- *event.Pair) {
// TODO: sync_file_range
// TODO: readahead
// TODO: fallocate
+ // TODO: https://man7.org/linux/man-pages/man2/io_uring_enter.2.html (already captured but without FDs)
ev.PrevPair, _ = e.prevPairs[ev.EnterEv.GetTid()]
ev.CalculateDurations()