Lines Matching refs:n
1266 struct rb_node *n = uprobes_tree.rb_node; in find_node_in_range() local
1268 while (n) { in find_node_in_range()
1269 struct uprobe *u = rb_entry(n, struct uprobe, rb_node); in find_node_in_range()
1272 n = n->rb_left; in find_node_in_range()
1274 n = n->rb_right; in find_node_in_range()
1277 n = n->rb_left; in find_node_in_range()
1279 n = n->rb_right; in find_node_in_range()
1285 return n; in find_node_in_range()
1297 struct rb_node *n, *t; in build_probe_list() local
1305 n = find_node_in_range(inode, min, max); in build_probe_list()
1306 if (n) { in build_probe_list()
1307 for (t = n; t; t = rb_prev(t)) { in build_probe_list()
1314 for (t = n; (t = rb_next(t)); ) { in build_probe_list()
1406 struct rb_node *n; in vma_has_uprobes() local
1414 n = find_node_in_range(inode, min, max); in vma_has_uprobes()
1417 return !!n; in vma_has_uprobes()
1753 struct return_instance **p, *o, *n; in dup_utask() local
1762 n = kmalloc(sizeof(struct return_instance), GFP_KERNEL); in dup_utask()
1763 if (!n) in dup_utask()
1766 *n = *o; in dup_utask()
1767 get_uprobe(n->uprobe); in dup_utask()
1768 n->next = NULL; in dup_utask()
1770 *p = n; in dup_utask()
1771 p = &n->next; in dup_utask()