Lines Matching full:both

36 details in common. Because both have "root"s ("head" for linked_list) and
40 Unless otherwise stated, examples and semantics below apply to both graph data
73 The "root" type for both linked_list and rbtree expects to be in a map_value
74 which also contains a ``bpf_spin_lock`` - in the above example both global
76 spin_lock to be associated with the ``bpf_rb_root`` by virtue of both being in
133 Both the read from and write to ``n->data`` would be rejected. The verifier
139   * Both graph data structures have pointer stability
155 Both terms currently only have meaning in the context of graph nodes and API.
159 Let's enumerate the properties of both types of references.
237   3) n and m are non-owning references, they both point to the same node
255 We prevent both by generalizing the "invalidate non-owning references" behavior