637 static inline struct pkt_rb_node *pkt_rbtree_next(struct pkt_rb_node *node)  in pkt_rbtree_next()  argument
639 	struct rb_node *n = rb_next(&node->rb_node);  in pkt_rbtree_next()
645 static void pkt_rbtree_erase(struct pktcdvd_device *pd, struct pkt_rb_node *node)  in pkt_rbtree_erase()  argument
647 	rb_erase(&node->rb_node, &pd->bio_queue);  in pkt_rbtree_erase()
648 	mempool_free(node, &pd->rb_pool);  in pkt_rbtree_erase()
690 static void pkt_rbtree_insert(struct pktcdvd_device *pd, struct pkt_rb_node *node)  in pkt_rbtree_insert()  argument
694 	sector_t s = node->bio->bi_iter.bi_sector;  in pkt_rbtree_insert()
705 	rb_link_node(&node->rb_node, parent, p);  in pkt_rbtree_insert()
706 	rb_insert_color(&node->rb_node, &pd->bio_queue);  in pkt_rbtree_insert()
1132 	struct pkt_rb_node *node, *first_node;  in pkt_handle_queue()  local
1152 	node = first_node;  in pkt_handle_queue()
1153 	while (node) {  in pkt_handle_queue()
1154 		bio = node->bio;  in pkt_handle_queue()
1164 		node = pkt_rbtree_next(node);  in pkt_handle_queue()
1165 		if (!node) {  in pkt_handle_queue()
1168 				node = rb_entry(n, struct pkt_rb_node, rb_node);  in pkt_handle_queue()
1170 		if (node == first_node)  in pkt_handle_queue()
1171 			node = NULL;  in pkt_handle_queue()
1192 	while ((node = pkt_rbtree_find(pd, zone)) != NULL) {  in pkt_handle_queue()
1193 		sector_t tmp = get_zone(node->bio->bi_iter.bi_sector, pd);  in pkt_handle_queue()
1195 		bio = node->bio;  in pkt_handle_queue()
1199 		pkt_rbtree_erase(pd, node);  in pkt_handle_queue()
2342 	struct pkt_rb_node *node;  in pkt_make_request_write()  local
2404 	node = mempool_alloc(&pd->rb_pool, GFP_NOIO);  in pkt_make_request_write()
2405 	node->bio = bio;  in pkt_make_request_write()
2409 	pkt_rbtree_insert(pd, node);  in pkt_make_request_write()