Lines Matching refs:n
1191 static void rb_erase_init(struct rb_node *n, struct rb_root *root) in rb_erase_init() argument
1193 rb_erase(n, root); in rb_erase_init()
1194 RB_CLEAR_NODE(n); in rb_erase_init()
1197 static void cfq_rb_erase(struct rb_node *n, struct cfq_rb_root *root) in cfq_rb_erase() argument
1199 if (root->left == n) in cfq_rb_erase()
1201 rb_erase_init(n, &root->rb); in cfq_rb_erase()
1355 struct rb_node *n; in cfq_group_notify_queue_add() local
1366 n = rb_last(&st->rb); in cfq_group_notify_queue_add()
1367 if (n) { in cfq_group_notify_queue_add()
1368 __cfqg = rb_entry_cfqg(n); in cfq_group_notify_queue_add()
2288 struct rb_node **n; in cfq_prio_tree_lookup() local
2298 n = &(*p)->rb_right; in cfq_prio_tree_lookup()
2300 n = &(*p)->rb_left; in cfq_prio_tree_lookup()
2303 p = n; in cfq_prio_tree_lookup()