Lines Matching full:graph

2 BPF Graph Data Structures
5 This document describes implementation details of new-style "graph" data
14 these graph data structures. **No guarantees** of stability for either
40 Unless otherwise stated, examples and semantics below apply to both graph data
48 or map-specific helpers. The new-style graph data structures instead use kfuncs
136   * Graph data structure APIs can only be used when the ``bpf_spin_lock``
137     associated with the graph root is held
139   * Both graph data structures have pointer stability
141      * Because graph nodes are allocated with ``bpf_obj_new`` and
143        ``bpf_{list,rb}_node`` field of the node struct, a graph node will
150 ends, we can safely access the graph node through ``n`` even after it was used
155 Both terms currently only have meaning in the context of graph nodes and API.
165   * Ownership of pointee must be 'released' by passing it to some graph API
176      * It cannot be used to add the graph node to a graph root, nor ``free``'d via
204 graph API add / remove implementations don't need to check if a node
257 ``bpf_rbtree_remove``. The logic here being that any graph API kfunc which: