624 	struct rb_node *n = rb_next(&node->rb_node);  in pkt_rbtree_next()
627 	return rb_entry(n, struct pkt_rb_node, rb_node);  in pkt_rbtree_next()
632 	rb_erase(&node->rb_node, &pd->bio_queue);  in pkt_rbtree_erase()
643 	struct rb_node *n = pd->bio_queue.rb_node;  in pkt_rbtree_find()
644 	struct rb_node *next;  in pkt_rbtree_find()
653 		tmp = rb_entry(n, struct pkt_rb_node, rb_node);  in pkt_rbtree_find()
677 	struct rb_node **p = &pd->bio_queue.rb_node;  in pkt_rbtree_insert()
678 	struct rb_node *parent = NULL;  in pkt_rbtree_insert()
684 		tmp = rb_entry(parent, struct pkt_rb_node, rb_node);  in pkt_rbtree_insert()
690 	rb_link_node(&node->rb_node, parent, p);  in pkt_rbtree_insert()
691 	rb_insert_color(&node->rb_node, &pd->bio_queue);  in pkt_rbtree_insert()
1200 	struct rb_node *n;  in pkt_handle_queue()
1218 			first_node = rb_entry(n, struct pkt_rb_node, rb_node);  in pkt_handle_queue()
1236 				node = rb_entry(n, struct pkt_rb_node, rb_node);  in pkt_handle_queue()