Home
last modified time | relevance | path

Searched refs:rb_node (Results 1 – 8 of 8) sorted by relevance

/block/
Dbfq-wf2q.c25 struct rb_node *node = tree->rb_node; in bfq_root_active_entity()
27 return rb_entry(node, struct bfq_entity, rb_node); in bfq_root_active_entity()
315 struct bfq_entity *bfq_entity_of(struct rb_node *node) in bfq_entity_of()
320 entity = rb_entry(node, struct bfq_entity, rb_node); in bfq_entity_of()
333 rb_erase(&entity->rb_node, root); in bfq_extract()
345 struct rb_node *next; in bfq_idle_extract()
348 next = rb_next(&entity->rb_node); in bfq_idle_extract()
353 next = rb_prev(&entity->rb_node); in bfq_idle_extract()
374 struct rb_node **node = &root->rb_node; in bfq_insert()
375 struct rb_node *parent = NULL; in bfq_insert()
[all …]
Delevator.c256 struct rb_node **p = &root->rb_node; in elv_rb_add()
257 struct rb_node *parent = NULL; in elv_rb_add()
262 __rq = rb_entry(parent, struct request, rb_node); in elv_rb_add()
270 rb_link_node(&rq->rb_node, parent, p); in elv_rb_add()
271 rb_insert_color(&rq->rb_node, root); in elv_rb_add()
277 BUG_ON(RB_EMPTY_NODE(&rq->rb_node)); in elv_rb_del()
278 rb_erase(&rq->rb_node, root); in elv_rb_del()
279 RB_CLEAR_NODE(&rq->rb_node); in elv_rb_del()
285 struct rb_node *n = root->rb_node; in elv_rb_find()
289 rq = rb_entry(n, struct request, rb_node); in elv_rb_find()
[all …]
Dbfq-iosched.h115 struct rb_node weights_node;
147 struct rb_node rb_node; member
254 struct rb_node pos_node;
1034 struct bfq_entity *bfq_entity_of(struct rb_node *node);
Dbfq-iosched.c560 sector_t sector, struct rb_node **ret_parent, in bfq_rq_pos_tree_lookup()
561 struct rb_node ***rb_link) in bfq_rq_pos_tree_lookup()
563 struct rb_node **p, *parent; in bfq_rq_pos_tree_lookup()
567 p = &root->rb_node; in bfq_rq_pos_tree_lookup()
569 struct rb_node **n; in bfq_rq_pos_tree_lookup()
617 struct rb_node **p, *parent; in bfq_pos_tree_add_move()
702 (bfqd->queue_weights_tree.rb_root.rb_node->rb_left || in bfq_asymmetric_scenario()
703 bfqd->queue_weights_tree.rb_root.rb_node->rb_right); in bfq_asymmetric_scenario()
734 struct rb_node **new = &(root->rb_root.rb_node), *parent = NULL; in bfq_weights_tree_add()
902 struct rb_node *rbnext = rb_next(&last->rb_node); in bfq_find_next_rq()
[all …]
Dblk-throttle.c99 #define rb_entry_tg(node) rb_entry((node), struct throtl_grp, rb_node)
112 struct rb_node rb_node; member
514 RB_CLEAR_NODE(&tg->rb_node); in throtl_pd_alloc()
643 struct rb_node *n; in throtl_rb_first()
652 static void throtl_rb_erase(struct rb_node *n, in throtl_rb_erase()
674 struct rb_node **node = &parent_sq->pending_tree.rb_root.rb_node; in tg_service_queue_add()
675 struct rb_node *parent = NULL; in tg_service_queue_add()
692 rb_link_node(&tg->rb_node, parent, node); in tg_service_queue_add()
693 rb_insert_color_cached(&tg->rb_node, &parent_sq->pending_tree, in tg_service_queue_add()
709 throtl_rb_erase(&tg->rb_node, tg->service_queue.parent_sq); in throtl_dequeue_tg()
Dmq-deadline-main.c162 struct rb_node *node = rb_next(&rq->rb_node); in deadline_latter_request()
201 if (!RB_EMPTY_NODE(&rq->rb_node)) in deadline_remove_request()
Dblk-core.c128 RB_CLEAR_NODE(&rq->rb_node); in blk_rq_init()
Dblk-mq.c304 RB_CLEAR_NODE(&rq->rb_node); in blk_mq_rq_ctx_init()