Searched refs:bfqd (Results 1 – 4 of 4) sorted by relevance
| /Linux-v5.15/block/ |
| D | bfq-iosched.c | 232 #define BFQ_RQ_SEEKY(bfqd, last_pos, rq) \ argument
235 (!blk_queue_nonrot(bfqd->queue) || \
440 static struct bfq_io_cq *bfq_bic_lookup(struct bfq_data *bfqd, in bfq_bic_lookup() argument
462 void bfq_schedule_dispatch(struct bfq_data *bfqd) in bfq_schedule_dispatch() argument
464 if (bfqd->queued != 0) { in bfq_schedule_dispatch()
465 bfq_log(bfqd, "schedule dispatch"); in bfq_schedule_dispatch()
466 blk_mq_run_hw_queues(bfqd->queue, true); in bfq_schedule_dispatch()
479 static struct request *bfq_choose_req(struct bfq_data *bfqd, in bfq_choose_req() argument
510 back_max = bfqd->bfq_back_max * 2; in bfq_choose_req()
520 d1 = (last - s1) * bfqd->bfq_back_penalty; in bfq_choose_req()
[all …]
|
| D | bfq-iosched.h | 239 struct bfq_data *bfqd; member
932 void *bfqd; member
968 void bfq_pos_tree_add_move(struct bfq_data *bfqd, struct bfq_queue *bfqq);
969 void bfq_weights_tree_add(struct bfq_data *bfqd, struct bfq_queue *bfqq,
971 void __bfq_weights_tree_remove(struct bfq_data *bfqd,
974 void bfq_weights_tree_remove(struct bfq_data *bfqd,
976 void bfq_bfqq_expire(struct bfq_data *bfqd, struct bfq_queue *bfqq,
979 void bfq_end_wr_async_queues(struct bfq_data *bfqd, struct bfq_group *bfqg);
980 void bfq_release_process_ref(struct bfq_data *bfqd, struct bfq_queue *bfqq);
981 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()
150 group_entity = &bfqq->bfqd->root_group->entity; in bfq_bfqq_to_bfqg()
235 return bfqq->bfqd->root_group; in bfq_bfqq_to_bfqg()
293 bfq_log_bfqq(bfqq->bfqd, bfqq, in bfq_calc_finish()
296 bfq_log_bfqq(bfqq->bfqd, bfqq, in bfq_calc_finish()
477 struct bfq_data *bfqd = NULL; in bfq_active_insert() local
492 bfqd = (struct bfq_data *)bfqg->bfqd; in bfq_active_insert()
495 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
556 bfqg->bfqd = bfqd; in bfq_pd_init()
586 static struct bfq_group *bfq_lookup_bfqg(struct bfq_data *bfqd, in bfq_lookup_bfqg() argument
591 blkg = blkg_lookup(blkcg, bfqd->queue); in bfq_lookup_bfqg()
597 struct bfq_group *bfq_find_set_group(struct bfq_data *bfqd, in bfq_find_set_group() argument
603 bfqg = bfq_lookup_bfqg(bfqd, blkcg); in bfq_find_set_group()
617 if (curr_bfqg != bfqd->root_group) { in bfq_find_set_group()
620 parent = bfqd->root_group; in bfq_find_set_group()
[all …]
|
