Subj : [$] Better linked-list traversal in BPF
To   : All
From : LWN.net
Date : Fri Mar 08 2024 14:45:06

[$] Better linked-list traversal in BPF

Date:
Fri, 08 Mar 2024 14:34:01 +0000

Description:
Before loading a BPF program, the kernel must verify that the program is
safe to run; among other things, that verification includes ensuring that
the program will terminate within a bounded time.  That requirement has
long made writing loops in BPF a challenging task.  The situation has
improved over the years for some types of loops, but others  including
linked-list traversal  are still awkward in BPF programs.  A new set of
BPF primitives aims to make life easier for this use case through the
installation of what can be seen as a sort of circuit breaker.

======================================================================
Link to news story:
https://lwn.net/Articles/964381/


--- Mystic BBS v1.12 A47 (Linux/64)
 * Origin: tqwNet UK HUB @ hub.uk.erb.pw (1337:1/100)

.