610 		struct rb_node **n;  in bfq_rq_pos_tree_lookup()  local
620 			n = &(*p)->rb_right;  in bfq_rq_pos_tree_lookup()
622 			n = &(*p)->rb_left;  in bfq_rq_pos_tree_lookup()
625 		p = n;  in bfq_rq_pos_tree_lookup()
1133 	struct hlist_node *n;  in bfq_reset_burst_list()  local
1135 	hlist_for_each_entry_safe(item, n, &bfqd->burst_list, burst_list_node)  in bfq_reset_burst_list()
1160 		struct hlist_node *n;  in bfq_add_to_burst()  local
1184 		hlist_for_each_entry_safe(pos, n, &bfqd->burst_list,  in bfq_add_to_burst()
5128 	struct hlist_node *n;  in bfq_put_queue()  local
5191 	hlist_for_each_entry_safe(item, n, &bfqq->woken_list,  in bfq_put_queue()
6894 	struct bfq_queue *bfqq, *n;  in bfq_exit_queue()  local
6899 	list_for_each_entry_safe(bfqq, n, &bfqd->idle_list, bfqq_list)  in bfq_exit_queue()