Lines Matching defs:node
623 static inline struct pkt_rb_node *pkt_rbtree_next(struct pkt_rb_node *node)
625 struct rb_node *n = rb_next(&node->rb_node);
631 static void pkt_rbtree_erase(struct pktcdvd_device *pd, struct pkt_rb_node *node)
633 rb_erase(&node->rb_node, &pd->bio_queue);
634 mempool_free(node, &pd->rb_pool);
640 * Find the first node in the pd->bio_queue rb tree with a starting sector >= s.
674 * Insert a node into the pd->bio_queue rb tree.
676 static void pkt_rbtree_insert(struct pktcdvd_device *pd, struct pkt_rb_node *node)
680 sector_t s = node->bio->bi_iter.bi_sector;
691 rb_link_node(&node->rb_node, parent, p);
692 rb_insert_color(&node->rb_node, &pd->bio_queue);
1108 struct pkt_rb_node *node, *first_node;
1129 node = first_node;
1130 while (node) {
1131 bio = node->bio;
1141 node = pkt_rbtree_next(node);
1142 if (!node) {
1145 node = rb_entry(n, struct pkt_rb_node, rb_node);
1147 if (node == first_node)
1148 node = NULL;
1169 while ((node = pkt_rbtree_find(pd, zone)) != NULL) {
1170 bio = node->bio;
1175 pkt_rbtree_erase(pd, node);
2292 struct pkt_rb_node *node;
2346 node = mempool_alloc(&pd->rb_pool, GFP_NOIO);
2347 node->bio = bio;
2351 pkt_rbtree_insert(pd, node);