24 	struct rb_node node;  member
65 	return rb_entry(n, struct ovl_cache_entry, node);  in ovl_cache_entry_from_node()
83 			newp = &tmp->node.rb_right;  in ovl_cache_entry_find_link()
85 			newp = &tmp->node.rb_left;  in ovl_cache_entry_find_link()
97 	struct rb_node *node = root->rb_node;  in ovl_cache_entry_find()  local
100 	while (node) {  in ovl_cache_entry_find()
101 		struct ovl_cache_entry *p = ovl_cache_entry_from_node(node);  in ovl_cache_entry_find()
105 			node = p->node.rb_right;  in ovl_cache_entry_find()
107 			node = p->node.rb_left;  in ovl_cache_entry_find()
195 	rb_link_node(&p->node, parent, newp);  in ovl_cache_entry_add_rb()
196 	rb_insert_color(&p->node, rdd->root);  in ovl_cache_entry_add_rb()
604 			rb_link_node(&p->node, parent, newp);  in ovl_dir_read_impure()
605 			rb_insert_color(&p->node, root);  in ovl_dir_read_impure()