Lines Matching refs:bfqq
136 void bfq_mark_bfqq_##name(struct bfq_queue *bfqq) \
138 __set_bit(BFQQF_##name, &(bfqq)->flags); \
140 void bfq_clear_bfqq_##name(struct bfq_queue *bfqq) \
142 __clear_bit(BFQQF_##name, &(bfqq)->flags); \
144 int bfq_bfqq_##name(const struct bfq_queue *bfqq) \
146 return test_bit(BFQQF_##name, &(bfqq)->flags); \
237 #define BFQQ_SEEKY(bfqq) (hweight32(bfqq->seek_history) > 19) argument
245 #define BFQQ_TOTALLY_SEEKY(bfqq) (bfqq->seek_history == -1) argument
371 return bic->bfqq[is_sync]; in bic_to_bfqq()
374 void bic_set_bfqq(struct bfq_io_cq *bic, struct bfq_queue *bfqq, bool is_sync) in bic_set_bfqq() argument
376 bic->bfqq[is_sync] = bfqq; in bic_set_bfqq()
430 #define bfq_class_idle(bfqq) ((bfqq)->ioprio_class == IOPRIO_CLASS_IDLE) argument
556 struct bfq_queue *bfqq = NULL; in bfq_rq_pos_tree_lookup() local
564 bfqq = rb_entry(parent, struct bfq_queue, pos_node); in bfq_rq_pos_tree_lookup()
570 if (sector > blk_rq_pos(bfqq->next_rq)) in bfq_rq_pos_tree_lookup()
572 else if (sector < blk_rq_pos(bfqq->next_rq)) in bfq_rq_pos_tree_lookup()
577 bfqq = NULL; in bfq_rq_pos_tree_lookup()
586 bfqq ? bfqq->pid : 0); in bfq_rq_pos_tree_lookup()
588 return bfqq; in bfq_rq_pos_tree_lookup()
591 static bool bfq_too_late_for_merging(struct bfq_queue *bfqq) in bfq_too_late_for_merging() argument
593 return bfqq->service_from_backlogged > 0 && in bfq_too_late_for_merging()
594 time_is_before_jiffies(bfqq->first_IO_time + in bfq_too_late_for_merging()
607 bfq_pos_tree_add_move(struct bfq_data *bfqd, struct bfq_queue *bfqq) in bfq_pos_tree_add_move() argument
612 if (bfqq->pos_root) { in bfq_pos_tree_add_move()
613 rb_erase(&bfqq->pos_node, bfqq->pos_root); in bfq_pos_tree_add_move()
614 bfqq->pos_root = NULL; in bfq_pos_tree_add_move()
618 if (bfqq == &bfqd->oom_bfqq) in bfq_pos_tree_add_move()
626 if (bfq_too_late_for_merging(bfqq)) in bfq_pos_tree_add_move()
629 if (bfq_class_idle(bfqq)) in bfq_pos_tree_add_move()
631 if (!bfqq->next_rq) in bfq_pos_tree_add_move()
634 bfqq->pos_root = &bfq_bfqq_to_bfqg(bfqq)->rq_pos_tree; in bfq_pos_tree_add_move()
635 __bfqq = bfq_rq_pos_tree_lookup(bfqd, bfqq->pos_root, in bfq_pos_tree_add_move()
636 blk_rq_pos(bfqq->next_rq), &parent, &p); in bfq_pos_tree_add_move()
638 rb_link_node(&bfqq->pos_node, parent, p); in bfq_pos_tree_add_move()
639 rb_insert_color(&bfqq->pos_node, bfqq->pos_root); in bfq_pos_tree_add_move()
641 bfqq->pos_root = NULL; in bfq_pos_tree_add_move()
678 struct bfq_queue *bfqq) in bfq_asymmetric_scenario() argument
680 bool smallest_weight = bfqq && in bfq_asymmetric_scenario()
681 bfqq->weight_counter && in bfq_asymmetric_scenario()
682 bfqq->weight_counter == in bfq_asymmetric_scenario()
722 void bfq_weights_tree_add(struct bfq_data *bfqd, struct bfq_queue *bfqq, in bfq_weights_tree_add() argument
725 struct bfq_entity *entity = &bfqq->entity; in bfq_weights_tree_add()
741 if (bfqq->weight_counter) in bfq_weights_tree_add()
751 bfqq->weight_counter = __counter; in bfq_weights_tree_add()
762 bfqq->weight_counter = kzalloc(sizeof(struct bfq_weight_counter), in bfq_weights_tree_add()
777 if (unlikely(!bfqq->weight_counter)) in bfq_weights_tree_add()
780 bfqq->weight_counter->weight = entity->weight; in bfq_weights_tree_add()
781 rb_link_node(&bfqq->weight_counter->weights_node, parent, new); in bfq_weights_tree_add()
782 rb_insert_color_cached(&bfqq->weight_counter->weights_node, root, in bfq_weights_tree_add()
786 bfqq->weight_counter->num_active++; in bfq_weights_tree_add()
787 bfqq->ref++; in bfq_weights_tree_add()
797 struct bfq_queue *bfqq, in __bfq_weights_tree_remove() argument
800 if (!bfqq->weight_counter) in __bfq_weights_tree_remove()
803 bfqq->weight_counter->num_active--; in __bfq_weights_tree_remove()
804 if (bfqq->weight_counter->num_active > 0) in __bfq_weights_tree_remove()
807 rb_erase_cached(&bfqq->weight_counter->weights_node, root); in __bfq_weights_tree_remove()
808 kfree(bfqq->weight_counter); in __bfq_weights_tree_remove()
811 bfqq->weight_counter = NULL; in __bfq_weights_tree_remove()
812 bfq_put_queue(bfqq); in __bfq_weights_tree_remove()
820 struct bfq_queue *bfqq) in bfq_weights_tree_remove() argument
822 struct bfq_entity *entity = bfqq->entity.parent; in bfq_weights_tree_remove()
864 __bfq_weights_tree_remove(bfqd, bfqq, in bfq_weights_tree_remove()
871 static struct request *bfq_check_fifo(struct bfq_queue *bfqq, in bfq_check_fifo() argument
876 if (bfq_bfqq_fifo_expire(bfqq)) in bfq_check_fifo()
879 bfq_mark_bfqq_fifo_expire(bfqq); in bfq_check_fifo()
881 rq = rq_entry_fifo(bfqq->fifo.next); in bfq_check_fifo()
886 bfq_log_bfqq(bfqq->bfqd, bfqq, "check_fifo: returned %p", rq); in bfq_check_fifo()
891 struct bfq_queue *bfqq, in bfq_find_next_rq() argument
899 next = bfq_check_fifo(bfqq, last); in bfq_find_next_rq()
909 rbnext = rb_first(&bfqq->sort_list); in bfq_find_next_rq()
919 struct bfq_queue *bfqq) in bfq_serv_to_charge() argument
921 if (bfq_bfqq_sync(bfqq) || bfqq->wr_coeff > 1 || in bfq_serv_to_charge()
922 bfq_asymmetric_scenario(bfqq->bfqd, bfqq)) in bfq_serv_to_charge()
940 struct bfq_queue *bfqq) in bfq_updated_next_req() argument
942 struct bfq_entity *entity = &bfqq->entity; in bfq_updated_next_req()
943 struct request *next_rq = bfqq->next_rq; in bfq_updated_next_req()
949 if (bfqq == bfqd->in_service_queue) in bfq_updated_next_req()
957 max_t(unsigned long, bfqq->max_budget, in bfq_updated_next_req()
958 bfq_serv_to_charge(next_rq, bfqq)), in bfq_updated_next_req()
962 bfq_log_bfqq(bfqd, bfqq, "updated next rq: new budget %lu", in bfq_updated_next_req()
964 bfq_requeue_bfqq(bfqd, bfqq, false); in bfq_updated_next_req()
1002 static void switch_back_to_interactive_wr(struct bfq_queue *bfqq, in switch_back_to_interactive_wr() argument
1005 bfqq->wr_coeff = bfqd->bfq_wr_coeff; in switch_back_to_interactive_wr()
1006 bfqq->wr_cur_max_time = bfq_wr_duration(bfqd); in switch_back_to_interactive_wr()
1007 bfqq->last_wr_start_finish = bfqq->wr_start_at_switch_to_srt; in switch_back_to_interactive_wr()
1011 bfq_bfqq_resume_state(struct bfq_queue *bfqq, struct bfq_data *bfqd, in bfq_bfqq_resume_state() argument
1014 unsigned int old_wr_coeff = bfqq->wr_coeff; in bfq_bfqq_resume_state()
1015 bool busy = bfq_already_existing && bfq_bfqq_busy(bfqq); in bfq_bfqq_resume_state()
1018 bfq_mark_bfqq_has_short_ttime(bfqq); in bfq_bfqq_resume_state()
1020 bfq_clear_bfqq_has_short_ttime(bfqq); in bfq_bfqq_resume_state()
1023 bfq_mark_bfqq_IO_bound(bfqq); in bfq_bfqq_resume_state()
1025 bfq_clear_bfqq_IO_bound(bfqq); in bfq_bfqq_resume_state()
1027 bfqq->entity.new_weight = bic->saved_weight; in bfq_bfqq_resume_state()
1028 bfqq->ttime = bic->saved_ttime; in bfq_bfqq_resume_state()
1029 bfqq->wr_coeff = bic->saved_wr_coeff; in bfq_bfqq_resume_state()
1030 bfqq->wr_start_at_switch_to_srt = bic->saved_wr_start_at_switch_to_srt; in bfq_bfqq_resume_state()
1031 bfqq->last_wr_start_finish = bic->saved_last_wr_start_finish; in bfq_bfqq_resume_state()
1032 bfqq->wr_cur_max_time = bic->saved_wr_cur_max_time; in bfq_bfqq_resume_state()
1034 if (bfqq->wr_coeff > 1 && (bfq_bfqq_in_large_burst(bfqq) || in bfq_bfqq_resume_state()
1035 time_is_before_jiffies(bfqq->last_wr_start_finish + in bfq_bfqq_resume_state()
1036 bfqq->wr_cur_max_time))) { in bfq_bfqq_resume_state()
1037 if (bfqq->wr_cur_max_time == bfqd->bfq_wr_rt_max_time && in bfq_bfqq_resume_state()
1038 !bfq_bfqq_in_large_burst(bfqq) && in bfq_bfqq_resume_state()
1039 time_is_after_eq_jiffies(bfqq->wr_start_at_switch_to_srt + in bfq_bfqq_resume_state()
1041 switch_back_to_interactive_wr(bfqq, bfqd); in bfq_bfqq_resume_state()
1043 bfqq->wr_coeff = 1; in bfq_bfqq_resume_state()
1044 bfq_log_bfqq(bfqq->bfqd, bfqq, in bfq_bfqq_resume_state()
1050 bfqq->entity.prio_changed = 1; in bfq_bfqq_resume_state()
1055 if (old_wr_coeff == 1 && bfqq->wr_coeff > 1) in bfq_bfqq_resume_state()
1057 else if (old_wr_coeff > 1 && bfqq->wr_coeff == 1) in bfq_bfqq_resume_state()
1061 static int bfqq_process_refs(struct bfq_queue *bfqq) in bfqq_process_refs() argument
1063 return bfqq->ref - bfqq->allocated - bfqq->entity.on_st_or_in_serv - in bfqq_process_refs()
1064 (bfqq->weight_counter != NULL); in bfqq_process_refs()
1068 static void bfq_reset_burst_list(struct bfq_data *bfqd, struct bfq_queue *bfqq) in bfq_reset_burst_list() argument
1082 hlist_add_head(&bfqq->burst_list_node, &bfqd->burst_list); in bfq_reset_burst_list()
1087 bfqd->burst_parent_entity = bfqq->entity.parent; in bfq_reset_burst_list()
1091 static void bfq_add_to_burst(struct bfq_data *bfqd, struct bfq_queue *bfqq) in bfq_add_to_burst() argument
1113 bfq_mark_bfqq_in_large_burst(bfqq); in bfq_add_to_burst()
1131 hlist_add_head(&bfqq->burst_list_node, &bfqd->burst_list); in bfq_add_to_burst()
1243 static void bfq_handle_burst(struct bfq_data *bfqd, struct bfq_queue *bfqq) in bfq_handle_burst() argument
1250 if (!hlist_unhashed(&bfqq->burst_list_node) || in bfq_handle_burst()
1251 bfq_bfqq_in_large_burst(bfqq) || in bfq_handle_burst()
1252 time_is_after_eq_jiffies(bfqq->split_time + in bfq_handle_burst()
1275 bfqq->entity.parent != bfqd->burst_parent_entity) { in bfq_handle_burst()
1277 bfq_reset_burst_list(bfqd, bfqq); in bfq_handle_burst()
1287 bfq_mark_bfqq_in_large_burst(bfqq); in bfq_handle_burst()
1296 bfq_add_to_burst(bfqd, bfqq); in bfq_handle_burst()
1309 static int bfq_bfqq_budget_left(struct bfq_queue *bfqq) in bfq_bfqq_budget_left() argument
1311 struct bfq_entity *entity = &bfqq->entity; in bfq_bfqq_budget_left()
1446 struct bfq_queue *bfqq, in bfq_bfqq_update_budg_for_activation() argument
1449 struct bfq_entity *entity = &bfqq->entity; in bfq_bfqq_update_budg_for_activation()
1458 if (bfq_bfqq_non_blocking_wait_rq(bfqq) && arrived_in_time && in bfq_bfqq_update_budg_for_activation()
1459 bfq_bfqq_budget_left(bfqq) > 0) { in bfq_bfqq_update_budg_for_activation()
1478 bfq_bfqq_budget_left(bfqq), in bfq_bfqq_update_budg_for_activation()
1479 bfqq->max_budget); in bfq_bfqq_update_budg_for_activation()
1499 entity->budget = max_t(unsigned long, bfqq->max_budget, in bfq_bfqq_update_budg_for_activation()
1500 bfq_serv_to_charge(bfqq->next_rq, bfqq)); in bfq_bfqq_update_budg_for_activation()
1501 bfq_clear_bfqq_non_blocking_wait_rq(bfqq); in bfq_bfqq_update_budg_for_activation()
1515 struct bfq_queue *bfqq, in bfq_update_bfqq_wr_on_rq_arrival() argument
1525 bfqq->service_from_wr = 0; in bfq_update_bfqq_wr_on_rq_arrival()
1526 bfqq->wr_coeff = bfqd->bfq_wr_coeff; in bfq_update_bfqq_wr_on_rq_arrival()
1527 bfqq->wr_cur_max_time = bfq_wr_duration(bfqd); in bfq_update_bfqq_wr_on_rq_arrival()
1540 bfqq->wr_start_at_switch_to_srt = in bfq_update_bfqq_wr_on_rq_arrival()
1542 bfqq->wr_coeff = bfqd->bfq_wr_coeff * in bfq_update_bfqq_wr_on_rq_arrival()
1544 bfqq->wr_cur_max_time = in bfq_update_bfqq_wr_on_rq_arrival()
1557 bfqq->entity.budget = min_t(unsigned long, in bfq_update_bfqq_wr_on_rq_arrival()
1558 bfqq->entity.budget, in bfq_update_bfqq_wr_on_rq_arrival()
1562 bfqq->wr_coeff = bfqd->bfq_wr_coeff; in bfq_update_bfqq_wr_on_rq_arrival()
1563 bfqq->wr_cur_max_time = bfq_wr_duration(bfqd); in bfq_update_bfqq_wr_on_rq_arrival()
1565 bfqq->wr_coeff = 1; in bfq_update_bfqq_wr_on_rq_arrival()
1596 if (bfqq->wr_cur_max_time != in bfq_update_bfqq_wr_on_rq_arrival()
1598 bfqq->wr_start_at_switch_to_srt = in bfq_update_bfqq_wr_on_rq_arrival()
1599 bfqq->last_wr_start_finish; in bfq_update_bfqq_wr_on_rq_arrival()
1601 bfqq->wr_cur_max_time = in bfq_update_bfqq_wr_on_rq_arrival()
1603 bfqq->wr_coeff = bfqd->bfq_wr_coeff * in bfq_update_bfqq_wr_on_rq_arrival()
1606 bfqq->last_wr_start_finish = jiffies; in bfq_update_bfqq_wr_on_rq_arrival()
1612 struct bfq_queue *bfqq) in bfq_bfqq_idle_for_long_time() argument
1614 return bfqq->dispatched == 0 && in bfq_bfqq_idle_for_long_time()
1616 bfqq->budget_timeout + in bfq_bfqq_idle_for_long_time()
1625 static bool bfq_bfqq_higher_class_or_weight(struct bfq_queue *bfqq, in bfq_bfqq_higher_class_or_weight() argument
1630 if (bfqq->ioprio_class < in_serv_bfqq->ioprio_class) in bfq_bfqq_higher_class_or_weight()
1633 if (in_serv_bfqq->entity.parent == bfqq->entity.parent) { in bfq_bfqq_higher_class_or_weight()
1634 bfqq_weight = bfqq->entity.weight; in bfq_bfqq_higher_class_or_weight()
1637 if (bfqq->entity.parent) in bfq_bfqq_higher_class_or_weight()
1638 bfqq_weight = bfqq->entity.parent->weight; in bfq_bfqq_higher_class_or_weight()
1640 bfqq_weight = bfqq->entity.weight; in bfq_bfqq_higher_class_or_weight()
1651 struct bfq_queue *bfqq, in bfq_bfqq_handle_idle_busy_switch() argument
1658 idle_for_long_time = bfq_bfqq_idle_for_long_time(bfqd, bfqq), in bfq_bfqq_handle_idle_busy_switch()
1665 bfqq->ttime.last_end_request + in bfq_bfqq_handle_idle_busy_switch()
1676 in_burst = bfq_bfqq_in_large_burst(bfqq); in bfq_bfqq_handle_idle_busy_switch()
1678 !BFQQ_TOTALLY_SEEKY(bfqq) && in bfq_bfqq_handle_idle_busy_switch()
1680 time_is_before_jiffies(bfqq->soft_rt_next_start) && in bfq_bfqq_handle_idle_busy_switch()
1681 bfqq->dispatched == 0; in bfq_bfqq_handle_idle_busy_switch()
1684 (bfqq->wr_coeff > 1 || in bfq_bfqq_handle_idle_busy_switch()
1685 (bfq_bfqq_sync(bfqq) && in bfq_bfqq_handle_idle_busy_switch()
1686 bfqq->bic && (*interactive || soft_rt))); in bfq_bfqq_handle_idle_busy_switch()
1693 bfq_bfqq_update_budg_for_activation(bfqd, bfqq, in bfq_bfqq_handle_idle_busy_switch()
1709 if (likely(!bfq_bfqq_just_created(bfqq)) && in bfq_bfqq_handle_idle_busy_switch()
1712 bfqq->budget_timeout + in bfq_bfqq_handle_idle_busy_switch()
1714 hlist_del_init(&bfqq->burst_list_node); in bfq_bfqq_handle_idle_busy_switch()
1715 bfq_clear_bfqq_in_large_burst(bfqq); in bfq_bfqq_handle_idle_busy_switch()
1718 bfq_clear_bfqq_just_created(bfqq); in bfq_bfqq_handle_idle_busy_switch()
1721 if (!bfq_bfqq_IO_bound(bfqq)) { in bfq_bfqq_handle_idle_busy_switch()
1723 bfqq->requests_within_timer++; in bfq_bfqq_handle_idle_busy_switch()
1724 if (bfqq->requests_within_timer >= in bfq_bfqq_handle_idle_busy_switch()
1726 bfq_mark_bfqq_IO_bound(bfqq); in bfq_bfqq_handle_idle_busy_switch()
1728 bfqq->requests_within_timer = 0; in bfq_bfqq_handle_idle_busy_switch()
1732 if (unlikely(time_is_after_jiffies(bfqq->split_time))) in bfq_bfqq_handle_idle_busy_switch()
1734 bfqq->split_time = in bfq_bfqq_handle_idle_busy_switch()
1737 if (time_is_before_jiffies(bfqq->split_time + in bfq_bfqq_handle_idle_busy_switch()
1739 bfq_update_bfqq_wr_on_rq_arrival(bfqd, bfqq, in bfq_bfqq_handle_idle_busy_switch()
1746 if (old_wr_coeff != bfqq->wr_coeff) in bfq_bfqq_handle_idle_busy_switch()
1747 bfqq->entity.prio_changed = 1; in bfq_bfqq_handle_idle_busy_switch()
1751 bfqq->last_idle_bklogged = jiffies; in bfq_bfqq_handle_idle_busy_switch()
1752 bfqq->service_from_backlogged = 0; in bfq_bfqq_handle_idle_busy_switch()
1753 bfq_clear_bfqq_softrt_update(bfqq); in bfq_bfqq_handle_idle_busy_switch()
1755 bfq_add_bfqq_busy(bfqd, bfqq); in bfq_bfqq_handle_idle_busy_switch()
1791 bfqq->wr_coeff >= bfqd->in_service_queue->wr_coeff) || in bfq_bfqq_handle_idle_busy_switch()
1792 bfq_bfqq_higher_class_or_weight(bfqq, bfqd->in_service_queue)) && in bfq_bfqq_handle_idle_busy_switch()
1799 struct bfq_queue *bfqq) in bfq_reset_inject_limit() argument
1802 bfqq->last_serv_time_ns = 0; in bfq_reset_inject_limit()
1856 if (bfq_bfqq_has_short_ttime(bfqq)) in bfq_reset_inject_limit()
1857 bfqq->inject_limit = 0; in bfq_reset_inject_limit()
1859 bfqq->inject_limit = 1; in bfq_reset_inject_limit()
1861 bfqq->decrease_time_jif = jiffies; in bfq_reset_inject_limit()
1866 struct bfq_queue *bfqq = RQ_BFQQ(rq); in bfq_add_request() local
1867 struct bfq_data *bfqd = bfqq->bfqd; in bfq_add_request()
1869 unsigned int old_wr_coeff = bfqq->wr_coeff; in bfq_add_request()
1872 bfq_log_bfqq(bfqd, bfqq, "add_request %d", rq_is_sync(rq)); in bfq_add_request()
1873 bfqq->queued[rq_is_sync(rq)]++; in bfq_add_request()
1876 if (RB_EMPTY_ROOT(&bfqq->sort_list) && bfq_bfqq_sync(bfqq)) { in bfq_add_request()
1932 !bfq_bfqq_has_short_ttime(bfqq) && in bfq_add_request()
1935 if (bfqd->last_completed_rq_bfqq != bfqq && in bfq_add_request()
1937 bfqq->waker_bfqq) { in bfq_add_request()
1944 bfqq->waker_bfqq = bfqd->last_completed_rq_bfqq; in bfq_add_request()
1966 if (!hlist_unhashed(&bfqq->woken_list_node)) in bfq_add_request()
1967 hlist_del_init(&bfqq->woken_list_node); in bfq_add_request()
1968 hlist_add_head(&bfqq->woken_list_node, in bfq_add_request()
1971 bfq_clear_bfqq_has_waker(bfqq); in bfq_add_request()
1973 bfqq->waker_bfqq && in bfq_add_request()
1974 !bfq_bfqq_has_waker(bfqq)) { in bfq_add_request()
1979 bfq_mark_bfqq_has_waker(bfqq); in bfq_add_request()
1989 if (time_is_before_eq_jiffies(bfqq->decrease_time_jif + in bfq_add_request()
1991 bfq_reset_inject_limit(bfqd, bfqq); in bfq_add_request()
2018 if (bfqq == bfqd->in_service_queue && in bfq_add_request()
2020 (bfqq->last_serv_time_ns > 0 && in bfq_add_request()
2022 time_is_before_eq_jiffies(bfqq->decrease_time_jif + in bfq_add_request()
2050 elv_rb_add(&bfqq->sort_list, rq); in bfq_add_request()
2055 prev = bfqq->next_rq; in bfq_add_request()
2056 next_rq = bfq_choose_req(bfqd, bfqq->next_rq, rq, bfqd->last_position); in bfq_add_request()
2057 bfqq->next_rq = next_rq; in bfq_add_request()
2063 if (unlikely(!bfqd->nonrot_with_queueing && prev != bfqq->next_rq)) in bfq_add_request()
2064 bfq_pos_tree_add_move(bfqd, bfqq); in bfq_add_request()
2066 if (!bfq_bfqq_busy(bfqq)) /* switching to busy ... */ in bfq_add_request()
2067 bfq_bfqq_handle_idle_busy_switch(bfqd, bfqq, old_wr_coeff, in bfq_add_request()
2072 bfqq->last_wr_start_finish + in bfq_add_request()
2074 bfqq->wr_coeff = bfqd->bfq_wr_coeff; in bfq_add_request()
2075 bfqq->wr_cur_max_time = bfq_wr_duration(bfqd); in bfq_add_request()
2078 bfqq->entity.prio_changed = 1; in bfq_add_request()
2080 if (prev != bfqq->next_rq) in bfq_add_request()
2081 bfq_updated_next_req(bfqd, bfqq); in bfq_add_request()
2111 (old_wr_coeff == 1 || bfqq->wr_coeff == 1 || interactive)) in bfq_add_request()
2112 bfqq->last_wr_start_finish = jiffies; in bfq_add_request()
2119 struct bfq_queue *bfqq = bfqd->bio_bfqq; in bfq_find_rq_fmerge() local
2122 if (bfqq) in bfq_find_rq_fmerge()
2123 return elv_rb_find(&bfqq->sort_list, bio_end_sector(bio)); in bfq_find_rq_fmerge()
2155 struct bfq_queue *bfqq = RQ_BFQQ(rq); in bfq_remove_request() local
2156 struct bfq_data *bfqd = bfqq->bfqd; in bfq_remove_request()
2159 if (bfqq->next_rq == rq) { in bfq_remove_request()
2160 bfqq->next_rq = bfq_find_next_rq(bfqd, bfqq, rq); in bfq_remove_request()
2161 bfq_updated_next_req(bfqd, bfqq); in bfq_remove_request()
2166 bfqq->queued[sync]--; in bfq_remove_request()
2168 elv_rb_del(&bfqq->sort_list, rq); in bfq_remove_request()
2174 if (RB_EMPTY_ROOT(&bfqq->sort_list)) { in bfq_remove_request()
2175 bfqq->next_rq = NULL; in bfq_remove_request()
2177 if (bfq_bfqq_busy(bfqq) && bfqq != bfqd->in_service_queue) { in bfq_remove_request()
2178 bfq_del_bfqq_busy(bfqd, bfqq, false); in bfq_remove_request()
2192 bfqq->entity.budget = bfqq->entity.service = 0; in bfq_remove_request()
2198 if (bfqq->pos_root) { in bfq_remove_request()
2199 rb_erase(&bfqq->pos_node, bfqq->pos_root); in bfq_remove_request()
2200 bfqq->pos_root = NULL; in bfq_remove_request()
2205 bfq_pos_tree_add_move(bfqd, bfqq); in bfq_remove_request()
2209 bfqq->meta_pending--; in bfq_remove_request()
2271 struct bfq_queue *bfqq = bfq_init_rq(req); in bfq_request_merged() local
2275 if (!bfqq) in bfq_request_merged()
2278 bfqd = bfqq->bfqd; in bfq_request_merged()
2281 elv_rb_del(&bfqq->sort_list, req); in bfq_request_merged()
2282 elv_rb_add(&bfqq->sort_list, req); in bfq_request_merged()
2285 prev = bfqq->next_rq; in bfq_request_merged()
2286 next_rq = bfq_choose_req(bfqd, bfqq->next_rq, req, in bfq_request_merged()
2288 bfqq->next_rq = next_rq; in bfq_request_merged()
2294 if (prev != bfqq->next_rq) { in bfq_request_merged()
2295 bfq_updated_next_req(bfqd, bfqq); in bfq_request_merged()
2301 bfq_pos_tree_add_move(bfqd, bfqq); in bfq_request_merged()
2323 struct bfq_queue *bfqq = bfq_init_rq(rq), in bfq_requests_merged() local
2326 if (!bfqq) in bfq_requests_merged()
2338 if (bfqq == next_bfqq && in bfq_requests_merged()
2346 if (bfqq->next_rq == next) in bfq_requests_merged()
2347 bfqq->next_rq = rq; in bfq_requests_merged()
2349 bfqg_stats_update_io_merged(bfqq_group(bfqq), next->cmd_flags); in bfq_requests_merged()
2353 static void bfq_bfqq_end_wr(struct bfq_queue *bfqq) in bfq_bfqq_end_wr() argument
2355 if (bfq_bfqq_busy(bfqq)) in bfq_bfqq_end_wr()
2356 bfqq->bfqd->wr_busy_queues--; in bfq_bfqq_end_wr()
2357 bfqq->wr_coeff = 1; in bfq_bfqq_end_wr()
2358 bfqq->wr_cur_max_time = 0; in bfq_bfqq_end_wr()
2359 bfqq->last_wr_start_finish = jiffies; in bfq_bfqq_end_wr()
2364 bfqq->entity.prio_changed = 1; in bfq_bfqq_end_wr()
2382 struct bfq_queue *bfqq; in bfq_end_wr() local
2386 list_for_each_entry(bfqq, &bfqd->active_list, bfqq_list) in bfq_end_wr()
2387 bfq_bfqq_end_wr(bfqq); in bfq_end_wr()
2388 list_for_each_entry(bfqq, &bfqd->idle_list, bfqq_list) in bfq_end_wr()
2389 bfq_bfqq_end_wr(bfqq); in bfq_end_wr()
2411 struct bfq_queue *bfqq, in bfqq_find_close()
2414 struct rb_root *root = &bfq_bfqq_to_bfqg(bfqq)->rq_pos_tree; in bfqq_find_close()
2456 struct bfq_queue *bfqq; in bfq_find_close_cooperator() local
2465 bfqq = bfqq_find_close(bfqd, cur_bfqq, sector); in bfq_find_close_cooperator()
2466 if (!bfqq || bfqq == cur_bfqq) in bfq_find_close_cooperator()
2469 return bfqq; in bfq_find_close_cooperator()
2473 bfq_setup_merge(struct bfq_queue *bfqq, struct bfq_queue *new_bfqq) in bfq_setup_merge() argument
2489 if (__bfqq == bfqq) in bfq_setup_merge()
2494 process_refs = bfqq_process_refs(bfqq); in bfq_setup_merge()
2503 bfq_log_bfqq(bfqq->bfqd, bfqq, "scheduling merge with queue %d", in bfq_setup_merge()
2526 bfqq->new_bfqq = new_bfqq; in bfq_setup_merge()
2531 static bool bfq_may_be_close_cooperator(struct bfq_queue *bfqq, in bfq_may_be_close_cooperator() argument
2537 if (bfq_class_idle(bfqq) || bfq_class_idle(new_bfqq) || in bfq_may_be_close_cooperator()
2538 (bfqq->ioprio_class != new_bfqq->ioprio_class)) in bfq_may_be_close_cooperator()
2546 if (BFQQ_SEEKY(bfqq) || BFQQ_SEEKY(new_bfqq)) in bfq_may_be_close_cooperator()
2554 if (!bfq_bfqq_sync(bfqq) || !bfq_bfqq_sync(new_bfqq)) in bfq_may_be_close_cooperator()
2581 bfq_setup_cooperator(struct bfq_data *bfqd, struct bfq_queue *bfqq, in bfq_setup_cooperator() argument
2637 if (bfq_too_late_for_merging(bfqq)) in bfq_setup_cooperator()
2640 if (bfqq->new_bfqq) in bfq_setup_cooperator()
2641 return bfqq->new_bfqq; in bfq_setup_cooperator()
2643 if (!io_struct || unlikely(bfqq == &bfqd->oom_bfqq)) in bfq_setup_cooperator()
2652 if (in_service_bfqq && in_service_bfqq != bfqq && in bfq_setup_cooperator()
2656 bfqq->entity.parent == in_service_bfqq->entity.parent && in bfq_setup_cooperator()
2657 bfq_may_be_close_cooperator(bfqq, in_service_bfqq)) { in bfq_setup_cooperator()
2658 new_bfqq = bfq_setup_merge(bfqq, in_service_bfqq); in bfq_setup_cooperator()
2667 new_bfqq = bfq_find_close_cooperator(bfqd, bfqq, in bfq_setup_cooperator()
2671 bfq_may_be_close_cooperator(bfqq, new_bfqq)) in bfq_setup_cooperator()
2672 return bfq_setup_merge(bfqq, new_bfqq); in bfq_setup_cooperator()
2677 static void bfq_bfqq_save_state(struct bfq_queue *bfqq) in bfq_bfqq_save_state() argument
2679 struct bfq_io_cq *bic = bfqq->bic; in bfq_bfqq_save_state()
2689 bic->saved_weight = bfqq->entity.orig_weight; in bfq_bfqq_save_state()
2690 bic->saved_ttime = bfqq->ttime; in bfq_bfqq_save_state()
2691 bic->saved_has_short_ttime = bfq_bfqq_has_short_ttime(bfqq); in bfq_bfqq_save_state()
2692 bic->saved_IO_bound = bfq_bfqq_IO_bound(bfqq); in bfq_bfqq_save_state()
2693 bic->saved_in_large_burst = bfq_bfqq_in_large_burst(bfqq); in bfq_bfqq_save_state()
2694 bic->was_in_burst_list = !hlist_unhashed(&bfqq->burst_list_node); in bfq_bfqq_save_state()
2695 if (unlikely(bfq_bfqq_just_created(bfqq) && in bfq_bfqq_save_state()
2696 !bfq_bfqq_in_large_burst(bfqq) && in bfq_bfqq_save_state()
2697 bfqq->bfqd->low_latency)) { in bfq_bfqq_save_state()
2707 bic->saved_wr_coeff = bfqq->bfqd->bfq_wr_coeff; in bfq_bfqq_save_state()
2709 bic->saved_wr_cur_max_time = bfq_wr_duration(bfqq->bfqd); in bfq_bfqq_save_state()
2712 bic->saved_wr_coeff = bfqq->wr_coeff; in bfq_bfqq_save_state()
2714 bfqq->wr_start_at_switch_to_srt; in bfq_bfqq_save_state()
2715 bic->saved_last_wr_start_finish = bfqq->last_wr_start_finish; in bfq_bfqq_save_state()
2716 bic->saved_wr_cur_max_time = bfqq->wr_cur_max_time; in bfq_bfqq_save_state()
2720 void bfq_release_process_ref(struct bfq_data *bfqd, struct bfq_queue *bfqq) in bfq_release_process_ref() argument
2733 if (bfq_bfqq_busy(bfqq) && RB_EMPTY_ROOT(&bfqq->sort_list) && in bfq_release_process_ref()
2734 bfqq != bfqd->in_service_queue) in bfq_release_process_ref()
2735 bfq_del_bfqq_busy(bfqd, bfqq, false); in bfq_release_process_ref()
2737 bfq_put_queue(bfqq); in bfq_release_process_ref()
2742 struct bfq_queue *bfqq, struct bfq_queue *new_bfqq) in bfq_merge_bfqqs() argument
2744 bfq_log_bfqq(bfqd, bfqq, "merging with queue %lu", in bfq_merge_bfqqs()
2747 bfq_bfqq_save_state(bfqq); in bfq_merge_bfqqs()
2749 if (bfq_bfqq_IO_bound(bfqq)) in bfq_merge_bfqqs()
2751 bfq_clear_bfqq_IO_bound(bfqq); in bfq_merge_bfqqs()
2762 if (new_bfqq->wr_coeff == 1 && bfqq->wr_coeff > 1) { in bfq_merge_bfqqs()
2763 new_bfqq->wr_coeff = bfqq->wr_coeff; in bfq_merge_bfqqs()
2764 new_bfqq->wr_cur_max_time = bfqq->wr_cur_max_time; in bfq_merge_bfqqs()
2765 new_bfqq->last_wr_start_finish = bfqq->last_wr_start_finish; in bfq_merge_bfqqs()
2767 bfqq->wr_start_at_switch_to_srt; in bfq_merge_bfqqs()
2773 if (bfqq->wr_coeff > 1) { /* bfqq has given its wr to new_bfqq */ in bfq_merge_bfqqs()
2774 bfqq->wr_coeff = 1; in bfq_merge_bfqqs()
2775 bfqq->entity.prio_changed = 1; in bfq_merge_bfqqs()
2776 if (bfq_bfqq_busy(bfqq)) in bfq_merge_bfqqs()
2809 bfqq->bic = NULL; in bfq_merge_bfqqs()
2810 bfq_release_process_ref(bfqd, bfqq); in bfq_merge_bfqqs()
2818 struct bfq_queue *bfqq = bfqd->bio_bfqq, *new_bfqq; in bfq_allow_bio_merge() local
2830 if (!bfqq) in bfq_allow_bio_merge()
2837 new_bfqq = bfq_setup_cooperator(bfqd, bfqq, bio, false); in bfq_allow_bio_merge()
2846 bfq_merge_bfqqs(bfqd, bfqd->bio_bic, bfqq, in bfq_allow_bio_merge()
2853 bfqq = new_bfqq; in bfq_allow_bio_merge()
2861 bfqd->bio_bfqq = bfqq; in bfq_allow_bio_merge()
2864 return bfqq == RQ_BFQQ(rq); in bfq_allow_bio_merge()
2874 struct bfq_queue *bfqq) in bfq_set_budget_timeout() argument
2878 if (bfqq->wr_cur_max_time == bfqd->bfq_wr_rt_max_time) in bfq_set_budget_timeout()
2881 timeout_coeff = bfqq->entity.weight / bfqq->entity.orig_weight; in bfq_set_budget_timeout()
2885 bfqq->budget_timeout = jiffies + in bfq_set_budget_timeout()
2890 struct bfq_queue *bfqq) in __bfq_set_in_service_queue() argument
2892 if (bfqq) { in __bfq_set_in_service_queue()
2893 bfq_clear_bfqq_fifo_expire(bfqq); in __bfq_set_in_service_queue()
2897 if (time_is_before_jiffies(bfqq->last_wr_start_finish) && in __bfq_set_in_service_queue()
2898 bfqq->wr_coeff > 1 && in __bfq_set_in_service_queue()
2899 bfqq->wr_cur_max_time == bfqd->bfq_wr_rt_max_time && in __bfq_set_in_service_queue()
2900 time_is_before_jiffies(bfqq->budget_timeout)) { in __bfq_set_in_service_queue()
2925 if (time_after(bfqq->budget_timeout, in __bfq_set_in_service_queue()
2926 bfqq->last_wr_start_finish)) in __bfq_set_in_service_queue()
2927 bfqq->last_wr_start_finish += in __bfq_set_in_service_queue()
2928 jiffies - bfqq->budget_timeout; in __bfq_set_in_service_queue()
2930 bfqq->last_wr_start_finish = jiffies; in __bfq_set_in_service_queue()
2933 bfq_set_budget_timeout(bfqd, bfqq); in __bfq_set_in_service_queue()
2934 bfq_log_bfqq(bfqd, bfqq, in __bfq_set_in_service_queue()
2936 bfqq->entity.budget); in __bfq_set_in_service_queue()
2939 bfqd->in_service_queue = bfqq; in __bfq_set_in_service_queue()
2947 struct bfq_queue *bfqq = bfq_get_next_queue(bfqd); in bfq_set_in_service_queue() local
2949 __bfq_set_in_service_queue(bfqd, bfqq); in bfq_set_in_service_queue()
2950 return bfqq; in bfq_set_in_service_queue()
2955 struct bfq_queue *bfqq = bfqd->in_service_queue; in bfq_arm_slice_timer() local
2958 bfq_mark_bfqq_wait_request(bfqq); in bfq_arm_slice_timer()
2976 if (BFQQ_SEEKY(bfqq) && bfqq->wr_coeff == 1 && in bfq_arm_slice_timer()
2977 !bfq_asymmetric_scenario(bfqd, bfqq)) in bfq_arm_slice_timer()
2979 else if (bfqq->wr_coeff > 1) in bfq_arm_slice_timer()
2987 bfqg_stats_set_start_idle_time(bfqq_group(bfqq)); in bfq_arm_slice_timer()
3240 struct bfq_queue *bfqq = RQ_BFQQ(rq); in bfq_dispatch_remove() local
3254 bfqq->dispatched++; in bfq_dispatch_remove()
3447 struct bfq_queue *bfqq) in idling_needed_for_service_guarantees() argument
3450 if (unlikely(!bfqq_process_refs(bfqq))) in idling_needed_for_service_guarantees()
3453 return (bfqq->wr_coeff > 1 && in idling_needed_for_service_guarantees()
3457 bfqq->dispatched + 4)) || in idling_needed_for_service_guarantees()
3458 bfq_asymmetric_scenario(bfqd, bfqq); in idling_needed_for_service_guarantees()
3461 static bool __bfq_bfqq_expire(struct bfq_data *bfqd, struct bfq_queue *bfqq, in __bfq_bfqq_expire() argument
3470 if (bfq_bfqq_coop(bfqq) && BFQQ_SEEKY(bfqq)) in __bfq_bfqq_expire()
3471 bfq_mark_bfqq_split_coop(bfqq); in __bfq_bfqq_expire()
3486 if (RB_EMPTY_ROOT(&bfqq->sort_list) && in __bfq_bfqq_expire()
3488 idling_needed_for_service_guarantees(bfqd, bfqq))) { in __bfq_bfqq_expire()
3489 if (bfqq->dispatched == 0) in __bfq_bfqq_expire()
3496 bfqq->budget_timeout = jiffies; in __bfq_bfqq_expire()
3498 bfq_del_bfqq_busy(bfqd, bfqq, true); in __bfq_bfqq_expire()
3500 bfq_requeue_bfqq(bfqd, bfqq, true); in __bfq_bfqq_expire()
3506 !RB_EMPTY_ROOT(&bfqq->sort_list))) in __bfq_bfqq_expire()
3507 bfq_pos_tree_add_move(bfqd, bfqq); in __bfq_bfqq_expire()
3530 struct bfq_queue *bfqq, in __bfq_bfqq_recalc_budget() argument
3538 if (bfqq->wr_coeff == 1) in __bfq_bfqq_recalc_budget()
3539 budget = bfqq->max_budget; in __bfq_bfqq_recalc_budget()
3548 bfq_log_bfqq(bfqd, bfqq, "recalc_budg: last budg %d, budg left %d", in __bfq_bfqq_recalc_budget()
3549 bfqq->entity.budget, bfq_bfqq_budget_left(bfqq)); in __bfq_bfqq_recalc_budget()
3550 bfq_log_bfqq(bfqd, bfqq, "recalc_budg: last max_budg %d, min budg %d", in __bfq_bfqq_recalc_budget()
3552 bfq_log_bfqq(bfqd, bfqq, "recalc_budg: sync %d, seeky %d", in __bfq_bfqq_recalc_budget()
3553 bfq_bfqq_sync(bfqq), BFQQ_SEEKY(bfqd->in_service_queue)); in __bfq_bfqq_recalc_budget()
3555 if (bfq_bfqq_sync(bfqq) && bfqq->wr_coeff == 1) { in __bfq_bfqq_recalc_budget()
3586 if (bfqq->dispatched > 0) /* still outstanding reqs */ in __bfq_bfqq_recalc_budget()
3649 budget = max_t(int, bfqq->entity.service, min_budget); in __bfq_bfqq_recalc_budget()
3654 } else if (!bfq_bfqq_sync(bfqq)) { in __bfq_bfqq_recalc_budget()
3664 bfqq->max_budget = budget; in __bfq_bfqq_recalc_budget()
3668 bfqq->max_budget = min(bfqq->max_budget, bfqd->bfq_max_budget); in __bfq_bfqq_recalc_budget()
3680 next_rq = bfqq->next_rq; in __bfq_bfqq_recalc_budget()
3682 bfqq->entity.budget = max_t(unsigned long, bfqq->max_budget, in __bfq_bfqq_recalc_budget()
3683 bfq_serv_to_charge(next_rq, bfqq)); in __bfq_bfqq_recalc_budget()
3685 bfq_log_bfqq(bfqd, bfqq, "head sect: %u, new budget %d", in __bfq_bfqq_recalc_budget()
3687 bfqq->entity.budget); in __bfq_bfqq_recalc_budget()
3721 static bool bfq_bfqq_is_slow(struct bfq_data *bfqd, struct bfq_queue *bfqq, in bfq_bfqq_is_slow() argument
3727 bool slow = BFQQ_SEEKY(bfqq); /* if delta too short, use seekyness */ in bfq_bfqq_is_slow()
3729 if (!bfq_bfqq_sync(bfqq)) in bfq_bfqq_is_slow()
3770 slow = bfqq->entity.service < bfqd->bfq_max_budget / 2; in bfq_bfqq_is_slow()
3773 bfq_log_bfqq(bfqd, bfqq, "bfq_bfqq_is_slow: slow %d", slow); in bfq_bfqq_is_slow()
3872 struct bfq_queue *bfqq) in bfq_bfqq_softrt_next_start() argument
3874 return max3(bfqq->soft_rt_next_start, in bfq_bfqq_softrt_next_start()
3875 bfqq->last_idle_bklogged + in bfq_bfqq_softrt_next_start()
3876 HZ * bfqq->service_from_backlogged / in bfq_bfqq_softrt_next_start()
3878 jiffies + nsecs_to_jiffies(bfqq->bfqd->bfq_slice_idle) + 4); in bfq_bfqq_softrt_next_start()
3908 struct bfq_queue *bfqq, in bfq_bfqq_expire() argument
3914 struct bfq_entity *entity = &bfqq->entity; in bfq_bfqq_expire()
3919 slow = bfq_bfqq_is_slow(bfqd, bfqq, compensate, reason, &delta); in bfq_bfqq_expire()
3936 if (bfqq->wr_coeff == 1 && in bfq_bfqq_expire()
3939 bfq_bfqq_budget_left(bfqq) >= entity->budget / 3))) in bfq_bfqq_expire()
3940 bfq_bfqq_charge_time(bfqd, bfqq, delta); in bfq_bfqq_expire()
3944 bfq_clear_bfqq_IO_bound(bfqq); in bfq_bfqq_expire()
3946 if (bfqd->low_latency && bfqq->wr_coeff == 1) in bfq_bfqq_expire()
3947 bfqq->last_wr_start_finish = jiffies; in bfq_bfqq_expire()
3950 RB_EMPTY_ROOT(&bfqq->sort_list)) { in bfq_bfqq_expire()
3977 if (bfqq->dispatched == 0 && in bfq_bfqq_expire()
3978 bfqq->wr_coeff != bfqd->bfq_wr_coeff) in bfq_bfqq_expire()
3979 bfqq->soft_rt_next_start = in bfq_bfqq_expire()
3980 bfq_bfqq_softrt_next_start(bfqd, bfqq); in bfq_bfqq_expire()
3981 else if (bfqq->dispatched > 0) { in bfq_bfqq_expire()
3986 bfq_mark_bfqq_softrt_update(bfqq); in bfq_bfqq_expire()
3990 bfq_log_bfqq(bfqd, bfqq, in bfq_bfqq_expire()
3992 slow, bfqq->dispatched, bfq_bfqq_has_short_ttime(bfqq)); in bfq_bfqq_expire()
4006 __bfq_bfqq_recalc_budget(bfqd, bfqq, reason); in bfq_bfqq_expire()
4007 if (__bfq_bfqq_expire(bfqd, bfqq, reason)) in bfq_bfqq_expire()
4012 if (!bfq_bfqq_busy(bfqq) && in bfq_bfqq_expire()
4015 bfq_mark_bfqq_non_blocking_wait_rq(bfqq); in bfq_bfqq_expire()
4051 static bool bfq_bfqq_budget_timeout(struct bfq_queue *bfqq) in bfq_bfqq_budget_timeout() argument
4053 return time_is_before_eq_jiffies(bfqq->budget_timeout); in bfq_bfqq_budget_timeout()
4064 static bool bfq_may_expire_for_budg_timeout(struct bfq_queue *bfqq) in bfq_may_expire_for_budg_timeout() argument
4066 bfq_log_bfqq(bfqq->bfqd, bfqq, in bfq_may_expire_for_budg_timeout()
4068 bfq_bfqq_wait_request(bfqq), in bfq_may_expire_for_budg_timeout()
4069 bfq_bfqq_budget_left(bfqq) >= bfqq->entity.budget / 3, in bfq_may_expire_for_budg_timeout()
4070 bfq_bfqq_budget_timeout(bfqq)); in bfq_may_expire_for_budg_timeout()
4072 return (!bfq_bfqq_wait_request(bfqq) || in bfq_may_expire_for_budg_timeout()
4073 bfq_bfqq_budget_left(bfqq) >= bfqq->entity.budget / 3) in bfq_may_expire_for_budg_timeout()
4075 bfq_bfqq_budget_timeout(bfqq); in bfq_may_expire_for_budg_timeout()
4079 struct bfq_queue *bfqq) in idling_boosts_thr_without_issues() argument
4087 if (unlikely(!bfqq_process_refs(bfqq))) in idling_boosts_thr_without_issues()
4090 bfqq_sequential_and_IO_bound = !BFQQ_SEEKY(bfqq) && in idling_boosts_thr_without_issues()
4091 bfq_bfqq_IO_bound(bfqq) && bfq_bfqq_has_short_ttime(bfqq); in idling_boosts_thr_without_issues()
4178 static bool bfq_better_to_idle(struct bfq_queue *bfqq) in bfq_better_to_idle() argument
4180 struct bfq_data *bfqd = bfqq->bfqd; in bfq_better_to_idle()
4184 if (unlikely(!bfqq_process_refs(bfqq))) in bfq_better_to_idle()
4198 if (bfqd->bfq_slice_idle == 0 || !bfq_bfqq_sync(bfqq) || in bfq_better_to_idle()
4199 bfq_class_idle(bfqq)) in bfq_better_to_idle()
4203 idling_boosts_thr_without_issues(bfqd, bfqq); in bfq_better_to_idle()
4206 idling_needed_for_service_guarantees(bfqd, bfqq); in bfq_better_to_idle()
4229 static bool bfq_bfqq_must_idle(struct bfq_queue *bfqq) in bfq_bfqq_must_idle() argument
4231 return RB_EMPTY_ROOT(&bfqq->sort_list) && bfq_better_to_idle(bfqq); in bfq_bfqq_must_idle()
4244 struct bfq_queue *bfqq, *in_serv_bfqq = bfqd->in_service_queue; in bfq_choose_bfqq_for_injection() local
4292 list_for_each_entry(bfqq, &bfqd->active_list, bfqq_list) in bfq_choose_bfqq_for_injection()
4293 if (!RB_EMPTY_ROOT(&bfqq->sort_list) && in bfq_choose_bfqq_for_injection()
4294 (in_serv_always_inject || bfqq->wr_coeff > 1) && in bfq_choose_bfqq_for_injection()
4295 bfq_serv_to_charge(bfqq->next_rq, bfqq) <= in bfq_choose_bfqq_for_injection()
4296 bfq_bfqq_budget_left(bfqq)) { in bfq_choose_bfqq_for_injection()
4315 blk_rq_sectors(bfqq->next_rq) >= in bfq_choose_bfqq_for_injection()
4323 return bfqq; in bfq_choose_bfqq_for_injection()
4336 struct bfq_queue *bfqq; in bfq_select_queue() local
4340 bfqq = bfqd->in_service_queue; in bfq_select_queue()
4341 if (!bfqq) in bfq_select_queue()
4344 bfq_log_bfqq(bfqd, bfqq, "select_queue: already in-service queue"); in bfq_select_queue()
4353 if (bfq_may_expire_for_budg_timeout(bfqq) && in bfq_select_queue()
4354 !bfq_bfqq_must_idle(bfqq)) in bfq_select_queue()
4364 next_rq = bfqq->next_rq; in bfq_select_queue()
4370 if (bfq_serv_to_charge(next_rq, bfqq) > in bfq_select_queue()
4371 bfq_bfqq_budget_left(bfqq)) { in bfq_select_queue()
4386 if (bfq_bfqq_wait_request(bfqq)) { in bfq_select_queue()
4400 bfq_clear_bfqq_wait_request(bfqq); in bfq_select_queue()
4415 if (bfq_bfqq_wait_request(bfqq) || in bfq_select_queue()
4416 (bfqq->dispatched != 0 && bfq_better_to_idle(bfqq))) { in bfq_select_queue()
4418 bfqq->bic && bfqq->bic->bfqq[0] && in bfq_select_queue()
4419 bfq_bfqq_busy(bfqq->bic->bfqq[0]) && in bfq_select_queue()
4420 bfqq->bic->bfqq[0]->next_rq ? in bfq_select_queue()
4421 bfqq->bic->bfqq[0] : NULL; in bfq_select_queue()
4496 icq_to_bic(async_bfqq->next_rq->elv.icq) == bfqq->bic && in bfq_select_queue()
4499 bfqq = bfqq->bic->bfqq[0]; in bfq_select_queue()
4500 else if (bfq_bfqq_has_waker(bfqq) && in bfq_select_queue()
4501 bfq_bfqq_busy(bfqq->waker_bfqq) && in bfq_select_queue()
4502 bfqq->next_rq && in bfq_select_queue()
4503 bfq_serv_to_charge(bfqq->waker_bfqq->next_rq, in bfq_select_queue()
4504 bfqq->waker_bfqq) <= in bfq_select_queue()
4505 bfq_bfqq_budget_left(bfqq->waker_bfqq) in bfq_select_queue()
4507 bfqq = bfqq->waker_bfqq; in bfq_select_queue()
4508 else if (!idling_boosts_thr_without_issues(bfqd, bfqq) && in bfq_select_queue()
4509 (bfqq->wr_coeff == 1 || bfqd->wr_busy_queues > 1 || in bfq_select_queue()
4510 !bfq_bfqq_has_short_ttime(bfqq))) in bfq_select_queue()
4511 bfqq = bfq_choose_bfqq_for_injection(bfqd); in bfq_select_queue()
4513 bfqq = NULL; in bfq_select_queue()
4520 bfq_bfqq_expire(bfqd, bfqq, false, reason); in bfq_select_queue()
4522 bfqq = bfq_set_in_service_queue(bfqd); in bfq_select_queue()
4523 if (bfqq) { in bfq_select_queue()
4524 bfq_log_bfqq(bfqd, bfqq, "select_queue: checking new queue"); in bfq_select_queue()
4528 if (bfqq) in bfq_select_queue()
4529 bfq_log_bfqq(bfqd, bfqq, "select_queue: returned this queue"); in bfq_select_queue()
4533 return bfqq; in bfq_select_queue()
4536 static void bfq_update_wr_data(struct bfq_data *bfqd, struct bfq_queue *bfqq) in bfq_update_wr_data() argument
4538 struct bfq_entity *entity = &bfqq->entity; in bfq_update_wr_data()
4540 if (bfqq->wr_coeff > 1) { /* queue is being weight-raised */ in bfq_update_wr_data()
4541 bfq_log_bfqq(bfqd, bfqq, in bfq_update_wr_data()
4543 jiffies_to_msecs(jiffies - bfqq->last_wr_start_finish), in bfq_update_wr_data()
4544 jiffies_to_msecs(bfqq->wr_cur_max_time), in bfq_update_wr_data()
4545 bfqq->wr_coeff, in bfq_update_wr_data()
4546 bfqq->entity.weight, bfqq->entity.orig_weight); in bfq_update_wr_data()
4549 bfq_log_bfqq(bfqd, bfqq, "WARN: pending prio change"); in bfq_update_wr_data()
4556 if (bfq_bfqq_in_large_burst(bfqq)) in bfq_update_wr_data()
4557 bfq_bfqq_end_wr(bfqq); in bfq_update_wr_data()
4558 else if (time_is_before_jiffies(bfqq->last_wr_start_finish + in bfq_update_wr_data()
4559 bfqq->wr_cur_max_time)) { in bfq_update_wr_data()
4560 if (bfqq->wr_cur_max_time != bfqd->bfq_wr_rt_max_time || in bfq_update_wr_data()
4561 time_is_before_jiffies(bfqq->wr_start_at_switch_to_srt + in bfq_update_wr_data()
4563 bfq_bfqq_end_wr(bfqq); in bfq_update_wr_data()
4565 switch_back_to_interactive_wr(bfqq, bfqd); in bfq_update_wr_data()
4566 bfqq->entity.prio_changed = 1; in bfq_update_wr_data()
4569 if (bfqq->wr_coeff > 1 && in bfq_update_wr_data()
4570 bfqq->wr_cur_max_time != bfqd->bfq_wr_rt_max_time && in bfq_update_wr_data()
4571 bfqq->service_from_wr > max_service_from_wr) { in bfq_update_wr_data()
4573 bfq_bfqq_end_wr(bfqq); in bfq_update_wr_data()
4584 if ((entity->weight > entity->orig_weight) != (bfqq->wr_coeff > 1)) in bfq_update_wr_data()
4593 struct bfq_queue *bfqq) in bfq_dispatch_rq_from_bfqq() argument
4595 struct request *rq = bfqq->next_rq; in bfq_dispatch_rq_from_bfqq()
4598 service_to_charge = bfq_serv_to_charge(rq, bfqq); in bfq_dispatch_rq_from_bfqq()
4600 bfq_bfqq_served(bfqq, service_to_charge); in bfq_dispatch_rq_from_bfqq()
4602 if (bfqq == bfqd->in_service_queue && bfqd->wait_dispatch) { in bfq_dispatch_rq_from_bfqq()
4609 if (bfqq != bfqd->in_service_queue) in bfq_dispatch_rq_from_bfqq()
4623 bfq_update_wr_data(bfqd, bfqq); in bfq_dispatch_rq_from_bfqq()
4630 if (!(bfq_tot_busy_queues(bfqd) > 1 && bfq_class_idle(bfqq))) in bfq_dispatch_rq_from_bfqq()
4633 bfq_bfqq_expire(bfqd, bfqq, false, BFQQE_BUDGET_EXHAUSTED); in bfq_dispatch_rq_from_bfqq()
4658 struct bfq_queue *bfqq = NULL; in __bfq_dispatch_request() local
4665 bfqq = RQ_BFQQ(rq); in __bfq_dispatch_request()
4667 if (bfqq) { in __bfq_dispatch_request()
4674 bfqq->dispatched++; in __bfq_dispatch_request()
4726 bfqq = bfq_select_queue(bfqd); in __bfq_dispatch_request()
4727 if (!bfqq) in __bfq_dispatch_request()
4730 rq = bfq_dispatch_rq_from_bfqq(bfqd, bfqq); in __bfq_dispatch_request()
4748 struct bfq_queue *bfqq = rq ? RQ_BFQQ(rq) : NULL; in bfq_update_dispatch_stats() local
4750 if (!idle_timer_disabled && !bfqq) in bfq_update_dispatch_stats()
4778 if (bfqq) { in bfq_update_dispatch_stats()
4779 struct bfq_group *bfqg = bfqq_group(bfqq); in bfq_update_dispatch_stats()
4826 void bfq_put_queue(struct bfq_queue *bfqq) in bfq_put_queue() argument
4830 struct bfq_group *bfqg = bfqq_group(bfqq); in bfq_put_queue()
4832 if (bfqq->bfqd) in bfq_put_queue()
4833 bfq_log_bfqq(bfqq->bfqd, bfqq, "put_queue: %p %d", in bfq_put_queue()
4834 bfqq, bfqq->ref); in bfq_put_queue()
4836 bfqq->ref--; in bfq_put_queue()
4837 if (bfqq->ref) in bfq_put_queue()
4840 if (!hlist_unhashed(&bfqq->burst_list_node)) { in bfq_put_queue()
4841 hlist_del_init(&bfqq->burst_list_node); in bfq_put_queue()
4868 if (bfqq->bic && bfqq->bfqd->burst_size > 0) in bfq_put_queue()
4869 bfqq->bfqd->burst_size--; in bfq_put_queue()
4888 if (!hlist_unhashed(&bfqq->woken_list_node)) in bfq_put_queue()
4889 hlist_del_init(&bfqq->woken_list_node); in bfq_put_queue()
4892 hlist_for_each_entry_safe(item, n, &bfqq->woken_list, in bfq_put_queue()
4899 if (bfqq->bfqd && bfqq->bfqd->last_completed_rq_bfqq == bfqq) in bfq_put_queue()
4900 bfqq->bfqd->last_completed_rq_bfqq = NULL; in bfq_put_queue()
4902 kmem_cache_free(bfq_pool, bfqq); in bfq_put_queue()
4906 static void bfq_put_cooperator(struct bfq_queue *bfqq) in bfq_put_cooperator() argument
4915 __bfqq = bfqq->new_bfqq; in bfq_put_cooperator()
4917 if (__bfqq == bfqq) in bfq_put_cooperator()
4925 static void bfq_exit_bfqq(struct bfq_data *bfqd, struct bfq_queue *bfqq) in bfq_exit_bfqq() argument
4927 if (bfqq == bfqd->in_service_queue) { in bfq_exit_bfqq()
4928 __bfq_bfqq_expire(bfqd, bfqq, BFQQE_BUDGET_TIMEOUT); in bfq_exit_bfqq()
4932 bfq_log_bfqq(bfqd, bfqq, "exit_bfqq: %p, %d", bfqq, bfqq->ref); in bfq_exit_bfqq()
4934 bfq_put_cooperator(bfqq); in bfq_exit_bfqq()
4936 bfq_release_process_ref(bfqd, bfqq); in bfq_exit_bfqq()
4941 struct bfq_queue *bfqq = bic_to_bfqq(bic, is_sync); in bfq_exit_icq_bfqq() local
4944 if (bfqq) in bfq_exit_icq_bfqq()
4945 bfqd = bfqq->bfqd; /* NULL if scheduler already exited */ in bfq_exit_icq_bfqq()
4947 if (bfqq && bfqd) { in bfq_exit_icq_bfqq()
4951 bfqq->bic = NULL; in bfq_exit_icq_bfqq()
4952 bfq_exit_bfqq(bfqd, bfqq); in bfq_exit_icq_bfqq()
4971 bfq_set_next_ioprio_data(struct bfq_queue *bfqq, struct bfq_io_cq *bic) in bfq_set_next_ioprio_data() argument
4975 struct bfq_data *bfqd = bfqq->bfqd; in bfq_set_next_ioprio_data()
4984 bdi_dev_name(bfqq->bfqd->queue->backing_dev_info), in bfq_set_next_ioprio_data()
4991 bfqq->new_ioprio = task_nice_ioprio(tsk); in bfq_set_next_ioprio_data()
4992 bfqq->new_ioprio_class = task_nice_ioclass(tsk); in bfq_set_next_ioprio_data()
4995 bfqq->new_ioprio = IOPRIO_PRIO_DATA(bic->ioprio); in bfq_set_next_ioprio_data()
4996 bfqq->new_ioprio_class = IOPRIO_CLASS_RT; in bfq_set_next_ioprio_data()
4999 bfqq->new_ioprio = IOPRIO_PRIO_DATA(bic->ioprio); in bfq_set_next_ioprio_data()
5000 bfqq->new_ioprio_class = IOPRIO_CLASS_BE; in bfq_set_next_ioprio_data()
5003 bfqq->new_ioprio_class = IOPRIO_CLASS_IDLE; in bfq_set_next_ioprio_data()
5004 bfqq->new_ioprio = 7; in bfq_set_next_ioprio_data()
5008 if (bfqq->new_ioprio >= IOPRIO_BE_NR) { in bfq_set_next_ioprio_data()
5010 bfqq->new_ioprio); in bfq_set_next_ioprio_data()
5011 bfqq->new_ioprio = IOPRIO_BE_NR; in bfq_set_next_ioprio_data()
5014 bfqq->entity.new_weight = bfq_ioprio_to_weight(bfqq->new_ioprio); in bfq_set_next_ioprio_data()
5015 bfqq->entity.prio_changed = 1; in bfq_set_next_ioprio_data()
5025 struct bfq_queue *bfqq; in bfq_check_ioprio_change() local
5037 bfqq = bic_to_bfqq(bic, false); in bfq_check_ioprio_change()
5038 if (bfqq) { in bfq_check_ioprio_change()
5039 bfq_release_process_ref(bfqd, bfqq); in bfq_check_ioprio_change()
5040 bfqq = bfq_get_queue(bfqd, bio, BLK_RW_ASYNC, bic); in bfq_check_ioprio_change()
5041 bic_set_bfqq(bic, bfqq, false); in bfq_check_ioprio_change()
5044 bfqq = bic_to_bfqq(bic, true); in bfq_check_ioprio_change()
5045 if (bfqq) in bfq_check_ioprio_change()
5046 bfq_set_next_ioprio_data(bfqq, bic); in bfq_check_ioprio_change()
5049 static void bfq_init_bfqq(struct bfq_data *bfqd, struct bfq_queue *bfqq, in bfq_init_bfqq() argument
5052 RB_CLEAR_NODE(&bfqq->entity.rb_node); in bfq_init_bfqq()
5053 INIT_LIST_HEAD(&bfqq->fifo); in bfq_init_bfqq()
5054 INIT_HLIST_NODE(&bfqq->burst_list_node); in bfq_init_bfqq()
5055 INIT_HLIST_NODE(&bfqq->woken_list_node); in bfq_init_bfqq()
5056 INIT_HLIST_HEAD(&bfqq->woken_list); in bfq_init_bfqq()
5058 bfqq->ref = 0; in bfq_init_bfqq()
5059 bfqq->bfqd = bfqd; in bfq_init_bfqq()
5062 bfq_set_next_ioprio_data(bfqq, bic); in bfq_init_bfqq()
5070 if (!bfq_class_idle(bfqq)) in bfq_init_bfqq()
5072 bfq_mark_bfqq_has_short_ttime(bfqq); in bfq_init_bfqq()
5073 bfq_mark_bfqq_sync(bfqq); in bfq_init_bfqq()
5074 bfq_mark_bfqq_just_created(bfqq); in bfq_init_bfqq()
5076 bfq_clear_bfqq_sync(bfqq); in bfq_init_bfqq()
5079 bfqq->ttime.last_end_request = ktime_get_ns() + 1; in bfq_init_bfqq()
5081 bfq_mark_bfqq_IO_bound(bfqq); in bfq_init_bfqq()
5083 bfqq->pid = pid; in bfq_init_bfqq()
5086 bfqq->max_budget = (2 * bfq_max_budget(bfqd)) / 3; in bfq_init_bfqq()
5087 bfqq->budget_timeout = bfq_smallest_from_now(); in bfq_init_bfqq()
5089 bfqq->wr_coeff = 1; in bfq_init_bfqq()
5090 bfqq->last_wr_start_finish = jiffies; in bfq_init_bfqq()
5091 bfqq->wr_start_at_switch_to_srt = bfq_smallest_from_now(); in bfq_init_bfqq()
5092 bfqq->split_time = bfq_smallest_from_now(); in bfq_init_bfqq()
5103 bfqq->soft_rt_next_start = jiffies; in bfq_init_bfqq()
5106 bfqq->seek_history = 1; in bfq_init_bfqq()
5135 struct bfq_queue *bfqq; in bfq_get_queue() local
5142 bfqq = &bfqd->oom_bfqq; in bfq_get_queue()
5149 bfqq = *async_bfqq; in bfq_get_queue()
5150 if (bfqq) in bfq_get_queue()
5154 bfqq = kmem_cache_alloc_node(bfq_pool, in bfq_get_queue()
5158 if (bfqq) { in bfq_get_queue()
5159 bfq_init_bfqq(bfqd, bfqq, bic, current->pid, in bfq_get_queue()
5161 bfq_init_entity(&bfqq->entity, bfqg); in bfq_get_queue()
5162 bfq_log_bfqq(bfqd, bfqq, "allocated"); in bfq_get_queue()
5164 bfqq = &bfqd->oom_bfqq; in bfq_get_queue()
5165 bfq_log_bfqq(bfqd, bfqq, "using oom bfqq"); in bfq_get_queue()
5174 bfqq->ref++; /* in bfq_get_queue()
5181 bfq_log_bfqq(bfqd, bfqq, "get_queue, bfqq not in async: %p, %d", in bfq_get_queue()
5182 bfqq, bfqq->ref); in bfq_get_queue()
5183 *async_bfqq = bfqq; in bfq_get_queue()
5187 bfqq->ref++; /* get a process reference to this queue */ in bfq_get_queue()
5188 bfq_log_bfqq(bfqd, bfqq, "get_queue, at end: %p, %d", bfqq, bfqq->ref); in bfq_get_queue()
5190 return bfqq; in bfq_get_queue()
5194 struct bfq_queue *bfqq) in bfq_update_io_thinktime() argument
5196 struct bfq_ttime *ttime = &bfqq->ttime; in bfq_update_io_thinktime()
5197 u64 elapsed = ktime_get_ns() - bfqq->ttime.last_end_request; in bfq_update_io_thinktime()
5201 ttime->ttime_samples = (7*bfqq->ttime.ttime_samples + 256) / 8; in bfq_update_io_thinktime()
5208 bfq_update_io_seektime(struct bfq_data *bfqd, struct bfq_queue *bfqq, in bfq_update_io_seektime() argument
5211 bfqq->seek_history <<= 1; in bfq_update_io_seektime()
5212 bfqq->seek_history |= BFQ_RQ_SEEKY(bfqd, bfqq->last_request_pos, rq); in bfq_update_io_seektime()
5214 if (bfqq->wr_coeff > 1 && in bfq_update_io_seektime()
5215 bfqq->wr_cur_max_time == bfqd->bfq_wr_rt_max_time && in bfq_update_io_seektime()
5216 BFQQ_TOTALLY_SEEKY(bfqq)) in bfq_update_io_seektime()
5217 bfq_bfqq_end_wr(bfqq); in bfq_update_io_seektime()
5221 struct bfq_queue *bfqq, in bfq_update_has_short_ttime() argument
5231 if (!bfq_bfqq_sync(bfqq) || bfq_class_idle(bfqq) || in bfq_update_has_short_ttime()
5236 if (time_is_after_eq_jiffies(bfqq->split_time + in bfq_update_has_short_ttime()
5245 (bfq_sample_valid(bfqq->ttime.ttime_samples) && in bfq_update_has_short_ttime()
5246 bfqq->ttime.ttime_mean > bfqd->bfq_slice_idle)) in bfq_update_has_short_ttime()
5249 state_changed = has_short_ttime != bfq_bfqq_has_short_ttime(bfqq); in bfq_update_has_short_ttime()
5252 bfq_mark_bfqq_has_short_ttime(bfqq); in bfq_update_has_short_ttime()
5254 bfq_clear_bfqq_has_short_ttime(bfqq); in bfq_update_has_short_ttime()
5340 if (state_changed && bfqq->last_serv_time_ns == 0 && in bfq_update_has_short_ttime()
5341 (time_is_before_eq_jiffies(bfqq->decrease_time_jif + in bfq_update_has_short_ttime()
5344 bfq_reset_inject_limit(bfqd, bfqq); in bfq_update_has_short_ttime()
5351 static void bfq_rq_enqueued(struct bfq_data *bfqd, struct bfq_queue *bfqq, in bfq_rq_enqueued() argument
5355 bfqq->meta_pending++; in bfq_rq_enqueued()
5357 bfqq->last_request_pos = blk_rq_pos(rq) + blk_rq_sectors(rq); in bfq_rq_enqueued()
5359 if (bfqq == bfqd->in_service_queue && bfq_bfqq_wait_request(bfqq)) { in bfq_rq_enqueued()
5360 bool small_req = bfqq->queued[rq_is_sync(rq)] == 1 && in bfq_rq_enqueued()
5362 bool budget_timeout = bfq_bfqq_budget_timeout(bfqq); in bfq_rq_enqueued()
5380 if (small_req && idling_boosts_thr_without_issues(bfqd, bfqq) && in bfq_rq_enqueued()
5391 bfq_clear_bfqq_wait_request(bfqq); in bfq_rq_enqueued()
5402 bfq_bfqq_expire(bfqd, bfqq, false, in bfq_rq_enqueued()
5410 struct bfq_queue *bfqq = RQ_BFQQ(rq), in __bfq_insert_request() local
5411 *new_bfqq = bfq_setup_cooperator(bfqd, bfqq, rq, true); in __bfq_insert_request()
5420 bfqq->allocated--; in __bfq_insert_request()
5430 if (bic_to_bfqq(RQ_BIC(rq), 1) == bfqq) in __bfq_insert_request()
5432 bfqq, new_bfqq); in __bfq_insert_request()
5434 bfq_clear_bfqq_just_created(bfqq); in __bfq_insert_request()
5439 bfq_put_queue(bfqq); in __bfq_insert_request()
5441 bfqq = new_bfqq; in __bfq_insert_request()
5444 bfq_update_io_thinktime(bfqd, bfqq); in __bfq_insert_request()
5445 bfq_update_has_short_ttime(bfqd, bfqq, RQ_BIC(rq)); in __bfq_insert_request()
5446 bfq_update_io_seektime(bfqd, bfqq, rq); in __bfq_insert_request()
5448 waiting = bfqq && bfq_bfqq_wait_request(bfqq); in __bfq_insert_request()
5450 idle_timer_disabled = waiting && !bfq_bfqq_wait_request(bfqq); in __bfq_insert_request()
5453 list_add_tail(&rq->queuelist, &bfqq->fifo); in __bfq_insert_request()
5455 bfq_rq_enqueued(bfqd, bfqq, rq); in __bfq_insert_request()
5462 struct bfq_queue *bfqq, in bfq_update_insert_stats() argument
5466 if (!bfqq) in bfq_update_insert_stats()
5480 bfqg_stats_update_io_add(bfqq_group(bfqq), bfqq, cmd_flags); in bfq_update_insert_stats()
5482 bfqg_stats_update_idle_time(bfqq_group(bfqq)); in bfq_update_insert_stats()
5487 struct bfq_queue *bfqq, in bfq_update_insert_stats() argument
5497 struct bfq_queue *bfqq; in bfq_insert_request() local
5516 bfqq = bfq_init_rq(rq); in bfq_insert_request()
5517 if (!bfqq || at_head || blk_rq_is_passthrough(rq)) { in bfq_insert_request()
5529 bfqq = RQ_BFQQ(rq); in bfq_insert_request()
5547 bfq_update_insert_stats(q, bfqq, idle_timer_disabled, in bfq_insert_request()
5566 struct bfq_queue *bfqq = bfqd->in_service_queue; in bfq_update_hw_tag() local
5588 if (bfqq && bfq_bfqq_has_short_ttime(bfqq) && in bfq_update_hw_tag()
5589 bfqq->dispatched + bfqq->queued[0] + bfqq->queued[1] < in bfq_update_hw_tag()
5605 static void bfq_completed_request(struct bfq_queue *bfqq, struct bfq_data *bfqd) in bfq_completed_request() argument
5613 bfqq->dispatched--; in bfq_completed_request()
5615 if (!bfqq->dispatched && !bfq_bfqq_busy(bfqq)) { in bfq_completed_request()
5622 bfqq->budget_timeout = jiffies; in bfq_completed_request()
5624 bfq_weights_tree_remove(bfqd, bfqq); in bfq_completed_request()
5629 bfqq->ttime.last_end_request = now_ns; in bfq_completed_request()
5658 bfqd->last_completed_rq_bfqq = bfqq; in bfq_completed_request()
5671 if (bfq_bfqq_softrt_update(bfqq) && bfqq->dispatched == 0 && in bfq_completed_request()
5672 RB_EMPTY_ROOT(&bfqq->sort_list) && in bfq_completed_request()
5673 bfqq->wr_coeff != bfqd->bfq_wr_coeff) in bfq_completed_request()
5674 bfqq->soft_rt_next_start = in bfq_completed_request()
5675 bfq_bfqq_softrt_next_start(bfqd, bfqq); in bfq_completed_request()
5681 if (bfqd->in_service_queue == bfqq) { in bfq_completed_request()
5682 if (bfq_bfqq_must_idle(bfqq)) { in bfq_completed_request()
5683 if (bfqq->dispatched == 0) in bfq_completed_request()
5709 } else if (bfq_may_expire_for_budg_timeout(bfqq)) in bfq_completed_request()
5710 bfq_bfqq_expire(bfqd, bfqq, false, in bfq_completed_request()
5712 else if (RB_EMPTY_ROOT(&bfqq->sort_list) && in bfq_completed_request()
5713 (bfqq->dispatched == 0 || in bfq_completed_request()
5714 !bfq_better_to_idle(bfqq))) in bfq_completed_request()
5715 bfq_bfqq_expire(bfqd, bfqq, false, in bfq_completed_request()
5723 static void bfq_finish_requeue_request_body(struct bfq_queue *bfqq) in bfq_finish_requeue_request_body() argument
5725 bfqq->allocated--; in bfq_finish_requeue_request_body()
5727 bfq_put_queue(bfqq); in bfq_finish_requeue_request_body()
5835 struct bfq_queue *bfqq) in bfq_update_inject_limit() argument
5838 unsigned int old_limit = bfqq->inject_limit; in bfq_update_inject_limit()
5840 if (bfqq->last_serv_time_ns > 0 && bfqd->rqs_injected) { in bfq_update_inject_limit()
5841 u64 threshold = (bfqq->last_serv_time_ns * 3)>>1; in bfq_update_inject_limit()
5844 bfqq->inject_limit--; in bfq_update_inject_limit()
5845 bfqq->decrease_time_jif = jiffies; in bfq_update_inject_limit()
5848 bfqq->inject_limit++; in bfq_update_inject_limit()
5863 if ((bfqq->last_serv_time_ns == 0 && bfqd->rq_in_driver == 1) || in bfq_update_inject_limit()
5864 tot_time_ns < bfqq->last_serv_time_ns) { in bfq_update_inject_limit()
5865 if (bfqq->last_serv_time_ns == 0) { in bfq_update_inject_limit()
5870 bfqq->inject_limit = max_t(unsigned int, 1, old_limit); in bfq_update_inject_limit()
5872 bfqq->last_serv_time_ns = tot_time_ns; in bfq_update_inject_limit()
5883 bfqq->last_serv_time_ns = tot_time_ns; in bfq_update_inject_limit()
5899 struct bfq_queue *bfqq = RQ_BFQQ(rq); in bfq_finish_requeue_request() local
5907 if (!rq->elv.icq || !bfqq) in bfq_finish_requeue_request()
5910 bfqd = bfqq->bfqd; in bfq_finish_requeue_request()
5913 bfqg_stats_update_completion(bfqq_group(bfqq), in bfq_finish_requeue_request()
5924 bfq_update_inject_limit(bfqd, bfqq); in bfq_finish_requeue_request()
5926 bfq_completed_request(bfqq, bfqd); in bfq_finish_requeue_request()
5927 bfq_finish_requeue_request_body(bfqq); in bfq_finish_requeue_request()
5947 bfqg_stats_update_io_remove(bfqq_group(bfqq), in bfq_finish_requeue_request()
5950 bfq_finish_requeue_request_body(bfqq); in bfq_finish_requeue_request()
5981 bfq_split_bfqq(struct bfq_io_cq *bic, struct bfq_queue *bfqq) in bfq_split_bfqq() argument
5983 bfq_log_bfqq(bfqq->bfqd, bfqq, "splitting queue"); in bfq_split_bfqq()
5985 if (bfqq_process_refs(bfqq) == 1) { in bfq_split_bfqq()
5986 bfqq->pid = current->pid; in bfq_split_bfqq()
5987 bfq_clear_bfqq_coop(bfqq); in bfq_split_bfqq()
5988 bfq_clear_bfqq_split_coop(bfqq); in bfq_split_bfqq()
5989 return bfqq; in bfq_split_bfqq()
5994 bfq_put_cooperator(bfqq); in bfq_split_bfqq()
5996 bfq_release_process_ref(bfqq->bfqd, bfqq); in bfq_split_bfqq()
6006 struct bfq_queue *bfqq = bic_to_bfqq(bic, is_sync); in bfq_get_bfqq_handle_split() local
6008 if (likely(bfqq && bfqq != &bfqd->oom_bfqq)) in bfq_get_bfqq_handle_split()
6009 return bfqq; in bfq_get_bfqq_handle_split()
6014 if (bfqq) in bfq_get_bfqq_handle_split()
6015 bfq_put_queue(bfqq); in bfq_get_bfqq_handle_split()
6016 bfqq = bfq_get_queue(bfqd, bio, is_sync, bic); in bfq_get_bfqq_handle_split()
6018 bic_set_bfqq(bic, bfqq, is_sync); in bfq_get_bfqq_handle_split()
6022 bfq_mark_bfqq_in_large_burst(bfqq); in bfq_get_bfqq_handle_split()
6024 bfq_clear_bfqq_in_large_burst(bfqq); in bfq_get_bfqq_handle_split()
6054 hlist_add_head(&bfqq->burst_list_node, in bfq_get_bfqq_handle_split()
6057 bfqq->split_time = jiffies; in bfq_get_bfqq_handle_split()
6060 return bfqq; in bfq_get_bfqq_handle_split()
6109 struct bfq_queue *bfqq; in bfq_init_rq() local
6132 bfqq = bfq_get_bfqq_handle_split(bfqd, bic, bio, false, is_sync, in bfq_init_rq()
6137 if (bfq_bfqq_coop(bfqq) && bfq_bfqq_split_coop(bfqq)) { in bfq_init_rq()
6138 bfq_log_bfqq(bfqd, bfqq, "breaking apart bfqq"); in bfq_init_rq()
6141 if (bfq_bfqq_in_large_burst(bfqq)) in bfq_init_rq()
6144 bfqq = bfq_split_bfqq(bic, bfqq); in bfq_init_rq()
6147 if (!bfqq) in bfq_init_rq()
6148 bfqq = bfq_get_bfqq_handle_split(bfqd, bic, bio, in bfq_init_rq()
6156 bfqq->allocated++; in bfq_init_rq()
6157 bfqq->ref++; in bfq_init_rq()
6158 bfq_log_bfqq(bfqd, bfqq, "get_request %p: bfqq %p, %d", in bfq_init_rq()
6159 rq, bfqq, bfqq->ref); in bfq_init_rq()
6162 rq->elv.priv[1] = bfqq; in bfq_init_rq()
6170 if (likely(bfqq != &bfqd->oom_bfqq) && bfqq_process_refs(bfqq) == 1) { in bfq_init_rq()
6171 bfqq->bic = bic; in bfq_init_rq()
6178 bfq_bfqq_resume_state(bfqq, bfqd, bic, in bfq_init_rq()
6203 if (unlikely(bfq_bfqq_just_created(bfqq) && in bfq_init_rq()
6206 bfq_handle_burst(bfqd, bfqq); in bfq_init_rq()
6208 return bfqq; in bfq_init_rq()
6212 bfq_idle_slice_timer_body(struct bfq_data *bfqd, struct bfq_queue *bfqq) in bfq_idle_slice_timer_body() argument
6226 if (bfqq != bfqd->in_service_queue) { in bfq_idle_slice_timer_body()
6231 bfq_clear_bfqq_wait_request(bfqq); in bfq_idle_slice_timer_body()
6233 if (bfq_bfqq_budget_timeout(bfqq)) in bfq_idle_slice_timer_body()
6240 else if (bfqq->queued[0] == 0 && bfqq->queued[1] == 0) in bfq_idle_slice_timer_body()
6251 bfq_bfqq_expire(bfqd, bfqq, true, reason); in bfq_idle_slice_timer_body()
6266 struct bfq_queue *bfqq = bfqd->in_service_queue; in bfq_idle_slice_timer() local
6276 if (bfqq) in bfq_idle_slice_timer()
6277 bfq_idle_slice_timer_body(bfqd, bfqq); in bfq_idle_slice_timer()
6285 struct bfq_queue *bfqq = *bfqq_ptr; in __bfq_put_async_bfqq() local
6287 bfq_log(bfqd, "put_async_bfqq: %p", bfqq); in __bfq_put_async_bfqq()
6288 if (bfqq) { in __bfq_put_async_bfqq()
6289 bfq_bfqq_move(bfqd, bfqq, bfqd->root_group); in __bfq_put_async_bfqq()
6291 bfq_log_bfqq(bfqd, bfqq, "put_async_bfqq: putting %p, %d", in __bfq_put_async_bfqq()
6292 bfqq, bfqq->ref); in __bfq_put_async_bfqq()
6293 bfq_put_queue(bfqq); in __bfq_put_async_bfqq()
6381 struct bfq_queue *bfqq, *n; in bfq_exit_queue() local
6386 list_for_each_entry_safe(bfqq, n, &bfqd->idle_list, bfqq_list) in bfq_exit_queue()
6387 bfq_deactivate_bfqq(bfqd, bfqq, false, false); in bfq_exit_queue()