Searched refs:bfqd (Results 1 – 4 of 4) sorted by relevance
| /Linux-v5.10/block/ |
| D | bfq-iosched.c | 231 #define BFQ_RQ_SEEKY(bfqd, last_pos, rq) \ argument
234 (!blk_queue_nonrot(bfqd->queue) || \
400 static struct bfq_io_cq *bfq_bic_lookup(struct bfq_data *bfqd, in bfq_bic_lookup() argument
422 void bfq_schedule_dispatch(struct bfq_data *bfqd) in bfq_schedule_dispatch() argument
424 if (bfqd->queued != 0) { in bfq_schedule_dispatch()
425 bfq_log(bfqd, "schedule dispatch"); in bfq_schedule_dispatch()
426 blk_mq_run_hw_queues(bfqd->queue, true); in bfq_schedule_dispatch()
439 static struct request *bfq_choose_req(struct bfq_data *bfqd, in bfq_choose_req() argument
470 back_max = bfqd->bfq_back_max * 2; in bfq_choose_req()
480 d1 = (last - s1) * bfqd->bfq_back_penalty; in bfq_choose_req()
[all …]
|
| D | bfq-iosched.h | 234 struct bfq_data *bfqd; member
908 void *bfqd; member
946 void bfq_pos_tree_add_move(struct bfq_data *bfqd, struct bfq_queue *bfqq);
947 void bfq_weights_tree_add(struct bfq_data *bfqd, struct bfq_queue *bfqq,
949 void __bfq_weights_tree_remove(struct bfq_data *bfqd,
952 void bfq_weights_tree_remove(struct bfq_data *bfqd,
954 void bfq_bfqq_expire(struct bfq_data *bfqd, struct bfq_queue *bfqq,
957 void bfq_end_wr_async_queues(struct bfq_data *bfqd, struct bfq_group *bfqg);
958 void bfq_release_process_ref(struct bfq_data *bfqd, struct bfq_queue *bfqq);
959 void bfq_schedule_dispatch(struct bfq_data *bfqd);
[all …]
|
| D | bfq-wf2q.c | 38 unsigned int bfq_tot_busy_queues(struct bfq_data *bfqd) in bfq_tot_busy_queues() argument
40 return bfqd->busy_queues[0] + bfqd->busy_queues[1] + in bfq_tot_busy_queues()
41 bfqd->busy_queues[2]; in bfq_tot_busy_queues()
153 group_entity = &bfqq->bfqd->root_group->entity; in bfq_bfqq_to_bfqg()
238 return bfqq->bfqd->root_group; in bfq_bfqq_to_bfqg()
296 bfq_log_bfqq(bfqq->bfqd, bfqq, in bfq_calc_finish()
299 bfq_log_bfqq(bfqq->bfqd, bfqq, in bfq_calc_finish()
480 struct bfq_data *bfqd = NULL; in bfq_active_insert() local
495 bfqd = (struct bfq_data *)bfqg->bfqd; in bfq_active_insert()
498 list_add(&bfqq->bfqq_list, &bfqq->bfqd->active_list); in bfq_active_insert()
[all …]
|
| D | bfq-cgroup.c | 227 if (!(bfqq == ((struct bfq_data *)bfqg->bfqd)->in_service_queue)) in bfqg_stats_update_io_add()
314 bfqq->bfqd->root_group; in bfqq_group()
544 struct bfq_data *bfqd = blkg->q->elevator->elevator_data; in bfq_pd_init() local
554 bfqg->bfqd = bfqd; in bfq_pd_init()
584 static struct bfq_group *bfq_lookup_bfqg(struct bfq_data *bfqd, in bfq_lookup_bfqg() argument
589 blkg = blkg_lookup(blkcg, bfqd->queue); in bfq_lookup_bfqg()
595 struct bfq_group *bfq_find_set_group(struct bfq_data *bfqd, in bfq_find_set_group() argument
601 bfqg = bfq_lookup_bfqg(bfqd, blkcg); in bfq_find_set_group()
615 if (curr_bfqg != bfqd->root_group) { in bfq_find_set_group()
618 parent = bfqd->root_group; in bfq_find_set_group()
[all …]
|
