Lines Matching refs:root
79 struct rb_root *root = <r->tree[idx];
80 struct rb_node **link = &root->rb_node;
96 rb_insert_color(node, root);
129 * latch_tree_insert() - insert @node into the trees @root
131 * @root: trees to insert @node into
134 * It inserts @node into @root in an ordered fashion such that we can always
145 struct latch_tree_root *root,
148 raw_write_seqcount_latch(&root->seq);
149 __lt_insert(node, root, 0, ops->less);
150 raw_write_seqcount_latch(&root->seq);
151 __lt_insert(node, root, 1, ops->less);
155 * latch_tree_erase() - removes @node from the trees @root
157 * @root: trees to remove @node from
160 * Removes @node from the trees @root in an ordered fashion such that we can
172 struct latch_tree_root *root,
175 raw_write_seqcount_latch(&root->seq);
176 __lt_erase(node, root, 0);
177 raw_write_seqcount_latch(&root->seq);
178 __lt_erase(node, root, 1);
182 * latch_tree_find() - find the node matching @key in the trees @root
184 * @root: trees to search for @key
187 * Does a lockless lookup in the trees @root for the node matching @key.
200 latch_tree_find(void *key, struct latch_tree_root *root,
207 seq = raw_read_seqcount_latch(&root->seq);
208 node = __lt_find(key, root, seq & 1, ops->comp);
209 } while (raw_read_seqcount_latch_retry(&root->seq, seq));