Documentation/bpf/graph_ds_impl.rst

6 structures (linked_list, rbtree), with particular focus on the verifier's
7 implementation of semantics specific to those data structures.
14 these graph data structures. **No guarantees** of stability for either
24 The BPF map API has historically been the main way to expose data structures
25 of various types for use within BPF programs. Some data structures fit naturally
27 interacting with the latter group of data structures can be hard to parse
32 BPF allocator, it is now possible to implement BPF data structures whose API
35 Two such data structures - linked_list and rbtree - have many verification
41 structures.
46 Data structures implemented using the BPF map API have historically used BPF
48 or map-specific helpers. The new-style graph data structures instead use kfuncs
50 for kfuncs, the API and semantics for these data structures can be evolved in
53 Root and node types for the new data structures are opaquely defined in the
59 The new-style data structures are intrusive and are defined similarly to their
139   * Both graph data structures have pointer stability