77 	struct rb_root *root = &ltr->tree[idx];  in __lt_insert()  local
78 	struct rb_node **link = &root->rb_node;  in __lt_insert()
94 	rb_insert_color(node, root);  in __lt_insert()
143 		  struct latch_tree_root *root,  in latch_tree_insert()  argument
146 	raw_write_seqcount_latch(&root->seq);  in latch_tree_insert()
147 	__lt_insert(node, root, 0, ops->less);  in latch_tree_insert()
148 	raw_write_seqcount_latch(&root->seq);  in latch_tree_insert()
149 	__lt_insert(node, root, 1, ops->less);  in latch_tree_insert()
170 		 struct latch_tree_root *root,  in latch_tree_erase()  argument
173 	raw_write_seqcount_latch(&root->seq);  in latch_tree_erase()
174 	__lt_erase(node, root, 0);  in latch_tree_erase()
175 	raw_write_seqcount_latch(&root->seq);  in latch_tree_erase()
176 	__lt_erase(node, root, 1);  in latch_tree_erase()
198 latch_tree_find(void *key, struct latch_tree_root *root,  in latch_tree_find()  argument
205 		seq = raw_read_seqcount_latch(&root->seq);  in latch_tree_find()
206 		node = __lt_find(key, root, seq & 1, ops->comp);  in latch_tree_find()
207 	} while (read_seqcount_retry(&root->seq, seq));  in latch_tree_find()