31 	struct rb_node node;  member
101 	struct rb_node **node = &locks.rb_node;  in __get_lock_node()  local
106 	while (*node) {  in __get_lock_node()
107 		l = rb_entry(*node, struct lock_lookup, node);  in __get_lock_node()
109 		*parent = *node;  in __get_lock_node()
111 			node = &l->node.rb_left;  in __get_lock_node()
113 			node = &l->node.rb_right;  in __get_lock_node()
115 			return node;  in __get_lock_node()
118 	return node;  in __get_lock_node()
177 	struct rb_node **node, *parent;  in __get_lock()  local
181 	node = __get_lock_node(lock, &parent);  in __get_lock()
183 	if (*node) {  in __get_lock()
184 		return rb_entry(*node, struct lock_lookup, node);  in __get_lock()
204 	node = __get_lock_node(lock, &parent);  in __get_lock()
205 	rb_link_node(&l->node, parent, node);  in __get_lock()
206 	rb_insert_color(&l->node, &locks);  in __get_lock()
215 	rb_erase(&lock->node, &locks);  in __del_lock()