Lines Matching refs:root
42 private(A) struct bpf_rb_root root __contains(node_data, r);
74 struct bpf_rb_root *root,
88 if (bpf_rbtree_add(root, &n->r, less)) {
106 static long __stash_map_insert_tree(int idx, int val, struct bpf_rb_root *root,
131 if (bpf_rbtree_add(root, &m->r, less)) {
140 static long __read_from_tree(struct bpf_rb_root *root,
150 rb = bpf_rbtree_first(root);
164 rb = bpf_rbtree_remove(root, rb);
233 err = __insert_in_tree_and_list(&head, &root, &lock); \
237 err = __read_from_tree(&root, &lock, rem_tree); \
272 err = __insert_in_tree_and_list(&head, &root, &lock); \
282 err = __read_from_tree(&root, &lock, rem_tree); \
310 err = __insert_in_tree_and_list(&head, &root, &lock); \
332 INSERT_DOUBLE_READ_AND_DEL(__read_from_tree, root, "insert_double_del: 2x read-and-del from tree");
343 err = __stash_map_insert_tree(0, 42, &root, &lock); \
347 err = __read_from_tree(&root, &lock, rem_tree); \
493 res = bpf_rbtree_remove(&root, &m->r);
518 bpf_rbtree_add(&root, &n->r, less);
519 rb = bpf_rbtree_first(&root);
523 rb = bpf_rbtree_remove(&root, rb);
552 bpf_rbtree_add(&root, &n->r, less);
553 rb = bpf_rbtree_first(&root);
557 rb = bpf_rbtree_remove(&root, rb);