Better linked-list traversal in BPF
Better linked-list traversal in BPF
Posted Mar 9, 2024 15:51 UTC (Sat) by adobriyan (subscriber, #30858)In reply to: Better linked-list traversal in BPF by atnot
Parent article: Better linked-list traversal in BPF
How would you structure (pardon the repetition) data structures?
Userspace have a luxury of kernel doing equivalent of vmalloc for their std::vector's, but kernel have to deal with fragmentation.
Posted Mar 9, 2024 20:24 UTC (Sat)
by Cyberax (✭ supporter ✭, #52523)
[Link]
Better linked-list traversal in BPF
There's no real reason the kernel can't allocate its internal data in a contiguous virtual RAM. It's just that right now the kernel has one simple 1-to-1 mapping.