641 	struct uprobe u = { .inode = inode, .offset = offset };  in __find_uprobe()  local
648 		match = match_uprobe(&u, uprobe);  in __find_uprobe()
679 	struct uprobe *u;  in __insert_uprobe()  local
684 		u = rb_entry(parent, struct uprobe, rb_node);  in __insert_uprobe()
685 		match = match_uprobe(uprobe, u);  in __insert_uprobe()
687 			return get_uprobe(u);  in __insert_uprobe()
696 	u = NULL;  in __insert_uprobe()
702 	return u;  in __insert_uprobe()
715 	struct uprobe *u;  in insert_uprobe()  local
718 	u = __insert_uprobe(uprobe);  in insert_uprobe()
721 	return u;  in insert_uprobe()
1272 		struct uprobe *u = rb_entry(n, struct uprobe, rb_node);  in find_node_in_range()  local
1274 		if (inode < u->inode) {  in find_node_in_range()
1276 		} else if (inode > u->inode) {  in find_node_in_range()
1279 			if (max < u->offset)  in find_node_in_range()
1281 			else if (min > u->offset)  in find_node_in_range()
1301 	struct uprobe *u;  in build_probe_list()  local
1311 			u = rb_entry(t, struct uprobe, rb_node);  in build_probe_list()
1312 			if (u->inode != inode || u->offset < min)  in build_probe_list()
1314 			list_add(&u->pending_list, head);  in build_probe_list()
1315 			get_uprobe(u);  in build_probe_list()
1318 			u = rb_entry(t, struct uprobe, rb_node);  in build_probe_list()
1319 			if (u->inode != inode || u->offset > max)  in build_probe_list()
1321 			list_add(&u->pending_list, head);  in build_probe_list()
1322 			get_uprobe(u);  in build_probe_list()
1366 	struct uprobe *uprobe, *u;  in uprobe_mmap()  local
1391 	list_for_each_entry_safe(uprobe, u, &tmp_list, pending_list) {  in uprobe_mmap()