66 	struct rb_node		rb_node;	/* node in the rb tree */  member
393 	struct rb_node *n = uprobes_tree.rb_node;  in __find_uprobe()
398 		uprobe = rb_entry(n, struct uprobe, rb_node);  in __find_uprobe()
428 	struct rb_node **p = &uprobes_tree.rb_node;  in __insert_uprobe()
429 	struct rb_node *parent = NULL;  in __insert_uprobe()
435 		u = rb_entry(parent, struct uprobe, rb_node);  in __insert_uprobe()
448 	rb_link_node(&uprobe->rb_node, parent, p);  in __insert_uprobe()
449 	rb_insert_color(&uprobe->rb_node, &uprobes_tree);  in __insert_uprobe()
677 	return !RB_EMPTY_NODE(&uprobe->rb_node);  in uprobe_is_active()
690 	rb_erase(&uprobe->rb_node, &uprobes_tree);  in delete_uprobe()
692 	RB_CLEAR_NODE(&uprobe->rb_node); /* for uprobe_is_active() */  in delete_uprobe()
987 static struct rb_node *
990 	struct rb_node *n = uprobes_tree.rb_node;  in find_node_in_range()
993 		struct uprobe *u = rb_entry(n, struct uprobe, rb_node);  in find_node_in_range()
1021 	struct rb_node *n, *t;  in build_probe_list()
1032 			u = rb_entry(t, struct uprobe, rb_node);  in build_probe_list()
1039 			u = rb_entry(t, struct uprobe, rb_node);  in build_probe_list()
1093 	struct rb_node *n;  in vma_has_uprobes()