Lines Matching refs:node

37 "node"s, the verifier code and this document refer to common functionality
53 Root and node types for the new data structures are opaquely defined in the
67           struct bpf_rb_node node;
71         struct bpf_rb_root groot __contains(node_data, node);
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
176      * It cannot be used to add the graph node to a graph root, nor ``free``'d via
201 Any reference to a node that is in an rbtree _must_ be non-owning, since
202 the tree has control of the pointee's lifetime. Similarly, any ref to a node
204 graph API add / remove implementations don't need to check if a node
237   3) n and m are non-owning references, they both point to the same node
239   4) o is an owning reference, n and m non-owning, all point to same node
241   5) o and p are owning, n and m non-owning, all point to the same node
243   6) a double-free has occurred, since o and p point to same node and o was
247 a node which is not in an rbtree. Statement 5 will try to remove a node which
253 node has already been removed at runtime.
259   * takes an arbitrary node argument
263   * returns an owning reference to the removed node
266 node. So ``remove``-type kfuncs must be considered a non-owning reference