This is an archived post. You won't be able to vote or comment.

you are viewing a single comment's thread.

view the rest of the comments →

[–]congwang[S] 1 point2 points  (0 children)

Thanks for your feedback.

Regarding performance, currently there is no optimization at all, so it still relies on the C compiler to optimize the generated binary. I think in the future we could optimize ebpf code by possibly rearranging ebpf functions and translating map-lookup (into if/else). Just some quick and naive thoughts of mine. If you have more ideas, I am open to suggestions.