79 	struct rb_root *root = &ltr->tree[idx];  in __lt_insert()  local
80 	struct rb_node **link = &root->rb_node;  in __lt_insert()
96 	rb_insert_color(node, root);  in __lt_insert()
145 		  struct latch_tree_root *root,  in latch_tree_insert()  argument
148 	write_seqcount_latch_begin(&root->seq);  in latch_tree_insert()
149 	__lt_insert(node, root, 0, ops->less);  in latch_tree_insert()
150 	write_seqcount_latch(&root->seq);  in latch_tree_insert()
151 	__lt_insert(node, root, 1, ops->less);  in latch_tree_insert()
152 	write_seqcount_latch_end(&root->seq);  in latch_tree_insert()
173 		 struct latch_tree_root *root,  in latch_tree_erase()  argument
176 	write_seqcount_latch_begin(&root->seq);  in latch_tree_erase()
177 	__lt_erase(node, root, 0);  in latch_tree_erase()
178 	write_seqcount_latch(&root->seq);  in latch_tree_erase()
179 	__lt_erase(node, root, 1);  in latch_tree_erase()
180 	write_seqcount_latch_end(&root->seq);  in latch_tree_erase()
202 latch_tree_find(void *key, struct latch_tree_root *root,  in latch_tree_find()  argument
209 		seq = read_seqcount_latch(&root->seq);  in latch_tree_find()
210 		node = __lt_find(key, root, seq & 1, ops->comp);  in latch_tree_find()
211 	} while (read_seqcount_latch_retry(&root->seq, seq));  in latch_tree_find()