39 	struct rb_node node[2];  member
68 __lt_from_rb(struct rb_node *node, int idx)  in __lt_from_rb()  argument
70 	return container_of(node, struct latch_tree_node, node[idx]);  in __lt_from_rb()
79 	struct rb_node *node = &ltn->node[idx];  in __lt_insert()  local
93 	rb_link_node_rcu(node, parent, link);  in __lt_insert()
94 	rb_insert_color(node, root);  in __lt_insert()
100 	rb_erase(&ltn->node[idx], &ltr->tree[idx]);  in __lt_erase()
105 	  int (*comp)(void *key, struct latch_tree_node *node))  in __lt_find()  argument
107 	struct rb_node *node = rcu_dereference_raw(ltr->tree[idx].rb_node);  in __lt_find()  local
111 	while (node) {  in __lt_find()
112 		ltn = __lt_from_rb(node, idx);  in __lt_find()
116 			node = rcu_dereference_raw(node->rb_left);  in __lt_find()
118 			node = rcu_dereference_raw(node->rb_right);  in __lt_find()
142 latch_tree_insert(struct latch_tree_node *node,  in latch_tree_insert()  argument
147 	__lt_insert(node, root, 0, ops->less);  in latch_tree_insert()
149 	__lt_insert(node, root, 1, ops->less);  in latch_tree_insert()
169 latch_tree_erase(struct latch_tree_node *node,  in latch_tree_erase()  argument
174 	__lt_erase(node, root, 0);  in latch_tree_erase()
176 	__lt_erase(node, root, 1);  in latch_tree_erase()
201 	struct latch_tree_node *node;  in latch_tree_find()  local
206 		node = __lt_find(key, root, seq & 1, ops->comp);  in latch_tree_find()
209 	return node;  in latch_tree_find()